vmalloc.c 45.8 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7
/*
 *  linux/mm/vmalloc.c
 *
 *  Copyright (C) 1993  Linus Torvalds
 *  Support of BIGMEM added by Gerhard Wichert, Siemens AG, July 1999
 *  SMP-safe vmalloc/vfree/ioremap, Tigran Aivazian <tigran@veritas.com>, May 2000
 *  Major rework to support vmap/vunmap, Christoph Hellwig, SGI, August 2002
C
Christoph Lameter 已提交
8
 *  Numa awareness, Christoph Lameter, SGI, June 2005
L
Linus Torvalds 已提交
9 10
 */

N
Nick Piggin 已提交
11
#include <linux/vmalloc.h>
L
Linus Torvalds 已提交
12 13 14 15 16 17
#include <linux/mm.h>
#include <linux/module.h>
#include <linux/highmem.h>
#include <linux/slab.h>
#include <linux/spinlock.h>
#include <linux/interrupt.h>
18
#include <linux/proc_fs.h>
19
#include <linux/seq_file.h>
20
#include <linux/debugobjects.h>
21
#include <linux/kallsyms.h>
N
Nick Piggin 已提交
22 23 24 25
#include <linux/list.h>
#include <linux/rbtree.h>
#include <linux/radix-tree.h>
#include <linux/rcupdate.h>
I
Ivan Kokshaysky 已提交
26
#include <linux/bootmem.h>
27
#include <linux/pfn.h>
L
Linus Torvalds 已提交
28

N
Nick Piggin 已提交
29
#include <asm/atomic.h>
L
Linus Torvalds 已提交
30 31 32 33
#include <asm/uaccess.h>
#include <asm/tlbflush.h>


N
Nick Piggin 已提交
34
/*** Page table manipulation functions ***/
A
Adrian Bunk 已提交
35

L
Linus Torvalds 已提交
36 37 38 39 40 41 42 43 44 45 46
static void vunmap_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end)
{
	pte_t *pte;

	pte = pte_offset_kernel(pmd, addr);
	do {
		pte_t ptent = ptep_get_and_clear(&init_mm, addr, pte);
		WARN_ON(!pte_none(ptent) && !pte_present(ptent));
	} while (pte++, addr += PAGE_SIZE, addr != end);
}

N
Nick Piggin 已提交
47
static void vunmap_pmd_range(pud_t *pud, unsigned long addr, unsigned long end)
L
Linus Torvalds 已提交
48 49 50 51 52 53 54 55 56 57 58 59 60
{
	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;
		vunmap_pte_range(pmd, addr, next);
	} while (pmd++, addr = next, addr != end);
}

N
Nick Piggin 已提交
61
static void vunmap_pud_range(pgd_t *pgd, unsigned long addr, unsigned long end)
L
Linus Torvalds 已提交
62 63 64 65 66 67 68 69 70 71 72 73 74
{
	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;
		vunmap_pmd_range(pud, addr, next);
	} while (pud++, addr = next, addr != end);
}

N
Nick Piggin 已提交
75
static void vunmap_page_range(unsigned long addr, unsigned long end)
L
Linus Torvalds 已提交
76 77 78 79 80 81 82 83 84 85 86 87 88 89 90
{
	pgd_t *pgd;
	unsigned long next;

	BUG_ON(addr >= end);
	pgd = pgd_offset_k(addr);
	do {
		next = pgd_addr_end(addr, end);
		if (pgd_none_or_clear_bad(pgd))
			continue;
		vunmap_pud_range(pgd, addr, next);
	} while (pgd++, addr = next, addr != end);
}

static int vmap_pte_range(pmd_t *pmd, unsigned long addr,
N
Nick Piggin 已提交
91
		unsigned long end, pgprot_t prot, struct page **pages, int *nr)
L
Linus Torvalds 已提交
92 93 94
{
	pte_t *pte;

N
Nick Piggin 已提交
95 96 97 98 99
	/*
	 * nr is a running index into the array which helps higher level
	 * callers keep track of where we're up to.
	 */

H
Hugh Dickins 已提交
100
	pte = pte_alloc_kernel(pmd, addr);
L
Linus Torvalds 已提交
101 102 103
	if (!pte)
		return -ENOMEM;
	do {
N
Nick Piggin 已提交
104 105 106 107 108
		struct page *page = pages[*nr];

		if (WARN_ON(!pte_none(*pte)))
			return -EBUSY;
		if (WARN_ON(!page))
L
Linus Torvalds 已提交
109 110
			return -ENOMEM;
		set_pte_at(&init_mm, addr, pte, mk_pte(page, prot));
N
Nick Piggin 已提交
111
		(*nr)++;
L
Linus Torvalds 已提交
112 113 114 115
	} while (pte++, addr += PAGE_SIZE, addr != end);
	return 0;
}

N
Nick Piggin 已提交
116 117
static int vmap_pmd_range(pud_t *pud, unsigned long addr,
		unsigned long end, pgprot_t prot, struct page **pages, int *nr)
L
Linus Torvalds 已提交
118 119 120 121 122 123 124 125 126
{
	pmd_t *pmd;
	unsigned long next;

	pmd = pmd_alloc(&init_mm, pud, addr);
	if (!pmd)
		return -ENOMEM;
	do {
		next = pmd_addr_end(addr, end);
N
Nick Piggin 已提交
127
		if (vmap_pte_range(pmd, addr, next, prot, pages, nr))
L
Linus Torvalds 已提交
128 129 130 131 132
			return -ENOMEM;
	} while (pmd++, addr = next, addr != end);
	return 0;
}

N
Nick Piggin 已提交
133 134
static int vmap_pud_range(pgd_t *pgd, unsigned long addr,
		unsigned long end, pgprot_t prot, struct page **pages, int *nr)
L
Linus Torvalds 已提交
135 136 137 138 139 140 141 142 143
{
	pud_t *pud;
	unsigned long next;

	pud = pud_alloc(&init_mm, pgd, addr);
	if (!pud)
		return -ENOMEM;
	do {
		next = pud_addr_end(addr, end);
N
Nick Piggin 已提交
144
		if (vmap_pmd_range(pud, addr, next, prot, pages, nr))
L
Linus Torvalds 已提交
145 146 147 148 149
			return -ENOMEM;
	} while (pud++, addr = next, addr != end);
	return 0;
}

N
Nick Piggin 已提交
150 151 152 153 154 155
/*
 * Set up page tables in kva (addr, end). The ptes shall have prot "prot", and
 * will have pfns corresponding to the "pages" array.
 *
 * Ie. pte at addr+N*PAGE_SIZE shall point to pfn corresponding to pages[N]
 */
156 157
static int vmap_page_range_noflush(unsigned long start, unsigned long end,
				   pgprot_t prot, struct page **pages)
L
Linus Torvalds 已提交
158 159 160
{
	pgd_t *pgd;
	unsigned long next;
161
	unsigned long addr = start;
N
Nick Piggin 已提交
162 163
	int err = 0;
	int nr = 0;
L
Linus Torvalds 已提交
164 165 166 167 168

	BUG_ON(addr >= end);
	pgd = pgd_offset_k(addr);
	do {
		next = pgd_addr_end(addr, end);
N
Nick Piggin 已提交
169
		err = vmap_pud_range(pgd, addr, next, prot, pages, &nr);
L
Linus Torvalds 已提交
170 171 172
		if (err)
			break;
	} while (pgd++, addr = next, addr != end);
N
Nick Piggin 已提交
173 174 175 176

	if (unlikely(err))
		return err;
	return nr;
L
Linus Torvalds 已提交
177 178
}

179 180 181 182 183 184 185 186 187 188
static int vmap_page_range(unsigned long start, unsigned long end,
			   pgprot_t prot, struct page **pages)
{
	int ret;

	ret = vmap_page_range_noflush(start, end, prot, pages);
	flush_cache_vmap(start, end);
	return ret;
}

189 190 191
static inline int is_vmalloc_or_module_addr(const void *x)
{
	/*
192
	 * ARM, x86-64 and sparc64 put modules in a special place,
193 194 195 196 197 198 199 200 201 202 203
	 * and fall back on vmalloc() if that fails. Others
	 * just put it in the vmalloc space.
	 */
#if defined(CONFIG_MODULES) && defined(MODULES_VADDR)
	unsigned long addr = (unsigned long)x;
	if (addr >= MODULES_VADDR && addr < MODULES_END)
		return 1;
#endif
	return is_vmalloc_addr(x);
}

204
/*
N
Nick Piggin 已提交
205
 * Walk a vmap address to the struct page it maps.
206
 */
