Searched refs:stackTop (Results 1 – 4 of 4) sorted by relevance
36 protected int stackTop; field in Tracer45 stackTop = 0; in Tracer()54 stackTop = t.stackTop; in Tracer()136 stackTypes[stackTop++] = new TypeData.NullType(); in doOpcode0_53()145 stackTypes[stackTop++] = INTEGER; in doOpcode0_53()149 stackTypes[stackTop++] = LONG; in doOpcode0_53()150 stackTypes[stackTop++] = TOP; in doOpcode0_53()155 stackTypes[stackTop++] = FLOAT; in doOpcode0_53()159 stackTypes[stackTop++] = DOUBLE; in doOpcode0_53()160 stackTypes[stackTop++] = TOP; in doOpcode0_53()[all …]
186 copyTypeData(tb.stackTop, tb.stackTypes, stackTypes); in make()187 stackTop = tb.stackTop; in make()220 if (tb.stackTop < 1) in traceException()243 n = stackTop; in mergeMap()267 int st = stackTop; in recordStackMap()400 n = block.stackTop; in fixTypes()459 int stackTop = bb.stackTop; in toStackMapBody() local460 if (stackTop == 0) { in toStackMapBody()478 else if (stackTop == 1 && diffL == 0) { in toStackMapBody()483 else if (stackTop == 2 && diffL == 0) { in toStackMapBody()[all …]
26 public int stackTop, numLocals; field in TypedBlock65 printTypes(sbuf, stackTop, stackTypes); in toString2()92 stackTop = st; in setStackMap()146 stackTop = 0; in initFirstBlock()
624 private Node<K, V> stackTop; field in LinkedHashTreeMap.AvlIterator627 Node<K, V> stackTop = null; in reset() local629 n.parent = stackTop; in reset()630 stackTop = n; // Stack push. in reset()632 this.stackTop = stackTop; in reset()636 Node<K, V> stackTop = this.stackTop; in next() local637 if (stackTop == null) { in next()640 Node<K, V> result = stackTop; in next()641 stackTop = result.parent; in next()644 n.parent = stackTop; in next()[all …]