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

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

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

88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131
#ifdef CONFIG_NUMA
/*
 * These functions are for numa_maps but called in generic **maps seq_file
 * ->start(), ->stop() ops.
 *
 * numa_maps scans all vmas under mmap_sem and checks their mempolicy.
 * Each mempolicy object is controlled by reference counting. The problem here
 * is how to avoid accessing dead mempolicy object.
 *
 * Because we're holding mmap_sem while reading seq_file, it's safe to access
 * each vma's mempolicy, no vma objects will never drop refs to mempolicy.
 *
 * A task's mempolicy (task->mempolicy) has different behavior. task->mempolicy
 * is set and replaced under mmap_sem but unrefed and cleared under task_lock().
 * So, without task_lock(), we cannot trust get_vma_policy() because we cannot
 * gurantee the task never exits under us. But taking task_lock() around
 * get_vma_plicy() causes lock order problem.
 *
 * To access task->mempolicy without lock, we hold a reference count of an
 * object pointed by task->mempolicy and remember it. This will guarantee
 * that task->mempolicy points to an alive object or NULL in numa_maps accesses.
 */
static void hold_task_mempolicy(struct proc_maps_private *priv)
{
	struct task_struct *task = priv->task;

	task_lock(task);
	priv->task_mempolicy = task->mempolicy;
	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

132
static void vma_stop(struct proc_maps_private *priv)
133
{
134 135 136 137 138
	struct mm_struct *mm = priv->mm;

	release_task_mempolicy(priv);
	up_read(&mm->mmap_sem);
	mmput(mm);
139
}
140

141 142 143 144 145 146 147 148
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;
}

149
static void *m_start(struct seq_file *m, loff_t *ppos)
M
Mauricio Lin 已提交
150
{
151 152
	struct proc_maps_private *priv = m->private;
	struct mm_struct *mm;
153 154
	struct vm_area_struct *vma;
	unsigned int pos = *ppos;
155 156 157

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

160 161 162
	mm = priv->mm;
	if (!mm || !atomic_inc_not_zero(&mm->mm_users))
		return NULL;
163

164
	down_read(&mm->mmap_sem);
165
	hold_task_mempolicy(priv);
166
	priv->tail_vma = get_gate_vma(mm);
167

168 169
	if (pos < mm->map_count) {
		for (vma = mm->mmap; pos; pos--)
170 171
			vma = vma->vm_next;
		return vma;
172
	}
173

174 175
	if (pos == mm->map_count && priv->tail_vma)
		return priv->tail_vma;
176 177 178

	vma_stop(priv);
	return NULL;
179 180 181 182 183
}

static void *m_next(struct seq_file *m, void *v, loff_t *pos)
{
	struct proc_maps_private *priv = m->private;
184
	struct vm_area_struct *next;
185 186

	(*pos)++;
187
	next = m_next_vma(priv, v);
188 189 190
	if (!next)
		vma_stop(priv);
	return next;
191 192 193 194 195 196
}

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

197 198
	if (!IS_ERR_OR_NULL(v))
		vma_stop(priv);
199
	if (priv->task) {
200
		put_task_struct(priv->task);
201 202
		priv->task = NULL;
	}
203 204
}

205 206 207 208 209 210 211 212 213
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;

	priv->pid = proc_pid(inode);
214 215 216 217 218 219 220 221
	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;
	}

222 223 224
	return 0;
}

225 226 227 228 229 230 231 232 233 234 235
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);
}

236
static int do_maps_open(struct inode *inode, struct file *file,
237
			const struct seq_operations *ops)
238
{
239 240
	return proc_maps_open(inode, file, ops,
				sizeof(struct proc_maps_private));
241
}
M
Mauricio Lin 已提交
242