207
struct page *vmalloc_to_page(const void *vmalloc_addr)
208 209 210 211 212
{
	unsigned long addr = (unsigned long) vmalloc_addr;
	struct page *page = NULL;
	pgd_t *pgd = pgd_offset_k(addr);

213 214 215 216
	/*
	 * XXX we might need to change this if we add VIRTUAL_BUG_ON for
	 * architectures that do not vmalloc module space
	 */
217
	VIRTUAL_BUG_ON(!is_vmalloc_or_module_addr(vmalloc_addr));
J
Jiri Slaby 已提交
218

219
	if (!pgd_none(*pgd)) {
N
Nick Piggin 已提交
220
		pud_t *pud = pud_offset(pgd, addr);
221
		if (!pud_none(*pud)) {
N
Nick Piggin 已提交
222
			pmd_t *pmd = pmd_offset(pud, addr);
223
			if (!pmd_none(*pmd)) {
N
Nick Piggin 已提交
224 225
				pte_t *ptep, pte;

226 227 228 229 230 231 232 233 234 235 236 237 238 239 240
				ptep = pte_offset_map(pmd, addr);
				pte = *ptep;
				if (pte_present(pte))
					page = pte_page(pte);
				pte_unmap(ptep);
			}
		}
	}
	return page;
}
EXPORT_SYMBOL(vmalloc_to_page);

/*
 * Map a vmalloc()-space virtual address to the physical page frame number.
 */
241
unsigned long vmalloc_to_pfn(const void *vmalloc_addr)
242 243 244 245 246
{
	return page_to_pfn(vmalloc_to_page(vmalloc_addr));
}
EXPORT_SYMBOL(vmalloc_to_pfn);

N
Nick Piggin 已提交
247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269

/*** Global kva allocator ***/

#define VM_LAZY_FREE	0x01
#define VM_LAZY_FREEING	0x02
#define VM_VM_AREA	0x04

struct vmap_area {
	unsigned long va_start;
	unsigned long va_end;
	unsigned long flags;
	struct rb_node rb_node;		/* address sorted rbtree */
	struct list_head list;		/* address sorted list */
	struct list_head purge_list;	/* "lazy purge" list */
	void *private;
	struct rcu_head rcu_head;
};

static DEFINE_SPINLOCK(vmap_area_lock);
static struct rb_root vmap_area_root = RB_ROOT;
static LIST_HEAD(vmap_area_list);

static struct vmap_area *__find_vmap_area(unsigned long addr)
L
Linus Torvalds 已提交
270
{
N
Nick Piggin 已提交
271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332
	struct rb_node *n = vmap_area_root.rb_node;

	while (n) {
		struct vmap_area *va;

		va = rb_entry(n, struct vmap_area, rb_node);
		if (addr < va->va_start)
			n = n->rb_left;
		else if (addr > va->va_start)
			n = n->rb_right;
		else
			return va;
	}

	return NULL;
}

static void __insert_vmap_area(struct vmap_area *va)
{
	struct rb_node **p = &vmap_area_root.rb_node;
	struct rb_node *parent = NULL;
	struct rb_node *tmp;

	while (*p) {
		struct vmap_area *tmp;

		parent = *p;
		tmp = rb_entry(parent, struct vmap_area, rb_node);
		if (va->va_start < tmp->va_end)
			p = &(*p)->rb_left;
		else if (va->va_end > tmp->va_start)
			p = &(*p)->rb_right;
		else
			BUG();
	}

	rb_link_node(&va->rb_node, parent, p);
	rb_insert_color(&va->rb_node, &vmap_area_root);

	/* address-sort this list so it is usable like the vmlist */
	tmp = rb_prev(&va->rb_node);
	if (tmp) {
		struct vmap_area *prev;
		prev = rb_entry(tmp, struct vmap_area, rb_node);
		list_add_rcu(&va->list, &prev->list);
	} else
		list_add_rcu(&va->list, &vmap_area_list);
}

static void purge_vmap_area_lazy(void);

/*
 * Allocate a region of KVA of the specified size and alignment, within the
 * vstart and vend.
 */
static struct vmap_area *alloc_vmap_area(unsigned long size,
				unsigned long align,
				unsigned long vstart, unsigned long vend,
				int node, gfp_t gfp_mask)
{
	struct vmap_area *va;
	struct rb_node *n;
L
Linus Torvalds 已提交
333
	unsigned long addr;
N
Nick Piggin 已提交
334 335
	int purged = 0;

N
Nick Piggin 已提交
336
	BUG_ON(!size);
N
Nick Piggin 已提交
337 338 339 340 341 342 343 344
	BUG_ON(size & ~PAGE_MASK);

	va = kmalloc_node(sizeof(struct vmap_area),
			gfp_mask & GFP_RECLAIM_MASK, node);
	if (unlikely(!va))
		return ERR_PTR(-ENOMEM);

retry:
G
Glauber Costa 已提交
345 346
	addr = ALIGN(vstart, align);

N
Nick Piggin 已提交
347
	spin_lock(&vmap_area_lock);
N
Nick Piggin 已提交
348 349 350
	if (addr + size - 1 < addr)
		goto overflow;

N
Nick Piggin 已提交
351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379
	/* XXX: could have a last_hole cache */
	n = vmap_area_root.rb_node;
	if (n) {
		struct vmap_area *first = NULL;

		do {
			struct vmap_area *tmp;
			tmp = rb_entry(n, struct vmap_area, rb_node);
			if (tmp->va_end >= addr) {
				if (!first && tmp->va_start < addr + size)
					first = tmp;
				n = n->rb_left;
			} else {
				first = tmp;
				n = n->rb_right;
			}
		} while (n);

		if (!first)
			goto found;

		if (first->va_end < addr) {
			n = rb_next(&first->rb_node);
			if (n)
				first = rb_entry(n, struct vmap_area, rb_node);
			else
				goto found;
		}

N
Nick Piggin 已提交
380
		while (addr + size > first->va_start && addr + size <= vend) {
N
Nick Piggin 已提交
381
			addr = ALIGN(first->va_end + PAGE_SIZE, align);
N
Nick Piggin 已提交
382 383
			if (addr + size - 1 < addr)
				goto overflow;
N
Nick Piggin 已提交
384 385 386 387 388 389 390 391 392 393

			n = rb_next(&first->rb_node);
			if (n)
				first = rb_entry(n, struct vmap_area, rb_node);
			else
				goto found;
		}
	}
found:
	if (addr + size > vend) {
N
Nick Piggin 已提交
394
overflow:
N
Nick Piggin 已提交
395 396 397 398 399 400 401
		spin_unlock(&vmap_area_lock);
		if (!purged) {
			purge_vmap_area_lazy();
			purged = 1;
			goto retry;
		}
		if (printk_ratelimit())
G
Glauber Costa 已提交
402 403 404
			printk(KERN_WARNING
				"vmap allocation for size %lu failed: "
				"use vmalloc=<size> to increase size.\n", size);
405
		kfree(va);
N
Nick Piggin 已提交
406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454
		return ERR_PTR(-EBUSY);
	}

	BUG_ON(addr & (align-1));

	va->va_start = addr;
	va->va_end = addr + size;
	va->flags = 0;
	__insert_vmap_area(va);
	spin_unlock(&vmap_area_lock);

	return va;
}

static void rcu_free_va(struct rcu_head *head)
{
	struct vmap_area *va = container_of(head, struct vmap_area, rcu_head);

	kfree(va);
}

static void __free_vmap_area(struct vmap_area *va)
{
	BUG_ON(RB_EMPTY_NODE(&va->rb_node));
	rb_erase(&va->rb_node, &vmap_area_root);
	RB_CLEAR_NODE(&va->rb_node);
	list_del_rcu(&va->list);

	call_rcu(&va->rcu_head, rcu_free_va);
}

/*
 * Free a region of KVA allocated by alloc_vmap_area
 */
static void free_vmap_area(struct vmap_area *va)
{
	spin_lock(&vmap_area_lock);
	__free_vmap_area(va);
	spin_unlock(&vmap_area_lock);
}

/*
 * Clear the pagetable entries of a given vmap_area
 */
static void unmap_vmap_area(struct vmap_area *va)
{
	vunmap_page_range(va->va_start, va->va_end);
}

455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475
static void vmap_debug_free_range(unsigned long start, unsigned long end)
{
	/*
	 * Unmap page tables and force a TLB flush immediately if
	 * CONFIG_DEBUG_PAGEALLOC is set. This catches use after free
	 * bugs similarly to those in linear kernel virtual address
	 * space after a page has been freed.
	 *
	 * All the lazy freeing logic is still retained, in order to
	 * minimise intrusiveness of this debugging feature.
	 *
	 * This is going to be *slow* (linear kernel virtual address
	 * debugging doesn't do a broadcast TLB flush so it is a lot
	 * faster).
	 */
#ifdef CONFIG_DEBUG_PAGEALLOC
	vunmap_page_range(start, end);
	flush_tlb_kernel_range(start, end);
#endif
}

N
Nick Piggin 已提交
476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515
/*
 * lazy_max_pages is the maximum amount of virtual address space we gather up
 * before attempting to purge with a TLB flush.
 *
 * There is a tradeoff here: a larger number will cover more kernel page tables
 * and take slightly longer to purge, but it will linearly reduce the number of
 * global TLB flushes that must be performed. It would seem natural to scale
 * this number up linearly with the number of CPUs (because vmapping activity
 * could also scale linearly with the number of CPUs), however it is likely
 * that in practice, workloads might be constrained in other ways that mean
 * vmap activity will not scale linearly with CPUs. Also, I want to be
 * conservative and not introduce a big latency on huge systems, so go with
 * a less aggressive log scale. It will still be an improvement over the old
 * code, and it will be simple to change the scale factor if we find that it
 * becomes a problem on bigger systems.
 */
