Efficient call sequence restoration method
US7926048B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Jul 26, 2006 |
| Grant date | Apr 12, 2011 |
| Priority date | — |
| Expiry date | Oct 15, 2029 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F9/4486
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Embodiments of the present invention provide for minimizing the number of procedure frame unwinding operations to be performed when restoring the program control flow information. A first data structure may be constructed to contain procedure linkage information along with references to the conventional memory area where each procedure linkage information element (procedure return address or a procedure frame pointer) was originally found. The first data structure may be initialized upon the initial request for program control flow information. Upon each subsequent request, the contents of the conventional memory area as referenced by the first data structure may be compared with the corresponding elements of the first data structure. As a result of said comparison, changed and unchanged regions within the conventional memory area may be determined. Then, procedure frame unwinding operations may be performed for the changed regions.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.