page-types.c 14 KB

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