|
|||||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||||
| Classes in org.jikesrvm.compilers.opt.controlflow used by org.jikesrvm.compilers.opt | |
|---|---|
| BranchOptimizations
Perform simple peephole optimizations for branches. |
|
| Classes in org.jikesrvm.compilers.opt.controlflow used by org.jikesrvm.compilers.opt.bc2ir | |
|---|---|
| BranchOptimizations
Perform simple peephole optimizations for branches. |
|
| Classes in org.jikesrvm.compilers.opt.controlflow used by org.jikesrvm.compilers.opt.controlflow | |
|---|---|
| AnnotatedLSTNode.BBEnum
This class implements an enumeration of BasicBlocks. |
|
| AnnotatedLSTNode.NonRegularLoopException
Exception thrown when a non-regular loop is encountered |
|
| BranchOptimizationDriver
IR level independent driver for simple peephole optimizations of branches. |
|
| BranchOptimizations
Perform simple peephole optimizations for branches. |
|
| Diamond
This class represents a diamond (if-then-else) structure in the control-flow graph. |
|
| DominatorOperator
This class implements the MEET operation for the dataflow equations for the dominator calculation. |
|
| DominatorTreeNode
This class implements a node in the dominator tree. |
|
| LoopUnrolling.RealDefs
|
|
| LSTGraph
Identify natural loops and builds the LST (Loop Structure Tree) Note: throws an exception if an irreducible loop is found (which I believe could only happen in Java from modified bytecode, because Java source code is structured enough to prevent irreducible loops.) |
|
| LSTNode
A node in the LST (Loop Structure Tree) |
|
| LSTNode.Edge
|
|
| LTDominatorInfo
This class holds data associated with a basic block as computed by the Lengauer-Tarjan dominator calculation. |
|
| ReorderingPhase.ChainInfo
|
|
| ReorderingPhase.Edge
|
|
| StaticSplitting.CandInfo
|
|
| Classes in org.jikesrvm.compilers.opt.controlflow used by org.jikesrvm.compilers.opt.hir2lir | |
|---|---|
| BranchOptimizations
Perform simple peephole optimizations for branches. |
|
| Classes in org.jikesrvm.compilers.opt.controlflow used by org.jikesrvm.compilers.opt.ir | |
|---|---|
| DominatorTree
This class provides the abstraction of a dominator tree TODO: we do not support IRs with exception handlers. |
|
| LSTGraph
Identify natural loops and builds the LST (Loop Structure Tree) Note: throws an exception if an irreducible loop is found (which I believe could only happen in Java from modified bytecode, because Java source code is structured enough to prevent irreducible loops.) |
|
| Classes in org.jikesrvm.compilers.opt.controlflow used by org.jikesrvm.compilers.opt.ssa | |
|---|---|
| AnnotatedLSTNode
A node in the LST (Loop Structure Tree) with added information on: Whether this is a countable, affine or non-regular loop The registers being used to hold the loop iterator The initial loop iterator value The terminal loop iterator value The instruction that modifies the iterator The phi instruction that merges the redefined iterator with its original value The condition used to test for loop termination The stride operand The information is only held on regular loops. |
|
| BranchOptimizations
Perform simple peephole optimizations for branches. |
|
| DominatorTree
This class provides the abstraction of a dominator tree TODO: we do not support IRs with exception handlers. |
|
| LSTGraph
Identify natural loops and builds the LST (Loop Structure Tree) Note: throws an exception if an irreducible loop is found (which I believe could only happen in Java from modified bytecode, because Java source code is structured enough to prevent irreducible loops.) |
|
|
|||||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||||