static unsigned long lazy_max_pages(void)
{
	unsigned int log;

	log = fls(num_online_cpus());

	return log * (32UL * 1024 * 1024 / PAGE_SIZE);
}

static atomic_t vmap_lazy_nr = ATOMIC_INIT(0);

/*
 * Purges all lazily-freed vmap areas.
 *
 * If sync is 0 then don't purge if there is already a purge in progress.
 * If force_flush is 1, then flush kernel TLBs between *start and *end even
 * if we found no lazy vmap areas to unmap (callers can use this to optimise
 * their own TLB flushing).
 * Returns with *start = min(*start, lowest purged address)
 *              *end = max(*end, highest purged address)
 */
static void __purge_vmap_area_lazy(unsigned long *start, unsigned long *end,
					int sync, int force_flush)
{
516
	static DEFINE_SPINLOCK(purge_lock);
N
Nick Piggin 已提交
517 518
	LIST_HEAD(valist);
	struct vmap_area *va;
519
	struct vmap_area *n_va;
N
Nick Piggin 已提交
520 521 522 523 524 525 526 527
	int nr = 0;

	/*
	 * If sync is 0 but force_flush is 1, we'll go sync anyway but callers
	 * should not expect such behaviour. This just simplifies locking for
	 * the case that isn't actually used at the moment anyway.
	 */
	if (!sync && !force_flush) {
528
		if (!spin_trylock(&purge_lock))
N
Nick Piggin 已提交
529 530
			return;
	} else
531
		spin_lock(&purge_lock);
N
Nick Piggin 已提交
532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558

	rcu_read_lock();
	list_for_each_entry_rcu(va, &vmap_area_list, list) {
		if (va->flags & VM_LAZY_FREE) {
			if (va->va_start < *start)
				*start = va->va_start;
			if (va->va_end > *end)
				*end = va->va_end;
			nr += (va->va_end - va->va_start) >> PAGE_SHIFT;
			unmap_vmap_area(va);
			list_add_tail(&va->purge_list, &valist);
			va->flags |= VM_LAZY_FREEING;
			va->flags &= ~VM_LAZY_FREE;
		}
	}
	rcu_read_unlock();

	if (nr) {
		BUG_ON(nr > atomic_read(&vmap_lazy_nr));
		atomic_sub(nr, &vmap_lazy_nr);
	}

	if (nr || force_flush)
		flush_tlb_kernel_range(*start, *end);

	if (nr) {
		spin_lock(&vmap_area_lock);
559
		list_for_each_entry_safe(va, n_va, &valist, purge_list)
N
Nick Piggin 已提交
560 561 562
			__free_vmap_area(va);
		spin_unlock(&vmap_area_lock);
	}
563
	spin_unlock(&purge_lock);
N
Nick Piggin 已提交
564 565
}

N
Nick Piggin 已提交
566 567 568 569 570 571 572 573 574 575 576
/*
 * Kick off a purge of the outstanding lazy areas. Don't bother if somebody
 * is already purging.
 */
static void try_purge_vmap_area_lazy(void)
{
	unsigned long start = ULONG_MAX, end = 0;

	__purge_vmap_area_lazy(&start, &end, 0, 0);
}

N
Nick Piggin 已提交
577 578 579 580 581 582 583
/*
 * Kick off a purge of the outstanding lazy areas.
 */
static void purge_vmap_area_lazy(void)
{
	unsigned long start = ULONG_MAX, end = 0;

N
Nick Piggin 已提交
584
	__purge_vmap_area_lazy(&start, &end, 1, 0);
N
Nick Piggin 已提交
585 586 587
}

/*
588 589
 * Free and unmap a vmap area, caller ensuring flush_cache_vunmap had been
 * called for the correct range previously.
N
Nick Piggin 已提交
590
 */
591
static void free_unmap_vmap_area_noflush(struct vmap_area *va)
N
Nick Piggin 已提交
592 593 594 595
{
	va->flags |= VM_LAZY_FREE;
	atomic_add((va->va_end - va->va_start) >> PAGE_SHIFT, &vmap_lazy_nr);
	if (unlikely(atomic_read(&vmap_lazy_nr) > lazy_max_pages()))
N
Nick Piggin 已提交
596
		try_purge_vmap_area_lazy();
N
Nick Piggin 已提交
597 598
}

599 600 601 602 603 604 605 606 607
/*
 * Free and unmap a vmap area
 */
static void free_unmap_vmap_area(struct vmap_area *va)
{
	flush_cache_vunmap(va->va_start, va->va_end);
	free_unmap_vmap_area_noflush(va);
}

N
Nick Piggin 已提交
608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657
static struct vmap_area *find_vmap_area(unsigned long addr)
{
	struct vmap_area *va;

	spin_lock(&vmap_area_lock);
	va = __find_vmap_area(addr);
	spin_unlock(&vmap_area_lock);

	return va;
}

static void free_unmap_vmap_area_addr(unsigned long addr)
{
	struct vmap_area *va;

	va = find_vmap_area(addr);
	BUG_ON(!va);
	free_unmap_vmap_area(va);
}


/*** Per cpu kva allocator ***/

/*
 * vmap space is limited especially on 32 bit architectures. Ensure there is
 * room for at least 16 percpu vmap blocks per CPU.
 */
/*
 * If we had a constant VMALLOC_START and VMALLOC_END, we'd like to be able
 * to #define VMALLOC_SPACE		(VMALLOC_END-VMALLOC_START). Guess
 * instead (we just need a rough idea)
 */
#if BITS_PER_LONG == 32
#define VMALLOC_SPACE		(128UL*1024*1024)
#else
#define VMALLOC_SPACE		(128UL*1024*1024*1024)
#endif

#define VMALLOC_PAGES		(VMALLOC_SPACE / PAGE_SIZE)
#define VMAP_MAX_ALLOC		BITS_PER_LONG	/* 256K with 4K pages */
#define VMAP_BBMAP_BITS_MAX	1024	/* 4MB with 4K pages */
#define VMAP_BBMAP_BITS_MIN	(VMAP_MAX_ALLOC*2)
#define VMAP_MIN(x, y)		((x) < (y) ? (x) : (y)) /* can't use min() */
#define VMAP_MAX(x, y)		((x) > (y) ? (x) : (y)) /* can't use max() */
#define VMAP_BBMAP_BITS		VMAP_MIN(VMAP_BBMAP_BITS_MAX,		\
					VMAP_MAX(VMAP_BBMAP_BITS_MIN,	\
						VMALLOC_PAGES / NR_CPUS / 16))

#define VMAP_BLOCK_SIZE		(VMAP_BBMAP_BITS * PAGE_SIZE)

658 659
static bool vmap_initialized __read_mostly = false;

N
Nick Piggin 已提交
660 661 662 663 664 665 666 667 668 669 670 671 672 673 674
struct vmap_block_queue {
	spinlock_t lock;
	struct list_head free;
	struct list_head dirty;
	unsigned int nr_dirty;
};

struct vmap_block {
	spinlock_t lock;
	struct vmap_area *va;
	struct vmap_block_queue *vbq;
	unsigned long free, dirty;
	DECLARE_BITMAP(alloc_map, VMAP_BBMAP_BITS);
	DECLARE_BITMAP(dirty_map, VMAP_BBMAP_BITS);
	union {
675
		struct list_head free_list;
N
Nick Piggin 已提交
676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771
		struct rcu_head rcu_head;
	};
};

/* Queue of free and dirty vmap blocks, for allocation and flushing purposes */
static DEFINE_PER_CPU(struct vmap_block_queue, vmap_block_queue);

/*
 * Radix tree of vmap blocks, indexed by address, to quickly find a vmap block
 * in the free path. Could get rid of this if we change the API to return a
 * "cookie" from alloc, to be passed to free. But no big deal yet.
 */
static DEFINE_SPINLOCK(vmap_block_tree_lock);
static RADIX_TREE(vmap_block_tree, GFP_ATOMIC);

/*
 * We should probably have a fallback mechanism to allocate virtual memory
 * out of partially filled vmap blocks. However vmap block sizing should be
 * fairly reasonable according to the vmalloc size, so it shouldn't be a
 * big problem.
 */

static unsigned long addr_to_vb_idx(unsigned long addr)
{
	addr -= VMALLOC_START & ~(VMAP_BLOCK_SIZE-1);
	addr /= VMAP_BLOCK_SIZE;
	return addr;
}

static struct vmap_block *new_vmap_block(gfp_t gfp_mask)
{
	struct vmap_block_queue *vbq;
	struct vmap_block *vb;
	struct vmap_area *va;
	unsigned long vb_idx;
	int node, err;

	node = numa_node_id();

