| /external/speex/libspeex/ |
| vq.c | 76 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)
110 void vq_nbest_sign(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)
|
| /external/v8/src/compiler/ |
| control-equivalence.h | 74 Node* node; // Node that this stack entry belongs to.
77 // The stack is used during the undirected DFS walk.
84 bool on_stack; // Indicates node is on DFS stack during walk.
151 // Mutates the DFS stack by pushing an entry.
152 void DFSPush(DFSStack& stack, Node* node, Node* from, DFSDirection dir);
154 // Mutates the DFS stack by popping an entry.
155 void DFSPop(DFSStack& stack, Node* node);
|
| /external/v8/src/crankshaft/ |
| hydrogen-bce.cc | 87 // Traversing the dominator tree we keep a stack (implemented as a singly
352 // Allocate the stack.
353 HBoundsCheckEliminationState* stack = local
357 stack[0].block_ = entry;
358 stack[0].bb_data_list_ = PreProcessBlock(entry);
359 stack[0].index_ = 0;
362 // Implement depth-first traversal with a stack.
365 HBoundsCheckEliminationState* state = &stack[current];
372 stack[next].block_ = child;
373 stack[next].bb_data_list_ = PreProcessBlock(child)
[all...] |
| /external/v8/test/mjsunit/ |
| debug-break-native.js | 33 new Error("123").stack; // break
|
| debug-evaluate-locals-capturing.js | 23 print(e, e.stack);
|
| debug-evaluate-modify-catch-block-scope.js | 20 print(e + e.stack);
|
| /external/v8/test/mjsunit/es6/debug-promises/ |
| reject-caught-late.js | 29 %AbortJS(e + "\n" + e.stack);
|
| reject-caught-uncaught.js | 31 %AbortJS(e + "\n" + e.stack);
|
| throw-caught-late.js | 29 %AbortJS(e + "\n" + e.stack);
|
| throw-caught-uncaught.js | 31 %AbortJS(e + "\n" + e.stack);
|
| /external/v8/test/mjsunit/es6/ |
| debug-stepin-generators.js | 20 print(e, e.stack);
|
| /external/v8/test/mjsunit/harmony/ |
| async-debug-step-next-constant.js | 19 print(e, e.stack);
|
| /external/v8/test/mjsunit/ignition/ |
| elided-instruction.js | 21 print(e + e.stack);
|
| /external/v8/test/mjsunit/regress/ |
| regress-crbug-409614.js | 24 print(e + e.stack);
|
| regress-crbug-467180.js | 26 print("Caught something. " + e + " " + e.stack);
|
| regress-crbug-469768.js | 6 // sneak through the system of stack checks.
|
| regress-crbug-568477-2.js | 21 %AbortJS(e + "\n" + e.stack);
|
| regress-crbug-568477-4.js | 18 %AbortJS(e + "\n" + e.stack);
|
| regress-crbug-582048.js | 22 print(e, e.stack);
|
| regress-crbug-593282.js | 5 // Flags: --expose-gc --stack-size=120
|
| /external/valgrind/coregrind/m_syswrap/ |
| syscall-mips32-linux.S | 73 Int nsigwords) // stack
164 addu $29, $29, 56 #release the stack frame.
186 addu $29, $29, 56 #release the stack frame.
209 /* Let the linker know we don't need an executable stack */
|
| /external/valgrind/gdbserver_tests/ |
| mcsignopass.stderr.exp | 5 Address 0x........ is not stack'd, malloc'd or (recently) free'd
|
| mcsigpass.stderr.exp | 5 Address 0x........ is not stack'd, malloc'd or (recently) free'd
|
| /frameworks/compile/mclinker/include/mcld/MC/ |
| InputBuilder.h | 16 #include <stack>
94 std::stack<InputTree::iterator> m_ReturnStack;
|
| /frameworks/compile/mclinker/lib/Script/ |
| RpnEvaluator.cpp | 22 #include <stack>
34 std::stack<Operand*> operandStack;
107 // stack top is result
|
