page-types.c 22 KB

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