/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
radeon_list.h | 35 struct rc_list * Prev;
|
radeon_program.h | 134 struct rc_instruction * Prev; 154 * Instructions.Prev points to the last instruction.
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
radeon_list.h | 35 struct rc_list * Prev;
|
/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/chromium_org/third_party/WebKit/public/platform/ |
WebIDBCursor.h | 44 Prev = 2,
|
/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/ |
UnicodeCharRanges.h | 43 uint32_t Prev = 0; 46 if (I != CharSet.begin() && Prev >= I->Lower) { 48 DEBUG(llvm::dbgs().write_hex(Prev)); 60 Prev = I->Upper;
|
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.
|
Registry.h | 139 listener *Prev, *Next; 156 listener() : Prev(ListenerTail), Next(0) { 157 if (Prev) 158 Prev->Next = this; 166 Next->Prev = Prev; 168 ListenerTail = Prev; 169 if (Prev) 170 Prev->Next = Next;
|
/external/chromium_org/third_party/leveldatabase/src/table/ |
iterator.cc | 50 virtual void Prev() { assert(false); }
|
iterator_wrapper.h | 43 void Prev() { assert(iter_); iter_->Prev(); Update(); }
|
merger.cc | 85 virtual void Prev() { 100 child->Prev(); 110 current_->Prev();
|
two_level_iterator.cc | 32 virtual void Prev(); 118 void TwoLevelIterator::Prev() { 120 data_iter_.Prev(); 145 index_iter_.Prev();
|
block.cc | 144 virtual void Prev() {
|
/external/llvm/lib/Option/ |
Option.cpp | 142 const char *Prev = Str; 147 if (Prev != Str) { 148 char *Value = new char[Str - Prev + 1]; 149 memcpy(Value, Prev, Str - Prev); 150 Value[Str - Prev] = '\0'; 157 Prev = Str + 1;
|
OptTable.cpp | 186 unsigned Prev = Index; 230 if (Prev != Index) 276 unsigned Prev = Index; 278 assert(Index > Prev && "Parser failed to consume argument."); 283 assert(Index - Prev - 1 && "No missing arguments!"); 284 MissingArgIndex = Prev; 285 MissingArgCount = Index - Prev - 1;
|
/external/clang/lib/Lex/ |
UnicodeCharSets.h | 49 uint32_t Prev = 0; 52 if (Prev >= I->Lower) { 54 DEBUG(llvm::dbgs().write_hex(Prev)); 66 Prev = I->Upper;
|
/external/chromium_org/third_party/leveldatabase/src/db/ |
db_iter.cc | 83 virtual void Prev(); 205 void DBIter::Prev() { 214 iter_->Prev(); 259 iter_->Prev();
|
memtable.cc | 60 virtual void Prev() { iter_.Prev(); }
|
skiplist.h | 19 // (2) The contents of a Node except for the next/prev pointers are 25 // ... prev vs. next pointer ordering ... 75 void Prev(); 125 // If prev is non-NULL, fills prev[level] with pointer to previous 127 Node* FindGreaterOrEqual(const Key& key, Node** prev) const; 211 inline void SkipList<Key,Comparator>::Iterator::Prev() { 212 // Instead of using explicit "prev" links, we just search for the 259 typename SkipList<Key,Comparator>::Node* SkipList<Key,Comparator>::FindGreaterOrEqual(const Key& key, Node** prev) 269 if (prev != NULL) prev[level] = x 337 Node* prev[kMaxHeight]; local [all...] |
/external/chromium_org/content/browser/indexed_db/leveldb/ |
leveldb_transaction.cc | 150 void LevelDBTransaction::DataIterator::Prev() { 254 void LevelDBTransaction::TransactionIterator::Prev() { 272 non_current->Prev(); 283 current_->Prev(); 331 data_iterator_->Prev(); 357 db_iterator_->Prev(); 369 data_iterator_->Prev();
|
/external/llvm/include/llvm/IR/ |
Use.h | 17 // operands, and the low bits of one of the fields (Prev) of the Use 85 Prev.setInt(tag); 130 PointerIntPair<Use**, 2, PrevPtrTag> Prev; 133 Prev.setPointer(NewPrev); 142 Use **StrippedPrev = Prev.getPointer();
|
/external/llvm/lib/CodeGen/ |
MachineRegisterInfo.cpp | 182 // Prev pointers are circular, so Head->Prev == Last. 186 MO->Contents.Reg.Prev = MO; 193 // Insert MO between Last and Head in the circular Prev chain. 194 MachineOperand *Last = Head->Contents.Reg.Prev; 197 Head->Contents.Reg.Prev = MO; 198 MO->Contents.Reg.Prev = Last; 222 MachineOperand *Prev = MO->Contents.Reg.Prev; 224 // Prev links are circular, next link is NULL instead of looping back to Head [all...] |