/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 | 165 /// "Prev" bit. Returns -1 if the next set bit is not found. 166 int find_next(unsigned Prev) const { 167 ++Prev; 168 if (Prev >= Size) 171 unsigned WordPos = Prev / BITWORD_SIZE; 172 unsigned BitPos = Prev % BITWORD_SIZE;
|
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...] |
SmallBitVector.h | 228 /// "Prev" bit. Returns -1 if the next set bit is not found. 229 int find_next(unsigned Prev) const { 233 Bits &= ~uintptr_t(0) << (Prev + 1); 234 if (Bits == 0 || Prev + 1 >= getSmallSize()) 242 return getPointer()->find_next(Prev);
|
/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 | 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.
|
/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;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
ANTLRLinkBase.h | 37 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp; 60 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp; 62 - (id<ANTLRLinkList>)initWithPtr:(id)np Prev:(id)pp;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
ANTLRLinkBase.h | 37 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp; 60 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp; 62 - (id<ANTLRLinkList>)initWithPtr:(id)np Prev:(id)pp;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
ANTLRLinkBase.h | 37 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp; 60 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp; 62 - (id<ANTLRLinkList>)initWithPtr:(id)np Prev:(id)pp;
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
ANTLRLinkBase.h | 41 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp; 66 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp; 68 - (id<ANTLRLinkList>)initWithPtr:(id)np Prev:(id)pp;
|
/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/tools/lli/ |
RemoteTarget.cpp | 25 sys::MemoryBlock *Prev = Allocations.size() ? &Allocations.back() : NULL; 26 sys::MemoryBlock Mem = sys::Memory::AllocateRWX(Size, Prev, &ErrorMsg);
|
/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/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/llvm/lib/VMCore/ |
Use.cpp | 56 unsigned Tag = (Current++)->Prev.getInt(); 66 unsigned Tag = Current->Prev.getInt();
|
/external/llvm/lib/ExecutionEngine/JIT/ |
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/webkit/Source/WebCore/platform/leveldb/ |
LevelDBIterator.cpp | 77 void LevelDBIterator::prev() function in class:WebCore::LevelDBIterator 79 m_iterator->Prev();
|
/external/clang/include/clang/StaticAnalyzer/Core/BugReporter/ |
BugReporterVisitor.h | 175 const ExplodedNode *Prev, 180 const ExplodedNode *Prev,
|
/external/clang/include/clang/AST/ |
ExternalASTSource.h | 413 iterator Prev(*this); 415 return Prev; 424 iterator Prev(*this); 426 return 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 | 450 iterator Prev(*this); 452 return Prev; 461 iterator Prev(*this); 463 return Prev;
|
/external/clang/test/CXX/class.access/class.friend/ |
p1.cpp | 123 X *Prev; 125 X *getPrev() { return Prev; } // expected-note{{member is declared here}}
|