Searched defs:maps (Results 1 - 20 of 20) 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)) {
88 fclose(maps);
H A DUnwindStackMap.cpp56 // Iterate through the maps and fill in the backtrace_map_t structure.
101 unwindstack::Maps* maps = stack_maps(); local
104 unwindstack::MapInfo* map_info = maps->Find(pc);
138 unwindstack::Maps* maps = new unwindstack::Maps; local
139 stack_maps_.reset(maps);
141 maps->Add(map.start, map.end, map.offset, map.flags, map.name, map.load_bias);
168 // Force use of the base class to parse the maps when this call is made.
185 BacktraceMap* BacktraceMap::CreateOffline(pid_t pid, const std::vector<backtrace_map_t>& maps) { argument
187 if (!map->Build(maps)) {
H A Dbacktrace_benchmarks.cpp45 // gets allocated, then this routine will add extra maps and the next
46 // call will fail to get the same number of maps as before.
48 open((std::string("/proc/") + std::to_string(pid) + "/maps").c_str(), O_RDONLY | O_CLOEXEC);
74 // Also, so that we can create a set number of maps.
81 // Create uniquely named maps.
82 std::vector<void*> maps; local
99 maps.push_back(memory);
110 android::base::ReadFileToString("/proc/self/maps", &str);
131 fprintf(stderr, "Timed out waiting for the number of maps available: %zu\n", num_maps);
H A DUnwindStack.cpp241 const std::vector<backtrace_map_t>& maps,
244 reinterpret_cast<UnwindStackOfflineMap*>(BacktraceMap::CreateOffline(pid, maps)));
240 CreateOffline(ArchEnum arch, pid_t pid, pid_t tid, const std::vector<backtrace_map_t>& maps, const backtrace_stackinfo_t& stack) argument
H A Dbacktrace_offline_test.cpp146 // 2. Dump maps
193 std::vector<backtrace_map_t> maps; member in struct:OfflineTestData
211 testdata->maps.resize(testdata->maps.size() + 1);
212 backtrace_map_t& map = testdata->maps.back();
254 for (auto& map : testdata.maps) {
274 arch, testdata.pid, testdata.tid, testdata.maps, testdata.stack_info));
337 for (auto& map : testdata.maps) {
359 arch, testdata.pid, testdata.tid, testdata.maps, testdata.stack_info));
H A Dbacktrace_test.cpp754 // multiple maps are created for the current process at the same time.
907 static std::string GetTestMapsAsString(const std::vector<map_test_t>& maps) { argument
908 if (maps.size() == 0) {
912 for (auto map : maps) {
918 static std::string GetMapsAsString(BacktraceMap* maps) { argument
919 if (maps->size() == 0) {
923 for (const backtrace_map_t* map : *maps) {
937 snprintf(buffer, sizeof(buffer), "/proc/%d/maps", pid);
955 ASSERT_TRUE(test_it != test_maps.end()) << "Mismatch in number of maps, expected test maps
[all...]
/system/core/libunwindstack/tests/
H A DMapsTest.cpp30 BufferMaps maps(line.c_str());
33 ASSERT_FALSE(maps.Parse()) << "Failed on: " + line;
35 ASSERT_TRUE(maps.Parse()) << "Failed on: " + line;
36 MapInfo* element = maps.Get(0);
48 Maps maps; local
50 maps.Add(0x1000, 0x2000, 0, PROT_READ, "fake_map", 0);
51 maps.Add(0x3000, 0x4000, 0x10, 0, "", 0x1234);
52 maps.Add(0x5000, 0x6000, 1, 2, "fake_map2", static_cast<uint64_t>(-1));
54 ASSERT_EQ(3U, maps.Total());
55 MapInfo* info = maps
[all...]
H A DUnwindTest.cpp102 static void VerifyUnwind(pid_t pid, Maps* maps, Regs* regs, argument
106 Unwinder unwinder(512, maps, regs, process_memory);
129 LocalMaps maps; local
130 ASSERT_TRUE(maps.Parse());
134 VerifyUnwind(getpid(), &maps, regs.get(), kFunctionOrder); local
206 RemoteMaps maps(pid);
207 ASSERT_TRUE(maps.Parse());
211 VerifyUnwind(pid, &maps, regs.get(), kFunctionOrder);
251 LocalMaps maps; local
252 ASSERT_TRUE(maps
255 VerifyUnwind(getpid(), &maps, regs.get(), kFunctionOrder); local
319 LocalMaps maps; local
[all...]
/system/core/libunwindstack/
H A DDexFiles.cpp120 void DexFiles::Init(Maps* maps) { argument
128 for (MapInfo* info : *maps) {
184 void DexFiles::GetMethodInformation(Maps* maps, MapInfo* info, uint64_t dex_pc, argument
188 Init(maps);
H A DJitDebug.cpp168 void JitDebug::Init(Maps* maps) { argument
176 for (MapInfo* info : *maps) {
208 Elf* JitDebug::GetElf(Maps* maps, uint64_t pc) { argument
213 Init(maps);
/system/core/libunwindstack/include/unwindstack/
H A DUnwinder.h60 Unwinder(size_t max_frames, Maps* maps, Regs* regs, std::shared_ptr<Memory> process_memory) argument
61 : max_frames_(max_frames), maps_(maps), regs_(regs), process_memory_(process_memory) {
/system/extras/simpleperf/
H A Dthread_tree.h63 std::set<MapEntry*, MapComparator> maps; member in struct:simpleperf::MapSet
64 uint64_t version = 0u; // incremented each time changing maps
71 MapSet* maps; member in struct:simpleperf::ThreadEntry
132 void FixOverlappedMap(MapSet* maps, const MapEntry* map);
H A Dinplace_sampler_lib.cpp264 std::vector<ThreadMmap> maps; local
265 if (!GetThreadMmapsInProcess(getpid(), &maps)) {
268 // Check new maps or changed maps.
269 for (auto& map : maps) {
H A Dthread_tree.cpp62 // Copy maps from parent process.
63 *child->maps = *parent->maps;
83 MapSet* maps = nullptr; local
85 maps = new MapSet;
86 map_set_storage_.push_back(std::unique_ptr<MapSet>(maps));
88 // Share maps among threads in the same thread group.
90 maps = process->maps;
95 maps,
158 FixOverlappedMap(MapSet* maps, const MapEntry* map) argument
191 FindMapByAddr(const MapSet& maps, uint64_t addr) argument
[all...]
/system/extras/libpagemap/include/pagemap/
H A Dpagemap.h95 pm_map_t **maps; member in struct:pm_process
172 /* Get the maps in the virtual address space of this process.
173 * Returns an array of pointers to pm_map_t through *maps.
174 * The array should be freed by the caller, but the maps should not be
/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/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/librank/
H A Dlibrank.c209 pm_map_t **maps; local
342 error = pm_process_maps(proc, &maps, &num_maps);
344 fprintf(stderr, "Error listing maps for process %d.\n", proc->pid);
349 if (prefix && (strncmp(pm_map_name(maps[j]), prefix, prefix_len)))
352 if (perm && (pm_map_flags(maps[j]) & PM_MAP_PERMISSIONS) != perm)
355 li = get_library(pm_map_name(maps[j]), all);
361 error = pm_map_usage_flags(maps[j], &map_usage, flags_mask,
366 pm_map_name(maps[j]), proc->pid);

Completed in 278 milliseconds