task_mmu.c 21.9 KB
Newer Older
L
Linus Torvalds 已提交
1 2
#include <linux/mm.h>
#include <linux/hugetlb.h>
3
#include <linux/huge_mm.h>
L
Linus Torvalds 已提交
4 5
#include <linux/mount.h>
#include <linux/seq_file.h>
M
Mauricio Lin 已提交
6
#include <linux/highmem.h>
K
Kees Cook 已提交
7
#include <linux/ptrace.h>
8
#include <linux/slab.h>
9 10
#include <linux/pagemap.h>
#include <linux/mempolicy.h>
11
#include <linux/rmap.h>
12 13
#include <linux/swap.h>
#include <linux/swapops.h>
M
Mauricio Lin 已提交
14

L
Linus Torvalds 已提交
15 16
#include <asm/elf.h>
#include <asm/uaccess.h>
M
Mauricio Lin 已提交
17
#include <asm/tlbflush.h>
L
Linus Torvalds 已提交
18 19
#include "internal.h"

20
void task_mem(struct seq_file *m, struct mm_struct *mm)
L
Linus Torvalds 已提交
21
{
K
KAMEZAWA Hiroyuki 已提交
22
	unsigned long data, text, lib, swap;
23 24 25 26 27 28 29 30 31 32 33 34 35 36 37
	unsigned long hiwater_vm, total_vm, hiwater_rss, total_rss;

	/*
	 * Note: to minimize their overhead, mm maintains hiwater_vm and
	 * hiwater_rss only when about to *lower* total_vm or rss.  Any
	 * collector of these hiwater stats must therefore get total_vm
	 * and rss too, which will usually be the higher.  Barriers? not
	 * worth the effort, such snapshots can always be inconsistent.
	 */
	hiwater_vm = total_vm = mm->total_vm;
	if (hiwater_vm < mm->hiwater_vm)
		hiwater_vm = mm->hiwater_vm;
	hiwater_rss = total_rss = get_mm_rss(mm);
	if (hiwater_rss < mm->hiwater_rss)
		hiwater_rss = mm->hiwater_rss;
L
Linus Torvalds 已提交
38 39 40 41

	data = mm->total_vm - mm->shared_vm - mm->stack_vm;
	text = (PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK)) >> 10;
	lib = (mm->exec_vm << (PAGE_SHIFT-10)) - text;
K
KAMEZAWA Hiroyuki 已提交
42
	swap = get_mm_counter(mm, MM_SWAPENTS);
43
	seq_printf(m,
44
		"VmPeak:\t%8lu kB\n"
L
Linus Torvalds 已提交
45 46
		"VmSize:\t%8lu kB\n"
		"VmLck:\t%8lu kB\n"
47
		"VmHWM:\t%8lu kB\n"
L
Linus Torvalds 已提交
48 49 50 51 52
		"VmRSS:\t%8lu kB\n"
		"VmData:\t%8lu kB\n"
		"VmStk:\t%8lu kB\n"
		"VmExe:\t%8lu kB\n"
		"VmLib:\t%8lu kB\n"
K
KAMEZAWA Hiroyuki 已提交
53 54
		"VmPTE:\t%8lu kB\n"
		"VmSwap:\t%8lu kB\n",
55 56
		hiwater_vm << (PAGE_SHIFT-10),
		(total_vm - mm->reserved_vm) << (PAGE_SHIFT-10),
L
Linus Torvalds 已提交
57
		mm->locked_vm << (PAGE_SHIFT-10),
58 59
		hiwater_rss << (PAGE_SHIFT-10),
		total_rss << (PAGE_SHIFT-10),
L
Linus Torvalds 已提交
60 61
		data << (PAGE_SHIFT-10),
		mm->stack_vm << (PAGE_SHIFT-10), text, lib,
K
KAMEZAWA Hiroyuki 已提交
62 63
		(PTRS_PER_PTE*sizeof(pte_t)*mm->nr_ptes) >> 10,
		swap << (PAGE_SHIFT-10));
L
Linus Torvalds 已提交
64 65 66 67 68 69 70
}

unsigned long task_vsize(struct mm_struct *mm)
{
	return PAGE_SIZE * mm->total_vm;
}

71 72 73
unsigned long task_statm(struct mm_struct *mm,
			 unsigned long *shared, unsigned long *text,
			 unsigned long *data, unsigned long *resident)
