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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.