| /ndk/tests/device/test-gnustl-full/unit/ |
| stack_test.cpp | 5 #include <stack>
35 stack<int, deque<int> > s;
49 stack<int, list<int> > s;
|
| /ndk/tests/device/test-stlport/unit/ |
| stack_test.cpp | 5 #include <stack>
35 stack<int, deque<int> > s;
49 stack<int, list<int> > s;
|
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| ElemContext.java | 24 * This class is a stack frame that consists of
36 * A stack frame will be pushed for "A" at depth 1,
38 * Then "B1" stackframe is popped. When the stack frame for "B2" is
39 * pushed, this implementation re-uses the old stack fram object used
94 /** The next element "stack frame". This value will only be
95 * set once as deeper stack frames are not deleted when popped off,
98 * This makes for very fast pushing and popping of stack frames
99 * because very few stack frame objects are ever created, they are
103 * as they are re-used. Only the reference to the current stack frame, which
108 /** The previous element "stack frame". *
[all...] |
| /external/bouncycastle/src/main/java/org/bouncycastle/asn1/ |
| DEROutputStream.java | 69 byte[] stack = new byte[5];
70 int pos = stack.length;
72 stack[--pos] = (byte)(tagNo & 0x7F);
77 stack[--pos] = (byte)(tagNo & 0x7F | 0x80);
81 write(stack, pos, stack.length - pos);
|
| /external/valgrind/main/exp-ptrcheck/tests/ |
| stackerr.stderr.exp-glibc27-x86 | 7 Expected: stack array "a" in frame 2 back from here
8 Actual: stack array "beforea" in frame 2 back from here
13 Expected: stack array "a" in this frame
14 Actual: stack array "beforea" in this frame
23 Expected: stack array "buf" in frame 4 back from here
24 Actual: stack array "beforebuf" in frame 4 back from here
|
| /sdk/emulator/qtools/ |
| check_stack.cpp | 45 class Stack {
51 Stack() {
60 void Stack::push(frame *pframe) {
62 fprintf(stderr, "Error: stack overflow\n");
69 frame *Stack::pop() {
76 Stack *mStacks[kMaxThreads];
121 // Get the stack for the current thread
122 Stack *mStack = mStacks[proc->pid];
124 // If the stack does not exist, then allocate a new one.
126 mStack = new Stack();
[all...] |
| read_method.cpp | 26 class Stack {
32 Stack() {
41 void Stack::push(frame *pframe) {
43 fprintf(stderr, "Error: stack overflow\n");
50 frame *Stack::pop() {
57 void Stack::dump() {
70 Stack *stacks[kMaxThreads];
115 // Get the stack for the current thread
116 Stack *pStack = stacks[proc->pid];
118 // If the stack does not exist, then allocate a new one
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| IntStack.java | 26 * Implement a stack of simple integers.
67 * Pushes an item onto the top of this stack.
69 * @param i the int to be pushed onto this stack.
94 * Removes the object at the top of this stack and returns that
97 * @return The object at the top of this stack.
105 * Quickly pops a number of items from the stack.
114 * Looks at the object at the top of this stack without removing it
115 * from the stack.
117 * @return the object at the top of this stack.
118 * @throws EmptyStackException if this stack is empty
[all...] |
| ObjectStack.java | 26 * Implement a stack of simple integers.
67 * Pushes an item onto the top of this stack.
69 * @param i the int to be pushed onto this stack.
94 * Removes the object at the top of this stack and returns that
97 * @return The object at the top of this stack.
108 * Quickly pops a number of items from the stack.
117 * Looks at the object at the top of this stack without removing it
118 * from the stack.
120 * @return the object at the top of this stack.
121 * @throws EmptyStackException if this stack is empty
[all...] |
| /external/llvm/test/FrontendC/ |
| 2002-02-13-UnnamedLocal.c | 4 * and did not have a VAR_DECL that explained the stack slot to LLVM.
5 * Now the LLVM code synthesizes a stack slot if one is presented that
|
| /external/valgrind/main/drd/tests/ |
| read_after_free.vgtest | 2 vgopts: --read-var-info=yes --check-stack-var=yes --free-is-write=yes --show-confl-seg=no
6 vgopts: --read-var-info=yes --check-stack-var=yes --free-is-write=yes --show-confl-seg=no
|
| sem_as_mutex3.stderr.exp | 7 (thread finished, call stack no longer available)
9 (thread finished, call stack no longer available)
|
| sem_open3.stderr.exp | 7 (thread finished, call stack no longer available)
9 (thread finished, call stack no longer available)
|
| /external/valgrind/main/none/tests/ |
| nestedfns.c | 4 modifying code on the stack, at least on x86 and amd64. It now
6 self-checking translations for translations taken from stack-like
|
| /external/pcre/doc/html/ |
| pcrestack.html | 16 PCRE DISCUSSION OF STACK USAGE
40 <b>pcre_dfa_exec()</b> to run out of stack. At present, there is no protection
48 Reducing <b>pcre_exec()</b>'s stack usage
52 from the process stack. For certain kinds of pattern and data, very large
53 amounts of stack may be needed, despite the recognition of "tail recursion".
54 You can often reduce the amount of recursion, and therefore the amount of stack
64 parenthesis is processed, a recursion occurs, so this formulation uses a stack
65 frame for each matched character. For a long string, a lot of stack is
71 This uses very much less stack, because runs of characters that do not contain
76 stack usage
[all...] |
| /external/chromium/base/ |
| stack_container.h | 14 // This allocator can be used with STL containers to provide a stack buffer
15 // from which to allocate memory and overflows onto the heap. This stack buffer
16 // would be allocated on the stack and allows us to avoid heap operations in
23 // based on our allocator will share the same stack buffer.
25 // This stack buffer implementation is very simple. The first allocation that
26 // fits in the stack buffer will use the stack buffer. Any subsequent
27 // allocations will not use the stack buffer, even if there is unused room.
29 // be sure to reserve() in the container up to the stack buffer size. Otherwise
30 // the container will allocate a small array which will "use up" the stack
[all...] |
| /external/llvm/include/llvm/Target/ |
| TargetFrameLowering.h | 10 // Interface to describe the layout of a stack frame on the target machine.
31 /// Information about stack frame layout on the target. It holds the direction
32 /// of stack growth, the known stack alignment on entry to each function, and
35 /// The offset to the local area is the offset from the stack pointer on
41 StackGrowsUp, // Adding to the stack increases the stack address
42 StackGrowsDown // Adding to the stack decreases the stack address
45 // Maps a callee saved register to a stack slot with a fixed offset
[all...] |
| /dalvik/dx/src/com/android/dx/cf/code/ |
| package.html | 3 is needed for verification or stack-to-register conversion.</p>
|
| /dalvik/dx/tests/076-dex-synch-and-stack/ |
| info.txt | 2 the synchronized method conversion doesn't interact poorly with stack
|
| /dalvik/vm/mterp/armv5te/ |
| OP_NOP.S | 7 /* insert fake function header to help gdb find the stack frame */
|
| /external/bluetooth/bluez/ |
| bluez.pc.in | 7 Description: Bluetooth protocol stack for Linux
|
| /external/bluetooth/glib/build/win32/vs8/ |
| README | 4 GTK+ stack) with Visual Studio.
|
| /external/bluetooth/glib/build/win32/vs9/ |
| README | 4 GTK+ stack) with Visual Studio.
|
| /external/libffi/src/pa/ |
| ffi.c | 82 /* PA has a downward growing stack, which looks like this:
99 The first four argument words on the stack are reserved for use by
111 The registers are allocated in the same manner as stack slots.
112 This allows the callee to save its arguments on the stack if
123 The rest of the arguments are passed on the stack starting at SP-52,
127 or in the stack. */
129 /* ffi_prep_args is called by the assembly routine once stack space
132 The following code will put everything into the stack frame
140 void ffi_prep_args_pa32(UINT32 *stack, extended_cif *ecif, unsigned bytes)
149 debug(1, "%s: stack = %p, ecif = %p, bytes = %u\n", __FUNCTION__, stack
[all...] |
| /external/llvm/test/Archive/ |
| IsNAN.o | |