L
Linus Torvalds 已提交
74
{
K
KAMEZAWA Hiroyuki 已提交
75
	*shared = get_mm_counter(mm, MM_FILEPAGES);
L
Linus Torvalds 已提交
76 77 78
	*text = (PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK))
								>> PAGE_SHIFT;
	*data = mm->total_vm - mm->shared_vm;
K
KAMEZAWA Hiroyuki 已提交
79
	*resident = *shared + get_mm_counter(mm, MM_ANONPAGES);
L
Linus Torvalds 已提交
80 81 82 83 84 85 86 87 88 89 90
	return mm->total_vm;
}

static void pad_len_spaces(struct seq_file *m, int len)
{
	len = 25 + sizeof(void*) * 6 - len;
	if (len < 1)
		len = 1;
	seq_printf(m, "%*c", len, ' ');
}

91 92 93 94 95 96 97 98
static void vma_stop(struct proc_maps_private *priv, struct vm_area_struct *vma)
{
	if (vma && vma != priv->tail_vma) {
		struct mm_struct *mm = vma->vm_mm;
		up_read(&mm->mmap_sem);
		mmput(mm);
	}
}
99

100
static void *m_start(struct seq_file *m, loff_t *pos)
M
Mauricio Lin 已提交
101
{
102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123
	struct proc_maps_private *priv = m->private;
	unsigned long last_addr = m->version;
	struct mm_struct *mm;
	struct vm_area_struct *vma, *tail_vma = NULL;
	loff_t l = *pos;

	/* Clear the per syscall fields in priv */
	priv->task = NULL;
	priv->tail_vma = NULL;

	/*
	 * We remember last_addr rather than next_addr to hit with
	 * mmap_cache most of the time. We have zero last_addr at
	 * the beginning and also after lseek. We will have -1 last_addr
	 * after the end of the vmas.
	 */

	if (last_addr == -1UL)
		return NULL;

	priv->task = get_pid_task(priv->pid, PIDTYPE_PID);
	if (!priv->task)
A
Al Viro 已提交
124
		return ERR_PTR(-ESRCH);
125 126

	mm = mm_for_maps(priv->task);
A
Al Viro 已提交
127 128
	if (!mm || IS_ERR(mm))
		return mm;
129
	down_read(&mm->mmap_sem);
130

131
	tail_vma = get_gate_vma(priv->task->mm);
132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184
	priv->tail_vma = tail_vma;

	/* Start with last addr hint */
	vma = find_vma(mm, last_addr);
	if (last_addr && vma) {
		vma = vma->vm_next;
		goto out;
	}

	/*
	 * Check the vma index is within the range and do
	 * sequential scan until m_index.
	 */
	vma = NULL;
	if ((unsigned long)l < mm->map_count) {
		vma = mm->mmap;
		while (l-- && vma)
			vma = vma->vm_next;
		goto out;
	}

	if (l != mm->map_count)
		tail_vma = NULL; /* After gate vma */

out:
	if (vma)
		return vma;

	/* End of vmas has been reached */
	m->version = (tail_vma != NULL)? 0: -1UL;
	up_read(&mm->mmap_sem);
	mmput(mm);
	return tail_vma;
}

static void *m_next(struct seq_file *m, void *v, loff_t *pos)
{
	struct proc_maps_private *priv = m->private;
	struct vm_area_struct *vma = v;
	struct vm_area_struct *tail_vma = priv->tail_vma;

	(*pos)++;
	if (vma && (vma != tail_vma) && vma->vm_next)
		return vma->vm_next;
	vma_stop(priv, vma);
	return (vma != tail_vma)? tail_vma: NULL;
}

static void m_stop(struct seq_file *m, void *v)
{
	struct proc_maps_private *priv = m->private;
	struct vm_area_struct *vma = v;

185 186
	if (!IS_ERR(vma))
		vma_stop(priv, vma);
187 188 189 190 191
	if (priv->task)
		put_task_struct(priv->task);
}

static int do_maps_open(struct inode *inode, struct file *file,
192
			const struct seq_operations *ops)
193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208
{
	struct proc_maps_private *priv;
	int ret = -ENOMEM;
	priv = kzalloc(sizeof(*priv), GFP_KERNEL);
	if (priv) {
		priv->pid = proc_pid(inode);
		ret = seq_open(file, ops);
		if (!ret) {
			struct seq_file *m = file->private_data;
			m->private = priv;
		} else {
			kfree(priv);
		}
	}
	return ret;
}
M
Mauricio Lin 已提交
209