	vb = kmalloc_node(sizeof(struct vmap_block),
			gfp_mask & GFP_RECLAIM_MASK, node);
	if (unlikely(!vb))
		return ERR_PTR(-ENOMEM);

	va = alloc_vmap_area(VMAP_BLOCK_SIZE, VMAP_BLOCK_SIZE,
					VMALLOC_START, VMALLOC_END,
					node, gfp_mask);
	if (unlikely(IS_ERR(va))) {
		kfree(vb);
		return ERR_PTR(PTR_ERR(va));
	}

	err = radix_tree_preload(gfp_mask);
	if (unlikely(err)) {
		kfree(vb);
		free_vmap_area(va);
		return ERR_PTR(err);
	}

	spin_lock_init(&vb->lock);
	vb->va = va;
	vb->free = VMAP_BBMAP_BITS;
	vb->dirty = 0;
	bitmap_zero(vb->alloc_map, VMAP_BBMAP_BITS);
	bitmap_zero(vb->dirty_map, VMAP_BBMAP_BITS);
	INIT_LIST_HEAD(&vb->free_list);

	vb_idx = addr_to_vb_idx(va->va_start);
	spin_lock(&vmap_block_tree_lock);
	err = radix_tree_insert(&vmap_block_tree, vb_idx, vb);
	spin_unlock(&vmap_block_tree_lock);
	BUG_ON(err);
	radix_tree_preload_end();

	vbq = &get_cpu_var(vmap_block_queue);
	vb->vbq = vbq;
	spin_lock(&vbq->lock);
	list_add(&vb->free_list, &vbq->free);
	spin_unlock(&vbq->lock);
	put_cpu_var(vmap_cpu_blocks);

	return vb;
}

static void rcu_free_vb(struct rcu_head *head)
{
	struct vmap_block *vb = container_of(head, struct vmap_block, rcu_head);

	kfree(vb);
}

static void free_vmap_block(struct vmap_block *vb)
{
	struct vmap_block *tmp;
	unsigned long vb_idx;

772
	BUG_ON(!list_empty(&vb->free_list));
N
Nick Piggin 已提交
773 774 775 776 777 778 779

	vb_idx = addr_to_vb_idx(vb->va->va_start);
	spin_lock(&vmap_block_tree_lock);
	tmp = radix_tree_delete(&vmap_block_tree, vb_idx);
	spin_unlock(&vmap_block_tree_lock);
	BUG_ON(tmp != vb);

780
	free_unmap_vmap_area_noflush(vb->va);
N
Nick Piggin 已提交
781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841
	call_rcu(&vb->rcu_head, rcu_free_vb);
}

static void *vb_alloc(unsigned long size, gfp_t gfp_mask)
{
	struct vmap_block_queue *vbq;
	struct vmap_block *vb;
	unsigned long addr = 0;
	unsigned int order;

	BUG_ON(size & ~PAGE_MASK);
	BUG_ON(size > PAGE_SIZE*VMAP_MAX_ALLOC);
	order = get_order(size);

again:
	rcu_read_lock();
	vbq = &get_cpu_var(vmap_block_queue);
	list_for_each_entry_rcu(vb, &vbq->free, free_list) {
		int i;

		spin_lock(&vb->lock);
		i = bitmap_find_free_region(vb->alloc_map,
						VMAP_BBMAP_BITS, order);

		if (i >= 0) {
			addr = vb->va->va_start + (i << PAGE_SHIFT);
			BUG_ON(addr_to_vb_idx(addr) !=
					addr_to_vb_idx(vb->va->va_start));
			vb->free -= 1UL << order;
			if (vb->free == 0) {
				spin_lock(&vbq->lock);
				list_del_init(&vb->free_list);
				spin_unlock(&vbq->lock);
			}
			spin_unlock(&vb->lock);
			break;
		}
		spin_unlock(&vb->lock);
	}
	put_cpu_var(vmap_cpu_blocks);
	rcu_read_unlock();

	if (!addr) {
		vb = new_vmap_block(gfp_mask);
		if (IS_ERR(vb))
			return vb;
		goto again;
	}

	return (void *)addr;
}

static void vb_free(const void *addr, unsigned long size)
{
	unsigned long offset;
	unsigned long vb_idx;
	unsigned int order;
	struct vmap_block *vb;

	BUG_ON(size & ~PAGE_MASK);
	BUG_ON(size > PAGE_SIZE*VMAP_MAX_ALLOC);
842 843 844

	flush_cache_vunmap((unsigned long)addr, (unsigned long)addr + size);

N
Nick Piggin 已提交
845 846 847 848 849 850 851 852 853 854 855 856
	order = get_order(size);

	offset = (unsigned long)addr & (VMAP_BLOCK_SIZE - 1);

	vb_idx = addr_to_vb_idx((unsigned long)addr);
	rcu_read_lock();
	vb = radix_tree_lookup(&vmap_block_tree, vb_idx);
	rcu_read_unlock();
	BUG_ON(!vb);

	spin_lock(&vb->lock);
	bitmap_allocate_region(vb->dirty_map, offset >> PAGE_SHIFT, order);
857

N
Nick Piggin 已提交
858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885
	vb->dirty += 1UL << order;
	if (vb->dirty == VMAP_BBMAP_BITS) {
		BUG_ON(vb->free || !list_empty(&vb->free_list));
		spin_unlock(&vb->lock);
		free_vmap_block(vb);
	} else
		spin_unlock(&vb->lock);
}

/**
 * vm_unmap_aliases - unmap outstanding lazy aliases in the vmap layer
 *
 * The vmap/vmalloc layer lazily flushes kernel virtual mappings primarily
 * to amortize TLB flushing overheads. What this means is that any page you
 * have now, may, in a former life, have been mapped into kernel virtual
 * address by the vmap layer and so there might be some CPUs with TLB entries
 * still referencing that page (additional to the regular 1:1 kernel mapping).
 *
 * vm_unmap_aliases flushes all such lazy mappings. After it returns, we can
 * be sure that none of the pages we have control over will have any aliases
 * from the vmap layer.
 */
void vm_unmap_aliases(void)
{
	unsigned long start = ULONG_MAX, end = 0;
	int cpu;
	int flush = 0;

886 887 888
	if (unlikely(!vmap_initialized))
		return;

N
Nick Piggin 已提交
889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943
	for_each_possible_cpu(cpu) {
		struct vmap_block_queue *vbq = &per_cpu(vmap_block_queue, cpu);
		struct vmap_block *vb;

		rcu_read_lock();
		list_for_each_entry_rcu(vb, &vbq->free, free_list) {
			int i;

			spin_lock(&vb->lock);
			i = find_first_bit(vb->dirty_map, VMAP_BBMAP_BITS);
			while (i < VMAP_BBMAP_BITS) {
				unsigned long s, e;
				int j;
				j = find_next_zero_bit(vb->dirty_map,
					VMAP_BBMAP_BITS, i);

				s = vb->va->va_start + (i << PAGE_SHIFT);
				e = vb->va->va_start + (j << PAGE_SHIFT);
				vunmap_page_range(s, e);
				flush = 1;

				if (s < start)
					start = s;
				if (e > end)
					end = e;

				i = j;
				i = find_next_bit(vb->dirty_map,
							VMAP_BBMAP_BITS, i);
			}
			spin_unlock(&vb->lock);
		}
		rcu_read_unlock();
	}

	__purge_vmap_area_lazy(&start, &end, 1, flush);
}
EXPORT_SYMBOL_GPL(vm_unmap_aliases);

/**
 * vm_unmap_ram - unmap linear kernel address space set up by vm_map_ram
 * @mem: the pointer returned by vm_map_ram
 * @count: the count passed to that vm_map_ram call (cannot unmap partial)
 */
void vm_unmap_ram(const void *mem, unsigned int count)
{
	unsigned long size = count << PAGE_SHIFT;
	unsigned long addr = (unsigned long)mem;

	BUG_ON(!addr);
	BUG_ON(addr < VMALLOC_START);
	BUG_ON(addr > VMALLOC_END);
	BUG_ON(addr & (PAGE_SIZE-1));

	debug_check_no_locks_freed(mem, size);
944
	vmap_debug_free_range(addr, addr+size);
N
Nick Piggin 已提交
945 946 947 948 949 950 951 952 953 954 955 956 957 958

	if (likely(count <= VMAP_MAX_ALLOC))
		vb_free(mem, size);
	else
		free_unmap_vmap_area_addr(addr);
}
EXPORT_SYMBOL(vm_unmap_ram);

/**
 * vm_map_ram - map pages linearly into kernel virtual address (vmalloc space)
 * @pages: an array of pointers to the pages to be mapped
 * @count: number of pages
 * @node: prefer to allocate data structures on this node
 * @prot: memory protection to use. PAGE_KERNEL for regular RAM
959 960
 *
 * Returns: a pointer to the address that has been mapped, or %NULL on failure
N
Nick Piggin 已提交
961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990
 */
