See: Description
| Interface | Description |
|---|---|
| Graph.DuplicationReplacement | |
| IterableNodeType |
A marker for a node type supporting fast iteration of its
instances in a graph.
|
| MemoryKillMarker |
Any node that includes
InputType.Memory in
NodeInfo.allowedUsageTypes
must also implement a subtype of this interface. |
| Node.IndirectCanonicalization |
Marker interface for nodes that contain other nodes.
|
| Node.ValueNumberable |
Marker for a node that can be replaced by another node via global value numbering.
|
| SourceLanguagePosition |
Provides a path to report information about a high level language source position to the Graph
Visualizer.
|
| SourceLanguagePositionProvider |
Provider of
SourceLanguagePosition for a constant if it represents an AST node. |
| 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.
|
| Edges |
Describes
Node fields representing the set of inputs for the node or the set of the
node's successors. |
| Graph |
This class is a graph container, it contains the set of nodes that belong to this graph.
|
| Graph.Mark |
A snapshot of the live node count in a graph.
|
| Graph.NodeEventListener |
Client interested in one or more node related events.
|
| Graph.Options | |
| InlineCacheGuardPosition | |
| InputEdges | |
| LinkedNodeStack |
A stack implementation for Node that uses a singly linked list as its underlying
storage strategy making push/pop operation O(1) at the cost of a constant memory overhead per
entry.
|
| Node |
This class is the base class for all nodes.
|
| Node.EdgeVisitor | |
| Node.NodeInsertionStackTrace | |
| NodeBitMap | |
| 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 |
A data structure for visiting nodes in a graph iteratively.
|
| NodeInputList<T extends Node> | |
| NodeList<T extends Node> | |
| NodeList.SubList<R extends Node> | |
| NodeMap<T> | |
| NodeSourcePosition | |
| NodeStack | |
| NodeSuccessorList<T extends Node> | |
| NodeUnionFind |
Union-find data structure for
Nodes. |
| NodeWorkList | |
| NodeWorkList.IterativeNodeWorkList |
A data structure for visiting nodes in a graph iteratively.
|
| NodeWorkList.SingletonNodeWorkList |
A data structure for visiting nodes in a graph iteratively.
|
| Position |
Describes an edge slot for a
NodeClass. |
| SuccessorEdges |
| 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 |
|---|---|
| GraalGraphError |
This error is the graph/node aware extension of
GraalError. |
| 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.NodeIntrinsicFactory |
Marker annotation indicating that the class uses factory methods instead of constructors for
intrinsification.
|
| Node.OptionalInput |
Denotes an optional (nullable) node input.
|
| Node.Successor |
Denotes a non-optional (non-null) node successor.
|