| /external/antlr/runtime/C/include/ |
| antlr3collections.h | 197 /** Structure that represents a Stack collection
201 /** List that supports the stack structure
205 /** Used for quick access to the top of the stack
208 void (*free) (struct ANTLR3_STACK_struct * stack);
209 void * (*pop) (struct ANTLR3_STACK_struct * stack);
210 void * (*get) (struct ANTLR3_STACK_struct * stack, ANTLR3_INTKEY key);
211 ANTLR3_BOOLEAN (*push) (struct ANTLR3_STACK_struct * stack, void * element, void (ANTLR3_CDECL *freeptr)(void *));
212 ANTLR3_UINT32 (*size) (struct ANTLR3_STACK_struct * stack);
213 void * (*peek) (struct ANTLR3_STACK_struct * stack);
425 * as a stack and each time we descend a node to one of its edges w
[all...] |
| /external/caliper/caliper/src/main/java/com/google/caliper/memory/ |
| ObjectExplorer.java | 100 Deque<Chain> stack = new ArrayDeque<Chain>(32); local
101 if (rootObject != null) stack.push(Chain.root(rootObject));
103 while (!stack.isEmpty()) {
104 Chain chain = stack.pop();
113 //only nonnull values pushed in the stack
119 * Since we push paths to explore in a stack, we push references found in the array in
133 stack.push(chain.appendArrayIndex(i, childValue));
139 * them to the stack in reverse order, so when we pop them, we get them in the original
163 stack.push(extendedChain);
|
| /external/compiler-rt/lib/lsan/ |
| lsan_allocator.cc | 71 static void RegisterAllocation(const StackTrace &stack, void *p, uptr size) {
76 m->stack_trace_id = StackDepotPut(stack);
88 void *Allocate(const StackTrace &stack, uptr size, uptr alignment,
100 RegisterAllocation(stack, p, size);
113 void *Reallocate(const StackTrace &stack, void *p, uptr new_size,
122 RegisterAllocation(stack, p, new_size);
|
| /external/fonttools/Lib/fontTools/misc/ |
| testTools.py | 85 self.stack = []
89 if self.stack:
90 self.stack[-1][2].append(element)
93 self.stack.append(element)
96 self.stack.pop()
99 self.stack[-1][2].append(data)
|
| /external/libffi/src/xtensa/ |
| sysv.S | 61 sub a11, a1, a6 # a11(->arg1): stack pointer
66 callx8 a8 # ffi_prep_args(ecif, stack)
68 # prepare to move stack pointer back up to 6 arguments
79 # (the stack size is at least 32 bytes, so no risk to cross boundaries)
88 # move stack pointer
181 /* ffi_trampoline is copied to the stack */
213 # save up to 6 arguments to stack (allocated by entry below)
|
| /external/python/cpython2/Modules/_ctypes/libffi/src/xtensa/ |
| sysv.S | 61 sub a11, a1, a6 # a11(->arg1): stack pointer
66 callx8 a8 # ffi_prep_args(ecif, stack)
68 # prepare to move stack pointer back up to 6 arguments
79 # (the stack size is at least 32 bytes, so no risk to cross boundaries)
88 # move stack pointer
181 /* ffi_trampoline is copied to the stack */
213 # save up to 6 arguments to stack (allocated by entry below)
|
| /external/python/cpython3/Lib/test/ |
| test_code_module.py | 20 # use exit stack to match patch context managers to addCleanup
21 stack = ExitStack()
22 self.addCleanup(stack.close)
23 self.infunc = stack.enter_context(mock.patch('code.input',
25 self.stdout = stack.enter_context(mock.patch('code.sys.stdout'))
26 self.stderr = stack.enter_context(mock.patch('code.sys.stderr'))
28 self.sysmod = stack.enter_context(prepatch)
|
| /external/archive-patcher/generator/src/main/java/com/google/archivepatcher/generator/bsdiff/ |
| DivSuffixSorter.java | 534 StackElement[] stack = new StackElement[STACK_SIZE]; local
561 StackElement se = stack[--ssize];
591 StackElement se = stack[--ssize];
637 stack[ssize++] = new StackElement(r, rm, last, (next & 3) | (check & 4));
646 stack[ssize++] = new StackElement(first, lm, l, (check & 3) | (next & 4));
673 StackElement se = stack[--ssize];
928 StackElement[] stack = new StackElement[STACK_SIZE]; local
942 StackElement se = stack[--ssize];
976 stack[ssize++] = new StackElement(a, last, depth, -1);
986 stack[ssize++] = new StackElement(first, a, depth + 1, ssIlg(a - first))
1418 StackElement[] stack = new StackElement[STACK_SIZE]; local
[all...] |
| /external/freetype/src/psaux/ |
| cffdecode.c | 508 FT_Fixed* stack; local
524 decoder->top = decoder->stack;
527 stack = decoder->top;
564 /* this is an operand, push it on the stack */
601 if ( decoder->top - stack >= CFF_MAX_OPERANDS )
618 /* from the bottom of the stack. However, this seems not to be */
623 FT_Int num_args = (FT_Int)( args - decoder->stack );
881 /* `glyph_width' to `nominal_width' plus number on the stack */
920 ( stack[0] >> 16 );
947 /* Note that we only pop arguments from the stack which we *
[all...] |
| /external/guice/extensions/struts2/lib/ |
| struts2-core-2.2.1.jar | |
| /external/syzkaller/pkg/report/ |
| linux.go | 89 // These pattern math kernel reports which are not bugs in itself but contain stack traces.
244 // reports unnecessary long and the panic (current) stack
248 // a single WARNING line without a stack and then the panic
249 // with the stack.
460 // Check if the report contains stack trace.
463 return true, "no stack trace in report"
472 // it must also contain at least a single stack frame after each of them.
488 // Next stack trace starts.
493 if bytes.Contains(frames[i], []byte("(stack is not available)")) ||
500 return true, "no frames in a stack trace
[all...] |
| /art/tools/ahat/etc/ |
| hprofdump.py | 158 stack = readu4(hprof)
162 print "LOAD CLASS #%d %s @%x stack=@%x" % (serial, showstr(classname), classobj, stack)
170 print "STACK FRAME %d '%s' '%s' '%s' line=%d classserial=%d" % (id, showstr(method), showstr(sig), showstr(file), line, serial)
173 print "STACK TRACE %d" % serial
189 stack = readu4(hprof)
198 stack = readu4(hprof)
234 print " ROOT NATIVE STACK serial=%d" % serial
248 stack = readu4(hprof) ; length -= 4
253 print " stack trace serial number: #%d" % readu4(hprof) ; length -=
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| sgmllib.py | 75 self.stack = []
216 # XXX if end: check for empty stack
344 self.stack.append(tag)
351 found = len(self.stack) - 1
356 if tag not in self.stack:
364 found = len(self.stack)
366 if self.stack[i] == tag: found = i
367 while len(self.stack) > found:
368 tag = self.stack[-1]
377 del self.stack[-1]
[all...] |
| /external/python/cpython2/Lib/ |
| sgmllib.py | 75 self.stack = []
216 # XXX if end: check for empty stack
344 self.stack.append(tag)
351 found = len(self.stack) - 1
356 if tag not in self.stack:
364 found = len(self.stack)
366 if self.stack[i] == tag: found = i
367 while len(self.stack) > found:
368 tag = self.stack[-1]
377 del self.stack[-1
[all...] |
| /external/python/cpython3/Python/ |
| modsupport.c | 213 do_mkstack(PyObject **stack, const char **p_format, va_list *p_va,
229 stack[i] = w;
244 Py_DECREF(stack[i]);
575 PyObject **stack; local
590 stack = small_stack;
593 stack = PyMem_Malloc(n * sizeof(stack[0]));
594 if (stack == NULL) {
602 res = do_mkstack(stack, &f, &lva, '\0', n, flags);
610 return stack;
[all...] |
| /external/swiftshader/src/OpenGL/compiler/ |
| ValidateLimitations.cpp | 21 bool IsLoopIndex(const TIntermSymbol* symbol, const TLoopStack& stack) {
22 for (TLoopStack::const_iterator i = stack.begin(); i != stack.end(); ++i) {
29 void MarkLoopForUnroll(const TIntermSymbol* symbol, TLoopStack& stack) {
30 for (TLoopStack::iterator i = stack.begin(); i != stack.end(); ++i) {
51 ValidateConstIndexExpr(const TLoopStack& stack)
52 : mValid(true), mLoopStack(stack) {}
76 ValidateLoopIndexExpr(TLoopStack& stack)
79 mLoopStack(stack) {}
[all...] |
| /external/zlib/src/examples/ |
| gun.c | 216 unsigned stack; /* next position for reversed string */ local
265 stack = 0;
325 match[stack++] = (unsigned char)final;
330 p = match + stack;
335 stack = p - match;
336 match[stack++] = (unsigned char)code;
350 while (stack > SIZE - outcnt) {
352 outbuf[outcnt++] = match[--stack];
359 p = match + stack;
363 stack = 0
[all...] |
| /device/linaro/bootloader/edk2/MdePkg/Library/BaseLib/Ia32/ |
| Thunk16.asm | 36 ; Here is the layout of the real mode stack. _ToUserCode() is responsible for
37 ; loading all these registers from real mode stack.
82 ; The order of saved registers on the stack matches the order they appears
166 mov ss, esi ; set up 16-bit stack segment
167 xchg sp, bx ; set up 16-bit stack pointer
171 mov ebp, [esp + sizeof(IA32_REGS)] ; BackFromUserCode address from stack
223 add edi, - (sizeof (IA32_REGS) + 4) ; reserve stack space
224 mov ebx, edi ; ebx <- stack offset
227 add edi, eax ; edi <- linear address of 16-bit stack
231 mov esi, edx ; esi <- 16-bit stack segment
[all...] |
| /external/libffi/src/arm/ |
| ffi.c | 40 int ffi_prep_args_SYSV(char *stack, extended_cif *ecif, float *vfp_space);
41 int ffi_prep_args_VFP(char *stack, extended_cif *ecif, float *vfp_space);
69 static size_t ffi_put_arg(ffi_type **arg_type, void **arg, char *stack)
71 register char* argp = stack;
121 /* ffi_prep_args is called by the assembly routine once stack space
128 int ffi_prep_args_SYSV(char *stack, extended_cif *ecif, float *vfp_space)
134 argp = stack;
155 int ffi_prep_args_VFP(char *stack, extended_cif *ecif, float *vfp_space)
168 /* the first 4 words on the stack are used for values passed in core
170 regp = stack;
[all...] |
| /external/python/cpython2/Modules/_ctypes/libffi/src/arm/ |
| ffi.c | 40 int ffi_prep_args_SYSV(char *stack, extended_cif *ecif, float *vfp_space);
41 int ffi_prep_args_VFP(char *stack, extended_cif *ecif, float *vfp_space);
69 static size_t ffi_put_arg(ffi_type **arg_type, void **arg, char *stack)
71 register char* argp = stack;
121 /* ffi_prep_args is called by the assembly routine once stack space
128 int ffi_prep_args_SYSV(char *stack, extended_cif *ecif, float *vfp_space)
134 argp = stack;
155 int ffi_prep_args_VFP(char *stack, extended_cif *ecif, float *vfp_space)
168 /* the first 4 words on the stack are used for values passed in core
170 regp = stack;
[all...] |
| /external/tensorflow/tensorflow/python/kernel_tests/ |
| stack_op_test.py | 15 """Functional tests for Stack and ParallelStack Ops."""
55 # Stack back into a single tensorflow tensor
56 c = array_ops.stack(xs)
86 # Stack back into a single tensorflow tensor directly using np array
87 c = array_ops.stack(data)
95 cl = array_ops.stack(data_list)
99 # Verify that shape induction works with shapes produced via const stack
101 b = array_ops.reshape(a, array_ops.stack([2, 3]))
143 c = array_ops.stack(xs)
158 c = array_ops.stack(xs, axis=1
[all...] |
| /external/libffi/src/avr32/ |
| ffi.c | 60 /* ffi_prep_args is called by the assembly routine once stack space
67 void ffi_prep_args(char *stack, extended_cif *ecif)
72 char *reg_base = stack;
73 char *stack_base = stack + 20;
179 /* Round the stack up to a multiple of 8 bytes. This isn't needed
269 static void ffi_prep_incoming_args_SYSV(char *stack, void **rvalue,
275 register char *reg_base = stack;
276 register char *stack_base = stack + 20;
283 printf("sp+%d: 0x%08x\n", i*4, ((unsigned int*)stack)[i]);
383 * array points to the corresponding value on the stack; and if th
[all...] |
| /external/python/cpython2/Modules/_ctypes/libffi/src/avr32/ |
| ffi.c | 60 /* ffi_prep_args is called by the assembly routine once stack space
67 void ffi_prep_args(char *stack, extended_cif *ecif)
72 char *reg_base = stack;
73 char *stack_base = stack + 20;
179 /* Round the stack up to a multiple of 8 bytes. This isn't needed
269 static void ffi_prep_incoming_args_SYSV(char *stack, void **rvalue,
275 register char *reg_base = stack;
276 register char *stack_base = stack + 20;
283 printf("sp+%d: 0x%08x\n", i*4, ((unsigned int*)stack)[i]);
383 * array points to the corresponding value on the stack; and if th
[all...] |
| /external/python/cpython2/Modules/_ctypes/libffi_msvc/ |
| ffi.c | 34 /* ffi_prep_args is called by the assembly routine once stack space
40 void ffi_prep_args(char *stack, extended_cif *ecif)
48 argp = stack;
122 if (argp >= stack && (unsigned)(argp - stack) > ecif->cif->bytes)
124 Py_FatalError("FFI BUG: not enough stack space for arguments");
254 static void ffi_prep_incoming_args_SYSV (char *stack, void **ret,
280 * value on the stack; and if the function returns
363 ffi_prep_incoming_args_SYSV(char *stack, void **rvalue,
372 argp = stack;
[all...] |
| /external/python/cpython3/Modules/_ctypes/libffi_msvc/ |
| ffi.c | 34 /* ffi_prep_args is called by the assembly routine once stack space
40 void ffi_prep_args(char *stack, extended_cif *ecif)
48 argp = stack;
141 if (argp >= stack && (unsigned)(argp - stack) > ecif->cif->bytes)
143 Py_FatalError("FFI BUG: not enough stack space for arguments");
284 static void ffi_prep_incoming_args_SYSV (char *stack, void **ret,
310 * value on the stack; and if the function returns
393 ffi_prep_incoming_args_SYSV(char *stack, void **rvalue,
402 argp = stack;
[all...] |
