< prev index next >

src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.graph/src/org/graalvm/compiler/graph/NodeBitMap.java

Print this page

        

*** 193,203 **** int bitIndex = Long.numberOfTrailingZeros(word); int nodeId = wordIndex * Long.SIZE + bitIndex; Node result = graph.getNode(nodeId); if (result == null) { // node was deleted -> clear the bit and continue searching ! bits[wordIndex] = bits[wordIndex] & ~(1 << bitIndex); int nextNodeId = nodeId + 1; if ((nextNodeId & (Long.SIZE - 1)) == 0) { // we reached the end of this word break; } else { --- 193,203 ---- int bitIndex = Long.numberOfTrailingZeros(word); int nodeId = wordIndex * Long.SIZE + bitIndex; Node result = graph.getNode(nodeId); if (result == null) { // node was deleted -> clear the bit and continue searching ! bits[wordIndex] = bits[wordIndex] & ~(1L << bitIndex); int nextNodeId = nodeId + 1; if ((nextNodeId & (Long.SIZE - 1)) == 0) { // we reached the end of this word break; } else {
< prev index next >