mm: convert sprintf_symbol to %pS
[linux-block.git] / fs / proc / task_mmu.c
CommitLineData
1da177e4
LT
1#include <linux/mm.h>
2#include <linux/hugetlb.h>
3#include <linux/mount.h>
4#include <linux/seq_file.h>
e070ad49 5#include <linux/highmem.h>
5096add8 6#include <linux/ptrace.h>
5a0e3ad6 7#include <linux/slab.h>
6e21c8f1
CL
8#include <linux/pagemap.h>
9#include <linux/mempolicy.h>
85863e47
MM
10#include <linux/swap.h>
11#include <linux/swapops.h>
e070ad49 12
1da177e4
LT
13#include <asm/elf.h>
14#include <asm/uaccess.h>
e070ad49 15#include <asm/tlbflush.h>
1da177e4
LT
16#include "internal.h"
17
df5f8314 18void task_mem(struct seq_file *m, struct mm_struct *mm)
1da177e4 19{
b084d435 20 unsigned long data, text, lib, swap;
365e9c87
HD
21 unsigned long hiwater_vm, total_vm, hiwater_rss, total_rss;
22
23 /*
24 * Note: to minimize their overhead, mm maintains hiwater_vm and
25 * hiwater_rss only when about to *lower* total_vm or rss. Any
26 * collector of these hiwater stats must therefore get total_vm
27 * and rss too, which will usually be the higher. Barriers? not
28 * worth the effort, such snapshots can always be inconsistent.
29 */
30 hiwater_vm = total_vm = mm->total_vm;
31 if (hiwater_vm < mm->hiwater_vm)
32 hiwater_vm = mm->hiwater_vm;
33 hiwater_rss = total_rss = get_mm_rss(mm);
34 if (hiwater_rss < mm->hiwater_rss)
35 hiwater_rss = mm->hiwater_rss;
1da177e4
LT
36
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;
b084d435 40 swap = get_mm_counter(mm, MM_SWAPENTS);
df5f8314 41 seq_printf(m,
365e9c87 42 "VmPeak:\t%8lu kB\n"
1da177e4
LT
43 "VmSize:\t%8lu kB\n"
44 "VmLck:\t%8lu kB\n"
365e9c87 45 "VmHWM:\t%8lu kB\n"
1da177e4
LT
46 "VmRSS:\t%8lu kB\n"
47 "VmData:\t%8lu kB\n"
48 "VmStk:\t%8lu kB\n"
49 "VmExe:\t%8lu kB\n"
50 "VmLib:\t%8lu kB\n"
b084d435
KH
51 "VmPTE:\t%8lu kB\n"
52 "VmSwap:\t%8lu kB\n",
365e9c87
HD
53 hiwater_vm << (PAGE_SHIFT-10),
54 (total_vm - mm->reserved_vm) << (PAGE_SHIFT-10),
1da177e4 55 mm->locked_vm << (PAGE_SHIFT-10),
365e9c87
HD
56 hiwater_rss << (PAGE_SHIFT-10),
57 total_rss << (PAGE_SHIFT-10),
1da177e4
LT
58 data << (PAGE_SHIFT-10),
59 mm->stack_vm << (PAGE_SHIFT-10), text, lib,
b084d435
KH
60 (PTRS_PER_PTE*sizeof(pte_t)*mm->nr_ptes) >> 10,
61 swap << (PAGE_SHIFT-10));
1da177e4
LT
62}
63
64unsigned long task_vsize(struct mm_struct *mm)
65{
66 return PAGE_SIZE * mm->total_vm;
67}
68
a2ade7b6
AD
69unsigned long task_statm(struct mm_struct *mm,
70 unsigned long *shared, unsigned long *text,
71 unsigned long *data, unsigned long *resident)
1da177e4 72{
d559db08 73 *shared = get_mm_counter(mm, MM_FILEPAGES);
1da177e4
LT
74 *text = (PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK))
75 >> PAGE_SHIFT;
76 *data = mm->total_vm - mm->shared_vm;
d559db08 77 *resident = *shared + get_mm_counter(mm, MM_ANONPAGES);
1da177e4
LT
78 return mm->total_vm;
79}
80
1da177e4
LT
81static void pad_len_spaces(struct seq_file *m, int len)
82{
83 len = 25 + sizeof(void*) * 6 - len;
84 if (len < 1)
85 len = 1;
86 seq_printf(m, "%*c", len, ' ');
87}
88
a6198797
MM
89static void vma_stop(struct proc_maps_private *priv, struct vm_area_struct *vma)
90{
91 if (vma && vma != priv->tail_vma) {
92 struct mm_struct *mm = vma->vm_mm;
93 up_read(&mm->mmap_sem);
94 mmput(mm);
95 }
96}
ec4dd3eb 97
a6198797 98static void *m_start(struct seq_file *m, loff_t *pos)
e070ad49 99{
a6198797
MM
100 struct proc_maps_private *priv = m->private;
101 unsigned long last_addr = m->version;
102 struct mm_struct *mm;
103 struct vm_area_struct *vma, *tail_vma = NULL;
104 loff_t l = *pos;
105
106 /* Clear the per syscall fields in priv */
107 priv->task = NULL;
108 priv->tail_vma = NULL;
109
110 /*
111 * We remember last_addr rather than next_addr to hit with
112 * mmap_cache most of the time. We have zero last_addr at
113 * the beginning and also after lseek. We will have -1 last_addr
114 * after the end of the vmas.
115 */
116
117 if (last_addr == -1UL)
118 return NULL;
119
120 priv->task = get_pid_task(priv->pid, PIDTYPE_PID);
121 if (!priv->task)
122 return NULL;
123
124 mm = mm_for_maps(priv->task);
125 if (!mm)
126 return NULL;
00f89d21 127 down_read(&mm->mmap_sem);
a6198797
MM
128
129 tail_vma = get_gate_vma(priv->task);
130 priv->tail_vma = tail_vma;
131
132 /* Start with last addr hint */
133 vma = find_vma(mm, last_addr);
134 if (last_addr && vma) {
135 vma = vma->vm_next;
136 goto out;
137 }
138
139 /*
140 * Check the vma index is within the range and do
141 * sequential scan until m_index.
142 */
143 vma = NULL;
144 if ((unsigned long)l < mm->map_count) {
145 vma = mm->mmap;
146 while (l-- && vma)
147 vma = vma->vm_next;
148 goto out;
149 }
150
151 if (l != mm->map_count)
152 tail_vma = NULL; /* After gate vma */
153
154out:
155 if (vma)
156 return vma;
157
158 /* End of vmas has been reached */
159 m->version = (tail_vma != NULL)? 0: -1UL;
160 up_read(&mm->mmap_sem);
161 mmput(mm);
162 return tail_vma;
163}
164
165static void *m_next(struct seq_file *m, void *v, loff_t *pos)
166{
167 struct proc_maps_private *priv = m->private;
168 struct vm_area_struct *vma = v;
169 struct vm_area_struct *tail_vma = priv->tail_vma;
170
171 (*pos)++;
172 if (vma && (vma != tail_vma) && vma->vm_next)
173 return vma->vm_next;
174 vma_stop(priv, vma);
175 return (vma != tail_vma)? tail_vma: NULL;
176}
177
178static void m_stop(struct seq_file *m, void *v)
179{
180 struct proc_maps_private *priv = m->private;
181 struct vm_area_struct *vma = v;
182
183 vma_stop(priv, vma);
184 if (priv->task)
185 put_task_struct(priv->task);
186}
187
188static int do_maps_open(struct inode *inode, struct file *file,
03a44825 189 const struct seq_operations *ops)
a6198797
MM
190{
191 struct proc_maps_private *priv;
192 int ret = -ENOMEM;
193 priv = kzalloc(sizeof(*priv), GFP_KERNEL);
194 if (priv) {
195 priv->pid = proc_pid(inode);
196 ret = seq_open(file, ops);
197 if (!ret) {
198 struct seq_file *m = file->private_data;
199 m->private = priv;
200 } else {
201 kfree(priv);
202 }
203 }
204 return ret;
205}
e070ad49 206
7c88db0c 207static void show_map_vma(struct seq_file *m, struct vm_area_struct *vma)
1da177e4 208{
e070ad49
ML
209 struct mm_struct *mm = vma->vm_mm;
210 struct file *file = vma->vm_file;
211 int flags = vma->vm_flags;
1da177e4 212 unsigned long ino = 0;
6260a4b0 213 unsigned long long pgoff = 0;
d7824370 214 unsigned long start;
1da177e4
LT
215 dev_t dev = 0;
216 int len;
217
218 if (file) {
2fddfeef 219 struct inode *inode = vma->vm_file->f_path.dentry->d_inode;
1da177e4
LT
220 dev = inode->i_sb->s_dev;
221 ino = inode->i_ino;
6260a4b0 222 pgoff = ((loff_t)vma->vm_pgoff) << PAGE_SHIFT;
1da177e4
LT
223 }
224
d7824370
LT
225 /* We don't show the stack guard page in /proc/maps */
226 start = vma->vm_start;
227 if (vma->vm_flags & VM_GROWSDOWN)
39aa3cb3
SB
228 if (!vma_stack_continue(vma->vm_prev, vma->vm_start))
229 start += PAGE_SIZE;
d7824370 230
1804dc6e 231 seq_printf(m, "%08lx-%08lx %c%c%c%c %08llx %02x:%02x %lu %n",
d7824370 232 start,
e070ad49 233 vma->vm_end,
1da177e4
LT
234 flags & VM_READ ? 'r' : '-',
235 flags & VM_WRITE ? 'w' : '-',
236 flags & VM_EXEC ? 'x' : '-',
237 flags & VM_MAYSHARE ? 's' : 'p',
6260a4b0 238 pgoff,
1da177e4
LT
239 MAJOR(dev), MINOR(dev), ino, &len);
240
241 /*
242 * Print the dentry name for named mappings, and a
243 * special [heap] marker for the heap:
244 */
e070ad49 245 if (file) {
1da177e4 246 pad_len_spaces(m, len);
c32c2f63 247 seq_path(m, &file->f_path, "\n");
1da177e4 248 } else {
e6e5494c
IM
249 const char *name = arch_vma_name(vma);
250 if (!name) {
251 if (mm) {
252 if (vma->vm_start <= mm->start_brk &&
e070ad49 253 vma->vm_end >= mm->brk) {
e6e5494c
IM
254 name = "[heap]";
255 } else if (vma->vm_start <= mm->start_stack &&
256 vma->vm_end >= mm->start_stack) {
257 name = "[stack]";
1da177e4 258 }
e6e5494c
IM
259 } else {
260 name = "[vdso]";
1da177e4 261 }
e6e5494c
IM
262 }
263 if (name) {
1da177e4 264 pad_len_spaces(m, len);
e6e5494c 265 seq_puts(m, name);
1da177e4
LT
266 }
267 }
268 seq_putc(m, '\n');
7c88db0c
JK
269}
270
271static int show_map(struct seq_file *m, void *v)
272{
273 struct vm_area_struct *vma = v;
274 struct proc_maps_private *priv = m->private;
275 struct task_struct *task = priv->task;
276
277 show_map_vma(m, vma);
e070ad49 278
e070ad49
ML
279 if (m->count < m->size) /* vma is copied successfully */
280 m->version = (vma != get_gate_vma(task))? vma->vm_start: 0;
1da177e4
LT
281 return 0;
282}
283
03a44825 284static const struct seq_operations proc_pid_maps_op = {
a6198797
MM
285 .start = m_start,
286 .next = m_next,
287 .stop = m_stop,
288 .show = show_map
289};
290
291static int maps_open(struct inode *inode, struct file *file)
292{
293 return do_maps_open(inode, file, &proc_pid_maps_op);
294}
295
296const struct file_operations proc_maps_operations = {
297 .open = maps_open,
298 .read = seq_read,
299 .llseek = seq_lseek,
300 .release = seq_release_private,
301};
302
303/*
304 * Proportional Set Size(PSS): my share of RSS.
305 *
306 * PSS of a process is the count of pages it has in memory, where each
307 * page is divided by the number of processes sharing it. So if a
308 * process has 1000 pages all to itself, and 1000 shared with one other
309 * process, its PSS will be 1500.
310 *
311 * To keep (accumulated) division errors low, we adopt a 64bit
312 * fixed-point pss counter to minimize division errors. So (pss >>
313 * PSS_SHIFT) would be the real byte count.
314 *
315 * A shift of 12 before division means (assuming 4K page size):
316 * - 1M 3-user-pages add up to 8KB errors;
317 * - supports mapcount up to 2^24, or 16M;
318 * - supports PSS up to 2^52 bytes, or 4PB.
319 */
320#define PSS_SHIFT 12
321
1e883281 322#ifdef CONFIG_PROC_PAGE_MONITOR
214e471f 323struct mem_size_stats {
a6198797
MM
324 struct vm_area_struct *vma;
325 unsigned long resident;
326 unsigned long shared_clean;
327 unsigned long shared_dirty;
328 unsigned long private_clean;
329 unsigned long private_dirty;
330 unsigned long referenced;
b40d4f84 331 unsigned long anonymous;
214e471f 332 unsigned long swap;
a6198797
MM
333 u64 pss;
334};
335
b3ae5acb 336static int smaps_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end,
2165009b 337 struct mm_walk *walk)
e070ad49 338{
2165009b 339 struct mem_size_stats *mss = walk->private;
b3ae5acb 340 struct vm_area_struct *vma = mss->vma;
e070ad49 341 pte_t *pte, ptent;
705e87c0 342 spinlock_t *ptl;
e070ad49 343 struct page *page;
ec4dd3eb 344 int mapcount;
e070ad49 345
705e87c0 346 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
826fad1b 347 for (; addr != end; pte++, addr += PAGE_SIZE) {
e070ad49 348 ptent = *pte;
214e471f
PZ
349
350 if (is_swap_pte(ptent)) {
351 mss->swap += PAGE_SIZE;
352 continue;
353 }
354
705e87c0 355 if (!pte_present(ptent))
e070ad49
ML
356 continue;
357
ad820c5d
NP
358 page = vm_normal_page(vma, addr, ptent);
359 if (!page)
e070ad49
ML
360 continue;
361
b40d4f84
NK
362 if (PageAnon(page))
363 mss->anonymous += PAGE_SIZE;
364
7f53a09e 365 mss->resident += PAGE_SIZE;
f79f177c
DR
366 /* Accumulate the size in pages that have been accessed. */
367 if (pte_young(ptent) || PageReferenced(page))
368 mss->referenced += PAGE_SIZE;
ec4dd3eb
FW
369 mapcount = page_mapcount(page);
370 if (mapcount >= 2) {
1c2499ae 371 if (pte_dirty(ptent) || PageDirty(page))
e070ad49
ML
372 mss->shared_dirty += PAGE_SIZE;
373 else
374 mss->shared_clean += PAGE_SIZE;
ec4dd3eb 375 mss->pss += (PAGE_SIZE << PSS_SHIFT) / mapcount;
e070ad49 376 } else {
1c2499ae 377 if (pte_dirty(ptent) || PageDirty(page))
e070ad49
ML
378 mss->private_dirty += PAGE_SIZE;
379 else
380 mss->private_clean += PAGE_SIZE;
ec4dd3eb 381 mss->pss += (PAGE_SIZE << PSS_SHIFT);
e070ad49 382 }
826fad1b 383 }
705e87c0
HD
384 pte_unmap_unlock(pte - 1, ptl);
385 cond_resched();
b3ae5acb 386 return 0;
e070ad49
ML
387}
388
e070ad49
ML
389static int show_smap(struct seq_file *m, void *v)
390{
7c88db0c
JK
391 struct proc_maps_private *priv = m->private;
392 struct task_struct *task = priv->task;
e070ad49 393 struct vm_area_struct *vma = v;
e070ad49 394 struct mem_size_stats mss;
2165009b
DH
395 struct mm_walk smaps_walk = {
396 .pmd_entry = smaps_pte_range,
397 .mm = vma->vm_mm,
398 .private = &mss,
399 };
e070ad49
ML
400
401 memset(&mss, 0, sizeof mss);
b3ae5acb 402 mss.vma = vma;
d82ef020 403 /* mmap_sem is held in m_start */
5ddfae16 404 if (vma->vm_mm && !is_vm_hugetlb_page(vma))
2165009b 405 walk_page_range(vma->vm_start, vma->vm_end, &smaps_walk);
4752c369 406
7c88db0c 407 show_map_vma(m, vma);
4752c369
MM
408
409 seq_printf(m,
410 "Size: %8lu kB\n"
411 "Rss: %8lu kB\n"
412 "Pss: %8lu kB\n"
413 "Shared_Clean: %8lu kB\n"
414 "Shared_Dirty: %8lu kB\n"
415 "Private_Clean: %8lu kB\n"
416 "Private_Dirty: %8lu kB\n"
214e471f 417 "Referenced: %8lu kB\n"
b40d4f84 418 "Anonymous: %8lu kB\n"
08fba699 419 "Swap: %8lu kB\n"
3340289d
MG
420 "KernelPageSize: %8lu kB\n"
421 "MMUPageSize: %8lu kB\n",
4752c369
MM
422 (vma->vm_end - vma->vm_start) >> 10,
423 mss.resident >> 10,
424 (unsigned long)(mss.pss >> (10 + PSS_SHIFT)),
425 mss.shared_clean >> 10,
426 mss.shared_dirty >> 10,
427 mss.private_clean >> 10,
428 mss.private_dirty >> 10,
214e471f 429 mss.referenced >> 10,
b40d4f84 430 mss.anonymous >> 10,
08fba699 431 mss.swap >> 10,
3340289d
MG
432 vma_kernel_pagesize(vma) >> 10,
433 vma_mmu_pagesize(vma) >> 10);
4752c369 434
7c88db0c
JK
435 if (m->count < m->size) /* vma is copied successfully */
436 m->version = (vma != get_gate_vma(task)) ? vma->vm_start : 0;
437 return 0;
e070ad49
ML
438}
439
03a44825 440static const struct seq_operations proc_pid_smaps_op = {
a6198797
MM
441 .start = m_start,
442 .next = m_next,
443 .stop = m_stop,
444 .show = show_smap
445};
446
447static int smaps_open(struct inode *inode, struct file *file)
448{
449 return do_maps_open(inode, file, &proc_pid_smaps_op);
450}
451
452const struct file_operations proc_smaps_operations = {
453 .open = smaps_open,
454 .read = seq_read,
455 .llseek = seq_lseek,
456 .release = seq_release_private,
457};
458
459static int clear_refs_pte_range(pmd_t *pmd, unsigned long addr,
2165009b 460 unsigned long end, struct mm_walk *walk)
a6198797 461{
2165009b 462 struct vm_area_struct *vma = walk->private;
a6198797
MM
463 pte_t *pte, ptent;
464 spinlock_t *ptl;
465 struct page *page;
466
467 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
468 for (; addr != end; pte++, addr += PAGE_SIZE) {
469 ptent = *pte;
470 if (!pte_present(ptent))
471 continue;
472
473 page = vm_normal_page(vma, addr, ptent);
474 if (!page)
475 continue;
476
477 /* Clear accessed and referenced bits. */
478 ptep_test_and_clear_young(vma, addr, pte);
479 ClearPageReferenced(page);
480 }
481 pte_unmap_unlock(pte - 1, ptl);
482 cond_resched();
483 return 0;
484}
485
398499d5
MB
486#define CLEAR_REFS_ALL 1
487#define CLEAR_REFS_ANON 2
488#define CLEAR_REFS_MAPPED 3
489
f248dcb3
MM
490static ssize_t clear_refs_write(struct file *file, const char __user *buf,
491 size_t count, loff_t *ppos)
b813e931 492{
f248dcb3 493 struct task_struct *task;
fb92a4b0 494 char buffer[PROC_NUMBUF];
f248dcb3 495 struct mm_struct *mm;
b813e931 496 struct vm_area_struct *vma;
fb92a4b0 497 long type;
b813e931 498
f248dcb3
MM
499 memset(buffer, 0, sizeof(buffer));
500 if (count > sizeof(buffer) - 1)
501 count = sizeof(buffer) - 1;
502 if (copy_from_user(buffer, buf, count))
503 return -EFAULT;
fb92a4b0
VL
504 if (strict_strtol(strstrip(buffer), 10, &type))
505 return -EINVAL;
398499d5 506 if (type < CLEAR_REFS_ALL || type > CLEAR_REFS_MAPPED)
f248dcb3 507 return -EINVAL;
f248dcb3
MM
508 task = get_proc_task(file->f_path.dentry->d_inode);
509 if (!task)
510 return -ESRCH;
511 mm = get_task_mm(task);
512 if (mm) {
20cbc972
AM
513 struct mm_walk clear_refs_walk = {
514 .pmd_entry = clear_refs_pte_range,
515 .mm = mm,
516 };
f248dcb3 517 down_read(&mm->mmap_sem);
2165009b
DH
518 for (vma = mm->mmap; vma; vma = vma->vm_next) {
519 clear_refs_walk.private = vma;
398499d5
MB
520 if (is_vm_hugetlb_page(vma))
521 continue;
522 /*
523 * Writing 1 to /proc/pid/clear_refs affects all pages.
524 *
525 * Writing 2 to /proc/pid/clear_refs only affects
526 * Anonymous pages.
527 *
528 * Writing 3 to /proc/pid/clear_refs only affects file
529 * mapped pages.
530 */
531 if (type == CLEAR_REFS_ANON && vma->vm_file)
532 continue;
533 if (type == CLEAR_REFS_MAPPED && !vma->vm_file)
534 continue;
535 walk_page_range(vma->vm_start, vma->vm_end,
536 &clear_refs_walk);
2165009b 537 }
f248dcb3
MM
538 flush_tlb_mm(mm);
539 up_read(&mm->mmap_sem);
540 mmput(mm);
541 }
542 put_task_struct(task);
fb92a4b0
VL
543
544 return count;
b813e931
DR
545}
546
f248dcb3
MM
547const struct file_operations proc_clear_refs_operations = {
548 .write = clear_refs_write,
6038f373 549 .llseek = noop_llseek,
f248dcb3
MM
550};
551
85863e47 552struct pagemapread {
d82ef020
KH
553 int pos, len;
554 u64 *buffer;
85863e47
MM
555};
556
f16278c6
HR
557#define PM_ENTRY_BYTES sizeof(u64)
558#define PM_STATUS_BITS 3
559#define PM_STATUS_OFFSET (64 - PM_STATUS_BITS)
560#define PM_STATUS_MASK (((1LL << PM_STATUS_BITS) - 1) << PM_STATUS_OFFSET)
561#define PM_STATUS(nr) (((nr) << PM_STATUS_OFFSET) & PM_STATUS_MASK)
562#define PM_PSHIFT_BITS 6
563#define PM_PSHIFT_OFFSET (PM_STATUS_OFFSET - PM_PSHIFT_BITS)
564#define PM_PSHIFT_MASK (((1LL << PM_PSHIFT_BITS) - 1) << PM_PSHIFT_OFFSET)
565#define PM_PSHIFT(x) (((u64) (x) << PM_PSHIFT_OFFSET) & PM_PSHIFT_MASK)
566#define PM_PFRAME_MASK ((1LL << PM_PSHIFT_OFFSET) - 1)
567#define PM_PFRAME(x) ((x) & PM_PFRAME_MASK)
568
569#define PM_PRESENT PM_STATUS(4LL)
570#define PM_SWAP PM_STATUS(2LL)
571#define PM_NOT_PRESENT PM_PSHIFT(PAGE_SHIFT)
85863e47
MM
572#define PM_END_OF_BUFFER 1
573
574static int add_to_pagemap(unsigned long addr, u64 pfn,
575 struct pagemapread *pm)
576{
d82ef020
KH
577 pm->buffer[pm->pos++] = pfn;
578 if (pm->pos >= pm->len)
aae8679b 579 return PM_END_OF_BUFFER;
85863e47
MM
580 return 0;
581}
582
583static int pagemap_pte_hole(unsigned long start, unsigned long end,
2165009b 584 struct mm_walk *walk)
85863e47 585{
2165009b 586 struct pagemapread *pm = walk->private;
85863e47
MM
587 unsigned long addr;
588 int err = 0;
589 for (addr = start; addr < end; addr += PAGE_SIZE) {
590 err = add_to_pagemap(addr, PM_NOT_PRESENT, pm);
591 if (err)
592 break;
593 }
594 return err;
595}
596
9d02dbc8 597static u64 swap_pte_to_pagemap_entry(pte_t pte)
85863e47
MM
598{
599 swp_entry_t e = pte_to_swp_entry(pte);
f16278c6 600 return swp_type(e) | (swp_offset(e) << MAX_SWAPFILES_SHIFT);
85863e47
MM
601}
602
49c50342 603static u64 pte_to_pagemap_entry(pte_t pte)
bcf8039e 604{
49c50342 605 u64 pme = 0;
bcf8039e
DH
606 if (is_swap_pte(pte))
607 pme = PM_PFRAME(swap_pte_to_pagemap_entry(pte))
608 | PM_PSHIFT(PAGE_SHIFT) | PM_SWAP;
609 else if (pte_present(pte))
610 pme = PM_PFRAME(pte_pfn(pte))
611 | PM_PSHIFT(PAGE_SHIFT) | PM_PRESENT;
612 return pme;
613}
614
85863e47 615static int pagemap_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end,
2165009b 616 struct mm_walk *walk)
85863e47 617{
bcf8039e 618 struct vm_area_struct *vma;
2165009b 619 struct pagemapread *pm = walk->private;
85863e47
MM
620 pte_t *pte;
621 int err = 0;
622
bcf8039e
DH
623 /* find the first VMA at or above 'addr' */
624 vma = find_vma(walk->mm, addr);
85863e47
MM
625 for (; addr != end; addr += PAGE_SIZE) {
626 u64 pfn = PM_NOT_PRESENT;
bcf8039e
DH
627
628 /* check to see if we've left 'vma' behind
629 * and need a new, higher one */
630 if (vma && (addr >= vma->vm_end))
631 vma = find_vma(walk->mm, addr);
632
633 /* check that 'vma' actually covers this address,
634 * and that it isn't a huge page vma */
635 if (vma && (vma->vm_start <= addr) &&
636 !is_vm_hugetlb_page(vma)) {
637 pte = pte_offset_map(pmd, addr);
638 pfn = pte_to_pagemap_entry(*pte);
639 /* unmap before userspace copy */
640 pte_unmap(pte);
641 }
85863e47
MM
642 err = add_to_pagemap(addr, pfn, pm);
643 if (err)
644 return err;
645 }
646
647 cond_resched();
648
649 return err;
650}
651
1a5cb814 652#ifdef CONFIG_HUGETLB_PAGE
5dc37642
NH
653static u64 huge_pte_to_pagemap_entry(pte_t pte, int offset)
654{
655 u64 pme = 0;
656 if (pte_present(pte))
657 pme = PM_PFRAME(pte_pfn(pte) + offset)
658 | PM_PSHIFT(PAGE_SHIFT) | PM_PRESENT;
659 return pme;
660}
661
116354d1
NH
662/* This function walks within one hugetlb entry in the single call */
663static int pagemap_hugetlb_range(pte_t *pte, unsigned long hmask,
664 unsigned long addr, unsigned long end,
665 struct mm_walk *walk)
5dc37642 666{
5dc37642 667 struct pagemapread *pm = walk->private;
5dc37642 668 int err = 0;
116354d1 669 u64 pfn;
5dc37642 670
5dc37642 671 for (; addr != end; addr += PAGE_SIZE) {
116354d1
NH
672 int offset = (addr & ~hmask) >> PAGE_SHIFT;
673 pfn = huge_pte_to_pagemap_entry(*pte, offset);
5dc37642
NH
674 err = add_to_pagemap(addr, pfn, pm);
675 if (err)
676 return err;
677 }
678
679 cond_resched();
680
681 return err;
682}
1a5cb814 683#endif /* HUGETLB_PAGE */
5dc37642 684
85863e47
MM
685/*
686 * /proc/pid/pagemap - an array mapping virtual pages to pfns
687 *
f16278c6
HR
688 * For each page in the address space, this file contains one 64-bit entry
689 * consisting of the following:
690 *
691 * Bits 0-55 page frame number (PFN) if present
692 * Bits 0-4 swap type if swapped
693 * Bits 5-55 swap offset if swapped
694 * Bits 55-60 page shift (page size = 1<<page shift)
695 * Bit 61 reserved for future use
696 * Bit 62 page swapped
697 * Bit 63 page present
698 *
699 * If the page is not present but in swap, then the PFN contains an
700 * encoding of the swap file number and the page's offset into the
701 * swap. Unmapped pages return a null PFN. This allows determining
85863e47
MM
702 * precisely which pages are mapped (or in swap) and comparing mapped
703 * pages between processes.
704 *
705 * Efficient users of this interface will use /proc/pid/maps to
706 * determine which areas of memory are actually mapped and llseek to
707 * skip over unmapped regions.
708 */
d82ef020 709#define PAGEMAP_WALK_SIZE (PMD_SIZE)
ea251c1d 710#define PAGEMAP_WALK_MASK (PMD_MASK)
85863e47
MM
711static ssize_t pagemap_read(struct file *file, char __user *buf,
712 size_t count, loff_t *ppos)
713{
714 struct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);
85863e47
MM
715 struct mm_struct *mm;
716 struct pagemapread pm;
85863e47 717 int ret = -ESRCH;
ee1e6ab6 718 struct mm_walk pagemap_walk = {};
5d7e0d2b
AM
719 unsigned long src;
720 unsigned long svpfn;
721 unsigned long start_vaddr;
722 unsigned long end_vaddr;
d82ef020 723 int copied = 0;
85863e47
MM
724
725 if (!task)
726 goto out;
727
728 ret = -EACCES;
006ebb40 729 if (!ptrace_may_access(task, PTRACE_MODE_READ))
fb39380b 730 goto out_task;
85863e47
MM
731
732 ret = -EINVAL;
733 /* file position must be aligned */
aae8679b 734 if ((*ppos % PM_ENTRY_BYTES) || (count % PM_ENTRY_BYTES))
fb39380b 735 goto out_task;
85863e47
MM
736
737 ret = 0;
08161786
VM
738
739 if (!count)
740 goto out_task;
741
85863e47
MM
742 mm = get_task_mm(task);
743 if (!mm)
fb39380b 744 goto out_task;
85863e47 745
d82ef020
KH
746 pm.len = PM_ENTRY_BYTES * (PAGEMAP_WALK_SIZE >> PAGE_SHIFT);
747 pm.buffer = kmalloc(pm.len, GFP_TEMPORARY);
5d7e0d2b 748 ret = -ENOMEM;
d82ef020 749 if (!pm.buffer)
fb39380b 750 goto out_mm;
85863e47 751
5d7e0d2b
AM
752 pagemap_walk.pmd_entry = pagemap_pte_range;
753 pagemap_walk.pte_hole = pagemap_pte_hole;
1a5cb814 754#ifdef CONFIG_HUGETLB_PAGE
5dc37642 755 pagemap_walk.hugetlb_entry = pagemap_hugetlb_range;
1a5cb814 756#endif
5d7e0d2b
AM
757 pagemap_walk.mm = mm;
758 pagemap_walk.private = &pm;
759
760 src = *ppos;
761 svpfn = src / PM_ENTRY_BYTES;
762 start_vaddr = svpfn << PAGE_SHIFT;
763 end_vaddr = TASK_SIZE_OF(task);
764
765 /* watch out for wraparound */
766 if (svpfn > TASK_SIZE_OF(task) >> PAGE_SHIFT)
767 start_vaddr = end_vaddr;
768
769 /*
770 * The odds are that this will stop walking way
771 * before end_vaddr, because the length of the
772 * user buffer is tracked in "pm", and the walk
773 * will stop when we hit the end of the buffer.
774 */
d82ef020
KH
775 ret = 0;
776 while (count && (start_vaddr < end_vaddr)) {
777 int len;
778 unsigned long end;
779
780 pm.pos = 0;
ea251c1d 781 end = (start_vaddr + PAGEMAP_WALK_SIZE) & PAGEMAP_WALK_MASK;
d82ef020
KH
782 /* overflow ? */
783 if (end < start_vaddr || end > end_vaddr)
784 end = end_vaddr;
785 down_read(&mm->mmap_sem);
786 ret = walk_page_range(start_vaddr, end, &pagemap_walk);
787 up_read(&mm->mmap_sem);
788 start_vaddr = end;
789
790 len = min(count, PM_ENTRY_BYTES * pm.pos);
309361e0 791 if (copy_to_user(buf, pm.buffer, len)) {
d82ef020
KH
792 ret = -EFAULT;
793 goto out_free;
794 }
795 copied += len;
796 buf += len;
797 count -= len;
85863e47 798 }
d82ef020
KH
799 *ppos += copied;
800 if (!ret || ret == PM_END_OF_BUFFER)
801 ret = copied;
802
85863e47 803out_free:
d82ef020 804 kfree(pm.buffer);
fb39380b
MT
805out_mm:
806 mmput(mm);
85863e47
MM
807out_task:
808 put_task_struct(task);
809out:
810 return ret;
811}
812
813const struct file_operations proc_pagemap_operations = {
814 .llseek = mem_lseek, /* borrow this */
815 .read = pagemap_read,
816};
1e883281 817#endif /* CONFIG_PROC_PAGE_MONITOR */
85863e47 818
6e21c8f1 819#ifdef CONFIG_NUMA
1a75a6c8 820extern int show_numa_map(struct seq_file *m, void *v);
6e21c8f1 821
03a44825 822static const struct seq_operations proc_pid_numa_maps_op = {
1a75a6c8
CL
823 .start = m_start,
824 .next = m_next,
825 .stop = m_stop,
3bbfe059 826 .show = show_numa_map,
6e21c8f1 827};
662795de
EB
828
829static int numa_maps_open(struct inode *inode, struct file *file)
830{
831 return do_maps_open(inode, file, &proc_pid_numa_maps_op);
832}
833
00977a59 834const struct file_operations proc_numa_maps_operations = {
662795de
EB
835 .open = numa_maps_open,
836 .read = seq_read,
837 .llseek = seq_lseek,
99f89551 838 .release = seq_release_private,
662795de 839};
6e21c8f1 840#endif