210
static void show_map_vma(struct seq_file *m, struct vm_area_struct *vma)
L
Linus Torvalds 已提交
211
{
M
Mauricio Lin 已提交
212 213 214
	struct mm_struct *mm = vma->vm_mm;
	struct file *file = vma->vm_file;
	int flags = vma->vm_flags;
L
Linus Torvalds 已提交
215
	unsigned long ino = 0;
216
	unsigned long long pgoff = 0;
217
	unsigned long start;
L
Linus Torvalds 已提交
218 219 220 221
	dev_t dev = 0;
	int len;

	if (file) {
222
		struct inode *inode = vma->vm_file->f_path.dentry->d_inode;
L
Linus Torvalds 已提交
223 224
		dev = inode->i_sb->s_dev;
		ino = inode->i_ino;
225
		pgoff = ((loff_t)vma->vm_pgoff) << PAGE_SHIFT;
L
Linus Torvalds 已提交
226 227
	}

228 229 230
	/* We don't show the stack guard page in /proc/maps */
	start = vma->vm_start;
	if (vma->vm_flags & VM_GROWSDOWN)
231 232
		if (!vma_stack_continue(vma->vm_prev, vma->vm_start))
			start += PAGE_SIZE;
233

234
	seq_printf(m, "%08lx-%08lx %c%c%c%c %08llx %02x:%02x %lu %n",
235
			start,
M
Mauricio Lin 已提交
236
			vma->vm_end,
L
Linus Torvalds 已提交
237 238 239 240
			flags & VM_READ ? 'r' : '-',
			flags & VM_WRITE ? 'w' : '-',
			flags & VM_EXEC ? 'x' : '-',
			flags & VM_MAYSHARE ? 's' : 'p',
241
			pgoff,
L
Linus Torvalds 已提交
242 243 244 245 246 247
			MAJOR(dev), MINOR(dev), ino, &len);

	/*
	 * Print the dentry name for named mappings, and a
	 * special [heap] marker for the heap:
	 */
M
Mauricio Lin 已提交
248
	if (file) {
L
Linus Torvalds 已提交
249
		pad_len_spaces(m, len);
250
		seq_path(m, &file->f_path, "\n");
L
Linus Torvalds 已提交
251
	} else {
252 253 254
		const char *name = arch_vma_name(vma);
		if (!name) {
			if (mm) {
255 256
				if (vma->vm_start <= mm->brk &&
						vma->vm_end >= mm->start_brk) {
257 258 259 260
					name = "[heap]";
				} else if (vma->vm_start <= mm->start_stack &&
					   vma->vm_end >= mm->start_stack) {
					name = "[stack]";
L
Linus Torvalds 已提交
261
				}
262 263
			} else {
				name = "[vdso]";
L
Linus Torvalds 已提交
264
			}
265 266
		}
		if (name) {
L
Linus Torvalds 已提交
267
			pad_len_spaces(m, len);
268
			seq_puts(m, name);
L
Linus Torvalds 已提交
269 270 271
		}
	}
	seq_putc(m, '\n');
272 273 274 275 276 277 278 279 280
}

static int show_map(struct seq_file *m, void *v)
{
	struct vm_area_struct *vma = v;
	struct proc_maps_private *priv = m->private;
	struct task_struct *task = priv->task;

	show_map_vma(m, vma);
M
Mauricio Lin 已提交
281 282

	if (m->count < m->size)  /* vma is copied successfully */
283 284
		m->version = (vma != get_gate_vma(task->mm))
			? vma->vm_start : 0;
L
Linus Torvalds 已提交
285 286 287
	return 0;
}

288
static const struct seq_operations proc_pid_maps_op = {
289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325
	.start	= m_start,
	.next	= m_next,
	.stop	= m_stop,
	.show	= show_map
};

static int maps_open(struct inode *inode, struct file *file)
{
	return do_maps_open(inode, file, &proc_pid_maps_op);
}

const struct file_operations proc_maps_operations = {
	.open		= maps_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= seq_release_private,
};

/*
 * Proportional Set Size(PSS): my share of RSS.
 *
 * PSS of a process is the count of pages it has in memory, where each
 * page is divided by the number of processes sharing it.  So if a
 * process has 1000 pages all to itself, and 1000 shared with one other
 * process, its PSS will be 1500.
 *
 * To keep (accumulated) division errors low, we adopt a 64bit
 * fixed-point pss counter to minimize division errors. So (pss >>
 * PSS_SHIFT) would be the real byte count.
 *
 * A shift of 12 before division means (assuming 4K page size):
 * 	- 1M 3-user-pages add up to 8KB errors;
 * 	- supports mapcount up to 2^24, or 16M;
 * 	- supports PSS up to 2^52 bytes, or 4PB.
 */