243 244
static void
show_map_vma(struct seq_file *m, struct vm_area_struct *vma, int is_pid)
L
Linus Torvalds 已提交
245
{
M
Mauricio Lin 已提交
246 247
	struct mm_struct *mm = vma->vm_mm;
	struct file *file = vma->vm_file;
248 249
	struct proc_maps_private *priv = m->private;
	struct task_struct *task = priv->task;
250
	vm_flags_t flags = vma->vm_flags;
L
Linus Torvalds 已提交
251
	unsigned long ino = 0;
252
	unsigned long long pgoff = 0;
253
	unsigned long start, end;
L
Linus Torvalds 已提交
254
	dev_t dev = 0;
255
	const char *name = NULL;
L
Linus Torvalds 已提交
256 257

	if (file) {
A
Al Viro 已提交
258
		struct inode *inode = file_inode(vma->vm_file);
L
Linus Torvalds 已提交
259 260
		dev = inode->i_sb->s_dev;
		ino = inode->i_ino;
261
		pgoff = ((loff_t)vma->vm_pgoff) << PAGE_SHIFT;
L
Linus Torvalds 已提交
262 263
	}

264 265
	/* We don't show the stack guard page in /proc/maps */
	start = vma->vm_start;
266 267 268 269 270
	if (stack_guard_page_start(vma, start))
		start += PAGE_SIZE;
	end = vma->vm_end;
	if (stack_guard_page_end(vma, end))
		end -= PAGE_SIZE;
271

272 273
	seq_setwidth(m, 25 + sizeof(void *) * 6 - 1);
	seq_printf(m, "%08lx-%08lx %c%c%c%c %08llx %02x:%02x %lu ",
274
			start,
275
			end,
L
Linus Torvalds 已提交
276 277 278 279
			flags & VM_READ ? 'r' : '-',
			flags & VM_WRITE ? 'w' : '-',
			flags & VM_EXEC ? 'x' : '-',
			flags & VM_MAYSHARE ? 's' : 'p',
280
			pgoff,
281
			MAJOR(dev), MINOR(dev), ino);
L
Linus Torvalds 已提交
282 283 284 285 286

	/*
	 * Print the dentry name for named mappings, and a
	 * special [heap] marker for the heap:
	 */
M
Mauricio Lin 已提交
287
	if (file) {
288
		seq_pad(m, ' ');
289
		seq_path(m, &file->f_path, "\n");
290 291 292
		goto done;
	}

293 294 295 296 297 298
	if (vma->vm_ops && vma->vm_ops->name) {
		name = vma->vm_ops->name(vma);
		if (name)
			goto done;
	}

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
	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;
		}

		tid = vm_is_stack(task, vma, is_pid);

		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]";
324
			} else {
325
				/* Thread stack in /proc/PID/maps */
326
				seq_pad(m, ' ');
327
				seq_printf(m, "[stack:%d]", tid);
L
Linus Torvalds 已提交
328
			}
329
		}
330 331 332 333
	}

done:
	if (name) {
334
		seq_pad(m, ' ');
335
		seq_puts(m, name);
L
Linus Torvalds 已提交
336 337
	}
	seq_putc(m, '\n');
338 339
}

340
static int show_map(struct seq_file *m, void *v, int is_pid)
341
{
342
	show_map_vma(m, v, is_pid);
L
Linus Torvalds 已提交
343 344 345
	return 0;
}

346 347 348 349 350 351 352 353 354 355
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);
}

356
static const struct seq_operations proc_pid_maps_op = {
357 358 359
	.start	= m_start,
	.next	= m_next,
	.stop	= m_stop,
360 361 362 363 364 365 366 367
	.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
368 369
};

370
static int pid_maps_open(struct inode *inode, struct file *file)
371 372 373 374
{
	return do_maps_open(inode, file, &proc_pid_maps_op);
}

375 376 377 378 379 380 381 382 383
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,
384
	.release	= proc_map_release,
385 386 387 388
};

const struct file_operations proc_tid_maps_operations = {
	.open		= tid_maps_open,
389 390
	.read		= seq_read,
	.llseek		= seq_lseek,
391
	.release	= proc_map_release,
392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412
};

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

413
#ifdef CONFIG_PROC_PAGE_MONITOR
P
Peter Zijlstra 已提交
414
struct mem_size_stats {
415 416 417 418 419 420 421
	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;
422
	unsigned long anonymous;
423
	unsigned long anonymous_thp;
P
Peter Zijlstra 已提交
424
	unsigned long swap;
425
	unsigned long nonlinear;
426 427 428
	u64 pss;
};

429 430

static void smaps_pte_entry(pte_t ptent, unsigned long addr,
431
		unsigned long ptent_size, struct mm_walk *walk)
432 433 434
{
	struct mem_size_stats *mss = walk->private;
	struct vm_area_struct *vma = mss->vma;
435
	pgoff_t pgoff = linear_page_index(vma, addr);
436
	struct page *page = NULL;
437 438
	int mapcount;

439 440 441 442
	if (pte_present(ptent)) {
		page = vm_normal_page(vma, addr, ptent);
	} else if (is_swap_pte(ptent)) {
		swp_entry_t swpent = pte_to_swp_entry(ptent);
443

444 445 446 447
		if (!non_swap_entry(swpent))
			mss->swap += ptent_size;
		else if (is_migration_entry(swpent))
			page = migration_entry_to_page(swpent);
448 449 450
	} else if (pte_file(ptent)) {
		if (pte_to_pgoff(ptent) != pgoff)
			mss->nonlinear += ptent_size;
451
	}
452 453 454 455 456

	if (!page)
		return;

	if (PageAnon(page))
457
		mss->anonymous += ptent_size;
458

459 460 461
	if (page->index != pgoff)
		mss->nonlinear += ptent_size;

462
	mss->resident += ptent_size;
463 464
	/* Accumulate the size in pages that have been accessed. */
	if (pte_young(ptent) || PageReferenced(page))
465
		mss->referenced += ptent_size;
466 467 468
	mapcount = page_mapcount(page);
	if (mapcount >= 2) {
		if (pte_dirty(ptent) || PageDirty(page))
469
			mss->shared_dirty += ptent_size;
470
		else
471 472
			mss->shared_clean += ptent_size;
		mss->pss += (ptent_size << PSS_SHIFT) / mapcount;
473 474
	} else {
		if (pte_dirty(ptent) || PageDirty(page))
475
			mss->private_dirty += ptent_size;
476
		else
477 478
			mss->private_clean += ptent_size;
		mss->pss += (ptent_size << PSS_SHIFT);
479 480 481
	}
}

