| /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...] |
| SparseMultiSet.h | 81 /// circular in Prev indices, and INVALID-terminated in Next indices. This
89 unsigned Prev;
92 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) { }
101 return Prev == INVALID;
104 /// Since the list is circular in Prev, all non-tombstone nodes have a valid
105 /// Prev.
106 bool isValid() const { return Prev != INVALID; }
140 return Dense[D.Prev].isTail();
148 return &Dense[N.Prev] == &N;
153 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next)
[all...] |
| /external/llvm/include/llvm/Support/ |
| Registry.h | 137 listener *Prev, *Next;
154 listener() : Prev(ListenerTail), Next(0) {
155 if (Prev)
156 Prev->Next = this;
164 Next->Prev = Prev;
166 ListenerTail = Prev;
167 if (Prev)
168 Prev->Next = Next;
|
| Recycler.h | 34 /// next/prev pointers.
36 RecyclerStruct *Prev, *Next;
42 static RecyclerStruct *getPrev(const RecyclerStruct *t) { return t->Prev; }
44 static void setPrev(RecyclerStruct *t, RecyclerStruct *p) { t->Prev = p; }
|
| Timer.h | 86 Timer **Prev, *Next; // Doubly linked list of timers in the group.
166 TimerGroup **Prev, *Next; // Doubly linked list of TimerGroup's.
|
| /external/llvm/lib/CodeGen/ |
| MachineRegisterInfo.cpp | 124 // Prev pointers are circular, so Head->Prev == Last.
128 MO->Contents.Reg.Prev = MO;
135 // Insert MO between Last and Head in the circular Prev chain.
136 MachineOperand *Last = Head->Contents.Reg.Prev;
139 Head->Contents.Reg.Prev = MO;
140 MO->Contents.Reg.Prev = Last;
164 MachineOperand *Prev = MO->Contents.Reg.Prev;
166 // Prev links are circular, next link is NULL instead of looping back to Head
[all...] |
| /external/clang/lib/Driver/ |
| Option.cpp | 122 const char *Prev = Str;
127 if (Prev != Str) {
128 char *Value = new char[Str - Prev + 1];
129 memcpy(Value, Prev, Str - Prev);
130 Value[Str - Prev] = '\0';
137 Prev = Str + 1;
|
| OptTable.cpp | 187 unsigned Prev = Index;
224 if (Prev != Index)
248 unsigned Prev = Index;
250 assert(Index > Prev && "Parser failed to consume argument.");
255 assert(Index - Prev - 1 && "No missing arguments!");
256 MissingArgIndex = Prev;
257 MissingArgCount = Index - Prev - 1;
|
| /external/llvm/lib/Option/ |
| Option.cpp | 124 const char *Prev = Str;
129 if (Prev != Str) {
130 char *Value = new char[Str - Prev + 1];
131 memcpy(Value, Prev, Str - Prev);
132 Value[Str - Prev] = '\0';
139 Prev = Str + 1;
|
| OptTable.cpp | 188 unsigned Prev = Index;
225 if (Prev != Index)
249 unsigned Prev = Index;
251 assert(Index > Prev && "Parser failed to consume argument.");
256 assert(Index - Prev - 1 && "No missing arguments!");
257 MissingArgIndex = Prev;
258 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/IR/ |
| 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/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/IR/ |
| Use.cpp | 56 unsigned Tag = (Current++)->Prev.getInt();
66 unsigned Tag = Current->Prev.getInt();
|
| /external/llvm/lib/ExecutionEngine/JIT/ |
| JITMemoryManager.cpp | 106 FreeRangeHeader *Prev;
123 assert(Next->Prev == this && Prev->Next == this && "Freelist broken!");
124 Next->Prev = Prev;
125 return Prev->Next = Next;
130 Prev = FreeList->Prev;
131 Prev->Next = this;
132 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/AST/ |
| ExternalASTSource.h | 421 iterator Prev(*this);
423 return Prev;
432 iterator Prev(*this);
434 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 | 426 iterator Prev(*this);
428 return Prev;
437 iterator Prev(*this);
439 return Prev;
|
| /external/clang/lib/Lex/ |
| PPMacroExpansion.cpp | 93 MacroDirective *Prev;
98 Prev = PrevPrev;
101 if (!Prev->getInfo()->isIdenticalTo(*MD->getInfo(), *this)) {
109 } while ((PrevPrev = Prev->getPrevious()) &&
118 MD->setPrevious(Prev->getPrevious());
119 Prev->setPrevious(MD);
124 MacroDirective *Prev = Hint? Hint : StoredMD;
125 while (Prev->getPrevious())
126 Prev = Prev->getPrevious()
[all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/BugReporter/ |
| BugReporterVisitor.h | 179 const ExplodedNode *Prev,
184 const ExplodedNode *Prev,
246 const ExplodedNode *Prev,
|
