Abstract: In a compiler for processing a software program and generating machine executable code, a method for optimizing a plurality of variables that have their addresses taken. The method is comprised of the steps of processing source code in a front end of the compiler, to determine a plurality of variables that have their addresses taken. The compiler then analyzes local calls for the plurality of variable that have their addresses taken and determines which local variables may be safely optimized. The compiler then analyzes global calls for the plurality of variables that have their addresses taken and determines which global variables may be safely optimized. The compiler then optimizes the code by moving the code containing local variables and global variables outside of the code loops in the software program.

Abstract: The present invention provides a system and method for solving interprocedural problems on incomplete call graphs. For a given program, the present invention constructs a standard call graph on which the edges are updated with summary information needed to solve a given interprocedural problem such as constant propagation. Each node of the call graph having an unknown incoming edge is cloned. The call graph is then updated so that the unknown incoming edges are directed to the clone nodes and the known edges are directed to the original nodes. This results in a purified call graph on which an interprocedural problem can be solved. The present invention then creates a real clone of the procedure associated with each clone node of the call graph. The real clones are optimized according to the interprocedural solution. The present invention updates the known procedure calls of the program to call the real clones.

Abstract: The present invention provides a system and method for implementing interprocedural analysis using a standard compilation user interface. The present invention stores an intermediate representation of the source code, associated interprocedural summary information, and compilation options into an extended object format file. Interprocedural analysis functions are then performed on each of the extended object format files, resulting in IPA output files which preserve the compilation options. A compiler back end is invoked for each IPA output file to produce a standard format binary object file. The standard format binary object files are finally linked together to produce a final output, such that the final output can be either an executable program or a dynamic shared object. The present invention executes the interprocedural analysis functions, the compiler back end, and the linking under the control of a linkage editor.