482
static int smaps_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end,
D
Dave Hansen 已提交
483
			   struct mm_walk *walk)
M
Mauricio Lin 已提交
484
{
D
Dave Hansen 已提交
485
	struct mem_size_stats *mss = walk->private;
486
	struct vm_area_struct *vma = mss->vma;
487
	pte_t *pte;
488
	spinlock_t *ptl;
M
Mauricio Lin 已提交
489

490
	if (pmd_trans_huge_lock(pmd, vma, &ptl) == 1) {
491
		smaps_pte_entry(*(pte_t *)pmd, addr, HPAGE_PMD_SIZE, walk);
492
		spin_unlock(ptl);
493 494
		mss->anonymous_thp += HPAGE_PMD_SIZE;
		return 0;
495
	}
496 497 498

	if (pmd_trans_unstable(pmd))
		return 0;
499 500 501 502 503
	/*
	 * The mmap_sem held all the way back in m_start() is what
	 * keeps khugepaged out of here and from collapsing things
	 * in here.
	 */
504
	pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
505
	for (; addr != end; pte++, addr += PAGE_SIZE)
506
		smaps_pte_entry(*pte, addr, PAGE_SIZE, walk);
507 508
	pte_unmap_unlock(pte - 1, ptl);
	cond_resched();
509
	return 0;
M
Mauricio Lin 已提交
510 511
}

512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545
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",
		[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_NONLINEAR)]	= "nl",
		[ilog2(VM_ARCH_1)]	= "ar",
		[ilog2(VM_DONTDUMP)]	= "dd",
546 547 548
#ifdef CONFIG_MEM_SOFT_DIRTY
		[ilog2(VM_SOFTDIRTY)]	= "sd",
#endif
549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565
		[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');
}

566
static int show_smap(struct seq_file *m, void *v, int is_pid)
M
Mauricio Lin 已提交
567 568 569
{
	struct vm_area_struct *vma = v;
	struct mem_size_stats mss;
D
Dave Hansen 已提交
570 571 572 573 574
	struct mm_walk smaps_walk = {
		.pmd_entry = smaps_pte_range,
		.mm = vma->vm_mm,
		.private = &mss,
	};
M
Mauricio Lin 已提交
575 576

	memset(&mss, 0, sizeof mss);
577
	mss.vma = vma;
578
	/* mmap_sem is held in m_start */
N
Nick Piggin 已提交
579
	if (vma->vm_mm && !is_vm_hugetlb_page(vma))
D
Dave Hansen 已提交
580
		walk_page_range(vma->vm_start, vma->vm_end, &smaps_walk);
581

582
	show_map_vma(m, vma, is_pid);
583 584 585 586 587 588 589 590 591

	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 已提交
592
		   "Referenced:     %8lu kB\n"
593
		   "Anonymous:      %8lu kB\n"
594
		   "AnonHugePages:  %8lu kB\n"
595
		   "Swap:           %8lu kB\n"
596
		   "KernelPageSize: %8lu kB\n"
597 598
		   "MMUPageSize:    %8lu kB\n"
		   "Locked:         %8lu kB\n",
599 600 601 602 603 604 605
		   (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 已提交
606
		   mss.referenced >> 10,
607
		   mss.anonymous >> 10,
608
		   mss.anonymous_thp >> 10,
609
		   mss.swap >> 10,
610
		   vma_kernel_pagesize(vma) >> 10,
611 612 613
		   vma_mmu_pagesize(vma) >> 10,
		   (vma->vm_flags & VM_LOCKED) ?
			(unsigned long)(mss.pss >> (10 + PSS_SHIFT)) : 0);
614

615 616 617 618
	if (vma->vm_flags & VM_NONLINEAR)
		seq_printf(m, "Nonlinear:      %8lu kB\n",
				mss.nonlinear >> 10);

619
	show_smap_vma_flags(m, vma);
620
	return 0;
M
Mauricio Lin 已提交
621 622
}

623 624 625 626 627 628 629 630 631 632
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);
}

633
static const struct seq_operations proc_pid_smaps_op = {
634 635 636
	.start	= m_start,
	.next	= m_next,
	.stop	= m_stop,
637 638 639 640 641 642 643 644
	.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
645 646
};

647
static int pid_smaps_open(struct inode *inode, struct file *file)
648 649 650 651
{
	return do_maps_open(inode, file, &proc_pid_smaps_op);
}

652 653 654 655 656 657 658 659 660
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,
661
	.release	= proc_map_release,
662 663 664 665
};

const struct file_operations proc_tid_smaps_operations = {
	.open		= tid_smaps_open,
666 667
	.read		= seq_read,
	.llseek		= seq_lseek,
668
	.release	= proc_map_release,
669 670
};

