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

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

22
void task_mem(struct seq_file *m, struct mm_struct *mm)
L
Linus Torvalds 已提交
23
{
24
	unsigned long data, text, lib, swap, ptes, pmds;
25 26 27 28 29 30 31 32 33 34 35 36 37 38 39
	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 已提交
40 41 42 43

	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 已提交
44
	swap = get_mm_counter(mm, MM_SWAPENTS);
45 46
	ptes = PTRS_PER_PTE * sizeof(pte_t) * atomic_long_read(&mm->nr_ptes);
	pmds = PTRS_PER_PMD * sizeof(pmd_t) * mm_nr_pmds(mm);
47
	seq_printf(m,
48
		"VmPeak:\t%8lu kB\n"
L
Linus Torvalds 已提交
49 50
		"VmSize:\t%8lu kB\n"
		"VmLck:\t%8lu kB\n"
51
		"VmPin:\t%8lu kB\n"
52
		"VmHWM:\t%8lu kB\n"
L
Linus Torvalds 已提交
53 54 55 56 57
		"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 已提交
58
		"VmPTE:\t%8lu kB\n"
59
		"VmPMD:\t%8lu kB\n"
K
KAMEZAWA Hiroyuki 已提交
60
		"VmSwap:\t%8lu kB\n",
61
		hiwater_vm << (PAGE_SHIFT-10),
62
		total_vm << (PAGE_SHIFT-10),
L
Linus Torvalds 已提交
63
		mm->locked_vm << (PAGE_SHIFT-10),
64
		mm->pinned_vm << (PAGE_SHIFT-10),
65 66
		hiwater_rss << (PAGE_SHIFT-10),
		total_rss << (PAGE_SHIFT-10),
L
Linus Torvalds 已提交
67 68
		data << (PAGE_SHIFT-10),
		mm->stack_vm << (PAGE_SHIFT-10), text, lib,
69 70
		ptes >> 10,
		pmds >> 10,
K
KAMEZAWA Hiroyuki 已提交
71
		swap << (PAGE_SHIFT-10));
L
Linus Torvalds 已提交
72 73 74 75 76 77 78
}

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

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

91 92
#ifdef CONFIG_NUMA
/*
93
 * Save get_task_policy() for show_numa_map().
94 95 96 97 98 99
 */
static void hold_task_mempolicy(struct proc_maps_private *priv)
{
	struct task_struct *task = priv->task;

	task_lock(task);
100
	priv->task_mempolicy = get_task_policy(task);
101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116
	mpol_get(priv->task_mempolicy);
	task_unlock(task);
}
static void release_task_mempolicy(struct proc_maps_private *priv)
{
	mpol_put(priv->task_mempolicy);
}
#else
static void hold_task_mempolicy(struct proc_maps_private *priv)
{
}
static void release_task_mempolicy(struct proc_maps_private *priv)
{
}
#endif

117
static void vma_stop(struct proc_maps_private *priv)
118
{
119 120 121 122 123
	struct mm_struct *mm = priv->mm;

	release_task_mempolicy(priv);
	up_read(&mm->mmap_sem);
	mmput(mm);
124
}
125

126 127 128 129 130 131 132 133
static struct vm_area_struct *
m_next_vma(struct proc_maps_private *priv, struct vm_area_struct *vma)
{
	if (vma == priv->tail_vma)
		return NULL;
	return vma->vm_next ?: priv->tail_vma;
}

134 135 136 137 138 139
static void m_cache_vma(struct seq_file *m, struct vm_area_struct *vma)
{
	if (m->count < m->size)	/* vma is copied successfully */
		m->version = m_next_vma(m->private, vma) ? vma->vm_start : -1UL;
}

140
static void *m_start(struct seq_file *m, loff_t *ppos)
M
Mauricio Lin 已提交
141
{
142
	struct proc_maps_private *priv = m->private;
143
	unsigned long last_addr = m->version;
144
	struct mm_struct *mm;
145 146
	struct vm_area_struct *vma;
	unsigned int pos = *ppos;
147

148 149 150 151
	/* See m_cache_vma(). Zero at the start or after lseek. */
	if (last_addr == -1UL)
		return NULL;

152
	priv->task = get_proc_task(priv->inode);
153
	if (!priv->task)
A
Al Viro 已提交
154
		return ERR_PTR(-ESRCH);
155

156 157 158
	mm = priv->mm;
	if (!mm || !atomic_inc_not_zero(&mm->mm_users))
		return NULL;
159

160
	down_read(&mm->mmap_sem);
161
	hold_task_mempolicy(priv);
162
	priv->tail_vma = get_gate_vma(mm);
163

164 165 166 167 168 169 170
	if (last_addr) {
		vma = find_vma(mm, last_addr);
		if (vma && (vma = m_next_vma(priv, vma)))
			return vma;
	}

	m->version = 0;
171
	if (pos < mm->map_count) {
172 173
		for (vma = mm->mmap; pos; pos--) {
			m->version = vma->vm_start;
174
			vma = vma->vm_next;
175
		}
176
		return vma;
177
	}
178

179
	/* we do not bother to update m->version in this case */
180 181
	if (pos == mm->map_count && priv->tail_vma)
		return priv->tail_vma;
182 183 184

	vma_stop(priv);
	return NULL;
185 186 187 188 189
}

static void *m_next(struct seq_file *m, void *v, loff_t *pos)
{
	struct proc_maps_private *priv = m->private;
190
	struct vm_area_struct *next;
191 192

	(*pos)++;
193
	next = m_next_vma(priv, v);
194 195 196
	if (!next)
		vma_stop(priv);
	return next;
197 198 199 200 201 202
}

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

203 204
	if (!IS_ERR_OR_NULL(v))
		vma_stop(priv);
205
	if (priv->task) {
206
		put_task_struct(priv->task);
207 208
		priv->task = NULL;
	}
209 210
}

211 212 213 214 215 216 217 218
static int proc_maps_open(struct inode *inode, struct file *file,
			const struct seq_operations *ops, int psize)
{
	struct proc_maps_private *priv = __seq_open_private(file, ops, psize);

	if (!priv)
		return -ENOMEM;

219
	priv->inode = inode;
220 221 222 223 224 225 226 227
	priv->mm = proc_mem_open(inode, PTRACE_MODE_READ);
	if (IS_ERR(priv->mm)) {
		int err = PTR_ERR(priv->mm);

		seq_release_private(inode, file);
		return err;
	}

228 229 230
	return 0;
}

231 232 233 234 235 236 237 238 239 240 241
static int proc_map_release(struct inode *inode, struct file *file)
{
	struct seq_file *seq = file->private_data;
	struct proc_maps_private *priv = seq->private;

	if (priv->mm)
		mmdrop(priv->mm);

	return seq_release_private(inode, file);
}