#define PSS_SHIFT 12

326
#ifdef CONFIG_PROC_PAGE_MONITOR
P
Peter Zijlstra 已提交
327
struct mem_size_stats {
328 329 330 331 332 333 334
	struct vm_area_struct *vma;
	unsigned long resident;
	unsigned long shared_clean;
	unsigned long shared_dirty;
	unsigned long private_clean;
	unsigned long private_dirty;
	unsigned long referenced;
335
	unsigned long anonymous;
336
	unsigned long anonymous_thp;
P
Peter Zijlstra 已提交
337
	unsigned long swap;
338 339 340
	u64 pss;
};

341 342

static void smaps_pte_entry(pte_t ptent, unsigned long addr,
343
		unsigned long ptent_size, struct mm_walk *walk)
344 345 346 347 348 349 350
{
	struct mem_size_stats *mss = walk->private;
	struct vm_area_struct *vma = mss->vma;
	struct page *page;
	int mapcount;

	if (is_swap_pte(ptent)) {
351
		mss->swap += ptent_size;
352 353 354 355 356 357 358 359 360 361 362
		return;
	}

	if (!pte_present(ptent))
		return;

	page = vm_normal_page(vma, addr, ptent);
	if (!page)
		return;

	if (PageAnon(page))
363
		mss->anonymous += ptent_size;
364

365
	mss->resident += ptent_size;
366 367
	/* Accumulate the size in pages that have been accessed. */
	if (pte_young(ptent) || PageReferenced(page))
368
		mss->referenced += ptent_size;
369 370 371
	mapcount = page_mapcount(page);
	if (mapcount >= 2) {
		if (pte_dirty(ptent) || PageDirty(page))
372
			mss->shared_dirty += ptent_size;
373
		else
374 375
			mss->shared_clean += ptent_size;
		mss->pss += (ptent_size << PSS_SHIFT) / mapcount;
376 377
	} else {
		if (pte_dirty(ptent) || PageDirty(page))
378
			mss->private_dirty += ptent_size;
379
		else
380 381
			mss->private_clean += ptent_size;
		mss->pss += (ptent_size << PSS_SHIFT);
382 383 384
	}
}

385
static int smaps_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end,
D
Dave Hansen 已提交
386
			   struct mm_walk *walk)
M
Mauricio Lin 已提交
387
{
D
Dave Hansen 已提交
388
	struct mem_size_stats *mss = walk->private;
389
	struct vm_area_struct *vma = mss->vma;
390
	pte_t *pte;
391
	spinlock_t *ptl;
M
Mauricio Lin 已提交
392

393 394 395 396 397 398 399 400 401
	spin_lock(&walk->mm->page_table_lock);
	if (pmd_trans_huge(*pmd)) {
		if (pmd_trans_splitting(*pmd)) {
			spin_unlock(&walk->mm->page_table_lock);
			wait_split_huge_page(vma->anon_vma, pmd);
		} else {
			smaps_pte_entry(*(pte_t *)pmd, addr,
					HPAGE_PMD_SIZE, walk);
			spin_unlock(&walk->mm->page_table_lock);
402
			mss->anonymous_thp += HPAGE_PMD_SIZE;
403 404 405 406 407 408 409 410 411 412
			return 0;
		}
	} else {
		spin_unlock(&walk->mm->page_table_lock);
	}
	/*
	 * The mmap_sem held all the way back in m_start() is what
	 * keeps khugepaged out of here and from collapsing things
	 * in here.
	 */
413
	pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
414
	for (; addr != end; pte++, addr += PAGE_SIZE)
415
		smaps_pte_entry(*pte, addr, PAGE_SIZE, walk);
416 417
	pte_unmap_unlock(pte - 1, ptl);
	cond_resched();
418
	return 0;
M
Mauricio Lin 已提交
419 420 421 422
}