671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687
/*
 * 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;

688 689 690 691
enum clear_refs_types {
	CLEAR_REFS_ALL = 1,
	CLEAR_REFS_ANON,
	CLEAR_REFS_MAPPED,
692
	CLEAR_REFS_SOFT_DIRTY,
693 694 695
	CLEAR_REFS_LAST,
};

696 697
struct clear_refs_private {
	struct vm_area_struct *vma;
698
	enum clear_refs_types type;
699 700
};

701 702 703 704 705 706 707 708 709 710 711
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;
712 713 714 715 716 717

	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);
718 719
	} else if (pte_file(ptent)) {
		ptent = pte_file_clear_soft_dirty(ptent);
720 721
	}

722 723 724 725
	set_pte_at(vma->vm_mm, addr, pte, ptent);
#endif
}

726
static int clear_refs_pte_range(pmd_t *pmd, unsigned long addr,
D
Dave Hansen 已提交
727
				unsigned long end, struct mm_walk *walk)
728
{
729 730
	struct clear_refs_private *cp = walk->private;
	struct vm_area_struct *vma = cp->vma;
731 732 733 734
	pte_t *pte, ptent;
	spinlock_t *ptl;
	struct page *page;

735
	split_huge_page_pmd(vma, addr, pmd);
736 737
	if (pmd_trans_unstable(pmd))
		return 0;
738

739 740 741 742
	pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
	for (; addr != end; pte++, addr += PAGE_SIZE) {
		ptent = *pte;

743 744 745 746 747
		if (cp->type == CLEAR_REFS_SOFT_DIRTY) {
			clear_soft_dirty(vma, addr, pte);
			continue;
		}

748 749 750
		if (!pte_present(ptent))
			continue;

751 752 753 754 755 756 757 758 759 760 761 762 763
		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;
}

764 765
static ssize_t clear_refs_write(struct file *file, const char __user *buf,
				size_t count, loff_t *ppos)
766
{
767
	struct task_struct *task;
768
	char buffer[PROC_NUMBUF];
769
	struct mm_struct *mm;
770
	struct vm_area_struct *vma;
771 772
	enum clear_refs_types type;
	int itype;
A
Alexey Dobriyan 已提交
773
	int rv;
774

775 776 777 778 779
	memset(buffer, 0, sizeof(buffer));
	if (count > sizeof(buffer) - 1)
		count = sizeof(buffer) - 1;
	if (copy_from_user(buffer, buf, count))
		return -EFAULT;
780
	rv = kstrtoint(strstrip(buffer), 10, &itype);
A
Alexey Dobriyan 已提交
781 782
	if (rv < 0)
		return rv;
783 784
	type = (enum clear_refs_types)itype;
	if (type < CLEAR_REFS_ALL || type >= CLEAR_REFS_LAST)
785
		return -EINVAL;
786 787 788

	if (type == CLEAR_REFS_SOFT_DIRTY) {
		soft_dirty_cleared = true;
789 790 791
		pr_warn_once("The pagemap bits 55-60 has changed their meaning!"
			     " See the linux/Documentation/vm/pagemap.txt for "
			     "details.\n");
792 793
	}

A
Al Viro 已提交
794
	task = get_proc_task(file_inode(file));
795 796 797 798
	if (!task)
		return -ESRCH;
	mm = get_task_mm(task);
	if (mm) {
799
		struct clear_refs_private cp = {
800
			.type = type,
801
		};
802 803 804
		struct mm_walk clear_refs_walk = {
			.pmd_entry = clear_refs_pte_range,
			.mm = mm,
805
			.private = &cp,
806
		};
807
		down_read(&mm->mmap_sem);
808 809
		if (type == CLEAR_REFS_SOFT_DIRTY)
			mmu_notifier_invalidate_range_start(mm, 0, -1);
D
Dave Hansen 已提交
810
		for (vma = mm->mmap; vma; vma = vma->vm_next) {
811
			cp.vma = vma;
812 813 814 815 816 817 818 819 820 821
			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.
822 823
			 *
			 * Writing 4 to /proc/pid/clear_refs affects all pages.
824 825 826 827 828
			 */
			if (type == CLEAR_REFS_ANON && vma->vm_file)
				continue;
			if (type == CLEAR_REFS_MAPPED && !vma->vm_file)
				continue;
829 830 831 832
			if (type == CLEAR_REFS_SOFT_DIRTY) {
				if (vma->vm_flags & VM_SOFTDIRTY)
					vma->vm_flags &= ~VM_SOFTDIRTY;
			}
833 834
			walk_page_range(vma->vm_start, vma->vm_end,
					&clear_refs_walk);
D
Dave Hansen 已提交
835
		}
836 837
		if (type == CLEAR_REFS_SOFT_DIRTY)
			mmu_notifier_invalidate_range_end(mm, 0, -1);
838 839 840 841 842
		flush_tlb_mm(mm);
		up_read(&mm->mmap_sem);
		mmput(mm);
	}
	put_task_struct(task);
