R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and F.K. Zadeck. An ecient method of computing static single assignment form. In POPL'89, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....fashion. Unfortunately, many embedded processors are highly constrained architectures containing very few specialized registers, what makes the application of these techniques impossible. In [13] a technique based on live range growth and a variation of Static Single Assignment (SSA) Form [14] was proposed. It consists on consecutively merging pairs of live ranges until the number of ranges equals the number of address registers in the target processor architecture. A heuristic was used to decide which pair of live ranges should be merged. The problem of nding the minimal number of ....

....will depend on how ecient is the algorithm that assigns address registers to the array references, as discussed in Section 4. In [13] it was realized that the problem of deciding where update instructions are needed resembles the problem of choosing places to insert functions in the SSA Form [14]. The points where to insert functions are those on the Iterated Dominance Frontier [14] of the basic blocks that contain array references. The program representation resulting after functions are inserted was called Single Reference Form (SRF) For example, Figure 2(a) shows the CFG of a loop ....

[Article contains additional citation context not shown here]

R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and F. Zadeck. An ecient method of computing static single assignment form. In Proc. of the ACM POPL'89, pages 23-25, 1989.

....to recognize and classify sequence variables in a loop. Di erent kinds of sequence variables are linear induction variables, periodic, polynomial, geometric, monotonic, and wrap around variables. Their algorithm is based on a demand driven representation of the Static Single Assignment form[6, 5]. The sequence variables can be detected and classi ed in a uni ed way by nding strongly connected components of the associated SSA graph. R. Gupta and M. Spezialetti [18] have extended the traditional data ow approach to detect monotonic statements. A statement is monotonic in a loop if, ....

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark K. Wegman, and F. Kenneth Zadeck. An ecient method of computing static single assignment form. In Proceedings of 16th Annual ACM Symposium on Principles of Programming Languages, pages 25-35, 1989.

....Static Single Information form In this section we will provide a formal speci cation of SSI form and its minimal and pruned variants. We will also provide ecient algorithms for constructing these representations. 2. 1 De nition of SSI form SSI form is an extension of the SSA form introduced in [4]. Building SSI form involves adding pseudo assignments for a variable V : at a control ow merge when disjoint paths from a conditional branch come together and at least one of the paths contains a de nition of V ; and ( at locations where control ow splits and at least one of the ....

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An ecient method of computing static single assignment form. In Proceedings of the 16th ACM Symposium on Principles of Programming Languages (POPL), pages 25-35, Austin, Texas, January 1989.

....can decide, at compile time, between using auto increment (decrement) mode for a, or inserting an update instruction on the path from a to b. This requirement can be satis ed if the references in the CFG are in Single Reference Form (SRF) 7] a variation of Static Single Assignment (SSA) Form [8]. After a program is in SRF, any loop basic block for which array references converge will have a equation, including the header and the tail of the loop. After reference analysis, which is performed by solving reaching de nitions [1, 16] with the data items being the array references, any ....

Cytron, R., Ferrante, J., Rosen, B., Wegman, M., and Zadeck, F. An ecient method of computing static single assignment form. In Proc. of the ACM POPL'89 (1989), pp. 23-25.

....Code motion transformations can then freely move the code within these zones, without concern for exceptions. Static Single Assignment (SSA) form, the standard intermediate representation for programs in a compiler, enables ecient implementation of many classical code optimization techniques [12, 2]. An ecient SSA representation is needed to improve the implementation of classical optimizations. We have developed a novel algorithm [3] for converting SSA form into a control ow graph (CFG) This is a very fast algorithm taking time that is nearly linear linear in the size of the CFG, while ....

....then converts the AST into a control ow graph. It also has the ability to create a CFG directly from the bytecode of the class by using symbolic code interpretation of the stack machine code. This compiler then performs exception hiding [3] It then uses the classical SSA construction algorithm [2, 12] to generate the SSA form for all the methods in the class. It then passes the SSA form to our back end optimizing compiler. This back end compiler operates on the SSA representation of the code. It performs numerous classical optimizations (dead code elimination, value numbering, constant ....

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck, An ecient method of computing static single assignment form, in Conference Record of the Sixteenth ACM Symposium on the Principles of Programming Languages, Austin, Texas, Jan. 1989, pp. 25-35.

....5.1. 1 Verifying Common Execution Common execution ensures both parent and child are created together, and is ensured if the parent and child creation nodes exist in the same inter procedural control dependence region (ip region) These ip regions generalize traditional control dependence regions[5, 15] to be inter procedural. More precisely, an ip region is governed by a conditional, and its members are a set of node, edge stack pairs where nodes are the program nodes dependent on the governing conditional, and the edge stack is the method calls between the conditional and the node. Because ....

R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and F. Zadeck. An ecient method of computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451-490, October 1991.

No context found.

R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and F.K. Zadeck. An ecient method of computing static single assignment form. In POPL'89, 1989.

No context found.

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An ecient method of computing static single assignment form. In Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages, pages 25-35, January 1989.

No context found.

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An ecient method of computing static single assignment form. In Proceedings of the 16th ACM Symposium on Principles of Programming Languages (POPL), pages 25-35, Austin, Texas, Jan. 1989.

No context found.

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark K. Wegman, and F. Kenneth Zadeck. An ecient method of computing static single assignment form. In Proceedings of 16th Annual ACM Symposium on Principles of Programming Languages, pages 25-35, 1989.

No context found.

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F.K. Zadeck. An ecient method of computing static single assignment form. In Proceedings of the 16th ACM Symposium on Principles of Programming Languages (POPL), Austin, January 1989 pp. 26-35.

No context found.

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. An ecient method of computing static single assignment form. In Symp. on Principles of Programming Languages, pages 25-35. ACM, 1989.

No context found.

Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An ecient method of computing static single assignment form. In Proceedings of the 16th ACM Symposium on Principles of Programming Languages, pages 25-35, January 1989.

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