HomeSort by relevance Sort by last modified time
    Searched refs:stack (Results 1101 - 1125 of 3511) sorted by null

<<41424344454647484950>>

  /external/libxml2/os400/iconv/bldcsndfa/
bldcsndfa.c 99 t_state * s_stack; /* Unprocessed DFA states stack. */
1295 t_state * stack; local
1432 t_state * stack; local
    [all...]
  /external/libvpx/libvpx/third_party/x86inc/
x86inc.asm 193 ; into registers at the start, and make no other use of the stack. Luckily that
197 ; %1 = number of arguments. loads them from stack if needed.
200 ; %4 = (optional) stack size to be allocated. The stack will be aligned before
201 ; allocating the specified stack size. If the required stack alignment is
202 ; larger than the known stack alignment the stack will be manually aligned
203 ; and an extra register will be allocated to hold the original stack
205 ; register as stack pointer, request a negative stack size
    [all...]
  /prebuilts/gdb/darwin-x86/lib/python2.7/
pdb.py 100 self.commands_silent = {} # for each bp num, tells if the stack trace
113 self.stack = []
119 self.stack, self.curindex = self.get_stack(f, t)
120 self.curframe = self.stack[self.curindex][0]
177 self.print_stack_entry(self.stack[self.curindex])
209 self.print_stack_entry(self.stack[self.curindex])
639 self.curframe = self.stack[self.curindex][0]
641 self.print_stack_entry(self.stack[self.curindex])
646 if self.curindex + 1 == len(self.stack):
650 self.curframe = self.stack[self.curindex][0
    [all...]
gettext.py 110 stack = ['']
113 stack.append('')
115 if len(stack) == 1:
120 s = expr.sub(repl, stack.pop())
121 stack[-1] += '(%s)' % s
123 stack[-1] += c
124 plural = expr.sub(repl, stack.pop())
  /prebuilts/gdb/linux-x86/lib/python2.7/
pdb.py 100 self.commands_silent = {} # for each bp num, tells if the stack trace
113 self.stack = []
119 self.stack, self.curindex = self.get_stack(f, t)
120 self.curframe = self.stack[self.curindex][0]
177 self.print_stack_entry(self.stack[self.curindex])
209 self.print_stack_entry(self.stack[self.curindex])
639 self.curframe = self.stack[self.curindex][0]
641 self.print_stack_entry(self.stack[self.curindex])
646 if self.curindex + 1 == len(self.stack):
650 self.curframe = self.stack[self.curindex][0
    [all...]
gettext.py 110 stack = ['']
113 stack.append('')
115 if len(stack) == 1:
120 s = expr.sub(repl, stack.pop())
121 stack[-1] += '(%s)' % s
123 stack[-1] += c
124 plural = expr.sub(repl, stack.pop())
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
pdb.py 100 self.commands_silent = {} # for each bp num, tells if the stack trace
113 self.stack = []
119 self.stack, self.curindex = self.get_stack(f, t)
120 self.curframe = self.stack[self.curindex][0]
177 self.print_stack_entry(self.stack[self.curindex])
209 self.print_stack_entry(self.stack[self.curindex])
639 self.curframe = self.stack[self.curindex][0]
641 self.print_stack_entry(self.stack[self.curindex])
646 if self.curindex + 1 == len(self.stack):
650 self.curframe = self.stack[self.curindex][0
    [all...]
gettext.py 110 stack = ['']
113 stack.append('')
115 if len(stack) == 1:
120 s = expr.sub(repl, stack.pop())
121 stack[-1] += '(%s)' % s
123 stack[-1] += c
124 plural = expr.sub(repl, stack.pop())
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
pdb.py 100 self.commands_silent = {} # for each bp num, tells if the stack trace
113 self.stack = []
119 self.stack, self.curindex = self.get_stack(f, t)
120 self.curframe = self.stack[self.curindex][0]
177 self.print_stack_entry(self.stack[self.curindex])
209 self.print_stack_entry(self.stack[self.curindex])
639 self.curframe = self.stack[self.curindex][0]
641 self.print_stack_entry(self.stack[self.curindex])
646 if self.curindex + 1 == len(self.stack):
650 self.curframe = self.stack[self.curindex][0
    [all...]
gettext.py 110 stack = ['']
113 stack.append('')
115 if len(stack) == 1:
120 s = expr.sub(repl, stack.pop())
121 stack[-1] += '(%s)' % s
123 stack[-1] += c
124 plural = expr.sub(repl, stack.pop())
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/LinearMath/
btConvexHullComputer.cpp 825 bool shiftFace(Face* face, btScalar amount, btAlignedObjectArray<Vertex*> stack);
2095 btAlignedObjectArray<Vertex*> stack; local
    [all...]
  /external/libunwind/doc/
libunwind-ia64.tex 43 \Prog{libunwind} depends on the type of stack frame that a cursor
77 explicitly (e.g., if a memory stack frame is 16 bytes in size, the
78 previous stack-pointer value can be calculated simply as
79 \texttt{sp+16}, so there is no need to save the stack-pointer
81 identifies a stack frame. The IA-64 architecture defines two stacks
82 (a memory and a register stack). Including the instruction-pointer
86 ``program counter'') of the current stack frame. Given this value,
93 stack-frame of a signal-handler trampoline.
94 \item[\Const{UNW\_IA64\_SP}:] Contains the (memory) stack-pointer
167 the register-stack configuration register
    [all...]
libunwind.tex 66 \Prog{Libunwind} is very easy to use when unwinding a stack from
68 you want to unwind the stack while executing in some function
73 to the current frame, that is, the stack frame that corresponds to the
75 be moved ``up'' (towards earlier stack frames) by calling
84 ``down'' direction (towards newer stack frames), this effect can be
86 that sometimes has to move ``down'' by one stack frame could maintain
98 registers that were preserved for the current stack frame (as
108 \emph{caller-saved} (``scratch'') registers are preserved in the stack
113 (IP), sometimes also known as the ``program counter'', and the stack
120 execution at an arbitrary stack frame. As you might guess, this i
    [all...]
  /external/mesa3d/src/mesa/program/
register_allocate.c 40 * pushed on a stack and removed (with its edges) from the graph.
44 * stack, their edges restored, and assigned a color different from
45 * their neighbors. Because they were pushed on the stack only when
132 * Set when the node is in the trivially colorable stack. When
153 unsigned int *stack; member in struct:ra_graph
314 g->stack = rzalloc_array(g, unsigned int, count);
364 * trivially-colorable nodes into a stack of nodes to be colored,
385 g->stack[g->stack_count] = i;
402 * Pops nodes from the stack back into the graph, coloring them with
415 int n = g->stack[g->stack_count - 1]
    [all...]
  /external/mockito/cglib-and-asm/src/org/mockito/asm/util/
ASMifierMethodVisitor.java 96 final Object[] stack)
103 declareFrameTypes(nStack, stack);
112 appendFrameTypes(nStack, stack);
132 declareFrameTypes(1, stack);
134 appendFrameTypes(1, stack);
  /external/selinux/libsepol/cil/src/
cil_policy.c 646 char *stack[COND_EXPR_MAXDEPTH] = {}; local
657 rc = cil_expr_to_string(curr->data, &stack[pos]);
664 stack[pos] = curr->data;
668 stack[pos] = ((struct cil_symtab_datum *)curr->data)->name;
718 len = strlen(stack[pos-1]) + strlen(op_str) + 4;
720 snprintf(expr_str, len, "(%s %s)", op_str, stack[pos-1]);
721 free(stack[pos-1]);
722 stack[pos-1] = NULL;
729 len = strlen(stack[pos-1]) + strlen(stack[pos-2]) + strlen(op_str) + 5
    [all...]
  /cts/libs/deviceutil/src/android/cts/util/
MediaUtils.java 81 StackTraceElement[] stack = entry.getValue(); local
82 for (int index = 0; index < stack.length; ++index) {
84 String methodName = stack[index].getMethodName();
93 clazz = Class.forName(stack[index].getClassName());
113 // even if we cannot verify the method signature, there are signals in the stack
117 while (index + depth < stack.length
118 && stack[index + depth].getMethodName().equals("invoke")
119 && stack[index + depth].getClassName().equals(
126 if (index + depth < stack.length) {
127 if (stack[index + depth].getClassName().startsWith("android.test."))
    [all...]
  /frameworks/base/packages/DocumentsUI/src/com/android/documentsui/
BaseActivity.java 138 (Spinner) findViewById(R.id.stack),
245 if (root.equals(getCurrentRoot()) && mState.stack.size() == 1) {
368 final int anim = (mState.hasLocationChanged() && mState.stack.size() > 1)
583 if (mState.stack.root != null) {
584 return mState.stack.root;
591 return mState.stack.peek();
605 // While action bar is expanded, the state stack UI is hidden.
622 public void onStackPicked(DocumentStack stack) {
624 // Update the restored stack to ensure we have freshest data
625 stack.updateDocuments(getContentResolver())
    [all...]
  /art/runtime/arch/mips64/
quick_entrypoints_mips64.S 60 sd $t8, 136($sp) # t8 holds caller's gp, now save it to the stack.
93 sd $t1, 0($sp) # Place ArtMethod* at bottom of stack.
117 sd $t8, 56($sp) # t8 holds caller's gp, now save it to the stack.
135 sd $t1, 0($sp) # Place Method* at bottom of stack.
188 // This assumes the top part of these stack frame types are identical.
204 sd $t8, 184($sp) # t8 holds caller's gp, now save it to the stack.
257 sd $t1, 0($sp) # Place Method* at bottom of stack.
263 sd $a0, 0($sp) # Place Method* at bottom of stack.
361 * On stack replacement stub.
363 * a0 = stack to cop
    [all...]
  /external/compiler-rt/lib/lsan/
lsan_common.cc 175 ScanRangeForPointers(begin, end, frontier, "FAKE STACK", kReachable);
202 // If unable to get SP, consider the entire stack to be reachable.
211 LOG_THREADS("Stack at %p-%p (SP = %p).\n", stack_begin, stack_end, sp);
213 // SP is outside the recorded stack range (e.g. the thread is running a
214 // signal handler on alternate stack). Again, consider the entire stack
216 LOG_THREADS("WARNING: stack pointer not in stack range.\n");
218 // Shrink the stack range to ignore out-of-scope values.
221 ScanRangeForPointers(stack_begin, stack_end, frontier, "STACK",
361 StackTrace stack = StackDepotGet(m.stack_trace_id()); local
485 StackTrace stack = StackDepotGet(stack_trace_id); local
    [all...]
  /external/opencv3/3rdparty/jinja2/
lexer.py 607 stack = ['root']
610 stack.append(state + '_begin')
613 statetokens = self.rules[stack[-1]]
699 stack.pop()
704 stack.append(key)
713 stack.append(new_state)
714 statetokens = self.rules[stack[-1]]
715 # we are still at the same position and no stack change.
720 'stack change' % regex)
  /frameworks/support/v7/recyclerview/src/android/support/v7/util/
DiffUtil.java 114 // instead of a recursive implementation, we keep our own stack to avoid potential stack
116 final List<Range> stack = new ArrayList<>(); local
118 stack.add(new Range(0, oldSize, 0, newSize));
129 while (!stack.isEmpty()) {
130 final Range range = stack.remove(stack.size() - 1);
158 stack.add(left);
175 stack.add(right);
    [all...]
  /hardware/qcom/display/msm8996/sdm/libs/core/fb/
hw_primary.cpp 375 LayerStack *stack = hw_layer_info.stack; local
398 if (stack->output_buffer && hw_resource_.has_concurrent_writeback) {
399 LayerBuffer *output_buffer = stack->output_buffer;
411 mdp_commit.flags |= (stack->flags.post_processed_output) ? MDP_COMMIT_CWB_DSPP : 0;
416 stack->flags.post_processed_output);
424 LayerBuffer *output_buffer = hw_layers->info.stack->output_buffer;
  /hardware/qcom/display/msmcobalt/sdm/libs/core/fb/
hw_primary.cpp 358 LayerStack *stack = hw_layer_info.stack; local
381 if (stack->output_buffer && hw_resource_.has_concurrent_writeback) {
382 LayerBuffer *output_buffer = stack->output_buffer;
394 mdp_commit.flags |= (stack->flags.post_processed_output) ? MDP_COMMIT_CWB_DSPP : 0;
399 stack->flags.post_processed_output);
411 LayerBuffer *output_buffer = hw_layers->info.stack->output_buffer;
  /external/fonttools/Lib/fontTools/misc/
psCharStrings.py 540 stack = self.operandStack[:]
542 return stack
975 stack = self.operandStack
976 stack[-1], stack[-2] = stack[-2], stack[-1]
988 # We must add a parameter to the stack if we are flexing
995 # We must add a parameter to the stack if we are flexing
1101 self.stack = [
    [all...]

Completed in 1222 milliseconds

<<41424344454647484950>>