Package com.android.dx.ssa
package com.android.dx.ssa
-
ClassDescriptionThis class maps one register space into another, with each mapping built up individually and added via addMapping()Collects constants that are used more than once at the top of the method block.A variation on Appel Algorithm 19.12 "Dead code elimination in SSA form".Calculates the dominance-frontiers of a method's basic blocks.Dominance-frontier information for a single basic block.This class computes dominator and post-dominator information using the Lengauer-Tarjan method.Simple intraprocedural escape analysis.Lattice values used to indicate escape state for an object.A register mapper that keeps track of the accumulated interference information for the registers in the new namespace.Upgrades insn to their literal (constant-immediate) equivalent if possible.Code to figure out which local variables are active at which points in a method.Container for local variable information for a particular
SsaMethod.Combine identical move-param insns, which may result from Ropper's handling of synchronized methods.A "normal" (non-phi) instruction in SSA form.Runs a method through the SSA form conversion, any optimization algorithms, and returns it to rop form.optional optimizer stepsA Phi instruction (magical post-control-flow-merge) instruction in SSA form.Visitor interface for instances of this (outer) class.Resolves the result types of phi instructions.Represents a mapping between two register numbering schemes.A small variant of Wegman and Zadeck's Sparse Conditional Constant Propagation algorithm.Makes int sets for various parts of the optimizer.An SSA representation of a basic block.Label comparator.Visitor interface for basic blocks.Converts ROP methods to SSA MethodsAn instruction in SSA formVisitor interface for this class.A method in SSA form.Complete transformation to SSA form by renaming all registers accessed.