task_mmu.c 39.0 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
#ifdef CONFIG_NUMA
/*
90
 * Save get_task_policy() for show_numa_map().
91 92 93 94 95 96
 */
static void hold_task_mempolicy(struct proc_maps_private *priv)
{
	struct task_struct *task = priv->task;

	task_lock(task);
97
	priv->task_mempolicy = get_task_policy(task);
98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113
	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

114
static void vma_stop(struct proc_maps_private *priv)
115
{
116 117 118 119 120
	struct mm_struct *mm = priv->mm;

	release_task_mempolicy(priv);
	up_read(&mm->mmap_sem);
	mmput(mm);
121
}
122

123 124 125 126 127 128 129 130
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;
}

131 132 133 134 135 136
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;
}

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

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

149
	priv->task = get_proc_task(priv->inode);
150
	if (!priv->task)
A
Al Viro 已提交
151
		return ERR_PTR(-ESRCH);
152

153 154 155
	mm = priv->mm;
	if (!mm || !atomic_inc_not_zero(&mm->mm_users))
		return NULL;
156

157
	down_read(&mm->mmap_sem);
158
	hold_task_mempolicy(priv);
159
	priv->tail_vma = get_gate_vma(mm);
160

161 162 163 164 165 166 167
	if (last_addr) {
		vma = find_vma(mm, last_addr);
		if (vma && (vma = m_next_vma(priv, vma)))
			return vma;
	}

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

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

	vma_stop(priv);
	return NULL;
182 183 184 185 186
}

static void *m_next(struct seq_file *m, void *v, loff_t *pos)
{
	struct proc_maps_private *priv = m->private;
187
	struct vm_area_struct *next;
188 189

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

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

200 201
	if (!IS_ERR_OR_NULL(v))
		vma_stop(priv);
202
	if (priv->task) {
203
		put_task_struct(priv->task);
204 205
		priv->task = NULL;
	}
206 207
}

208 209 210 211 212 213 214 215
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;

216
	priv->inode = inode;
217 218 219 220 221 222 223 224
	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;
	}

225 226 227
	return 0;
}

228 229 230 231 232 233 234 235 236 237 238
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);
}

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

246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264
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;
}

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

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

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

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

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

314 315 316 317 318 319
	if (vma->vm_ops && vma->vm_ops->name) {
		name = vma->vm_ops->name(vma);
		if (name)
			goto done;
	}

320 321 322 323 324 325 326 327 328 329 330 331 332 333 334
	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;
		}

335
		tid = pid_of_stack(priv, vma, is_pid);
336 337 338 339 340 341 342 343
		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]";
344
			} else {
345
				/* Thread stack in /proc/PID/maps */
346
				seq_pad(m, ' ');
347
				seq_printf(m, "[stack:%d]", tid);
L
Linus Torvalds 已提交
348
			}
349
		}
350 351 352 353
	}

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

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

367 368 369 370 371 372 373 374 375 376
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);
}

377
static const struct seq_operations proc_pid_maps_op = {
378 379 380
	.start	= m_start,
	.next	= m_next,
	.stop	= m_stop,
381 382 383 384 385 386 387 388
	.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
389 390
};

391
static int pid_maps_open(struct inode *inode, struct file *file)
392 393 394 395
{
	return do_maps_open(inode, file, &proc_pid_maps_op);
}

396 397 398 399 400 401 402 403 404
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,
405
	.release	= proc_map_release,
406 407 408 409
};

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

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

434
#ifdef CONFIG_PROC_PAGE_MONITOR
P
Peter Zijlstra 已提交
435
struct mem_size_stats {
436 437 438 439 440 441 442
	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;
443
	unsigned long anonymous;
444
	unsigned long anonymous_thp;
P
Peter Zijlstra 已提交
445
	unsigned long swap;
446
	unsigned long nonlinear;
447 448 449
	u64 pss;
};

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

482 483
static void smaps_pte_entry(pte_t *pte, unsigned long addr,
		struct mm_walk *walk)
