sandy
/
PL286
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
1 Commit
1 Branch
0 Tags
18 GiB
Tree: 99da0f2c72
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '99da0f2c72'
${ noResults }
PL286/system/extras/showmap/showmap.cpp

369 lines
9.7 KiB
Raw Blame History

#include <ctype.h>
#include <errno.h>
#include <fcntl.h>
#include <math.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
struct mapinfo {
mapinfo *next;
unsigned start;
unsigned end;
unsigned size;
unsigned rss;
unsigned pss;
unsigned shared_clean;
unsigned shared_dirty;
unsigned private_clean;
unsigned private_dirty;
unsigned swap;
unsigned swap_pss;
int is_bss;
int count;
char name[1];
};
static bool verbose = false;
static bool terse = false;
static bool addresses = false;
static bool quiet = false;
static int is_library(const char *name) {
int len = strlen(name);
return len >= 4 && name[0] == '/'
&& name[len - 3] == '.' && name[len - 2] == 's' && name[len - 1] == 'o';
}
// 6f000000-6f01e000 rwxp 00000000 00:0c 16389419 /android/lib/libcomposer.so
// 012345678901234567890123456789012345678901234567890123456789
// 0 1 2 3 4 5
static int parse_header(const char* line, const mapinfo* prev, mapinfo** mi) {
unsigned long start;
unsigned long end;
char name[128];
int name_pos;
int is_bss = 0;
if (sscanf(line, "%lx-%lx %*s %*x %*x:%*x %*d%n", &start, &end, &name_pos) != 2) {
*mi = NULL;
return -1;
}
while (isspace(line[name_pos])) {
name_pos += 1;
}
if (line[name_pos]) {
strlcpy(name, line + name_pos, sizeof(name));
} else {
if (prev && start == prev->end && is_library(prev->name)) {
// anonymous mappings immediately adjacent to shared libraries
// usually correspond to the library BSS segment, so we use the
// library's own name
strlcpy(name, prev->name, sizeof(name));
is_bss = 1;
} else {
strlcpy(name, "[anon]", sizeof(name));
}
}
const int name_size = strlen(name) + 1;
struct mapinfo* info = reinterpret_cast<mapinfo*>(calloc(1, sizeof(mapinfo) + name_size));
if (info == NULL) {
fprintf(stderr, "out of memory\n");
exit(1);
}
info->start = start;
info->end = end;
info->is_bss = is_bss;
info->count = 1;
strlcpy(info->name, name, name_size);
*mi = info;
return 0;
}
static int parse_field(mapinfo* mi, const char* line) {
char field[64];
int len;
if (sscanf(line, "%63s %n", field, &len) == 1
&& *field && field[strlen(field) - 1] == ':') {
int size;
if (sscanf(line + len, "%d kB", &size) == 1) {
if (!strcmp(field, "Size:")) {
mi->size = size;
} else if (!strcmp(field, "Rss:")) {
mi->rss = size;
} else if (!strcmp(field, "Pss:")) {
mi->pss = size;
} else if (!strcmp(field, "Shared_Clean:")) {
mi->shared_clean = size;
} else if (!strcmp(field, "Shared_Dirty:")) {
mi->shared_dirty = size;
} else if (!strcmp(field, "Private_Clean:")) {
mi->private_clean = size;
} else if (!strcmp(field, "Private_Dirty:")) {
mi->private_dirty = size;
} else if (!strcmp(field, "Swap:")) {
mi->swap = size;
} else if (!strcmp(field, "SwapPss:")) {
mi->swap_pss = size;
}
}
return 0;
}
return -1;
}
static int order_before(const mapinfo *a, const mapinfo *b, int sort_by_address) {
if (sort_by_address) {
return a->start < b->start
|| (a->start == b->start && a->end < b->end);
} else {
return strcmp(a->name, b->name) < 0;
}
}
static void enqueue_map(mapinfo **head, mapinfo *map, int sort_by_address, int coalesce_by_name) {
mapinfo *prev = NULL;
mapinfo *current = *head;
if (!map) {
return;
}
for (;;) {
if (current && coalesce_by_name && !strcmp(map->name, current->name)) {
current->size += map->size;
current->rss += map->rss;
current->pss += map->pss;
current->shared_clean += map->shared_clean;
current->shared_dirty += map->shared_dirty;
current->private_clean += map->private_clean;
current->private_dirty += map->private_dirty;
current->swap += map->swap;
current->swap_pss += map->swap_pss;
current->is_bss &= map->is_bss;
current->count++;
free(map);
break;
}
if (!current || order_before(map, current, sort_by_address)) {
if (prev) {
prev->next = map;
} else {
*head = map;
}
map->next = current;
break;
}
prev = current;
current = current->next;
}
}
static mapinfo *load_maps(int pid, int sort_by_address, int coalesce_by_name)
{
char fn[128];
FILE *fp;
char line[1024];
mapinfo *head = NULL;
mapinfo *current = NULL;
int len;
snprintf(fn, sizeof(fn), "/proc/%d/smaps", pid);
fp = fopen(fn, "r");
if (fp == 0) {
if (!quiet) fprintf(stderr, "cannot open /proc/%d/smaps: %s\n", pid, strerror(errno));
return NULL;
}
while (fgets(line, sizeof(line), fp) != 0) {
len = strlen(line);
if (line[len - 1] == '\n') {
line[--len] = 0;
}
if (current != NULL && !parse_field(current, line)) {
continue;
}
mapinfo *next;
if (!parse_header(line, current, &next)) {
enqueue_map(&head, current, sort_by_address, coalesce_by_name);
current = next;
continue;
}
fprintf(stderr, "warning: could not parse map info line: %s\n", line);
}
enqueue_map(&head, current, sort_by_address, coalesce_by_name);
fclose(fp);
if (!head) {
if (!quiet) fprintf(stderr, "could not read /proc/%d/smaps\n", pid);
return NULL;
}
return head;
}
static void print_header()
{
const char *addr1 = addresses ? " start end " : "";
const char *addr2 = addresses ? " addr addr " : "";
printf("%s virtual shared shared private private\n", addr1);
printf("%s size RSS PSS clean dirty clean dirty swap swapPSS", addr2);
if (!verbose && !addresses) {
printf(" # ");
}
printf("object\n");
}
static void print_divider()
{
if (addresses) {
printf("-------- -------- ");
}
printf("-------- -------- -------- -------- -------- -------- -------- -------- -------- ");
if (!verbose && !addresses) {
printf("---- ");
}
printf("------------------------------\n");
}
static void print_mi(mapinfo *mi, bool total)
{
if (addresses) {
if (total) {
printf(" ");
} else {
printf("%08x %08x ", mi->start, mi->end);
}
}
printf("%8d %8d %8d %8d %8d %8d %8d %8d %8d ", mi->size,
mi->rss,
mi->pss,
mi->shared_clean, mi->shared_dirty,
mi->private_clean, mi->private_dirty, mi->swap, mi->swap_pss);
if (!verbose && !addresses) {
printf("%4d ", mi->count);
}
}
static int show_map(int pid)
{
mapinfo total;
memset(&total, 0, sizeof(total));
mapinfo *milist = load_maps(pid, addresses, !verbose && !addresses);
if (milist == NULL) {
return quiet ? 0 : 1;
}
print_header();
print_divider();
for (mapinfo *mi = milist; mi;) {
mapinfo* last = mi;
total.shared_clean += mi->shared_clean;
total.shared_dirty += mi->shared_dirty;
total.private_clean += mi->private_clean;
total.private_dirty += mi->private_dirty;
total.swap += mi->swap;
total.swap_pss += mi->swap_pss;
total.rss += mi->rss;
total.pss += mi->pss;
total.size += mi->size;
total.count += mi->count;
if (terse && !mi->private_dirty) {
goto out;
}
print_mi(mi, false);
printf("%s%s\n", mi->name, mi->is_bss ? " [bss]" : "");
out:
mi = mi->next;
free(last);
}
print_divider();
print_header();
print_divider();
print_mi(&total, true);
printf("TOTAL\n");
return 0;
}
int main(int argc, char *argv[])
{
int usage = 1;
int result = 0;
int pid;
char *arg;
char *argend;
signal(SIGPIPE, SIG_IGN);
for (argc--, argv++; argc > 0; argc--, argv++) {
arg = argv[0];
if (!strcmp(arg,"-v")) {
verbose = true;
continue;
}
if (!strcmp(arg,"-t")) {
terse = true;
continue;
}
if (!strcmp(arg,"-a")) {
addresses = true;
continue;
}
if (!strcmp(arg,"-q")) {
quiet = true;
continue;
}
if (argc != 1) {
fprintf(stderr, "too many arguments\n");
break;
}
pid = strtol(arg, &argend, 10);
if (*arg && !*argend) {
usage = 0;
if (show_map(pid)) {
result = 1;
}
break;
}
fprintf(stderr, "unrecognized argument: %s\n", arg);
break;
}
if (usage) {
fprintf(stderr,
"showmap [-t] [-v] [-c] [-q] <pid>\n"
" -t = terse (show only items with private pages)\n"
" -v = verbose (don't coalesce maps with the same name)\n"
" -a = addresses (show virtual memory map)\n"
" -q = quiet (don't show error if map could not be read)\n"
);
result = 1;
}
return result;
}