| /external/clang/test/SemaCXX/ |
| return-stack-addr.cpp | 5 return &x; // expected-warning {{address of stack memory}}
10 return x; // expected-warning {{address of stack memory}}
15 return &x[i]; // expected-warning {{address of stack memory}}
20 return &i[x]; // expected-warning {{address of stack memory}}
25 return &x[2]; // expected-warning {{address of stack memory}}
30 return x; // expected-warning {{reference to stack memory}}
35 return &*&x; // expected-warning {{address of stack memory}}
40 return (&(*(&x))); // expected-warning {{address of stack memory}}
45 return &*(&x+1); // expected-warning {{address of stack memory}}
50 return &*(&x+1); // expected-warning {{address of stack memory}
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| Stack.java | 21 * {@code Stack} is a Last-In/First-Out(LIFO) data structure which represents a
22 * stack of objects. It enables users to pop to and push from the stack,
23 * including null objects. There is no limit to the size of the stack.
25 public class Stack<E> extends Vector<E> {
30 * Constructs a stack with the default size of {@code Vector}.
32 public Stack() {
36 * Returns whether the stack is empty or not.
38 * @return {@code true} if the stack is empty, {@code false} otherwise.
45 * Returns the element at the top of the stack without removing it
[all...] |
| /dalvik/dx/src/com/android/dx/cf/code/ |
| ExecutionStack.java | 26 * Representation of a Java method execution stack.
33 /** {@code non-null;} array of stack contents */
34 private final TypeBearer[] stack; field in class:ExecutionStack
37 * {@code non-null;} array specifying whether stack contents have entries
42 * {@code >= 0;} stack pointer (points one past the end) / current stack
50 * @param maxStack {@code >= 0;} the maximum size of the stack for this
55 stack = new TypeBearer[maxStack];
66 ExecutionStack result = new ExecutionStack(stack.length);
68 System.arraycopy(stack, 0, result.stack, 0, stack.length)
[all...] |
| /external/webkit/Tools/Scripts/webkitpy/common/system/ |
| stack_utils.py | 29 """Simple routines for logging, obtaining thread stack information."""
37 stack = _find_thread_stack(thread_id)
38 assert(stack is not None)
41 _log_stack(logger, stack)
46 """Returns a stack object that can be used to dump a stack trace for
48 for tid, stack in sys._current_frames().items():
50 return stack
54 def _log_stack(logger, stack):
55 """Log a stack trace to the logger callback.""
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| StackTest.java | 21 import java.util.Stack;
25 Stack s;
28 * @tests java.util.Stack#Stack()
31 // Test for method java.util.Stack()
32 assertEquals("Stack creation failed", 0, s.size());
36 * @tests java.util.Stack#empty()
39 // Test for method boolean java.util.Stack.empty()
40 assertTrue("New stack answers non-empty", s.empty());
42 assertTrue("Stack should not be empty but answers empty", !s.empty())
[all...] |
| /cts/tools/dasm/src/java_cup/runtime/ |
| virtual_parse_stack.java | 4 import java.util.Stack;
6 /** This class implements a temporary or "virtual" parse stack that
7 * replaces the top portion of the actual parse stack (the part that
13 * reverts to the original parse stack (which has not actually been
15 * state is maintained on the virtual stack, not full symbol objects.
27 /** Constructor to build a virtual stack out of a real stack. */
28 public virtual_parse_stack(Stack shadowing_stack) throws java.lang.Exception
33 "Internal parser error: attempt to create null virtual stack");
37 vstack = new Stack();
[all...] |
| /external/valgrind/main/memcheck/tests/linux/ |
| stack_changes.c | 11 // checks that Valgrind notices their stack changes properly.
28 void *stack; local
37 stack = (void *)mmap(0, STACK_SIZE, PROT_READ|PROT_WRITE|PROT_EXEC,
40 if (stack == (void*)-1) {
45 ret = VALGRIND_STACK_REGISTER(stack, stack + STACK_SIZE);
48 uc->uc_stack.ss_sp = stack;
|
| /external/bluetooth/glib/docs/reference/glib/tmpl/ |
| trash_stack.sgml | 5 maintain a stack of unused allocated memory chunks
9 A #GTrashStack is an efficient way to keep a stack of unused allocated
11 a #gpointer. This allows the stack to be maintained without any space
12 overhead, since the stack pointers can be stored inside the memory chunks.
16 is a perfectly valid empty stack.
29 Each piece of memory that is pushed onto the stack
33 @next: pointer to the previous element of the stack,
43 @data_p: the piece of memory to push on the stack.
52 @Returns: the element at the top of the stack.
61 @Returns: the element at the top of the stack
[all...] |
| /external/valgrind/main/memcheck/tests/ |
| execve.stderr.exp | 3 Address 0x........ is not stack'd, malloc'd or (recently) free'd
7 Address 0x........ is not stack'd, malloc'd or (recently) free'd
11 Address 0x........ is not stack'd, malloc'd or (recently) free'd
|
| supp_unknown.stderr.exp | 6 If you believe this happened as a result of a stack
9 main thread stack using the --main-stacksize= flag.
10 The main thread stack size used in this run was ....
|
| /external/valgrind/main/none/tests/linux/ |
| blockfault.stderr.exp | 6 If you believe this happened as a result of a stack
9 main thread stack using the --main-stacksize= flag.
10 The main thread stack size used in this run was ....
|
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| NamespaceMappings.java | 31 * prefix/uri/depth triplets are pushed on a stack pushed on a stack. The depth
47 * "def" is pushed on the stack with depth 1.
52 * stack. Of course popNamespaces(2) would pop anything with depth 2 or
55 * So prefix/uri pairs are pushed and poped off the stack as elements are
57 * are on the stack and a prefix can be found given a uri, or a uri can be found
73 * Each entry (prefix) in this hashtable points to a Stack of URIs
74 * This table maps a prefix (String) to a Stack of NamespaceNodes.
75 * All Namespace nodes in that retrieved stack have the same prefix,
76 * though possibly different URI's or depths. Such a stack must hav
119 Stack stack; local
141 final Stack stack = getPrefixStack(prefix); local
152 final Stack stack = (Stack) m_namespaces.get(prefix); local
210 Stack stack; local
233 Stack stack; local
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_stack.h | 0 // Stack implementation -*- C++ -*-
78 * first-in-last-out %stack behavior.
88 * push, @c pop, and @c top, which are standard %stack/FILO
92 class stack class
102 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
106 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
126 stack(const _Sequence& __c = _Sequence()) function in class:stack
130 stack(const _Sequence& __c function in class:stack
134 stack(_Sequence&& __c = _Sequence()) function in class:stack
[all...] |
| /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_stack.h | 0 // Stack implementation -*- C++ -*-
78 * first-in-last-out %stack behavior.
88 * push, @c pop, and @c top, which are standard %stack/FILO
92 class stack class
102 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
106 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
126 stack(const _Sequence& __c = _Sequence()) function in class:stack
130 stack(const _Sequence& __c function in class:stack
134 stack(_Sequence&& __c = _Sequence()) function in class:stack
[all...] |
| /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_stack.h | 0 // Stack implementation -*- C++ -*-
78 * first-in-last-out %stack behavior.
88 * push, @c pop, and @c top, which are standard %stack/FILO
92 class stack class
102 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
106 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
126 stack(const _Sequence& __c = _Sequence()) function in class:stack
130 stack(const _Sequence& __c function in class:stack
134 stack(_Sequence&& __c = _Sequence()) function in class:stack
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| BoolStack.java | 25 * Simple stack for boolean values.
73 * Clears the stack.
82 * Pushes an item onto the top of this stack.
85 * @param val the boolean to be pushed onto this stack.
98 * Removes the object at the top of this stack and returns that
101 * @return The object at the top of this stack.
102 * @throws EmptyStackException if this stack is empty.
110 * Removes the object at the top of this stack and returns the
125 * Set the item at the top of this stack
128 * @param b Object to set at the top of this stack
[all...] |
| /external/llvm/test/Object/TestObjectFiles/ |
| trivial-object-test.elf-i386 | |
| /external/nist-sip/java/gov/nist/javax/sip/stack/ |
| RawMessageChannel.java | 1 package gov.nist.javax.sip.stack;
|
| /external/proguard/src/proguard/classfile/attribute/preverification/ |
| FullFrame.java | 37 public VerificationType[] stack; field in class:FullFrame
49 * Creates a FullFrame with the given variables and stack.
53 VerificationType[] stack)
58 stack.length,
59 stack);
64 * Creates a FullFrame with the given variables and stack.
70 VerificationType[] stack)
76 this.stack = stack;
93 * Applies the given verification type visitor to all stack
[all...] |
| /external/stlport/etc/ |
| std_headers.txt | 27 stack
|
| /external/valgrind/main/drd/tests/ |
| annotate_hb_race.vgtest | 2 vgopts: --check-stack-var=yes --show-confl-seg=no
|
| annotate_ignore_rw.vgtest | 2 vgopts: --read-var-info=yes --check-stack-var=yes --show-confl-seg=no
|
| annotate_ignore_write.vgtest | 2 vgopts: --read-var-info=yes --check-stack-var=yes --show-confl-seg=no
|
| hg05_race2.vgtest | 2 vgopts: --read-var-info=yes --check-stack-var=yes --num-callers=2
|
| omp_matinv.vgtest | 3 vgopts: --check-stack-var=yes --read-var-info=yes
|
