/art/compiler/dex/ |
H A D | mir_method_info.cc | 35 for (auto it = method_infos, end = method_infos + count; it != end; ++it) { 36 MirMethodLoweringInfo unresolved(it->MethodIndex(), it->GetInvokeType()); 37 if (it->target_dex_file_ != nullptr) { 38 unresolved.target_dex_file_ = it->target_dex_file_; 39 unresolved.target_method_idx_ = it->target_method_idx_; 41 DCHECK_EQ(memcmp(&unresolved, &*it, sizeof(*it)), [all...] |
H A D | mir_field_info.cc | 37 for (auto it = field_infos, end = field_infos + count; it != end; ++it) { 38 MirIFieldLoweringInfo unresolved(it->field_idx_); 39 DCHECK_EQ(memcmp(&unresolved, &*it, sizeof(*it)), 0); 55 for (auto it = field_infos, end = field_infos + count; it != end; ++it) { 56 uint32_t field_idx = it [all...] |
H A D | verification_results.cc | 65 auto it = verified_methods_.find(ref); local 66 if (it != verified_methods_.end()) { 67 // TODO: Investigate why are we doing the work again for this method and try to avoid it. 70 DCHECK_EQ(it->second->GetDevirtMap().size(), verified_method->GetDevirtMap().size()); 71 DCHECK_EQ(it->second->GetSafeCastSet().size(), verified_method->GetSafeCastSet().size()); 72 DCHECK_EQ(it->second->GetDexGcMap().size(), verified_method->GetDexGcMap().size()); 73 delete it->second; 74 verified_methods_.erase(it); 83 auto it = verified_methods_.find(ref); local 84 return (it ! 89 auto it = verified_methods_.find(ref); local [all...] |
/art/compiler/optimizing/ |
H A D | ssa_phi_elimination.cc | 23 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { 24 HBasicBlock* block = it.Current(); 25 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { 26 HPhi* phi = it.Current()->AsPhi(); 31 for (HUseIterator<HInstruction> it(phi->GetUses()); !it [all...] |
H A D | ssa_type_propagation.cc | 50 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { 51 VisitBasicBlock(it.Current()); 58 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { 59 HPhi* phi = it.Current()->AsPhi(); 66 for (HInstructionIterator it(block->GetPhis()); !it [all...] |
H A D | ssa_liveness_analysis.cc | 104 for (HLinearOrderIterator it(*this); !it.Done(); it.Advance()) { 105 HBasicBlock* block = it.Current(); 108 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { 109 HInstruction* current = it.Current(); 125 for (HInstructionIterator it(block->GetInstructions()); !it [all...] |
H A D | ssa_builder.cc | 28 for (HReversePostOrderIterator it(*GetGraph()); !it.Done(); it.Advance()) { 29 VisitBasicBlock(it.Current()); 35 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { 36 HPhi* phi = it.Current()->AsPhi(); 50 for (HInstructionIterator it(GetGraph()->GetEntryBlock()->GetInstructions()); 51 !it [all...] |
H A D | pretty_printer.h | 45 for (HInputIterator it(instruction); !it.Done(); it.Advance()) { 51 PrintInt(it.Current()->GetId()); 58 for (HUseIterator<HInstruction> it(instruction->GetUses()); !it.Done(); it.Advance()) { 64 PrintInt(it.Current()->GetUser()->GetId());
|
H A D | ssa_test.cc | 69 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { 70 it.Current()->SetId(id++); 72 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { 73 it.Current()->SetId(id++); 92 for (HInstructionIterator it(graph->GetBlocks().Get(i)->GetPhis()); !it [all...] |
H A D | nodes.cc | 40 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { 41 block->RemovePhi(it.Current()->AsPhi()); 43 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { 44 block->RemoveInstruction(it.Current()); 397 for (HUseIterator<HInstruction> it(GetUses()); !it [all...] |
H A D | code_generator.cc | 54 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { 55 HInstruction* current = it.Current(); 82 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { 83 HInstruction* current = it.Current(); 347 auto it = table.PcToDexBegin(); local 351 CHECK_EQ(pc_info.native_pc, it [all...] |
/art/runtime/ |
H A D | dex_method_iterator_test.cc | 36 DexMethodIterator it(dex_files); 37 while (it.HasNext()) { 38 const DexFile& dex_file = it.GetDexFile(); 39 InvokeType invoke_type = it.GetInvokeType(); 40 uint32_t method_idx = it.GetMemberIndex(); 44 it.Next();
|
H A D | mem_map.cc | 51 for (BacktraceMap::const_iterator it = iters.first; it != iters.second; ++it) { 53 static_cast<uint32_t>(it->start), 54 static_cast<uint32_t>(it->end), 55 (it->flags & PROT_READ) ? 'r' : '-', 56 (it->flags & PROT_WRITE) ? 'w' : '-', 57 (it->flags & PROT_EXEC) ? 'x' : '-', it->name.c_str()); 64 for (auto it [all...] |
H A D | transaction.cc | 42 for (auto it : object_logs_) { 43 field_values_count += it.second.Size(); 47 for (auto it : array_logs_) { 48 array_values_count += it.second.Size(); 133 for (auto it : object_logs_) { 134 it.second.Undo(it.first); 142 for (auto it : array_logs_) { 143 it.second.Undo(it 227 auto it = field_values_.find(offset.Uint32Value()); local 238 auto it = field_values_.find(offset.Uint32Value()); local 249 auto it = field_values_.find(offset.Uint32Value()); local 371 auto it = array_values_.find(index); local [all...] |
H A D | intern_table.cc | 295 auto it = post_zygote_table_.Find(GcRoot<mirror::String>(s)); local 296 if (it != post_zygote_table_.end()) { 297 post_zygote_table_.Erase(it); 299 it = pre_zygote_table_.Find(GcRoot<mirror::String>(s)); 300 DCHECK(it != pre_zygote_table_.end()); 301 pre_zygote_table_.Erase(it); 307 auto it = pre_zygote_table_.Find(GcRoot<mirror::String>(s)); local 308 if (it != pre_zygote_table_.end()) { 309 return it->Read(); 311 it [all...] |
/art/runtime/gc/accounting/ |
H A D | heap_bitmap.cc | 28 auto it = std::find(continuous_space_bitmaps_.begin(), continuous_space_bitmaps_.end(), local 30 CHECK(it != continuous_space_bitmaps_.end()) << " continuous space bitmap " << old_bitmap 32 *it = new_bitmap; 37 auto it = std::find(large_object_bitmaps_.begin(), large_object_bitmaps_.end(), old_bitmap); local 38 CHECK(it != large_object_bitmaps_.end()) << " large object bitmap " << old_bitmap 40 *it = new_bitmap; 57 auto it = std::find(continuous_space_bitmaps_.begin(), continuous_space_bitmaps_.end(), bitmap); local 58 DCHECK(it != continuous_space_bitmaps_.end()); 59 continuous_space_bitmaps_.erase(it); 69 auto it local [all...] |
H A D | card_table.h | 76 for (byte* it = card_start; it != card_end; ++it) { 77 if (*it == kCardDirty) { 78 *it = kCardClean; 79 visitor(it); 147 // Card table doesn't begin at the beginning of the mem_map_, instead it is displaced by offset
|
/art/runtime/jdwp/ |
H A D | object_registry.cc | 74 // This object isn't in the registry yet, so add it. 94 for (auto it = object_to_entry_.lower_bound(identity_hash_code), end = object_to_entry_.end(); 95 it != end && it->first == identity_hash_code; ++it) { 96 ObjectRegistryEntry* entry = it->second; 130 auto it = id_to_entry_.find(id); local 131 if (it == id_to_entry_.end()) { 134 ObjectRegistryEntry& entry = *it->second; 144 auto it local 153 auto it = id_to_entry_.find(id); local 161 auto it = id_to_entry_.find(id); local 191 auto it = id_to_entry_.find(id); local 205 auto it = id_to_entry_.find(id); local [all...] |
/art/runtime/base/ |
H A D | hash_set_test.cc | 70 auto it = hash_set.Find(test_string); local 71 ASSERT_EQ(*it, test_string); 72 auto after_it = hash_set.Erase(it); 76 it = hash_set.Find(test_string); 77 ASSERT_TRUE(it == hash_set.end()); 88 auto it = hash_set.Find(strings[i]); local 89 ASSERT_TRUE(it != hash_set.end()); 90 ASSERT_EQ(*it, strings[i]); 95 auto it = hash_set.Find(strings[i]); local 96 ASSERT_TRUE(it ! 102 auto it = hash_set.Find(strings[i]); local 106 auto it = hash_set.Find(strings[i]); local 216 auto it = hash_map.Find(std::string("abcd")); local [all...] |
/art/compiler/dex/quick/ |
H A D | dex_file_to_method_inliner_map.cc | 44 auto it = inliners_.find(dex_file); local 45 if (it != inliners_.end()) { 46 return it->second; 50 // We need to acquire our lock_ to modify inliners_ but we want to release it
|
/art/runtime/entrypoints/portable/ |
H A D | portable_throw_entrypoints.cc | 91 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(); 108 catch_dex_pc = it.GetHandlerAddress(); 118 // If the catch block has no move-exception then clear the exception for it.
|
/art/compiler/utils/ |
H A D | swap_space.cc | 111 auto it = free_by_start_.empty() local 114 if (it != free_by_size_.end()) { 115 old_chunk = *it->second; 116 RemoveChunk(&free_by_start_, &free_by_size_, it); 173 auto it = free_by_start_.lower_bound(chunk); local 174 if (it != free_by_start_.begin()) { 175 auto prev = it; 185 // "prev" is invalidated but "it" remains valid. 188 if (it != free_by_start_.end()) { 189 CHECK_LE(chunk.End(), it [all...] |
/art/compiler/ |
H A D | elf_writer_quick.cc | 141 for (auto it = pieces.begin(); it != pieces.end(); ++it) { 142 if (!(*it)->Write(elf_file)) { 373 ElfRawSectionBuilder* it = other_builders_.data(); local 374 for (uint32_t cnt = 0; cnt < other_builders_.size(); ++it, ++cnt) { 376 section_ptrs.push_back(&it->section_); 377 AssignSectionStr(it, &shstrtab); 378 it->section_index_ = section_index++; 488 for (auto it [all...] |
H A D | elf_writer_mclinker.cc | 112 // TODO: LinkerTest uses mcld::Initialize(), but it does an 114 // want mcld::InitializeNative, but it doesn't exist yet, so we 244 DexMethodIterator it(dex_files); 245 while (it.HasNext()) { 246 const DexFile& dex_file = it.GetDexFile(); 247 uint32_t method_idx = it.GetMemberIndex(); 253 it.Next(); 260 // it. This can happen for reused code such as invoke stubs. 262 SafeMap<const std::string*, const std::string*>::iterator it = added_symbols_.find(&symbol); local 263 if (it ! 392 SafeMap<const std::string*, uint32_t>::iterator it = symbol_to_compiled_code_offset_.find(&symbol); local [all...] |
/art/runtime/verifier/ |
H A D | register_line.h | 83 // The register index was validated during the static pass, so we don't need to check it here. 150 * The "this" argument to <init> uses code offset kUninitThisArgAddr, which puts it at the start 151 * of the list in slot 0. If we see a register with an uninitialized slot 0 reference, we know it 170 * caller can decide whether it needs the reference to be initialized or not. (Can also return 296 auto it = reg_to_lock_depths_.find(src); 297 if (it != reg_to_lock_depths_.end()) { 298 reg_to_lock_depths_.Put(dst, it->second); 303 auto it = reg_to_lock_depths_.find(reg); 304 if (it != reg_to_lock_depths_.end()) { 305 return (it 314 auto it = reg_to_lock_depths_.find(reg); local 325 auto it = reg_to_lock_depths_.find(reg); local [all...] |