static int show_smap(struct seq_file *m, void *v)
{
423 424
	struct proc_maps_private *priv = m->private;
	struct task_struct *task = priv->task;
M
Mauricio Lin 已提交
425 426
	struct vm_area_struct *vma = v;
	struct mem_size_stats mss;
D
Dave Hansen 已提交
427 428 429 430 431
	struct mm_walk smaps_walk = {
		.pmd_entry = smaps_pte_range,
		.mm = vma->vm_mm,
		.private = &mss,
	};
M
Mauricio Lin 已提交
432 433

	memset(&mss, 0, sizeof mss);
434
	mss.vma = vma;
435
	/* mmap_sem is held in m_start */
N
Nick Piggin 已提交
436
	if (vma->vm_mm && !is_vm_hugetlb_page(vma))
D
Dave Hansen 已提交
437
		walk_page_range(vma->vm_start, vma->vm_end, &smaps_walk);
438

439
	show_map_vma(m, vma);
440 441 442 443 444 445 446 447 448

	seq_printf(m,
		   "Size:           %8lu kB\n"
		   "Rss:            %8lu kB\n"
		   "Pss:            %8lu kB\n"
		   "Shared_Clean:   %8lu kB\n"
		   "Shared_Dirty:   %8lu kB\n"
		   "Private_Clean:  %8lu kB\n"
		   "Private_Dirty:  %8lu kB\n"
P
Peter Zijlstra 已提交
449
		   "Referenced:     %8lu kB\n"
450
		   "Anonymous:      %8lu kB\n"
451
		   "AnonHugePages:  %8lu kB\n"
452
		   "Swap:           %8lu kB\n"
453
		   "KernelPageSize: %8lu kB\n"
454 455
		   "MMUPageSize:    %8lu kB\n"
		   "Locked:         %8lu kB\n",
456 457 458 459 460 461 462
		   (vma->vm_end - vma->vm_start) >> 10,
		   mss.resident >> 10,
		   (unsigned long)(mss.pss >> (10 + PSS_SHIFT)),
		   mss.shared_clean  >> 10,
		   mss.shared_dirty  >> 10,
		   mss.private_clean >> 10,
		   mss.private_dirty >> 10,
P
Peter Zijlstra 已提交
463
		   mss.referenced >> 10,
464
		   mss.anonymous >> 10,
465
		   mss.anonymous_thp >> 10,
466
		   mss.swap >> 10,
467
		   vma_kernel_pagesize(vma) >> 10,
468 469 470
		   vma_mmu_pagesize(vma) >> 10,
		   (vma->vm_flags & VM_LOCKED) ?
			(unsigned long)(mss.pss >> (10 + PSS_SHIFT)) : 0);
471

472
	if (m->count < m->size)  /* vma is copied successfully */
473 474
		m->version = (vma != get_gate_vma(task->mm))
			? vma->vm_start : 0;
475
	return 0;
M
Mauricio Lin 已提交
476 477
}

478
static const struct seq_operations proc_pid_smaps_op = {
479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497
	.start	= m_start,
	.next	= m_next,
	.stop	= m_stop,
	.show	= show_smap
};

static int smaps_open(struct inode *inode, struct file *file)
{
	return do_maps_open(inode, file, &proc_pid_smaps_op);
}

const struct file_operations proc_smaps_operations = {
	.open		= smaps_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= seq_release_private,
};

static int clear_refs_pte_range(pmd_t *pmd, unsigned long addr,
D
Dave Hansen 已提交
498
				unsigned long end, struct mm_walk *walk)
499
{
D
Dave Hansen 已提交
500
	struct vm_area_struct *vma = walk->private;
501 502 503 504
	pte_t *pte, ptent;
	spinlock_t *ptl;
	struct page *page;

505 506
	split_huge_page_pmd(walk->mm, pmd);

507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525
	pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
	for (; addr != end; pte++, addr += PAGE_SIZE) {
		ptent = *pte;
		if (!pte_present(ptent))
			continue;

		page = vm_normal_page(vma, addr, ptent);
		if (!page)
			continue;

		/* Clear accessed and referenced bits. */
		ptep_test_and_clear_young(vma, addr, pte);
		ClearPageReferenced(page);
	}
	pte_unmap_unlock(pte - 1, ptl);
	cond_resched();
	return 0;
}

526 527 528 529
#define CLEAR_REFS_ALL 1
#define CLEAR_REFS_ANON 2
#define CLEAR_REFS_MAPPED 3

530 531
static ssize_t clear_refs_write(struct file *file, const char __user *buf,
				size_t count, loff_t *ppos)
