/art/test/548-checker-inlining-and-dce/src/ |
H A D | Main.java | 19 private void inlinedForNull(Iterable it) { argument 20 if (it != null) { 22 it.iterator(); 26 private void inlinedForFalse(boolean value, Iterable it) { argument 29 it.iterator(); 40 public void testInlinedForFalseInlined(Iterable it) { argument 41 inlinedForFalse(false, it); 50 public void testInlinedForFalseNotInlined(Iterable it) { argument 51 inlinedForFalse(true, it); 61 public void testInlinedForNullInlined(Iterable it) { argument 71 testInlinedForNullNotInlined(Iterable it) argument [all...] |
/art/test/478-checker-clinit-check-pruning/src/ |
H A D | Main.java | 44 // CFG as it is before the next pass (liveness analysis) instead. 84 // dumped after (nor before) this step, we check the CFG as it is 305 * later invoke-static (or it's ClinitCheck). 315 static void constClassAndInvokeStatic(Iterable<?> it) { argument 317 ClassWithClinit7.someStaticMethod(it); 329 static void someStaticMethod(Iterable<?> it) { argument 331 it.iterator(); 346 static void sgetAndInvokeStatic(Iterable<?> it) { argument 348 ClassWithClinit8.someStaticMethod(it); 361 static void someStaticMethod(Iterable<?> it) { argument 377 constClassSgetAndInvokeStatic(Iterable<?> it) argument 390 someStaticMethod(Iterable<?> it) argument 408 inlinedInvokeStaticViaNonStatic(Iterable<?> it) argument 413 inlinedInvokeStaticViaNonStaticHelper(Iterable<?> it) argument 423 inlinedForNull(Iterable<?> it) argument 448 inlinedInvokeStaticViaStatic(Iterable<?> it) argument 458 callInlinedForNull(Iterable<?> it) argument 462 inlinedForNull(Iterable<?> it) argument 480 inlinedInvokeStaticViaStaticTwice(Iterable<?> it) argument 491 callInlinedForNull(Iterable<?> it) argument 495 inlinedForNull(Iterable<?> it) argument 508 $inline$forwardToGetIterator(Iterable<?> it) argument 512 $noinline$getIterator(Iterable<?> it) argument 519 $noinline$testInliningAndNewInstance(Iterable<?> it) argument [all...] |
/art/runtime/ |
H A D | dex_method_iterator_test.cc | 37 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 D | mem_map.cc | 52 for (BacktraceMap::const_iterator it = iters.first; it != iters.second; ++it) { 54 static_cast<uint32_t>(it->start), 55 static_cast<uint32_t>(it->end), 56 (it->flags & PROT_READ) ? 'r' : '-', 57 (it->flags & PROT_WRITE) ? 'w' : '-', 58 (it->flags & PROT_EXEC) ? 'x' : '-', it->name.c_str()); 65 for (auto it 810 auto it = maps_->upper_bound(reinterpret_cast<void*>(ptr)); local [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 | 78 for (uint8_t* it = card_start; it != card_end; ++it) { 79 if (*it == kCardDirty) { 80 *it = kCardClean; 81 visitor(it); 148 // Card table doesn't begin at the beginning of the mem_map_, instead it is displaced by offset
|
/art/compiler/optimizing/ |
H A D | side_effects_analysis.cc | 29 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { 30 HBasicBlock* block = it.Current(); 41 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) { 42 HBasicBlock* block = it.Current();
|
H A D | select_generator.cc | 33 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { 34 HInstruction* instruction = it.Current(); 60 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { 61 HPhi* phi = it.Current()->AsPhi(); 79 for (HPostOrderIterator it(*graph_); !it [all...] |
H A D | ssa_phi_elimination.cc | 37 for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { 38 HBasicBlock* block = it.Current(); 70 for (HInputIterator it(phi); !it.Done(); it.Advance()) { 71 HPhi* input = it.Current()->AsPhi(); 73 // Input is a dead phi. Revive it and add to the worklist. We make sure 87 for (HPostOrderIterator it(*graph [all...] |
H A D | dead_code_elimination.cc | 60 // that task to the verifier and use unsigned arithmetic with it's "modulo 2^32" 94 // support it, but that would require changes in our loop representation to handle 95 // multiple entry points. We decided it was not worth the complexity. 109 for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) { 110 HBasicBlock* block = it.Current(); 137 for (HReversePostOrderIterator it(*graph_); !it.Done();) { 138 HBasicBlock* block = it [all...] |
H A D | licm.cc | 28 * 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. 93 for (HPostOrderIterator it(*graph_); !it [all...] |
H A D | block_builder.cc | 78 for (CodeItemIterator it(code_item_); !it.Done(); it.Advance()) { 79 uint32_t dex_pc = it.CurrentDexPc(); 80 const Instruction& instruction = it.CurrentInstruction(); 94 // instruction for uniqueness but give it the dex_pc of the SWITCH 95 // instruction which it semantically belongs to. 107 if (it.IsLast()) { 112 MaybeCreateBlockAt(dex_pc + it.CurrentInstruction().SizeInCodeUnits()); 125 for (CodeItemIterator it(code_item [all...] |
H A D | instruction_simplifier_arm64.h | 62 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { 63 HInstruction* instruction = it.Current();
|
/art/runtime/interpreter/mterp/arm/ |
H A D | op_nop.S | 3 GOTO_OPCODE ip @ execute it
|
/art/compiler/dex/ |
H A D | verification_results.cc | 58 auto it = verified_methods_.find(ref); local 59 if (it != verified_methods_.end()) { 60 // TODO: Investigate why are we doing the work again for this method and try to avoid it. 64 DCHECK_EQ(it->second->GetDevirtMap().size(), verified_method->GetDevirtMap().size()); 65 DCHECK_EQ(it->second->GetSafeCastSet().size(), verified_method->GetSafeCastSet().size()); 68 // is unsafe to replace the existing one since the JIT may be using it to generate a 79 auto it = verified_methods_.find(ref); local 80 return (it != verified_methods_.end()) ? it->second : nullptr;
|
/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/jdwp/ |
H A D | object_registry.cc | 104 // 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/runtime/base/ |
H A D | stl_util.h | 40 // For hash_[multi]set, it is important that this deletes behind the iterator 41 // because the hash_set may call the hash function on the iterator when it is 74 // in the case it's given a null pointer. 121 auto it = std::find(container.begin(), container.end(), value); local 122 DCHECK(it != container.end()); // Must exist. 123 return std::distance(container.begin(), it); 129 auto it = std::find(container.begin(), container.end(), value); local 130 DCHECK(it != container.end()); // Must exist. 131 container.erase(it); 137 auto it local 148 auto it = std::find(start, container.end(), value); local [all...] |
H A D | hash_set_test.cc | 72 auto it = hash_set.Find(test_string); local 73 ASSERT_EQ(*it, test_string); 74 auto after_it = hash_set.Erase(it); 78 it = hash_set.Find(test_string); 79 ASSERT_TRUE(it == hash_set.end()); 90 auto it = hash_set.Find(strings[i]); local 91 ASSERT_TRUE(it != hash_set.end()); 92 ASSERT_EQ(*it, strings[i]); 97 auto it = hash_set.Find(strings[i]); local 98 ASSERT_TRUE(it ! 104 auto it = hash_set.Find(strings[i]); local 108 auto it = hash_set.Find(strings[i]); local 274 auto it = hash_map.Find(std::string("abcd")); local [all...] |
/art/test/137-cfi/ |
H A D | cfi.cc | 68 for (Backtrace::const_iterator it = bt->begin(); it != bt->end(); ++it) { 69 if (BacktraceMap::IsValid(it->map)) { 70 LOG(INFO) << "Got " << it->func_name << ", looking for " << seq[cur_search_index]; 71 if (it->func_name == seq[cur_search_index]) { 81 for (Backtrace::const_iterator it = bt->begin(); it != bt->end(); ++it) { 82 if (BacktraceMap::IsValid(it [all...] |
/art/compiler/utils/ |
H A D | swap_space.cc | 114 auto it = free_by_start_.empty() local 117 if (it != free_by_size_.end()) { 118 old_chunk = *it->second; 119 RemoveChunk(it); 174 auto it = free_by_start_.lower_bound(chunk); local 175 if (it != free_by_start_.begin()) { 176 auto prev = it; 186 // "prev" is invalidated but "it" remains valid. 189 if (it != free_by_start_.end()) { 190 CHECK_LE(chunk.End(), it [all...] |
/art/runtime/interpreter/mterp/x86/ |
H A D | op_const_wide_16.S | 3 movl rIBASE, %ecx # preserve rIBASE (cltd trashes it)
|
H A D | op_const_wide_32.S | 3 movl rIBASE, %ecx # preserve rIBASE (cltd trashes it)
|
/art/compiler/debug/dwarf/ |
H A D | debug_abbrev_writer.h | 69 auto it = abbrev_codes_.insert(std::make_pair(std::move(current_abbrev_), NextAbbrevCode())); local 70 uint32_t abbrev_code = it.first->second; 71 if (UNLIKELY(it.second)) { // Inserted new entry. 72 const Vector& abbrev = it.first->first;
|
/art/compiler/linker/ |
H A D | multi_oat_relative_patcher.cc | 64 auto it = map.find(ref); local 65 if (it == map.end()) { 68 return std::pair<bool, uint32_t>(true, it->second);
|