Searched refs:pair (Results 1 - 25 of 52) sorted by relevance

123

/art/runtime/base/
H A Dhash_map.h31 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 Dhash_set_test.cc203 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 Dmutex.cc243 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 Dallocator.h149 Key, T, Compare, TrackingAllocator<std::pair<Key, T>, kTag>> {
/art/runtime/
H A Dclass_reference.h28 typedef std::pair<const DexFile*, uint32_t> ClassReference;
H A Dsafe_map.h31 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 Dtransaction.cc167 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 Dmonitor_test.cc37 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 Dcommon_runtime_test.h36 typedef std::vector<std::pair<std::string, const void*>> RuntimeOptions;
H A Dparsed_options.h35 typedef std::vector<std::pair<std::string, const void*>> RuntimeOptions;
H A Ddex_file.h999 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 Dprofiler.h44 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 Dutility_mips.cc347 // 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 Dscoped_hashtable.h52 scopes.front().insert(std::pair< K, V >(k, v));
/art/compiler/dex/
H A Dmir_field_info.cc66 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 Dutility_x86.cc639 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 Dcode_gen.h46 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 Dobject_registry.cc113 for (const auto& pair : object_to_entry_) {
114 const ObjectRegistryEntry* entry = pair.second;
/art/runtime/gc/space/
H A Dlarge_object_space_test.cc46 std::vector<std::pair<mirror::Object*, size_t>> requests;
H A Dmalloc_space.h164 std::pair<const mirror::Object*, mirror::Class*> recent_freed_objects_[kRecentFreeCount];
/art/compiler/sea_ir/ir/
H A Dsea.cc213 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 Dquick_trampoline_entrypoints.cc556 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 Dimage_writer.cc211 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 Dcompiler_driver-inl.h95 inline std::pair<bool, bool> CompilerDriver::IsFastInstanceField(
107 inline std::pair<bool, bool> CompilerDriver::IsFastStaticField(
H A Dcompiler_driver.cc438 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...]

Completed in 434 milliseconds

123