task_mmu.c 10.4 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4
#include <linux/mm.h>
#include <linux/hugetlb.h>
#include <linux/mount.h>
#include <linux/seq_file.h>
M
Mauricio Lin 已提交
5
#include <linux/highmem.h>
6 7
#include <linux/pagemap.h>
#include <linux/mempolicy.h>
M
Mauricio Lin 已提交
8

L
Linus Torvalds 已提交
9 10
#include <asm/elf.h>
#include <asm/uaccess.h>
M
Mauricio Lin 已提交
11
#include <asm/tlbflush.h>
L
Linus Torvalds 已提交
12 13 14 15 16
#include "internal.h"

char *task_mem(struct mm_struct *mm, char *buffer)
{
	unsigned long data, text, lib;
17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
	unsigned long hiwater_vm, total_vm, hiwater_rss, total_rss;

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

	data = mm->total_vm - mm->shared_vm - mm->stack_vm;
	text = (PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK)) >> 10;
	lib = (mm->exec_vm << (PAGE_SHIFT-10)) - text;
	buffer += sprintf(buffer,
37
		"VmPeak:\t%8lu kB\n"
L
Linus Torvalds 已提交
38 39
		"VmSize:\t%8lu kB\n"
		"VmLck:\t%8lu kB\n"
40
		"VmHWM:\t%8lu kB\n"
L
Linus Torvalds 已提交
41 42 43 44 45 46
		"VmRSS:\t%8lu kB\n"
		"VmData:\t%8lu kB\n"
		"VmStk:\t%8lu kB\n"
		"VmExe:\t%8lu kB\n"
		"VmLib:\t%8lu kB\n"
		"VmPTE:\t%8lu kB\n",
47 48
		hiwater_vm << (PAGE_SHIFT-10),
		(total_vm - mm->reserved_vm) << (PAGE_SHIFT-10),
L
Linus Torvalds 已提交
49
		mm->locked_vm << (PAGE_SHIFT-10),
50 51
		hiwater_rss << (PAGE_SHIFT-10),
		total_rss << (PAGE_SHIFT-10),
L
Linus Torvalds 已提交
52 53 54 55 56 57 58 59 60 61 62 63 64 65
		data << (PAGE_SHIFT-10),
		mm->stack_vm << (PAGE_SHIFT-10), text, lib,
		(PTRS_PER_PTE*sizeof(pte_t)*mm->nr_ptes) >> 10);
	return buffer;
}

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

int task_statm(struct mm_struct *mm, int *shared, int *text,
	       int *data, int *resident)
{
66
	*shared = get_mm_counter(mm, file_rss);
L
Linus Torvalds 已提交
67 68 69
	*text = (PAGE_ALIGN(mm->end_code) - (mm->start_code & PAGE_MASK))
								>> PAGE_SHIFT;
	*data = mm->total_vm - mm->shared_vm;
70
	*resident = *shared + get_mm_counter(mm, anon_rss);
L
Linus Torvalds 已提交
71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111
	return mm->total_vm;
}

int proc_exe_link(struct inode *inode, struct dentry **dentry, struct vfsmount **mnt)
{
	struct vm_area_struct * vma;
	int result = -ENOENT;
	struct task_struct *task = proc_task(inode);
	struct mm_struct * mm = get_task_mm(task);

	if (!mm)
		goto out;
	down_read(&mm->mmap_sem);

	vma = mm->mmap;
	while (vma) {
		if ((vma->vm_flags & VM_EXECUTABLE) && vma->vm_file)
			break;
		vma = vma->vm_next;
	}

	if (vma) {
		*mnt = mntget(vma->vm_file->f_vfsmnt);
		*dentry = dget(vma->vm_file->f_dentry);
		result = 0;
	}

	up_read(&mm->mmap_sem);
	mmput(mm);
out:
	return result;
}

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

M
Mauricio Lin 已提交
112 113 114 115 116 117 118 119 120 121
struct mem_size_stats
{
	unsigned long resident;
	unsigned long shared_clean;
	unsigned long shared_dirty;
	unsigned long private_clean;
	unsigned long private_dirty;
};

