| /external/llvm/include/llvm/ADT/ |
| ImmutableSet.h | 651 SmallVector<uintptr_t,20> stack; member in class:llvm::ImutAVLTreeGenericIterator
661 if (Root) stack.push_back(reinterpret_cast<uintptr_t>(Root));
665 assert(!stack.empty());
666 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/opencv/cv/src/ |
| cvconvhull.cpp | 45 icvSklansky_32s( CvPoint** array, int start, int end, int* stack, int nsign, int sign2 )
56 stack[0] = start;
60 stack[0] = pprev;
61 stack[1] = pcur;
62 stack[2] = pnext;
85 stack[stacksize] = pnext;
93 stack[1] = pcur;
95 stack[2] = pnext;
99 stack[stacksize-2] = pnext;
101 pprev = stack[stacksize-4]
234 int* stack = 0; local
[all...] |
| /external/v8/test/mjsunit/ |
| stack-traces.js | 115 // in the stack trace produced when running the given function.
122 assertTrue(e.stack.indexOf(expected[i]) != -1,
123 name + " doesn't contain expected[" + i + "] stack = " + e.stack);
127 assertEquals(e.stack.indexOf(unexpected[i]), -1,
142 assertEquals(-1, e.stack.indexOf('at new ReferenceError'),
159 assertTrue(e.stack.indexOf('at new ReferenceError') != -1,
166 // If an error occurs while the stack trace is being formatted it should
178 assertTrue(e.stack.indexOf('<error: ReferenceError') != -1,
184 // the stack frame. Put that in your pipe and smoke it
[all...] |
| stack-traces-2.js | 28 // Flags: --builtins-in-stack-traces
37 // stack trace.
44 assertTrue(e.stack.indexOf(nativeFuncName) >= 0, nativeFuncName);
49 // stack trace.
56 assertTrue(e.stack.indexOf(nativeFuncName) >= 0, nativeFuncName);
66 assertTrue(e.stack.indexOf(included) >= 0, included);
81 // builtin. Should not be omitted with the --builtins-in-stack-traces flag.
|
| /external/valgrind/main/drd/tests/ |
| fp_race_xml.stderr.exp | 41 <stack>
50 </stack>
64 <stack>
73 </stack>
|
| /packages/apps/Camera/src/com/android/camera/ |
| CameraHolder.java | 70 String[] stack; field in class:CameraHolder.OpenReleaseState
87 StackTraceElement[] stack = Thread.currentThread().getStackTrace(); local
88 String[] lines = new String[stack.length];
89 for (int i = 0; i < stack.length; i++) {
90 lines[i] = stack[i].toString();
92 s.stack = lines;
106 Log.d(TAG, "Stack:");
107 for (int j = 0; j < s.stack.length; j++) {
108 Log.d(TAG, " " + s.stack[j]);
|
| /packages/apps/Camera2/src/com/android/camera/ |
| CameraHolder.java | 70 String[] stack; field in class:CameraHolder.OpenReleaseState
87 StackTraceElement[] stack = Thread.currentThread().getStackTrace(); local
88 String[] lines = new String[stack.length];
89 for (int i = 0; i < stack.length; i++) {
90 lines[i] = stack[i].toString();
92 s.stack = lines;
106 Log.d(TAG, "Stack:");
107 for (int j = 0; j < s.stack.length; j++) {
108 Log.d(TAG, " " + s.stack[j]);
|
| /packages/apps/UnifiedEmail/src/com/android/mail/lib/html/parser/ |
| HtmlTreeBuilder.java | 38 /** Stack contains HTML4.Element objects to keep track of unclosed tags */
39 private final List<HTML.Element> stack = new ArrayList<HTML.Element>(); field in class:HtmlTreeBuilder
59 while (stack.size() > 0) {
103 while (pos < stack.size() - 1) {
128 /** Finds the start tag from the stack, returns -1 if not found */
130 for (int i = stack.size() - 1; i >= 0; i--) {
131 HTML.Element e = stack.get(i);
140 * Adds a close tag corresponding to a tag on the stack, if
151 /** Pushes a tag onto the stack */
153 stack.add(element)
[all...] |
| /packages/apps/UnifiedEmail/src/com/google/android/mail/common/html/parser/ |
| HtmlTreeBuilder.java | 38 /** Stack contains HTML4.Element objects to keep track of unclosed tags */
39 private final List<HTML.Element> stack = new ArrayList<HTML.Element>(); field in class:HtmlTreeBuilder
59 while (stack.size() > 0) {
103 while (pos < stack.size() - 1) {
128 /** Finds the start tag from the stack, returns -1 if not found */
130 for (int i = stack.size() - 1; i >= 0; i--) {
131 HTML.Element e = stack.get(i);
140 * Adds a close tag corresponding to a tag on the stack, if
151 /** Pushes a tag onto the stack */
153 stack.add(element)
[all...] |
| /external/chromium_org/v8/test/mjsunit/ |
| stack-traces-2.js | 28 // Flags: --builtins-in-stack-traces
37 // stack trace.
44 assertTrue(e.stack.indexOf(nativeFuncName) >= 0, nativeFuncName);
49 // stack trace.
56 assertTrue(e.stack.indexOf(nativeFuncName) >= 0, nativeFuncName);
66 assertTrue(e.stack.indexOf(included) >= 0, included);
81 // builtin. Should not be omitted with the --builtins-in-stack-traces flag.
|
| /external/chromium_org/v8/test/webkit/fast/js/ |
| stack-overflow-arrity-catch.js | 24 description('Test that if an arrity check causes a stack overflow, the exception goes to the right catch');
40 // Should get here because of stack overflow,
41 // now cause a stack overflow exception due to arrity processing
45 // (1) It is dendent on the stack size if we arrive here, in (2) or
63 // (2) It is dendent on the stack size if we arrive here, in (1) or
71 // Should get here because of stack overflow,
72 // now cause a stack overflow exception due to arrity processing
|
| 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.'");
|
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
| brw_eu.c | 157 assert(p->current != &p->stack[BRW_EU_MAX_INSN_STACK-1]);
159 p->compressed_stack[p->current - p->stack] = p->compressed;
165 assert(p->current != p->stack);
167 p->compressed = p->compressed_stack[p->current - p->stack];
185 p->current = p->stack;
198 /* Set up control flow stack */
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| profiler.cc | 34 // Profile current program by sampling stack-trace every so often
267 void* stack[ProfileData::kMaxStackDepth]; local
271 stack[0] = GetPC(*reinterpret_cast<ucontext_t*>(signal_ucontext));
273 // We skip the top two stack trace entries (this function and one
279 int depth = GetStackTraceWithContext(stack + 1, arraysize(stack) - 1,
281 depth++; // To account for pc value in stack[0];
283 instance->collector_.Add(depth, stack);
|
| profiledata.cc | 75 memcpy(&evict_[num_evicted_], entry.stack, d * sizeof(Slot));
260 void ProfileData::Add(int depth, const void* const* stack) {
271 Slot slot = reinterpret_cast<Slot>(stack[i]);
286 if (e->stack[i] != reinterpret_cast<Slot>(stack[i])) {
316 e->stack[i] = reinterpret_cast<Slot>(stack[i]);
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_eu.c | 157 assert(p->current != &p->stack[BRW_EU_MAX_INSN_STACK-1]);
159 p->compressed_stack[p->current - p->stack] = p->compressed;
165 assert(p->current != p->stack);
167 p->compressed = p->compressed_stack[p->current - p->stack];
185 p->current = p->stack;
198 /* Set up control flow stack */
|
| /external/protobuf/gtest/test/ |
| gtest_xml_output_unittest.py | 65 Expected: 1%(stack)s]]></failure>
73 Expected: 1%(stack)s]]></failure>
76 Expected: 2%(stack)s]]></failure>
84 XML output: <?xml encoding="utf-8"><top><![CDATA[cdata text]]>]]><![CDATA[</top>%(stack)s]]></failure>
91 Invalid characters in brackets []%(stack)s]]></failure>
108 </testsuites>""" % {'stack': STACK_TRACE_TEMPLATE}
|
| /external/srec/srec/crec/ |
| srec_stats.c | 141 void srec_stats_update_astar(AstarStack* stack)
147 stack->num_active_paths);
150 stack->num_complete_paths);
152 num_parps_in_use = stack->partial_path_array_size;
153 for (parp = stack->free_parp_list; parp; parp = parp->next)
|
| /packages/apps/Gallery2/src/com/android/gallery3d/util/ |
| ProfileData.java | 74 public void addSample(String[] stack) {
75 int[] ids = new int[stack.length];
76 for (int i = 0; i < stack.length; i++) {
77 ids[i] = nameToId(stack[i]);
81 for (int i = stack.length - 1; i >= 0; i--) {
127 // Writes out one stack, consisting of N+2 words:
129 // second word: depth of the stack (N)
130 // N words: each word is the id of one address in the stack
|
| /external/llvm/test/MC/ARM/ |
| eh-directive-setfp.s | 7 @ the stack pointer. This is required for the function that will change
8 @ the stack pointer out of the function prologue. If the exception is thrown,
9 @ then libunwind will reconstruct the stack pointer from the frame pointer.
11 @ (i) the unwind opcode to copy stack offset from the other register, and
12 @ (ii) the unwind opcode to add or substract the stack offset.
43 @ The assembler should emit 0x9B to copy stack pointer from r11.
85 @ The assembler should emit 0x9B to copy stack pointer from r11.
128 @ The assembler should emit 0x9B to copy stack pointer from r11.
171 @ The assembler should emit 0x9B to copy stack pointer from r11.
229 @ The assembler should emit 0x9B to copy stack pointer from r11
[all...] |
| /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);
564 return stack.get(stack.size() - 1);
568 return stack.remove(stack.size() - 1);
572 stack.add(newTop);
576 * Replace the value on the top of the stack with the given value.
579 stack.set(stack.size() - 1, newTop)
[all...] |
| /external/chromium_org/third_party/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...] |
| /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...] |
| /external/chromium_org/chrome/browser/ui/panels/ |
| panel_manager.cc | 56 // stack or panel we want to seacrh first for adding new panel.
61 // When there're ties, the right-most stack will appear first.
67 // In the event of another draw, the top-most stack will appear first.
73 // The stack with more panels will appear first.
314 // If there're stacks, try to find a stack that can fit new panel.
317 // 1) Search from the stack with more panels to the stack with least panels.
319 // most stack to the left-most stack.
320 // 3) Among the stack with same number of panels and same x position
327 StackedPanelCollection* stack = *iter; local
421 StackedPanelCollection* stack = local
442 StackedPanelCollection* stack = new StackedPanelCollection(this); local
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| profiledata.cc | 75 memcpy(&evict_[num_evicted_], entry.stack, d * sizeof(Slot));
260 void ProfileData::Add(int depth, const void* const* stack) {
271 Slot slot = reinterpret_cast<Slot>(stack[i]);
286 if (e->stack[i] != reinterpret_cast<Slot>(stack[i])) {
316 e->stack[i] = reinterpret_cast<Slot>(stack[i]);
|