532
{
533
	struct task_struct *task;
534
	char buffer[PROC_NUMBUF];
535
	struct mm_struct *mm;
536
	struct vm_area_struct *vma;
537
	long type;
538

539 540 541 542 543
	memset(buffer, 0, sizeof(buffer));
	if (count > sizeof(buffer) - 1)
		count = sizeof(buffer) - 1;
	if (copy_from_user(buffer, buf, count))
		return -EFAULT;
544 545
	if (strict_strtol(strstrip(buffer), 10, &type))
		return -EINVAL;
546
	if (type < CLEAR_REFS_ALL || type > CLEAR_REFS_MAPPED)
547 548 549 550 551 552
		return -EINVAL;
	task = get_proc_task(file->f_path.dentry->d_inode);
	if (!task)
		return -ESRCH;
	mm = get_task_mm(task);
	if (mm) {
553 554 555 556
		struct mm_walk clear_refs_walk = {
			.pmd_entry = clear_refs_pte_range,
			.mm = mm,
		};
557
		down_read(&mm->mmap_sem);
D
Dave Hansen 已提交
558 559
		for (vma = mm->mmap; vma; vma = vma->vm_next) {
			clear_refs_walk.private = vma;
560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576
			if (is_vm_hugetlb_page(vma))
				continue;
			/*
			 * Writing 1 to /proc/pid/clear_refs affects all pages.
			 *
			 * Writing 2 to /proc/pid/clear_refs only affects
			 * Anonymous pages.
			 *
			 * Writing 3 to /proc/pid/clear_refs only affects file
			 * mapped pages.
			 */
			if (type == CLEAR_REFS_ANON && vma->vm_file)
				continue;
			if (type == CLEAR_REFS_MAPPED && !vma->vm_file)
				continue;
			walk_page_range(vma->vm_start, vma->vm_end,
					&clear_refs_walk);
D
Dave Hansen 已提交
577
		}
578 579 580 581 582
		flush_tlb_mm(mm);
		up_read(&mm->mmap_sem);
		mmput(mm);
	}
	put_task_struct(task);
583 584

	return count;
585 586
}

587 588
const struct file_operations proc_clear_refs_operations = {
	.write		= clear_refs_write,
589
	.llseek		= noop_llseek,
590 591
};

592
struct pagemapread {
593 594
	int pos, len;
	u64 *buffer;
595 596
};

597 598 599 600 601 602 603 604 605 606 607 608 609 610 611
#define PM_ENTRY_BYTES      sizeof(u64)
#define PM_STATUS_BITS      3
#define PM_STATUS_OFFSET    (64 - PM_STATUS_BITS)
#define PM_STATUS_MASK      (((1LL << PM_STATUS_BITS) - 1) << PM_STATUS_OFFSET)
#define PM_STATUS(nr)       (((nr) << PM_STATUS_OFFSET) & PM_STATUS_MASK)
#define PM_PSHIFT_BITS      6
#define PM_PSHIFT_OFFSET    (PM_STATUS_OFFSET - PM_PSHIFT_BITS)
#define PM_PSHIFT_MASK      (((1LL << PM_PSHIFT_BITS) - 1) << PM_PSHIFT_OFFSET)
#define PM_PSHIFT(x)        (((u64) (x) << PM_PSHIFT_OFFSET) & PM_PSHIFT_MASK)
#define PM_PFRAME_MASK      ((1LL << PM_PSHIFT_OFFSET) - 1)
#define PM_PFRAME(x)        ((x) & PM_PFRAME_MASK)

#define PM_PRESENT          PM_STATUS(4LL)
#define PM_SWAP             PM_STATUS(2LL)
#define PM_NOT_PRESENT      PM_PSHIFT(PAGE_SHIFT)
612 613 614 615 616
#define PM_END_OF_BUFFER    1

static int add_to_pagemap(unsigned long addr, u64 pfn,
			  struct pagemapread *pm)
{
617 618
	pm->buffer[pm->pos++] = pfn;
	if (pm->pos >= pm->len)
619
		return PM_END_OF_BUFFER;
620 621 622 623
	return 0;
}

static int pagemap_pte_hole(unsigned long start, unsigned long end,
D
Dave Hansen 已提交
624
				struct mm_walk *walk)
625
{
D
Dave Hansen 已提交
626
	struct pagemapread *pm = walk->private;
627 628 629 630 631 632 633 634 635 636
	unsigned long addr;
	int err = 0;
	for (addr = start; addr < end; addr += PAGE_SIZE) {
		err = add_to_pagemap(addr, PM_NOT_PRESENT, pm);
		if (err)
			break;
	}
	return err;
}

637
static u64 swap_pte_to_pagemap_entry(pte_t pte)
638 639
{
	swp_entry_t e = pte_to_swp_entry(pte);
640
	return swp_type(e) | (swp_offset(e) << MAX_SWAPFILES_SHIFT);
641 642
}

