| /external/bison/examples/calc++/ |
| Makefile.am | 87 $(srcdir)/stack.hh $(srcdir)/position.hh $(srcdir)/location.hh \
|
| /external/elfutils/tests/ |
| run-addrname-test.sh | 75 7fff61068000-7fff6107d000 rw-p 7ffffffea000 00:00 0 [stack]
|
| /external/javassist/src/main/javassist/bytecode/stackmap/ |
| TypedBlock.java | 68 sbuf.append(",\n stack={");
98 public void setStackMap(int st, TypeData[] stack, int nl, TypeData[] locals)
102 stackTypes = stack;
|
| /external/javassist/src/main/javassist/expr/ |
| Expr.java | 84 protected final int stack() { method in class:Expr
229 * After executing this method, the current stack depth might be less than
313 codeAttr.setMaxStack(stack()); method
|
| /external/libffi/src/powerpc/ |
| ffi.c | 63 /* ffi_prep_args_SYSV is called by the assembly routine once stack space
66 The stack layout we want looks like this:
70 | Previous backchain pointer 4 | stack pointer here
77 |--------------------------------------------| | stack |
83 |--------------------------------------------| | stack pointer here
90 ffi_prep_args_SYSV (extended_cif *ecif, unsigned *const stack)
144 stacktop.c = (char *) stack + bytes;
150 next_arg.u = stack + 2;
153 FFI_ASSERT (((unsigned) (char *) stack & 0xF) == 0);
222 stack, 4-byte aligned. *
[all...] |
| /external/llvm/lib/Target/X86/ |
| X86CompilationCallback_Win64.asm | 30 ; Align stack on 16-byte boundary.
|
| /external/openssl/crypto/bn/asm/ |
| sparcv9a-mont.pl | 148 add %sp,$bias,%o0 ! real top of stack
|
| /external/openssl/crypto/perlasm/ |
| x86gas.pl | 118 $::stack=4;
124 $::stack=0;
|
| x86masm.pl | 107 $::stack=4;
113 $::stack=0;
|
| /external/regex-re2/re2/testing/ |
| regexp_generator.cc | 12 // To evaluate a command, enough arguments are popped from the value stack to
13 // plug into the %s slots. Then the result is pushed onto the stack.
16 // results in the stack
25 #include <stack>
92 // nstk: the number of elements that would be on the stack after executing
107 // get back down to a single expression on the stack
147 // get back down to a single expression on the stack
181 stack<string> regexps;
214 printf("Stack after running program:\n");
|
| /external/regex-re2/re2/ |
| walker-inl.h | 79 // Clears the stack. Should never be necessary, since
80 // Walk always enters and exits with an empty stack.
81 // Logs DFATAL if stack is not already clear.
89 stack<WalkState<T> >* stack_;
133 stack_ = new stack<WalkState<T> >;
142 // Clears the stack. Should never be necessary, since
143 // Walk always enters and exits with an empty stack.
144 // Logs DFATAL if stack is not already clear.
147 LOG(DFATAL) << "Stack not empty.";
|
| /external/speex/libspeex/ |
| cb_search_arm4.h | 39 static void compute_weighted_codebook(const signed char *shape_cb, const spx_word16_t *r, spx_word16_t *resp, spx_word16_t *resp2, spx_word32_t *E, int shape_cb_size, int subvect_size, char *stack)
|
| /external/v8/test/mjsunit/regress/ |
| regress-119429.js | 32 if (++d == 25135) { // A magic number just below stack overflow on ia32
|
| regress-2249423.js | 29 // Regression test for stack corruption issue.
|
| regress-3230771.js | 28 // Regression test for missing stack-overflow check in
|
| regress-crbug-100859.js | 28 // This used to trigger a crash because of an unhandled stack overflow.
|
| /external/valgrind/main/coregrind/ |
| m_cpuid.S | 155 /* Let the linker know we don't need an executable stack */
156 .section .note.GNU-stack,"",@progbits
|
| /external/valgrind/main/memcheck/tests/ |
| fprw.stderr.exp | 34 Address 0x........ is not stack'd, malloc'd or (recently) free'd
|
| origin2-not-quite.stderr.exp | 26 Uninitialised value was created by a stack allocation
|
| /external/webkit/Source/JavaScriptCore/runtime/ |
| JSGlobalData.h | 181 const MarkedArgumentBuffer* emptyList; // Lists are supposed to be allocated on the stack to have their elements properly marked, which is not the case here - but this list has nothing to mark.
199 const StackBounds& stack() function in class:JSC::JSGlobalData
203 : wtfThreadData().stack();
|
| /frameworks/rs/ |
| spec.l | 1 %option stack
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/makedict/ |
| BinaryDictIOUtils.java | 38 import java.util.Stack;
75 Stack<Position> stack = new Stack<Position>(); local
79 stack.push(initPos);
81 while (!stack.empty()) {
82 Position p = stack.peek();
98 stack.pop();
127 stack.pop();
130 stack.pop()
[all...] |
| /external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/ |
| indentation.py | 43 # 1. Build a stack of tokens that can affect indentation.
47 # Much of the work here is determining which tokens to keep on the stack
52 # 2. Given that stack, determine the allowable indentations.
54 # allowable indentations for each stack. We follows the general
70 even after the overriding token is removed from the stack. For example:
124 raise Exception("INTERNAL ERROR: indentation stack is not empty: %r" %
141 stack = self._stack
200 print 'Line #%d: stack %r' % (token.line_number, stack)
258 if (stack and stack[-1].token.string == '?')
[all...] |
| /external/eigen/Eigen/src/OrderingMethods/ |
| Amd.h | 64 Index cs_tdfs(Index j, Index k, Index *head, const Index *next, Index *post, Index *stack)
67 if(!head || !next || !post || !stack) return (-1); /* check inputs */
68 stack[0] = j; /* place j on the stack */
69 while (top >= 0) /* while (stack is not empty) */
71 p = stack[top]; /* p = top of stack */
81 stack[++top] = i; /* start dfs on child node i */
|
| /external/libffi/src/s390/ |
| sysv.S | 55 ahi %r15,-96-48 # Allocate stack
127 lr %r1,%r15 # Set up stack frame
257 aghi %r15,-160-80 # Allocate stack
331 lgr %r1,%r15 # Set up stack frame
433 .section .note.GNU-stack,"",@progbits
|
