page-types.c 21 KB

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