Home
last modified time | relevance | path

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

12

/art/runtime/base/
Diteration_range.h29 typedef Iter iterator; typedef
35 IterationRange(iterator first, iterator last) : first_(first), last_(last) { } in IterationRange()
37 iterator begin() const { return first_; } in begin()
38 iterator end() const { return last_; } in end()
39 iterator cbegin() const { return first_; } in cbegin()
40 iterator cend() const { return last_; } in cend()
43 const iterator first_;
44 const iterator last_;
Dbit_vector_test.cc58 BitVector::IndexIterator iterator = bv.Indexes().begin(); in TEST() local
59 EXPECT_TRUE(iterator != bv.Indexes().end()); in TEST()
60 EXPECT_EQ(0u, *iterator); in TEST()
61 ++iterator; in TEST()
62 EXPECT_TRUE(iterator != bv.Indexes().end()); in TEST()
63 EXPECT_EQ(kBits - 1u, *iterator); in TEST()
64 ++iterator; in TEST()
65 EXPECT_TRUE(iterator == bv.Indexes().end()); in TEST()
Dstringpiece.h43 typedef const char* iterator; typedef
45 typedef std::reverse_iterator<iterator> reverse_iterator;
133 iterator begin() const { return ptr_; } in begin()
134 iterator end() const { return ptr_ + length_; } in end()
Dstl_util.h76 for (typename T::iterator i = v->begin(); i != v->end(); ++i) { in STLDeleteValues()
Dbit_vector.h49 std::iterator<std::forward_iterator_tag, uint32_t, ptrdiff_t, void, uint32_t> {
Dvariant_map.h401 typename StorageMap::iterator GetKeyValueIterator(const TKey<TValue>& key) { in GetKeyValueIterator()
Dbit_utils.h260 : public std::iterator<std::forward_iterator_tag, uint32_t, ptrdiff_t, void, void> {
/art/runtime/
Dsafe_map.h40 typedef typename ::std::map<K, V, Comparator, Allocator>::iterator iterator; typedef
61 iterator begin() { return map_.begin(); } in begin()
63 iterator end() { return map_.end(); } in end()
71 iterator erase(iterator it) { return map_.erase(it); } in erase()
74 iterator find(const K& k) { return map_.find(k); } in find()
77 iterator lower_bound(const K& k) { return map_.lower_bound(k); } in lower_bound()
90 iterator Put(const K& k, const V& v) { in Put()
91 std::pair<iterator, bool> result = map_.emplace(k, v); in Put()
97 iterator PutBefore(iterator pos, const K& k, const V& v) { in PutBefore()
100 DCHECK(pos == map_.begin() || map_.key_comp()((--iterator(pos))->first, k)); in PutBefore()
[all …]
Dprofiler.cc491 Map::iterator i = table[index]->find(method); in Put()
550 MethodContextMap::iterator i = method_context_table->find(method); in PutStack()
592 PreviousProfile::iterator pi = previous_.find(method_name); in Write()
632 PreviousProfile::iterator pi = previous_.find(method_name); in Write()
639 PreviousContextMap::iterator ci = new_context_map.find(context_i.first); in Write()
850 ProfileSet::iterator end = countSet.end(); in LoadFile()
852 for (ProfileSet::iterator it = countSet.begin(); it != end ; it++) { in LoadFile()
873 ProfileMap::iterator i = profile_map_.find(method_name); in GetProfileData()
882 ProfileMap::iterator end = profile_map_.end(); in GetTopKSamples()
883 for (ProfileMap::iterator it = profile_map_.begin(); it != end; it++) { in GetTopKSamples()
[all …]
Dstride_iterator.h25 class StrideIterator : public std::iterator<std::forward_iterator_tag, T> {
Doat_file_assistant.cc537 std::set<std::string>::iterator end = diff.end(); in IsProfileChangeSignificant()
538 for (std::set<std::string>::iterator it = diff.begin(); it != end; it++) { in IsProfileChangeSignificant()
/art/cmdline/
Dtoken_range.h106 using iterator = TokenList::const_iterator; member
109 using const_iterator = iterator;
144 iterator begin() const { in begin()
149 iterator end() const { in end()
248 iterator it_end;
289 for (iterator it = begin(); it != end(); ++it) { in MatchSubstrings()
407 TokenList::iterator new_end = in RemoveIf()
420 const iterator begin_;
421 const iterator end_;
/art/compiler/dex/
Dpass_driver_me.h188 DataflowIterator* iterator) { in DoWalkBasicBlocks() argument
190 DCHECK(iterator != nullptr); in DoWalkBasicBlocks()
192 for (BasicBlock* bb = iterator->Next(change); bb != nullptr; bb = iterator->Next(change)) { in DoWalkBasicBlocks()
203 Iterator iterator(c_unit->mir_graph.get()); in DoWalkBasicBlocks()
204 DoWalkBasicBlocks(data, pass, &iterator); in DoWalkBasicBlocks()
Dlocal_value_numbering.h350 const typename Set::value_type& entry, typename Set::iterator hint)>
355 void MergeEscapedRefs(const ValueNameSet::value_type& entry, ValueNameSet::iterator hint);
357 EscapedIFieldClobberSet::iterator hint);
359 EscapedIFieldClobberSet::iterator hint);
361 EscapedArrayClobberSet::iterator hint);
363 SFieldToValueMap::iterator hint);
365 IFieldLocToValueMap::iterator hint);
370 void MergeAliasingValues(const typename Map::value_type& entry, typename Map::iterator hint);
Dmir_optimization_test.cc382 RepeatingPreOrderDfsIterator iterator(cu_.mir_graph.get()); in PerformClassInitCheckElimination() local
384 for (BasicBlock* bb = iterator.Next(change); bb != nullptr; bb = iterator.Next(change)) { in PerformClassInitCheckElimination()
435 RepeatingPreOrderDfsIterator iterator(cu_.mir_graph.get()); in PerformNullCheckElimination() local
437 for (BasicBlock* bb = iterator.Next(change); bb != nullptr; bb = iterator.Next(change)) { in PerformNullCheckElimination()
481 TopologicalSortIterator iterator(cu_.mir_graph.get()); in PerformSuspendCheckElimination() local
483 for (BasicBlock* bb = iterator.Next(change); bb != nullptr; bb = iterator.Next(change)) { in PerformSuspendCheckElimination()
Dgvn_dead_code_elimination_test.cc337 AllNodesIterator iterator(cu_.mir_graph.get()); in PrepareSRegToVRegMap() local
338 for (BasicBlock* bb = iterator.Next(); bb != nullptr; bb = iterator.Next()) { in PrepareSRegToVRegMap()
361 LoopRepeatingTopologicalSortIterator iterator(cu_.mir_graph.get()); in PerformGVN() local
363 for (BasicBlock* bb = iterator.Next(change); bb != nullptr; bb = iterator.Next(change)) { in PerformGVN()
379 TopologicalSortIterator iterator(cu_.mir_graph.get()); in PerformGVNCodeModifications() local
380 for (BasicBlock* bb = iterator.Next(); bb != nullptr; bb = iterator.Next()) { in PerformGVNCodeModifications()
396 PreOrderDfsIterator iterator(cu_.mir_graph.get()); in FillVregToSsaRegExitMaps() local
397 for (BasicBlock* bb = iterator.Next(); bb != nullptr; bb = iterator.Next()) { in FillVregToSsaRegExitMaps()
424 PreOrderDfsIterator iterator(cu_.mir_graph.get()); in PerformDCE() local
425 for (BasicBlock* bb = iterator.Next(); bb != nullptr; bb = iterator.Next()) { in PerformDCE()
Dmir_graph.cc378 CatchHandlerIterator iterator(handlers_ptr); in ProcessTryCatchBlocks() local
379 for (; iterator.HasNext(); iterator.Next()) { in ProcessTryCatchBlocks()
380 uint32_t address = iterator.GetHandlerAddress(); in ProcessTryCatchBlocks()
383 handlers_ptr = iterator.EndDataPointer(); in ProcessTryCatchBlocks()
605 CatchHandlerIterator iterator(*current_code_item_, cur_offset); in ProcessCanThrow() local
613 for (; iterator.HasNext(); iterator.Next()) { in ProcessCanThrow()
614 BasicBlock* catch_block = FindBlock(iterator.GetHandlerAddress(), false /* create */, in ProcessCanThrow()
632 successor_block_info->key = iterator.GetHandlerTypeIndex(); in ProcessCanThrow()
Dlocal_value_numbering.cc591 const typename Set::value_type& entry, typename Set::iterator hint)>
641 ValueNameSet::iterator hint) { in MergeEscapedRefs()
657 const EscapedIFieldClobberSet::value_type& entry, EscapedIFieldClobberSet::iterator hint) { in MergeEscapedIFieldTypeClobberSets()
665 const EscapedIFieldClobberSet::value_type& entry, EscapedIFieldClobberSet::iterator hint) { in MergeEscapedIFieldClobberSets()
675 const EscapedArrayClobberSet::value_type& entry, EscapedArrayClobberSet::iterator hint) { in MergeEscapedArrayClobberSets()
738 SFieldToValueMap::iterator hint) { in MergeSFieldValues()
776 IFieldLocToValueMap::iterator hint) { in MergeNonAliasingIFieldValues()
813 typename Map::iterator hint) { in MergeAliasingValues()
Dglobal_value_numbering_test.cc325 IteratorType iterator(cu_.mir_graph.get()); in DoPerformGVN() local
327 for (BasicBlock* bb = iterator.Next(change); bb != nullptr; bb = iterator.Next(change)) { in DoPerformGVN()
343 TopologicalSortIterator iterator(cu_.mir_graph.get()); in PerformGVNCodeModifications() local
344 for (BasicBlock* bb = iterator.Next(); bb != nullptr; bb = iterator.Next()) { in PerformGVNCodeModifications()
Dtype_inference_test.cc446 AllNodesIterator iterator(cu_.mir_graph.get()); in AllocEndingVRegToSRegMaps() local
447 for (BasicBlock* bb = iterator.Next(); bb != nullptr; bb = iterator.Next()) { in AllocEndingVRegToSRegMaps()
/art/compiler/utils/
Darray_ref.h51 typedef T* iterator; typedef
53 typedef std::reverse_iterator<iterator> reverse_iterator;
112 iterator begin() { return array_; } in begin()
115 iterator end() { return array_ + size_; } in end()
/art/runtime/verifier/
Dmethod_verifier.cc745 CatchHandlerIterator iterator(handlers_ptr); in ScanTryCatchBlocks() local
746 for (; iterator.HasNext(); iterator.Next()) { in ScanTryCatchBlocks()
747 uint32_t dex_pc= iterator.GetHandlerAddress(); in ScanTryCatchBlocks()
761 if (iterator.GetHandlerTypeIndex() != DexFile::kDexNoIndex16) { in ScanTryCatchBlocks()
763 iterator.GetHandlerTypeIndex(), in ScanTryCatchBlocks()
771 handlers_ptr = iterator.EndDataPointer(); in ScanTryCatchBlocks()
1349 DexFileParameterIterator iterator(*dex_file_, proto_id); in SetTypesFromSignature() local
1351 for (; iterator.HasNext(); iterator.Next()) { in SetTypesFromSignature()
1352 const char* descriptor = iterator.GetDescriptor(); in SetTypesFromSignature()
1369 const RegType& reg_type = ResolveClassAndCheckAccess(iterator.GetTypeIdx()); in SetTypesFromSignature()
[all …]
Dreg_type_cache.cc256 std::vector<const RegType*>::iterator non_primitive_begin = entries_.begin(); in ~RegTypeCache()
/art/compiler/optimizing/
Dgvn.cc172 Node* CloneBucket(size_t index, Node* iterator = nullptr) { in CloneBucket() argument
179 if (node == iterator) { in CloneBucket()
Dbuilder.cc300 CatchHandlerIterator iterator(handlers_ptr); in BuildGraph() local
301 for (; iterator.HasNext(); iterator.Next()) { in BuildGraph()
302 uint32_t address = iterator.GetHandlerAddress(); in BuildGraph()
310 handlers_ptr = iterator.EndDataPointer(); in BuildGraph()

12