| /external/valgrind/main/memcheck/tests/ |
| deep_templates.cpp | 11 class Stack
14 Stack(int = 10) { size=5; top=6; stackPtr=(T*)6; };
15 ~Stack() { }
27 typedef Stack<int,char> Foo;
28 typedef Stack<Foo,Foo> Foo2;
29 typedef Stack<Foo2,Foo2> Foo3;
30 typedef Stack<Foo3,Foo3> Foo4;
31 typedef Stack<Foo4,Foo4> Foo5;
32 typedef Stack<Foo5,Foo5> Foo6;
33 typedef Stack<Foo6,Foo6> Foo7
[all...] |
| /frameworks/base/tools/layoutlib/bridge/src/com/android/layoutlib/bridge/impl/ |
| Stack.java | 22 * Custom Stack implementation on top of an {@link ArrayList} instead of
23 * using {@link java.util.Stack} which is on top of a vector.
27 public class Stack<T> extends ArrayList<T> {
31 public Stack() {
35 public Stack(int size) {
40 * Pushes the given object to the stack
48 * Remove the object at the top of the stack and returns it.
49 * @return the removed object or null if the stack was empty.
60 * Returns the object at the top of the stack.
61 * @return the object at the top or null if the stack is empty
[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...] |
| /external/llvm/lib/Target/X86/ |
| X86FloatingPoint.cpp | 1 //===-- X86FloatingPoint.cpp - Floating point Reg -> Stack converter ------===//
11 // pseudo registers into register stack instructions. This pass uses live
15 // The x87 hardware tracks liveness of the stack registers, so it is necessary
18 // identical stack positions. Instructions are inserted at the end of each basic
58 memset(Stack, 0, sizeof(Stack));
79 // LiveBundle. It represents a set of CFG edges where the live FP stack
80 // registers must be allocated identically in the x87 stack.
87 // but the exact mapping of FP registers to stack slots is fixed later.
93 // stack order has not yet been fixed
[all...] |
| /sdk/emulator/qtools/ |
| 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...] |
| 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...] |
| /external/clang/include/clang/Serialization/ |
| ModuleManager.h | 72 Stack.reserve(N);
79 /// \brief The stack used when marking the imports of a particular module
81 SmallVector<ModuleFile *, 4> Stack;
|
| /external/clang/lib/Sema/ |
| SemaAttr.cpp | 29 // We just use a sentinel to represent when the stack is set to mac68k
37 /// PragmaPackStack - Simple class to wrap the stack used by #pragma
45 /// Stack - Entries in the #pragma pack stack, consisting of saved
47 stack_ty Stack;
55 /// push - Push the current alignment onto the stack, optionally
59 Stack.push_back(PSE);
62 /// pop - Pop a record from the stack and restore the current
73 // An empty stack is a special case...
74 if (Stack.empty())
[all...] |
| Sema.cpp | 631 SmallVector<Module *, 2> Stack;
632 Stack.push_back(CurrentModule);
633 while (!Stack.empty()) {
634 Module *Mod = Stack.back();
635 Stack.pop_back();
647 Stack.push_back(*Sub);
[all...] |
| /external/giflib/ |
| gif_lib_private.h | 43 StackPtr, /* For character stack (see below). */
51 GifByteType Stack[LZ_MAX_CODE]; /* Decoded pixels are stacked here. */
|
| dgif_lib.c | 714 Private->StackPtr = 0; /* No pixels on the pixel stack. */
739 GifByteType *Stack, *Suffix;
746 Stack = Private->Stack;
756 /* Let pop the stack off before continueing to read the gif file: */
758 Line[i++] = Stack[--StackPtr];
792 * pixels on our stack. If we done, pop the stack in reverse
793 * (thats what stack is good for!) order to output. */
802 Stack[StackPtr++] = DGifGetPrefixChar(Prefix
[all...] |
| /external/llvm/test/Scripts/ |
| coff-dump.py | 236 Stack = []
282 Stack [0:0] = [Input.tell()]
287 assert(len(Stack) > 0)
288 Input.seek(Stack[0])
289 del Stack[0]
|
| /external/valgrind/main/coregrind/ |
| m_stacks.c | 3 /*--- Stack management. m_stacks.c ---*/
41 The stack
43 The stack's segment seems to be dynamically extended downwards by
44 the kernel as the stack pointer moves down. Initially, a 1-page
45 (4k) stack is allocated. When SP moves below that for the first
48 upwards to the current valid stack. It then extends the stack
53 That means that Valgrind can't spot when the stack segment is being
55 update stack permissions around SP, so we need to spot all writes
58 The deal is: when SP is assigned a lower value, the stack is bein
263 Stack* stack = find_stack_by_addr(SP); local
[all...] |
| /external/clang/lib/AST/ |
| NestedNameSpecifier.cpp | 565 SmallVector<NestedNameSpecifier *, 4> Stack;
567 Stack.push_back(NNS);
568 while (!Stack.empty()) {
569 NestedNameSpecifier *NNS = Stack.back();
570 Stack.pop_back();
593 SaveSourceLocation(Stack.empty()? R.getEnd() : R.getBegin(),
|
| CXXInheritance.cpp | 586 SmallVector<OverriddenMethods, 4> Stack;
587 Stack.push_back(std::make_pair(CanonM->begin_overridden_methods(),
589 while (!Stack.empty()) {
590 OverriddenMethods OverMethods = Stack.back();
591 Stack.pop_back();
616 Stack.push_back(std::make_pair(CanonOM->begin_overridden_methods(),
|
| DumpXML.cpp | 174 SmallVector<Node, 16> Stack;
184 /// Push a new node on the stack.
186 if (!Stack.empty()) {
187 assert(Stack.back().isDoneWithAttrs());
188 if (Stack.back().State == NS_LazyChildren) {
189 Stack.back().State = NS_Children;
195 Stack.push_back(Node(name));
201 assert(!Stack.empty() && !Stack.back().isDoneWithAttrs());
207 assert(!Stack.empty() && !Stack.back().isDoneWithAttrs())
[all...] |
| /external/clang/lib/Format/ |
| UnwrappedLineParser.cpp | 27 ScopedDeclarationState(UnwrappedLine &Line, std::vector<bool> &Stack,
29 : Line(Line), Stack(Stack) {
31 Stack.push_back(MustBeDeclaration);
34 Stack.pop_back();
35 if (!Stack.empty())
36 Line.MustBeDeclaration = Stack.back();
42 std::vector<bool> &Stack;
|
| /external/clang/lib/Frontend/ |
| DiagnosticRenderer.cpp | 193 /// \brief Prints an include stack when appropriate for a particular
199 /// of customizing the formatting and display of the include stack.
203 /// \param Level The diagnostic level of the message this stack pertains to.
227 /// \brief Helper to recursivly walk up the include stack and print each layer
241 // import stack rather than the
245 // This location was imported by a module. Emit the module import stack.
257 /// \brief Emit the module import stack associated with the current location.
270 /// \brief Helper to recursivly walk up the import stack and print each layer
292 /// \brief Emit the module build stack, for cases where a module is (re-)built
295 ModuleBuildStack Stack = SM.getModuleBuildStack()
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| CoreEngine.cpp | 44 SmallVector<WorkListUnit,20> Stack;
47 return !Stack.empty();
51 Stack.push_back(U);
55 assert (!Stack.empty());
56 const WorkListUnit& U = Stack.back();
57 Stack.pop_back(); // This technically "invalidates" U, but we are fine.
63 I = Stack.begin(), E = Stack.end(); I != E; ++I) {
110 SmallVector<WorkListUnit,20> Stack;
113 return !Queue.empty() || !Stack.empty()
[all...] |
| /external/llvm/lib/Target/R600/ |
| SIAnnotateControlFlow.cpp | 63 StackVector Stack;
148 /// \brief Is BB the last block saved on the stack ?
150 return !Stack.empty() && Stack.back().first == BB;
153 /// \brief Pop the last saved value from the control flow stack
155 return Stack.pop_back_val().second;
158 /// \brief Push a BB and saved value to the control flow stack
160 Stack.push_back(std::make_pair(BB, Saved));
322 assert(Stack.empty());
|
| /external/proguard/src/proguard/evaluation/ |
| Stack.java | 26 * This class represents an operand stack that contains <code>Value</code>
31 public class Stack
42 * Creates a new Stack with a given maximum size, accounting for the double
45 public Stack(int maxSize)
52 * Creates a Stack that is a copy of the given Stack.
54 public Stack(Stack stack)
57 this(stack.values.length)
[all...] |
| /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...] |
| /external/clang/lib/Serialization/ |
| GlobalModuleIndex.cpp | 242 SmallVector<unsigned, 4> Stack;
248 // If this module is out-of-date, push it onto the stack.
250 Stack.push_back(ID);
259 Stack.push_back(ID);
272 while (!Stack.empty()) {
273 unsigned ID = Stack.back();
274 Stack.pop_back();
281 Stack.push_back(FromID);
|
| /external/clang/lib/CodeGen/ |
| CGDecl.cpp | 399 llvm::Value *Stack;
400 CallStackRestore(llvm::Value *Stack) : Stack(Stack) {}
402 llvm::Value *V = CGF.Builder.CreateLoad(Stack);
773 /// These turn into simple stack objects, or GlobalValues depending on target.
884 // Save the stack.
885 llvm::Value *Stack = CreateTempAlloca(Int8PtrTy, "saved_stack");
890 Builder.CreateStore(V, Stack);
894 // Push a cleanup block and restore the stack there
[all...] |
| /external/llvm/include/llvm/Support/ |
| FileSystem.h | 39 #include <stack>
793 std::stack<directory_iterator, std::vector<directory_iterator> > Stack;
808 State->Stack.push(directory_iterator(path, ec));
809 if (State->Stack.top() == directory_iterator())
820 if ((ec = State->Stack.top()->status(st))) return *this;
822 State->Stack.push(directory_iterator(*State->Stack.top(), ec));
824 if (State->Stack.top() != end_itr) {
828 State->Stack.pop()
[all...] |
