12
 

Using procedure or function call graph

CL 717 SC 157
5920723 Compiler with inter-modular procedure optimization
Jul-6-1999 A compiler method is adapted to be executed by a computer with limited memory, yet enables cross-CU optimization during the conversion of a source code listing to an object code listing. The compiler method...
5878261 Method for restructuring code to reduce procedure call overhead
Mar-2-1999 Software procedure call overhead, i.e. the memory references or other steps taken to save and restore callee save register values during execution of a called procedure, are reduced by restructuring the...
5815716 Method for supporting multiple call interface conventions for computer programs using directives
Sep-29-1998 A method, apparatus, and article of manufacture for optimizing programming language compilers and run-time environments. More specifically, the present invention provides a computer-implemented method...
5812855 System and method for constaint propagation cloning for unknown edges in IPA
Sep-22-1998 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...
5797012 Connectivity based program partitioning
Aug-18-1998 A method for partitioning programs into multi-procedure modules for efficient compilation. During interprocedural analysis, a weighted callgraph of the program is constructed in which weights on nodes...
5774730 Method and apparatus for improving colorability of constrained nodes in an interference graph within a computer system
Jun-30-1998 A method and apparatus for coloring an interference graph yields a higher number of colored nodes by taking into consideration the colors of neighbors of a node's uncolored constrained neighbors. By assigning...
5701489 System for partial in-line expansion of procedure calls during program compilation
Dec-23-1997 A system for the in-line expansion of a portion of the program body otherwise rejected as too expensive for full in-line expansion during intermediate code optimization by a compiler. The partial in-lining...
5535394 Methods for distinguishing dynamically allocated storage along different call paths and for providing a compact representation of alias analysis
Jul-9-1996 The invention provides a method for improving the precision of interprocedural alias analysis by efficiently qualifying (naming) dynamically allocated storage locations with call path information and identifying...
5428793 Method and apparatus for compiling computer programs with interproceduural register allocation
Jun-27-1995 Optimization techniques are implemented by means of a program analyzer used in connection with a program compiler to optimize usage of limited register resources in a computer processor. The first optimization...
5327561 System and method for solving monotone information propagation problems
Jul-5-1994 A method and system is provided for constructing sparse evaluation graphs for forward or backward monotone data flow problems. The sparse graph combines information as early as possible, yet directly connects...
5249295 Digital computer register allocation and code spilling using interference graph coloring
Sep-28-1993 A method is disclosed for allocating internal machine registers in a digital computer for use in storing values defined and referenced by a computer program. An allocator in accordance with the present...