242
static int do_maps_open(struct inode *inode, struct file *file,
243
			const struct seq_operations *ops)
244
{
245 246
	return proc_maps_open(inode, file, ops,
				sizeof(struct proc_maps_private));
247
}
M
Mauricio Lin 已提交
248

249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267
static pid_t pid_of_stack(struct proc_maps_private *priv,
				struct vm_area_struct *vma, bool is_pid)
{
	struct inode *inode = priv->inode;
	struct task_struct *task;
	pid_t ret = 0;

	rcu_read_lock();
	task = pid_task(proc_pid(inode), PIDTYPE_PID);
	if (task) {
		task = task_of_stack(task, vma, is_pid);
		if (task)
			ret = task_pid_nr_ns(task, inode->i_sb->s_fs_info);
	}
	rcu_read_unlock();

	return ret;
}

268 269
static void
show_map_vma(struct seq_file *m, struct vm_area_struct *vma, int is_pid)
L
Linus Torvalds 已提交
270
{
M
Mauricio Lin 已提交
271 272
	struct mm_struct *mm = vma->vm_mm;
	struct file *file = vma->vm_file;
273
	struct proc_maps_private *priv = m->private;
274
	vm_flags_t flags = vma->vm_flags;
L
Linus Torvalds 已提交
275
	unsigned long ino = 0;
276
	unsigned long long pgoff = 0;
277
	unsigned long start, end;
L
Linus Torvalds 已提交
278
	dev_t dev = 0;
279
	const char *name = NULL;
L
Linus Torvalds 已提交
280 281

	if (file) {
A
Al Viro 已提交
282
		struct inode *inode = file_inode(vma->vm_file);
L
Linus Torvalds 已提交
283 284
		dev = inode->i_sb->s_dev;
		ino = inode->i_ino;
285
		pgoff = ((loff_t)vma->vm_pgoff) << PAGE_SHIFT;
L
Linus Torvalds 已提交
286 287
	}

288 289
	/* We don't show the stack guard page in /proc/maps */
	start = vma->vm_start;
290 291 292 293 294
	if (stack_guard_page_start(vma, start))
		start += PAGE_SIZE;
	end = vma->vm_end;
	if (stack_guard_page_end(vma, end))
		end -= PAGE_SIZE;
295

296 297
	seq_setwidth(m, 25 + sizeof(void *) * 6 - 1);
	seq_printf(m, "%08lx-%08lx %c%c%c%c %08llx %02x:%02x %lu ",
298
			start,
299
			end,
L
Linus Torvalds 已提交
300 301 302 303
			flags & VM_READ ? 'r' : '-',
			flags & VM_WRITE ? 'w' : '-',
			flags & VM_EXEC ? 'x' : '-',
			flags & VM_MAYSHARE ? 's' : 'p',
304
			pgoff,
305
			MAJOR(dev), MINOR(dev), ino);
L
Linus Torvalds 已提交
306 307 308 309 310

	/*
	 * Print the dentry name for named mappings, and a
	 * special [heap] marker for the heap:
	 */
M
Mauricio Lin 已提交
311
	if (file) {
312
		seq_pad(m, ' ');
313
		seq_path(m, &file->f_path, "\n");
314 315 316
		goto done;
	}

317 318 319 320 321 322
	if (vma->vm_ops && vma->vm_ops->name) {
		name = vma->vm_ops->name(vma);
		if (name)
			goto done;
	}

323 324 325 326 327 328 329 330 331 332 333 334 335 336 337
	name = arch_vma_name(vma);
	if (!name) {
		pid_t tid;

		if (!mm) {
			name = "[vdso]";
			goto done;
		}

		if (vma->vm_start <= mm->brk &&
		    vma->vm_end >= mm->start_brk) {
			name = "[heap]";
			goto done;
		}

338
		tid = pid_of_stack(priv, vma, is_pid);
339 340 341 342 343 344 345 346
		if (tid != 0) {
			/*
			 * Thread stack in /proc/PID/task/TID/maps or
			 * the main process stack.
			 */
			if (!is_pid || (vma->vm_start <= mm->start_stack &&
			    vma->vm_end >= mm->start_stack)) {
				name = "[stack]";
347
			} else {
348
				/* Thread stack in /proc/PID/maps */
349
				seq_pad(m, ' ');
350
				seq_printf(m, "[stack:%d]", tid);
L
Linus Torvalds 已提交
351
			}
352
		}
353 354 355 356
	}

done:
	if (name) {
357
		seq_pad(m, ' ');
358
		seq_puts(m, name);
L
Linus Torvalds 已提交
359 360
	}
	seq_putc(m, '\n');
361 362
}

363
static int show_map(struct seq_file *m, void *v, int is_pid)
364
{
365
	show_map_vma(m, v, is_pid);
366
	m_cache_vma(m, v);
L
Linus Torvalds 已提交
367 368 369
	return 0;
}

370 371 372 373 374 375 376 377 378 379
static int show_pid_map(struct seq_file *m, void *v)
{
	return show_map(m, v, 1);
}

static int show_tid_map(struct seq_file *m, void *v)
{
	return show_map(m, v, 0);
}

380
static const struct seq_operations proc_pid_maps_op = {
381 382 383
	.start	= m_start,
	.next	= m_next,
	.stop	= m_stop,
384 385 386 387 388 389 390 391
	.show	= show_pid_map
};

static const struct seq_operations proc_tid_maps_op = {
	.start	= m_start,
	.next	= m_next,
	.stop	= m_stop,
	.show	= show_tid_map
392 393
};

394
static int pid_maps_open(struct inode *inode, struct file *file)
395 396 397 398
{
	return do_maps_open(inode, file, &proc_pid_maps_op);
}

399 400 401 402 403 404 405 406 407
static int tid_maps_open(struct inode *inode, struct file *file)
{
	return do_maps_open(inode, file, &proc_tid_maps_op);
}

const struct file_operations proc_pid_maps_operations = {
	.open		= pid_maps_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
408
	.release	= proc_map_release,
409 410 411 412
};

const struct file_operations proc_tid_maps_operations = {
	.open		= tid_maps_open,
413 414
	.read		= seq_read,
	.llseek		= seq_lseek,
415
	.release	= proc_map_release,
416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436
};