static int show_map_internal(struct seq_file *m, void *v, struct mem_size_stats *mss)
L
Linus Torvalds 已提交
122 123
{
	struct task_struct *task = m->private;
M
Mauricio Lin 已提交
124 125 126 127
	struct vm_area_struct *vma = v;
	struct mm_struct *mm = vma->vm_mm;
	struct file *file = vma->vm_file;
	int flags = vma->vm_flags;
L
Linus Torvalds 已提交
128 129 130 131 132
	unsigned long ino = 0;
	dev_t dev = 0;
	int len;

	if (file) {
M
Mauricio Lin 已提交
133
		struct inode *inode = vma->vm_file->f_dentry->d_inode;
L
Linus Torvalds 已提交
134 135 136 137 138
		dev = inode->i_sb->s_dev;
		ino = inode->i_ino;
	}

	seq_printf(m, "%08lx-%08lx %c%c%c%c %08lx %02x:%02x %lu %n",
M
Mauricio Lin 已提交
139 140
			vma->vm_start,
			vma->vm_end,
L
Linus Torvalds 已提交
141 142 143 144
			flags & VM_READ ? 'r' : '-',
			flags & VM_WRITE ? 'w' : '-',
			flags & VM_EXEC ? 'x' : '-',
			flags & VM_MAYSHARE ? 's' : 'p',
M
Mauricio Lin 已提交
145
			vma->vm_pgoff << PAGE_SHIFT,
L
Linus Torvalds 已提交
146 147 148 149 150 151
			MAJOR(dev), MINOR(dev), ino, &len);

	/*
	 * Print the dentry name for named mappings, and a
	 * special [heap] marker for the heap:
	 */
M
Mauricio Lin 已提交
152
	if (file) {
L
Linus Torvalds 已提交
153
		pad_len_spaces(m, len);
M
Mauricio Lin 已提交
154
		seq_path(m, file->f_vfsmnt, file->f_dentry, "\n");
L
Linus Torvalds 已提交
155 156
	} else {
		if (mm) {
M
Mauricio Lin 已提交
157 158
			if (vma->vm_start <= mm->start_brk &&
						vma->vm_end >= mm->brk) {
L
Linus Torvalds 已提交
159 160 161
				pad_len_spaces(m, len);
				seq_puts(m, "[heap]");
			} else {
M
Mauricio Lin 已提交
162 163
				if (vma->vm_start <= mm->start_stack &&
					vma->vm_end >= mm->start_stack) {
L
Linus Torvalds 已提交
164 165 166 167 168 169 170 171 172 173 174

					pad_len_spaces(m, len);
					seq_puts(m, "[stack]");
				}
			}
		} else {
			pad_len_spaces(m, len);
			seq_puts(m, "[vdso]");
		}
	}
	seq_putc(m, '\n');
M
Mauricio Lin 已提交
175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192

	if (mss)
		seq_printf(m,
			   "Size:          %8lu kB\n"
			   "Rss:           %8lu kB\n"
			   "Shared_Clean:  %8lu kB\n"
			   "Shared_Dirty:  %8lu kB\n"
			   "Private_Clean: %8lu kB\n"
			   "Private_Dirty: %8lu kB\n",
			   (vma->vm_end - vma->vm_start) >> 10,
			   mss->resident >> 10,
			   mss->shared_clean  >> 10,
			   mss->shared_dirty  >> 10,
			   mss->private_clean >> 10,
			   mss->private_dirty >> 10);

	if (m->count < m->size)  /* vma is copied successfully */
		m->version = (vma != get_gate_vma(task))? vma->vm_start: 0;
L
Linus Torvalds 已提交
193 194 195
	return 0;
}

M
Mauricio Lin 已提交
196 197
static int show_map(struct seq_file *m, void *v)
{
198
	return show_map_internal(m, v, NULL);
M
Mauricio Lin 已提交
199 200 201 202 203 204 205
}

