| /external/v8/test/mjsunit/regress/ |
| regress-97116b.js | 31 // have a pending lazy deoptimization on the stack.
|
| regress-conditional-position.js | 48 return x.stack;
|
| regress-crbug-150545.js | 31 // stack height different from zero. The OSR machinery cannot generate
|
| regress-crbug-178790.js | 46 // This should not cause a stack overflow.
|
| regress-deopt-gc.js | 32 // the stack.
|
| regress-deopt-gcb.js | 32 // the stack.
|
| /external/v8/test/mjsunit/ |
| try-finally-continue.js | 28 // Test that we correctly restore the stack when continuing from a
|
| /external/v8/test/webkit/ |
| dfg-inline-arguments-use-from-all-the-places-broken.js | 25 "This attempts to test that inlining preserves basic function.arguments functionality when said functionality is used from inside and outside getters and from inlined code, all at once; but it fails at this and instead finds other bugs particularly in the DFG stack layout machinery."
|
| exception-try-finally-scope-error.js | 24 description('This test makes sure stack unwinding works correctly in combination with dynamically added scopes');
|
| stack-overflow-catch.js | 24 description('Test that when the stack overflows, the exception goes to the last frame before the overflow');
|
| /frameworks/base/tools/layoutlib/create/src/com/android/tools/layoutlib/create/ |
| DelegateMethodAdapter.java | 217 // Push this.getField("this$0") on the call stack.
247 // we pushed on the call stack. The return type remains unchanged.
389 public void visitFrame(int type, int nLocal, Object[] local, int nStack, Object[] stack) {
391 mOrgWriter.visitFrame(type, nLocal, local, nStack, stack);
|
| StubMethodAdapter.java | 160 /* Pops the stack, depending on the return type.
266 // Pop the last word from the stack since invoke will generate its own return.
306 public void visitFrame(int type, int nLocal, Object[] local, int nStack, Object[] stack) {
308 mParentVisitor.visitFrame(type, nLocal, local, nStack, stack);
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/m68hc11/ |
| insns-dwarf2.d | 18 lds #stack\+1024
|
| insns.d | 11 [ ]+1: R_M68HC11_16 stack
|
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-m68hc11/ |
| far-hc11.d | 17 0+8014 <_start> lds \#0x0+64 <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/chromium-trace/catapult/third_party/vinn/third_party/parse5/lib/tree_construction/ |
| open_element_stack.js | 82 //Stack of open elements
203 //NOTE: here we assume that root <html> element is always first in the open element stack, so
204 //we perform this fast stack clean up.
240 //Properly nested <body> element (should be second element in stack).
|
| /external/libavc/common/arm/ |
| ih264_intra_pred_chroma_a9q.s | 108 stmfd sp!, {r4, r14} @store register values to stack
184 ldmfd sp!, {r4, pc} @Restoring registers from stack
241 stmfd sp!, {r14} @store register values to stack
262 ldmfd sp!, {pc} @restoring registers from stack
317 stmfd sp!, {r4-r12, r14} @store register values to stack
331 ldmfd sp!, {r4-r12, pc} @Restoring registers from stack
|
| /external/libunwind/doc/ |
| libunwind-dynamic.tex | 17 stack-pointer) and all callee-saved registers (preserved registers).
48 on the stack and save certain callee-saved registers. The body
62 by the dynamic unwind-info is the point at which the stack-pointer
64 once the stack-pointer is restored, all values saved in the
65 deallocated portion of the stack frame become invalid and hence
67 state not saved on the stack is assume to remain valid through the end
82 in the stack frame.
340 of the stack frame layout.
343 spills register \Var{reg} to a stack-pointer-relative location. The
344 stack-pointer-relative offset is given by the value stored in membe
[all...] |
| /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/v8/test/unittests/compiler/ |
| instruction-selector-unittest.cc | 374 Node* stack = m.AddNode(m.common()->TypedStateValues(&empty_types)); local
379 parameters, locals, stack, context_sentinel, function_node,
430 Node* stack = m.AddNode(m.common()->TypedStateValues(&tagged_type), local
436 parameters, locals, stack, context_sentinel, function_node,
532 Node* stack = local
538 parameters, locals, stack, context, function_node, m.UndefinedConstant());
|
| /external/valgrind/coregrind/m_syswrap/ |
| syswrap-amd64-linux.c | 63 /* Call f(arg1), but first switch stacks, using 'stack' as the new
64 stack, and use 'retaddr' as f's return-to address. Also, clear all
67 void ML_(call_on_new_stack_0_1) ( Addr stack,
71 // %rdi == stack
79 " movq %rdi, %rsp\n" // set stack
80 " pushq %rsi\n" // retaddr to stack
81 " pushq %rdx\n" // f to stack
82 " pushq %rcx\n" // arg1 to stack
135 void* stack,
145 // set up child stack, temporarily preserving fn and ar
210 UWord* stack; local
[all...] |
| syswrap-amd64-solaris.c | 49 /* Call f(arg1), but first switch stacks, using 'stack' as the new stack, and
53 void ML_(call_on_new_stack_0_1)(Addr stack, /* %rdi */
61 " movq %rdi, %rsp\n" /* set stack */
63 " pushq %rsi\n" /* retaddr to stack */
64 " pushq %rdx\n" /* f to stack */
89 UWord *stack = (UWord*)tst->os_state.valgrind_stack_init_SP; local
97 /* Set up the stack, it should be always 16-byte aligned before doing
99 vg_assert(VG_IS_16_ALIGNED(stack));
100 stack -= 1
[all...] |
| syswrap-arm-linux.c | 65 /* Call f(arg1), but first switch stacks, using 'stack' as the new
66 stack, and use 'retaddr' as f's return-to address. Also, clear all
69 void ML_(call_on_new_stack_0_1) ( Addr stack,
73 // r0 = stack
81 " mov sp,r0\n\t" /* Stack pointer */
107 void* stack,
118 /*Setup child stack */
123 /* r1 (arg2) is already our child's stack */
157 1. allocate a ThreadId+ThreadState+stack for the thread
162 but using the scheduler entrypoint for IP, and a separate stack
175 UWord *stack; local
[all...] |
| syswrap-mips32-linux.c | 76 /* Call f(arg1), but first switch stacks, using 'stack' as the new
77 stack, and use 'retaddr' as f's return-to address. Also, clear all
81 void ML_ (call_on_new_stack_0_1) (Addr stack, Addr retaddr,
83 // a0 = stack
91 " move $29, $4\n\t" // stack to %sp
127 pid_t* child_tid in stack 16
128 pid_t* parent_tid in stack 20
129 void* tls_ptr in stack 24
137 pid_t* child_tid in stack 16
149 void *stack, //a1 4 3
248 UWord * stack; local
[all...] |
