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

123456

/art/runtime/
H A Ddex_method_iterator_test.cc37 DexMethodIterator it(dex_files);
38 while (it.HasNext()) {
39 const DexFile& dex_file = it.GetDexFile();
40 InvokeType invoke_type = it.GetInvokeType();
41 uint32_t method_idx = it.GetMemberIndex();
45 it.Next();
H A Dmem_map.cc58 for (BacktraceMap::const_iterator it = iters.first; it != iters.second; ++it) {
60 static_cast<uint32_t>(it->start),
61 static_cast<uint32_t>(it->end),
62 (it->flags & PROT_READ) ? 'r' : '-',
63 (it->flags & PROT_WRITE) ? 'w' : '-',
64 (it->flags & PROT_EXEC) ? 'x' : '-', it->name.c_str());
71 for (auto it
337 auto it = maps_->upper_bound(reinterpret_cast<void*>(ptr)); local
[all...]
/art/compiler/dex/
H A Dmir_method_info.cc40 for (auto it = method_infos, end = method_infos + count; it != end; ++it) {
41 MirMethodLoweringInfo unresolved(it->MethodIndex(), it->GetInvokeType(), it->IsQuickened());
42 unresolved.declaring_dex_file_ = it->declaring_dex_file_;
43 unresolved.vtable_idx_ = it->vtable_idx_;
44 if (it->target_dex_file_ != nullptr) {
45 unresolved.target_dex_file_ = it
[all...]
H A Dmir_field_info.cc38 for (auto it = field_infos, end = field_infos + count; it != end; ++it) {
39 MirIFieldLoweringInfo unresolved(it->field_idx_, it->MemAccessType(), it->IsQuickened());
40 unresolved.field_offset_ = it->field_offset_;
41 unresolved.CheckEquals(*it);
57 for (auto it = field_infos, end = field_infos + count; it !
[all...]
H A Dverification_results.cc59 auto it = verified_methods_.find(ref); local
60 if (it != verified_methods_.end()) {
61 // TODO: Investigate why are we doing the work again for this method and try to avoid it.
65 DCHECK_EQ(it->second->GetDevirtMap().size(), verified_method->GetDevirtMap().size());
66 DCHECK_EQ(it->second->GetSafeCastSet().size(), verified_method->GetSafeCastSet().size());
68 DCHECK_EQ(it->second->GetDexGcMap().size(), verified_method->GetDexGcMap().size());
70 // is unsafe to replace the existing one since the JIT may be using it to generate a
82 auto it = verified_methods_.find(ref); local
83 return (it != verified_methods_.end()) ? it
88 auto it = verified_methods_.find(ref); local
[all...]
/art/runtime/gc/accounting/
H A Dheap_bitmap.cc28 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 Dcard_table.h78 for (uint8_t* it = card_start; it != card_end; ++it) {
79 if (*it == kCardDirty) {
80 *it = kCardClean;
81 visitor(it);
146 // Card table doesn't begin at the beginning of the mem_map_, instead it is displaced by offset
/art/compiler/optimizing/
H A Dprimitive_type_propagation.cc81 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) {
82 VisitBasicBlock(it.Current());
89 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) {
90 HPhi* phi = it.Current()->AsPhi();
96 for (HInstructionIterator it(block->GetPhis()); !it
[all...]
H A Dssa_phi_elimination.cc28 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) {
29 HBasicBlock* block = it.Current();
49 for (HInputIterator it(phi); !it.Done(); it.Advance()) {
50 HInstruction* input = it.Current();
63 for (HPostOrderIterator it(*graph_); !it
[all...]
H A Dside_effects_analysis.cc28 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) {
29 HBasicBlock* block = it.Current();
40 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) {
41 HBasicBlock* block = it.Current();
H A Ddead_code_elimination.cc51 for (HLoopInformationOutwardIterator it(block); !it.Done(); it.Advance()) {
52 set->SetBit(it.Current()->GetHeader()->GetBlockId());
75 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) {
76 HBasicBlock* block = it.Current();
99 for (HReversePostOrderIterator it(*graph_); !it
[all...]
H A Dreference_type_propagation.cc30 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) {
31 VisitBasicBlock(it.Current());
41 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) {
42 HInstruction* instr = it.Current();
51 for (HInstructionIterator it(block->GetPhis()); !it
[all...]
H A Dlicm.cc28 * before the loop it is in.
33 for (HInputIterator it(instruction); !it.Done(); it.Advance()) {
34 HLoopInformation* input_loop = it.Current()->GetBlock()->GetLoopInformation();
35 // We only need to check whether the input is defined in the loop. If it is not
36 // it is defined before the loop.
64 * If `environment` has a loop header phi, we replace it with its first input.
86 for (HPostOrderIterator it(*graph_); !it
[all...]
H A Dpretty_printer.h45 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 Dssa_builder.cc68 // input is a phi, and it is dead (because its input types are
92 // add it to the worklist to ensure its inputs can also be converted to reference.
93 // If not, it will remain dead, and the algorithm will make the current phi dead
121 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) {
122 HPhi* phi = it.Current()->AsPhi();
156 for (HUseIterator<HInstruction*> it(instruction->GetUses()); !it.Done(); it
[all...]
H A Dprepare_for_register_allocation.cc23 for (HReversePostOrderIterator it(*GetGraph()); !it.Done(); it.Advance()) {
24 HBasicBlock* block = it.Current();
96 // If the load class instruction is no longer used, remove it from
H A Dssa_test.cc69 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++);
96 for (HInstructionIterator it(graph->GetBlocks().Get(i)->GetPhis()); !it
[all...]
/art/runtime/base/
H A Dhash_set_test.cc70 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 Ddex_file_to_method_inliner_map.cc44 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/jdwp/
H A Dobject_registry.cc104 // This object isn't in the registry yet, so add it.
124 for (auto it = object_to_entry_.lower_bound(identity_hash_code), end = object_to_entry_.end();
125 it != end && it->first == identity_hash_code; ++it) {
126 ObjectRegistryEntry* entry = it->second;
173 auto it = id_to_entry_.find(id); local
174 if (it == id_to_entry_.end()) {
178 ObjectRegistryEntry& entry = *it->second;
189 auto it local
198 auto it = id_to_entry_.find(id); local
206 auto it = id_to_entry_.find(id); local
236 auto it = id_to_entry_.find(id); local
250 auto it = id_to_entry_.find(id); local
[all...]
/art/test/137-cfi/
H A Dcfi.cc67 for (Backtrace::const_iterator it = bt->begin(); it != bt->end(); ++it) {
68 if (BacktraceMap::IsValid(it->map)) {
69 LOG(INFO) << "Got " << it->func_name << ", looking for " << seq[cur_search_index];
70 if (it->func_name == seq[cur_search_index]) {
80 for (Backtrace::const_iterator it = bt->begin(); it != bt->end(); ++it) {
81 if (BacktraceMap::IsValid(it
[all...]
/art/runtime/jit/
H A Djit_instrumentation.cc70 auto it = samples_.find(method_id); local
71 if (it != samples_.end()) {
72 samples_.erase(it);
89 auto it = samples_.find(method_id); local
90 if (it != samples_.end()) {
91 it->second += count;
92 sample_count = it->second;
/art/compiler/
H A Delf_writer_quick.cc44 // it is used by C++ exception handling (which we do not use so we
46 // because if they need it sometimes, they might as well always use it.
53 // exist, but it will still work well without them.
260 for (auto it = method_info.begin(); it != method_info.end(); ++it) {
261 if (it->deduped_) {
262 deduped_addresses.insert(it->low_pc_);
267 for (auto it
[all...]
/art/compiler/utils/
H A Dswap_space.cc111 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/runtime/gc/
H A Dtask_processor.cc53 // Non empty queue, look at the top element and see if we are ready to run it.
57 // task if it is late enough.
78 for (auto it = range.first; it != range.second; ++it) {
79 if (*it == task) {
82 tasks_.erase(it);

Completed in 392 milliseconds

123456