• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.java/src/org/graalvm/compiler/java/

Lines Matching refs:locals

90     protected final ValueNode[] locals;
137 this.locals = allocateArray(code.getMaxLocals());
158 locals[javaIndex] = arguments[index];
161 constantReceiver = locals[0].asJavaConstant();
167 locals[javaIndex] = arguments[index];
170 locals[javaIndex] = TWO_SLOT_MARKER;
206 locals[javaIndex] = graph.addOrUnique(receiver);
240 locals[javaIndex] = graph.addOrUnique(param);
243 locals[javaIndex] = TWO_SLOT_MARKER;
255 this.locals = other.locals.clone();
261 assert locals.length == code.getMaxLocals();
268 assert locals.length == code.getMaxLocals();
284 sb.append("[locals: [");
285 for (int i = 0; i < locals.length; i++) {
286 sb.append(i == 0 ? "" : ",").append(locals[i] == null ? "_" : locals[i] == TWO_SLOT_MARKER ? "#" : locals[i].toString(Verbosity.Id));
336 FrameState res = graph.add(new FrameState(outerFrameState, code, bci, locals, stack, stackSize, lockedObjects, Arrays.asList(monitorIds), rethrowException, duringCall));
344 return graph.add(new FrameState(outerFrameState, code, bci, locals, stack, stackSize, lockedObjects, Arrays.asList(monitorIds), rethrowException, duringCall));
409 locals[i] = merge(locals[i], other.locals[i], block);
446 assert !(block instanceof LoopBeginNode) : String.format("Phi functions for loop headers are create eagerly for changed locals and all stack slots: %s != %s", currentValue, otherValue);
465 inferPhiStamp(block, locals[i]);
485 locals[i] = createLoopPhi(loopBegin, locals[i], stampFromValueForForcedPhis && !changedInLoop);
498 ValueNode value = locals[i];
501 locals[i] = ProxyNode.forValue(value, loopExit, graph);
522 ValueNode value = locals[i];
525 locals[i] = proxyFunction.apply(value);
602 if (locals[i] == value) {
631 for (int i = 0; i < locals.length; i++) {
633 assert locals[i] != TWO_SLOT_MARKER || locals[i - 1] == null : "Clearing of second slot must have cleared the first slot too";
634 locals[i] = null;
638 for (int i = 0; i < locals.length; i++) {
640 assert locals[i] != TWO_SLOT_MARKER || locals[i - 1] == null : "Clearing of second slot must have cleared the first slot too";
641 locals[i] = null;
651 for (int i = 0; i < locals.length; i++) {
652 locals[i] = null;
676 return locals.length;
706 ValueNode x = locals[i];
708 assert slotKind.needsTwoSlots() ? locals[i + 1] == TWO_SLOT_MARKER : (i == locals.length - 1 || locals[i + 1] != TWO_SLOT_MARKER);
723 if (locals[i] == TWO_SLOT_MARKER) {
725 locals[i - 1] = null;
727 locals[i] = x;
730 locals[i + 1] = TWO_SLOT_MARKER;
731 } else if (i < locals.length - 1 && locals[i + 1] == TWO_SLOT_MARKER) {
736 locals[i + 1] = null;
914 int result = hashCode(locals, locals.length);
960 if (other.locals.length != locals.length) {
963 return equals(other.locals, locals, locals.length) && equals(other.stack, stack, stackSize) && equals(other.lockedObjects, lockedObjects, lockedObjects.length) &&
990 Debug.log("| state [nr locals = %d, stack depth = %d, method = %s]", localsSize(), stackSize(), getMethod());
992 ValueNode value = locals[i];