src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.replacements.jdk9.test/src/org/graalvm/compiler/replacements/jdk9/test/VarHandleTest.java
equal
deleted
inserted
replaced
1 /* |
1 /* |
2 * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved. |
2 * Copyright (c) 2018, 2019, Oracle and/or its affiliates. All rights reserved. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * |
4 * |
5 * This code is free software; you can redistribute it and/or modify it |
5 * This code is free software; you can redistribute it and/or modify it |
6 * under the terms of the GNU General Public License version 2 only, as |
6 * under the terms of the GNU General Public License version 2 only, as |
7 * published by the Free Software Foundation. |
7 * published by the Free Software Foundation. |
160 for (Node n : graph.getNodes()) { |
160 for (Node n : graph.getNodes()) { |
161 if (n instanceof StartNode) { |
161 if (n instanceof StartNode) { |
162 startNodes++; |
162 startNodes++; |
163 } else if (n instanceof MemoryCheckpoint.Single) { |
163 } else if (n instanceof MemoryCheckpoint.Single) { |
164 MemoryCheckpoint.Single single = (MemoryCheckpoint.Single) n; |
164 MemoryCheckpoint.Single single = (MemoryCheckpoint.Single) n; |
165 if (single.getLocationIdentity().isAny()) { |
165 if (single.getKilledLocationIdentity().isAny()) { |
166 anyKillCount++; |
166 anyKillCount++; |
167 } |
167 } |
168 } else if (n instanceof MemoryCheckpoint.Multi) { |
168 } else if (n instanceof MemoryCheckpoint.Multi) { |
169 MemoryCheckpoint.Multi multi = (MemoryCheckpoint.Multi) n; |
169 MemoryCheckpoint.Multi multi = (MemoryCheckpoint.Multi) n; |
170 for (LocationIdentity loc : multi.getLocationIdentities()) { |
170 for (LocationIdentity loc : multi.getKilledLocationIdentities()) { |
171 if (loc.isAny()) { |
171 if (loc.isAny()) { |
172 anyKillCount++; |
172 anyKillCount++; |
173 break; |
173 break; |
174 } |
174 } |
175 } |
175 } |