| /external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/ |
| indentation.py | 43 # 1. Build a stack of tokens that can affect indentation.
47 # Much of the work here is determining which tokens to keep on the stack
52 # 2. Given that stack, determine the allowable indentations.
54 # allowable indentations for each stack. We follows the general
70 even after the overriding token is removed from the stack. For example:
124 raise Exception("INTERNAL ERROR: indentation stack is not empty: %r" %
141 stack = self._stack
200 print 'Line #%d: stack %r' % (token.line_number, stack)
258 if (stack and stack[-1].token.string == '?')
[all...] |
| /external/chromium_org/third_party/closure_linter/closure_linter/ |
| indentation.py | 43 # 1. Build a stack of tokens that can affect indentation.
47 # Much of the work here is determining which tokens to keep on the stack
52 # 2. Given that stack, determine the allowable indentations.
54 # allowable indentations for each stack. We follows the general
70 even after the overriding token is removed from the stack. For example:
124 raise Exception("INTERNAL ERROR: indentation stack is not empty: %r" %
141 stack = self._stack
200 print 'Line #%d: stack %r' % (token.line_number, stack)
258 if (stack and stack[-1].token.string == '?')
[all...] |
| /external/chromium_org/tools/valgrind/ |
| memcheck_analyze.py | 30 # we don't want to see in stack traces while pretty printing
32 # Just stop printing the stack/suppression frames when the current one
130 # Valgrind errors contain one <what><stack> pair, plus an optional
131 # <auxwhat><stack> pair, plus an optional <origin><what><stack></origin>,
142 # <stack>
146 # </stack>
148 # <stack>
152 # </stack>
155 # <stack>
[all...] |
| /external/chromium_org/v8/src/ |
| full-codegen.h | 210 // Link into codegen's nesting stack.
215 // Unlink from codegen's nesting stack.
228 // next outer statement in the nesting stack. We accumulate in
229 // *stack_depth the amount to drop the stack and in *context_length the
231 // stack from an exit to its target.
385 // is expected on the stack or the accumulator, depending on the platform.
423 // An operand used to read/write a stack-allocated (PARAMETER or LOCAL)
475 // set to a value popped from the stack, and "done" is set according to the
535 // Emit code to pop values from the stack associated with nested statements
592 // The receiver is left on the stack by the IC
[all...] |
| hydrogen-bce.cc | 108 // Traversing the dominator tree we keep a stack (implemented as a singly
336 // Allocate the stack.
337 HBoundsCheckEliminationState* stack = local
341 stack[0].block_ = entry;
342 stack[0].bb_data_list_ = PreProcessBlock(entry);
343 stack[0].index_ = 0;
346 // Implement depth-first traversal with a stack.
349 HBoundsCheckEliminationState* state = &stack[current];
356 stack[next].block_ = child;
357 stack[next].bb_data_list_ = PreProcessBlock(child)
[all...] |
| /external/llvm/lib/CodeGen/ |
| ShadowStackGC.cpp | 12 // generated is not quite as efficient as algorithms which generate stack maps
22 // In order to support this particular transformation, all stack roots are
23 // coallocated in the stack. This allows a fully target-independent stack map
46 /// StackEntryTy - Abstract type of a link in the shadow stack.
77 X("shadow-stack", "Very portable GC for uncooperative code generators");
272 // int32_t NumRoots; // Number of roots in stack frame.
277 // 32 bits is ok up to a 32GB stack frame. :)
285 // ShadowStackEntry *Next; // Caller's stack entry.
287 // void *Roots[]; // Stack roots (in-place array, so we pretend)
[all...] |
| StackColoring.cpp | 10 // This pass implements the stack-coloring optimization that looks for
12 // which represent the possible lifetime of stack slots. It attempts to
13 // merge disjoint stack slots and reduce the used stack space.
16 // TODO: In the future we plan to improve stack coloring in the following ways:
61 DisableColoring("no-stack-coloring",
63 cl::desc("Disable stack coloring"));
77 STATISTIC(StackSlotMerged, "Number of stack slot merged.");
85 /// StackColoring - A machine pass for merging disjoint stack allocations,
93 /// for a different stack slot
[all...] |
| /art/runtime/arch/x86/ |
| quick_entrypoints_x86.S | 27 subl MACRO_LITERAL(16), %esp // Grow stack by 4 words, bottom word will hold Method*
39 subl MACRO_LITERAL(16), %esp // Grow stack by 4 words, bottom word will hold Method*
44 addl MACRO_LITERAL(28), %esp // Unwind stack up to return address
59 PUSH eax // Align stack, eax will be clobbered by Method*
152 * that will place a mock Method* at the bottom of the stack. Arg1 holds the exception.
171 * stack and call the appropriate C helper.
221 addl MACRO_LITERAL(4), %esp // Pop code pointer off stack
249 mov %esp, %ebp // copy value of stack pointer into base pointer
255 subl %ebx, %esp // reserve stack space for argument array
256 lea 4(%esp), %eax // use stack pointer + method ptr as dest for memcp
[all...] |
| /system/core/libcorkscrew/arch-x86/ |
| backtrace-x86.c | 321 dwarf_state_t* stack, uint8_t* stack_ptr) {
350 dstate->regs[op].rule = stack->regs[op].rule;
351 dstate->regs[op].value = stack->regs[op].value;
393 dstate->regs[reg].rule = stack->regs[reg].rule;
394 dstate->regs[reg].value = stack->regs[reg].value;
435 ALOGE("DW_CFA_remember_state: states stack overflow %d", *stack_ptr);
438 stack[(*stack_ptr)++] = *dstate;
445 ALOGE("DW_CFA_restore_state: states stack is empty");
450 *dstate = stack[--*stack_ptr];
566 dwarf_state_t stack[DWARF_STATES_STACK] local
[all...] |
| /external/v8/src/ia32/ |
| builtins-ia32.cc | 92 // Store a smi-tagged arguments count on the stack.
96 // Push the function to invoke on the stack.
287 // Retrieve the function from the stack.
290 // Retrieve smi-tagged arguments count from the stack.
294 // Push the allocated receiver to the stack. We need two copies
303 // Copy arguments and receiver to the expression stack.
349 // on-stack receiver as the result.
360 // Remove caller arguments from the stack and return.
400 // Push the function and the receiver onto the stack.
408 // Copy arguments to the stack in a loop
[all...] |
| regexp-macro-assembler-ia32.cc | 34 #include "regexp-stack.h"
52 * - esp : points to tip of C stack.
53 * - ecx : points to tip of backtrack stack
58 * The stack will have the following structure:
63 * backtracking stack)
153 // Pop Code* offset from backtrack stack, add Code* and jump to location.
377 // Put arguments into allocated stack area, last argument highest on stack.
675 // Tell the system that we have a stack frame. Because the type is MANUAL, no
679 // Actually emit code to start a new stack frame
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/lib/ |
| libc.a | [all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/lib/ |
| libc.a | [all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/lib/xen/ |
| libc.a | [all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/lib/xen/ |
| libc.a | [all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| XPathContext.java | 24 import java.util.Stack;
67 * Stack of cached "reusable" DTMs for Result Tree Fragments.
71 * %REVIEW% I'm using a Vector rather than Stack so we can reuse
81 * Most recent "reusable" DTM for Global Result Tree Fragments. No stack is
419 * Push a slot on the locations stack so that setSAXLocator can be
471 * The stack of Variable stacks. A VariableStack will be
472 * pushed onto this stack for each template invocation.
477 * Get the variable stack, which is in charge of variables and
480 * @return the variable stack, which should not be null.
488 * Get the variable stack, which is in charge of variables an
[all...] |
| /external/chromium_org/v8/src/arm/ |
| regexp-macro-assembler-arm.cc | 36 #include "regexp-stack.h"
54 * - r8 : Points to tip of backtrack stack
60 * - r13/sp : Points to tip of C stack.
65 * The stack will have the following structure:
70 * backtracking stack).
181 // Pop Code* offset from backtrack stack, add Code* and jump to location.
613 // Tell the system that we have a stack frame. Because the type is MANUAL, no
617 // Actually emit code to start a new stack frame.
620 // Start new stack frame.
621 // Store link register in existing stack-cell
[all...] |
| simulator-arm.h | 66 // The stack limit beyond which we will throw stack overflow errors in
67 // generated code. Because generated code on arm uses the C stack, we
68 // just use the C stack limit.
209 // Accessor to the internal simulator stack area.
225 // Push an address onto the JS stack.
228 // Pop an address from the JS stack.
456 // The simulator has its own stack. Thus it has a different stack limit from
458 // stack cause stack overflow errors, since the simulator ignores the input
[all...] |
| /dalvik/tools/dmtracedump/ |
| CreateTestTrace.c | 79 typedef struct stack { struct
82 } stack; typedef in typeref:struct:stack
105 * determines the call stack. Each called method must be indented by one
126 stack *callStack;
163 callStack = (stack *) malloc(sizeof(stack) * numThreads);
198 // Allocate space for the thread stack, if necessary
263 // Exiting method must be currently on top of stack (unless stack is empty)
266 printf(" Exiting %s (past bottom of stack)\n", records[nextRecord].fullName)
[all...] |
| /development/samples/training/threadsample/src/com/example/android/threadsample/ |
| DisplayActivity.java | 59 // Tracks the number of Fragments on the back stack
108 * A callback invoked when the task's back stack changes. This allows the app to
115 // Gets the previous global stack count
121 // Sets the current back stack count
124 // Re-sets the global stack count to be the current count
128 * If the current stack count is less than the previous, something was popped off the stack
134 // When going backwards in the back stack, turns off full screen mode.
233 * Adds the back stack change listener defined in this Activity as the listener for the
241 // Starts a Fragment transaction to track the stack
[all...] |
| /external/bluetooth/bluedroid/stack/include/ |
| uipc_msg.h | 71 UINT8 num_streams; /* Number of simultaneous streams supported by the light stack */
82 /* Structure of UIPC_CLOSE_RSP message, only for BTC, full stack may ignore it */
171 UINT16 light_xmit_quota; /* Total quota for light stack */
191 UINT16 light_xmit_unacked; /* unacked packet more than quota in light stack */
199 UINT16 light_xmit_quota; /* Total quota for light stack */
291 /* op_code for MM light stack */
304 /* op_code for BTC light stack */
815 /* Dual stack stream events */
833 /* Dual stack stream events */
861 /* MM light stack */
[all...] |
| /external/compiler-rt/lib/asan/ |
| asan_mac.cc | 248 void ReadContextStack(void *context, uptr *stack, uptr *ssize) {
296 void asan_register_worker_thread(int parent_tid, StackTrace *stack) {
300 CreateThreadContextArgs args = { t, stack };
319 asan_register_worker_thread(context->parent_tid, &stack);
322 asan_free(context, &stack, FROM_MALLOC);
333 StackTrace *stack) {
335 (asan_block_context_t*) asan_malloc(sizeof(asan_block_context_t), stack);
348 asan_block_context_t *asan_ctxt = alloc_asan_context(ctxt, func, &stack); \
366 asan_block_context_t *asan_ctxt = alloc_asan_context(ctxt, func, &stack);
379 asan_block_context_t *asan_ctxt = alloc_asan_context(ctxt, func, &stack);
[all...] |
| /external/v8/src/arm/ |
| simulator-arm.h | 66 // The stack limit beyond which we will throw stack overflow errors in
67 // generated code. Because generated code on arm uses the C stack, we
68 // just use the C stack limit.
177 // Accessor to the internal simulator stack area.
191 // Push an address onto the JS stack.
194 // Pop an address from the JS stack.
413 // The simulator has its own stack. Thus it has a different stack limit from
415 // stack cause stack overflow errors, since the simulator ignores the input
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| plistlib.py | 155 self.stack = []
160 self.stack.append(element)
166 assert self.stack.pop() == element
396 self.stack = []
425 self.stack[-1][self.currentKey] = value
427 elif not self.stack:
431 self.stack[-1].append(value)
447 self.stack.append(d)
449 self.stack.pop()
457 self.stack.append(a
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| plistlib.py | 155 self.stack = []
160 self.stack.append(element)
166 assert self.stack.pop() == element
396 self.stack = []
425 self.stack[-1][self.currentKey] = value
427 elif not self.stack:
431 self.stack[-1].append(value)
447 self.stack.append(d)
449 self.stack.pop()
457 self.stack.append(a
[all...] |
