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

12

/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);
47 usage.vss += map->proc->ker->pagesize;
55 error = pm_kernel_flags(map
85 pm_map_usage(pm_map_t *map, pm_memusage_t *usage_out) argument
89 pm_map_workingset(pm_map_t *map, pm_memusage_t *ws_out) argument
133 pm_map_destroy(pm_map_t *map) argument
[all...]
H A Dpm_process.c235 pm_map_t *map, **maps, **new_maps; local
268 maps[maps_count] = map = calloc(1, sizeof(*map));
270 map->proc = proc;
274 &map->start, &map->end, perms, &map->offset, name);
276 map->name = malloc(strlen(name) + 1);
277 if (!map->name) {
284 strcpy(map
[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
80 hashKey(Hashmap* map, void* key) argument
93 hashmapSize(Hashmap* map) argument
101 expandIfNecessary(Hashmap* map) argument
132 hashmapLock(Hashmap* map) argument
136 hashmapUnlock(Hashmap* map) argument
140 hashmapFree(Hashmap* map) argument
189 hashmapPut(Hashmap* map, void* key, void* value) argument
221 hashmapGet(Hashmap* map, void* key) argument
236 hashmapContainsKey(Hashmap* map, void* key) argument
251 hashmapMemoize(Hashmap* map, void* key, void* (*initialValue)(void* key, void* context), void* context) argument
284 hashmapRemove(Hashmap* map, void* key) argument
306 hashmapForEach(Hashmap* map, bool (*callback)(void* key, void* value, void* context), void* context) argument
322 hashmapCurrentCapacity(Hashmap* map) argument
327 hashmapCountCollisions(Hashmap* map) argument
[all...]
H A Dstr_parms.c34 Hashmap *map; member in struct:str_parms
62 str_parms->map = hashmapCreate(5, str_hash_fn, str_eq);
63 if (!str_parms->map)
102 hashmapRemove(ctxt->str_parms->map, key);
114 hashmapForEach(str_parms->map, remove_pair, &ctxt);
123 hashmapForEach(str_parms->map, remove_pair, &ctxt);
124 hashmapFree(str_parms->map);
168 old_val = hashmapPut(str_parms->map, key, value);
201 old_val = hashmapPut(str_parms->map, tmp_key, tmp_val);
246 value = hashmapGet(str_parms->map, (voi
[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, int tag);
H A Dlogprint.h115 * If "map" is non-NULL, it will be used to convert the log tag number
119 AndroidLogEntry *entry, const EventTagMap* map, char* messageBuf,
/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/liblog/
H A Devent_tag_map.c50 static int processFile(EventTagMap* map);
51 static int countMapLines(const EventTagMap* map);
52 static int parseMapLines(EventTagMap* map);
54 static int sortTags(EventTagMap* map);
55 static void dumpTags(const EventTagMap* map);
59 * Open the map file and allocate a structure to manage it.
76 fprintf(stderr, "%s: unable to open map '%s': %s\n",
84 fprintf(stderr, "%s: unable to seek map '%s'\n", OUT_TAG, fileName);
110 * Close the map.
112 void android_closeEventTagMap(EventTagMap* map) argument
126 android_lookupEventTag(const EventTagMap* map, int tag) argument
186 processFile(EventTagMap* map) argument
225 countMapLines(const EventTagMap* map) argument
262 parseMapLines(EventTagMap* map) argument
407 sortTags(EventTagMap* map) argument
429 dumpTags(const EventTagMap* map) argument
[all...]
H A Dlogprint.c600 AndroidLogEntry *entry, const EventTagMap* map, char* messageBuf,
624 if (map != NULL) {
625 entry->tag = android_lookupEventTag(map, tagIndex);
631 * If we don't have a map, or didn't find the tag number in the map,
599 android_log_processBinaryLogBuffer(struct logger_entry *buf, AndroidLogEntry *entry, const EventTagMap* map, char* messageBuf, int messageBufLen) argument
/system/extras/libpagemap/include/pagemap/
H A Dpagemap.h89 /* Get the map count (from /proc/kpagecount) of a physical frame.
174 /* Get the name, flags, start/end address, or offset of a map. */
175 #define pm_map_name(map) ((map)->name)
176 #define pm_map_flags(map) ((map)->flags)
181 #define pm_map_start(map) ((map)->start)
182 #define pm_map_end(map) ((map)
[all...]
/system/core/toolbox/
H A Dload_policy.c15 void *map; local
35 map = mmap(NULL, sb.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
36 if (map == MAP_FAILED) {
41 rc = security_load_policy(map, sb.st_size);
46 munmap(map, sb.st_size);
H A Dreadtty.c13 } map[] = { variable in typeref:struct:__anon255
30 for(i = 0; i < sizeof(map) / sizeof(map[0]); i++) {
31 if(key == map[i].key) {
32 next = strchr(map[i].chars, current);
35 return map[i].chars[1];
45 for(i = 0; i < sizeof(map) / sizeof(map[0]); i++) {
46 if(key == map[i].key) {
47 next = strchr(map[
[all...]
/system/core/libutils/
H A DPropertyMap.cpp112 void PropertyMap::addAll(const PropertyMap* map) { argument
113 for (size_t i = 0; i < map->mProperties.size(); i++) {
114 mProperties.add(map->mProperties.keyAt(i), map->mProperties.valueAt(i));
126 PropertyMap* map = new PropertyMap(); local
127 if (!map) {
128 ALOGE("Error allocating property map.");
134 Parser parser(map, tokenizer);
143 delete map;
145 *outMap = map;
156 Parser(PropertyMap* map, Tokenizer* tokenizer) argument
[all...]
/system/extras/showmap/
H A Dshowmap.c123 static void enqueue_map(mapinfo **head, mapinfo *map, int sort_by_address, int coalesce_by_name) { argument
127 if (!map) {
132 if (current && coalesce_by_name && !strcmp(map->name, current->name)) {
133 current->size += map->size;
134 current->rss += map->rss;
135 current->pss += map->pss;
136 current->shared_clean += map->shared_clean;
137 current->shared_dirty += map->shared_dirty;
138 current->private_clean += map->private_clean;
139 current->private_dirty += map
[all...]
/system/extras/memtrack/
H A Dmemtrack.h22 #include <map>
63 typedef std::map<std::string, process_info_t> processes_t;
70 typedef std::map<std::string, cur_process_info_t> cur_processes_t;
/system/core/include/utils/
H A DPropertyMap.h50 /* Creates an empty property map. */
54 /* Clears the property map. */
62 /* Returns true if the property map contains the specified key. */
74 /* Adds all values from the specified property map. */
75 void addAll(const PropertyMap* map);
77 /* Gets the underlying property map. */
80 /* Loads a property map from a file. */
89 Parser(PropertyMap* map, Tokenizer* tokenizer);
/system/extras/procmem/
H A Dprocmem.c26 pm_map_t *map; member in struct:map_info
164 mi->map = maps[i];
169 error = pm_map_workingset(mi->map, &mi->usage);
171 error = pm_map_usage(mi->map, &mi->usage);
174 fprintf(stderr, "error getting usage for map.\n");
182 error = pm_map_pagemap(mi->map, &pagemap, &num_pages);
185 fprintf(stderr, "error getting pagemap for map.\n");
192 address = pm_map_start(mi->map) + j * ker->pagesize;
253 pm_map_name(mi->map)
265 pm_map_name(mi->map)
[all...]
/system/core/healthd/
H A DBatteryMonitor.cpp45 struct sysfsStringEnumMap map[]) {
46 for (int i = 0; map[i].s; i++)
47 if (!strcmp(str, map[i].s))
48 return map[i].val;
44 mapSysfsString(const char* str, struct sysfsStringEnumMap map[]) argument
/system/netd/
H A DSecondaryTableController.h39 SecondaryTableController(UidMarkMap *map);
H A DDnsProxyListener.cpp42 DnsProxyListener::DnsProxyListener(UidMarkMap *map) : argument
44 registerCmd(new GetAddrInfoCmd(map));
45 registerCmd(new GetHostByAddrCmd(map));
46 registerCmd(new GetHostByNameCmd(map));
47 mUidMarkMap = map;
H A DCommandListener.h50 CommandListener(UidMarkMap *map);
H A DDnsProxyListener.h27 DnsProxyListener(UidMarkMap *map);
H A DSecondaryTableController.cpp43 SecondaryTableController::SecondaryTableController(UidMarkMap *map) : mUidMarkMap(map) { argument
/system/core/debuggerd/
H A Dtombstone.c391 _LOG(log, scopeFlags, "\nmemory map around fault addr %08x:\n", (int)si.si_addr);
397 map_info_t* map = context->map_info_list; local
400 while (map != NULL) {
401 if (addr >= map->start && addr < map->end) {
402 next = map->next;
404 } else if (addr >= map->end) {
405 /* map would be between "prev" and this entry */
406 next = map;
407 map
[all...]

Completed in 496 milliseconds

12