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