| /prebuilts/python/darwin-x86/2.7.5/include/python2.7/ |
| frameobject.h | 13 int b_level; /* value stack level to pop to */
26 to the current stack top. */
49 PyObject *f_localsplus[1]; /* locals+stack, dynamically sized */
72 /* Extend the value stack */
|
| /prebuilts/python/linux-x86/2.7.5/include/python2.7/ |
| frameobject.h | 13 int b_level; /* value stack level to pop to */
26 to the current stack top. */
49 PyObject *f_localsplus[1]; /* locals+stack, dynamically sized */
72 /* Extend the value stack */
|
| /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();
|
| /system/core/debuggerd/ |
| crasher.c | 46 printf("crasher: deliberately corrupting stack...\n");
47 // Unless there's a "big enough" buffer on the stack, gcc
135 } else if (!strcmp(arg,"smash-stack")) {
137 } else if (!strcmp(arg,"stack-overflow")) {
155 fprintf(stderr, " smash-stack overwrite a stack-guard canary\n");
156 fprintf(stderr, " stack-overflow recurse until the stack overflows\n");
159 fprintf(stderr, " nostack crash with a NULL stack pointer\n");
|
| /frameworks/base/docs/html/training/implementing-navigation/ |
| temporal.jd | 13 <li><a href="#SynthesizeBackStack">Synthesize a new Back Stack for Deep Links</a></li>
21 <li><a href="{@docRoot}guide/components/tasks-and-back-stack.html">Tasks and Back Stack</a></li>
33 <p>In almost all situations, the system maintains a back stack of activities while the user
62 <h2 id="SynthesizeBackStack">Synthesize a new Back Stack for Deep Links</h2>
64 <p>Ordinarily, the system incrementally builds the back stack as the user navigates from one
67 back stack because the activity is running in a new task without any back stack at all.</p>
70 you should add activities into your task's back stack so that pressing <em>Back</em> navigates
120 {@link android.support.v4.app.NavUtils} APIs to synthesize a new back stack by identifying whic
[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/llvm/lib/Target/X86/ |
| X86FloatingPoint.cpp | 1 //===-- X86FloatingPoint.cpp - Floating point Reg -> Stack converter ------===//
11 // pseudo registers into register stack instructions. This pass uses live
15 // The x87 hardware tracks liveness of the stack registers, so it is necessary
18 // identical stack positions. Instructions are inserted at the end of each basic
58 memset(Stack, 0, sizeof(Stack));
79 // LiveBundle. It represents a set of CFG edges where the live FP stack
80 // registers must be allocated identically in the x87 stack.
87 // but the exact mapping of FP registers to stack slots is fixed later.
93 // stack order has not yet been fixed
[all...] |
| X86FrameLowering.cpp | 87 /// when it reaches the "return" instruction. We can then pop a stack object
144 /// stack pointer by a constant value.
202 /// mergeSPUpdatesUp - Merge two stack-manipulating instructions upper iterator.
226 /// mergeSPUpdatesDown - Merge two stack-manipulating instructions lower iterator.
259 /// stack adjustment is returned as a positive value for ADD/LEA and a negative for
325 // Determine maximum offset (minimum due to stack growth).
550 // We already have a stack size.
556 // We need this to be a stack adjustment pointer. Something like:
586 // Frameless stack with a small stack size
[all...] |
| /external/valgrind/main/coregrind/m_syswrap/ |
| syswrap-amd64-darwin.c | 246 // on a separate non-client stack.
253 char *stack; local
258 stack = (char *)allocstack(tst->tid);
259 stack -= 64+320; // make room for top frame
260 memset(stack, 0, 64+320); // ...and clear it
261 *(uintptr_t *)stack = 0; // push fake return address
265 mach->__rsp = (uintptr_t)stack;
269 /* Call f(arg1), but first switch stacks, using 'stack' as the new
270 stack, and use 'retaddr' as f's return-to address. Also, clear all
273 void call_on_new_stack_0_1 ( Addr stack,
358 Addr stack = VG_PGROUNDUP(sp) - stacksize; local
421 Addr stack; local
[all...] |
| /sdk/emulator/qtools/ |
| callstack.h | 18 // Define a template class for the stack frame. The template parameter
74 int mTop; // index of the next stack frame to write
91 // on the stack.
95 // stack.
217 // If the stack is now empty, then push the current function.
319 // return. We don't necessarily have a complete call stack (since
387 // Check for stack overflow
389 // Don't show the stack by default because this generates a lot
395 fprintf(stderr, "Error: stack overflow (%d frames)\n", mTop);
411 // to false matches when searching the stack
[all...] |
| /external/valgrind/main/drd/tests/ |
| tc22_exit_w_lock.stderr.exp-32bit | 10 (thread finished, call stack no longer available)
12 (thread finished, call stack no longer available)
22 (thread finished, call stack no longer available)
24 (thread finished, call stack no longer available)
34 (thread finished, call stack no longer available)
36 (thread finished, call stack no longer available)
46 (thread finished, call stack no longer available)
48 (thread finished, call stack no longer available)
58 (thread finished, call stack no longer available)
60 (thread finished, call stack no longer available
[all...] |
| /external/chromium_org/tools/mac/ |
| symbolicate_crash.py | 66 """Symbolicates a crash report stack trace."""
94 # Attaches a list of symbol names to stack frames. This assumes that the
104 # dictionary until the first thread stack is reached.
122 # thread stack heading has been read past. Seek backwards from the current
128 """Parses the stack dump of a crash report and creates a list of threads
129 and their stack traces."""
130 # Compile a regex that matches the start of a thread stack. Note that this
132 # right after all the stack traces.
141 # Check for start of the thread stack.
145 # A blank line indicates a break in the thread stack
[all...] |
| /prebuilts/python/darwin-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...] |
| /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...] |
| /bionic/libc/bionic/ |
| pthread_create.cpp | 68 // GCC looks in the TLS for the stack guard on x86, so copy it there from our global.
73 // Create and set an alternate signal stack.
141 void* stack = mmap(NULL, thread->attr.stack_size, prot, flags, -1, 0); local
142 if (stack == MAP_FAILED) {
145 "pthread_create failed: couldn't allocate %zd-byte stack: %s",
150 // Set the guard region at the end of the stack to PROT_NONE.
151 if (mprotect(stack, thread->attr.guard_size, PROT_NONE) == -1) {
153 "pthread_create failed: couldn't mprotect PROT_NONE %zd-byte stack guard region: %s",
155 munmap(stack, thread->attr.stack_size);
159 return stack;
[all...] |
| /dalvik/vm/arch/mips/ |
| CallO32.S | 19 * argument list has to be pushed onto the native stack according to
54 * MIPS reservers 16 bytes on stack even if the first 4 args are passed by
68 * L - number of double-words (64 bits!) of storage required on stack (0-30 words)
69 * F - pad flag -- if set, write a pad word to the stack
72 * onto the stack. Anything requiring more than that -- which should happen
80 * will not be able to unwind the stack past this method. The only way
84 /* Stack:
118 * These registers should be saved to and restored from stack.
124 * We put the stack size into register s1 because we can not know the size
125 * of stack at the beginning. This size can be calculated with the hel
[all...] |
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXPrologEpilogPass.cpp | 79 /// AdjustStackOffset - Helper function used to adjust the stack frame offset.
84 // If the stack grows down, add the object size to find the lowest address.
90 // If the alignment of this object is greater than that of the stack, then
91 // increase the stack alignment to match.
115 // Loop over all of the stack objects, assigning sequential addresses...
119 // The Offset is the distance from the stack top in the direction
120 // of stack growth -- so it's always nonnegative.
125 && "Local area offset should be in direction of stack growth");
136 // The maximum distance from the stack pointer is at lower address of
137 // the object -- which is given by offset. For down growing stack
[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...] |
| DocumentsActivity.java | 296 // Restore last stack for calling package
304 cursor.getColumnIndex(ResumeColumns.STACK));
305 DurableUtils.readFromArray(rawStack, mState.stack);
315 // Update the restored stack to ensure we have freshest data
318 mState.stack.updateRoot(matchingRoots);
319 mState.stack.updateDocuments(getContentResolver());
321 Log.w(TAG, "Failed to restore stack: " + e);
322 mState.stack.reset();
335 // Show drawer when no stack restored, but only when requesting
446 if (mState.stack.size() <= 1)
1147 public DocumentStack stack = new DocumentStack(); field in class:DocumentsActivity.State
[all...] |
| /development/scripts/ |
| stack_core.py | 17 """stack symbolizes native crash dumps."""
27 print "Stack Trace:"
36 """Print stack data values."""
39 print "Stack Data:"
48 STACK = "[stack]"
62 """Convert strings containing native crash to a stack."""
70 # whitespace (e.g. \t). This is because the we want to allow for the stack
143 if area == UNKNOWN or area == HEAP or area == STACK:
147 # display "a -> b -> c" in the stack trace instead of just "a -> c
[all...] |
| /external/bison/examples/calc++/ |
| calc++-parser.hh | 57 #include "stack.hh"
161 /// State stack type.
162 typedef stack<state_type> state_stack_type;
163 /// Semantic value stack type.
164 typedef stack<semantic_type> semantic_stack_type;
165 /// location stack type.
166 typedef stack<location_type> location_stack_type;
168 /// The state stack.
170 /// The semantic value stack.
172 /// The location stack
[all...] |
| /external/chromium_org/v8/test/mjsunit/ |
| eval-stack-trace.js | 28 // Return the stack frames of an Error object.
35 var frames = this.stack;
94 // f (eval at g (eval-stack.js:87:8), <anonymous>:2:9)
95 // eval (eval at g (eval-stack.js:87:8), <anonymous>:4:1)
96 // g (eval-stack.js:87:3)
97 // eval-stack.js:94:3
124 // f (eval at h (eval at <anonymous> (eval-stack.js:116:8)),
126 // eval (eval at h (eval at <anonymous> (eval-stack.js:116:8)),
128 // h (eval at <anonymous> (eval-stack.js:116:8), <anonymous>:3:3)
129 // eval (eval at <anonymous> (eval-stack.js:116:8), <anonymous>:5:1
[all...] |
| /ndk/sources/host-tools/sed-4.2.1/testsuite/ |
| binary.sed | 17 # stack manipulation commands
18 # c clear stack
19 # P pop stack top
20 # D duplicate stack top
22 # r rotate stack counter-clockwise (second element becomes first)
23 # R rotate stack clockwise (last element becomes first)
26 # l print stack (stack top is first)
27 # p print stack top
28 # q quit, print stack top if any (cq is quiet quit
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/bn/ |
| bn_ctx.c | 83 /* The stack frame info is resizing, set a first-time expansion size; */
103 /* Stack depth and allocation size */
118 /* A wrapper to manage the "stack frames" */
121 /* Array of indexes into the bignum stack */
123 /* Number of stack frames, and the size of the allocated array */
143 /* The "stack frames", if you will */
144 BN_STACK stack; member in struct:bignum_ctx
147 /* Depth of stack overflow */
160 BN_STACK *stack = &ctx->stack; local
[all...] |
| /external/chromium_org/third_party/skia/include/core/ |
| SkClipStack.h | 19 // stores the stack depth (fSaveCount) and clips (fDeque) separately.
20 // Each clip in fDeque stores the stack state to which it belongs
107 /** The GenID can be used by clip stack clients to cache representations of the clip. The
109 stack not to the element itself. That is the same clip path in different stacks will
163 int fSaveCount; // save count of stack when this element was added.
168 /* fFiniteBoundType and fFiniteBound are used to incrementally update the clip stack's
181 // When element is applied to the previous elements in the stack is the result known to be
242 stack */
290 * clip-stack. If false is returned then the rect does not intersect the
356 Iter(const SkClipStack& stack, IterStart startLoc)
[all...] |
