/external/javassist/src/main/javassist/bytecode/stackmap/ |
Tracer.java | 35 protected int stackTop; 44 stackTop = 0; 54 stackTop = t.stackTop; 58 copyFrom(t.stackTop, t.stackTypes, stackTypes); 143 * stackTypes[stackTop++] = TOP; 160 stackTypes[stackTop++] = new TypeData.NullType(); 169 stackTypes[stackTop++] = INTEGER; 173 stackTypes[stackTop++] = LONG; 174 stackTypes[stackTop++] = TOP [all...] |
MapMaker.java | 212 maker.stackTop = 1; 225 n = stackTop; 249 int st = stackTop; 288 evalExpected(cp, target.stackTop, target.stackTypes); 351 int stackTop = bb.stackTop; 352 if (stackTop == 0) { 370 else if (stackTop == 1 && diffL == 0) { 379 else if (stackTop == 2 && diffL == 0) { 389 int[] sdata = new int[stackTop]; [all...] |
TypedBlock.java | 21 public int stackTop, numLocals; 69 printTypes(sbuf, stackTop, stackTypes); 101 stackTop = st; 154 stackTop = 0;
|
/external/chromium_org/v8/test/mjsunit/compiler/ |
regress-177883.js | 69 i3 = STACKTOP; 70 STACKTOP = STACKTOP + 16 | 0; 157 STACKTOP = i3; 161 STACKTOP = i3; 167 var STACKTOP = 0;
|
/external/valgrind/main/coregrind/ |
m_wordfm.c | 90 Int stackTop; // Iterator stack pointer, one past end 470 fm->stackTop = 0; 476 tl_assert(fm->stackTop < WFM_STKMAX); 478 fm->nodeStack[fm->stackTop] = n; 479 fm-> numStack[fm->stackTop] = i; 480 fm->stackTop++; 486 tl_assert(fm->stackTop <= WFM_STKMAX); 488 if (fm->stackTop > 0) { 489 fm->stackTop--; 490 *n = fm->nodeStack[fm->stackTop]; [all...] |
m_oset.c | 125 Int stackTop; // Iterator stack pointer, one past end 252 t->stackTop = 0; 258 vg_assert(t->stackTop < STACK_MAX); 260 t->nodeStack[t->stackTop] = n; 261 t-> numStack[t->stackTop] = i; 262 t->stackTop++; 268 vg_assert(t->stackTop <= STACK_MAX); 270 if (t->stackTop > 0) { 271 t->stackTop--; 272 *n = t->nodeStack[t->stackTop]; [all...] |
m_libcassert.c | 222 Addr stacktop; local 240 stacktop = tst->os_state.valgrind_stack_init_SP; 248 &startRegs, stacktop
|
/external/llvm/lib/Target/X86/ |
X86FloatingPoint.cpp | 136 unsigned StackTop; // The current top of the FP stack. 178 for (unsigned i = 0; i != StackTop; ++i) { 198 return Slot < StackTop && Stack[Slot] == RegNo; 216 if (STi >= StackTop) 218 return Stack[StackTop-1-STi]; 224 return StackTop - 1 - getSlot(RegNo) + X86::ST0; 230 if (StackTop >= 8) 232 Stack[StackTop] = Reg; 233 RegMap[Reg] = StackTop++; 236 bool isAtTop(unsigned RegNo) const { return getSlot(RegNo) == StackTop-1; [all...] |
/external/qemu/distrib/sdl-1.2.15/src/stdlib/ |
SDL_qsort.c | 111 #define pushLeft {stack[stacktop].first=ffirst;stack[stacktop++].last=last;} 112 #define pushRight {stack[stacktop].first=first;stack[stacktop++].last=llast;} 115 #define pop {if (--stacktop<0) break;\ 116 first=ffirst=stack[stacktop].first;\ 117 last=llast=stack[stacktop].last;\ 324 int stacktop=0; local 355 int stacktop=0; local 386 int stacktop=0 local [all...] |
/external/valgrind/main/cachegrind/ |
cg_merge.c | 992 Int stackTop; // Iterator stack pointer, one past end [all...] |
/external/libffi/src/powerpc/ |
ffi.c | 103 /* 'stacktop' points at the previous backchain pointer. */ 104 valp stacktop; local 144 stacktop.c = (char *) stack + bytes; 145 gpr_base.u = stacktop.u - ASM_NEEDS_REGISTERS - NUM_GPR_ARG_REGISTERS; 155 FFI_ASSERT (((unsigned) stacktop.c & 0xF) == 0); 362 FFI_ASSERT (gpr_base.u <= stacktop.u - ASM_NEEDS_REGISTERS); 364 <= stacktop.u - ASM_NEEDS_REGISTERS - NUM_GPR_ARG_REGISTERS); 422 /* 'stacktop' points at the previous backchain pointer. */ 423 valp stacktop; local 455 stacktop.c = (char *) stack + bytes [all...] |
ffi_darwin.c | 88 /* 'stacktop' points at the previous backchain pointer. */ 89 unsigned *const stacktop = stack + (bytes / sizeof(unsigned)); local 93 double *fpr_base = (double*) (stacktop - ASM_NEEDS_REGISTERS) - NUM_FPR_ARG_REGISTERS; 110 FFI_ASSERT(((unsigned)(char *)stacktop & 0xF) == 0); 223 //FFI_ASSERT(gpr_base <= stacktop - ASM_NEEDS_REGISTERS); 225 // <= stacktop - ASM_NEEDS_REGISTERS - NUM_GPR_ARG_REGISTERS);
|
/external/chromium_org/third_party/npapi/npspy/extern/nspr/md/ |
_macos.h | 236 #define INIT_STACKPTR(stackTop) ((unsigned char*)stackTop - 128) 241 #define INIT_STACKPTR(stackTop) ((unsigned char*)stackTop - 4)
|
_win16.h | 144 char * stackTop; /* high address on stack */
|
/dalvik/dx/src/com/android/dx/ssa/ |
SsaRenamer.java | 646 RegisterSpec stackTop = currentMapping[ropReg]; 647 if (!isVersionZeroRegister(stackTop.getReg())) { 648 insn.addPhiOperand(stackTop, block);
|
/external/dexmaker/src/dx/java/com/android/dx/ssa/ |
SsaRenamer.java | 647 RegisterSpec stackTop = currentMapping[ropReg]; 648 if (!isVersionZeroRegister(stackTop.getReg())) { 649 insn.addPhiOperand(stackTop, block);
|
/external/chromium_org/third_party/icu/source/common/ |
ubidi.c | 615 UBiDiLevel embeddingLevel=level, newLevel, stackTop=0; 631 stack[stackTop]=embeddingLevel; 632 ++stackTop; 653 stack[stackTop]=embeddingLevel; 654 ++stackTop; 676 } else if(stackTop>0) { 678 --stackTop; 679 embeddingLevel=stack[stackTop]; 685 stackTop=0; [all...] |
/external/icu4c/common/ |
ubidi.c | 648 UBiDiLevel embeddingLevel=level, newLevel, stackTop=0; 664 stack[stackTop]=embeddingLevel; 665 ++stackTop; 686 stack[stackTop]=embeddingLevel; 687 ++stackTop; 709 } else if(stackTop>0) { 711 --stackTop; 712 embeddingLevel=stack[stackTop]; 718 stackTop=0; [all...] |
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/ |
Profiler.cs | 262 // int stackTop = lookaheadStack.size()-1; 263 // Integer startingIndex = (Integer)lookaheadStack.get(stackTop);
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/ |
Profiler.cs | 288 // int stackTop = lookaheadStack.size()-1; 289 // Integer startingIndex = (Integer)lookaheadStack.get(stackTop);
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/debug/ |
Profiler.java | 305 // int stackTop = lookaheadStack.size()-1; 306 // Integer startingIndex = (Integer)lookaheadStack.get(stackTop);
|
/system/core/libcorkscrew/arch-x86/ |
backtrace-x86.c | 439 ALOGV("DW_CFA_remember_state: stacktop moves to %d", *stack_ptr); 452 ALOGV("DW_CFA_restore_state: stacktop moves to %d", *stack_ptr); [all...] |
/external/chromium_org/tools/win/split_link/viz.js/ |
viz.js | 136 return STACKTOP; 138 stackRestore: function (stackTop) { 139 STACKTOP = stackTop; 393 stackAlloc: function (size) { var ret = STACKTOP;STACKTOP = (STACKTOP + size)|0;STACKTOP = ((((STACKTOP)+7)>>3)<<3); return ret; }, 662 var STACK_BASE = 0, STACKTOP = 0, STACK_MAX = 0; // stack are [all...] |
/external/chromium_org/v8/tools/profviz/ |
gnuplot-4.6.3-emscripten.js | 194 return STACKTOP; 196 stackRestore: function (stackTop) { 197 STACKTOP = stackTop; 451 stackAlloc: function (size) { var ret = STACKTOP;STACKTOP = (STACKTOP + size)|0;STACKTOP = ((((STACKTOP)+7)>>3)<<3); return ret; }, 724 var STACK_BASE = 0, STACKTOP = 0, STACK_MAX = 0; // stack are [all...] |
/external/robolectric/lib/main/ |
javassist-3.14.0-GA.jar | |