| /dalvik/vm/compiler/template/armv5te/ |
| TEMPLATE_INVOKE_METHOD_NO_OPT.S | 12 SAVEAREA_FROM_FP(r1, rFP) @ r1<- stack save area
14 SAVEAREA_FROM_FP(r10, r1) @ r10<- stack save area
17 bxlo lr @ return to raise stack overflow excep.
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 197 /** Structure that represents a Stack collection
201 /** List that supports the stack structure
205 /** Used for quick access to the top of the stack
208 void (*free) (struct ANTLR3_STACK_struct * stack);
209 void * (*pop) (struct ANTLR3_STACK_struct * stack);
210 void * (*get) (struct ANTLR3_STACK_struct * stack, ANTLR3_INTKEY key);
211 ANTLR3_BOOLEAN (*push) (struct ANTLR3_STACK_struct * stack, void * element, void (ANTLR3_CDECL *freeptr)(void *));
212 ANTLR3_UINT32 (*size) (struct ANTLR3_STACK_struct * stack);
213 void * (*peek) (struct ANTLR3_STACK_struct * stack);
425 * as a stack and each time we descend a node to one of its edges w
[all...] |
| /external/skia/include/core/ |
| SkClipStack.h | 19 // stores the stack depth (fSaveCount) and clips (fDeque) separately.
20 // Each clip in fDeque stores the stack state to which it belongs
107 /** The GenID can be used by clip stack clients to cache representations of the clip. The
109 stack not to the element itself. That is the same clip path in different stacks will
163 int fSaveCount; // save count of stack when this element was added.
168 /* fFiniteBoundType and fFiniteBound are used to incrementally update the clip stack's
181 // When element is applied to the previous elements in the stack is the result known to be
242 stack */
290 * clip-stack. If false is returned then the rect does not intersect the
356 Iter(const SkClipStack& stack, IterStart startLoc)
[all...] |
| /external/speex/libspeex/ |
| filters_bfin.h | 85 void filter_mem16(const spx_word16_t *_x, const spx_coef_t *num, const spx_coef_t *den, spx_word16_t *_y, int N, int ord, spx_mem_t *mem, char *stack)
230 void iir_mem16(const spx_word16_t *_x, const spx_coef_t *den, spx_word16_t *_y, int N, int ord, spx_mem_t *mem, char *stack)
355 void fir_mem16(const spx_word16_t *x, const spx_coef_t *num, spx_word16_t *y, int N, int ord, spx_mem_t *mem, char *stack)
363 filter_mem16(x, num, den, y, N, ord, mem, stack);
368 void compute_impulse_response(const spx_coef_t *ak, const spx_coef_t *awk1, const spx_coef_t *awk2, spx_word16_t *y, int N, int ord, char *stack)
438 void compute_impulse_response(const spx_coef_t *ak, const spx_coef_t *awk1, const spx_coef_t *awk2, spx_word16_t *y, int N, int ord, char *stack)
|
| /external/stlport/test/unit/ |
| mvctor_declaration_test.cpp | 23 #include <stack>
272 //stack:
273 CPPUNIT_ASSERT( is_movable(stack<char>()) );
274 CPPUNIT_ASSERT( is_movable(stack<specially_allocated_struct>()) );
276 CPPUNIT_ASSERT( is_move_complete(stack<char>()) );
277 CPPUNIT_ASSERT( !is_move_complete(stack<specially_allocated_struct>()) );
279 CPPUNIT_ASSERT( !is_move_complete(stack<char>()) );
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| mvctor_declaration_test.cpp | 23 #include <stack>
272 //stack:
273 CPPUNIT_ASSERT( is_movable(stack<char>()) );
274 CPPUNIT_ASSERT( is_movable(stack<specially_allocated_struct>()) );
276 CPPUNIT_ASSERT( is_move_complete(stack<char>()) );
277 CPPUNIT_ASSERT( !is_move_complete(stack<specially_allocated_struct>()) );
279 CPPUNIT_ASSERT( !is_move_complete(stack<char>()) );
|
| /ndk/tests/device/test-stlport/unit/ |
| mvctor_declaration_test.cpp | 23 #include <stack>
272 //stack:
273 CPPUNIT_ASSERT( is_movable(stack<char>()) );
274 CPPUNIT_ASSERT( is_movable(stack<specially_allocated_struct>()) );
276 CPPUNIT_ASSERT( is_move_complete(stack<char>()) );
277 CPPUNIT_ASSERT( !is_move_complete(stack<specially_allocated_struct>()) );
279 CPPUNIT_ASSERT( !is_move_complete(stack<char>()) );
|
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/scene/ |
| ViewHierarchyLoader.java | 34 import java.util.Stack;
64 Stack<ViewNode> stack = new Stack<ViewNode>(); local
77 stack.push(lastNode);
78 } else if (!stack.isEmpty()) {
81 stack.pop();
102 if (!stack.isEmpty()) {
103 final ViewNode parent = stack.peek();
|
| /external/bluetooth/bluedroid/main/ |
| Android.mk | 83 $(LOCAL_PATH)/../stack/include \
84 $(LOCAL_PATH)/../stack/l2cap \
85 $(LOCAL_PATH)/../stack/a2dp \
86 $(LOCAL_PATH)/../stack/btm \
87 $(LOCAL_PATH)/../stack/avdt \
|
| /external/zlib/src/examples/ |
| gun.c | 215 unsigned stack; /* next position for reversed string */ local
264 stack = 0;
324 match[stack++] = (unsigned char)final;
329 p = match + stack;
334 stack = p - match;
335 match[stack++] = (unsigned char)code;
349 while (stack > SIZE - outcnt) {
351 outbuf[outcnt++] = match[--stack];
358 p = match + stack;
362 stack = 0
[all...] |
| /external/libvpx/libvpx/vpx_ports/ |
| x86_abi_support.asm | 153 ; This macro aligns the stack to the given alignment (in bytes). The stack
154 ; is left such that the previous value of the stack pointer is the first
155 ; argument on the stack (ie, the inverse of this macro is 'pop rsp.')
305 ; store registers 6-n on the stack
307 ; Win64 ABI requires 16 byte stack alignment, but then pushes an 8 byte return
308 ; value. Typically we follow this up with 'push rbp' - re-aligning the stack -
367 ; Tell GNU ld that we don't require an executable stack.
369 section .note.GNU-stack noalloc noexec nowrite progbits
372 section .note.GNU-stack noalloc noexec nowrite progbit
[all...] |
| /external/v8/tools/ |
| logreader.js | 91 * Processes stack record.
95 * @param {Array.<string>} stack String representation of a stack.
96 * @return {Array.<number>} Processed stack.
98 LogReader.prototype.processStack = function(pc, func, stack) {
101 for (var i = 0, n = stack.length; i < n; ++i) {
102 var frame = stack[i];
|
| /external/valgrind/main/memcheck/tests/ |
| addressable.stderr.exp | 14 Address 0x........ is not stack'd, malloc'd or (recently) free'd
19 Address 0x........ is not stack'd, malloc'd or (recently) free'd
26 If you believe this happened as a result of a stack
29 main thread stack using the --main-stacksize= flag.
30 The main thread stack size used in this run was ....
66 Address 0x........ is not stack'd, malloc'd or (recently) free'd
71 Address 0x........ is not stack'd, malloc'd or (recently) free'd
|
| /external/libffi/src/x86/ |
| ffi.c | 38 /* ffi_prep_args is called by the assembly routine once stack space
41 void ffi_prep_args(char *stack, extended_cif *ecif)
48 argp = stack;
231 static void ffi_prep_incoming_args_SYSV (char *stack, void **ret,
261 * value on the stack; and if the function returns
273 ffi_prep_incoming_args_SYSV(char *stack, void **rvalue, void **avalue,
281 argp = stack;
414 ffi_prep_args_raw(char *stack, extended_cif *ecif)
416 memcpy (stack, ecif->avalue, ecif->cif->bytes);
|
| /frameworks/base/services/java/com/android/server/am/ |
| ActivityRecord.java | 54 * An entry in the history stack, representing an activity.
58 final ActivityStack stack; // owner field in class:ActivityRecord
132 private boolean inHistory; // are we in the history stack?
335 stack = _stack;
584 // stack.
586 && stack.topRunningActivityLocked(null) == this))
730 Message msg = stack.mHandler.obtainMessage(ActivityStack.LAUNCH_TICK_MSG);
732 stack.mHandler.removeMessages(ActivityStack.LAUNCH_TICK_MSG);
733 stack.mHandler.sendMessageDelayed(msg, ActivityStack.LAUNCH_TICK);
741 stack.mHandler.removeMessages(ActivityStack.LAUNCH_TICK_MSG)
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaMethod.java | 36 import java.util.Stack;
758 // We push the parent first, then the child on the stack.
759 Stack<SsaBasicBlock> stack = new Stack<SsaBasicBlock>(); local
768 stack.add(null); // Start with null parent.
769 stack.add(rootBlock);
771 while (stack.size() > 0) {
772 SsaBasicBlock cur = stack.pop();
773 SsaBasicBlock parent = stack.pop()
798 Stack<SsaBasicBlock> stack = new Stack<SsaBasicBlock>(); local
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| SsaMethod.java | 36 import java.util.Stack;
758 // We push the parent first, then the child on the stack.
759 Stack<SsaBasicBlock> stack = new Stack<SsaBasicBlock>(); local
768 stack.add(null); // Start with null parent.
769 stack.add(rootBlock);
771 while (stack.size() > 0) {
772 SsaBasicBlock cur = stack.pop();
773 SsaBasicBlock parent = stack.pop()
798 Stack<SsaBasicBlock> stack = new Stack<SsaBasicBlock>(); local
[all...] |
| /external/qemu/distrib/sdl-1.2.15/src/stdlib/ |
| SDL_qsort.c | 88 /* How big does our stack need to be? Answer: one entry per
111 #define pushLeft {stack[stacktop].first=ffirst;stack[stacktop++].last=last;}
112 #define pushRight {stack[stacktop].first=first;stack[stacktop++].last=llast;}
116 first=ffirst=stack[stacktop].first;\
117 last=llast=stack[stacktop].last;\
130 * an item onto the stack its size is <= 1/2 of that
131 * of its parent; so the stack can't need more than
171 * computing the size of stack needed. This woul
323 stack_entry stack[STACK_SIZE]; local
354 stack_entry stack[STACK_SIZE]; local
385 stack_entry stack[STACK_SIZE]; local
[all...] |
| /external/valgrind/main/coregrind/m_syswrap/ |
| syswrap-main.c | 71 mips v0 a0 a1 a2 a3 stack stack n/a n/a v0 (== NUM)
108 * Ensures the root thread's stack is suitably mapped. Tedious and
491 UWord *stack = (UWord *)gst->guest_ESP;
495 // stack[0] is return address
496 canonical->arg1 = stack[1];
497 canonical->arg2 = stack[2];
498 canonical->arg3 = stack[3];
499 canonical->arg4 = stack[4];
500 canonical->arg5 = stack[5]
[all...] |
| /dalvik/dx/src/com/android/dx/cf/code/ |
| BaseMachine.java | 120 ExecutionStack stack = frame.getStack(); local
130 args[i] = stack.pop();
148 throw new SimException("at stack depth " + (size - 1 - i) +
531 * onto the stack.
552 ExecutionStack stack = frame.getStack(); local
555 stack.setLocal();
557 stack.push(results[i]);
|
| /dalvik/vm/arch/arm/ |
| CallOldABI.S | 19 * argument list has to be pushed onto the native stack according to
61 Stack is "full descending". Only the arguments that don't fit in the first 4
62 registers are placed on the stack. "sp" points at the first stacked argument
88 @ Standard gcc stack frame setup. We don't need to push the original
96 @ We need to push a variable number of arguments onto the stack.
98 @ the stack pointers.
119 @ to the stack. We need to push the last item in argv first, and we
137 @ Load the last two args. These are coming out of the interpreted stack,
|
| /external/chromium/testing/gtest/test/ |
| gtest_xml_output_unittest.py | 65 Expected: 1%(stack)s]]></failure>
73 Expected: 1%(stack)s]]></failure>
76 Expected: 2%(stack)s]]></failure>
84 XML output: <?xml encoding="utf-8"><top><![CDATA[cdata text]]>]]><![CDATA[</top>%(stack)s]]></failure>
91 Invalid characters in brackets []%(stack)s]]></failure>
126 </testsuites>""" % {'stack': STACK_TRACE_TEMPLATE}
|
| /external/gtest/test/ |
| gtest_xml_output_unittest.py | 65 Expected: 1%(stack)s]]></failure>
73 Expected: 1%(stack)s]]></failure>
76 Expected: 2%(stack)s]]></failure>
84 XML output: <?xml encoding="utf-8"><top><![CDATA[cdata text]]>]]><![CDATA[</top>%(stack)s]]></failure>
91 Invalid characters in brackets []%(stack)s]]></failure>
126 </testsuites>""" % {'stack': STACK_TRACE_TEMPLATE}
|
| /external/javassist/src/main/javassist/ |
| CodeConverter.java | 515 int stack = 0; local
522 if (s > stack)
523 stack = s;
532 if (stack > 0)
533 codeAttr.setMaxStack(codeAttr.getMaxStack() + stack);
|
| /external/javassist/src/main/javassist/expr/ |
| ExprEditor.java | 100 context.updateMax(h.locals(), h.stack());
166 void updateMax(int locals, int stack) {
170 if (maxStack < stack)
171 maxStack = stack;
245 context.updateMax(expr.locals(), expr.stack());
|
