| /external/v8/test/webkit/fast/js/ |
| deep-recursion-test.js | 24 description("This test how deep we can recurse, and that we get an exception when we do, as opposed to a stack overflow.");
41 shouldBe("msg", "'RangeError: Maximum call stack size exceeded.'");
48 shouldBe("msg", "'RangeError: Maximum call stack size exceeded.'");
65 shouldBe("msg", "'RangeError: Maximum call stack size exceeded.'");
77 shouldBe("msg", "'RangeError: Maximum call stack size exceeded.'");
|
| /frameworks/base/core/java/android/util/ |
| JsonReader.java | 205 private final List<JsonScope> stack = new ArrayList<JsonScope>(); field in class:JsonReader
536 stack.clear();
537 stack.add(JsonScope.CLOSED);
567 return stack.get(stack.size() - 1);
571 return stack.remove(stack.size() - 1);
575 stack.add(newTop);
579 * Replace the value on the top of the stack with the given value.
582 stack.set(stack.size() - 1, newTop)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setools/policyrep/ |
| constraint.py | 131 stack = []
144 stack.append([operand1, operator, operand2])
161 stack.append([operand1, operator, operand2])
166 operand = stack.pop()
169 stack.append([operator, "(", operand, ")"])
174 operand1 = stack.pop()
175 operand2 = stack.pop()
182 stack.append([operand1, operator, operand2])
184 stack.append(["(", operand1, operator, operand2, ")"])
188 return self.__unwind_subexpression(stack)
[all...] |
| /external/selinux/libsepol/src/ |
| module_to_cil.c | 151 struct stack *decl_stack;
157 struct stack { struct
158 void **stack; member in struct:stack
392 static int stack_destroy(struct stack **stack)
394 if (stack == NULL || *stack == NULL) {
398 free((*stack)->stack);
399 free(*stack);
1118 struct stack *stack = NULL; local
1622 struct stack *stack = NULL; local
3622 struct stack *stack; local
3690 struct stack *stack; local
[all...] |
| /external/valgrind/memcheck/tests/darwin/ |
| scalar.stderr.exp | 29 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
65 Address 0x........ is not stack'd, malloc'd or (recently) free'd
101 Address 0x........ is not stack'd, malloc'd or (recently) free'd
106 Address 0x........ is not stack'd, malloc'd or (recently) free'd
125 Address 0x........ is not stack'd, malloc'd or (recently) free'd
130 Address 0x........ is not stack'd, malloc'd or (recently) free'd
142 Address 0x........ is not stack'd, malloc'd or (recently) free'd
157 Address 0x........ is not stack'd, malloc'd or (recently) free'd
183 Address 0x........ is not stack'd, malloc'd or (recently) free'
[all...] |
| /external/compiler-rt/lib/tsan/rtl/ |
| tsan_report.cc | 31 fd(0), suppressable(false), stack(nullptr) {}
122 Printf(" [failed to restore the stack]\n\n");
164 PrintStack(mop->stack);
189 Printf(" Location is stack of %s.\n\n", thread_name(thrbuf, loc->tid));
199 PrintStack(loc->stack);
223 PrintStack(rm->stack);
239 if (rt->stack)
243 PrintStack(rt->stack);
256 return rep->mops[0]->stack;
260 return rep->mutexes[0]->stack;
[all...] |
| /external/regex-re2/re2/ |
| onepass.cc | 399 InstCond *stack = new InstCond[size]; local
417 // Flood graph using manual stack, filling in actions as found.
426 stack[nstack].id = id;
427 stack[nstack++].cond = 0;
429 int id = stack[--nstack].id;
431 uint32 cond = stack[nstack].cond;
441 stack[nstack].id = ip->out1();
442 stack[nstack++].cond = cond;
443 stack[nstack].id = ip->out();
444 stack[nstack++].cond = cond
[all...] |
| /frameworks/base/packages/DocumentsUI/src/com/android/documentsui/ |
| FilesActivity.java | 81 if (DEBUG) Log.d(TAG, "Stack already resolved for uri: " + intent.getData());
82 } else if (!mState.stack.isEmpty()) {
83 // If a non-empty stack is present in our state, it was read (presumably)
85 // loading or restoring the stack (like URI).
87 // When restoring from a stack, if a URI is present, it should only ever be:
96 && !uri.equals(mState.stack.peek())
99 "Launching with non-empty stack. Ignoring unexpected uri: " + uri);
101 if (DEBUG) Log.d(TAG, "Launching with non-empty stack.");
132 mState.stack,
147 final DocumentStack stack = intent.getParcelableExtra(Shared.EXTRA_STACK) local
[all...] |
| /external/freetype/src/cff/ |
| cffparse.c | 49 parser->top = parser->stack;
518 FT_Byte** data = parser->stack;
522 if ( parser->top >= parser->stack + 6 )
635 FT_Byte** data = parser->stack;
641 if ( parser->top >= parser->stack + 4 )
664 FT_Byte** data = parser->stack;
670 if ( parser->top >= parser->stack + 2 )
727 if ( parser->top >= parser->stack + 5 )
729 FT_Long num_designs = cff_parse_num( parser->stack );
741 dict->num_axes = (FT_UShort)( parser->top - parser->stack - 4 )
1116 FT_Fixed* stack; local
[all...] |
| /external/llvm/include/llvm/ADT/ |
| ImmutableSet.h | 651 SmallVector<uintptr_t,20> stack; member in class:llvm::ImutAVLTreeGenericIterator
660 if (Root) stack.push_back(reinterpret_cast<uintptr_t>(Root));
664 assert(!stack.empty());
665 return *reinterpret_cast<TreeTy *>(stack.back() & ~Flags);
670 assert(!stack.empty());
671 return stack.back() & Flags;
675 bool atEnd() const { return stack.empty(); }
678 return stack.size() == 1 && getVisitState() == VisitedNone;
682 assert(!stack.empty());
683 stack.pop_back()
[all...] |
| /external/valgrind/coregrind/m_syswrap/ |
| syswrap-amd64-darwin.c | 262 // on a separate non-client stack.
269 char *stack; local
274 stack = (char *)allocstack(tst->tid);
275 stack -= 64+320; // make room for top frame
276 memset(stack, 0, 64+320); // ...and clear it
277 *(uintptr_t *)stack = 0; // push fake return address
281 mach->__rsp = (uintptr_t)stack;
285 /* Call f(arg1), but first switch stacks, using 'stack' as the new
286 stack, and use 'retaddr' as f's return-to address. Also, clear all
289 void call_on_new_stack_0_1 ( Addr stack,
374 Addr stack = VG_PGROUNDUP(sp) - stacksize; local
437 Addr stack; local
[all...] |
| /art/runtime/verifier/ |
| reg_type_test.cc | 37 ArenaStack stack(Runtime::Current()->GetArenaPool());
38 ScopedArenaAllocator allocator(&stack);
61 ArenaStack stack(Runtime::Current()->GetArenaPool());
62 ScopedArenaAllocator allocator(&stack);
87 ArenaStack stack(Runtime::Current()->GetArenaPool());
88 ScopedArenaAllocator allocator(&stack);
362 ArenaStack stack(Runtime::Current()->GetArenaPool());
363 ScopedArenaAllocator allocator(&stack);
379 ArenaStack stack(Runtime::Current()->GetArenaPool());
380 ScopedArenaAllocator allocator(&stack);
[all...] |
| /external/libgdx/gdx/src/com/badlogic/gdx/utils/ |
| JsonWriter.java | 29 private final Array<JsonObject> stack = new Array();
field in class:JsonWriter
68 stack.add(current = new JsonObject(false));
74 stack.add(current = new JsonObject(true));
131 stack.pop().close();
132 current = stack.size == 0 ? null : stack.peek();
145 while (stack.size > 0)
|
| /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/makedict/ |
| BinaryDictIOUtils.java | 28 import java.util.Stack;
83 Stack<Position> stack = new Stack<>(); local
87 stack.push(initPos);
89 while (!stack.empty()) {
90 Position p = stack.peek();
106 stack.pop();
124 stack.pop();
132 stack.push(childrenPos)
[all...] |
| /system/core/libbacktrace/ |
| backtrace_offline_test.cpp | 32 // Don't touch the stack anymore.
78 // Create a thread to generate the needed stack and registers information.
81 void* stack = mmap(NULL, stack_size, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS, -1, 0); local
82 ASSERT_NE(MAP_FAILED, stack);
83 uintptr_t stack_addr = reinterpret_cast<uintptr_t>(stack);
86 ASSERT_EQ(0, pthread_attr_setstack(&attr, reinterpret_cast<void*>(stack), stack_size));
91 // Wait for the offline thread to generate the stack and unw_context information.
93 // Copy the stack information.
94 std::vector<uint8_t> stack_data(reinterpret_cast<uint8_t*>(stack),
95 reinterpret_cast<uint8_t*>(stack) + stack_size)
[all...] |
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_common_libcdep.cc | 49 void ReportErrorSummary(const char *error_type, StackTrace *stack) {
53 if (stack->size == 0) {
57 // Currently, we include the first stack frame into the report summary.
59 uptr pc = StackTrace::GetPreviousInstructionPc(stack->trace[0]);
87 // If stack depot has grown 10% since last time, print it too.
|
| /external/google-breakpad/src/processor/ |
| minidump_processor_unittest.cc | 31 // corresponding symbol file, and checks the stack frames for correctness.
421 CallStack *stack = state.threads()->at(0); local
422 ASSERT_TRUE(stack);
423 ASSERT_EQ(stack->frames()->size(), 4U);
425 ASSERT_TRUE(stack->frames()->at(0)->module);
426 ASSERT_EQ(stack->frames()->at(0)->module->base_address(), 0x400000U);
427 ASSERT_EQ(stack->frames()->at(0)->module->code_file(), "c:\\test_app.exe");
428 ASSERT_EQ(stack->frames()->at(0)->function_name,
430 ASSERT_EQ(stack->frames()->at(0)->source_file_name, "c:\\test_app.cc");
431 ASSERT_EQ(stack->frames()->at(0)->source_line, 58)
[all...] |
| /external/icu/icu4c/source/layout/ |
| LigatureSubstProc.cpp | 71 le_int32 stack[nComponents]; local
107 mm--; // don't overrun the stack.
109 stack[++mm] = componentGlyph;
127 componentStack[m] = stack[mm--];
|
| /external/libgdx/gdx/src/com/badlogic/gdx/math/ |
| DelaunayTriangulator.java | 276 IntArray stack = quicksortStack;
local
277 stack.add(lower);
278 stack.add(upper - 1);
279 while (stack.size > 0) {
280 upper = stack.pop();
281 lower = stack.pop();
285 stack.add(lower);
286 stack.add(i - 2);
288 stack.add(i + 2);
289 stack.add(upper);
[all...] |
| /frameworks/base/packages/DocumentsUI/src/com/android/documentsui/model/ |
| DocumentStack.java | 33 * Representation of a stack of {@link DocumentInfo}, usually the result of a
67 * Update a possibly stale restored stack against a live
77 * Build key that uniquely identifies this stack. It omits most of the raw
154 final DocumentStack stack = new DocumentStack();
155 DurableUtils.readFromParcel(in, stack);
156 return stack;
|
| /frameworks/base/packages/DocumentsUI/src/com/android/documentsui/services/ |
| DeleteJob.java | 51 String id, DocumentStack stack, List<DocumentInfo> srcs, DocumentInfo srcParent) {
52 super(service, appContext, listener, OPERATION_DELETE, id, stack);
104 .append(", location=" + stack)
|
| /frameworks/base/packages/DocumentsUI/tests/src/com/android/documentsui/services/ |
| AbstractJobTest.java | 89 DocumentStack stack = new DocumentStack(); local
90 stack.push(DocumentInfo.fromUri(mResolver, destination));
97 return createJob(srcDocs, DocumentInfo.fromUri(mResolver, srcParent), stack);
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/idlelib/ |
| PyParse.py | 390 stack = [] # stack of open bracket indices
391 push_stack = stack.append
413 bracketing.append((p, len(stack)))
419 if stack:
420 del stack[-1]
423 bracketing.append((p, len(stack)))
434 bracketing.append((p, len(stack)+1))
437 bracketing.append((p, len(stack)))
442 bracketing.append((p, len(stack)+1)
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| shlex.py | 60 "Push a token onto the stack popped by the get_token method"
66 "Push an input source onto the lexer's input source stack."
80 "Pop the input source stack."
89 "Get a token from the input stream (or from stack if it's nonempty)"
|
| /prebuilts/gdb/linux-x86/lib/python2.7/idlelib/ |
| PyParse.py | 390 stack = [] # stack of open bracket indices
391 push_stack = stack.append
413 bracketing.append((p, len(stack)))
419 if stack:
420 del stack[-1]
423 bracketing.append((p, len(stack)))
434 bracketing.append((p, len(stack)+1))
437 bracketing.append((p, len(stack)))
442 bracketing.append((p, len(stack)+1)
[all...] |
