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

12345678910

/system/bt/osi/test/
H A Dhash_map_utils_test.cc32 map.clear();
36 std::unordered_map<std::string, std::string> map; member in class:HashMapUtilsTest
41 map = hash_map_utils_new_from_string_params(params);
42 EXPECT_TRUE(map.empty());
47 map = hash_map_utils_new_from_string_params(params);
48 EXPECT_TRUE(map.empty());
55 map = hash_map_utils_new_from_string_params(params);
56 EXPECT_EQ(1u, map.size());
57 EXPECT_EQ(value, map[key]);
58 map
[all...]
/system/extras/libpagemap/
H A Dpm_map.h22 int pm_map_destroy(pm_map_t *map);
H A Dpm_map.c22 int pm_map_pagemap(pm_map_t *map, uint64_t **pagemap_out, size_t *len) { argument
23 if (!map)
26 return pm_process_pagemap_range(map->proc, map->start, map->end,
30 int pm_map_usage_flags(pm_map_t *map, pm_memusage_t *usage_out, argument
38 if (!map || !usage_out)
41 error = pm_map_pagemap(map, &pagemap, &len);
48 usage.vss += map->proc->ker->pagesize;
57 error = pm_kernel_flags(map
88 pm_map_usage(pm_map_t *map, pm_memusage_t *usage_out) argument
92 pm_map_workingset(pm_map_t *map, pm_memusage_t *ws_out) argument
136 pm_map_destroy(pm_map_t *map) argument
[all...]
/system/core/include/log/
H A Devent_tag_map.h30 * Open the specified file as an event log tag map.
37 * Close the map.
39 void android_closeEventTagMap(EventTagMap* map);
44 const char* android_lookupEventTag(const EventTagMap* map, unsigned int tag)
53 const char* android_lookupEventTag_len(const EventTagMap* map, size_t* len,
60 const char* android_lookupEventFormat_len(const EventTagMap* map, size_t* len,
66 int android_lookupEventTagNum(EventTagMap* map, const char* tagname,
/system/core/liblog/include/log/
H A Devent_tag_map.h30 * Open the specified file as an event log tag map.
37 * Close the map.
39 void android_closeEventTagMap(EventTagMap* map);
44 const char* android_lookupEventTag(const EventTagMap* map, unsigned int tag)
53 const char* android_lookupEventTag_len(const EventTagMap* map, size_t* len,
60 const char* android_lookupEventFormat_len(const EventTagMap* map, size_t* len,
66 int android_lookupEventTagNum(EventTagMap* map, const char* tagname,
/system/core/libbacktrace/
H A DUnwindMap.cpp34 // of maps using the same map cursor.
55 backtrace_map_t map; local
57 map.start = unw_map.start;
58 map.end = unw_map.end;
59 map.offset = unw_map.offset;
60 map.load_bias = unw_map.load_base;
61 map.flags = unw_map.flags;
62 map.name = unw_map.path;
65 maps_.push_front(map);
91 // It's possible for the map t
104 backtrace_map_t map; local
137 FillIn(uintptr_t addr, backtrace_map_t* map) argument
154 BacktraceMap* map; local
[all...]
H A DBacktraceMap.cpp17 #define LOG_TAG "backtrace-map"
41 void BacktraceMap::FillIn(uintptr_t addr, backtrace_map_t* map) { argument
45 *map = *it;
49 *map = {};
52 bool BacktraceMap::ParseLine(const char* line, backtrace_map_t* map) { argument
76 map->start = start;
77 map->end = end;
78 map->flags = PROT_NONE;
80 map->flags |= PROT_READ;
83 map
122 backtrace_map_t map; local
140 BacktraceMap* map = new BacktraceMap(pid); local
[all...]
H A DBacktrace.cpp42 Backtrace::Backtrace(pid_t pid, pid_t tid, BacktraceMap* map) argument
43 : pid_(pid), tid_(tid), map_(map), map_shared_(true) {
57 std::string Backtrace::GetFunctionName(uintptr_t pc, uintptr_t* offset, const backtrace_map_t* map) { argument
59 if (map == nullptr) {
61 map = &map_value;
63 // If no map is found, or this map is backed by a device, then return nothing.
64 if (map->start == 0 || (map->flags & PROT_DEVICE_MAP)) {
88 if (BacktraceMap::IsValid(frame->map)) {
120 FillInMap(uintptr_t pc, backtrace_map_t* map) argument
126 Create(pid_t pid, pid_t tid, BacktraceMap* map) argument
[all...]
H A DUnwindPtrace.cpp31 UnwindPtrace::UnwindPtrace(pid_t pid, pid_t tid, BacktraceMap* map) argument
32 : BacktracePtrace(pid, tid, map), addr_space_(nullptr), upt_info_(nullptr) {
42 // Remove the map from the address space before destroying it.
69 UnwindMap* map = static_cast<UnwindMap*>(GetMap()); local
70 unw_map_set(addr_space_, map->GetMapCursor());
84 // Without a map object, we can't do anything.
137 FillInMap(frame->pc, &frame->map);
138 if (BacktraceMap::IsValid(frame->map)) {
139 frame->rel_pc = frame->pc - frame->map.start + frame->map
153 backtrace_map_t map; local
161 backtrace_map_t map; local
[all...]
/system/core/libcutils/
H A Dhashmap.c48 Hashmap* map = malloc(sizeof(Hashmap)); local
49 if (map == NULL) {
55 map->bucketCount = 1;
56 while (map->bucketCount <= minimumBucketCount) {
58 map->bucketCount <<= 1;
61 map->buckets = calloc(map->bucketCount, sizeof(Entry*));
62 if (map->buckets == NULL) {
63 free(map);
67 map
83 hashKey(Hashmap* map, void* key) argument
96 hashmapSize(Hashmap* map) argument
104 expandIfNecessary(Hashmap* map) argument
135 hashmapLock(Hashmap* map) argument
139 hashmapUnlock(Hashmap* map) argument
143 hashmapFree(Hashmap* map) argument
196 hashmapPut(Hashmap* map, void* key, void* value) argument
228 hashmapGet(Hashmap* map, void* key) argument
243 hashmapContainsKey(Hashmap* map, void* key) argument
258 hashmapMemoize(Hashmap* map, void* key, void* (*initialValue)(void* key, void* context), void* context) argument
291 hashmapRemove(Hashmap* map, void* key) argument
313 hashmapForEach(Hashmap* map, bool (*callback)(void* key, void* value, void* context), void* context) argument
329 hashmapCurrentCapacity(Hashmap* map) argument
334 hashmapCountCollisions(Hashmap* map) argument
[all...]
/system/core/debuggerd/libdebuggerd/test/
H A Dtombstone_test.cpp100 backtrace_map_t map; local
102 map.start = 0x123456789abcd000UL;
103 map.end = 0x123456789abdf000UL;
105 map.start = 0x1234000;
106 map.end = 0x1235000;
108 map_mock_->AddMap(map);
116 "\nmemory map:\n"
132 backtrace_map_t map; local
134 map.start = 0x123456789abcd000UL;
135 map
169 backtrace_map_t map; local
208 backtrace_map_t map; local
272 backtrace_map_t map; local
330 backtrace_map_t map; local
388 backtrace_map_t map; local
444 backtrace_map_t map; local
506 backtrace_map_t map; local
540 backtrace_map_t map; local
[all...]
/system/core/include/cutils/
H A Dhashmap.h18 * Hash map.
31 /** A hash map. */
35 * Creates a new hash map. Returns NULL if memory allocation fails.
45 * Frees the hash map. Does not free the keys or values themselves.
47 void hashmapFree(Hashmap* map);
56 * Puts value for the given key in the map. Returns pre-existing value if
59 * If memory allocation fails, this function returns NULL, the map's size
62 void* hashmapPut(Hashmap* map, void* key, void* value);
65 * Gets a value from the map. Returns NULL if no entry for the given key is
68 void* hashmapGet(Hashmap* map, voi
[all...]
/system/core/libcutils/include/cutils/
H A Dhashmap.h18 * Hash map.
31 /** A hash map. */
35 * Creates a new hash map. Returns NULL if memory allocation fails.
45 * Frees the hash map. Does not free the keys or values themselves.
47 void hashmapFree(Hashmap* map);
56 * Puts value for the given key in the map. Returns pre-existing value if
59 * If memory allocation fails, this function returns NULL, the map's size
62 void* hashmapPut(Hashmap* map, void* key, void* value);
65 * Gets a value from the map. Returns NULL if no entry for the given key is
68 void* hashmapGet(Hashmap* map, voi
[all...]
/system/core/libcutils/include_vndk/cutils/
H A Dhashmap.h18 * Hash map.
31 /** A hash map. */
35 * Creates a new hash map. Returns NULL if memory allocation fails.
45 * Frees the hash map. Does not free the keys or values themselves.
47 void hashmapFree(Hashmap* map);
56 * Puts value for the given key in the map. Returns pre-existing value if
59 * If memory allocation fails, this function returns NULL, the map's size
62 void* hashmapPut(Hashmap* map, void* key, void* value);
65 * Gets a value from the map. Returns NULL if no entry for the given key is
68 void* hashmapGet(Hashmap* map, voi
[all...]
/system/core/include/backtrace/
H A DBacktraceMap.h36 // Special flag to indicate a map is in /dev/. However, a map in
51 // If uncached is true, then parse the current process map as of the call.
52 // Passing a map created with uncached set to true to Backtrace::Create()
60 // Fill in the map data structure for the given address.
61 virtual void FillIn(uintptr_t addr, backtrace_map_t* map);
66 backtrace_map_t map; local
67 FillIn(pc, &map);
68 if (IsValid(map)) {
69 return map
96 IsValid(const backtrace_map_t& map) argument
111 ScopedBacktraceMapIteratorLock(BacktraceMap* map) argument
[all...]
/system/core/libbacktrace/include/backtrace/
H A DBacktraceMap.h36 // Special flag to indicate a map is in /dev/. However, a map in
51 // If uncached is true, then parse the current process map as of the call.
52 // Passing a map created with uncached set to true to Backtrace::Create()
60 // Fill in the map data structure for the given address.
61 virtual void FillIn(uintptr_t addr, backtrace_map_t* map);
66 backtrace_map_t map; local
67 FillIn(pc, &map);
68 if (IsValid(map)) {
69 return map
96 IsValid(const backtrace_map_t& map) argument
111 ScopedBacktraceMapIteratorLock(BacktraceMap* map) argument
[all...]
/system/core/init/
H A Dbuiltins.h21 #include <map>
36 const Map& map() const override;
/system/extras/iotop/
H A Dtasklist.h15 #include <map>
23 static bool Scan(std::map<pid_t, std::vector<pid_t>>&);
/system/libvintf/include/vintf/
H A DXmlFileGroup.h20 #include <map>
36 using map = std::multimap<std::string, T>;
37 using const_range = std::pair<typename map::const_iterator, typename map::const_iterator>;
62 map mXmlFiles;
H A DKernelConfigParser.h21 #include <map>
37 std::map<std::string, std::string>& configs();
38 const std::map<std::string, std::string>& configs() const;
42 std::map<std::string, std::string> mConfigs;
/system/netd/libnetdutils/include/netdutils/
H A DMisc.h20 #include <map>
25 // Lookup key in map, returing a default value if key is not found
27 inline const V& findWithDefault(const std::map<U, V>& map, const U& key, const V& dflt) { argument
28 auto it = map.find(key);
29 return (it == map.end()) ? dflt : it->second;
/system/core/debuggerd/libdebuggerd/include/
H A Dbacktrace.h23 #include <map>
33 void dump_backtrace(int fd, BacktraceMap* map, pid_t pid, pid_t tid, const std::string& process_name,
34 const std::map<pid_t, std::string>& threads, std::string* amfd_data);
/system/extras/simpleperf/
H A Dtest_util.h17 #include <map>
30 void ParseSymbol(const ElfFileSymbol& symbol, std::map<std::string, ElfFileSymbol>* symbols);
31 void CheckElfFileSymbols(const std::map<std::string, ElfFileSymbol>& symbols);
/system/extras/perfprofd/
H A Dconfigreader.h22 #include <map>
61 std::map<std::string, values> u_info;
62 std::map<std::string, unsigned> u_entries;
63 std::map<std::string, std::string> s_entries;
/system/bt/osi/include/
H A Dhash_map_utils.h24 // Creates a hash map based on the |params| string containing key and value
29 // "key0=value10;key1=value1;" -> map: [key0]="value0" [key1]="value1"
30 // "key0=;key1=value1;" -> map: [key0]="" [key1]="value1"
31 // "=value0;key1=value1;" -> map: [key1]="value1"
32 // A new hash map or NULL is returned and is owned by the caller.
37 // If |map| is not NULL, all entries of |map| will be dumped, otherwise nothing
38 // will be dumped. Note that this function does not take the ownership of |map|.
40 std::unordered_map<std::string, std::string>& map);

Completed in 326 milliseconds

12345678910