HomeSort by relevance Sort by last modified time
    Searched defs:Stack (Results 1 - 25 of 37) sorted by null

1 2

  /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
59 memset(Stack, 0, sizeof(Stack));
80 // LiveBundle. It represents a set of CFG edges where the live FP stack
81 // registers must be allocated identically in the x87 stack.
88 // but the exact mapping of FP registers to stack slots is fixed later.
94 // stack order has not yet been fixed
    [all...]
  /external/clang/include/clang/Serialization/
ModuleManager.h 71 Stack.reserve(N);
78 /// \brief The stack used when marking the imports of a particular module
80 SmallVector<ModuleFile *, 4> Stack;
  /external/giflib/
gif_lib_private.h 42 StackPtr, /* For character stack (see below). */
50 GifByteType Stack[LZ_MAX_CODE]; /* Decoded pixels are stacked here. */
dgif_lib.c 761 Private->StackPtr = 0; /* No pixels on the pixel stack. */
784 GifByteType *Stack, *Suffix;
791 Stack = Private->Stack;
801 /* Let pop the stack off before continueing to read the GIF file: */
803 Line[i++] = Stack[--StackPtr];
834 * pixels on our stack. If we done, pop the stack in reverse
835 * (thats what stack is good for!) order to output. */
844 Stack[StackPtr++] = DGifGetPrefixChar(Prefix
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
nv50_ir_util.h 232 class Stack
248 Stack() : size(0), limit(0), array(0) { }
249 ~Stack() { if (array) FREE(array); }
284 void moveTo(Stack&); // move all items to target (not like push(pop()))
414 Stack ids;
  /external/mesa3d/src/gallium/drivers/nv50/codegen/
nv50_ir_util.h 232 class Stack
248 Stack() : size(0), limit(0), array(0) { }
249 ~Stack() { if (array) FREE(array); }
284 void moveTo(Stack&); // move all items to target (not like push(pop()))
414 Stack ids;
  /external/clang/lib/AST/
NestedNameSpecifier.cpp 567 SmallVector<NestedNameSpecifier *, 4> Stack;
569 Stack.push_back(NNS);
570 while (!Stack.empty()) {
571 NestedNameSpecifier *NNS = Stack.pop_back_val();
594 SaveSourceLocation(Stack.empty()? R.getEnd() : R.getBegin(),
CXXInheritance.cpp 574 SmallVector<OverriddenMethods, 4> Stack;
575 Stack.push_back(std::make_pair(CanonM->begin_overridden_methods(),
577 while (!Stack.empty()) {
578 OverriddenMethods OverMethods = Stack.back();
579 Stack.pop_back();
604 Stack.push_back(std::make_pair(CanonOM->begin_overridden_methods(),
  /external/clang/lib/Format/
ContinuationIndenter.h 322 /// \brief A stack keeping track of properties applying to parenthesis
324 std::vector<ParenState> Stack;
326 /// \brief Ignore the stack of \c ParenStates for state comparison.
334 /// ParenState stack (in an otherwise identical state) and these different
366 return Stack < Other.Stack;
UnwrappedLineParser.cpp 37 ScopedDeclarationState(UnwrappedLine &Line, std::vector<bool> &Stack,
39 : Line(Line), Stack(Stack) {
41 Stack.push_back(MustBeDeclaration);
44 Stack.pop_back();
45 if (!Stack.empty())
46 Line.MustBeDeclaration = Stack.back();
53 std::vector<bool> &Stack;
316 // Keep a stack of positions of lbrace tokens. We will
    [all...]
  /external/clang/lib/Frontend/
DiagnosticRenderer.cpp 199 /// \brief Prints an include stack when appropriate for a particular
205 /// of customizing the formatting and display of the include stack.
209 /// \param Level The diagnostic level of the message this stack pertains to.
233 /// \brief Helper to recursivly walk up the include stack and print each layer
247 // import stack rather than the
251 // This location was imported by a module. Emit the module import stack.
263 /// \brief Emit the module import stack associated with the current location.
276 /// \brief Helper to recursivly walk up the import stack and print each layer
298 /// \brief Emit the module build stack, for cases where a module is (re-)built
301 ModuleBuildStack Stack = SM.getModuleBuildStack()
    [all...]
  /external/clang/lib/Sema/
SemaAttr.cpp 30 // We just use a sentinel to represent when the stack is set to mac68k
38 /// PragmaPackStack - Simple class to wrap the stack used by #pragma
46 /// Stack - Entries in the #pragma pack stack, consisting of saved
48 stack_ty Stack;
56 /// push - Push the current alignment onto the stack, optionally
60 Stack.push_back(PSE);
63 /// pop - Pop a record from the stack and restore the current
74 // An empty stack is a special case...
75 if (Stack.empty())
    [all...]
Sema.cpp 131 // Initilization of data sharing attributes stack for OpenMP
242 // Destroys data sharing attributes stack for OpenMP
694 SmallVector<Module *, 2> Stack;
695 Stack.push_back(CurrentModule);
696 while (!Stack.empty()) {
697 Module *Mod = Stack.pop_back_val();
711 Stack.push_back(*Sub);
    [all...]
SemaOpenMP.cpp 32 // Stack of data-sharing attributes for variables
63 /// \brief Stack for tracking declarations used in OpenMP directives and
107 /// \brief Stack of used declaration and their data-sharing attributes.
108 StackTy Stack;
119 explicit DSAStackTy(Sema &S) : Stack(1), SemaRef(S) {}
123 Stack.push_back(SharingMapTy(DKind, DirName, CurScope, Loc));
124 Stack.back().DefaultAttrLoc = Loc;
128 assert(Stack.size() > 1 && "Data-sharing attributes stack is empty!");
129 Stack.pop_back()
    [all...]
SemaType.cpp     [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 67 StackVector Stack;
151 /// \brief Is BB the last block saved on the stack ?
153 return !Stack.empty() && Stack.back().first == BB;
156 /// \brief Pop the last saved value from the control flow stack
158 return Stack.pop_back_val().second;
161 /// \brief Push a BB and saved value to the control flow stack
163 Stack.push_back(std::make_pair(BB, Saved));
322 assert(Stack.empty());
  /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/llvm/include/llvm/Support/
FileSystem.h 38 #include <stack>
815 std::stack<directory_iterator, std::vector<directory_iterator> > Stack;
830 State->Stack.push(directory_iterator(path, ec));
831 if (State->Stack.top() == directory_iterator())
842 if ((ec = State->Stack.top()->status(st))) return *this;
844 State->Stack.push(directory_iterator(*State->Stack.top(), ec));
846 if (State->Stack.top() != end_itr) {
850 State->Stack.pop()
    [all...]
  /external/openfst/src/include/fst/extensions/pdt/
expand.h 42 PdtStack<typename Arc::StateId, typename Arc::Label> *stack; member in struct:fst::ExpandFstOptions
50 : CacheOptions(opts), keep_parentheses(kp), stack(s), state_table(st) {}
90 stack_(opts.stack ? opts.stack: new PdtStack<StateId, Label>(parens)),
93 own_stack_(opts.stack == 0), own_state_table_(opts.state_table == 0),
186 // Stack push/pop
326 // shortest-stack first queue discipline and relies on the
342 typedef PdtStack<StackId, Label> Stack;
388 // 1. states corresponding to shortest stack first,
390 // 3. among states with the same stack, shortest-first order is used
    [all...]
  /external/clang/lib/CodeGen/
CGDecl.cpp 415 llvm::Value *Stack;
416 CallStackRestore(llvm::Value *Stack) : Stack(Stack) {}
418 llvm::Value *V = CGF.Builder.CreateLoad(Stack);
821 /// These turn into simple stack objects, or GlobalValues depending on target.
    [all...]
CodeGenModule.cpp     [all...]
  /external/llvm/lib/IR/
Verifier.cpp     [all...]
  /external/llvm/lib/Target/XCore/
XCoreISelLowering.cpp 147 // Dynamic stack
    [all...]
  /external/clang/lib/Serialization/
ASTReader.cpp     [all...]

Completed in 1022 milliseconds

1 2