Fast Escape Analysis and Stack Allocation for Object-Based Programs

A fast and scalable interprocedural escape analysis algorithm is presented. The analysis computes a description of a subset of created objects whose lifetime is bounded by the lifetime of a runtime stack frame. The analysis results can be used for many purposes, including stack allocation of objects, thread synchronization elimination, deadstore removal, code motion, and iterator reduction. A method to use the analysis results for transforming a program to allocate some objects on the runtime stack is also presented. For non-trivial programs, typically 10%-20% of all allocated objects are placed on the runtime stack after the transformation.

• Type: Conference
• Year: 2000
• Where: CC
• Authors: David Gay, Bjarne Steensgaard
• Keywords: Analysis, CC 2000, Runtime Stack, Runtime Stack Frame, System Software