Searched defs:map (Results 1 - 12 of 12) sorted by relevance

/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:__anon485
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/extras/libpagemap/
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(pm_map_t *map, pm_memusage_t *usage_out) { argument
37 if (!map || !usage_out)
40 error = pm_map_pagemap(map, &pagemap, &len);
50 error = pm_kernel_count(map->proc->ker, PM_PAGEMAP_PFN(pagemap[i]),
54 usage.vss += map
70 pm_map_workingset(pm_map_t *map, pm_memusage_t *ws_out) argument
114 pm_map_destroy(pm_map_t *map) argument
[all...]
H A Dpm_process.c227 pm_map_t *map, **maps, **new_maps; local
260 maps[maps_count] = map = calloc(1, sizeof(*map));
262 map->proc = proc;
265 &map->start, &map->end, perms, &map->offset, name);
267 map->name = malloc(strlen(name) + 1);
268 if (!map->name) {
275 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/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/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/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/core/debuggerd/
H A Dtombstone.c348 _LOG(log, false, "\nmemory map around fault addr %08x:\n", (int)si.si_addr);
354 map_info_t* map = context->map_info_list; local
357 while (map != NULL) {
358 if (addr >= map->start && addr < map->end) {
359 next = map->next;
361 } else if (addr >= map->end) {
362 /* map would be between "prev" and this entry */
363 next = map;
364 map
[all...]
/system/bluetooth/bluez-clean-headers/bluetooth/
H A Dhci.h1035 uint8_t map[10]; member in struct:__anon89
1394 uint8_t map[10]; member in struct:__anon137
1636 uint8_t map[5]; member in struct:__anon163
1650 uint8_t map[5]; member in struct:__anon165

Completed in 86 milliseconds