/*
 * 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

437
#ifdef CONFIG_PROC_PAGE_MONITOR
P
Peter Zijlstra 已提交
438
struct mem_size_stats {
439 440 441 442 443 444
	unsigned long resident;
	unsigned long shared_clean;
	unsigned long shared_dirty;
	unsigned long private_clean;
	unsigned long private_dirty;
	unsigned long referenced;
445
	unsigned long anonymous;
446
	unsigned long anonymous_thp;
P
Peter Zijlstra 已提交
447
	unsigned long swap;
448 449 450
	u64 pss;
};

451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481
static void smaps_account(struct mem_size_stats *mss, struct page *page,
		unsigned long size, bool young, bool dirty)
{
	int mapcount;

	if (PageAnon(page))
		mss->anonymous += size;

	mss->resident += size;
	/* Accumulate the size in pages that have been accessed. */
	if (young || PageReferenced(page))
		mss->referenced += size;
	mapcount = page_mapcount(page);
	if (mapcount >= 2) {
		u64 pss_delta;

		if (dirty || PageDirty(page))
			mss->shared_dirty += size;
		else
			mss->shared_clean += size;
		pss_delta = (u64)size << PSS_SHIFT;
		do_div(pss_delta, mapcount);
		mss->pss += pss_delta;
	} else {
		if (dirty || PageDirty(page))
			mss->private_dirty += size;
		else
			mss->private_clean += size;
		mss->pss += (u64)size << PSS_SHIFT;
	}
}
482

483 484
static void smaps_pte_entry(pte_t *pte, unsigned long addr,
		struct mm_walk *walk)
485 486
{
	struct mem_size_stats *mss = walk->private;
487
	struct vm_area_struct *vma = walk->vma;
488
	struct page *page = NULL;
489

490 491 492 493
	if (pte_present(*pte)) {
		page = vm_normal_page(vma, addr, *pte);
	} else if (is_swap_pte(*pte)) {
		swp_entry_t swpent = pte_to_swp_entry(*pte);
494

495
		if (!non_swap_entry(swpent))
496
			mss->swap += PAGE_SIZE;
497 498 499
		else if (is_migration_entry(swpent))
			page = migration_entry_to_page(swpent);
	}
500 501 502

	if (!page)
		return;
503
	smaps_account(mss, page, PAGE_SIZE, pte_young(*pte), pte_dirty(*pte));
504 505
}

506 507 508 509 510
#ifdef CONFIG_TRANSPARENT_HUGEPAGE
static void smaps_pmd_entry(pmd_t *pmd, unsigned long addr,
		struct mm_walk *walk)
{
	struct mem_size_stats *mss = walk->private;
511
	struct vm_area_struct *vma = walk->vma;
512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528
	struct page *page;

	/* FOLL_DUMP will return -EFAULT on huge zero page */
	page = follow_trans_huge_pmd(vma, addr, pmd, FOLL_DUMP);
	if (IS_ERR_OR_NULL(page))
		return;
	mss->anonymous_thp += HPAGE_PMD_SIZE;
	smaps_account(mss, page, HPAGE_PMD_SIZE,
			pmd_young(*pmd), pmd_dirty(*pmd));
}
#else
static void smaps_pmd_entry(pmd_t *pmd, unsigned long addr,
		struct mm_walk *walk)
{
}
#endif

529
static int smaps_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end,
D
Dave Hansen 已提交
530
			   struct mm_walk *walk)
M
Mauricio Lin 已提交
531
{
532
	struct vm_area_struct *vma = walk->vma;
533
	pte_t *pte;
534
	spinlock_t *ptl;
M
Mauricio Lin 已提交
535

536
	if (pmd_trans_huge_lock(pmd, vma, &ptl) == 1) {
537
		smaps_pmd_entry(pmd, addr, walk);
538
		spin_unlock(ptl);
539
		return 0;
540
	}
541 542 543

	if (pmd_trans_unstable(pmd))
		return 0;
544 545 546 547 548
	/*
	 * The mmap_sem held all the way back in m_start() is what
	 * keeps khugepaged out of here and from collapsing things
	 * in here.
	 */
549
	pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
550
	for (; addr != end; pte++, addr += PAGE_SIZE)
551
		smaps_pte_entry(pte, addr, walk);
552 553
	pte_unmap_unlock(pte - 1, ptl);
	cond_resched();
554
	return 0;
M
Mauricio Lin 已提交
555 556
}

557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578
static void show_smap_vma_flags(struct seq_file *m, struct vm_area_struct *vma)
{
	/*
	 * Don't forget to update Documentation/ on changes.
	 */
	static const char mnemonics[BITS_PER_LONG][2] = {
		/*
		 * In case if we meet a flag we don't know about.
		 */
		[0 ... (BITS_PER_LONG-1)] = "??",

		[ilog2(VM_READ)]	= "rd",
		[ilog2(VM_WRITE)]	= "wr",
		[ilog2(VM_EXEC)]	= "ex",
		[ilog2(VM_SHARED)]	= "sh",
		[ilog2(VM_MAYREAD)]	= "mr",
		[ilog2(VM_MAYWRITE)]	= "mw",
		[ilog2(VM_MAYEXEC)]	= "me",
		[ilog2(VM_MAYSHARE)]	= "ms",
		[ilog2(VM_GROWSDOWN)]	= "gd",
		[ilog2(VM_PFNMAP)]	= "pf",
		[ilog2(VM_DENYWRITE)]	= "dw",
579 580 581
#ifdef CONFIG_X86_INTEL_MPX
		[ilog2(VM_MPX)]		= "mp",
#endif
582 583 584 585 586 587 588 589 590 591 592
		[ilog2(VM_LOCKED)]	= "lo",
		[ilog2(VM_IO)]		= "io",
		[ilog2(VM_SEQ_READ)]	= "sr",
		[ilog2(VM_RAND_READ)]	= "rr",
		[ilog2(VM_DONTCOPY)]	= "dc",
		[ilog2(VM_DONTEXPAND)]	= "de",
		[ilog2(VM_ACCOUNT)]	= "ac",
		[ilog2(VM_NORESERVE)]	= "nr",
		[ilog2(VM_HUGETLB)]	= "ht",
		[ilog2(VM_ARCH_1)]	= "ar",
		[ilog2(VM_DONTDUMP)]	= "dd",
593 594 595
#ifdef CONFIG_MEM_SOFT_DIRTY
		[ilog2(VM_SOFTDIRTY)]	= "sd",
#endif
596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612
		[ilog2(VM_MIXEDMAP)]	= "mm",
		[ilog2(VM_HUGEPAGE)]	= "hg",
		[ilog2(VM_NOHUGEPAGE)]	= "nh",
		[ilog2(VM_MERGEABLE)]	= "mg",
	};
	size_t i;

	seq_puts(m, "VmFlags: ");
	for (i = 0; i < BITS_PER_LONG; i++) {
		if (vma->vm_flags & (1UL << i)) {
			seq_printf(m, "%c%c ",
				   mnemonics[i][0], mnemonics[i][1]);
		}
	}
	seq_putc(m, '\n');
}