static void smaps_pte_range(struct vm_area_struct *vma, pmd_t *pmd,
				unsigned long addr, unsigned long end,
				struct mem_size_stats *mss)
{
	pte_t *pte, ptent;
206
	spinlock_t *ptl;
M
Mauricio Lin 已提交
207 208
	struct page *page;

209
	pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
M
Mauricio Lin 已提交
210 211
	do {
		ptent = *pte;
212
		if (!pte_present(ptent))
M
Mauricio Lin 已提交
213 214 215
			continue;

		mss->resident += PAGE_SIZE;
N
Nick Piggin 已提交
216 217 218

		page = vm_normal_page(vma, addr, ptent);
		if (!page)
M
Mauricio Lin 已提交
219 220
			continue;

N
Nick Piggin 已提交
221
		if (page_mapcount(page) >= 2) {
M
Mauricio Lin 已提交
222 223 224 225 226 227 228 229 230 231 232
			if (pte_dirty(ptent))
				mss->shared_dirty += PAGE_SIZE;
			else
				mss->shared_clean += PAGE_SIZE;
		} else {
			if (pte_dirty(ptent))
				mss->private_dirty += PAGE_SIZE;
			else
				mss->private_clean += PAGE_SIZE;
		}
	} while (pte++, addr += PAGE_SIZE, addr != end);
233 234
	pte_unmap_unlock(pte - 1, ptl);
	cond_resched();
M
Mauricio Lin 已提交
235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290
}

static inline void smaps_pmd_range(struct vm_area_struct *vma, pud_t *pud,
				unsigned long addr, unsigned long end,
				struct mem_size_stats *mss)
{
	pmd_t *pmd;
	unsigned long next;

	pmd = pmd_offset(pud, addr);
	do {
		next = pmd_addr_end(addr, end);
		if (pmd_none_or_clear_bad(pmd))
			continue;
		smaps_pte_range(vma, pmd, addr, next, mss);
	} while (pmd++, addr = next, addr != end);
}

static inline void smaps_pud_range(struct vm_area_struct *vma, pgd_t *pgd,
				unsigned long addr, unsigned long end,
				struct mem_size_stats *mss)
{
	pud_t *pud;
	unsigned long next;

	pud = pud_offset(pgd, addr);
	do {
		next = pud_addr_end(addr, end);
		if (pud_none_or_clear_bad(pud))
			continue;
		smaps_pmd_range(vma, pud, addr, next, mss);
	} while (pud++, addr = next, addr != end);
}

static inline void smaps_pgd_range(struct vm_area_struct *vma,
				unsigned long addr, unsigned long end,
				struct mem_size_stats *mss)
{
	pgd_t *pgd;
	unsigned long next;

	pgd = pgd_offset(vma->vm_mm, addr);
	do {
		next = pgd_addr_end(addr, end);
		if (pgd_none_or_clear_bad(pgd))
			continue;
		smaps_pud_range(vma, pgd, addr, next, mss);
	} while (pgd++, addr = next, addr != end);
}

static int show_smap(struct seq_file *m, void *v)
{
	struct vm_area_struct *vma = v;
	struct mem_size_stats mss;

	memset(&mss, 0, sizeof mss);
N
Nick Piggin 已提交
291
	if (vma->vm_mm && !is_vm_hugetlb_page(vma))
M
Mauricio Lin 已提交
292 293 294 295
		smaps_pgd_range(vma, vma->vm_start, vma->vm_end, &mss);
	return show_map_internal(m, v, &mss);
}

