git.itanic.dy.fi Git - scan-pagemap/blob - analyze.c

   1 #include <string.h>
   2 #include <stdio.h>
   3
   4 #include "analyze.h"
   5 #include "utils.h"
   6 #include "bintree.h"
   7
   8 #define SI_k    1024ll
   9 #define SI_M    (SI_k * SI_k)
  10 #define SI_G    (SI_M * SI_k)
  11
  12 #define PRETTY_THRESH   100
  13 #define NICE_DIV(a)                                                     \
  14         ((a) < SI_k * PRETTY_THRESH ? (a) :                             \
  15                 (a < SI_M * PRETTY_THRESH ? ((a) / SI_k) :              \
  16                         (a < SI_G * PRETTY_THRESH ? ((a) / SI_M) :      \
  17                                 ((a) / SI_G))))
  18
  19 #define NICE_UNIT(a)                                                    \
  20         ((a) < (SI_k * PRETTY_THRESH) ? " " :                           \
  21                 ((a) < (SI_M * PRETTY_THRESH) ? "k" :                   \
  22                         ((a) < (SI_G * PRETTY_THRESH) ? "M" : "G")))
  23
  24 #define PAGE_TO_NICE(a)         NICE_DIV((long long)a * PAGE_SIZE)
  25 #define PAGE_TO_NICE_UNIT(a)    NICE_UNIT((long long)a * PAGE_SIZE)
  26
  27 struct analyze_frames {
  28         struct bintree_ops ops;
  29         long int pages_present;
  30         long int pages_swapped;
  31         int pid;
  32 };
  33
  34 #define bintree_ops_to_af(bintree_ops)                          \
  35         container_of((bintree_ops), struct analyze_frames, ops)
  36
  37 static void count_pages(struct bintree *b, struct bintree_ops *ops)
  38 {
  39         struct pageframe *pf = tree_to_pageframe(b);
  40         struct analyze_frames *af = bintree_ops_to_af(ops);
  41         struct maps_list *ml;
  42
  43         if (af->pid) {
  44                 if (!pf->ml)
  45                         return;
  46                 if (list_empty(&pf->ml->list)) {
  47                         ml = list_to_maps_list(&pf->ml->list);
  48                         if (ml->map->pid == af->pid)
  49                                 goto get_stats;
  50                 }
  51                 list_for_each_entry(ml, &pf->ml->list, list) {
  52                         if (ml->map->pid == af->pid)
  53                                 goto get_stats;
  54                 }
  55                 return;
  56         }
  57
  58 get_stats:
  59         if (pf->page_present)
  60                 af->pages_present++;
  61         else if (pf->page_swapped)
  62                 af->pages_swapped++;
  63 }
  64
  65 /*
  66  * print_page_stats - Prints system wide page stats
  67  */
  68 void print_page_stats(struct pageframe *pf)
  69 {
  70         struct analyze_frames af;
  71         long count;
  72         memset(&af, 0, sizeof(af));
  73
  74         af.ops.callback = count_pages;
  75
  76         count = bintree_walk(&pf->tree, &af.ops);
  77         printf("present pages: %ld, %lld %sB\n"
  78                 "Swapped pages: %ld, %lld %sB\n"
  79                 "Total %ld physical pages, %lld %sB\n",
  80                 af.pages_present,
  81                 PAGE_TO_NICE(af.pages_present),
  82                 PAGE_TO_NICE_UNIT(af.pages_present),
  83                 af.pages_swapped,
  84                 PAGE_TO_NICE(af.pages_swapped),
  85                 PAGE_TO_NICE_UNIT(af.pages_swapped),
  86                 count,
  87                 PAGE_TO_NICE(count),
  88                 PAGE_TO_NICE_UNIT(count));
  89 }
  90
  91 void print_pid_stats(struct pageframe *pf, struct process *process_list,
  92                 struct parse_opts *opts)
  93 {
  94         struct analyze_frames af;
  95         struct process *ps;
  96         long int swapped, present, total;
  97         long int biggest = 0, second_biggest;
  98         int count, processes = 0;
  99
 100         /*
 101          * walk through all processes, find the one with most present
 102          * pages
 103          */
 104         list_for_each_entry(ps, &process_list->list, list) {
 105                 memset(&af, 0, sizeof(af));
 106                 af.ops.callback = count_pages;
 107                 af.pid = ps->pid;
 108
 109                 bintree_walk(&pf->tree, &af.ops);
 110                 ps->pages_present = af.pages_present;
 111                 ps->pages_swapped = af.pages_swapped;
 112                 biggest = MAX(biggest, ps->pages_present + ps->pages_swapped);
 113         }
 114
 115         printf("   in ram   swapped     total   pid");
 116         if (opts->with_threads)
 117                 printf("   tid");
 118         printf(" name\n");
 119
 120 restart:
 121         second_biggest = 0;
 122         count = 0;
 123         list_for_each_entry(ps, &process_list->list, list) {
 124
 125                 present = ps->pages_present;
 126                 swapped = ps->pages_swapped;
 127                 total = present + swapped;
 128
 129                 second_biggest = (total < biggest) &&
 130                         (second_biggest < total) ?
 131                         total : second_biggest;
 132
 133                 if (total != biggest)
 134                         continue;
 135
 136                 if (total == 0)
 137                         continue;
 138
 139                 printf("%6lld %sB %6lld %sB %6lld %sB %5d ",
 140                         PAGE_TO_NICE(present), PAGE_TO_NICE_UNIT(present),
 141                         PAGE_TO_NICE(swapped), PAGE_TO_NICE_UNIT(swapped),
 142                         PAGE_TO_NICE(total), PAGE_TO_NICE_UNIT(total),
 143                         ps->pid);
 144
 145                 if (opts->with_threads)
 146                         printf("%5d ", ps->tid);
 147
 148                 printf("%s\n", ps->name);
 149
 150                 count++;
 151                 processes++;
 152         }
 153
 154         if (count > 0) {
 155                 biggest = second_biggest;
 156                 goto restart;
 157         }
 158
 159         printf("Total %d processes\n", processes);
 160 }