843 844

	return count;
845 846
}

847 848
const struct file_operations proc_clear_refs_operations = {
	.write		= clear_refs_write,
849
	.llseek		= noop_llseek,
850 851
};

852 853 854 855
typedef struct {
	u64 pme;
} pagemap_entry_t;

856
struct pagemapread {
857
	int pos, len;		/* units: PM_ENTRY_BYTES, not bytes */
858
	pagemap_entry_t *buffer;
859
	bool v2;
860 861
};

862 863 864
#define PAGEMAP_WALK_SIZE	(PMD_SIZE)
#define PAGEMAP_WALK_MASK	(PMD_MASK)

865
#define PM_ENTRY_BYTES      sizeof(pagemap_entry_t)
866 867 868 869 870 871 872
#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)
873
#define __PM_PSHIFT(x)      (((u64) (x) << PM_PSHIFT_OFFSET) & PM_PSHIFT_MASK)
874 875
#define PM_PFRAME_MASK      ((1LL << PM_PSHIFT_OFFSET) - 1)
#define PM_PFRAME(x)        ((x) & PM_PFRAME_MASK)
876 877
/* in "new" pagemap pshift bits are occupied with more status bits */
#define PM_STATUS2(v2, x)   (__PM_PSHIFT(v2 ? x : PAGE_SHIFT))
878

879
#define __PM_SOFT_DIRTY      (1LL)
880 881
#define PM_PRESENT          PM_STATUS(4LL)
#define PM_SWAP             PM_STATUS(2LL)
882
#define PM_FILE             PM_STATUS(1LL)
883
#define PM_NOT_PRESENT(v2)  PM_STATUS2(v2, 0)
884 885
#define PM_END_OF_BUFFER    1

886 887 888 889 890 891
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,
892 893
			  struct pagemapread *pm)
{
894
	pm->buffer[pm->pos++] = *pme;
895
	if (pm->pos >= pm->len)
896
		return PM_END_OF_BUFFER;
897 898 899 900
	return 0;
}

static int pagemap_pte_hole(unsigned long start, unsigned long end,
D
Dave Hansen 已提交
901
				struct mm_walk *walk)
902
{
D
Dave Hansen 已提交
903
	struct pagemapread *pm = walk->private;
904
	unsigned long addr = start;
905
	int err = 0;
906

907 908 909
	while (addr < end) {
		struct vm_area_struct *vma = find_vma(walk->mm, addr);
		pagemap_entry_t pme = make_pme(PM_NOT_PRESENT(pm->v2));
910 911
		/* End of address space hole, which we mark as non-present. */
		unsigned long hole_end;
912

913 914 915 916 917 918 919 920 921
		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;
922 923
		}

924 925 926 927 928 929 930
		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) {
931 932 933 934
			err = add_to_pagemap(addr, &pme, pm);
			if (err)
				goto out;
		}
935
	}
936
out:
937 938 939
	return err;
}

940
static void pte_to_pagemap_entry(pagemap_entry_t *pme, struct pagemapread *pm,
941
		struct vm_area_struct *vma, unsigned long addr, pte_t pte)
