Searched refs:map (Results 1 - 25 of 59) sorted by relevance

123

/art/compiler/dex/quick/
H A Ddex_file_to_method_inliner_map.h20 #include <map>
49 std::map<const DexFile*, DexFileMethodInliner*> inliners_ GUARDED_BY(lock_);
/art/test/004-InterfaceTest/src/
H A DMain.java22 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/runtime/
H A Dparsed_options_test.cc62 RuntimeArgumentMap map; local
63 std::unique_ptr<ParsedOptions> parsed(ParsedOptions::Create(options, false, &map));
65 ASSERT_NE(0u, map.Size());
69 #define EXPECT_PARSED_EQ(expected, actual_key) EXPECT_EQ(expected, map.GetOrDefault(actual_key))
70 #define EXPECT_PARSED_EXISTS(actual_key) EXPECT_TRUE(map.Exists(actual_key))
79 EXPECT_DOUBLE_EQ(0.75, map.GetOrDefault(Opt::HeapTargetUtilization));
80 EXPECT_TRUE(test_vfprintf == map.GetOrDefault(Opt::HookVfprintf));
81 EXPECT_TRUE(test_exit == map.GetOrDefault(Opt::HookExit));
82 EXPECT_TRUE(test_abort == map.GetOrDefault(Opt::HookAbort));
94 auto&& properties_list = map
104 RuntimeArgumentMap map; local
[all...]
H A Dmem_map_test.cc132 std::unique_ptr<MemMap> map(MemMap::MapAnonymous("MapAnonymousEmpty",
139 ASSERT_TRUE(map.get() != nullptr) << error_msg;
141 map.reset(MemMap::MapAnonymous("MapAnonymousEmpty",
148 ASSERT_TRUE(map.get() != nullptr) << error_msg;
156 std::unique_ptr<MemMap> map(MemMap::MapAnonymous("MapAnonymousEmpty",
163 ASSERT_TRUE(map.get() != nullptr) << error_msg;
165 ASSERT_LT(reinterpret_cast<uintptr_t>(BaseBegin(map.get())), 1ULL << 32);
194 // Attempt to map at the same address, which should fail.
222 std::unique_ptr<MemMap> map(MemMap::MapAnonymous("MapAnonymousExactAddr32bitHighAddr",
229 ASSERT_TRUE(map
[all...]
H A Dzip_archive.cc58 std::unique_ptr<MemMap> map(MemMap::MapAnonymous(name.c_str(),
62 if (map.get() == nullptr) {
68 map->Begin(), map->Size());
74 return map.release();
H A Dsafe_map.h20 #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 Dmem_map.cc73 MemMap* map = it->second; local
74 CHECK_EQ(base, map->BaseBegin());
75 os << *map << std::endl;
140 // Return true if the address range is contained in a single /proc/self/map entry.
145 std::unique_ptr<BacktraceMap> map(BacktraceMap::Create(getpid(), true));
146 if (map.get() == nullptr) {
147 *error_msg = StringPrintf("Failed to build process map");
150 for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) {
158 "any existing map
657 MemMap* map = begin_map; local
690 MemMap* map = it->second; local
733 HasMemMap(MemMap* map) argument
750 MemMap* map = it->second; local
[all...]
H A Dprofiler.h124 typedef std::map<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 Dtransaction.h30 #include <map>
147 std::map<uint32_t, FieldValue> field_values_;
166 std::map<size_t, uint64_t> array_values_;
223 std::map<mirror::Object*, ObjectLog> object_logs_ GUARDED_BY(log_lock_);
224 std::map<mirror::Array*, ArrayLog> array_logs_ GUARDED_BY(log_lock_);
H A Dcheck_reference_map_visitor.h108 NativePcOffsetToReferenceMap map(m->GetNativeGcMap(sizeof(void*)));
109 const uint8_t* ref_bitmap = map.FindBitMap(native_pc_offset);
115 << "Error: Reg @" << i << " is not in GC map";
H A Dmem_map.h23 #include <map>
117 // Resize the mem-map by unmapping pages at the end. Currently only supports shrinking.
140 // Unmap the pages at end and remap them to create another memory map.
160 static bool HasMemMap(MemMap* map)
171 int prot_; // Protection of the map.
H A Delf_file_impl.h20 #include <map>
134 bool SetMap(MemMap* map, std::string* error_msg);
150 typedef std::map<std::string, Elf_Sym*> SymbolTable;
168 // If build_map is true, builds a map to speed repeated access. The
169 // map does not included untyped symbol values (aka STT_NOTYPE)
170 // since they can contain duplicates. If build_map is false, the map
/art/compiler/dwarf/
H A Dregister.h47 static const int map[8] = {0, 2, 1, 3, 7, 6, 4, 5}; local
48 return Reg(num < 8 ? map[num] : num);
/art/test/099-vmdebug/src/
H A DMain.java190 Map<String, String> map = VMDebug.getRuntimeStats();
191 String gc_count = map.get("art.gc.gc-count");
192 String gc_time = map.get("art.gc.gc-time");
193 String bytes_allocated = map.get("art.gc.bytes-allocated");
194 String bytes_freed = map.get("art.gc.bytes-freed");
195 String blocking_gc_count = map.get("art.gc.blocking-gc-count");
196 String blocking_gc_time = map.get("art.gc.blocking-gc-time");
197 String gc_count_rate_histogram = map.get("art.gc.gc-count-rate-histogram");
199 map.get("art.gc.blocking-gc-count-rate-histogram");
/art/cmdline/
H A Dcmdline_parser_test.cc89 const TMap& map,
91 auto* actual = map.Get(key);
101 return ::testing::AssertionFailure() << "key was not in the map";
146 #define EXPECT_KEY_EXISTS(map, key) EXPECT_TRUE((map).Exists(key))
147 #define EXPECT_KEY_VALUE(map, key, expected) EXPECT_TRUE(IsExpectedKeyValue(expected, map, key))
211 // Test value map substitution fails
544 "-Xnodex2oat -Xmethod-trace -XX:LargeObjectSpace=map")));
546 auto&& map local
88 IsExpectedKeyValue(const T& expected, const TMap& map, const TKey& key) argument
[all...]
/art/compiler/dex/
H A Dlocal_value_numbering.h97 uint16_t GetSregValueImpl(int s_reg, const SregValueMap* map) const {
99 auto lb = map->find(s_reg);
100 if (lb != map->end()) {
108 void SetOperandValueImpl(uint16_t s_reg, uint16_t value, SregValueMap* map) { argument
109 DCHECK_EQ(map->count(s_reg), 0u);
110 map->Put(s_reg, value);
113 uint16_t GetOperandValueImpl(int s_reg, const SregValueMap* map) const {
115 auto lb = map->find(s_reg);
116 if (lb != map->end()) {
284 AliasingValues* GetAliasingValues(Map* map, cons
[all...]
H A Dverified_method.cc46 /* Generate a register map. */
97 LOG(WARNING) << "Cannot encode GC map for method with " << ref_bitmap_bits << " registers: "
104 LOG(WARNING) << "Cannot encode GC map for method with " << num_entries << " entries: "
118 LOG(WARNING) << "Cannot encode GC map for method with "
149 // Check that for every GC point there is a map entry, there aren't entries for non-GC points,
151 verifier::DexPcToReferenceMap map(&data[0]);
152 CHECK_EQ(data.size(), map.RawSize()) << map.NumEntries() << " " << map.RegWidth();
156 const uint8_t* reg_bitmap = map
[all...]
/art/runtime/jit/
H A Djit_code_cache.cc33 MemMap* map = MemMap::MapAnonymous("jit-code-cache", nullptr, capacity, local
35 if (map == nullptr) {
41 return new JitCodeCache(map);
49 // Data cache is 1 / 4 of the map. TODO: Make this variable?
/art/imgdiag/
H A Dimgdiag.cc25 #include <map>
117 // Find the memory map only for boot.art
118 for (const backtrace_map_t& map : *proc_maps) {
119 if (EndsWith(map.name, GetImageLocationBaseName())) {
120 if ((map.flags & PROT_WRITE) != 0) {
121 boot_map = map;
125 // In actuality there's more than 1 map, but the second one is read-only.
126 // The one we care about is the write-able map.
133 os << "Could not find map for " << GetImageLocationBaseName();
160 // Memory-map /pro
704 SortByValueDesc(const std::map<K, V> map) argument
[all...]
/art/tools/dexfuzz/src/dexfuzz/listeners/
H A DUniqueProgramTrackerListener.java187 private void addToMap(String md5sum, Map<String, Integer> map) { argument
188 if (map.containsKey(md5sum)) {
189 map.put(md5sum, map.get(md5sum) + 1);
191 map.put(md5sum, 1);
/art/test/137-cfi/
H A Dcfi.cc68 if (BacktraceMap::IsValid(it->map)) {
81 if (BacktraceMap::IsValid(it->map)) {
/art/compiler/linker/
H A Drelative_patcher_test.h98 method_offset_map_.map.Put(compiled_method_refs_[idx], quick_code_offset);
218 // Wrap the map in a class implementing linker::RelativePatcherTargetProvider.
222 auto it = map.find(ref);
223 if (it == map.end()) {
229 SafeMap<MethodReference, uint32_t, MethodReferenceComparator> map; member in class:art::linker::RelativePatcherTest::FINAL
/art/runtime/base/
H A Dvariant_map.h21 #include <map>
27 // A variant map is a heterogenous, type safe key->value map. It allows
28 // for multiple different value types to be stored dynamically in the same map.
205 // A variant map allows type-safe heteregeneous key->value mappings.
215 // A null value is returned only when the key does not exist in this map.
222 // A null value is returned only when the key does not exist in this map.
228 // Lookup the value from the key. If it was not set in the map, return the default value.
240 ScopedRemove(VariantMap& map, const TKey<TValue>& key) : map_(map), key argument
[all...]
/art/compiler/
H A Doat_writer.cc177 return "GC map";
398 auto method_lb = writer_->method_offset_map_.map.lower_bound(method_ref);
399 if (method_lb != writer_->method_offset_map_.map.end() &&
400 !writer_->method_offset_map_.map.key_comp()(method_ref, method_lb->first)) {
406 writer_->method_offset_map_.map.PutBefore(method_lb, method_ref, quick_code_offset);
568 const SwapVector<uint8_t>* map = DataAccess::GetData(compiled_method); local
569 uint32_t map_size = map == nullptr ? 0 : map->size() * sizeof((*map)[0]);
571 auto lb = dedupe_map_.lower_bound(map);
916 const SwapVector<uint8_t>* map = DataAccess::GetData(compiled_method); local
[all...]
/art/test/004-ThreadStress/src/
H A DMain.java37 // --dumpmap ....... print the frequency map
285 private static void normalize(Map<Operation, Double> map) { argument
287 for (Double d : map.values()) {
295 Set<Operation> tmp = new HashSet<>(map.keySet());
297 map.put(op, map.get(op) / sum);

Completed in 487 milliseconds

123