]> git.itanic.dy.fi Git - scan-pagemap/blob - parse.c
parser: Fix crash when maps structure is NULL
[scan-pagemap] / parse.c
1 #include <sys/types.h>
2 #include <dirent.h>
3 #include <stdio.h>
4 #include <stdlib.h>
5 #include <string.h>
6 #include <errno.h>
7
8 #include "parse.h"
9 #include "pagemap.h"
10
11 static struct maps_list *alloc_maplist(void)
12 {
13         struct maps_list *map;
14
15         map = malloc(sizeof *map);
16         if (map == NULL)
17                 goto err;
18
19         memset(map, 0, sizeof(*map));
20         INIT_LIST_HEAD(&map->list);
21 err:
22         return map;
23 }
24
25 static struct maps *alloc_map(void)
26 {
27         struct maps *map;
28
29         map = malloc(sizeof *map);
30         if (map == NULL)
31                 goto err;
32
33         memset(map, 0, sizeof(*map));
34         INIT_LIST_HEAD(&map->list);
35 err:
36         return map;
37 }
38
39 static struct maps *parse_maps(FILE *file, int pid)
40 {
41         struct maps *the_map = NULL;
42         char line[1024];
43         int ret;
44
45         while(fgets(line, sizeof(line), file)) {
46                 struct maps *map = alloc_map();
47                 unsigned long start, end;
48                 char name[1024];
49
50                 if (map == NULL)
51                         return 0;
52
53                 if (the_map == NULL)
54                         the_map = map;
55
56                 ret = sscanf(line, "%lx-%lx %*s %*s %*s %*s %s",
57                              &start, &end, name);
58
59                 if (ret < 2) {
60                         printf("Error reading input: %s\n", line);
61                         break;
62                 }
63
64                 map->start = start;
65                 map->end = end;
66                 map->size = end - start;
67                 map->pid = pid;
68
69                 if (ret >= 3)
70                         strncpy(map->name, name, sizeof(map->name));
71
72                 list_add_tail(&map->list, &the_map->list);
73         }
74
75         return the_map;
76 }
77
78 static void clear_pageframe(struct pageframe *pf)
79 {
80         memset(pf, 0, sizeof(*pf));
81 }
82
83 static struct pageframe *alloc_pageframe(void)
84 {
85         struct pageframe *pageframe;
86
87         pageframe = malloc(sizeof *pageframe);
88         if (pageframe == NULL)
89                 goto err;
90
91         clear_pageframe(pageframe);
92 err:
93         return pageframe;
94 }
95
96 #define BITRANGE(first, last) (((2ll << (last - first)) - 1) << first)
97
98 static void pageframe_to_struct(unsigned long long p, struct pageframe *pf)
99 {
100         pf->page_present = !!(BITRANGE(63, 63) & p);
101         pf->page_swapped = !!(BITRANGE(62, 62) & p);
102         pf->page_shift   =   (BITRANGE(55, 60) & p) >> 55;
103         pf->pfn          =   (BITRANGE(0, 54) & p);
104         pf->swap_type    =   (BITRANGE(0, 4) & p);
105         pf->swap_offset  =   (BITRANGE(5, 54) & p) >> 5;
106 #if 0
107         printf("pfn: %lx shift: %d present: %d swapped %d\n",
108                 pf->pfn, pf->page_shift, pf->page_present, pf->page_swapped);
109 #endif
110 }
111
112 static int compare_pageframe(struct bintree *at, struct bintree *bt)
113 {
114         struct pageframe *a, *b;
115         a = tree_to_pageframe(at);
116         b = tree_to_pageframe(bt);
117
118         return a->pfn - b->pfn;
119 }
120
121 struct bintree_ops pageframe_ops = {
122         .compare = compare_pageframe,
123 };
124
125 /* Read data from the /proc/pid/pagemap file */
126 static int parse_pageframe(FILE *file, struct pageframe *pf_tree,
127                         struct maps *maps, int add_to_tree)
128 {
129         struct maps *map;
130         struct maps_list *tmp;
131         struct pageframe *match, *pageframe = NULL;
132         long start, len, i;
133         unsigned long long pf;
134         int ret, error;
135
136         if (maps == NULL)
137                 return 0;
138
139         /* Go through the list of allocated memory areas */
140         list_for_each_entry(map, &maps->list, list) {
141                 start = map->start >> (PAGE_SHIFT - 3);
142                 len = map->size >> (PAGE_SHIFT - 3);
143
144                 ret = fseek(file, start, SEEK_SET);
145                 if (ret) {
146                         error = errno;
147                         fprintf(stderr, "Error seeking to %lx: %s\n", start,
148                                 strerror(error));
149                         continue;
150                 }
151
152                 for (i = 0; i < len; i++) {
153                         ret = fread(&pf, 1, sizeof(pf), file);
154                         if (ret != sizeof(pf)) {
155                                 error = errno;
156                                 continue;
157                         }
158                         if (!pageframe)
159                                 pageframe = alloc_pageframe();
160
161                         pageframe_to_struct(pf, pageframe);
162
163                         if (add_to_tree) {
164                                 match = tree_to_pageframe(
165                                         bintree_add(&pf_tree->tree,
166                                                 &pageframe->tree,
167                                                 &pageframe_ops));
168                         } else {
169                                 match = tree_to_pageframe(
170                                         bintree_find(&pf_tree->tree,
171                                                 &pageframe->tree,
172                                                 &pageframe_ops));
173                         }
174
175                         if (match == NULL)
176                                 continue;
177
178                         if (match == pageframe)
179                                 pageframe = NULL;
180
181                         match->refcount++;
182                         /*
183                          * Add a link from the physical page to this
184                          * process's page map
185                          */
186                         if (!match->ml) {
187                                 match->ml = alloc_maplist();
188                                 match->ml->map = map;
189                         } else {
190                                 tmp = alloc_maplist();
191                                 tmp->map = map;
192                                 list_add(&match->ml->list, &tmp->list);
193                         }
194
195                         if (match->page_present) {
196                                 map->pages_present++;
197                         } else if (match->page_swapped) {
198                                 map->pages_swapped++;
199                         }
200                 }
201         }
202
203         return 0;
204 }
205
206 void read_pageframe(int pid, struct pageframe *pageframe,
207                 struct process **process_list, int add_to_tree)
208 {
209         struct maps *maps;
210         struct process *process;
211         FILE *file;
212         char path[512];
213         int ret;
214
215         process = malloc(sizeof(*process));
216         memset(process, 0, sizeof(*process));
217         INIT_LIST_HEAD(&process->list);
218
219         if (*process_list == NULL)
220                 *process_list = process;
221
222         process->pid = pid;
223
224         list_add_tail(&process->list, &(*process_list)->list);
225
226         snprintf(path, sizeof(path), "/proc/%d/maps", pid);
227         file = fopen(path, "rb");
228
229         if (!file)
230                 return;
231
232         maps = parse_maps(file, pid);
233         fclose(file);
234         process->maps = maps;
235
236         snprintf(path, sizeof(path), "/proc/%d/pagemap", pid);
237         file = fopen(path, "rb");
238
239         if (!file)
240                 return;
241
242         parse_pageframe(file, pageframe, maps, add_to_tree);
243         fclose(file);
244
245         snprintf(path, sizeof(path), "/proc/%d/cmdline", pid);
246         file = fopen(path, "rb");
247
248         if (!file)
249                 return;
250
251         ret = fread(process->name, 1, sizeof(process->name), file);
252         if (ret > 0)
253                 process->name[ret - 1] = 0;
254         fclose(file);
255
256         if (maps == NULL)
257                 return;
258
259         list_for_each_entry(maps, &process->maps->list, list) {
260                 process->pages_present += maps->pages_present;
261                 process->pages_swapped += maps->pages_swapped;
262         }
263
264         return;
265 }
266
267 static int get_next_pid(void)
268 {
269         static DIR *dir = NULL;
270         struct dirent *dirent;
271         int error;
272
273         if (!dir) {
274                 dir = opendir("/proc");
275                 if (!dir) {
276                         error = errno;
277                         printf("Failed to open /proc directory: %s\n",
278                                 strerror(error));
279                         return -1;
280                 }
281         }
282
283 restart:
284         dirent = readdir(dir);
285         if (!dirent) {
286                 if (errno == 0) {
287                         closedir(dir);
288                         dir = NULL;
289                         return 0;
290                 }
291                 error = errno;
292                 printf("Failed to read /proc directory: %s\n", strerror(error));
293                 return -1;
294         }
295
296         printf("%s\n", dirent->d_name);
297         if (dirent->d_name[0] < '0' || dirent->d_name[0] > '9')
298                 goto restart;
299
300         return atoi(dirent->d_name);
301 }
302
303 void scan_all_pids(struct pageframe *pf, struct process **process_list,
304                 int interesting_pid)
305 {
306         int pid;
307
308         read_pageframe(interesting_pid, pf, process_list, 1);
309
310         while(1) {
311                 pid = get_next_pid();
312                 if (pid <= 0)
313                         break;
314                 read_pageframe(pid, pf, process_list, 0);
315         }
316 }