942
{
943 944
	u64 frame, flags;
	struct page *page = NULL;
945
	int flags2 = 0;
946

947 948 949 950
	if (pte_present(pte)) {
		frame = pte_pfn(pte);
		flags = PM_PRESENT;
		page = vm_normal_page(vma, addr, pte);
951 952
		if (pte_soft_dirty(pte))
			flags2 |= __PM_SOFT_DIRTY;
953
	} else if (is_swap_pte(pte)) {
954 955 956 957
		swp_entry_t entry;
		if (pte_swp_soft_dirty(pte))
			flags2 |= __PM_SOFT_DIRTY;
		entry = pte_to_swp_entry(pte);
958 959 960 961 962 963
		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 {
964 965 966
		if (vma->vm_flags & VM_SOFTDIRTY)
			flags2 |= __PM_SOFT_DIRTY;
		*pme = make_pme(PM_NOT_PRESENT(pm->v2) | PM_STATUS2(pm->v2, flags2));
967 968 969 970 971
		return;
	}

	if (page && !PageAnon(page))
		flags |= PM_FILE;
972
	if ((vma->vm_flags & VM_SOFTDIRTY))
973
		flags2 |= __PM_SOFT_DIRTY;
974

975
	*pme = make_pme(PM_PFRAME(frame) | PM_STATUS2(pm->v2, flags2) | flags);
976 977
}

978
#ifdef CONFIG_TRANSPARENT_HUGEPAGE
979
static void thp_pmd_to_pagemap_entry(pagemap_entry_t *pme, struct pagemapread *pm,
980
		pmd_t pmd, int offset, int pmd_flags2)
981 982 983 984 985 986 987
{
	/*
	 * 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))
988
		*pme = make_pme(PM_PFRAME(pmd_pfn(pmd) + offset)
989
				| PM_STATUS2(pm->v2, pmd_flags2) | PM_PRESENT);
990
	else
991
		*pme = make_pme(PM_NOT_PRESENT(pm->v2) | PM_STATUS2(pm->v2, pmd_flags2));
992 993
}
#else
994
static inline void thp_pmd_to_pagemap_entry(pagemap_entry_t *pme, struct pagemapread *pm,
995
		pmd_t pmd, int offset, int pmd_flags2)
996 997 998 999
{
}
#endif

1000
static int pagemap_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end,
D
Dave Hansen 已提交
1001
			     struct mm_walk *walk)
1002
{
1003
	struct vm_area_struct *vma;
D
Dave Hansen 已提交
1004
	struct pagemapread *pm = walk->private;
1005
	spinlock_t *ptl;
1006 1007
	pte_t *pte;
	int err = 0;
1008
	pagemap_entry_t pme = make_pme(PM_NOT_PRESENT(pm->v2));
1009

1010 1011
	/* find the first VMA at or above 'addr' */
	vma = find_vma(walk->mm, addr);
1012
	if (vma && pmd_trans_huge_lock(pmd, vma, &ptl) == 1) {
1013 1014
		int pmd_flags2;

1015 1016 1017 1018 1019
		if ((vma->vm_flags & VM_SOFTDIRTY) || pmd_soft_dirty(*pmd))
			pmd_flags2 = __PM_SOFT_DIRTY;
		else
			pmd_flags2 = 0;

1020 1021 1022 1023 1024
		for (; addr != end; addr += PAGE_SIZE) {
			unsigned long offset;

			offset = (addr & ~PAGEMAP_WALK_MASK) >>
					PAGE_SHIFT;
1025
			thp_pmd_to_pagemap_entry(&pme, pm, *pmd, offset, pmd_flags2);
1026
			err = add_to_pagemap(addr, &pme, pm);
1027 1028
			if (err)
				break;
1029
		}
1030
		spin_unlock(ptl);
1031
		return err;
1032 1033
	}

1034 1035
	if (pmd_trans_unstable(pmd))
		return 0;
1036
	for (; addr != end; addr += PAGE_SIZE) {
1037
		int flags2;
1038 1039 1040

		/* check to see if we've left 'vma' behind
		 * and need a new, higher one */
1041
		if (vma && (addr >= vma->vm_end)) {
1042
			vma = find_vma(walk->mm, addr);
1043 1044 1045 1046 1047
			if (vma && (vma->vm_flags & VM_SOFTDIRTY))
				flags2 = __PM_SOFT_DIRTY;
			else
				flags2 = 0;
			pme = make_pme(PM_NOT_PRESENT(pm->v2) | PM_STATUS2(pm->v2, flags2));
1048
		}
1049 1050 1051 1052 1053 1054

		/* 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);
1055
			pte_to_pagemap_entry(&pme, pm, vma, addr, *pte);
1056 1057 1058
			/* unmap before userspace copy */
			pte_unmap(pte);
		}
1059
		err = add_to_pagemap(addr, &pme, pm);
1060 1061 1062 1063 1064 1065 1066 1067 1068
		if (err)
			return err;
	}

	cond_resched();

	return err;
}

1069
#ifdef CONFIG_HUGETLB_PAGE
1070
static void huge_pte_to_pagemap_entry(pagemap_entry_t *pme, struct pagemapread *pm,
1071
					pte_t pte, int offset, int flags2)
1072 1073
{
	if (pte_present(pte))
1074 1075 1076
		*pme = make_pme(PM_PFRAME(pte_pfn(pte) + offset)	|
				PM_STATUS2(pm->v2, flags2)		|
				PM_PRESENT);
1077
	else
1078 1079
		*pme = make_pme(PM_NOT_PRESENT(pm->v2)			|
				PM_STATUS2(pm->v2, flags2));
1080 1081
}

1082 1083 1084 1085
/* 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)
1086 1087
{
	struct pagemapread *pm = walk->private;
1088
	struct vm_area_struct *vma;
1089
	int err = 0;
1090
	int flags2;
1091
	pagemap_entry_t pme;
1092

1093 1094 1095 1096 1097 1098 1099 1100
	vma = find_vma(walk->mm, addr);
	WARN_ON_ONCE(!vma);

	if (vma && (vma->vm_flags & VM_SOFTDIRTY))
		flags2 = __PM_SOFT_DIRTY;
	else
		flags2 = 0;

1101
	for (; addr != end; addr += PAGE_SIZE) {
1102
		int offset = (addr & ~hmask) >> PAGE_SHIFT;
1103
		huge_pte_to_pagemap_entry(&pme, pm, *pte, offset, flags2);
1104
		err = add_to_pagemap(addr, &pme, pm);
1105 1106 1107 1108 1109 1110 1111 1112
		if (err)
			return err;
	}

	cond_resched();

	return err;
}
1113
#endif /* HUGETLB_PAGE */
1114

