Method inside an optimizing compiler for analyzing assertions an

Details Method inside an optimizing compiler for analyzing assertions an Method inside an optimizing compiler for analyzing assertions an

1996-03-06

1998-09-08

Trammell, James P.

G06F 945

Patent

active

058058940

ABSTRACT:
A method of analyzing and optimizing programs by predicting branches and redirecting control flow. A program to be analyzed and optimized is inspected to find branches that might be predictable. A set of assertions is generated, analyzed by a dataflow solver and then used to predict the effects of branches. Control flow in the program is redirected to skip over predictable branches. The dataflow solver is capable of analyzing assertions involving lvalues such as variables, pointer expressions, or components of aggregate lvalues.

REFERENCES:
patent: 5146594 (1992-09-01), Iitsuka
patent: 5671419 (1997-09-01), Carini et al.
"Compilers, Principles, Techniques, and Tools" Aho, Sethi, and Ullman, pp. 681-691 (1986).
"Avoiding Conditional Branches By Code Replication" Mueller, Frank and Whalley, David B., SIGPLAN '95 PLDC, pp. 56-66.
"Propagation of Constants and Assertions," Sakharov, Alexander, ACM SIGPLAN Notices, (1994), pp. 3-6.2.

Affiliated with

Also associated with

Rating

Method inside an optimizing compiler for analyzing assertions an 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 inside an optimizing compiler for analyzing assertions an, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method inside an optimizing compiler for analyzing assertions an will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1294290