Searched refs:maps (Results 1 - 12 of 12) sorted by relevance

/system/extras/libpagemap/
H A Dpagemap_test.cpp23 TEST(pagemap, maps) {
30 pm_map_t** maps; local
32 ASSERT_EQ(0, pm_process_maps(process, &maps, &num_maps));
37 std::string name(maps[i]->name);
45 free(maps);
H A Dpm_process.c90 error = pm_map_usage_flags(proc->maps[i], &map_usage, flags_mask,
158 pm_map_t **maps; local
164 maps = malloc(proc->num_maps * sizeof(pm_map_t*));
165 if (!maps)
168 memcpy(maps, proc->maps, proc->num_maps * sizeof(pm_map_t*));
170 *maps_out = maps;
198 error = pm_map_workingset(proc->maps[i], &map_ws);
233 pm_map_destroy(proc->maps[i]);
235 free(proc->maps);
251 pm_map_t *map, **maps, **new_maps; local
[all...]
/system/core/libbacktrace/
H A DGetPss.cpp47 FILE* maps = fopen("/proc/self/maps", "r"); local
48 if (maps == nullptr) {
54 fclose(maps);
60 fclose(maps);
68 while (fgets(line, sizeof(line), maps)) {
87 fclose(maps);
H A DBacktraceMap.cpp62 // Linux /proc/<pid>/maps lines:
100 char path[sizeof(pid_t)*3 + sizeof("/proc//maps") + 1];
110 snprintf(path, sizeof(path), "/proc/%d/maps", pid_);
145 BacktraceMap* BacktraceMap::Create(pid_t pid, const std::vector<backtrace_map_t>& maps) { argument
147 backtrace_map->maps_.insert(backtrace_map->maps_.begin(), maps.begin(), maps.end());
/system/extras/ksmutils/
H A Dksminfo.c62 static int read_pages(struct ksm_pages *kp, pm_map_t **maps, size_t num_maps, uint8_t pr_flags);
75 pm_map_t **maps; local
160 error = pm_process_maps(proc, &maps, &num_maps);
168 if (read_pages(&kp, maps, num_maps, pr_flags) < 0) {
169 free(maps);
175 free(maps);
190 static int read_pages(struct ksm_pages *kp, pm_map_t **maps, size_t num_maps, uint8_t pr_flags) { argument
210 pid = pm_process_pid(maps[0]->proc);
211 ker = maps[0]->proc->ker;
231 error = pm_map_pagemap(maps[
[all...]
/system/extras/simpleperf/
H A Dthread_tree.cpp51 std::set<MapEntry*, MapComparator>(), // maps
65 child->maps = parent->maps;
116 FixOverlappedMap(&thread->maps, map);
117 auto pair = thread->maps.insert(map);
139 // No more overlapped maps.
167 static MapEntry* FindMapByAddr(const std::set<MapEntry*, MapComparator>& maps, uint64_t addr) { argument
171 auto it = maps.upper_bound(&find_map);
172 if (it != maps.begin() && IsAddrInMap(addr, *--it)) {
181 result = FindMapByAddr(thread->maps, i
[all...]
H A Ddwarf_unwind.cpp111 std::vector<backtrace_map_t> bt_maps(thread.maps.size());
113 for (auto& map : thread.maps) {
H A Dthread_tree.h56 std::set<MapEntry*, MapComparator> maps; member in struct:simpleperf::ThreadEntry
/system/extras/librank/
H A Dlibrank.c210 pm_map_t **maps; local
343 error = pm_process_maps(proc, &maps, &num_maps);
345 fprintf(stderr, "Error listing maps for process %d.\n", proc->pid);
350 if (prefix && (strncmp(pm_map_name(maps[j]), prefix, prefix_len)))
353 if (perm && (pm_map_flags(maps[j]) & PM_MAP_PERMISSIONS) != perm)
356 li = get_library(pm_map_name(maps[j]), all);
362 error = pm_map_usage_flags(maps[j], &map_usage, flags_mask,
367 pm_map_name(maps[j]), proc->pid);
/system/extras/procmem/
H A Dprocmem.c39 /* qsort compare function to compare maps by PSS */
50 /* maps and such */
51 pm_map_t **maps; size_t num_maps; local
128 /* get maps, and allocate our map_info array */
129 error = pm_process_maps(proc, &maps, &num_maps);
131 fprintf(stderr, "error listing maps.\n");
165 mi->map = maps[i];
310 " -h Hide maps with no RSS.\n",
/system/core/include/backtrace/
H A DBacktraceMap.h52 static BacktraceMap* Create(pid_t pid, const std::vector<backtrace_map_t>& maps);
/system/extras/libpagemap/include/pagemap/
H A Dpagemap.h93 pm_map_t **maps; member in struct:pm_process
198 /* Get the maps in the virtual address space of this process.
199 * Returns an array of pointers to pm_map_t through *maps.
200 * The array should be freed by the caller, but the maps should not be

Completed in 212 milliseconds