| /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();
|
| /art/runtime/ |
| instrumentation.cc | 166 // Create method enter events for all methods current on the thread's stack.
248 std::deque<instrumentation::InstrumentationStackFrame>* stack = thread->GetInstrumentationStack(); local
249 if (stack->size() > 0) {
254 CHECK_EQ(visitor.frames_removed_, stack->size());
255 while (stack->size() > 0) {
256 stack->pop_front();
486 std::deque<instrumentation::InstrumentationStackFrame>* stack = self->GetInstrumentationStack(); local
492 stack->push_front(instrumentation_frame);
500 std::deque<instrumentation::InstrumentationStackFrame>* stack = self->GetInstrumentationStack(); local
501 CHECK_GT(stack->size(), 0U)
554 std::deque<instrumentation::InstrumentationStackFrame>* stack = self->GetInstrumentationStack(); local
[all...] |
| /frameworks/base/packages/DocumentsUI/src/com/android/documentsui/ |
| DocumentsActivity.java | 296 // Restore last stack for calling package
304 cursor.getColumnIndex(ResumeColumns.STACK));
305 DurableUtils.readFromArray(rawStack, mState.stack);
315 // Update the restored stack to ensure we have freshest data
318 mState.stack.updateRoot(matchingRoots);
319 mState.stack.updateDocuments(getContentResolver());
321 Log.w(TAG, "Failed to restore stack: " + e);
322 mState.stack.reset();
335 // Show drawer when no stack restored, but only when requesting
446 if (mState.stack.size() <= 1)
1147 public DocumentStack stack = new DocumentStack(); field in class:DocumentsActivity.State
[all...] |
| /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/chromium_org/sandbox/linux/seccomp-bpf/ |
| codegen_unittest.cc | 179 std::vector<Instruction *> stack; local
193 stack.push_back(insn->jf_ptr);
198 if (stack.empty()) {
201 insn = stack.back();
202 stack.pop_back();
295 std::vector<BasicBlock *> stack; local
326 stack.push_back(all_blocks[insn->jf_ptr]);
331 if (stack.empty()) {
334 bb = stack.back();
335 stack.pop_back()
[all...] |
| /external/chromium_org/third_party/angle_dx11/src/compiler/ |
| ValidateLimitations.cpp | 13 bool IsLoopIndex(const TIntermSymbol* symbol, const TLoopStack& stack) {
14 for (TLoopStack::const_iterator i = stack.begin(); i != stack.end(); ++i) {
21 void MarkLoopForUnroll(const TIntermSymbol* symbol, TLoopStack& stack) {
22 for (TLoopStack::iterator i = stack.begin(); i != stack.end(); ++i) {
43 ValidateConstIndexExpr(const TLoopStack& stack)
44 : mValid(true), mLoopStack(stack) {}
68 ValidateLoopIndexExpr(TLoopStack& stack)
71 mLoopStack(stack) {}
[all...] |
| /external/zlib/src/examples/ |
| gun.c | 216 unsigned stack; /* next position for reversed string */ local
265 stack = 0;
325 match[stack++] = (unsigned char)final;
330 p = match + stack;
335 stack = p - match;
336 match[stack++] = (unsigned char)code;
350 while (stack > SIZE - outcnt) {
352 outbuf[outcnt++] = match[--stack];
359 p = match + stack;
363 stack = 0
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| sgmllib.py | 75 self.stack = []
216 # XXX if end: check for empty stack
344 self.stack.append(tag)
351 found = len(self.stack) - 1
356 if tag not in self.stack:
364 found = len(self.stack)
366 if self.stack[i] == tag: found = i
367 while len(self.stack) > found:
368 tag = self.stack[-1]
377 del self.stack[-1
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| sgmllib.py | 75 self.stack = []
216 # XXX if end: check for empty stack
344 self.stack.append(tag)
351 found = len(self.stack) - 1
356 if tag not in self.stack:
364 found = len(self.stack)
366 if self.stack[i] == tag: found = i
367 while len(self.stack) > found:
368 tag = self.stack[-1]
377 del self.stack[-1
[all...] |
| /external/chromium_org/v8/test/mjsunit/ |
| eval-stack-trace.js | 28 // Return the stack frames of an Error object.
35 var frames = this.stack;
94 // f (eval at g (eval-stack.js:87:8), <anonymous>:2:9)
95 // eval (eval at g (eval-stack.js:87:8), <anonymous>:4:1)
96 // g (eval-stack.js:87:3)
97 // eval-stack.js:94:3
124 // f (eval at h (eval at <anonymous> (eval-stack.js:116:8)),
126 // eval (eval at h (eval at <anonymous> (eval-stack.js:116:8)),
128 // h (eval at <anonymous> (eval-stack.js:116:8), <anonymous>:3:3)
129 // eval (eval at <anonymous> (eval-stack.js:116:8), <anonymous>:5:1
[all...] |
| /external/chromium_org/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/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/chromium_org/third_party/WebKit/Source/wtf/ |
| Assertions.cpp | 226 void WTFGetBacktrace(void** stack, int* size)
229 *size = backtrace(stack, *size);
243 *size = captureStackBackTraceFunc(0, *size, stack, 0);
262 void WTFPrintBacktrace(void** stack, int size)
269 if (dladdr(stack[i], &info) && info.dli_sname)
276 printf_stderr_common("%-3d %p %s\n", frameNumber, stack[i], cxaDemangled ? cxaDemangled : mangledName);
278 printf_stderr_common("%-3d %p\n", frameNumber, stack[i]);
325 // Needed otherwise we are going to dump the stack trace twice
|
| /external/chromium_org/tools/memory_watcher/ |
| call_stack.cc | 64 // watching code may cause recursion, which may obscure the stack for the truly
105 // Load the symbols for generating stack traces.
206 pc = pc + (frame_count_ * 13); // Alter the PC based on position in stack.
254 // Walk the stack.
273 continue; // End of stack.
294 // Iterate through each frame in the call stack.
384 AllocationStack* stack = freelist_; local
386 stack->next_ = NULL;
387 return stack;
394 AllocationStack *stack = reinterpret_cast<AllocationStack*>(ptr) local
[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 | 35 import java.util.Stack;
757 // We push the parent first, then the child on the stack.
758 Stack<SsaBasicBlock> stack = new Stack<SsaBasicBlock>(); local
767 stack.add(null); // Start with null parent.
768 stack.add(rootBlock);
770 while (stack.size() > 0) {
771 SsaBasicBlock cur = stack.pop();
772 SsaBasicBlock parent = stack.pop()
797 Stack<SsaBasicBlock> stack = new Stack<SsaBasicBlock>(); local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| TextEditorModel.js | 458 * @param {Array.<WebInspector.TextEditorCommand>} stack
461 _doUndo: function(stack)
464 for (var i = stack.length - 1; i >= 0; --i) {
465 var command = stack[i];
466 stack.length = i;
469 if (i > 0 && stack[i - 1].explicit)
662 var stack = [];
673 stack.push(brace.token);
674 else if (stack.length === 0)
680 else if (!this._matches(brace.token, stack.pop())
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| memory_region_map.cc | 47 // HeapLeakChecker uses the regions and the associated stack traces
87 // static fixed-sized stack (saved_regions and saved_buckets), when the
89 // this stack and move the data from saved_regions and saved_buckets to its
255 MyAllocator::Free(bucket->stack, 0);
364 RAW_VLOG(10, "Stack at %p is inside region %p..%p",
389 // Lookup stack trace in table
395 std::equal(key, key + depth, bucket->stack)) {
409 bucket->stack = key_copy;
422 bucket->stack = key_copy;
467 // and its call stack data: it's safe to do it now
[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...] |