484 485 486
{
	struct mem_size_stats *mss = walk->private;
	struct vm_area_struct *vma = mss->vma;
487
	pgoff_t pgoff = linear_page_index(vma, addr);
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
		else if (is_migration_entry(swpent))
			page = migration_entry_to_page(swpent);
499 500 501
	} else if (pte_file(*pte)) {
		if (pte_to_pgoff(*pte) != pgoff)
			mss->nonlinear += PAGE_SIZE;
502
	}
503 504 505 506

	if (!page)
		return;

507
	if (page->index != pgoff)
508
		mss->nonlinear += PAGE_SIZE;
509

510
	smaps_account(mss, page, PAGE_SIZE, pte_young(*pte), pte_dirty(*pte));
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
#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;
	struct vm_area_struct *vma = mss->vma;
	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

536
static int smaps_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end,
D
Dave Hansen 已提交
537
			   struct mm_walk *walk)
M
Mauricio Lin 已提交
538
{
D
Dave Hansen 已提交
539
	struct mem_size_stats *mss = walk->private;
540
	struct vm_area_struct *vma = mss->vma;
541
	pte_t *pte;
542
	spinlock_t *ptl;
M
Mauricio Lin 已提交
543

544
	if (pmd_trans_huge_lock(pmd, vma, &ptl) == 1) {
545
		smaps_pmd_entry(pmd, addr, walk);
546
		spin_unlock(ptl);
547
		return 0;
548
	}
549 550 551

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

565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586
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",
587 588 589
#ifdef CONFIG_X86_INTEL_MPX
		[ilog2(VM_MPX)]		= "mp",
#endif
590 591 592 593 594 595 596 597 598 599 600 601
		[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",
602 603 604
#ifdef CONFIG_MEM_SOFT_DIRTY
		[ilog2(VM_SOFTDIRTY)]	= "sd",
#endif
605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621
		[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');
}

622
static int show_smap(struct seq_file *m, void *v, int is_pid)
M
Mauricio Lin 已提交
623 624 625
{
	struct vm_area_struct *vma = v;
	struct mem_size_stats mss;
D
Dave Hansen 已提交
626 627 628 629 630
	struct mm_walk smaps_walk = {
		.pmd_entry = smaps_pte_range,
		.mm = vma->vm_mm,
		.private = &mss,
	};
M
Mauricio Lin 已提交
631 632

	memset(&mss, 0, sizeof mss);
633
	mss.vma = vma;
634
	/* mmap_sem is held in m_start */
N
Nick Piggin 已提交
635
	if (vma->vm_mm && !is_vm_hugetlb_page(vma))
D
Dave Hansen 已提交
636
		walk_page_range(vma->vm_start, vma->vm_end, &smaps_walk);
637

638
	show_map_vma(m, vma, is_pid);
639 640 641 642 643 644 645 646 647

	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 已提交
648
		   "Referenced:     %8lu kB\n"
649
		   "Anonymous:      %8lu kB\n"
650
		   "AnonHugePages:  %8lu kB\n"
651
		   "Swap:           %8lu kB\n"
652
		   "KernelPageSize: %8lu kB\n"
653 654
		   "MMUPageSize:    %8lu kB\n"
		   "Locked:         %8lu kB\n",
655 656 657 658 659 660 661
		   (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 已提交
662
		   mss.referenced >> 10,
663
		   mss.anonymous >> 10,
664
		   mss.anonymous_thp >> 10,
665
		   mss.swap >> 10,
666
		   vma_kernel_pagesize(vma) >> 10,
667 668 669
		   vma_mmu_pagesize(vma) >> 10,
		   (vma->vm_flags & VM_LOCKED) ?
			(unsigned long)(mss.pss >> (10 + PSS_SHIFT)) : 0);
670

671 672 673 674
	if (vma->vm_flags & VM_NONLINEAR)
		seq_printf(m, "Nonlinear:      %8lu kB\n",
				mss.nonlinear >> 10);

675
	show_smap_vma_flags(m, vma);
676
	m_cache_vma(m, vma);
677
	return 0;
M
Mauricio Lin 已提交
678 679
}

680 681 682 683 684 685 686 687 688 689
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);
}

