Searched refs:getNodes (Results 1 - 25 of 191) sorted by relevance

12345678

/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/
H A DIterativeConditionalEliminationPhase.java57 if (listener.getNodes().isEmpty()) {
60 for (Node node : graph.getNodes()) {
62 listener.getNodes().add(node);
65 canonicalizer.applyIncremental(graph, context, listener.getNodes());
66 listener.getNodes().clear();
H A DVerifyHeapAtReturnPhase.java34 for (ReturnNode returnNode : graph.getNodes(ReturnNode.TYPE)) {
H A DIncrementalCanonicalizerPhase.java57 if (!listener.getNodes().isEmpty()) {
58 canonicalizer.applyIncremental(graph, context, listener.getNodes(), null, false);
H A DLoopSafepointInsertionPhase.java48 for (LoopBeginNode loopBeginNode : graph.getNodes(LoopBeginNode.TYPE)) {
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core.test/src/org/graalvm/compiler/core/test/
H A DHashCodeTest.java102 Assert.assertEquals(0, g.getNodes().filter(InvokeNode.class).count());
108 Assert.assertEquals(0, g.getNodes().filter(InvokeNode.class).count());
124 Assert.assertEquals(0, g.getNodes().filter(InvokeNode.class).count());
131 Assert.assertEquals(0, g.getNodes().filter(InvokeNode.class).count());
147 int invokeNodeCount = g.getNodes().filter(InvokeNode.class).count();
148 int invokeWithExceptionNodeCount = g.getNodes().filter(InvokeWithExceptionNode.class).count();
150 Assert.assertEquals(1, g.getNodes().filter(LoadHubNode.class).count());
151 Assert.assertEquals(1, g.getNodes().filter(LoadMethodNode.class).count());
H A DPhiCreationTests.java46 Assert.assertFalse(graph.getNodes().filter(ValuePhiNode.class).iterator().hasNext());
59 Assert.assertFalse(graph.getNodes().filter(ValuePhiNode.class).iterator().hasNext());
74 Assert.assertFalse(graph.getNodes().filter(ValuePhiNode.class).iterator().hasNext());
91 Assert.assertFalse(graph.getNodes().filter(ValuePhiNode.class).iterator().hasNext());
H A DGuardedIntrinsicTest.java151 Assert.assertEquals(1, parsedForCompile.getNodes().filter(LoadMethodNode.class).count());
152 Assert.assertEquals(1, parsedForCompile.getNodes().filter(LoadHubNode.class).count());
155 Assert.assertEquals(1, parsedForCompile.getNodes().filter(OpaqueNode.class).count());
158 List<Node> invokes = graph.getNodes().filter(n -> n instanceof Invoke).snapshot();
167 Assert.assertEquals(0, parsedForCompile.getNodes().filter(LoadMethodNode.class).count());
168 Assert.assertEquals(0, parsedForCompile.getNodes().filter(LoadHubNode.class).count());
170 Assert.assertEquals(0, parsedForCompile.getNodes().filter(InvokeNode.class).count());
178 Assert.assertEquals(0, parsedForCompile.getNodes().filter(LoadMethodNode.class).count());
179 Assert.assertEquals(0, parsedForCompile.getNodes().filter(LoadHubNode.class).count());
190 Assert.assertEquals(1, parsedForCompile.getNodes()
[all...]
H A DLockEliminationTest.java73 assertDeepEquals(1, graph.getNodes().filter(RawMonitorEnterNode.class).count());
74 assertDeepEquals(1, graph.getNodes().filter(MonitorExitNode.class).count());
91 assertDeepEquals(1, graph.getNodes().filter(RawMonitorEnterNode.class).count());
92 assertDeepEquals(1, graph.getNodes().filter(MonitorExitNode.class).count());
111 assertDeepEquals(1, graph.getNodes().filter(RawMonitorEnterNode.class).count());
112 assertDeepEquals(1, graph.getNodes().filter(MonitorExitNode.class).count());
H A DEnumSwitchTest.java147 assertTrue(graph.getNodes().filter(LoadIndexedNode.class).count() == 1);
149 assertTrue(graph.getNodes().filter(IntegerSwitchNode.class).count() == 1);
161 assertTrue(graph.getNodes().filter(LoadIndexedNode.class).count() == 0);
163 assertTrue(graph.getNodes().filter(IntegerSwitchNode.class).count() == 1);
H A DDeMorganCanonicalizationTest.java48 Assert.assertEquals(1, g.getNodes().filter(OrNode.class).count());
49 Assert.assertEquals(1, g.getNodes().filter(NotNode.class).count());
61 Assert.assertEquals(1, g.getNodes().filter(AndNode.class).count());
62 Assert.assertEquals(1, g.getNodes().filter(NotNode.class).count());
H A DSchedulingTest.java59 for (FrameState fs : graph.getNodes().filter(FrameState.class).snapshot()) {
67 assertTrue(graph.getNodes().filter(LoopExitNode.class).count() == 1);
68 LoopExitNode loopExit = graph.getNodes().filter(LoopExitNode.class).first();
70 for (BinaryArithmeticNode<?> node : graph.getNodes().filter(BinaryArithmeticNode.class)) {
/openjdk10/hotspot/src/share/tools/IdealGraphVisualizer/Bytecodes/src/com/sun/hotspot/igv/bytecodes/
H A DSelectBytecodesCookie.java44 public Set<InputNode> getNodes() { method in class:SelectBytecodesCookie
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.hotspot.test/src/org/graalvm/compiler/hotspot/test/
H A DAheadOfTimeCompilationTest.java79 assertDeepEquals(2, result.getNodes().filter(ReadNode.class).count());
87 assertDeepEquals(0, result.getNodes().filter(ReadNode.class).count());
103 assertDeepEquals(1, result.getNodes().filter(ReadNode.class).count());
115 assertDeepEquals(0, result.getNodes().filter(ReadNode.class).count());
130 assertDeepEquals(2, result.getNodes().filter(ReadNode.class).count());
141 assertDeepEquals(0, result.getNodes().filter(ReadNode.class).count());
167 assertDeepEquals(0, result.getNodes().filter(FloatingReadNode.class).count());
168 assertDeepEquals(0, result.getNodes().filter(ReadNode.class).count());
179 assertDeepEquals(0, result.getNodes().filter(FloatingReadNode.class).count());
180 assertDeepEquals(0, result.getNodes(PiNod
[all...]
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases/src/org/graalvm/compiler/phases/graph/
H A DInferStamps.java50 for (Node n : graph.getNodes()) {
71 for (Node n : graph.getNodes()) {
90 for (Node n : graph.getNodes()) {
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core.test/src/org/graalvm/compiler/core/test/ea/
H A DEarlyReadEliminationTest.java93 assertTrue(result.graph().getNodes().filter(LoadFieldNode.class).isEmpty());
99 assertTrue(result.graph().getNodes().filter(ReadNode.class).isEmpty());
128 assertTrue(result.graph().getNodes().filter(LoadFieldNode.class).isEmpty());
142 assertTrue(result.graph().getNodes().filter(LoadFieldNode.class).isEmpty());
159 assertTrue(result.graph().getNodes().filter(LoadFieldNode.class).isEmpty());
164 assertTrue(result.graph().getNodes().filter(ReadNode.class).isEmpty());
182 assertDeepEquals(0, result.graph().getNodes().filter(LoadFieldNode.class).count());
200 assertDeepEquals(1, result.graph().getNodes().filter(LoadFieldNode.class).count());
217 assertTrue(graph.getNodes().filter(LoadFieldNode.class).isEmpty());
218 List<ReturnNode> returnNodes = graph.getNodes(ReturnNod
[all...]
H A DPEAReadEliminationTest.java54 assertDeepEquals(0, graph.getNodes().filter(LoadIndexedNode.class).count());
74 assertDeepEquals(3, graph.getNodes().filter(LoadIndexedNode.class).count());
75 assertDeepEquals(7, graph.getNodes().filter(StoreIndexedNode.class).count());
98 assertDeepEquals(3, graph.getNodes().filter(LoadIndexedNode.class).count());
117 assertDeepEquals(3, graph.getNodes().filter(LoadIndexedNode.class).count());
133 assertDeepEquals(1, graph.getNodes().filter(RawLoadNode.class).count());
146 assertDeepEquals(3, graph.getNodes().filter(RawLoadNode.class).count());
162 assertDeepEquals(1, graph.getNodes().filter(RawLoadNode.class).count());
176 assertDeepEquals(3, graph.getNodes().filter(RawLoadNode.class).count());
192 assertDeepEquals(1, graph.getNodes()
[all...]
H A DEATestBase.java147 int newInstanceCount = graph.getNodes().filter(NewInstanceNode.class).count() + graph.getNodes().filter(NewArrayNode.class).count() +
148 graph.getNodes().filter(CommitAllocationNode.class).count();
163 returnNodes = graph.getNodes(ReturnNode.TYPE).snapshot();
/openjdk10/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/
H A DInputGraph.java74 for(InputNode node : getNodes()) {
84 Map<InputNode, List<InputEdge>> result = new HashMap<>(getNodes().size());
85 for(InputNode n : this.getNodes()) {
97 for(InputNode n : this.getNodes()) {
106 Map<InputNode, List<InputEdge>> result = new HashMap<>(getNodes().size());
107 for(InputNode n : this.getNodes()) {
119 for(InputNode n : this.getNodes()) {
161 for (InputNode n : b.getNodes()) {
167 for (InputNode n : this.getNodes()) {
210 public Collection<InputNode> getNodes() { method in class:InputGraph
[all...]
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.graph.test/src/org/graalvm/compiler/graph/test/
H A DTypedNodeIteratorTest.java69 assertEquals("a", toString(graph.getNodes(TestNode.TYPE)));
83 assertEquals("", toString(graph.getNodes(TestNode.TYPE)));
94 assertEquals("a", toString(graph.getNodes(TestNode.TYPE)));
96 assertEquals("ac", toString(graph.getNodes(TestNode.TYPE)));
104 Iterator<TestNode> iterator = graph.getNodes(TestNode.TYPE).iterator();
124 for (TestNode tn : graph.getNodes(TestNode.TYPE)) {
144 for (TestNode tn2 : graph.getNodes(TestNode.TYPE)) {
156 assertEquals("dddd", toString(graph.getNodes(TestNode.TYPE)));
166 for (TestNode tn : graph.getNodes(TestNode.TYPE)) {
176 for (TestNode tn : graph.getNodes(TestNod
[all...]
H A DTypedNodeIteratorTest2.java106 Assert.assertEquals("bd", TypedNodeIteratorTest.toString(graph.getNodes(NodeB.TYPE)));
107 Assert.assertEquals("d", TypedNodeIteratorTest.toString(graph.getNodes(NodeD.TYPE)));
116 for (NodeB tn : graph.getNodes(NodeB.TYPE)) {
123 for (NodeB tn : graph.getNodes(NodeB.TYPE)) {
129 assertEquals(4, graph.getNodes(NodeB.TYPE).count());
130 assertEquals(1, graph.getNodes(NodeD.TYPE).count());
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.loop.phases/src/org/graalvm/compiler/loop/phases/
H A DLoopPartialUnrollPhase.java74 if (!listener.getNodes().isEmpty()) {
75 canonicalizer.applyIncremental(graph, context, listener.getNodes());
76 listener.getNodes().clear();
/openjdk10/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DGraph.java76 public Collection<Node<N, E>> getNodes() { method in class:Graph
112 for (Node<N, E> n : getNodes()) {
125 for (Node<N, E> n : getNodes()) {
143 for (Node<N, E> n : getNodes()) {
192 traverseDFS(getNodes(), tv);
197 for (Node<N, E> n : getNodes()) {
234 for (Node<N, E> n : getNodes()) {
240 for (Node<N, E> n : getNodes()) {
278 for (Node<N, E> n : getNodes()) {
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes.test/src/org/graalvm/compiler/nodes/test/
H A DLoopPhiCanonicalizerTest.java68 Assert.assertEquals(5, graph.getNodes().filter(loopPhis).count());
70 Assert.assertEquals(2, graph.getNodes().filter(loopPhis).count());
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.hotspot/src/org/graalvm/compiler/hotspot/nodes/profiling/
H A DProfileInvokeNode.java42 * {@linkplain StructuredGraph#getNodes() live nodes} in a given graph.
45 return graph.getNodes().filter(ProfileInvokeNode.class);
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.replacements.aarch64/src/org/graalvm/compiler/replacements/aarch64/
H A DAArch64ReadReplacementPhase.java42 for (Node node : graph.getNodes()) {

Completed in 160 milliseconds

12345678