초록 ▼

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 includes the steps of: converting plural source code listings into plural CUs, each CU being

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 includes the steps of: converting plural source code listings into plural CUs, each CU being an intermediate code representation; analyzing each CU and deriving a global CU table which includes a reference to each analyzed CU; a program symbol table which indicates in which CU each program routine is defined and/or referred to; and a global call graph which notes each routine in each CU, indicates references therebetween, and further indicates where the routine exists in the program symbol table. The method further derives a CU symbol table which includes information that includes a reference for each routine defined in a CU to the intermediate representation for that routine. The method compiles the CUs by analyzing each CU and employing at least the global call graph and program symbol table to enable cross CU relationships to be taken into account and utilized in arranging an improved object code representation of the source code listing. CUs which are being operated upon are stored in uncompressed form; whereas other CUs may be stored in either uncompressed form, compressed form or off-line on a disk memory.

대표청구항 ▼

[ We claim:] [1.] A compiler method for converting a source code listing comprising plural code modules, to an object code listing, said method adapted to be executed by a computer with limited memory resources, said method comprising the steps of:converting said source code listing into plural comp

[ We claim:] [1.] A compiler method for converting a source code listing comprising plural code modules, to an object code listing, said method adapted to be executed by a computer with limited memory resources, said method comprising the steps of:converting said source code listing into plural compilation units (CUs), each CU being an intermediate code listing corresponding to a code module of said source code listing;analyzing each CU and deriving:global CU table (GCUT) means for including a reference to each analyzed CU and an indication of whether or not said each analyzed CU is stored in compressed form;program symbol table (PST) means for indicating in which CU, each program routine is defined and/or referred to;global call graph (GCG) means for noting each program routine in each CU, indicating references therebetween, and further indicating where said each program routine is present in said PST; andCU symbol table (CUST) means, for each routine listed in a CU, for including a reference to a location where the routine can be found in memory; andcompiling received CUs by employing at least data from said GCG means and PST means in analysis of each CU to enable cross-CU relationships to be taken into account during the analysis and utilized in arranging an object code representation of said source code listing.