| Class and Description |
|---|
| Block
Represents BasicBlocks that partition
a method body.
|
| SlowPseudoTopologicalOrderer
Provide the pseudo topological order of a graph's nodes.
|
| Class and Description |
|---|
| BriefUnitGraph
Represents a CFG where the nodes are Unit instances, and
where no edges are included to account for control flow
associated with exceptions.
|
| DirectedGraph
Defines the notion of a directed graph.
|
| TrapUnitGraph |
| Class and Description |
|---|
| BriefUnitGraph
Represents a CFG where the nodes are Unit instances, and
where no edges are included to account for control flow
associated with exceptions.
|
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| TrapUnitGraph |
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| ExceptionalUnitGraph |
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| Class and Description |
|---|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| HashMutableDirectedGraph
HashMap based implementation of a MutableBlockGraph.
|
| MutableDirectedGraph
Defines a DirectedGraph which is modifiable.
|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| BriefUnitGraph
Represents a CFG where the nodes are Unit instances, and
where no edges are included to account for control flow
associated with exceptions.
|
| DirectedGraph
Defines the notion of a directed graph.
|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| Class and Description |
|---|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| MutableDirectedGraph
Defines a DirectedGraph which is modifiable.
|
| MutableEdgeLabelledDirectedGraph
Defines a DirectedGraph which is modifiable and associates
a label object with every edge.
|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| Block
Represents BasicBlocks that partition
a method body.
|
| BlockGraph
Represents the control flow graph of a
Body at the basic block level. |
| DominanceFrontier
Interface to compute and/or store the dominance frontiers of nodes
in a dominator tree.
|
| DominatorsFinder
General interface for a dominators analysis.
|
| DominatorTree
Constructs a dominator tree structure from the given
DominatorsFinder.
|
| ReversibleGraph
DirectedGraph which can be reversed and re-reversed.
|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| Block
Represents BasicBlocks that partition
a method body.
|
| BlockGraph
Represents the control flow graph of a
Body at the basic block level. |
| DominanceFrontier
Interface to compute and/or store the dominance frontiers of nodes
in a dominator tree.
|
| DominatorTree
Constructs a dominator tree structure from the given
DominatorsFinder.
|
| ReversibleGraph
DirectedGraph which can be reversed and re-reversed.
|
| Class and Description |
|---|
| BlockGraph
Represents the control flow graph of a
Body at the basic block level. |
| Class and Description |
|---|
| ExceptionalUnitGraph |
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| Block
Represents BasicBlocks that partition
a method body.
|
| BlockGraph
Represents the control flow graph of a
Body at the basic block level. |
| BriefUnitGraph
Represents a CFG where the nodes are Unit instances, and
where no edges are included to account for control flow
associated with exceptions.
|
| ClassicCompleteUnitGraph
Represents a CFG for a Body instance where the nodes are
Unit instances, and where edges are a conservative
indication of unexceptional and exceptional control
flow. |
| DirectedGraph
Defines the notion of a directed graph.
|
| DominanceFrontier
Interface to compute and/or store the dominance frontiers of nodes
in a dominator tree.
|
| DominatorNode
Represents a dominator node in DominatorTree.
|
| DominatorsFinder
General interface for a dominators analysis.
|
| DominatorTree
Constructs a dominator tree structure from the given
DominatorsFinder.
|
| ExceptionalBlockGraph
Represents a CFG where the nodes are
Blocks and the
edges are derived from control flow. |
| ExceptionalBlockGraph.ExceptionDest |
| ExceptionalGraph
Defines the interface for navigating a control flow graph which
distinguishes exceptional control flow.
|
| ExceptionalGraph.ExceptionDest
Data structure to represent the fact that
a given
Trap will catch some subset of the exceptions
which may be thrown by a given graph node. |
| ExceptionalUnitGraph |
| ExceptionalUnitGraph.ExceptionDest |
| HashMutableDirectedGraph
HashMap based implementation of a MutableBlockGraph.
|
| HashMutableEdgeLabelledDirectedGraph |
| MHGDominatorsFinder
Calculate dominators for basic blocks.
|
| MutableDirectedGraph
Defines a DirectedGraph which is modifiable.
|
| MutableEdgeLabelledDirectedGraph
Defines a DirectedGraph which is modifiable and associates
a label object with every edge.
|
| Orderer
An orderer builds an order on a directed, not necessarily acyclic, graph.
|
| PseudoTopologicalOrderer
Orders in pseudo-topological order, the nodes of a DirectedGraph instance.
|
| ReversibleGraph
DirectedGraph which can be reversed and re-reversed.
|
| SlowPseudoTopologicalOrderer
Provide the pseudo topological order of a graph's nodes.
|
| TrapUnitGraph |
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| Class and Description |
|---|
| Block
Represents BasicBlocks that partition
a method body.
|
| BlockGraph
Represents the control flow graph of a
Body at the basic block level. |
| DirectedGraph
Defines the notion of a directed graph.
|
| DominatorsFinder
General interface for a dominators analysis.
|
| DominatorTree
Constructs a dominator tree structure from the given
DominatorsFinder.
|
| HashMutableEdgeLabelledDirectedGraph |
| MutableEdgeLabelledDirectedGraph
Defines a DirectedGraph which is modifiable and associates
a label object with every edge.
|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| Orderer
An orderer builds an order on a directed, not necessarily acyclic, graph.
|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| ExceptionalGraph
Defines the interface for navigating a control flow graph which
distinguishes exceptional control flow.
|
| UnitGraph
Represents a CFG where the nodes are
Unit instances and
edges represent unexceptional and (possibly) exceptional control
flow between Units. |
| Class and Description |
|---|
| DirectedGraph
Defines the notion of a directed graph.
|
| ExceptionalGraph
Defines the interface for navigating a control flow graph which
distinguishes exceptional control flow.
|