| /external/chromium-trace/catapult/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
190 print 'Line #%d: stack %r' % (token.line_number, stack)
251 if stack and stack[-1].token.string == '?'
[all...] |
| /external/eigen/Eigen/src/OrderingMethods/ |
| Amd.h | 60 Index cs_tdfs(Index j, Index k, Index *head, const Index *next, Index *post, Index *stack)
63 if(!head || !next || !post || !stack) return (-1); /* check inputs */
64 stack[0] = j; /* place j on the stack */
65 while (top >= 0) /* while (stack is not empty) */
67 p = stack[top]; /* p = top of stack */
77 stack[++top] = i; /* start dfs on child node i */
|
| /external/fonttools/Lib/fontTools/misc/ |
| psOperators.py | 235 if len(self.stack) < 2:
236 raise RuntimeError('stack underflow')
243 if not self.stack:
244 raise RuntimeError('stack underflow')
245 self.push(self.stack[-1])
255 self.push(ps_integer(len(self.stack)))
471 self.push(self.stack[-1-n])
|
| /external/google-breakpad/src/client/linux/handler/ |
| exception_handler.cc | 39 // SignalHandler (uses a global stack of ExceptionHandler objects to find
128 // InstallAlternateStackLocked will store the newly installed stack in new_stack
129 // and (if it exists) the previously installed stack in old_stack.
134 // Create an alternative stack to run the signal handlers on. This is done since
135 // the signal might have been caused by a stack overflow.
145 // the alternative stack. Ensure that the size of the alternative stack is
149 // Only set an alternative stack if there isn't already one, or if the current
173 // Only restore the old_stack if the current alternative stack is the one
209 // The global exception handler stack. This is needed because there may exis
475 uint8_t* stack = reinterpret_cast<uint8_t*>(allocator.Alloc(kChildStackSize)); local
[all...] |
| /external/mockito/cglib-and-asm/src/org/mockito/asm/util/ |
| CheckMethodAdapter.java | 360 final Object[] stack)
408 if (nStack > 0 && (stack == null || stack.length < nStack)) {
409 throw new IllegalArgumentException("Array stack[] is shorter than nStack");
412 checkFrameValue(stack[i]);
415 mv.visitFrame(type, nLocal, local, nStack, stack);
639 checkUnsignedShort(maxStack, "Invalid max stack");
680 * Checks a stack frame value.
693 checkInternalName((String) value, "Invalid stack frame value");
697 throw new IllegalArgumentException("Invalid stack frame value: "
[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/v8/tools/profviz/ |
| composer.js | 37 var kStackFrames = 8; // Stack frames to display in the plot.
40 var kExecutionFrameWidth = 0.2; // Width of the top stack frame line.
41 var kStackFrameWidth = 0.1; // Width of the lower stack frame lines.
42 var kGapWidth = 0.05; // Gap between stack frame lines.
44 var kY1Offset = 11; // Offset for stack frame vs. event lines.
158 error_output(error.stack);
252 "inconsistent event stack");
297 pc, timer, unused_x, unused_y, vmstate, stack) {
304 if (!stack[i]) break;
305 var entry = code_map.findEntry(stack[i])
[all...] |
| /external/valgrind/coregrind/m_syswrap/ |
| syswrap-arm64-linux.c | 58 /* Call f(arg1), but first switch stacks, using 'stack' as the new
59 stack, and use 'retaddr' as f's return-to address. Also, clear all
62 void ML_(call_on_new_stack_0_1) ( Addr stack,
66 // r0 = stack
74 " mov sp, x0\n\t" /* Stack pointer */
153 // set up child stack, temporarily preserving fn and arg
154 " sub x1, x1, #16\n" // make space on stack
201 1. allocate a ThreadId+ThreadState+stack for the thread
206 but using the scheduler entrypoint for IP, and a separate stack
219 UWord* stack; local
[all...] |
| /frameworks/support/documents-archive/src/android/support/provider/ |
| DocumentArchive.java | 54 import java.util.Stack;
115 final Stack<ZipEntry> stack = new Stack<>(); local
129 stack.push(entry);
137 while (stack.size() > 0) {
138 entry = stack.pop();
151 // fake ZipEntry and add it on top of the stack to process it next.
156 stack.push(parentEntry);
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/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/google-breakpad/src/client/linux/minidump_writer/ |
| minidump_writer.cc | 113 // Estimate for how big each thread's stack will be (in bytes).
115 // Number of threads whose stack size we don't want to limit. These base
120 // Maximum stack size to dump for any extra thread (in bytes).
123 // (exclude the stack data).
263 const void* stack; local
265 if (dumper_->GetStackInfo(&stack, &stack_len, stack_pointer)) {
274 dumper_->CopyFromProcess(*stack_copy, thread->thread_id, stack,
277 thread->stack.start_of_memory_range =
278 reinterpret_cast<uintptr_t>(stack);
279 thread->stack.memory = memory.location()
[all...] |
| /toolchain/binutils/binutils-2.25/libiberty/ |
| regex.c | 355 /* Define how to allocate the failure stack. */
2131 compile_stack_elt_t *stack; member in struct:__anon75864
[all...] |
| /external/guice/extensions/persist/lib/ |
| easymock.jar | |
| /external/guice/lib/build/ |
| easymock.jar | |
| /external/v8/src/js/ |
| messages.js | 608 // Format the stack trace if not yet done, and return it.
609 // Cache the formatted stack trace on the holder.
617 // No formatted stack trace available.
620 // Neither formatted nor structured stack trace available.
635 // If the receiver equals the holder, set the formatted stack trace that the
645 // Use a dummy function since we do not actually want to capture a stack trace
729 // Boilerplate for exceptions for stack overflows. Used from
732 utils.InstallGetterSetter(StackOverflowBoilerplate, 'stack',
738 %object_define_property(obj, 'stack', { get: StackTraceGetter,
|
| /external/v8/tools/ |
| profile.js | 88 * during stack strace processing, specifies a position of the frame
233 * Records a tick event. Stack must contain a sequence of
236 * @param {Array<number>} stack Stack sample.
238 Profile.prototype.recordTick = function(stack) {
239 var processedStack = this.resolveAndFilterFuncs_(stack);
250 * @param {Array<number>} stack Stack sample.
252 Profile.prototype.resolveAndFilterFuncs_ = function(stack) {
256 for (var i = 0; i < stack.length; ++i)
[all...] |
| /prebuilts/tools/common/m2/repository/org/easymock/easymock/2.4/ |
| easymock-2.4.jar | |
| /external/google-breakpad/src/processor/ |
| stackwalk_common.cc | 31 // executables to print the content of dumps (w/ stack traces) on the console.
114 // PrintStackContents prints the stack contents of the current frame to stdout.
122 // Find stack range.
173 // Print stack contents.
200 // Try to find instruction pointers from stack.
206 // Read a word (possible instruction pointer) from stack.
243 // PrintStack prints the call stack in |stack| to stdout, in a reasonably
250 // If |cpu| is a recognized CPU name, relevant register state for each stack
252 static void PrintStack(const CallStack *stack,
[all...] |
| /external/opencv3/modules/imgproc/src/ |
| approx.cpp | 483 stack = *_stack; \
486 stack[top++] = slice
507 Range* stack = *_stack; local
564 // 2. initialize the stack
580 slice = stack[--top];
709 cv::AutoBuffer<cv::Range> stack(100);
792 nout = cv::approxPolyDP_(src, npoints, dst, closed, parameter, &stack);
795 (cv::Point2f*)dst, closed, parameter, &stack);
|
| /frameworks/base/packages/SystemUI/src/com/android/systemui/recents/views/ |
| RecentsView.java | 175 // Update the stack
195 * Called from RecentsActivity when the task stack is updated.
197 public void updateStack(TaskStack stack, boolean setStackViewTasks) {
198 mStack = stack;
200 mTaskStackView.setTasks(stack, true /* allowNotifyStackChanges */);
204 if (stack.getTaskCount() > 0) {
226 * Returns whether the last task launched was in the freeform stack or not.
232 /** Launches the focused task from the first stack if possible */
254 TaskStack stack = mTaskStackView.getStack(); local
255 Task task = stack.getLaunchTarget()
[all...] |
| /prebuilts/gdb/darwin-x86/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
|
| /prebuilts/gdb/linux-x86/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
|
| /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
|
| /prebuilts/python/linux-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/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/BroadphaseCollision/ |
| btDbvt.cpp | 595 btAlignedObjectArray<sStkCLN> stack; local
596 stack.reserve(m_leaves);
597 stack.push_back(sStkCLN(m_root,0));
599 const int i=stack.size()-1;
600 const sStkCLN e=stack[i];
602 stack.pop_back();
609 stack.push_back(sStkCLN(e.node->childs[0],n));
610 stack.push_back(sStkCLN(e.node->childs[1],n));
616 } while(stack.size()>0);
[all...] |