690
static const struct seq_operations proc_pid_smaps_op = {
691 692 693
	.start	= m_start,
	.next	= m_next,
	.stop	= m_stop,
694 695 696 697 698 699 700 701
	.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
702 703
};

704
static int pid_smaps_open(struct inode *inode, struct file *file)
705 706 707 708
{
	return do_maps_open(inode, file, &proc_pid_smaps_op);
}

709 710 711 712 713 714 715 716 717
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,
718
	.release	= proc_map_release,
719 720 721 722
};

const struct file_operations proc_tid_smaps_operations = {
	.open		= tid_smaps_open,
723 724
	.read		= seq_read,
	.llseek		= seq_lseek,
725
	.release	= proc_map_release,
726 727
};

728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744
/*
 * 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;

745 746 747 748
enum clear_refs_types {
	CLEAR_REFS_ALL = 1,
	CLEAR_REFS_ANON,
	CLEAR_REFS_MAPPED,
749
	CLEAR_REFS_SOFT_DIRTY,
750 751 752
	CLEAR_REFS_LAST,
};

753 754
struct clear_refs_private {
	struct vm_area_struct *vma;
755
	enum clear_refs_types type;
756 757
};

758 759 760 761 762 763 764 765 766 767 768
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;
769 770 771 772 773 774

	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);
775 776
	} else if (pte_file(ptent)) {
		ptent = pte_file_clear_soft_dirty(ptent);
777 778
	}

779 780 781 782
	set_pte_at(vma->vm_mm, addr, pte, ptent);
#endif
}

783
static int clear_refs_pte_range(pmd_t *pmd, unsigned long addr,
D
Dave Hansen 已提交
784
				unsigned long end, struct mm_walk *walk)
785
{
786 787
	struct clear_refs_private *cp = walk->private;
	struct vm_area_struct *vma = cp->vma;
788 789 790 791
	pte_t *pte, ptent;
	spinlock_t *ptl;
	struct page *page;

792
	split_huge_page_pmd(vma, addr, pmd);
793 794
	if (pmd_trans_unstable(pmd))
		return 0;
795

796 797 798 799
	pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
	for (; addr != end; pte++, addr += PAGE_SIZE) {
		ptent = *pte;

800 801 802 803 804
		if (cp->type == CLEAR_REFS_SOFT_DIRTY) {
			clear_soft_dirty(vma, addr, pte);
			continue;
		}

805 806 807
		if (!pte_present(ptent))
			continue;

808 809 810 811 812 813 814 815 816 817 818 819 820
		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;
}

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

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

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

A
Al Viro 已提交
851
	task = get_proc_task(file_inode(file));
852 853 854 855
	if (!task)
		return -ESRCH;
	mm = get_task_mm(task);
	if (mm) {
856
		struct clear_refs_private cp = {
857
			.type = type,
858
		};
859 860 861
		struct mm_walk clear_refs_walk = {
			.pmd_entry = clear_refs_pte_range,
			.mm = mm,
862
			.private = &cp,
863
		};
864
		down_read(&mm->mmap_sem);
865 866 867 868 869 870 871 872 873 874 875 876 877
		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;
			}
878
			mmu_notifier_invalidate_range_start(mm, 0, -1);
879
		}
D
Dave Hansen 已提交
880
		for (vma = mm->mmap; vma; vma = vma->vm_next) {
881
			cp.vma = vma;
882 883 884 885 886 887 888 889 890 891
			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.
892 893
			 *
			 * Writing 4 to /proc/pid/clear_refs affects all pages.
894 895 896 897 898 899 900
			 */
			if (type == CLEAR_REFS_ANON && vma->vm_file)
				continue;
			if (type == CLEAR_REFS_MAPPED && !vma->vm_file)
				continue;
			walk_page_range(vma->vm_start, vma->vm_end,
					&clear_refs_walk);
