Efficient call sequence restoration method

Details Efficient call sequence restoration method Efficient call sequence restoration method

2011-04-12

2011-04-12

Zhen, Wei Y (Department: 2191)

Data processing: software development, installation, and managem

Software program development tool

Translation of code

C717S131000, C717S132000, C717S133000, C717S151000, C717S154000, C717S156000, C717S157000

Reexamination Certificate

active

07926048

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.

REFERENCES:
patent: 6009258 (1999-12-01), Elliott
patent: 6014515 (2000-01-01), Burch
patent: 6293712 (2001-09-01), Coutant
patent: 6574721 (2003-06-01), Christenson et al.
patent: 6993754 (2006-01-01), Freudenberger et al.
patent: 7017153 (2006-03-01), Gouriou et al.
patent: 7426719 (2008-09-01), Chaiken et al.
patent: 7480902 (2009-01-01), Patil et al.
patent: 2003/0101380 (2003-05-01), Chaiken et al.
patent: 2004/0128658 (2004-07-01), Lueh et al.
patent: 2004/0205409 (2004-10-01), Wu et al.
patent: 2006/0010431 (2006-01-01), Patil et al.
patent: WO 2005/013134 (2005-02-01), None
Michael Cierniak, et al.; “Practicing JUDO: Java under dynamic optimizations” PLDI '00: Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation, 2000, XP002437389, ACM Press, pp. 13-26.
Stichnoth J. M. et al., “Support for Garbage Collection at Every Instruction in a Java Compiler”, ACM SIGPLAN Notices, ACM, Association for Computing Machinery, New York, NY, US, vol. 34, No. 5, May 5, 1999, XP000832668, pp. 118-127.
International Search Report and Written Opinion; International Application No. PCT/RU2006/000400; Mailing date Jun. 27, 2007; 14 pages.

Affiliated with

Also associated with

Rating

Efficient call sequence restoration method does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient call sequence restoration method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient call sequence restoration method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2633244