643
static u64 pte_to_pagemap_entry(pte_t pte)
644
{
645
	u64 pme = 0;
646 647 648 649 650 651 652 653 654
	if (is_swap_pte(pte))
		pme = PM_PFRAME(swap_pte_to_pagemap_entry(pte))
			| PM_PSHIFT(PAGE_SHIFT) | PM_SWAP;
	else if (pte_present(pte))
		pme = PM_PFRAME(pte_pfn(pte))
			| PM_PSHIFT(PAGE_SHIFT) | PM_PRESENT;
	return pme;
}

655
static int pagemap_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end,
D
Dave Hansen 已提交
656
			     struct mm_walk *walk)
657
{
658
	struct vm_area_struct *vma;
D
Dave Hansen 已提交
659
	struct pagemapread *pm = walk->private;
660 661 662
	pte_t *pte;
	int err = 0;

663 664
	split_huge_page_pmd(walk->mm, pmd);

665 666
	/* find the first VMA at or above 'addr' */
	vma = find_vma(walk->mm, addr);
667 668
	for (; addr != end; addr += PAGE_SIZE) {
		u64 pfn = PM_NOT_PRESENT;
669 670 671 672 673 674 675 676 677 678 679 680 681 682 683

		/* check to see if we've left 'vma' behind
		 * and need a new, higher one */
		if (vma && (addr >= vma->vm_end))
			vma = find_vma(walk->mm, addr);

		/* check that 'vma' actually covers this address,
		 * and that it isn't a huge page vma */
		if (vma && (vma->vm_start <= addr) &&
		    !is_vm_hugetlb_page(vma)) {
			pte = pte_offset_map(pmd, addr);
			pfn = pte_to_pagemap_entry(*pte);
			/* unmap before userspace copy */
			pte_unmap(pte);
		}
684 685 686 687 688 689 690 691 692 693
		err = add_to_pagemap(addr, pfn, pm);
		if (err)
			return err;
	}

	cond_resched();

	return err;
}

694
#ifdef CONFIG_HUGETLB_PAGE
695 696 697 698 699 700 701 702 703
static u64 huge_pte_to_pagemap_entry(pte_t pte, int offset)
{
	u64 pme = 0;
	if (pte_present(pte))
		pme = PM_PFRAME(pte_pfn(pte) + offset)
			| PM_PSHIFT(PAGE_SHIFT) | PM_PRESENT;
	return pme;
}

704 705 706 707
/* This function walks within one hugetlb entry in the single call */
static int pagemap_hugetlb_range(pte_t *pte, unsigned long hmask,
				 unsigned long addr, unsigned long end,
				 struct mm_walk *walk)
708 709 710
{
	struct pagemapread *pm = walk->private;
	int err = 0;
711
	u64 pfn;
712 713

	for (; addr != end; addr += PAGE_SIZE) {
714 715
		int offset = (addr & ~hmask) >> PAGE_SHIFT;
		pfn = huge_pte_to_pagemap_entry(*pte, offset);
716 717 718 719 720 721 722 723 724
		err = add_to_pagemap(addr, pfn, pm);
		if (err)
			return err;
	}

	cond_resched();

	return err;
}
725
#endif /* HUGETLB_PAGE */
726

727 728 729
/*
 * /proc/pid/pagemap - an array mapping virtual pages to pfns
 *
730 731 732 733 734 735 736 737 738 739 740 741 742 743
 * For each page in the address space, this file contains one 64-bit entry
 * consisting of the following:
 *
 * Bits 0-55  page frame number (PFN) if present
 * Bits 0-4   swap type if swapped
 * Bits 5-55  swap offset if swapped
 * Bits 55-60 page shift (page size = 1<<page shift)
 * Bit  61    reserved for future use
 * Bit  62    page swapped
 * Bit  63    page present
 *
 * If the page is not present but in swap, then the PFN contains an
 * encoding of the swap file number and the page's offset into the
 * swap. Unmapped pages return a null PFN. This allows determining
744 745 746 747 748 749 750
 * precisely which pages are mapped (or in swap) and comparing mapped
 * pages between processes.
 *
 * Efficient users of this interface will use /proc/pid/maps to
 * determine which areas of memory are actually mapped and llseek to
 * skip over unmapped regions.
 */
751
#define PAGEMAP_WALK_SIZE	(PMD_SIZE)
752
#define PAGEMAP_WALK_MASK	(PMD_MASK)
753 754 755 756 757 758 759
static ssize_t pagemap_read(struct file *file, char __user *buf,
			    size_t count, loff_t *ppos)
{
	struct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);
	struct mm_struct *mm;
	struct pagemapread pm;
	int ret = -ESRCH;
