| /external/compiler-rt/lib/asan/ |
| asan_report.h | 42 // on the memory type (shadow/heap/stack/global).
63 void ReportMallocUsableSizeNotOwned(uptr addr, BufferedStackTrace *stack);
65 BufferedStackTrace *stack);
69 BufferedStackTrace *stack);
71 BufferedStackTrace *stack);
74 BufferedStackTrace *stack);
82 BufferedStackTrace *stack);
85 BufferedStackTrace *stack);
|
| asan_malloc_linux.cc | 41 asan_free(ptr, &stack, FROM_MALLOC);
48 asan_free(ptr, &stack, FROM_MALLOC);
53 return asan_malloc(size, &stack);
67 return asan_calloc(nmemb, size, &stack);
75 void *new_ptr = asan_malloc(size, &stack);
79 return asan_realloc(ptr, size, &stack);
84 return asan_memalign(boundary, size, &stack, FROM_MALLOC);
89 return asan_memalign(boundary, size, &stack, FROM_MALLOC);
94 void *res = asan_memalign(boundary, size, &stack, FROM_MALLOC);
126 return asan_posix_memalign(memptr, alignment, size, &stack);
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| BinaryTreeTraverser.java | 106 private final LinkedList<InOrderNode<T>> stack;
109 this.stack = Lists.newLinkedList();
110 stack.addLast(new InOrderNode<T>(root));
115 while (!stack.isEmpty()) {
116 InOrderNode<T> inOrderNode = stack.getLast();
118 stack.removeLast();
131 stack.addLast(new InOrderNode<T>(node.get()));
|
| /cts/libs/json/src/com/android/json/stream/ |
| JsonWriter.java | 125 private final List<JsonScope> stack = new ArrayList<JsonScope>(); field in class:JsonWriter
127 stack.add(JsonScope.EMPTY_DOCUMENT);
215 stack.add(empty);
228 throw new IllegalStateException("Nesting problem: " + stack);
231 stack.remove(stack.size() - 1);
240 * Returns the value on the top of the stack.
243 return stack.get(stack.size() - 1);
247 * Replace the value on the top of the stack with the given value
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/pgen2/ |
| parse.py | 104 # Each stack entry is a tuple: (dfa, state, node).
109 self.stack = [stackentry]
119 dfa, state, node = self.stack[-1]
134 if not self.stack:
137 dfa, state, node = self.stack[-1]
153 if not self.stack:
177 dfa, state, node = self.stack[-1]
182 self.stack[-1] = (dfa, newstate, node)
186 dfa, state, node = self.stack[-1]
188 self.stack[-1] = (dfa, newstate, node
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/pgen2/ |
| parse.py | 104 # Each stack entry is a tuple: (dfa, state, node).
109 self.stack = [stackentry]
119 dfa, state, node = self.stack[-1]
134 if not self.stack:
137 dfa, state, node = self.stack[-1]
153 if not self.stack:
177 dfa, state, node = self.stack[-1]
182 self.stack[-1] = (dfa, newstate, node)
186 dfa, state, node = self.stack[-1]
188 self.stack[-1] = (dfa, newstate, node
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/pgen2/ |
| parse.py | 104 # Each stack entry is a tuple: (dfa, state, node).
109 self.stack = [stackentry]
119 dfa, state, node = self.stack[-1]
134 if not self.stack:
137 dfa, state, node = self.stack[-1]
153 if not self.stack:
177 dfa, state, node = self.stack[-1]
182 self.stack[-1] = (dfa, newstate, node)
186 dfa, state, node = self.stack[-1]
188 self.stack[-1] = (dfa, newstate, node
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/pgen2/ |
| parse.py | 104 # Each stack entry is a tuple: (dfa, state, node).
109 self.stack = [stackentry]
119 dfa, state, node = self.stack[-1]
134 if not self.stack:
137 dfa, state, node = self.stack[-1]
153 if not self.stack:
177 dfa, state, node = self.stack[-1]
182 self.stack[-1] = (dfa, newstate, node)
186 dfa, state, node = self.stack[-1]
188 self.stack[-1] = (dfa, newstate, node
[all...] |
| /external/llvm/tools/llvm-c-test/ |
| calc.c | 45 LLVMValueRef stack[MAX_DEPTH]; local
60 printf("stack underflow\n");
64 stack[depth - 2] = LLVMBuildBinOp(builder, op_to_opcode(tok),
65 stack[depth - 1], stack[depth - 2], "");
74 printf("stack underflow\n");
78 off = LLVMBuildGEP(builder, param, &stack[depth - 1], 1, "");
79 stack[depth - 1] = LLVMBuildLoad(builder, off, "");
93 printf("stack overflow\n");
97 stack[depth++] = LLVMConstInt(LLVMInt64Type(), val, 1)
[all...] |
| /external/speex/libspeex/ |
| filters.h | 61 void qmf_decomp(const spx_word16_t *xx, const spx_word16_t *aa, spx_word16_t *, spx_word16_t *y2, int N, int M, spx_word16_t *mem, char *stack);
62 void qmf_synth(const spx_word16_t *x1, const spx_word16_t *x2, const spx_word16_t *a, spx_word16_t *y, int N, int M, spx_word16_t *mem1, spx_word16_t *mem2, char *stack);
64 void filter_mem16(const spx_word16_t *x, const spx_coef_t *num, const spx_coef_t *den, spx_word16_t *y, int N, int ord, spx_mem_t *mem, char *stack);
65 void iir_mem16(const spx_word16_t *x, const spx_coef_t *den, spx_word16_t *y, int N, int ord, spx_mem_t *mem, char *stack);
66 void fir_mem16(const spx_word16_t *x, const spx_coef_t *num, spx_word16_t *y, int N, int ord, spx_mem_t *mem, char *stack);
73 void syn_percep_zero16(const spx_word16_t *xx, const spx_coef_t *ak, const spx_coef_t *awk1, const spx_coef_t *awk2, spx_word16_t *y, int N, int ord, char *stack);
74 void residue_percep_zero16(const spx_word16_t *xx, const spx_coef_t *ak, const spx_coef_t *awk1, const spx_coef_t *awk2, spx_word16_t *y, int N, int ord, char *stack);
76 void compute_impulse_response(const spx_coef_t *ak, const spx_coef_t *awk1, const spx_coef_t *awk2, spx_word16_t *y, int N, int ord, char *stack);
87 char *stack
|
| /external/boringssl/src/ssl/ |
| custom_extensions.c | 23 #include <openssl/stack.h>
33 STACK_OF(SSL_CUSTOM_EXTENSION) *stack,
36 for (i = 0; i < sk_SSL_CUSTOM_EXTENSION_num(stack); i++) {
37 const SSL_CUSTOM_EXTENSION *ext = sk_SSL_CUSTOM_EXTENSION_value(stack, i);
63 STACK_OF(SSL_CUSTOM_EXTENSION) *stack = ssl->ctx->client_custom_extensions;
65 stack = ssl->ctx->server_custom_extensions;
68 if (stack == NULL) {
73 for (i = 0; i < sk_SSL_CUSTOM_EXTENSION_num(stack); i++) {
74 const SSL_CUSTOM_EXTENSION *ext = sk_SSL_CUSTOM_EXTENSION_value(stack, i);
191 static int custom_ext_append(STACK_OF(SSL_CUSTOM_EXTENSION) **stack,
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
| StreamUtil.java | 101 byte[] stack = new byte[5];
102 int pos = stack.length;
104 stack[--pos] = (byte)(tagNo & 0x7F);
109 stack[--pos] = (byte)(tagNo & 0x7F | 0x80);
113 length += stack.length - pos;
|
| /external/chromium-trace/catapult/tracing/tracing/mre/ |
| failure.py | 11 failure_type_name, description, stack):
19 self.stack = stack
24 'of type %s wtih description %s. Stack:\n\n%s' % (
27 self.description, self.stack))
36 'stack': self.stack
53 failure_dict['stack'])
|
| /external/compiler-rt/lib/tsan/rtl/ |
| tsan_report.h | 59 ReportStack *stack; member in struct:__tsan::ReportMop
80 ReportStack *stack; member in struct:__tsan::ReportLocation
93 ReportStack *stack; member in struct:__tsan::ReportThread
100 ReportStack *stack; member in struct:__tsan::ReportMutex
125 void PrintStack(const ReportStack *stack);
|
| /external/libgdx/gdx/src/com/badlogic/gdx/graphics/profiling/ |
| GLErrorListener.java | 41 final StackTraceElement[] stack = Thread.currentThread().getStackTrace();
42 for (int i = 0; i < stack.length; i++) {
43 if ("check".equals(stack[i].getMethodName())) {
44 if (i + 1 < stack.length) {
45 final StackTraceElement glMethod = stack[i + 1];
58 // This will capture current stack trace for logging, if possible
|
| /frameworks/volley/src/main/java/com/android/volley/toolbox/ |
| Volley.java | 39 * @param stack An {@link HttpStack} to use for the network, or null for default.
42 public static RequestQueue newRequestQueue(Context context, HttpStack stack) {
53 if (stack == null) {
55 stack = new HurlStack();
59 stack = new HttpClientStack(AndroidHttpClient.newInstance(userAgent));
63 Network network = new BasicNetwork(stack);
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setools/policyrep/ |
| boolcond.py | 104 stack = []
113 stack.append(str(nodebool))
115 operand = stack.pop()
126 stack.append(subexpr)
129 operand1 = stack.pop()
130 operand2 = stack.pop()
141 stack.append(subexpr)
144 return self.__unwind_subexpression(stack)
186 stack = []
192 stack.append(kwargs[nodebool]
[all...] |
| /cts/tools/dasm/src/java_cup/runtime/ |
| lr_parser.java | 4 import java.util.Stack;
8 * parsers act by shifting input onto a parse stack until the symbols
10 * stack. Once this occurs, a reduce is performed. This involves removing
18 * on top of the parse stack (stored as part of a symbol object representing
23 * onto the stack. When the parser reduces, it pops the handle (right hand
24 * side of a production) off the stack. This leaves the parser in the state
29 * (also containing the new state) onto the stack.<p>
68 * pushed onto the stack for the reduce.
158 * is on top of the stack) and the given terminal is next on the input.
180 * the stack. The new top of stack indicates a state. This table is
242 protected Stack stack = new Stack(); field in class:lr_parser
[all...] |
| /external/valgrind/memcheck/tests/solaris/ |
| scalar_spawn.stderr.exp | 21 Address 0x........ is not stack'd, malloc'd or (recently) free'd
25 Address 0x........ is not stack'd, malloc'd or (recently) free'd
29 Address 0x........ is not stack'd, malloc'd or (recently) free'd
33 Address 0x........ is not stack'd, malloc'd or (recently) free'd
37 Address 0x........ is not stack'd, malloc'd or (recently) free'd
41 Address 0x........ is not stack'd, malloc'd or (recently) free'd
45 Address 0x........ is not stack'd, malloc'd or (recently) free'd
64 Address 0x........ is not stack'd, malloc'd or (recently) free'd
68 Address 0x........ is on thread 1's stack
72 Address 0x........ is on thread 1's stack
[all...] |
| /external/elfutils/tests/ |
| run-stack-d-test.sh | 66 STACKCMD=${bindir}/`program_transform stack`
68 STACKCMD=${abs_top_builddir}/src/stack
77 testrun_compare ${abs_top_builddir}/src/stack -r -n 2 -e testfiledwarfinlines --core testfiledwarfinlines.core<<EOF
87 testrun_compare ${abs_top_builddir}/src/stack -r -n 2 -s -e testfiledwarfinlines --core testfiledwarfinlines.core<<EOF
98 testrun_compare ${abs_top_builddir}/src/stack -n 2 -d -e testfiledwarfinlines --core testfiledwarfinlines.core<<EOF
107 testrun_compare ${abs_top_builddir}/src/stack -n 2 -s -d -e testfiledwarfinlines --core testfiledwarfinlines.core<<EOF
|
| /external/google-breakpad/src/client/linux/dump_writer_common/ |
| seccomp_unwinder.cc | 44 uint64_t top = thread.stack.start_of_memory_range;
47 bp > thread.stack.start_of_memory_range +
48 thread.stack.memory.data_size - sizeof(bp) ||
54 uint8_t* bp_addr = stack_copy + bp - thread.stack.start_of_memory_range;
80 thread.stack.start_of_memory_range+thread.stack.memory.data_size) {
107 uint32_t top = thread.stack.start_of_memory_range;
110 bp > thread.stack.start_of_memory_range +
111 thread.stack.memory.data_size - sizeof(bp) ||
117 uint8_t* bp_addr = stack_copy + bp - thread.stack.start_of_memory_range
[all...] |
| /external/google-breakpad/src/processor/ |
| stackwalker_address_list.cc | 30 // stackwalker_address_list.cc: a pseudo stack walker.
71 StackFrame* StackwalkerAddressList::GetCallerFrame(const CallStack* stack,
73 if (!stack) {
74 BPLOG(ERROR) << "Can't get caller frame without stack";
78 size_t frame_index = stack->frames()->size();
|
| /external/libcxx/test/std/containers/container.adaptors/stack/stack.cons.alloc/ |
| ctor_alloc.pass.cpp | 10 // <stack>
13 // explicit stack(const Alloc& a);
15 #include <stack>
21 : private std::stack<int, std::deque<int, test_allocator<int> > >
23 typedef std::stack<int, std::deque<int, test_allocator<int> > > base;
|
| ctor_copy_alloc.pass.cpp | 10 // <stack>
13 // stack(const stack& q, const Alloc& a);
15 #include <stack>
34 : public std::stack<T, C>
36 typedef std::stack<T, C> base;
|
| /external/llvm/unittests/Support/ |
| ManagedStatic.cpp | 31 // Valgrind's leak checker complains glibc's stack allocation.
32 // To appease valgrind, we provide our own stack for each thread.
34 void *stack = malloc(n); local
37 pthread_attr_setstack(&a, stack, n);
39 return stack;
|
