We present a framework that allows translation of predicated code into the static single assignment (SSA) form, and simpliJies application of the SSA-based optimizations to predicated code. In particulal; we represent predicate join points in the program by the Q-functions similar to the $-functions of the basic SSA. The SSA-based optimizations (such as constant propagation) can be applied to predicated code by simply specifying additional rules for processing the Q-functions. We present efJicient algorithms for constructing, and then for removing the Q-functions at the end of SSA processing. Our algorithm for translating out of the Q-SSA splits predicated live ranges into smaller live ranges active under disjoint predicates. The experimental evaluation on a set of predicated benchmarks demonstrates e@-ciency of our approach.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.