| /external/llvm/tools/lli/ |
| RemoteTarget.cpp | 25 sys::MemoryBlock *Prev = Allocations.size() ? &Allocations.back() : NULL;
26 sys::MemoryBlock Mem = sys::Memory::AllocateRWX(Size, Prev, &ErrorMsg);
|
| /external/clang/lib/Driver/ |
| Option.cpp | 100 const char *Prev = Str;
105 if (Prev != Str) {
106 char *Value = new char[Str - Prev + 1];
107 memcpy(Value, Prev, Str - Prev);
108 Value[Str - Prev] = '\0';
115 Prev = Str + 1;
|
| OptTable.cpp | 147 unsigned Prev = Index;
181 if (Prev != Index)
205 unsigned Prev = Index;
207 assert(Index > Prev && "Parser failed to consume argument.");
212 assert(Index - Prev - 1 && "No missing arguments!");
213 MissingArgIndex = Prev;
214 MissingArgCount = Index - Prev - 1;
|
| ToolChains.cpp | 709 unsigned Prev = Index;
720 if (!XarchArg || Index > Prev + 1) {
[all...] |
| Tools.cpp | [all...] |
| /external/llvm/include/llvm/ADT/ |
| ilist_node.h | 23 /// ilist_half_node - Base class that provides prev services for sentinels.
28 NodeTy *Prev;
30 NodeTy *getPrev() { return Prev; }
31 const NodeTy *getPrev() const { return Prev; }
32 void setPrev(NodeTy *P) { Prev = P; }
33 ilist_half_node() : Prev(0) {}
39 /// ilist_node - Base class that provides next/prev services for nodes
59 NodeTy *Prev = this->getPrev();
62 if (!Prev->getNext())
65 return Prev;
[all...] |
| ilist.h | 20 // that the nodes contain next/prev pointers. This list replacement does not
27 // of this, users of the direct next/prev links will see an extra link on the
32 // 1. The user must provide {g|s}et{Next|Prev} methods, or specialize
34 // prev links.
52 /// that provides default next/prev implementations for common operations.
61 static void setPrev(NodeTy *N, NodeTy *Prev) { N->setPrev(Prev); }
72 /// strategy. The sentinel is stored in the prev field of ilist's Head.
132 // can change what next/prev fields are used to store the links...
293 /// holds the next/prev pointers. The only state of the list itself is a singl
[all...] |
| /external/llvm/include/llvm/Support/ |
| Recycler.h | 32 /// next/prev pointers.
34 RecyclerStruct *Prev, *Next;
40 static RecyclerStruct *getPrev(const RecyclerStruct *t) { return t->Prev; }
42 static void setPrev(RecyclerStruct *t, RecyclerStruct *p) { t->Prev = p; }
|
| Timer.h | 90 Timer **Prev, *Next; // Doubly linked list of timers in the group.
170 TimerGroup **Prev, *Next; // Doubly linked list of TimerGroup's.
|
| Registry.h | 136 listener *Prev, *Next;
153 listener() : Prev(ListenerTail), Next(0) {
154 if (Prev)
155 Prev->Next = this;
163 Next->Prev = Prev;
165 ListenerTail = Prev;
166 if (Prev)
167 Prev->Next = Next;
|
| /external/llvm/lib/CodeGen/ |
| MachineRegisterInfo.cpp | 129 // Prev pointers are circular, so Head->Prev == Last.
133 MO->Contents.Reg.Prev = MO;
140 // Insert MO between Last and Head in the circular Prev chain.
141 MachineOperand *Last = Head->Contents.Reg.Prev;
144 Head->Contents.Reg.Prev = MO;
145 MO->Contents.Reg.Prev = Last;
169 MachineOperand *Prev = MO->Contents.Reg.Prev;
171 // Prev links are circular, next link is NULL instead of looping back to Head
[all...] |
| /external/llvm/lib/Object/ |
| MachOObject.cpp | 152 const LoadCommandInfo &Prev = getLoadCommandInfo(Index - 1);
153 Offset = Prev.Offset + Prev.Command.Size;
|
| /external/llvm/include/llvm/ |
| Use.h | 17 // operands, and the low bits of one of the fields (Prev) of the Use
83 Prev.setInt(tag);
128 PointerIntPair<Use**, 2, PrevPtrTag> Prev;
131 Prev.setPointer(NewPrev);
140 Use **StrippedPrev = Prev.getPointer();
|
| /external/llvm/lib/ExecutionEngine/JIT/ |
| JITDwarfEmitter.cpp | 354 CallSiteEntry &Prev = CallSites.back();
355 if (Site.PadLabel == Prev.PadLabel && Site.Action == Prev.Action) {
357 Prev.EndLabel = Site.EndLabel;
|
| JITMemoryManager.cpp | 102 FreeRangeHeader *Prev;
119 assert(Next->Prev == this && Prev->Next == this && "Freelist broken!");
120 Next->Prev = Prev;
121 return Prev->Next = Next;
126 Prev = FreeList->Prev;
127 Prev->Next = this;
128 Next->Prev = this
[all...] |
| /external/clang/test/CXX/class.access/class.friend/ |
| p1.cpp | 123 X *Prev;
125 X *getPrev() { return Prev; } // expected-note{{member is declared here}}
|
| /external/llvm/include/llvm/Analysis/ |
| AliasSetTracker.h | 112 AliasSet *Next, *Prev; // Doubly linked list of AliasSets.
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineOperand.h | 161 MachineOperand *Prev; // Access list for register. See MRI.
575 Op.Contents.Reg.Prev = 0;
681 return Contents.Reg.Prev != 0;
|
| SelectionDAGNodes.h | 207 /// pointer to the SDNode using the value, and Next and Prev pointers,
215 /// Prev, Next - Pointers to the uses list of the SDNode referred by
217 SDUse **Prev, *Next;
223 SDUse() : Val(), User(NULL), Prev(NULL), Next(NULL) {}
278 if (Next) Next->Prev = &Next;
279 Prev = List;
284 *Prev = Next;
285 if (Next) Next->Prev = Prev;
[all...] |
| /external/llvm/lib/MC/ |
| MCAssembler.cpp | 370 MCFragment *Prev = F->getPrevNode();
376 assert((!Prev || isFragmentUpToDate(Prev)) &&
383 if (Prev)
384 Offset += Prev->Offset + getAssembler().computeFragmentSize(*this, *Prev);
[all...] |
| /external/llvm/lib/VMCore/ |
| ConstantFold.cpp | [all...] |
| /external/clang/lib/AST/ |
| DeclCXX.cpp | [all...] |
| Decl.cpp | 821 if (const FunctionDecl *Prev = Function->getPreviousDecl()) {
822 LinkageInfo PrevLV = getLVForDecl(Prev, OnlyTemplate);
[all...] |
| /external/clang/include/clang/Lex/ |
| Preprocessor.h | 355 MacroInfoChain *Prev;
[all...] |
| /external/clang/lib/Sema/ |
| SemaTemplateInstantiateDecl.cpp | 183 if (TypedefNameDecl *Prev = D->getPreviousDecl()) {
184 NamedDecl *InstPrev = SemaRef.FindInstantiatedDecl(D->getLocation(), Prev,
565 NamedDecl *Prev = SemaRef.FindInstantiatedDecl(D->getLocation(),
568 if (!Prev) return 0;
569 PrevDecl = cast<EnumDecl>(Prev);
[all...] |
