| /xsrc/external/mit/MesaLib/dist/include/android_stub/backtrace/ |
| BacktraceMap.h | 33 #include <iterator>
74 class iterator : public std::iterator<std::bidirectional_iterator_tag, backtrace_map_t*> { class in class:BacktraceMap
76 iterator(BacktraceMap* map, size_t index) : map_(map), index_(index) {} function in class:BacktraceMap::iterator
78 iterator& operator++() {
82 const iterator operator++(int increment) {
86 iterator& operator--() {
90 const iterator operator--(int decrement) {
95 bool operator==(const iterator& rhs) { return this->index_ == rhs.index_; }
96 bool operator!=(const iterator& rhs) { return this->index_ != rhs.index_;
[all...] |
| Backtrace.h | 172 typedef std::vector<backtrace_frame_data_t>::iterator iterator; typedef in class:Backtrace
173 iterator begin() { return frames_.begin(); }
174 iterator end() { return frames_.end(); }
|
| /xsrc/external/mit/freetype/dist/src/sfnt/ |
| ttcolr.h | 43 FT_LayerIterator* iterator );
|
| ttcolr.c | 216 FT_LayerIterator* iterator )
225 if ( !iterator->p )
231 iterator->layer = 0;
240 iterator->num_layers = glyph_record.num_layers;
248 iterator->p = colr->layers + offset;
251 if ( iterator->layer >= iterator->num_layers )
254 *aglyph_index = FT_NEXT_USHORT( iterator->p );
255 *acolor_index = FT_NEXT_USHORT( iterator->p );
262 iterator->layer++
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r600/sb/ |
| sb_ir.h | 115 typedef typename data_vector::iterator iterator; typedef in class:r600_sb::sb_set
121 iterator begin() { return vec.begin(); }
122 iterator end() { return vec.end(); }
134 iterator lower_bound(const V& v) {
138 std::pair<iterator, bool> insert(const V& v) {
139 iterator P = lower_bound(v);
146 iterator P = lower_bound(v);
161 iterator find(const V& v) {
162 iterator P = lower_bound(v)
188 typedef typename dataset::iterator iterator; typedef in class:r600_sb::sb_map
327 class iterator { class in class:r600_sb::sb_value_set
892 class iterator { class in class:r600_sb::container_node
895 iterator(node *pp = NULL) : p(pp) {} function in class:r600_sb::container_node::iterator
[all...] |
| sb_ra_coalesce.cpp | 96 for (vvec::iterator I = c2->values.begin(), E = c2->values.end(); I != E;
102 chunk_vec::iterator F = std::find(all_chunks.begin(), all_chunks.end(), c2);
123 for (vvec::iterator I = c1->values.begin(), E = c1->values.end(); I != E;
127 for (vvec::iterator I = c2->values.begin(), E = c2->values.end(); I != E;
140 for (edge_queue::iterator I = edges.begin(), E = edges.end();
169 for (edge_queue::iterator I = edges.begin(), E = edges.end();
183 for (chunk_vec::iterator I = all_chunks.begin(), E = all_chunks.end();
194 for (constraint_queue::iterator I = constraints.begin(),
233 for (vvec::iterator I = c->values.begin(), E = c->values.end(); I != E;
242 for (chunk_vec::iterator I = all_chunks.begin()
[all...] |
| sb_def_use.cpp | 90 for (vvec::iterator I = vv.begin(), E = vv.end(); I != E; ++I) {
109 for (vvec::iterator I = n->src.begin(), E = n->src.end(); I != E; ++I) {
118 for (vvec::iterator I = v->muse.begin(), E = v->muse.end();
130 for (vvec::iterator I = n->dst.begin(), E = n->dst.end(); I != E; ++I) {
137 for (vvec::iterator I = v->muse.begin(), E = v->muse.end();
|
| sb_shader.h | 157 typedef typename container::iterator iterator; typedef in class:r600_sb::queue
159 iterator begin() { return cont.begin(); }
160 iterator end() { return cont.end(); }
162 iterator insert(const T& t) {
163 iterator I = std::upper_bound(begin(), end(), t, Comp());
173 std::pair<iterator, iterator> R =
175 iterator F = std::find(R.first, R.second, t);
|
| sb_gvn.cpp | 166 for (vvec::iterator I = n.src.begin(), E = n.src.end(); I != E;
177 for (vvec::iterator I = n.src.begin(), E = n.src.end(); I != E; ++I) {
190 for(vvec::iterator I = n.src.begin(), E = n.src.end(); I != E; ++I) {
217 for(vvec::iterator I = n.dst.begin(), E = n.dst.end(); I != E; ++I) {
|
| sb_ir.cpp | 65 for (vvec::iterator I = dst.begin(), E = dst.end(); I != E; ++I) {
110 void container_node::move(iterator b, iterator e) {
125 node* container_node::cut(iterator b, iterator e) {
319 vvec::iterator SI(src.begin()), DI(dst.begin());
335 for (vvec::iterator I2 = dst.begin(), E2 = dst.end();
346 for (vvec::iterator I2 = dst.begin(), E2 = dst.end();
356 for (vvec::iterator I2 = n->src.begin(), E2 = n->src.end();
360 for (vvec::iterator I2 = n->dst.begin(), E2 = n->dst.end()
[all...] |
| sb_liveness.cpp | 197 for(val_set::iterator I = s.begin(sh), E = s.end(sh); I != E; ++I) {
230 vvec::iterator S(v->muse.begin());
232 for (vvec::iterator I = v->mdef.begin(), E = v->mdef.end(); I != E;
283 for (vvec::iterator I = vv.begin(), E = vv.end(); I != E; ++I) {
349 for (gpr_array_vec::iterator I = vv.begin(), E = vv.end(); I != E;
360 for (vvec::iterator I = vv.begin(), E = vv.end(); I != E; ++I) {
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r600/sb/ |
| sb_ir.h | 115 typedef typename data_vector::iterator iterator; typedef in class:r600_sb::sb_set
121 iterator begin() { return vec.begin(); }
122 iterator end() { return vec.end(); }
134 iterator lower_bound(const V& v) {
138 std::pair<iterator, bool> insert(const V& v) {
139 iterator P = lower_bound(v);
146 iterator P = lower_bound(v);
161 iterator find(const V& v) {
162 iterator P = lower_bound(v)
188 typedef typename dataset::iterator iterator; typedef in class:r600_sb::sb_map
327 class iterator { class in class:r600_sb::sb_value_set
891 class iterator { class in class:r600_sb::container_node
894 iterator(node *pp = NULL) : p(pp) {} function in class:r600_sb::container_node::iterator
[all...] |
| sb_ra_coalesce.cpp | 96 for (vvec::iterator I = c2->values.begin(), E = c2->values.end(); I != E;
102 chunk_vec::iterator F = std::find(all_chunks.begin(), all_chunks.end(), c2);
123 for (vvec::iterator I = c1->values.begin(), E = c1->values.end(); I != E;
127 for (vvec::iterator I = c2->values.begin(), E = c2->values.end(); I != E;
140 for (edge_queue::iterator I = edges.begin(), E = edges.end();
169 for (edge_queue::iterator I = edges.begin(), E = edges.end();
183 for (chunk_vec::iterator I = all_chunks.begin(), E = all_chunks.end();
194 for (constraint_queue::iterator I = constraints.begin(),
233 for (vvec::iterator I = c->values.begin(), E = c->values.end(); I != E;
242 for (chunk_vec::iterator I = all_chunks.begin()
[all...] |
| sb_def_use.cpp | 90 for (vvec::iterator I = vv.begin(), E = vv.end(); I != E; ++I) {
109 for (vvec::iterator I = n->src.begin(), E = n->src.end(); I != E; ++I) {
118 for (vvec::iterator I = v->muse.begin(), E = v->muse.end();
130 for (vvec::iterator I = n->dst.begin(), E = n->dst.end(); I != E; ++I) {
137 for (vvec::iterator I = v->muse.begin(), E = v->muse.end();
|
| sb_shader.h | 157 typedef typename container::iterator iterator; typedef in class:r600_sb::queue
159 iterator begin() { return cont.begin(); }
160 iterator end() { return cont.end(); }
162 iterator insert(const T& t) {
163 iterator I = std::upper_bound(begin(), end(), t, Comp());
173 std::pair<iterator, iterator> R =
175 iterator F = std::find(R.first, R.second, t);
|
| sb_gvn.cpp | 166 for (vvec::iterator I = n.src.begin(), E = n.src.end(); I != E;
177 for (vvec::iterator I = n.src.begin(), E = n.src.end(); I != E; ++I) {
190 for(vvec::iterator I = n.src.begin(), E = n.src.end(); I != E; ++I) {
217 for(vvec::iterator I = n.dst.begin(), E = n.dst.end(); I != E; ++I) {
|
| sb_ir.cpp | 65 for (vvec::iterator I = dst.begin(), E = dst.end(); I != E; ++I) {
110 void container_node::move(iterator b, iterator e) {
125 node* container_node::cut(iterator b, iterator e) {
319 vvec::iterator SI(src.begin()), DI(dst.begin());
335 for (vvec::iterator I2 = dst.begin(), E2 = dst.end();
346 for (vvec::iterator I2 = dst.begin(), E2 = dst.end();
356 for (vvec::iterator I2 = n->src.begin(), E2 = n->src.end();
360 for (vvec::iterator I2 = n->dst.begin(), E2 = n->dst.end()
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/frontends/clover/util/ |
| range.hpp | 74 typedef I iterator; typedef in class:clover::detail::basic_range
76 typedef typename std::iterator_traits<iterator>::value_type value_type;
77 typedef typename std::iterator_traits<iterator>::reference
81 typedef typename std::iterator_traits<iterator>::difference_type
95 iterator
100 iterator
115 std::reverse_iterator<iterator>
120 std::reverse_iterator<iterator>
180 /// Range that contains all elements delimited by an iterator pair
254 typename super::iterator
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/state_trackers/clover/util/ |
| range.hpp | 74 typedef I iterator; typedef in class:clover::detail::basic_range
76 typedef typename std::iterator_traits<iterator>::value_type value_type;
77 typedef typename std::iterator_traits<iterator>::reference
81 typedef typename std::iterator_traits<iterator>::difference_type
95 iterator
100 iterator
115 std::reverse_iterator<iterator>
120 std::reverse_iterator<iterator>
180 /// Range that contains all elements delimited by an iterator pair
254 typename super::iterator
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/hgl/ |
| GLRendererRoster.cpp | 96 RendererMap::const_iterator iterator = fRenderers.begin();
97 iterator != fRenderers.end();
98 iterator++
100 renderer_item item = *iterator;
|
| /xsrc/external/mit/freetype/dist/include/freetype/ |
| ftlist.h | 184 * An FT_List iterator function that is called during a list parse by
206 * Parse a list and calls a given iterator function on each element.
207 * Note that parsing is stopped as soon as one of the iterator calls
213 * iterator ::
214 * An iterator function, called on each node of the list.
217 * iterator.
220 * The result (a FreeType error code) of the last iterator call.
224 FT_List_Iterator iterator,
234 * An @FT_List iterator function that is called during a list
|
| /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/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/hgl/ |
| GLRendererRoster.cpp | 89 RendererMap::const_iterator iterator = fRenderers.find(id); local
90 if (iterator == fRenderers.end())
93 struct renderer_item item = iterator->second;
|
