task_nommu.c 6.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302
  1. // SPDX-License-Identifier: GPL-2.0
  2. #include <linux/mm.h>
  3. #include <linux/file.h>
  4. #include <linux/fdtable.h>
  5. #include <linux/fs_struct.h>
  6. #include <linux/mount.h>
  7. #include <linux/ptrace.h>
  8. #include <linux/slab.h>
  9. #include <linux/seq_file.h>
  10. #include <linux/sched/mm.h>
  11. #include "internal.h"
  12. /*
  13. * Logic: we've got two memory sums for each process, "shared", and
  14. * "non-shared". Shared memory may get counted more than once, for
  15. * each process that owns it. Non-shared memory is counted
  16. * accurately.
  17. */
  18. void task_mem(struct seq_file *m, struct mm_struct *mm)
  19. {
  20. struct vm_area_struct *vma;
  21. struct vm_region *region;
  22. struct rb_node *p;
  23. unsigned long bytes = 0, sbytes = 0, slack = 0, size;
  24. down_read(&mm->mmap_sem);
  25. for (p = rb_first(&mm->mm_rb); p; p = rb_next(p)) {
  26. vma = rb_entry(p, struct vm_area_struct, vm_rb);
  27. bytes += kobjsize(vma);
  28. region = vma->vm_region;
  29. if (region) {
  30. size = kobjsize(region);
  31. size += region->vm_end - region->vm_start;
  32. } else {
  33. size = vma->vm_end - vma->vm_start;
  34. }
  35. if (atomic_read(&mm->mm_count) > 1 ||
  36. vma->vm_flags & VM_MAYSHARE) {
  37. sbytes += size;
  38. } else {
  39. bytes += size;
  40. if (region)
  41. slack = region->vm_end - vma->vm_end;
  42. }
  43. }
  44. if (atomic_read(&mm->mm_count) > 1)
  45. sbytes += kobjsize(mm);
  46. else
  47. bytes += kobjsize(mm);
  48. if (current->fs && current->fs->users > 1)
  49. sbytes += kobjsize(current->fs);
  50. else
  51. bytes += kobjsize(current->fs);
  52. if (current->files && atomic_read(&current->files->count) > 1)
  53. sbytes += kobjsize(current->files);
  54. else
  55. bytes += kobjsize(current->files);
  56. if (current->sighand && atomic_read(&current->sighand->count) > 1)
  57. sbytes += kobjsize(current->sighand);
  58. else
  59. bytes += kobjsize(current->sighand);
  60. bytes += kobjsize(current); /* includes kernel stack */
  61. seq_printf(m,
  62. "Mem:\t%8lu bytes\n"
  63. "Slack:\t%8lu bytes\n"
  64. "Shared:\t%8lu bytes\n",
  65. bytes, slack, sbytes);
  66. up_read(&mm->mmap_sem);
  67. }
  68. unsigned long task_vsize(struct mm_struct *mm)
  69. {
  70. struct vm_area_struct *vma;
  71. struct rb_node *p;
  72. unsigned long vsize = 0;
  73. down_read(&mm->mmap_sem);
  74. for (p = rb_first(&mm->mm_rb); p; p = rb_next(p)) {
  75. vma = rb_entry(p, struct vm_area_struct, vm_rb);
  76. vsize += vma->vm_end - vma->vm_start;
  77. }
  78. up_read(&mm->mmap_sem);
  79. return vsize;
  80. }
  81. unsigned long task_statm(struct mm_struct *mm,
  82. unsigned long *shared, unsigned long *text,
  83. unsigned long *data, unsigned long *resident)
  84. {
  85. struct vm_area_struct *vma;
  86. struct vm_region *region;
  87. struct rb_node *p;
  88. unsigned long size = kobjsize(mm);
  89. down_read(&mm->mmap_sem);
  90. for (p = rb_first(&mm->mm_rb); p; p = rb_next(p)) {
  91. vma = rb_entry(p, struct vm_area_struct, vm_rb);
  92. size += kobjsize(vma);
  93. region = vma->vm_region;
  94. if (region) {
  95. size += kobjsize(region);
  96. size += region->vm_end - region->vm_start;
  97. }
  98. }
  99. *text = (PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK))
  100. >> PAGE_SHIFT;
  101. *data = (PAGE_ALIGN(mm->start_stack) - (mm->start_data & PAGE_MASK))
  102. >> PAGE_SHIFT;
  103. up_read(&mm->mmap_sem);
  104. size >>= PAGE_SHIFT;
  105. size += *text + *data;
  106. *resident = size;
  107. return size;
  108. }
  109. static int is_stack(struct vm_area_struct *vma)
  110. {
  111. struct mm_struct *mm = vma->vm_mm;
  112. /*
  113. * We make no effort to guess what a given thread considers to be
  114. * its "stack". It's not even well-defined for programs written
  115. * languages like Go.
  116. */
  117. return vma->vm_start <= mm->start_stack &&
  118. vma->vm_end >= mm->start_stack;
  119. }
  120. /*
  121. * display a single VMA to a sequenced file
  122. */
  123. static int nommu_vma_show(struct seq_file *m, struct vm_area_struct *vma)
  124. {
  125. struct mm_struct *mm = vma->vm_mm;
  126. unsigned long ino = 0;
  127. struct file *file;
  128. dev_t dev = 0;
  129. int flags;
  130. unsigned long long pgoff = 0;
  131. flags = vma->vm_flags;
  132. file = vma->vm_file;
  133. if (file) {
  134. struct inode *inode = file_inode(vma->vm_file);
  135. dev = inode->i_sb->s_dev;
  136. ino = inode->i_ino;
  137. pgoff = (loff_t)vma->vm_pgoff << PAGE_SHIFT;
  138. }
  139. seq_setwidth(m, 25 + sizeof(void *) * 6 - 1);
  140. seq_printf(m,
  141. "%08lx-%08lx %c%c%c%c %08llx %02x:%02x %lu ",
  142. vma->vm_start,
  143. vma->vm_end,
  144. flags & VM_READ ? 'r' : '-',
  145. flags & VM_WRITE ? 'w' : '-',
  146. flags & VM_EXEC ? 'x' : '-',
  147. flags & VM_MAYSHARE ? flags & VM_SHARED ? 'S' : 's' : 'p',
  148. pgoff,
  149. MAJOR(dev), MINOR(dev), ino);
  150. if (file) {
  151. seq_pad(m, ' ');
  152. seq_file_path(m, file, "");
  153. } else if (mm && is_stack(vma)) {
  154. seq_pad(m, ' ');
  155. seq_printf(m, "[stack]");
  156. }
  157. seq_putc(m, '\n');
  158. return 0;
  159. }
  160. /*
  161. * display mapping lines for a particular process's /proc/pid/maps
  162. */
  163. static int show_map(struct seq_file *m, void *_p)
  164. {
  165. struct rb_node *p = _p;
  166. return nommu_vma_show(m, rb_entry(p, struct vm_area_struct, vm_rb));
  167. }
  168. static void *m_start(struct seq_file *m, loff_t *pos)
  169. {
  170. struct proc_maps_private *priv = m->private;
  171. struct mm_struct *mm;
  172. struct rb_node *p;
  173. loff_t n = *pos;
  174. /* pin the task and mm whilst we play with them */
  175. priv->task = get_proc_task(priv->inode);
  176. if (!priv->task)
  177. return ERR_PTR(-ESRCH);
  178. mm = priv->mm;
  179. if (!mm || !mmget_not_zero(mm))
  180. return NULL;
  181. if (down_read_killable(&mm->mmap_sem)) {
  182. mmput(mm);
  183. return ERR_PTR(-EINTR);
  184. }
  185. /* start from the Nth VMA */
  186. for (p = rb_first(&mm->mm_rb); p; p = rb_next(p))
  187. if (n-- == 0)
  188. return p;
  189. up_read(&mm->mmap_sem);
  190. mmput(mm);
  191. return NULL;
  192. }
  193. static void m_stop(struct seq_file *m, void *_vml)
  194. {
  195. struct proc_maps_private *priv = m->private;
  196. if (!IS_ERR_OR_NULL(_vml)) {
  197. up_read(&priv->mm->mmap_sem);
  198. mmput(priv->mm);
  199. }
  200. if (priv->task) {
  201. put_task_struct(priv->task);
  202. priv->task = NULL;
  203. }
  204. }
  205. static void *m_next(struct seq_file *m, void *_p, loff_t *pos)
  206. {
  207. struct rb_node *p = _p;
  208. (*pos)++;
  209. return p ? rb_next(p) : NULL;
  210. }
  211. static const struct seq_operations proc_pid_maps_ops = {
  212. .start = m_start,
  213. .next = m_next,
  214. .stop = m_stop,
  215. .show = show_map
  216. };
  217. static int maps_open(struct inode *inode, struct file *file,
  218. const struct seq_operations *ops)
  219. {
  220. struct proc_maps_private *priv;
  221. priv = __seq_open_private(file, ops, sizeof(*priv));
  222. if (!priv)
  223. return -ENOMEM;
  224. priv->inode = inode;
  225. priv->mm = proc_mem_open(inode, PTRACE_MODE_READ);
  226. if (IS_ERR(priv->mm)) {
  227. int err = PTR_ERR(priv->mm);
  228. seq_release_private(inode, file);
  229. return err;
  230. }
  231. return 0;
  232. }
  233. static int map_release(struct inode *inode, struct file *file)
  234. {
  235. struct seq_file *seq = file->private_data;
  236. struct proc_maps_private *priv = seq->private;
  237. if (priv->mm)
  238. mmdrop(priv->mm);
  239. return seq_release_private(inode, file);
  240. }
  241. static int pid_maps_open(struct inode *inode, struct file *file)
  242. {
  243. return maps_open(inode, file, &proc_pid_maps_ops);
  244. }
  245. const struct file_operations proc_pid_maps_operations = {
  246. .open = pid_maps_open,
  247. .read = seq_read,
  248. .llseek = seq_lseek,
  249. .release = map_release,
  250. };