See: Description
| Interface | Description |
|---|---|
| Graph.DuplicationReplacement | |
| Graph.NodeEventListener |
Client interested in one or more node related events.
|
| IterableNodeType |
A marker for a node type supporting fast iteration of its
instances in a graph.
|
| Node.ValueNumberable |
Marker for a node that can be replaced by another node via global value numbering.
|
| NodeClass.InplaceUpdateClosure | |
| NodeClassIterable |
The iterator returned by this iterable can be used to access
positions during
iteration using NodePosIterator.nextPosition(). |
| NodeCollectionsProvider |
Extends
CollectionsProvider with support for creating Node based collections. |
| NodeInterface | |
| NodePosIterator |
Describes an edge slot for a
NodeClass. |
| Class | Description |
|---|---|
| CachedGraph<G extends Graph> |
This class is a container of a graph that needs to be readonly and optionally a lazily created
mutable copy of the graph.
|
| DefaultNodeCollectionsProvider |
A default implementation of
NodeCollectionsProvider that creates standard JDK collection
class objects. |
| Edges |
Describes
Node fields representing the set of inputs for the node or the set of the
node's successors. |
| Edges.AllEdgesIterator | |
| Edges.EdgesIterator |
An iterator that will iterate over edges.
|
| Edges.EdgesWithModCountIterator | |
| Graph |
This class is a graph container, it contains the set of nodes that belong to this graph.
|
| Graph.CacheEntry |
Entry in
Graph.cachedLeafNodes. |
| Graph.ChainedNodeEventListener | |
| Graph.MapReplacement | |
| Graph.Mark |
A snapshot of the live node count in a graph.
|
| Graph.Options | |
| Graph.PlaceHolderNode | |
| GraphNodeIterator |
Iterates over the nodes in a given graph.
|
| InputEdges | |
| Node |
This class is the base class for all nodes.
|
| NodeBitMap | |
| NodeBitMap.MarkedNodeIterator | |
| NodeClass<T> |
Metadata for every
Node type. |
| NodeClass.EdgeInfo |
Describes a field representing an input or successor edge in a node.
|
| NodeClass.InputInfo |
Describes a field representing an input edge in a node.
|
| NodeClass.NodeFieldsScanner | |
| NodeFlood | |
| NodeFlood.QueueConsumingIterator | |
| NodeFlood.UnmarkedNodeIterator | |
| NodeIdAccessor |
An entity that depends upon stable node identifiers.
|
| NodeInputList<T extends Node> | |
| NodeList<T extends Node> | |
| NodeMap<T> | |
| NodeNodeMap | |
| NodeStack | |
| NodeSuccessorList<T extends Node> | |
| NodeUnionFind |
Union-find data structure for
Nodes. |
| NodeUsageIterable | |
| NodeUsageIterator | |
| NodeUsageWithModCountIterator | |
| NodeWorkList | |
| NodeWorkList.IterativeNodeWorkList | |
| NodeWorkList.SingletonNodeWorkList | |
| Position |
Describes an edge slot for a
NodeClass. |
| SuccessorEdges | |
| TypedGraphNodeIterator<T extends IterableNodeType> |
| Enum | Description |
|---|---|
| Edges.Type |
Constants denoting whether a set of edges are inputs or successors.
|
| Graph.NodeEvent |
The type of events sent to a
Graph.NodeEventListener. |
| Error | Description |
|---|---|
| GraalGraphJVMCIError |
This error is the graph/node aware extension of JVMCIError.
|
| VerificationError |
This error represents a failed verification of a node .
|
| Annotation Type | Description |
|---|---|
| Node.ConstantNodeParameter |
Denotes that a parameter of an intrinsic method must be a compile
time constant at all call sites to the intrinsic method.
|
| Node.InjectedNodeParameter |
Denotes an injected parameter in a node intrinsic constructor.
|
| Node.Input |
Denotes a non-optional (non-null) node input.
|
| Node.NodeIntrinsic |
Annotates a method that can be replaced by a compiler intrinsic.
|
| Node.OptionalInput |
Denotes an optional (nullable) node input.
|
| Node.Successor |