| /external/libvpx/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...] |
| /dalvik/vm/compiler/template/mips/ |
| TEMPLATE_INVOKE_METHOD_NO_OPT.S | 12 SAVEAREA_FROM_FP(a1, rFP) # a1<- stack save area
15 SAVEAREA_FROM_FP(t0, a1) # t0<- stack save area
19 RETURN # return to raise stack overflow excep.
|
| TEMPLATE_INVOKE_METHOD_NATIVE.S | 6 SAVEAREA_FROM_FP(a1, rFP) # a1<- stack save area
9 SAVEAREA_FROM_FP(t0, a1) # t0<- stack save area
11 RETURN # return to raise stack overflow excep.
38 SAVEAREA_FROM_FP(rBIX, a1) # rBIX<- new stack save area
|
| /external/bison/data/ |
| lalr1.cc | 31 m4_include(b4_pkgdatadir/[stack.hh])
51 #include "stack.hh"
140 /// State stack type.
141 typedef stack<state_type> state_stack_type;
142 /// Semantic value stack type.
143 typedef stack<semantic_type> semantic_stack_type;
144 /// location stack type.
145 typedef stack<location_type> location_stack_type;
147 /// The state stack.
149 /// The semantic value stack
[all...] |
| /external/chromium_org/third_party/yasm/source/patched-yasm/modules/objfmts/bin/tests/multisect/ |
| ldlinux-sects.asm | 25 [section .stack nobits align=16 start=STACK_START]
27 [section .stack nobits align=16 start=STACK_START]
28 [section .stack nobits align=16 start=STACK_START]
|
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-117794.js | 42 print(exc2.stack);
50 print(exc3.stack);
56 print(exc1.stack);
|
| /external/v8/test/mjsunit/regress/ |
| regress-117794.js | 42 print(exc2.stack);
50 print(exc3.stack);
56 print(exc1.stack);
|
| /frameworks/base/services/java/com/android/server/am/ |
| ActivityRecord.java | 56 * An entry in the history stack, representing an activity.
144 private boolean inHistory; // are we in the history stack?
486 Slog.d(TAG, "!!! REMOVE THIS LOG !!! setTask: nearly removed stack=" +
487 (newTask == null ? null : newTask.stack));
639 // stack.
642 && task.stack.topRunningActivityLocked(null) == this))
783 final ActivityStack stack = task.stack; local
826 final ActivityStack stack = task.stack; local
857 final ActivityStack stack = task.stack; local
945 final ActivityStack stack = task.stack; local
[all...] |
| /packages/apps/UnifiedEmail/src/com/android/mail/ui/ |
| FolderSelectorAdapter.java | 241 final Deque<TreeNode> stack = new ArrayDeque<TreeNode>(10); local
242 stack.push(root);
244 while ((currentNode = stack.poll()) != null) {
245 final TreeNode parentNode = stack.peek();
271 stack.push(currentNode);
273 stack.push(childNode);
|
| /dalvik/hit/src/com/android/hit/ |
| ArrayInstance.java | 28 public ArrayInstance(long id, StackTrace stack, int type, int numEntries,
31 mStack = stack;
|
| /dalvik/vm/alloc/ |
| HeapSource.cpp | 556 * Create a stack big enough for the worst possible case, where the
558 * TODO: be better about memory usage; use a smaller stack with
561 static bool allocMarkStack(GcMarkStack *stack, size_t maximumSize)
563 const char *name = "dalvik-mark-stack";
566 assert(stack != NULL);
567 stack->length = maximumSize * sizeof(Object*) /
569 addr = dvmAllocRegion(stack->length, PROT_READ | PROT_WRITE, name);
573 stack->base = (const Object **)addr;
574 stack->limit = (const Object **)((char *)addr + stack->length)
[all...] |
| /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
10 bxlo lr @ return to raise stack overflow excep.
34 SAVEAREA_FROM_FP(r10, r1) @ r10<- new stack save area
|
| /external/chromium_org/build/android/pylib/utils/ |
| reraiser_thread.py | 80 """Join all threads without stack dumps.
116 stack = sys._current_frames()[thread.ident]
118 logging.critical('Stack dump for timed out thread \'%s\'', thread.name)
120 for filename, lineno, name, line in traceback.extract_stack(stack):
|
| /external/chromium_org/chrome/browser/ui/views/panels/ |
| panel_view.cc | 477 // in a stack.
479 if (!panel_->stack())
541 // panel window has the same problem as the stack window. However,
793 StackedPanelCollection* stack = panel_->stack(); local
794 if (stack) {
798 if (panel_->stack()->GetPanelBelow(panel_.get())) {
810 Panel* below_panel = stack->GetPanelBelow(panel_.get());
833 StackedPanelCollection* stack = panel_->stack(); local
[all...] |
| /external/chromium_org/chrome/test/base/ |
| chrome_test_launcher.cc | 7 #include <stack>
120 std::stack<linked_ptr<views::AcceleratorHandler> > handlers_;
|
| /external/chromium_org/content/browser/indexed_db/ |
| indexed_db_transaction.h | 10 #include <stack>
127 std::stack<Operation*> stack_;
|
| /external/chromium_org/third_party/WebKit/Source/bindings/v8/ |
| IDBBindingUtilities.cpp | 75 static PassRefPtr<IDBKey> createIDBKeyFromValue(v8::Handle<v8::Value> value, Vector<v8::Handle<v8::Array> >& stack)
86 if (stack.contains(array))
88 if (stack.size() >= maximumDepth)
90 stack.append(array);
96 RefPtr<IDBKey> subkey = createIDBKeyFromValue(item, stack);
103 stack.removeLast();
111 Vector<v8::Handle<v8::Array> > stack; local
112 RefPtr<IDBKey> key = createIDBKeyFromValue(value, stack);
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/cm/ |
| matchbrackets.js | 19 var stack = [line.text.charAt(pos)], re = /[(){}[\]]/;
29 if (match.charAt(1) == ">" == forward) stack.push(ch);
30 else if (stack.pop() != match.charAt(0)) return {pos: pos, match: false};
31 else if (!stack.length) return {pos: pos, match: true};
|
| /external/chromium_org/third_party/angle_dx11/src/compiler/depgraph/ |
| DependencyGraphBuilder.h | 27 typedef std::stack<TGraphSymbol*> TSymbolStack;
34 // This data structure is stack of sets. Each set contains dependency graph parent nodes.
94 typedef std::stack<TParentNodeSet*> TParentNodeSetStack;
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.cpp | 26 #include <stack>
171 std::stack<const Node *> stack; local
175 stack.push(node);
177 while (!stack.empty()) {
178 pos = stack.top();
179 stack.pop();
190 stack.push(ei.getNode());
286 Stack bb, cross;
|
| /external/chromium_org/third_party/npapi/npspy/extern/nspr/private/ |
| pprthred.h | 61 ** "stack" defines the shape of the threads stack
72 PRThreadStack *stack);
165 PRThreadStack *stack);
190 ** Return the thread stack pointer of the given thread.
232 ** Signature of a thread stack scanning function. It is applied to every
242 ** within a thread. This includes the stack, registers, and thread-local
257 ** Returns a conservative estimate on the amount of stack space left
348 ** An EXCEPTIONREGISTRATIONRECORD must be declared on the stack and its
|
| /external/chromium_org/third_party/re2/util/ |
| util.h | 27 #include <stack>
44 using std::stack;
|
| /external/chromium_org/v8/src/ |
| hydrogen-bce.cc | 108 // Traversing the dominator tree we keep a stack (implemented as a singly
336 // Allocate the stack.
337 HBoundsCheckEliminationState* stack = local
341 stack[0].block_ = entry;
342 stack[0].bb_data_list_ = PreProcessBlock(entry);
343 stack[0].index_ = 0;
346 // Implement depth-first traversal with a stack.
349 HBoundsCheckEliminationState* state = &stack[current];
356 stack[next].block_ = child;
357 stack[next].bb_data_list_ = PreProcessBlock(child)
[all...] |
