| /external/v8/test/mjsunit/ |
| eval-origin.js | 17 log.push([geval(source).stack, "17:13"]); 18 log.push([geval(source).stack, "18:13"]); 19 // log.push([geval(source).stack, "19:13"]); TODO(4921). 23 log.push([eval(source).stack, "23:13"]); 24 log.push([eval(source).stack, "24:13"]); 25 // log.push([eval(source).stack, "25:13"]); TODO(4921). 28 log.push([eval(source).stack, "28:11"]); 29 log.push([eval(source).stack, "29:11"]); 30 // log.push([eval(source).stack, "30:11"]); TODO(4921).
|
| /external/compiler-rt/lib/asan/ |
| asan_malloc_mac.cc | 31 void *p = asan_memalign(alignment, size, &stack, FROM_MALLOC) 34 void *p = asan_malloc(size, &stack) 37 void *p = asan_realloc(ptr, size, &stack); 40 void *p = asan_calloc(count, size, &stack); 43 void *p = asan_memalign(GetPageSizeCached(), size, &stack, FROM_MALLOC); 46 asan_free(ptr, &stack, FROM_MALLOC); 56 ReportMacMzReallocUnknown((uptr)ptr, (uptr)zone_ptr, zone_name, &stack);
|
| /external/valgrind/helgrind/tests/ |
| stackteardown.c | 16 its stack and then exits. We cannot do that in C, 17 as we cannot touch the stack after the munmap 68 void _exit_with_stack_teardown(void*stack, size_t sz) 75 static void *stack; variable 83 _exit_with_stack_teardown(stack, sz); 88 its own stack. */ 97 stack = mmap(NULL, sz, PROT_READ|PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS, 100 stack = mmap(NULL, sz, PROT_READ|PROT_WRITE, MAP_PRIVATE | MAP_ANON, 103 assert(stack != (void *)-1); 104 r = pthread_attr_setstack(&attr, stack, sz) [all...] |
| /external/mesa3d/src/glsl/tests/ |
| sexps.py | 51 stack = [[]] 55 stack.append([]) 57 if len(stack) == 1: 59 sexp = stack.pop() 60 stack[-1].append(sexp) 62 stack[-1].append(token) 63 if len(stack) != 1: 65 if len(stack[0]) != 1: 67 return stack[0][0]
|
| /external/guava/guava-testlib/test/com/google/common/testing/ |
| TearDownStackTest.java | 32 final TearDownStack stack = buildTearDownStack(); local 35 stack.addTearDown(tearDown); 39 stack.runTearDown(); 45 final TearDownStack stack = buildTearDownStack(); local 48 stack.addTearDown(tearDownOne); 59 stack.addTearDown(tearDownTwo); 64 stack.runTearDown(); 71 final TearDownStack stack = buildTearDownStack(); local 74 stack.addTearDown(tearDownOne); 77 stack.addTearDown(tearDownTwo) [all...] |
| /external/libcxx/test/std/containers/container.adaptors/stack/stack.defn/ |
| assign_move.pass.cpp | 10 // <stack> 12 // stack& operator=(stack&& q); 14 #include <stack> 36 std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5)); 37 std::stack<MoveOnly> q2;
|
| /external/ltrace/testsuite/ltrace.minor/ |
| trace-clone.c | 26 static __attribute__ ((aligned (16))) char stack[STACK_SIZE]; local 29 pid = __clone2((myfunc)&child, stack, STACK_SIZE, CLONE_FS, NULL); 31 pid = clone((myfunc)&child, stack + STACK_SIZE, CLONE_FS, NULL);
|
| /external/proguard/src/proguard/classfile/attribute/preverification/ |
| FullFrame.java | 37 public VerificationType[] stack; field in class:FullFrame 49 * Creates a FullFrame with the given variables and stack. 53 VerificationType[] stack) 58 stack.length, 59 stack); 64 * Creates a FullFrame with the given variables and stack. 70 VerificationType[] stack) 76 this.stack = stack; 93 * Applies the given verification type visitor to all stack [all...] |
| /frameworks/base/tools/preload/ |
| Proc.java | 46 /** Maps thread ID to operation stack. */ 96 LinkedList<Operation> stack = stacks.get(threadId); local 97 if (stack == null) { 98 stack = new LinkedList<Operation>(); 99 stacks.put(threadId, stack); 102 if (!stack.isEmpty()) { 103 stack.getLast().subops.add(o); 106 stack.add(o); 118 LinkedList<Operation> stack = stacks.get(threadId); local 120 if (stack == null || stack.isEmpty()) [all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.defn/ |
| assign_move.pass.cpp | 10 // <stack> 12 // stack& operator=(stack&& q); 14 #include <stack> 36 std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5)); 37 std::stack<MoveOnly> q2;
|
| /toolchain/binutils/binutils-2.25/gold/testsuite/ |
| split_i386_4.s | 21 .section .note.GNU-stack,"",@progbits 22 .section .note.GNU-split-stack,"",@progbits 23 .section .note.GNU-no-split-stack,"",@progbits
|
| split_x32_4.s | 21 .section .note.GNU-stack,"",@progbits 22 .section .note.GNU-split-stack,"",@progbits 23 .section .note.GNU-no-split-stack,"",@progbits
|
| split_x86_64_4.s | 21 .section .note.GNU-stack,"",@progbits 22 .section .note.GNU-split-stack,"",@progbits 23 .section .note.GNU-no-split-stack,"",@progbits
|
| /cts/tools/dasm/src/dasm/ |
| parser.java | 812 java.util.Stack stack, 817 return action_obj.CUP$do_action(act_num, parser, stack, top); [all...] |
| /external/chromium-trace/catapult/third_party/coverage/coverage/ctracer/ |
| datastack.c | 13 pdata_stack->stack = NULL; 21 PyMem_Free(pdata_stack->stack); 31 DataStackEntry * bigger_data_stack = PyMem_Realloc(pdata_stack->stack, bigger * sizeof(DataStackEntry)); 38 pdata_stack->stack = bigger_data_stack;
|
| /external/clang/test/CodeGen/ |
| 2002-12-15-StructParameters.c | 5 void *stack; member in struct:__anon7140
|
| /external/libunwind/src/ppc/ |
| longjmp.S | 34 /* We do not need executable stack. */ 35 .section .note.GNU-stack,"",@progbits
|
| /external/libunwind/src/x86_64/ |
| longjmp.S | 33 /* We do not need executable stack. */ 34 .section .note.GNU-stack,"",@progbits
|
| siglongjmp.S | 31 /* We do not need executable stack. */ 32 .section .note.GNU-stack,"",@progbits
|
| /external/nist-sip/java/gov/nist/javax/sip/stack/ |
| RawMessageChannel.java | 1 package gov.nist.javax.sip.stack;
|
| SIPStackTimerTask.java | 9 package gov.nist.javax.sip.stack; 31 System.out.println("SIP stack timer task failed due to exception:");
|
| ServerRequestInterface.java | 29 package gov.nist.javax.sip.stack; 35 * This is implemented by the application. The stack calls the message
|
| /external/speex/libspeex/ |
| cb_search.h | 62 char *stack, 72 char *stack, 88 char *stack, 99 char *stack,
|
| lsp_bfin.h | 42 char *stack
|
| vq.h | 45 void vq_nbest(spx_word16_t *in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack); 47 void vq_nbest_sign(spx_word16_t *in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack); 49 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack); 51 void vq_nbest_sign(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack);
|