| /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/clang/lib/Driver/ |
| Option.cpp | 175 const char *Prev = Str;
180 if (Prev != Str) {
181 char *Value = new char[Str - Prev + 1];
182 memcpy(Value, Prev, Str - Prev);
183 Value[Str - Prev] = '\0';
190 Prev = Str + 1;
|
| OptTable.cpp | 189 unsigned Prev = Index;
223 if (Prev != Index)
247 unsigned Prev = Index;
249 assert(Index > Prev && "Parser failed to consume argument.");
254 assert(Index - Prev - 1 && "No missing arguments!");
255 MissingArgIndex = Prev;
256 MissingArgCount = Index - Prev - 1;
|
| Tools.cpp | 933 unsigned& Prev = PrevFeature[Name];
934 if (Prev)
935 Features[Prev - 1] = 0;
936 Prev = Features.size() + 1;
[all...] |
| /external/llvm/include/llvm/Support/ |
| Recycler.h | 31 /// next/prev pointers.
33 RecyclerStruct *Prev, *Next;
39 static RecyclerStruct *getPrev(const RecyclerStruct *t) { return t->Prev; }
41 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/Object/ |
| MachOObject.cpp | 151 const LoadCommandInfo &Prev = getLoadCommandInfo(Index - 1);
152 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/CodeGen/ |
| VirtRegRewriter.cpp | 318 MachineBasicBlock::iterator Prev = prior(NewInsertLoc);
319 for (unsigned i = 0; i < Prev->getNumOperands(); ++i) {
320 MachineOperand &Op = Prev->getOperand(i);
324 if (Prev->findRegisterUseOperandIdx(PhysReg) != -1 ||
325 Prev->findRegisterDefOperand(PhysReg))
328 if (Prev->findRegisterUseOperandIdx(*Alias) != -1 ||
329 Prev->findRegisterDefOperand(*Alias))
331 NewInsertLoc = Prev;
585 // the def of this reg (by prev MI) is now dead.
[all...] |
| /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 | 90 FreeRangeHeader *Prev;
107 assert(Next->Prev == this && Prev->Next == this && "Freelist broken!");
108 Next->Prev = Prev;
109 return Prev->Next = Next;
114 Prev = FreeList->Prev;
115 Prev->Next = this;
116 Next->Prev = this
[all...] |
| /external/clang/test/CXX/class.access/class.friend/ |
| p1.cpp | 122 X *Prev;
124 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/clang/lib/AST/ |
| DeclCXX.cpp | [all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineOperand.h | 138 MachineOperand **Prev; // Access list for register.
504 Op.Contents.Reg.Prev = 0;
584 return Contents.Reg.Prev != 0;
588 /// MachineRegisterInfo. If it is null, then the next/prev fields should be
|
| SelectionDAGNodes.h | 202 /// pointer to the SDNode using the value, and Next and Prev pointers,
210 /// Prev, Next - Pointers to the uses list of the SDNode referred by
212 SDUse **Prev, *Next;
218 SDUse() : Val(), User(NULL), Prev(NULL), Next(NULL) {}
273 if (Next) Next->Prev = &Next;
274 Prev = List;
279 *Prev = Next;
280 if (Next) Next->Prev = Prev;
[all...] |
| /external/llvm/lib/MC/ |
| MCAssembler.cpp | 363 MCFragment *Prev = F->getPrevNode();
369 assert((!Prev || isFragmentUpToDate(Prev)) &&
376 if (Prev)
377 Offset += Prev->Offset + getAssembler().ComputeFragmentSize(*this, *Prev);
|
| /external/llvm/lib/VMCore/ |
| ConstantFold.cpp | [all...] |
| /external/clang/include/clang/Lex/ |
| Preprocessor.h | 316 MacroInfoChain *Prev;
[all...] |
| /external/clang/lib/Sema/ |
| SemaTemplateInstantiateDecl.cpp | 167 if (TypedefNameDecl *Prev = D->getPreviousDeclaration()) {
168 NamedDecl *InstPrev = SemaRef.FindInstantiatedDecl(D->getLocation(), Prev,
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfDebug.cpp | [all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| GVN.cpp | 504 LeaderTableEntry* Prev = 0;
508 Prev = Curr;
512 if (Prev) {
513 Prev->Next = Curr->Next;
[all...] |
| /external/llvm/utils/TableGen/ |
| AsmMatcherEmitter.cpp | 671 unsigned Prev = 0;
683 AsmOperands.push_back(AsmOperand(String.slice(Prev, i)));
688 Prev = i + 1;
693 AsmOperands.push_back(AsmOperand(String.slice(Prev, i)));
699 Prev = i + 1;
704 AsmOperands.push_back(AsmOperand(String.slice(Prev, i)));
710 Prev = i;
718 Prev = EndPos + 1;
725 AsmOperands.push_back(AsmOperand(String.slice(Prev, i)));
726 Prev = i
[all...] |
