|
SandMark version 3.0 |
|||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Class Summary | |
Assert | This class is used for making assertions, if an assertion fails an IllegalArgumentException is thrown. |
BasicBlock | BasicBlock represents a basic block in a control flow graph. |
CallGenerator | |
CallingCallGenerator | |
CodeContext | A CodeContext encapsulates an InstructionHandle and an InstructionList to simplify the generation of sequences of code. |
ControlFlowSynthesizer | Family of classes that generate code to match a control flow graph. |
DominanceFrontier | |
DomTree | All files in the distribution of BLOAT (Bytecode Level Optimization and Analysis tool for Java(tm)) are Copyright 1997-2001 by the Purdue Research Foundation of Purdue University. |
DotGraph | |
Edge | |
Graph | |
GraphNode | GraphNode represents a node in a Graph. |
InterferenceGraph | InterferenceGraph analyzes accesses to local variables within a method to determine where variables are live. |
InterferenceGraph.PartialNode | Represents a part basic block as a live range. |
InterferenceGraph.RangeNode | Represents a whole basic block as a live range. |
IntFuncSynthesizer | An IntFuncSynthesizer generates code having a control structure that matches a supplied graph. |
LiveVariable | LiveVariable encapsulates information about a variable in the local variable table. |
MethodCFG | |
MinimalSynthesizer | A simple code generator designed to minimize output size without reordering nodes. |
NullNENullCallGenerator | |
PositiveIntSynthesizer | A PositiveIntSyntheizer generates an integer function that works by maintaining the "hidden" invariant: its one variable always has a nonnegative value. |
ProgramCFG | |
ProgramGraph | |
RegisterAllocator | |
SimpleGotoSynthesizer | A simple code generator using conditional and unconditional branches. |
SimpleSwitchSynthesizer | A simple code generator using TABLESWITCH instructions. |
VoidMethodSynthesizer | A VoidMethodSynthesizer generates code having a control structure that matches a supplied graph. |
This package performs analysis and synthesis related to program control flow. It includes a method control flow graph, dominance frontier, dominator tree, liveness analysis, interference graph, and a register allocator. It also contains a hierarchy of classes for generating methods that mimic a graph.
|
SandMark version 3.0 Wed Jan 29 10:30:05 MST 2003 |
|||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |