Home
last modified time | relevance | path

Searched refs:stackTop (Results 1 – 23 of 23) sorted by relevance

/external/javassist/src/main/javassist/bytecode/stackmap/
DTracer.java35 protected int stackTop; field in Tracer
44 stackTop = 0; in Tracer()
54 stackTop = t.stackTop; in Tracer()
58 copyFrom(t.stackTop, t.stackTypes, stackTypes); in Tracer()
160 stackTypes[stackTop++] = new TypeData.NullType(); in doOpcode0_53()
169 stackTypes[stackTop++] = INTEGER; in doOpcode0_53()
173 stackTypes[stackTop++] = LONG; in doOpcode0_53()
174 stackTypes[stackTop++] = TOP; in doOpcode0_53()
179 stackTypes[stackTop++] = FLOAT; in doOpcode0_53()
183 stackTypes[stackTop++] = DOUBLE; in doOpcode0_53()
[all …]
DMapMaker.java212 maker.stackTop = 1; in traceException()
225 n = stackTop; in mergeMap()
249 int st = stackTop; in recordStackMap()
288 evalExpected(cp, target.stackTop, target.stackTypes); in evalExpected()
351 int stackTop = bb.stackTop; in toStackMapBody() local
352 if (stackTop == 0) { in toStackMapBody()
370 else if (stackTop == 1 && diffL == 0) { in toStackMapBody()
379 else if (stackTop == 2 && diffL == 0) { in toStackMapBody()
389 int[] sdata = new int[stackTop]; in toStackMapBody()
390 int[] stags = fillStackMap(stackTop, 0, sdata, bb.stackTypes); in toStackMapBody()
[all …]
DTypedBlock.java21 public int stackTop, numLocals; field in TypedBlock
69 printTypes(sbuf, stackTop, stackTypes); in toString2()
101 stackTop = st; in setStackMap()
154 stackTop = 0; in initFirstBlock()
/external/chromium-trace/catapult/third_party/vinn/third_party/parse5/lib/tree_construction/
Dopen_element_stack.js84 this.stackTop = -1;
97 for (var i = this.stackTop; i >= 0; i--) {
115 this.current = this.items[this.stackTop];
123 this.items[++this.stackTop] = element;
132 this.stackTop--;
144 if (idx === this.stackTop)
153 if (insertionIdx == ++this.stackTop)
158 while (this.stackTop > -1) {
169 while (this.stackTop > -1) {
181 while (this.stackTop > -1) {
[all …]
Dlocation_info_mixin.js53 for (var i = this.stackTop; i > 0; i--)
96 for (var i = this.openElements.stackTop; i >= 0; i--) {
Dparser.js475 return this.openElements.stackTop === 0 && this.fragmentContext ?
725 for (var i = this.openElements.stackTop, last = false; i >= 0; i--) {
823 for (var i = this.openElements.stackTop; i >= 0; i--) {
905 for (var i = p.openElements.stackTop; i >= 0; i--) {
1321 for (var i = p.openElements.stackTop; i >= 0; i--) {
1890 for (var i = p.openElements.stackTop; i > 0; i--) {
2579 var prevOpenElement = p.openElements.items[p.openElements.stackTop - 1],
2814 for (var i = p.openElements.stackTop; i > 0; i--) {
/external/chromium-trace/catapult/third_party/vinn/third_party/parse5/test/fixtures/
Dopen_element_stack_test.js18 assert.strictEqual(stack.stackTop, -1);
23 assert.strictEqual(stack.stackTop, 0);
28 assert.strictEqual(stack.stackTop, 1);
40 assert.strictEqual(stack.stackTop, 0);
45 assert.strictEqual(stack.stackTop, -1);
58 assert.strictEqual(stack.stackTop, 1);
70 assert.strictEqual(stack.stackTop, 2);
74 assert.strictEqual(stack.stackTop, 3);
90 assert.strictEqual(stack.stackTop, -1);
97 assert.strictEqual(stack.stackTop, 0);
[all …]
/external/valgrind/coregrind/
Dm_wordfm.c90 Int stackTop; // Iterator stack pointer, one past end member
470 fm->stackTop = 0; in stackClear()
476 vg_assert(fm->stackTop < WFM_STKMAX); in stackPush()
478 fm->nodeStack[fm->stackTop] = n; in stackPush()
479 fm-> numStack[fm->stackTop] = i; in stackPush()
480 fm->stackTop++; in stackPush()
486 vg_assert(fm->stackTop <= WFM_STKMAX); in stackPop()
488 if (fm->stackTop > 0) { in stackPop()
489 fm->stackTop--; in stackPop()
490 *n = fm->nodeStack[fm->stackTop]; in stackPop()
[all …]
Dm_oset.c125 Int stackTop; // Iterator stack pointer, one past end member
252 t->stackTop = 0; in stackClear()
258 vg_assert(t->stackTop < STACK_MAX); in stackPush()
260 t->nodeStack[t->stackTop] = n; in stackPush()
261 t-> numStack[t->stackTop] = i; in stackPush()
262 t->stackTop++; in stackPush()
268 vg_assert(t->stackTop <= STACK_MAX); in stackPop()
270 if (t->stackTop > 0) { in stackPop()
271 t->stackTop--; in stackPop()
272 *n = t->nodeStack[t->stackTop]; in stackPop()
[all …]
/external/valgrind/cachegrind/
Dcg_merge.c1003 Int stackTop; // Iterator stack pointer, one past end member
1312 fm->stackTop = 0; in stackClear()
1318 assert(fm->stackTop < WFM_STKMAX); in stackPush()
1320 fm->nodeStack[fm->stackTop] = n; in stackPush()
1321 fm-> numStack[fm->stackTop] = i; in stackPush()
1322 fm->stackTop++; in stackPush()
1328 assert(fm->stackTop <= WFM_STKMAX); in stackPop()
1330 if (fm->stackTop > 0) { in stackPop()
1331 fm->stackTop--; in stackPop()
1332 *n = fm->nodeStack[fm->stackTop]; in stackPop()
[all …]
/external/dexmaker/src/dx/java/com/android/dx/ssa/
DSsaRenamer.java647 RegisterSpec stackTop = currentMapping[ropReg]; in updateSuccessorPhis()
648 if (!isVersionZeroRegister(stackTop.getReg())) { in updateSuccessorPhis()
649 insn.addPhiOperand(stackTop, block); in updateSuccessorPhis()
/external/chromium-trace/catapult/third_party/vinn/third_party/parse5/
Dparse5.js4511 for (var i = this.stackTop; i > 0; i--)
4554 for (var i = this.openElements.stackTop; i >= 0; i--) {
4741 this.stackTop = -1;
4754 for (var i = this.stackTop; i >= 0; i--) {
4772 this.current = this.items[this.stackTop];
4780 this.items[++this.stackTop] = element;
4789 this.stackTop--;
4801 if (idx === this.stackTop)
4810 if (insertionIdx == ++this.stackTop)
4815 while (this.stackTop > -1) {
[all …]
/external/v8/test/mjsunit/asm/embenchen/
Dprimes.js192 stackRestore: function (stackTop) { argument
193 STACKTOP = stackTop;
Dcopy.js192 stackRestore: function (stackTop) { argument
193 STACKTOP = stackTop;
Dcorrections.js192 stackRestore: function (stackTop) { argument
193 STACKTOP = stackTop;
Dfannkuch.js223 stackRestore: function (stackTop) { argument
224 STACKTOP = stackTop;
Dmemops.js192 stackRestore: function (stackTop) { argument
193 STACKTOP = stackTop;
Dfasta.js202 stackRestore: function (stackTop) { argument
203 STACKTOP = stackTop;
Dzlib.js192 stackRestore: function (stackTop) { argument
193 STACKTOP = stackTop;
Dbox2d.js193 stackRestore: function (stackTop) { argument
194 STACKTOP = stackTop;
Dlua_binarytrees.js224 stackRestore: function (stackTop) { argument
225 STACKTOP = stackTop;
/external/v8/tools/profviz/
Dgnuplot-4.6.3-emscripten.js196 stackRestore: function (stackTop) { argument
197 STACKTOP = stackTop;
/external/v8/test/mjsunit/asm/poppler/
Dpoppler.js225 stackRestore: function (stackTop) { argument
226 STACKTOP = stackTop;