dead code elimination

preston@dawn.cs.rice.edu (Preston Briggs)
Tue, 26 Nov 1991 19:23:40 GMT

          From comp.compilers
Related articles
[2 earlier articles]
Re: Dead code elimination clyde@hitech.com.au (1991-11-01)
Re: Dead code elimination henry@zoo.toronto.edu (1991-11-05)
Re: Dead code elimination schwartz@roke.cs.psu.edu (1991-11-05)
Re: Dead code elimination dd@mips.com (1991-11-05)
Re: Dead code elimination eggert@twinsun.com (1991-11-06)
Re: Dead Code Elimination preston@dawn.cs.rice.edu (1991-11-07)
dead code elimination preston@dawn.cs.rice.edu (1991-11-26)
dead code elimination preston@tera.com (1995-03-23)
| List of all articles for this month |
Newsgroups: comp.compilers
From: preston@dawn.cs.rice.edu (Preston Briggs)
Keywords: optimize, bibliography
Organization: Rice University, Houston
Date: Tue, 26 Nov 1991 19:23:40 GMT

Earlier, there was some discussion about dead code elimination,
particularly the problem of eliminating "empty" loops. In the most recent
issue of TOPLAS, there's an article that describes a systematic way to
achieve this.


Efficiently Computing Static Single Assignment Form
and the Control Dependence Graph
Cytron, Ferrante, Rosen, Wegman, Zadeck
TOPLAS Volume 13, Number 4
October 1991


See especially Section 7.1 "Dead Code Elimination"


Basically, they describe how to find live instructions by chasing back
through use-def chains from a set of critical instructions. The extension
is to notice that a conditional is not critical unless some statement
that is control dependent on the conditional is also critical.


Preston Briggs
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.