Data-flow method for optimizing exception-handling instructions in programs
US7120904B1 · kind B1 · utility
Assignee
Inventor
Key dates
| Filing date | Apr 19, 2000 |
| Grant date | Oct 10, 2006 |
| Priority date | — |
| Expiry date | Apr 19, 2020 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F8/443
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method for analyzing and optimizing programs that operate on a data structure where the state of the data structure must be valid at certain program points. The program is represented as a control-flow graph. The method decomposes the state of the data structure into components, and applies partial redundancy elimination to place instructions that set the state of the data structure, with a variation that permits speculative placement. Application extends to manipulating a stack that keeps track of what to do should an exception arise during execution. In this context, a control-flow representation of contingencies is converted into placement of instructions that manipulate the stack.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.