void *vm_map_ram(struct page **pages, unsigned int count, int node, pgprot_t prot)
{
	unsigned long size = count << PAGE_SHIFT;
	unsigned long addr;
	void *mem;

	if (likely(count <= VMAP_MAX_ALLOC)) {
		mem = vb_alloc(size, GFP_KERNEL);
		if (IS_ERR(mem))
			return NULL;
		addr = (unsigned long)mem;
	} else {
		struct vmap_area *va;
		va = alloc_vmap_area(size, PAGE_SIZE,
				VMALLOC_START, VMALLOC_END, node, GFP_KERNEL);
		if (IS_ERR(va))
			return NULL;

		addr = va->va_start;
		mem = (void *)addr;
	}
	if (vmap_page_range(addr, addr + size, prot, pages) < 0) {
		vm_unmap_ram(mem, count);
		return NULL;
	}
	return mem;
}
EXPORT_SYMBOL(vm_map_ram);

991 992 993
/**
 * vm_area_register_early - register vmap area early during boot
 * @vm: vm_struct to register
994
 * @align: requested alignment
995 996 997 998 999 1000 1001 1002
 *
 * This function is used to register kernel vm area before
 * vmalloc_init() is called.  @vm->size and @vm->flags should contain
 * proper values on entry and other fields should be zero.  On return,
 * vm->addr contains the allocated address.
 *
 * DO NOT USE THIS FUNCTION UNLESS YOU KNOW WHAT YOU'RE DOING.
 */
1003
void __init vm_area_register_early(struct vm_struct *vm, size_t align)
1004 1005
{
	static size_t vm_init_off __initdata;
1006 1007 1008 1009
	unsigned long addr;

	addr = ALIGN(VMALLOC_START + vm_init_off, align);
	vm_init_off = PFN_ALIGN(addr + vm->size) - VMALLOC_START;
1010

1011
	vm->addr = (void *)addr;
1012 1013 1014 1015 1016

	vm->next = vmlist;
	vmlist = vm;
}

N
Nick Piggin 已提交
1017 1018
void __init vmalloc_init(void)
{
I
Ivan Kokshaysky 已提交
1019 1020
	struct vmap_area *va;
	struct vm_struct *tmp;
N
Nick Piggin 已提交
1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031
	int i;

	for_each_possible_cpu(i) {
		struct vmap_block_queue *vbq;

		vbq = &per_cpu(vmap_block_queue, i);
		spin_lock_init(&vbq->lock);
		INIT_LIST_HEAD(&vbq->free);
		INIT_LIST_HEAD(&vbq->dirty);
		vbq->nr_dirty = 0;
	}
1032

I
Ivan Kokshaysky 已提交
1033 1034 1035 1036 1037 1038 1039 1040
	/* Import existing vmlist entries. */
	for (tmp = vmlist; tmp; tmp = tmp->next) {
		va = alloc_bootmem(sizeof(struct vmap_area));
		va->flags = tmp->flags | VM_VM_AREA;
		va->va_start = (unsigned long)tmp->addr;
		va->va_end = va->va_start + tmp->size;
		__insert_vmap_area(va);
	}
1041
	vmap_initialized = true;
N
Nick Piggin 已提交
1042 1043
}

1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095
/**
 * map_kernel_range_noflush - map kernel VM area with the specified pages
 * @addr: start of the VM area to map
 * @size: size of the VM area to map
 * @prot: page protection flags to use
 * @pages: pages to map
 *
 * Map PFN_UP(@size) pages at @addr.  The VM area @addr and @size
 * specify should have been allocated using get_vm_area() and its
 * friends.
 *
 * NOTE:
 * This function does NOT do any cache flushing.  The caller is
 * responsible for calling flush_cache_vmap() on to-be-mapped areas
 * before calling this function.
 *
 * RETURNS:
 * The number of pages mapped on success, -errno on failure.
 */
int map_kernel_range_noflush(unsigned long addr, unsigned long size,
			     pgprot_t prot, struct page **pages)
{
	return vmap_page_range_noflush(addr, addr + size, prot, pages);
}

/**
 * unmap_kernel_range_noflush - unmap kernel VM area
 * @addr: start of the VM area to unmap
 * @size: size of the VM area to unmap
 *
 * Unmap PFN_UP(@size) pages at @addr.  The VM area @addr and @size
 * specify should have been allocated using get_vm_area() and its
 * friends.
 *
 * NOTE:
 * This function does NOT do any cache flushing.  The caller is
 * responsible for calling flush_cache_vunmap() on to-be-mapped areas
 * before calling this function and flush_tlb_kernel_range() after.
 */
void unmap_kernel_range_noflush(unsigned long addr, unsigned long size)
{
	vunmap_page_range(addr, addr + size);
}

/**
 * unmap_kernel_range - unmap kernel VM area and flush cache and TLB
 * @addr: start of the VM area to unmap
 * @size: size of the VM area to unmap
 *
 * Similar to unmap_kernel_range_noflush() but flushes vcache before
 * the unmapping and tlb after.
 */
N
Nick Piggin 已提交
1096 1097 1098
void unmap_kernel_range(unsigned long addr, unsigned long size)
{
	unsigned long end = addr + size;
1099 1100

	flush_cache_vunmap(addr, end);
N
Nick Piggin 已提交
1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132
	vunmap_page_range(addr, end);
	flush_tlb_kernel_range(addr, end);
}

int map_vm_area(struct vm_struct *area, pgprot_t prot, struct page ***pages)
{
	unsigned long addr = (unsigned long)area->addr;
	unsigned long end = addr + area->size - PAGE_SIZE;
	int err;

	err = vmap_page_range(addr, end, prot, *pages);
	if (err > 0) {
		*pages += err;
		err = 0;
	}

	return err;
}
EXPORT_SYMBOL_GPL(map_vm_area);

/*** Old vmalloc interfaces ***/
DEFINE_RWLOCK(vmlist_lock);
struct vm_struct *vmlist;

static struct vm_struct *__get_vm_area_node(unsigned long size,
		unsigned long flags, unsigned long start, unsigned long end,
		int node, gfp_t gfp_mask, void *caller)
{
	static struct vmap_area *va;
	struct vm_struct *area;
	struct vm_struct *tmp, **p;
	unsigned long align = 1;
L
Linus Torvalds 已提交
1133

1134
	BUG_ON(in_interrupt());
L
Linus Torvalds 已提交
1135 1136 1137 1138 1139 1140 1141 1142 1143 1144
	if (flags & VM_IOREMAP) {
		int bit = fls(size);

		if (bit > IOREMAP_MAX_ORDER)
			bit = IOREMAP_MAX_ORDER;
		else if (bit < PAGE_SHIFT)
			bit = PAGE_SHIFT;

		align = 1ul << bit;
	}
N
Nick Piggin 已提交
1145

L
Linus Torvalds 已提交
1146
	size = PAGE_ALIGN(size);
1147 1148
	if (unlikely(!size))
		return NULL;
L
Linus Torvalds 已提交
1149

C
Christoph Lameter 已提交
1150
	area = kmalloc_node(sizeof(*area), gfp_mask & GFP_RECLAIM_MASK, node);
L
Linus Torvalds 已提交
1151 1152 1153 1154 1155 1156 1157 1158
	if (unlikely(!area))
		return NULL;

	/*
	 * We always allocate a guard page.
	 */
	size += PAGE_SIZE;

N
Nick Piggin 已提交
1159 1160 1161 1162
	va = alloc_vmap_area(size, align, start, end, node, gfp_mask);
	if (IS_ERR(va)) {
		kfree(area);
		return NULL;
L
Linus Torvalds 已提交
1163 1164 1165
	}

	area->flags = flags;
N
Nick Piggin 已提交
1166
	area->addr = (void *)va->va_start;
L
Linus Torvalds 已提交
1167 1168 1169 1170
	area->size = size;
	area->pages = NULL;
	area->nr_pages = 0;
	area->phys_addr = 0;
1171
	area->caller = caller;
N
Nick Piggin 已提交
1172 1173 1174 1175 1176 1177 1178 1179 1180 1181
	va->private = area;
	va->flags |= VM_VM_AREA;

	write_lock(&vmlist_lock);
	for (p = &vmlist; (tmp = *p) != NULL; p = &tmp->next) {
		if (tmp->addr >= area->addr)
			break;
	}
	area->next = *p;
	*p = area;
L
Linus Torvalds 已提交
1182 1183 1184 1185 1186
	write_unlock(&vmlist_lock);

	return area;
}

C
Christoph Lameter 已提交
1187 1188 1189
struct vm_struct *__get_vm_area(unsigned long size, unsigned long flags,
				unsigned long start, unsigned long end)
{
1190 1191
	return __get_vm_area_node(size, flags, start, end, -1, GFP_KERNEL,
						__builtin_return_address(0));
C
Christoph Lameter 已提交
1192
}
1193
EXPORT_SYMBOL_GPL(__get_vm_area);
C
Christoph Lameter 已提交
1194

