Patent
1997-04-01
1999-12-14
Trammell, James P.
395706, 395708, G06F 945, G06F 944
Patent
active
060028793
ABSTRACT:
Briefly, in one embodiment, the invention is a method for eliminating common subexpressions in an initial SSA intermediate language representation of at least a portion of a computer program. The method includes (a) inserting a phi-node for an unambiguous definition used in an unambiguous subexpression reaching a join point in the initial intermediate language subsequent to the join point; (b) inserting a phi-node for the unambiguous common subexpression; (c) renaming the unambiguous definition and a subsequent use reached by the definition; and (d) renaming the unambiguous common subexpression.
REFERENCES:
patent: 5287510 (1994-02-01), Hall et al.
patent: 5327561 (1994-07-01), Choi et al.
patent: 5448737 (1995-09-01), Burke et al.
patent: 5475842 (1995-12-01), Gilbert et al.
patent: 5584027 (1996-12-01), Smith
patent: 5659754 (1997-08-01), Grove et al.
patent: 5768596 (1998-06-01), Chow et al.
Cytron and Gershbein, "Efficient Accommodation of May-Alias Information in SSA Form", published at ACM, pp. 36-45, 1993.
Munehiro and Ken'ichi, "Efficient Partial Redundancy Elimination Based on Phi-Function Motion", Hoho Shori Gakkai Kenkyu Hokoku, vol. 95, No. 15, pp. 21-30, 1995.
Parikh Vishesh M.
Radigan Jim J.
Intel Corporation
Smith Demetra R.
Trammell James P.
LandOfFree
Method for performing common subexpression elimination on a rack does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for performing common subexpression elimination on a rack, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for performing common subexpression elimination on a rack will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-871983