D
Dave Hansen 已提交
901
		}
902 903
		if (type == CLEAR_REFS_SOFT_DIRTY)
			mmu_notifier_invalidate_range_end(mm, 0, -1);
904 905 906 907 908
		flush_tlb_mm(mm);
		up_read(&mm->mmap_sem);
		mmput(mm);
	}
	put_task_struct(task);
909 910

	return count;
911 912
}

913 914
const struct file_operations proc_clear_refs_operations = {
	.write		= clear_refs_write,
915
	.llseek		= noop_llseek,
916 917
};

918 919 920 921
typedef struct {
	u64 pme;
} pagemap_entry_t;

922
struct pagemapread {
923
	int pos, len;		/* units: PM_ENTRY_BYTES, not bytes */
924
	pagemap_entry_t *buffer;
925
	bool v2;
926 927
};

928 929 930
#define PAGEMAP_WALK_SIZE	(PMD_SIZE)
#define PAGEMAP_WALK_MASK	(PMD_MASK)

931
#define PM_ENTRY_BYTES      sizeof(pagemap_entry_t)
932 933 934 935 936 937 938
#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)
939
#define __PM_PSHIFT(x)      (((u64) (x) << PM_PSHIFT_OFFSET) & PM_PSHIFT_MASK)
940 941
#define PM_PFRAME_MASK      ((1LL << PM_PSHIFT_OFFSET) - 1)
#define PM_PFRAME(x)        ((x) & PM_PFRAME_MASK)
942 943
/* in "new" pagemap pshift bits are occupied with more status bits */
#define PM_STATUS2(v2, x)   (__PM_PSHIFT(v2 ? x : PAGE_SHIFT))
944

945
#define __PM_SOFT_DIRTY      (1LL)
946 947
#define PM_PRESENT          PM_STATUS(4LL)
#define PM_SWAP             PM_STATUS(2LL)
948
#define PM_FILE             PM_STATUS(1LL)
949
#define PM_NOT_PRESENT(v2)  PM_STATUS2(v2, 0)
950 951
#define PM_END_OF_BUFFER    1

952 953 954 955 956 957
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,
958 959
			  struct pagemapread *pm)
{
960
	pm->buffer[pm->pos++] = *pme;
961
	if (pm->pos >= pm->len)
962
		return PM_END_OF_BUFFER;
963 964 965 966
	return 0;
}

static int pagemap_pte_hole(unsigned long start, unsigned long end,
D
Dave Hansen 已提交
967
				struct mm_walk *walk)
968
{
D
Dave Hansen 已提交
969
	struct pagemapread *pm = walk->private;
970
	unsigned long addr = start;
971
	int err = 0;
972

973 974 975
	while (addr < end) {
		struct vm_area_struct *vma = find_vma(walk->mm, addr);
		pagemap_entry_t pme = make_pme(PM_NOT_PRESENT(pm->v2));
976 977
		/* End of address space hole, which we mark as non-present. */
		unsigned long hole_end;
978

979 980 981 982 983 984 985 986 987
		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;
988 989
		}

990 991 992 993 994 995 996
		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) {
997 998 999 1000
			err = add_to_pagemap(addr, &pme, pm);
			if (err)
				goto out;
		}
1001
	}
1002
out:
1003 1004 1005
	return err;
}

1006
static void pte_to_pagemap_entry(pagemap_entry_t *pme, struct pagemapread *pm,
1007
		struct vm_area_struct *vma, unsigned long addr, pte_t pte)
