| /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...] |
| BitVector.h | 158 /// "Prev" bit. Returns -1 if the next set bit is not found.
159 int find_next(unsigned Prev) const {
160 ++Prev;
161 if (Prev >= Size)
164 unsigned WordPos = Prev / BITWORD_SIZE;
165 unsigned BitPos = Prev % BITWORD_SIZE;
|
| SmallBitVector.h | 221 /// "Prev" bit. Returns -1 if the next set bit is not found.
222 int find_next(unsigned Prev) const {
226 Bits &= ~uintptr_t(0) << (Prev + 1);
227 if (Bits == 0 || Prev + 1 >= getSmallSize())
235 return getPointer()->find_next(Prev);
|
| 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/ |
| 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;
|
| 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.
|
| /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/Support/ |
| Timer.cpp | 259 TimerGroupList->Prev = &Next;
261 Prev = &TimerGroupList;
273 *Prev = Next;
275 Next->Prev = Prev;
289 *T.Prev = T.Next;
291 T.Next->Prev = T.Prev;
308 FirstTimer->Prev = &T.Next;
310 T.Prev = &FirstTimer
[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;
|
| /external/llvm/lib/VMCore/ |
| Use.cpp | 55 unsigned Tag = (Current++)->Prev.getInt();
65 unsigned Tag = Current->Prev.getInt();
|
| /external/llvm/lib/ExecutionEngine/JIT/ |
| 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...] |
| JITDwarfEmitter.cpp | 354 CallSiteEntry &Prev = CallSites.back();
355 if (Site.PadLabel == Prev.PadLabel && Site.Action == Prev.Action) {
357 Prev.EndLabel = Site.EndLabel;
|
| /external/clang/include/clang/AST/ |
| ExternalASTSource.h | 358 iterator Prev(*this);
360 return Prev;
369 iterator Prev(*this);
371 return Prev;
|
| /external/webkit/Source/WebCore/platform/leveldb/ |
| LevelDBIterator.cpp | 77 void LevelDBIterator::prev() function in class:WebCore::LevelDBIterator
79 m_iterator->Prev();
|
| /external/clang/include/clang/Analysis/FlowSensitive/ |
| DataflowSolver.h | 81 static BlockEdge PrevEdge(const CFGBlock *B, const CFGBlock *Prev) {
82 return BlockEdge(Prev, B, 0);
104 static BlockEdge PrevEdge(const CFGBlock *B, const CFGBlock *Prev) {
105 return BlockEdge(B, Prev, 0);
|
| /external/clang/include/clang/Lex/ |
| PreprocessingRecord.h | 406 iterator Prev(*this);
408 return Prev;
417 iterator Prev(*this);
419 return Prev;
|
| /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/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
|
| /external/llvm/lib/Object/ |
| MachOObject.cpp | 151 const LoadCommandInfo &Prev = getLoadCommandInfo(Index - 1);
152 Offset = Prev.Offset + Prev.Command.Size;
|
| /external/clang/include/clang/StaticAnalyzer/Core/BugReporter/ |
| BugReporterVisitor.h | 136 const ExplodedNode *Prev,
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfDebug.cpp | [all...] |
| DwarfException.cpp | 294 CallSiteEntry &Prev = CallSites.back();
295 if (Site.PadLabel == Prev.PadLabel && Site.Action == Prev.Action) {
297 Prev.EndLabel = Site.EndLabel;
|
| /external/clang/lib/Lex/ |
| PPDirectives.cpp | 43 MIChain->Prev = 0;
45 MIChainHead->Prev = MIChain;
67 if (MacroInfoChain *Prev = MIChain->Prev) {
69 Prev->Next = Next;
71 Next->Prev = Prev;
76 MIChainHead->Prev = 0;
[all...] |
