/art/compiler/dex/quick/ |
H A D | dex_file_to_method_inliner_map.h | 20 #include <map> 49 std::map<const DexFile*, DexFileMethodInliner*> inliners_ GUARDED_BY(lock_);
|
/art/test/004-ReferenceMap/ |
H A D | stack_walk_refmap_jni.cc | 44 << "Error: Reg @ " << i << "-th argument is not in GC map"; \ 60 NativePcOffsetToReferenceMap map(m->GetNativeGcMap(sizeof(void*))); 74 ref_bitmap = map.FindBitMap(m->NativePcOffset(m->ToNativePc(0x03U))); 78 ref_bitmap = map.FindBitMap(m->NativePcOffset(m->ToNativePc(0x06U))); 82 ref_bitmap = map.FindBitMap(m->NativePcOffset(m->ToNativePc(0x08U))); 86 ref_bitmap = map.FindBitMap(m->NativePcOffset(m->ToNativePc(0x0cU))); 90 ref_bitmap = map.FindBitMap(m->NativePcOffset(m->ToNativePc(0x0eU))); 94 ref_bitmap = map.FindBitMap(m->NativePcOffset(m->ToNativePc(0x10U))); 98 ref_bitmap = map.FindBitMap(m->NativePcOffset(m->ToNativePc(0x13U))); 108 ref_bitmap = map [all...] |
/art/test/004-InterfaceTest/src/ |
H A D | Main.java | 22 public static long test_virtual(HashMap map) { argument 27 map.put(intobj, s); 33 public static long test_interface(Map map) { argument 38 map.put(intobj, s);
|
/art/compiler/utils/ |
H A D | scoped_hashtable.h | 19 #include <map> 33 scopes.push_front(std::map<K, V>()); 39 for (typename std::list<std::map<K, V>>::const_iterator scopes_it = scopes.begin(); 41 typename std::map<K, V>::const_iterator result_it = (*scopes_it).find(k); 67 std::list<std::map<K, V>> scopes;
|
/art/runtime/ |
H A D | mem_map_test.cc | 129 std::unique_ptr<MemMap> map(MemMap::MapAnonymous("MapAnonymousEmpty", 135 ASSERT_TRUE(map.get() != nullptr) << error_msg; 137 map.reset(MemMap::MapAnonymous("MapAnonymousEmpty", 143 ASSERT_TRUE(map.get() != nullptr) << error_msg; 151 std::unique_ptr<MemMap> map(MemMap::MapAnonymous("MapAnonymousEmpty", 157 ASSERT_TRUE(map.get() != nullptr) << error_msg; 159 ASSERT_LT(reinterpret_cast<uintptr_t>(BaseBegin(map.get())), 1ULL << 32); 186 // Attempt to map at the same address, which should fail. 211 std::unique_ptr<MemMap> map(MemMap::MapAnonymous("MapAnonymousExactAddr32bitHighAddr", 217 ASSERT_TRUE(map [all...] |
H A D | zip_archive.cc | 58 std::unique_ptr<MemMap> map(MemMap::MapAnonymous(name.c_str(), 61 if (map.get() == nullptr) { 67 map->Begin(), map->Size()); 73 return map.release();
|
H A D | safe_map.h | 20 #include <map> 28 // Equivalent to std::map, but without operator[] and its bug-prone semantics (in particular, 37 typedef typename ::std::map<K, V, Comparator, Allocator>::key_compare key_compare; 38 typedef typename ::std::map<K, V, Comparator, Allocator>::value_compare value_compare; 39 typedef typename ::std::map<K, V, Comparator, Allocator>::allocator_type allocator_type; 40 typedef typename ::std::map<K, V, Comparator, Allocator>::iterator iterator; 41 typedef typename ::std::map<K, V, Comparator, Allocator>::const_iterator const_iterator; 42 typedef typename ::std::map<K, V, Comparator, Allocator>::size_type size_type; 43 typedef typename ::std::map<K, V, Comparator, Allocator>::key_type key_type; 44 typedef typename ::std::map< [all...] |
H A D | mem_map.cc | 66 MemMap* map = it->second; local 67 CHECK_EQ(base, map->BaseBegin()); 68 os << *map << std::endl; 134 // Return true if the address range is contained in a single /proc/self/map entry. 138 std::unique_ptr<BacktraceMap> map(BacktraceMap::Create(getpid(), true)); 139 if (map.get() == nullptr) { 140 *error_msg = StringPrintf("Failed to build process map"); 143 for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) { 152 "any existing map 600 MemMap* map = begin_map; local 621 HasMemMap(MemMap* map) argument 638 MemMap* map = it->second; local [all...] |
H A D | profiler.h | 124 typedef std::map<mirror::ArtMethod*, uint32_t> Map; // Map of method vs its count. 129 typedef std::map<MethodReference, TrieNodeSet*, MethodReferenceComparator> MethodContextMap; 134 typedef std::map<std::pair<uint32_t, std::string>, uint32_t> PreviousContextMap; 144 typedef std::map<std::string, PreviousValue> PreviousProfile; 277 // Profile data is stored in a map, indexed by the full method name. 278 typedef std::map<std::string, ProfileData> ProfileMap;
|
H A D | transaction.h | 29 #include <map> 114 std::map<uint32_t, FieldValue> field_values_; 133 std::map<size_t, uint64_t> array_values_; 188 std::map<mirror::Object*, ObjectLog> object_logs_ GUARDED_BY(log_lock_); 189 std::map<mirror::Array*, ArrayLog> array_logs_ GUARDED_BY(log_lock_);
|
H A D | elf_file.h | 20 #include <map> 56 // The start of the memory map address range for this ELF file. 61 // The end of the memory map address range for this ELF file. 119 bool SetMap(MemMap* map, std::string* error_msg); 135 typedef std::map<std::string, Elf32_Sym*> SymbolTable; 153 // If build_map is true, builds a map to speed repeated access. The 154 // map does not included untyped symbol values (aka STT_NOTYPE) 155 // since they can contain duplicates. If build_map is false, the map 207 // When not-null, override the base vaddr we memory map LOAD segments into.
|
H A D | mem_map.h | 23 #include <map> 130 // Unmap the pages at end and remap them to create another memory map. 150 static bool HasMemMap(MemMap* map) 161 int prot_; // Protection of the map.
|
H A D | dex_file.cc | 179 std::unique_ptr<MemMap> map; local 193 map.reset(MemMap::MapFile(length, PROT_READ, MAP_PRIVATE, fd, 0, location, error_msg)); 194 if (map.get() == nullptr) { 200 if (map->Size() < sizeof(DexFile::Header)) { 206 const Header* dex_header = reinterpret_cast<const Header*>(map->Begin()); 208 const DexFile* dex_file = OpenMemory(location, dex_header->checksum_, map.release(), error_msg); 257 std::unique_ptr<MemMap> map(zip_entry->ExtractToMemMap(location.c_str(), entry_name, error_msg)); 258 if (map.get() == NULL) { 264 std::unique_ptr<const DexFile> dex_file(OpenMemory(location, zip_entry->GetCrc32(), map.release(),
|
H A D | dex_file_verifier.cc | 275 CheckValidOffsetAndSize(header_->map_off_, header_->map_off_, "map") && 288 const DexFile::MapList* map = reinterpret_cast<const DexFile::MapList*>(begin_ + local 290 // Check that map list content is available. 291 if (!CheckListSize(map, 1, sizeof(DexFile::MapList), "maplist content")) { 295 const DexFile::MapItem* item = map->list_; 297 uint32_t count = map->size_; 303 // Sanity check the size of the map list. 304 if (!CheckListSize(item, count, sizeof(DexFile::MapItem), "map size")) { 308 // Check the items listed in the map. 311 ErrorStringPrintf("Out of order map ite 1320 const DexFile::MapList* map = reinterpret_cast<const DexFile::MapList*>(begin_ + header_->map_off_); local 2036 const DexFile::MapList* map = reinterpret_cast<const DexFile::MapList*>(begin_ + header_->map_off_); local [all...] |
/art/compiler/dex/ |
H A D | verified_method.cc | 50 /* Generate a register map. */ 85 LOG(WARNING) << "Cannot encode GC map for method with " << ref_bitmap_bits << " registers: " 93 LOG(WARNING) << "Cannot encode GC map for method with " << num_entries << " entries: " 107 LOG(WARNING) << "Cannot encode GC map for method with " 138 // Check that for every GC point there is a map entry, there aren't entries for non-GC points, 140 verifier::DexPcToReferenceMap map(&data[0]); 141 DCHECK_EQ(data.size(), map.RawSize()); 145 const uint8_t* reg_bitmap = map.FindBitMap(i, false); 147 DCHECK_LT(map_index, map.NumEntries()); 148 DCHECK_EQ(map [all...] |
H A D | local_value_numbering.h | 105 void SetOperandValueImpl(uint16_t s_reg, uint16_t value, SregValueMap* map) { argument 106 DCHECK_EQ(map->count(s_reg), 0u) << PrettyMethod(gvn_->cu_->method_idx, *gvn_->cu_->dex_file) 108 map->Put(s_reg, value); 111 uint16_t GetOperandValueImpl(int s_reg, const SregValueMap* map) const { 113 auto lb = map->find(s_reg); 114 if (lb != map->end()) { 272 AliasingValues* GetAliasingValues(Map* map, const typename Map::key_type& key); 280 Map* map, const typename Map::key_type& key, 284 uint16_t HandleAliasingValuesGet(Map* map, const typename Map::key_type& key, 288 bool HandleAliasingValuesPut(Map* map, cons [all...] |
/art/test/004-StackWalk/ |
H A D | stack_walk_jni.cc | 62 NativePcOffsetToReferenceMap map(m->GetNativeGcMap(sizeof(void*))); 63 reg_bitmap = map.FindBitMap(GetNativePcOffset());
|
/art/compiler/sea_ir/ir/ |
H A D | sea.h | 22 #include <map> 161 const std::map<int, sea_ir::InstructionNode*>* GetDownExposedDefs() const; 166 std::map<int, std::set<sea_ir::InstructionNode*>* >* GetReachingDefs(); 242 std::map<int, sea_ir::InstructionNode*> de_defs_; 243 std::map<int, std::set<sea_ir::InstructionNode*>* > reaching_defs_;
|
H A D | sea.cc | 203 std::map<const uint16_t*, Region*> target_regions; 245 std::map<const uint16_t*, Region*>::iterator it = target_regions.find(&code[i + offset]); 249 std::map<const uint16_t*, Region*>::iterator it = target_regions.find(&code[i]); 291 // The map @block maps registers to the blocks in which they are defined. 292 std::map<int, std::set<Region*>> blocks; 484 std::map<int, InstructionNode*>::iterator res = de_defs_.find(reg_no); 491 for (std::map<int, sea_ir::InstructionNode*>::const_iterator cit = de_defs_.begin(); 497 const std::map<int, sea_ir::InstructionNode*>* Region::GetDownExposedDefs() const { 501 std::map<int, std::set<sea_ir::InstructionNode*>* >* Region::GetReachingDefs() { 506 std::map<in [all...] |
H A D | instruction_nodes.h | 73 std::map<int, InstructionNode* >* GetSSAProducersMap() { 102 std::map<int, InstructionNode* > definition_edges_; // Maps used registers to their definitions.
|
/art/compiler/sea_ir/code_gen/ |
H A D | code_gen.h | 29 // Abstracts away the containers we use to map SEA IR objects to LLVM IR objects. 36 std::map<int, llvm::BasicBlock*>::iterator block_it = blocks_.find(region_id); 54 std::map<int, llvm::Value*>::iterator value_it = values_.find(instruction_id); 80 std::map<int, llvm::BasicBlock*> blocks_; 81 std::map<int, llvm::Value*> values_;
|
/art/runtime/jdwp/ |
H A D | object_registry.h | 23 #include <map> 45 // The corresponding id, so we only need one map lookup in Add.
|
/art/compiler/ |
H A D | oat_writer.cc | 158 return "GC map"; 508 const SwapVector<uint8_t>* map = DataAccess::GetData(compiled_method); 509 uint32_t map_size = map->size() * sizeof((*map)[0]); 511 auto lb = dedupe_map_.lower_bound(map); 512 if (lb != dedupe_map_.end() && !dedupe_map_.key_comp()(map, lb->first)) { 516 dedupe_map_.PutBefore(lb, map, offset_); 518 writer_->oat_header_->UpdateChecksum(&(*map)[0], map_size); 670 // Write deduplicated map. 671 const SwapVector<uint8_t>* map local [all...] |
/art/compiler/sea_ir/debug/ |
H A D | dot_gen.cc | 45 std::map<int, InstructionNode*>* definition_edges = instruction->GetSSAProducersMap(); 47 for (std::map<int, InstructionNode*>::const_iterator
|
/art/runtime/gc/space/ |
H A D | image_space.cc | 649 std::unique_ptr<MemMap> map(MemMap::MapFileAtAddress(image_header.GetImageBegin(), 658 if (map.get() == NULL) { 662 CHECK_EQ(image_header.GetImageBegin(), map->Begin()); 663 DCHECK_EQ(0, memcmp(&image_header, map->Begin(), sizeof(ImageHeader))); 673 *error_msg = StringPrintf("Failed to map image bitmap: %s", error_msg->c_str()); 681 reinterpret_cast<byte*>(map->Begin()), 682 map->Size())); 689 map.release(), bitmap.release()));
|