1008
{
1009 1010
	u64 frame, flags;
	struct page *page = NULL;
1011
	int flags2 = 0;
1012

1013 1014 1015 1016
	if (pte_present(pte)) {
		frame = pte_pfn(pte);
		flags = PM_PRESENT;
		page = vm_normal_page(vma, addr, pte);
1017 1018
		if (pte_soft_dirty(pte))
			flags2 |= __PM_SOFT_DIRTY;
1019
	} else if (is_swap_pte(pte)) {
1020 1021 1022 1023
		swp_entry_t entry;
		if (pte_swp_soft_dirty(pte))
			flags2 |= __PM_SOFT_DIRTY;
		entry = pte_to_swp_entry(pte);
1024 1025 1026 1027 1028 1029
		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 {
1030 1031 1032
		if (vma->vm_flags & VM_SOFTDIRTY)
			flags2 |= __PM_SOFT_DIRTY;
		*pme = make_pme(PM_NOT_PRESENT(pm->v2) | PM_STATUS2(pm->v2, flags2));
1033 1034 1035 1036 1037
		return;
	}

	if (page && !PageAnon(page))
		flags |= PM_FILE;
1038
	if ((vma->vm_flags & VM_SOFTDIRTY))
1039
		flags2 |= __PM_SOFT_DIRTY;
1040

1041
	*pme = make_pme(PM_PFRAME(frame) | PM_STATUS2(pm->v2, flags2) | flags);
1042 1043
}

1044
#ifdef CONFIG_TRANSPARENT_HUGEPAGE
1045
static void thp_pmd_to_pagemap_entry(pagemap_entry_t *pme, struct pagemapread *pm,
1046
		pmd_t pmd, int offset, int pmd_flags2)
1047 1048 1049 1050 1051 1052 1053
{
	/*
	 * 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))
1054
		*pme = make_pme(PM_PFRAME(pmd_pfn(pmd) + offset)
1055
				| PM_STATUS2(pm->v2, pmd_flags2) | PM_PRESENT);
1056
	else
1057
		*pme = make_pme(PM_NOT_PRESENT(pm->v2) | PM_STATUS2(pm->v2, pmd_flags2));
1058 1059
}
#else
1060
static inline void thp_pmd_to_pagemap_entry(pagemap_entry_t *pme, struct pagemapread *pm,
1061
		pmd_t pmd, int offset, int pmd_flags2)
1062 1063 1064 1065
{
}
#endif

1066
static int pagemap_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end,
D
Dave Hansen 已提交
1067
			     struct mm_walk *walk)
1068
{
1069
	struct vm_area_struct *vma;
D
Dave Hansen 已提交
1070
	struct pagemapread *pm = walk->private;
1071
	spinlock_t *ptl;
1072 1073 1074
	pte_t *pte;
	int err = 0;

1075 1076
	/* find the first VMA at or above 'addr' */
	vma = find_vma(walk->mm, addr);
1077
	if (vma && pmd_trans_huge_lock(pmd, vma, &ptl) == 1) {
1078 1079
		int pmd_flags2;

1080 1081 1082 1083 1084
		if ((vma->vm_flags & VM_SOFTDIRTY) || pmd_soft_dirty(*pmd))
			pmd_flags2 = __PM_SOFT_DIRTY;
		else
			pmd_flags2 = 0;

1085 1086
		for (; addr != end; addr += PAGE_SIZE) {
			unsigned long offset;
1087
			pagemap_entry_t pme;
1088 1089 1090

			offset = (addr & ~PAGEMAP_WALK_MASK) >>
					PAGE_SHIFT;
1091
			thp_pmd_to_pagemap_entry(&pme, pm, *pmd, offset, pmd_flags2);
1092
			err = add_to_pagemap(addr, &pme, pm);
1093 1094
			if (err)
				break;
1095
		}
1096
		spin_unlock(ptl);
1097
		return err;
1098 1099
	}

1100 1101
	if (pmd_trans_unstable(pmd))
		return 0;
1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117

	while (1) {
		/* End of address space hole, which we mark as non-present. */
		unsigned long hole_end;

		if (vma)
			hole_end = min(end, vma->vm_start);
		else
			hole_end = end;

		for (; addr < hole_end; addr += PAGE_SIZE) {
			pagemap_entry_t pme = make_pme(PM_NOT_PRESENT(pm->v2));

			err = add_to_pagemap(addr, &pme, pm);
			if (err)
				return err;
1118
		}
1119

1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134
		if (!vma || vma->vm_start >= end)
			break;
		/*
		 * We can't possibly be in a hugetlb VMA. In general,
		 * for a mm_walk with a pmd_entry and a hugetlb_entry,
		 * the pmd_entry can only be called on addresses in a
		 * hugetlb if the walk starts in a non-hugetlb VMA and
		 * spans a hugepage VMA. Since pagemap_read walks are
		 * PMD-sized and PMD-aligned, this will never be true.
		 */
		BUG_ON(is_vm_hugetlb_page(vma));

		/* Addresses in the VMA. */
		for (; addr < min(end, vma->vm_end); addr += PAGE_SIZE) {
			pagemap_entry_t pme;
1135
			pte = pte_offset_map(pmd, addr);
1136
			pte_to_pagemap_entry(&pme, pm, vma, addr, *pte);
1137
			pte_unmap(pte);
1138 1139 1140
			err = add_to_pagemap(addr, &pme, pm);
			if (err)
				return err;
1141
		}
1142 1143 1144 1145 1146

		if (addr == end)
			break;

		vma = find_vma(walk->mm, addr);
1147 1148 1149 1150 1151 1152 1153
	}

	cond_resched();

	return err;
}

1154
#ifdef CONFIG_HUGETLB_PAGE
1155
static void huge_pte_to_pagemap_entry(pagemap_entry_t *pme, struct pagemapread *pm,
1156
					pte_t pte, int offset, int flags2)
1157 1158
{
	if (pte_present(pte))
1159 1160 1161
		*pme = make_pme(PM_PFRAME(pte_pfn(pte) + offset)	|
				PM_STATUS2(pm->v2, flags2)		|
				PM_PRESENT);
1162
	else
1163 1164
		*pme = make_pme(PM_NOT_PRESENT(pm->v2)			|
				PM_STATUS2(pm->v2, flags2));
1165 1166
}

1167 1168 1169 1170
/* 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)
1171 1172
{
	struct pagemapread *pm = walk->private;
1173
	struct vm_area_struct *vma;
1174
	int err = 0;
1175
	int flags2;
1176
	pagemap_entry_t pme;
1177

1178 1179 1180 1181 1182 1183 1184 1185
	vma = find_vma(walk->mm, addr);
	WARN_ON_ONCE(!vma);

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

1186
	for (; addr != end; addr += PAGE_SIZE) {
1187
		int offset = (addr & ~hmask) >> PAGE_SHIFT;
1188
		huge_pte_to_pagemap_entry(&pme, pm, *pte, offset, flags2);
1189
		err = add_to_pagemap(addr, &pme, pm);
1190 1191 1192 1193 1194 1195 1196 1197
		if (err)
			return err;
	}

	cond_resched();

	return err;
}
1198
#endif /* HUGETLB_PAGE */
1199

1200 1201 1202
/*
 * /proc/pid/pagemap - an array mapping virtual pages to pfns
 *
1203 1204 1205
 * For each page in the address space, this file contains one 64-bit entry
 * consisting of the following:
 *
1206
 * Bits 0-54  page frame number (PFN) if present
1207
 * Bits 0-4   swap type if swapped
1208
 * Bits 5-54  swap offset if swapped
1209
 * Bits 55-60 page shift (page size = 1<<page shift)
1210
 * Bit  61    page is file-page or shared-anon
1211 1212 1213 1214 1215 1216
 * 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
1217 1218 1219 1220 1221 1222 1223 1224 1225 1226
 * 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 已提交
1227
	struct task_struct *task = get_proc_task(file_inode(file));
1228 1229 1230
	struct mm_struct *mm;
	struct pagemapread pm;
	int ret = -ESRCH;
1231
	struct mm_walk pagemap_walk = {};
1232 1233 1234 1235
	unsigned long src;
	unsigned long svpfn;
	unsigned long start_vaddr;
	unsigned long end_vaddr;
1236
	int copied = 0;
1237 1238 1239 1240 1241 1242

	if (!task)
		goto out;

	ret = -EINVAL;
	/* file position must be aligned */
1243
	if ((*ppos % PM_ENTRY_BYTES) || (count % PM_ENTRY_BYTES))
1244
		goto out_task;
1245 1246

	ret = 0;
1247 1248 1249
	if (!count)
		goto out_task;

1250
	pm.v2 = soft_dirty_cleared;
1251 1252
	pm.len = (PAGEMAP_WALK_SIZE >> PAGE_SHIFT);
	pm.buffer = kmalloc(pm.len * PM_ENTRY_BYTES, GFP_TEMPORARY);
1253
	ret = -ENOMEM;
1254
	if (!pm.buffer)
1255 1256
		goto out_task;

C
Cong Wang 已提交
1257
	mm = mm_access(task, PTRACE_MODE_READ);
1258 1259 1260
	ret = PTR_ERR(mm);
	if (!mm || IS_ERR(mm))
		goto out_free;
1261

1262 1263
	pagemap_walk.pmd_entry = pagemap_pte_range;
	pagemap_walk.pte_hole = pagemap_pte_hole;
1264
#ifdef CONFIG_HUGETLB_PAGE
1265
	pagemap_walk.hugetlb_entry = pagemap_hugetlb_range;
1266
#endif
1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284
	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.
	 */
1285 1286 1287 1288 1289 1290
	ret = 0;
	while (count && (start_vaddr < end_vaddr)) {
		int len;
		unsigned long end;

		pm.pos = 0;
1291
		end = (start_vaddr + PAGEMAP_WALK_SIZE) & PAGEMAP_WALK_MASK;
1292 1293 1294 1295 1296 1297 1298 1299 1300
		/* 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);
1301
		if (copy_to_user(buf, pm.buffer, len)) {
1302
			ret = -EFAULT;
1303
			goto out_mm;
1304 1305 1306 1307
		}
		copied += len;
		buf += len;
		count -= len;
1308
	}
1309 1310 1311 1312
	*ppos += copied;
	if (!ret || ret == PM_END_OF_BUFFER)
		ret = copied;

1313 1314
out_mm:
	mmput(mm);
1315 1316
out_free:
	kfree(pm.buffer);
1317 1318 1319 1320 1321 1322
out_task:
	put_task_struct(task);
out:
	return ret;
}

1323 1324 1325 1326 1327 1328 1329 1330
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;
}

1331 1332 1333
const struct file_operations proc_pagemap_operations = {
	.llseek		= mem_lseek, /* borrow this */
	.read		= pagemap_read,
1334
	.open		= pagemap_open,
1335
};
1336
#endif /* CONFIG_PROC_PAGE_MONITOR */
1337

1338 1339
#ifdef CONFIG_NUMA

1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351
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];
};

