Home
last modified time | relevance | path

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

123

/system/core/libunwindstack/
DElfInterfaceArm.h34 class iterator : public std::iterator<std::bidirectional_iterator_tag, uint32_t> {
36 iterator(ElfInterfaceArm* interface, size_t index) : interface_(interface), index_(index) { } in iterator() function
38 iterator& operator++() { index_++; return *this; }
39 iterator& operator++(int increment) { index_ += increment; return *this; }
40 iterator& operator--() { index_--; return *this; }
41 iterator& operator--(int decrement) { index_ -= decrement; return *this; }
43 bool operator==(const iterator& rhs) { return this->index_ == rhs.index_; }
44 bool operator!=(const iterator& rhs) { return this->index_ != rhs.index_; }
62 iterator begin() { return iterator(this, 0); } in begin()
63 iterator end() { return iterator(this, total_entries_); } in end()
/system/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/libutils/include/utils/
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 …]
DSortedVector.h128 typedef TYPE* iterator; typedef
131 inline iterator begin() { return editArray(); } in begin()
132 inline iterator end() { return editArray() + size(); } in end()
137 inline iterator erase(iterator pos) { in erase()
/system/core/libsysutils/include/sysutils/
DList.h176 typedef _ListIterator<T, NON_CONST_ITERATOR> iterator; typedef
194 inline iterator begin() { in begin()
195 return iterator(mpMiddle->getNext()); in begin()
200 inline iterator end() { in end()
201 return iterator(mpMiddle); in end()
212 iterator insert(iterator posn, const T& val) in insert()
219 return iterator(newNode); in insert()
223 void insert(iterator posn, const_iterator first, const_iterator last) { in insert()
229 iterator erase(iterator posn) { in erase()
235 return iterator(pNext); in erase()
[all …]
/system/core/libbacktrace/include/backtrace/
DBacktraceMap.h84 typedef std::deque<backtrace_map_t>::iterator iterator; typedef
85 iterator begin() { return maps_.begin(); } in begin()
86 iterator end() { return maps_.end(); } in end()
DBacktrace.h140 typedef std::vector<backtrace_frame_data_t>::iterator iterator; typedef
141 iterator begin() { return frames_.begin(); } in begin()
142 iterator end() { return frames_.end(); } in end()
/system/chre/util/tests/
Dfixed_size_vector_test.cc184 for (FixedSizeVector<int, 8>::iterator it = vector.begin(); in TEST()
189 FixedSizeVector<int, 8>::iterator it = vector.begin() + vector.size() - 1; in TEST()
222 FixedSizeVector<int, 8>::iterator it_b = vector.begin(); in TEST()
223 FixedSizeVector<int, 8>::iterator it_e = vector.end(); in TEST()
239 FixedSizeVector<int, 8>::iterator it_b = vector.begin(); in TEST()
240 FixedSizeVector<int, 8>::iterator it_e = vector.end(); in TEST()
256 FixedSizeVector<int, 8>::iterator it_b = vector.begin(); in TEST()
273 FixedSizeVector<int, 8>::iterator it_b = vector.begin(); in TEST()
294 FixedSizeVector<int, 8>::iterator it_b = vector.begin(); in TEST()
Darray_queue_test.cc200 ArrayQueue<int, 4>::iterator it = q.begin(); in TEST()
212 for (ArrayQueue<int, 4>::iterator it = q.begin(); it != q.end(); ++it) { in TEST()
217 ArrayQueue<int, 4>::iterator it = q.begin(); in TEST()
240 ArrayQueue<int, 4>::iterator it_b = q.begin(); in TEST()
241 ArrayQueue<int, 4>::iterator it_e = q.end(); in TEST()
256 ArrayQueue<int, 4>::iterator it_b = q.begin(); in TEST()
271 ArrayQueue<int, 4>::iterator it_b = q.begin(); in TEST()
283 ArrayQueue<int, 4>::iterator it_b = q.begin(); in TEST()
284 ArrayQueue<int, 4>::iterator it_e = q.end(); in TEST()
/system/core/logd/
DLogBuffer.h85 LogBufferElementCollection::iterator mLast[LOG_ID_MAX];
88 typedef std::unordered_map<uid_t, LogBufferElementCollection::iterator>
92 typedef std::unordered_map<pid_t, LogBufferElementCollection::iterator>
181 LogBufferElementCollection::iterator erase(
182 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()
100 LastLogTimes::iterator times = mTimes.begin(); in init()
377 LogBufferElementCollection::iterator it = mLogElements.end(); in log()
378 LogBufferElementCollection::iterator last = it; in log()
394 LastLogTimes::iterator times = mTimes.begin(); in log()
456 LogBufferElementCollection::iterator LogBuffer::erase( in erase()
457 LogBufferElementCollection::iterator it, bool coalesce) { in erase()
468 LogBufferIteratorMap::iterator found = mLastWorst[id].find(key); in erase()
478 LogBufferPidIteratorMap::iterator found = in erase()
492 LogBufferElementCollection::iterator bad = it; in erase()
[all …]
DLogStatistics.h72 typedef typename std::unordered_map<TKey, TEntry>::iterator iterator; typedef
114 inline iterator add(TKey key, LogBufferElement* element) { in add()
115 iterator it = map.find(key); in add()
124 inline iterator add(TKey key) { in add()
125 iterator it = map.find(key); in add()
135 iterator it = map.find(key); in subtract()
142 iterator it = map.find(key); in drop()
148 inline iterator begin() { in begin()
154 inline iterator end() { in end()
552 (pidTable.size() * sizeof(pidTable_t::iterator)) + in sizeOf()
[all …]
/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.h155 typedef ElementType* iterator; typedef
161 typename FixedSizeVector<ElementType, kCapacity>::iterator begin();
168 typename FixedSizeVector<ElementType, kCapacity>::iterator end();
Ddynamic_vector.h312 typedef ElementType* iterator; typedef
318 typename DynamicVector<ElementType>::iterator begin();
325 typename DynamicVector<ElementType>::iterator end();
Darray_queue.h198 typedef ArrayQueueIterator<ElementType> iterator; typedef
204 typename ArrayQueue<ElementType, kCapacity>::iterator begin();
211 typename ArrayQueue<ElementType, kCapacity>::iterator end();
Darray_queue_impl.h148 typename ArrayQueue<ElementType, kCapacity>::iterator
151 return empty() ? end() : iterator(data() + mHead, data(), mTail); in begin()
155 typename ArrayQueue<ElementType, kCapacity>::iterator
157 return iterator(data() + kCapacity, data(), mTail); in end()
/system/core/fastboot/
Dusb_osx.cpp88 io_iterator_t iterator; in try_interfaces() local
105 kr = (*dev)->CreateInterfaceIterator(dev, &request, &iterator); in try_interfaces()
112 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()
453 IOObjectRelease(iterator); in init_usb()
/system/update_engine/payload_generator/
Dcycle_breaker.cc79 for (vector<Vertex::Index>::iterator it = component_indexes.begin(); in BreakCycles()
82 for (vector<Vertex::Index>::iterator jt = component_indexes.begin(); in BreakCycles()
136 for (Vertex::EdgeMap::iterator it = blocked_graph_[u].out_edges.begin(); in Unblock()
175 for (Vertex::SubgraphEdgeMap::iterator w = in Circuit()
196 for (Vertex::SubgraphEdgeMap::iterator w = in Circuit()
Dgraph_utils.cc53 Vertex::EdgeMap::iterator edge_it = src->out_edges.find(dst); in AddReadBeforeDep()
56 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.cc83 ExtentSet::iterator begin_del = extent_set_.end(); in AddExtent()
84 ExtentSet::iterator end_del = extent_set_.end(); in AddExtent()
86 for (ExtentSet::iterator it = extent_set_.begin(), e = extent_set_.end(); in AddExtent()
126 ExtentSet::iterator begin_del = extent_set_.end(); in SubtractExtent()
127 ExtentSet::iterator end_del = extent_set_.end(); in SubtractExtent()
130 for (ExtentSet::iterator it = extent_set_.begin(), e = extent_set_.end(); in SubtractExtent()
143 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/core/libsysutils/src/
DSocketListener.cpp66 SocketClientCollection::iterator it; in ~SocketListener()
138 SocketClientCollection::iterator it; in stopListener()
159 SocketClientCollection::iterator it; in runListener()
252 SocketClientCollection::iterator it; in release()
278 SocketClientCollection::iterator i; in sendBroadcast()
306 SocketClientCollection::iterator i; in runOnEachSocket()
/system/libhidl/transport/include/hidl/
DConcurrentMap.h29 using iterator = typename std::map<K, V>::iterator; variable

123