| /external/libunwind/src/x86/ |
| getcontext-linux.S | 73 /* We do not need executable stack. */
74 .section .note.GNU-stack,"",@progbits
|
| siglongjmp.S | 35 /* Stack layout at this point:
91 /* We do not need executable stack. */
92 .section .note.GNU-stack,"",@progbits
|
| /external/libvpx/libvpx/vp8/common/arm/armv6/ |
| sixtappredict8x4_v6.asm | 20 ; stack unsigned char *dst_ptr,
21 ; stack int dst_pitch
23 ;note: In first pass, store the result in transpose(8linesx9columns) on stack. Temporary stack size is 184.
24 ;Line width is 20 that is 9 short data plus 2 to make it 4bytes aligned. In second pass, load data from stack,
28 str r3, [sp, #-184]! ;reserve space on stack for temporary storage, store yoffset
124 ldr r0, [sp, #216] ; load dst address from stack 180+36
125 ldr r1, [sp, #220] ; load dst stride from stack 180+40
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| ReductionRules.h | 179 Solution backpropagate(GraphT& G, StackT stack) {
186 while (!stack.empty()) {
187 NodeId NId = stack.back();
188 stack.pop_back();
|
| /external/ltrace/testsuite/ltrace.torture/ |
| ia64-sigill.s | 42 .section .note.GNU-stack,"",@progbits
|
| /external/mesa3d/src/glx/ |
| indirect_vertex_array_priv.h | 306 struct array_stack_state *stack; member in struct:array_state_vector
|
| /external/mockito/cglib-and-asm/src/org/mockito/asm/ |
| MethodVisitor.java | 104 * Visits the current state of the local variables and operand stack
109 * values of the local variables and of the operand stack elements <i>just
116 * locals as the previous frame and with the empty stack.</li> <li>{@link Opcodes#F_SAME1}
118 * with single value on the stack (<code>nStack</code> is 1 and
119 * <code>stack[0]</code> contains value for the type of the stack item).</li>
126 * locals are absent and with the empty stack (<code>nLocals</code> is 1,
130 * @param type the type of this stack map frame. Must be
147 * @param nStack the number of operand stack elements in the visited frame.
148 * @param stack the operand stack types in this frame. This array must not
[all...] |
| /external/opencv3/modules/cudalegacy/test/ |
| test_labeling.cpp | 81 dot* stack = new dot[image.cols * image.rows]; local
98 dot* top = stack;
104 while (top >= stack)
130 delete[] stack;
|
| /external/opencv3/modules/imgproc/src/ |
| convhull.cpp | 49 static int Sklansky_( Point_<_Tp>** array, int start, int end, int* stack, int nsign, int sign2 )
60 stack[0] = start;
64 stack[0] = pprev;
65 stack[1] = pcur;
66 stack[2] = pnext;
89 stack[stacksize] = pnext;
97 stack[1] = pcur;
99 stack[2] = pnext;
103 stack[stacksize-2] = pnext;
105 pprev = stack[stacksize-4]
150 int* stack = _stack; local
[all...] |
| /external/slf4j/log4j-over-slf4j/src/main/java/org/apache/log4j/ |
| NDC.java | 21 import java.util.Stack;
42 public static Stack cloneStack() {
47 public static void inherit(Stack stack) {
|
| /external/v8/build/android/pylib/utils/ |
| proguard.py | 205 stack = self._annotation_stack
206 while len(stack) > 0 and stack[-1].depth >= depth:
207 stack.pop()
|
| /external/v8/src/regexp/ |
| regexp-stack.h | 17 // Maintains a per-v8thread stack area that can be used by irregexp
18 // implementation for its backtracking stack.
19 // Since there is only one stack area, the Irregexp implementation is not
24 // Create and delete an instance to control the life-time of a growing stack.
26 // Initializes the stack memory area if necessary.
28 ~RegExpStackScope(); // Releases the stack if it has grown.
30 RegExpStack* stack() const { return regexp_stack_; } function in class:v8::internal::RegExpStackScope
41 // Number of allocated locations on the stack below the limit.
42 // No sequence of pushes must be longer that this without doing a stack-limit
46 // Gives the top of the memory used as stack
[all...] |
| /external/v8/test/cctest/ |
| test-log-stack-tracer.cc | 77 // from the calling function. When this function runs, the stack contains
148 // This test verifies that stack tracing works when called during
150 // TickSample::Trace uses Isolate::c_entry_fp as a starting point for stack
174 // When stack tracer is invoked, the stack should look as follows:
186 // Stack tracing will start from the first JS function, i.e. "JSFuncDoTrace"
191 context, "JSFuncDoTrace", sample.stack[base + 0]));
192 CHECK(IsAddressWithinFuncCode(context, "JSTrace", sample.stack[base + 1]));
196 // This test verifies that stack tracing works when called during
200 // pointer value as a starting point for stack walking
[all...] |
| /external/v8/test/mjsunit/ |
| debug-stepin-foreach.js | 16 assertTrue(exec_state.frameCount() != 0, "FAIL: Empty stack trace");
35 print(e, e.stack);
|
| /external/v8/test/mjsunit/es6/debug-promises/ |
| promise-all-uncaught.js | 47 %AbortJS(e + "\n" + e.stack);
66 %AbortJS(e + "\n" + e.stack);
|
| promise-race-uncaught.js | 47 %AbortJS(e + "\n" + e.stack);
66 %AbortJS(e + "\n" + e.stack);
|
| reject-caught-all.js | 43 %AbortJS(e + "\n" + e.stack);
62 %AbortJS(e + "\n" + e.stack);
|
| reject-caught-by-default-reject-handler.js | 57 %AbortJS(e + "\n" + e.stack);
76 %AbortJS(e + "\n" + e.stack);
|
| reject-uncaught-late.js | 47 %AbortJS(e + "\n" + e.stack);
66 %AbortJS(e + "\n" + e.stack);
|
| reject-with-throw-in-reject.js | 56 print("Unexpected exception: " + e + "\n" + e.stack);
77 %AbortJS(e + "\n" + e.stack);
|
| stepin-handler.js | 16 assertTrue(exec_state.frameCount() != 0, "FAIL: Empty stack trace");
35 print(e, e.stack);
|
| throw-caught-by-default-reject-handler.js | 58 %AbortJS(e + "\n" + e.stack);
77 %AbortJS(e + "\n" + e.stack);
|
| throw-uncaught-all.js | 41 %AbortJS(e + "\n" + e.stack);
60 %AbortJS(e + "\n" + e.stack);
|
| throw-uncaught-uncaught.js | 41 %AbortJS(e + "\n" + e.stack);
60 %AbortJS(e + "\n" + e.stack);
|
| throw-with-throw-in-reject.js | 61 %AbortJS(e + "\n" + e.stack);
81 %AbortJS(e + "\n" + e.stack);
|
