com.oracle.graal.graph

Interface IterableNodeType

All Known Implementing Classes:

AbstractBeginNode, AbstractDeoptimizeNode, AbstractEndNode, AbstractMergeNode, BeginNode, BeginStateSplitNode, ControlSplitNode, DeoptimizeNode, DispatchBeginNode, DynamicDeoptimizeNode, EndNode, EntryMarkerNode, EntryProxyNode, ExceptionObjectNode, FixedGuardNode, FrameState, GuardedValueNode, GuardProxyNode, IfNode, IntegerAddExactSplitNode, IntegerExactArithmeticSplitNode, IntegerMulExactSplitNode, IntegerSubExactSplitNode, IntegerSwitchNode, InvokeWithExceptionNode, KillingBeginNode, LoopBeginNode, LoopEndNode, LoopExitNode, MaterializeFrameNode, MergeNode, MethodCallTargetNode, MonitorEnterNode, MonitorExitNode, MonitorIdNode, NeverPartOfCompilationNode, NewFrameNode, NewFrameNode.VirtualOnlyInstanceNode, OSRLocalNode, OSRStartNode, ParameterNode, PiArrayNode, PiNode, ProxyNode, RawMonitorEnterNode, ResolvedMethodHandleCallTargetNode, ReturnNode, ShortCircuitOrNode, SimpleInfopointNode, StartNode, StubStartNode, SwitchNode, TypedNodeIteratorTest.TestNode, TypedNodeIteratorTest2.NodeB, TypedNodeIteratorTest2.NodeC, TypedNodeIteratorTest2.NodeD, TypeSwitchNode, UnsafeCastNode, ValueProxyNode, VirtualArrayNode, VirtualBoxingNode, VirtualInstanceNode, VirtualObjectNode

public interface IterableNodeType

A marker for a node type supporting fast iteration of its instances in a graph. The support for fast iteration comes with a memory cost (e.g., extra data structures Graph) so only node types for which fast iteration provides a compilation performance benefit should implement this interface.