2 #include <linux/hugetlb.h>
3 #include <linux/mount.h>
4 #include <linux/seq_file.h>
5 #include <linux/highmem.h>
6 #include <linux/ptrace.h>
7 #include <linux/pagemap.h>
8 #include <linux/mempolicy.h>
9 #include <linux/swap.h>
10 #include <linux/swapops.h>
13 #include <asm/uaccess.h>
14 #include <asm/tlbflush.h>
17 void task_mem(struct seq_file
*m
, struct mm_struct
*mm
)
19 unsigned long data
, text
, lib
;
20 unsigned long hiwater_vm
, total_vm
, hiwater_rss
, total_rss
;
23 * Note: to minimize their overhead, mm maintains hiwater_vm and
24 * hiwater_rss only when about to *lower* total_vm or rss. Any
25 * collector of these hiwater stats must therefore get total_vm
26 * and rss too, which will usually be the higher. Barriers? not
27 * worth the effort, such snapshots can always be inconsistent.
29 hiwater_vm
= total_vm
= mm
->total_vm
;
30 if (hiwater_vm
< mm
->hiwater_vm
)
31 hiwater_vm
= mm
->hiwater_vm
;
32 hiwater_rss
= total_rss
= get_mm_rss(mm
);
33 if (hiwater_rss
< mm
->hiwater_rss
)
34 hiwater_rss
= mm
->hiwater_rss
;
36 data
= mm
->total_vm
- mm
->shared_vm
- mm
->stack_vm
;
37 text
= (PAGE_ALIGN(mm
->end_code
) - (mm
->start_code
& PAGE_MASK
)) >> 10;
38 lib
= (mm
->exec_vm
<< (PAGE_SHIFT
-10)) - text
;
50 hiwater_vm
<< (PAGE_SHIFT
-10),
51 (total_vm
- mm
->reserved_vm
) << (PAGE_SHIFT
-10),
52 mm
->locked_vm
<< (PAGE_SHIFT
-10),
53 hiwater_rss
<< (PAGE_SHIFT
-10),
54 total_rss
<< (PAGE_SHIFT
-10),
55 data
<< (PAGE_SHIFT
-10),
56 mm
->stack_vm
<< (PAGE_SHIFT
-10), text
, lib
,
57 (PTRS_PER_PTE
*sizeof(pte_t
)*mm
->nr_ptes
) >> 10);
60 unsigned long task_vsize(struct mm_struct
*mm
)
62 return PAGE_SIZE
* mm
->total_vm
;
65 int task_statm(struct mm_struct
*mm
, int *shared
, int *text
,
66 int *data
, int *resident
)
68 *shared
= get_mm_counter(mm
, file_rss
);
69 *text
= (PAGE_ALIGN(mm
->end_code
) - (mm
->start_code
& PAGE_MASK
))
71 *data
= mm
->total_vm
- mm
->shared_vm
;
72 *resident
= *shared
+ get_mm_counter(mm
, anon_rss
);
76 static void pad_len_spaces(struct seq_file
*m
, int len
)
78 len
= 25 + sizeof(void*) * 6 - len
;
81 seq_printf(m
, "%*c", len
, ' ');
84 static void vma_stop(struct proc_maps_private
*priv
, struct vm_area_struct
*vma
)
86 if (vma
&& vma
!= priv
->tail_vma
) {
87 struct mm_struct
*mm
= vma
->vm_mm
;
88 up_read(&mm
->mmap_sem
);
93 static void *m_start(struct seq_file
*m
, loff_t
*pos
)
95 struct proc_maps_private
*priv
= m
->private;
96 unsigned long last_addr
= m
->version
;
98 struct vm_area_struct
*vma
, *tail_vma
= NULL
;
101 /* Clear the per syscall fields in priv */
103 priv
->tail_vma
= NULL
;
106 * We remember last_addr rather than next_addr to hit with
107 * mmap_cache most of the time. We have zero last_addr at
108 * the beginning and also after lseek. We will have -1 last_addr
109 * after the end of the vmas.
112 if (last_addr
== -1UL)
115 priv
->task
= get_pid_task(priv
->pid
, PIDTYPE_PID
);
119 mm
= mm_for_maps(priv
->task
);
123 tail_vma
= get_gate_vma(priv
->task
);
124 priv
->tail_vma
= tail_vma
;
126 /* Start with last addr hint */
127 vma
= find_vma(mm
, last_addr
);
128 if (last_addr
&& vma
) {
134 * Check the vma index is within the range and do
135 * sequential scan until m_index.
138 if ((unsigned long)l
< mm
->map_count
) {
145 if (l
!= mm
->map_count
)
146 tail_vma
= NULL
; /* After gate vma */
152 /* End of vmas has been reached */
153 m
->version
= (tail_vma
!= NULL
)? 0: -1UL;
154 up_read(&mm
->mmap_sem
);
159 static void *m_next(struct seq_file
*m
, void *v
, loff_t
*pos
)
161 struct proc_maps_private
*priv
= m
->private;
162 struct vm_area_struct
*vma
= v
;
163 struct vm_area_struct
*tail_vma
= priv
->tail_vma
;
166 if (vma
&& (vma
!= tail_vma
) && vma
->vm_next
)
169 return (vma
!= tail_vma
)? tail_vma
: NULL
;
172 static void m_stop(struct seq_file
*m
, void *v
)
174 struct proc_maps_private
*priv
= m
->private;
175 struct vm_area_struct
*vma
= v
;
179 put_task_struct(priv
->task
);
182 static int do_maps_open(struct inode
*inode
, struct file
*file
,
183 const struct seq_operations
*ops
)
185 struct proc_maps_private
*priv
;
187 priv
= kzalloc(sizeof(*priv
), GFP_KERNEL
);
189 priv
->pid
= proc_pid(inode
);
190 ret
= seq_open(file
, ops
);
192 struct seq_file
*m
= file
->private_data
;
201 static int show_map(struct seq_file
*m
, void *v
)
203 struct proc_maps_private
*priv
= m
->private;
204 struct task_struct
*task
= priv
->task
;
205 struct vm_area_struct
*vma
= v
;
206 struct mm_struct
*mm
= vma
->vm_mm
;
207 struct file
*file
= vma
->vm_file
;
208 int flags
= vma
->vm_flags
;
209 unsigned long ino
= 0;
213 if (maps_protect
&& !ptrace_may_attach(task
))
217 struct inode
*inode
= vma
->vm_file
->f_path
.dentry
->d_inode
;
218 dev
= inode
->i_sb
->s_dev
;
222 seq_printf(m
, "%08lx-%08lx %c%c%c%c %08lx %02x:%02x %lu %n",
225 flags
& VM_READ
? 'r' : '-',
226 flags
& VM_WRITE
? 'w' : '-',
227 flags
& VM_EXEC
? 'x' : '-',
228 flags
& VM_MAYSHARE
? 's' : 'p',
229 vma
->vm_pgoff
<< PAGE_SHIFT
,
230 MAJOR(dev
), MINOR(dev
), ino
, &len
);
233 * Print the dentry name for named mappings, and a
234 * special [heap] marker for the heap:
237 pad_len_spaces(m
, len
);
238 seq_path(m
, &file
->f_path
, "\n");
240 const char *name
= arch_vma_name(vma
);
243 if (vma
->vm_start
<= mm
->start_brk
&&
244 vma
->vm_end
>= mm
->brk
) {
246 } else if (vma
->vm_start
<= mm
->start_stack
&&
247 vma
->vm_end
>= mm
->start_stack
) {
255 pad_len_spaces(m
, len
);
261 if (m
->count
< m
->size
) /* vma is copied successfully */
262 m
->version
= (vma
!= get_gate_vma(task
))? vma
->vm_start
: 0;
266 static const struct seq_operations proc_pid_maps_op
= {
273 static int maps_open(struct inode
*inode
, struct file
*file
)
275 return do_maps_open(inode
, file
, &proc_pid_maps_op
);
278 const struct file_operations proc_maps_operations
= {
282 .release
= seq_release_private
,
286 * Proportional Set Size(PSS): my share of RSS.
288 * PSS of a process is the count of pages it has in memory, where each
289 * page is divided by the number of processes sharing it. So if a
290 * process has 1000 pages all to itself, and 1000 shared with one other
291 * process, its PSS will be 1500.
293 * To keep (accumulated) division errors low, we adopt a 64bit
294 * fixed-point pss counter to minimize division errors. So (pss >>
295 * PSS_SHIFT) would be the real byte count.
297 * A shift of 12 before division means (assuming 4K page size):
298 * - 1M 3-user-pages add up to 8KB errors;
299 * - supports mapcount up to 2^24, or 16M;
300 * - supports PSS up to 2^52 bytes, or 4PB.
304 #ifdef CONFIG_PROC_PAGE_MONITOR
305 struct mem_size_stats
{
306 struct vm_area_struct
*vma
;
307 unsigned long resident
;
308 unsigned long shared_clean
;
309 unsigned long shared_dirty
;
310 unsigned long private_clean
;
311 unsigned long private_dirty
;
312 unsigned long referenced
;
317 static int smaps_pte_range(pmd_t
*pmd
, unsigned long addr
, unsigned long end
,
318 struct mm_walk
*walk
)
320 struct mem_size_stats
*mss
= walk
->private;
321 struct vm_area_struct
*vma
= mss
->vma
;
327 pte
= pte_offset_map_lock(vma
->vm_mm
, pmd
, addr
, &ptl
);
328 for (; addr
!= end
; pte
++, addr
+= PAGE_SIZE
) {
331 if (is_swap_pte(ptent
)) {
332 mss
->swap
+= PAGE_SIZE
;
336 if (!pte_present(ptent
))
339 mss
->resident
+= PAGE_SIZE
;
341 page
= vm_normal_page(vma
, addr
, ptent
);
345 /* Accumulate the size in pages that have been accessed. */
346 if (pte_young(ptent
) || PageReferenced(page
))
347 mss
->referenced
+= PAGE_SIZE
;
348 mapcount
= page_mapcount(page
);
350 if (pte_dirty(ptent
))
351 mss
->shared_dirty
+= PAGE_SIZE
;
353 mss
->shared_clean
+= PAGE_SIZE
;
354 mss
->pss
+= (PAGE_SIZE
<< PSS_SHIFT
) / mapcount
;
356 if (pte_dirty(ptent
))
357 mss
->private_dirty
+= PAGE_SIZE
;
359 mss
->private_clean
+= PAGE_SIZE
;
360 mss
->pss
+= (PAGE_SIZE
<< PSS_SHIFT
);
363 pte_unmap_unlock(pte
- 1, ptl
);
368 static int show_smap(struct seq_file
*m
, void *v
)
370 struct vm_area_struct
*vma
= v
;
371 struct mem_size_stats mss
;
373 struct mm_walk smaps_walk
= {
374 .pmd_entry
= smaps_pte_range
,
379 memset(&mss
, 0, sizeof mss
);
381 if (vma
->vm_mm
&& !is_vm_hugetlb_page(vma
))
382 walk_page_range(vma
->vm_start
, vma
->vm_end
, &smaps_walk
);
384 ret
= show_map(m
, v
);
392 "Shared_Clean: %8lu kB\n"
393 "Shared_Dirty: %8lu kB\n"
394 "Private_Clean: %8lu kB\n"
395 "Private_Dirty: %8lu kB\n"
396 "Referenced: %8lu kB\n"
398 (vma
->vm_end
- vma
->vm_start
) >> 10,
400 (unsigned long)(mss
.pss
>> (10 + PSS_SHIFT
)),
401 mss
.shared_clean
>> 10,
402 mss
.shared_dirty
>> 10,
403 mss
.private_clean
>> 10,
404 mss
.private_dirty
>> 10,
405 mss
.referenced
>> 10,
411 static const struct seq_operations proc_pid_smaps_op
= {
418 static int smaps_open(struct inode
*inode
, struct file
*file
)
420 return do_maps_open(inode
, file
, &proc_pid_smaps_op
);
423 const struct file_operations proc_smaps_operations
= {
427 .release
= seq_release_private
,
430 static int clear_refs_pte_range(pmd_t
*pmd
, unsigned long addr
,
431 unsigned long end
, struct mm_walk
*walk
)
433 struct vm_area_struct
*vma
= walk
->private;
438 pte
= pte_offset_map_lock(vma
->vm_mm
, pmd
, addr
, &ptl
);
439 for (; addr
!= end
; pte
++, addr
+= PAGE_SIZE
) {
441 if (!pte_present(ptent
))
444 page
= vm_normal_page(vma
, addr
, ptent
);
448 /* Clear accessed and referenced bits. */
449 ptep_test_and_clear_young(vma
, addr
, pte
);
450 ClearPageReferenced(page
);
452 pte_unmap_unlock(pte
- 1, ptl
);
457 static ssize_t
clear_refs_write(struct file
*file
, const char __user
*buf
,
458 size_t count
, loff_t
*ppos
)
460 struct task_struct
*task
;
461 char buffer
[PROC_NUMBUF
], *end
;
462 struct mm_struct
*mm
;
463 struct vm_area_struct
*vma
;
465 memset(buffer
, 0, sizeof(buffer
));
466 if (count
> sizeof(buffer
) - 1)
467 count
= sizeof(buffer
) - 1;
468 if (copy_from_user(buffer
, buf
, count
))
470 if (!simple_strtol(buffer
, &end
, 0))
474 task
= get_proc_task(file
->f_path
.dentry
->d_inode
);
477 mm
= get_task_mm(task
);
479 struct mm_walk clear_refs_walk
= {
480 .pmd_entry
= clear_refs_pte_range
,
483 down_read(&mm
->mmap_sem
);
484 for (vma
= mm
->mmap
; vma
; vma
= vma
->vm_next
) {
485 clear_refs_walk
.private = vma
;
486 if (!is_vm_hugetlb_page(vma
))
487 walk_page_range(vma
->vm_start
, vma
->vm_end
,
491 up_read(&mm
->mmap_sem
);
494 put_task_struct(task
);
495 if (end
- buffer
== 0)
500 const struct file_operations proc_clear_refs_operations
= {
501 .write
= clear_refs_write
,
505 u64 __user
*out
, *end
;
508 #define PM_ENTRY_BYTES sizeof(u64)
509 #define PM_STATUS_BITS 3
510 #define PM_STATUS_OFFSET (64 - PM_STATUS_BITS)
511 #define PM_STATUS_MASK (((1LL << PM_STATUS_BITS) - 1) << PM_STATUS_OFFSET)
512 #define PM_STATUS(nr) (((nr) << PM_STATUS_OFFSET) & PM_STATUS_MASK)
513 #define PM_PSHIFT_BITS 6
514 #define PM_PSHIFT_OFFSET (PM_STATUS_OFFSET - PM_PSHIFT_BITS)
515 #define PM_PSHIFT_MASK (((1LL << PM_PSHIFT_BITS) - 1) << PM_PSHIFT_OFFSET)
516 #define PM_PSHIFT(x) (((u64) (x) << PM_PSHIFT_OFFSET) & PM_PSHIFT_MASK)
517 #define PM_PFRAME_MASK ((1LL << PM_PSHIFT_OFFSET) - 1)
518 #define PM_PFRAME(x) ((x) & PM_PFRAME_MASK)
520 #define PM_PRESENT PM_STATUS(4LL)
521 #define PM_SWAP PM_STATUS(2LL)
522 #define PM_NOT_PRESENT PM_PSHIFT(PAGE_SHIFT)
523 #define PM_END_OF_BUFFER 1
525 static int add_to_pagemap(unsigned long addr
, u64 pfn
,
526 struct pagemapread
*pm
)
528 if (put_user(pfn
, pm
->out
))
531 if (pm
->out
>= pm
->end
)
532 return PM_END_OF_BUFFER
;
536 static int pagemap_pte_hole(unsigned long start
, unsigned long end
,
537 struct mm_walk
*walk
)
539 struct pagemapread
*pm
= walk
->private;
542 for (addr
= start
; addr
< end
; addr
+= PAGE_SIZE
) {
543 err
= add_to_pagemap(addr
, PM_NOT_PRESENT
, pm
);
550 static u64
swap_pte_to_pagemap_entry(pte_t pte
)
552 swp_entry_t e
= pte_to_swp_entry(pte
);
553 return swp_type(e
) | (swp_offset(e
) << MAX_SWAPFILES_SHIFT
);
556 static unsigned long pte_to_pagemap_entry(pte_t pte
)
558 unsigned long pme
= 0;
559 if (is_swap_pte(pte
))
560 pme
= PM_PFRAME(swap_pte_to_pagemap_entry(pte
))
561 | PM_PSHIFT(PAGE_SHIFT
) | PM_SWAP
;
562 else if (pte_present(pte
))
563 pme
= PM_PFRAME(pte_pfn(pte
))
564 | PM_PSHIFT(PAGE_SHIFT
) | PM_PRESENT
;
568 static int pagemap_pte_range(pmd_t
*pmd
, unsigned long addr
, unsigned long end
,
569 struct mm_walk
*walk
)
571 struct vm_area_struct
*vma
;
572 struct pagemapread
*pm
= walk
->private;
576 /* find the first VMA at or above 'addr' */
577 vma
= find_vma(walk
->mm
, addr
);
578 for (; addr
!= end
; addr
+= PAGE_SIZE
) {
579 u64 pfn
= PM_NOT_PRESENT
;
581 /* check to see if we've left 'vma' behind
582 * and need a new, higher one */
583 if (vma
&& (addr
>= vma
->vm_end
))
584 vma
= find_vma(walk
->mm
, addr
);
586 /* check that 'vma' actually covers this address,
587 * and that it isn't a huge page vma */
588 if (vma
&& (vma
->vm_start
<= addr
) &&
589 !is_vm_hugetlb_page(vma
)) {
590 pte
= pte_offset_map(pmd
, addr
);
591 pfn
= pte_to_pagemap_entry(*pte
);
592 /* unmap before userspace copy */
595 err
= add_to_pagemap(addr
, pfn
, pm
);
605 static struct mm_walk pagemap_walk
= {
606 .pmd_entry
= pagemap_pte_range
,
607 .pte_hole
= pagemap_pte_hole
611 * /proc/pid/pagemap - an array mapping virtual pages to pfns
613 * For each page in the address space, this file contains one 64-bit entry
614 * consisting of the following:
616 * Bits 0-55 page frame number (PFN) if present
617 * Bits 0-4 swap type if swapped
618 * Bits 5-55 swap offset if swapped
619 * Bits 55-60 page shift (page size = 1<<page shift)
620 * Bit 61 reserved for future use
621 * Bit 62 page swapped
622 * Bit 63 page present
624 * If the page is not present but in swap, then the PFN contains an
625 * encoding of the swap file number and the page's offset into the
626 * swap. Unmapped pages return a null PFN. This allows determining
627 * precisely which pages are mapped (or in swap) and comparing mapped
628 * pages between processes.
630 * Efficient users of this interface will use /proc/pid/maps to
631 * determine which areas of memory are actually mapped and llseek to
632 * skip over unmapped regions.
634 static ssize_t
pagemap_read(struct file
*file
, char __user
*buf
,
635 size_t count
, loff_t
*ppos
)
637 struct task_struct
*task
= get_proc_task(file
->f_path
.dentry
->d_inode
);
638 struct page
**pages
, *page
;
639 unsigned long uaddr
, uend
;
640 struct mm_struct
*mm
;
641 struct pagemapread pm
;
649 if (!ptrace_may_attach(task
))
653 /* file position must be aligned */
654 if ((*ppos
% PM_ENTRY_BYTES
) || (count
% PM_ENTRY_BYTES
))
658 mm
= get_task_mm(task
);
663 uaddr
= (unsigned long)buf
& PAGE_MASK
;
664 uend
= (unsigned long)(buf
+ count
);
665 pagecount
= (PAGE_ALIGN(uend
) - uaddr
) / PAGE_SIZE
;
666 pages
= kmalloc(pagecount
* sizeof(struct page
*), GFP_KERNEL
);
670 down_read(¤t
->mm
->mmap_sem
);
671 ret
= get_user_pages(current
, current
->mm
, uaddr
, pagecount
,
673 up_read(¤t
->mm
->mmap_sem
);
678 if (ret
!= pagecount
) {
685 pm
.end
= (u64
*)(buf
+ count
);
687 if (!ptrace_may_attach(task
)) {
690 unsigned long src
= *ppos
;
691 unsigned long svpfn
= src
/ PM_ENTRY_BYTES
;
692 unsigned long start_vaddr
= svpfn
<< PAGE_SHIFT
;
693 unsigned long end_vaddr
= TASK_SIZE_OF(task
);
695 /* watch out for wraparound */
696 if (svpfn
> TASK_SIZE_OF(task
) >> PAGE_SHIFT
)
697 start_vaddr
= end_vaddr
;
700 * The odds are that this will stop walking way
701 * before end_vaddr, because the length of the
702 * user buffer is tracked in "pm", and the walk
703 * will stop when we hit the end of the buffer.
705 ret
= walk_page_range(start_vaddr
, end_vaddr
,
707 if (ret
== PM_END_OF_BUFFER
)
709 /* don't need mmap_sem for these, but this looks cleaner */
710 *ppos
+= (char *)pm
.out
- buf
;
712 ret
= (char *)pm
.out
- buf
;
716 for (; pagecount
; pagecount
--) {
717 page
= pages
[pagecount
-1];
718 if (!PageReserved(page
))
720 page_cache_release(page
);
727 put_task_struct(task
);
732 const struct file_operations proc_pagemap_operations
= {
733 .llseek
= mem_lseek
, /* borrow this */
734 .read
= pagemap_read
,
736 #endif /* CONFIG_PROC_PAGE_MONITOR */
739 extern int show_numa_map(struct seq_file
*m
, void *v
);
741 static int show_numa_map_checked(struct seq_file
*m
, void *v
)
743 struct proc_maps_private
*priv
= m
->private;
744 struct task_struct
*task
= priv
->task
;
746 if (maps_protect
&& !ptrace_may_attach(task
))
749 return show_numa_map(m
, v
);
752 static const struct seq_operations proc_pid_numa_maps_op
= {
756 .show
= show_numa_map_checked
759 static int numa_maps_open(struct inode
*inode
, struct file
*file
)
761 return do_maps_open(inode
, file
, &proc_pid_numa_maps_op
);
764 const struct file_operations proc_numa_maps_operations
= {
765 .open
= numa_maps_open
,
768 .release
= seq_release_private
,