1352 1353 1354 1355 1356
struct numa_maps_private {
	struct proc_maps_private proc_maps;
	struct numa_maps md;
};

1357 1358
static void gather_stats(struct page *page, struct numa_maps *md, int pte_dirty,
			unsigned long nr_pages)
1359 1360 1361
{
	int count = page_mapcount(page);

1362
	md->pages += nr_pages;
1363
	if (pte_dirty || PageDirty(page))
1364
		md->dirty += nr_pages;
1365 1366

	if (PageSwapCache(page))
1367
		md->swapcache += nr_pages;
1368 1369

	if (PageActive(page) || PageUnevictable(page))
1370
		md->active += nr_pages;
1371 1372

	if (PageWriteback(page))
1373
		md->writeback += nr_pages;
1374 1375

	if (PageAnon(page))
1376
		md->anon += nr_pages;
1377 1378 1379 1380

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

1381
	md->node[page_to_nid(page)] += nr_pages;
1382 1383
}

1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400
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);
1401
	if (!node_isset(nid, node_states[N_MEMORY]))
1402 1403 1404 1405 1406
		return NULL;

	return page;
}

1407 1408 1409 1410 1411 1412 1413 1414 1415
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;
1416

1417
	if (pmd_trans_huge_lock(pmd, md->vma, &ptl) == 1) {
1418 1419 1420 1421 1422 1423 1424
		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);
