| /art/runtime/base/ |
| D | hash_map.h | 31 size_t operator()(const std::pair<Key, Value>& pair) const { in operator()
32 return fn_(pair.first); in operator()
39 bool operator()(const std::pair<Key, Value>& a, const std::pair<Key, Value>& b) const { in operator()
43 bool operator()(const std::pair<Key, Value>& a, const Element& element) const { in operator()
53 class Alloc = std::allocator<std::pair<Key, Value>>>
54 class HashMap : public HashSet<std::pair<Key, Value>, EmptyFn, HashMapWrapper<HashFn>,
|
| D | hash_set_test.cc | 203 void MakeEmpty(std::pair<std::string, int>& pair) const { in MakeEmpty()
204 pair.first.clear(); in MakeEmpty()
206 bool IsEmpty(const std::pair<std::string, int>& pair) const { in IsEmpty()
207 return pair.first.empty(); in IsEmpty()
|
| D | mutex.cc | 243 for (const auto& pair : most_common_blocked) { in DumpContention() local
244 if (pair.second > max_tid_count) { in DumpContention()
245 max_tid = pair.first; in DumpContention()
246 max_tid_count = pair.second; in DumpContention()
254 for (const auto& pair : most_common_blocker) { in DumpContention() local
255 if (pair.second > max_tid_count) { in DumpContention()
256 max_tid = pair.first; in DumpContention()
257 max_tid_count = pair.second; in DumpContention()
|
| D | allocator.h | 149 Key, T, Compare, TrackingAllocator<std::pair<Key, T>, kTag>> {
|
| /art/compiler/dex/quick/mips/ |
| D | utility_mips.cc | 470 bool pair = r_dest.IsPair(); in LoadBaseDispBody() local
475 if (!pair) { in LoadBaseDispBody()
478 pair = 1; in LoadBaseDispBody()
518 if (!pair) { in LoadBaseDispBody()
525 if (pair) { in LoadBaseDispBody()
542 AnnotateDalvikRegAccess(load, (displacement + (pair ? LOWORD_OFFSET : 0)) >> 2, in LoadBaseDispBody()
543 true /* is_load */, pair /* is64bit */); in LoadBaseDispBody()
544 if (pair) { in LoadBaseDispBody()
546 true /* is_load */, pair /* is64bit */); in LoadBaseDispBody()
581 bool pair = r_src.IsPair(); in StoreBaseDispBody() local
[all …]
|
| /art/runtime/ |
| D | safe_map.h | 31 typename Allocator = TrackingAllocator<std::pair<const K, V>, kAllocatorTagSafeMap>>
90 std::pair<iterator, bool> result = map_.emplace(k, v); in Put()
107 std::pair<iterator, bool> result = map_.insert(std::make_pair(k, v)); in Overwrite()
136 Key, T, Compare, TrackingAllocator<std::pair<Key, T>, kTag>> {
|
| D | transaction.cc | 167 typedef std::pair<mirror::Object*, mirror::Object*> ObjectPair; in VisitObjectLogs()
182 for (const ObjectPair& pair : moving_roots) { in VisitObjectLogs() local
183 mirror::Object* old_root = pair.first; in VisitObjectLogs()
184 mirror::Object* new_root = pair.second; in VisitObjectLogs()
195 typedef std::pair<mirror::Array*, mirror::Array*> ArrayPair; in VisitArrayLogs()
209 for (const ArrayPair& pair : moving_roots) { in VisitArrayLogs() local
210 mirror::Array* old_root = pair.first; in VisitArrayLogs()
211 mirror::Array* new_root = pair.second; in VisitArrayLogs()
|
| D | class_reference.h | 28 typedef std::pair<const DexFile*, uint32_t> ClassReference;
|
| D | monitor_test.cc | 37 for (std::pair<std::string, const void*>& pair : *options) { in SetUpRuntimeOptions()
38 if (pair.first.find("-Xmx") == 0) { in SetUpRuntimeOptions()
39 pair.first = "-Xmx4M"; // Smallest we can go. in SetUpRuntimeOptions()
|
| D | dex_file.h | 999 void MakeEmpty(std::pair<const char*, const ClassDef*>& pair) const { in MakeEmpty()
1000 pair.first = nullptr; in MakeEmpty()
1001 pair.second = nullptr; in MakeEmpty()
1003 bool IsEmpty(const std::pair<const char*, const ClassDef*>& pair) const { in IsEmpty()
1004 if (pair.first == nullptr) { in IsEmpty()
1005 DCHECK(pair.second == nullptr); in IsEmpty()
|
| D | profiler.h | 44 typedef std::pair<mirror::ArtMethod*, uint32_t> InstructionLocation;
134 typedef std::map<std::pair<uint32_t, std::string>, uint32_t> PreviousContextMap;
|
| D | parsed_options.h | 35 typedef std::vector<std::pair<std::string, const void*>> RuntimeOptions;
|
| D | common_runtime_test.h | 36 typedef std::vector<std::pair<std::string, const void*>> RuntimeOptions;
|
| /art/compiler/dex/quick/x86/ |
| D | utility_x86.cc | 639 bool pair = r_dest.IsPair(); in LoadBaseIndexedDisp() local
647 } else if (!pair) { in LoadBaseIndexedDisp()
691 if (!pair) { in LoadBaseIndexedDisp()
707 AnnotateDalvikRegAccess(load, (displacement + (pair ? LOWORD_OFFSET : 0)) >> 2, in LoadBaseIndexedDisp()
709 if (pair) { in LoadBaseIndexedDisp()
715 if (!pair) { in LoadBaseIndexedDisp()
786 bool pair = r_src.IsPair(); in StoreBaseIndexedDisp() local
794 } else if (!pair) { in StoreBaseIndexedDisp()
833 if (!pair) { in StoreBaseIndexedDisp()
842 AnnotateDalvikRegAccess(store, (displacement + (pair ? LOWORD_OFFSET : 0)) >> 2, in StoreBaseIndexedDisp()
[all …]
|
| /art/compiler/dex/ |
| D | mir_field_info.cc | 66 std::pair<bool, bool> fast_path = compiler_driver->IsFastInstanceField( in Resolve()
114 std::pair<bool, bool> fast_path = compiler_driver->IsFastStaticField( in Resolve()
|
| /art/compiler/utils/ |
| D | scoped_hashtable.h | 52 scopes.front().insert(std::pair< K, V >(k, v)); in Add()
|
| /art/compiler/sea_ir/code_gen/ |
| D | code_gen.h | 46 blocks_.insert(std::pair<int, llvm::BasicBlock*>(region_id, block)); in AddBlock()
64 values_.insert(std::pair<int, llvm::Value*>(instruction_id, value)); in AddValue()
|
| /art/compiler/sea_ir/ir/ |
| D | sea.cc | 213 target_regions.insert(std::pair<const uint16_t*, Region*>(&code[i + offset], region)); in BuildMethodSeaGraph()
219 std::pair<const uint16_t*, Region*>(&code[i + inst->SizeInCodeUnits()], region)); in BuildMethodSeaGraph()
314 blocks.insert(std::pair<int, std::set<Region*>>(reg_def, std::set<Region*>())); in ConvertToSSA()
486 de_defs_.insert(std::pair<int, InstructionNode*>(reg_no, *inst_it)); in ComputeDownExposedDefs()
524 std::pair<int const, std::set<InstructionNode*>*>(de_def->first, solo_def)); in UpdateReachingDefs()
539 std::pair<int, std::set<sea_ir::InstructionNode*>*>( in UpdateReachingDefs()
|
| /art/runtime/entrypoints/quick/ |
| D | quick_trampoline_entrypoints.cc | 556 std::vector<std::pair<jobject, StackReference<mirror::Object>*>> references_;
598 for (const auto& pair : references_) { in FixupReferences() local
599 pair.second->Assign(soa_->Decode<mirror::Object*>(pair.first)); in FixupReferences()
600 soa_->Env()->DeleteLocalRef(pair.first); in FixupReferences()
675 std::vector<std::pair<jobject, StackReference<mirror::Object>*> > references_;
692 for (const auto& pair : references_) { in FixupReferences() local
693 pair.second->Assign(soa_->Decode<mirror::Object*>(pair.first)); in FixupReferences()
694 soa_->Env()->DeleteLocalRef(pair.first); in FixupReferences()
|
| /art/runtime/jdwp/ |
| D | object_registry.cc | 113 for (const auto& pair : object_to_entry_) { in Clear() local
114 const ObjectRegistryEntry* entry = pair.second; in Clear()
|
| /art/compiler/driver/ |
| D | compiler_driver-inl.h | 95 inline std::pair<bool, bool> CompilerDriver::IsFastInstanceField( in IsFastInstanceField()
107 inline std::pair<bool, bool> CompilerDriver::IsFastStaticField( in IsFastStaticField()
|
| D | compiler_driver.cc | 438 for (auto& pair : compiled_methods_) { in ~CompilerDriver() local
439 CompiledMethod::ReleaseSwapAllocatedCompiledMethod(this, pair.second); in ~CompilerDriver()
649 std::set<std::pair<uint16_t, const DexFile*>>& exceptions_to_resolve) in ResolveExceptionsForMethod()
673 std::pair<uint16_t, const DexFile*>(encoded_catch_handler_handlers_type_idx, in ResolveExceptionsForMethod()
688 std::set<std::pair<uint16_t, const DexFile*>>* exceptions_to_resolve = in ResolveCatchBlockExceptionsClassVisitor()
689 reinterpret_cast<std::set<std::pair<uint16_t, const DexFile*>>*>(arg); in ResolveCatchBlockExceptionsClassVisitor()
742 std::set<std::pair<uint16_t, const DexFile*>> unresolved_exception_types; in LoadImageClasses()
750 for (const std::pair<uint16_t, const DexFile*>& exception_type : unresolved_exception_types) { in LoadImageClasses()
786 std::pair<std::set<std::string>::iterator, bool> result = image_classes->insert(descriptor); in MaybeAddToImageClasses()
1086 std::pair<bool, bool> fast_path = IsFastInstanceField( in ComputeInstanceFieldInfo()
[all …]
|
| /art/runtime/gc/space/ |
| D | malloc_space.h | 164 std::pair<const mirror::Object*, mirror::Class*> recent_freed_objects_[kRecentFreeCount];
|
| D | large_object_space_test.cc | 46 std::vector<std::pair<mirror::Object*, size_t>> requests; in LargeObjectTest()
|
| /art/compiler/ |
| D | image_writer.cc | 211 std::pair<BinSlot, uint32_t> slot_hash = *hash_it; in SetImageOffset()
500 bool operator()(const std::pair<size_t, size_t>& a, const std::pair<size_t, size_t>& b) { in operator ()()
548 std::set<std::pair<size_t, size_t>, SubstringComparator> existing_strings(( in ProcessStrings()
559 std::pair<size_t, size_t> new_string(num_chars - length, length); in ProcessStrings()
966 for (const std::pair<mirror::Object*, uint32_t>& hash_pair : saved_hashes_) { in CopyAndFixupObjects()
|