/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/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...] |
/art/compiler/dex/ |
H A D | verification_results.cc | 59 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...] |
H A D | global_value_numbering.cc | 158 auto it = array_location_map_.PutBefore(lb, key, location); local 159 array_location_reverse_map_.push_back(&*it);
|
H A D | verified_method.cc | 75 auto it = devirt_map_.find(dex_pc); local 76 return (it != devirt_map_.end()) ? &it->second : nullptr; 81 auto it = dequicken_map_.find(dex_pc); local 82 return (it != dequicken_map_.end()) ? &it->second : nullptr; 220 // It can be null if the line wasn't verified since it was unreachable. 233 // It can be null if the line wasn't verified since it was unreachable. 294 // If the method is not found in the cache this means that it was never found 340 // Do not attempt to quicken this instruction, it' [all...] |
H A D | mir_analysis.cc | 1152 * If huge, assume we won't compile, but allow futher analysis to turn it back on. 1162 /* If it's large and contains no branches, it's likely to be machine generated initialization */ 1223 // Get field index and try to find it among existing indexes. If found, it's usually among 1225 // is a linear search, it actually performs much better than map based approach. 1372 // We need to store the vtable index since we can't necessarily recreate it at resolve 1387 // and increment it as needed instead of making O(log n) lookups. 1397 auto it = invoke_map.insert(entry).first; // Iterator to either the old or the new entry. local 1398 mir->meta.method_lowering_info = it [all...] |
H A D | ssa_transformation.cc | 295 auto it = bb->predecessors.begin(), end = bb->predecessors.end(); local 299 for ( ; ; ++it) { 300 CHECK(it != end); 301 BasicBlock* pred_bb = GetBasicBlock(*it); 310 for ( ; it != end; ++it) { 311 BasicBlock* pred_bb = GetBasicBlock(*it);
|
/art/runtime/jit/ |
H A D | jit_instrumentation.cc | 70 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;
|
H A D | jit_code_cache.cc | 102 auto it = method_code_map_.find(method); local 103 if (it != method_code_map_.end()) { 104 return it->second; 114 auto it = method_code_map_.find(method); local 115 if (it != method_code_map_.end()) {
|
/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...] |
H A D | dedupe_set.h | 35 // Add method. The data-structure is thread-safe through the use of internal locks, it also 91 auto it = keys_[shard_bin].find(hashed_key); local 92 if (it != keys_[shard_bin].end()) { 93 DCHECK(it->store_ptr != nullptr); 94 return it->store_ptr;
|
H A D | test_dex_file_builder.h | 39 auto it = strings_.emplace(str, IdxAndDataOffset()).first; local 40 CHECK_LT(it->first.length(), 128u); // Don't allow multi-byte length in uleb128. 71 auto it = protos_.emplace(proto_key, IdxAndDataOffset()).first; local 72 const ProtoKey* proto = &it->first; // Valid as long as the element remains in protos_. 80 // NOTE: The builder holds the actual data, so it must live as long as the dex file. 207 auto it = protos_.find(*entry.first.proto); local 208 CHECK(it != protos_.end()); 209 Write16(raw_offset + 2u, it->second.idx); 223 auto it = strings_.find(type); local 224 CHECK(it ! 229 auto it = types_.find(type); local 237 auto it = fields_.find(key); local 246 auto it = methods_.find(method_key); 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...] |
H A D | timing_logger.cc | 98 auto it = histograms_.find(&dummy); local 99 if (it == histograms_.end()) { 105 histogram = *it; 124 // We don't expect DumpHistogram to be called often, so it is not performance critical.
|
/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/compiler/dex/quick/arm/ |
H A D | fp_arm.cc | 342 LIR* it = OpIT((default_result == -1) ? kCondGt : kCondMi, ""); local 345 OpEndIT(it); 347 it = OpIT(kCondEq, ""); 349 OpEndIT(it);
|
/art/compiler/dwarf/ |
H A D | debug_info_entry_writer.h | 220 auto it = abbrev_codes_.insert(std::make_pair(std::move(current_abbrev_), local 222 int abbrev_code = it.first->second; 223 if (UNLIKELY(it.second)) { // Inserted new entry. 224 const std::vector<uint8_t, Allocator>& abbrev = it.first->first;
|
/art/compiler/linker/ |
H A D | relative_patcher_test.h | 222 auto it = map.find(ref); variable 223 if (it == map.end()) { 226 return std::pair<bool, uint32_t>(true, it->second);
|
/art/compiler/optimizing/ |
H A D | stack_map_stream.cc | 75 // companion hash map of locations to indices). Use its index if it 76 // is already in the location catalog. If not, insert it (in the 78 auto it = location_catalog_entries_indices_.Find(location); local 79 if (it != location_catalog_entries_indices_.end()) { 81 dex_register_locations_.Add(it->second);
|
/art/runtime/ |
H A D | fault_handler.cc | 33 // Typically a signal handler should not need to deal with signals that occur within it. 37 // that it may not work. If the cause of the original SIGSEGV is a corrupted stack or other 52 // a. it completes successfully 53 // b. it crashes and a signal is raised. 60 // and write something to the log to tell the user that it happened. 151 // If malloc calls abort, it will be holding its lock. 152 // If the handler tries to call malloc, it will deadlock. 165 // We have handled a signal so it's time to return from the 175 // if it is. 191 // Release the fault manager so that it wil 285 auto it = std::find(generated_code_handlers_.begin(), generated_code_handlers_.end(), handler); local [all...] |
H A D | monitor_test.cc | 94 // Allocate simple objects till it fails. 105 // This test is potentially racy, but the timeout is long enough that it should work. 120 LockWord lock_after = monitor_test_->object_.Get()->GetLockWord(false); // it to thinLocked. 238 // Give it some more time to get to the exception code. 320 auto it = handles.begin(); local 323 for ( ; it != end; ++it) { 324 it->Assign(nullptr); 379 // after which it will interrupt the create task and then wait another 10ms.
|
H A D | safe_map.h | 71 iterator erase(iterator it) { return map_.erase(it); } argument 84 const_iterator it = map_.find(k); local 85 DCHECK(it != map_.end()); 86 return it->second;
|
/art/runtime/verifier/ |
H A D | register_line.h | 85 // The register index was validated during the static pass, so we don't need to check it here. 164 * The "this" argument to <init> uses code offset kUninitThisArgAddr, which puts it at the start 165 * of the list in slot 0. If we see a register with an uninitialized slot 0 reference, we know it 184 * caller can decide whether it needs the reference to be initialized or not. (Can also return 307 auto it = reg_to_lock_depths_.find(src); local 308 if (it != reg_to_lock_depths_.end()) { 309 reg_to_lock_depths_.Put(dst, it->second); 314 auto it = reg_to_lock_depths_.find(reg); local 315 if (it != reg_to_lock_depths_.end()) { 316 return (it 327 auto it = reg_to_lock_depths_.find(reg); local 339 auto it = reg_to_lock_depths_.find(reg); local [all...] |
/art/compiler/ |
H A D | elf_writer_debug.cc | 252 for (auto it = method_infos.begin(); it != method_infos.end(); ++it) { 253 if (it->deduped_) { 254 deduped_addresses.insert(it->low_pc_); 372 auto it = directories_map.find(package_name); local 373 if (it == directories_map.end()) { 378 directory_index = it->second;
|
H A D | image_writer.h | 81 auto it = dex_cache_array_starts_.find(dex_file); local 82 DCHECK(it != dex_cache_array_starts_.end()); 84 image_begin_ + RoundUp(sizeof(ImageHeader), kObjectAlignment) + it->second + offset); 137 // Subtract read barrier bits since we want these to remain 0, or else it may result in DCHECK
|