Carl D. O ner. Notes on graph algorithms used in optimizing compilers. Available from http:// www.cs.umb.edu/~offner/files/flow graph.ps, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Static Single Information Form - Ananian, Rinard (1999) (1 citation) (Correct)
....null pointer checks. Lastly, we will describe an extension to SPTC that allows bitwidth analysis, and the possible uses of this information. 4. 1 Backward Data ow Analysis Backward data ow analyses are those in which information is propagated in the direction opposite that of program execution [15]. There is general agreement [10, 3, 20] that SSA form is unable to directly handle backwards data ow analyses; liveness is often cited as a canonical example. However, SSI form allows the sparse computation of such backwards properties. Liveness, for example, comes for free from pruned SSI ....
....is dominated by the de nition; Cytron [5] has shown that functions will always be found on the dominance frontier. Thus the live region between de nition and use can be enumerated with a simple depth rst search, taking advantage of the topological sorting by dominance that DFS provides [15]. Because of function uses, the DFS will have to look one node past its spanningtree leaves to see the functions on the dominance frontier; this does not change the algorithmic complexity. Computation of other data ow properties will use this same enumeration routine to propagate values ....
[Article contains additional citation context not shown here]
Carl D. O ner. Notes on graph algorithms used in optimizing compilers. Available from http:// www.cs.umb.edu/~offner/files/flow graph.ps, 1995.
The Static Single Information Form - Ananian (1999) (1 citation) (Correct)
....not be cycle free. Correctness. As with the SSA conditions, this definition does not prohibit extra OE or oe functions not required by conditions 1 and 2. Property 5.1. There exists exactly one reaching definition of V at every non OE function use of V in the new program. Proof. Offner [29] defines a reaching definition as follows: A definition of a variable v reaches the point P in the program iff there is a path from the definition to P on which. there is no other definition of v. From this definition and condition 3 we directly obtain the property. Note that ....
....is violated. Thus X E must contain every use of v. Property 5.3. Every definition of a variable V dominates all non OEfunction uses of V and every use of V post dominates any non oefunction reaching definition of V in the new program. Proof. The dominance relation is defined in Offner [29] as: If x and y are two elements in a flow graph G, then x dominates y (x is a dominator of y) iff every path from s [START] to y includes x. Post dominance is the dual on a flow graph with edges reversed: x postdominates y iff every path from END to y includes x. The previous property ....
[Article contains additional citation context not shown here]
C. D. Offner. Notes on graph algorithms used in optimizing compilers. Available from http://www.cs.umb.edu/~offner/files/ flow graph.ps, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC