task_mmu.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545
  1. #include <linux/mm.h>
  2. #include <linux/hugetlb.h>
  3. #include <linux/mount.h>
  4. #include <linux/seq_file.h>
  5. #include <linux/highmem.h>
  6. #include <linux/pagemap.h>
  7. #include <linux/mempolicy.h>
  8. #include <asm/elf.h>
  9. #include <asm/uaccess.h>
  10. #include <asm/tlbflush.h>
  11. #include "internal.h"
  12. char *task_mem(struct mm_struct *mm, char *buffer)
  13. {
  14. unsigned long data, text, lib;
  15. unsigned long hiwater_vm, total_vm, hiwater_rss, total_rss;
  16. /*
  17. * Note: to minimize their overhead, mm maintains hiwater_vm and
  18. * hiwater_rss only when about to *lower* total_vm or rss. Any
  19. * collector of these hiwater stats must therefore get total_vm
  20. * and rss too, which will usually be the higher. Barriers? not
  21. * worth the effort, such snapshots can always be inconsistent.
  22. */
  23. hiwater_vm = total_vm = mm->total_vm;
  24. if (hiwater_vm < mm->hiwater_vm)
  25. hiwater_vm = mm->hiwater_vm;
  26. hiwater_rss = total_rss = get_mm_rss(mm);
  27. if (hiwater_rss < mm->hiwater_rss)
  28. hiwater_rss = mm->hiwater_rss;
  29. data = mm->total_vm - mm->shared_vm - mm->stack_vm;
  30. text = (PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK)) >> 10;
  31. lib = (mm->exec_vm << (PAGE_SHIFT-10)) - text;
  32. buffer += sprintf(buffer,
  33. "VmPeak:\t%8lu kB\n"
  34. "VmSize:\t%8lu kB\n"
  35. "VmLck:\t%8lu kB\n"
  36. "VmHWM:\t%8lu kB\n"
  37. "VmRSS:\t%8lu kB\n"
  38. "VmData:\t%8lu kB\n"
  39. "VmStk:\t%8lu kB\n"
  40. "VmExe:\t%8lu kB\n"
  41. "VmLib:\t%8lu kB\n"
  42. "VmPTE:\t%8lu kB\n",
  43. hiwater_vm << (PAGE_SHIFT-10),
  44. (total_vm - mm->reserved_vm) << (PAGE_SHIFT-10),
  45. mm->locked_vm << (PAGE_SHIFT-10),
  46. hiwater_rss << (PAGE_SHIFT-10),
  47. total_rss << (PAGE_SHIFT-10),
  48. data << (PAGE_SHIFT-10),
  49. mm->stack_vm << (PAGE_SHIFT-10), text, lib,
  50. (PTRS_PER_PTE*sizeof(pte_t)*mm->nr_ptes) >> 10);
  51. return buffer;
  52. }
  53. unsigned long task_vsize(struct mm_struct *mm)
  54. {
  55. return PAGE_SIZE * mm->total_vm;
  56. }
  57. int task_statm(struct mm_struct *mm, int *shared, int *text,
  58. int *data, int *resident)
  59. {
  60. *shared = get_mm_counter(mm, file_rss);
  61. *text = (PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK))
  62. >> PAGE_SHIFT;
  63. *data = mm->total_vm - mm->shared_vm;
  64. *resident = *shared + get_mm_counter(mm, anon_rss);
  65. return mm->total_vm;
  66. }
  67. int proc_exe_link(struct inode *inode, struct dentry **dentry, struct vfsmount **mnt)
  68. {
  69. struct vm_area_struct * vma;
  70. int result = -ENOENT;
  71. struct task_struct *task = get_proc_task(inode);
  72. struct mm_struct * mm = NULL;
  73. if (task) {
  74. mm = get_task_mm(task);
  75. put_task_struct(task);
  76. }
  77. if (!mm)
  78. goto out;
  79. down_read(&mm->mmap_sem);
  80. vma = mm->mmap;
  81. while (vma) {
  82. if ((vma->vm_flags & VM_EXECUTABLE) && vma->vm_file)
  83. break;
  84. vma = vma->vm_next;
  85. }
  86. if (vma) {
  87. *mnt = mntget(vma->vm_file->f_path.mnt);
  88. *dentry = dget(vma->vm_file->f_path.dentry);
  89. result = 0;
  90. }
  91. up_read(&mm->mmap_sem);
  92. mmput(mm);
  93. out:
  94. return result;
  95. }
  96. static void pad_len_spaces(struct seq_file *m, int len)
  97. {
  98. len = 25 + sizeof(void*) * 6 - len;
  99. if (len < 1)
  100. len = 1;
  101. seq_printf(m, "%*c", len, ' ');
  102. }
  103. struct mem_size_stats
  104. {
  105. unsigned long resident;
  106. unsigned long shared_clean;
  107. unsigned long shared_dirty;
  108. unsigned long private_clean;
  109. unsigned long private_dirty;
  110. unsigned long referenced;
  111. };
  112. struct pmd_walker {
  113. struct vm_area_struct *vma;
  114. void *private;
  115. void (*action)(struct vm_area_struct *, pmd_t *, unsigned long,
  116. unsigned long, void *);
  117. };
  118. static int show_map_internal(struct seq_file *m, void *v, struct mem_size_stats *mss)
  119. {
  120. struct proc_maps_private *priv = m->private;
  121. struct task_struct *task = priv->task;
  122. struct vm_area_struct *vma = v;
  123. struct mm_struct *mm = vma->vm_mm;
  124. struct file *file = vma->vm_file;
  125. int flags = vma->vm_flags;
  126. unsigned long ino = 0;
  127. dev_t dev = 0;
  128. int len;
  129. if (file) {
  130. struct inode *inode = vma->vm_file->f_path.dentry->d_inode;
  131. dev = inode->i_sb->s_dev;
  132. ino = inode->i_ino;
  133. }
  134. seq_printf(m, "%08lx-%08lx %c%c%c%c %08lx %02x:%02x %lu %n",
  135. vma->vm_start,
  136. vma->vm_end,
  137. flags & VM_READ ? 'r' : '-',
  138. flags & VM_WRITE ? 'w' : '-',
  139. flags & VM_EXEC ? 'x' : '-',
  140. flags & VM_MAYSHARE ? 's' : 'p',
  141. vma->vm_pgoff << PAGE_SHIFT,
  142. MAJOR(dev), MINOR(dev), ino, &len);
  143. /*
  144. * Print the dentry name for named mappings, and a
  145. * special [heap] marker for the heap:
  146. */
  147. if (file) {
  148. pad_len_spaces(m, len);
  149. seq_path(m, file->f_path.mnt, file->f_path.dentry, "\n");
  150. } else {
  151. const char *name = arch_vma_name(vma);
  152. if (!name) {
  153. if (mm) {
  154. if (vma->vm_start <= mm->start_brk &&
  155. vma->vm_end >= mm->brk) {
  156. name = "[heap]";
  157. } else if (vma->vm_start <= mm->start_stack &&
  158. vma->vm_end >= mm->start_stack) {
  159. name = "[stack]";
  160. }
  161. } else {
  162. name = "[vdso]";
  163. }
  164. }
  165. if (name) {
  166. pad_len_spaces(m, len);
  167. seq_puts(m, name);
  168. }
  169. }
  170. seq_putc(m, '\n');
  171. if (mss)
  172. seq_printf(m,
  173. "Size: %8lu kB\n"
  174. "Rss: %8lu kB\n"
  175. "Shared_Clean: %8lu kB\n"
  176. "Shared_Dirty: %8lu kB\n"
  177. "Private_Clean: %8lu kB\n"
  178. "Private_Dirty: %8lu kB\n"
  179. "Referenced: %8lu kB\n",
  180. (vma->vm_end - vma->vm_start) >> 10,
  181. mss->resident >> 10,
  182. mss->shared_clean >> 10,
  183. mss->shared_dirty >> 10,
  184. mss->private_clean >> 10,
  185. mss->private_dirty >> 10,
  186. mss->referenced >> 10);
  187. if (m->count < m->size) /* vma is copied successfully */
  188. m->version = (vma != get_gate_vma(task))? vma->vm_start: 0;
  189. return 0;
  190. }
  191. static int show_map(struct seq_file *m, void *v)
  192. {
  193. return show_map_internal(m, v, NULL);
  194. }
  195. static void smaps_pte_range(struct vm_area_struct *vma, pmd_t *pmd,
  196. unsigned long addr, unsigned long end,
  197. void *private)
  198. {
  199. struct mem_size_stats *mss = private;
  200. pte_t *pte, ptent;
  201. spinlock_t *ptl;
  202. struct page *page;
  203. pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
  204. for (; addr != end; pte++, addr += PAGE_SIZE) {
  205. ptent = *pte;
  206. if (!pte_present(ptent))
  207. continue;
  208. mss->resident += PAGE_SIZE;
  209. page = vm_normal_page(vma, addr, ptent);
  210. if (!page)
  211. continue;
  212. /* Accumulate the size in pages that have been accessed. */
  213. if (pte_young(ptent) || PageReferenced(page))
  214. mss->referenced += PAGE_SIZE;
  215. if (page_mapcount(page) >= 2) {
  216. if (pte_dirty(ptent))
  217. mss->shared_dirty += PAGE_SIZE;
  218. else
  219. mss->shared_clean += PAGE_SIZE;
  220. } else {
  221. if (pte_dirty(ptent))
  222. mss->private_dirty += PAGE_SIZE;
  223. else
  224. mss->private_clean += PAGE_SIZE;
  225. }
  226. }
  227. pte_unmap_unlock(pte - 1, ptl);
  228. cond_resched();
  229. }
  230. static void clear_refs_pte_range(struct vm_area_struct *vma, pmd_t *pmd,
  231. unsigned long addr, unsigned long end,
  232. void *private)
  233. {
  234. pte_t *pte, ptent;
  235. spinlock_t *ptl;
  236. struct page *page;
  237. pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
  238. for (; addr != end; pte++, addr += PAGE_SIZE) {
  239. ptent = *pte;
  240. if (!pte_present(ptent))
  241. continue;
  242. page = vm_normal_page(vma, addr, ptent);
  243. if (!page)
  244. continue;
  245. /* Clear accessed and referenced bits. */
  246. ptep_test_and_clear_young(vma, addr, pte);
  247. ClearPageReferenced(page);
  248. }
  249. pte_unmap_unlock(pte - 1, ptl);
  250. cond_resched();
  251. }
  252. static inline void walk_pmd_range(struct pmd_walker *walker, pud_t *pud,
  253. unsigned long addr, unsigned long end)
  254. {
  255. pmd_t *pmd;
  256. unsigned long next;
  257. for (pmd = pmd_offset(pud, addr); addr != end;
  258. pmd++, addr = next) {
  259. next = pmd_addr_end(addr, end);
  260. if (pmd_none_or_clear_bad(pmd))
  261. continue;
  262. walker->action(walker->vma, pmd, addr, next, walker->private);
  263. }
  264. }
  265. static inline void walk_pud_range(struct pmd_walker *walker, pgd_t *pgd,
  266. unsigned long addr, unsigned long end)
  267. {
  268. pud_t *pud;
  269. unsigned long next;
  270. for (pud = pud_offset(pgd, addr); addr != end;
  271. pud++, addr = next) {
  272. next = pud_addr_end(addr, end);
  273. if (pud_none_or_clear_bad(pud))
  274. continue;
  275. walk_pmd_range(walker, pud, addr, next);
  276. }
  277. }
  278. /*
  279. * walk_page_range - walk the page tables of a VMA with a callback
  280. * @vma - VMA to walk
  281. * @action - callback invoked for every bottom-level (PTE) page table
  282. * @private - private data passed to the callback function
  283. *
  284. * Recursively walk the page table for the memory area in a VMA, calling
  285. * a callback for every bottom-level (PTE) page table.
  286. */
  287. static inline void walk_page_range(struct vm_area_struct *vma,
  288. void (*action)(struct vm_area_struct *,
  289. pmd_t *, unsigned long,
  290. unsigned long, void *),
  291. void *private)
  292. {
  293. unsigned long addr = vma->vm_start;
  294. unsigned long end = vma->vm_end;
  295. struct pmd_walker walker = {
  296. .vma = vma,
  297. .private = private,
  298. .action = action,
  299. };
  300. pgd_t *pgd;
  301. unsigned long next;
  302. for (pgd = pgd_offset(vma->vm_mm, addr); addr != end;
  303. pgd++, addr = next) {
  304. next = pgd_addr_end(addr, end);
  305. if (pgd_none_or_clear_bad(pgd))
  306. continue;
  307. walk_pud_range(&walker, pgd, addr, next);
  308. }
  309. }
  310. static int show_smap(struct seq_file *m, void *v)
  311. {
  312. struct vm_area_struct *vma = v;
  313. struct mem_size_stats mss;
  314. memset(&mss, 0, sizeof mss);
  315. if (vma->vm_mm && !is_vm_hugetlb_page(vma))
  316. walk_page_range(vma, smaps_pte_range, &mss);
  317. return show_map_internal(m, v, &mss);
  318. }
  319. void clear_refs_smap(struct mm_struct *mm)
  320. {
  321. struct vm_area_struct *vma;
  322. down_read(&mm->mmap_sem);
  323. for (vma = mm->mmap; vma; vma = vma->vm_next)
  324. if (vma->vm_mm && !is_vm_hugetlb_page(vma))
  325. walk_page_range(vma, clear_refs_pte_range, NULL);
  326. flush_tlb_mm(mm);
  327. up_read(&mm->mmap_sem);
  328. }
  329. static void *m_start(struct seq_file *m, loff_t *pos)
  330. {
  331. struct proc_maps_private *priv = m->private;
  332. unsigned long last_addr = m->version;
  333. struct mm_struct *mm;
  334. struct vm_area_struct *vma, *tail_vma = NULL;
  335. loff_t l = *pos;
  336. /* Clear the per syscall fields in priv */
  337. priv->task = NULL;
  338. priv->tail_vma = NULL;
  339. /*
  340. * We remember last_addr rather than next_addr to hit with
  341. * mmap_cache most of the time. We have zero last_addr at
  342. * the beginning and also after lseek. We will have -1 last_addr
  343. * after the end of the vmas.
  344. */
  345. if (last_addr == -1UL)
  346. return NULL;
  347. priv->task = get_pid_task(priv->pid, PIDTYPE_PID);
  348. if (!priv->task)
  349. return NULL;
  350. mm = get_task_mm(priv->task);
  351. if (!mm)
  352. return NULL;
  353. priv->tail_vma = tail_vma = get_gate_vma(priv->task);
  354. down_read(&mm->mmap_sem);
  355. /* Start with last addr hint */
  356. if (last_addr && (vma = find_vma(mm, last_addr))) {
  357. vma = vma->vm_next;
  358. goto out;
  359. }
  360. /*
  361. * Check the vma index is within the range and do
  362. * sequential scan until m_index.
  363. */
  364. vma = NULL;
  365. if ((unsigned long)l < mm->map_count) {
  366. vma = mm->mmap;
  367. while (l-- && vma)
  368. vma = vma->vm_next;
  369. goto out;
  370. }
  371. if (l != mm->map_count)
  372. tail_vma = NULL; /* After gate vma */
  373. out:
  374. if (vma)
  375. return vma;
  376. /* End of vmas has been reached */
  377. m->version = (tail_vma != NULL)? 0: -1UL;
  378. up_read(&mm->mmap_sem);
  379. mmput(mm);
  380. return tail_vma;
  381. }
  382. static void vma_stop(struct proc_maps_private *priv, struct vm_area_struct *vma)
  383. {
  384. if (vma && vma != priv->tail_vma) {
  385. struct mm_struct *mm = vma->vm_mm;
  386. up_read(&mm->mmap_sem);
  387. mmput(mm);
  388. }
  389. }
  390. static void *m_next(struct seq_file *m, void *v, loff_t *pos)
  391. {
  392. struct proc_maps_private *priv = m->private;
  393. struct vm_area_struct *vma = v;
  394. struct vm_area_struct *tail_vma = priv->tail_vma;
  395. (*pos)++;
  396. if (vma && (vma != tail_vma) && vma->vm_next)
  397. return vma->vm_next;
  398. vma_stop(priv, vma);
  399. return (vma != tail_vma)? tail_vma: NULL;
  400. }
  401. static void m_stop(struct seq_file *m, void *v)
  402. {
  403. struct proc_maps_private *priv = m->private;
  404. struct vm_area_struct *vma = v;
  405. vma_stop(priv, vma);
  406. if (priv->task)
  407. put_task_struct(priv->task);
  408. }
  409. static struct seq_operations proc_pid_maps_op = {
  410. .start = m_start,
  411. .next = m_next,
  412. .stop = m_stop,
  413. .show = show_map
  414. };
  415. static struct seq_operations proc_pid_smaps_op = {
  416. .start = m_start,
  417. .next = m_next,
  418. .stop = m_stop,
  419. .show = show_smap
  420. };
  421. static int do_maps_open(struct inode *inode, struct file *file,
  422. struct seq_operations *ops)
  423. {
  424. struct proc_maps_private *priv;
  425. int ret = -ENOMEM;
  426. priv = kzalloc(sizeof(*priv), GFP_KERNEL);
  427. if (priv) {
  428. priv->pid = proc_pid(inode);
  429. ret = seq_open(file, ops);
  430. if (!ret) {
  431. struct seq_file *m = file->private_data;
  432. m->private = priv;
  433. } else {
  434. kfree(priv);
  435. }
  436. }
  437. return ret;
  438. }
  439. static int maps_open(struct inode *inode, struct file *file)
  440. {
  441. return do_maps_open(inode, file, &proc_pid_maps_op);
  442. }
  443. const struct file_operations proc_maps_operations = {
  444. .open = maps_open,
  445. .read = seq_read,
  446. .llseek = seq_lseek,
  447. .release = seq_release_private,
  448. };
  449. #ifdef CONFIG_NUMA
  450. extern int show_numa_map(struct seq_file *m, void *v);
  451. static struct seq_operations proc_pid_numa_maps_op = {
  452. .start = m_start,
  453. .next = m_next,
  454. .stop = m_stop,
  455. .show = show_numa_map
  456. };
  457. static int numa_maps_open(struct inode *inode, struct file *file)
  458. {
  459. return do_maps_open(inode, file, &proc_pid_numa_maps_op);
  460. }
  461. const struct file_operations proc_numa_maps_operations = {
  462. .open = numa_maps_open,
  463. .read = seq_read,
  464. .llseek = seq_lseek,
  465. .release = seq_release_private,
  466. };
  467. #endif
  468. static int smaps_open(struct inode *inode, struct file *file)
  469. {
  470. return do_maps_open(inode, file, &proc_pid_smaps_op);
  471. }
  472. const struct file_operations proc_smaps_operations = {
  473. .open = smaps_open,
  474. .read = seq_read,
  475. .llseek = seq_lseek,
  476. .release = seq_release_private,
  477. };