| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-1118.js | 30 // An exception thrown in a function optimized by on-stack replacement (OSR)
31 // should be able to construct a receiver from all optimized stack frames.
|
| regress-1184.js | 28 // Test the case when finally clause throws another exception (stack overflow)
41 // stack with catcher set while processing exception
|
| /external/chromium_org/v8/test/mjsunit/tools/ |
| profile.js | 32 function stackToString(stack) {
33 return stack.join(' -> ');
88 // Stack looks like this: [pc, caller, ..., main].
191 var stack = stackToString(path);
192 assertNotNull(node, 'node not found: ' + stack);
193 assertEquals(selfTicks, node.selfWeight, 'self of ' + stack);
194 assertEquals(totalTicks, node.totalWeight, 'total of ' + stack);
243 // Only count each function in the stack once.
|
| /external/dropbear/libtomcrypt/src/headers/ |
| tomcrypt_custom.h | 77 /* clean the stack of functions which put private information on stack */
|
| /external/kernel-headers/original/asm-arm/ |
| smp.h | 65 * This also gives us the initial stack to use for this CPU.
85 void *stack; member in struct:secondary_data
|
| /external/kernel-headers/original/asm-mips/ |
| ptrace.h | 27 * This struct defines the way the registers are stored on the stack during a
32 /* Pad bytes for argument save space on the stack. */
|
| /external/libnfc-nci/halimpl/bcm2079x/gki/common/ |
| gki_debug.c | 102 ** stack used by looking non magic num. Magic num is consider
103 ** the first byte in the stack.
105 ** Returns the number of unused byte on the stack. 4 in case of stack overrun
115 p = (UINT32 *)gki_cb.com.OSStack[task]; /* assume stack is aligned, */
130 ** Description Print task stack usage.
142 GKI_TRACE_0("TID TASKNAME STATE FREE_STACK STACK");
261 print("TID VID TASKNAME STATE WAIT WAITFOR TIMEOUT STACK\n");
|
| /external/libnfc-nci/src/gki/common/ |
| gki_debug.c | 102 ** stack used by looking non magic num. Magic num is consider
103 ** the first byte in the stack.
105 ** Returns the number of unused byte on the stack. 4 in case of stack overrun
115 p = (UINT32 *)gki_cb.com.OSStack[task]; /* assume stack is aligned, */
130 ** Description Print task stack usage.
142 GKI_TRACE_0("TID TASKNAME STATE FREE_STACK STACK");
261 print("TID VID TASKNAME STATE WAIT WAITFOR TIMEOUT STACK\n");
|
| /external/libnfc-nci/src/nfa/dm/ |
| nfa_dm_cfg.c | 48 /* the SetConfig for optional general NFC stack functions */
92 /* set to NULL to use the default mapping set by stack */
|
| /external/llvm/lib/CodeGen/ |
| TargetFrameLoweringImpl.cpp | 10 // Implements the layout of a stack frame on the target machine.
26 /// the stack frame of the specified index. This is the default implementation
|
| /external/llvm/lib/Target/Hexagon/ |
| Hexagon.h | 72 // allocframe saves LR and FP on stack before allocating
73 // a new stack frame. This takes 8 bytes.
|
| /external/llvm/lib/Target/SystemZ/MCTargetDesc/ |
| SystemZMCTargetDesc.h | 32 // a stack frame.
35 // The offset of the DWARF CFA from the incoming stack pointer.
|
| /external/llvm/test/CodeGen/X86/ |
| 2009-09-10-LoadFoldingBug.ll | 3 ; It's not legal to fold a load from 32-bit stack slot into a 64-bit
7 ; can simply turn it into a 32-bit load from the stack slot.
|
| /external/marisa-trie/lib/marisa/ |
| trie-inline.h | 259 Vector<Cell> stack; local
260 stack.push_back(cell);
263 Cell &cur = stack[stack_pos - 1];
287 if (stack_pos == stack.size()) {
291 stack.push_back(cell);
293 stack[stack_pos].set_length(key.length());
294 stack[stack_pos - 1].set_node(stack[stack_pos - 1].node() + 1);
|
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| trie-inline.h | 264 Vector<Cell> stack; local
265 stack.push_back(cell);
268 Cell &cur = stack[stack_pos - 1];
292 if (stack_pos == stack.size()) {
296 stack.push_back(cell);
298 stack[stack_pos].set_length(key.length());
299 stack[stack_pos - 1].set_node(stack[stack_pos - 1].node() + 1);
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_debug_stack.c | 30 * Stack backtracing.
82 /* Limit the stack walk to avoid referencing undefined memory */
|
| /external/mesa3d/src/gallium/drivers/radeon/ |
| AMDILFrameLowering.cpp | 10 // Interface to describe a layout of a stack frame on a AMDIL target machine
28 /// the stack frame of the specified index.
|
| /external/nist-sip/java/gov/nist/core/net/ |
| AddressResolver.java | 36 * schemes and register it with the stack.
40 * implement this interface and register it with the stack using
|
| /external/nist-sip/java/gov/nist/javax/sip/stack/ |
| ServerRequestInterface.java | 29 package gov.nist.javax.sip.stack;
35 * This is implemented by the application. The stack calls the message
|
| ServerResponseInterface.java | 29 package gov.nist.javax.sip.stack;
39 * This is implemented by the application. The stack calls the message
|
| /external/openfst/src/extensions/pdt/ |
| pdtexpand.cc | 20 // Expands a (bounded-stack) PDT as an FST.
35 string usage = "Expand a (bounded-stack) PDT as an FST.\n\n Usage: ";
|
| pdtshortestpath.cc | 20 // Return the shortest path in a (bounded-stack) PDT.
36 string usage = "Shortest path in a (bounded-stack) PDT.\n\n Usage: ";
|
| /external/v8/src/ |
| vm-state-inl.h | 38 // VMState class implementation. A simple stack of VM states held by the
39 // logger and partially threaded through the call stack. States are pushed by
|
| /external/v8/test/mjsunit/regress/ |
| regress-1118.js | 30 // An exception thrown in a function optimized by on-stack replacement (OSR)
31 // should be able to construct a receiver from all optimized stack frames.
|
| regress-1184.js | 28 // Test the case when finally clause throws another exception (stack overflow)
41 // stack with catcher set while processing exception
|
