Linux Audio

Check our new training course

Loading...
v4.17
   1// SPDX-License-Identifier: GPL-2.0
   2#include <linux/mm.h>
   3#include <linux/vmacache.h>
   4#include <linux/hugetlb.h>
   5#include <linux/huge_mm.h>
   6#include <linux/mount.h>
   7#include <linux/seq_file.h>
   8#include <linux/highmem.h>
   9#include <linux/ptrace.h>
  10#include <linux/slab.h>
  11#include <linux/pagemap.h>
  12#include <linux/mempolicy.h>
  13#include <linux/rmap.h>
  14#include <linux/swap.h>
  15#include <linux/sched/mm.h>
  16#include <linux/swapops.h>
  17#include <linux/mmu_notifier.h>
  18#include <linux/page_idle.h>
  19#include <linux/shmem_fs.h>
  20#include <linux/uaccess.h>
 
  21
  22#include <asm/elf.h>
  23#include <asm/tlb.h>
  24#include <asm/tlbflush.h>
  25#include "internal.h"
  26
  27#define SEQ_PUT_DEC(str, val) \
  28		seq_put_decimal_ull_width(m, str, (val) << (PAGE_SHIFT-10), 8)
  29void task_mem(struct seq_file *m, struct mm_struct *mm)
  30{
  31	unsigned long text, lib, swap, anon, file, shmem;
  32	unsigned long hiwater_vm, total_vm, hiwater_rss, total_rss;
  33
  34	anon = get_mm_counter(mm, MM_ANONPAGES);
  35	file = get_mm_counter(mm, MM_FILEPAGES);
  36	shmem = get_mm_counter(mm, MM_SHMEMPAGES);
  37
  38	/*
  39	 * Note: to minimize their overhead, mm maintains hiwater_vm and
  40	 * hiwater_rss only when about to *lower* total_vm or rss.  Any
  41	 * collector of these hiwater stats must therefore get total_vm
  42	 * and rss too, which will usually be the higher.  Barriers? not
  43	 * worth the effort, such snapshots can always be inconsistent.
  44	 */
  45	hiwater_vm = total_vm = mm->total_vm;
  46	if (hiwater_vm < mm->hiwater_vm)
  47		hiwater_vm = mm->hiwater_vm;
  48	hiwater_rss = total_rss = anon + file + shmem;
  49	if (hiwater_rss < mm->hiwater_rss)
  50		hiwater_rss = mm->hiwater_rss;
  51
  52	/* split executable areas between text and lib */
  53	text = PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK);
  54	text = min(text, mm->exec_vm << PAGE_SHIFT);
  55	lib = (mm->exec_vm << PAGE_SHIFT) - text;
  56
  57	swap = get_mm_counter(mm, MM_SWAPENTS);
  58	SEQ_PUT_DEC("VmPeak:\t", hiwater_vm);
  59	SEQ_PUT_DEC(" kB\nVmSize:\t", total_vm);
  60	SEQ_PUT_DEC(" kB\nVmLck:\t", mm->locked_vm);
  61	SEQ_PUT_DEC(" kB\nVmPin:\t", mm->pinned_vm);
  62	SEQ_PUT_DEC(" kB\nVmHWM:\t", hiwater_rss);
  63	SEQ_PUT_DEC(" kB\nVmRSS:\t", total_rss);
  64	SEQ_PUT_DEC(" kB\nRssAnon:\t", anon);
  65	SEQ_PUT_DEC(" kB\nRssFile:\t", file);
  66	SEQ_PUT_DEC(" kB\nRssShmem:\t", shmem);
  67	SEQ_PUT_DEC(" kB\nVmData:\t", mm->data_vm);
  68	SEQ_PUT_DEC(" kB\nVmStk:\t", mm->stack_vm);
  69	seq_put_decimal_ull_width(m,
  70		    " kB\nVmExe:\t", text >> 10, 8);
  71	seq_put_decimal_ull_width(m,
  72		    " kB\nVmLib:\t", lib >> 10, 8);
  73	seq_put_decimal_ull_width(m,
  74		    " kB\nVmPTE:\t", mm_pgtables_bytes(mm) >> 10, 8);
  75	SEQ_PUT_DEC(" kB\nVmSwap:\t", swap);
  76	seq_puts(m, " kB\n");
  77	hugetlb_report_usage(m, mm);
  78}
  79#undef SEQ_PUT_DEC
  80
  81unsigned long task_vsize(struct mm_struct *mm)
  82{
  83	return PAGE_SIZE * mm->total_vm;
  84}
  85
  86unsigned long task_statm(struct mm_struct *mm,
  87			 unsigned long *shared, unsigned long *text,
  88			 unsigned long *data, unsigned long *resident)
  89{
  90	*shared = get_mm_counter(mm, MM_FILEPAGES) +
  91			get_mm_counter(mm, MM_SHMEMPAGES);
  92	*text = (PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK))
  93								>> PAGE_SHIFT;
  94	*data = mm->data_vm + mm->stack_vm;
  95	*resident = *shared + get_mm_counter(mm, MM_ANONPAGES);
  96	return mm->total_vm;
  97}
  98
  99#ifdef CONFIG_NUMA
 100/*
 101 * Save get_task_policy() for show_numa_map().
 102 */
 103static void hold_task_mempolicy(struct proc_maps_private *priv)
 104{
 105	struct task_struct *task = priv->task;
 106
 107	task_lock(task);
 108	priv->task_mempolicy = get_task_policy(task);
 109	mpol_get(priv->task_mempolicy);
 110	task_unlock(task);
 111}
 112static void release_task_mempolicy(struct proc_maps_private *priv)
 113{
 114	mpol_put(priv->task_mempolicy);
 115}
 116#else
 117static void hold_task_mempolicy(struct proc_maps_private *priv)
 118{
 119}
 120static void release_task_mempolicy(struct proc_maps_private *priv)
 121{
 122}
 123#endif
 124
 125static void vma_stop(struct proc_maps_private *priv)
 126{
 127	struct mm_struct *mm = priv->mm;
 128
 129	release_task_mempolicy(priv);
 130	up_read(&mm->mmap_sem);
 131	mmput(mm);
 132}
 133
 134static struct vm_area_struct *
 135m_next_vma(struct proc_maps_private *priv, struct vm_area_struct *vma)
 136{
 137	if (vma == priv->tail_vma)
 138		return NULL;
 139	return vma->vm_next ?: priv->tail_vma;
 140}
 141
 142static void m_cache_vma(struct seq_file *m, struct vm_area_struct *vma)
 143{
 144	if (m->count < m->size)	/* vma is copied successfully */
 145		m->version = m_next_vma(m->private, vma) ? vma->vm_end : -1UL;
 146}
 147
 148static void *m_start(struct seq_file *m, loff_t *ppos)
 149{
 150	struct proc_maps_private *priv = m->private;
 151	unsigned long last_addr = m->version;
 152	struct mm_struct *mm;
 153	struct vm_area_struct *vma;
 154	unsigned int pos = *ppos;
 155
 156	/* See m_cache_vma(). Zero at the start or after lseek. */
 157	if (last_addr == -1UL)
 158		return NULL;
 159
 160	priv->task = get_proc_task(priv->inode);
 161	if (!priv->task)
 162		return ERR_PTR(-ESRCH);
 163
 164	mm = priv->mm;
 165	if (!mm || !mmget_not_zero(mm))
 
 
 166		return NULL;
 
 
 
 
 
 
 
 
 167
 168	down_read(&mm->mmap_sem);
 169	hold_task_mempolicy(priv);
 170	priv->tail_vma = get_gate_vma(mm);
 171
 172	if (last_addr) {
 173		vma = find_vma(mm, last_addr - 1);
 174		if (vma && vma->vm_start <= last_addr)
 175			vma = m_next_vma(priv, vma);
 176		if (vma)
 177			return vma;
 178	}
 179
 180	m->version = 0;
 181	if (pos < mm->map_count) {
 182		for (vma = mm->mmap; pos; pos--) {
 183			m->version = vma->vm_start;
 184			vma = vma->vm_next;
 185		}
 186		return vma;
 187	}
 188
 189	/* we do not bother to update m->version in this case */
 190	if (pos == mm->map_count && priv->tail_vma)
 191		return priv->tail_vma;
 192
 193	vma_stop(priv);
 194	return NULL;
 195}
 196
 197static void *m_next(struct seq_file *m, void *v, loff_t *pos)
 198{
 199	struct proc_maps_private *priv = m->private;
 200	struct vm_area_struct *next;
 
 
 
 
 
 
 
 
 
 201
 202	(*pos)++;
 203	next = m_next_vma(priv, v);
 204	if (!next)
 205		vma_stop(priv);
 206	return next;
 207}
 208
 209static void m_stop(struct seq_file *m, void *v)
 210{
 211	struct proc_maps_private *priv = m->private;
 
 212
 213	if (!IS_ERR_OR_NULL(v))
 214		vma_stop(priv);
 215	if (priv->task) {
 216		put_task_struct(priv->task);
 217		priv->task = NULL;
 218	}
 
 
 219}
 220
 221static int proc_maps_open(struct inode *inode, struct file *file,
 222			const struct seq_operations *ops, int psize)
 223{
 224	struct proc_maps_private *priv = __seq_open_private(file, ops, psize);
 225
 226	if (!priv)
 227		return -ENOMEM;
 228
 229	priv->inode = inode;
 230	priv->mm = proc_mem_open(inode, PTRACE_MODE_READ);
 231	if (IS_ERR(priv->mm)) {
 232		int err = PTR_ERR(priv->mm);
 233
 234		seq_release_private(inode, file);
 235		return err;
 236	}
 237
 238	return 0;
 239}
 240
 241static int proc_map_release(struct inode *inode, struct file *file)
 242{
 243	struct seq_file *seq = file->private_data;
 244	struct proc_maps_private *priv = seq->private;
 245
 246	if (priv->mm)
 247		mmdrop(priv->mm);
 248
 249	kfree(priv->rollup);
 250	return seq_release_private(inode, file);
 251}
 252
 253static int do_maps_open(struct inode *inode, struct file *file,
 254			const struct seq_operations *ops)
 255{
 256	return proc_maps_open(inode, file, ops,
 257				sizeof(struct proc_maps_private));
 258}
 259
 260/*
 261 * Indicate if the VMA is a stack for the given task; for
 262 * /proc/PID/maps that is the stack of the main task.
 263 */
 264static int is_stack(struct vm_area_struct *vma)
 265{
 266	/*
 267	 * We make no effort to guess what a given thread considers to be
 268	 * its "stack".  It's not even well-defined for programs written
 269	 * languages like Go.
 270	 */
 271	return vma->vm_start <= vma->vm_mm->start_stack &&
 272		vma->vm_end >= vma->vm_mm->start_stack;
 273}
 274
 275static void show_vma_header_prefix(struct seq_file *m,
 276				   unsigned long start, unsigned long end,
 277				   vm_flags_t flags, unsigned long long pgoff,
 278				   dev_t dev, unsigned long ino)
 279{
 280	seq_setwidth(m, 25 + sizeof(void *) * 6 - 1);
 281	seq_put_hex_ll(m, NULL, start, 8);
 282	seq_put_hex_ll(m, "-", end, 8);
 283	seq_putc(m, ' ');
 284	seq_putc(m, flags & VM_READ ? 'r' : '-');
 285	seq_putc(m, flags & VM_WRITE ? 'w' : '-');
 286	seq_putc(m, flags & VM_EXEC ? 'x' : '-');
 287	seq_putc(m, flags & VM_MAYSHARE ? 's' : 'p');
 288	seq_put_hex_ll(m, " ", pgoff, 8);
 289	seq_put_hex_ll(m, " ", MAJOR(dev), 2);
 290	seq_put_hex_ll(m, ":", MINOR(dev), 2);
 291	seq_put_decimal_ull(m, " ", ino);
 292	seq_putc(m, ' ');
 293}
 294
 295static void
 296show_map_vma(struct seq_file *m, struct vm_area_struct *vma, int is_pid)
 297{
 298	struct mm_struct *mm = vma->vm_mm;
 299	struct file *file = vma->vm_file;
 300	vm_flags_t flags = vma->vm_flags;
 301	unsigned long ino = 0;
 302	unsigned long long pgoff = 0;
 303	unsigned long start, end;
 304	dev_t dev = 0;
 305	const char *name = NULL;
 306
 307	if (file) {
 308		struct inode *inode = file_inode(vma->vm_file);
 309		dev = inode->i_sb->s_dev;
 310		ino = inode->i_ino;
 311		pgoff = ((loff_t)vma->vm_pgoff) << PAGE_SHIFT;
 312	}
 313
 314	start = vma->vm_start;
 315	end = vma->vm_end;
 316	show_vma_header_prefix(m, start, end, flags, pgoff, dev, ino);
 317
 318	/*
 319	 * Print the dentry name for named mappings, and a
 320	 * special [heap] marker for the heap:
 321	 */
 322	if (file) {
 323		seq_pad(m, ' ');
 324		seq_file_path(m, file, "\n");
 325		goto done;
 326	}
 327
 328	if (vma->vm_ops && vma->vm_ops->name) {
 329		name = vma->vm_ops->name(vma);
 330		if (name)
 331			goto done;
 332	}
 333
 334	name = arch_vma_name(vma);
 335	if (!name) {
 336		if (!mm) {
 337			name = "[vdso]";
 338			goto done;
 339		}
 340
 341		if (vma->vm_start <= mm->brk &&
 342		    vma->vm_end >= mm->start_brk) {
 343			name = "[heap]";
 344			goto done;
 345		}
 346
 347		if (is_stack(vma))
 348			name = "[stack]";
 349	}
 350
 351done:
 352	if (name) {
 353		seq_pad(m, ' ');
 354		seq_puts(m, name);
 355	}
 356	seq_putc(m, '\n');
 357}
 358
 359static int show_map(struct seq_file *m, void *v, int is_pid)
 360{
 361	show_map_vma(m, v, is_pid);
 362	m_cache_vma(m, v);
 363	return 0;
 364}
 365
 366static int show_pid_map(struct seq_file *m, void *v)
 367{
 368	return show_map(m, v, 1);
 369}
 370
 371static int show_tid_map(struct seq_file *m, void *v)
 372{
 373	return show_map(m, v, 0);
 374}
 375
 376static const struct seq_operations proc_pid_maps_op = {
 377	.start	= m_start,
 378	.next	= m_next,
 379	.stop	= m_stop,
 380	.show	= show_pid_map
 381};
 382
 383static const struct seq_operations proc_tid_maps_op = {
 384	.start	= m_start,
 385	.next	= m_next,
 386	.stop	= m_stop,
 387	.show	= show_tid_map
 388};
 389
 390static int pid_maps_open(struct inode *inode, struct file *file)
 391{
 392	return do_maps_open(inode, file, &proc_pid_maps_op);
 393}
 394
 395static int tid_maps_open(struct inode *inode, struct file *file)
 396{
 397	return do_maps_open(inode, file, &proc_tid_maps_op);
 398}
 399
 400const struct file_operations proc_pid_maps_operations = {
 401	.open		= pid_maps_open,
 402	.read		= seq_read,
 403	.llseek		= seq_lseek,
 404	.release	= proc_map_release,
 405};
 406
 407const struct file_operations proc_tid_maps_operations = {
 408	.open		= tid_maps_open,
 409	.read		= seq_read,
 410	.llseek		= seq_lseek,
 411	.release	= proc_map_release,
 412};
 413
 414/*
 415 * Proportional Set Size(PSS): my share of RSS.
 416 *
 417 * PSS of a process is the count of pages it has in memory, where each
 418 * page is divided by the number of processes sharing it.  So if a
 419 * process has 1000 pages all to itself, and 1000 shared with one other
 420 * process, its PSS will be 1500.
 421 *
 422 * To keep (accumulated) division errors low, we adopt a 64bit
 423 * fixed-point pss counter to minimize division errors. So (pss >>
 424 * PSS_SHIFT) would be the real byte count.
 425 *
 426 * A shift of 12 before division means (assuming 4K page size):
 427 * 	- 1M 3-user-pages add up to 8KB errors;
 428 * 	- supports mapcount up to 2^24, or 16M;
 429 * 	- supports PSS up to 2^52 bytes, or 4PB.
 430 */
 431#define PSS_SHIFT 12
 432
 433#ifdef CONFIG_PROC_PAGE_MONITOR
 434struct mem_size_stats {
 435	bool first;
 436	unsigned long resident;
 437	unsigned long shared_clean;
 438	unsigned long shared_dirty;
 439	unsigned long private_clean;
 440	unsigned long private_dirty;
 441	unsigned long referenced;
 442	unsigned long anonymous;
 443	unsigned long lazyfree;
 444	unsigned long anonymous_thp;
 445	unsigned long shmem_thp;
 
 446	unsigned long swap;
 447	unsigned long shared_hugetlb;
 448	unsigned long private_hugetlb;
 449	unsigned long first_vma_start;
 450	u64 pss;
 
 
 
 451	u64 pss_locked;
 452	u64 swap_pss;
 453	bool check_shmem_swap;
 454};
 455
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 456static void smaps_account(struct mem_size_stats *mss, struct page *page,
 457		bool compound, bool young, bool dirty)
 458{
 459	int i, nr = compound ? 1 << compound_order(page) : 1;
 460	unsigned long size = nr * PAGE_SIZE;
 461
 
 
 
 
 462	if (PageAnon(page)) {
 463		mss->anonymous += size;
 464		if (!PageSwapBacked(page) && !dirty && !PageDirty(page))
 465			mss->lazyfree += size;
 466	}
 467
 468	mss->resident += size;
 469	/* Accumulate the size in pages that have been accessed. */
 470	if (young || page_is_young(page) || PageReferenced(page))
 471		mss->referenced += size;
 472
 473	/*
 
 
 
 474	 * page_count(page) == 1 guarantees the page is mapped exactly once.
 475	 * If any subpage of the compound page mapped with PTE it would elevate
 476	 * page_count().
 477	 */
 478	if (page_count(page) == 1) {
 479		if (dirty || PageDirty(page))
 480			mss->private_dirty += size;
 481		else
 482			mss->private_clean += size;
 483		mss->pss += (u64)size << PSS_SHIFT;
 484		return;
 485	}
 486
 487	for (i = 0; i < nr; i++, page++) {
 488		int mapcount = page_mapcount(page);
 489
 490		if (mapcount >= 2) {
 491			if (dirty || PageDirty(page))
 492				mss->shared_dirty += PAGE_SIZE;
 493			else
 494				mss->shared_clean += PAGE_SIZE;
 495			mss->pss += (PAGE_SIZE << PSS_SHIFT) / mapcount;
 496		} else {
 497			if (dirty || PageDirty(page))
 498				mss->private_dirty += PAGE_SIZE;
 499			else
 500				mss->private_clean += PAGE_SIZE;
 501			mss->pss += PAGE_SIZE << PSS_SHIFT;
 502		}
 503	}
 504}
 505
 506#ifdef CONFIG_SHMEM
 507static int smaps_pte_hole(unsigned long addr, unsigned long end,
 508		struct mm_walk *walk)
 509{
 510	struct mem_size_stats *mss = walk->private;
 511
 512	mss->swap += shmem_partial_swap_usage(
 513			walk->vma->vm_file->f_mapping, addr, end);
 514
 515	return 0;
 516}
 517#endif
 
 
 518
 519static void smaps_pte_entry(pte_t *pte, unsigned long addr,
 520		struct mm_walk *walk)
 521{
 522	struct mem_size_stats *mss = walk->private;
 523	struct vm_area_struct *vma = walk->vma;
 
 524	struct page *page = NULL;
 525
 526	if (pte_present(*pte)) {
 527		page = vm_normal_page(vma, addr, *pte);
 528	} else if (is_swap_pte(*pte)) {
 529		swp_entry_t swpent = pte_to_swp_entry(*pte);
 530
 531		if (!non_swap_entry(swpent)) {
 532			int mapcount;
 533
 534			mss->swap += PAGE_SIZE;
 535			mapcount = swp_swapcount(swpent);
 536			if (mapcount >= 2) {
 537				u64 pss_delta = (u64)PAGE_SIZE << PSS_SHIFT;
 538
 539				do_div(pss_delta, mapcount);
 540				mss->swap_pss += pss_delta;
 541			} else {
 542				mss->swap_pss += (u64)PAGE_SIZE << PSS_SHIFT;
 543			}
 544		} else if (is_migration_entry(swpent))
 545			page = migration_entry_to_page(swpent);
 546		else if (is_device_private_entry(swpent))
 547			page = device_private_entry_to_page(swpent);
 548	} else if (unlikely(IS_ENABLED(CONFIG_SHMEM) && mss->check_shmem_swap
 549							&& pte_none(*pte))) {
 550		page = find_get_entry(vma->vm_file->f_mapping,
 551						linear_page_index(vma, addr));
 552		if (!page)
 553			return;
 554
 555		if (radix_tree_exceptional_entry(page))
 556			mss->swap += PAGE_SIZE;
 557		else
 558			put_page(page);
 559
 560		return;
 561	}
 562
 563	if (!page)
 564		return;
 565
 566	smaps_account(mss, page, false, pte_young(*pte), pte_dirty(*pte));
 567}
 568
 569#ifdef CONFIG_TRANSPARENT_HUGEPAGE
 570static void smaps_pmd_entry(pmd_t *pmd, unsigned long addr,
 571		struct mm_walk *walk)
 572{
 573	struct mem_size_stats *mss = walk->private;
 574	struct vm_area_struct *vma = walk->vma;
 575	struct page *page;
 
 576
 577	/* FOLL_DUMP will return -EFAULT on huge zero page */
 578	page = follow_trans_huge_pmd(vma, addr, pmd, FOLL_DUMP);
 
 
 
 
 
 
 
 579	if (IS_ERR_OR_NULL(page))
 580		return;
 581	if (PageAnon(page))
 582		mss->anonymous_thp += HPAGE_PMD_SIZE;
 583	else if (PageSwapBacked(page))
 584		mss->shmem_thp += HPAGE_PMD_SIZE;
 585	else if (is_zone_device_page(page))
 586		/* pass */;
 587	else
 588		VM_BUG_ON_PAGE(1, page);
 589	smaps_account(mss, page, true, pmd_young(*pmd), pmd_dirty(*pmd));
 590}
 591#else
 592static void smaps_pmd_entry(pmd_t *pmd, unsigned long addr,
 593		struct mm_walk *walk)
 594{
 595}
 596#endif
 597
 598static int smaps_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end,
 599			   struct mm_walk *walk)
 600{
 601	struct vm_area_struct *vma = walk->vma;
 602	pte_t *pte;
 603	spinlock_t *ptl;
 604
 605	ptl = pmd_trans_huge_lock(pmd, vma);
 606	if (ptl) {
 607		if (pmd_present(*pmd))
 608			smaps_pmd_entry(pmd, addr, walk);
 609		spin_unlock(ptl);
 610		goto out;
 611	}
 612
 613	if (pmd_trans_unstable(pmd))
 614		goto out;
 615	/*
 616	 * The mmap_sem held all the way back in m_start() is what
 617	 * keeps khugepaged out of here and from collapsing things
 618	 * in here.
 619	 */
 620	pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
 621	for (; addr != end; pte++, addr += PAGE_SIZE)
 622		smaps_pte_entry(pte, addr, walk);
 623	pte_unmap_unlock(pte - 1, ptl);
 624out:
 625	cond_resched();
 626	return 0;
 627}
 628
 629static void show_smap_vma_flags(struct seq_file *m, struct vm_area_struct *vma)
 630{
 631	/*
 632	 * Don't forget to update Documentation/ on changes.
 633	 */
 634	static const char mnemonics[BITS_PER_LONG][2] = {
 635		/*
 636		 * In case if we meet a flag we don't know about.
 637		 */
 638		[0 ... (BITS_PER_LONG-1)] = "??",
 639
 640		[ilog2(VM_READ)]	= "rd",
 641		[ilog2(VM_WRITE)]	= "wr",
 642		[ilog2(VM_EXEC)]	= "ex",
 643		[ilog2(VM_SHARED)]	= "sh",
 644		[ilog2(VM_MAYREAD)]	= "mr",
 645		[ilog2(VM_MAYWRITE)]	= "mw",
 646		[ilog2(VM_MAYEXEC)]	= "me",
 647		[ilog2(VM_MAYSHARE)]	= "ms",
 648		[ilog2(VM_GROWSDOWN)]	= "gd",
 649		[ilog2(VM_PFNMAP)]	= "pf",
 650		[ilog2(VM_DENYWRITE)]	= "dw",
 651#ifdef CONFIG_X86_INTEL_MPX
 652		[ilog2(VM_MPX)]		= "mp",
 653#endif
 654		[ilog2(VM_LOCKED)]	= "lo",
 655		[ilog2(VM_IO)]		= "io",
 656		[ilog2(VM_SEQ_READ)]	= "sr",
 657		[ilog2(VM_RAND_READ)]	= "rr",
 658		[ilog2(VM_DONTCOPY)]	= "dc",
 659		[ilog2(VM_DONTEXPAND)]	= "de",
 660		[ilog2(VM_ACCOUNT)]	= "ac",
 661		[ilog2(VM_NORESERVE)]	= "nr",
 662		[ilog2(VM_HUGETLB)]	= "ht",
 663		[ilog2(VM_SYNC)]	= "sf",
 664		[ilog2(VM_ARCH_1)]	= "ar",
 665		[ilog2(VM_WIPEONFORK)]	= "wf",
 666		[ilog2(VM_DONTDUMP)]	= "dd",
 
 
 
 667#ifdef CONFIG_MEM_SOFT_DIRTY
 668		[ilog2(VM_SOFTDIRTY)]	= "sd",
 669#endif
 670		[ilog2(VM_MIXEDMAP)]	= "mm",
 671		[ilog2(VM_HUGEPAGE)]	= "hg",
 672		[ilog2(VM_NOHUGEPAGE)]	= "nh",
 673		[ilog2(VM_MERGEABLE)]	= "mg",
 674		[ilog2(VM_UFFD_MISSING)]= "um",
 675		[ilog2(VM_UFFD_WP)]	= "uw",
 676#ifdef CONFIG_X86_INTEL_MEMORY_PROTECTION_KEYS
 
 
 
 
 677		/* These come out via ProtectionKey: */
 678		[ilog2(VM_PKEY_BIT0)]	= "",
 679		[ilog2(VM_PKEY_BIT1)]	= "",
 680		[ilog2(VM_PKEY_BIT2)]	= "",
 681		[ilog2(VM_PKEY_BIT3)]	= "",
 
 
 682#endif
 
 
 
 
 683	};
 684	size_t i;
 685
 686	seq_puts(m, "VmFlags: ");
 687	for (i = 0; i < BITS_PER_LONG; i++) {
 688		if (!mnemonics[i][0])
 689			continue;
 690		if (vma->vm_flags & (1UL << i)) {
 691			seq_putc(m, mnemonics[i][0]);
 692			seq_putc(m, mnemonics[i][1]);
 693			seq_putc(m, ' ');
 694		}
 695	}
 696	seq_putc(m, '\n');
 697}
 698
 699#ifdef CONFIG_HUGETLB_PAGE
 700static int smaps_hugetlb_range(pte_t *pte, unsigned long hmask,
 701				 unsigned long addr, unsigned long end,
 702				 struct mm_walk *walk)
 703{
 704	struct mem_size_stats *mss = walk->private;
 705	struct vm_area_struct *vma = walk->vma;
 706	struct page *page = NULL;
 707
 708	if (pte_present(*pte)) {
 709		page = vm_normal_page(vma, addr, *pte);
 710	} else if (is_swap_pte(*pte)) {
 711		swp_entry_t swpent = pte_to_swp_entry(*pte);
 712
 713		if (is_migration_entry(swpent))
 714			page = migration_entry_to_page(swpent);
 715		else if (is_device_private_entry(swpent))
 716			page = device_private_entry_to_page(swpent);
 717	}
 718	if (page) {
 719		int mapcount = page_mapcount(page);
 720
 721		if (mapcount >= 2)
 722			mss->shared_hugetlb += huge_page_size(hstate_vma(vma));
 723		else
 724			mss->private_hugetlb += huge_page_size(hstate_vma(vma));
 725	}
 726	return 0;
 727}
 
 
 728#endif /* HUGETLB_PAGE */
 729
 730void __weak arch_show_smap(struct seq_file *m, struct vm_area_struct *vma)
 731{
 732}
 
 733
 734#define SEQ_PUT_DEC(str, val) \
 735		seq_put_decimal_ull_width(m, str, (val) >> 10, 8)
 736static int show_smap(struct seq_file *m, void *v, int is_pid)
 737{
 738	struct proc_maps_private *priv = m->private;
 739	struct vm_area_struct *vma = v;
 740	struct mem_size_stats mss_stack;
 741	struct mem_size_stats *mss;
 742	struct mm_walk smaps_walk = {
 743		.pmd_entry = smaps_pte_range,
 744#ifdef CONFIG_HUGETLB_PAGE
 745		.hugetlb_entry = smaps_hugetlb_range,
 746#endif
 747		.mm = vma->vm_mm,
 748	};
 749	int ret = 0;
 750	bool rollup_mode;
 751	bool last_vma;
 752
 753	if (priv->rollup) {
 754		rollup_mode = true;
 755		mss = priv->rollup;
 756		if (mss->first) {
 757			mss->first_vma_start = vma->vm_start;
 758			mss->first = false;
 759		}
 760		last_vma = !m_next_vma(priv, vma);
 761	} else {
 762		rollup_mode = false;
 763		memset(&mss_stack, 0, sizeof(mss_stack));
 764		mss = &mss_stack;
 765	}
 766
 767	smaps_walk.private = mss;
 
 
 768
 769#ifdef CONFIG_SHMEM
 
 
 770	if (vma->vm_file && shmem_mapping(vma->vm_file->f_mapping)) {
 771		/*
 772		 * For shared or readonly shmem mappings we know that all
 773		 * swapped out pages belong to the shmem object, and we can
 774		 * obtain the swap value much more efficiently. For private
 775		 * writable mappings, we might have COW pages that are
 776		 * not affected by the parent swapped out pages of the shmem
 777		 * object, so we have to distinguish them during the page walk.
 778		 * Unless we know that the shmem object (or the part mapped by
 779		 * our VMA) has no swapped out pages at all.
 780		 */
 781		unsigned long shmem_swapped = shmem_swap_usage(vma);
 782
 783		if (!shmem_swapped || (vma->vm_flags & VM_SHARED) ||
 784					!(vma->vm_flags & VM_WRITE)) {
 785			mss->swap = shmem_swapped;
 786		} else {
 787			mss->check_shmem_swap = true;
 788			smaps_walk.pte_hole = smaps_pte_hole;
 789		}
 790	}
 791#endif
 
 
 
 
 
 
 792
 793	/* mmap_sem is held in m_start */
 794	walk_page_vma(vma, &smaps_walk);
 795	if (vma->vm_flags & VM_LOCKED)
 796		mss->pss_locked += mss->pss;
 797
 798	if (!rollup_mode) {
 799		show_map_vma(m, vma, is_pid);
 800	} else if (last_vma) {
 801		show_vma_header_prefix(
 802			m, mss->first_vma_start, vma->vm_end, 0, 0, 0, 0);
 803		seq_pad(m, ' ');
 804		seq_puts(m, "[rollup]\n");
 805	} else {
 806		ret = SEQ_SKIP;
 807	}
 808
 809	if (!rollup_mode) {
 810		SEQ_PUT_DEC("Size:           ", vma->vm_end - vma->vm_start);
 811		SEQ_PUT_DEC(" kB\nKernelPageSize: ", vma_kernel_pagesize(vma));
 812		SEQ_PUT_DEC(" kB\nMMUPageSize:    ", vma_mmu_pagesize(vma));
 813		seq_puts(m, " kB\n");
 814	}
 815
 816	if (!rollup_mode || last_vma) {
 817		SEQ_PUT_DEC("Rss:            ", mss->resident);
 818		SEQ_PUT_DEC(" kB\nPss:            ", mss->pss >> PSS_SHIFT);
 819		SEQ_PUT_DEC(" kB\nShared_Clean:   ", mss->shared_clean);
 820		SEQ_PUT_DEC(" kB\nShared_Dirty:   ", mss->shared_dirty);
 821		SEQ_PUT_DEC(" kB\nPrivate_Clean:  ", mss->private_clean);
 822		SEQ_PUT_DEC(" kB\nPrivate_Dirty:  ", mss->private_dirty);
 823		SEQ_PUT_DEC(" kB\nReferenced:     ", mss->referenced);
 824		SEQ_PUT_DEC(" kB\nAnonymous:      ", mss->anonymous);
 825		SEQ_PUT_DEC(" kB\nLazyFree:       ", mss->lazyfree);
 826		SEQ_PUT_DEC(" kB\nAnonHugePages:  ", mss->anonymous_thp);
 827		SEQ_PUT_DEC(" kB\nShmemPmdMapped: ", mss->shmem_thp);
 828		SEQ_PUT_DEC(" kB\nShared_Hugetlb: ", mss->shared_hugetlb);
 829		seq_put_decimal_ull_width(m, " kB\nPrivate_Hugetlb: ",
 830					  mss->private_hugetlb >> 10, 7);
 831		SEQ_PUT_DEC(" kB\nSwap:           ", mss->swap);
 832		SEQ_PUT_DEC(" kB\nSwapPss:        ",
 833						mss->swap_pss >> PSS_SHIFT);
 834		SEQ_PUT_DEC(" kB\nLocked:         ", mss->pss >> PSS_SHIFT);
 835		seq_puts(m, " kB\n");
 836	}
 837	if (!rollup_mode) {
 838		arch_show_smap(m, vma);
 839		show_smap_vma_flags(m, vma);
 840	}
 841	m_cache_vma(m, vma);
 842	return ret;
 
 
 
 843}
 844#undef SEQ_PUT_DEC
 845
 846static int show_pid_smap(struct seq_file *m, void *v)
 847{
 848	return show_smap(m, v, 1);
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 849}
 850
 851static int show_tid_smap(struct seq_file *m, void *v)
 852{
 853	return show_smap(m, v, 0);
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 854}
 
 855
 856static const struct seq_operations proc_pid_smaps_op = {
 857	.start	= m_start,
 858	.next	= m_next,
 859	.stop	= m_stop,
 860	.show	= show_pid_smap
 861};
 862
 863static const struct seq_operations proc_tid_smaps_op = {
 864	.start	= m_start,
 865	.next	= m_next,
 866	.stop	= m_stop,
 867	.show	= show_tid_smap
 868};
 869
 870static int pid_smaps_open(struct inode *inode, struct file *file)
 871{
 872	return do_maps_open(inode, file, &proc_pid_smaps_op);
 873}
 874
 875static int pid_smaps_rollup_open(struct inode *inode, struct file *file)
 876{
 877	struct seq_file *seq;
 878	struct proc_maps_private *priv;
 879	int ret = do_maps_open(inode, file, &proc_pid_smaps_op);
 880
 881	if (ret < 0)
 882		return ret;
 883	seq = file->private_data;
 884	priv = seq->private;
 885	priv->rollup = kzalloc(sizeof(*priv->rollup), GFP_KERNEL);
 886	if (!priv->rollup) {
 887		proc_map_release(inode, file);
 888		return -ENOMEM;
 
 
 
 
 
 
 
 
 
 
 
 
 889	}
 890	priv->rollup->first = true;
 891	return 0;
 
 
 
 
 892}
 893
 894static int tid_smaps_open(struct inode *inode, struct file *file)
 895{
 896	return do_maps_open(inode, file, &proc_tid_smaps_op);
 
 
 
 
 
 
 
 897}
 898
 899const struct file_operations proc_pid_smaps_operations = {
 900	.open		= pid_smaps_open,
 901	.read		= seq_read,
 902	.llseek		= seq_lseek,
 903	.release	= proc_map_release,
 904};
 905
 906const struct file_operations proc_pid_smaps_rollup_operations = {
 907	.open		= pid_smaps_rollup_open,
 908	.read		= seq_read,
 909	.llseek		= seq_lseek,
 910	.release	= proc_map_release,
 911};
 912
 913const struct file_operations proc_tid_smaps_operations = {
 914	.open		= tid_smaps_open,
 915	.read		= seq_read,
 916	.llseek		= seq_lseek,
 917	.release	= proc_map_release,
 918};
 919
 920enum clear_refs_types {
 921	CLEAR_REFS_ALL = 1,
 922	CLEAR_REFS_ANON,
 923	CLEAR_REFS_MAPPED,
 924	CLEAR_REFS_SOFT_DIRTY,
 925	CLEAR_REFS_MM_HIWATER_RSS,
 926	CLEAR_REFS_LAST,
 927};
 928
 929struct clear_refs_private {
 930	enum clear_refs_types type;
 931};
 932
 933#ifdef CONFIG_MEM_SOFT_DIRTY
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 934static inline void clear_soft_dirty(struct vm_area_struct *vma,
 935		unsigned long addr, pte_t *pte)
 936{
 937	/*
 938	 * The soft-dirty tracker uses #PF-s to catch writes
 939	 * to pages, so write-protect the pte as well. See the
 940	 * Documentation/vm/soft-dirty.txt for full description
 941	 * of how soft-dirty works.
 942	 */
 943	pte_t ptent = *pte;
 944
 945	if (pte_present(ptent)) {
 946		ptent = ptep_modify_prot_start(vma->vm_mm, addr, pte);
 947		ptent = pte_wrprotect(ptent);
 
 
 
 
 948		ptent = pte_clear_soft_dirty(ptent);
 949		ptep_modify_prot_commit(vma->vm_mm, addr, pte, ptent);
 950	} else if (is_swap_pte(ptent)) {
 951		ptent = pte_swp_clear_soft_dirty(ptent);
 952		set_pte_at(vma->vm_mm, addr, pte, ptent);
 953	}
 954}
 955#else
 956static inline void clear_soft_dirty(struct vm_area_struct *vma,
 957		unsigned long addr, pte_t *pte)
 958{
 959}
 960#endif
 961
 962#if defined(CONFIG_MEM_SOFT_DIRTY) && defined(CONFIG_TRANSPARENT_HUGEPAGE)
 963static inline void clear_soft_dirty_pmd(struct vm_area_struct *vma,
 964		unsigned long addr, pmd_t *pmdp)
 965{
 966	pmd_t old, pmd = *pmdp;
 967
 968	if (pmd_present(pmd)) {
 969		/* See comment in change_huge_pmd() */
 970		old = pmdp_invalidate(vma, addr, pmdp);
 971		if (pmd_dirty(old))
 972			pmd = pmd_mkdirty(pmd);
 973		if (pmd_young(old))
 974			pmd = pmd_mkyoung(pmd);
 975
 976		pmd = pmd_wrprotect(pmd);
 977		pmd = pmd_clear_soft_dirty(pmd);
 978
 979		set_pmd_at(vma->vm_mm, addr, pmdp, pmd);
 980	} else if (is_migration_entry(pmd_to_swp_entry(pmd))) {
 981		pmd = pmd_swp_clear_soft_dirty(pmd);
 982		set_pmd_at(vma->vm_mm, addr, pmdp, pmd);
 983	}
 984}
 985#else
 986static inline void clear_soft_dirty_pmd(struct vm_area_struct *vma,
 987		unsigned long addr, pmd_t *pmdp)
 988{
 989}
 990#endif
 991
 992static int clear_refs_pte_range(pmd_t *pmd, unsigned long addr,
 993				unsigned long end, struct mm_walk *walk)
 994{
 995	struct clear_refs_private *cp = walk->private;
 996	struct vm_area_struct *vma = walk->vma;
 997	pte_t *pte, ptent;
 998	spinlock_t *ptl;
 999	struct page *page;
1000
1001	ptl = pmd_trans_huge_lock(pmd, vma);
1002	if (ptl) {
1003		if (cp->type == CLEAR_REFS_SOFT_DIRTY) {
1004			clear_soft_dirty_pmd(vma, addr, pmd);
1005			goto out;
1006		}
1007
1008		if (!pmd_present(*pmd))
1009			goto out;
1010
1011		page = pmd_page(*pmd);
1012
1013		/* Clear accessed and referenced bits. */
1014		pmdp_test_and_clear_young(vma, addr, pmd);
1015		test_and_clear_page_young(page);
1016		ClearPageReferenced(page);
1017out:
1018		spin_unlock(ptl);
1019		return 0;
1020	}
1021
1022	if (pmd_trans_unstable(pmd))
1023		return 0;
1024
1025	pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
1026	for (; addr != end; pte++, addr += PAGE_SIZE) {
1027		ptent = *pte;
1028
1029		if (cp->type == CLEAR_REFS_SOFT_DIRTY) {
1030			clear_soft_dirty(vma, addr, pte);
1031			continue;
1032		}
1033
1034		if (!pte_present(ptent))
1035			continue;
1036
1037		page = vm_normal_page(vma, addr, ptent);
1038		if (!page)
1039			continue;
1040
1041		/* Clear accessed and referenced bits. */
1042		ptep_test_and_clear_young(vma, addr, pte);
1043		test_and_clear_page_young(page);
1044		ClearPageReferenced(page);
1045	}
1046	pte_unmap_unlock(pte - 1, ptl);
1047	cond_resched();
1048	return 0;
1049}
1050
1051static int clear_refs_test_walk(unsigned long start, unsigned long end,
1052				struct mm_walk *walk)
1053{
1054	struct clear_refs_private *cp = walk->private;
1055	struct vm_area_struct *vma = walk->vma;
1056
1057	if (vma->vm_flags & VM_PFNMAP)
1058		return 1;
1059
1060	/*
1061	 * Writing 1 to /proc/pid/clear_refs affects all pages.
1062	 * Writing 2 to /proc/pid/clear_refs only affects anonymous pages.
1063	 * Writing 3 to /proc/pid/clear_refs only affects file mapped pages.
1064	 * Writing 4 to /proc/pid/clear_refs affects all pages.
1065	 */
1066	if (cp->type == CLEAR_REFS_ANON && vma->vm_file)
1067		return 1;
1068	if (cp->type == CLEAR_REFS_MAPPED && !vma->vm_file)
1069		return 1;
1070	return 0;
1071}
1072
 
 
 
 
 
