HomeSort by relevance Sort by last modified time
    Searched refs:stack (Results 101 - 125 of 636) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/speex/libspeex/
vq_bfin.h 37 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack)
sb_celp.h 58 char *stack; /**< Temporary allocation stack */ member in struct:SBEncState
111 char *stack; member in struct:SBDecState
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/srec/srec/crec/
srec_stats.h 68 void srec_stats_update_astar(AstarStack* stack);
  /external/webkit/WebCore/platform/graphics/
GraphicsContextPrivate.h 95 Vector<GraphicsContextState> stack; member in class:WebCore::GraphicsContextPrivate
  /libcore/luni/src/main/java/java/security/
AccessController.java 266 * Returns array of ProtectionDomains from the classes residing on the stack
288 ProtectionDomain[] stack = getStackDomains(); local
293 return new AccessControlContext(stack);
309 ProtectionDomain[] protectionDomains = that.combiner.combine(stack, assigned);
316 return new AccessControlContext(stack, that);
  /dalvik/vm/compiler/template/armv5te/
TEMPLATE_INVOKE_METHOD_NATIVE.S 6 SAVEAREA_FROM_FP(r1, rFP) @ r1<- stack save area
8 SAVEAREA_FROM_FP(r10, r1) @ r10<- stack save area
11 bxlo lr @ return to raise stack overflow excep.
39 SAVEAREA_FROM_FP(r10, r1) @ r10<- new stack save area
TEMPLATE_INVOKE_METHOD_CHAIN.S 14 SAVEAREA_FROM_FP(r1, rFP) @ r1<- stack save area
16 SAVEAREA_FROM_FP(r10, r1) @ r10<- stack save area
21 bxlo r12 @ return to raise stack overflow excep.
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
18 bxlo lr @ return to raise stack overflow excep.
  /external/emma/core/java12/com/vladium/logging/
Logger.java 269 * Logs 'msg' from an unnamed calling method followed by the 'throwable' stack
283 * Logs 'msg' from a given calling method followed by the 'throwable' stack
310 * Returns the current top of the thread-local logger stack or the static
311 * Logger instance scoped to Logger.class if the stack is empty.
317 final LinkedList stack = (LinkedList) THREAD_LOCAL_STACK.get (); local
319 // [assertion: stack != null]
321 if (stack.isEmpty ())
327 return (Logger) stack.getLast ();
340 final LinkedList stack = (LinkedList) THREAD_LOCAL_STACK.get (); local
341 stack.addLast (ctx)
355 final LinkedList stack = (LinkedList) THREAD_LOCAL_STACK.get (); local
    [all...]
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
union-find.h 23 #include <stack>
87 stack<T*> exec_stack_; // Used for path compression.
  /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/sources/android/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>()) );
  /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/v8/tools/
tickprocessor.py 40 def Tick(self, pc, stack):
42 if len(stack) > 0:
43 stack.insert(0, self.ToString())
44 stack_key = tuple(stack)
84 def Tick(self, pc, stack):
85 super(JSCodeEntry, self).Tick(pc, stack)
338 def PreprocessStack(self, stack):
341 for frame in stack:
346 def ProcessStack(self, stack):
348 for frame in stack
    [all...]
  /external/zlib/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...]
  /frameworks/base/services/java/com/android/server/am/
ActivityRecord.java 46 * An entry in the history stack, representing an activity.
50 final ActivityStack stack; // owner field in class:ActivityRecord
98 boolean inHistory; // are we in the history stack?
193 stack = _stack;
427 final long totalTime = stack.mInitialStartTime != 0
428 ? (curTime - stack.mInitialStartTime) : thisTime;
446 stack.reportActivityLaunchedLocked(false, this, thisTime, totalTime);
451 stack.mInitialStartTime = 0;
454 stack.reportActivityVisibleLocked(this);
463 stack.processStoppingActivitiesLocked(false)
    [all...]
  /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...]
  /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/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;
  /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...]
  /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...]

Completed in 1121 milliseconds

1 2 3 45 6 7 8 91011>>