| /xsrc/external/mit/MesaLib/dist/src/amd/compiler/ |
| aco_util.h | 33 #include <iterator> 50 using iterator = pointer; 52 using reverse_iterator = std::reverse_iterator<iterator>; 67 /*! \brief Returns an iterator to the begin of the span 70 constexpr iterator begin() noexcept { return (pointer)((uintptr_t)this + offset); } 80 /*! \brief Returns an iterator to the end of the span 83 constexpr iterator end() noexcept { return std::next(begin(), length); } 244 struct Iterator { 254 Iterator& operator++(); 256 bool operator!=(const Iterator& other) const [all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gtest/include/gtest/internal/ |
| gtest-param-util.h | 39 #include <iterator> 97 // Used only for the purposes of iterator comparison 100 // Advances iterator to point to the next element 102 // for not calling Advance() on an iterator equal to 105 // Clones the iterator object. Used for implementing copy semantics 108 // Dereferences the current iterator and provides (read-only) access 110 // Current() on an iterator equal to BaseGenerator()->End(). 113 // Determines whether the given iterator and other point to the same 121 // and implements the const forward iterator concept. 185 typedef ParamIterator<T> iterator; typedef in class:testing::internal::ParamGenerator [all...] |
| gtest-param-util-generated.h | 3173 return new Iterator(this, g1_, g1_.begin(), g2_, g2_.begin()); 3176 return new Iterator(this, g1_, g1_.end(), g2_, g2_.end()); 3180 class Iterator : public ParamIteratorInterface<ParamType> { 3182 Iterator(const ParamGeneratorInterface<ParamType>* base, 3184 const typename ParamGenerator<T1>::iterator& current1, 3186 const typename ParamGenerator<T2>::iterator& current2) 3192 virtual ~Iterator() {} 3209 return new Iterator(*this); 3214 // iterator is of the same type and we can downcast. 3218 const Iterator* typed_other [all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_util.h | 87 class Iterator 90 virtual ~Iterator() { }; 98 typedef std::unique_ptr<Iterator> IteratorRef; 100 typedef std::auto_ptr<Iterator> IteratorRef; 103 class ManipIterator : public Iterator 148 for (DLList::Iterator it = (list)->iterator(); !(it).end(); (it).next()) 192 class Iterator : public ManipIterator 195 Iterator(Item *head, bool r) : rev(r), pos(r ? head->prev : head->next), 217 inline void erase(Iterator& pos 222 Iterator iterator() function in class:nv50_ir::DLList [all...] |
| nv50_ir_util.cpp | 37 DLList::Iterator::erase() 49 void DLList::Iterator::moveToList(DLList& dest) 63 DLList::Iterator::insert(void *data)
|
| nv50_ir_bb.cpp | 64 for (ArrayList::Iterator it = allInsns.iterator(); !it.end(); it.next()) 67 for (ArrayList::Iterator it = allLValues.iterator(); !it.end(); it.next()) 70 for (ArrayList::Iterator BBs = allBBlocks.iterator(); !BBs.end(); BBs.next()) 438 for (ArrayList::Iterator bi = allBBlocks.iterator(); !bi.end(); bi.next()) 448 for (ArrayList::Iterator bi = allBBlocks.iterator(); !bi.end(); bi.next() [all...] |
| nv50_ir_ssa.cpp | 156 for (DLList::Iterator it = bucket[p].iterator(); !it.end(); it.erase()) { 209 DLList::Iterator dfIt = cb->getDF().iterator(); 254 for (std::deque<ValueRef>::iterator it = f->outs.begin(); 308 for (ArrayList::Iterator fi = allFuncs.iterator(); !fi.end(); fi.next()) { 369 for (DLList::Iterator wI = workList.iterator(); !wI.end(); wI.erase()) { 372 DLList::Iterator dfIter = bb->getDF().iterator() [all...] |
| nv50_ir_graph.h | 74 class EdgeIterator : public Iterator
|
| nv50_ir_inlines.h | 389 Value *Value::get(Iterator &it) 399 BasicBlock *BasicBlock::get(Iterator &iter)
|
| nv50_ir_graph.cpp | 196 class DFSIterator : public Iterator 254 class CFGIterator : public Iterator 424 for (std::list<Node *>::iterator n = nodeList.begin();
|
| nv50_ir_target.cpp | 220 for (ArrayList::Iterator fi = prog->allFuncs.iterator(); 370 for (ArrayList::Iterator fi = allFuncs.iterator(); !fi.end(); fi.next()) {
|
| nv50_ir.h | 750 static inline Value *get(Iterator&); 754 typedef unordered_set<ValueRef *>::iterator UseIterator; 756 typedef std::list<ValueDef *>::iterator DefIterator; 1203 DLList::Iterator iterDF() { return df.iterator(); } 1205 static inline BasicBlock *get(Iterator&);
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_util.h | 87 class Iterator 90 virtual ~Iterator() { }; 98 typedef std::unique_ptr<Iterator> IteratorRef; 100 typedef std::auto_ptr<Iterator> IteratorRef; 103 class ManipIterator : public Iterator 148 for (DLList::Iterator (it) = (list)->iterator(); !(it).end(); (it).next()) 192 class Iterator : public ManipIterator 195 Iterator(Item *head, bool r) : rev(r), pos(r ? head->prev : head->next), 217 inline void erase(Iterator& pos 222 Iterator iterator() function in class:nv50_ir::DLList [all...] |
| nv50_ir_util.cpp | 37 DLList::Iterator::erase() 49 void DLList::Iterator::moveToList(DLList& dest) 63 DLList::Iterator::insert(void *data)
|
| nv50_ir_bb.cpp | 64 for (ArrayList::Iterator it = allInsns.iterator(); !it.end(); it.next()) 67 for (ArrayList::Iterator it = allLValues.iterator(); !it.end(); it.next()) 70 for (ArrayList::Iterator BBs = allBBlocks.iterator(); !BBs.end(); BBs.next()) 438 for (ArrayList::Iterator bi = allBBlocks.iterator(); !bi.end(); bi.next()) 448 for (ArrayList::Iterator bi = allBBlocks.iterator(); !bi.end(); bi.next() [all...] |
| nv50_ir_ssa.cpp | 156 for (DLList::Iterator it = bucket[p].iterator(); !it.end(); it.erase()) { 209 DLList::Iterator dfIt = cb->getDF().iterator(); 254 for (std::deque<ValueRef>::iterator it = f->outs.begin(); 308 for (ArrayList::Iterator fi = allFuncs.iterator(); !fi.end(); fi.next()) { 369 for (DLList::Iterator wI = workList.iterator(); !wI.end(); wI.erase()) { 372 DLList::Iterator dfIter = bb->getDF().iterator() [all...] |
| nv50_ir_graph.h | 75 class EdgeIterator : public Iterator
|
| nv50_ir_inlines.h | 389 Value *Value::get(Iterator &it) 399 BasicBlock *BasicBlock::get(Iterator &iter)
|
| nv50_ir_target.cpp | 211 for (ArrayList::Iterator fi = prog->allFuncs.iterator(); 354 for (ArrayList::Iterator fi = allFuncs.iterator(); 387 for (ArrayList::Iterator fi = allFuncs.iterator(); !fi.end(); fi.next()) {
|
| nv50_ir_graph.cpp | 196 class DFSIterator : public Iterator 254 class CFGIterator : public Iterator 429 for (std::list<Node *>::iterator n = nodeList.begin();
|
| nv50_ir_print.cpp | 764 for (std::deque<ValueRef>::iterator it = fn->outs.begin(); 773 for (std::deque<ValueDef>::iterator it = fn->ins.begin(); 800 for (DLList::Iterator df = bb->getDF().iterator(); !df.end(); df.next()) 845 for (ArrayList::Iterator it = allLValues.iterator(); !it.end(); it.next()) {
|
| /xsrc/external/mit/MesaLib/dist/src/gtest/include/gtest/internal/ |
| gtest-param-util.h | 41 #include <iterator> 95 // Used only for the purposes of iterator comparison 98 // Advances iterator to point to the next element 100 // for not calling Advance() on an iterator equal to 103 // Clones the iterator object. Used for implementing copy semantics 106 // Dereferences the current iterator and provides (read-only) access 108 // Current() on an iterator equal to BaseGenerator()->End(). 111 // Determines whether the given iterator and other point to the same 119 // and implements the const forward iterator concept. 183 typedef ParamIterator<T> iterator; typedef in class:testing::internal::ParamGenerator [all...] |
| gtest-internal.h | 863 // will be viable (since both C::iterator* and C::const_iterator* are 866 // the type of argument 0. If C::iterator or C::const_iterator is not 873 // iterator is properly implemented for the container. 875 // For pre-C++11 that we look for both C::iterator and C::const_iterator. 877 // class itself (e.g. you can refer to class iterator as either 878 // 'iterator' or 'iterator::iterator'). If we look for C::iterator 880 // iterator is an STL container 1039 typedef Element* iterator; typedef in class:testing::internal::NativeArray [all...] |
| /xsrc/external/mit/MesaLib/dist/bin/ |
| gen_calendar_entries_test.py | 41 def mock_csv(data: typing.List[gen_calendar_entries.CalendarRowType]) -> typing.Iterator[None]: 84 def _patch_date(date: datetime.date) -> typing.Iterator[None]: 271 def _patch_date(self) -> typing.Iterator[None]:
|
| gen_calendar_entries.py | 169 def write_existing(writer: _csv._writer, current: typing.List[CalendarRowType]) -> typing.Iterator[CalendarRowType]:
|