Searched refs:it (Results 1 - 25 of 51) sorted by relevance

123

/art/runtime/
H A Ddex_method_iterator_test.cc33 DexMethodIterator it(dex_files);
34 while (it.HasNext()) {
35 const DexFile& dex_file = it.GetDexFile();
36 InvokeType invoke_type = it.GetInvokeType();
37 uint32_t method_idx = it.GetMemberIndex();
41 it.Next();
H A Dintern_table.cc64 for (auto it = table.find(hash_code), end = table.end(); it != end; ++it) {
65 mirror::String* existing_string = it->second;
83 for (auto it = table.find(hash_code), end = table.end(); it != end; ++it) {
84 if (it->second == s) {
85 table.erase(it);
222 for (auto it
[all...]
H A Dsafe_map.h55 void erase(iterator it) { map_.erase(it); } argument
65 const_iterator it = map_.find(k); local
66 DCHECK(it != map_.end());
67 return it->second;
H A Ddex_file_test.cc151 ClassDataItemIterator it(*raw, class_data);
153 EXPECT_EQ(1u, it.NumDirectMethods());
157 ASSERT_EQ(1U, it.NumDirectMethods());
158 const DexFile::MethodId& method_id = raw->GetMethodId(it.GetMemberIndex());
168 ASSERT_EQ(2U, it.NumVirtualMethods());
170 it.Next();
171 const DexFile::MethodId& method_id = raw->GetMethodId(it.GetMemberIndex());
183 it.Next();
184 const DexFile::MethodId& method_id = raw->GetMethodId(it.GetMemberIndex());
H A Ddex_file_verifier.cc564 ClassDataItemIterator it(*dex_file_, ptr_);
566 for (; it.HasNextStaticField(); it.Next()) {
567 if (!CheckClassDataItemField(it.GetMemberIndex(), it.GetMemberAccessFlags(), true)) {
571 for (; it.HasNextInstanceField(); it.Next()) {
572 if (!CheckClassDataItemField(it.GetMemberIndex(), it.GetMemberAccessFlags(), false)) {
576 for (; it
1302 auto it = offset_to_type_map_.find(offset); local
[all...]
H A Doat_file.cc81 // This won't work for portable runtime execution because it doesn't process relocations.
329 Table::const_iterator it = oat_dex_files_.find(dex_location); local
330 if (it != oat_dex_files_.end()) {
331 const OatFile::OatDexFile* oat_dex_file = it->second;
342 for (Table::const_iterator it = oat_dex_files_.begin(); it != oat_dex_files_.end(); ++it) {
344 << " contains OatDexFile " << it->second->GetDexFileLocation();
353 for (Table::const_iterator it = oat_dex_files_.begin(); it !
[all...]
H A Dinstrumentation.cc169 for (It it = thread->GetInstrumentationStack()->rbegin(),
170 end = thread->GetInstrumentationStack()->rend(); it != end; ++it) {
171 mirror::Object* this_object = (*it).this_object_;
172 mirror::ArtMethod* method = (*it).method_;
407 auto it = method_entry_listeners_.begin(); local
408 bool is_end = (it == method_entry_listeners_.end());
411 InstrumentationListener* cur = *it;
412 ++it;
413 is_end = (it
421 auto it = method_exit_listeners_.begin(); local
[all...]
H A Dintern_table_test.cc61 for (auto it = expected_.begin(), end = expected_.end(); it != end; ++it) {
62 if (*it == s) {
63 expected_.erase(it);
H A Dclass_linker.cc188 // dex_lock_ is recursive as it may be used in stack dumping.
209 // java_lang_Class comes first, it's needed for AllocClass
924 // If no classes.dex found in dex_location, it has been stripped, assume oat is up-to-date.
960 // Try to generate oat file if it wasn't found or was obsolete.
1114 for (const std::pair<size_t, mirror::Class*>& it : class_table_) {
1115 visitor(it.second, arg);
1134 for (const std::pair<size_t, mirror::Class*>& it : class_table_) {
1135 if (!visitor(it.second, arg)) {
1267 // Wait for the class if it has not already been linked.
1472 for (ClassDataItemIterator it(dex_fil
1839 LoadField(const DexFile& , const ClassDataItemIterator& it, SirtRef<mirror::Class>& klass, SirtRef<mirror::ArtField>& dst) argument
1847 LoadMethod(Thread* self, const DexFile& dex_file, const ClassDataItemIterator& it, SirtRef<mirror::Class>& klass) argument
[all...]
/art/runtime/gc/accounting/
H A Dmod_union_table-inl.h36 for (It it = spaces.begin(); it != spaces.end(); ++it) {
37 if ((*it)->Contains(ref)) {
38 return (*it)->IsDlMallocSpace();
41 // Assume it points to a large object.
55 for (It it = spaces.begin(); it != spaces.end(); ++it) {
56 space::ContinuousSpace* space = *it;
[all...]
H A Dcard_table.h76 for (byte* it = card_start; it != card_end; ++it) {
77 if (*it == kCardDirty) {
78 *it = kCardClean;
79 visitor(it);
146 // Card table doesn't begin at the beginning of the mem_map_, instead it is displaced by offset
H A Dmod_union_table.cc104 // Only add the reference if it is non null and fits our criteria.
192 for (const std::pair<const byte*, std::vector<const Object*> >& it : references_) {
193 for (const Object* ref : it.second) {
200 for (const std::pair<const byte*, std::vector<const Object*> > & it : references_) {
201 const byte* card = it.first;
203 std::set<const Object*> reference_set(it.second.begin(), it.second.end());
224 for (const std::pair<const byte*, std::vector<const Object*> >& it : references_) {
225 const byte* card_addr = it.first;
229 for (const mirror::Object* ref : it
[all...]
/art/compiler/dex/
H A Dlocal_value_numbering.h46 ValueMap::iterator it = value_map_.find(key); local
47 if (it != value_map_.end()) {
48 res = it->second;
58 ValueMap::const_iterator it = value_map_.find(key); local
59 return (it != value_map_.end());
65 MemoryVersionMap::iterator it = memory_version_map_.find(key); local
66 if (it == memory_version_map_.end()) {
70 res = it->second;
77 MemoryVersionMap::iterator it = memory_version_map_.find(key); local
78 if (it
86 SregValueMap::iterator it = sreg_value_map_.find(s_reg); local
96 SregValueMap::iterator it = sreg_value_map_.find(s_reg); local
108 SregValueMap::iterator it = sreg_wide_value_map_.find(s_reg); local
118 SregValueMap::iterator it = sreg_wide_value_map_.find(s_reg); local
[all...]
/art/runtime/jdwp/
H A Dobject_registry.cc65 // This object isn't in the registry yet, so add it.
95 for (object_iterator it = object_to_entry_.begin(); it != object_to_entry_.end(); ++it) {
96 ObjectRegistryEntry& entry = (it->second);
112 id_iterator it = id_to_entry_.find(id); local
113 if (it == id_to_entry_.end()) {
116 ObjectRegistryEntry& entry = *(it->second);
123 id_iterator it = id_to_entry_.find(id); local
124 CHECK(it !
132 id_iterator it = id_to_entry_.find(id); local
142 id_iterator it = id_to_entry_.find(id); local
174 id_iterator it = id_to_entry_.find(id); local
191 id_iterator it = id_to_entry_.find(id); local
[all...]
/art/runtime/base/
H A Dtiming_logger.cc70 for (CumulativeLogger::HistogramsIterator it = histograms_.begin(), end = histograms_.end();
71 it != end; ++it) {
72 total += it->second->Sum();
80 for (base::TimingLogger::SplitTimingsIterator it = splits.begin(), end = splits.end();
81 it != end; ++it) {
82 base::TimingLogger::SplitTiming split = *it;
110 for (CumulativeLogger::HistogramsIterator it = histograms_.begin(), end = histograms_.end();
111 it !
[all...]
H A Dmutex.cc154 for (It it = all_mutexes->begin(); it != all_mutexes->end(); ++it) {
155 BaseMutex* mutex = *it;
162 for (It it = all_mutexes->begin(); it != all_mutexes->end(); ++it) {
163 BaseMutex* mutex = *it;
216 // This code is intentionally racy as it is only used for diagnostics.
253 It it local
[all...]
/art/runtime/entrypoints/portable/
H A Dportable_throw_entrypoints.cc91 for (CatchHandlerIterator it(*code_item, *try_item); it.HasNext(); it.Next()) {
92 uint16_t iter_type_idx = it.GetHandlerTypeIndex();
95 catch_dex_pc = it.GetHandlerAddress();
107 catch_dex_pc = it.GetHandlerAddress();
120 // If the catch block has no move-exception then clear the exception for it.
/art/runtime/verifier/
H A Dregister_line.h86 // The register index was validated during the static pass, so we don't need to check it here.
153 * The "this" argument to <init> uses code offset kUninitThisArgAddr, which puts it at the start
154 * of the list in slot 0. If we see a register with an uninitialized slot 0 reference, we know it
173 * caller can decide whether it needs the reference to be initialized or not. (Can also return
299 SafeMap<uint32_t, uint32_t>::iterator it = reg_to_lock_depths_.find(src);
300 if (it != reg_to_lock_depths_.end()) {
301 reg_to_lock_depths_.Put(dst, it->second);
306 SafeMap<uint32_t, uint32_t>::iterator it = reg_to_lock_depths_.find(reg);
307 if (it != reg_to_lock_depths_.end()) {
308 return (it
317 SafeMap<uint32_t, uint32_t>::iterator it = reg_to_lock_depths_.find(reg); local
328 SafeMap<uint32_t, uint32_t>::iterator it = reg_to_lock_depths_.find(reg); local
[all...]
/art/compiler/utils/
H A Ddedupe_set.h58 auto it = keys_.find(hashed_key); local
59 if (it != keys_.end()) {
60 return it->second;
/art/compiler/
H A Delf_writer_mclinker.cc108 // TODO: LinkerTest uses mcld::Initialize(), but it does an
110 // want mcld::InitializeNative, but it doesn't exist yet, so we
240 DexMethodIterator it(dex_files);
241 while (it.HasNext()) {
242 const DexFile& dex_file = it.GetDexFile();
243 uint32_t method_idx = it.GetMemberIndex();
249 it.Next();
256 // it. This can happen for reused code such as invoke stubs.
258 SafeMap<const std::string*, const std::string*>::iterator it = added_symbols_.find(&symbol); local
259 if (it !
386 SafeMap<const std::string*, uint32_t>::iterator it = symbol_to_compiled_code_offset_.find(&symbol); local
[all...]
H A Doat_writer.cc147 ClassDataItemIterator it(*dex_file, class_data);
148 size_t num_direct_methods = it.NumDirectMethods();
149 size_t num_virtual_methods = it.NumVirtualMethods();
242 ClassDataItemIterator it(dex_file, class_data);
244 it.NumDirectMethods() + it.NumVirtualMethods());
246 while (it.HasNextStaticField()) {
247 it.Next();
249 while (it.HasNextInstanceField()) {
250 it
[all...]
/art/runtime/native/
H A Ddalvik_system_VMDebug.cc265 for (It it = continuous_spaces.begin(), end = continuous_spaces.end(); it != end; ++it) {
266 gc::space::ContinuousSpace* space = *it;
281 for (It2 it = discontinuous_spaces.begin(), end = discontinuous_spaces.end(); it != end; ++it) {
282 gc::space::DiscontinuousSpace* space = *it;
/art/compiler/driver/
H A Dcompiler_driver.cc211 // Indicate that a method of the given type was unresolved at compile time as it was in an
684 for (auto it = image_classes_->begin(), end = image_classes_->end(); it != end;) {
685 std::string descriptor(*it);
688 image_classes_->erase(it++);
692 ++it;
829 // Get type from dex cache assuming it was populated by the verifier
866 // Get type from dex cache assuming it was populated by the verifier.
1016 // We have the resolved field, we must make it into a ssbIndex for the referrer
1017 // in its static storage base (which may fail if it does
2372 ClassTable::const_iterator it = compiled_classes_.find(ref); local
2382 auto it = compiled_classes_.find(ref); local
2408 MethodTable::const_iterator it = compiled_methods_.find(ref); local
[all...]
/art/runtime/mirror/
H A Dart_method.cc220 for (CatchHandlerIterator it(*code_item, dex_pc); it.HasNext(); it.Next()) {
221 uint16_t iter_type_idx = it.GetHandlerTypeIndex();
224 found_dex_pc = it.GetHandlerAddress();
234 found_dex_pc = it.GetHandlerAddress();
319 // find it.
/art/oatdump/
H A Doatdump.cc162 It it = offsets_.upper_bound(begin_offset); local
163 CHECK(it != offsets_.end());
164 uint32_t end_offset = *it;
212 ClassDataItemIterator it(*dex_file, class_data);
213 SkipAllFields(it);
215 while (it.HasNextDirectMethod()) {
217 it.Next();
219 while (it.HasNextVirtualMethod()) {
221 it.Next();
268 static void SkipAllFields(ClassDataItemIterator& it) { argument
1130 SizeAndCountTable::iterator it = sizes_and_counts.find(descriptor); local
[all...]

Completed in 527 milliseconds

123