| /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);
111 void *Reallocate(const StackTrace &stack, void *p, uptr new_size,
120 RegisterAllocation(stack, p, new_size);
|
| /external/skia/include/core/ |
| SkClipStack.h | 21 // stores the stack depth (fSaveCount) and clips (fDeque) separately.
22 // Each clip in fDeque stores the stack state to which it belongs
111 /** The GenID can be used by clip stack clients to cache representations of the clip. The
113 stack not to the element itself. That is the same clip path in different stacks will
183 int fSaveCount; // save count of stack when this element was added.
188 /* fFiniteBoundType and fFiniteBound are used to incrementally update the clip stack's
201 // When element is applied to the previous elements in the stack is the result known to be
265 stack */
319 * Flattens the clip stack into a single SkPath. Returns true if any of
320 * the clip stack components requires anti-aliasing
[all...] |
| /external/speex/libspeex/ |
| filters_bfin.h | 85 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)
230 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)
355 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)
363 filter_mem16(x, num, den, y, N, ord, mem, stack);
368 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)
438 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)
|
| /external/v8/test/mjsunit/es6/debug-promises/ |
| reject-uncaught-all.js | 36 // All of the frames on the stack are from native Javascript.
40 %AbortJS(e + "\n" + e.stack);
59 %AbortJS(e + "\n" + e.stack);
|
| reject-uncaught-uncaught.js | 36 // All of the frames on the stack are from native Javascript.
40 %AbortJS(e + "\n" + e.stack);
59 %AbortJS(e + "\n" + e.stack);
|
| reject-with-invalid-reject.js | 43 // All of the frames on the stack are from native Javascript.
47 %AbortJS(e + "\n" + e.stack);
65 %AbortJS(e + "\n" + e.stack);
|
| reject-with-undefined-reject.js | 43 // All of the frames on the stack are from native Javascript.
47 %AbortJS(e + "\n" + e.stack);
65 %AbortJS(e + "\n" + e.stack);
|
| /external/v8/test/mjsunit/regress/ |
| regress-237617.js | 31 throw new Error("test stack");
38 error_stack = e.stack;
41 assertTrue(error_stack.indexOf("test stack") > 0);
|
| /external/v8/test/mjsunit/wasm/ |
| function-names.js | 37 var lines = e.stack.split(/\r?\n/);
64 assertEquals(names.length, e.stack.length);
66 assertEquals(names[i], e.stack[i].getFunctionName());
|
| trap-location.js | 68 assertEquals(3, e.stack.length, "number of frames");
69 assertEquals(0, e.stack[0].getLineNumber(), "wasmFunctionIndex");
70 assertEquals(position, e.stack[0].getPosition(), "position");
|
| /external/valgrind/memcheck/tests/solaris/ |
| scalar_shm_new.stderr.exp | 18 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
56 Address 0x........ is not stack'd, malloc'd or (recently) free'd
|
| scalar_utimesys.stderr.exp | 15 Address 0x........ is not stack'd, malloc'd or (recently) free'd
49 Address 0x........ is not stack'd, malloc'd or (recently) free'd
53 Address 0x........ is not stack'd, malloc'd or (recently) free'd
|
| /external/valgrind/memcheck/tests/x86-solaris/ |
| scalar.stderr.exp | 18 Address 0x........ is not stack'd, malloc'd or (recently) free'd
22 Address 0x........ is not stack'd, malloc'd or (recently) free'd
38 Address 0x........ is not stack'd, malloc'd or (recently) free'd
57 Address 0x........ is not stack'd, malloc'd or (recently) free'd
85 Address 0x........ is not stack'd, malloc'd or (recently) free'd
122 Address 0x........ is not stack'd, malloc'd or (recently) free'd
126 Address 0x........ is not stack'd, malloc'd or (recently) free'd
154 Address 0x........ is not stack'd, malloc'd or (recently) free'd
167 Address 0x........ is not stack'd, malloc'd or (recently) free'd
180 Address 0x........ is not stack'd, malloc'd or (recently) free'
[all...] |
| /frameworks/base/packages/SystemUI/src/com/android/systemui/recents/tv/views/ |
| RecentsTvView.java | 98 public void init(TaskStack stack) {
101 mStack = stack;
103 mTaskStackHorizontalView.init(stack);
105 if (stack.getStackTaskCount() > 0) {
111 // Layout with the new stack
129 TaskStack stack = mTaskStackHorizontalView.getStack(); local
130 Task task = stack.getLaunchTarget();
189 * Hides the task stack and shows the empty view.
200 * Shows the task stack and hides the empty view.
|
| /frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/ |
| ViewTransformationHelper.java | 30 import com.android.systemui.statusbar.stack.StackStateAnimator;
32 import java.util.Stack;
221 Stack<View> stack = new Stack<>(); local
223 stack.push(viewRoot);
224 while (!stack.isEmpty()) {
225 View child = stack.pop();
243 stack.push(group.getChildAt(i));
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| mvctor_declaration_test.cpp | 23 #include <stack>
272 //stack:
273 CPPUNIT_ASSERT( is_movable(stack<char>()) );
274 CPPUNIT_ASSERT( is_movable(stack<specially_allocated_struct>()) );
276 CPPUNIT_ASSERT( is_move_complete(stack<char>()) );
277 CPPUNIT_ASSERT( !is_move_complete(stack<specially_allocated_struct>()) );
279 CPPUNIT_ASSERT( !is_move_complete(stack<char>()) );
|
| /ndk/tests/device/test-stlport/unit/ |
| mvctor_declaration_test.cpp | 23 #include <stack>
272 //stack:
273 CPPUNIT_ASSERT( is_movable(stack<char>()) );
274 CPPUNIT_ASSERT( is_movable(stack<specially_allocated_struct>()) );
276 CPPUNIT_ASSERT( is_move_complete(stack<char>()) );
277 CPPUNIT_ASSERT( !is_move_complete(stack<specially_allocated_struct>()) );
279 CPPUNIT_ASSERT( !is_move_complete(stack<char>()) );
|
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/scene/ |
| ViewHierarchyLoader.java | 34 import java.util.Stack;
64 Stack<ViewNode> stack = new Stack<ViewNode>(); local
77 stack.push(lastNode);
78 } else if (!stack.isEmpty()) {
81 stack.pop();
102 if (!stack.isEmpty()) {
103 final ViewNode parent = stack.peek();
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/i386/ |
| x86-64-inval.l | 132 [ ]*18[ ]+enterl \$0,\$0 \# can't have 32-bit stack operands
155 [ ]*41[ ]+leavel \# can't have 32-bit stack operands
160 [ ]*46[ ]+popl %eax \# can't have 32-bit stack operands
166 [ ]*52[ ]+pushl %eax \# can't have 32-bit stack operands
167 [ ]*53[ ]+pushfl \# can't have 32-bit stack operands
168 [ ]*54[ ]+popfl \# can't have 32-bit stack operands
169 [ ]*55[ ]+retl \# can't have 32-bit stack operands
|
| /external/libgdx/gdx/src/com/badlogic/gdx/utils/ |
| JsonReader.java | 83 int[] stack = new int[4];
local
269 if (top == stack.length) {
270 int[] newStack = new int[stack.length * 2];
271 System.arraycopy(stack, 0, newStack, 0, stack.length);
272 stack = newStack;
275 stack[top++] = cs;
289 cs = stack[--top];
302 if (top == stack.length) {
303 int[] newStack = new int[stack.length * 2];
[all...] |
| /external/valgrind/coregrind/m_syswrap/ |
| syswrap-main.c | 71 mips32 v0 a0 a1 a2 a3 stack stack n/a n/a v0 (== NUM)
119 * Ensures the root thread's stack is suitably mapped. Tedious and
578 UWord *stack = (UWord *)gst->guest_ESP;
582 // stack[0] is return address
583 canonical->arg1 = stack[1];
584 canonical->arg2 = stack[2];
585 canonical->arg3 = stack[3];
586 canonical->arg4 = stack[4];
587 canonical->arg5 = stack[5]
[all...] |
| /external/guice/extensions/struts2/lib/ |
| struts2-core-2.2.1.jar | |
| /external/v8/test/mjsunit/ |
| big-array-literal.js | 28 // On MacOS X 10.7.5, this test needs a stack size of at least 788 kBytes.
29 // On PPC64, this test needs a stack size of at least 698 kBytes.
30 // Flags: --stack-size=1000
99 assertTrue(e.message.indexOf("Maximum call stack size exceeded") >= 0);
120 // Catch stack overflows.
|
| /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...] |
