HomeSort by relevance Sort by last modified time
    Searched refs:stack (Results 526 - 550 of 2132) sorted by null

<<21222324252627282930>>

  /dalvik/dx/src/com/android/dx/ssa/
SsaMethod.java 35 import java.util.Stack;
740 // We push the parent first, then the child on the stack.
741 Stack<SsaBasicBlock> stack = new Stack<SsaBasicBlock>(); local
750 stack.add(null); // Start with null parent.
751 stack.add(rootBlock);
753 while (stack.size() > 0) {
754 SsaBasicBlock cur = stack.pop();
755 SsaBasicBlock parent = stack.pop()
780 Stack<SsaBasicBlock> stack = new Stack<SsaBasicBlock>(); local
    [all...]
  /device/linaro/bootloader/edk2/MdeModulePkg/Universal/DebugSupportDxe/X64/
AsmFuncs.S 38 // The declarations below define the memory region that will be used for the debug stack.
39 // The context record will be built by pushing register values onto this stack.
43 // The stub will switch stacks from the application stack to the debuger stack
46 // Then we building the context record on the stack. Since the stack grows down,
48 // are 336 bytes of stack used prior allocating the 512 bytes of stack to be
53 // We carefully locate the stack to make this happen.
73 # 32K should be enough stack
    [all...]
  /external/fonttools/Lib/fontTools/misc/
plistlib.py 162 self.stack = []
192 if not isinstance(self.stack[-1], type({})):
193 raise ValueError("unexpected element: %r" % self.stack[-1])
194 self.stack[-1][self.current_key] = value
196 elif not self.stack:
200 if not isinstance(self.stack[-1], type([])):
201 raise ValueError("unexpected element: %r" % self.stack[-1])
202 self.stack[-1].append(value)
216 self.stack.append(d)
222 self.stack.pop(
    [all...]
xmlWriter.py 46 self.stack = []
118 self.stack.append(_TAG_)
122 assert self.stack and self.stack[-1] == _TAG_, "nonmatching endtag"
123 del self.stack[-1]
  /external/guava/guava-tests/benchmark/com/google/common/util/concurrent/
ExecutionListBenchmark.java 333 // A version of the execution list that doesn't reverse the stack in execute().
394 // rather than flipping the stack in execute().
463 // A version of the list that uses compare and swap to manage the stack without locks.
472 * bottom of the stack.
526 // Try to make newHead the new head of the stack at runnables.
532 RunnableExecutorPair stack;
534 stack = head;
535 if (stack == null) {
540 } while (!UNSAFE.compareAndSwapObject(this, HEAD_OFFSET, stack, null));
543 while (stack != NULL_PAIR)
    [all...]
  /external/libffi/src/x86/
ffi.c 43 /* ffi_prep_args is called by the assembly routine once stack space
46 unsigned int ffi_prep_args(char *stack, extended_cif *ecif);
47 unsigned int ffi_prep_args(char *stack, extended_cif *ecif)
58 char *argp2 = stack;
63 argp = stack;
202 on top of stack, so that those can be moved to registers by call-handler. */
416 static unsigned int ffi_prep_incoming_args (char *stack, void **ret,
454 * value on the stack; and if the function returns
483 * value on the stack; and if the function returns
507 * value on the stack; and if the function return
    [all...]
  /device/linaro/bootloader/edk2/DuetPkg/BootSector/
efi32.asm 24 .stack
147 push eax ; push memory map location on stack for call to EFILDR...
149 push eax ; push return address (useless, just for stack balance)
161 push 0h ; push error code place holder on the stack
168 push 0h ; push error code place holder on the stack
173 push 0h ; push error code place holder on the stack
178 push 0h ; push error code place holder on the stack
183 push 0h ; push error code place holder on the stack
188 push 0h ; push error code place holder on the stack
193 push 0h ; push error code place holder on the stack
    [all...]
  /external/bcc/tools/
deadlock_detector.py 19 # the cycle of mutexes and the stack traces where each mutex was acquired, and
208 stack = set([thisnode])
209 while stack:
210 node = stack.pop()
213 stack.update(B[node])
234 stack = [(startnode, list(subG.neighbors(startnode)))]
235 while stack:
236 thisnode, nbrs = stack[-1]
244 stack.append((nextnode, list(subG.neighbors(nextnode))))
256 stack.pop(
    [all...]
  /external/libffi/src/metag/
sysv.S 86 ! Return registers from the stack. Reverse SAVE_REGS operation
133 ! Call ffi_prep_args(stack, &ecif)
142 ! The foreign stack should look like this
143 ! XXXXX XXXXXX <--- stack pointer
160 ! A0FrP points to the initial stack without the reserved space for the
161 ! cifs->bytes, whilst A0StP points to the stack after the space allocation
164 ! The stack at this point looks like this:
188 ! The rest of the arguments are stored in stack pointed by A0StP
192 ! Reset stack.
229 ! At this point, the stack pointer points right after the argumen
    [all...]
ffi.c 33 * ffi_prep_args is called by the assembly routine once stack space has been
37 unsigned int ffi_prep_args(char *stack, extended_cif *ecif)
44 argp = stack;
95 padded to an 8 byte boundary to preserve stack alignment */
96 return ALIGN(MIN(stack - argp, 6*4), 8);
127 /* Ensure stack is aligned to an 8-byte boundary */
283 * value on the stack; and if the function returns
294 static void ffi_prep_incoming_args_SYSV(char *stack, void **rvalue,
303 /* stack points to original arguments */
304 argp = stack;
    [all...]
  /external/lua/src/
lstate.c 153 /* initialize stack array */
154 L1->stack = luaM_newvector(L, BASIC_STACK_SIZE, TValue);
157 setnilvalue(L1->stack + i); /* erase new stack */
158 L1->top = L1->stack;
159 L1->stack_last = L1->stack + L1->stacksize - EXTRA_STACK;
172 if (L->stack == NULL)
173 return; /* stack not completely built yet */
177 luaM_freearray(L, L->stack, L->stacksize); /* free stack array *
    [all...]
  /external/python/cpython2/Modules/_ctypes/libffi/src/metag/
sysv.S 86 ! Return registers from the stack. Reverse SAVE_REGS operation
133 ! Call ffi_prep_args(stack, &ecif)
142 ! The foreign stack should look like this
143 ! XXXXX XXXXXX <--- stack pointer
160 ! A0FrP points to the initial stack without the reserved space for the
161 ! cifs->bytes, whilst A0StP points to the stack after the space allocation
164 ! The stack at this point looks like this:
188 ! The rest of the arguments are stored in stack pointed by A0StP
192 ! Reset stack.
229 ! At this point, the stack pointer points right after the argumen
    [all...]
ffi.c 33 * ffi_prep_args is called by the assembly routine once stack space has been
37 unsigned int ffi_prep_args(char *stack, extended_cif *ecif)
44 argp = stack;
95 padded to an 8 byte boundary to preserve stack alignment */
96 return ALIGN(MIN(stack - argp, 6*4), 8);
127 /* Ensure stack is aligned to an 8-byte boundary */
283 * value on the stack; and if the function returns
294 static void ffi_prep_incoming_args_SYSV(char *stack, void **rvalue,
303 /* stack points to original arguments */
304 argp = stack;
    [all...]
  /external/tensorflow/tensorflow/python/framework/
error_interpolation_test.py 35 """Return a copy of an existing stack frame with a new filename."""
53 stack = []
55 stack.append(op._traceback[idx])
56 for idx in range(len(stack), len(stack) + num_user_frames):
57 stack.append(_make_frame_with_filename(op, idx, user_filename % idx))
58 for idx in range(len(stack), len(stack) + num_inner_tf_frames):
59 stack.append(_make_frame_with_filename(op, idx, tf_filename % idx))
60 op._traceback = stack
    [all...]
  /dalvik/dx/src/com/android/dx/cf/code/
BaseMachine.java 123 ExecutionStack stack = frame.getStack(); local
133 args[i] = stack.pop();
152 throw new SimException("at stack depth " + (size - 1 - i) +
547 * onto the stack.
568 ExecutionStack stack = frame.getStack(); local
571 stack.setLocal();
573 stack.push(results[i]);
  /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Foundation/Library/EdkIIGlueLib/Library/BaseLib/Ia32/
Thunk16.asm 35 ; Here is the layout of the real mode stack. _ToUserCode() is responsible for
36 ; loading all these registers from real mode stack.
81 ; The order of saved registers on the stack matches the order they appears
161 mov ss, esi ; set up 16-bit stack segment
162 xchg sp, bx ; set up 16-bit stack pointer
216 add edi, - (sizeof (IA32_REGS) + 4) ; reserve stack space
217 mov ebx, edi ; ebx <- stack offset
220 add edi, eax ; edi <- linear address of 16-bit stack
224 mov esi, edx ; esi <- 16-bit stack segment
233 sidt fword ptr [esp + 36] ; save IDT stack in argument space
    [all...]
  /external/google-breakpad/src/processor/
stackwalker_selftest.cc 31 // running process' stack as test data, if running on an x86 or ppc and
37 // - stack frame reuse. The Recursor function here calls itself with
42 // caller frame in the stack than its caller.
127 // end of a stack when it tries to dereference a null or low pointer
149 // on the stack (provided frame pointers are not being omitted.) Because
165 // The CALL instruction places a 4-byte return address on the stack above
167 // on the stack as well, for another 4 bytes, before storing %esp in %ebp.
181 // stack, where it was placed by the call instruction that called GetEIP.
204 // is the stack pointer on ppc. Because it's implemented as a function,
205 // %r1 itself contains GetSP's own stack pointer and not the caller's stac
346 CallStack stack; local
    [all...]
  /external/libffi/src/m68k/
ffi.c 27 void *ffi_prep_args (void *stack, extended_cif *ecif);
33 /* ffi_prep_args is called by the assembly routine once stack space has
37 ffi_prep_args (void *stack, extended_cif *ecif)
45 argp = stack;
253 ffi_prep_incoming_args_SYSV (char *stack, void **avalue, ffi_cif *cif)
260 argp = stack;
  /external/libffi/src/vax/
elfbsd.S 48 # Allocate stack space for the args
61 pushl %r0 # argument stack usage
144 # Allocate room on stack for return value
148 pushal 4(%ap) # calling stack
190 pushal 4(%ap) # calling stack
  /external/libffi/src/xtensa/
ffi.c 34 | caller stack frame for registers a0-a3 |
43 The area below the entry line becomes the new stack frame for the function.
89 /* Round the stack up to a full 4 register frame, just in case
97 void ffi_prep_args(extended_cif *ecif, unsigned char* stack)
117 FFI_ASSERT (((unsigned long) stack & 0x7) == 0);
120 addr = (unsigned long*)stack;
170 offs = (unsigned long) addr - (unsigned long) stack;
176 addr = (unsigned long*) (stack + FFI_REGISTER_NARGS * 4);
235 /* copye trampoline to stack and patch 'ffi_closure_SYSV' pointer */
  /external/python/cpython2/Lib/idlelib/
StackViewer.py 24 self.stack = self.get_stack(tb)
30 stack = []
34 stack.append((tb.tb_frame, tb.tb_lineno))
36 return stack
53 for info in self.stack:
137 # inject stack trace to sys
  /external/python/cpython2/Modules/_ctypes/libffi/src/m68k/
ffi.c 27 void *ffi_prep_args (void *stack, extended_cif *ecif);
33 /* ffi_prep_args is called by the assembly routine once stack space has
37 ffi_prep_args (void *stack, extended_cif *ecif)
45 argp = stack;
253 ffi_prep_incoming_args_SYSV (char *stack, void **avalue, ffi_cif *cif)
260 argp = stack;
  /external/python/cpython2/Modules/_ctypes/libffi/src/vax/
elfbsd.S 48 # Allocate stack space for the args
61 pushl %r0 # argument stack usage
144 # Allocate room on stack for return value
148 pushal 4(%ap) # calling stack
190 pushal 4(%ap) # calling stack
  /external/python/cpython2/Modules/_ctypes/libffi/src/xtensa/
ffi.c 34 | caller stack frame for registers a0-a3 |
43 The area below the entry line becomes the new stack frame for the function.
89 /* Round the stack up to a full 4 register frame, just in case
97 void ffi_prep_args(extended_cif *ecif, unsigned char* stack)
117 FFI_ASSERT (((unsigned long) stack & 0x7) == 0);
120 addr = (unsigned long*)stack;
170 offs = (unsigned long) addr - (unsigned long) stack;
176 addr = (unsigned long*) (stack + FFI_REGISTER_NARGS * 4);
235 /* copye trampoline to stack and patch 'ffi_closure_SYSV' pointer */
  /external/python/cpython3/Lib/idlelib/
stackviewer.py 25 self.stack = self.get_stack(tb)
31 stack = []
35 stack.append((tb.tb_frame, tb.tb_lineno))
37 return stack
54 for info in self.stack:
138 # inject stack trace to sys

Completed in 2093 milliseconds

<<21222324252627282930>>