613
static int show_smap(struct seq_file *m, void *v, int is_pid)
M
Mauricio Lin 已提交
614 615 616
{
	struct vm_area_struct *vma = v;
	struct mem_size_stats mss;
D
Dave Hansen 已提交
617 618 619 620 621
	struct mm_walk smaps_walk = {
		.pmd_entry = smaps_pte_range,
		.mm = vma->vm_mm,
		.private = &mss,
	};
M
Mauricio Lin 已提交
622 623

	memset(&mss, 0, sizeof mss);
624
	/* mmap_sem is held in m_start */
625
	walk_page_vma(vma, &smaps_walk);
626

627
	show_map_vma(m, vma, is_pid);
628 629 630 631 632 633 634 635 636

	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 已提交
637
		   "Referenced:     %8lu kB\n"
638
		   "Anonymous:      %8lu kB\n"
639
		   "AnonHugePages:  %8lu kB\n"
640
		   "Swap:           %8lu kB\n"
641
		   "KernelPageSize: %8lu kB\n"
642 643
		   "MMUPageSize:    %8lu kB\n"
		   "Locked:         %8lu kB\n",
644 645 646 647 648 649 650
		   (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 已提交
651
		   mss.referenced >> 10,
652
		   mss.anonymous >> 10,
653
		   mss.anonymous_thp >> 10,
654
		   mss.swap >> 10,
655
		   vma_kernel_pagesize(vma) >> 10,
656 657 658
		   vma_mmu_pagesize(vma) >> 10,
		   (vma->vm_flags & VM_LOCKED) ?
			(unsigned long)(mss.pss >> (10 + PSS_SHIFT)) : 0);
659

660
	show_smap_vma_flags(m, vma);
661
	m_cache_vma(m, vma);
662
	return 0;
M
Mauricio Lin 已提交
663 664
}

665 666 667 668 669 670 671 672 673 674
static int show_pid_smap(struct seq_file *m, void *v)
{
	return show_smap(m, v, 1);
}

static int show_tid_smap(struct seq_file *m, void *v)
{
	return show_smap(m, v, 0);
}

675
static const struct seq_operations proc_pid_smaps_op = {
676 677 678
	.start	= m_start,
	.next	= m_next,
	.stop	= m_stop,
679 680 681 682 683 684 685 686
	.show	= show_pid_smap
};

static const struct seq_operations proc_tid_smaps_op = {
	.start	= m_start,
	.next	= m_next,
	.stop	= m_stop,
	.show	= show_tid_smap
687 688
};

689
static int pid_smaps_open(struct inode *inode, struct file *file)
690 691 692 693
{
	return do_maps_open(inode, file, &proc_pid_smaps_op);
}

694 695 696 697 698 699 700 701 702
static int tid_smaps_open(struct inode *inode, struct file *file)
{
	return do_maps_open(inode, file, &proc_tid_smaps_op);
}

const struct file_operations proc_pid_smaps_operations = {
	.open		= pid_smaps_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
703
	.release	= proc_map_release,
704 705 706 707
};

const struct file_operations proc_tid_smaps_operations = {
	.open		= tid_smaps_open,
708 709
	.read		= seq_read,
	.llseek		= seq_lseek,
710
	.release	= proc_map_release,
711 712
};

713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729
/*
 * We do not want to have constant page-shift bits sitting in
 * pagemap entries and are about to reuse them some time soon.
 *
 * Here's the "migration strategy":
 * 1. when the system boots these bits remain what they are,
 *    but a warning about future change is printed in log;
 * 2. once anyone clears soft-dirty bits via clear_refs file,
 *    these flag is set to denote, that user is aware of the
 *    new API and those page-shift bits change their meaning.
 *    The respective warning is printed in dmesg;
 * 3. In a couple of releases we will remove all the mentions
 *    of page-shift in pagemap entries.
 */

static bool soft_dirty_cleared __read_mostly;

730 731 732 733
enum clear_refs_types {
	CLEAR_REFS_ALL = 1,
	CLEAR_REFS_ANON,
	CLEAR_REFS_MAPPED,
734
	CLEAR_REFS_SOFT_DIRTY,
735 736 737
	CLEAR_REFS_LAST,
};

738
struct clear_refs_private {
739
	enum clear_refs_types type;
740 741
};

742 743 744 745 746 747 748 749 750 751 752
static inline void clear_soft_dirty(struct vm_area_struct *vma,
		unsigned long addr, pte_t *pte)
{
#ifdef CONFIG_MEM_SOFT_DIRTY
	/*
	 * The soft-dirty tracker uses #PF-s to catch writes
	 * to pages, so write-protect the pte as well. See the
	 * Documentation/vm/soft-dirty.txt for full description
	 * of how soft-dirty works.
	 */
	pte_t ptent = *pte;
753 754 755 756 757 758 759 760

	if (pte_present(ptent)) {
		ptent = pte_wrprotect(ptent);
		ptent = pte_clear_flags(ptent, _PAGE_SOFT_DIRTY);
	} else if (is_swap_pte(ptent)) {
		ptent = pte_swp_clear_soft_dirty(ptent);
	}

761 762 763 764
	set_pte_at(vma->vm_mm, addr, pte, ptent);
#endif
}

765
static int clear_refs_pte_range(pmd_t *pmd, unsigned long addr,
D
Dave Hansen 已提交
766
				unsigned long end, struct mm_walk *walk)
