Abstract
Good quality information from data flow analysis is a prerequisite for code improvement and, in parallelizing compilers, parallelism detection. Typically, compilers do many kinds of data flow analyses and optimizations one after another, which may pose a phase-ordering problem: the analyses may have to be run several times until a fixed point is reached. However, when two related optimizations/analyses are performed in combination, it may be possible to obtain better results than iterating over the two analyses independently. Combining optimizations/analyses may be beneficial while potentially enforcing little calculation overhead. This paper discusses combining interprocedural conditional constant propagation (CCP) and interprocedural alias analysis (AA) in pointer-supporting languages.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Choi, J.-D., Burke, M., Carini, P.: Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In: Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, South Carolina, pp. 232–245 (January 1993)
Click, C., Cooper, K.: Combining Analyses, Combining Optimizations. TOPLAS (2), 181 (1995)
Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Kenneth Zadeck, F.: Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems 13(4), 451–490 (1991)
Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Kenneth Zadeck, F.: Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems 13(4), 451–490 (1991)
Cytron, R., Gershbein, R.: Efficient accomodation of may-alias information in ssa form. SIGPLAN Notices 28(6), 36–45 (1993)
Landi, W., Ryder, B.G.: A safe approximate algorithm for interprocedural pointer aliasing. SIGPLAN Notices 27(7), 235–248 (1992)
Landi, W., Ryder, B.G., Zhang, S.: Interprocedural modification side effect analysis with pointer aliasing. SIGPLAN Notices 28(6), 56–67 (1993)
Ghiya, R., Emami, M., Hendren, L.J.: Context-sensitive interprocedural points-to analysis in the presence of pointers. Acaps technical memo 54, School of Computer Science, McGill University (1993)
Pollock, L.L., Soffa, M.L.: An incremental version of iterative data flow analysis. IEEE Transactions on Software Engineering SE-15(12) (December 1989) Incremental Data Flow Analysis
Wegman, M.N., Zadeck, F.K.: Constant propagation with conditional branches. TOPLAS 13(2), 181–210 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gopinath, K., Nandakumar, K.S. (1999). Combining Conditional Constant Propagation and Interprocedural Alias Analysis. In: Banerjee, P., Prasanna, V.K., Sinha, B.P. (eds) High Performance Computing – HiPC’99. HiPC 1999. Lecture Notes in Computer Science, vol 1745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46642-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-46642-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66907-4
Online ISBN: 978-3-540-46642-0
eBook Packages: Springer Book Archive