1425
		spin_unlock(ptl);
1426
		return 0;
1427 1428
	}

1429 1430
	if (pmd_trans_unstable(pmd))
		return 0;
1431 1432
	orig_pte = pte = pte_offset_map_lock(walk->mm, pmd, addr, &ptl);
	do {
1433
		struct page *page = can_gather_numa_stats(*pte, md->vma, addr);
1434 1435
		if (!page)
			continue;
1436
		gather_stats(page, md, pte_dirty(*pte), 1);
1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448

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

1449
	if (!pte_present(*pte))
1450 1451 1452 1453 1454 1455 1456
		return 0;

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

	md = walk->private;
1457
	gather_stats(page, md, pte_dirty(*pte), 1);
1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471
	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.
 */
1472
static int show_numa_map(struct seq_file *m, void *v, int is_pid)
1473
{
1474 1475
	struct numa_maps_private *numa_priv = m->private;
	struct proc_maps_private *proc_priv = &numa_priv->proc_maps;
1476
	struct vm_area_struct *vma = v;
1477
	struct numa_maps *md = &numa_priv->md;
1478 1479 1480 1481
	struct file *file = vma->vm_file;
	struct mm_struct *mm = vma->vm_mm;
	struct mm_walk walk = {};
	struct mempolicy *pol;
1482 1483
	char buffer[64];
	int nid;
1484 1485 1486 1487

	if (!mm)
		return 0;

1488 1489
	/* Ensure we start with an empty set of numa_maps statistics. */
	memset(md, 0, sizeof(*md));
1490 1491 1492 1493 1494 1495 1496 1497

	md->vma = vma;

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

1498 1499 1500 1501 1502 1503 1504
	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);
	}
