Home
last modified time | relevance | path

Searched refs:it (Results 1 – 25 of 162) sorted by relevance

1234567

/art/compiler/dex/
Dmir_method_info.cc40 for (auto it = method_infos, end = method_infos + count; it != end; ++it) { in Resolve() local
41 MirMethodLoweringInfo unresolved(it->MethodIndex(), it->GetInvokeType(), it->IsQuickened()); in Resolve()
42 unresolved.declaring_dex_file_ = it->declaring_dex_file_; in Resolve()
43 unresolved.vtable_idx_ = it->vtable_idx_; in Resolve()
44 if (it->target_dex_file_ != nullptr) { in Resolve()
45 unresolved.target_dex_file_ = it->target_dex_file_; in Resolve()
46 unresolved.target_method_idx_ = it->target_method_idx_; in Resolve()
49 unresolved.CheckEquals(*it); in Resolve()
74 for (auto it = method_infos, end = method_infos + count; it != end; ++it) { in Resolve() local
76 if (it->IsQuickened()) { in Resolve()
[all …]
Dmir_field_info.cc38 for (auto it = field_infos, end = field_infos + count; it != end; ++it) { in Resolve() local
39 MirIFieldLoweringInfo unresolved(it->field_idx_, it->MemAccessType(), it->IsQuickened()); in Resolve()
40 unresolved.field_offset_ = it->field_offset_; in Resolve()
41 unresolved.CheckEquals(*it); in Resolve()
57 for (auto it = field_infos, end = field_infos + count; it != end; ++it) { in Resolve() local
60 if (!it->IsQuickened()) { in Resolve()
61 field_idx = it->field_idx_; in Resolve()
65 const auto mir_offset = it->field_idx_; in Resolve()
82 &it->declaring_dex_file_, &it->declaring_class_idx_, &it->declaring_field_idx_); in Resolve()
84 it->field_offset_ = compiler_driver->GetFieldOffset(resolved_field); in Resolve()
[all …]
Dverification_results.cc59 auto it = verified_methods_.find(ref); in ProcessVerifiedMethod() local
60 if (it != verified_methods_.end()) { in ProcessVerifiedMethod()
65 DCHECK_EQ(it->second->GetDevirtMap().size(), verified_method->GetDevirtMap().size()); in ProcessVerifiedMethod()
66 DCHECK_EQ(it->second->GetSafeCastSet().size(), verified_method->GetSafeCastSet().size()); in ProcessVerifiedMethod()
68 DCHECK_EQ(it->second->GetDexGcMap().size(), verified_method->GetDexGcMap().size()); in ProcessVerifiedMethod()
82 auto it = verified_methods_.find(ref); in GetVerifiedMethod() local
83 return (it != verified_methods_.end()) ? it->second : nullptr; in GetVerifiedMethod()
88 auto it = verified_methods_.find(ref); in RemoveVerifiedMethod() local
89 if (it != verified_methods_.end()) { in RemoveVerifiedMethod()
90 delete it->second; in RemoveVerifiedMethod()
[all …]
/art/runtime/
Dmem_map.cc58 for (BacktraceMap::const_iterator it = iters.first; it != iters.second; ++it) { in operator <<() local
60 static_cast<uint32_t>(it->start), in operator <<()
61 static_cast<uint32_t>(it->end), in operator <<()
62 (it->flags & PROT_READ) ? 'r' : '-', in operator <<()
63 (it->flags & PROT_WRITE) ? 'w' : '-', in operator <<()
64 (it->flags & PROT_EXEC) ? 'x' : '-', it->name.c_str()); in operator <<()
71 for (auto it = mem_maps.begin(); it != mem_maps.end(); ++it) { in operator <<() local
72 void* base = it->first; in operator <<()
73 MemMap* map = it->second; in operator <<()
150 for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) { in ContainedWithinExistingMap() local
[all …]
Ddex_method_iterator_test.cc37 DexMethodIterator it(dex_files); in TEST_F() local
38 while (it.HasNext()) { in TEST_F()
39 const DexFile& dex_file = it.GetDexFile(); in TEST_F()
40 InvokeType invoke_type = it.GetInvokeType(); in TEST_F()
41 uint32_t method_idx = it.GetMemberIndex(); in TEST_F()
45 it.Next(); in TEST_F()
Dtransaction.cc44 for (auto it : object_logs_) { in ~Transaction() local
45 field_values_count += it.second.Size(); in ~Transaction()
49 for (auto it : array_logs_) { in ~Transaction() local
50 array_values_count += it.second.Size(); in ~Transaction()
208 for (auto it : object_logs_) { in UndoObjectModifications() local
209 it.second.Undo(it.first); in UndoObjectModifications()
217 for (auto it : array_logs_) { in UndoArrayModifications() local
218 it.second.Undo(it.first); in UndoArrayModifications()
246 for (auto it : object_logs_) { in VisitObjectLogs() local
247 it.second.VisitRoots(visitor); in VisitObjectLogs()
[all …]
/art/compiler/optimizing/
Dssa_phi_elimination.cc28 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in MarkDeadPhis() local
29 HBasicBlock* block = it.Current(); in MarkDeadPhis()
49 for (HInputIterator it(phi); !it.Done(); it.Advance()) { in MarkDeadPhis() local
50 HInstruction* input = it.Current(); in MarkDeadPhis()
63 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in EliminateDeadPhis() local
64 HBasicBlock* block = it.Current(); in EliminateDeadPhis()
102 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in Run() local
103 HBasicBlock* block = it.Current(); in Run()
144 for (HUseIterator<HInstruction*> it(phi->GetUses()); !it.Done(); it.Advance()) { in Run() local
145 HUseListNode<HInstruction*>* current = it.Current(); in Run()
Dprimitive_type_propagation.cc81 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in Run() local
82 VisitBasicBlock(it.Current()); in Run()
89 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { in VisitBasicBlock() local
90 HPhi* phi = it.Current()->AsPhi(); in VisitBasicBlock()
96 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { in VisitBasicBlock() local
102 HPhi* phi = it.Current()->AsPhi(); in VisitBasicBlock()
125 for (HUseIterator<HInstruction*> it(instruction->GetUses()); !it.Done(); it.Advance()) { in AddDependentInstructionsToWorklist() local
126 HPhi* phi = it.Current()->GetUser()->AsPhi(); in AddDependentInstructionsToWorklist()
Dssa_builder.cc121 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { in VisitBasicBlock() local
122 HPhi* phi = it.Current()->AsPhi(); in VisitBasicBlock()
156 for (HUseIterator<HInstruction*> it(instruction->GetUses()); !it.Done(); it.Advance()) { in AddDependentInstructionsToWorklist() local
157 HPhi* phi = it.Current()->GetUser()->AsPhi(); in AddDependentInstructionsToWorklist()
165 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in Run() local
166 VisitBasicBlock(it.Current()); in Run()
180 for (HInstructionIterator it(itb.Current()->GetInstructions()); !it.Done(); it.Advance()) { in FixNullConstantType() local
181 HInstruction* equality_instr = it.Current(); in FixNullConstantType()
212 for (HInstructionIterator it(itb.Current()->GetPhis()); !it.Done(); it.Advance()) { in EquivalentPhisCleanup() local
213 HPhi* phi = it.Current()->AsPhi(); in EquivalentPhisCleanup()
[all …]
Dreference_type_propagation.cc30 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in Run() local
31 VisitBasicBlock(it.Current()); in Run()
41 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in VisitBasicBlock() local
42 HInstruction* instr = it.Current(); in VisitBasicBlock()
51 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { in VisitBasicBlock() local
52 VisitPhi(it.Current()->AsPhi()); in VisitBasicBlock()
94 for (HUseIterator<HInstruction*> it(obj->GetUses()); !it.Done(); it.Advance()) { in BoundTypeForIfNotNull() local
95 HInstruction* user = it.Current()->GetUser(); in BoundTypeForIfNotNull()
101 user->ReplaceInput(bound_type, it.Current()->GetIndex()); in BoundTypeForIfNotNull()
149 for (HUseIterator<HInstruction*> it(obj->GetUses()); !it.Done(); it.Advance()) { in BoundTypeForIfInstanceOf() local
[all …]
Ddead_code_elimination.cc51 for (HLoopInformationOutwardIterator it(block); !it.Done(); it.Advance()) { in MarkLoopHeadersContaining() local
52 set->SetBit(it.Current()->GetHeader()->GetBlockId()); in MarkLoopHeadersContaining()
75 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in RemoveDeadBlocks() local
76 HBasicBlock* block = it.Current(); in RemoveDeadBlocks()
99 for (HReversePostOrderIterator it(*graph_); !it.Done();) { in RemoveDeadBlocks() local
100 HBasicBlock* block = it.Current(); in RemoveDeadBlocks()
102 it.Advance(); in RemoveDeadBlocks()
107 it.Advance(); in RemoveDeadBlocks()
Dside_effects_analysis.cc28 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in Run() local
29 HBasicBlock* block = it.Current(); in Run()
40 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in Run() local
41 HBasicBlock* block = it.Current(); in Run()
Dlicm.cc33 for (HInputIterator it(instruction); !it.Done(); it.Advance()) { in InputsAreDefinedBeforeLoop() local
34 HLoopInformation* input_loop = it.Current()->GetBlock()->GetLoopInformation(); in InputsAreDefinedBeforeLoop()
86 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) { in Run() local
87 HBasicBlock* block = it.Current(); in Run()
Dpretty_printer.h45 for (HInputIterator it(instruction); !it.Done(); it.Advance()) { in PrintPostInstruction()
51 PrintInt(it.Current()->GetId()); in PrintPostInstruction()
58 for (HUseIterator<HInstruction*> it(instruction->GetUses()); !it.Done(); it.Advance()) { in PrintPostInstruction()
64 PrintInt(it.Current()->GetUser()->GetId()); in PrintPostInstruction()
Dnodes.cc58 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in RemoveInstructionsAsUsersFromDeadBlocks() local
59 RemoveAsUser(it.Current()); in RemoveInstructionsAsUsersFromDeadBlocks()
124 for (HReversePostOrderIterator it(*this); !it.Done(); it.Advance()) { in ClearDominanceInformation() local
125 it.Current()->ClearDominanceInformation(); in ClearDominanceInformation()
282 for (HReversePostOrderIterator it(*this); !it.Done(); it.Advance()) { in AnalyzeNaturalLoops() local
283 HBasicBlock* block = it.Current(); in AnalyzeNaturalLoops()
677 for (HInstructionIterator it(*this); !it.Done(); it.Advance()) { in Contains() local
678 if (it.Current() == instruction) { in Contains()
688 for (HInstructionIterator it(*this); !it.Done(); it.Advance()) { in FoundBefore() local
689 if (it.Current() == instruction1) { in FoundBefore()
[all …]
Dssa_test.cc69 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { in ReNumberInstructions() local
70 it.Current()->SetId(id++); in ReNumberInstructions()
72 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in ReNumberInstructions() local
73 it.Current()->SetId(id++); in ReNumberInstructions()
96 for (HInstructionIterator it(graph->GetBlocks().Get(i)->GetPhis()); !it.Done(); it.Advance()) { in TestCode() local
97 ASSERT_NE(it.Current()->GetType(), Primitive::kPrimVoid); in TestCode()
/art/runtime/gc/accounting/
Dheap_bitmap.cc28 auto it = std::find(continuous_space_bitmaps_.begin(), continuous_space_bitmaps_.end(), in ReplaceBitmap() local
30 CHECK(it != continuous_space_bitmaps_.end()) << " continuous space bitmap " << old_bitmap in ReplaceBitmap()
32 *it = new_bitmap; in ReplaceBitmap()
37 auto it = std::find(large_object_bitmaps_.begin(), large_object_bitmaps_.end(), old_bitmap); in ReplaceLargeObjectBitmap() local
38 CHECK(it != large_object_bitmaps_.end()) << " large object bitmap " << old_bitmap in ReplaceLargeObjectBitmap()
40 *it = new_bitmap; in ReplaceLargeObjectBitmap()
57 auto it = std::find(continuous_space_bitmaps_.begin(), continuous_space_bitmaps_.end(), bitmap); in RemoveContinuousSpaceBitmap() local
58 DCHECK(it != continuous_space_bitmaps_.end()); in RemoveContinuousSpaceBitmap()
59 continuous_space_bitmaps_.erase(it); in RemoveContinuousSpaceBitmap()
69 auto it = std::find(large_object_bitmaps_.begin(), large_object_bitmaps_.end(), bitmap); in RemoveLargeObjectBitmap() local
[all …]
Dcard_table.h78 for (uint8_t* it = card_start; it != card_end; ++it) { in VisitClear() local
79 if (*it == kCardDirty) { in VisitClear()
80 *it = kCardClean; in VisitClear()
81 visitor(it); in VisitClear()
/art/runtime/base/
Dhash_set_test.cc70 auto it = hash_set.Find(test_string); in TEST_F() local
71 ASSERT_EQ(*it, test_string); in TEST_F()
72 auto after_it = hash_set.Erase(it); in TEST_F()
76 it = hash_set.Find(test_string); in TEST_F()
77 ASSERT_TRUE(it == hash_set.end()); in TEST_F()
88 auto it = hash_set.Find(strings[i]); in TEST_F() local
89 ASSERT_TRUE(it != hash_set.end()); in TEST_F()
90 ASSERT_EQ(*it, strings[i]); in TEST_F()
95 auto it = hash_set.Find(strings[i]); in TEST_F() local
96 ASSERT_TRUE(it != hash_set.end()); in TEST_F()
[all …]
/art/runtime/jdwp/
Dobject_registry.cc124 for (auto it = object_to_entry_.lower_bound(identity_hash_code), end = object_to_entry_.end(); in ContainsLocked() local
125 it != end && it->first == identity_hash_code; ++it) { in ContainsLocked()
126 ObjectRegistryEntry* entry = it->second; in ContainsLocked()
173 auto it = id_to_entry_.find(id); in InternalGet() local
174 if (it == id_to_entry_.end()) { in InternalGet()
178 ObjectRegistryEntry& entry = *it->second; in InternalGet()
189 auto it = id_to_entry_.find(id); in GetJObject() local
190 CHECK(it != id_to_entry_.end()) << id; in GetJObject()
191 ObjectRegistryEntry& entry = *it->second; in GetJObject()
198 auto it = id_to_entry_.find(id); in DisableCollection() local
[all …]
/art/compiler/
Delf_writer_quick.cc260 for (auto it = method_info.begin(); it != method_info.end(); ++it) { in WriteDebugSymbols() local
261 if (it->deduped_) { in WriteDebugSymbols()
262 deduped_addresses.insert(it->low_pc_); in WriteDebugSymbols()
267 for (auto it = method_info.begin(); it != method_info.end(); ++it) { in WriteDebugSymbols() local
268 if (it->deduped_) { in WriteDebugSymbols()
271 std::string name = PrettyMethod(it->dex_method_index_, *it->dex_file_, true); in WriteDebugSymbols()
272 if (deduped_addresses.find(it->low_pc_) != deduped_addresses.end()) { in WriteDebugSymbols()
276 uint32_t low_pc = it->low_pc_; in WriteDebugSymbols()
278 low_pc += it->compiled_method_->CodeDelta(); in WriteDebugSymbols()
280 true, it->high_pc_ - it->low_pc_, STB_GLOBAL, STT_FUNC); in WriteDebugSymbols()
[all …]
/art/test/137-cfi/
Dcfi.cc67 for (Backtrace::const_iterator it = bt->begin(); it != bt->end(); ++it) { in CheckStack() local
68 if (BacktraceMap::IsValid(it->map)) { in CheckStack()
69 LOG(INFO) << "Got " << it->func_name << ", looking for " << seq[cur_search_index]; in CheckStack()
70 if (it->func_name == seq[cur_search_index]) { in CheckStack()
80 for (Backtrace::const_iterator it = bt->begin(); it != bt->end(); ++it) { in CheckStack() local
81 if (BacktraceMap::IsValid(it->map)) { in CheckStack()
82 printf(" %s\n", it->func_name.c_str()); in CheckStack()
/art/compiler/utils/
Dswap_space.cc111 auto it = free_by_start_.empty() in Alloc() local
114 if (it != free_by_size_.end()) { in Alloc()
115 old_chunk = *it->second; in Alloc()
116 RemoveChunk(&free_by_start_, &free_by_size_, it); in Alloc()
173 auto it = free_by_start_.lower_bound(chunk); in Free() local
174 if (it != free_by_start_.begin()) { in Free()
175 auto prev = it; in Free()
188 if (it != free_by_start_.end()) { in Free()
189 CHECK_LE(chunk.End(), it->Start()); in Free()
190 if (chunk.End() == it->Start()) { in Free()
[all …]
/art/runtime/jit/
Djit_instrumentation.cc70 auto it = samples_.find(method_id); in SignalCompiled() local
71 if (it != samples_.end()) { in SignalCompiled()
72 samples_.erase(it); in SignalCompiled()
89 auto it = samples_.find(method_id); in AddSamples() local
90 if (it != samples_.end()) { in AddSamples()
91 it->second += count; in AddSamples()
92 sample_count = it->second; in AddSamples()
/art/runtime/verifier/
Dregister_line.h307 auto it = reg_to_lock_depths_.find(src); in CopyRegToLockDepth() local
308 if (it != reg_to_lock_depths_.end()) { in CopyRegToLockDepth()
309 reg_to_lock_depths_.Put(dst, it->second); in CopyRegToLockDepth()
314 auto it = reg_to_lock_depths_.find(reg); in IsSetLockDepth() local
315 if (it != reg_to_lock_depths_.end()) { in IsSetLockDepth()
316 return (it->second & (1 << depth)) != 0; in IsSetLockDepth()
327 auto it = reg_to_lock_depths_.find(reg); in SetRegToLockDepth() local
328 if (it == reg_to_lock_depths_.end()) { in SetRegToLockDepth()
331 it->second |= (1 << depth); in SetRegToLockDepth()
339 auto it = reg_to_lock_depths_.find(reg); in ClearRegToLockDepth() local
[all …]

1234567