Home
last modified time | relevance | path

Searched refs:iterator (Results 1 – 25 of 86) sorted by relevance

1234

/system/core/libunwindstack/
DElfInterfaceArm.h36 class iterator : public std::iterator<std::bidirectional_iterator_tag, uint32_t> {
38 iterator(ElfInterfaceArm* interface, size_t index) : interface_(interface), index_(index) { } in iterator() function
40 iterator& operator++() { index_++; return *this; }
41 iterator& operator++(int increment) { index_ += increment; return *this; }
42 iterator& operator--() { index_--; return *this; }
43 iterator& operator--(int decrement) { index_ -= decrement; return *this; }
45 bool operator==(const iterator& rhs) { return this->index_ == rhs.index_; }
46 bool operator!=(const iterator& rhs) { return this->index_ != rhs.index_; }
64 iterator begin() { return iterator(this, 0); } in begin()
65 iterator end() { return iterator(this, total_entries_); } in end()
/system/core/libbacktrace/include/backtrace/
DBacktraceMap.h76 class iterator : public std::iterator<std::bidirectional_iterator_tag, backtrace_map_t*> {
78 iterator(BacktraceMap* map, size_t index) : map_(map), index_(index) {} in iterator() function
80 iterator& operator++() {
84 iterator& operator++(int increment) {
88 iterator& operator--() {
92 iterator& operator--(int decrement) {
97 bool operator==(const iterator& rhs) { return this->index_ == rhs.index_; }
98 bool operator!=(const iterator& rhs) { return this->index_ != rhs.index_; }
116 iterator begin() { return iterator(this, 0); } in begin()
117 iterator end() { return iterator(this, maps_.size()); } in end()
DBacktrace.h195 typedef std::vector<backtrace_frame_data_t>::iterator iterator; typedef
196 iterator begin() { return frames_.begin(); } in begin()
197 iterator end() { return frames_.end(); } in end()
/system/core/libutils/include/utils/
DList.h177 typedef _ListIterator<T, NON_CONST_ITERATOR> iterator; typedef
195 inline iterator begin() { in begin()
196 return iterator(mpMiddle->getNext()); in begin()
201 inline iterator end() { in end()
202 return iterator(mpMiddle); in end()
213 iterator insert(iterator posn, const T& val) in insert()
220 return iterator(newNode); in insert()
224 void insert(iterator posn, const_iterator first, const_iterator last) { in insert()
230 iterator erase(iterator posn) { in erase()
236 return iterator(pNext); in erase()
[all …]
DSortedVector.h130 typedef TYPE* iterator; typedef
133 inline iterator begin() { return editArray(); } in begin()
134 inline iterator end() { return editArray() + size(); } in end()
139 inline iterator erase(iterator pos) { in erase()
/system/keymaster/include/keymaster/
DList.h175 typedef _ListIterator<T, NON_CONST_ITERATOR> iterator; typedef
193 inline iterator begin() { in begin()
194 return iterator(mpMiddle->getNext()); in begin()
199 inline iterator end() { in end()
200 return iterator(mpMiddle); in end()
211 iterator insert(iterator posn, const T& val) in insert()
218 return iterator(newNode); in insert()
222 void insert(iterator posn, const_iterator first, const_iterator last) { in insert()
228 iterator erase(iterator posn) { in erase()
234 return iterator(pNext); in erase()
[all …]
/system/core/libunwindstack/include/unwindstack/
DDwarfSection.h44 class iterator : public std::iterator<std::bidirectional_iterator_tag, DwarfFde*> {
46 iterator(DwarfSection* section, size_t index) : index_(index) { in iterator() function
53 iterator& operator++() {
57 iterator& operator++(int increment) {
61 iterator& operator--() {
65 iterator& operator--(int decrement) {
70 bool operator==(const iterator& rhs) { return this->index_ == rhs.index_; }
71 bool operator!=(const iterator& rhs) { return this->index_ != rhs.index_; }
83 iterator begin() { return iterator(this, 0); } in begin()
84 iterator end() { return iterator(this, static_cast<size_t>(-1)); } in end()
DMaps.h63 typedef std::vector<std::unique_ptr<MapInfo>>::iterator iterator; typedef
64 iterator begin() { return maps_.begin(); } in begin()
65 iterator end() { return maps_.end(); } in end()
/system/chre/util/include/chre/util/
Dpriority_queue.h152 typedef ElementType* iterator; typedef
158 typename PriorityQueue<ElementType, CompareFunction>::iterator begin();
165 typename PriorityQueue<ElementType, CompareFunction>::iterator end();
Dfixed_size_vector.h180 typedef ElementType* iterator; typedef
186 typename FixedSizeVector<ElementType, kCapacity>::iterator begin();
193 typename FixedSizeVector<ElementType, kCapacity>::iterator end();
Ddynamic_vector.h36 typedef ElementType* iterator; typedef
293 typename DynamicVector<ElementType>::iterator begin();
300 typename DynamicVector<ElementType>::iterator end();
Darray_queue.h229 typedef ArrayQueueIterator<ElementType> iterator; typedef
235 typename ArrayQueue<ElementType, kCapacity>::iterator begin();
242 typename ArrayQueue<ElementType, kCapacity>::iterator end();
/system/chre/util/tests/
Dfixed_size_vector_test.cc206 for (FixedSizeVector<int, 8>::iterator it = vector.begin(); in TEST()
211 FixedSizeVector<int, 8>::iterator it = vector.begin() + vector.size() - 1; in TEST()
244 FixedSizeVector<int, 8>::iterator it_b = vector.begin(); in TEST()
245 FixedSizeVector<int, 8>::iterator it_e = vector.end(); in TEST()
261 FixedSizeVector<int, 8>::iterator it_b = vector.begin(); in TEST()
262 FixedSizeVector<int, 8>::iterator it_e = vector.end(); in TEST()
278 FixedSizeVector<int, 8>::iterator it_b = vector.begin(); in TEST()
295 FixedSizeVector<int, 8>::iterator it_b = vector.begin(); in TEST()
316 FixedSizeVector<int, 8>::iterator it_b = vector.begin(); in TEST()
Darray_queue_test.cc288 ArrayQueue<int, 4>::iterator it = q.begin(); in TEST()
301 for (ArrayQueue<int, 4>::iterator it = q.begin(); it != q.end(); ++it) { in TEST()
305 for (ArrayQueue<int, 4>::iterator it = q.begin(); it != q.end(); it++) { in TEST()
310 ArrayQueue<int, 4>::iterator it = q.begin(); in TEST()
328 ArrayQueue<int, 4>::iterator it2; in TEST()
332 ArrayQueue<int, 4>::iterator it3(it); in TEST()
353 ArrayQueue<int, 4>::iterator it_b = q.begin(); in TEST()
354 ArrayQueue<int, 4>::iterator it_e = q.end(); in TEST()
369 ArrayQueue<int, 4>::iterator it_b = q.begin(); in TEST()
384 ArrayQueue<int, 4>::iterator it_b = q.begin(); in TEST()
[all …]
/system/core/logd/
DLogBuffer.h86 LogBufferElementCollection::iterator mLast[LOG_ID_MAX];
89 typedef std::unordered_map<uid_t, LogBufferElementCollection::iterator>
93 typedef std::unordered_map<pid_t, LogBufferElementCollection::iterator>
191 LogBufferElementCollection::iterator erase(
192 LogBufferElementCollection::iterator it, bool coalesce = false);
DLogWhiteBlackList.cpp58 PruneCollection::iterator it; in ~PruneList()
70 PruneCollection::iterator it; in init()
185 PruneCollection::iterator it = list->begin(); in init()
232 PruneCollection::iterator it; in format()
254 PruneCollection::iterator it; in naughty()
264 PruneCollection::iterator it; in nice()
DLogBuffer.cpp76 LogBufferElementCollection::iterator it = mLogElements.begin(); in init()
106 LastLogTimes::iterator times = mTimes.begin(); in init()
391 LogBufferElementCollection::iterator it = mLogElements.end(); in log()
392 LogBufferElementCollection::iterator last = it; in log()
408 LastLogTimes::iterator times = mTimes.begin(); in log()
468 LogBufferElementCollection::iterator LogBuffer::erase( in erase()
469 LogBufferElementCollection::iterator it, bool coalesce) { in erase()
480 LogBufferIteratorMap::iterator found = mLastWorst[id].find(key); in erase()
490 LogBufferPidIteratorMap::iterator found = in erase()
504 LogBufferElementCollection::iterator bad = it; in erase()
[all …]
DLogStatistics.h78 typedef typename std::unordered_map<TKey, TEntry>::iterator iterator; typedef
120 inline iterator add(const TKey& key, const LogBufferElement* element) { in add()
121 iterator it = map.find(key); in add()
130 inline iterator add(TKey key) { in add()
131 iterator it = map.find(key); in add()
141 iterator it = map.find(std::move(key)); in subtract()
148 iterator it = map.find(key); in subtract()
155 iterator it = map.find(key); in drop()
161 inline iterator begin() { in begin()
167 inline iterator end() { in end()
[all …]
/system/core/fastboot/
Dusb_osx.cpp92 io_iterator_t iterator; in try_interfaces() local
106 kr = (*dev)->CreateInterfaceIterator(dev, &request, &iterator); in try_interfaces()
113 while ((usbInterface = IOIteratorNext(iterator))) { in try_interfaces()
395 io_iterator_t iterator; in init_usb() local
414 kIOMasterPortDefault, matchingDict, &iterator); in init_usb()
422 if (! IOIteratorIsValid(iterator)) { in init_usb()
427 IOIteratorReset(iterator); in init_usb()
431 io_service_t device = IOIteratorNext(iterator); in init_usb()
452 IOObjectRelease(iterator); in init_usb()
/system/libhidl/transport/include/hidl/
DConcurrentMap.h29 using iterator = typename std::map<K, V>::iterator; variable
83 iterator begin() { return mMap.begin(); } in begin()
84 iterator end() { return mMap.end(); } in end()
/system/update_engine/payload_generator/
Dcycle_breaker.cc80 for (vector<Vertex::Index>::iterator it = component_indexes.begin(); in BreakCycles()
84 for (vector<Vertex::Index>::iterator jt = component_indexes.begin(); in BreakCycles()
139 for (Vertex::EdgeMap::iterator it = blocked_graph_[u].out_edges.begin(); in Unblock()
180 for (Vertex::SubgraphEdgeMap::iterator w = in Circuit()
202 for (Vertex::SubgraphEdgeMap::iterator w = in Circuit()
Dgraph_utils.cc51 Vertex::EdgeMap::iterator edge_it = src->out_edges.find(dst); in AddReadBeforeDep()
54 pair<Vertex::EdgeMap::iterator, bool> result = in AddReadBeforeDep()
81 for (Vertex::EdgeMap::iterator it = edge_map->begin(); in DropWriteBeforeDeps()
98 for (Graph::iterator it = graph->begin(), e = graph->end(); it != e; ++it) { in DropIncomingEdgesTo()
Dextent_ranges.cc84 ExtentSet::iterator begin_del = extent_set_.end(); in AddExtent()
85 ExtentSet::iterator end_del = extent_set_.end(); in AddExtent()
87 for (ExtentSet::iterator it = extent_set_.begin(), e = extent_set_.end(); in AddExtent()
128 ExtentSet::iterator begin_del = extent_set_.end(); in SubtractExtent()
129 ExtentSet::iterator end_del = extent_set_.end(); in SubtractExtent()
132 for (ExtentSet::iterator it = extent_set_.begin(), e = extent_set_.end(); in SubtractExtent()
146 for (ExtentSet::iterator jt = subtraction.begin(), je = subtraction.end(); in SubtractExtent()
/system/netd/server/
DPppController.cpp43 TtyCollection::iterator it; in ~PppController()
62 TtyCollection::iterator it; in attachPppd()
131 TtyCollection::iterator it; in updateTtyList()
/system/security/keystore/
Dgrant_store.cpp52 auto iterator = in put() local
56 std::tie(iterator, success) = uid_grant_list.emplace(blobEntry, std::rand()); in put()
58 s << iterator->grant_no_; in put()

1234