1073static ssize_t clear_refs_write(struct file *file, const char __user *buf,
1074				size_t count, loff_t *ppos)
1075{
1076	struct task_struct *task;
1077	char buffer[PROC_NUMBUF];
1078	struct mm_struct *mm;
1079	struct vm_area_struct *vma;
1080	enum clear_refs_types type;
1081	struct mmu_gather tlb;
1082	int itype;
1083	int rv;
1084
1085	memset(buffer, 0, sizeof(buffer));
1086	if (count > sizeof(buffer) - 1)
1087		count = sizeof(buffer) - 1;
1088	if (copy_from_user(buffer, buf, count))
1089		return -EFAULT;
1090	rv = kstrtoint(strstrip(buffer), 10, &itype);
1091	if (rv < 0)
1092		return rv;
1093	type = (enum clear_refs_types)itype;
1094	if (type < CLEAR_REFS_ALL || type >= CLEAR_REFS_LAST)
1095		return -EINVAL;
1096
1097	task = get_proc_task(file_inode(file));
1098	if (!task)
1099		return -ESRCH;
1100	mm = get_task_mm(task);
1101	if (mm) {
 
1102		struct clear_refs_private cp = {
1103			.type = type,
1104		};
1105		struct mm_walk clear_refs_walk = {
1106			.pmd_entry = clear_refs_pte_range,
1107			.test_walk = clear_refs_test_walk,
1108			.mm = mm,
1109			.private = &cp,
1110		};
1111
 
 
 
 
1112		if (type == CLEAR_REFS_MM_HIWATER_RSS) {
1113			if (down_write_killable(&mm->mmap_sem)) {
1114				count = -EINTR;
1115				goto out_mm;
1116			}
1117
1118			/*
1119			 * Writing 5 to /proc/pid/clear_refs resets the peak
1120			 * resident set size to this mm's current rss value.
1121			 */
1122			reset_mm_hiwater_rss(mm);
1123			up_write(&mm->mmap_sem);
1124			goto out_mm;
1125		}
1126
1127		down_read(&mm->mmap_sem);
1128		tlb_gather_mmu(&tlb, mm, 0, -1);
1129		if (type == CLEAR_REFS_SOFT_DIRTY) {
1130			for (vma = mm->mmap; vma; vma = vma->vm_next) {
1131				if (!(vma->vm_flags & VM_SOFTDIRTY))
1132					continue;
1133				up_read(&mm->mmap_sem);
1134				if (down_write_killable(&mm->mmap_sem)) {
1135					count = -EINTR;
1136					goto out_mm;
1137				}
1138				for (vma = mm->mmap; vma; vma = vma->vm_next) {
1139					vma->vm_flags &= ~VM_SOFTDIRTY;
1140					vma_set_page_prot(vma);
1141				}
1142				downgrade_write(&mm->mmap_sem);
1143				break;
1144			}
1145			mmu_notifier_invalidate_range_start(mm, 0, -1);
 
 
 
 
1146		}
1147		walk_page_range(0, mm->highest_vm_end, &clear_refs_walk);
1148		if (type == CLEAR_REFS_SOFT_DIRTY)
1149			mmu_notifier_invalidate_range_end(mm, 0, -1);
1150		tlb_finish_mmu(&tlb, 0, -1);
1151		up_read(&mm->mmap_sem);
 
 
 
 
1152out_mm:
1153		mmput(mm);
1154	}
1155	put_task_struct(task);
1156
1157	return count;
1158}
1159
1160const struct file_operations proc_clear_refs_operations = {
1161	.write		= clear_refs_write,
1162	.llseek		= noop_llseek,
1163};
1164
1165typedef struct {
1166	u64 pme;
1167} pagemap_entry_t;
1168
1169struct pagemapread {
1170	int pos, len;		/* units: PM_ENTRY_BYTES, not bytes */
1171	pagemap_entry_t *buffer;
1172	bool show_pfn;
1173};
1174
1175#define PAGEMAP_WALK_SIZE	(PMD_SIZE)
1176#define PAGEMAP_WALK_MASK	(PMD_MASK)
1177
1178#define PM_ENTRY_BYTES		sizeof(pagemap_entry_t)
1179#define PM_PFRAME_BITS		55
1180#define PM_PFRAME_MASK		GENMASK_ULL(PM_PFRAME_BITS - 1, 0)
1181#define PM_SOFT_DIRTY		BIT_ULL(55)
1182#define PM_MMAP_EXCLUSIVE	BIT_ULL(56)
 
