| /packages/apps/UnifiedEmail/src/com/google/android/mail/common/html/parser/ |
| HtmlTree.java | 29 import java.util.Stack;
104 private final Stack<Integer> begins = new Stack<Integer>();
105 private final Stack<Integer> ends = new Stack<Integer>();
264 int stack = 0; local
275 stack++;
281 if (stack == 0) {
284 stack--;
289 if (stack == 0 && sb.length() >= chunkSize)
940 private Stack<Integer> stack; typedefs
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| plistlib.py | 155 self.stack = []
160 self.stack.append(element)
166 assert self.stack.pop() == element
396 self.stack = []
425 self.stack[-1][self.currentKey] = value
427 elif not self.stack:
431 self.stack[-1].append(value)
447 self.stack.append(d)
449 self.stack.pop()
457 self.stack.append(a
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| plistlib.py | 155 self.stack = []
160 self.stack.append(element)
166 assert self.stack.pop() == element
396 self.stack = []
425 self.stack[-1][self.currentKey] = value
427 elif not self.stack:
431 self.stack[-1].append(value)
447 self.stack.append(d)
449 self.stack.pop()
457 self.stack.append(a
[all...] |
| /external/compiler-rt/lib/asan/tests/ |
| asan_noinst_test.cc | 261 StackTrace stack; local
262 stack.trace[0] = 0x890;
263 stack.size = 1;
266 void *p = __asan::asan_malloc(size, &stack);
267 __asan::asan_free(p, &stack, __asan::FROM_MALLOC);
271 void *p1 = __asan::asan_malloc(size, &stack);
272 __asan::asan_free(p1, &stack, __asan::FROM_MALLOC);
282 StackTrace stack; local
283 stack.trace[0] = 0x890;
284 stack.size = 1
309 StackTrace stack; local
[all...] |
| /external/freetype/src/cff/ |
| cffparse.c | 46 parser->top = parser->stack;
517 FT_Byte** data = parser->stack;
521 if ( parser->top >= parser->stack + 6 )
587 FT_Byte** data = parser->stack;
593 if ( parser->top >= parser->stack + 4 )
616 FT_Byte** data = parser->stack;
622 if ( parser->top >= parser->stack + 2 )
640 FT_Byte** data = parser->stack;
646 if ( parser->top >= parser->stack + 3 )
943 parser->top = parser->stack;
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/idlelib/ |
| Debugger.py | 120 text="Stack", command=self.show_stack, variable=self.vstack)
183 stack, i = self.idb.get_stack(self.frame, tb)
184 sv.load_stack(stack, i)
243 stack, i = self.idb.get_stack(self.frame, None)
244 sv.load_stack(stack, i)
335 self.stack = []
337 def load_stack(self, stack, index=None):
338 self.stack = stack
340 for i in range(len(stack))
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/idlelib/ |
| Debugger.py | 120 text="Stack", command=self.show_stack, variable=self.vstack)
183 stack, i = self.idb.get_stack(self.frame, tb)
184 sv.load_stack(stack, i)
243 stack, i = self.idb.get_stack(self.frame, None)
244 sv.load_stack(stack, i)
335 self.stack = []
337 def load_stack(self, stack, index=None):
338 self.stack = stack
340 for i in range(len(stack))
[all...] |
| /external/libvpx/libvpx/vpx_ports/ |
| x86_abi_support.asm | 164 ; This macro aligns the stack to the given alignment (in bytes). The stack
165 ; is left such that the previous value of the stack pointer is the first
166 ; argument on the stack (ie, the inverse of this macro is 'pop rsp.')
322 ; store registers 6-n on the stack
324 ; Win64 ABI requires 16 byte stack alignment, but then pushes an 8 byte return
325 ; value. Typically we follow this up with 'push rbp' - re-aligning the stack -
384 ; Tell GNU ld that we don't require an executable stack.
386 section .note.GNU-stack noalloc noexec nowrite progbits
389 section .note.GNU-stack noalloc noexec nowrite progbit
[all...] |
| /dalvik/vm/alloc/ |
| CardTable.cpp | 341 * Returns true if the given object has been pushed on the mark stack
346 GcMarkStack *stack = &gDvm.gcHeap->markContext.stack; local
347 for (const Object **ptr = stack->base; ptr < stack->top; ++ptr) {
|
| /dalvik/vm/arch/arm/ |
| CallEABI.S | 19 * argument list has to be pushed onto the native stack according to
70 Stack is "full descending". Only the arguments that don't fit in the first 4
71 registers are placed on the stack. "sp" points at the first stacked argument
105 * L - number of double-words of storage required on stack (0-30 words)
106 * F - pad flag -- if set, write a pad word to the stack
109 * onto the stack. Anything requiring more than that -- which should happen
117 * will not be able to unwind the stack past this method. The only way
119 * The stack unwinder in debuggerd *does* pay attention to fp if we set it
134 * stack looks like:
181 * Make room on the stack for the arguments and copy them over
[all...] |
| /external/bluetooth/bluedroid/bta/ |
| Android.mk | 95 $(LOCAL_PATH)/../stack/include \
96 $(LOCAL_PATH)/../stack/btm \
|
| /external/chromium_org/base/debug/ |
| trace_event_memory.h | 33 typedef int (*StackGeneratorFunction)(int skip_count, void** stack);
86 // A scoped context for memory tracing. Pushes the name onto a stack for
95 // Enables the storing of trace names on a per-thread stack.
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| HeapSnapshotWorkerDispatcher.js | 88 response.errorCallStack = e.stack;
|
| /external/chromium_org/third_party/bintrees/bintrees/ |
| walker.py | 150 stack = self._stack
154 stack.append(node)
162 if len(stack) == 0:
164 node = stack.pop()
|
| /external/chromium_org/third_party/cld/base/ |
| stl_decl_msvc.h | 30 #include <stack>
|
| /external/chromium_org/third_party/mesa/src/src/glx/ |
| indirect_vertex_array_priv.h | 306 struct array_stack_state *stack; member in struct:array_state_vector
|
| /external/chromium_org/third_party/openssl/openssl/crypto/txt_db/ |
| txt_db.h | 66 #include <openssl/stack.h>
|
| /external/chromium_org/third_party/openssl/openssl/include/openssl/ |
| txt_db.h | 66 #include <openssl/stack.h>
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| stacktrace_arm-inl.h | 48 // mode in a fixed location on its stack frame. If the caller is a different
50 // still in the designated register or saved on stack along with other callee
53 // Given a pointer to a stack frame, locate and return the calling
64 // With the stack growing downwards, older stack frame must be
67 // Assume stack frames larger than 100,000 bytes are bogus.
70 // In the non-strict mode, allow discontiguous stack frames.
98 // void** result: the stack-trace, as an array
99 // int* sizes: the size of each stack frame, as an array
102 // int skip_count: how many stack pointers to skip before storing in resul
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| stacktrace_arm-inl.h | 48 // mode in a fixed location on its stack frame. If the caller is a different
50 // still in the designated register or saved on stack along with other callee
53 // Given a pointer to a stack frame, locate and return the calling
64 // With the stack growing downwards, older stack frame must be
67 // Assume stack frames larger than 100,000 bytes are bogus.
70 // In the non-strict mode, allow discontiguous stack frames.
98 // void** result: the stack-trace, as an array
99 // int* sizes: the size of each stack frame, as an array
102 // int skip_count: how many stack pointers to skip before storing in resul
[all...] |
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/pyxelator/ |
| cparse.py | 265 stack = []
266 # read up to identifier, pushing tokens onto stack
267 self.ident = self.parse_identifier(lexer,symbols,stack)
273 self.parse_declarator(lexer,symbols,stack)
276 def parse_identifier(self,lexer,symbols,stack):
282 stack.append( (lexer.tok, lexer.kind) )
286 #stack.append( (ident.name, ident) )
292 def parse_declarator(self,lexer,symbols,stack,level=0):
295 (self,stack)
312 while stack
[all...] |
| /external/chromium_org/v8/src/ |
| hydrogen-range-analysis.cc | 60 ZoneList<Pending> stack(graph()->blocks()->length(), zone());
88 // remaining blocks on the stack (in reverse order).
91 stack.Add(Pending(dominated_blocks->at(i), last_changed_range), zone());
94 } else if (!stack.is_empty()) {
95 // Pop next pending block from stack.
96 Pending pending = stack.RemoveLast();
|
| regexp-stack.h | 36 // Maintains a per-v8thread stack area that can be used by irregexp
37 // implementation for its backtracking stack.
38 // Since there is only one stack area, the Irregexp implementation is not
43 // Create and delete an instance to control the life-time of a growing stack.
45 // Initializes the stack memory area if necessary.
47 ~RegExpStackScope(); // Releases the stack if it has grown.
49 RegExpStack* stack() const { return regexp_stack_; } function in class:v8::internal::RegExpStackScope
60 // Number of allocated locations on the stack below the limit.
61 // No sequence of pushes must be longer that this without doing a stack-limit
65 // Gives the top of the memory used as stack
[all...] |
| sampler.h | 44 // (if used for profiling) the program counter and stack pointer for
50 Address sp; // Stack pointer.
67 Address tos; // Top stack value (*sp).
71 Address stack[kMaxFramesCount]; // Call stack. member in struct:v8::internal::TickSample
90 // Performs stack sampling.
105 // Used in tests to make sure that stack sampling is performed.
131 // Counts stack samples taken in JS VM state.
|
| /external/compiler-rt/lib/asan/ |
| asan_internal.h | 93 void ReadContextStack(void *context, uptr *stack, uptr *ssize);
|
