Interprocedural dead store elimination

Details Interprocedural dead store elimination Interprocedural dead store elimination

G - Physics

06

F

G06F 9/45 (2006.01) G06F 11/36 (2006.01)

Patent

CA 2321016

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.

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: LFCA-PAI-O-1624018