Searched defs:stack (Results 201 - 225 of 419) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/speex/libspeex/
H A Dnb_celp.h77 char *stack; /**< Pseudo-stack allocation for temporary memory */ member in struct:EncState
137 char *stack; /**< Pseudo-stack allocation for temporary memory */ member in struct:DecState
H A Dsb_celp.c54 /* Default size for the encoder and decoder stack (can be changed at compile time).
206 st->stack = NULL;
208 /*st->stack = (char*)speex_alloc_scratch(SB_ENC_STACK);*/
209 speex_encoder_ctl(st->st_low, SPEEX_GET_STACK, &st->stack);
270 VALGRIND_MAKE_READABLE(st, (st->stack-(char*)st));
281 /*speex_free_scratch(st->stack);*/
308 char *stack; local
332 stack=st->stack;
339 qmf_decomp(in, h0, low, high, st->full_frame_size, QMF_ORDER, st->h0_mem, stack);
835 sb_decode_lost(SBDecState *st, spx_word16_t *out, int dtx, char *stack) argument
879 char *stack; local
[all...]
/external/chromium_org/third_party/tcmalloc/vendor/src/
H A Dheap-profile-table.cc108 // We strip out different number of stack frames in debug mode
170 dealloc_(b->stack);
191 // Lookup stack trace in table
196 equal(key, key + depth, b->stack)) {
209 b->stack = kcopy;
219 int skip_count, void* stack[kMaxStackDepth]) {
221 stack, kMaxStackDepth, kStripFrames + skip_count + 1);
262 info->call_stack = alloc_value->bucket()->stack;
317 reinterpret_cast<uintptr_t>(b.stack[d]));
406 info.call_stack = list[i]->stack;
218 GetCallerStackTrace( int skip_count, void* stack[kMaxStackDepth]) argument
[all...]
H A Dheap-profile-table.h55 // Longest stack trace we record.
77 const void* const* call_stack; // call stack that made the allocation call
84 // An allocation context is a unique caller stack trace
87 int stack_depth; // Depth of stack trace
100 // Collect the stack trace for the function that asked to do the
103 // The stack trace is stored in 'stack'. The stack depth is returned.
105 // 'skip_count' gives the number of stack frames between this call
107 static int GetCallerStackTrace(int skip_count, void* stack[kMaxStackDept
209 const void** stack; // Stack trace member in struct:HeapProfileTable::Bucket
[all...]
H A Dheap-profiler.cc301 // Take the stack trace outside the critical section.
302 void* stack[HeapProfileTable::kMaxStackDepth]; local
303 int depth = HeapProfileTable::GetCallerStackTrace(skip_count + 1, stack);
306 heap_profile->RecordAlloc(ptr, bytes, depth, stack);
334 // TODO(jandrews): Re-enable stack tracing
424 // call stack traces of at least size kMaxStackDepth:
/external/compiler-rt/lib/asan/
H A Dasan_mac.cc216 void ReadContextStack(void *context, uptr *stack, uptr *ssize) { argument
264 void asan_register_worker_thread(int parent_tid, StackTrace *stack) { argument
268 CreateThreadContextArgs args = { t, stack };
286 asan_register_worker_thread(context->parent_tid, &stack);
289 asan_free(context, &stack, FROM_MALLOC);
300 StackTrace *stack) {
302 (asan_block_context_t*) asan_malloc(sizeof(asan_block_context_t), stack);
315 asan_block_context_t *asan_ctxt = alloc_asan_context(ctxt, func, &stack); \
333 asan_block_context_t *asan_ctxt = alloc_asan_context(ctxt, func, &stack);
346 asan_block_context_t *asan_ctxt = alloc_asan_context(ctxt, func, &stack);
299 alloc_asan_context(void *ctxt, dispatch_function_t func, StackTrace *stack) argument
[all...]
/external/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_common.cc200 void ReportErrorSummary(const char *error_type, StackTrace *stack) { argument
205 if (stack->size > 0 && Symbolizer::Get()->CanReturnFileLineInfo()) {
206 // Currently, we include the first stack frame into the report summary.
208 uptr pc = StackTrace::GetPreviousInstructionPc(stack->trace[0]);
/external/eigen/Eigen/src/OrderingMethods/
H A DAmd.h60 Index cs_tdfs(Index j, Index k, Index *head, const Index *next, Index *post, Index *stack) argument
63 if(!head || !next || !post || !stack) return (-1); /* check inputs */
64 stack[0] = j; /* place j on the stack */
65 while (top >= 0) /* while (stack is not empty) */
67 p = stack[top]; /* p = top of stack */
77 stack[++top] = i; /* start dfs on child node i */
/external/javassist/src/main/javassist/bytecode/
H A DCodeAttribute.java52 * @param stack <code>max_stack</code>
57 public CodeAttribute(ConstPool cp, int stack, int locals, byte[] code, argument
61 maxStack = stack;
231 * Computes the maximum stack size and sets <code>max_stack</code>
309 * Adds a stack map table. If another copy of stack map table
312 * @param smt the stack map table added to this code attribute.
313 * If it is null, a new stack map is not added.
314 * Only the old stack map is removed.
323 * Adds a stack ma
[all...]
H A DStackMap.java138 * Visits each entry of the stack map frames.
148 pos = stack(pos + 2, offset, numStack);
161 * Invoked when <code>stack</code> of <code>stack_map_frame</code>
164 public int stack(int pos, int offset, int num) { method in class:StackMap.Walker
174 * false if it is for <code>stack</code>.
273 * Updates this stack map table when a new local variable is inserted
404 * It is called to update the stack map when
422 public int stack(int pos, int offset, int num) { method in class:StackMap.NewRemover
470 * Prints this stack map.
/external/libxml2/
H A Dtimsort.h295 static int CHECK_INVARIANT(TIM_SORT_RUN_T *stack, const int stack_curr) argument
301 const int64_t A1 = stack[stack_curr - 2].length;
302 const int64_t B1 = stack[stack_curr - 1].length;
306 A = stack[stack_curr - 3].length;
307 B = stack[stack_curr - 2].length;
308 C = stack[stack_curr - 1].length;
334 static void TIM_SORT_MERGE(SORT_TYPE *dst, const TIM_SORT_RUN_T *stack, const int stack_curr, TEMP_STORAGE_T *store) argument
336 const int64_t A = stack[stack_curr - 2].length;
337 const int64_t B = stack[stack_curr - 1].length;
338 const int64_t curr = stack[stack_cur
393 TIM_SORT_COLLAPSE(SORT_TYPE *dst, TIM_SORT_RUN_T *stack, int stack_curr, TEMP_STORAGE_T *store, const size_t size) argument
[all...]
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_ssa.cpp299 Stack *stack; member in class:nv50_ir::RenamePass
406 stack = new Stack[func->allLValues.getSize()];
411 if (stack)
412 delete[] stack;
418 if (!stack[val->id].getSize())
420 return reinterpret_cast<LValue *>(stack[val->id].peek().u.p);
437 if (!stack)
461 stack[lval->id].push(ssa);
484 stack[lval->id].push(stmt->def(d).get());
529 stack[stm
[all...]
/external/mesa3d/src/mesa/drivers/dri/i965/
H A Dbrw_eu.h120 struct brw_instruction stack[BRW_EU_MAX_INSN_STACK]; member in struct:brw_compile
147 * blocks they were popping out of, to fix up the mask stack. This tracks
/external/mesa3d/src/mesa/program/
H A Dregister_allocate.c40 * pushed on a stack and removed (with its edges) from the graph.
44 * stack, their edges restored, and assigned a color different from
45 * their neighbors. Because they were pushed on the stack only when
132 * Set when the node is in the trivially colorable stack. When
153 unsigned int *stack; member in struct:ra_graph
314 g->stack = rzalloc_array(g, unsigned int, count);
364 * trivially-colorable nodes into a stack of nodes to be colored,
385 g->stack[g->stack_count] = i;
402 * Pops nodes from the stack back into the graph, coloring them with
415 int n = g->stack[
[all...]
/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/
H A DMethodNode.java125 * The maximum stack size of this method.
236 final Object[] stack)
240 : getLabelNodes(local), nStack, stack == null
242 : getLabelNodes(stack)));
231 visitFrame( final int type, final int nLocal, final Object[] local, final int nStack, final Object[] stack) argument
/external/mockito/cglib-and-asm/src/org/mockito/asm/util/
H A DTraceMethodVisitor.java172 final Object[] stack)
183 appendFrameTypes(nStack, stack);
199 appendFrameTypes(1, stack);
206 mv.visitFrame(type, nLocal, local, nStack, stack);
167 visitFrame( final int type, final int nLocal, final Object[] local, final int nStack, final Object[] stack) argument
/external/nist-sip/java/gov/nist/javax/sip/stack/
H A DSIPClientTransaction.java26 package gov.nist.javax.sip.stack;
282 * @param newSIPStack Transaction stack this transaction belongs to.
978 * Called by the transaction stack when a retransmission timer fires.
1040 * Called by the transaction stack when a timeout timer fires.
1086 * stack at this point but we do it to be nice.
1266 * This is called by the stack after a non-invite client transaction goes to completed state.
1355 * @see gov.nist.javax.sip.stack.ServerResponseInterface#processResponse(gov.nist.javax.sip.message.SIPResponse,
1356 * gov.nist.javax.sip.stack.MessageChannel)
1457 * @see gov.nist.javax.sip.stack.SIPTransaction#getDialog()
1485 * @see gov.nist.javax.sip.stack
[all...]
H A DSIPServerTransaction.java26 package gov.nist.javax.sip.stack;
497 * @param sipStack Transaction stack this transaction belongs to.
667 * transaction is not known to the stack.
678 // null check added as the stack may be stopped.
695 * Return true if the transaction is known to stack.
1107 * Called by the transaction stack when a retransmission timer fires. This retransmits the
1156 * Called by the transaction stack when a timeout timer fires.
1484 * @see gov.nist.javax.sip.stack.SIPTransaction#getDialog()
1494 * @see gov.nist.javax.sip.stack.SIPTransaction#setDialog(gov.nist.javax.sip.stack
[all...]
/external/opencv/cv/src/
H A Dcvapprox.cpp531 CvSeq* stack = 0; local
545 stack = cvCreateSeq( 0, sizeof(CvSeq), sizeof(CvSlice), temp_storage );
559 cvSeqPush( stack, &slice );
599 /* 2. initialize the stack */
610 cvSeqPush( stack, &right_slice );
611 cvSeqPush( stack, &slice );
618 while( stack->total != 0 )
620 cvSeqPop( stack, &slice );
668 cvSeqPush( stack, &right_slice );
669 cvSeqPush( stack,
735 CvSeq* stack = 0; local
[all...]
/external/pdfium/core/src/fxge/agg/agg23/
H A Dfx_agg_rasterizer_scanline_aa.cpp348 cell_aa** stack[80]; local
354 top = stack;
409 if(top > stack) {
/external/proguard/src/proguard/optimize/evaluation/
H A DPartialEvaluator.java249 System.out.println(" Max stack = "+codeAttribute.u2maxStack);
252 // Reuse the existing variables and stack objects, ensuring the right size.
254 TracedStack stack = new TracedStack(codeAttribute.u2maxStack);
268 stack,
480 * Returns the stack before execution of the instruction at the given
490 * Returns the stack after execution of the instruction at the given
526 TracedStack stack,
530 stack,
539 TracedStack stack,
543 stack,
525 pushCallingInstructionBlock(TracedVariables variables, TracedStack stack, int startOffset) argument
538 pushInstructionBlock(TracedVariables variables, TracedStack stack, int startOffset) argument
552 evaluateInstructionBlockAndExceptionHandlers(Clazz clazz, Method method, CodeAttribute codeAttribute, TracedVariables variables, TracedStack stack, int startOffset, int endOffset) argument
579 evaluateInstructionBlock(Clazz clazz, Method method, CodeAttribute codeAttribute, TracedVariables variables, TracedStack stack, int startOffset) argument
618 evaluateSingleInstructionBlock(Clazz clazz, Method method, CodeAttribute codeAttribute, TracedVariables variables, TracedStack stack, int startOffset) argument
898 evaluateSubroutine(Clazz clazz, Method method, CodeAttribute codeAttribute, TracedVariables variables, TracedStack stack, int subroutineStart, java.util.Stack instructionBlockStack) argument
1262 private TracedStack stack; field in class:PartialEvaluator.MyInstructionBlock
1266 MyInstructionBlock(TracedVariables variables, TracedStack stack, int startOffset) argument
[all...]
/external/regex-re2/re2/
H A Donepass.cc399 InstCond *stack = new InstCond[size]; local
417 // Flood graph using manual stack, filling in actions as found.
426 stack[nstack].id = id;
427 stack[nstack++].cond = 0;
429 int id = stack[--nstack].id;
431 uint32 cond = stack[nstack].cond;
441 stack[nstack].id = ip->out1();
442 stack[nstack++].cond = cond;
443 stack[nstack].id = ip->out();
444 stack[nstac
[all...]
/external/skia/include/core/
H A DSkClipStack.h22 // stores the stack depth (fSaveCount) and clips (fDeque) separately.
23 // Each clip in fDeque stores the stack state to which it belongs
112 /** The GenID can be used by clip stack clients to cache representations of the clip. The
114 stack not to the element itself. That is the same clip path in different stacks will
184 int fSaveCount; // save count of stack when this element was added.
189 /* fFiniteBoundType and fFiniteBound are used to incrementally update the clip stack's
202 // When element is applied to the previous elements in the stack is the result known to be
266 stack */
314 * clip-stack. If false is returned then the rect does not intersect the
357 * Dumps the contents of the clip stack t
413 B2TIter(const SkClipStack& stack) argument
423 reset(const SkClipStack& stack) argument
[all...]
/external/speex/libspeex/
H A Dlsp.c144 char *stack
177 static float cheb_poly_eva(spx_word32_t *coef, spx_word16_t x, int m, char *stack) argument
219 int lpc_to_lsp (spx_coef_t *a,int lpcrdr,spx_lsp_t *freq,int nb,spx_word16_t delta, char *stack) argument
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) argument
522 void lsp_to_lpc(spx_lsp_t *freq,spx_coef_t *ak,int lpcrdr, char *stack) argument
H A Dnb_celp.h77 char *stack; /**< Pseudo-stack allocation for temporary memory */ member in struct:EncState
137 char *stack; /**< Pseudo-stack allocation for temporary memory */ member in struct:DecState

Completed in 2162 milliseconds

1234567891011>>