1195 1196 1197 1198 1199 1200 1201 1202
struct vm_struct *__get_vm_area_caller(unsigned long size, unsigned long flags,
				       unsigned long start, unsigned long end,
				       void *caller)
{
	return __get_vm_area_node(size, flags, start, end, -1, GFP_KERNEL,
				  caller);
}

L
Linus Torvalds 已提交
1203
/**
S
Simon Arlott 已提交
1204
 *	get_vm_area  -  reserve a contiguous kernel virtual area
L
Linus Torvalds 已提交
1205 1206 1207 1208 1209 1210 1211 1212 1213
 *	@size:		size of the area
 *	@flags:		%VM_IOREMAP for I/O mappings or VM_ALLOC
 *
 *	Search an area of @size in the kernel virtual mapping area,
 *	and reserved it for out purposes.  Returns the area descriptor
 *	on success or %NULL on failure.
 */
struct vm_struct *get_vm_area(unsigned long size, unsigned long flags)
{
1214 1215 1216 1217 1218 1219 1220 1221 1222
	return __get_vm_area_node(size, flags, VMALLOC_START, VMALLOC_END,
				-1, GFP_KERNEL, __builtin_return_address(0));
}

struct vm_struct *get_vm_area_caller(unsigned long size, unsigned long flags,
				void *caller)
{
	return __get_vm_area_node(size, flags, VMALLOC_START, VMALLOC_END,
						-1, GFP_KERNEL, caller);
L
Linus Torvalds 已提交
1223 1224
}

1225 1226
struct vm_struct *get_vm_area_node(unsigned long size, unsigned long flags,
				   int node, gfp_t gfp_mask)
C
Christoph Lameter 已提交
1227
{
1228
	return __get_vm_area_node(size, flags, VMALLOC_START, VMALLOC_END, node,
1229
				  gfp_mask, __builtin_return_address(0));
C
Christoph Lameter 已提交
1230 1231
}

N
Nick Piggin 已提交
1232
static struct vm_struct *find_vm_area(const void *addr)
1233
{
N
Nick Piggin 已提交
1234
	struct vmap_area *va;
1235

N
Nick Piggin 已提交
1236 1237 1238
	va = find_vmap_area((unsigned long)addr);
	if (va && va->flags & VM_VM_AREA)
		return va->private;
L
Linus Torvalds 已提交
1239 1240 1241 1242

	return NULL;
}

1243
/**
S
Simon Arlott 已提交
1244
 *	remove_vm_area  -  find and remove a continuous kernel virtual area
1245 1246 1247 1248 1249 1250
 *	@addr:		base address
 *
 *	Search for the kernel VM area starting at @addr, and remove it.
 *	This function returns the found VM area, but using it is NOT safe
 *	on SMP machines, except for its size or flags.
 */
1251
struct vm_struct *remove_vm_area(const void *addr)
1252
{
N
Nick Piggin 已提交
1253 1254 1255 1256 1257 1258
	struct vmap_area *va;

	va = find_vmap_area((unsigned long)addr);
	if (va && va->flags & VM_VM_AREA) {
		struct vm_struct *vm = va->private;
		struct vm_struct *tmp, **p;
1259 1260

		vmap_debug_free_range(va->va_start, va->va_end);
N
Nick Piggin 已提交
1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272
		free_unmap_vmap_area(va);
		vm->size -= PAGE_SIZE;

		write_lock(&vmlist_lock);
		for (p = &vmlist; (tmp = *p) != vm; p = &tmp->next)
			;
		*p = tmp->next;
		write_unlock(&vmlist_lock);

		return vm;
	}
	return NULL;
1273 1274
}

1275
static void __vunmap(const void *addr, int deallocate_pages)
L
Linus Torvalds 已提交
1276 1277 1278 1279 1280 1281 1282
{
	struct vm_struct *area;

	if (!addr)
		return;

	if ((PAGE_SIZE-1) & (unsigned long)addr) {
A
Arjan van de Ven 已提交
1283
		WARN(1, KERN_ERR "Trying to vfree() bad address (%p)\n", addr);
L
Linus Torvalds 已提交
1284 1285 1286 1287 1288
		return;
	}

	area = remove_vm_area(addr);
	if (unlikely(!area)) {
A
Arjan van de Ven 已提交
1289
		WARN(1, KERN_ERR "Trying to vfree() nonexistent vm area (%p)\n",
L
Linus Torvalds 已提交
1290 1291 1292 1293
				addr);
		return;
	}

1294
	debug_check_no_locks_freed(addr, area->size);
1295
	debug_check_no_obj_freed(addr, area->size);
1296

L
Linus Torvalds 已提交
1297 1298 1299 1300
	if (deallocate_pages) {
		int i;

		for (i = 0; i < area->nr_pages; i++) {
1301 1302 1303 1304
			struct page *page = area->pages[i];

			BUG_ON(!page);
			__free_page(page);
L
Linus Torvalds 已提交
1305 1306
		}

1307
		if (area->flags & VM_VPAGES)
L
Linus Torvalds 已提交
1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320
			vfree(area->pages);
		else
			kfree(area->pages);
	}

	kfree(area);
	return;
}

/**
 *	vfree  -  release memory allocated by vmalloc()
 *	@addr:		memory base address
 *
S
Simon Arlott 已提交
1321
 *	Free the virtually continuous memory area starting at @addr, as
1322 1323
 *	obtained from vmalloc(), vmalloc_32() or __vmalloc(). If @addr is
 *	NULL, no operation is performed.
L
Linus Torvalds 已提交
1324
 *
1325
 *	Must not be called in interrupt context.
L
Linus Torvalds 已提交
1326
 */
1327
void vfree(const void *addr)
L
Linus Torvalds 已提交
1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340
{
	BUG_ON(in_interrupt());
	__vunmap(addr, 1);
}
EXPORT_SYMBOL(vfree);

/**
 *	vunmap  -  release virtual mapping obtained by vmap()
 *	@addr:		memory base address
 *
 *	Free the virtually contiguous memory area starting at @addr,
 *	which was created from the page array passed to vmap().
 *
1341
 *	Must not be called in interrupt context.
L
Linus Torvalds 已提交
1342
 */
1343
void vunmap(const void *addr)
L
Linus Torvalds 已提交
1344 1345
{
	BUG_ON(in_interrupt());
1346
	might_sleep();
L
Linus Torvalds 已提交
1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365
	__vunmap(addr, 0);
}
EXPORT_SYMBOL(vunmap);

/**
 *	vmap  -  map an array of pages into virtually contiguous space
 *	@pages:		array of page pointers
 *	@count:		number of pages to map
 *	@flags:		vm_area->flags
 *	@prot:		page protection for the mapping
 *
 *	Maps @count pages from @pages into contiguous kernel virtual
 *	space.
 */
void *vmap(struct page **pages, unsigned int count,
		unsigned long flags, pgprot_t prot)
{
	struct vm_struct *area;

1366 1367
	might_sleep();

L
Linus Torvalds 已提交
1368 1369 1370
	if (count > num_physpages)
		return NULL;

1371 1372
	area = get_vm_area_caller((count << PAGE_SHIFT), flags,
					__builtin_return_address(0));
L
Linus Torvalds 已提交
1373 1374
	if (!area)
		return NULL;
1375

L
Linus Torvalds 已提交
1376 1377 1378 1379 1380 1381 1382 1383 1384
	if (map_vm_area(area, prot, &pages)) {
		vunmap(area->addr);
		return NULL;
	}

	return area->addr;
}
EXPORT_SYMBOL(vmap);

N
Nick Piggin 已提交
1385 1386
static void *__vmalloc_node(unsigned long size, gfp_t gfp_mask, pgprot_t prot,
			    int node, void *caller);
A
Adrian Bunk 已提交
1387
static void *__vmalloc_area_node(struct vm_struct *area, gfp_t gfp_mask,
1388
				 pgprot_t prot, int node, void *caller)
L
Linus Torvalds 已提交
1389 1390 1391 1392 1393 1394 1395 1396 1397
{
	struct page **pages;
	unsigned int nr_pages, array_size, i;

	nr_pages = (area->size - PAGE_SIZE) >> PAGE_SHIFT;
	array_size = (nr_pages * sizeof(struct page *));

	area->nr_pages = nr_pages;
	/* Please note that the recursion is strictly bounded. */
1398
	if (array_size > PAGE_SIZE) {
1399
		pages = __vmalloc_node(array_size, gfp_mask | __GFP_ZERO,
1400
				PAGE_KERNEL, node, caller);
1401
		area->flags |= VM_VPAGES;
1402 1403
	} else {
		pages = kmalloc_node(array_size,
C
Christoph Lameter 已提交
1404
				(gfp_mask & GFP_RECLAIM_MASK) | __GFP_ZERO,
1405 1406
				node);
	}
L
Linus Torvalds 已提交
1407
	area->pages = pages;
1408
	area->caller = caller;
L
Linus Torvalds 已提交
1409 1410 1411 1412 1413 1414 1415
	if (!area->pages) {
		remove_vm_area(area->addr);
		kfree(area);
		return NULL;
	}

	for (i = 0; i < area->nr_pages; i++) {
1416 1417
		struct page *page;

C
Christoph Lameter 已提交
1418
		if (node < 0)
1419
			page = alloc_page(gfp_mask);
C
Christoph Lameter 已提交
1420
		else
1421 1422 1423
			page = alloc_pages_node(node, gfp_mask, 0);

		if (unlikely(!page)) {
L
Linus Torvalds 已提交
1424 1425 1426 1427
			/* Successfully allocated i pages, free them in __vunmap() */
			area->nr_pages = i;
			goto fail;
		}
1428
		area->pages[i] = page;
L
Linus Torvalds 已提交
1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439
	}

	if (map_vm_area(area, prot, &pages))
		goto fail;
	return area->addr;

fail:
	vfree(area->addr);
	return NULL;
}

