| /external/valgrind/main/coregrind/m_debuginfo/ |
| d3basics.c | 485 FAIL("evaluate_Dwarf3_Expr: stack overflow(1)"); \
487 stack[sp] = (_arg); \
494 FAIL("evaluate_Dwarf3_Expr: stack underflow(1)"); \
495 _lval = stack[sp]; \
502 Addr stack[N_EXPR_STACK]; /* stack of addresses, as per D3 spec */ local
552 /* end of expr - return expr on the top of stack. */
554 /* stack empty. Bad. */
555 FAIL("evaluate_Dwarf3_Expr: stack empty at end of expr");
598 FAIL("evaluate_Dwarf3_Expr: DW_OP_{implicit,stack}_value
[all...] |
| /external/bison/data/ |
| glr.c | 30 # Stack parameters.
547 if the built-in stack extension method is used).
557 /* Minimum number of free items on the stack allowed after an
560 stack is expanded, thus insuring that all necessary pointers get
687 /** Preceding state in this stack */
729 /** Type of the items in the GLR stack. The yyisState field
826 * and top stack item YYVSP. YYLVALP points to place to put semantic
1043 * stack #K of *STACKP. */
1068 /** Initialize SET to a singleton set containing an empty stack. */
1094 /** Initialize STACK to a single empty stack, with total maximu
[all...] |
| /packages/apps/Camera/jni/feature_mos/src/mosaic/ |
| Delaunay.cpp | 372 int stack[DM]; local
409 // Now to recurse on shorter partition, store longer partition on stack
413 break; // empty stack && both partitions < QQ so break
415 sj = stack[--m];
416 si = stack[--m];
423 stack[m++] = si;
424 stack[m++] = sL;
432 break; // empty stack && both partitions < QQ so break
434 sj = stack[--m];
435 si = stack[--m]
[all...] |
| /packages/apps/Gallery2/jni_mosaic/feature_mos/src/mosaic/ |
| Delaunay.cpp | 372 int stack[DM]; local
409 // Now to recurse on shorter partition, store longer partition on stack
413 break; // empty stack && both partitions < QQ so break
415 sj = stack[--m];
416 si = stack[--m];
423 stack[m++] = si;
424 stack[m++] = sL;
432 break; // empty stack && both partitions < QQ so break
434 sj = stack[--m];
435 si = stack[--m]
[all...] |
| /packages/apps/LegacyCamera/jni/feature_mos/src/mosaic/ |
| Delaunay.cpp | 372 int stack[DM]; local
409 // Now to recurse on shorter partition, store longer partition on stack
413 break; // empty stack && both partitions < QQ so break
415 sj = stack[--m];
416 si = stack[--m];
423 stack[m++] = si;
424 stack[m++] = sL;
432 break; // empty stack && both partitions < QQ so break
434 sj = stack[--m];
435 si = stack[--m]
[all...] |
| /external/speex/libspeex/ |
| ltp.c | 79 void pitch_xcorr(const spx_word16_t *_x, const spx_word16_t *_y, spx_word32_t *corr, int len, int nb_pitch, char *stack)
142 void pitch_xcorr(const spx_word16_t *_x, const spx_word16_t *_y, spx_word32_t *corr, int len, int nb_pitch, char *stack)
173 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)
245 pitch_xcorr(sw, sw-end, corr, len, end-start+1, stack);
360 char *stack,
419 iir_mem16(e, ak, e, nsf, p, mm, stack);
422 filter_mem16(e, awk1, awk2, e, nsf, p, mm, stack);
542 char *stack,
609 open_loop_nbest_pitch(sw, start, end, nsf, nbest, NULL, N, stack);
622 bits, stack, exc2, r, new_target, &cdbk_index, plc_tuning, *cumul_gain, scaledown)
[all...] |
| lsp.c | 144 char *stack
177 static float cheb_poly_eva(spx_word32_t *coef, spx_word16_t x, int m, char *stack)
219 int lpc_to_lsp (spx_coef_t *a,int lpcrdr,spx_lsp_t *freq,int nb,spx_word16_t delta, char *stack)
325 psuml = cheb_poly_eva(pt,xl,m,stack); /* evals poly. at xl */
340 psumr = cheb_poly_eva(pt,xr,m,stack);/* poly(xl-delta_x) */
364 psumm=cheb_poly_eva(pt,xm,m,stack);
403 void lsp_to_lpc(spx_lsp_t *freq,spx_coef_t *ak,int lpcrdr, char *stack)
522 void lsp_to_lpc(spx_lsp_t *freq,spx_coef_t *ak,int lpcrdr, char *stack)
|
| vq_sse.h | 36 void vq_nbest(spx_word16_t *_in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack)
75 void vq_nbest_sign(spx_word16_t *_in, const __m128 *codebook, int len, int entries, __m128 *E, int N, int *nbest, spx_word32_t *best_dist, char *stack)
|
| /external/valgrind/main/none/tests/ |
| cmdline1.stdout.exp | 37 --num-callers=<number> show <number> callers in stack traces [12]
40 --show-below-main=no|yes continue stack traces below main() [no]
47 --max-stackframe=<number> assume stack switch for SP changes larger
49 --main-stacksize=<number> set size of main thread's stack (in bytes)
64 --smc-check=none|stack|all|all-non-file [stack]
68 --read-var-info=yes|no read debug info on stack and global variables
|
| /external/libvpx/libvpx/vp8/common/arm/neon/ |
| bilinearpredict4x4_neon.asm | 23 ; stack(lr) int dst_pitch
29 ldr r4, [sp, #8] ;load parameters from stack
30 ldr lr, [sp, #12] ;load parameters from stack
|
| /external/webkit/Source/WebCore/inspector/ |
| InspectorBrowserDebuggerAgent.cpp | 159 Vector<Node*> stack(1, InspectorDOMAgent::innerFirstChild(node));
161 Node* node = stack.last();
162 stack.removeLast();
166 stack.append(InspectorDOMAgent::innerFirstChild(node));
167 stack.append(InspectorDOMAgent::innerNextSibling(node));
168 } while (!stack.isEmpty());
|
| /bionic/libc/bionic/ |
| pthread_debug.cpp | 192 CallStackListEntry* stack; member in union:GrowingList::__anon12
219 // call stack when this lock was acquired last
284 static void dup_backtrace(CallStack* stack, size_t count, uintptr_t const* addrs) {
285 stack->depth = count;
286 stack->addrs = DbgAllocLocked<uintptr_t>(count);
287 memcpy(stack->addrs, addrs, count * sizeof(uintptr_t));
344 dup_backtrace(&pList->stack[pList->count - 1], count, addrs);
410 log_backtrace(obj->stacks.stack[index].addrs, obj->stacks.stack[index].depth);
438 // always record the call stack when acquiring a lock
[all...] |
| /dalvik/hit/src/com/android/hit/ |
| ClassInstance.java | 27 public ClassInstance(long id, StackTrace stack, long classId) {
29 mStack = stack;
|
| ClassObj.java | 41 public ClassObj(long id, StackTrace stack, String className) {
43 mStack = stack;
|
| /external/chromium/base/synchronization/ |
| condition_variable_win.cc | 7 #include <stack>
76 std::stack<HANDLE> handles; // See FAQ-question-10.
402 stack.
|
| /external/iproute2/tc/ |
| emp_ematch.l | 68 %option 8bit stack warn noyywrap prefix="ematch_"
|
| /external/libffi/src/m32r/ |
| ffi.c | 32 /* ffi_prep_args is called by the assembly routine once stack
35 void ffi_prep_args(char *stack, extended_cif *ecif)
45 argp = stack;
|
| /external/libvpx/libvpx/build/make/ |
| ads2gas.pl | 24 # Stack of procedure names.
168 # REQUIRE8 Stack is required to be 8-byte aligned
171 # PRESERVE8 Stack 8-byte align is preserved
211 # Mark that this object doesn't need an executable stack.
212 printf ("\t.section\t.note.GNU-stack,\"\",\%\%progbits\n");
|
| /external/openfst/src/include/fst/ |
| dfs-visit.h | 25 #include <stack>
72 // An Fst state's DFS stack state
104 stack<DfsState<Arc> *> state_stack; // DFS execution stack
|
| /external/openssl/crypto/perlasm/ |
| x86nasm.pl | 108 $::stack=4;
112 { $::stack=0;
|
| /external/qemu/distrib/sdl-1.2.15/src/hermes/ |
| mmx_main.asm | 73 section .note.GNU-stack noalloc noexec nowrite progbits
|
| x86_main.asm | 74 section .note.GNU-stack noalloc noexec nowrite progbits
|
| /external/v8/test/mjsunit/ |
| error-constructors.js | 37 ReferenceError.prototype.__defineSetter__('stack', fail);
44 assertTrue(e0.hasOwnProperty('stack'));
45 assertTrue(e1.hasOwnProperty('stack'));
75 desc = Object.getOwnPropertyDescriptor(e, 'stack');
|
| /external/webkit/Source/WebCore/platform/image-decoders/gif/ |
| GIFImageReader.cpp | 250 unsigned char *stack = gs->stack; local
313 if (stackp == stack + MAX_BITS)
329 if (stackp == stack + MAX_BITS)
358 } while (stackp > stack);
483 if (!frame_reader->stack)
484 frame_reader->stack = new unsigned char[MAX_BITS];
485 frame_reader->stackp = frame_reader->stack;
|
| /frameworks/opt/mms/src/java/com/google/android/mms/pdu/ |
| PduComposer.java | 101 * Message compose buffer stack.
1062 private LengthRecordNode stack = null; field in class:PduComposer.BufferStack
[all...] |