L
Linus Torvalds 已提交
296 297 298 299 300
static void *m_start(struct seq_file *m, loff_t *pos)
{
	struct task_struct *task = m->private;
	unsigned long last_addr = m->version;
	struct mm_struct *mm;
M
Mauricio Lin 已提交
301
	struct vm_area_struct *vma, *tail_vma;
L
Linus Torvalds 已提交
302 303 304 305 306
	loff_t l = *pos;

	/*
	 * We remember last_addr rather than next_addr to hit with
	 * mmap_cache most of the time. We have zero last_addr at
M
Mauricio Lin 已提交
307 308
	 * the beginning and also after lseek. We will have -1 last_addr
	 * after the end of the vmas.
L
Linus Torvalds 已提交
309 310 311 312 313 314 315 316 317
	 */

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

	mm = get_task_mm(task);
	if (!mm)
		return NULL;

M
Mauricio Lin 已提交
318
	tail_vma = get_gate_vma(task);
L
Linus Torvalds 已提交
319 320 321
	down_read(&mm->mmap_sem);

	/* Start with last addr hint */
M
Mauricio Lin 已提交
322 323
	if (last_addr && (vma = find_vma(mm, last_addr))) {
		vma = vma->vm_next;
L
Linus Torvalds 已提交
324 325 326 327
		goto out;
	}

	/*
M
Mauricio Lin 已提交
328
	 * Check the vma index is within the range and do
L
Linus Torvalds 已提交
329 330
	 * sequential scan until m_index.
	 */
M
Mauricio Lin 已提交
331
	vma = NULL;
L
Linus Torvalds 已提交
332
	if ((unsigned long)l < mm->map_count) {
M
Mauricio Lin 已提交
333 334 335
		vma = mm->mmap;
		while (l-- && vma)
			vma = vma->vm_next;
L
Linus Torvalds 已提交
336 337 338 339
		goto out;
	}

	if (l != mm->map_count)
M
Mauricio Lin 已提交
340
		tail_vma = NULL; /* After gate vma */
L
Linus Torvalds 已提交
341 342

out:
M
Mauricio Lin 已提交
343 344
	if (vma)
		return vma;
L
Linus Torvalds 已提交
345

M
Mauricio Lin 已提交
346 347
	/* End of vmas has been reached */
	m->version = (tail_vma != NULL)? 0: -1UL;
L
Linus Torvalds 已提交
348 349
	up_read(&mm->mmap_sem);
	mmput(mm);
M
Mauricio Lin 已提交
350
	return tail_vma;
L
Linus Torvalds 已提交
351 352 353 354 355
}

static void m_stop(struct seq_file *m, void *v)
{
	struct task_struct *task = m->private;
M
Mauricio Lin 已提交
356 357 358
	struct vm_area_struct *vma = v;
	if (vma && vma != get_gate_vma(task)) {
		struct mm_struct *mm = vma->vm_mm;
L
Linus Torvalds 已提交
359 360 361 362 363 364 365 366
		up_read(&mm->mmap_sem);
		mmput(mm);
	}
}

static void *m_next(struct seq_file *m, void *v, loff_t *pos)
{
	struct task_struct *task = m->private;
M
Mauricio Lin 已提交
367 368
	struct vm_area_struct *vma = v;
	struct vm_area_struct *tail_vma = get_gate_vma(task);
L
Linus Torvalds 已提交
369 370

	(*pos)++;
M
Mauricio Lin 已提交
371 372
	if (vma && (vma != tail_vma) && vma->vm_next)
		return vma->vm_next;
L
Linus Torvalds 已提交
373
	m_stop(m, v);
M
Mauricio Lin 已提交
374
	return (vma != tail_vma)? tail_vma: NULL;
L
Linus Torvalds 已提交
375 376
}

377
static struct seq_operations proc_pid_maps_op = {
L
Linus Torvalds 已提交
378 379 380 381 382
	.start	= m_start,
	.next	= m_next,
	.stop	= m_stop,
	.show	= show_map
};
383

384
static struct seq_operations proc_pid_smaps_op = {
M
Mauricio Lin 已提交
385 386 387 388 389 390
	.start	= m_start,
	.next	= m_next,
	.stop	= m_stop,
	.show	= show_smap
};

391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414
static int do_maps_open(struct inode *inode, struct file *file,
			struct seq_operations *ops)
{
	struct task_struct *task = proc_task(inode);
	int ret = seq_open(file, ops);
	if (!ret) {
		struct seq_file *m = file->private_data;
		m->private = task;
	}
	return ret;
}

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

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

415
#ifdef CONFIG_NUMA
416
extern int show_numa_map(struct seq_file *m, void *v);
417

418
static struct seq_operations proc_pid_numa_maps_op = {
419 420 421 422
        .start  = m_start,
        .next   = m_next,
        .stop   = m_stop,
        .show   = show_numa_map
423
};
424 425 426 427 428 429 430 431 432 433 434 435

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

struct file_operations proc_numa_maps_operations = {
	.open		= numa_maps_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= seq_release,
};
436
#endif
437 438 439 440 441 442 443 444 445 446 447 448

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

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