1505 1506 1507 1508

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

	if (file) {
1509
		seq_puts(m, " file=");
1510 1511
		seq_path(m, &file->f_path, "\n\t= ");
	} else if (vma->vm_start <= mm->brk && vma->vm_end >= mm->start_brk) {
1512
		seq_puts(m, " heap");
1513
	} else {
1514
		pid_t tid = pid_of_stack(proc_priv, vma, is_pid);
1515 1516 1517 1518 1519 1520 1521
		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))
1522
				seq_puts(m, " stack");
1523 1524 1525
			else
				seq_printf(m, " stack:%d", tid);
		}
1526 1527
	}

1528
	if (is_vm_hugetlb_page(vma))
1529
		seq_puts(m, " huge");
1530

1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556
	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);

1557 1558 1559
	for_each_node_state(nid, N_MEMORY)
		if (md->node[nid])
			seq_printf(m, " N%d=%lu", nid, md->node[nid]);
1560 1561
out:
	seq_putc(m, '\n');
1562
	m_cache_vma(m, vma);
1563 1564
	return 0;
}
1565

1566 1567 1568 1569 1570 1571 1572 1573 1574 1575
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);
}

1576
static const struct seq_operations proc_pid_numa_maps_op = {
1577 1578 1579 1580
	.start  = m_start,
	.next   = m_next,
	.stop   = m_stop,
	.show   = show_pid_numa_map,
1581
};
1582

1583 1584 1585 1586 1587 1588 1589 1590 1591
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)
1592
{
1593 1594
	return proc_maps_open(inode, file, ops,
				sizeof(struct numa_maps_private));
1595 1596
}

1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610
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,
1611
	.release	= proc_map_release,
1612 1613 1614 1615
};

const struct file_operations proc_tid_numa_maps_operations = {
	.open		= tid_numa_maps_open,
1616 1617
	.read		= seq_read,
	.llseek		= seq_lseek,
1618
	.release	= proc_map_release,
1619
};
1620
#endif /* CONFIG_NUMA */