| /external/openfst/src/include/fst/ |
| pair-weight.h | 26 #include <stack>
159 stack<int> parens;
|
| /external/v8/benchmarks/spinning-balls/ |
| splay-tree.js | 304 var stack = [this.root_];
308 var new_stack = new Array(stack.length * 2);
311 var n = stack[i];
323 stack = new_stack;
|
| /external/v8/test/mjsunit/compiler/ |
| simple-deopt.js | 81 // Test deopt with literals on the expression stack.
|
| /external/v8/test/mjsunit/ |
| deep-recursion.js | 30 * cause stack overflows.
|
| /external/v8/test/mjsunit/regress/ |
| regress-1129.js | 32 // Create RegExp that is syntactically correct, but throws a stack overflow
|
| regress-1132.js | 32 // NOTE: stack size constant above has been empirically chosen.
|
| regress-124594.js | 32 // stack frame.
|
| regress-1472.js | 29 // Some of these caused stack overflows, others cause out-of-memory.
|
| regress-233.js | 29 // A stack overflow detected by a global regexp match wasn't handled correctly.
38 // Stack overflow caught.
|
| regress-603.js | 29 // not mess up the stack.
|
| regress-69.js | 29 // balanced stack. It should not trigger the break point when --debug_code
|
| regress-784.js | 30 // on the stack.
|
| regress-937896.js | 30 // to try to unlink the inner try-handler that wasn't on the stack.
|
| regress-97116.js | 31 // have a pending lazy deoptimization on the stack.
|
| regress-conditional-position.js | 48 return x.stack;
|
| regress-deopt-gc.js | 32 // the stack.
|
| /external/valgrind/main/memcheck/tests/ |
| big_blocks_freed_list.stderr.exp | 16 Address 0x........ is not stack'd, malloc'd or (recently) free'd
|
| /frameworks/base/tools/layoutlib/create/src/com/android/tools/layoutlib/create/ |
| DelegateMethodAdapter2.java | 213 // Push this.getField("this$0") on the call stack.
243 // we pushed on the call stack. The return type remains unchanged.
384 public void visitFrame(int type, int nLocal, Object[] local, int nStack, Object[] stack) {
386 mOrgWriter.visitFrame(type, nLocal, local, nStack, stack);
|
| StubMethodAdapter.java | 153 /* Pops the stack, depending on the return type.
259 // Pop the last word from the stack since invoke will generate its own return.
299 public void visitFrame(int type, int nLocal, Object[] local, int nStack, Object[] stack) {
301 mParentVisitor.visitFrame(type, nLocal, local, nStack, stack);
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| tree.rb | 283 stack = []
288 stack.push( cursor.children.dup ) unless cursor.empty?
292 break if stack.empty?
293 cursor = stack.last.shift
294 stack.pop if stack.last.empty?
419 stack = []
424 stack.push( Array[ *cursor ] ) unless cursor.empty?
428 break if stack.empty?
429 cursor = stack.last.shif
[all...] |
| /external/libvpx/libvpx/vp8/common/arm/neon/ |
| bilinearpredict8x8_neon.asm | 23 ; stack(lr) int dst_pitch
29 ldr r4, [sp, #8] ;load parameters from stack
30 ldr lr, [sp, #12] ;load parameters from stack
|
| /external/regex-re2/re2/ |
| regexp.cc | 127 // Handle recursive Destroy with explicit stack
128 // to avoid arbitrarily deep recursion on process stack [sigh].
130 Regexp* stack = this; local
131 while (stack != NULL) {
132 Regexp* re = stack;
133 stack = re->down_;
147 sub->down_ = stack;
148 stack = sub;
405 // The stack (vector) has pairs of regexps waiting to
|
| /external/valgrind/main/coregrind/m_syswrap/ |
| syswrap-ppc64-linux.c | 64 /* Call f(arg1), but first switch stacks, using 'stack' as the new
65 stack, and use 'retaddr' as f's return-to address. Also, clear all
68 void ML_(call_on_new_stack_0_1) ( Addr stack,
72 // r3 = stack
91 " mr %r1,%r3\n\t" // stack to %sp
166 void* stack,
190 // setup child stack
194 " stdu 0,-32(4)\n" // make initial stack frame
220 /* Note: 2.4 kernel doesn't set the child stack pointer,
223 on the wrong stack, unfortunately. *
273 UWord* stack; local
[all...] |
| /dalvik/vm/compiler/template/out/ |
| CompilerTemplateAsm-armv5te-vfp.S | 48 Stack is "full descending". Only the arguments that don't fit in the first 4
49 registers are placed on the stack. "sp" points at the first stacked argument
88 * Given a frame pointer, find the stack save area.
163 * Unwind a frame from the Dalvik stack for compiled OP_RETURN_XXX.
236 SAVEAREA_FROM_FP(r1, rFP) @ r1<- stack save area
238 SAVEAREA_FROM_FP(r10, r1) @ r10<- stack save area
241 bxlo lr @ return to raise stack overflow excep.
303 SAVEAREA_FROM_FP(r1, rFP) @ r1<- stack save area
305 SAVEAREA_FROM_FP(r10, r1) @ r10<- stack save area
309 bxlo r12 @ return to raise stack overflow excep
[all...] |
| CompilerTemplateAsm-armv7-a-neon.S | 48 Stack is "full descending". Only the arguments that don't fit in the first 4
49 registers are placed on the stack. "sp" points at the first stacked argument
88 * Given a frame pointer, find the stack save area.
163 * Unwind a frame from the Dalvik stack for compiled OP_RETURN_XXX.
236 SAVEAREA_FROM_FP(r1, rFP) @ r1<- stack save area
238 SAVEAREA_FROM_FP(r10, r1) @ r10<- stack save area
241 bxlo lr @ return to raise stack overflow excep.
303 SAVEAREA_FROM_FP(r1, rFP) @ r1<- stack save area
305 SAVEAREA_FROM_FP(r10, r1) @ r10<- stack save area
309 bxlo r12 @ return to raise stack overflow excep
[all...] |
