| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| inspect.py | 23 currentframe() - get the current stack frame
24 stack(), trace() - get info about frames on the stack or in a traceback
223 co_stacksize virtual machine stack space required
761 stack, remain, count = [], [], []
773 stack.append(names[value])
779 stack[0] = [stack[0]]
786 stack[-size:] = [stack[-size:]
1052 def stack(context=1): function
[all...] |
| bdb.py | 339 # to get a data structure representing a stack trace.
342 stack = []
346 stack.append((f, f.f_lineno))
350 stack.reverse()
351 i = max(0, len(stack) - 1)
353 stack.append((t.tb_frame, t.tb_lineno))
356 i = max(0, len(stack) - 1)
357 return stack, i
|
| /prebuilts/python/linux-x86/2.7.5/share/pretty-printers/stlport/test/ |
| test.cpp | 12 #include <stack>
104 std::stack<int> stack1;
|
| /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/third_party/openssl/openssl/crypto/ |
| sparccpuid.S | 21 ! Keep in mind that this does not excuse us from wiping the stack!
23 ! resides on the stack, toward lower addresses]. To facilitate for
24 ! stack wiping I return pointer to the top of stack of the *caller*.
126 add %fp,BIAS,%i0 ! return pointer to callerīs top of stack
|
| /external/eigen/Eigen/src/OrderingMethods/ |
| Amd.h | 64 Index cs_tdfs(Index j, Index k, Index *head, const Index *next, Index *post, Index *stack)
67 if(!head || !next || !post || !stack) return (-1); /* check inputs */
68 stack[0] = j; /* place j on the stack */
69 while (top >= 0) /* while (stack is not empty) */
71 p = stack[top]; /* p = top of stack */
81 stack[++top] = i; /* start dfs on child node i */
|
| /external/libffi/src/s390/ |
| sysv.S | 55 ahi %r15,-96-48 # Allocate stack
127 lr %r1,%r15 # Set up stack frame
257 aghi %r15,-160-80 # Allocate stack
331 lgr %r1,%r15 # Set up stack frame
433 .section .note.GNU-stack,"",@progbits
|
| /external/libvpx/libvpx/vp8/common/ppc/ |
| variance_subpixel_altivec.asm | 200 stwu r1,-32(r1) ;# create space on the stack
270 addi r1, r1, 32 ;# recover stack
291 stwu r1,-32(r1) ;# create space on the stack
381 addi r1, r1, 32 ;# recover stack
401 stwu r1,-32(r1) ;# create space on the stack
538 addi r1, r1, 32 ;# recover stack
618 stwu r1, -32(r1) ;# create space on the stack
689 addi r1, r1, 32 ;# recover stack
711 stwu r1, -32(r1) ;# create space on the stack
814 addi r1, r1, 32 ;# recover stack
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| HeuristicSolver.h | 107 std::vector<Graph::NodeItr> stack; member in class:PBQP::HeuristicSolverImpl
190 /// \brief Add to the end of the stack.
191 /// @param nItr Node iterator to add to the reduction stack.
194 stack.push_back(nItr);
222 /// Node will be automatically pushed to the solver stack.
227 // Nothing to do. Just push the node onto the reduction stack.
236 /// Node will be automatically pushed to the solver stack.
285 /// Node will be automatically pushed to the solver stack.
551 while (!stack.empty()) {
552 computeSolution(stack.back())
[all...] |
| /external/nist-sip/java/gov/nist/javax/sip/stack/ |
| UDPMessageChannel.java | 30 package gov.nist.javax.sip.stack;
66 * stack (later removed). Lamine Brahimi suggested a single threaded behavior
74 * fixed a performance issue where the stack was doing DNS lookups (potentially
76 * the stack from exitting when an exception is encountered.
84 * is handed off via a SIP stack request for further processing. This stack
100 * SIP Stack structure for this channel.
163 * Constructor - takes a datagram packet and a stack structure Extracts the
165 * pointer to the passed stack structure.
167 * @param stack
[all...] |
| /external/openssl/crypto/ |
| sparccpuid.S | 21 ! Keep in mind that this does not excuse us from wiping the stack!
23 ! resides on the stack, toward lower addresses]. To facilitate for
24 ! stack wiping I return pointer to the top of stack of the *caller*.
126 add %fp,BIAS,%i0 ! return pointer to callerīs top of stack
|
| /dalvik/vm/compiler/template/out/ |
| CompilerTemplateAsm-armv5te.S | 48 Stack is "full descending". Only the arguments that don't fit in the first 4
49 registers are placed on the stack. "sp" points at the first stacked argument
88 * Given a frame pointer, find the stack save area.
163 * Unwind a frame from the Dalvik stack for compiled OP_RETURN_XXX.
236 SAVEAREA_FROM_FP(r1, rFP) @ r1<- stack save area
238 SAVEAREA_FROM_FP(r10, r1) @ r10<- stack save area
241 bxlo lr @ return to raise stack overflow excep.
303 SAVEAREA_FROM_FP(r1, rFP) @ r1<- stack save area
305 SAVEAREA_FROM_FP(r10, r1) @ r10<- stack save area
309 bxlo r12 @ return to raise stack overflow excep
[all...] |
| CompilerTemplateAsm-armv7-a-neon.S | 48 Stack is "full descending". Only the arguments that don't fit in the first 4
49 registers are placed on the stack. "sp" points at the first stacked argument
88 * Given a frame pointer, find the stack save area.
163 * Unwind a frame from the Dalvik stack for compiled OP_RETURN_XXX.
236 SAVEAREA_FROM_FP(r1, rFP) @ r1<- stack save area
238 SAVEAREA_FROM_FP(r10, r1) @ r10<- stack save area
241 bxlo lr @ return to raise stack overflow excep.
303 SAVEAREA_FROM_FP(r1, rFP) @ r1<- stack save area
305 SAVEAREA_FROM_FP(r10, r1) @ r10<- stack save area
309 bxlo r12 @ return to raise stack overflow excep
[all...] |
| CompilerTemplateAsm-armv7-a.S | 48 Stack is "full descending". Only the arguments that don't fit in the first 4
49 registers are placed on the stack. "sp" points at the first stacked argument
88 * Given a frame pointer, find the stack save area.
163 * Unwind a frame from the Dalvik stack for compiled OP_RETURN_XXX.
236 SAVEAREA_FROM_FP(r1, rFP) @ r1<- stack save area
238 SAVEAREA_FROM_FP(r10, r1) @ r10<- stack save area
241 bxlo lr @ return to raise stack overflow excep.
303 SAVEAREA_FROM_FP(r1, rFP) @ r1<- stack save area
305 SAVEAREA_FROM_FP(r10, r1) @ r10<- stack save area
309 bxlo r12 @ return to raise stack overflow excep
[all...] |
| /external/chromium_org/chrome/common/extensions/docs/examples/howto/sandbox/ |
| handlebars-1.0.0.beta.6.js | 200 var self = this, stack = [0], vstack = [null], lstack = [], table = this.table, yytext = "", yylineno = 0, yyleng = 0, recovering = 0, TERROR = 2, EOF = 1;
211 stack.length = stack.length - 2 * n;
225 state = stack[stack.length - 1];
254 stack.push(symbol);
257 stack.push(action[1]);
280 stack = stack.slice(0, -1 * len * 2);
284 stack.push(this.productions_[action[1]][0])
[all...] |
| /external/chromium_org/v8/tools/ |
| profile.js | 87 * during stack strace processing, specifies a position of the frame
232 * Records a tick event. Stack must contain a sequence of
235 * @param {Array<number>} stack Stack sample.
237 Profile.prototype.recordTick = function(stack) {
238 var processedStack = this.resolveAndFilterFuncs_(stack);
249 * @param {Array<number>} stack Stack sample.
251 Profile.prototype.resolveAndFilterFuncs_ = function(stack) {
253 for (var i = 0; i < stack.length; ++i)
[all...] |
| /external/v8/tools/ |
| profile.js | 87 * during stack strace processing, specifies a position of the frame
232 * Records a tick event. Stack must contain a sequence of
235 * @param {Array<number>} stack Stack sample.
237 Profile.prototype.recordTick = function(stack) {
238 var processedStack = this.resolveAndFilterFuncs_(stack);
249 * @param {Array<number>} stack Stack sample.
251 Profile.prototype.resolveAndFilterFuncs_ = function(stack) {
253 for (var i = 0; i < stack.length; ++i)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| FlameChart.js | 310 var stack = [];
311 appendReversedArray(stack, this._cpuProfileView.profileHead.children);
317 while (stack.length) {
319 var node = stack.pop();
330 levelExitIndexes.push(stack.length);
332 appendReversedArray(stack, node.children);
335 while (stack.length === levelExitIndexes[levelExitIndexes.length - 1]) {
381 // GC samples have no stack, so we just put GC node on top of the last recoreded sample.
388 // If previous stack is also GC then just continue.
541 var maxStackDepth = 5; // minimum stack depth for the case when we see no activity
[all...] |
| /external/marisa-trie/lib/marisa/ |
| trie-search.cc | 622 Vector<Cell> stack; local
623 stack.push_back(cell);
626 Cell &cur = stack[stack_pos - 1];
642 if (stack_pos == stack.size()) {
646 stack.push_back(cell);
648 stack[stack_pos - 1].set_node(stack[stack_pos - 1].node() + 1);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| bdb.py | 339 # to get a data structure representing a stack trace.
342 stack = []
346 stack.append((f, f.f_lineno))
350 stack.reverse()
351 i = max(0, len(stack) - 1)
353 stack.append((t.tb_frame, t.tb_lineno))
356 i = max(0, len(stack) - 1)
357 return stack, i
|
| /external/chromium/chrome/browser/sync/ |
| profile_sync_service_bookmark_unittest.cc | 9 #include <stack>
463 std::stack<int64> stack; local
464 stack.push(bookmark_bar_id());
465 while (!stack.empty()) {
466 int64 id = stack.top();
467 stack.pop();
474 stack.push(gnode.GetFirstChildId());
475 stack.push(gnode.GetSuccessorId());
[all...] |
| /art/runtime/arch/arm/ |
| quick_entrypoints_arm.S | 71 add sp, #32 @ unwind stack
77 add sp, #32 @ unwind stack
170 * that will place a mock Method* at the bottom of the stack. Arg1 holds the exception.
204 * stack and call the appropriate C helper.
267 mov r11, sp @ save the stack pointer
273 sub sp, r5 @ reserve stack space for argument array
274 add r0, sp, #4 @ pass stack pointer + method ptr as dest for memcpy
284 mov sp, r11 @ restore the stack pointer
574 sub sp, #8 @ grow frame for alignment with stack args
616 sub sp, #8 @ grow frame for alignment with stack arg
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
| BaseRecognizer.java | 212 * more information such as the stack frame with
379 * follow that rule reference on the stack; this amounts to
406 * that rule is pushed on a stack. Here are the various "local"
417 * and, hence, the follow context stack is:
528 // what is exact? it seems to only add sets from above on stack
695 /** Push a rule's follow set using our own hardcoded stack */
720 * stack trace. This routine is shared with all recognizers, hence,
729 StackTraceElement[] stack = e.getStackTrace(); local
731 for (i=stack.length-1; i>=0; i--) {
732 StackTraceElement t = stack[i]
[all...] |
| /external/chromium/chrome/browser/sync/glue/ |
| bookmark_model_associator.cc | 7 #include <stack>
356 std::stack<int64> dfs_stack;
370 // Only folder nodes are pushed on to the stack.
496 std::stack<int64> dfs_stack;
531 // Add all children of the current node to the stack.
|
