Interprocedural dead store elimination

Details Interprocedural dead store elimination Interprocedural dead store elimination

2006-08-29

2006-08-29

Zhen, Wei (Department: 2191)

Data processing: software development, installation, and managem

Software program development tool

Translation of code

C717S156000, C717S157000, C712S241000

Reexamination Certificate

active

07100156

ABSTRACT:
A system for optimizing computer code generation by carrying out interprocedural dead store elimination. The system carries out a top down traversal of a call graph in an intermediate representation of the code being compiled. Live on exit (LOE) sets are defined for variables at call points for functions in the code being compiled. Bit vectors representing the LOE sets for call points for functions are stored in an LOE table indexed or hashed by call graph edges. For each function definition reached in the call graph traversal, a LOE set for the function itself is generated by taking the union of the LOE call point sets. The entries in the LOE table for the LOE call point sets are then removed. The LOE set for each function is used to determine if variables that are the subject of a store operation in a function may be subject to a dead store elimination optimization.

REFERENCES:
patent: 4951194 (1990-08-01), Bradley et al.
patent: 5175856 (1992-12-01), Van Dyke et al.
patent: 5179702 (1993-01-01), Spix et al.
patent: 5428793 (1995-06-01), Odnert et al.
patent: 5485616 (1996-01-01), Burke et al.
patent: 5555417 (1996-09-01), Odnert et al.
patent: 5590332 (1996-12-01), Baker
patent: 5812855 (1998-09-01), Hiranandani et al.
patent: 5850549 (1998-12-01), Blainey et al.
patent: 5878261 (1999-03-01), Holler et al.
patent: 6041179 (2000-03-01), Bacon et al.
patent: 6173444 (2001-01-01), Archambault
patent: 6182284 (2001-01-01), Sreedhar et al.
patent: 6381738 (2002-04-01), Choi et al.
patent: 6487716 (2002-11-01), Choi et al.
patent: 2002/0010911 (2002-01-01), Cheng et al.
patent: 2002/0166115 (2002-11-01), Sastry
patent: 2003/0005421 (2003-01-01), Prakash et al.
patent: 2004/0205740 (2004-10-01), Lavery et al.
Kandemir et al., A framework for interprocedural locality optimization using both loop and data layout transformations, Sep. 1999, IEEE, pp. 95-102.
Genin et al., System design, optimization and intelligent code generation for standard digital signal processors, May 1989, IEEE, vol. 1, pp. 565-569.
Carr et al., Compiler optimization for improving data locality, 1994, IEEE, pp. 252-262.
Cooper, Interprocedural Analyses of Fortran Programs, Citeseer, 1997, pp. 1-33.
Cooper, Fast Interprocedural Alias Analysis, ACMPRESS, Jan. 1989, pp. 49-59.
Mahlke, Design and Implementation of a Portable Global Code Optimizer, http://www.crhc.uiuc.edu/IMPACT/ftp/report/ms-thesis-scott-mahlke.pdf, 1998, pp. 1-78.
Hall et al., Interprocedural compilation of Fortran D for MIMD distributed-memory machines, IEEE, Nov. 1992, pp. 522-534.
Knoop et al., Interprocedural distribution assignment placement: more than just enhancing intraprocedural placing techniques, IEEE, Nov. 1997, pp. 26-37.
Inagaki et al., Supporting software distributed shared memory with an optimizing compiler, IEEE, Aug. 1998, pp. 225-234.
Adve et al., High Performance Fortran Compilation Techniques for Parallelizing Scientific Codes, IEEE, Nov. 1998, pp. 1-20.

Affiliated with

Also associated with

Rating

Interprocedural dead store elimination does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3613492