Patent
1997-02-19
1999-08-31
Trammell, James P.
G06F 945
Patent
active
059464925
ABSTRACT:
The present invention uses an optimizing compiler to identify what are referred to herein as stackless variables. A variable is said to be stackless for a given call statement if the calling program does not have a need for the information stored in the variable when the calling program resumes execution after the program that is the subject of the call statement returns control of the processor to the calling program. The decision of whether a variable is stackless or not for a given call statement is made within the preferred embodiment by determining whether the live range of the particular variable spans the location of the call statement in question. If a variable's live range is found to cross the location of the call statement, it is not considered stackless. However, if a variable's live range is not found to cross the location of the call statement, it is considered to be stackless for that particular call statement.
REFERENCES:
patent: 5355494 (1994-10-01), Sistare et al.
patent: 5481708 (1996-01-01), Kukol
patent: 5515535 (1996-05-01), Frankel et al.
patent: 5530866 (1996-06-01), Koblenz et al.
patent: 5628016 (1997-05-01), Kukol
patent: 5642512 (1997-06-01), Tanaka et al.
patent: 5659754 (1997-08-01), Grove et al.
patent: 5761514 (1998-06-01), Aizikowitz et al.
International Business Machines - Corporation
Roth Steven W.
Smithers Matthew
Trammell James P.
LandOfFree
Compiler that reduces call stack size through identification of does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Compiler that reduces call stack size through identification of , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compiler that reduces call stack size through identification of will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2428487