1183#define PM_FILE			BIT_ULL(61)
1184#define PM_SWAP			BIT_ULL(62)
1185#define PM_PRESENT		BIT_ULL(63)
1186
1187#define PM_END_OF_BUFFER    1
1188
1189static inline pagemap_entry_t make_pme(u64 frame, u64 flags)
1190{
1191	return (pagemap_entry_t) { .pme = (frame & PM_PFRAME_MASK) | flags };
1192}
1193
1194static int add_to_pagemap(unsigned long addr, pagemap_entry_t *pme,
1195			  struct pagemapread *pm)
1196{
1197	pm->buffer[pm->pos++] = *pme;
1198	if (pm->pos >= pm->len)
1199		return PM_END_OF_BUFFER;
1200	return 0;
1201}
1202
1203static int pagemap_pte_hole(unsigned long start, unsigned long end,
1204				struct mm_walk *walk)
1205{
1206	struct pagemapread *pm = walk->private;
1207	unsigned long addr = start;
1208	int err = 0;
1209
1210	while (addr < end) {
1211		struct vm_area_struct *vma = find_vma(walk->mm, addr);
1212		pagemap_entry_t pme = make_pme(0, 0);
1213		/* End of address space hole, which we mark as non-present. */
1214		unsigned long hole_end;
1215
1216		if (vma)
1217			hole_end = min(end, vma->vm_start);
1218		else
1219			hole_end = end;
1220
1221		for (; addr < hole_end; addr += PAGE_SIZE) {
1222			err = add_to_pagemap(addr, &pme, pm);
1223			if (err)
1224				goto out;
1225		}
1226
1227		if (!vma)
1228			break;
1229
1230		/* Addresses in the VMA. */
1231		if (vma->vm_flags & VM_SOFTDIRTY)
1232			pme = make_pme(0, PM_SOFT_DIRTY);
1233		for (; addr < min(end, vma->vm_end); addr += PAGE_SIZE) {
1234			err = add_to_pagemap(addr, &pme, pm);
1235			if (err)
1236				goto out;
1237		}
1238	}
1239out:
1240	return err;
1241}
1242
1243static pagemap_entry_t pte_to_pagemap_entry(struct pagemapread *pm,
1244		struct vm_area_struct *vma, unsigned long addr, pte_t pte)
1245{
1246	u64 frame = 0, flags = 0;
1247	struct page *page = NULL;
1248
1249	if (pte_present(pte)) {
1250		if (pm->show_pfn)
1251			frame = pte_pfn(pte);
1252		flags |= PM_PRESENT;
1253		page = _vm_normal_page(vma, addr, pte, true);
1254		if (pte_soft_dirty(pte))
1255			flags |= PM_SOFT_DIRTY;
 
 
1256	} else if (is_swap_pte(pte)) {
1257		swp_entry_t entry;
1258		if (pte_swp_soft_dirty(pte))
1259			flags |= PM_SOFT_DIRTY;
 
 
1260		entry = pte_to_swp_entry(pte);
1261		frame = swp_type(entry) |
1262			(swp_offset(entry) << MAX_SWAPFILES_SHIFT);
 
1263		flags |= PM_SWAP;
1264		if (is_migration_entry(entry))
1265			page = migration_entry_to_page(entry);
1266
1267		if (is_device_private_entry(entry))
1268			page = device_private_entry_to_page(entry);
1269	}
1270
1271	if (page && !PageAnon(page))
1272		flags |= PM_FILE;
1273	if (page && page_mapcount(page) == 1)
1274		flags |= PM_MMAP_EXCLUSIVE;
1275	if (vma->vm_flags & VM_SOFTDIRTY)
1276		flags |= PM_SOFT_DIRTY;
1277
1278	return make_pme(frame, flags);
1279}
1280
1281static int pagemap_pmd_range(pmd_t *pmdp, unsigned long addr, unsigned long end,
1282			     struct mm_walk *walk)
1283{
1284	struct vm_area_struct *vma = walk->vma;
1285	struct pagemapread *pm = walk->private;
1286	spinlock_t *ptl;
1287	pte_t *pte, *orig_pte;
1288	int err = 0;
1289
1290#ifdef CONFIG_TRANSPARENT_HUGEPAGE
1291	ptl = pmd_trans_huge_lock(pmdp, vma);
1292	if (ptl) {
1293		u64 flags = 0, frame = 0;
1294		pmd_t pmd = *pmdp;
1295		struct page *page = NULL;
1296
1297		if (vma->vm_flags & VM_SOFTDIRTY)
1298			flags |= PM_SOFT_DIRTY;
1299
1300		if (pmd_present(pmd)) {
1301			page = pmd_page(pmd);
1302
1303			flags |= PM_PRESENT;
1304			if (pmd_soft_dirty(pmd))
1305				flags |= PM_SOFT_DIRTY;
 
 
1306			if (pm->show_pfn)
1307				frame = pmd_pfn(pmd) +
1308					((addr & ~PMD_MASK) >> PAGE_SHIFT);
1309		}
1310#ifdef CONFIG_ARCH_ENABLE_THP_MIGRATION
1311		else if (is_swap_pmd(pmd)) {
1312			swp_entry_t entry = pmd_to_swp_entry(pmd);
1313			unsigned long offset = swp_offset(entry);
1314
1315			offset += (addr & ~PMD_MASK) >> PAGE_SHIFT;
1316			frame = swp_type(entry) |
1317				(offset << MAX_SWAPFILES_SHIFT);
 
 
 
1318			flags |= PM_SWAP;
1319			if (pmd_swp_soft_dirty(pmd))
1320				flags |= PM_SOFT_DIRTY;
 
 
1321			VM_BUG_ON(!is_pmd_migration_entry(pmd));
1322			page = migration_entry_to_page(entry);
1323		}
1324#endif
1325
1326		if (page && page_mapcount(page) == 1)
1327			flags |= PM_MMAP_EXCLUSIVE;
1328
1329		for (; addr != end; addr += PAGE_SIZE) {
1330			pagemap_entry_t pme = make_pme(frame, flags);
1331
1332			err = add_to_pagemap(addr, &pme, pm);
1333			if (err)
1334				break;
1335			if (pm->show_pfn && (flags & PM_PRESENT))
1336				frame++;
1337			else if (flags & PM_SWAP)
1338				frame += (1 << MAX_SWAPFILES_SHIFT);
 
 
1339		}
1340		spin_unlock(ptl);
1341		return err;
1342	}
1343
1344	if (pmd_trans_unstable(pmdp))
1345		return 0;
1346#endif /* CONFIG_TRANSPARENT_HUGEPAGE */
1347
1348	/*
1349	 * We can assume that @vma always points to a valid one and @end never
1350	 * goes beyond vma->vm_end.
1351	 */
1352	orig_pte = pte = pte_offset_map_lock(walk->mm, pmdp, addr, &ptl);
1353	for (; addr < end; pte++, addr += PAGE_SIZE) {
1354		pagemap_entry_t pme;
1355
1356		pme = pte_to_pagemap_entry(pm, vma, addr, *pte);
1357		err = add_to_pagemap(addr, &pme, pm);
1358		if (err)
1359			break;
1360	}
1361	pte_unmap_unlock(orig_pte, ptl);
1362
1363	cond_resched();
1364
1365	return err;
1366}
1367
1368#ifdef CONFIG_HUGETLB_PAGE
1369/* This function walks within one hugetlb entry in the single call */
1370static int pagemap_hugetlb_range(pte_t *ptep, unsigned long hmask,
1371				 unsigned long addr, unsigned long end,
1372				 struct mm_walk *walk)
1373{
1374	struct pagemapread *pm = walk->private;
1375	struct vm_area_struct *vma = walk->vma;
1376	u64 flags = 0, frame = 0;
1377	int err = 0;
1378	pte_t pte;
1379
1380	if (vma->vm_flags & VM_SOFTDIRTY)
1381		flags |= PM_SOFT_DIRTY;
1382
1383	pte = huge_ptep_get(ptep);
1384	if (pte_present(pte)) {
1385		struct page *page = pte_page(pte);
1386
1387		if (!PageAnon(page))
1388			flags |= PM_FILE;
1389
1390		if (page_mapcount(page) == 1)
1391			flags |= PM_MMAP_EXCLUSIVE;
1392
1393		flags |= PM_PRESENT;
1394		if (pm->show_pfn)
1395			frame = pte_pfn(pte) +
1396				((addr & ~hmask) >> PAGE_SHIFT);
1397	}
1398
1399	for (; addr != end; addr += PAGE_SIZE) {
1400		pagemap_entry_t pme = make_pme(frame, flags);
1401
1402		err = add_to_pagemap(addr, &pme, pm);
1403		if (err)
1404			return err;
1405		if (pm->show_pfn && (flags & PM_PRESENT))
1406			frame++;
1407	}
1408
1409	cond_resched();
1410
1411	return err;
1412}
 
 
1413#endif /* HUGETLB_PAGE */
1414
 
 
 
 
 
 
1415/*
1416 * /proc/pid/pagemap - an array mapping virtual pages to pfns
1417 *
1418 * For each page in the address space, this file contains one 64-bit entry
1419 * consisting of the following:
1420 *
1421 * Bits 0-54  page frame number (PFN) if present
1422 * Bits 0-4   swap type if swapped
1423 * Bits 5-54  swap offset if swapped
1424 * Bit  55    pte is soft-dirty (see Documentation/vm/soft-dirty.txt)
1425 * Bit  56    page exclusively mapped
1426 * Bits 57-60 zero
1427 * Bit  61    page is file-page or shared-anon
1428 * Bit  62    page swapped
1429 * Bit  63    page present
1430 *
1431 * If the page is not present but in swap, then the PFN contains an
1432 * encoding of the swap file number and the page's offset into the
1433 * swap. Unmapped pages return a null PFN. This allows determining
1434 * precisely which pages are mapped (or in swap) and comparing mapped
1435 * pages between processes.
1436 *
1437 * Efficient users of this interface will use /proc/pid/maps to
1438 * determine which areas of memory are actually mapped and llseek to
1439 * skip over unmapped regions.
1440 */
1441static ssize_t pagemap_read(struct file *file, char __user *buf,
1442			    size_t count, loff_t *ppos)
1443{
1444	struct mm_struct *mm = file->private_data;
1445	struct pagemapread pm;
1446	struct mm_walk pagemap_walk = {};
1447	unsigned long src;
1448	unsigned long svpfn;
1449	unsigned long start_vaddr;
1450	unsigned long end_vaddr;
1451	int ret = 0, copied = 0;
1452
1453	if (!mm || !mmget_not_zero(mm))
1454		goto out;
1455
1456	ret = -EINVAL;
1457	/* file position must be aligned */
1458	if ((*ppos % PM_ENTRY_BYTES) || (count % PM_ENTRY_BYTES))
1459		goto out_mm;
1460
1461	ret = 0;
1462	if (!count)
1463		goto out_mm;
1464
1465	/* do not disclose physical addresses: attack vector */
1466	pm.show_pfn = file_ns_capable(file, &init_user_ns, CAP_SYS_ADMIN);
1467
1468	pm.len = (PAGEMAP_WALK_SIZE >> PAGE_SHIFT);
1469	pm.buffer = kmalloc(pm.len * PM_ENTRY_BYTES, GFP_KERNEL);
1470	ret = -ENOMEM;
1471	if (!pm.buffer)
1472		goto out_mm;
1473
1474	pagemap_walk.pmd_entry = pagemap_pmd_range;
1475	pagemap_walk.pte_hole = pagemap_pte_hole;
1476#ifdef CONFIG_HUGETLB_PAGE
1477	pagemap_walk.hugetlb_entry = pagemap_hugetlb_range;
1478#endif
1479	pagemap_walk.mm = mm;
1480	pagemap_walk.private = &pm;
1481
1482	src = *ppos;
1483	svpfn = src / PM_ENTRY_BYTES;
1484	start_vaddr = svpfn << PAGE_SHIFT;
1485	end_vaddr = mm->task_size;
1486
1487	/* watch out for wraparound */
1488	if (svpfn > mm->task_size >> PAGE_SHIFT)
 
 
 
 
 
1489		start_vaddr = end_vaddr;
1490
1491	/*
1492	 * The odds are that this will stop walking way
1493	 * before end_vaddr, because the length of the
1494	 * user buffer is tracked in "pm", and the walk
1495	 * will stop when we hit the end of the buffer.
1496	 */
1497	ret = 0;
1498	while (count && (start_vaddr < end_vaddr)) {
1499		int len;
1500		unsigned long end;
1501
1502		pm.pos = 0;
1503		end = (start_vaddr + PAGEMAP_WALK_SIZE) & PAGEMAP_WALK_MASK;
1504		/* overflow ? */
1505		if (end < start_vaddr || end > end_vaddr)
1506			end = end_vaddr;
1507		down_read(&mm->mmap_sem);
1508		ret = walk_page_range(start_vaddr, end, &pagemap_walk);
1509		up_read(&mm->mmap_sem);
 
 
1510		start_vaddr = end;
1511
1512		len = min(count, PM_ENTRY_BYTES * pm.pos);
1513		if (copy_to_user(buf, pm.buffer, len)) {
1514			ret = -EFAULT;
1515			goto out_free;
1516		}
1517		copied += len;
1518		buf += len;
1519		count -= len;
1520	}
1521	*ppos += copied;
1522	if (!ret || ret == PM_END_OF_BUFFER)
1523		ret = copied;
1524
1525out_free:
1526	kfree(pm.buffer);
1527out_mm:
1528	mmput(mm);
1529out:
1530	return ret;
1531}
1532
1533static int pagemap_open(struct inode *inode, struct file *file)
1534{
1535	struct mm_struct *mm;
1536
1537	mm = proc_mem_open(inode, PTRACE_MODE_READ);
1538	if (IS_ERR(mm))
1539		return PTR_ERR(mm);
1540	file->private_data = mm;
1541	return 0;
1542}
1543
1544static int pagemap_release(struct inode *inode, struct file *file)
1545{
1546	struct mm_struct *mm = file->private_data;
1547
1548	if (mm)
1549		mmdrop(mm);
1550	return 0;
1551}
1552
1553const struct file_operations proc_pagemap_operations = {
1554	.llseek		= mem_lseek, /* borrow this */
1555	.read		= pagemap_read,
1556	.open		= pagemap_open,
1557	.release	= pagemap_release,
1558};
1559#endif /* CONFIG_PROC_PAGE_MONITOR */
1560
1561#ifdef CONFIG_NUMA
1562
1563struct numa_maps {
1564	unsigned long pages;
1565	unsigned long anon;
1566	unsigned long active;
1567	unsigned long writeback;
1568	unsigned long mapcount_max;
1569	unsigned long dirty;
1570	unsigned long swapcache;
1571	unsigned long node[MAX_NUMNODES];
1572};
1573
1574struct numa_maps_private {
1575	struct proc_maps_private proc_maps;
1576	struct numa_maps md;
1577};
1578
1579static void gather_stats(struct page *page, struct numa_maps *md, int pte_dirty,
1580			unsigned long nr_pages)
1581{
1582	int count = page_mapcount(page);
1583
1584	md->pages += nr_pages;
1585	if (pte_dirty || PageDirty(page))
1586		md->dirty += nr_pages;
1587
1588	if (PageSwapCache(page))
1589		md->swapcache += nr_pages;
1590
1591	if (PageActive(page) || PageUnevictable(page))
1592		md->active += nr_pages;
1593
1594	if (PageWriteback(page))
1595		md->writeback += nr_pages;
1596
1597	if (PageAnon(page))
1598		md->anon += nr_pages;
1599
1600	if (count > md->mapcount_max)
1601		md->mapcount_max = count;
1602
1603	md->node[page_to_nid(page)] += nr_pages;
1604}
1605
1606static struct page *can_gather_numa_stats(pte_t pte, struct vm_area_struct *vma,
1607		unsigned long addr)
1608{
1609	struct page *page;
1610	int nid;
1611
1612	if (!pte_present(pte))
1613		return NULL;
1614
1615	page = vm_normal_page(vma, addr, pte);
1616	if (!page)
1617		return NULL;
1618
1619	if (PageReserved(page))
1620		return NULL;
1621
1622	nid = page_to_nid(page);
1623	if (!node_isset(nid, node_states[N_MEMORY]))
1624		return NULL;
1625
1626	return page;
1627}
1628
1629#ifdef CONFIG_TRANSPARENT_HUGEPAGE
1630static struct page *can_gather_numa_stats_pmd(pmd_t pmd,
1631					      struct vm_area_struct *vma,
1632					      unsigned long addr)
1633{
1634	struct page *page;
1635	int nid;
1636
1637	if (!pmd_present(pmd))
1638		return NULL;
1639
1640	page = vm_normal_page_pmd(vma, addr, pmd);
1641	if (!page)
1642		return NULL;
1643
1644	if (PageReserved(page))
1645		return NULL;
1646
1647	nid = page_to_nid(page);
1648	if (!node_isset(nid, node_states[N_MEMORY]))
1649		return NULL;
1650
1651	return page;
1652}
1653#endif
1654
1655static int gather_pte_stats(pmd_t *pmd, unsigned long addr,
1656		unsigned long end, struct mm_walk *walk)
1657{
1658	struct numa_maps *md = walk->private;
1659	struct vm_area_struct *vma = walk->vma;
1660	spinlock_t *ptl;
1661	pte_t *orig_pte;
1662	pte_t *pte;
1663
1664#ifdef CONFIG_TRANSPARENT_HUGEPAGE
1665	ptl = pmd_trans_huge_lock(pmd, vma);
1666	if (ptl) {
1667		struct page *page;
1668
1669		page = can_gather_numa_stats_pmd(*pmd, vma, addr);
1670		if (page)
1671			gather_stats(page, md, pmd_dirty(*pmd),
1672				     HPAGE_PMD_SIZE/PAGE_SIZE);
1673		spin_unlock(ptl);
1674		return 0;
1675	}
1676
1677	if (pmd_trans_unstable(pmd))
1678		return 0;
1679#endif
1680	orig_pte = pte = pte_offset_map_lock(walk->mm, pmd, addr, &ptl);
1681	do {
1682		struct page *page = can_gather_numa_stats(*pte, vma, addr);
1683		if (!page)
1684			continue;
1685		gather_stats(page, md, pte_dirty(*pte), 1);
1686
1687	} while (pte++, addr += PAGE_SIZE, addr != end);
1688	pte_unmap_unlock(orig_pte, ptl);
1689	cond_resched();
1690	return 0;
1691}
1692#ifdef CONFIG_HUGETLB_PAGE
1693static int gather_hugetlb_stats(pte_t *pte, unsigned long hmask,
1694		unsigned long addr, unsigned long end, struct mm_walk *walk)
1695{
1696	pte_t huge_pte = huge_ptep_get(pte);
1697	struct numa_maps *md;
1698	struct page *page;
1699
1700	if (!pte_present(huge_pte))
1701		return 0;
1702
1703	page = pte_page(huge_pte);
1704	if (!page)
1705		return 0;
1706
1707	md = walk->private;
1708	gather_stats(page, md, pte_dirty(huge_pte), 1);
1709	return 0;
1710}
1711
1712#else
1713static int gather_hugetlb_stats(pte_t *pte, unsigned long hmask,
1714		unsigned long addr, unsigned long end, struct mm_walk *walk)
1715{
1716	return 0;
1717}
1718#endif
1719
 
 
 
 
 
