task_mmu.c 38 KB

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