page-types.c 21 KB

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