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

<<21222324252627282930>>

  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/
xmllib.py 144 self.stack = []
235 for t, d, nst in self.stack:
265 if not self.stack and space.match(data) is None:
364 if not self.stack:
420 if self.stack:
422 while self.stack:
423 self.finish_endtag(self.stack[-1][0])
502 if not self.stack:
580 self.__use_namespaces = len(self.stack)+1
607 if self.__seen_starttag and not self.stack:
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/
xmllib.py 144 self.stack = []
235 for t, d, nst in self.stack:
265 if not self.stack and space.match(data) is None:
364 if not self.stack:
420 if self.stack:
422 while self.stack:
423 self.finish_endtag(self.stack[-1][0])
502 if not self.stack:
580 self.__use_namespaces = len(self.stack)+1
607 if self.__seen_starttag and not self.stack:
    [all...]
  /device/linaro/bootloader/edk2/MdePkg/Library/BaseLib/X64/
Thunk16.asm 73 ; The order of saved registers on the stack matches the order they appears
146 SavedSp DQ ? ; restore stack
175 mov ss, esi ; set up 16-bit stack segment
176 mov sp, bx ; set up 16-bit stack pointer
238 push rbx ; Save ds segment register on the stack
240 push rbx ; Save es segment register on the stack
242 push rbx ; Save ss segment register on the stack
250 imul eax, r8d, 16 ; eax <- r8d(stack segment) * 16
251 mov ebx, edi ; ebx <- stack for 16-bit code
253 add edi, eax ; edi <- linear address of 16-bit stack
    [all...]
  /external/python/cpython2/Lib/
xmllib.py 144 self.stack = []
235 for t, d, nst in self.stack:
265 if not self.stack and space.match(data) is None:
364 if not self.stack:
420 if self.stack:
422 while self.stack:
423 self.finish_endtag(self.stack[-1][0])
502 if not self.stack:
580 self.__use_namespaces = len(self.stack)+1
607 if self.__seen_starttag and not self.stack
    [all...]
  /external/python/cpython3/Modules/
_pickle.c 419 /* Internal data type used as the unpickling stack. */
517 "unpickling stack underflow");
522 * must be an lvalue holding PyObject*. On stack underflow, UnpicklingError
546 /* Push an object on stack, transferring its ownership to the stack. */
550 /* Push an object on stack, adding a new reference to the object. */
642 Pdata *stack; /* Pickle data stack, store unpickled objects. */ member in struct:UnpicklerObject
671 Py_ssize_t *marks; /* Mark stack, used for unpickling container
673 Py_ssize_t num_marks; /* Number of marks in the mark stack. *
    [all...]
  /external/v8/src/objects/
module.cc 459 ZoneForwardList<Handle<Module>> stack(&zone);
461 if (!FinishInstantiate(isolate, module, &stack, &dfs_index, &zone)) {
462 for (auto& descendant : stack) {
470 DCHECK(stack.empty());
556 ZoneForwardList<Handle<Module>>* stack,
560 // {module} is on the {stack}.
561 std::count_if(stack->begin(), stack->end(),
568 ancestor = stack->front();
569 stack->pop_front()
    [all...]
  /art/runtime/interpreter/mterp/x86/
floating_point.S 180 fldl VREG_ADDRESS(rINST) # vB to fp stack
182 fldl VREG_ADDRESS(%ecx) # vA to fp stack
197 flds VREG_ADDRESS(%ecx) # vBB to fp stack
198 flds VREG_ADDRESS(%eax) # vCC to fp stack
213 flds VREG_ADDRESS(rINST) # vB to fp stack
215 flds VREG_ADDRESS(%ecx) # vA to fp stack
  /art/runtime/interpreter/mterp/x86_64/
floating_point.S 180 fldl VREG_ADDRESS(rINSTq) # vB to fp stack
182 fldl VREG_ADDRESS(%rcx) # vA to fp stack
197 flds VREG_ADDRESS(%rcx) # vBB to fp stack
198 flds VREG_ADDRESS(%rax) # vCC to fp stack
213 flds VREG_ADDRESS(rINSTq) # vB to fp stack
215 flds VREG_ADDRESS(%rcx) # vA to fp stack
  /device/linaro/bootloader/edk2/MdeModulePkg/Universal/EbcDxe/Ia32/
EbcLowLevel.asm 46 ; specified function. On return, we restore the stack pointer
61 ; Set stack pointer to new value
106 ; The stack is below:
138 ; Construct new stack
175 ; The stack is below:
193 ; Construct new stack
  /external/compiler-rt/lib/lsan/
lsan_common_linux.cc 96 StackTrace stack = map->Get(stack_id); local
98 if (stack.size >= 2)
99 return stack.trace[1];
123 // it as reachable, as we can't properly report its allocation stack anyway.
  /external/deqp-deps/SPIRV-Tools/source/opt/
tree_iterator.h 18 #include <stack>
32 // - Looks at the top of the stack;
36 // stack.
89 // current node into the stack.
115 std::stack<std::pair<NodePtr, NodeIterator>> parent_iterators_;
125 // - Looks at the top of the stack;
127 // current one and we pop the stack;
196 // current node into the stack.
205 // If we visited all children, the current node is the top of the stack.
223 // current node into the stack
    [all...]
  /external/libffi/src/moxie/
ffi.c 32 /* ffi_prep_args is called by the assembly routine once stack space
35 void *ffi_prep_args(char *stack, extended_cif *ecif)
44 argp = stack;
103 return (stack + ((count > 24) ? 24 : ALIGN_DOWN(count, 8)));
167 /* Arguments that don't fit in registers are found on the stack
225 start looking at the those passed on the stack. */
  /external/libunwind/doc/
