| /system/unwinding/libunwindstack/ |
| D | ElfInterfaceArm.h | 34 class iterator {
42 iterator(ElfInterfaceArm* interface, size_t index) : interface_(interface), index_(index) { } in iterator() function
44 iterator& operator++() { index_++; return *this; }
45 iterator& operator++(int increment) { index_ += increment; return *this; }
46 iterator& operator--() { index_--; return *this; }
47 iterator& operator--(int decrement) { index_ -= decrement; return *this; }
49 bool operator==(const iterator& rhs) { return this->index_ == rhs.index_; }
50 bool operator!=(const iterator& rhs) { return this->index_ != rhs.index_; }
68 iterator begin() { return iterator(this, 0); } in begin()
69 iterator end() { return iterator(this, total_entries_); } in end()
|
| /system/keymaster/include/keymaster/ |
| D | List.h | 162 typedef _ListIterator<T, NON_CONST_ITERATOR> iterator; typedef
178 inline iterator begin() { return iterator(mpMiddle->getNext()); } in begin()
182 inline iterator end() { return iterator(mpMiddle); } in end()
190 iterator insert(iterator posn, const T& val) { in insert()
196 return iterator(newNode); in insert()
200 void insert(iterator posn, const_iterator first, const_iterator last) { in insert()
206 iterator erase(iterator posn) { in erase()
212 return iterator(pNext); in erase()
216 iterator erase(iterator first, iterator last) { in erase()
219 return iterator(last); in erase()
[all …]
|
| /system/core/libutils/include/utils/ |
| D | List.h | 177 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 …]
|
| D | SortedVector.h | 130 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/unwinding/libunwindstack/include/unwindstack/ |
| D | DwarfSection.h | 44 class iterator {
52 iterator(DwarfSection* section, size_t index) : index_(index) { in iterator() function
59 iterator& operator++() {
63 iterator& operator++(int increment) {
67 iterator& operator--() {
71 iterator& operator--(int decrement) {
76 bool operator==(const iterator& rhs) { return this->index_ == rhs.index_; }
77 bool operator!=(const iterator& rhs) { return this->index_ != rhs.index_; }
89 iterator begin() { return iterator(this, 0); } in begin()
90 iterator end() { return iterator(this, static_cast<size_t>(-1)); } in end()
|
| D | Maps.h | 64 typedef std::vector<std::shared_ptr<MapInfo>>::iterator iterator; typedef
65 iterator begin() { return maps_.begin(); } in begin()
66 iterator end() { return maps_.end(); } in end()
|
| /system/incremental_delivery/incfs/include/ |
| D | MountRegistry.h | 70 struct iterator final : public std::vector<Root>::const_iterator {
75 explicit iterator(base b) : base(b) {} in iterator() function
81 iterator begin() const { return iterator(roots.begin()); } in begin()
82 iterator end() const { return iterator(roots.end()); } in end()
|
| /system/chre/util/tests/ |
| D | fixed_size_vector_test.cc | 206 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()
|
| D | array_queue_test.cc | 300 ArrayQueue<int, 4>::iterator it = q.begin(); in TEST()
313 for (ArrayQueue<int, 4>::iterator it = q.begin(); it != q.end(); ++it) { in TEST()
317 for (ArrayQueue<int, 4>::iterator it = q.begin(); it != q.end(); it++) { in TEST()
322 ArrayQueue<int, 4>::iterator it = q.begin(); in TEST()
340 ArrayQueue<int, 4>::iterator it2; in TEST()
344 ArrayQueue<int, 4>::iterator it3(it); in TEST()
365 ArrayQueue<int, 4>::iterator it_b = q.begin(); in TEST()
366 ArrayQueue<int, 4>::iterator it_e = q.end(); in TEST()
381 ArrayQueue<int, 4>::iterator it_b = q.begin(); in TEST()
396 ArrayQueue<int, 4>::iterator it_b = q.begin(); in TEST()
[all …]
|
| D | dynamic_vector_test.cc | 524 for (DynamicVector<int>::iterator it = vector.begin(); it != vector.end(); in TEST()
529 DynamicVector<int>::iterator it = vector.begin() + vector.size() - 1; in TEST()
562 DynamicVector<int>::iterator it_b = vector.begin(); in TEST()
563 DynamicVector<int>::iterator it_e = vector.end(); in TEST()
581 DynamicVector<int>::iterator it_b = vector.begin(); in TEST()
582 DynamicVector<int>::iterator it_e = vector.end(); in TEST()
600 DynamicVector<int>::iterator it_b = vector.begin(); in TEST()
601 DynamicVector<int>::iterator it_e = vector.end(); in TEST()
619 DynamicVector<int>::iterator it_b = vector.begin(); in TEST()
636 DynamicVector<int>::iterator it_b = vector.begin(); in TEST()
[all …]
|
| /system/chre/util/include/chre/util/ |
| D | priority_queue.h | 153 typedef ElementType *iterator; typedef
159 typename PriorityQueue<ElementType, CompareFunction>::iterator begin();
168 typename PriorityQueue<ElementType, CompareFunction>::iterator end();
|
| D | fixed_size_vector.h | 184 typedef ElementType *iterator; typedef
190 typename FixedSizeVector<ElementType, kCapacity>::iterator begin();
199 typename FixedSizeVector<ElementType, kCapacity>::iterator end();
|
| D | dynamic_vector.h | 36 typedef ElementType *iterator; typedef
293 typename DynamicVector<ElementType>::iterator begin();
300 typename DynamicVector<ElementType>::iterator end();
|
| D | array_queue.h | 200 typedef ArrayQueueIterator<ElementType> iterator; typedef
206 iterator begin();
213 iterator end();
|
| /system/logging/logd/ |
| D | SimpleLogBuffer.h | 57 std::list<LogBufferElement>::iterator GetOldest(log_id_t log_id) REQUIRES(logd_lock);
58 std::list<LogBufferElement>::iterator Erase(std::list<LogBufferElement>::iterator it)
82 std::optional<std::list<LogBufferElement>::iterator> oldest_[LOG_ID_MAX] GUARDED_BY(logd_lock);
|
| D | LogStatistics.h | 93 typedef typename std::unordered_map<TKey, TEntry>::iterator iterator; typedef
141 iterator Add(const TKey& key, const LogStatisticsElement& element) { in Add()
142 iterator it = map.find(key); in Add()
151 iterator Add(const TKey& key) { in Add()
152 iterator it = map.find(key); in Add()
162 iterator it = map.find(key); in Subtract()
169 iterator it = map.find(key); in Drop()
176 iterator it = map.find(key); in Erase()
182 iterator begin() { return map.begin(); } in begin()
184 iterator end() { return map.end(); } in end()
[all …]
|
| /system/libhidl/transport/include/hidl/ |
| D | ConcurrentMap.h | 29 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/core/fastboot/ |
| D | usb_osx.cpp | 92 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()
411 io_iterator_t iterator; in init_usb() local
430 kIOMasterPortDefault, matchingDict, &iterator); in init_usb()
438 if (! IOIteratorIsValid(iterator)) { in init_usb()
443 IOIteratorReset(iterator); in init_usb()
447 io_service_t device = IOIteratorNext(iterator); in init_usb()
467 IOObjectRelease(iterator); in init_usb()
|
| /system/chre/apps/nearby/third_party/contexthub/chre/util/include/chre/util/ |
| D | dynamic_vector.h | 36 typedef ElementType *iterator; typedef
293 typename DynamicVector<ElementType>::iterator begin();
300 typename DynamicVector<ElementType>::iterator end();
|
| /system/netd/server/ |
| D | PppController.cpp | 44 TtyCollection::iterator it; in ~PppController()
63 TtyCollection::iterator it; in attachPppd()
132 TtyCollection::iterator it; in updateTtyList()
|
| /system/hardware/interfaces/suspend/1.0/default/ |
| D | WakeupList.h | 45 void erase(std::list<WakeupInfo>::iterator entry) REQUIRES(mLock);
50 std::unordered_map<std::string, std::list<WakeupInfo>::iterator> mLookupTable GUARDED_BY(mLock);
|
| D | WakeLockEntryList.h | 58 void deleteEntry(std::list<WakeLockInfo>::iterator entry) REQUIRES(mStatsLock);
79 std::unordered_map<std::pair<std::string, int>, std::list<WakeLockInfo>::iterator, LockHash>
|
| /system/update_engine/payload_generator/ |
| D | extent_ranges.cc | 84 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()
131 ExtentSet::iterator begin_del = extent_set_.end(); in SubtractExtent()
132 ExtentSet::iterator end_del = extent_set_.end(); in SubtractExtent()
135 for (ExtentSet::iterator it = extent_set_.begin(), e = extent_set_.end(); in SubtractExtent()
149 for (ExtentSet::iterator jt = subtraction.begin(), je = subtraction.end(); in SubtractExtent()
|
| /system/core/property_service/libpropertyinfoserializer/ |
| D | trie_builder.cpp | 100 auto [iterator, _] = container->emplace(string); in StringPointerFromContainer()
101 return &(*iterator); in StringPointerFromContainer()
|
| /system/libvintf/include/vintf/ |
| D | MapValueIterator.h | 34 struct IteratorImpl : public std::iterator <
48 typename Map::const_iterator, typename Map::iterator>::type;
104 typename Map::iterator>::type;
|