/external/v8/test/mjsunit/ |
stack-traces.js | 115 // in the stack trace produced when running the given function. 122 assertTrue(e.stack.indexOf(expected[i]) != -1, 123 name + " doesn't contain expected[" + i + "] stack = " + e.stack); 127 assertEquals(e.stack.indexOf(unexpected[i]), -1, 142 assertEquals(-1, e.stack.indexOf('at new ReferenceError'), 159 assertTrue(e.stack.indexOf('at new ReferenceError') != -1, 166 // If an error occurs while the stack trace is being formatted it should 178 assertTrue(e.stack.indexOf('<error: ReferenceError') != -1, 184 // the stack frame. Put that in your pipe and smoke it [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/valgrind/main/none/tests/ |
cmdline1.stdout.exp | 29 --num-callers=<number> show <number> callers in stack traces [12] 32 --show-below-main=no|yes continue stack traces below main() [no] 39 --max-stackframe=<number> assume stack switch for SP changes larger 41 --main-stacksize=<number> set size of main thread's stack (in bytes) 54 --smc-check=none|stack|all checks for self-modifying code: none, 55 only for code found in stacks, or all [stack] 56 --read-var-info=yes|no read debug info on stack and global variables
|
/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);
|
/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/qemu/distrib/sdl-1.2.12/src/stdlib/ |
SDL_qsort.c | 70 /* How big does our stack need to be? Answer: one entry per 93 #define pushLeft {stack[stacktop].first=ffirst;stack[stacktop++].last=last;} 94 #define pushRight {stack[stacktop].first=first;stack[stacktop++].last=llast;} 98 first=ffirst=stack[stacktop].first;\ 99 last=llast=stack[stacktop].last;\ 112 * an item onto the stack its size is <= 1/2 of that 113 * of its parent; so the stack can't need more than 153 * computing the size of stack needed. This woul 305 stack_entry stack[STACK_SIZE]; local 336 stack_entry stack[STACK_SIZE]; local 367 stack_entry stack[STACK_SIZE]; local [all...] |
/external/valgrind/main/coregrind/m_syswrap/ |
syswrap-main.c | 102 * Ensures the root thread's stack is suitably mapped. Tedious and 497 UWord *stack = (UWord *)gst->guest_ESP; 501 // stack[0] is return address 502 canonical->arg1 = stack[1]; 503 canonical->arg2 = stack[2]; 504 canonical->arg3 = stack[3]; 505 canonical->arg4 = stack[4]; 506 canonical->arg5 = stack[5]; 507 canonical->arg6 = stack[6]; 508 canonical->arg7 = stack[7] [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/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());
|
/external/libffi/src/arm/ |
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) 42 argp = stack; 113 /* Round the stack up to a multiple of 8 bytes. This isn't needed 196 static void ffi_prep_incoming_args_SYSV (char *stack, void **ret, 218 * value on the stack; and if the function returns 231 ffi_prep_incoming_args_SYSV(char *stack, void **rvalue, 240 argp = stack;
|
/external/libffi/src/m68k/ |
ffi.c | 18 void *ffi_prep_args (void *stack, extended_cif *ecif); 24 /* ffi_prep_args is called by the assembly routine once stack space has 28 ffi_prep_args (void *stack, extended_cif *ecif) 36 argp = stack; 200 ffi_prep_incoming_args_SYSV (char *stack, void **avalue, ffi_cif *cif) 207 argp = stack;
|
/external/webkit/Source/JavaScriptCore/wtf/ |
StackBounds.cpp | 60 // Bug 26276 - Need a mechanism to determine stack extent 67 // FIXME: remove this! - this code unsafely guesses at stack sizes! 69 // Based on the current limit used by the JSC parser, guess the stack size. 71 // This method assumes the stack is growing downwards. 128 stack_t stack; local 129 pthread_stackseg_np(thread, &stack); 130 m_origin = stack.ss_sp; 184 // Find the address of this stack frame by taking the address of a local variable. 233 // find the address of this stack frame by taking the address of a local variable 275 #error Need a way to get the stack bounds on this platform (Windows [all...] |
/frameworks/base/tools/localize/ |
XMLHandler.cpp | 172 vector<XMLHandler*> stack; member in struct:xml_handler_data 471 list_contains(const vector<XMLHandler*>& stack, XMLHandler* handler) 473 const size_t N = stack.size(); 475 if (stack[i] == handler) { 487 XMLHandler* handler = data->stack[data->stack.size()-1]; 511 data->stack.push_back(next); 519 XMLHandler* handler = data->stack[data->stack.size()-1]; 520 data->stack.pop_back() [all...] |
/packages/apps/Browser/src/com/android/browser/ |
PieControlXLarge.java | 86 PieStackView stack = new PieStackView(mActivity); local 87 stack.setLayoutListener(new OnLayoutListener() { 93 stack.setOnCurrentListener(mTabAdapter); 94 stack.setAdapter(mTabAdapter); 95 mShowTabs.setPieView(stack);
|
/sdk/emulator/qtools/ |
q2dm.cpp | 74 CallStackType *stack = (CallStackType *) base; local 78 stack->getGlobalTime(time), pid, stackLevel, 96 CallStackType *stack = (CallStackType *) base; local 100 stack->getGlobalTime(time), pid, stackLevel, 113 stack->getGlobalTime(time), pid, sym->name); 161 // Create a fake kernel thread stack where we will put all the kernel 188 // Use the kernel stack 193 // stack frames for the kernel thread. 199 // Get the stack for the current thread 203 // Get the stack for the current threa [all...] |
/external/bluetooth/glib/glib/ |
gqsort.c | 62 /* Stack node declarations used to store unfulfilled partition obligations. */ 69 /* The next 4 #defines implement a very fast in-line stack abstraction. */ 70 /* The stack needs log (total_elements) entries (we could even subtract 77 #define STACK_NOT_EMPTY (stack < top) 83 1. Non-recursive, using an explicit stack of pointer that store the 86 stack. Assuming a 32-bit (64 bit) integer for size_t, this needs 100 stack first, with the algorithm then concentrating on the 102 stack size is needed (actually O(1) in this case)! */ 139 stack_node stack[STACK_SIZE]; local 140 stack_node *top = stack; [all...] |
/external/harfbuzz/src/ |
harfbuzz-shaper-private.h | 154 Type stack##Name[512]; \ 155 Type *Name = stack##Name; 166 if (stack##Name != Name) \
|
/external/libvpx/vp8/common/ppc/ |
recon_altivec.asm | 39 stw r0, -8(r1) ;# save old VRSAVE to stack 51 lwz r12, -8(r1) ;# restore old VRSAVE from stack 88 stw r0, -8(r1) ;# save old VRSAVE to stack 104 lwz r12, -8(r1) ;# restore old VRSAVE from stack 127 stw r0, -8(r1) ;# save old VRSAVE to stack 172 lwz r12, -8(r1) ;# restore old VRSAVE from stack
|
/external/speex/libspeex/ |
ltp_bfin.h | 66 void pitch_xcorr(const spx_word16_t *_x, const spx_word16_t *_y, spx_word32_t *corr, int len, int nb_pitch, char *stack) 157 void open_loop_nbest_pitch(spx_word16_t *sw, int start, int end, int len, int *pitch, spx_word16_t *gain, int N, char *stack) 210 pitch_xcorr(sw, sw-end, corr, len, end-start+1, stack);
|
nb_celp.c | 67 /* Default size for the encoder and decoder stack (can be changed at compile time). 125 st->stack = NULL; 127 st->stack = (char*)speex_alloc_scratch(NB_ENC_STACK); 219 speex_free_scratch(st->stack); 273 char *stack; local 282 stack=st->stack; 322 roots=lpc_to_lsp (lpc, st->lpcSize, lsp, 10, LSP_DELTA1, stack); 349 lsp_to_lpc(interp_lsp, interp_lpc, st->lpcSize,stack); 367 filter_mem16(st->sw, bw_lpc1, bw_lpc2, st->sw, st->frameSize, st->lpcSize, st->mem_sw_whole, stack); 1096 char *stack; local [all...] |
/external/valgrind/tsan/ |
Makefile | 20 CFLAGS=-g $(COPT) $(CWARN) -fno-strict-aliasing -fno-stack-protector -fpic 27 VG_CXXFLAGS=-fno-rtti -fno-stack-protector 39 DR_CXXFLAGS=-fPIC -fno-rtti -fno-stack-protector
|