A method for performing partial dead code elimination without transforming control flow graph
Original Publication Date: 2003-Jan-20
Included in the Prior Art Database: 2003-Jan-20
Disclosed is a method for performing partial dead code elimination (PDE) without transforming control flow graph (CFG). In general, some special control flow edges (called "critical edges") become barriers for performing PDE. Previous work solves critical edges by inserting a block on each critical edge. However, this solution increases the number of blocks, and thus compilation time and memory consumption are increased. This disclosure describes a method for performing PDE without inserting a block on each critical edge.