767
{
768
	struct clear_refs_private *cp = walk->private;
769
	struct vm_area_struct *vma = walk->vma;
770 771 772 773
	pte_t *pte, ptent;
	spinlock_t *ptl;
	struct page *page;

774
	split_huge_page_pmd(vma, addr, pmd);
775 776
	if (pmd_trans_unstable(pmd))
		return 0;
777

778 779 780 781
	pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
	for (; addr != end; pte++, addr += PAGE_SIZE) {
		ptent = *pte;

782 783 784 785 786
		if (cp->type == CLEAR_REFS_SOFT_DIRTY) {
			clear_soft_dirty(vma, addr, pte);
			continue;
		}

787 788 789
		if (!pte_present(ptent))
			continue;

790 791 792 793 794 795 796 797 798 799 800 801 802
		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;
}

803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821
static int clear_refs_test_walk(unsigned long start, unsigned long end,
				struct mm_walk *walk)
{
	struct clear_refs_private *cp = walk->private;
	struct vm_area_struct *vma = walk->vma;

	/*
	 * 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.
	 * Writing 4 to /proc/pid/clear_refs affects all pages.
	 */
	if (cp->type == CLEAR_REFS_ANON && vma->vm_file)
		return 1;
	if (cp->type == CLEAR_REFS_MAPPED && !vma->vm_file)
		return 1;
	return 0;
}

822 823
static ssize_t clear_refs_write(struct file *file, const char __user *buf,
				size_t count, loff_t *ppos)
824
{
825
	struct task_struct *task;
826
	char buffer[PROC_NUMBUF];
827
	struct mm_struct *mm;
828
	struct vm_area_struct *vma;
829 830
	enum clear_refs_types type;
	int itype;
A
Alexey Dobriyan 已提交
831
	int rv;
832

833 834 835 836 837
	memset(buffer, 0, sizeof(buffer));
	if (count > sizeof(buffer) - 1)
		count = sizeof(buffer) - 1;
	if (copy_from_user(buffer, buf, count))
		return -EFAULT;
838
	rv = kstrtoint(strstrip(buffer), 10, &itype);
A
Alexey Dobriyan 已提交
839 840
	if (rv < 0)
		return rv;
841 842
	type = (enum clear_refs_types)itype;
	if (type < CLEAR_REFS_ALL || type >= CLEAR_REFS_LAST)
843
		return -EINVAL;
844 845 846

	if (type == CLEAR_REFS_SOFT_DIRTY) {
		soft_dirty_cleared = true;
847 848 849
		pr_warn_once("The pagemap bits 55-60 has changed their meaning!"
			     " See the linux/Documentation/vm/pagemap.txt for "
			     "details.\n");
850 851
	}

A
Al Viro 已提交
852
	task = get_proc_task(file_inode(file));
853 854 855 856
	if (!task)
		return -ESRCH;
	mm = get_task_mm(task);
	if (mm) {
857
		struct clear_refs_private cp = {
858
			.type = type,
859
		};
860 861
		struct mm_walk clear_refs_walk = {
			.pmd_entry = clear_refs_pte_range,
862
			.test_walk = clear_refs_test_walk,
863
			.mm = mm,
864
			.private = &cp,
865
		};
866
		down_read(&mm->mmap_sem);
867 868 869 870 871 872 873 874 875 876 877 878 879
		if (type == CLEAR_REFS_SOFT_DIRTY) {
			for (vma = mm->mmap; vma; vma = vma->vm_next) {
				if (!(vma->vm_flags & VM_SOFTDIRTY))
					continue;
				up_read(&mm->mmap_sem);
				down_write(&mm->mmap_sem);
				for (vma = mm->mmap; vma; vma = vma->vm_next) {
					vma->vm_flags &= ~VM_SOFTDIRTY;
					vma_set_page_prot(vma);
				}
				downgrade_write(&mm->mmap_sem);
				break;
			}
880
			mmu_notifier_invalidate_range_start(mm, 0, -1);
881
		}
882
		walk_page_range(0, ~0UL, &clear_refs_walk);
883 884
		if (type == CLEAR_REFS_SOFT_DIRTY)
			mmu_notifier_invalidate_range_end(mm, 0, -1);
885 886 887 888 889
		flush_tlb_mm(mm);
		up_read(&mm->mmap_sem);
		mmput(mm);
	}
	put_task_struct(task);
890 891

	return count;
892 893
}

894 895
const struct file_operations proc_clear_refs_operations = {
	.write		= clear_refs_write,
896
	.llseek		= noop_llseek,
897 898
};

899 900 901 902
typedef struct {
	u64 pme;
} pagemap_entry_t;

903
struct pagemapread {
904
	int pos, len;		/* units: PM_ENTRY_BYTES, not bytes */
905
	pagemap_entry_t *buffer;
906
	bool v2;
907 908
};

909 910 911
#define PAGEMAP_WALK_SIZE	(PMD_SIZE)
#define PAGEMAP_WALK_MASK	(PMD_MASK)

912
#define PM_ENTRY_BYTES      sizeof(pagemap_entry_t)
913 914 915 916 917 918 919
#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)
920
#define __PM_PSHIFT(x)      (((u64) (x) << PM_PSHIFT_OFFSET) & PM_PSHIFT_MASK)
921 922
#define PM_PFRAME_MASK      ((1LL << PM_PSHIFT_OFFSET) - 1)
#define PM_PFRAME(x)        ((x) & PM_PFRAME_MASK)
923 924
/* in "new" pagemap pshift bits are occupied with more status bits */
#define PM_STATUS2(v2, x)   (__PM_PSHIFT(v2 ? x : PAGE_SHIFT))
925

926
#define __PM_SOFT_DIRTY      (1LL)
927 928
#define PM_PRESENT          PM_STATUS(4LL)
#define PM_SWAP             PM_STATUS(2LL)
929
#define PM_FILE             PM_STATUS(1LL)
930
#define PM_NOT_PRESENT(v2)  PM_STATUS2(v2, 0)
931 932
#define PM_END_OF_BUFFER    1

933 934 935 936 937 938
static inline pagemap_entry_t make_pme(u64 val)
{
	return (pagemap_entry_t) { .pme = val };
}

static int add_to_pagemap(unsigned long addr, pagemap_entry_t *pme,
939 940
			  struct pagemapread *pm)
{
941
	pm->buffer[pm->pos++] = *pme;
942
	if (pm->pos >= pm->len)
943
		return PM_END_OF_BUFFER;
944 945 946 947
	return 0;
}

static int pagemap_pte_hole(unsigned long start, unsigned long end,
D
Dave Hansen 已提交
948
				struct mm_walk *walk)
949
{
D
Dave Hansen 已提交
950
	struct pagemapread *pm = walk->private;
951
	unsigned long addr = start;
952
	int err = 0;
953

954 955 956
	while (addr < end) {
		struct vm_area_struct *vma = find_vma(walk->mm, addr);
		pagemap_entry_t pme = make_pme(PM_NOT_PRESENT(pm->v2));
957 958
		/* End of address space hole, which we mark as non-present. */
		unsigned long hole_end;
959

960 961 962 963 964 965 966 967 968
		if (vma)
			hole_end = min(end, vma->vm_start);
		else
			hole_end = end;

		for (; addr < hole_end; addr += PAGE_SIZE) {
			err = add_to_pagemap(addr, &pme, pm);
			if (err)
				goto out;
969 970
		}

971 972 973 974 975 976 977
		if (!vma)
			break;

		/* Addresses in the VMA. */
		if (vma->vm_flags & VM_SOFTDIRTY)
			pme.pme |= PM_STATUS2(pm->v2, __PM_SOFT_DIRTY);
		for (; addr < min(end, vma->vm_end); addr += PAGE_SIZE) {
978 979 980 981
			err = add_to_pagemap(addr, &pme, pm);
			if (err)
				goto out;
		}
982
	}
983
out:
984 985 986
	return err;
}

987
static void pte_to_pagemap_entry(pagemap_entry_t *pme, struct pagemapread *pm,
988
		struct vm_area_struct *vma, unsigned long addr, pte_t pte)
989
{
990 991
	u64 frame, flags;
	struct page *page = NULL;
992
	int flags2 = 0;
993

994 995 996 997
	if (pte_present(pte)) {
		frame = pte_pfn(pte);
		flags = PM_PRESENT;
		page = vm_normal_page(vma, addr, pte);
998 999
		if (pte_soft_dirty(pte))
			flags2 |= __PM_SOFT_DIRTY;
1000
	} else if (is_swap_pte(pte)) {
1001 1002 1003 1004
		swp_entry_t entry;
		if (pte_swp_soft_dirty(pte))
			flags2 |= __PM_SOFT_DIRTY;
		entry = pte_to_swp_entry(pte);
1005 1006 1007 1008 1009 1010
		frame = swp_type(entry) |
			(swp_offset(entry) << MAX_SWAPFILES_SHIFT);
		flags = PM_SWAP;
		if (is_migration_entry(entry))
			page = migration_entry_to_page(entry);
	} else {
1011 1012 1013
		if (vma->vm_flags & VM_SOFTDIRTY)
			flags2 |= __PM_SOFT_DIRTY;
		*pme = make_pme(PM_NOT_PRESENT(pm->v2) | PM_STATUS2(pm->v2, flags2));
1014 1015 1016 1017 1018
		return;
	}

	if (page && !PageAnon(page))
		flags |= PM_FILE;
1019
	if ((vma->vm_flags & VM_SOFTDIRTY))
1020
		flags2 |= __PM_SOFT_DIRTY;
1021

1022
	*pme = make_pme(PM_PFRAME(frame) | PM_STATUS2(pm->v2, flags2) | flags);
1023 1024
}

1025
#ifdef CONFIG_TRANSPARENT_HUGEPAGE
1026
static void thp_pmd_to_pagemap_entry(pagemap_entry_t *pme, struct pagemapread *pm,
1027
		pmd_t pmd, int offset, int pmd_flags2)
1028 1029 1030 1031 1032 1033 1034
{
	/*
	 * Currently pmd for thp is always present because thp can not be
	 * swapped-out, migrated, or HWPOISONed (split in such cases instead.)
	 * This if-check is just to prepare for future implementation.
	 */
	if (pmd_present(pmd))
1035
		*pme = make_pme(PM_PFRAME(pmd_pfn(pmd) + offset)
1036
				| PM_STATUS2(pm->v2, pmd_flags2) | PM_PRESENT);
1037
	else
1038
		*pme = make_pme(PM_NOT_PRESENT(pm->v2) | PM_STATUS2(pm->v2, pmd_flags2));
1039 1040
}
#else
1041
static inline void thp_pmd_to_pagemap_entry(pagemap_entry_t *pme, struct pagemapread *pm,
1042
		pmd_t pmd, int offset, int pmd_flags2)
1043 1044 1045 1046
{
}
#endif

1047
static int pagemap_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end,
D
Dave Hansen 已提交
1048
			     struct mm_walk *walk)