1115 1116 1117
/*
 * /proc/pid/pagemap - an array mapping virtual pages to pfns
 *
1118 1119 1120
 * For each page in the address space, this file contains one 64-bit entry
 * consisting of the following:
 *
1121
 * Bits 0-54  page frame number (PFN) if present
1122
 * Bits 0-4   swap type if swapped
1123
 * Bits 5-54  swap offset if swapped
1124
 * Bits 55-60 page shift (page size = 1<<page shift)
1125
 * Bit  61    page is file-page or shared-anon
1126 1127 1128 1129 1130 1131
 * 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
1132 1133 1134 1135 1136 1137 1138 1139 1140 1141
 * 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 已提交
1142
	struct task_struct *task = get_proc_task(file_inode(file));
1143 1144 1145
	struct mm_struct *mm;
	struct pagemapread pm;
	int ret = -ESRCH;
1146
	struct mm_walk pagemap_walk = {};
1147 1148 1149 1150
	unsigned long src;
	unsigned long svpfn;
	unsigned long start_vaddr;
	unsigned long end_vaddr;
1151
	int copied = 0;
1152 1153 1154 1155 1156 1157

	if (!task)
		goto out;

	ret = -EINVAL;
	/* file position must be aligned */
1158
	if ((*ppos % PM_ENTRY_BYTES) || (count % PM_ENTRY_BYTES))
1159
		goto out_task;
1160 1161

	ret = 0;
1162 1163 1164
	if (!count)
		goto out_task;

1165
	pm.v2 = soft_dirty_cleared;
1166 1167
	pm.len = (PAGEMAP_WALK_SIZE >> PAGE_SHIFT);
	pm.buffer = kmalloc(pm.len * PM_ENTRY_BYTES, GFP_TEMPORARY);
1168
	ret = -ENOMEM;
1169
	if (!pm.buffer)
1170 1171
		goto out_task;

C
Cong Wang 已提交
1172
	mm = mm_access(task, PTRACE_MODE_READ);
1173 1174 1175
	ret = PTR_ERR(mm);
	if (!mm || IS_ERR(mm))
		goto out_free;
1176

1177 1178
	pagemap_walk.pmd_entry = pagemap_pte_range;
	pagemap_walk.pte_hole = pagemap_pte_hole;
1179
#ifdef CONFIG_HUGETLB_PAGE
1180
	pagemap_walk.hugetlb_entry = pagemap_hugetlb_range;
1181
#endif
1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199
	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.
	 */
1200 1201 1202 1203 1204 1205
	ret = 0;
	while (count && (start_vaddr < end_vaddr)) {
		int len;
		unsigned long end;

		pm.pos = 0;
1206
		end = (start_vaddr + PAGEMAP_WALK_SIZE) & PAGEMAP_WALK_MASK;
1207 1208 1209 1210 1211 1212 1213 1214 1215
		/* 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);
1216
		if (copy_to_user(buf, pm.buffer, len)) {
1217
			ret = -EFAULT;
1218
			goto out_mm;
1219 1220 1221 1222
		}
		copied += len;
		buf += len;
		count -= len;
1223
	}
1224 1225 1226 1227
	*ppos += copied;
	if (!ret || ret == PM_END_OF_BUFFER)
		ret = copied;

1228 1229
out_mm:
	mmput(mm);
1230 1231
out_free:
	kfree(pm.buffer);
1232 1233 1234 1235 1236 1237
out_task:
	put_task_struct(task);
out:
	return ret;
}

1238 1239 1240 1241 1242 1243 1244 1245
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;
}

1246 1247 1248
const struct file_operations proc_pagemap_operations = {
	.llseek		= mem_lseek, /* borrow this */
	.read		= pagemap_read,
1249
	.open		= pagemap_open,
1250
};
1251
#endif /* CONFIG_PROC_PAGE_MONITOR */
1252

1253 1254
#ifdef CONFIG_NUMA

1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266
struct numa_maps {
	struct vm_area_struct *vma;
	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];
};

1267 1268 1269 1270 1271
struct numa_maps_private {
	struct proc_maps_private proc_maps;
	struct numa_maps md;
};

1272 1273
static void gather_stats(struct page *page, struct numa_maps *md, int pte_dirty,
			unsigned long nr_pages)
1274 1275 1276
{
	int count = page_mapcount(page);

1277
	md->pages += nr_pages;
1278
	if (pte_dirty || PageDirty(page))
1279
		md->dirty += nr_pages;
1280 1281

	if (PageSwapCache(page))
1282
		md->swapcache += nr_pages;
1283 1284

	if (PageActive(page) || PageUnevictable(page))
1285
		md->active += nr_pages;
1286 1287

	if (PageWriteback(page))
1288
		md->writeback += nr_pages;
1289 1290

	if (PageAnon(page))
1291
		md->anon += nr_pages;
1292 1293 1294 1295

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

1296
	md->node[page_to_nid(page)] += nr_pages;
1297 1298
}

1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315
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);
1316
	if (!node_isset(nid, node_states[N_MEMORY]))
1317 1318 1319 1320 1321
		return NULL;

	return page;
}

