Partial dead code elimination optimizations for program code...

Details Partial dead code elimination optimizations for program code... Partial dead code elimination optimizations for program code...

2003-12-30

2009-06-02

Kiss, Eric B (Department: 2192)

Data processing: software development, installation, and managem

Software program development tool

Translation of code

C717S148000

Reexamination Certificate

active

07543284

ABSTRACT:
An improved method and apparatus for performing program code conversion is provided and, more particularly, for generating improved intermediate representations for use in program code conversion. During program code conversion, a partial dead code elimination optimization technique is implemented to identify partially dead register definitions within a block of program code being translated. The partial dead code elimination is an optimization to the intermediate representation in the form of code motion for blocks of program code ending in non-computed branches or computed jumps, where target code for all dead child nodes of a partially dead register definition is prevented from being generated and target code for partially dead child nodes of a partially dead register definition is delayed from being generated until after target code is generated for all fully live child nodes for the partially dead register definition.

REFERENCES:
patent: 5652889 (1997-07-01), Sites
patent: 5751982 (1998-05-01), Morley
patent: 5768593 (1998-06-01), Walters et al.
patent: 5828884 (1998-10-01), Lee et al.
patent: 5842017 (1998-11-01), Hookway et al.
patent: 5867690 (1999-02-01), Lee et al.
patent: 5966539 (1999-10-01), Srivastava
patent: 5970236 (1999-10-01), Galloway et al.
patent: 6002879 (1999-12-01), Radigan et al.
patent: 6021275 (2000-02-01), Horwat
patent: 6085203 (2000-07-01), Ahlers et al.
patent: 6099585 (2000-08-01), Godfrey
patent: 6189141 (2001-02-01), Benitez et al.
patent: 6237141 (2001-05-01), Holzle et al.
patent: 6345384 (2002-02-01), Sato et al.
patent: 6484188 (2002-11-01), Kwong et al.
patent: 6535903 (2003-03-01), Yates et al.
patent: 6880152 (2005-04-01), Torvalds et al.
patent: 7200841 (2007-04-01), Lovett et al.
patent: 2001/0042172 (2001-11-01), Duesterwald et al.
patent: 2004/0154009 (2004-08-01), Reynaud
patent: 2004/0221278 (2004-11-01), Dankel et al.
patent: 2004/0221280 (2004-11-01), Bolton et al.
patent: 2004/0255279 (2004-12-01), Rawsthorne et al.
patent: 2005/0010891 (2005-01-01), Chaiken et al.
patent: 0908819 (1999-04-01), None
patent: 2367652 (2002-04-01), None
patent: WO-00/24649 (2000-05-01), None
patent: WO-01/27751 (2001-04-01), None
Alfred v. Aho, et al., “Compilers: Principles, Techniques, and Tools,” 1988, Addison-Wesley, pp. i, ii, 463-473, 585-595.
Rajiv Gupta, et al., “Path Profile Guided Partial Dead Code Elimination Using Predication,” 1997, proc. 1997 Int'l Conf. on Parallel Architectures and Compilation Techniques, pp. 102-113.
Jens Knoop, et al, “Partial Dead Code Elimination,” 1994, proc. ACM SIGPLAN 1994 conference on Programming language design and implementation, pp. 147-158.
Munehiro Takimoto and Kenichi Harada, “Partial Dead Code Elimination Using Extended Value Graph,” 1999, Springer-Verlag, Lecture Notes in Computer Science, vol. 1694, proc. Of the 6th Int'l Symposium on Static Analysis, pp. 179-193.
Alfred v. Aho, et al., “Compilers: Principles, Techniques, and Tools,” 1988, Addision-Wesley, pp. 554-555.
Search Report from United Kingdom Patent Application No. GB0322323.7 dated Mar. 11, 2004.
“Analysis of the Virtual Method Invocation for Binary Translation.” Proceedings of the Ninth Conference on Reverse Engineering. Troger and Clifuentes. pp. 65-74.
Altman et al. IBM Search Report. BOA: The Architecture of a Binary Translation Processor. Dec. 16, 1999.
Bala, Vasanth et al. “Dynamo: A Transparent Dynamic Optimization System.” PLDI 2000. pp. 1-12.
Cifuentes C et al. “The Design of a Resourceable and Retargetable Binary Translator.” Reverse Engineering. 1999. Proceedings Sixth Working Conference on Altanta, Georgia. pp. 280-291. XP010360118.
Ebcioglu et al. “Dynamic Binary Translation and Optimization.” IEEE, Transactions on Computers. vol. 50, No. 6, Jun. 2001. pp. 529-548.
Erik Altman et al. “Welcome to the Opportunities of Binary Translation.” pp. 40-45. IEEE.
Ertl, M. Anton. “A Portable Forth Engine.” In EuroForth 1993 Conference Proceedings. pp. 1-5.
International Search Report for International Patent Application No. PCT/GB2004/001722 mailed Feb. 3, 2005.
International Search Report from International Patent Application No. PCT/GB2004/001744 mailed Nov. 23, 2004.
Palaniswamy A C et al. “An Efficient Implementation of Lazy Reevaluation.” Proceedings of the 25th Annual Simulation Symposium. IEEE. 1992. pp. 140-146. XP010028446.
Sun Microsystems. “The Java Hotspot Virtual Machine.” V.1.41, d2. A Technical White Paper. Sep. 2002.
Ung, David et al. “Machine Adaptable Dynamic Binary Translation.” Proceedings of the ACM Sigplan Workshop on Dynamic and Adaptive Compilation and Optimization. Jan. 2000. pp. 41-51. XP002279759.
United Kingdom Search Report from United Kingdom Patent Application No. GB0320718.0 dated Feb. 24, 2004.

Affiliated with

Also associated with

Rating

Partial dead code elimination optimizations for program code... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Partial dead code elimination optimizations for program code..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partial dead code elimination optimizations for program code... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4104681