| /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 | 33 sys::MemoryBlock *Prev = Allocations.size() ? &Allocations.back() : nullptr;
34 sys::MemoryBlock Mem = sys::Memory::AllocateRWX(Size, Prev, &ErrorMsg);
|
| /external/chromium_org/third_party/WebKit/public/platform/ |
| WebIDBCursor.h | 46 static const WebIDBCursorDirection Prev = WebIDBCursorDirectionPrev;
|
| /external/chromium_org/third_party/skia/experimental/PdfViewer/pdfparser/native/pdfapi/ |
| SkPdfFileTrailerDictionary_autogen.cpp | 23 int64_t SkPdfFileTrailerDictionary::Prev(SkPdfNativeDoc* doc) {
24 SkPdfNativeObject* ret = get("Prev", "");
32 return get("Prev", "") != NULL;
|
| SkPdfOutlineItemDictionary_autogen.cpp | 35 SkPdfDictionary* SkPdfOutlineItemDictionary::Prev(SkPdfNativeDoc* doc) {
36 SkPdfNativeObject* ret = get("Prev", "");
44 return get("Prev", "") != NULL;
|
| /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(nullptr) {}
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 | 85 /// circular in Prev indices, and INVALID-terminated in Next indices. This
93 unsigned Prev;
96 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) { }
105 return Prev == INVALID;
108 /// Since the list is circular in Prev, all non-tombstone nodes have a valid
109 /// Prev.
110 bool isValid() const { return Prev != INVALID; }
144 return Dense[D.Prev].isTail();
152 return &Dense[N.Prev] == &N;
157 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next)
[all...] |
| /external/llvm/include/llvm/Support/ |
| UnicodeCharRanges.h | 67 uint32_t Prev = 0;
70 if (I != Ranges.begin() && Prev >= I->Lower) {
72 DEBUG(dbgs().write_hex(Prev));
84 Prev = I->Upper;
|
| Recycler.h | 33 /// next/prev pointers.
35 RecyclerStruct *Prev, *Next;
41 static RecyclerStruct *getPrev(const RecyclerStruct *t) { return t->Prev; }
43 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/skia/experimental/PdfViewer/pdfparser/native/pdfapi/ |
| SkPdfFileTrailerDictionary_autogen.cpp | 23 int64_t SkPdfFileTrailerDictionary::Prev(SkPdfNativeDoc* doc) {
24 SkPdfNativeObject* ret = get("Prev", "");
32 return get("Prev", "") != NULL;
|
| SkPdfOutlineItemDictionary_autogen.cpp | 35 SkPdfDictionary* SkPdfOutlineItemDictionary::Prev(SkPdfNativeDoc* doc) {
36 SkPdfNativeObject* ret = get("Prev", "");
44 return get("Prev", "") != NULL;
|
| /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 | 143 const char *Prev = Str;
148 if (Prev != Str) {
149 char *Value = new char[Str - Prev + 1];
150 memcpy(Value, Prev, Str - Prev);
151 Value[Str - Prev] = '\0';
158 Prev = Str + 1;
|
| /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/llvm/include/llvm/IR/ |
| Use.h | 18 /// one of the fields (Prev) of the Use class are used to encode offsets to be
91 Use(PrevPtrTag tag) : Val(nullptr) { Prev.setInt(tag); }
137 PointerIntPair<Use **, 2, PrevPtrTag> Prev;
139 void setPrev(Use **NewPrev) { Prev.setPointer(NewPrev); }
148 Use **StrippedPrev = Prev.getPointer();
|
| /external/chromium_org/content/browser/indexed_db/leveldb/ |
| leveldb_transaction.cc | 152 leveldb::Status LevelDBTransaction::DataIterator::Prev() {
272 leveldb::Status LevelDBTransaction::TransactionIterator::Prev() {
293 non_current->Prev();
304 s = current_->Prev();
355 data_iterator_->Prev();
381 db_iterator_->Prev();
393 data_iterator_->Prev();
|
