|
|||||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||||
| Uses of Graph in org.jikesrvm.compilers.opt.controlflow |
|---|
| Classes in org.jikesrvm.compilers.opt.controlflow that implement Graph | |
|---|---|
class |
AnnotatedLSTGraph
Extends the functionality of a LSTGraph so that it comprises
AnnotatedLSTNodes which have extra information in them. |
class |
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.) |
| Uses of Graph in org.jikesrvm.compilers.opt.depgraph |
|---|
| Classes in org.jikesrvm.compilers.opt.depgraph that implement Graph | |
|---|---|
class |
DepGraph
Dependence Graph for a single basic block in the program. |
| Uses of Graph in org.jikesrvm.compilers.opt.dfsolver |
|---|
| Classes in org.jikesrvm.compilers.opt.dfsolver that implement Graph | |
|---|---|
(package private) class |
DF_Graph
Implementation of a graph used in the guts of the dataflow equation solver. |
| Fields in org.jikesrvm.compilers.opt.dfsolver declared as Graph | |
|---|---|
private Graph |
DF_System.equations
The equations that comprise this dataflow system. |
| Uses of Graph in org.jikesrvm.compilers.opt.ir |
|---|
| Classes in org.jikesrvm.compilers.opt.ir that implement Graph | |
|---|---|
class |
ControlFlowGraph
The Factored Control Flow Graph (FCFG). |
| Uses of Graph in org.jikesrvm.compilers.opt.regalloc |
|---|
| Classes in org.jikesrvm.compilers.opt.regalloc that implement Graph | |
|---|---|
(package private) class |
CoalesceGraph
This class represents a graph, where the nodes are registers the edge weights represent affinities between registers. |
| Uses of Graph in org.jikesrvm.compilers.opt.util |
|---|
| Classes in org.jikesrvm.compilers.opt.util that implement Graph | |
|---|---|
class |
SpaceEffGraph
SpaceEffGraph package implements a generic directed graph that can be a multigraph. |
| Methods in org.jikesrvm.compilers.opt.util with parameters of type Graph | |
|---|---|
static Enumeration<GraphNode> |
GraphUtilities.enumerateTopSort(Graph G)
Return an enumeration of the nodes, or a subset of the nodes, in an acyclic graph in topological order. |
static Enumeration<GraphNode> |
GraphUtilities.enumerateTopSort(Graph G,
Enumeration<GraphNode> ie)
|
static Enumeration<GraphNode> |
GraphUtilities.enumerateTopSort(Graph G,
Enumeration<GraphNode> ie,
GraphEdgeFilter f)
|
private static Enumeration<GraphNode> |
GraphUtilities.enumerateTopSortInternal(Graph G,
Enumeration<GraphNode> e)
|
| Constructors in org.jikesrvm.compilers.opt.util with parameters of type Graph | |
|---|---|
DFSenumerateByFinish(Graph net)
Construct a depth-first enumerator across all the nodes of a graph. |
|
DFSenumerateByFinish(Graph net,
Enumeration<GraphNode> nodes)
Construct a depth-first enumerator across the (possibly improper) subset of nodes reachable from the nodes in the given enumeration. |
|
FilteredDFSenumerateByFinish(Graph net,
Enumeration<GraphNode> nodes,
GraphEdgeFilter filter)
|
|
ReverseDFSenumerateByFinish(Graph net)
Construct a reverse DFS across a graph. |
|
ReverseDFSenumerateByFinish(Graph net,
Enumeration<GraphNode> nodes)
Construct a reverse DFS across a subset of a graph, starting at the given set of nodes. |
|
ReverseFilteredDFSenumerateByFinish(Graph net,
Enumeration<GraphNode> nodes,
GraphEdgeFilter filter)
|
|
|
|||||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||||