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>
10 #include <asm/uaccess.h>
11 #include <asm/tlbflush.h>
14 char *task_mem(struct mm_struct *mm, char *buffer)
16 unsigned long data, text, lib;
17 unsigned long hiwater_vm, total_vm, hiwater_rss, total_rss;
20 * Note: to minimize their overhead, mm maintains hiwater_vm and
21 * hiwater_rss only when about to *lower* total_vm or rss. Any
22 * collector of these hiwater stats must therefore get total_vm
23 * and rss too, which will usually be the higher. Barriers? not
24 * worth the effort, such snapshots can always be inconsistent.
26 hiwater_vm = total_vm = mm->total_vm;
27 if (hiwater_vm < mm->hiwater_vm)
28 hiwater_vm = mm->hiwater_vm;
29 hiwater_rss = total_rss = get_mm_rss(mm);
30 if (hiwater_rss < mm->hiwater_rss)
31 hiwater_rss = mm->hiwater_rss;
33 data = mm->total_vm - mm->shared_vm - mm->stack_vm;
34 text = (PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK)) >> 10;
35 lib = (mm->exec_vm << (PAGE_SHIFT-10)) - text;
36 buffer += sprintf(buffer,
47 hiwater_vm << (PAGE_SHIFT-10),
48 (total_vm - mm->reserved_vm) << (PAGE_SHIFT-10),
49 mm->locked_vm << (PAGE_SHIFT-10),
50 hiwater_rss << (PAGE_SHIFT-10),
51 total_rss << (PAGE_SHIFT-10),
52 data << (PAGE_SHIFT-10),
53 mm->stack_vm << (PAGE_SHIFT-10), text, lib,
54 (PTRS_PER_PTE*sizeof(pte_t)*mm->nr_ptes) >> 10);
58 unsigned long task_vsize(struct mm_struct *mm)
60 return PAGE_SIZE * mm->total_vm;
63 int task_statm(struct mm_struct *mm, int *shared, int *text,
64 int *data, int *resident)
66 *shared = get_mm_counter(mm, file_rss);
67 *text = (PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK))
69 *data = mm->total_vm - mm->shared_vm;
70 *resident = *shared + get_mm_counter(mm, anon_rss);
74 int proc_exe_link(struct inode *inode, struct dentry **dentry, struct vfsmount **mnt)
76 struct vm_area_struct * vma;
78 struct task_struct *task = get_proc_task(inode);
79 struct mm_struct * mm = NULL;
82 mm = get_task_mm(task);
83 put_task_struct(task);
87 down_read(&mm->mmap_sem);
91 if ((vma->vm_flags & VM_EXECUTABLE) && vma->vm_file)
97 *mnt = mntget(vma->vm_file->f_vfsmnt);
98 *dentry = dget(vma->vm_file->f_dentry);
102 up_read(&mm->mmap_sem);
108 static void pad_len_spaces(struct seq_file *m, int len)
110 len = 25 + sizeof(void*) * 6 - len;
113 seq_printf(m, "%*c", len, ' ');
116 struct mem_size_stats
118 unsigned long resident;
119 unsigned long shared_clean;
120 unsigned long shared_dirty;
121 unsigned long private_clean;
122 unsigned long private_dirty;
125 static int show_map_internal(struct seq_file *m, void *v, struct mem_size_stats *mss)
127 struct proc_maps_private *priv = m->private;
128 struct task_struct *task = priv->task;
129 struct vm_area_struct *vma = v;
130 struct mm_struct *mm = vma->vm_mm;
131 struct file *file = vma->vm_file;
132 int flags = vma->vm_flags;
133 unsigned long ino = 0;
138 struct inode *inode = vma->vm_file->f_dentry->d_inode;
139 dev = inode->i_sb->s_dev;
143 seq_printf(m, "%08lx-%08lx %c%c%c%c %08lx %02x:%02x %lu %n",
146 flags & VM_READ ? 'r' : '-',
147 flags & VM_WRITE ? 'w' : '-',
148 flags & VM_EXEC ? 'x' : '-',
149 flags & VM_MAYSHARE ? 's' : 'p',
150 vma->vm_pgoff << PAGE_SHIFT,
151 MAJOR(dev), MINOR(dev), ino, &len);
154 * Print the dentry name for named mappings, and a
155 * special [heap] marker for the heap:
158 pad_len_spaces(m, len);
159 seq_path(m, file->f_vfsmnt, file->f_dentry, "\n");
162 if (vma->vm_start <= mm->start_brk &&
163 vma->vm_end >= mm->brk) {
164 pad_len_spaces(m, len);
165 seq_puts(m, "[heap]");
167 if (vma->vm_start <= mm->start_stack &&
168 vma->vm_end >= mm->start_stack) {
170 pad_len_spaces(m, len);
171 seq_puts(m, "[stack]");
175 pad_len_spaces(m, len);
176 seq_puts(m, "[vdso]");
185 "Shared_Clean: %8lu kB\n"
186 "Shared_Dirty: %8lu kB\n"
187 "Private_Clean: %8lu kB\n"
188 "Private_Dirty: %8lu kB\n",
189 (vma->vm_end - vma->vm_start) >> 10,
191 mss->shared_clean >> 10,
192 mss->shared_dirty >> 10,
193 mss->private_clean >> 10,
194 mss->private_dirty >> 10);
196 if (m->count < m->size) /* vma is copied successfully */
197 m->version = (vma != get_gate_vma(task))? vma->vm_start: 0;
201 static int show_map(struct seq_file *m, void *v)
203 return show_map_internal(m, v, NULL);
206 static void smaps_pte_range(struct vm_area_struct *vma, pmd_t *pmd,
207 unsigned long addr, unsigned long end,
208 struct mem_size_stats *mss)
214 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
217 if (!pte_present(ptent))
220 mss->resident += PAGE_SIZE;
222 page = vm_normal_page(vma, addr, ptent);
226 if (page_mapcount(page) >= 2) {
227 if (pte_dirty(ptent))
228 mss->shared_dirty += PAGE_SIZE;
230 mss->shared_clean += PAGE_SIZE;
232 if (pte_dirty(ptent))
233 mss->private_dirty += PAGE_SIZE;
235 mss->private_clean += PAGE_SIZE;
237 } while (pte++, addr += PAGE_SIZE, addr != end);
238 pte_unmap_unlock(pte - 1, ptl);
242 static inline void smaps_pmd_range(struct vm_area_struct *vma, pud_t *pud,
243 unsigned long addr, unsigned long end,
244 struct mem_size_stats *mss)
249 pmd = pmd_offset(pud, addr);
251 next = pmd_addr_end(addr, end);
252 if (pmd_none_or_clear_bad(pmd))
254 smaps_pte_range(vma, pmd, addr, next, mss);
255 } while (pmd++, addr = next, addr != end);
258 static inline void smaps_pud_range(struct vm_area_struct *vma, pgd_t *pgd,
259 unsigned long addr, unsigned long end,
260 struct mem_size_stats *mss)
265 pud = pud_offset(pgd, addr);
267 next = pud_addr_end(addr, end);
268 if (pud_none_or_clear_bad(pud))
270 smaps_pmd_range(vma, pud, addr, next, mss);
271 } while (pud++, addr = next, addr != end);
274 static inline void smaps_pgd_range(struct vm_area_struct *vma,
275 unsigned long addr, unsigned long end,
276 struct mem_size_stats *mss)
281 pgd = pgd_offset(vma->vm_mm, addr);
283 next = pgd_addr_end(addr, end);
284 if (pgd_none_or_clear_bad(pgd))
286 smaps_pud_range(vma, pgd, addr, next, mss);
287 } while (pgd++, addr = next, addr != end);
290 static int show_smap(struct seq_file *m, void *v)
292 struct vm_area_struct *vma = v;
293 struct mem_size_stats mss;
295 memset(&mss, 0, sizeof mss);
296 if (vma->vm_mm && !is_vm_hugetlb_page(vma))
297 smaps_pgd_range(vma, vma->vm_start, vma->vm_end, &mss);
298 return show_map_internal(m, v, &mss);
301 static void *m_start(struct seq_file *m, loff_t *pos)
303 struct proc_maps_private *priv = m->private;
304 unsigned long last_addr = m->version;
305 struct mm_struct *mm;
306 struct vm_area_struct *vma, *tail_vma = NULL;
309 /* Clear the per syscall fields in priv */
311 priv->tail_vma = NULL;
314 * We remember last_addr rather than next_addr to hit with
315 * mmap_cache most of the time. We have zero last_addr at
316 * the beginning and also after lseek. We will have -1 last_addr
317 * after the end of the vmas.
320 if (last_addr == -1UL)
323 priv->task = get_pid_task(priv->pid, PIDTYPE_PID);
327 mm = get_task_mm(priv->task);
331 priv->tail_vma = tail_vma = get_gate_vma(priv->task);
332 down_read(&mm->mmap_sem);
334 /* Start with last addr hint */
335 if (last_addr && (vma = find_vma(mm, last_addr))) {
341 * Check the vma index is within the range and do
342 * sequential scan until m_index.
345 if ((unsigned long)l < mm->map_count) {
352 if (l != mm->map_count)
353 tail_vma = NULL; /* After gate vma */
359 /* End of vmas has been reached */
360 m->version = (tail_vma != NULL)? 0: -1UL;
361 up_read(&mm->mmap_sem);
366 static void vma_stop(struct proc_maps_private *priv, struct vm_area_struct *vma)
368 if (vma && vma != priv->tail_vma) {
369 struct mm_struct *mm = vma->vm_mm;
370 up_read(&mm->mmap_sem);
375 static void *m_next(struct seq_file *m, void *v, loff_t *pos)
377 struct proc_maps_private *priv = m->private;
378 struct vm_area_struct *vma = v;
379 struct vm_area_struct *tail_vma = priv->tail_vma;
382 if (vma && (vma != tail_vma) && vma->vm_next)
385 return (vma != tail_vma)? tail_vma: NULL;
388 static void m_stop(struct seq_file *m, void *v)
390 struct proc_maps_private *priv = m->private;
391 struct vm_area_struct *vma = v;
395 put_task_struct(priv->task);
398 static struct seq_operations proc_pid_maps_op = {
405 static struct seq_operations proc_pid_smaps_op = {
412 static int do_maps_open(struct inode *inode, struct file *file,
413 struct seq_operations *ops)
415 struct proc_maps_private *priv;
417 priv = kzalloc(sizeof(*priv), GFP_KERNEL);
419 priv->pid = proc_pid(inode);
420 ret = seq_open(file, ops);
422 struct seq_file *m = file->private_data;
431 static int maps_open(struct inode *inode, struct file *file)
433 return do_maps_open(inode, file, &proc_pid_maps_op);
436 struct file_operations proc_maps_operations = {
440 .release = seq_release_private,
444 extern int show_numa_map(struct seq_file *m, void *v);
446 static struct seq_operations proc_pid_numa_maps_op = {
450 .show = show_numa_map
453 static int numa_maps_open(struct inode *inode, struct file *file)
455 return do_maps_open(inode, file, &proc_pid_numa_maps_op);
458 struct file_operations proc_numa_maps_operations = {
459 .open = numa_maps_open,
462 .release = seq_release_private,
466 static int smaps_open(struct inode *inode, struct file *file)
468 return do_maps_open(inode, file, &proc_pid_smaps_op);
471 struct file_operations proc_smaps_operations = {
475 .release = seq_release_private,