page-types.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858
  1. /*
  2. * page-types: Tool for querying page flags
  3. *
  4. * Copyright (C) 2009 Intel corporation
  5. * Copyright (C) 2009 Wu Fengguang <fengguang.wu@intel.com>
  6. */
  7. #define _LARGEFILE64_SOURCE
  8. #include <stdio.h>
  9. #include <stdlib.h>
  10. #include <unistd.h>
  11. #include <stdint.h>
  12. #include <stdarg.h>
  13. #include <string.h>
  14. #include <getopt.h>
  15. #include <limits.h>
  16. #include <assert.h>
  17. #include <sys/types.h>
  18. #include <sys/errno.h>
  19. #include <sys/fcntl.h>
  20. /*
  21. * pagemap kernel ABI bits
  22. */
  23. #define PM_ENTRY_BYTES sizeof(uint64_t)
  24. #define PM_STATUS_BITS 3
  25. #define PM_STATUS_OFFSET (64 - PM_STATUS_BITS)
  26. #define PM_STATUS_MASK (((1LL << PM_STATUS_BITS) - 1) << PM_STATUS_OFFSET)
  27. #define PM_STATUS(nr) (((nr) << PM_STATUS_OFFSET) & PM_STATUS_MASK)
  28. #define PM_PSHIFT_BITS 6
  29. #define PM_PSHIFT_OFFSET (PM_STATUS_OFFSET - PM_PSHIFT_BITS)
  30. #define PM_PSHIFT_MASK (((1LL << PM_PSHIFT_BITS) - 1) << PM_PSHIFT_OFFSET)
  31. #define PM_PSHIFT(x) (((u64) (x) << PM_PSHIFT_OFFSET) & PM_PSHIFT_MASK)
  32. #define PM_PFRAME_MASK ((1LL << PM_PSHIFT_OFFSET) - 1)
  33. #define PM_PFRAME(x) ((x) & PM_PFRAME_MASK)
  34. #define PM_PRESENT PM_STATUS(4LL)
  35. #define PM_SWAP PM_STATUS(2LL)
  36. /*
  37. * kernel page flags
  38. */
  39. #define KPF_BYTES 8
  40. #define PROC_KPAGEFLAGS "/proc/kpageflags"
  41. /* copied from kpageflags_read() */
  42. #define KPF_LOCKED 0
  43. #define KPF_ERROR 1
  44. #define KPF_REFERENCED 2
  45. #define KPF_UPTODATE 3
  46. #define KPF_DIRTY 4
  47. #define KPF_LRU 5
  48. #define KPF_ACTIVE 6
  49. #define KPF_SLAB 7
  50. #define KPF_WRITEBACK 8
  51. #define KPF_RECLAIM 9
  52. #define KPF_BUDDY 10
  53. /* [11-20] new additions in 2.6.31 */
  54. #define KPF_MMAP 11
  55. #define KPF_ANON 12
  56. #define KPF_SWAPCACHE 13
  57. #define KPF_SWAPBACKED 14
  58. #define KPF_COMPOUND_HEAD 15
  59. #define KPF_COMPOUND_TAIL 16
  60. #define KPF_HUGE 17
  61. #define KPF_UNEVICTABLE 18
  62. #define KPF_NOPAGE 20
  63. /* [32-] kernel hacking assistances */
  64. #define KPF_RESERVED 32
  65. #define KPF_MLOCKED 33
  66. #define KPF_MAPPEDTODISK 34
  67. #define KPF_PRIVATE 35
  68. #define KPF_PRIVATE_2 36
  69. #define KPF_OWNER_PRIVATE 37
  70. #define KPF_ARCH 38
  71. #define KPF_UNCACHED 39
  72. /* [48-] take some arbitrary free slots for expanding overloaded flags
  73. * not part of kernel API
  74. */
  75. #define KPF_READAHEAD 48
  76. #define KPF_SLOB_FREE 49
  77. #define KPF_SLUB_FROZEN 50
  78. #define KPF_SLUB_DEBUG 51
  79. #define KPF_ALL_BITS ((uint64_t)~0ULL)
  80. #define KPF_HACKERS_BITS (0xffffULL << 32)
  81. #define KPF_OVERLOADED_BITS (0xffffULL << 48)
  82. #define BIT(name) (1ULL << KPF_##name)
  83. #define BITS_COMPOUND (BIT(COMPOUND_HEAD) | BIT(COMPOUND_TAIL))
  84. static char *page_flag_names[] = {
  85. [KPF_LOCKED] = "L:locked",
  86. [KPF_ERROR] = "E:error",
  87. [KPF_REFERENCED] = "R:referenced",
  88. [KPF_UPTODATE] = "U:uptodate",
  89. [KPF_DIRTY] = "D:dirty",
  90. [KPF_LRU] = "l:lru",
  91. [KPF_ACTIVE] = "A:active",
  92. [KPF_SLAB] = "S:slab",
  93. [KPF_WRITEBACK] = "W:writeback",
  94. [KPF_RECLAIM] = "I:reclaim",
  95. [KPF_BUDDY] = "B:buddy",
  96. [KPF_MMAP] = "M:mmap",
  97. [KPF_ANON] = "a:anonymous",
  98. [KPF_SWAPCACHE] = "s:swapcache",
  99. [KPF_SWAPBACKED] = "b:swapbacked",
  100. [KPF_COMPOUND_HEAD] = "H:compound_head",
  101. [KPF_COMPOUND_TAIL] = "T:compound_tail",
  102. [KPF_HUGE] = "G:huge",
  103. [KPF_UNEVICTABLE] = "u:unevictable",
  104. [KPF_NOPAGE] = "n:nopage",
  105. [KPF_RESERVED] = "r:reserved",
  106. [KPF_MLOCKED] = "m:mlocked",
  107. [KPF_MAPPEDTODISK] = "d:mappedtodisk",
  108. [KPF_PRIVATE] = "P:private",
  109. [KPF_PRIVATE_2] = "p:private_2",
  110. [KPF_OWNER_PRIVATE] = "O:owner_private",
  111. [KPF_ARCH] = "h:arch",
  112. [KPF_UNCACHED] = "c:uncached",
  113. [KPF_READAHEAD] = "I:readahead",
  114. [KPF_SLOB_FREE] = "P:slob_free",
  115. [KPF_SLUB_FROZEN] = "A:slub_frozen",
  116. [KPF_SLUB_DEBUG] = "E:slub_debug",
  117. };
  118. /*
  119. * data structures
  120. */
  121. static int opt_raw; /* for kernel developers */
  122. static int opt_list; /* list pages (in ranges) */
  123. static int opt_no_summary; /* don't show summary */
  124. static pid_t opt_pid; /* process to walk */
  125. #define MAX_ADDR_RANGES 1024
  126. static int nr_addr_ranges;
  127. static unsigned long opt_offset[MAX_ADDR_RANGES];
  128. static unsigned long opt_size[MAX_ADDR_RANGES];
  129. #define MAX_VMAS 10240
  130. static int nr_vmas;
  131. static unsigned long pg_start[MAX_VMAS];
  132. static unsigned long pg_end[MAX_VMAS];
  133. static unsigned long voffset;
  134. static int pagemap_fd;
  135. #define MAX_BIT_FILTERS 64
  136. static int nr_bit_filters;
  137. static uint64_t opt_mask[MAX_BIT_FILTERS];
  138. static uint64_t opt_bits[MAX_BIT_FILTERS];
  139. static int page_size;
  140. #define PAGES_BATCH (64 << 10) /* 64k pages */
  141. static int kpageflags_fd;
  142. #define HASH_SHIFT 13
  143. #define HASH_SIZE (1 << HASH_SHIFT)
  144. #define HASH_MASK (HASH_SIZE - 1)
  145. #define HASH_KEY(flags) (flags & HASH_MASK)
  146. static unsigned long total_pages;
  147. static unsigned long nr_pages[HASH_SIZE];
  148. static uint64_t page_flags[HASH_SIZE];
  149. /*
  150. * helper functions
  151. */
  152. #define ARRAY_SIZE(x) (sizeof(x) / sizeof((x)[0]))
  153. #define min_t(type, x, y) ({ \
  154. type __min1 = (x); \
  155. type __min2 = (y); \
  156. __min1 < __min2 ? __min1 : __min2; })
  157. #define max_t(type, x, y) ({ \
  158. type __max1 = (x); \
  159. type __max2 = (y); \
  160. __max1 > __max2 ? __max1 : __max2; })
  161. static unsigned long pages2mb(unsigned long pages)
  162. {
  163. return (pages * page_size) >> 20;
  164. }
  165. static void fatal(const char *x, ...)
  166. {
  167. va_list ap;
  168. va_start(ap, x);
  169. vfprintf(stderr, x, ap);
  170. va_end(ap);
  171. exit(EXIT_FAILURE);
  172. }
  173. /*
  174. * page flag names
  175. */
  176. static char *page_flag_name(uint64_t flags)
  177. {
  178. static char buf[65];
  179. int present;
  180. int i, j;
  181. for (i = 0, j = 0; i < ARRAY_SIZE(page_flag_names); i++) {
  182. present = (flags >> i) & 1;
  183. if (!page_flag_names[i]) {
  184. if (present)
  185. fatal("unkown flag bit %d\n", i);
  186. continue;
  187. }
  188. buf[j++] = present ? page_flag_names[i][0] : '_';
  189. }
  190. return buf;
  191. }
  192. static char *page_flag_longname(uint64_t flags)
  193. {
  194. static char buf[1024];
  195. int i, n;
  196. for (i = 0, n = 0; i < ARRAY_SIZE(page_flag_names); i++) {
  197. if (!page_flag_names[i])
  198. continue;
  199. if ((flags >> i) & 1)
  200. n += snprintf(buf + n, sizeof(buf) - n, "%s,",
  201. page_flag_names[i] + 2);
  202. }
  203. if (n)
  204. n--;
  205. buf[n] = '\0';
  206. return buf;
  207. }
  208. /*
  209. * page list and summary
  210. */
  211. static void show_page_range(unsigned long offset, uint64_t flags)
  212. {
  213. static uint64_t flags0;
  214. static unsigned long voff;
  215. static unsigned long index;
  216. static unsigned long count;
  217. if (flags == flags0 && offset == index + count &&
  218. (!opt_pid || voffset == voff + count)) {
  219. count++;
  220. return;
  221. }
  222. if (count) {
  223. if (opt_pid)
  224. printf("%lx\t", voff);
  225. printf("%lx\t%lx\t%s\n",
  226. index, count, page_flag_name(flags0));
  227. }
  228. flags0 = flags;
  229. index = offset;
  230. voff = voffset;
  231. count = 1;
  232. }
  233. static void show_page(unsigned long offset, uint64_t flags)
  234. {
  235. if (opt_pid)
  236. printf("%lx\t", voffset);
  237. printf("%lx\t%s\n", offset, page_flag_name(flags));
  238. }
  239. static void show_summary(void)
  240. {
  241. int i;
  242. printf(" flags\tpage-count MB"
  243. " symbolic-flags\t\t\tlong-symbolic-flags\n");
  244. for (i = 0; i < ARRAY_SIZE(nr_pages); i++) {
  245. if (nr_pages[i])
  246. printf("0x%016llx\t%10lu %8lu %s\t%s\n",
  247. (unsigned long long)page_flags[i],
  248. nr_pages[i],
  249. pages2mb(nr_pages[i]),
  250. page_flag_name(page_flags[i]),
  251. page_flag_longname(page_flags[i]));
  252. }
  253. printf(" total\t%10lu %8lu\n",
  254. total_pages, pages2mb(total_pages));
  255. }
  256. /*
  257. * page flag filters
  258. */
  259. static int bit_mask_ok(uint64_t flags)
  260. {
  261. int i;
  262. for (i = 0; i < nr_bit_filters; i++) {
  263. if (opt_bits[i] == KPF_ALL_BITS) {
  264. if ((flags & opt_mask[i]) == 0)
  265. return 0;
  266. } else {
  267. if ((flags & opt_mask[i]) != opt_bits[i])
  268. return 0;
  269. }
  270. }
  271. return 1;
  272. }
  273. static uint64_t expand_overloaded_flags(uint64_t flags)
  274. {
  275. /* SLOB/SLUB overload several page flags */
  276. if (flags & BIT(SLAB)) {
  277. if (flags & BIT(PRIVATE))
  278. flags ^= BIT(PRIVATE) | BIT(SLOB_FREE);
  279. if (flags & BIT(ACTIVE))
  280. flags ^= BIT(ACTIVE) | BIT(SLUB_FROZEN);
  281. if (flags & BIT(ERROR))
  282. flags ^= BIT(ERROR) | BIT(SLUB_DEBUG);
  283. }
  284. /* PG_reclaim is overloaded as PG_readahead in the read path */
  285. if ((flags & (BIT(RECLAIM) | BIT(WRITEBACK))) == BIT(RECLAIM))
  286. flags ^= BIT(RECLAIM) | BIT(READAHEAD);
  287. return flags;
  288. }
  289. static uint64_t well_known_flags(uint64_t flags)
  290. {
  291. /* hide flags intended only for kernel hacker */
  292. flags &= ~KPF_HACKERS_BITS;
  293. /* hide non-hugeTLB compound pages */
  294. if ((flags & BITS_COMPOUND) && !(flags & BIT(HUGE)))
  295. flags &= ~BITS_COMPOUND;
  296. return flags;
  297. }
  298. /*
  299. * page frame walker
  300. */
  301. static int hash_slot(uint64_t flags)
  302. {
  303. int k = HASH_KEY(flags);
  304. int i;
  305. /* Explicitly reserve slot 0 for flags 0: the following logic
  306. * cannot distinguish an unoccupied slot from slot (flags==0).
  307. */
  308. if (flags == 0)
  309. return 0;
  310. /* search through the remaining (HASH_SIZE-1) slots */
  311. for (i = 1; i < ARRAY_SIZE(page_flags); i++, k++) {
  312. if (!k || k >= ARRAY_SIZE(page_flags))
  313. k = 1;
  314. if (page_flags[k] == 0) {
  315. page_flags[k] = flags;
  316. return k;
  317. }
  318. if (page_flags[k] == flags)
  319. return k;
  320. }
  321. fatal("hash table full: bump up HASH_SHIFT?\n");
  322. exit(EXIT_FAILURE);
  323. }
  324. static void add_page(unsigned long offset, uint64_t flags)
  325. {
  326. flags = expand_overloaded_flags(flags);
  327. if (!opt_raw)
  328. flags = well_known_flags(flags);
  329. if (!bit_mask_ok(flags))
  330. return;
  331. if (opt_list == 1)
  332. show_page_range(offset, flags);
  333. else if (opt_list == 2)
  334. show_page(offset, flags);
  335. nr_pages[hash_slot(flags)]++;
  336. total_pages++;
  337. }
  338. static void walk_pfn(unsigned long index, unsigned long count)
  339. {
  340. unsigned long batch;
  341. unsigned long n;
  342. unsigned long i;
  343. if (index > ULONG_MAX / KPF_BYTES)
  344. fatal("index overflow: %lu\n", index);
  345. lseek(kpageflags_fd, index * KPF_BYTES, SEEK_SET);
  346. while (count) {
  347. uint64_t kpageflags_buf[KPF_BYTES * PAGES_BATCH];
  348. batch = min_t(unsigned long, count, PAGES_BATCH);
  349. n = read(kpageflags_fd, kpageflags_buf, batch * KPF_BYTES);
  350. if (n == 0)
  351. break;
  352. if (n < 0) {
  353. perror(PROC_KPAGEFLAGS);
  354. exit(EXIT_FAILURE);
  355. }
  356. if (n % KPF_BYTES != 0)
  357. fatal("partial read: %lu bytes\n", n);
  358. n = n / KPF_BYTES;
  359. for (i = 0; i < n; i++)
  360. add_page(index + i, kpageflags_buf[i]);
  361. index += batch;
  362. count -= batch;
  363. }
  364. }
  365. #define PAGEMAP_BATCH 4096
  366. static unsigned long task_pfn(unsigned long pgoff)
  367. {
  368. static uint64_t buf[PAGEMAP_BATCH];
  369. static unsigned long start;
  370. static long count;
  371. uint64_t pfn;
  372. if (pgoff < start || pgoff >= start + count) {
  373. if (lseek64(pagemap_fd,
  374. (uint64_t)pgoff * PM_ENTRY_BYTES,
  375. SEEK_SET) < 0) {
  376. perror("pagemap seek");
  377. exit(EXIT_FAILURE);
  378. }
  379. count = read(pagemap_fd, buf, sizeof(buf));
  380. if (count == 0)
  381. return 0;
  382. if (count < 0) {
  383. perror("pagemap read");
  384. exit(EXIT_FAILURE);
  385. }
  386. if (count % PM_ENTRY_BYTES) {
  387. fatal("pagemap read not aligned.\n");
  388. exit(EXIT_FAILURE);
  389. }
  390. count /= PM_ENTRY_BYTES;
  391. start = pgoff;
  392. }
  393. pfn = buf[pgoff - start];
  394. if (pfn & PM_PRESENT)
  395. pfn = PM_PFRAME(pfn);
  396. else
  397. pfn = 0;
  398. return pfn;
  399. }
  400. static void walk_task(unsigned long index, unsigned long count)
  401. {
  402. int i = 0;
  403. const unsigned long end = index + count;
  404. while (index < end) {
  405. while (pg_end[i] <= index)
  406. if (++i >= nr_vmas)
  407. return;
  408. if (pg_start[i] >= end)
  409. return;
  410. voffset = max_t(unsigned long, pg_start[i], index);
  411. index = min_t(unsigned long, pg_end[i], end);
  412. assert(voffset < index);
  413. for (; voffset < index; voffset++) {
  414. unsigned long pfn = task_pfn(voffset);
  415. if (pfn)
  416. walk_pfn(pfn, 1);
  417. }
  418. }
  419. }
  420. static void add_addr_range(unsigned long offset, unsigned long size)
  421. {
  422. if (nr_addr_ranges >= MAX_ADDR_RANGES)
  423. fatal("too many addr ranges\n");
  424. opt_offset[nr_addr_ranges] = offset;
  425. opt_size[nr_addr_ranges] = min_t(unsigned long, size, ULONG_MAX-offset);
  426. nr_addr_ranges++;
  427. }
  428. static void walk_addr_ranges(void)
  429. {
  430. int i;
  431. kpageflags_fd = open(PROC_KPAGEFLAGS, O_RDONLY);
  432. if (kpageflags_fd < 0) {
  433. perror(PROC_KPAGEFLAGS);
  434. exit(EXIT_FAILURE);
  435. }
  436. if (!nr_addr_ranges)
  437. add_addr_range(0, ULONG_MAX);
  438. for (i = 0; i < nr_addr_ranges; i++)
  439. if (!opt_pid)
  440. walk_pfn(opt_offset[i], opt_size[i]);
  441. else
  442. walk_task(opt_offset[i], opt_size[i]);
  443. close(kpageflags_fd);
  444. }
  445. /*
  446. * user interface
  447. */
  448. static const char *page_flag_type(uint64_t flag)
  449. {
  450. if (flag & KPF_HACKERS_BITS)
  451. return "(r)";
  452. if (flag & KPF_OVERLOADED_BITS)
  453. return "(o)";
  454. return " ";
  455. }
  456. static void usage(void)
  457. {
  458. int i, j;
  459. printf(
  460. "page-types [options]\n"
  461. " -r|--raw Raw mode, for kernel developers\n"
  462. " -a|--addr addr-spec Walk a range of pages\n"
  463. " -b|--bits bits-spec Walk pages with specified bits\n"
  464. " -p|--pid pid Walk process address space\n"
  465. #if 0 /* planned features */
  466. " -f|--file filename Walk file address space\n"
  467. #endif
  468. " -l|--list Show page details in ranges\n"
  469. " -L|--list-each Show page details one by one\n"
  470. " -N|--no-summary Don't show summay info\n"
  471. " -h|--help Show this usage message\n"
  472. "addr-spec:\n"
  473. " N one page at offset N (unit: pages)\n"
  474. " N+M pages range from N to N+M-1\n"
  475. " N,M pages range from N to M-1\n"
  476. " N, pages range from N to end\n"
  477. " ,M pages range from 0 to M-1\n"
  478. "bits-spec:\n"
  479. " bit1,bit2 (flags & (bit1|bit2)) != 0\n"
  480. " bit1,bit2=bit1 (flags & (bit1|bit2)) == bit1\n"
  481. " bit1,~bit2 (flags & (bit1|bit2)) == bit1\n"
  482. " =bit1,bit2 flags == (bit1|bit2)\n"
  483. "bit-names:\n"
  484. );
  485. for (i = 0, j = 0; i < ARRAY_SIZE(page_flag_names); i++) {
  486. if (!page_flag_names[i])
  487. continue;
  488. printf("%16s%s", page_flag_names[i] + 2,
  489. page_flag_type(1ULL << i));
  490. if (++j > 3) {
  491. j = 0;
  492. putchar('\n');
  493. }
  494. }
  495. printf("\n "
  496. "(r) raw mode bits (o) overloaded bits\n");
  497. }
  498. static unsigned long long parse_number(const char *str)
  499. {
  500. unsigned long long n;
  501. n = strtoll(str, NULL, 0);
  502. if (n == 0 && str[0] != '0')
  503. fatal("invalid name or number: %s\n", str);
  504. return n;
  505. }
  506. static void parse_pid(const char *str)
  507. {
  508. FILE *file;
  509. char buf[5000];
  510. opt_pid = parse_number(str);
  511. sprintf(buf, "/proc/%d/pagemap", opt_pid);
  512. pagemap_fd = open(buf, O_RDONLY);
  513. if (pagemap_fd < 0) {
  514. perror(buf);
  515. exit(EXIT_FAILURE);
  516. }
  517. sprintf(buf, "/proc/%d/maps", opt_pid);
  518. file = fopen(buf, "r");
  519. if (!file) {
  520. perror(buf);
  521. exit(EXIT_FAILURE);
  522. }
  523. while (fgets(buf, sizeof(buf), file) != NULL) {
  524. unsigned long vm_start;
  525. unsigned long vm_end;
  526. unsigned long long pgoff;
  527. int major, minor;
  528. char r, w, x, s;
  529. unsigned long ino;
  530. int n;
  531. n = sscanf(buf, "%lx-%lx %c%c%c%c %llx %x:%x %lu",
  532. &vm_start,
  533. &vm_end,
  534. &r, &w, &x, &s,
  535. &pgoff,
  536. &major, &minor,
  537. &ino);
  538. if (n < 10) {
  539. fprintf(stderr, "unexpected line: %s\n", buf);
  540. continue;
  541. }
  542. pg_start[nr_vmas] = vm_start / page_size;
  543. pg_end[nr_vmas] = vm_end / page_size;
  544. if (++nr_vmas >= MAX_VMAS) {
  545. fprintf(stderr, "too many VMAs\n");
  546. break;
  547. }
  548. }
  549. fclose(file);
  550. }
  551. static void parse_file(const char *name)
  552. {
  553. }
  554. static void parse_addr_range(const char *optarg)
  555. {
  556. unsigned long offset;
  557. unsigned long size;
  558. char *p;
  559. p = strchr(optarg, ',');
  560. if (!p)
  561. p = strchr(optarg, '+');
  562. if (p == optarg) {
  563. offset = 0;
  564. size = parse_number(p + 1);
  565. } else if (p) {
  566. offset = parse_number(optarg);
  567. if (p[1] == '\0')
  568. size = ULONG_MAX;
  569. else {
  570. size = parse_number(p + 1);
  571. if (*p == ',') {
  572. if (size < offset)
  573. fatal("invalid range: %lu,%lu\n",
  574. offset, size);
  575. size -= offset;
  576. }
  577. }
  578. } else {
  579. offset = parse_number(optarg);
  580. size = 1;
  581. }
  582. add_addr_range(offset, size);
  583. }
  584. static void add_bits_filter(uint64_t mask, uint64_t bits)
  585. {
  586. if (nr_bit_filters >= MAX_BIT_FILTERS)
  587. fatal("too much bit filters\n");
  588. opt_mask[nr_bit_filters] = mask;
  589. opt_bits[nr_bit_filters] = bits;
  590. nr_bit_filters++;
  591. }
  592. static uint64_t parse_flag_name(const char *str, int len)
  593. {
  594. int i;
  595. if (!*str || !len)
  596. return 0;
  597. if (len <= 8 && !strncmp(str, "compound", len))
  598. return BITS_COMPOUND;
  599. for (i = 0; i < ARRAY_SIZE(page_flag_names); i++) {
  600. if (!page_flag_names[i])
  601. continue;
  602. if (!strncmp(str, page_flag_names[i] + 2, len))
  603. return 1ULL << i;
  604. }
  605. return parse_number(str);
  606. }
  607. static uint64_t parse_flag_names(const char *str, int all)
  608. {
  609. const char *p = str;
  610. uint64_t flags = 0;
  611. while (1) {
  612. if (*p == ',' || *p == '=' || *p == '\0') {
  613. if ((*str != '~') || (*str == '~' && all && *++str))
  614. flags |= parse_flag_name(str, p - str);
  615. if (*p != ',')
  616. break;
  617. str = p + 1;
  618. }
  619. p++;
  620. }
  621. return flags;
  622. }
  623. static void parse_bits_mask(const char *optarg)
  624. {
  625. uint64_t mask;
  626. uint64_t bits;
  627. const char *p;
  628. p = strchr(optarg, '=');
  629. if (p == optarg) {
  630. mask = KPF_ALL_BITS;
  631. bits = parse_flag_names(p + 1, 0);
  632. } else if (p) {
  633. mask = parse_flag_names(optarg, 0);
  634. bits = parse_flag_names(p + 1, 0);
  635. } else if (strchr(optarg, '~')) {
  636. mask = parse_flag_names(optarg, 1);
  637. bits = parse_flag_names(optarg, 0);
  638. } else {
  639. mask = parse_flag_names(optarg, 0);
  640. bits = KPF_ALL_BITS;
  641. }
  642. add_bits_filter(mask, bits);
  643. }
  644. static struct option opts[] = {
  645. { "raw" , 0, NULL, 'r' },
  646. { "pid" , 1, NULL, 'p' },
  647. { "file" , 1, NULL, 'f' },
  648. { "addr" , 1, NULL, 'a' },
  649. { "bits" , 1, NULL, 'b' },
  650. { "list" , 0, NULL, 'l' },
  651. { "list-each" , 0, NULL, 'L' },
  652. { "no-summary", 0, NULL, 'N' },
  653. { "help" , 0, NULL, 'h' },
  654. { NULL , 0, NULL, 0 }
  655. };
  656. int main(int argc, char *argv[])
  657. {
  658. int c;
  659. page_size = getpagesize();
  660. while ((c = getopt_long(argc, argv,
  661. "rp:f:a:b:lLNh", opts, NULL)) != -1) {
  662. switch (c) {
  663. case 'r':
  664. opt_raw = 1;
  665. break;
  666. case 'p':
  667. parse_pid(optarg);
  668. break;
  669. case 'f':
  670. parse_file(optarg);
  671. break;
  672. case 'a':
  673. parse_addr_range(optarg);
  674. break;
  675. case 'b':
  676. parse_bits_mask(optarg);
  677. break;
  678. case 'l':
  679. opt_list = 1;
  680. break;
  681. case 'L':
  682. opt_list = 2;
  683. break;
  684. case 'N':
  685. opt_no_summary = 1;
  686. break;
  687. case 'h':
  688. usage();
  689. exit(0);
  690. default:
  691. usage();
  692. exit(1);
  693. }
  694. }
  695. if (opt_list && opt_pid)
  696. printf("voffset\t");
  697. if (opt_list == 1)
  698. printf("offset\tlen\tflags\n");
  699. if (opt_list == 2)
  700. printf("offset\tflags\n");
  701. walk_addr_ranges();
  702. if (opt_list == 1)
  703. show_page_range(0, 0); /* drain the buffer */
  704. if (opt_no_summary)
  705. return 0;
  706. if (opt_list)
  707. printf("\n\n");
  708. show_summary();
  709. return 0;
  710. }