/art/test/113-multidex/src/ |
D | Main.java | 21 Inf1 second = new Second(); in main() local 22 System.out.println(second.getClass().getName()); in main() 23 second.zcall(); in main() 24 second.zcall1(); in main() 25 second.zcall2(); in main() 26 second.zcall3(); in main() 27 second.zcall4(); in main() 28 second.zcall5(); in main() 29 second.zcall6(); in main() 30 second.zcall7(); in main() [all …]
|
/art/runtime/ |
D | class_reference.h | 31 if (lhs.second < rhs.second) { 33 } else if (lhs.second > rhs.second) {
|
D | profiler.cc | 498 i->second++; in Put() 528 uint32_t dex_pc = inst_loc.second; in PutStack() 559 TrieNodeSet* node_set = i->second; in PutStack() 591 uint32_t count = meth_iter.second; in Write() 597 count += pi->second.count_; in Write() 609 TrieNodeSet* node_set = method_iter.second; in Write() 637 total_count += pi->second.count_; in Write() 638 PreviousContextMap* previous_context_map = pi->second.context_map_; in Write() 641 uint32_t count = context_i.second; in Write() 646 ci->second += count; in Write() [all …]
|
D | transaction.cc | 43 field_values_count += it.second.Size(); in ~Transaction() 48 array_values_count += it.second.Size(); in ~Transaction() 134 it.second.Undo(it.first); in UndoObjectModifications() 143 it.second.Undo(it.first); in UndoArrayModifications() 172 it.second.VisitRoots(callback, arg); in VisitObjectLogs() 184 mirror::Object* new_root = pair.second; in VisitObjectLogs() 188 object_logs_.insert(std::make_pair(new_root, old_root_it->second)); in VisitObjectLogs() 211 mirror::Array* new_root = pair.second; in VisitArrayLogs() 215 array_logs_.insert(std::make_pair(new_root, old_root_it->second)); in VisitArrayLogs() 273 FieldValue& field_value = it.second; in Undo() [all …]
|
D | safe_map.h | 85 return it->second; in Get() 91 DCHECK(result.second); // Check we didn't accidentally overwrite an existing value. in Put() 108 if (!result.second) { in Overwrite() 110 result.first->second = v; in Overwrite()
|
/art/compiler/dex/ |
D | verification_results.cc | 70 DCHECK_EQ(it->second->GetDevirtMap().size(), verified_method->GetDevirtMap().size()); in ProcessVerifiedMethod() 71 DCHECK_EQ(it->second->GetSafeCastSet().size(), verified_method->GetSafeCastSet().size()); in ProcessVerifiedMethod() 72 DCHECK_EQ(it->second->GetDexGcMap().size(), verified_method->GetDexGcMap().size()); in ProcessVerifiedMethod() 73 delete it->second; in ProcessVerifiedMethod() 84 return (it != verified_methods_.end()) ? it->second : nullptr; in GetVerifiedMethod() 91 delete it->second; in RemoveVerifiedMethod()
|
D | local_value_numbering.cc | 83 ? lb->second in LookupMergeValue() 202 return &lb->second; in GetAliasingValues() 237 } else if (it->second.store_loc_set.count(location) != 0u) { in AliasingValuesMergeGet() 238 value_name = it->second.last_stored_value; in AliasingValuesMergeGet() 240 auto load_it = it->second.load_value_map.find(location); in AliasingValuesMergeGet() 241 if (load_it != it->second.load_value_map.end()) { in AliasingValuesMergeGet() 242 value_name = load_it->second; in AliasingValuesMergeGet() 244 … value_name = Versions::LookupGlobalValue(gvn, key, location, it->second.last_load_memory_version); in AliasingValuesMergeGet() 262 res = lb->second; in HandleAliasingValuesGet() 276 if (load_values_it != values->load_value_map.end() && load_values_it->second == value) { in HandleAliasingValuesPut() [all …]
|
D | post_opt_passes.cc | 91 AllNodesIterator second(mir_graph); in Start() local 92 for (BasicBlock* bb = second.Next(); bb != nullptr; bb = second.Next()) { in Start()
|
D | global_value_numbering.h | 90 res = lb->second; in LookupValue() 107 return (it != global_value_map_.end() && it->second == value); in HasValue() 179 res = lb->second; in GetRefSetId()
|
/art/compiler/utils/ |
D | dedupe_set.h | 61 b.in_key->second->begin(), b.in_key->second->end()); in operator() 63 return std::lexicographical_compare(a.in_key->second->begin(), a.in_key->second->end(), in operator() 66 return std::lexicographical_compare(a.in_key->second->begin(), a.in_key->second->end(), in operator() 67 b.in_key->second->begin(), b.in_key->second->end()); in operator()
|
D | swap_space.cc | 42 LOG(INFO) << " 0x" << std::hex << entry.second->Start() in DumpFreeMap() 43 << " size=" << std::dec << entry.second->size; in DumpFreeMap() 51 auto free_by_start_pos = free_by_size_pos->second; in RemoveChunk() 62 DCHECK(insert_result.second); in InsertChunk() 89 sum1 += entry.second->size; in CollectFree() 115 old_chunk = *it->second; in Alloc()
|
/art/runtime/jdwp/ |
D | object_registry.cc | 96 ObjectRegistryEntry* entry = it->second; in ContainsLocked() 114 const ObjectRegistryEntry* entry = pair.second; in Clear() 134 ObjectRegistryEntry& entry = *it->second; in InternalGet() 146 ObjectRegistryEntry& entry = *it->second; in GetJObject() 155 Promote(*it->second); in DisableCollection() 163 Demote(*it->second); in EnableCollection() 193 ObjectRegistryEntry& entry = *it->second; in IsCollected() 209 ObjectRegistryEntry* entry = it->second; in DisposeObject() 218 if (entry == it->second) { in DisposeObject()
|
/art/test/003-omnibus-opcodes/src/ |
D | Throw.java | 90 boolean second = false; in rethrow() 108 second = true; in rethrow() 113 Main.assertTrue(second); in rethrow()
|
/art/test/008-exceptions/ |
D | expected.txt | 1 Got an NPE: second throw 2 java.lang.NullPointerException: second throw
|
/art/compiler/sea_ir/debug/ |
D | dot_gen.cc | 50 if (NULL != def_it->second) { in ToDotSSAEdges() 51 dot_text_ += def_it->second->StringId() + " -> "; in ToDotSSAEdges() 54 art::SafeMap<int, const Type*>::const_iterator type_it = types_->find(def_it->second->Id()); in ToDotSSAEdges() 57 dot_text_ += "(" + type_it->second->Dump() + ")"; in ToDotSSAEdges() 89 dot_text_ += "(" + type_it->second->Dump() + ")"; in ToDotSSAEdges()
|
/art/compiler/dex/quick/ |
D | dex_file_to_method_inliner_map.cc | 36 delete entry.second; in ~DexFileToMethodInlinerMap() 46 return it->second; in GetMethodInliner()
|
/art/compiler/sea_ir/ir/ |
D | sea.cc | 247 AddEdge(r, it->second); // Add edge to branch target. in BuildMethodSeaGraph() 252 Region* nextRegion = it->second; in BuildMethodSeaGraph() 255 AddEdge(r, it->second); // Add flow-through edge. in BuildMethodSeaGraph() 315 std::set<Region*>* reg_def_blocks = &(blocks.find(reg_def)->second); in ConvertToSSA() 325 std::set<Region*> worklist((*(blocks.find(global))).second); in ConvertToSSA() 488 res->second = *inst_it; in ComputeDownExposedDefs() 493 (*cit).second->MarkAsDEDef(); in ComputeDownExposedDefs() 522 solo_def->insert(de_def->second); in UpdateReachingDefs() 536 crt_entry->second->insert(reaching_it->second->begin(), reaching_it->second->end()); in UpdateReachingDefs() 541 reaching_it->second) ); in UpdateReachingDefs() [all …]
|
/art/runtime/gc/accounting/ |
D | mod_union_table.cc | 220 for (mirror::HeapReference<Object>* ref : ref_pair.second) { in Verify() 232 for (mirror::HeapReference<Object>* obj_ptr : ref_pair.second) { in Verify() 256 for (mirror::HeapReference<Object>* ref : ref_pair.second) { in Dump() 289 found->second = cards_references; in UpdateAndMarkReferences() 295 for (mirror::HeapReference<Object>* obj_ptr : ref.second) { in UpdateAndMarkReferences() 298 count += ref.second.size(); in UpdateAndMarkReferences()
|
/art/runtime/verifier/ |
D | register_line.h | 298 reg_to_lock_depths_.Put(dst, it->second); in CopyRegToLockDepth() 305 return (it->second & (1 << depth)) != 0; in IsSetLockDepth() 318 it->second |= (1 << depth); in SetRegToLockDepth() 327 uint32_t depths = it->second ^ (1 << depth); in ClearRegToLockDepth() 329 it->second = depths; in ClearRegToLockDepth()
|
/art/compiler/optimizing/ |
D | builder.cc | 142 HInstruction* second = LoadLocal(instruction.VRegB(), Primitive::kPrimInt); in If_22t() local 143 T* comparison = new (arena_) T(first, second); in If_22t() 275 HInstruction* second = LoadLocal(instruction.VRegC(), type); in Binop_23x() local 276 current_block_->AddInstruction(new (arena_) T(type, first, second)); in Binop_23x() 283 HInstruction* second = LoadLocal(instruction.VRegB(), type); in Binop_12x() local 284 current_block_->AddInstruction(new (arena_) T(type, first, second)); in Binop_12x() 291 HInstruction* second = GetIntConstant(instruction.VRegC_22s()); in Binop_22s() local 293 std::swap(first, second); in Binop_22s() 295 current_block_->AddInstruction(new (arena_) T(Primitive::kPrimInt, first, second)); in Binop_22s() 302 HInstruction* second = GetIntConstant(instruction.VRegC_22b()); in Binop_22b() local [all …]
|
D | nodes.h | 151 HBasicBlock* FindCommonDominator(HBasicBlock* first, HBasicBlock* second) const; 918 HCondition(HInstruction* first, HInstruction* second) in HCondition() argument 919 : HBinaryOperation(Primitive::kPrimBoolean, first, second) {} in HCondition() 935 HEqual(HInstruction* first, HInstruction* second) in HEqual() argument 936 : HCondition(first, second) {} in HEqual() 950 HNotEqual(HInstruction* first, HInstruction* second) in HNotEqual() argument 951 : HCondition(first, second) {} in HNotEqual() 965 HLessThan(HInstruction* first, HInstruction* second) in HLessThan() argument 966 : HCondition(first, second) {} in HLessThan() 980 HLessThanOrEqual(HInstruction* first, HInstruction* second) in HLessThanOrEqual() argument [all …]
|
D | nodes.cc | 95 HBasicBlock* HGraph::FindCommonDominator(HBasicBlock* first, HBasicBlock* second) const { in FindCommonDominator() 103 while (second != nullptr) { in FindCommonDominator() 104 if (visited.IsBitSet(second->GetBlockId())) { in FindCommonDominator() 105 return second; in FindCommonDominator() 107 second = second->GetDominator(); in FindCommonDominator()
|
/art/test/302-float-conversion/ |
D | info.txt | 5 The second test checks the Load hoisting optimization for float pointing conversion.
|
/art/compiler/sea_ir/types/ |
D | types.h | 41 return result_it->second; in FindTypeOf()
|
/art/test/098-ddmc/src/ |
D | Main.java | 75 Allocations second = new Allocations(DdmVmInternal.getRecentAllocations()); in testRecentAllocationTracking() local 76 System.out.println("second > first =" + (second.numberOfEntries > first.numberOfEntries)); in testRecentAllocationTracking()
|