unw_resume.tex 8 \begin{Name}{3}{unw\_resume}{David Mosberger-Tang}{Programming Library}{unw\_resume}unw\_resume -- resume execution in a particular stack frame
19 The \Func{unw\_resume}() routine resumes execution at the stack frame
24 and then directly resumes execution in the target stack frame. Thus
27 (callee-saved) registers. However, if execution in any of the stack
31 \Func{unw\_resume}() on a cursor which identifies the stack frame of
81 \item[\Const{UNW\_BADFRAME}] The stack frame identified by
  /external/pcre/dist2/src/
pcre2_jit_match.c 56 arguments->stack = &local_stack;
77 jit_stack points to a JIT stack
167 arguments.stack = (struct sljit_stack *)(jit_stack->stack);
  /external/pdfium/core/fpdfapi/parser/
cpdf_object_avail.cpp 68 std::stack<uint32_t> non_parsed_objects_in_root;
77 std::stack<uint32_t> objects_to_check = std::move(non_parsed_objects_);
105 std::stack<uint32_t>* refs) const {
  /external/pdfium/core/fxcrt/xml/
cfx_saxreader.h 11 #include <stack>
157 std::stack<std::unique_ptr<CFX_SAXItem>> m_Stack;
164 std::stack<char> m_SkipStack;
  /external/perfetto/src/protozero/protoc_plugin/
protozero_generator.cc 171 std::vector<const Descriptor*> stack; local
173 stack.push_back(source_->message_type(i));
175 while (!stack.empty()) {
176 const Descriptor* message = stack.back();
177 stack.pop_back();
180 stack.push_back(message->nested_type(i));
208 std::vector<const FileDescriptor*> stack; local
211 stack.push_back(import);
217 while (!stack.empty()) {
218 const FileDescriptor* import = stack.back()
    [all...]
  /external/python/cpython2/Modules/_ctypes/libffi/src/moxie/
ffi.c 32 /* ffi_prep_args is called by the assembly routine once stack space
35 void *ffi_prep_args(char *stack, extended_cif *ecif)
44 argp = stack;
103 return (stack + ((count > 24) ? 24 : ALIGN_DOWN(count, 8)));
167 /* Arguments that don't fit in registers are found on the stack
225 start looking at the those passed on the stack. */
  /external/skia/tools/
CrashHandler.cpp 65 void* stack[kMax]; local
66 const int count = backtrace(stack, kMax);
69 backtrace_symbols_fd(stack, count, 2/*stderr*/);
125 // We need to run SymInitialize before doing any of the stack walking below.
  /external/skqp/tools/
CrashHandler.cpp 65 void* stack[kMax]; local
66 const int count = backtrace(stack, kMax);
69 backtrace_symbols_fd(stack, count, 2/*stderr*/);
125 // We need to run SymInitialize before doing any of the stack walking below.
  /external/swiftshader/third_party/SPIRV-Tools/source/opt/
tree_iterator.h 18 #include <stack>
32 // - Looks at the top of the stack;
36 // stack.
89 // current node into the stack.
115 std::stack<std::pair<NodePtr, NodeIterator>> parent_iterators_;
125 // - Looks at the top of the stack;
127 // current one and we pop the stack;
196 // current node into the stack.
205 // If we visited all children, the current node is the top of the stack.
223 // current node into the stack
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Parser/
parser.c 25 /* STACK DATA TYPE */
27 static void s_reset(stack *);
30 s_reset(stack *s)
38 s_push(register stack *s, dfa *d, node *parent)
42 fprintf(stderr, "s_push: parser stack overflow\n");
55 s_pop(register stack *s)
58 Py_FatalError("s_pop: parser stack underflow -- FATAL");
105 /* PARSER STACK OPERATIONS */
108 shift(register stack *s, int type, char *str, int newstate, int lineno, int col_offset)
120 push(register stack *s, int type, dfa *d, int newstate, int lineno, int col_offset)
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Parser/
parser.c 25 /* STACK DATA TYPE */
27 static void s_reset(stack *);
30 s_reset(stack *s)
38 s_push(register stack *s, dfa *d, node *parent)
42 fprintf(stderr, "s_push: parser stack overflow\n");
55 s_pop(register stack *s)
58 Py_FatalError("s_pop: parser stack underflow -- FATAL");
105 /* PARSER STACK OPERATIONS */
108 shift(register stack *s, int type, char *str, int newstate, int lineno, int col_offset)
120 push(register stack *s, int type, dfa *d, int newstate, int lineno, int col_offset)
    [all...]
  /device/linaro/bootloader/edk2/ArmPlatformPkg/PrePeiCore/Arm/
PrePeiCoreEntryPoint.asm 56 // The stack starts at the top of the stack region. Add '1' to the Core Position to get the top of the stack
  /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Foundation/Library/EdkIIGlueLib/Library/BaseLib/Ia32/
Thunk16.S 96 movl %esi, %ss # set up 16-bit stack segment
97 xchgw %bx, %sp # set up 16-bit stack pointer
140 # @return The address of the 16-bit stack after returning from user code
155 movl %edi, %ebx # ebx <- stack offset
158 addl %eax, %edi # edi <- linear address of 16-bit stack
163 movl %edx, %esi # esi <- 16-bit stack segment

Completed in 1851 milliseconds

<<21222324252627282930>>