1049
{
1050
	struct vm_area_struct *vma = walk->vma;
D
Dave Hansen 已提交
1051
	struct pagemapread *pm = walk->private;
1052
	spinlock_t *ptl;
1053
	pte_t *pte, *orig_pte;
1054 1055
	int err = 0;

1056
	if (pmd_trans_huge_lock(pmd, vma, &ptl) == 1) {
1057 1058
		int pmd_flags2;

1059 1060 1061 1062 1063
		if ((vma->vm_flags & VM_SOFTDIRTY) || pmd_soft_dirty(*pmd))
			pmd_flags2 = __PM_SOFT_DIRTY;
		else
			pmd_flags2 = 0;

1064 1065
		for (; addr != end; addr += PAGE_SIZE) {
			unsigned long offset;
1066
			pagemap_entry_t pme;
1067 1068 1069

			offset = (addr & ~PAGEMAP_WALK_MASK) >>
					PAGE_SHIFT;
1070
			thp_pmd_to_pagemap_entry(&pme, pm, *pmd, offset, pmd_flags2);
1071
			err = add_to_pagemap(addr, &pme, pm);
1072 1073
			if (err)
				break;
1074
		}
1075
		spin_unlock(ptl);
1076
		return err;
1077 1078
	}

1079 1080
	if (pmd_trans_unstable(pmd))
		return 0;
1081

1082 1083 1084 1085 1086 1087 1088
	/*
	 * We can assume that @vma always points to a valid one and @end never
	 * goes beyond vma->vm_end.
	 */
	orig_pte = pte = pte_offset_map_lock(walk->mm, pmd, addr, &ptl);
	for (; addr < end; pte++, addr += PAGE_SIZE) {
		pagemap_entry_t pme;
1089

1090 1091
		pte_to_pagemap_entry(&pme, pm, vma, addr, *pte);
		err = add_to_pagemap(addr, &pme, pm);
1092
		if (err)
1093
			break;
1094
	}
1095
	pte_unmap_unlock(orig_pte, ptl);
1096 1097 1098 1099 1100 1101

	cond_resched();

	return err;
}

1102
#ifdef CONFIG_HUGETLB_PAGE
1103
static void huge_pte_to_pagemap_entry(pagemap_entry_t *pme, struct pagemapread *pm,
1104
					pte_t pte, int offset, int flags2)
1105 1106
{
	if (pte_present(pte))
1107 1108 1109
		*pme = make_pme(PM_PFRAME(pte_pfn(pte) + offset)	|
				PM_STATUS2(pm->v2, flags2)		|
				PM_PRESENT);
1110
	else
1111 1112
		*pme = make_pme(PM_NOT_PRESENT(pm->v2)			|
				PM_STATUS2(pm->v2, flags2));
1113 1114
}

1115 1116 1117 1118
/* 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)
1119 1120
{
	struct pagemapread *pm = walk->private;
1121
	struct vm_area_struct *vma = walk->vma;
1122
	int err = 0;
1123
	int flags2;
1124
	pagemap_entry_t pme;
1125

1126
	if (vma->vm_flags & VM_SOFTDIRTY)
1127 1128 1129 1130
		flags2 = __PM_SOFT_DIRTY;
	else
		flags2 = 0;

1131
	for (; addr != end; addr += PAGE_SIZE) {
1132
		int offset = (addr & ~hmask) >> PAGE_SHIFT;
1133
		huge_pte_to_pagemap_entry(&pme, pm, *pte, offset, flags2);
1134
		err = add_to_pagemap(addr, &pme, pm);
1135 1136 1137 1138 1139 1140 1141 1142
		if (err)
			return err;
	}

	cond_resched();

	return err;
}
1143
#endif /* HUGETLB_PAGE */
1144

1145 1146 1147
/*
 * /proc/pid/pagemap - an array mapping virtual pages to pfns
 *
1148 1149 1150
 * For each page in the address space, this file contains one 64-bit entry
 * consisting of the following:
 *
1151
 * Bits 0-54  page frame number (PFN) if present
1152
 * Bits 0-4   swap type if swapped
1153
 * Bits 5-54  swap offset if swapped
1154
 * Bits 55-60 page shift (page size = 1<<page shift)
1155
 * Bit  61    page is file-page or shared-anon
1156 1157 1158 1159 1160 1161
 * 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
1162 1163 1164 1165 1166 1167 1168 1169 1170 1171
 * 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.
 */