1720/*
1721 * Display pages allocated per node and memory policy via /proc.
1722 */
1723static int show_numa_map(struct seq_file *m, void *v, int is_pid)
1724{
1725	struct numa_maps_private *numa_priv = m->private;
1726	struct proc_maps_private *proc_priv = &numa_priv->proc_maps;
1727	struct vm_area_struct *vma = v;
1728	struct numa_maps *md = &numa_priv->md;
1729	struct file *file = vma->vm_file;
1730	struct mm_struct *mm = vma->vm_mm;
1731	struct mm_walk walk = {
1732		.hugetlb_entry = gather_hugetlb_stats,
1733		.pmd_entry = gather_pte_stats,
1734		.private = md,
1735		.mm = mm,
1736	};
1737	struct mempolicy *pol;
1738	char buffer[64];
1739	int nid;
1740
1741	if (!mm)
1742		return 0;
1743
1744	/* Ensure we start with an empty set of numa_maps statistics. */
1745	memset(md, 0, sizeof(*md));
1746
1747	pol = __get_vma_policy(vma, vma->vm_start);
1748	if (pol) {
1749		mpol_to_str(buffer, sizeof(buffer), pol);
1750		mpol_cond_put(pol);
1751	} else {
1752		mpol_to_str(buffer, sizeof(buffer), proc_priv->task_mempolicy);
1753	}
1754
1755	seq_printf(m, "%08lx %s", vma->vm_start, buffer);
1756
1757	if (file) {
1758		seq_puts(m, " file=");
1759		seq_file_path(m, file, "\n\t= ");
1760	} else if (vma->vm_start <= mm->brk && vma->vm_end >= mm->start_brk) {
1761		seq_puts(m, " heap");
1762	} else if (is_stack(vma)) {
1763		seq_puts(m, " stack");
1764	}
1765
1766	if (is_vm_hugetlb_page(vma))
1767		seq_puts(m, " huge");
1768
1769	/* mmap_sem is held by m_start */
1770	walk_page_vma(vma, &walk);
1771
1772	if (!md->pages)
1773		goto out;
1774
1775	if (md->anon)
1776		seq_printf(m, " anon=%lu", md->anon);
1777
1778	if (md->dirty)
1779		seq_printf(m, " dirty=%lu", md->dirty);
1780
1781	if (md->pages != md->anon && md->pages != md->dirty)
1782		seq_printf(m, " mapped=%lu", md->pages);
1783
1784	if (md->mapcount_max > 1)
1785		seq_printf(m, " mapmax=%lu", md->mapcount_max);
1786
1787	if (md->swapcache)
1788		seq_printf(m, " swapcache=%lu", md->swapcache);
1789
1790	if (md->active < md->pages && !is_vm_hugetlb_page(vma))
1791		seq_printf(m, " active=%lu", md->active);
1792
1793	if (md->writeback)
1794		seq_printf(m, " writeback=%lu", md->writeback);
1795
1796	for_each_node_state(nid, N_MEMORY)
1797		if (md->node[nid])
1798			seq_printf(m, " N%d=%lu", nid, md->node[nid]);
1799
1800	seq_printf(m, " kernelpagesize_kB=%lu", vma_kernel_pagesize(vma) >> 10);
1801out:
1802	seq_putc(m, '\n');
1803	m_cache_vma(m, vma);
1804	return 0;
1805}
1806
1807static int show_pid_numa_map(struct seq_file *m, void *v)
1808{
1809	return show_numa_map(m, v, 1);
1810}
1811
1812static int show_tid_numa_map(struct seq_file *m, void *v)
1813{
1814	return show_numa_map(m, v, 0);
1815}
1816
1817static const struct seq_operations proc_pid_numa_maps_op = {
1818	.start  = m_start,
1819	.next   = m_next,
1820	.stop   = m_stop,
1821	.show   = show_pid_numa_map,
1822};
1823
1824static const struct seq_operations proc_tid_numa_maps_op = {
1825	.start  = m_start,
1826	.next   = m_next,
1827	.stop   = m_stop,
1828	.show   = show_tid_numa_map,
1829};
1830
1831static int numa_maps_open(struct inode *inode, struct file *file,
1832			  const struct seq_operations *ops)
1833{
1834	return proc_maps_open(inode, file, ops,
1835				sizeof(struct numa_maps_private));
1836}
1837
1838static int pid_numa_maps_open(struct inode *inode, struct file *file)
1839{
1840	return numa_maps_open(inode, file, &proc_pid_numa_maps_op);
1841}
1842
1843static int tid_numa_maps_open(struct inode *inode, struct file *file)
1844{
1845	return numa_maps_open(inode, file, &proc_tid_numa_maps_op);
1846}
1847
1848const struct file_operations proc_pid_numa_maps_operations = {
1849	.open		= pid_numa_maps_open,
1850	.read		= seq_read,
1851	.llseek		= seq_lseek,
1852	.release	= proc_map_release,
1853};
1854
1855const struct file_operations proc_tid_numa_maps_operations = {
1856	.open		= tid_numa_maps_open,
1857	.read		= seq_read,
1858	.llseek		= seq_lseek,
1859	.release	= proc_map_release,
1860};
1861#endif /* CONFIG_NUMA */
v5.14.15
   1// SPDX-License-Identifier: GPL-2.0
   2#include <linux/pagewalk.h>
   3#include <linux/vmacache.h>
   4#include <linux/hugetlb.h>
   5#include <linux/huge_mm.h>
   6#include <linux/mount.h>
   7#include <linux/seq_file.h>
   8#include <linux/highmem.h>
   9#include <linux/ptrace.h>
  10#include <linux/slab.h>
  11#include <linux/pagemap.h>
  12#include <linux/mempolicy.h>
  13#include <linux/rmap.h>
  14#include <linux/swap.h>
  15#include <linux/sched/mm.h>
  16#include <linux/swapops.h>
  17#include <linux/mmu_notifier.h>
  18#include <linux/page_idle.h>
  19#include <linux/shmem_fs.h>
  20#include <linux/uaccess.h>
  21#include <linux/pkeys.h>
  22
  23#include <asm/elf.h>
  24#include <asm/tlb.h>
  25#include <asm/tlbflush.h>
  26#include "internal.h"
  27
  28#define SEQ_PUT_DEC(str, val) \
  29		seq_put_decimal_ull_width(m, str, (val) << (PAGE_SHIFT-10), 8)
  30void task_mem(struct seq_file *m, struct mm_struct *mm)
  31{
  32	unsigned long text, lib, swap, anon, file, shmem;
  33	unsigned long hiwater_vm, total_vm, hiwater_rss, total_rss;
  34
  35	anon = get_mm_counter(mm, MM_ANONPAGES);
  36	file = get_mm_counter(mm, MM_FILEPAGES);
  37	shmem = get_mm_counter(mm, MM_SHMEMPAGES);
  38
  39	/*
  40	 * Note: to minimize their overhead, mm maintains hiwater_vm and
  41	 * hiwater_rss only when about to *lower* total_vm or rss.  Any
  42	 * collector of these hiwater stats must therefore get total_vm
  43	 * and rss too, which will usually be the higher.  Barriers? not
  44	 * worth the effort, such snapshots can always be inconsistent.
  45	 */
  46	hiwater_vm = total_vm = mm->total_vm;
  47	if (hiwater_vm < mm->hiwater_vm)
  48		hiwater_vm = mm->hiwater_vm;
  49	hiwater_rss = total_rss = anon + file + shmem;
  50	if (hiwater_rss < mm->hiwater_rss)
  51		hiwater_rss = mm->hiwater_rss;
  52
  53	/* split executable areas between text and lib */
  54	text = PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK);
  55	text = min(text, mm->exec_vm << PAGE_SHIFT);
  56	lib = (mm->exec_vm << PAGE_SHIFT) - text;
  57
  58	swap = get_mm_counter(mm, MM_SWAPENTS);
  59	SEQ_PUT_DEC("VmPeak:\t", hiwater_vm);
  60	SEQ_PUT_DEC(" kB\nVmSize:\t", total_vm);
  61	SEQ_PUT_DEC(" kB\nVmLck:\t", mm->locked_vm);
  62	SEQ_PUT_DEC(" kB\nVmPin:\t", atomic64_read(&mm->pinned_vm));
  63	SEQ_PUT_DEC(" kB\nVmHWM:\t", hiwater_rss);
  64	SEQ_PUT_DEC(" kB\nVmRSS:\t", total_rss);
  65	SEQ_PUT_DEC(" kB\nRssAnon:\t", anon);
  66	SEQ_PUT_DEC(" kB\nRssFile:\t", file);
  67	SEQ_PUT_DEC(" kB\nRssShmem:\t", shmem);
  68	SEQ_PUT_DEC(" kB\nVmData:\t", mm->data_vm);
  69	SEQ_PUT_DEC(" kB\nVmStk:\t", mm->stack_vm);
  70	seq_put_decimal_ull_width(m,
  71		    " kB\nVmExe:\t", text >> 10, 8);
  72	seq_put_decimal_ull_width(m,
  73		    " kB\nVmLib:\t", lib >> 10, 8);
  74	seq_put_decimal_ull_width(m,
  75		    " kB\nVmPTE:\t", mm_pgtables_bytes(mm) >> 10, 8);
  76	SEQ_PUT_DEC(" kB\nVmSwap:\t", swap);
  77	seq_puts(m, " kB\n");
  78	hugetlb_report_usage(m, mm);
  79}
  80#undef SEQ_PUT_DEC
  81
  82unsigned long task_vsize(struct mm_struct *mm)
  83{
  84	return PAGE_SIZE * mm->total_vm;
  85}
  86
  87unsigned long task_statm(struct mm_struct *mm,
  88			 unsigned long *shared, unsigned long *text,
  89			 unsigned long *data, unsigned long *resident)
  90{
  91	*shared = get_mm_counter(mm, MM_FILEPAGES) +
  92			get_mm_counter(mm, MM_SHMEMPAGES);
  93	*text = (PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK))
  94								>> PAGE_SHIFT;
  95	*data = mm->data_vm + mm->stack_vm;
  96	*resident = *shared + get_mm_counter(mm, MM_ANONPAGES);
  97	return mm->total_vm;
  98}
  99
 100#ifdef CONFIG_NUMA
 101/*
 102 * Save get_task_policy() for show_numa_map().
 103 */
 104static void hold_task_mempolicy(struct proc_maps_private *priv)
 105{
 106	struct task_struct *task = priv->task;
 107
 108	task_lock(task);
 109	priv->task_mempolicy = get_task_policy(task);
 110	mpol_get(priv->task_mempolicy);
 111	task_unlock(task);
 112}
 113static void release_task_mempolicy(struct proc_maps_private *priv)
 114{
 115	mpol_put(priv->task_mempolicy);
 116}
 117#else
 118static void hold_task_mempolicy(struct proc_maps_private *priv)
 119{
 120}
 121static void release_task_mempolicy(struct proc_maps_private *priv)
 122{
 123}
 124#endif
 125
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 126static void *m_start(struct seq_file *m, loff_t *ppos)
 127{
 128	struct proc_maps_private *priv = m->private;
 129	unsigned long last_addr = *ppos;
 130	struct mm_struct *mm;
 131	struct vm_area_struct *vma;
 
 132
 133	/* See m_next(). Zero at the start or after lseek. */
 134	if (last_addr == -1UL)
 135		return NULL;
 136
 137	priv->task = get_proc_task(priv->inode);
 138	if (!priv->task)
 139		return ERR_PTR(-ESRCH);
 140
 141	mm = priv->mm;
 142	if (!mm || !mmget_not_zero(mm)) {
 143		put_task_struct(priv->task);
 144		priv->task = NULL;
 145		return NULL;
 146	}
 147
 148	if (mmap_read_lock_killable(mm)) {
 149		mmput(mm);
 150		put_task_struct(priv->task);
 151		priv->task = NULL;
 152		return ERR_PTR(-EINTR);
 153	}
 154
 
 155	hold_task_mempolicy(priv);
 156	priv->tail_vma = get_gate_vma(mm);
 157
 158	vma = find_vma(mm, last_addr);
 159	if (vma)
 
 
 
 
 
 
 
 
 
 
 
 
 160		return vma;
 
 161
 162	return priv->tail_vma;
 
 
 
 
 
 163}
 164
 165static void *m_next(struct seq_file *m, void *v, loff_t *ppos)
 166{
 167	struct proc_maps_private *priv = m->private;
 168	struct vm_area_struct *next, *vma = v;
 169
 170	if (vma == priv->tail_vma)
 171		next = NULL;
 172	else if (vma->vm_next)
 173		next = vma->vm_next;
 174	else
 175		next = priv->tail_vma;
 176
 177	*ppos = next ? next->vm_start : -1UL;
 178
 
 
 
 
 179	return next;
 180}
 181
 182static void m_stop(struct seq_file *m, void *v)
 183{
 184	struct proc_maps_private *priv = m->private;
 185	struct mm_struct *mm = priv->mm;
 186
 187	if (!priv->task)
 188		return;
 189
 190	release_task_mempolicy(priv);
 191	mmap_read_unlock(mm);
 192	mmput(mm);
 193	put_task_struct(priv->task);
 194	priv->task = NULL;
 195}
 196
 197static int proc_maps_open(struct inode *inode, struct file *file,
 198			const struct seq_operations *ops, int psize)
 199{
 200	struct proc_maps_private *priv = __seq_open_private(file, ops, psize);
 201
 202	if (!priv)
 203		return -ENOMEM;
 204
 205	priv->inode = inode;
 206	priv->mm = proc_mem_open(inode, PTRACE_MODE_READ);
 207	if (IS_ERR(priv->mm)) {
 208		int err = PTR_ERR(priv->mm);
 209
 210		seq_release_private(inode, file);
 211		return err;
 212	}
 213
 214	return 0;
 215}
 216
 217static int proc_map_release(struct inode *inode, struct file *file)
 218{
 219	struct seq_file *seq = file->private_data;
 220	struct proc_maps_private *priv = seq->private;
 221
 222	if (priv->mm)
 223		mmdrop(priv->mm);
 224
 
 225	return seq_release_private(inode, file);
 226}
 227
 228static int do_maps_open(struct inode *inode, struct file *file,
 229			const struct seq_operations *ops)
 230{
 231	return proc_maps_open(inode, file, ops,
 232				sizeof(struct proc_maps_private));
 233}
 234
 235/*
 236 * Indicate if the VMA is a stack for the given task; for
 237 * /proc/PID/maps that is the stack of the main task.
 238 */
 239static int is_stack(struct vm_area_struct *vma)
 240{
 241	/*
 242	 * We make no effort to guess what a given thread considers to be
 243	 * its "stack".  It's not even well-defined for programs written
 244	 * languages like Go.
 245	 */
 246	return vma->vm_start <= vma->vm_mm->start_stack &&
 247		vma->vm_end >= vma->vm_mm->start_stack;
 248}
 249
 250static void show_vma_header_prefix(struct seq_file *m,
 251				   unsigned long start, unsigned long end,
 252				   vm_flags_t flags, unsigned long long pgoff,
 253				   dev_t dev, unsigned long ino)
 254{
 255	seq_setwidth(m, 25 + sizeof(void *) * 6 - 1);
 256	seq_put_hex_ll(m, NULL, start, 8);
 257	seq_put_hex_ll(m, "-", end, 8);
 258	seq_putc(m, ' ');
 259	seq_putc(m, flags & VM_READ ? 'r' : '-');
 260	seq_putc(m, flags & VM_WRITE ? 'w' : '-');
 261	seq_putc(m, flags & VM_EXEC ? 'x' : '-');
 262	seq_putc(m, flags & VM_MAYSHARE ? 's' : 'p');
 263	seq_put_hex_ll(m, " ", pgoff, 8);
 264	seq_put_hex_ll(m, " ", MAJOR(dev), 2);
 265	seq_put_hex_ll(m, ":", MINOR(dev), 2);
 266	seq_put_decimal_ull(m, " ", ino);
 267	seq_putc(m, ' ');
 268}
 269
 270static void
 271show_map_vma(struct seq_file *m, struct vm_area_struct *vma)
 272{
 273	struct mm_struct *mm = vma->vm_mm;
 274	struct file *file = vma->vm_file;
 275	vm_flags_t flags = vma->vm_flags;
 276	unsigned long ino = 0;
 277	unsigned long long pgoff = 0;
 278	unsigned long start, end;
 279	dev_t dev = 0;
 280	const char *name = NULL;
 281
 282	if (file) {
 283		struct inode *inode = file_inode(vma->vm_file);
 284		dev = inode->i_sb->s_dev;
 285		ino = inode->i_ino;
 286		pgoff = ((loff_t)vma->vm_pgoff) << PAGE_SHIFT;
 287	}
 288
 289	start = vma->vm_start;
 290	end = vma->vm_end;
 291	show_vma_header_prefix(m, start, end, flags, pgoff, dev, ino);
 292
 293	/*
 294	 * Print the dentry name for named mappings, and a
 295	 * special [heap] marker for the heap:
 296	 */
 297	if (file) {
 298		seq_pad(m, ' ');
 299		seq_file_path(m, file, "\n");
 300		goto done;
 301	}
 302
 303	if (vma->vm_ops && vma->vm_ops->name) {
 304		name = vma->vm_ops->name(vma);
 305		if (name)
 306			goto done;
 307	}
 308
 309	name = arch_vma_name(vma);
 310	if (!name) {
 311		if (!mm) {
 312			name = "[vdso]";
 313			goto done;
 314		}
 315
 316		if (vma->vm_start <= mm->brk &&
 317		    vma->vm_end >= mm->start_brk) {
 318			name = "[heap]";
 319			goto done;
 320		}
 321
 322		if (is_stack(vma))
 323			name = "[stack]";
 324	}
 325
 326done:
 327	if (name) {
 328		seq_pad(m, ' ');
 329		seq_puts(m, name);
 330	}
 331	seq_putc(m, '\n');
 332}
 333
 334static int show_map(struct seq_file *m, void *v)
 335{
 336	show_map_vma(m, v);
 
 337	return 0;
 338}
 339
 
 
 
 
 
 
 
 
 
 
 340static const struct seq_operations proc_pid_maps_op = {
 341	.start	= m_start,
 342	.next	= m_next,
 343	.stop	= m_stop,
 344	.show	= show_map
 
 
 
 
 
 
 
 345};
 346
 347static int pid_maps_open(struct inode *inode, struct file *file)
 348{
 349	return do_maps_open(inode, file, &proc_pid_maps_op);
 350}
 351
 
 
 
 
 
 352const struct file_operations proc_pid_maps_operations = {
 353	.open		= pid_maps_open,
 354	.read		= seq_read,
 355	.llseek		= seq_lseek,
 356	.release	= proc_map_release,
 357};
 358
 
 
 
 
 
 
 
 359/*
 360 * Proportional Set Size(PSS): my share of RSS.
 361 *
 362 * PSS of a process is the count of pages it has in memory, where each
 363 * page is divided by the number of processes sharing it.  So if a
 364 * process has 1000 pages all to itself, and 1000 shared with one other
 365 * process, its PSS will be 1500.
 366 *
 367 * To keep (accumulated) division errors low, we adopt a 64bit
 368 * fixed-point pss counter to minimize division errors. So (pss >>
 369 * PSS_SHIFT) would be the real byte count.
 370 *
 371 * A shift of 12 before division means (assuming 4K page size):
 372 * 	- 1M 3-user-pages add up to 8KB errors;
 373 * 	- supports mapcount up to 2^24, or 16M;
 374 * 	- supports PSS up to 2^52 bytes, or 4PB.
 375 */
 376#define PSS_SHIFT 12
 377
 378#ifdef CONFIG_PROC_PAGE_MONITOR
 379struct mem_size_stats {
 
 380	unsigned long resident;
 381	unsigned long shared_clean;
 382	unsigned long shared_dirty;
 383	unsigned long private_clean;
 384	unsigned long private_dirty;
 385	unsigned long referenced;
 386	unsigned long anonymous;
 387	unsigned long lazyfree;
 388	unsigned long anonymous_thp;
 389	unsigned long shmem_thp;
 390	unsigned long file_thp;
 391	unsigned long swap;
 392	unsigned long shared_hugetlb;
 393	unsigned long private_hugetlb;
 
 394	u64 pss;
 395	u64 pss_anon;
 396	u64 pss_file;
 397	u64 pss_shmem;
 398	u64 pss_locked;
 399	u64 swap_pss;
 400	bool check_shmem_swap;
 401};
 402
 403static void smaps_page_accumulate(struct mem_size_stats *mss,
 404		struct page *page, unsigned long size, unsigned long pss,
 405		bool dirty, bool locked, bool private)
 406{
 407	mss->pss += pss;
 408
 409	if (PageAnon(page))
 410		mss->pss_anon += pss;
 411	else if (PageSwapBacked(page))
 412		mss->pss_shmem += pss;
 413	else
 414		mss->pss_file += pss;
 415
 416	if (locked)
 417		mss->pss_locked += pss;
 418
 419	if (dirty || PageDirty(page)) {
 420		if (private)
 421			mss->private_dirty += size;
 422		else
 423			mss->shared_dirty += size;
 424	} else {
 425		if (private)
 426			mss->private_clean += size;
 427		else
 428			mss->shared_clean += size;
 429	}
 430}
 431
 432static void smaps_account(struct mem_size_stats *mss, struct page *page,
 433		bool compound, bool young, bool dirty, bool locked)
 434{
 435	int i, nr = compound ? compound_nr(page) : 1;
 436	unsigned long size = nr * PAGE_SIZE;
 437
 438	/*
 439	 * First accumulate quantities that depend only on |size| and the type
 440	 * of the compound page.
 441	 */
 442	if (PageAnon(page)) {
 443		mss->anonymous += size;
 444		if (!PageSwapBacked(page) && !dirty && !PageDirty(page))
 445			mss->lazyfree += size;
 446	}
 447
 448	mss->resident += size;
 449	/* Accumulate the size in pages that have been accessed. */
 450	if (young || page_is_young(page) || PageReferenced(page))
 451		mss->referenced += size;
 452
 453	/*
 454	 * Then accumulate quantities that may depend on sharing, or that may
 455	 * differ page-by-page.
 456	 *
 457	 * page_count(page) == 1 guarantees the page is mapped exactly once.
 458	 * If any subpage of the compound page mapped with PTE it would elevate
 459	 * page_count().
 460	 */
 461	if (page_count(page) == 1) {
 462		smaps_page_accumulate(mss, page, size, size << PSS_SHIFT, dirty,
 463			locked, true);
 
 
 
 464		return;
 465	}
 
 466	for (i = 0; i < nr; i++, page++) {
 467		int mapcount = page_mapcount(page);
 468		unsigned long pss = PAGE_SIZE << PSS_SHIFT;
 469		if (mapcount >= 2)
 470			pss /= mapcount;
 471		smaps_page_accumulate(mss, page, PAGE_SIZE, pss, dirty, locked,
 472				      mapcount < 2);
 
 
 
 
 
 
 
 
 
 473	}
 474}
 475
 476#ifdef CONFIG_SHMEM
 477static int smaps_pte_hole(unsigned long addr, unsigned long end,
 478			  __always_unused int depth, struct mm_walk *walk)
 479{
 480	struct mem_size_stats *mss = walk->private;
 481
 482	mss->swap += shmem_partial_swap_usage(
 483			walk->vma->vm_file->f_mapping, addr, end);
 484
 485	return 0;
 486}
 487#else
 488#define smaps_pte_hole		NULL
 489#endif /* CONFIG_SHMEM */
 490
 491static void smaps_pte_entry(pte_t *pte, unsigned long addr,
 492		struct mm_walk *walk)
 493{
 494	struct mem_size_stats *mss = walk->private;
 495	struct vm_area_struct *vma = walk->vma;
 496	bool locked = !!(vma->vm_flags & VM_LOCKED);
 497	struct page *page = NULL;
 498
 499	if (pte_present(*pte)) {
 500		page = vm_normal_page(vma, addr, *pte);
 501	} else if (is_swap_pte(*pte)) {
 502		swp_entry_t swpent = pte_to_swp_entry(*pte);
 503
 504		if (!non_swap_entry(swpent)) {
 505			int mapcount;
 506
 507			mss->swap += PAGE_SIZE;
 508			mapcount = swp_swapcount(swpent);
 509			if (mapcount >= 2) {
 510				u64 pss_delta = (u64)PAGE_SIZE << PSS_SHIFT;
 511
 512				do_div(pss_delta, mapcount);
 513				mss->swap_pss += pss_delta;
 514			} else {
 515				mss->swap_pss += (u64)PAGE_SIZE << PSS_SHIFT;
 516			}
 517		} else if (is_pfn_swap_entry(swpent))
 518			page = pfn_swap_entry_to_page(swpent);
 
 
 519	} else if (unlikely(IS_ENABLED(CONFIG_SHMEM) && mss->check_shmem_swap
 520							&& pte_none(*pte))) {
 521		page = xa_load(&vma->vm_file->f_mapping->i_pages,
 522						linear_page_index(vma, addr));
 523		if (xa_is_value(page))
 
 
 
 524			mss->swap += PAGE_SIZE;
 
 
 
 525		return;
 526	}
 527
 528	if (!page)
 529		return;
 530
 531	smaps_account(mss, page, false, pte_young(*pte), pte_dirty(*pte), locked);
 532}
 533
 534#ifdef CONFIG_TRANSPARENT_HUGEPAGE
 535static void smaps_pmd_entry(pmd_t *pmd, unsigned long addr,
 536		struct mm_walk *walk)
 537{
 538	struct mem_size_stats *mss = walk->private;
 539	struct vm_area_struct *vma = walk->vma;
 540	bool locked = !!(vma->vm_flags & VM_LOCKED);
 541	struct page *page = NULL;
 542
 543	if (pmd_present(*pmd)) {
 544		/* FOLL_DUMP will return -EFAULT on huge zero page */
 545		page = follow_trans_huge_pmd(vma, addr, pmd, FOLL_DUMP);
 546	} else if (unlikely(thp_migration_supported() && is_swap_pmd(*pmd))) {
 547		swp_entry_t entry = pmd_to_swp_entry(*pmd);
 548
 549		if (is_migration_entry(entry))
 550			page = pfn_swap_entry_to_page(entry);
 551	}
 552	if (IS_ERR_OR_NULL(page))
 553		return;
 554	if (PageAnon(page))
 555		mss->anonymous_thp += HPAGE_PMD_SIZE;
 556	else if (PageSwapBacked(page))
 557		mss->shmem_thp += HPAGE_PMD_SIZE;
 558	else if (is_zone_device_page(page))
 559		/* pass */;
 560	else
 561		mss->file_thp += HPAGE_PMD_SIZE;
 562	smaps_account(mss, page, true, pmd_young(*pmd), pmd_dirty(*pmd), locked);
 563}
 564#else
 565static void smaps_pmd_entry(pmd_t *pmd, unsigned long addr,
 566		struct mm_walk *walk)
 567{
 568}
 569#endif
 570
 571static int smaps_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end,
 572			   struct mm_walk *walk)
 573{
 574	struct vm_area_struct *vma = walk->vma;
 575	pte_t *pte;
 576	spinlock_t *ptl;
 577
 578	ptl = pmd_trans_huge_lock(pmd, vma);
 579	if (ptl) {
 580		smaps_pmd_entry(pmd, addr, walk);
 
 581		spin_unlock(ptl);
 582		goto out;
 583	}
 584
 585	if (pmd_trans_unstable(pmd))
 586		goto out;
 587	/*
 588	 * The mmap_lock held all the way back in m_start() is what
 589	 * keeps khugepaged out of here and from collapsing things
 590	 * in here.
 591	 */
 592	pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
 593	for (; addr != end; pte++, addr += PAGE_SIZE)
 594		smaps_pte_entry(pte, addr, walk);
 595	pte_unmap_unlock(pte - 1, ptl);
 596out:
 597	cond_resched();
 598	return 0;
 599}
 600
 601static void show_smap_vma_flags(struct seq_file *m, struct vm_area_struct *vma)
 602{
 603	/*
 604	 * Don't forget to update Documentation/ on changes.
 605	 */
 606	static const char mnemonics[BITS_PER_LONG][2] = {
 607		/*
 608		 * In case if we meet a flag we don't know about.
 609		 */
 610		[0 ... (BITS_PER_LONG-1)] = "??",
 611
 612		[ilog2(VM_READ)]	= "rd",
 613		[ilog2(VM_WRITE)]	= "wr",
 614		[ilog2(VM_EXEC)]	= "ex",
 615		[ilog2(VM_SHARED)]	= "sh",
 616		[ilog2(VM_MAYREAD)]	= "mr",
 617		[ilog2(VM_MAYWRITE)]	= "mw",
 618		[ilog2(VM_MAYEXEC)]	= "me",
 619		[ilog2(VM_MAYSHARE)]	= "ms",
 620		[ilog2(VM_GROWSDOWN)]	= "gd",
 621		[ilog2(VM_PFNMAP)]	= "pf",
 622		[ilog2(VM_DENYWRITE)]	= "dw",
 
 
 
 623		[ilog2(VM_LOCKED)]	= "lo",
 624		[ilog2(VM_IO)]		= "io",
 625		[ilog2(VM_SEQ_READ)]	= "sr",
 626		[ilog2(VM_RAND_READ)]	= "rr",
 627		[ilog2(VM_DONTCOPY)]	= "dc",
 628		[ilog2(VM_DONTEXPAND)]	= "de",
 629		[ilog2(VM_ACCOUNT)]	= "ac",
 630		[ilog2(VM_NORESERVE)]	= "nr",
 631		[ilog2(VM_HUGETLB)]	= "ht",
 632		[ilog2(VM_SYNC)]	= "sf",
 633		[ilog2(VM_ARCH_1)]	= "ar",
 634		[ilog2(VM_WIPEONFORK)]	= "wf",
 635		[ilog2(VM_DONTDUMP)]	= "dd",
 636#ifdef CONFIG_ARM64_BTI
 637		[ilog2(VM_ARM64_BTI)]	= "bt",
 638#endif
 639#ifdef CONFIG_MEM_SOFT_DIRTY
 640		[ilog2(VM_SOFTDIRTY)]	= "sd",
 641#endif
 642		[ilog2(VM_MIXEDMAP)]	= "mm",
 643		[ilog2(VM_HUGEPAGE)]	= "hg",
 644		[ilog2(VM_NOHUGEPAGE)]	= "nh",
 645		[ilog2(VM_MERGEABLE)]	= "mg",
 646		[ilog2(VM_UFFD_MISSING)]= "um",
 647		[ilog2(VM_UFFD_WP)]	= "uw",
 648#ifdef CONFIG_ARM64_MTE
 649		[ilog2(VM_MTE)]		= "mt",
 650		[ilog2(VM_MTE_ALLOWED)]	= "",
 651#endif
 652#ifdef CONFIG_ARCH_HAS_PKEYS
 653		/* These come out via ProtectionKey: */
 654		[ilog2(VM_PKEY_BIT0)]	= "",
 655		[ilog2(VM_PKEY_BIT1)]	= "",
 656		[ilog2(VM_PKEY_BIT2)]	= "",
 657		[ilog2(VM_PKEY_BIT3)]	= "",
 658#if VM_PKEY_BIT4
 659		[ilog2(VM_PKEY_BIT4)]	= "",
 660#endif
 661#endif /* CONFIG_ARCH_HAS_PKEYS */
 662#ifdef CONFIG_HAVE_ARCH_USERFAULTFD_MINOR
 663		[ilog2(VM_UFFD_MINOR)]	= "ui",
 664#endif /* CONFIG_HAVE_ARCH_USERFAULTFD_MINOR */
 665	};
 666	size_t i;
 667
 668	seq_puts(m, "VmFlags: ");
 669	for (i = 0; i < BITS_PER_LONG; i++) {
 670		if (!mnemonics[i][0])
 671			continue;
 672		if (vma->vm_flags & (1UL << i)) {
 673			seq_putc(m, mnemonics[i][0]);
 674			seq_putc(m, mnemonics[i][1]);
 675			seq_putc(m, ' ');
 676		}
 677	}
 678	seq_putc(m, '\n');
 679}
 680
 681#ifdef CONFIG_HUGETLB_PAGE
 682static int smaps_hugetlb_range(pte_t *pte, unsigned long hmask,
 683				 unsigned long addr, unsigned long end,
 684				 struct mm_walk *walk)
 685{
 686	struct mem_size_stats *mss = walk->private;
 687	struct vm_area_struct *vma = walk->vma;
 688	struct page *page = NULL;
 689
 690	if (pte_present(*pte)) {
 691		page = vm_normal_page(vma, addr, *pte);
 692	} else if (is_swap_pte(*pte)) {
 693		swp_entry_t swpent = pte_to_swp_entry(*pte);
 694
 695		if (is_pfn_swap_entry(swpent))
 696			page = pfn_swap_entry_to_page(swpent);
 
 
 697	}
 698	if (page) {
 699		int mapcount = page_mapcount(page);
 700
 701		if (mapcount >= 2)
 702			mss->shared_hugetlb += huge_page_size(hstate_vma(vma));
 703		else
 704			mss->private_hugetlb += huge_page_size(hstate_vma(vma));
 705	}
 706	return 0;
 707}
 708#else
 709#define smaps_hugetlb_range	NULL
 710#endif /* HUGETLB_PAGE */
 711
 712static const struct mm_walk_ops smaps_walk_ops = {
 713	.pmd_entry		= smaps_pte_range,
 714	.hugetlb_entry		= smaps_hugetlb_range,
 715};
 716
 717static const struct mm_walk_ops smaps_shmem_walk_ops = {
 718	.pmd_entry		= smaps_pte_range,
 719	.hugetlb_entry		= smaps_hugetlb_range,
 720	.pte_hole		= smaps_pte_hole,
 721};
 
 
 
 
 
 
 
 
 
 
 
 
 
 722
 723/*
 724 * Gather mem stats from @vma with the indicated beginning
 725 * address @start, and keep them in @mss.
 726 *
 727 * Use vm_start of @vma as the beginning address if @start is 0.
 728 */
 729static void smap_gather_stats(struct vm_area_struct *vma,
 730		struct mem_size_stats *mss, unsigned long start)
 731{
 732	const struct mm_walk_ops *ops = &smaps_walk_ops;
 
 
 
 733
 734	/* Invalid start */
 735	if (start >= vma->vm_end)
 736		return;
 737
 738#ifdef CONFIG_SHMEM
 739	/* In case of smaps_rollup, reset the value from previous vma */
 740	mss->check_shmem_swap = false;
 741	if (vma->vm_file && shmem_mapping(vma->vm_file->f_mapping)) {
 742		/*
 743		 * For shared or readonly shmem mappings we know that all
 744		 * swapped out pages belong to the shmem object, and we can
 745		 * obtain the swap value much more efficiently. For private
 746		 * writable mappings, we might have COW pages that are
 747		 * not affected by the parent swapped out pages of the shmem
 748		 * object, so we have to distinguish them during the page walk.
 749		 * Unless we know that the shmem object (or the part mapped by
 750		 * our VMA) has no swapped out pages at all.
 751		 */
 752		unsigned long shmem_swapped = shmem_swap_usage(vma);
 753
 754		if (!start && (!shmem_swapped || (vma->vm_flags & VM_SHARED) ||
 755					!(vma->vm_flags & VM_WRITE))) {
 756			mss->swap += shmem_swapped;
 757		} else {
 758			mss->check_shmem_swap = true;
 759			ops = &smaps_shmem_walk_ops;
 760		}
 761	}
 762#endif
 763	/* mmap_lock is held in m_start */
 764	if (!start)
 765		walk_page_vma(vma, ops, mss);
 766	else
 767		walk_page_range(vma->vm_mm, start, vma->vm_end, ops, mss);
 768}
 769
 770#define SEQ_PUT_DEC(str, val) \
 771		seq_put_decimal_ull_width(m, str, (val) >> 10, 8)
 
 
 
 
 
 
 
 
 
 
 
 
 
 772
 773/* Show the contents common for smaps and smaps_rollup */
 774static void __show_smap(struct seq_file *m, const struct mem_size_stats *mss,
 775	bool rollup_mode)
 776{
 777	SEQ_PUT_DEC("Rss:            ", mss->resident);
 778	SEQ_PUT_DEC(" kB\nPss:            ", mss->pss >> PSS_SHIFT);
 779	if (rollup_mode) {
 780		/*
 781		 * These are meaningful only for smaps_rollup, otherwise two of
 782		 * them are zero, and the other one is the same as Pss.
 783		 */
 784		SEQ_PUT_DEC(" kB\nPss_Anon:       ",
 785			mss->pss_anon >> PSS_SHIFT);
 786		SEQ_PUT_DEC(" kB\nPss_File:       ",
 787			mss->pss_file >> PSS_SHIFT);
 788		SEQ_PUT_DEC(" kB\nPss_Shmem:      ",
 789			mss->pss_shmem >> PSS_SHIFT);
 790	}
 791	SEQ_PUT_DEC(" kB\nShared_Clean:   ", mss->shared_clean);
 792	SEQ_PUT_DEC(" kB\nShared_Dirty:   ", mss->shared_dirty);
 793	SEQ_PUT_DEC(" kB\nPrivate_Clean:  ", mss->private_clean);
 794	SEQ_PUT_DEC(" kB\nPrivate_Dirty:  ", mss->private_dirty);
 795	SEQ_PUT_DEC(" kB\nReferenced:     ", mss->referenced);
 796	SEQ_PUT_DEC(" kB\nAnonymous:      ", mss->anonymous);
 797	SEQ_PUT_DEC(" kB\nLazyFree:       ", mss->lazyfree);
 798	SEQ_PUT_DEC(" kB\nAnonHugePages:  ", mss->anonymous_thp);
 799	SEQ_PUT_DEC(" kB\nShmemPmdMapped: ", mss->shmem_thp);
 800	SEQ_PUT_DEC(" kB\nFilePmdMapped:  ", mss->file_thp);
 801	SEQ_PUT_DEC(" kB\nShared_Hugetlb: ", mss->shared_hugetlb);
 802	seq_put_decimal_ull_width(m, " kB\nPrivate_Hugetlb: ",
 803				  mss->private_hugetlb >> 10, 7);
 804	SEQ_PUT_DEC(" kB\nSwap:           ", mss->swap);
 805	SEQ_PUT_DEC(" kB\nSwapPss:        ",
 806					mss->swap_pss >> PSS_SHIFT);
 807	SEQ_PUT_DEC(" kB\nLocked:         ",
 808					mss->pss_locked >> PSS_SHIFT);
 809	seq_puts(m, " kB\n");
 810}
 
 811
 812static int show_smap(struct seq_file *m, void *v)
 813{
 814	struct vm_area_struct *vma = v;
 815	struct mem_size_stats mss;
 816
 817	memset(&mss, 0, sizeof(mss));
 818
 819	smap_gather_stats(vma, &mss, 0);
 820
 821	show_map_vma(m, vma);
 822
 823	SEQ_PUT_DEC("Size:           ", vma->vm_end - vma->vm_start);
 824	SEQ_PUT_DEC(" kB\nKernelPageSize: ", vma_kernel_pagesize(vma));
 825	SEQ_PUT_DEC(" kB\nMMUPageSize:    ", vma_mmu_pagesize(vma));
 826	seq_puts(m, " kB\n");
 827
 828	__show_smap(m, &mss, false);
 829
 830	seq_printf(m, "THPeligible:    %d\n",
 831		   transparent_hugepage_active(vma));
 832
 833	if (arch_pkeys_enabled())
 834		seq_printf(m, "ProtectionKey:  %8u\n", vma_pkey(vma));
 835	show_smap_vma_flags(m, vma);
 836
 837	return 0;
 838}
 839
 840static int show_smaps_rollup(struct seq_file *m, void *v)
 841{
 842	struct proc_maps_private *priv = m->private;
 843	struct mem_size_stats mss;
 844	struct mm_struct *mm;
 845	struct vm_area_struct *vma;
 846	unsigned long last_vma_end = 0;
 847	int ret = 0;
 848
 849	priv->task = get_proc_task(priv->inode);
 850	if (!priv->task)
 851		return -ESRCH;
 852
 853	mm = priv->mm;
 854	if (!mm || !mmget_not_zero(mm)) {
 855		ret = -ESRCH;
 856		goto out_put_task;
 857	}
 858
 859	memset(&mss, 0, sizeof(mss));
 860
 861	ret = mmap_read_lock_killable(mm);
 862	if (ret)
 863		goto out_put_mm;
 864
 865	hold_task_mempolicy(priv);
 866
 867	for (vma = priv->mm->mmap; vma;) {
 868		smap_gather_stats(vma, &mss, 0);
 869		last_vma_end = vma->vm_end;
 870
 871		/*
 872		 * Release mmap_lock temporarily if someone wants to
 873		 * access it for write request.
 874		 */
 875		if (mmap_lock_is_contended(mm)) {
 876			mmap_read_unlock(mm);
 877			ret = mmap_read_lock_killable(mm);
 878			if (ret) {
 879				release_task_mempolicy(priv);
 880				goto out_put_mm;
 881			}
 882
 883			/*
 884			 * After dropping the lock, there are four cases to
 885			 * consider. See the following example for explanation.
 886			 *
 887			 *   +------+------+-----------+
 888			 *   | VMA1 | VMA2 | VMA3      |
 889			 *   +------+------+-----------+
 890			 *   |      |      |           |
 891			 *  4k     8k     16k         400k
 892			 *
 893			 * Suppose we drop the lock after reading VMA2 due to
 894			 * contention, then we get:
 895			 *
 896			 *	last_vma_end = 16k
 897			 *
 898			 * 1) VMA2 is freed, but VMA3 exists:
 899			 *
 900			 *    find_vma(mm, 16k - 1) will return VMA3.
 901			 *    In this case, just continue from VMA3.
 902			 *
 903			 * 2) VMA2 still exists:
 904			 *
 905			 *    find_vma(mm, 16k - 1) will return VMA2.
 906			 *    Iterate the loop like the original one.
 907			 *
 908			 * 3) No more VMAs can be found:
 909			 *
 910			 *    find_vma(mm, 16k - 1) will return NULL.
 911			 *    No more things to do, just break.
 912			 *
 913			 * 4) (last_vma_end - 1) is the middle of a vma (VMA'):
 914			 *
 915			 *    find_vma(mm, 16k - 1) will return VMA' whose range
 916			 *    contains last_vma_end.
 917			 *    Iterate VMA' from last_vma_end.
 918			 */
 919			vma = find_vma(mm, last_vma_end - 1);
 920			/* Case 3 above */
 921			if (!vma)
 922				break;
 923
 924			/* Case 1 above */
 925			if (vma->vm_start >= last_vma_end)
 926				continue;
 927
 928			/* Case 4 above */
 929			if (vma->vm_end > last_vma_end)
 930				smap_gather_stats(vma, &mss, last_vma_end);
 931		}
 932		/* Case 2 above */
 933		vma = vma->vm_next;
 934	}
 935
 936	show_vma_header_prefix(m, priv->mm->mmap->vm_start,
 937			       last_vma_end, 0, 0, 0, 0);
 938	seq_pad(m, ' ');
 939	seq_puts(m, "[rollup]\n");
 940
 941	__show_smap(m, &mss, true);
 942
 943	release_task_mempolicy(priv);
 944	mmap_read_unlock(mm);
 945
 946out_put_mm:
 947	mmput(mm);
 948out_put_task:
 949	put_task_struct(priv->task);
 950	priv->task = NULL;
 951
 952	return ret;
 953}
 954#undef SEQ_PUT_DEC
 955
 956static const struct seq_operations proc_pid_smaps_op = {
 957	.start	= m_start,
 958	.next	= m_next,
 959	.stop	= m_stop,
 960	.show	= show_smap
 
 
 
 
 
 
 
 961};
 962
 963static int pid_smaps_open(struct inode *inode, struct file *file)
 964{
 965	return do_maps_open(inode, file, &proc_pid_smaps_op);
 966}
 967
 968static int smaps_rollup_open(struct inode *inode, struct file *file)
 969{
 970	int ret;
 971	struct proc_maps_private *priv;
 
 972
 973	priv = kzalloc(sizeof(*priv), GFP_KERNEL_ACCOUNT);
 974	if (!priv)
 
 
 
 
 
 975		return -ENOMEM;
 976
 977	ret = single_open(file, show_smaps_rollup, priv);
 978	if (ret)
 979		goto out_free;
 980
 981	priv->inode = inode;
 982	priv->mm = proc_mem_open(inode, PTRACE_MODE_READ);
 983	if (IS_ERR(priv->mm)) {
 984		ret = PTR_ERR(priv->mm);
 985
 986		single_release(inode, file);
 987		goto out_free;
 988	}
 989
 990	return 0;
 991
 992out_free:
 993	kfree(priv);
 994	return ret;
 995}
 996
 997static int smaps_rollup_release(struct inode *inode, struct file *file)
 998{
 999	struct seq_file *seq = file->private_data;
1000	struct proc_maps_private *priv = seq->private;
1001
1002	if (priv->mm)
1003		mmdrop(priv->mm);
1004
1005	kfree(priv);
1006	return single_release(inode, file);
1007}
1008
1009const struct file_operations proc_pid_smaps_operations = {
1010	.open		= pid_smaps_open,
1011	.read		= seq_read,
1012	.llseek		= seq_lseek,
1013	.release	= proc_map_release,
1014};
1015
1016const struct file_operations proc_pid_smaps_rollup_operations = {
1017	.open		= smaps_rollup_open,
1018	.read		= seq_read,
1019	.llseek		= seq_lseek,
1020	.release	= smaps_rollup_release,
 
 
 
 
 
 
 
1021};
1022
1023enum clear_refs_types {
1024	CLEAR_REFS_ALL = 1,
1025	CLEAR_REFS_ANON,
1026	CLEAR_REFS_MAPPED,
1027	CLEAR_REFS_SOFT_DIRTY,
1028	CLEAR_REFS_MM_HIWATER_RSS,
1029	CLEAR_REFS_LAST,
1030};
1031
1032struct clear_refs_private {
1033	enum clear_refs_types type;
1034};
1035
1036#ifdef CONFIG_MEM_SOFT_DIRTY
1037
1038static inline bool pte_is_pinned(struct vm_area_struct *vma, unsigned long addr, pte_t pte)
1039{
1040	struct page *page;
1041
1042	if (!pte_write(pte))
1043		return false;
1044	if (!is_cow_mapping(vma->vm_flags))
1045		return false;
1046	if (likely(!test_bit(MMF_HAS_PINNED, &vma->vm_mm->flags)))
1047		return false;
1048	page = vm_normal_page(vma, addr, pte);
1049	if (!page)
1050		return false;
1051	return page_maybe_dma_pinned(page);
1052}
1053
1054static inline void clear_soft_dirty(struct vm_area_struct *vma,
1055		unsigned long addr, pte_t *pte)
1056{
1057	/*
1058	 * The soft-dirty tracker uses #PF-s to catch writes
1059	 * to pages, so write-protect the pte as well. See the
1060	 * Documentation/admin-guide/mm/soft-dirty.rst for full description
1061	 * of how soft-dirty works.
1062	 */
1063	pte_t ptent = *pte;
1064
1065	if (pte_present(ptent)) {
1066		pte_t old_pte;
1067
1068		if (pte_is_pinned(vma, addr, ptent))
1069			return;
1070		old_pte = ptep_modify_prot_start(vma, addr, pte);
1071		ptent = pte_wrprotect(old_pte);
1072		ptent = pte_clear_soft_dirty(ptent);
1073		ptep_modify_prot_commit(vma, addr, pte, old_pte, ptent);
1074	} else if (is_swap_pte(ptent)) {
1075		ptent = pte_swp_clear_soft_dirty(ptent);
1076		set_pte_at(vma->vm_mm, addr, pte, ptent);
1077	}
1078}
1079#else
1080static inline void clear_soft_dirty(struct vm_area_struct *vma,
1081		unsigned long addr, pte_t *pte)
1082{
1083}
1084#endif
1085
1086#if defined(CONFIG_MEM_SOFT_DIRTY) && defined(CONFIG_TRANSPARENT_HUGEPAGE)
1087static inline void clear_soft_dirty_pmd(struct vm_area_struct *vma,
1088		unsigned long addr, pmd_t *pmdp)
1089{
1090	pmd_t old, pmd = *pmdp;
1091
1092	if (pmd_present(pmd)) {
1093		/* See comment in change_huge_pmd() */
1094		old = pmdp_invalidate(vma, addr, pmdp);
1095		if (pmd_dirty(old))
1096			pmd = pmd_mkdirty(pmd);
1097		if (pmd_young(old))
1098			pmd = pmd_mkyoung(pmd);
1099
1100		pmd = pmd_wrprotect(pmd);
1101		pmd = pmd_clear_soft_dirty(pmd);
1102
1103		set_pmd_at(vma->vm_mm, addr, pmdp, pmd);
1104	} else if (is_migration_entry(pmd_to_swp_entry(pmd))) {
1105		pmd = pmd_swp_clear_soft_dirty(pmd);
1106		set_pmd_at(vma->vm_mm, addr, pmdp, pmd);
1107	}
1108}
1109#else
1110static inline void clear_soft_dirty_pmd(struct vm_area_struct *vma,
1111		unsigned long addr, pmd_t *pmdp)
1112{
1113}
1114#endif
1115
1116static int clear_refs_pte_range(pmd_t *pmd, unsigned long addr,
1117				unsigned long end, struct mm_walk *walk)
1118{
1119	struct clear_refs_private *cp = walk->private;
1120	struct vm_area_struct *vma = walk->vma;
1121	pte_t *pte, ptent;
1122	spinlock_t *ptl;
1123	struct page *page;
1124
1125	ptl = pmd_trans_huge_lock(pmd, vma);
1126	if (ptl) {
1127		if (cp->type == CLEAR_REFS_SOFT_DIRTY) {
1128			clear_soft_dirty_pmd(vma, addr, pmd);
1129			goto out;
1130		}
1131
1132		if (!pmd_present(*pmd))
1133			goto out;
1134
1135		page = pmd_page(*pmd);
1136
1137		/* Clear accessed and referenced bits. */
1138		pmdp_test_and_clear_young(vma, addr, pmd);
1139		test_and_clear_page_young(page);
1140		ClearPageReferenced(page);
1141out:
1142		spin_unlock(ptl);
1143		return 0;
1144	}
1145
1146	if (pmd_trans_unstable(pmd))
1147		return 0;
1148
1149	pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
1150	for (; addr != end; pte++, addr += PAGE_SIZE) {
1151		ptent = *pte;
1152
1153		if (cp->type == CLEAR_REFS_SOFT_DIRTY) {
1154			clear_soft_dirty(vma, addr, pte);
1155			continue;
1156		}
1157
1158		if (!pte_present(ptent))
1159			continue;
1160
1161		page = vm_normal_page(vma, addr, ptent);
1162		if (!page)
1163			continue;
1164
1165		/* Clear accessed and referenced bits. */
1166		ptep_test_and_clear_young(vma, addr, pte);
1167		test_and_clear_page_young(page);
1168		ClearPageReferenced(page);
1169	}
1170	pte_unmap_unlock(pte - 1, ptl);
1171	cond_resched();
1172	return 0;
1173}
1174
1175static int clear_refs_test_walk(unsigned long start, unsigned long end,
1176				struct mm_walk *walk)
1177{
1178	struct clear_refs_private *cp = walk->private;
1179	struct vm_area_struct *vma = walk->vma;
1180
1181	if (vma->vm_flags & VM_PFNMAP)
1182		return 1;
1183
1184	/*
1185	 * Writing 1 to /proc/pid/clear_refs affects all pages.
1186	 * Writing 2 to /proc/pid/clear_refs only affects anonymous pages.
1187	 * Writing 3 to /proc/pid/clear_refs only affects file mapped pages.
1188	 * Writing 4 to /proc/pid/clear_refs affects all pages.
1189	 */
1190	if (cp->type == CLEAR_REFS_ANON && vma->vm_file)
1191		return 1;
1192	if (cp->type == CLEAR_REFS_MAPPED && !vma->vm_file)
1193		return 1;
1194	return 0;
1195}
1196
1197static const struct mm_walk_ops clear_refs_walk_ops = {
1198	.pmd_entry		= clear_refs_pte_range,
1199	.test_walk		= clear_refs_test_walk,
1200};
1201
1202static ssize_t clear_refs_write(struct file *file, const char __user *buf,
1203				size_t count, loff_t *ppos)
1204{
1205	struct task_struct *task;
1206	char buffer[PROC_NUMBUF];
1207	struct mm_struct *mm;
1208	struct vm_area_struct *vma;
1209	enum clear_refs_types type;
 
1210	int itype;
1211	int rv;
1212
1213	memset(buffer, 0, sizeof(buffer));
1214	if (count > sizeof(buffer) - 1)
1215		count = sizeof(buffer) - 1;
1216	if (copy_from_user(buffer, buf, count))
1217		return -EFAULT;
1218	rv = kstrtoint(strstrip(buffer), 10, &itype);
1219	if (rv < 0)
1220		return rv;
1221	type = (enum clear_refs_types)itype;
1222	if (type < CLEAR_REFS_ALL || type >= CLEAR_REFS_LAST)
1223		return -EINVAL;
1224
1225	task = get_proc_task(file_inode(file));
1226	if (!task)
1227		return -ESRCH;
1228	mm = get_task_mm(task);
1229	if (mm) {
1230		struct mmu_notifier_range range;
1231		struct clear_refs_private cp = {
1232			.type = type,
1233		};
 
 
 
 
 
 
1234
1235		if (mmap_write_lock_killable(mm)) {
1236			count = -EINTR;
1237			goto out_mm;
1238		}
1239		if (type == CLEAR_REFS_MM_HIWATER_RSS) {
 
 
 
 
 
1240			/*
1241			 * Writing 5 to /proc/pid/clear_refs resets the peak
1242			 * resident set size to this mm's current rss value.
1243			 */
1244			reset_mm_hiwater_rss(mm);
1245			goto out_unlock;
 
1246		}
1247
 
 
1248		if (type == CLEAR_REFS_SOFT_DIRTY) {
1249			for (vma = mm->mmap; vma; vma = vma->vm_next) {
1250				if (!(vma->vm_flags & VM_SOFTDIRTY))
1251					continue;
1252				vma->vm_flags &= ~VM_SOFTDIRTY;
1253				vma_set_page_prot(vma);
 
 
 
 
 
 
 
 
 
1254			}
1255
1256			inc_tlb_flush_pending(mm);
1257			mmu_notifier_range_init(&range, MMU_NOTIFY_SOFT_DIRTY,
1258						0, NULL, mm, 0, -1UL);
1259			mmu_notifier_invalidate_range_start(&range);
1260		}
1261		walk_page_range(mm, 0, mm->highest_vm_end, &clear_refs_walk_ops,
1262				&cp);
1263		if (type == CLEAR_REFS_SOFT_DIRTY) {
1264			mmu_notifier_invalidate_range_end(&range);
1265			flush_tlb_mm(mm);
1266			dec_tlb_flush_pending(mm);
1267		}
1268out_unlock:
1269		mmap_write_unlock(mm);
1270out_mm:
1271		mmput(mm);
1272	}
1273	put_task_struct(task);
1274
1275	return count;
1276}
1277
1278const struct file_operations proc_clear_refs_operations = {
1279	.write		= clear_refs_write,
1280	.llseek		= noop_llseek,
1281};
1282
1283typedef struct {
1284	u64 pme;
1285} pagemap_entry_t;
1286
1287struct pagemapread {
1288	int pos, len;		/* units: PM_ENTRY_BYTES, not bytes */
1289	pagemap_entry_t *buffer;
1290	bool show_pfn;
1291};
1292
1293#define PAGEMAP_WALK_SIZE	(PMD_SIZE)
1294#define PAGEMAP_WALK_MASK	(PMD_MASK)
1295
1296#define PM_ENTRY_BYTES		sizeof(pagemap_entry_t)
1297#define PM_PFRAME_BITS		55
1298#define PM_PFRAME_MASK		GENMASK_ULL(PM_PFRAME_BITS - 1, 0)
1299#define PM_SOFT_DIRTY		BIT_ULL(55)
1300#define PM_MMAP_EXCLUSIVE	BIT_ULL(56)
1301#define PM_UFFD_WP		BIT_ULL(57)
1302#define PM_FILE			BIT_ULL(61)
1303#define PM_SWAP			BIT_ULL(62)
1304#define PM_PRESENT		BIT_ULL(63)
1305
1306#define PM_END_OF_BUFFER    1
1307
1308static inline pagemap_entry_t make_pme(u64 frame, u64 flags)
1309{
1310	return (pagemap_entry_t) { .pme = (frame & PM_PFRAME_MASK) | flags };
1311}
1312
1313static int add_to_pagemap(unsigned long addr, pagemap_entry_t *pme,
1314			  struct pagemapread *pm)
1315{
1316	pm->buffer[pm->pos++] = *pme;
1317	if (pm->pos >= pm->len)
1318		return PM_END_OF_BUFFER;
1319	return 0;
1320}
1321
1322static int pagemap_pte_hole(unsigned long start, unsigned long end,
1323			    __always_unused int depth, struct mm_walk *walk)
1324{
1325	struct pagemapread *pm = walk->private;
1326	unsigned long addr = start;
1327	int err = 0;
1328
1329	while (addr < end) {
1330		struct vm_area_struct *vma = find_vma(walk->mm, addr);
1331		pagemap_entry_t pme = make_pme(0, 0);
1332		/* End of address space hole, which we mark as non-present. */
1333		unsigned long hole_end;
1334
1335		if (vma)
1336			hole_end = min(end, vma->vm_start);
1337		else
1338			hole_end = end;
1339
1340		for (; addr < hole_end; addr += PAGE_SIZE) {
1341			err = add_to_pagemap(addr, &pme, pm);
1342			if (err)
1343				goto out;
1344		}
1345
1346		if (!vma)
1347			break;
1348
1349		/* Addresses in the VMA. */
1350		if (vma->vm_flags & VM_SOFTDIRTY)
1351			pme = make_pme(0, PM_SOFT_DIRTY);
1352		for (; addr < min(end, vma->vm_end); addr += PAGE_SIZE) {
1353			err = add_to_pagemap(addr, &pme, pm);
1354			if (err)
1355				goto out;
1356		}
1357	}
1358out:
1359	return err;
1360}
1361
1362static pagemap_entry_t pte_to_pagemap_entry(struct pagemapread *pm,
1363		struct vm_area_struct *vma, unsigned long addr, pte_t pte)
1364{
1365	u64 frame = 0, flags = 0;
1366	struct page *page = NULL;
1367
1368	if (pte_present(pte)) {
1369		if (pm->show_pfn)
1370			frame = pte_pfn(pte);
1371		flags |= PM_PRESENT;
1372		page = vm_normal_page(vma, addr, pte);
1373		if (pte_soft_dirty(pte))
1374			flags |= PM_SOFT_DIRTY;
1375		if (pte_uffd_wp(pte))
1376			flags |= PM_UFFD_WP;
1377	} else if (is_swap_pte(pte)) {
1378		swp_entry_t entry;
1379		if (pte_swp_soft_dirty(pte))
1380			flags |= PM_SOFT_DIRTY;
1381		if (pte_swp_uffd_wp(pte))
1382			flags |= PM_UFFD_WP;
1383		entry = pte_to_swp_entry(pte);
1384		if (pm->show_pfn)
1385			frame = swp_type(entry) |
1386				(swp_offset(entry) << MAX_SWAPFILES_SHIFT);
1387		flags |= PM_SWAP;
1388		if (is_pfn_swap_entry(entry))
1389			page = pfn_swap_entry_to_page(entry);
 
 
 
1390	}
1391
1392	if (page && !PageAnon(page))
1393		flags |= PM_FILE;
1394	if (page && page_mapcount(page) == 1)
1395		flags |= PM_MMAP_EXCLUSIVE;
1396	if (vma->vm_flags & VM_SOFTDIRTY)
1397		flags |= PM_SOFT_DIRTY;
1398
1399	return make_pme(frame, flags);
1400}
1401
1402static int pagemap_pmd_range(pmd_t *pmdp, unsigned long addr, unsigned long end,
1403			     struct mm_walk *walk)
1404{
1405	struct vm_area_struct *vma = walk->vma;
1406	struct pagemapread *pm = walk->private;
1407	spinlock_t *ptl;
1408	pte_t *pte, *orig_pte;
1409	int err = 0;
1410
1411#ifdef CONFIG_TRANSPARENT_HUGEPAGE
1412	ptl = pmd_trans_huge_lock(pmdp, vma);
1413	if (ptl) {
1414		u64 flags = 0, frame = 0;
1415		pmd_t pmd = *pmdp;
1416		struct page *page = NULL;
1417
1418		if (vma->vm_flags & VM_SOFTDIRTY)
1419			flags |= PM_SOFT_DIRTY;
1420
1421		if (pmd_present(pmd)) {
1422			page = pmd_page(pmd);
1423
1424			flags |= PM_PRESENT;
1425			if (pmd_soft_dirty(pmd))
1426				flags |= PM_SOFT_DIRTY;
1427			if (pmd_uffd_wp(pmd))
1428				flags |= PM_UFFD_WP;
1429			if (pm->show_pfn)
1430				frame = pmd_pfn(pmd) +
1431					((addr & ~PMD_MASK) >> PAGE_SHIFT);
1432		}
1433#ifdef CONFIG_ARCH_ENABLE_THP_MIGRATION
1434		else if (is_swap_pmd(pmd)) {
1435			swp_entry_t entry = pmd_to_swp_entry(pmd);
1436			unsigned long offset;
1437
1438			if (pm->show_pfn) {
1439				offset = swp_offset(entry) +
1440					((addr & ~PMD_MASK) >> PAGE_SHIFT);
1441				frame = swp_type(entry) |
1442					(offset << MAX_SWAPFILES_SHIFT);
1443			}
1444			flags |= PM_SWAP;
1445			if (pmd_swp_soft_dirty(pmd))
1446				flags |= PM_SOFT_DIRTY;
1447			if (pmd_swp_uffd_wp(pmd))
1448				flags |= PM_UFFD_WP;
1449			VM_BUG_ON(!is_pmd_migration_entry(pmd));
1450			page = pfn_swap_entry_to_page(entry);
1451		}
1452#endif
1453
1454		if (page && page_mapcount(page) == 1)
1455			flags |= PM_MMAP_EXCLUSIVE;
1456
1457		for (; addr != end; addr += PAGE_SIZE) {
1458			pagemap_entry_t pme = make_pme(frame, flags);
1459
1460			err = add_to_pagemap(addr, &pme, pm);
1461			if (err)
1462				break;
1463			if (pm->show_pfn) {
1464				if (flags & PM_PRESENT)
1465					frame++;
1466				else if (flags & PM_SWAP)
1467					frame += (1 << MAX_SWAPFILES_SHIFT);
1468			}
1469		}
1470		spin_unlock(ptl);
1471		return err;
1472	}
1473
1474	if (pmd_trans_unstable(pmdp))
1475		return 0;
1476#endif /* CONFIG_TRANSPARENT_HUGEPAGE */
1477
1478	/*
1479	 * We can assume that @vma always points to a valid one and @end never
1480	 * goes beyond vma->vm_end.
1481	 */
1482	orig_pte = pte = pte_offset_map_lock(walk->mm, pmdp, addr, &ptl);
1483	for (; addr < end; pte++, addr += PAGE_SIZE) {
1484		pagemap_entry_t pme;
1485
1486		pme = pte_to_pagemap_entry(pm, vma, addr, *pte);
1487		err = add_to_pagemap(addr, &pme, pm);
1488		if (err)
1489			break;
1490	}
1491	pte_unmap_unlock(orig_pte, ptl);
1492
1493	cond_resched();
1494
1495	return err;
1496}
1497
1498#ifdef CONFIG_HUGETLB_PAGE
1499/* This function walks within one hugetlb entry in the single call */
1500static int pagemap_hugetlb_range(pte_t *ptep, unsigned long hmask,
1501				 unsigned long addr, unsigned long end,
1502				 struct mm_walk *walk)
1503{
1504	struct pagemapread *pm = walk->private;
1505	struct vm_area_struct *vma = walk->vma;
1506	u64 flags = 0, frame = 0;
1507	int err = 0;
1508	pte_t pte;
1509
1510	if (vma->vm_flags & VM_SOFTDIRTY)
1511		flags |= PM_SOFT_DIRTY;
1512
1513	pte = huge_ptep_get(ptep);
1514	if (pte_present(pte)) {
1515		struct page *page = pte_page(pte);
1516
1517		if (!PageAnon(page))
1518			flags |= PM_FILE;
1519
1520		if (page_mapcount(page) == 1)
1521			flags |= PM_MMAP_EXCLUSIVE;
1522
1523		flags |= PM_PRESENT;
1524		if (pm->show_pfn)
1525			frame = pte_pfn(pte) +
1526				((addr & ~hmask) >> PAGE_SHIFT);
1527	}
1528
1529	for (; addr != end; addr += PAGE_SIZE) {
1530		pagemap_entry_t pme = make_pme(frame, flags);
1531
1532		err = add_to_pagemap(addr, &pme, pm);
1533		if (err)
1534			return err;
1535		if (pm->show_pfn && (flags & PM_PRESENT))
1536			frame++;
1537	}
1538
1539	cond_resched();
1540
1541	return err;
1542}
1543#else
1544#define pagemap_hugetlb_range	NULL
1545#endif /* HUGETLB_PAGE */
1546
1547static const struct mm_walk_ops pagemap_ops = {
1548	.pmd_entry	= pagemap_pmd_range,
1549	.pte_hole	= pagemap_pte_hole,
1550	.hugetlb_entry	= pagemap_hugetlb_range,
1551};
1552
1553/*
1554 * /proc/pid/pagemap - an array mapping virtual pages to pfns
1555 *
1556 * For each page in the address space, this file contains one 64-bit entry
1557 * consisting of the following:
1558 *
1559 * Bits 0-54  page frame number (PFN) if present
1560 * Bits 0-4   swap type if swapped
1561 * Bits 5-54  swap offset if swapped
1562 * Bit  55    pte is soft-dirty (see Documentation/admin-guide/mm/soft-dirty.rst)
1563 * Bit  56    page exclusively mapped
1564 * Bits 57-60 zero
1565 * Bit  61    page is file-page or shared-anon
1566 * Bit  62    page swapped
1567 * Bit  63    page present
1568 *
1569 * If the page is not present but in swap, then the PFN contains an
1570 * encoding of the swap file number and the page's offset into the
1571 * swap. Unmapped pages return a null PFN. This allows determining
1572 * precisely which pages are mapped (or in swap) and comparing mapped
1573 * pages between processes.
1574 *
1575 * Efficient users of this interface will use /proc/pid/maps to
1576 * determine which areas of memory are actually mapped and llseek to
1577 * skip over unmapped regions.
1578 */
1579static ssize_t pagemap_read(struct file *file, char __user *buf,
1580			    size_t count, loff_t *ppos)
1581{
1582	struct mm_struct *mm = file->private_data;
1583	struct pagemapread pm;
 
1584	unsigned long src;
1585	unsigned long svpfn;
1586	unsigned long start_vaddr;
1587	unsigned long end_vaddr;
1588	int ret = 0, copied = 0;
1589
1590	if (!mm || !mmget_not_zero(mm))
1591		goto out;
1592
1593	ret = -EINVAL;
1594	/* file position must be aligned */
1595	if ((*ppos % PM_ENTRY_BYTES) || (count % PM_ENTRY_BYTES))
1596		goto out_mm;
1597
1598	ret = 0;
1599	if (!count)
1600		goto out_mm;
1601
1602	/* do not disclose physical addresses: attack vector */
1603	pm.show_pfn = file_ns_capable(file, &init_user_ns, CAP_SYS_ADMIN);
1604
1605	pm.len = (PAGEMAP_WALK_SIZE >> PAGE_SHIFT);
1606	pm.buffer = kmalloc_array(pm.len, PM_ENTRY_BYTES, GFP_KERNEL);
1607	ret = -ENOMEM;
1608	if (!pm.buffer)
1609		goto out_mm;
1610
 
 
 
 
 
 
 
 
1611	src = *ppos;
1612	svpfn = src / PM_ENTRY_BYTES;
 
1613	end_vaddr = mm->task_size;
1614
1615	/* watch out for wraparound */
1616	start_vaddr = end_vaddr;
1617	if (svpfn <= (ULONG_MAX >> PAGE_SHIFT))
1618		start_vaddr = untagged_addr(svpfn << PAGE_SHIFT);
1619
1620	/* Ensure the address is inside the task */
1621	if (start_vaddr > mm->task_size)
1622		start_vaddr = end_vaddr;
1623
1624	/*
1625	 * The odds are that this will stop walking way
1626	 * before end_vaddr, because the length of the
1627	 * user buffer is tracked in "pm", and the walk
1628	 * will stop when we hit the end of the buffer.
1629	 */
1630	ret = 0;
1631	while (count && (start_vaddr < end_vaddr)) {
1632		int len;
1633		unsigned long end;
1634
1635		pm.pos = 0;
1636		end = (start_vaddr + PAGEMAP_WALK_SIZE) & PAGEMAP_WALK_MASK;
1637		/* overflow ? */
1638		if (end < start_vaddr || end > end_vaddr)
1639			end = end_vaddr;
1640		ret = mmap_read_lock_killable(mm);
1641		if (ret)
1642			goto out_free;
1643		ret = walk_page_range(mm, start_vaddr, end, &pagemap_ops, &pm);
1644		mmap_read_unlock(mm);
1645		start_vaddr = end;
1646
1647		len = min(count, PM_ENTRY_BYTES * pm.pos);
1648		if (copy_to_user(buf, pm.buffer, len)) {
1649			ret = -EFAULT;
1650			goto out_free;
1651		}
1652		copied += len;
1653		buf += len;
1654		count -= len;
1655	}
1656	*ppos += copied;
1657	if (!ret || ret == PM_END_OF_BUFFER)
1658		ret = copied;
1659
1660out_free:
1661	kfree(pm.buffer);
1662out_mm:
1663	mmput(mm);
1664out:
1665	return ret;
1666}
1667
1668static int pagemap_open(struct inode *inode, struct file *file)
1669{
1670	struct mm_struct *mm;
1671
1672	mm = proc_mem_open(inode, PTRACE_MODE_READ);
1673	if (IS_ERR(mm))
1674		return PTR_ERR(mm);
1675	file->private_data = mm;
1676	return 0;
1677}
1678
1679static int pagemap_release(struct inode *inode, struct file *file)
1680{
1681	struct mm_struct *mm = file->private_data;
1682
1683	if (mm)
1684		mmdrop(mm);
1685	return 0;
1686}
1687
1688const struct file_operations proc_pagemap_operations = {
1689	.llseek		= mem_lseek, /* borrow this */
1690	.read		= pagemap_read,
1691	.open		= pagemap_open,
1692	.release	= pagemap_release,
1693};
1694#endif /* CONFIG_PROC_PAGE_MONITOR */
1695
1696#ifdef CONFIG_NUMA
1697
1698struct numa_maps {
1699	unsigned long pages;
1700	unsigned long anon;
1701	unsigned long active;
1702	unsigned long writeback;
1703	unsigned long mapcount_max;
1704	unsigned long dirty;
1705	unsigned long swapcache;
1706	unsigned long node[MAX_NUMNODES];
1707};
1708
1709struct numa_maps_private {
1710	struct proc_maps_private proc_maps;
1711	struct numa_maps md;
1712};
1713
1714static void gather_stats(struct page *page, struct numa_maps *md, int pte_dirty,
1715			unsigned long nr_pages)
1716{
1717	int count = page_mapcount(page);
1718
1719	md->pages += nr_pages;
1720	if (pte_dirty || PageDirty(page))
1721		md->dirty += nr_pages;
1722
1723	if (PageSwapCache(page))
1724		md->swapcache += nr_pages;
1725
1726	if (PageActive(page) || PageUnevictable(page))
1727		md->active += nr_pages;
1728
1729	if (PageWriteback(page))
1730		md->writeback += nr_pages;
1731
1732	if (PageAnon(page))
1733		md->anon += nr_pages;
1734
1735	if (count > md->mapcount_max)
1736		md->mapcount_max = count;
1737
1738	md->node[page_to_nid(page)] += nr_pages;
1739}
1740
1741static struct page *can_gather_numa_stats(pte_t pte, struct vm_area_struct *vma,
1742		unsigned long addr)
1743{
1744	struct page *page;
1745	int nid;
1746
1747	if (!pte_present(pte))
1748		return NULL;
1749
1750	page = vm_normal_page(vma, addr, pte);
1751	if (!page)
1752		return NULL;
1753
1754	if (PageReserved(page))
1755		return NULL;
1756
1757	nid = page_to_nid(page);
1758	if (!node_isset(nid, node_states[N_MEMORY]))
1759		return NULL;
1760
1761	return page;
1762}
1763
1764#ifdef CONFIG_TRANSPARENT_HUGEPAGE
1765static struct page *can_gather_numa_stats_pmd(pmd_t pmd,
1766					      struct vm_area_struct *vma,
1767					      unsigned long addr)
1768{
1769	struct page *page;
1770	int nid;
1771
1772	if (!pmd_present(pmd))
1773		return NULL;
1774
1775	page = vm_normal_page_pmd(vma, addr, pmd);
1776	if (!page)
1777		return NULL;
1778
1779	if (PageReserved(page))
1780		return NULL;
1781
1782	nid = page_to_nid(page);
1783	if (!node_isset(nid, node_states[N_MEMORY]))
1784		return NULL;
1785
1786	return page;
1787}
1788#endif
1789
1790static int gather_pte_stats(pmd_t *pmd, unsigned long addr,
1791		unsigned long end, struct mm_walk *walk)
1792{
1793	struct numa_maps *md = walk->private;
1794	struct vm_area_struct *vma = walk->vma;
1795	spinlock_t *ptl;
1796	pte_t *orig_pte;
1797	pte_t *pte;
1798
1799#ifdef CONFIG_TRANSPARENT_HUGEPAGE
1800	ptl = pmd_trans_huge_lock(pmd, vma);
1801	if (ptl) {
1802		struct page *page;
1803
1804		page = can_gather_numa_stats_pmd(*pmd, vma, addr);
1805		if (page)
1806			gather_stats(page, md, pmd_dirty(*pmd),
1807				     HPAGE_PMD_SIZE/PAGE_SIZE);
1808		spin_unlock(ptl);
1809		return 0;
1810	}
1811
1812	if (pmd_trans_unstable(pmd))
1813		return 0;
1814#endif
1815	orig_pte = pte = pte_offset_map_lock(walk->mm, pmd, addr, &ptl);
1816	do {
1817		struct page *page = can_gather_numa_stats(*pte, vma, addr);
1818		if (!page)
1819			continue;
1820		gather_stats(page, md, pte_dirty(*pte), 1);
1821
1822	} while (pte++, addr += PAGE_SIZE, addr != end);
1823	pte_unmap_unlock(orig_pte, ptl);
1824	cond_resched();
1825	return 0;
1826}
1827#ifdef CONFIG_HUGETLB_PAGE
1828static int gather_hugetlb_stats(pte_t *pte, unsigned long hmask,
1829		unsigned long addr, unsigned long end, struct mm_walk *walk)
1830{
1831	pte_t huge_pte = huge_ptep_get(pte);
1832	struct numa_maps *md;
1833	struct page *page;
1834
1835	if (!pte_present(huge_pte))
1836		return 0;
1837
1838	page = pte_page(huge_pte);
1839	if (!page)
1840		return 0;
1841
1842	md = walk->private;
1843	gather_stats(page, md, pte_dirty(huge_pte), 1);
1844	return 0;
1845}
1846
1847#else
1848static int gather_hugetlb_stats(pte_t *pte, unsigned long hmask,
1849		unsigned long addr, unsigned long end, struct mm_walk *walk)
1850{
1851	return 0;
1852}
1853#endif
1854
1855static const struct mm_walk_ops show_numa_ops = {
1856	.hugetlb_entry = gather_hugetlb_stats,
1857	.pmd_entry = gather_pte_stats,
1858};
1859
1860/*
1861 * Display pages allocated per node and memory policy via /proc.
1862 */
1863static int show_numa_map(struct seq_file *m, void *v)
1864{
1865	struct numa_maps_private *numa_priv = m->private;
1866	struct proc_maps_private *proc_priv = &numa_priv->proc_maps;
1867	struct vm_area_struct *vma = v;
1868	struct numa_maps *md = &numa_priv->md;
1869	struct file *file = vma->vm_file;
1870	struct mm_struct *mm = vma->vm_mm;
 
 
 
 
 
 
1871	struct mempolicy *pol;
1872	char buffer[64];
1873	int nid;
1874
1875	if (!mm)
1876		return 0;
1877
1878	/* Ensure we start with an empty set of numa_maps statistics. */
1879	memset(md, 0, sizeof(*md));
1880
1881	pol = __get_vma_policy(vma, vma->vm_start);
1882	if (pol) {
1883		mpol_to_str(buffer, sizeof(buffer), pol);
1884		mpol_cond_put(pol);
1885	} else {
1886		mpol_to_str(buffer, sizeof(buffer), proc_priv->task_mempolicy);
1887	}
1888
1889	seq_printf(m, "%08lx %s", vma->vm_start, buffer);
1890
1891	if (file) {
1892		seq_puts(m, " file=");
1893		seq_file_path(m, file, "\n\t= ");
1894	} else if (vma->vm_start <= mm->brk && vma->vm_end >= mm->start_brk) {
1895		seq_puts(m, " heap");
1896	} else if (is_stack(vma)) {
1897		seq_puts(m, " stack");
1898	}
1899
1900	if (is_vm_hugetlb_page(vma))
1901		seq_puts(m, " huge");
1902
1903	/* mmap_lock is held by m_start */
1904	walk_page_vma(vma, &show_numa_ops, md);
1905
1906	if (!md->pages)
1907		goto out;
1908
1909	if (md->anon)
1910		seq_printf(m, " anon=%lu", md->anon);
1911
1912	if (md->dirty)
1913		seq_printf(m, " dirty=%lu", md->dirty);
1914
1915	if (md->pages != md->anon && md->pages != md->dirty)
1916		seq_printf(m, " mapped=%lu", md->pages);
1917
1918	if (md->mapcount_max > 1)
1919		seq_printf(m, " mapmax=%lu", md->mapcount_max);
1920
1921	if (md->swapcache)
1922		seq_printf(m, " swapcache=%lu", md->swapcache);
1923
1924	if (md->active < md->pages && !is_vm_hugetlb_page(vma))
1925		seq_printf(m, " active=%lu", md->active);
1926
1927	if (md->writeback)
1928		seq_printf(m, " writeback=%lu", md->writeback);
1929
1930	for_each_node_state(nid, N_MEMORY)
1931		if (md->node[nid])
1932			seq_printf(m, " N%d=%lu", nid, md->node[nid]);
1933
1934	seq_printf(m, " kernelpagesize_kB=%lu", vma_kernel_pagesize(vma) >> 10);
1935out:
1936	seq_putc(m, '\n');
 
1937	return 0;
1938}
1939
 
 
 
 
 
 
 
 
 
 
1940static const struct seq_operations proc_pid_numa_maps_op = {
1941	.start  = m_start,
1942	.next   = m_next,
1943	.stop   = m_stop,
1944	.show   = show_numa_map,
 
 
 
 
 
 
 
1945};
1946
 
 
 
 
 
 
 
1947static int pid_numa_maps_open(struct inode *inode, struct file *file)
1948{
1949	return proc_maps_open(inode, file, &proc_pid_numa_maps_op,
1950				sizeof(struct numa_maps_private));
 
 
 
 
1951}
1952
1953const struct file_operations proc_pid_numa_maps_operations = {
1954	.open		= pid_numa_maps_open,
1955	.read		= seq_read,
1956	.llseek		= seq_lseek,
1957	.release	= proc_map_release,
1958};
1959
 
 
 
 
 
 
1960#endif /* CONFIG_NUMA */