C
Christoph Lameter 已提交
1440 1441
void *__vmalloc_area(struct vm_struct *area, gfp_t gfp_mask, pgprot_t prot)
{
1442 1443
	return __vmalloc_area_node(area, gfp_mask, prot, -1,
					__builtin_return_address(0));
C
Christoph Lameter 已提交
1444 1445
}

L
Linus Torvalds 已提交
1446
/**
C
Christoph Lameter 已提交
1447
 *	__vmalloc_node  -  allocate virtually contiguous memory
L
Linus Torvalds 已提交
1448 1449 1450
 *	@size:		allocation size
 *	@gfp_mask:	flags for the page level allocator
 *	@prot:		protection mask for the allocated pages
1451
 *	@node:		node to use for allocation or -1
1452
 *	@caller:	caller's return address
L
Linus Torvalds 已提交
1453 1454 1455 1456 1457
 *
 *	Allocate enough pages to cover @size from the page level
 *	allocator with @gfp_mask flags.  Map them into contiguous
 *	kernel virtual space, using a pagetable protection of @prot.
 */
A
Adrian Bunk 已提交
1458
static void *__vmalloc_node(unsigned long size, gfp_t gfp_mask, pgprot_t prot,
1459
						int node, void *caller)
L
Linus Torvalds 已提交
1460 1461 1462 1463 1464 1465 1466
{
	struct vm_struct *area;

	size = PAGE_ALIGN(size);
	if (!size || (size >> PAGE_SHIFT) > num_physpages)
		return NULL;

1467 1468 1469
	area = __get_vm_area_node(size, VM_ALLOC, VMALLOC_START, VMALLOC_END,
						node, gfp_mask, caller);

L
Linus Torvalds 已提交
1470 1471 1472
	if (!area)
		return NULL;

1473
	return __vmalloc_area_node(area, gfp_mask, prot, node, caller);
L
Linus Torvalds 已提交
1474 1475
}

C
Christoph Lameter 已提交
1476 1477
void *__vmalloc(unsigned long size, gfp_t gfp_mask, pgprot_t prot)
{
1478 1479
	return __vmalloc_node(size, gfp_mask, prot, -1,
				__builtin_return_address(0));
C
Christoph Lameter 已提交
1480
}
L
Linus Torvalds 已提交
1481 1482 1483 1484 1485 1486 1487 1488
EXPORT_SYMBOL(__vmalloc);

/**
 *	vmalloc  -  allocate virtually contiguous memory
 *	@size:		allocation size
 *	Allocate enough pages to cover @size from the page level
 *	allocator and map them into contiguous kernel virtual space.
 *
1489
 *	For tight control over page level allocator and protection flags
L
Linus Torvalds 已提交
1490 1491 1492 1493
 *	use __vmalloc() instead.
 */
void *vmalloc(unsigned long size)
{
1494 1495
	return __vmalloc_node(size, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL,
					-1, __builtin_return_address(0));
L
Linus Torvalds 已提交
1496 1497 1498
}
EXPORT_SYMBOL(vmalloc);

1499
/**
1500 1501
 * vmalloc_user - allocate zeroed virtually contiguous memory for userspace
 * @size: allocation size
1502
 *
1503 1504
 * The resulting memory area is zeroed so it can be mapped to userspace
 * without leaking data.
1505 1506 1507 1508 1509 1510
 */
void *vmalloc_user(unsigned long size)
{
	struct vm_struct *area;
	void *ret;

G
Glauber Costa 已提交
1511 1512
	ret = __vmalloc_node(size, GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO,
			     PAGE_KERNEL, -1, __builtin_return_address(0));
1513
	if (ret) {
N
Nick Piggin 已提交
1514
		area = find_vm_area(ret);
1515 1516
		area->flags |= VM_USERMAP;
	}
1517 1518 1519 1520
	return ret;
}
EXPORT_SYMBOL(vmalloc_user);

C
Christoph Lameter 已提交
1521 1522 1523
/**
 *	vmalloc_node  -  allocate memory on a specific node
 *	@size:		allocation size
1524
 *	@node:		numa node
C
Christoph Lameter 已提交
1525 1526 1527 1528
 *
 *	Allocate enough pages to cover @size from the page level
 *	allocator and map them into contiguous kernel virtual space.
 *
1529
 *	For tight control over page level allocator and protection flags
C
Christoph Lameter 已提交
1530 1531 1532 1533
 *	use __vmalloc() instead.
 */
void *vmalloc_node(unsigned long size, int node)
{
1534 1535
	return __vmalloc_node(size, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL,
					node, __builtin_return_address(0));
C
Christoph Lameter 已提交
1536 1537 1538
}
EXPORT_SYMBOL(vmalloc_node);

1539 1540 1541 1542
#ifndef PAGE_KERNEL_EXEC
# define PAGE_KERNEL_EXEC PAGE_KERNEL
#endif

L
Linus Torvalds 已提交
1543 1544 1545 1546 1547 1548 1549 1550
/**
 *	vmalloc_exec  -  allocate virtually contiguous, executable memory
 *	@size:		allocation size
 *
 *	Kernel-internal function to allocate enough pages to cover @size
 *	the page level allocator and map them into contiguous and
 *	executable kernel virtual space.
 *
1551
 *	For tight control over page level allocator and protection flags
L
Linus Torvalds 已提交
1552 1553 1554 1555 1556
 *	use __vmalloc() instead.
 */

void *vmalloc_exec(unsigned long size)
{
G
Glauber Costa 已提交
1557 1558
	return __vmalloc_node(size, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL_EXEC,
			      -1, __builtin_return_address(0));
L
Linus Torvalds 已提交
1559 1560
}

1561
#if defined(CONFIG_64BIT) && defined(CONFIG_ZONE_DMA32)
1562
#define GFP_VMALLOC32 GFP_DMA32 | GFP_KERNEL
1563
#elif defined(CONFIG_64BIT) && defined(CONFIG_ZONE_DMA)
1564
#define GFP_VMALLOC32 GFP_DMA | GFP_KERNEL
1565 1566 1567 1568
#else
#define GFP_VMALLOC32 GFP_KERNEL
#endif

L
Linus Torvalds 已提交
1569 1570 1571 1572 1573 1574 1575 1576 1577
/**
 *	vmalloc_32  -  allocate virtually contiguous memory (32bit addressable)
 *	@size:		allocation size
 *
 *	Allocate enough 32bit PA addressable pages to cover @size from the
 *	page level allocator and map them into contiguous kernel virtual space.
 */
void *vmalloc_32(unsigned long size)
{
G
Glauber Costa 已提交
1578 1579
	return __vmalloc_node(size, GFP_VMALLOC32, PAGE_KERNEL,
			      -1, __builtin_return_address(0));
L
Linus Torvalds 已提交
1580 1581 1582
}
EXPORT_SYMBOL(vmalloc_32);

1583
/**
1584
 * vmalloc_32_user - allocate zeroed virtually contiguous 32bit memory
1585
 *	@size:		allocation size
1586 1587 1588
 *
 * The resulting memory area is 32bit addressable and zeroed so it can be
 * mapped to userspace without leaking data.
1589 1590 1591 1592 1593 1594
 */
void *vmalloc_32_user(unsigned long size)
{
	struct vm_struct *area;
	void *ret;

G
Glauber Costa 已提交
1595 1596
	ret = __vmalloc_node(size, GFP_VMALLOC32 | __GFP_ZERO, PAGE_KERNEL,
			     -1, __builtin_return_address(0));
1597
	if (ret) {
N
Nick Piggin 已提交
1598
		area = find_vm_area(ret);
1599 1600
		area->flags |= VM_USERMAP;
	}
1601 1602 1603 1604
	return ret;
}
EXPORT_SYMBOL(vmalloc_32_user);

L
Linus Torvalds 已提交
1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678
long vread(char *buf, char *addr, unsigned long count)
{
	struct vm_struct *tmp;
	char *vaddr, *buf_start = buf;
	unsigned long n;

	/* Don't allow overflow */
	if ((unsigned long) addr + count < count)
		count = -(unsigned long) addr;

	read_lock(&vmlist_lock);
	for (tmp = vmlist; tmp; tmp = tmp->next) {
		vaddr = (char *) tmp->addr;
		if (addr >= vaddr + tmp->size - PAGE_SIZE)
			continue;
		while (addr < vaddr) {
			if (count == 0)
				goto finished;
			*buf = '\0';
			buf++;
			addr++;
			count--;
		}
		n = vaddr + tmp->size - PAGE_SIZE - addr;
		do {
			if (count == 0)
				goto finished;
			*buf = *addr;
			buf++;
			addr++;
			count--;
		} while (--n > 0);
	}
finished:
	read_unlock(&vmlist_lock);
	return buf - buf_start;
}

