InliningIterator (Graal OpenJDK Project Documentation)

```
public class InliningIterator
extends Object
```
Given a graph, visit all fixed nodes in dominator-based order, collecting in the process the Invoke nodes with MethodCallTargetNode. Such list of callsites is returned by apply()

Constructors
Constructor and Description
`InliningIterator(StructuredGraph graph)`

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`LinkedList<Invoke>`	`apply()`
`private static int`	`count(Iterable<Invoke> invokes)`
`private void`	`forcedQueue(Node node)`
`private FixedNode`	`nextQueuedNode()`
`private void`	`queue(Node node)`
`private void`	`queueMerge(AbstractEndNode end)`
`private void`	`queueSuccessors(FixedNode x)`
`private boolean`	`visitedAllEnds(AbstractMergeNode merge)`

private final Deque<FixedNode> nodeQueue

public InliningIterator(StructuredGraph graph)

private void queueSuccessors(FixedNode x)

private void queueMerge(AbstractEndNode end)

private boolean visitedAllEnds(AbstractMergeNode merge)

private static int count(Iterable<Invoke> invokes)

Class InliningIterator