| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/hotshot/ |
| log.py | 38 # This mirrors the call stack of the profiled code as the log
182 stack = [st.totuple(1)]
184 while stack:
185 tree = stack.pop()
194 stack.extend(list(tree[1:]))
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| pickletools.py | 39 The PM has two data areas, "the stack" and "the memo".
41 Many opcodes push Python objects onto the stack; e.g., INT pushes a Python
42 integer object on the stack, whose value is gotten from a decimal string
44 opcodes take Python objects off the stack. The result of unpickling is
45 whatever object is left on the stack when the final STOP opcode is executed.
50 names. Some opcodes pop a stack object into the memo at a given index,
51 and others push a memo object at a given index onto the stack again.
111 a number of opcodes that operate on many stack elements at once (like APPENDS
153 # off the stack -- ArgumentDescriptor applies only to arguments embedded in
692 # Object descriptors. The stack used by the pickle machine holds objects
[all...] |
| /frameworks/base/packages/DocumentsUI/src/com/android/documentsui/ |
| RecentsProvider.java | 79 public static final String STACK = "stack";
93 public static final String STACK = "stack";
133 RecentColumns.STACK + " BLOB DEFAULT NULL," +
149 ResumeColumns.STACK + " BLOB DEFAULT NULL," +
308 final DocumentStack stack = new DocumentStack(); local
315 cursor.getColumnIndex(RecentColumns.STACK));
316 DurableUtils.readFromArray(rawStack, stack);
318 if (stack.root != null && predicate.apply(stack.root.authority))
[all...] |
| /system/core/libutils/ |
| RefBase.cpp | 45 // folder where stack traces are saved when DEBUG_REFS is enabled
112 refs->stack.dump(LOG_TAG);
126 refs->stack.dump(LOG_TAG);
133 CallStack stack(LOG_TAG);
199 snprintf(name, 100, DEBUG_REFS_CALLSTACK_PATH "/%p.stack", this);
204 ALOGD("STACK TRACE for %p saved in %s", this, name);
206 else ALOGE("FAILED TO PRINT STACK TRACE for %p in %s: %s", this,
217 CallStack stack; member in struct:android::RefBase::weakref_impl::ref_entry
234 ref->stack.update(2);
269 CallStack stack(LOG_TAG)
[all...] |
| /dalvik/hit/src/com/android/hit/ |
| HprofParser.java | 412 StackTrace stack = mState.getStackTrace(thread.mStackTrace); local
414 threadSerialNumber, stack);
438 StackTrace stack = mState.getStackTrace(stackSerialNumber); local
497 ClassObj theClass = new ClassObj(id, stack, mClassNames.get(id));
518 StackTrace stack = mState.getStackTrace(stackId); local
521 ClassInstance instance = new ClassInstance(id, stack, classId);
533 StackTrace stack = mState.getStackTrace(stackId); local
542 ArrayInstance array = new ArrayInstance(id, stack, Types.OBJECT,
555 StackTrace stack = mState.getStackTrace(stackId); local
564 ArrayInstance array = new ArrayInstance(id, stack, type, numElements
[all...] |
| /external/chromium_org/ppapi/proxy/ |
| raw_var_data.cc | 7 #include <stack>
75 // This function uses a stack-based DFS search to traverse the var graph. Each
76 // iteration, the top node on the stack examined. If the node has not been
81 // Otherwise, if they haven't been visited yet we add them to the stack, If the
82 // node at the top of the stack has already been visited, then we pop it off the
83 // stack and erase it from |parent_ids|.
92 std::stack<StackEntry> stack; local
93 stack.push(StackEntry(var, GetOrCreateRawVarData(var, &visited_map,
96 while (!stack.empty())
[all...] |
| /external/chromium_org/sandbox/linux/seccomp-bpf/ |
| codegen.cc | 238 Instructions stack; local
247 stack.push_back(const_cast<Instruction *>(insn));
252 // already remembered the "false" branch on the stack and will
276 while (!insn && !stack.empty()) {
278 // stack to any branches that we haven't processed yet. By definition,
281 insn = stack.back();
282 stack.pop_back();
289 // up the stack.
349 Instructions stack; local
368 // false branch of the jump. We need to maintain a stack to do so
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_ssa.cpp | 299 Stack *stack; member in class:nv50_ir::RenamePass
406 stack = new Stack[func->allLValues.getSize()];
411 if (stack)
412 delete[] stack;
418 if (!stack[val->id].getSize())
420 return reinterpret_cast<LValue *>(stack[val->id].peek().u.p);
437 if (!stack)
461 stack[lval->id].push(ssa)
[all...] |
| /external/chromium_org/v8/src/ |
| profile-generator.cc | 327 List<Position> stack(10);
328 stack.Add(Position(root_));
329 while (stack.length() > 0) {
330 Position& current = stack.last();
333 stack.Add(Position(current.current_child()));
336 if (stack.length() > 1) {
337 Position& parent = stack[stack.length() - 2];
341 // Remove child from the stack.
342 stack.RemoveLast()
[all...] |
| /external/libffi/src/mips/ |
| ffi.c | 51 FFI_ASSERT(argp <= &stack[bytes]); \
52 if (argp == &stack[bytes]) \
54 argp = stack; \
62 /* ffi_prep_args is called by the assembly routine once stack space
65 static void ffi_prep_args(char *stack,
77 on the stack. We reorder stuff on the stack here to
80 argp = &stack[bytes - (8 * sizeof(ffi_arg))];
82 argp = stack;
84 argp = stack;
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_ssa.cpp | 299 Stack *stack; member in class:nv50_ir::RenamePass
406 stack = new Stack[func->allLValues.getSize()];
411 if (stack)
412 delete[] stack;
418 if (!stack[val->id].getSize())
420 return reinterpret_cast<LValue *>(stack[val->id].peek().u.p);
437 if (!stack)
461 stack[lval->id].push(ssa)
[all...] |
| /cts/tools/tradefed-host/src/com/android/cts/tradefed/result/ |
| Test.java | 290 * Gets the failure message to show from the stack trace.
294 * @param stack the full stack trace
297 static String getFailureMessageFromStackTrace(String stack) {
298 // return the first two lines of stack as failure message
299 int endPoint = stack.indexOf('\n');
301 int nextLine = stack.indexOf('\n', endPoint + 1);
303 return stack.substring(0, nextLine);
306 return stack;
|
| /external/chromium_org/testing/gtest/test/ |
| gtest_xml_output_unittest.py | 68 Expected: 1%(stack)s]]></failure>
76 Expected: 1%(stack)s]]></failure>
79 Expected: 2%(stack)s]]></failure>
87 XML output: <?xml encoding="utf-8"><top><![CDATA[cdata text]]>]]><![CDATA[</top>%(stack)s]]></failure>
94 Invalid characters in brackets []%(stack)s]]></failure>
129 </testsuites>""" % {'stack': STACK_TRACE_TEMPLATE}
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/pyxelator/ |
| lexer.py | 46 self.stack = None
221 self.stack = self.get_state() # a short stack :)
222 #self.stack.push( self.get_state() )
225 assert self.stack is not None
226 self.set_state(*self.stack)
227 self.stack = None
|
| /external/compiler-rt/lib/tsan/rtl/ |
| tsan_rtl_amd64.S | 35 # Align stack frame.
46 # Unalign stack frame back.
115 # Align stack frame.
126 # Unalign stack frame back.
231 // align stack frame
241 // unalign stack frame
272 // align stack frame
282 // unalign stack frame
301 /* We do not need executable stack. */
302 .section .note.GNU-stack,"",@progbit
[all...] |
| /ndk/sources/third_party/googletest/googletest/test/ |
| gtest_xml_output_unittest.py | 68 Expected: 1%(stack)s]]></failure>
76 Expected: 1%(stack)s]]></failure>
79 Expected: 2%(stack)s]]></failure>
87 XML output: <?xml encoding="utf-8"><top><![CDATA[cdata text]]>]]><![CDATA[</top>%(stack)s]]></failure>
94 Invalid characters in brackets []%(stack)s]]></failure>
129 </testsuites>""" % {'stack': STACK_TRACE_TEMPLATE}
|
| /external/checkpolicy/ |
| module_compiler.c | 48 /* keep track of the last item added to the stack */
92 /* reset the scoping stack */
104 /* Given the current parse stack, returns 1 if a declaration would be
107 * current scope stack then this would return a 0.
601 /* Given the current parse stack, returns 1 if a requirement would be
1225 static int is_scope_in_stack(scope_datum_t * scope, scope_stack_t * stack)
1228 if (stack == NULL) {
1231 if (stack->type == 1) {
1232 avrule_decl_t *decl = stack->decl;
1243 /* not within scope of this stack, so try its parent *
[all...] |
| /external/valgrind/main/coregrind/m_debuginfo/ |
| d3basics.c | 485 FAIL("evaluate_Dwarf3_Expr: stack overflow(1)"); \
487 stack[sp] = (_arg); \
494 FAIL("evaluate_Dwarf3_Expr: stack underflow(1)"); \
495 _lval = stack[sp]; \
502 Addr stack[N_EXPR_STACK]; /* stack of addresses, as per D3 spec */ local
552 /* end of expr - return expr on the top of stack. */
554 /* stack empty. Bad. */
555 FAIL("evaluate_Dwarf3_Expr: stack empty at end of expr");
598 FAIL("evaluate_Dwarf3_Expr: DW_OP_{implicit,stack}_value
[all...] |
| /external/bison/data/ |
| glr.c | 30 # Stack parameters.
547 if the built-in stack extension method is used).
557 /* Minimum number of free items on the stack allowed after an
560 stack is expanded, thus insuring that all necessary pointers get
687 /** Preceding state in this stack */
729 /** Type of the items in the GLR stack. The yyisState field
826 * and top stack item YYVSP. YYLVALP points to place to put semantic
1043 * stack #K of *STACKP. */
1068 /** Initialize SET to a singleton set containing an empty stack. */
1094 /** Initialize STACK to a single empty stack, with total maximu
[all...] |
| /packages/apps/Camera/jni/feature_mos/src/mosaic/ |
| Delaunay.cpp | 372 int stack[DM]; local
409 // Now to recurse on shorter partition, store longer partition on stack
413 break; // empty stack && both partitions < QQ so break
415 sj = stack[--m];
416 si = stack[--m];
423 stack[m++] = si;
424 stack[m++] = sL;
432 break; // empty stack && both partitions < QQ so break
434 sj = stack[--m];
435 si = stack[--m]
[all...] |
| /packages/apps/Camera2/jni/feature_mos/src/mosaic/ |
| Delaunay.cpp | 372 int stack[DM]; local
409 // Now to recurse on shorter partition, store longer partition on stack
413 break; // empty stack && both partitions < QQ so break
415 sj = stack[--m];
416 si = stack[--m];
423 stack[m++] = si;
424 stack[m++] = sL;
432 break; // empty stack && both partitions < QQ so break
434 sj = stack[--m];
435 si = stack[--m]
[all...] |
| /packages/apps/LegacyCamera/jni/feature_mos/src/mosaic/ |
| Delaunay.cpp | 372 int stack[DM]; local
409 // Now to recurse on shorter partition, store longer partition on stack
413 break; // empty stack && both partitions < QQ so break
415 sj = stack[--m];
416 si = stack[--m];
423 stack[m++] = si;
424 stack[m++] = sL;
432 break; // empty stack && both partitions < QQ so break
434 sj = stack[--m];
435 si = stack[--m]
[all...] |
| /external/chromium_org/chrome/browser/resources/file_manager/css/ |
| audio_player.css | 82 .audio-player > .track-stack {
103 .audio-player > .track-stack {
109 .audio-player:not(.collapsed):not(.single-track) > .track-stack {
139 .track-stack > .track {
144 .track-stack > .track.selected {
153 .track-stack > .track:not(.selected) .data,
154 .track-stack > .track:not(.visible) .art {
|
| /external/chromium_org/third_party/bintrees/bintrees/ |
| ctrees.c | 10 #include "stack.h"
511 /* Push direction and node onto stack */
592 /* Push direction and node onto stack */
788 node_stack_t *stack; local
789 stack = stack_init(32);
793 stack_push(stack, node);
798 stack_delete(stack);
807 if (stack_is_empty(stack)) {
808 stack_delete(stack);
811 node = stack_pop(stack);
830 node_stack_t *stack; local
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| heap-profile-table.cc | 110 // We strip out different number of stack frames in debug mode
161 dealloc_(bucket->stack);
181 // Lookup stack trace in table
186 equal(key, key + depth, b->stack)) {
199 b->stack = kcopy;
207 int skip_count, void* stack[kMaxStackDepth]) {
209 stack, kMaxStackDepth, kStripFrames + skip_count + 1);
249 info->call_stack = alloc_value->bucket()->stack;
322 reinterpret_cast<uintptr_t>(b.stack[d]));
391 info.call_stack = list[i]->stack;
[all...] |