static ssize_t pagemap_read(struct file *file, char __user *buf,
			    size_t count, loff_t *ppos)
{
A
Al Viro 已提交
1172
	struct task_struct *task = get_proc_task(file_inode(file));
1173 1174 1175
	struct mm_struct *mm;
	struct pagemapread pm;
	int ret = -ESRCH;
1176
	struct mm_walk pagemap_walk = {};
1177 1178 1179 1180
	unsigned long src;
	unsigned long svpfn;
	unsigned long start_vaddr;
	unsigned long end_vaddr;
1181
	int copied = 0;
1182 1183 1184 1185 1186 1187

	if (!task)
		goto out;

	ret = -EINVAL;
	/* file position must be aligned */
1188
	if ((*ppos % PM_ENTRY_BYTES) || (count % PM_ENTRY_BYTES))
1189
		goto out_task;
1190 1191

	ret = 0;
1192 1193 1194
	if (!count)
		goto out_task;

1195
	pm.v2 = soft_dirty_cleared;
1196 1197
	pm.len = (PAGEMAP_WALK_SIZE >> PAGE_SHIFT);
	pm.buffer = kmalloc(pm.len * PM_ENTRY_BYTES, GFP_TEMPORARY);
1198
	ret = -ENOMEM;
1199
	if (!pm.buffer)
1200 1201
		goto out_task;

C
Cong Wang 已提交
1202
	mm = mm_access(task, PTRACE_MODE_READ);
1203 1204 1205
	ret = PTR_ERR(mm);
	if (!mm || IS_ERR(mm))
		goto out_free;
1206

1207 1208
	pagemap_walk.pmd_entry = pagemap_pte_range;
	pagemap_walk.pte_hole = pagemap_pte_hole;
1209
#ifdef CONFIG_HUGETLB_PAGE
1210
	pagemap_walk.hugetlb_entry = pagemap_hugetlb_range;
1211
#endif
1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229
	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.
	 */
1230 1231 1232 1233 1234 1235
	ret = 0;
	while (count && (start_vaddr < end_vaddr)) {
		int len;
		unsigned long end;

		pm.pos = 0;
1236
		end = (start_vaddr + PAGEMAP_WALK_SIZE) & PAGEMAP_WALK_MASK;
1237 1238 1239 1240 1241 1242 1243 1244 1245
		/* 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);
1246
		if (copy_to_user(buf, pm.buffer, len)) {
1247
			ret = -EFAULT;
1248
			goto out_mm;
1249 1250 1251 1252
		}
		copied += len;
		buf += len;
		count -= len;
1253
	}
1254 1255 1256 1257
	*ppos += copied;
	if (!ret || ret == PM_END_OF_BUFFER)
		ret = copied;

1258 1259
out_mm:
	mmput(mm);
1260 1261
out_free:
	kfree(pm.buffer);
1262 1263 1264 1265 1266 1267
out_task:
	put_task_struct(task);
out:
	return ret;
}

1268 1269 1270 1271 1272 1273 1274 1275
static int pagemap_open(struct inode *inode, struct file *file)
{
	pr_warn_once("Bits 55-60 of /proc/PID/pagemap entries are about "
			"to stop being page-shift some time soon. See the "
			"linux/Documentation/vm/pagemap.txt for details.\n");
	return 0;
}

1276 1277 1278
const struct file_operations proc_pagemap_operations = {
	.llseek		= mem_lseek, /* borrow this */
	.read		= pagemap_read,
1279
	.open		= pagemap_open,
1280
};
1281
#endif /* CONFIG_PROC_PAGE_MONITOR */
1282

1283 1284
#ifdef CONFIG_NUMA

1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295
struct numa_maps {
	unsigned long pages;
	unsigned long anon;
	unsigned long active;
	unsigned long writeback;
	unsigned long mapcount_max;
	unsigned long dirty;
	unsigned long swapcache;
	unsigned long node[MAX_NUMNODES];
};

1296 1297 1298 1299 1300
struct numa_maps_private {
	struct proc_maps_private proc_maps;
	struct numa_maps md;
};

1301 1302
static void gather_stats(struct page *page, struct numa_maps *md, int pte_dirty,
			unsigned long nr_pages)
1303 1304 1305
{
	int count = page_mapcount(page);

1306
	md->pages += nr_pages;
1307
	if (pte_dirty || PageDirty(page))
1308
		md->dirty += nr_pages;
1309 1310

	if (PageSwapCache(page))
1311
		md->swapcache += nr_pages;
1312 1313

	if (PageActive(page) || PageUnevictable(page))
1314
		md->active += nr_pages;
1315 1316

	if (PageWriteback(page))
1317
		md->writeback += nr_pages;
1318 1319

	if (PageAnon(page))
1320
		md->anon += nr_pages;
1321 1322 1323 1324

	if (count > md->mapcount_max)
		md->mapcount_max = count;

1325
	md->node[page_to_nid(page)] += nr_pages;
1326 1327
}

1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344
static struct page *can_gather_numa_stats(pte_t pte, struct vm_area_struct *vma,
		unsigned long addr)
{
	struct page *page;
	int nid;

	if (!pte_present(pte))
		return NULL;

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

	if (PageReserved(page))
		return NULL;

	nid = page_to_nid(page);
1345
	if (!node_isset(nid, node_states[N_MEMORY]))
1346 1347 1348 1349 1350
		return NULL;

	return page;
}

1351 1352 1353
static int gather_pte_stats(pmd_t *pmd, unsigned long addr,
		unsigned long end, struct mm_walk *walk)
{
1354 1355
	struct numa_maps *md = walk->private;
	struct vm_area_struct *vma = walk->vma;
1356 1357 1358 1359
	spinlock_t *ptl;
	pte_t *orig_pte;
	pte_t *pte;

1360
	if (pmd_trans_huge_lock(pmd, vma, &ptl) == 1) {
1361 1362 1363
		pte_t huge_pte = *(pte_t *)pmd;
		struct page *page;

1364
		page = can_gather_numa_stats(huge_pte, vma, addr);
1365 1366 1367
		if (page)
			gather_stats(page, md, pte_dirty(huge_pte),
				     HPAGE_PMD_SIZE/PAGE_SIZE);
1368
		spin_unlock(ptl);
1369
		return 0;
1370 1371
	}

1372 1373
	if (pmd_trans_unstable(pmd))
		return 0;
1374 1375
	orig_pte = pte = pte_offset_map_lock(walk->mm, pmd, addr, &ptl);
	do {
1376
		struct page *page = can_gather_numa_stats(*pte, vma, addr);
1377 1378
		if (!page)
			continue;
1379
		gather_stats(page, md, pte_dirty(*pte), 1);
1380 1381 1382 1383 1384 1385

	} while (pte++, addr += PAGE_SIZE, addr != end);
	pte_unmap_unlock(orig_pte, ptl);
	return 0;
}
#ifdef CONFIG_HUGETLB_PAGE
1386
static int gather_hugetlb_stats(pte_t *pte, unsigned long hmask,
1387 1388 1389 1390 1391
		unsigned long addr, unsigned long end, struct mm_walk *walk)
{
	struct numa_maps *md;
	struct page *page;

1392
	if (!pte_present(*pte))
1393 1394 1395 1396 1397 1398 1399
		return 0;

	page = pte_page(*pte);
	if (!page)
		return 0;

	md = walk->private;
1400
	gather_stats(page, md, pte_dirty(*pte), 1);
1401 1402 1403 1404
	return 0;
}

#else
1405
static int gather_hugetlb_stats(pte_t *pte, unsigned long hmask,
1406 1407 1408 1409 1410 1411 1412 1413 1414
		unsigned long addr, unsigned long end, struct mm_walk *walk)
{
	return 0;
}
#endif

/*
 * Display pages allocated per node and memory policy via /proc.
 */
1415
static int show_numa_map(struct seq_file *m, void *v, int is_pid)
1416
{
1417 1418
	struct numa_maps_private *numa_priv = m->private;
	struct proc_maps_private *proc_priv = &numa_priv->proc_maps;
1419
	struct vm_area_struct *vma = v;
1420
	struct numa_maps *md = &numa_priv->md;
1421 1422
	struct file *file = vma->vm_file;
	struct mm_struct *mm = vma->vm_mm;
1423 1424 1425 1426 1427 1428
	struct mm_walk walk = {
		.hugetlb_entry = gather_hugetlb_stats,
		.pmd_entry = gather_pte_stats,
		.private = md,
		.mm = mm,
	};
1429
	struct mempolicy *pol;
1430 1431
	char buffer[64];
	int nid;
1432 1433 1434 1435

	if (!mm)
		return 0;

1436 1437
	/* Ensure we start with an empty set of numa_maps statistics. */
	memset(md, 0, sizeof(*md));
1438

1439 1440 1441 1442 1443 1444 1445
	pol = __get_vma_policy(vma, vma->vm_start);
	if (pol) {
		mpol_to_str(buffer, sizeof(buffer), pol);
		mpol_cond_put(pol);
	} else {
		mpol_to_str(buffer, sizeof(buffer), proc_priv->task_mempolicy);
	}
1446 1447 1448 1449

	seq_printf(m, "%08lx %s", vma->vm_start, buffer);

	if (file) {
1450
		seq_puts(m, " file=");
1451 1452
		seq_path(m, &file->f_path, "\n\t= ");
	} else if (vma->vm_start <= mm->brk && vma->vm_end >= mm->start_brk) {
1453
		seq_puts(m, " heap");
1454
	} else {
1455
		pid_t tid = pid_of_stack(proc_priv, vma, is_pid);
1456 1457 1458 1459 1460 1461 1462
		if (tid != 0) {
			/*
			 * Thread stack in /proc/PID/task/TID/maps or
			 * the main process stack.
			 */
			if (!is_pid || (vma->vm_start <= mm->start_stack &&
			    vma->vm_end >= mm->start_stack))
1463
				seq_puts(m, " stack");
1464 1465 1466
			else
				seq_printf(m, " stack:%d", tid);
		}
1467 1468
	}

1469
	if (is_vm_hugetlb_page(vma))
1470
		seq_puts(m, " huge");
1471

1472 1473
	/* mmap_sem is held by m_start */
	walk_page_vma(vma, &walk);
1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498

	if (!md->pages)
		goto out;

	if (md->anon)
		seq_printf(m, " anon=%lu", md->anon);

	if (md->dirty)
		seq_printf(m, " dirty=%lu", md->dirty);

	if (md->pages != md->anon && md->pages != md->dirty)
		seq_printf(m, " mapped=%lu", md->pages);

	if (md->mapcount_max > 1)
		seq_printf(m, " mapmax=%lu", md->mapcount_max);

	if (md->swapcache)
		seq_printf(m, " swapcache=%lu", md->swapcache);

	if (md->active < md->pages && !is_vm_hugetlb_page(vma))
		seq_printf(m, " active=%lu", md->active);

	if (md->writeback)
		seq_printf(m, " writeback=%lu", md->writeback);

1499 1500 1501
	for_each_node_state(nid, N_MEMORY)
		if (md->node[nid])
			seq_printf(m, " N%d=%lu", nid, md->node[nid]);
1502 1503
out:
	seq_putc(m, '\n');
1504
	m_cache_vma(m, vma);
1505 1506
	return 0;
}
1507

1508 1509 1510 1511 1512 1513 1514 1515 1516 1517
static int show_pid_numa_map(struct seq_file *m, void *v)
{
	return show_numa_map(m, v, 1);
}

static int show_tid_numa_map(struct seq_file *m, void *v)
{
	return show_numa_map(m, v, 0);
}

1518
static const struct seq_operations proc_pid_numa_maps_op = {
1519 1520 1521 1522
	.start  = m_start,
	.next   = m_next,
	.stop   = m_stop,
	.show   = show_pid_numa_map,
1523
};
1524

1525 1526 1527 1528 1529 1530 1531 1532 1533
static const struct seq_operations proc_tid_numa_maps_op = {
	.start  = m_start,
	.next   = m_next,
	.stop   = m_stop,
	.show   = show_tid_numa_map,
};

static int numa_maps_open(struct inode *inode, struct file *file,
			  const struct seq_operations *ops)
1534
{
1535 1536
	return proc_maps_open(inode, file, ops,
				sizeof(struct numa_maps_private));
1537 1538
}

1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552
static int pid_numa_maps_open(struct inode *inode, struct file *file)
{
	return numa_maps_open(inode, file, &proc_pid_numa_maps_op);
}

static int tid_numa_maps_open(struct inode *inode, struct file *file)
{
	return numa_maps_open(inode, file, &proc_tid_numa_maps_op);
}

const struct file_operations proc_pid_numa_maps_operations = {
	.open		= pid_numa_maps_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
1553
	.release	= proc_map_release,
1554 1555 1556 1557
};

const struct file_operations proc_tid_numa_maps_operations = {
	.open		= tid_numa_maps_open,
1558 1559
	.read		= seq_read,
	.llseek		= seq_lseek,
1560
	.release	= proc_map_release,
1561
};
1562
#endif /* CONFIG_NUMA */