1322 1323 1324 1325 1326 1327 1328 1329 1330
static int gather_pte_stats(pmd_t *pmd, unsigned long addr,
		unsigned long end, struct mm_walk *walk)
{
	struct numa_maps *md;
	spinlock_t *ptl;
	pte_t *orig_pte;
	pte_t *pte;

	md = walk->private;
1331

1332
	if (pmd_trans_huge_lock(pmd, md->vma, &ptl) == 1) {
1333 1334 1335 1336 1337 1338 1339
		pte_t huge_pte = *(pte_t *)pmd;
		struct page *page;

		page = can_gather_numa_stats(huge_pte, md->vma, addr);
		if (page)
			gather_stats(page, md, pte_dirty(huge_pte),
				     HPAGE_PMD_SIZE/PAGE_SIZE);
1340
		spin_unlock(ptl);
1341
		return 0;
1342 1343
	}

1344 1345
	if (pmd_trans_unstable(pmd))
		return 0;
1346 1347
	orig_pte = pte = pte_offset_map_lock(walk->mm, pmd, addr, &ptl);
	do {
1348
		struct page *page = can_gather_numa_stats(*pte, md->vma, addr);
1349 1350
		if (!page)
			continue;
1351
		gather_stats(page, md, pte_dirty(*pte), 1);
1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363

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

1364
	if (!pte_present(*pte))
1365 1366 1367 1368 1369 1370 1371
		return 0;

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

	md = walk->private;
1372
	gather_stats(page, md, pte_dirty(*pte), 1);
1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386
	return 0;
}

#else
static int gather_hugetbl_stats(pte_t *pte, unsigned long hmask,
		unsigned long addr, unsigned long end, struct mm_walk *walk)
{
	return 0;
}
#endif

/*
 * Display pages allocated per node and memory policy via /proc.
 */
1387
static int show_numa_map(struct seq_file *m, void *v, int is_pid)
1388
{
1389 1390
	struct numa_maps_private *numa_priv = m->private;
	struct proc_maps_private *proc_priv = &numa_priv->proc_maps;
1391
	struct vm_area_struct *vma = v;
1392
	struct numa_maps *md = &numa_priv->md;
1393
	struct file *file = vma->vm_file;
1394
	struct task_struct *task = proc_priv->task;
1395 1396 1397
	struct mm_struct *mm = vma->vm_mm;
	struct mm_walk walk = {};
	struct mempolicy *pol;
1398 1399
	char buffer[64];
	int nid;
1400 1401 1402 1403

	if (!mm)
		return 0;

1404 1405
	/* Ensure we start with an empty set of numa_maps statistics. */
	memset(md, 0, sizeof(*md));
1406 1407 1408 1409 1410 1411 1412 1413

	md->vma = vma;

	walk.hugetlb_entry = gather_hugetbl_stats;
	walk.pmd_entry = gather_pte_stats;
	walk.private = md;
	walk.mm = mm;

1414
	pol = get_vma_policy(task, vma, vma->vm_start);
1415
	mpol_to_str(buffer, sizeof(buffer), pol);
1416 1417 1418 1419 1420
	mpol_cond_put(pol);

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

	if (file) {
1421
		seq_puts(m, " file=");
1422 1423
		seq_path(m, &file->f_path, "\n\t= ");
	} else if (vma->vm_start <= mm->brk && vma->vm_end >= mm->start_brk) {
1424
		seq_puts(m, " heap");
1425
	} else {
1426
		pid_t tid = vm_is_stack(task, vma, is_pid);
1427 1428 1429 1430 1431 1432 1433
		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))
1434
				seq_puts(m, " stack");
1435 1436 1437
			else
				seq_printf(m, " stack:%d", tid);
		}
1438 1439
	}

1440
	if (is_vm_hugetlb_page(vma))
1441
		seq_puts(m, " huge");
1442

1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468
	walk_page_range(vma->vm_start, vma->vm_end, &walk);

	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);

1469 1470 1471
	for_each_node_state(nid, N_MEMORY)
		if (md->node[nid])
			seq_printf(m, " N%d=%lu", nid, md->node[nid]);
1472 1473 1474 1475
out:
	seq_putc(m, '\n');
	return 0;
}
1476

1477 1478 1479 1480 1481 1482 1483 1484 1485 1486
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);
}

1487
static const struct seq_operations proc_pid_numa_maps_op = {
1488 1489 1490 1491
	.start  = m_start,
	.next   = m_next,
	.stop   = m_stop,
	.show   = show_pid_numa_map,
1492
};
1493

1494 1495 1496 1497 1498 1499 1500 1501 1502
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)
1503
{
1504 1505
	return proc_maps_open(inode, file, ops,
				sizeof(struct numa_maps_private));
1506 1507
}

1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521
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,
1522
	.release	= proc_map_release,
1523 1524 1525 1526
};

const struct file_operations proc_tid_numa_maps_operations = {
	.open		= tid_numa_maps_open,
1527 1528
	.read		= seq_read,
	.llseek		= seq_lseek,
1529
	.release	= proc_map_release,
1530
};
1531
#endif /* CONFIG_NUMA */