task_mmu.c 38 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543
  1. #include <linux/mm.h>
  2. #include <linux/hugetlb.h>
  3. #include <linux/huge_mm.h>
  4. #include <linux/mount.h>
  5. #include <linux/seq_file.h>
  6. #include <linux/highmem.h>
  7. #include <linux/ptrace.h>
  8. #include <linux/slab.h>
  9. #include <linux/pagemap.h>
  10. #include <linux/mempolicy.h>
  11. #include <linux/rmap.h>
  12. #include <linux/swap.h>
  13. #include <linux/swapops.h>
  14. #include <linux/mmu_notifier.h>
  15. #include <asm/elf.h>
  16. #include <asm/uaccess.h>
  17. #include <asm/tlbflush.h>
  18. #include "internal.h"
  19. void task_mem(struct seq_file *m, struct mm_struct *mm)
  20. {
  21. unsigned long data, text, lib, swap;
  22. unsigned long hiwater_vm, total_vm, hiwater_rss, total_rss;
  23. /*
  24. * Note: to minimize their overhead, mm maintains hiwater_vm and
  25. * hiwater_rss only when about to *lower* total_vm or rss. Any
  26. * collector of these hiwater stats must therefore get total_vm
  27. * and rss too, which will usually be the higher. Barriers? not
  28. * worth the effort, such snapshots can always be inconsistent.
  29. */
  30. hiwater_vm = total_vm = mm->total_vm;
  31. if (hiwater_vm < mm->hiwater_vm)
  32. hiwater_vm = mm->hiwater_vm;
  33. hiwater_rss = total_rss = get_mm_rss(mm);
  34. if (hiwater_rss < mm->hiwater_rss)
  35. hiwater_rss = mm->hiwater_rss;
  36. data = mm->total_vm - mm->shared_vm - mm->stack_vm;
  37. text = (PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK)) >> 10;
  38. lib = (mm->exec_vm << (PAGE_SHIFT-10)) - text;
  39. swap = get_mm_counter(mm, MM_SWAPENTS);
  40. seq_printf(m,
  41. "VmPeak:\t%8lu kB\n"
  42. "VmSize:\t%8lu kB\n"
  43. "VmLck:\t%8lu kB\n"
  44. "VmPin:\t%8lu kB\n"
  45. "VmHWM:\t%8lu kB\n"
  46. "VmRSS:\t%8lu kB\n"
  47. "VmData:\t%8lu kB\n"
  48. "VmStk:\t%8lu kB\n"
  49. "VmExe:\t%8lu kB\n"
  50. "VmLib:\t%8lu kB\n"
  51. "VmPTE:\t%8lu kB\n"
  52. "VmSwap:\t%8lu kB\n",
  53. hiwater_vm << (PAGE_SHIFT-10),
  54. total_vm << (PAGE_SHIFT-10),
  55. mm->locked_vm << (PAGE_SHIFT-10),
  56. mm->pinned_vm << (PAGE_SHIFT-10),
  57. hiwater_rss << (PAGE_SHIFT-10),
  58. total_rss << (PAGE_SHIFT-10),
  59. data << (PAGE_SHIFT-10),
  60. mm->stack_vm << (PAGE_SHIFT-10), text, lib,
  61. (PTRS_PER_PTE * sizeof(pte_t) *
  62. atomic_long_read(&mm->nr_ptes)) >> 10,
  63. swap << (PAGE_SHIFT-10));
  64. }
  65. unsigned long task_vsize(struct mm_struct *mm)
  66. {
  67. return PAGE_SIZE * mm->total_vm;
  68. }
  69. unsigned long task_statm(struct mm_struct *mm,
  70. unsigned long *shared, unsigned long *text,
  71. unsigned long *data, unsigned long *resident)
  72. {
  73. *shared = get_mm_counter(mm, MM_FILEPAGES);
  74. *text = (PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK))
  75. >> PAGE_SHIFT;
  76. *data = mm->total_vm - mm->shared_vm;
  77. *resident = *shared + get_mm_counter(mm, MM_ANONPAGES);
  78. return mm->total_vm;
  79. }
  80. static void pad_len_spaces(struct seq_file *m, int len)
  81. {
  82. len = 25 + sizeof(void*) * 6 - len;
  83. if (len < 1)
  84. len = 1;
  85. seq_printf(m, "%*c", len, ' ');
  86. }
  87. #ifdef CONFIG_NUMA
  88. /*
  89. * These functions are for numa_maps but called in generic **maps seq_file
  90. * ->start(), ->stop() ops.
  91. *
  92. * numa_maps scans all vmas under mmap_sem and checks their mempolicy.
  93. * Each mempolicy object is controlled by reference counting. The problem here
  94. * is how to avoid accessing dead mempolicy object.
  95. *
  96. * Because we're holding mmap_sem while reading seq_file, it's safe to access
  97. * each vma's mempolicy, no vma objects will never drop refs to mempolicy.
  98. *
  99. * A task's mempolicy (task->mempolicy) has different behavior. task->mempolicy
  100. * is set and replaced under mmap_sem but unrefed and cleared under task_lock().
  101. * So, without task_lock(), we cannot trust get_vma_policy() because we cannot
  102. * gurantee the task never exits under us. But taking task_lock() around
  103. * get_vma_plicy() causes lock order problem.
  104. *
  105. * To access task->mempolicy without lock, we hold a reference count of an
  106. * object pointed by task->mempolicy and remember it. This will guarantee
  107. * that task->mempolicy points to an alive object or NULL in numa_maps accesses.
  108. */
  109. static void hold_task_mempolicy(struct proc_maps_private *priv)
  110. {
  111. struct task_struct *task = priv->task;
  112. task_lock(task);
  113. priv->task_mempolicy = task->mempolicy;
  114. mpol_get(priv->task_mempolicy);
  115. task_unlock(task);
  116. }
  117. static void release_task_mempolicy(struct proc_maps_private *priv)
  118. {
  119. mpol_put(priv->task_mempolicy);
  120. }
  121. #else
  122. static void hold_task_mempolicy(struct proc_maps_private *priv)
  123. {
  124. }
  125. static void release_task_mempolicy(struct proc_maps_private *priv)
  126. {
  127. }
  128. #endif
  129. static void vma_stop(struct proc_maps_private *priv, struct vm_area_struct *vma)
  130. {
  131. if (vma && vma != priv->tail_vma) {
  132. struct mm_struct *mm = vma->vm_mm;
  133. release_task_mempolicy(priv);
  134. up_read(&mm->mmap_sem);
  135. mmput(mm);
  136. }
  137. }
  138. static void *m_start(struct seq_file *m, loff_t *pos)
  139. {
  140. struct proc_maps_private *priv = m->private;
  141. unsigned long last_addr = m->version;
  142. struct mm_struct *mm;
  143. struct vm_area_struct *vma, *tail_vma = NULL;
  144. loff_t l = *pos;
  145. /* Clear the per syscall fields in priv */
  146. priv->task = NULL;
  147. priv->tail_vma = NULL;
  148. /*
  149. * We remember last_addr rather than next_addr to hit with
  150. * mmap_cache most of the time. We have zero last_addr at
  151. * the beginning and also after lseek. We will have -1 last_addr
  152. * after the end of the vmas.
  153. */
  154. if (last_addr == -1UL)
  155. return NULL;
  156. priv->task = get_pid_task(priv->pid, PIDTYPE_PID);
  157. if (!priv->task)
  158. return ERR_PTR(-ESRCH);
  159. mm = mm_access(priv->task, PTRACE_MODE_READ);
  160. if (!mm || IS_ERR(mm))
  161. return mm;
  162. down_read(&mm->mmap_sem);
  163. tail_vma = get_gate_vma(priv->task->mm);
  164. priv->tail_vma = tail_vma;
  165. hold_task_mempolicy(priv);
  166. /* Start with last addr hint */
  167. vma = find_vma(mm, last_addr);
  168. if (last_addr && vma) {
  169. vma = vma->vm_next;
  170. goto out;
  171. }
  172. /*
  173. * Check the vma index is within the range and do
  174. * sequential scan until m_index.
  175. */
  176. vma = NULL;
  177. if ((unsigned long)l < mm->map_count) {
  178. vma = mm->mmap;
  179. while (l-- && vma)
  180. vma = vma->vm_next;
  181. goto out;
  182. }
  183. if (l != mm->map_count)
  184. tail_vma = NULL; /* After gate vma */
  185. out:
  186. if (vma)
  187. return vma;
  188. release_task_mempolicy(priv);
  189. /* End of vmas has been reached */
  190. m->version = (tail_vma != NULL)? 0: -1UL;
  191. up_read(&mm->mmap_sem);
  192. mmput(mm);
  193. return tail_vma;
  194. }
  195. static void *m_next(struct seq_file *m, void *v, loff_t *pos)
  196. {
  197. struct proc_maps_private *priv = m->private;
  198. struct vm_area_struct *vma = v;
  199. struct vm_area_struct *tail_vma = priv->tail_vma;
  200. (*pos)++;
  201. if (vma && (vma != tail_vma) && vma->vm_next)
  202. return vma->vm_next;
  203. vma_stop(priv, vma);
  204. return (vma != tail_vma)? tail_vma: NULL;
  205. }
  206. static void m_stop(struct seq_file *m, void *v)
  207. {
  208. struct proc_maps_private *priv = m->private;
  209. struct vm_area_struct *vma = v;
  210. if (!IS_ERR(vma))
  211. vma_stop(priv, vma);
  212. if (priv->task)
  213. put_task_struct(priv->task);
  214. }
  215. static int do_maps_open(struct inode *inode, struct file *file,
  216. const struct seq_operations *ops)
  217. {
  218. struct proc_maps_private *priv;
  219. int ret = -ENOMEM;
  220. priv = kzalloc(sizeof(*priv), GFP_KERNEL);
  221. if (priv) {
  222. priv->pid = proc_pid(inode);
  223. ret = seq_open(file, ops);
  224. if (!ret) {
  225. struct seq_file *m = file->private_data;
  226. m->private = priv;
  227. } else {
  228. kfree(priv);
  229. }
  230. }
  231. return ret;
  232. }
  233. static void
  234. show_map_vma(struct seq_file *m, struct vm_area_struct *vma, int is_pid)
  235. {
  236. struct mm_struct *mm = vma->vm_mm;
  237. struct file *file = vma->vm_file;
  238. struct proc_maps_private *priv = m->private;
  239. struct task_struct *task = priv->task;
  240. vm_flags_t flags = vma->vm_flags;
  241. unsigned long ino = 0;
  242. unsigned long long pgoff = 0;
  243. unsigned long start, end;
  244. dev_t dev = 0;
  245. int len;
  246. const char *name = NULL;
  247. if (file) {
  248. struct inode *inode = file_inode(vma->vm_file);
  249. dev = inode->i_sb->s_dev;
  250. ino = inode->i_ino;
  251. pgoff = ((loff_t)vma->vm_pgoff) << PAGE_SHIFT;
  252. }
  253. /* We don't show the stack guard page in /proc/maps */
  254. start = vma->vm_start;
  255. if (stack_guard_page_start(vma, start))
  256. start += PAGE_SIZE;
  257. end = vma->vm_end;
  258. if (stack_guard_page_end(vma, end))
  259. end -= PAGE_SIZE;
  260. seq_printf(m, "%08lx-%08lx %c%c%c%c %08llx %02x:%02x %lu %n",
  261. start,
  262. end,
  263. flags & VM_READ ? 'r' : '-',
  264. flags & VM_WRITE ? 'w' : '-',
  265. flags & VM_EXEC ? 'x' : '-',
  266. flags & VM_MAYSHARE ? 's' : 'p',
  267. pgoff,
  268. MAJOR(dev), MINOR(dev), ino, &len);
  269. /*
  270. * Print the dentry name for named mappings, and a
  271. * special [heap] marker for the heap:
  272. */
  273. if (file) {
  274. pad_len_spaces(m, len);
  275. seq_path(m, &file->f_path, "\n");
  276. goto done;
  277. }
  278. name = arch_vma_name(vma);
  279. if (!name) {
  280. pid_t tid;
  281. if (!mm) {
  282. name = "[vdso]";
  283. goto done;
  284. }
  285. if (vma->vm_start <= mm->brk &&
  286. vma->vm_end >= mm->start_brk) {
  287. name = "[heap]";
  288. goto done;
  289. }
  290. tid = vm_is_stack(task, vma, is_pid);
  291. if (tid != 0) {
  292. /*
  293. * Thread stack in /proc/PID/task/TID/maps or
  294. * the main process stack.
  295. */
  296. if (!is_pid || (vma->vm_start <= mm->start_stack &&
  297. vma->vm_end >= mm->start_stack)) {
  298. name = "[stack]";
  299. } else {
  300. /* Thread stack in /proc/PID/maps */
  301. pad_len_spaces(m, len);
  302. seq_printf(m, "[stack:%d]", tid);
  303. }
  304. }
  305. }
  306. done:
  307. if (name) {
  308. pad_len_spaces(m, len);
  309. seq_puts(m, name);
  310. }
  311. seq_putc(m, '\n');
  312. }
  313. static int show_map(struct seq_file *m, void *v, int is_pid)
  314. {
  315. struct vm_area_struct *vma = v;
  316. struct proc_maps_private *priv = m->private;
  317. struct task_struct *task = priv->task;
  318. show_map_vma(m, vma, is_pid);
  319. if (m->count < m->size) /* vma is copied successfully */
  320. m->version = (vma != get_gate_vma(task->mm))
  321. ? vma->vm_start : 0;
  322. return 0;
  323. }
  324. static int show_pid_map(struct seq_file *m, void *v)
  325. {
  326. return show_map(m, v, 1);
  327. }
  328. static int show_tid_map(struct seq_file *m, void *v)
  329. {
  330. return show_map(m, v, 0);
  331. }
  332. static const struct seq_operations proc_pid_maps_op = {
  333. .start = m_start,
  334. .next = m_next,
  335. .stop = m_stop,
  336. .show = show_pid_map
  337. };
  338. static const struct seq_operations proc_tid_maps_op = {
  339. .start = m_start,
  340. .next = m_next,
  341. .stop = m_stop,
  342. .show = show_tid_map
  343. };
  344. static int pid_maps_open(struct inode *inode, struct file *file)
  345. {
  346. return do_maps_open(inode, file, &proc_pid_maps_op);
  347. }
  348. static int tid_maps_open(struct inode *inode, struct file *file)
  349. {
  350. return do_maps_open(inode, file, &proc_tid_maps_op);
  351. }
  352. const struct file_operations proc_pid_maps_operations = {
  353. .open = pid_maps_open,
  354. .read = seq_read,
  355. .llseek = seq_lseek,
  356. .release = seq_release_private,
  357. };
  358. const struct file_operations proc_tid_maps_operations = {
  359. .open = tid_maps_open,
  360. .read = seq_read,
  361. .llseek = seq_lseek,
  362. .release = seq_release_private,
  363. };
  364. /*
  365. * Proportional Set Size(PSS): my share of RSS.
  366. *
  367. * PSS of a process is the count of pages it has in memory, where each
  368. * page is divided by the number of processes sharing it. So if a
  369. * process has 1000 pages all to itself, and 1000 shared with one other
  370. * process, its PSS will be 1500.
  371. *
  372. * To keep (accumulated) division errors low, we adopt a 64bit
  373. * fixed-point pss counter to minimize division errors. So (pss >>
  374. * PSS_SHIFT) would be the real byte count.
  375. *
  376. * A shift of 12 before division means (assuming 4K page size):
  377. * - 1M 3-user-pages add up to 8KB errors;
  378. * - supports mapcount up to 2^24, or 16M;
  379. * - supports PSS up to 2^52 bytes, or 4PB.
  380. */
  381. #define PSS_SHIFT 12
  382. #ifdef CONFIG_PROC_PAGE_MONITOR
  383. struct mem_size_stats {
  384. struct vm_area_struct *vma;
  385. unsigned long resident;
  386. unsigned long shared_clean;
  387. unsigned long shared_dirty;
  388. unsigned long private_clean;
  389. unsigned long private_dirty;
  390. unsigned long referenced;
  391. unsigned long anonymous;
  392. unsigned long anonymous_thp;
  393. unsigned long swap;
  394. unsigned long nonlinear;
  395. u64 pss;
  396. };
  397. static void smaps_pte_entry(pte_t ptent, unsigned long addr,
  398. unsigned long ptent_size, struct mm_walk *walk)
  399. {
  400. struct mem_size_stats *mss = walk->private;
  401. struct vm_area_struct *vma = mss->vma;
  402. pgoff_t pgoff = linear_page_index(vma, addr);
  403. struct page *page = NULL;
  404. int mapcount;
  405. if (pte_present(ptent)) {
  406. page = vm_normal_page(vma, addr, ptent);
  407. } else if (is_swap_pte(ptent)) {
  408. swp_entry_t swpent = pte_to_swp_entry(ptent);
  409. if (!non_swap_entry(swpent))
  410. mss->swap += ptent_size;
  411. else if (is_migration_entry(swpent))
  412. page = migration_entry_to_page(swpent);
  413. } else if (pte_file(ptent)) {
  414. if (pte_to_pgoff(ptent) != pgoff)
  415. mss->nonlinear += ptent_size;
  416. }
  417. if (!page)
  418. return;
  419. if (PageAnon(page))
  420. mss->anonymous += ptent_size;
  421. if (page->index != pgoff)
  422. mss->nonlinear += ptent_size;
  423. mss->resident += ptent_size;
  424. /* Accumulate the size in pages that have been accessed. */
  425. if (pte_young(ptent) || PageReferenced(page))
  426. mss->referenced += ptent_size;
  427. mapcount = page_mapcount(page);
  428. if (mapcount >= 2) {
  429. if (pte_dirty(ptent) || PageDirty(page))
  430. mss->shared_dirty += ptent_size;
  431. else
  432. mss->shared_clean += ptent_size;
  433. mss->pss += (ptent_size << PSS_SHIFT) / mapcount;
  434. } else {
  435. if (pte_dirty(ptent) || PageDirty(page))
  436. mss->private_dirty += ptent_size;
  437. else
  438. mss->private_clean += ptent_size;
  439. mss->pss += (ptent_size << PSS_SHIFT);
  440. }
  441. }
  442. static int smaps_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end,
  443. struct mm_walk *walk)
  444. {
  445. struct mem_size_stats *mss = walk->private;
  446. struct vm_area_struct *vma = mss->vma;
  447. pte_t *pte;
  448. spinlock_t *ptl;
  449. if (pmd_trans_huge_lock(pmd, vma, &ptl) == 1) {
  450. smaps_pte_entry(*(pte_t *)pmd, addr, HPAGE_PMD_SIZE, walk);
  451. spin_unlock(ptl);
  452. mss->anonymous_thp += HPAGE_PMD_SIZE;
  453. return 0;
  454. }
  455. if (pmd_trans_unstable(pmd))
  456. return 0;
  457. /*
  458. * The mmap_sem held all the way back in m_start() is what
  459. * keeps khugepaged out of here and from collapsing things
  460. * in here.
  461. */
  462. pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
  463. for (; addr != end; pte++, addr += PAGE_SIZE)
  464. smaps_pte_entry(*pte, addr, PAGE_SIZE, walk);
  465. pte_unmap_unlock(pte - 1, ptl);
  466. cond_resched();
  467. return 0;
  468. }
  469. static void show_smap_vma_flags(struct seq_file *m, struct vm_area_struct *vma)
  470. {
  471. /*
  472. * Don't forget to update Documentation/ on changes.
  473. */
  474. static const char mnemonics[BITS_PER_LONG][2] = {
  475. /*
  476. * In case if we meet a flag we don't know about.
  477. */
  478. [0 ... (BITS_PER_LONG-1)] = "??",
  479. [ilog2(VM_READ)] = "rd",
  480. [ilog2(VM_WRITE)] = "wr",
  481. [ilog2(VM_EXEC)] = "ex",
  482. [ilog2(VM_SHARED)] = "sh",
  483. [ilog2(VM_MAYREAD)] = "mr",
  484. [ilog2(VM_MAYWRITE)] = "mw",
  485. [ilog2(VM_MAYEXEC)] = "me",
  486. [ilog2(VM_MAYSHARE)] = "ms",
  487. [ilog2(VM_GROWSDOWN)] = "gd",
  488. [ilog2(VM_PFNMAP)] = "pf",
  489. [ilog2(VM_DENYWRITE)] = "dw",
  490. [ilog2(VM_LOCKED)] = "lo",
  491. [ilog2(VM_IO)] = "io",
  492. [ilog2(VM_SEQ_READ)] = "sr",
  493. [ilog2(VM_RAND_READ)] = "rr",
  494. [ilog2(VM_DONTCOPY)] = "dc",
  495. [ilog2(VM_DONTEXPAND)] = "de",
  496. [ilog2(VM_ACCOUNT)] = "ac",
  497. [ilog2(VM_NORESERVE)] = "nr",
  498. [ilog2(VM_HUGETLB)] = "ht",
  499. [ilog2(VM_NONLINEAR)] = "nl",
  500. [ilog2(VM_ARCH_1)] = "ar",
  501. [ilog2(VM_DONTDUMP)] = "dd",
  502. #ifdef CONFIG_MEM_SOFT_DIRTY
  503. [ilog2(VM_SOFTDIRTY)] = "sd",
  504. #endif
  505. [ilog2(VM_MIXEDMAP)] = "mm",
  506. [ilog2(VM_HUGEPAGE)] = "hg",
  507. [ilog2(VM_NOHUGEPAGE)] = "nh",
  508. [ilog2(VM_MERGEABLE)] = "mg",
  509. };
  510. size_t i;
  511. seq_puts(m, "VmFlags: ");
  512. for (i = 0; i < BITS_PER_LONG; i++) {
  513. if (vma->vm_flags & (1UL << i)) {
  514. seq_printf(m, "%c%c ",
  515. mnemonics[i][0], mnemonics[i][1]);
  516. }
  517. }
  518. seq_putc(m, '\n');
  519. }
  520. static int show_smap(struct seq_file *m, void *v, int is_pid)
  521. {
  522. struct proc_maps_private *priv = m->private;
  523. struct task_struct *task = priv->task;
  524. struct vm_area_struct *vma = v;
  525. struct mem_size_stats mss;
  526. struct mm_walk smaps_walk = {
  527. .pmd_entry = smaps_pte_range,
  528. .mm = vma->vm_mm,
  529. .private = &mss,
  530. };
  531. memset(&mss, 0, sizeof mss);
  532. mss.vma = vma;
  533. /* mmap_sem is held in m_start */
  534. if (vma->vm_mm && !is_vm_hugetlb_page(vma))
  535. walk_page_range(vma->vm_start, vma->vm_end, &smaps_walk);
  536. show_map_vma(m, vma, is_pid);
  537. seq_printf(m,
  538. "Size: %8lu kB\n"
  539. "Rss: %8lu kB\n"
  540. "Pss: %8lu kB\n"
  541. "Shared_Clean: %8lu kB\n"
  542. "Shared_Dirty: %8lu kB\n"
  543. "Private_Clean: %8lu kB\n"
  544. "Private_Dirty: %8lu kB\n"
  545. "Referenced: %8lu kB\n"
  546. "Anonymous: %8lu kB\n"
  547. "AnonHugePages: %8lu kB\n"
  548. "Swap: %8lu kB\n"
  549. "KernelPageSize: %8lu kB\n"
  550. "MMUPageSize: %8lu kB\n"
  551. "Locked: %8lu kB\n",
  552. (vma->vm_end - vma->vm_start) >> 10,
  553. mss.resident >> 10,
  554. (unsigned long)(mss.pss >> (10 + PSS_SHIFT)),
  555. mss.shared_clean >> 10,
  556. mss.shared_dirty >> 10,
  557. mss.private_clean >> 10,
  558. mss.private_dirty >> 10,
  559. mss.referenced >> 10,
  560. mss.anonymous >> 10,
  561. mss.anonymous_thp >> 10,
  562. mss.swap >> 10,
  563. vma_kernel_pagesize(vma) >> 10,
  564. vma_mmu_pagesize(vma) >> 10,
  565. (vma->vm_flags & VM_LOCKED) ?
  566. (unsigned long)(mss.pss >> (10 + PSS_SHIFT)) : 0);
  567. if (vma->vm_flags & VM_NONLINEAR)
  568. seq_printf(m, "Nonlinear: %8lu kB\n",
  569. mss.nonlinear >> 10);
  570. show_smap_vma_flags(m, vma);
  571. if (m->count < m->size) /* vma is copied successfully */
  572. m->version = (vma != get_gate_vma(task->mm))
  573. ? vma->vm_start : 0;
  574. return 0;
  575. }
  576. static int show_pid_smap(struct seq_file *m, void *v)
  577. {
  578. return show_smap(m, v, 1);
  579. }
  580. static int show_tid_smap(struct seq_file *m, void *v)
  581. {
  582. return show_smap(m, v, 0);
  583. }
  584. static const struct seq_operations proc_pid_smaps_op = {
  585. .start = m_start,
  586. .next = m_next,
  587. .stop = m_stop,
  588. .show = show_pid_smap
  589. };
  590. static const struct seq_operations proc_tid_smaps_op = {
  591. .start = m_start,
  592. .next = m_next,
  593. .stop = m_stop,
  594. .show = show_tid_smap
  595. };
  596. static int pid_smaps_open(struct inode *inode, struct file *file)
  597. {
  598. return do_maps_open(inode, file, &proc_pid_smaps_op);
  599. }
  600. static int tid_smaps_open(struct inode *inode, struct file *file)
  601. {
  602. return do_maps_open(inode, file, &proc_tid_smaps_op);
  603. }
  604. const struct file_operations proc_pid_smaps_operations = {
  605. .open = pid_smaps_open,
  606. .read = seq_read,
  607. .llseek = seq_lseek,
  608. .release = seq_release_private,
  609. };
  610. const struct file_operations proc_tid_smaps_operations = {
  611. .open = tid_smaps_open,
  612. .read = seq_read,
  613. .llseek = seq_lseek,
  614. .release = seq_release_private,
  615. };
  616. /*
  617. * We do not want to have constant page-shift bits sitting in
  618. * pagemap entries and are about to reuse them some time soon.
  619. *
  620. * Here's the "migration strategy":
  621. * 1. when the system boots these bits remain what they are,
  622. * but a warning about future change is printed in log;
  623. * 2. once anyone clears soft-dirty bits via clear_refs file,
  624. * these flag is set to denote, that user is aware of the
  625. * new API and those page-shift bits change their meaning.
  626. * The respective warning is printed in dmesg;
  627. * 3. In a couple of releases we will remove all the mentions
  628. * of page-shift in pagemap entries.
  629. */
  630. static bool soft_dirty_cleared __read_mostly;
  631. enum clear_refs_types {
  632. CLEAR_REFS_ALL = 1,
  633. CLEAR_REFS_ANON,
  634. CLEAR_REFS_MAPPED,
  635. CLEAR_REFS_SOFT_DIRTY,
  636. CLEAR_REFS_LAST,
  637. };
  638. struct clear_refs_private {
  639. struct vm_area_struct *vma;
  640. enum clear_refs_types type;
  641. };
  642. static inline void clear_soft_dirty(struct vm_area_struct *vma,
  643. unsigned long addr, pte_t *pte)
  644. {
  645. #ifdef CONFIG_MEM_SOFT_DIRTY
  646. /*
  647. * The soft-dirty tracker uses #PF-s to catch writes
  648. * to pages, so write-protect the pte as well. See the
  649. * Documentation/vm/soft-dirty.txt for full description
  650. * of how soft-dirty works.
  651. */
  652. pte_t ptent = *pte;
  653. if (pte_present(ptent)) {
  654. ptent = pte_wrprotect(ptent);
  655. ptent = pte_clear_flags(ptent, _PAGE_SOFT_DIRTY);
  656. } else if (is_swap_pte(ptent)) {
  657. ptent = pte_swp_clear_soft_dirty(ptent);
  658. } else if (pte_file(ptent)) {
  659. ptent = pte_file_clear_soft_dirty(ptent);
  660. }
  661. if (vma->vm_flags & VM_SOFTDIRTY)
  662. vma->vm_flags &= ~VM_SOFTDIRTY;
  663. set_pte_at(vma->vm_mm, addr, pte, ptent);
  664. #endif
  665. }
  666. static int clear_refs_pte_range(pmd_t *pmd, unsigned long addr,
  667. unsigned long end, struct mm_walk *walk)
  668. {
  669. struct clear_refs_private *cp = walk->private;
  670. struct vm_area_struct *vma = cp->vma;
  671. pte_t *pte, ptent;
  672. spinlock_t *ptl;
  673. struct page *page;
  674. split_huge_page_pmd(vma, addr, pmd);
  675. if (pmd_trans_unstable(pmd))
  676. return 0;
  677. pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
  678. for (; addr != end; pte++, addr += PAGE_SIZE) {
  679. ptent = *pte;
  680. if (cp->type == CLEAR_REFS_SOFT_DIRTY) {
  681. clear_soft_dirty(vma, addr, pte);
  682. continue;
  683. }
  684. if (!pte_present(ptent))
  685. continue;
  686. page = vm_normal_page(vma, addr, ptent);
  687. if (!page)
  688. continue;
  689. /* Clear accessed and referenced bits. */
  690. ptep_test_and_clear_young(vma, addr, pte);
  691. ClearPageReferenced(page);
  692. }
  693. pte_unmap_unlock(pte - 1, ptl);
  694. cond_resched();
  695. return 0;
  696. }
  697. static ssize_t clear_refs_write(struct file *file, const char __user *buf,
  698. size_t count, loff_t *ppos)
  699. {
  700. struct task_struct *task;
  701. char buffer[PROC_NUMBUF];
  702. struct mm_struct *mm;
  703. struct vm_area_struct *vma;
  704. enum clear_refs_types type;
  705. int itype;
  706. int rv;
  707. memset(buffer, 0, sizeof(buffer));
  708. if (count > sizeof(buffer) - 1)
  709. count = sizeof(buffer) - 1;
  710. if (copy_from_user(buffer, buf, count))
  711. return -EFAULT;
  712. rv = kstrtoint(strstrip(buffer), 10, &itype);
  713. if (rv < 0)
  714. return rv;
  715. type = (enum clear_refs_types)itype;
  716. if (type < CLEAR_REFS_ALL || type >= CLEAR_REFS_LAST)
  717. return -EINVAL;
  718. if (type == CLEAR_REFS_SOFT_DIRTY) {
  719. soft_dirty_cleared = true;
  720. pr_warn_once("The pagemap bits 55-60 has changed their meaning! "
  721. "See the linux/Documentation/vm/pagemap.txt for details.\n");
  722. }
  723. task = get_proc_task(file_inode(file));
  724. if (!task)
  725. return -ESRCH;
  726. mm = get_task_mm(task);
  727. if (mm) {
  728. struct clear_refs_private cp = {
  729. .type = type,
  730. };
  731. struct mm_walk clear_refs_walk = {
  732. .pmd_entry = clear_refs_pte_range,
  733. .mm = mm,
  734. .private = &cp,
  735. };
  736. down_read(&mm->mmap_sem);
  737. if (type == CLEAR_REFS_SOFT_DIRTY)
  738. mmu_notifier_invalidate_range_start(mm, 0, -1);
  739. for (vma = mm->mmap; vma; vma = vma->vm_next) {
  740. cp.vma = vma;
  741. if (is_vm_hugetlb_page(vma))
  742. continue;
  743. /*
  744. * Writing 1 to /proc/pid/clear_refs affects all pages.
  745. *
  746. * Writing 2 to /proc/pid/clear_refs only affects
  747. * Anonymous pages.
  748. *
  749. * Writing 3 to /proc/pid/clear_refs only affects file
  750. * mapped pages.
  751. */
  752. if (type == CLEAR_REFS_ANON && vma->vm_file)
  753. continue;
  754. if (type == CLEAR_REFS_MAPPED && !vma->vm_file)
  755. continue;
  756. walk_page_range(vma->vm_start, vma->vm_end,
  757. &clear_refs_walk);
  758. }
  759. if (type == CLEAR_REFS_SOFT_DIRTY)
  760. mmu_notifier_invalidate_range_end(mm, 0, -1);
  761. flush_tlb_mm(mm);
  762. up_read(&mm->mmap_sem);
  763. mmput(mm);
  764. }
  765. put_task_struct(task);
  766. return count;
  767. }
  768. const struct file_operations proc_clear_refs_operations = {
  769. .write = clear_refs_write,
  770. .llseek = noop_llseek,
  771. };
  772. typedef struct {
  773. u64 pme;
  774. } pagemap_entry_t;
  775. struct pagemapread {
  776. int pos, len; /* units: PM_ENTRY_BYTES, not bytes */
  777. pagemap_entry_t *buffer;
  778. bool v2;
  779. };
  780. #define PAGEMAP_WALK_SIZE (PMD_SIZE)
  781. #define PAGEMAP_WALK_MASK (PMD_MASK)
  782. #define PM_ENTRY_BYTES sizeof(pagemap_entry_t)
  783. #define PM_STATUS_BITS 3
  784. #define PM_STATUS_OFFSET (64 - PM_STATUS_BITS)
  785. #define PM_STATUS_MASK (((1LL << PM_STATUS_BITS) - 1) << PM_STATUS_OFFSET)
  786. #define PM_STATUS(nr) (((nr) << PM_STATUS_OFFSET) & PM_STATUS_MASK)
  787. #define PM_PSHIFT_BITS 6
  788. #define PM_PSHIFT_OFFSET (PM_STATUS_OFFSET - PM_PSHIFT_BITS)
  789. #define PM_PSHIFT_MASK (((1LL << PM_PSHIFT_BITS) - 1) << PM_PSHIFT_OFFSET)
  790. #define __PM_PSHIFT(x) (((u64) (x) << PM_PSHIFT_OFFSET) & PM_PSHIFT_MASK)
  791. #define PM_PFRAME_MASK ((1LL << PM_PSHIFT_OFFSET) - 1)
  792. #define PM_PFRAME(x) ((x) & PM_PFRAME_MASK)
  793. /* in "new" pagemap pshift bits are occupied with more status bits */
  794. #define PM_STATUS2(v2, x) (__PM_PSHIFT(v2 ? x : PAGE_SHIFT))
  795. #define __PM_SOFT_DIRTY (1LL)
  796. #define PM_PRESENT PM_STATUS(4LL)
  797. #define PM_SWAP PM_STATUS(2LL)
  798. #define PM_FILE PM_STATUS(1LL)
  799. #define PM_NOT_PRESENT(v2) PM_STATUS2(v2, 0)
  800. #define PM_END_OF_BUFFER 1
  801. static inline pagemap_entry_t make_pme(u64 val)
  802. {
  803. return (pagemap_entry_t) { .pme = val };
  804. }
  805. static int add_to_pagemap(unsigned long addr, pagemap_entry_t *pme,
  806. struct pagemapread *pm)
  807. {
  808. pm->buffer[pm->pos++] = *pme;
  809. if (pm->pos >= pm->len)
  810. return PM_END_OF_BUFFER;
  811. return 0;
  812. }
  813. static int pagemap_pte_hole(unsigned long start, unsigned long end,
  814. struct mm_walk *walk)
  815. {
  816. struct pagemapread *pm = walk->private;
  817. unsigned long addr;
  818. int err = 0;
  819. pagemap_entry_t pme = make_pme(PM_NOT_PRESENT(pm->v2));
  820. for (addr = start; addr < end; addr += PAGE_SIZE) {
  821. err = add_to_pagemap(addr, &pme, pm);
  822. if (err)
  823. break;
  824. }
  825. return err;
  826. }
  827. static void pte_to_pagemap_entry(pagemap_entry_t *pme, struct pagemapread *pm,
  828. struct vm_area_struct *vma, unsigned long addr, pte_t pte)
  829. {
  830. u64 frame, flags;
  831. struct page *page = NULL;
  832. int flags2 = 0;
  833. if (pte_present(pte)) {
  834. frame = pte_pfn(pte);
  835. flags = PM_PRESENT;
  836. page = vm_normal_page(vma, addr, pte);
  837. if (pte_soft_dirty(pte))
  838. flags2 |= __PM_SOFT_DIRTY;
  839. } else if (is_swap_pte(pte)) {
  840. swp_entry_t entry;
  841. if (pte_swp_soft_dirty(pte))
  842. flags2 |= __PM_SOFT_DIRTY;
  843. entry = pte_to_swp_entry(pte);
  844. frame = swp_type(entry) |
  845. (swp_offset(entry) << MAX_SWAPFILES_SHIFT);
  846. flags = PM_SWAP;
  847. if (is_migration_entry(entry))
  848. page = migration_entry_to_page(entry);
  849. } else {
  850. if (vma->vm_flags & VM_SOFTDIRTY)
  851. flags2 |= __PM_SOFT_DIRTY;
  852. *pme = make_pme(PM_NOT_PRESENT(pm->v2) | PM_STATUS2(pm->v2, flags2));
  853. return;
  854. }
  855. if (page && !PageAnon(page))
  856. flags |= PM_FILE;
  857. if ((vma->vm_flags & VM_SOFTDIRTY))
  858. flags2 |= __PM_SOFT_DIRTY;
  859. *pme = make_pme(PM_PFRAME(frame) | PM_STATUS2(pm->v2, flags2) | flags);
  860. }
  861. #ifdef CONFIG_TRANSPARENT_HUGEPAGE
  862. static void thp_pmd_to_pagemap_entry(pagemap_entry_t *pme, struct pagemapread *pm,
  863. pmd_t pmd, int offset, int pmd_flags2)
  864. {
  865. /*
  866. * Currently pmd for thp is always present because thp can not be
  867. * swapped-out, migrated, or HWPOISONed (split in such cases instead.)
  868. * This if-check is just to prepare for future implementation.
  869. */
  870. if (pmd_present(pmd))
  871. *pme = make_pme(PM_PFRAME(pmd_pfn(pmd) + offset)
  872. | PM_STATUS2(pm->v2, pmd_flags2) | PM_PRESENT);
  873. else
  874. *pme = make_pme(PM_NOT_PRESENT(pm->v2) | PM_STATUS2(pm->v2, pmd_flags2));
  875. }
  876. #else
  877. static inline void thp_pmd_to_pagemap_entry(pagemap_entry_t *pme, struct pagemapread *pm,
  878. pmd_t pmd, int offset, int pmd_flags2)
  879. {
  880. }
  881. #endif
  882. static int pagemap_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end,
  883. struct mm_walk *walk)
  884. {
  885. struct vm_area_struct *vma;
  886. struct pagemapread *pm = walk->private;
  887. spinlock_t *ptl;
  888. pte_t *pte;
  889. int err = 0;
  890. pagemap_entry_t pme = make_pme(PM_NOT_PRESENT(pm->v2));
  891. /* find the first VMA at or above 'addr' */
  892. vma = find_vma(walk->mm, addr);
  893. if (vma && pmd_trans_huge_lock(pmd, vma, &ptl) == 1) {
  894. int pmd_flags2;
  895. if ((vma->vm_flags & VM_SOFTDIRTY) || pmd_soft_dirty(*pmd))
  896. pmd_flags2 = __PM_SOFT_DIRTY;
  897. else
  898. pmd_flags2 = 0;
  899. for (; addr != end; addr += PAGE_SIZE) {
  900. unsigned long offset;
  901. offset = (addr & ~PAGEMAP_WALK_MASK) >>
  902. PAGE_SHIFT;
  903. thp_pmd_to_pagemap_entry(&pme, pm, *pmd, offset, pmd_flags2);
  904. err = add_to_pagemap(addr, &pme, pm);
  905. if (err)
  906. break;
  907. }
  908. spin_unlock(ptl);
  909. return err;
  910. }
  911. if (pmd_trans_unstable(pmd))
  912. return 0;
  913. for (; addr != end; addr += PAGE_SIZE) {
  914. int flags2;
  915. /* check to see if we've left 'vma' behind
  916. * and need a new, higher one */
  917. if (vma && (addr >= vma->vm_end)) {
  918. vma = find_vma(walk->mm, addr);
  919. if (vma && (vma->vm_flags & VM_SOFTDIRTY))
  920. flags2 = __PM_SOFT_DIRTY;
  921. else
  922. flags2 = 0;
  923. pme = make_pme(PM_NOT_PRESENT(pm->v2) | PM_STATUS2(pm->v2, flags2));
  924. }
  925. /* check that 'vma' actually covers this address,
  926. * and that it isn't a huge page vma */
  927. if (vma && (vma->vm_start <= addr) &&
  928. !is_vm_hugetlb_page(vma)) {
  929. pte = pte_offset_map(pmd, addr);
  930. pte_to_pagemap_entry(&pme, pm, vma, addr, *pte);
  931. /* unmap before userspace copy */
  932. pte_unmap(pte);
  933. }
  934. err = add_to_pagemap(addr, &pme, pm);
  935. if (err)
  936. return err;
  937. }
  938. cond_resched();
  939. return err;
  940. }
  941. #ifdef CONFIG_HUGETLB_PAGE
  942. static void huge_pte_to_pagemap_entry(pagemap_entry_t *pme, struct pagemapread *pm,
  943. pte_t pte, int offset, int flags2)
  944. {
  945. if (pte_present(pte))
  946. *pme = make_pme(PM_PFRAME(pte_pfn(pte) + offset) |
  947. PM_STATUS2(pm->v2, flags2) |
  948. PM_PRESENT);
  949. else
  950. *pme = make_pme(PM_NOT_PRESENT(pm->v2) |
  951. PM_STATUS2(pm->v2, flags2));
  952. }
  953. /* This function walks within one hugetlb entry in the single call */
  954. static int pagemap_hugetlb_range(pte_t *pte, unsigned long hmask,
  955. unsigned long addr, unsigned long end,
  956. struct mm_walk *walk)
  957. {
  958. struct pagemapread *pm = walk->private;
  959. struct vm_area_struct *vma;
  960. int err = 0;
  961. int flags2;
  962. pagemap_entry_t pme;
  963. vma = find_vma(walk->mm, addr);
  964. WARN_ON_ONCE(!vma);
  965. if (vma && (vma->vm_flags & VM_SOFTDIRTY))
  966. flags2 = __PM_SOFT_DIRTY;
  967. else
  968. flags2 = 0;
  969. for (; addr != end; addr += PAGE_SIZE) {
  970. int offset = (addr & ~hmask) >> PAGE_SHIFT;
  971. huge_pte_to_pagemap_entry(&pme, pm, *pte, offset, flags2);
  972. err = add_to_pagemap(addr, &pme, pm);
  973. if (err)
  974. return err;
  975. }
  976. cond_resched();
  977. return err;
  978. }
  979. #endif /* HUGETLB_PAGE */
  980. /*
  981. * /proc/pid/pagemap - an array mapping virtual pages to pfns
  982. *
  983. * For each page in the address space, this file contains one 64-bit entry
  984. * consisting of the following:
  985. *
  986. * Bits 0-54 page frame number (PFN) if present
  987. * Bits 0-4 swap type if swapped
  988. * Bits 5-54 swap offset if swapped
  989. * Bits 55-60 page shift (page size = 1<<page shift)
  990. * Bit 61 page is file-page or shared-anon
  991. * Bit 62 page swapped
  992. * Bit 63 page present
  993. *
  994. * If the page is not present but in swap, then the PFN contains an
  995. * encoding of the swap file number and the page's offset into the
  996. * swap. Unmapped pages return a null PFN. This allows determining
  997. * precisely which pages are mapped (or in swap) and comparing mapped
  998. * pages between processes.
  999. *
  1000. * Efficient users of this interface will use /proc/pid/maps to
  1001. * determine which areas of memory are actually mapped and llseek to
  1002. * skip over unmapped regions.
  1003. */
  1004. static ssize_t pagemap_read(struct file *file, char __user *buf,
  1005. size_t count, loff_t *ppos)
  1006. {
  1007. struct task_struct *task = get_proc_task(file_inode(file));
  1008. struct mm_struct *mm;
  1009. struct pagemapread pm;
  1010. int ret = -ESRCH;
  1011. struct mm_walk pagemap_walk = {};
  1012. unsigned long src;
  1013. unsigned long svpfn;
  1014. unsigned long start_vaddr;
  1015. unsigned long end_vaddr;
  1016. int copied = 0;
  1017. if (!task)
  1018. goto out;
  1019. ret = -EINVAL;
  1020. /* file position must be aligned */
  1021. if ((*ppos % PM_ENTRY_BYTES) || (count % PM_ENTRY_BYTES))
  1022. goto out_task;
  1023. ret = 0;
  1024. if (!count)
  1025. goto out_task;
  1026. pm.v2 = soft_dirty_cleared;
  1027. pm.len = (PAGEMAP_WALK_SIZE >> PAGE_SHIFT);
  1028. pm.buffer = kmalloc(pm.len * PM_ENTRY_BYTES, GFP_TEMPORARY);
  1029. ret = -ENOMEM;
  1030. if (!pm.buffer)
  1031. goto out_task;
  1032. mm = mm_access(task, PTRACE_MODE_READ);
  1033. ret = PTR_ERR(mm);
  1034. if (!mm || IS_ERR(mm))
  1035. goto out_free;
  1036. pagemap_walk.pmd_entry = pagemap_pte_range;
  1037. pagemap_walk.pte_hole = pagemap_pte_hole;
  1038. #ifdef CONFIG_HUGETLB_PAGE
  1039. pagemap_walk.hugetlb_entry = pagemap_hugetlb_range;
  1040. #endif
  1041. pagemap_walk.mm = mm;
  1042. pagemap_walk.private = &pm;
  1043. src = *ppos;
  1044. svpfn = src / PM_ENTRY_BYTES;
  1045. start_vaddr = svpfn << PAGE_SHIFT;
  1046. end_vaddr = TASK_SIZE_OF(task);
  1047. /* watch out for wraparound */
  1048. if (svpfn > TASK_SIZE_OF(task) >> PAGE_SHIFT)
  1049. start_vaddr = end_vaddr;
  1050. /*
  1051. * The odds are that this will stop walking way
  1052. * before end_vaddr, because the length of the
  1053. * user buffer is tracked in "pm", and the walk
  1054. * will stop when we hit the end of the buffer.
  1055. */
  1056. ret = 0;
  1057. while (count && (start_vaddr < end_vaddr)) {
  1058. int len;
  1059. unsigned long end;
  1060. pm.pos = 0;
  1061. end = (start_vaddr + PAGEMAP_WALK_SIZE) & PAGEMAP_WALK_MASK;
  1062. /* overflow ? */
  1063. if (end < start_vaddr || end > end_vaddr)
  1064. end = end_vaddr;
  1065. down_read(&mm->mmap_sem);
  1066. ret = walk_page_range(start_vaddr, end, &pagemap_walk);
  1067. up_read(&mm->mmap_sem);
  1068. start_vaddr = end;
  1069. len = min(count, PM_ENTRY_BYTES * pm.pos);
  1070. if (copy_to_user(buf, pm.buffer, len)) {
  1071. ret = -EFAULT;
  1072. goto out_mm;
  1073. }
  1074. copied += len;
  1075. buf += len;
  1076. count -= len;
  1077. }
  1078. *ppos += copied;
  1079. if (!ret || ret == PM_END_OF_BUFFER)
  1080. ret = copied;
  1081. out_mm:
  1082. mmput(mm);
  1083. out_free:
  1084. kfree(pm.buffer);
  1085. out_task:
  1086. put_task_struct(task);
  1087. out:
  1088. return ret;
  1089. }
  1090. static int pagemap_open(struct inode *inode, struct file *file)
  1091. {
  1092. pr_warn_once("Bits 55-60 of /proc/PID/pagemap entries are about "
  1093. "to stop being page-shift some time soon. See the "
  1094. "linux/Documentation/vm/pagemap.txt for details.\n");
  1095. return 0;
  1096. }
  1097. const struct file_operations proc_pagemap_operations = {
  1098. .llseek = mem_lseek, /* borrow this */
  1099. .read = pagemap_read,
  1100. .open = pagemap_open,
  1101. };
  1102. #endif /* CONFIG_PROC_PAGE_MONITOR */
  1103. #ifdef CONFIG_NUMA
  1104. struct numa_maps {
  1105. struct vm_area_struct *vma;
  1106. unsigned long pages;
  1107. unsigned long anon;
  1108. unsigned long active;
  1109. unsigned long writeback;
  1110. unsigned long mapcount_max;
  1111. unsigned long dirty;
  1112. unsigned long swapcache;
  1113. unsigned long node[MAX_NUMNODES];
  1114. };
  1115. struct numa_maps_private {
  1116. struct proc_maps_private proc_maps;
  1117. struct numa_maps md;
  1118. };
  1119. static void gather_stats(struct page *page, struct numa_maps *md, int pte_dirty,
  1120. unsigned long nr_pages)
  1121. {
  1122. int count = page_mapcount(page);
  1123. md->pages += nr_pages;
  1124. if (pte_dirty || PageDirty(page))
  1125. md->dirty += nr_pages;
  1126. if (PageSwapCache(page))
  1127. md->swapcache += nr_pages;
  1128. if (PageActive(page) || PageUnevictable(page))
  1129. md->active += nr_pages;
  1130. if (PageWriteback(page))
  1131. md->writeback += nr_pages;
  1132. if (PageAnon(page))
  1133. md->anon += nr_pages;
  1134. if (count > md->mapcount_max)
  1135. md->mapcount_max = count;
  1136. md->node[page_to_nid(page)] += nr_pages;
  1137. }
  1138. static struct page *can_gather_numa_stats(pte_t pte, struct vm_area_struct *vma,
  1139. unsigned long addr)
  1140. {
  1141. struct page *page;
  1142. int nid;
  1143. if (!pte_present(pte))
  1144. return NULL;
  1145. page = vm_normal_page(vma, addr, pte);
  1146. if (!page)
  1147. return NULL;
  1148. if (PageReserved(page))
  1149. return NULL;
  1150. nid = page_to_nid(page);
  1151. if (!node_isset(nid, node_states[N_MEMORY]))
  1152. return NULL;
  1153. return page;
  1154. }
  1155. static int gather_pte_stats(pmd_t *pmd, unsigned long addr,
  1156. unsigned long end, struct mm_walk *walk)
  1157. {
  1158. struct numa_maps *md;
  1159. spinlock_t *ptl;
  1160. pte_t *orig_pte;
  1161. pte_t *pte;
  1162. md = walk->private;
  1163. if (pmd_trans_huge_lock(pmd, md->vma, &ptl) == 1) {
  1164. pte_t huge_pte = *(pte_t *)pmd;
  1165. struct page *page;
  1166. page = can_gather_numa_stats(huge_pte, md->vma, addr);
  1167. if (page)
  1168. gather_stats(page, md, pte_dirty(huge_pte),
  1169. HPAGE_PMD_SIZE/PAGE_SIZE);
  1170. spin_unlock(ptl);
  1171. return 0;
  1172. }
  1173. if (pmd_trans_unstable(pmd))
  1174. return 0;
  1175. orig_pte = pte = pte_offset_map_lock(walk->mm, pmd, addr, &ptl);
  1176. do {
  1177. struct page *page = can_gather_numa_stats(*pte, md->vma, addr);
  1178. if (!page)
  1179. continue;
  1180. gather_stats(page, md, pte_dirty(*pte), 1);
  1181. } while (pte++, addr += PAGE_SIZE, addr != end);
  1182. pte_unmap_unlock(orig_pte, ptl);
  1183. return 0;
  1184. }
  1185. #ifdef CONFIG_HUGETLB_PAGE
  1186. static int gather_hugetbl_stats(pte_t *pte, unsigned long hmask,
  1187. unsigned long addr, unsigned long end, struct mm_walk *walk)
  1188. {
  1189. struct numa_maps *md;
  1190. struct page *page;
  1191. if (pte_none(*pte))
  1192. return 0;
  1193. page = pte_page(*pte);
  1194. if (!page)
  1195. return 0;
  1196. md = walk->private;
  1197. gather_stats(page, md, pte_dirty(*pte), 1);
  1198. return 0;
  1199. }
  1200. #else
  1201. static int gather_hugetbl_stats(pte_t *pte, unsigned long hmask,
  1202. unsigned long addr, unsigned long end, struct mm_walk *walk)
  1203. {
  1204. return 0;
  1205. }
  1206. #endif
  1207. /*
  1208. * Display pages allocated per node and memory policy via /proc.
  1209. */
  1210. static int show_numa_map(struct seq_file *m, void *v, int is_pid)
  1211. {
  1212. struct numa_maps_private *numa_priv = m->private;
  1213. struct proc_maps_private *proc_priv = &numa_priv->proc_maps;
  1214. struct vm_area_struct *vma = v;
  1215. struct numa_maps *md = &numa_priv->md;
  1216. struct file *file = vma->vm_file;
  1217. struct task_struct *task = proc_priv->task;
  1218. struct mm_struct *mm = vma->vm_mm;
  1219. struct mm_walk walk = {};
  1220. struct mempolicy *pol;
  1221. char buffer[64];
  1222. int nid;
  1223. if (!mm)
  1224. return 0;
  1225. /* Ensure we start with an empty set of numa_maps statistics. */
  1226. memset(md, 0, sizeof(*md));
  1227. md->vma = vma;
  1228. walk.hugetlb_entry = gather_hugetbl_stats;
  1229. walk.pmd_entry = gather_pte_stats;
  1230. walk.private = md;
  1231. walk.mm = mm;
  1232. pol = get_vma_policy(task, vma, vma->vm_start);
  1233. mpol_to_str(buffer, sizeof(buffer), pol);
  1234. mpol_cond_put(pol);
  1235. seq_printf(m, "%08lx %s", vma->vm_start, buffer);
  1236. if (file) {
  1237. seq_printf(m, " file=");
  1238. seq_path(m, &file->f_path, "\n\t= ");
  1239. } else if (vma->vm_start <= mm->brk && vma->vm_end >= mm->start_brk) {
  1240. seq_printf(m, " heap");
  1241. } else {
  1242. pid_t tid = vm_is_stack(task, vma, is_pid);
  1243. if (tid != 0) {
  1244. /*
  1245. * Thread stack in /proc/PID/task/TID/maps or
  1246. * the main process stack.
  1247. */
  1248. if (!is_pid || (vma->vm_start <= mm->start_stack &&
  1249. vma->vm_end >= mm->start_stack))
  1250. seq_printf(m, " stack");
  1251. else
  1252. seq_printf(m, " stack:%d", tid);
  1253. }
  1254. }
  1255. if (is_vm_hugetlb_page(vma))
  1256. seq_printf(m, " huge");
  1257. walk_page_range(vma->vm_start, vma->vm_end, &walk);
  1258. if (!md->pages)
  1259. goto out;
  1260. if (md->anon)
  1261. seq_printf(m, " anon=%lu", md->anon);
  1262. if (md->dirty)
  1263. seq_printf(m, " dirty=%lu", md->dirty);
  1264. if (md->pages != md->anon && md->pages != md->dirty)
  1265. seq_printf(m, " mapped=%lu", md->pages);
  1266. if (md->mapcount_max > 1)
  1267. seq_printf(m, " mapmax=%lu", md->mapcount_max);
  1268. if (md->swapcache)
  1269. seq_printf(m, " swapcache=%lu", md->swapcache);
  1270. if (md->active < md->pages && !is_vm_hugetlb_page(vma))
  1271. seq_printf(m, " active=%lu", md->active);
  1272. if (md->writeback)
  1273. seq_printf(m, " writeback=%lu", md->writeback);
  1274. for_each_node_state(nid, N_MEMORY)
  1275. if (md->node[nid])
  1276. seq_printf(m, " N%d=%lu", nid, md->node[nid]);
  1277. out:
  1278. seq_putc(m, '\n');
  1279. if (m->count < m->size)
  1280. m->version = (vma != proc_priv->tail_vma) ? vma->vm_start : 0;
  1281. return 0;
  1282. }
  1283. static int show_pid_numa_map(struct seq_file *m, void *v)
  1284. {
  1285. return show_numa_map(m, v, 1);
  1286. }
  1287. static int show_tid_numa_map(struct seq_file *m, void *v)
  1288. {
  1289. return show_numa_map(m, v, 0);
  1290. }
  1291. static const struct seq_operations proc_pid_numa_maps_op = {
  1292. .start = m_start,
  1293. .next = m_next,
  1294. .stop = m_stop,
  1295. .show = show_pid_numa_map,
  1296. };
  1297. static const struct seq_operations proc_tid_numa_maps_op = {
  1298. .start = m_start,
  1299. .next = m_next,
  1300. .stop = m_stop,
  1301. .show = show_tid_numa_map,
  1302. };
  1303. static int numa_maps_open(struct inode *inode, struct file *file,
  1304. const struct seq_operations *ops)
  1305. {
  1306. struct numa_maps_private *priv;
  1307. int ret = -ENOMEM;
  1308. priv = kzalloc(sizeof(*priv), GFP_KERNEL);
  1309. if (priv) {
  1310. priv->proc_maps.pid = proc_pid(inode);
  1311. ret = seq_open(file, ops);
  1312. if (!ret) {
  1313. struct seq_file *m = file->private_data;
  1314. m->private = priv;
  1315. } else {
  1316. kfree(priv);
  1317. }
  1318. }
  1319. return ret;
  1320. }
  1321. static int pid_numa_maps_open(struct inode *inode, struct file *file)
  1322. {
  1323. return numa_maps_open(inode, file, &proc_pid_numa_maps_op);
  1324. }
  1325. static int tid_numa_maps_open(struct inode *inode, struct file *file)
  1326. {
  1327. return numa_maps_open(inode, file, &proc_tid_numa_maps_op);
  1328. }
  1329. const struct file_operations proc_pid_numa_maps_operations = {
  1330. .open = pid_numa_maps_open,
  1331. .read = seq_read,
  1332. .llseek = seq_lseek,
  1333. .release = seq_release_private,
  1334. };
  1335. const struct file_operations proc_tid_numa_maps_operations = {
  1336. .open = tid_numa_maps_open,
  1337. .read = seq_read,
  1338. .llseek = seq_lseek,
  1339. .release = seq_release_private,
  1340. };
  1341. #endif /* CONFIG_NUMA */