Method inside an optimizing compiler for analyzing assertions and redirecting control flow in programs
US5805894A · kind A · utility
13Cited by
2References
7Claims
0Family size
Assignee
Inventor
Key dates
| Filing date | Mar 6, 1996 |
| Grant date | Sep 8, 1998 |
| Priority date | — |
| Expiry date | Mar 6, 2016 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F8/443
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.