task_mmu.c 38 KB

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