long vwrite(char *buf, char *addr, unsigned long count)
{
	struct vm_struct *tmp;
	char *vaddr, *buf_start = buf;
	unsigned long n;

	/* Don't allow overflow */
	if ((unsigned long) addr + count < count)
		count = -(unsigned long) addr;

	read_lock(&vmlist_lock);
	for (tmp = vmlist; tmp; tmp = tmp->next) {
		vaddr = (char *) tmp->addr;
		if (addr >= vaddr + tmp->size - PAGE_SIZE)
			continue;
		while (addr < vaddr) {
			if (count == 0)
				goto finished;
			buf++;
			addr++;
			count--;
		}
		n = vaddr + tmp->size - PAGE_SIZE - addr;
		do {
			if (count == 0)
				goto finished;
			*addr = *buf;
			buf++;
			addr++;
			count--;
		} while (--n > 0);
	}
finished:
	read_unlock(&vmlist_lock);
	return buf - buf_start;
}
1679 1680 1681 1682 1683 1684

/**
 *	remap_vmalloc_range  -  map vmalloc pages to userspace
 *	@vma:		vma to cover (map full range of vma)
 *	@addr:		vmalloc memory
 *	@pgoff:		number of pages into addr before first page to map
1685 1686
 *
 *	Returns:	0 for success, -Exxx on failure
1687 1688 1689 1690 1691
 *
 *	This function checks that addr is a valid vmalloc'ed area, and
 *	that it is big enough to cover the vma. Will return failure if
 *	that criteria isn't met.
 *
1692
 *	Similar to remap_pfn_range() (see mm/memory.c)
1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703
 */
int remap_vmalloc_range(struct vm_area_struct *vma, void *addr,
						unsigned long pgoff)
{
	struct vm_struct *area;
	unsigned long uaddr = vma->vm_start;
	unsigned long usize = vma->vm_end - vma->vm_start;

	if ((PAGE_SIZE-1) & (unsigned long)addr)
		return -EINVAL;

N
Nick Piggin 已提交
1704
	area = find_vm_area(addr);
1705
	if (!area)
N
Nick Piggin 已提交
1706
		return -EINVAL;
1707 1708

	if (!(area->flags & VM_USERMAP))
N
Nick Piggin 已提交
1709
		return -EINVAL;
1710 1711

	if (usize + (pgoff << PAGE_SHIFT) > area->size - PAGE_SIZE)
N
Nick Piggin 已提交
1712
		return -EINVAL;
1713 1714 1715 1716

	addr += pgoff << PAGE_SHIFT;
	do {
		struct page *page = vmalloc_to_page(addr);
N
Nick Piggin 已提交
1717 1718
		int ret;

1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730
		ret = vm_insert_page(vma, uaddr, page);
		if (ret)
			return ret;

		uaddr += PAGE_SIZE;
		addr += PAGE_SIZE;
		usize -= PAGE_SIZE;
	} while (usize > 0);

	/* Prevent "things" like memory migration? VM_flags need a cleanup... */
	vma->vm_flags |= VM_RESERVED;

N
Nick Piggin 已提交
1731
	return 0;
1732 1733 1734
}
EXPORT_SYMBOL(remap_vmalloc_range);

1735 1736 1737 1738 1739 1740 1741
/*
 * Implement a stub for vmalloc_sync_all() if the architecture chose not to
 * have one.
 */
void  __attribute__((weak)) vmalloc_sync_all(void)
{
}
1742 1743


1744
static int f(pte_t *pte, pgtable_t table, unsigned long addr, void *data)
1745 1746 1747 1748 1749 1750 1751 1752
{
	/* apply_to_page_range() does all the hard work. */
	return 0;
}

/**
 *	alloc_vm_area - allocate a range of kernel address space
 *	@size:		size of the area
1753 1754
 *
 *	Returns:	NULL on failure, vm_struct on success
1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765
 *
 *	This function reserves a range of kernel address space, and
 *	allocates pagetables to map that range.  No actual mappings
 *	are created.  If the kernel address space is not shared
 *	between processes, it syncs the pagetable across all
 *	processes.
 */
struct vm_struct *alloc_vm_area(size_t size)
{
	struct vm_struct *area;

1766 1767
	area = get_vm_area_caller(size, VM_IOREMAP,
				__builtin_return_address(0));
1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796
	if (area == NULL)
		return NULL;

	/*
	 * This ensures that page tables are constructed for this region
	 * of kernel virtual address space and mapped into init_mm.
	 */
	if (apply_to_page_range(&init_mm, (unsigned long)area->addr,
				area->size, f, NULL)) {
		free_vm_area(area);
		return NULL;
	}

	/* Make sure the pagetables are constructed in process kernel
	   mappings */
	vmalloc_sync_all();

	return area;
}
EXPORT_SYMBOL_GPL(alloc_vm_area);

void free_vm_area(struct vm_struct *area)
{
	struct vm_struct *ret;
	ret = remove_vm_area(area->addr);
	BUG_ON(ret != area);
	kfree(area);
}
EXPORT_SYMBOL_GPL(free_vm_area);
1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830


#ifdef CONFIG_PROC_FS
static void *s_start(struct seq_file *m, loff_t *pos)
{
	loff_t n = *pos;
	struct vm_struct *v;

	read_lock(&vmlist_lock);
	v = vmlist;
	while (n > 0 && v) {
		n--;
		v = v->next;
	}
	if (!n)
		return v;

	return NULL;

}

static void *s_next(struct seq_file *m, void *p, loff_t *pos)
{
	struct vm_struct *v = p;

	++*pos;
	return v->next;
}

static void s_stop(struct seq_file *m, void *p)
{
	read_unlock(&vmlist_lock);
}

E
Eric Dumazet 已提交
1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849
static void show_numa_info(struct seq_file *m, struct vm_struct *v)
{
	if (NUMA_BUILD) {
		unsigned int nr, *counters = m->private;

		if (!counters)
			return;

		memset(counters, 0, nr_node_ids * sizeof(unsigned int));

		for (nr = 0; nr < v->nr_pages; nr++)
			counters[page_to_nid(v->pages[nr])]++;

		for_each_node_state(nr, N_HIGH_MEMORY)
			if (counters[nr])
				seq_printf(m, " N%u=%u", nr, counters[nr]);
	}
}

1850 1851 1852 1853 1854 1855 1856
static int s_show(struct seq_file *m, void *p)
{
	struct vm_struct *v = p;

	seq_printf(m, "0x%p-0x%p %7ld",
		v->addr, v->addr + v->size, v->size);

1857
	if (v->caller) {
H
Hugh Dickins 已提交
1858
		char buff[KSYM_SYMBOL_LEN];
1859 1860 1861 1862 1863 1864

		seq_putc(m, ' ');
		sprint_symbol(buff, (unsigned long)v->caller);
		seq_puts(m, buff);
	}

1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885
	if (v->nr_pages)
		seq_printf(m, " pages=%d", v->nr_pages);

	if (v->phys_addr)
		seq_printf(m, " phys=%lx", v->phys_addr);

	if (v->flags & VM_IOREMAP)
		seq_printf(m, " ioremap");

	if (v->flags & VM_ALLOC)
		seq_printf(m, " vmalloc");

	if (v->flags & VM_MAP)
		seq_printf(m, " vmap");

	if (v->flags & VM_USERMAP)
		seq_printf(m, " user");

	if (v->flags & VM_VPAGES)
		seq_printf(m, " vpages");

E
Eric Dumazet 已提交
1886
	show_numa_info(m, v);
1887 1888 1889 1890
	seq_putc(m, '\n');
	return 0;
}

1891
static const struct seq_operations vmalloc_op = {
1892 1893 1894 1895 1896
	.start = s_start,
	.next = s_next,
	.stop = s_stop,
	.show = s_show,
};
1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926

static int vmalloc_open(struct inode *inode, struct file *file)
{
	unsigned int *ptr = NULL;
	int ret;

	if (NUMA_BUILD)
		ptr = kmalloc(nr_node_ids * sizeof(unsigned int), GFP_KERNEL);
	ret = seq_open(file, &vmalloc_op);
	if (!ret) {
		struct seq_file *m = file->private_data;
		m->private = ptr;
	} else
		kfree(ptr);
	return ret;
}

static const struct file_operations proc_vmalloc_operations = {
	.open		= vmalloc_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= seq_release_private,
};

static int __init proc_vmalloc_init(void)
{
	proc_create("vmallocinfo", S_IRUSR, NULL, &proc_vmalloc_operations);
	return 0;
}
module_init(proc_vmalloc_init);
1927 1928
#endif