760
	struct mm_walk pagemap_walk = {};
761 762 763 764
	unsigned long src;
	unsigned long svpfn;
	unsigned long start_vaddr;
	unsigned long end_vaddr;
765
	int copied = 0;
766 767 768 769

	if (!task)
		goto out;

A
Al Viro 已提交
770
	mm = mm_for_maps(task);
A
Al Viro 已提交
771 772
	ret = PTR_ERR(mm);
	if (!mm || IS_ERR(mm))
773
		goto out_task;
774 775 776

	ret = -EINVAL;
	/* file position must be aligned */
777
	if ((*ppos % PM_ENTRY_BYTES) || (count % PM_ENTRY_BYTES))
778
		goto out_task;
779 780

	ret = 0;
781 782 783 784

	if (!count)
		goto out_task;

785 786
	pm.len = PM_ENTRY_BYTES * (PAGEMAP_WALK_SIZE >> PAGE_SHIFT);
	pm.buffer = kmalloc(pm.len, GFP_TEMPORARY);
787
	ret = -ENOMEM;
788
	if (!pm.buffer)
789
		goto out_mm;
790

791 792
	pagemap_walk.pmd_entry = pagemap_pte_range;
	pagemap_walk.pte_hole = pagemap_pte_hole;
793
#ifdef CONFIG_HUGETLB_PAGE
794
	pagemap_walk.hugetlb_entry = pagemap_hugetlb_range;
795
#endif
796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813
	pagemap_walk.mm = mm;
	pagemap_walk.private = &pm;

	src = *ppos;
	svpfn = src / PM_ENTRY_BYTES;
	start_vaddr = svpfn << PAGE_SHIFT;
	end_vaddr = TASK_SIZE_OF(task);

	/* watch out for wraparound */
	if (svpfn > TASK_SIZE_OF(task) >> PAGE_SHIFT)
		start_vaddr = end_vaddr;

	/*
	 * The odds are that this will stop walking way
	 * before end_vaddr, because the length of the
	 * user buffer is tracked in "pm", and the walk
	 * will stop when we hit the end of the buffer.
	 */
814 815 816 817 818 819
	ret = 0;
	while (count && (start_vaddr < end_vaddr)) {
		int len;
		unsigned long end;

		pm.pos = 0;
820
		end = (start_vaddr + PAGEMAP_WALK_SIZE) & PAGEMAP_WALK_MASK;
821 822 823 824 825 826 827 828 829
		/* overflow ? */
		if (end < start_vaddr || end > end_vaddr)
			end = end_vaddr;
		down_read(&mm->mmap_sem);
		ret = walk_page_range(start_vaddr, end, &pagemap_walk);
		up_read(&mm->mmap_sem);
		start_vaddr = end;

		len = min(count, PM_ENTRY_BYTES * pm.pos);
830
		if (copy_to_user(buf, pm.buffer, len)) {
831 832 833 834 835 836
			ret = -EFAULT;
			goto out_free;
		}
		copied += len;
		buf += len;
		count -= len;
837
	}
838 839 840 841
	*ppos += copied;
	if (!ret || ret == PM_END_OF_BUFFER)
		ret = copied;

842
out_free:
843
	kfree(pm.buffer);
844 845
out_mm:
	mmput(mm);
846 847 848 849 850 851 852 853 854 855
out_task:
	put_task_struct(task);
out:
	return ret;
}

const struct file_operations proc_pagemap_operations = {
	.llseek		= mem_lseek, /* borrow this */
	.read		= pagemap_read,
};
856
#endif /* CONFIG_PROC_PAGE_MONITOR */
857

858
#ifdef CONFIG_NUMA
859
extern int show_numa_map(struct seq_file *m, void *v);
860

861
static const struct seq_operations proc_pid_numa_maps_op = {
862 863 864
        .start  = m_start,
        .next   = m_next,
        .stop   = m_stop,
A
Alexey Dobriyan 已提交
865
        .show   = show_numa_map,
866
};
867 868 869 870 871 872

static int numa_maps_open(struct inode *inode, struct file *file)
{
	return do_maps_open(inode, file, &proc_pid_numa_maps_op);
}

873
const struct file_operations proc_numa_maps_operations = {
874 875 876
	.open		= numa_maps_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
877
	.release	= seq_release_private,
878
};
879
#endif