4 * Copyright (C) 1993 Linus Torvalds
5 * Support of BIGMEM added by Gerhard Wichert, Siemens AG, July 1999
6 * SMP-safe vmalloc/vfree/ioremap, Tigran Aivazian <tigran@veritas.com>, May 2000
7 * Major rework to support vmap/vunmap, Christoph Hellwig, SGI, August 2002
8 * Numa awareness, Christoph Lameter, SGI, June 2005
11 #include <linux/vmalloc.h>
13 #include <linux/module.h>
14 #include <linux/highmem.h>
15 #include <linux/sched.h>
16 #include <linux/slab.h>
17 #include <linux/spinlock.h>
18 #include <linux/interrupt.h>
19 #include <linux/proc_fs.h>
20 #include <linux/seq_file.h>
21 #include <linux/debugobjects.h>
22 #include <linux/kallsyms.h>
23 #include <linux/list.h>
24 #include <linux/rbtree.h>
25 #include <linux/radix-tree.h>
26 #include <linux/rcupdate.h>
27 #include <linux/pfn.h>
28 #include <linux/kmemleak.h>
29 #include <asm/atomic.h>
30 #include <asm/uaccess.h>
31 #include <asm/tlbflush.h>
32 #include <asm/shmparam.h>
34 /*** Page table manipulation functions ***/
36 static void vunmap_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end)
40 pte = pte_offset_kernel(pmd, addr);
42 pte_t ptent = ptep_get_and_clear(&init_mm, addr, pte);
43 WARN_ON(!pte_none(ptent) && !pte_present(ptent));
44 } while (pte++, addr += PAGE_SIZE, addr != end);
47 static void vunmap_pmd_range(pud_t *pud, unsigned long addr, unsigned long end)
52 pmd = pmd_offset(pud, addr);
54 next = pmd_addr_end(addr, end);
55 if (pmd_none_or_clear_bad(pmd))
57 vunmap_pte_range(pmd, addr, next);
58 } while (pmd++, addr = next, addr != end);
61 static void vunmap_pud_range(pgd_t *pgd, unsigned long addr, unsigned long end)
66 pud = pud_offset(pgd, addr);
68 next = pud_addr_end(addr, end);
69 if (pud_none_or_clear_bad(pud))
71 vunmap_pmd_range(pud, addr, next);
72 } while (pud++, addr = next, addr != end);
75 static void vunmap_page_range(unsigned long addr, unsigned long end)
81 pgd = pgd_offset_k(addr);
83 next = pgd_addr_end(addr, end);
84 if (pgd_none_or_clear_bad(pgd))
86 vunmap_pud_range(pgd, addr, next);
87 } while (pgd++, addr = next, addr != end);
90 static int vmap_pte_range(pmd_t *pmd, unsigned long addr,
91 unsigned long end, pgprot_t prot, struct page **pages, int *nr)
96 * nr is a running index into the array which helps higher level
97 * callers keep track of where we're up to.
100 pte = pte_alloc_kernel(pmd, addr);
104 struct page *page = pages[*nr];
106 if (WARN_ON(!pte_none(*pte)))
110 set_pte_at(&init_mm, addr, pte, mk_pte(page, prot));
112 } while (pte++, addr += PAGE_SIZE, addr != end);
116 static int vmap_pmd_range(pud_t *pud, unsigned long addr,
117 unsigned long end, pgprot_t prot, struct page **pages, int *nr)
122 pmd = pmd_alloc(&init_mm, pud, addr);
126 next = pmd_addr_end(addr, end);
127 if (vmap_pte_range(pmd, addr, next, prot, pages, nr))
129 } while (pmd++, addr = next, addr != end);
133 static int vmap_pud_range(pgd_t *pgd, unsigned long addr,
134 unsigned long end, pgprot_t prot, struct page **pages, int *nr)
139 pud = pud_alloc(&init_mm, pgd, addr);
143 next = pud_addr_end(addr, end);
144 if (vmap_pmd_range(pud, addr, next, prot, pages, nr))
146 } while (pud++, addr = next, addr != end);
151 * Set up page tables in kva (addr, end). The ptes shall have prot "prot", and
152 * will have pfns corresponding to the "pages" array.
154 * Ie. pte at addr+N*PAGE_SIZE shall point to pfn corresponding to pages[N]
156 static int vmap_page_range_noflush(unsigned long start, unsigned long end,
157 pgprot_t prot, struct page **pages)
161 unsigned long addr = start;
166 pgd = pgd_offset_k(addr);
168 next = pgd_addr_end(addr, end);
169 err = vmap_pud_range(pgd, addr, next, prot, pages, &nr);
172 } while (pgd++, addr = next, addr != end);
177 static int vmap_page_range(unsigned long start, unsigned long end,
178 pgprot_t prot, struct page **pages)
182 ret = vmap_page_range_noflush(start, end, prot, pages);
183 flush_cache_vmap(start, end);
187 int is_vmalloc_or_module_addr(const void *x)
190 * ARM, x86-64 and sparc64 put modules in a special place,
191 * and fall back on vmalloc() if that fails. Others
192 * just put it in the vmalloc space.
194 #if defined(CONFIG_MODULES) && defined(MODULES_VADDR)
195 unsigned long addr = (unsigned long)x;
196 if (addr >= MODULES_VADDR && addr < MODULES_END)
199 return is_vmalloc_addr(x);
203 * Walk a vmap address to the struct page it maps.
205 struct page *vmalloc_to_page(const void *vmalloc_addr)
207 unsigned long addr = (unsigned long) vmalloc_addr;
208 struct page *page = NULL;
209 pgd_t *pgd = pgd_offset_k(addr);
212 * XXX we might need to change this if we add VIRTUAL_BUG_ON for
213 * architectures that do not vmalloc module space
215 VIRTUAL_BUG_ON(!is_vmalloc_or_module_addr(vmalloc_addr));
217 if (!pgd_none(*pgd)) {
218 pud_t *pud = pud_offset(pgd, addr);
219 if (!pud_none(*pud)) {
220 pmd_t *pmd = pmd_offset(pud, addr);
221 if (!pmd_none(*pmd)) {
224 ptep = pte_offset_map(pmd, addr);
226 if (pte_present(pte))
227 page = pte_page(pte);
234 EXPORT_SYMBOL(vmalloc_to_page);
237 * Map a vmalloc()-space virtual address to the physical page frame number.
239 unsigned long vmalloc_to_pfn(const void *vmalloc_addr)
241 return page_to_pfn(vmalloc_to_page(vmalloc_addr));
243 EXPORT_SYMBOL(vmalloc_to_pfn);
246 /*** Global kva allocator ***/
248 #define VM_LAZY_FREE 0x01
249 #define VM_LAZY_FREEING 0x02
250 #define VM_VM_AREA 0x04
253 unsigned long va_start;
254 unsigned long va_end;
256 struct rb_node rb_node; /* address sorted rbtree */
257 struct list_head list; /* address sorted list */
258 struct list_head purge_list; /* "lazy purge" list */
260 struct rcu_head rcu_head;
263 static DEFINE_SPINLOCK(vmap_area_lock);
264 static LIST_HEAD(vmap_area_list);
265 static struct rb_root vmap_area_root = RB_ROOT;
267 /* The vmap cache globals are protected by vmap_area_lock */
268 static struct rb_node *free_vmap_cache;
269 static unsigned long cached_hole_size;
270 static unsigned long cached_vstart;
271 static unsigned long cached_align;
273 static unsigned long vmap_area_pcpu_hole;
275 static struct vmap_area *__find_vmap_area(unsigned long addr)
277 struct rb_node *n = vmap_area_root.rb_node;
280 struct vmap_area *va;
282 va = rb_entry(n, struct vmap_area, rb_node);
283 if (addr < va->va_start)
285 else if (addr > va->va_start)
294 static void __insert_vmap_area(struct vmap_area *va)
296 struct rb_node **p = &vmap_area_root.rb_node;
297 struct rb_node *parent = NULL;
301 struct vmap_area *tmp_va;
304 tmp_va = rb_entry(parent, struct vmap_area, rb_node);
305 if (va->va_start < tmp_va->va_end)
307 else if (va->va_end > tmp_va->va_start)
313 rb_link_node(&va->rb_node, parent, p);
314 rb_insert_color(&va->rb_node, &vmap_area_root);
316 /* address-sort this list so it is usable like the vmlist */
317 tmp = rb_prev(&va->rb_node);
319 struct vmap_area *prev;
320 prev = rb_entry(tmp, struct vmap_area, rb_node);
321 list_add_rcu(&va->list, &prev->list);
323 list_add_rcu(&va->list, &vmap_area_list);
326 static void purge_vmap_area_lazy(void);
329 * Allocate a region of KVA of the specified size and alignment, within the
332 static struct vmap_area *alloc_vmap_area(unsigned long size,
334 unsigned long vstart, unsigned long vend,
335 int node, gfp_t gfp_mask)
337 struct vmap_area *va;
341 struct vmap_area *first;
344 BUG_ON(size & ~PAGE_MASK);
345 BUG_ON(!is_power_of_2(align));
347 va = kmalloc_node(sizeof(struct vmap_area),
348 gfp_mask & GFP_RECLAIM_MASK, node);
350 return ERR_PTR(-ENOMEM);
353 spin_lock(&vmap_area_lock);
355 * Invalidate cache if we have more permissive parameters.
356 * cached_hole_size notes the largest hole noticed _below_
357 * the vmap_area cached in free_vmap_cache: if size fits
358 * into that hole, we want to scan from vstart to reuse
359 * the hole instead of allocating above free_vmap_cache.
360 * Note that __free_vmap_area may update free_vmap_cache
361 * without updating cached_hole_size or cached_align.
363 if (!free_vmap_cache ||
364 size < cached_hole_size ||
365 vstart < cached_vstart ||
366 align < cached_align) {
368 cached_hole_size = 0;
369 free_vmap_cache = NULL;
371 /* record if we encounter less permissive parameters */
372 cached_vstart = vstart;
373 cached_align = align;
375 /* find starting point for our search */
376 if (free_vmap_cache) {
377 first = rb_entry(free_vmap_cache, struct vmap_area, rb_node);
378 addr = ALIGN(first->va_end, align);
381 if (addr + size - 1 < addr)
385 addr = ALIGN(vstart, align);
386 if (addr + size - 1 < addr)
389 n = vmap_area_root.rb_node;
393 struct vmap_area *tmp;
394 tmp = rb_entry(n, struct vmap_area, rb_node);
395 if (tmp->va_end >= addr) {
397 if (tmp->va_start <= addr)
408 /* from the starting point, walk areas until a suitable hole is found */
409 while (addr + size > first->va_start && addr + size <= vend) {
410 if (addr + cached_hole_size < first->va_start)
411 cached_hole_size = first->va_start - addr;
412 addr = ALIGN(first->va_end, align);
413 if (addr + size - 1 < addr)
416 n = rb_next(&first->rb_node);
418 first = rb_entry(n, struct vmap_area, rb_node);
424 if (addr + size > vend)
428 va->va_end = addr + size;
430 __insert_vmap_area(va);
431 free_vmap_cache = &va->rb_node;
432 spin_unlock(&vmap_area_lock);
434 BUG_ON(va->va_start & (align-1));
435 BUG_ON(va->va_start < vstart);
436 BUG_ON(va->va_end > vend);
441 spin_unlock(&vmap_area_lock);
443 purge_vmap_area_lazy();
447 if (printk_ratelimit())
449 "vmap allocation for size %lu failed: "
450 "use vmalloc=<size> to increase size.\n", size);
452 return ERR_PTR(-EBUSY);
455 static void __free_vmap_area(struct vmap_area *va)
457 BUG_ON(RB_EMPTY_NODE(&va->rb_node));
459 if (free_vmap_cache) {
460 if (va->va_end < cached_vstart) {
461 free_vmap_cache = NULL;
463 struct vmap_area *cache;
464 cache = rb_entry(free_vmap_cache, struct vmap_area, rb_node);
465 if (va->va_start <= cache->va_start) {
466 free_vmap_cache = rb_prev(&va->rb_node);
468 * We don't try to update cached_hole_size or
469 * cached_align, but it won't go very wrong.
474 rb_erase(&va->rb_node, &vmap_area_root);
475 RB_CLEAR_NODE(&va->rb_node);
476 list_del_rcu(&va->list);
479 * Track the highest possible candidate for pcpu area
480 * allocation. Areas outside of vmalloc area can be returned
481 * here too, consider only end addresses which fall inside
482 * vmalloc area proper.
484 if (va->va_end > VMALLOC_START && va->va_end <= VMALLOC_END)
485 vmap_area_pcpu_hole = max(vmap_area_pcpu_hole, va->va_end);
487 kfree_rcu(va, rcu_head);
491 * Free a region of KVA allocated by alloc_vmap_area
493 static void free_vmap_area(struct vmap_area *va)
495 spin_lock(&vmap_area_lock);
496 __free_vmap_area(va);
497 spin_unlock(&vmap_area_lock);
501 * Clear the pagetable entries of a given vmap_area
503 static void unmap_vmap_area(struct vmap_area *va)
505 vunmap_page_range(va->va_start, va->va_end);
508 static void vmap_debug_free_range(unsigned long start, unsigned long end)
511 * Unmap page tables and force a TLB flush immediately if
512 * CONFIG_DEBUG_PAGEALLOC is set. This catches use after free
513 * bugs similarly to those in linear kernel virtual address
514 * space after a page has been freed.
516 * All the lazy freeing logic is still retained, in order to
517 * minimise intrusiveness of this debugging feature.
519 * This is going to be *slow* (linear kernel virtual address
520 * debugging doesn't do a broadcast TLB flush so it is a lot
523 #ifdef CONFIG_DEBUG_PAGEALLOC
524 vunmap_page_range(start, end);
525 flush_tlb_kernel_range(start, end);
530 * lazy_max_pages is the maximum amount of virtual address space we gather up
531 * before attempting to purge with a TLB flush.
533 * There is a tradeoff here: a larger number will cover more kernel page tables
534 * and take slightly longer to purge, but it will linearly reduce the number of
535 * global TLB flushes that must be performed. It would seem natural to scale
536 * this number up linearly with the number of CPUs (because vmapping activity
537 * could also scale linearly with the number of CPUs), however it is likely
538 * that in practice, workloads might be constrained in other ways that mean
539 * vmap activity will not scale linearly with CPUs. Also, I want to be
540 * conservative and not introduce a big latency on huge systems, so go with
541 * a less aggressive log scale. It will still be an improvement over the old
542 * code, and it will be simple to change the scale factor if we find that it
543 * becomes a problem on bigger systems.
545 static unsigned long lazy_max_pages(void)
549 log = fls(num_online_cpus());
551 return log * (32UL * 1024 * 1024 / PAGE_SIZE);
554 static atomic_t vmap_lazy_nr = ATOMIC_INIT(0);
556 /* for per-CPU blocks */
557 static void purge_fragmented_blocks_allcpus(void);
560 * called before a call to iounmap() if the caller wants vm_area_struct's
563 void set_iounmap_nonlazy(void)
565 atomic_set(&vmap_lazy_nr, lazy_max_pages()+1);
569 * Purges all lazily-freed vmap areas.
571 * If sync is 0 then don't purge if there is already a purge in progress.
572 * If force_flush is 1, then flush kernel TLBs between *start and *end even
573 * if we found no lazy vmap areas to unmap (callers can use this to optimise
574 * their own TLB flushing).
575 * Returns with *start = min(*start, lowest purged address)
576 * *end = max(*end, highest purged address)
578 static void __purge_vmap_area_lazy(unsigned long *start, unsigned long *end,
579 int sync, int force_flush)
581 static DEFINE_SPINLOCK(purge_lock);
583 struct vmap_area *va;
584 struct vmap_area *n_va;
588 * If sync is 0 but force_flush is 1, we'll go sync anyway but callers
589 * should not expect such behaviour. This just simplifies locking for
590 * the case that isn't actually used at the moment anyway.
592 if (!sync && !force_flush) {
593 if (!spin_trylock(&purge_lock))
596 spin_lock(&purge_lock);
599 purge_fragmented_blocks_allcpus();
602 list_for_each_entry_rcu(va, &vmap_area_list, list) {
603 if (va->flags & VM_LAZY_FREE) {
604 if (va->va_start < *start)
605 *start = va->va_start;
606 if (va->va_end > *end)
608 nr += (va->va_end - va->va_start) >> PAGE_SHIFT;
609 list_add_tail(&va->purge_list, &valist);
610 va->flags |= VM_LAZY_FREEING;
611 va->flags &= ~VM_LAZY_FREE;
617 atomic_sub(nr, &vmap_lazy_nr);
619 if (nr || force_flush)
620 flush_tlb_kernel_range(*start, *end);
623 spin_lock(&vmap_area_lock);
624 list_for_each_entry_safe(va, n_va, &valist, purge_list)
625 __free_vmap_area(va);
626 spin_unlock(&vmap_area_lock);
628 spin_unlock(&purge_lock);
632 * Kick off a purge of the outstanding lazy areas. Don't bother if somebody
633 * is already purging.
635 static void try_purge_vmap_area_lazy(void)
637 unsigned long start = ULONG_MAX, end = 0;
639 __purge_vmap_area_lazy(&start, &end, 0, 0);
643 * Kick off a purge of the outstanding lazy areas.
645 static void purge_vmap_area_lazy(void)
647 unsigned long start = ULONG_MAX, end = 0;
649 __purge_vmap_area_lazy(&start, &end, 1, 0);
653 * Free a vmap area, caller ensuring that the area has been unmapped
654 * and flush_cache_vunmap had been called for the correct range
657 static void free_vmap_area_noflush(struct vmap_area *va)
659 va->flags |= VM_LAZY_FREE;
660 atomic_add((va->va_end - va->va_start) >> PAGE_SHIFT, &vmap_lazy_nr);
661 if (unlikely(atomic_read(&vmap_lazy_nr) > lazy_max_pages()))
662 try_purge_vmap_area_lazy();
666 * Free and unmap a vmap area, caller ensuring flush_cache_vunmap had been
667 * called for the correct range previously.
669 static void free_unmap_vmap_area_noflush(struct vmap_area *va)
672 free_vmap_area_noflush(va);
676 * Free and unmap a vmap area
678 static void free_unmap_vmap_area(struct vmap_area *va)
680 flush_cache_vunmap(va->va_start, va->va_end);
681 free_unmap_vmap_area_noflush(va);
684 static struct vmap_area *find_vmap_area(unsigned long addr)
686 struct vmap_area *va;
688 spin_lock(&vmap_area_lock);
689 va = __find_vmap_area(addr);
690 spin_unlock(&vmap_area_lock);
695 static void free_unmap_vmap_area_addr(unsigned long addr)
697 struct vmap_area *va;
699 va = find_vmap_area(addr);
701 free_unmap_vmap_area(va);
705 /*** Per cpu kva allocator ***/
708 * vmap space is limited especially on 32 bit architectures. Ensure there is
709 * room for at least 16 percpu vmap blocks per CPU.
712 * If we had a constant VMALLOC_START and VMALLOC_END, we'd like to be able
713 * to #define VMALLOC_SPACE (VMALLOC_END-VMALLOC_START). Guess
714 * instead (we just need a rough idea)
716 #if BITS_PER_LONG == 32
717 #define VMALLOC_SPACE (128UL*1024*1024)
719 #define VMALLOC_SPACE (128UL*1024*1024*1024)
722 #define VMALLOC_PAGES (VMALLOC_SPACE / PAGE_SIZE)
723 #define VMAP_MAX_ALLOC BITS_PER_LONG /* 256K with 4K pages */
724 #define VMAP_BBMAP_BITS_MAX 1024 /* 4MB with 4K pages */
725 #define VMAP_BBMAP_BITS_MIN (VMAP_MAX_ALLOC*2)
726 #define VMAP_MIN(x, y) ((x) < (y) ? (x) : (y)) /* can't use min() */
727 #define VMAP_MAX(x, y) ((x) > (y) ? (x) : (y)) /* can't use max() */
728 #define VMAP_BBMAP_BITS VMAP_MIN(VMAP_BBMAP_BITS_MAX, \
729 VMAP_MAX(VMAP_BBMAP_BITS_MIN, \
730 VMALLOC_PAGES / NR_CPUS / 16))
732 #define VMAP_BLOCK_SIZE (VMAP_BBMAP_BITS * PAGE_SIZE)
734 static bool vmap_initialized __read_mostly = false;
736 struct vmap_block_queue {
738 struct list_head free;
743 struct vmap_area *va;
744 struct vmap_block_queue *vbq;
745 unsigned long free, dirty;
746 DECLARE_BITMAP(alloc_map, VMAP_BBMAP_BITS);
747 DECLARE_BITMAP(dirty_map, VMAP_BBMAP_BITS);
748 struct list_head free_list;
749 struct rcu_head rcu_head;
750 struct list_head purge;
753 /* Queue of free and dirty vmap blocks, for allocation and flushing purposes */
754 static DEFINE_PER_CPU(struct vmap_block_queue, vmap_block_queue);
757 * Radix tree of vmap blocks, indexed by address, to quickly find a vmap block
758 * in the free path. Could get rid of this if we change the API to return a
759 * "cookie" from alloc, to be passed to free. But no big deal yet.
761 static DEFINE_SPINLOCK(vmap_block_tree_lock);
762 static RADIX_TREE(vmap_block_tree, GFP_ATOMIC);
765 * We should probably have a fallback mechanism to allocate virtual memory
766 * out of partially filled vmap blocks. However vmap block sizing should be
767 * fairly reasonable according to the vmalloc size, so it shouldn't be a
771 static unsigned long addr_to_vb_idx(unsigned long addr)
773 addr -= VMALLOC_START & ~(VMAP_BLOCK_SIZE-1);
774 addr /= VMAP_BLOCK_SIZE;
778 static struct vmap_block *new_vmap_block(gfp_t gfp_mask)
780 struct vmap_block_queue *vbq;
781 struct vmap_block *vb;
782 struct vmap_area *va;
783 unsigned long vb_idx;
786 node = numa_node_id();
788 vb = kmalloc_node(sizeof(struct vmap_block),
789 gfp_mask & GFP_RECLAIM_MASK, node);
791 return ERR_PTR(-ENOMEM);
793 va = alloc_vmap_area(VMAP_BLOCK_SIZE, VMAP_BLOCK_SIZE,
794 VMALLOC_START, VMALLOC_END,
801 err = radix_tree_preload(gfp_mask);
808 spin_lock_init(&vb->lock);
810 vb->free = VMAP_BBMAP_BITS;
812 bitmap_zero(vb->alloc_map, VMAP_BBMAP_BITS);
813 bitmap_zero(vb->dirty_map, VMAP_BBMAP_BITS);
814 INIT_LIST_HEAD(&vb->free_list);
816 vb_idx = addr_to_vb_idx(va->va_start);
817 spin_lock(&vmap_block_tree_lock);
818 err = radix_tree_insert(&vmap_block_tree, vb_idx, vb);
819 spin_unlock(&vmap_block_tree_lock);
821 radix_tree_preload_end();
823 vbq = &get_cpu_var(vmap_block_queue);
825 spin_lock(&vbq->lock);
826 list_add_rcu(&vb->free_list, &vbq->free);
827 spin_unlock(&vbq->lock);
828 put_cpu_var(vmap_block_queue);
833 static void rcu_free_vb(struct rcu_head *head)
835 struct vmap_block *vb = container_of(head, struct vmap_block, rcu_head);
840 static void free_vmap_block(struct vmap_block *vb)
842 struct vmap_block *tmp;
843 unsigned long vb_idx;
845 vb_idx = addr_to_vb_idx(vb->va->va_start);
846 spin_lock(&vmap_block_tree_lock);
847 tmp = radix_tree_delete(&vmap_block_tree, vb_idx);
848 spin_unlock(&vmap_block_tree_lock);
851 free_vmap_area_noflush(vb->va);
852 call_rcu(&vb->rcu_head, rcu_free_vb);
855 static void purge_fragmented_blocks(int cpu)
858 struct vmap_block *vb;
859 struct vmap_block *n_vb;
860 struct vmap_block_queue *vbq = &per_cpu(vmap_block_queue, cpu);
863 list_for_each_entry_rcu(vb, &vbq->free, free_list) {
865 if (!(vb->free + vb->dirty == VMAP_BBMAP_BITS && vb->dirty != VMAP_BBMAP_BITS))
868 spin_lock(&vb->lock);
869 if (vb->free + vb->dirty == VMAP_BBMAP_BITS && vb->dirty != VMAP_BBMAP_BITS) {
870 vb->free = 0; /* prevent further allocs after releasing lock */
871 vb->dirty = VMAP_BBMAP_BITS; /* prevent purging it again */
872 bitmap_fill(vb->alloc_map, VMAP_BBMAP_BITS);
873 bitmap_fill(vb->dirty_map, VMAP_BBMAP_BITS);
874 spin_lock(&vbq->lock);
875 list_del_rcu(&vb->free_list);
876 spin_unlock(&vbq->lock);
877 spin_unlock(&vb->lock);
878 list_add_tail(&vb->purge, &purge);
880 spin_unlock(&vb->lock);
884 list_for_each_entry_safe(vb, n_vb, &purge, purge) {
885 list_del(&vb->purge);
890 static void purge_fragmented_blocks_thiscpu(void)
892 purge_fragmented_blocks(smp_processor_id());
895 static void purge_fragmented_blocks_allcpus(void)
899 for_each_possible_cpu(cpu)
900 purge_fragmented_blocks(cpu);
903 static void *vb_alloc(unsigned long size, gfp_t gfp_mask)
905 struct vmap_block_queue *vbq;
906 struct vmap_block *vb;
907 unsigned long addr = 0;
911 BUG_ON(size & ~PAGE_MASK);
912 BUG_ON(size > PAGE_SIZE*VMAP_MAX_ALLOC);
913 order = get_order(size);
917 vbq = &get_cpu_var(vmap_block_queue);
918 list_for_each_entry_rcu(vb, &vbq->free, free_list) {
921 spin_lock(&vb->lock);
922 if (vb->free < 1UL << order)
925 i = bitmap_find_free_region(vb->alloc_map,
926 VMAP_BBMAP_BITS, order);
929 if (vb->free + vb->dirty == VMAP_BBMAP_BITS) {
930 /* fragmented and no outstanding allocations */
931 BUG_ON(vb->dirty != VMAP_BBMAP_BITS);
936 addr = vb->va->va_start + (i << PAGE_SHIFT);
937 BUG_ON(addr_to_vb_idx(addr) !=
938 addr_to_vb_idx(vb->va->va_start));
939 vb->free -= 1UL << order;
941 spin_lock(&vbq->lock);
942 list_del_rcu(&vb->free_list);
943 spin_unlock(&vbq->lock);
945 spin_unlock(&vb->lock);
948 spin_unlock(&vb->lock);
952 purge_fragmented_blocks_thiscpu();
954 put_cpu_var(vmap_block_queue);
958 vb = new_vmap_block(gfp_mask);
967 static void vb_free(const void *addr, unsigned long size)
969 unsigned long offset;
970 unsigned long vb_idx;
972 struct vmap_block *vb;
974 BUG_ON(size & ~PAGE_MASK);
975 BUG_ON(size > PAGE_SIZE*VMAP_MAX_ALLOC);
977 flush_cache_vunmap((unsigned long)addr, (unsigned long)addr + size);
979 order = get_order(size);
981 offset = (unsigned long)addr & (VMAP_BLOCK_SIZE - 1);
983 vb_idx = addr_to_vb_idx((unsigned long)addr);
985 vb = radix_tree_lookup(&vmap_block_tree, vb_idx);
989 vunmap_page_range((unsigned long)addr, (unsigned long)addr + size);
991 spin_lock(&vb->lock);
992 BUG_ON(bitmap_allocate_region(vb->dirty_map, offset >> PAGE_SHIFT, order));
994 vb->dirty += 1UL << order;
995 if (vb->dirty == VMAP_BBMAP_BITS) {
997 spin_unlock(&vb->lock);
1000 spin_unlock(&vb->lock);
1004 * vm_unmap_aliases - unmap outstanding lazy aliases in the vmap layer
1006 * The vmap/vmalloc layer lazily flushes kernel virtual mappings primarily
1007 * to amortize TLB flushing overheads. What this means is that any page you
1008 * have now, may, in a former life, have been mapped into kernel virtual
1009 * address by the vmap layer and so there might be some CPUs with TLB entries
1010 * still referencing that page (additional to the regular 1:1 kernel mapping).
1012 * vm_unmap_aliases flushes all such lazy mappings. After it returns, we can
1013 * be sure that none of the pages we have control over will have any aliases
1014 * from the vmap layer.
1016 void vm_unmap_aliases(void)
1018 unsigned long start = ULONG_MAX, end = 0;
1022 if (unlikely(!vmap_initialized))
1025 for_each_possible_cpu(cpu) {
1026 struct vmap_block_queue *vbq = &per_cpu(vmap_block_queue, cpu);
1027 struct vmap_block *vb;
1030 list_for_each_entry_rcu(vb, &vbq->free, free_list) {
1033 spin_lock(&vb->lock);
1034 i = find_first_bit(vb->dirty_map, VMAP_BBMAP_BITS);
1035 while (i < VMAP_BBMAP_BITS) {
1038 j = find_next_zero_bit(vb->dirty_map,
1039 VMAP_BBMAP_BITS, i);
1041 s = vb->va->va_start + (i << PAGE_SHIFT);
1042 e = vb->va->va_start + (j << PAGE_SHIFT);
1051 i = find_next_bit(vb->dirty_map,
1052 VMAP_BBMAP_BITS, i);
1054 spin_unlock(&vb->lock);
1059 __purge_vmap_area_lazy(&start, &end, 1, flush);
1061 EXPORT_SYMBOL_GPL(vm_unmap_aliases);
1064 * vm_unmap_ram - unmap linear kernel address space set up by vm_map_ram
1065 * @mem: the pointer returned by vm_map_ram
1066 * @count: the count passed to that vm_map_ram call (cannot unmap partial)
1068 void vm_unmap_ram(const void *mem, unsigned int count)
1070 unsigned long size = count << PAGE_SHIFT;
1071 unsigned long addr = (unsigned long)mem;
1074 BUG_ON(addr < VMALLOC_START);
1075 BUG_ON(addr > VMALLOC_END);
1076 BUG_ON(addr & (PAGE_SIZE-1));
1078 debug_check_no_locks_freed(mem, size);
1079 vmap_debug_free_range(addr, addr+size);
1081 if (likely(count <= VMAP_MAX_ALLOC))
1084 free_unmap_vmap_area_addr(addr);
1086 EXPORT_SYMBOL(vm_unmap_ram);
1089 * vm_map_ram - map pages linearly into kernel virtual address (vmalloc space)
1090 * @pages: an array of pointers to the pages to be mapped
1091 * @count: number of pages
1092 * @node: prefer to allocate data structures on this node
1093 * @prot: memory protection to use. PAGE_KERNEL for regular RAM
1095 * Returns: a pointer to the address that has been mapped, or %NULL on failure
1097 void *vm_map_ram(struct page **pages, unsigned int count, int node, pgprot_t prot)
1099 unsigned long size = count << PAGE_SHIFT;
1103 if (likely(count <= VMAP_MAX_ALLOC)) {
1104 mem = vb_alloc(size, GFP_KERNEL);
1107 addr = (unsigned long)mem;
1109 struct vmap_area *va;
1110 va = alloc_vmap_area(size, PAGE_SIZE,
1111 VMALLOC_START, VMALLOC_END, node, GFP_KERNEL);
1115 addr = va->va_start;
1118 if (vmap_page_range(addr, addr + size, prot, pages) < 0) {
1119 vm_unmap_ram(mem, count);
1124 EXPORT_SYMBOL(vm_map_ram);
1127 * vm_area_register_early - register vmap area early during boot
1128 * @vm: vm_struct to register
1129 * @align: requested alignment
1131 * This function is used to register kernel vm area before
1132 * vmalloc_init() is called. @vm->size and @vm->flags should contain
1133 * proper values on entry and other fields should be zero. On return,
1134 * vm->addr contains the allocated address.
1136 * DO NOT USE THIS FUNCTION UNLESS YOU KNOW WHAT YOU'RE DOING.
1138 void __init vm_area_register_early(struct vm_struct *vm, size_t align)
1140 static size_t vm_init_off __initdata;
1143 addr = ALIGN(VMALLOC_START + vm_init_off, align);
1144 vm_init_off = PFN_ALIGN(addr + vm->size) - VMALLOC_START;
1146 vm->addr = (void *)addr;
1152 void __init vmalloc_init(void)
1154 struct vmap_area *va;
1155 struct vm_struct *tmp;
1158 for_each_possible_cpu(i) {
1159 struct vmap_block_queue *vbq;
1161 vbq = &per_cpu(vmap_block_queue, i);
1162 spin_lock_init(&vbq->lock);
1163 INIT_LIST_HEAD(&vbq->free);
1166 /* Import existing vmlist entries. */
1167 for (tmp = vmlist; tmp; tmp = tmp->next) {
1168 va = kzalloc(sizeof(struct vmap_area), GFP_NOWAIT);
1169 va->flags = tmp->flags | VM_VM_AREA;
1170 va->va_start = (unsigned long)tmp->addr;
1171 va->va_end = va->va_start + tmp->size;
1172 __insert_vmap_area(va);
1175 vmap_area_pcpu_hole = VMALLOC_END;
1177 vmap_initialized = true;
1181 * map_kernel_range_noflush - map kernel VM area with the specified pages
1182 * @addr: start of the VM area to map
1183 * @size: size of the VM area to map
1184 * @prot: page protection flags to use
1185 * @pages: pages to map
1187 * Map PFN_UP(@size) pages at @addr. The VM area @addr and @size
1188 * specify should have been allocated using get_vm_area() and its
1192 * This function does NOT do any cache flushing. The caller is
1193 * responsible for calling flush_cache_vmap() on to-be-mapped areas
1194 * before calling this function.
1197 * The number of pages mapped on success, -errno on failure.
1199 int map_kernel_range_noflush(unsigned long addr, unsigned long size,
1200 pgprot_t prot, struct page **pages)
1202 return vmap_page_range_noflush(addr, addr + size, prot, pages);
1206 * unmap_kernel_range_noflush - unmap kernel VM area
1207 * @addr: start of the VM area to unmap
1208 * @size: size of the VM area to unmap
1210 * Unmap PFN_UP(@size) pages at @addr. The VM area @addr and @size
1211 * specify should have been allocated using get_vm_area() and its
1215 * This function does NOT do any cache flushing. The caller is
1216 * responsible for calling flush_cache_vunmap() on to-be-mapped areas
1217 * before calling this function and flush_tlb_kernel_range() after.
1219 void unmap_kernel_range_noflush(unsigned long addr, unsigned long size)
1221 vunmap_page_range(addr, addr + size);
1223 EXPORT_SYMBOL_GPL(unmap_kernel_range_noflush);
1226 * unmap_kernel_range - unmap kernel VM area and flush cache and TLB
1227 * @addr: start of the VM area to unmap
1228 * @size: size of the VM area to unmap
1230 * Similar to unmap_kernel_range_noflush() but flushes vcache before
1231 * the unmapping and tlb after.
1233 void unmap_kernel_range(unsigned long addr, unsigned long size)
1235 unsigned long end = addr + size;
1237 flush_cache_vunmap(addr, end);
1238 vunmap_page_range(addr, end);
1239 flush_tlb_kernel_range(addr, end);
1242 int map_vm_area(struct vm_struct *area, pgprot_t prot, struct page ***pages)
1244 unsigned long addr = (unsigned long)area->addr;
1245 unsigned long end = addr + area->size - PAGE_SIZE;
1248 err = vmap_page_range(addr, end, prot, *pages);
1256 EXPORT_SYMBOL_GPL(map_vm_area);
1258 /*** Old vmalloc interfaces ***/
1259 DEFINE_RWLOCK(vmlist_lock);
1260 struct vm_struct *vmlist;
1262 static void insert_vmalloc_vm(struct vm_struct *vm, struct vmap_area *va,
1263 unsigned long flags, void *caller)
1265 struct vm_struct *tmp, **p;
1268 vm->addr = (void *)va->va_start;
1269 vm->size = va->va_end - va->va_start;
1270 vm->caller = caller;
1272 va->flags |= VM_VM_AREA;
1274 write_lock(&vmlist_lock);
1275 for (p = &vmlist; (tmp = *p) != NULL; p = &tmp->next) {
1276 if (tmp->addr >= vm->addr)
1281 write_unlock(&vmlist_lock);
1284 static struct vm_struct *__get_vm_area_node(unsigned long size,
1285 unsigned long align, unsigned long flags, unsigned long start,
1286 unsigned long end, int node, gfp_t gfp_mask, void *caller)
1288 static struct vmap_area *va;
1289 struct vm_struct *area;
1291 BUG_ON(in_interrupt());
1292 if (flags & VM_IOREMAP) {
1293 int bit = fls(size);
1295 if (bit > IOREMAP_MAX_ORDER)
1296 bit = IOREMAP_MAX_ORDER;
1297 else if (bit < PAGE_SHIFT)
1303 size = PAGE_ALIGN(size);
1304 if (unlikely(!size))
1307 area = kzalloc_node(sizeof(*area), gfp_mask & GFP_RECLAIM_MASK, node);
1308 if (unlikely(!area))
1312 * We always allocate a guard page.
1316 va = alloc_vmap_area(size, align, start, end, node, gfp_mask);
1322 insert_vmalloc_vm(area, va, flags, caller);
1326 struct vm_struct *__get_vm_area(unsigned long size, unsigned long flags,
1327 unsigned long start, unsigned long end)
1329 return __get_vm_area_node(size, 1, flags, start, end, -1, GFP_KERNEL,
1330 __builtin_return_address(0));
1332 EXPORT_SYMBOL_GPL(__get_vm_area);
1334 struct vm_struct *__get_vm_area_caller(unsigned long size, unsigned long flags,
1335 unsigned long start, unsigned long end,
1338 return __get_vm_area_node(size, 1, flags, start, end, -1, GFP_KERNEL,
1343 * get_vm_area - reserve a contiguous kernel virtual area
1344 * @size: size of the area
1345 * @flags: %VM_IOREMAP for I/O mappings or VM_ALLOC
1347 * Search an area of @size in the kernel virtual mapping area,
1348 * and reserved it for out purposes. Returns the area descriptor
1349 * on success or %NULL on failure.
1351 struct vm_struct *get_vm_area(unsigned long size, unsigned long flags)
1353 return __get_vm_area_node(size, 1, flags, VMALLOC_START, VMALLOC_END,
1354 -1, GFP_KERNEL, __builtin_return_address(0));
1357 struct vm_struct *get_vm_area_caller(unsigned long size, unsigned long flags,
1360 return __get_vm_area_node(size, 1, flags, VMALLOC_START, VMALLOC_END,
1361 -1, GFP_KERNEL, caller);
1364 static struct vm_struct *find_vm_area(const void *addr)
1366 struct vmap_area *va;
1368 va = find_vmap_area((unsigned long)addr);
1369 if (va && va->flags & VM_VM_AREA)
1376 * remove_vm_area - find and remove a continuous kernel virtual area
1377 * @addr: base address
1379 * Search for the kernel VM area starting at @addr, and remove it.
1380 * This function returns the found VM area, but using it is NOT safe
1381 * on SMP machines, except for its size or flags.
1383 struct vm_struct *remove_vm_area(const void *addr)
1385 struct vmap_area *va;
1387 va = find_vmap_area((unsigned long)addr);
1388 if (va && va->flags & VM_VM_AREA) {
1389 struct vm_struct *vm = va->private;
1390 struct vm_struct *tmp, **p;
1392 * remove from list and disallow access to this vm_struct
1393 * before unmap. (address range confliction is maintained by
1396 write_lock(&vmlist_lock);
1397 for (p = &vmlist; (tmp = *p) != vm; p = &tmp->next)
1400 write_unlock(&vmlist_lock);
1402 vmap_debug_free_range(va->va_start, va->va_end);
1403 free_unmap_vmap_area(va);
1404 vm->size -= PAGE_SIZE;
1411 static void __vunmap(const void *addr, int deallocate_pages)
1413 struct vm_struct *area;
1418 if ((PAGE_SIZE-1) & (unsigned long)addr) {
1419 WARN(1, KERN_ERR "Trying to vfree() bad address (%p)\n", addr);
1423 area = remove_vm_area(addr);
1424 if (unlikely(!area)) {
1425 WARN(1, KERN_ERR "Trying to vfree() nonexistent vm area (%p)\n",
1430 debug_check_no_locks_freed(addr, area->size);
1431 debug_check_no_obj_freed(addr, area->size);
1433 if (deallocate_pages) {
1436 for (i = 0; i < area->nr_pages; i++) {
1437 struct page *page = area->pages[i];
1443 if (area->flags & VM_VPAGES)
1454 * vfree - release memory allocated by vmalloc()
1455 * @addr: memory base address
1457 * Free the virtually continuous memory area starting at @addr, as
1458 * obtained from vmalloc(), vmalloc_32() or __vmalloc(). If @addr is
1459 * NULL, no operation is performed.
1461 * Must not be called in interrupt context.
1463 void vfree(const void *addr)
1465 BUG_ON(in_interrupt());
1467 kmemleak_free(addr);
1471 EXPORT_SYMBOL(vfree);
1474 * vunmap - release virtual mapping obtained by vmap()
1475 * @addr: memory base address
1477 * Free the virtually contiguous memory area starting at @addr,
1478 * which was created from the page array passed to vmap().
1480 * Must not be called in interrupt context.
1482 void vunmap(const void *addr)
1484 BUG_ON(in_interrupt());
1488 EXPORT_SYMBOL(vunmap);
1491 * vmap - map an array of pages into virtually contiguous space
1492 * @pages: array of page pointers
1493 * @count: number of pages to map
1494 * @flags: vm_area->flags
1495 * @prot: page protection for the mapping
1497 * Maps @count pages from @pages into contiguous kernel virtual
1500 void *vmap(struct page **pages, unsigned int count,
1501 unsigned long flags, pgprot_t prot)
1503 struct vm_struct *area;
1507 if (count > totalram_pages)
1510 area = get_vm_area_caller((count << PAGE_SHIFT), flags,
1511 __builtin_return_address(0));
1515 if (map_vm_area(area, prot, &pages)) {
1522 EXPORT_SYMBOL(vmap);
1524 static void *__vmalloc_node(unsigned long size, unsigned long align,
1525 gfp_t gfp_mask, pgprot_t prot,
1526 int node, void *caller);
1527 static void *__vmalloc_area_node(struct vm_struct *area, gfp_t gfp_mask,
1528 pgprot_t prot, int node, void *caller)
1530 const int order = 0;
1531 struct page **pages;
1532 unsigned int nr_pages, array_size, i;
1533 gfp_t nested_gfp = (gfp_mask & GFP_RECLAIM_MASK) | __GFP_ZERO;
1535 nr_pages = (area->size - PAGE_SIZE) >> PAGE_SHIFT;
1536 array_size = (nr_pages * sizeof(struct page *));
1538 area->nr_pages = nr_pages;
1539 /* Please note that the recursion is strictly bounded. */
1540 if (array_size > PAGE_SIZE) {
1541 pages = __vmalloc_node(array_size, 1, nested_gfp|__GFP_HIGHMEM,
1542 PAGE_KERNEL, node, caller);
1543 area->flags |= VM_VPAGES;
1545 pages = kmalloc_node(array_size, nested_gfp, node);
1547 area->pages = pages;
1548 area->caller = caller;
1550 remove_vm_area(area->addr);
1555 for (i = 0; i < area->nr_pages; i++) {
1557 gfp_t tmp_mask = gfp_mask | __GFP_NOWARN;
1560 page = alloc_page(tmp_mask);
1562 page = alloc_pages_node(node, tmp_mask, order);
1564 if (unlikely(!page)) {
1565 /* Successfully allocated i pages, free them in __vunmap() */
1569 area->pages[i] = page;
1572 if (map_vm_area(area, prot, &pages))
1577 warn_alloc_failed(gfp_mask, order, "vmalloc: allocation failure, "
1578 "allocated %ld of %ld bytes\n",
1579 (area->nr_pages*PAGE_SIZE), area->size);
1585 * __vmalloc_node_range - allocate virtually contiguous memory
1586 * @size: allocation size
1587 * @align: desired alignment
1588 * @start: vm area range start
1589 * @end: vm area range end
1590 * @gfp_mask: flags for the page level allocator
1591 * @prot: protection mask for the allocated pages
1592 * @node: node to use for allocation or -1
1593 * @caller: caller's return address
1595 * Allocate enough pages to cover @size from the page level
1596 * allocator with @gfp_mask flags. Map them into contiguous
1597 * kernel virtual space, using a pagetable protection of @prot.
1599 void *__vmalloc_node_range(unsigned long size, unsigned long align,
1600 unsigned long start, unsigned long end, gfp_t gfp_mask,
1601 pgprot_t prot, int node, void *caller)
1603 struct vm_struct *area;
1605 unsigned long real_size = size;
1607 size = PAGE_ALIGN(size);
1608 if (!size || (size >> PAGE_SHIFT) > totalram_pages)
1611 area = __get_vm_area_node(size, align, VM_ALLOC, start, end, node,
1617 addr = __vmalloc_area_node(area, gfp_mask, prot, node, caller);
1620 * A ref_count = 3 is needed because the vm_struct and vmap_area
1621 * structures allocated in the __get_vm_area_node() function contain
1622 * references to the virtual address of the vmalloc'ed block.
1624 kmemleak_alloc(addr, real_size, 3, gfp_mask);
1630 * __vmalloc_node - allocate virtually contiguous memory
1631 * @size: allocation size
1632 * @align: desired alignment
1633 * @gfp_mask: flags for the page level allocator
1634 * @prot: protection mask for the allocated pages
1635 * @node: node to use for allocation or -1
1636 * @caller: caller's return address
1638 * Allocate enough pages to cover @size from the page level
1639 * allocator with @gfp_mask flags. Map them into contiguous
1640 * kernel virtual space, using a pagetable protection of @prot.
1642 static void *__vmalloc_node(unsigned long size, unsigned long align,
1643 gfp_t gfp_mask, pgprot_t prot,
1644 int node, void *caller)
1646 return __vmalloc_node_range(size, align, VMALLOC_START, VMALLOC_END,
1647 gfp_mask, prot, node, caller);
1650 void *__vmalloc(unsigned long size, gfp_t gfp_mask, pgprot_t prot)
1652 return __vmalloc_node(size, 1, gfp_mask, prot, -1,
1653 __builtin_return_address(0));
1655 EXPORT_SYMBOL(__vmalloc);
1657 static inline void *__vmalloc_node_flags(unsigned long size,
1658 int node, gfp_t flags)
1660 return __vmalloc_node(size, 1, flags, PAGE_KERNEL,
1661 node, __builtin_return_address(0));
1665 * vmalloc - allocate virtually contiguous memory
1666 * @size: allocation size
1667 * Allocate enough pages to cover @size from the page level
1668 * allocator and map them into contiguous kernel virtual space.
1670 * For tight control over page level allocator and protection flags
1671 * use __vmalloc() instead.
1673 void *vmalloc(unsigned long size)
1675 return __vmalloc_node_flags(size, -1, GFP_KERNEL | __GFP_HIGHMEM);
1677 EXPORT_SYMBOL(vmalloc);
1680 * vzalloc - allocate virtually contiguous memory with zero fill
1681 * @size: allocation size
1682 * Allocate enough pages to cover @size from the page level
1683 * allocator and map them into contiguous kernel virtual space.
1684 * The memory allocated is set to zero.
1686 * For tight control over page level allocator and protection flags
1687 * use __vmalloc() instead.
1689 void *vzalloc(unsigned long size)
1691 return __vmalloc_node_flags(size, -1,
1692 GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO);
1694 EXPORT_SYMBOL(vzalloc);
1697 * vmalloc_user - allocate zeroed virtually contiguous memory for userspace
1698 * @size: allocation size
1700 * The resulting memory area is zeroed so it can be mapped to userspace
1701 * without leaking data.
1703 void *vmalloc_user(unsigned long size)
1705 struct vm_struct *area;
1708 ret = __vmalloc_node(size, SHMLBA,
1709 GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO,
1710 PAGE_KERNEL, -1, __builtin_return_address(0));
1712 area = find_vm_area(ret);
1713 area->flags |= VM_USERMAP;
1717 EXPORT_SYMBOL(vmalloc_user);
1720 * vmalloc_node - allocate memory on a specific node
1721 * @size: allocation size
1724 * Allocate enough pages to cover @size from the page level
1725 * allocator and map them into contiguous kernel virtual space.
1727 * For tight control over page level allocator and protection flags
1728 * use __vmalloc() instead.
1730 void *vmalloc_node(unsigned long size, int node)
1732 return __vmalloc_node(size, 1, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL,
1733 node, __builtin_return_address(0));
1735 EXPORT_SYMBOL(vmalloc_node);
1738 * vzalloc_node - allocate memory on a specific node with zero fill
1739 * @size: allocation size
1742 * Allocate enough pages to cover @size from the page level
1743 * allocator and map them into contiguous kernel virtual space.
1744 * The memory allocated is set to zero.
1746 * For tight control over page level allocator and protection flags
1747 * use __vmalloc_node() instead.
1749 void *vzalloc_node(unsigned long size, int node)
1751 return __vmalloc_node_flags(size, node,
1752 GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO);
1754 EXPORT_SYMBOL(vzalloc_node);
1756 #ifndef PAGE_KERNEL_EXEC
1757 # define PAGE_KERNEL_EXEC PAGE_KERNEL
1761 * vmalloc_exec - allocate virtually contiguous, executable memory
1762 * @size: allocation size
1764 * Kernel-internal function to allocate enough pages to cover @size
1765 * the page level allocator and map them into contiguous and
1766 * executable kernel virtual space.
1768 * For tight control over page level allocator and protection flags
1769 * use __vmalloc() instead.
1772 void *vmalloc_exec(unsigned long size)
1774 return __vmalloc_node(size, 1, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL_EXEC,
1775 -1, __builtin_return_address(0));
1778 #if defined(CONFIG_64BIT) && defined(CONFIG_ZONE_DMA32)
1779 #define GFP_VMALLOC32 GFP_DMA32 | GFP_KERNEL
1780 #elif defined(CONFIG_64BIT) && defined(CONFIG_ZONE_DMA)
1781 #define GFP_VMALLOC32 GFP_DMA | GFP_KERNEL
1783 #define GFP_VMALLOC32 GFP_KERNEL
1787 * vmalloc_32 - allocate virtually contiguous memory (32bit addressable)
1788 * @size: allocation size
1790 * Allocate enough 32bit PA addressable pages to cover @size from the
1791 * page level allocator and map them into contiguous kernel virtual space.
1793 void *vmalloc_32(unsigned long size)
1795 return __vmalloc_node(size, 1, GFP_VMALLOC32, PAGE_KERNEL,
1796 -1, __builtin_return_address(0));
1798 EXPORT_SYMBOL(vmalloc_32);
1801 * vmalloc_32_user - allocate zeroed virtually contiguous 32bit memory
1802 * @size: allocation size
1804 * The resulting memory area is 32bit addressable and zeroed so it can be
1805 * mapped to userspace without leaking data.
1807 void *vmalloc_32_user(unsigned long size)
1809 struct vm_struct *area;
1812 ret = __vmalloc_node(size, 1, GFP_VMALLOC32 | __GFP_ZERO, PAGE_KERNEL,
1813 -1, __builtin_return_address(0));
1815 area = find_vm_area(ret);
1816 area->flags |= VM_USERMAP;
1820 EXPORT_SYMBOL(vmalloc_32_user);
1823 * small helper routine , copy contents to buf from addr.
1824 * If the page is not present, fill zero.
1827 static int aligned_vread(char *buf, char *addr, unsigned long count)
1833 unsigned long offset, length;
1835 offset = (unsigned long)addr & ~PAGE_MASK;
1836 length = PAGE_SIZE - offset;
1839 p = vmalloc_to_page(addr);
1841 * To do safe access to this _mapped_ area, we need
1842 * lock. But adding lock here means that we need to add
1843 * overhead of vmalloc()/vfree() calles for this _debug_
1844 * interface, rarely used. Instead of that, we'll use
1845 * kmap() and get small overhead in this access function.
1849 * we can expect USER0 is not used (see vread/vwrite's
1850 * function description)
1852 void *map = kmap_atomic(p, KM_USER0);
1853 memcpy(buf, map + offset, length);
1854 kunmap_atomic(map, KM_USER0);
1856 memset(buf, 0, length);
1866 static int aligned_vwrite(char *buf, char *addr, unsigned long count)
1872 unsigned long offset, length;
1874 offset = (unsigned long)addr & ~PAGE_MASK;
1875 length = PAGE_SIZE - offset;
1878 p = vmalloc_to_page(addr);
1880 * To do safe access to this _mapped_ area, we need
1881 * lock. But adding lock here means that we need to add
1882 * overhead of vmalloc()/vfree() calles for this _debug_
1883 * interface, rarely used. Instead of that, we'll use
1884 * kmap() and get small overhead in this access function.
1888 * we can expect USER0 is not used (see vread/vwrite's
1889 * function description)
1891 void *map = kmap_atomic(p, KM_USER0);
1892 memcpy(map + offset, buf, length);
1893 kunmap_atomic(map, KM_USER0);
1904 * vread() - read vmalloc area in a safe way.
1905 * @buf: buffer for reading data
1906 * @addr: vm address.
1907 * @count: number of bytes to be read.
1909 * Returns # of bytes which addr and buf should be increased.
1910 * (same number to @count). Returns 0 if [addr...addr+count) doesn't
1911 * includes any intersect with alive vmalloc area.
1913 * This function checks that addr is a valid vmalloc'ed area, and
1914 * copy data from that area to a given buffer. If the given memory range
1915 * of [addr...addr+count) includes some valid address, data is copied to
1916 * proper area of @buf. If there are memory holes, they'll be zero-filled.
1917 * IOREMAP area is treated as memory hole and no copy is done.
1919 * If [addr...addr+count) doesn't includes any intersects with alive
1920 * vm_struct area, returns 0.
1921 * @buf should be kernel's buffer. Because this function uses KM_USER0,
1922 * the caller should guarantee KM_USER0 is not used.
1924 * Note: In usual ops, vread() is never necessary because the caller
1925 * should know vmalloc() area is valid and can use memcpy().
1926 * This is for routines which have to access vmalloc area without
1927 * any informaion, as /dev/kmem.
1931 long vread(char *buf, char *addr, unsigned long count)
1933 struct vm_struct *tmp;
1934 char *vaddr, *buf_start = buf;
1935 unsigned long buflen = count;
1938 /* Don't allow overflow */
1939 if ((unsigned long) addr + count < count)
1940 count = -(unsigned long) addr;
1942 read_lock(&vmlist_lock);
1943 for (tmp = vmlist; count && tmp; tmp = tmp->next) {
1944 vaddr = (char *) tmp->addr;
1945 if (addr >= vaddr + tmp->size - PAGE_SIZE)
1947 while (addr < vaddr) {
1955 n = vaddr + tmp->size - PAGE_SIZE - addr;
1958 if (!(tmp->flags & VM_IOREMAP))
1959 aligned_vread(buf, addr, n);
1960 else /* IOREMAP area is treated as memory hole */
1967 read_unlock(&vmlist_lock);
1969 if (buf == buf_start)
1971 /* zero-fill memory holes */
1972 if (buf != buf_start + buflen)
1973 memset(buf, 0, buflen - (buf - buf_start));
1979 * vwrite() - write vmalloc area in a safe way.
1980 * @buf: buffer for source data
1981 * @addr: vm address.
1982 * @count: number of bytes to be read.
1984 * Returns # of bytes which addr and buf should be incresed.
1985 * (same number to @count).
1986 * If [addr...addr+count) doesn't includes any intersect with valid
1987 * vmalloc area, returns 0.
1989 * This function checks that addr is a valid vmalloc'ed area, and
1990 * copy data from a buffer to the given addr. If specified range of
1991 * [addr...addr+count) includes some valid address, data is copied from
1992 * proper area of @buf. If there are memory holes, no copy to hole.
1993 * IOREMAP area is treated as memory hole and no copy is done.
1995 * If [addr...addr+count) doesn't includes any intersects with alive
1996 * vm_struct area, returns 0.
1997 * @buf should be kernel's buffer. Because this function uses KM_USER0,
1998 * the caller should guarantee KM_USER0 is not used.
2000 * Note: In usual ops, vwrite() is never necessary because the caller
2001 * should know vmalloc() area is valid and can use memcpy().
2002 * This is for routines which have to access vmalloc area without
2003 * any informaion, as /dev/kmem.
2006 long vwrite(char *buf, char *addr, unsigned long count)
2008 struct vm_struct *tmp;
2010 unsigned long n, buflen;
2013 /* Don't allow overflow */
2014 if ((unsigned long) addr + count < count)
2015 count = -(unsigned long) addr;
2018 read_lock(&vmlist_lock);
2019 for (tmp = vmlist; count && tmp; tmp = tmp->next) {
2020 vaddr = (char *) tmp->addr;
2021 if (addr >= vaddr + tmp->size - PAGE_SIZE)
2023 while (addr < vaddr) {
2030 n = vaddr + tmp->size - PAGE_SIZE - addr;
2033 if (!(tmp->flags & VM_IOREMAP)) {
2034 aligned_vwrite(buf, addr, n);
2042 read_unlock(&vmlist_lock);
2049 * remap_vmalloc_range - map vmalloc pages to userspace
2050 * @vma: vma to cover (map full range of vma)
2051 * @addr: vmalloc memory
2052 * @pgoff: number of pages into addr before first page to map
2054 * Returns: 0 for success, -Exxx on failure
2056 * This function checks that addr is a valid vmalloc'ed area, and
2057 * that it is big enough to cover the vma. Will return failure if
2058 * that criteria isn't met.
2060 * Similar to remap_pfn_range() (see mm/memory.c)
2062 int remap_vmalloc_range(struct vm_area_struct *vma, void *addr,
2063 unsigned long pgoff)
2065 struct vm_struct *area;
2066 unsigned long uaddr = vma->vm_start;
2067 unsigned long usize = vma->vm_end - vma->vm_start;
2069 if ((PAGE_SIZE-1) & (unsigned long)addr)
2072 area = find_vm_area(addr);
2076 if (!(area->flags & VM_USERMAP))
2079 if (usize + (pgoff << PAGE_SHIFT) > area->size - PAGE_SIZE)
2082 addr += pgoff << PAGE_SHIFT;
2084 struct page *page = vmalloc_to_page(addr);
2087 ret = vm_insert_page(vma, uaddr, page);
2094 } while (usize > 0);
2096 /* Prevent "things" like memory migration? VM_flags need a cleanup... */
2097 vma->vm_flags |= VM_RESERVED;
2101 EXPORT_SYMBOL(remap_vmalloc_range);
2104 * Implement a stub for vmalloc_sync_all() if the architecture chose not to
2107 void __attribute__((weak)) vmalloc_sync_all(void)
2112 static int f(pte_t *pte, pgtable_t table, unsigned long addr, void *data)
2114 /* apply_to_page_range() does all the hard work. */
2119 * alloc_vm_area - allocate a range of kernel address space
2120 * @size: size of the area
2122 * Returns: NULL on failure, vm_struct on success
2124 * This function reserves a range of kernel address space, and
2125 * allocates pagetables to map that range. No actual mappings
2126 * are created. If the kernel address space is not shared
2127 * between processes, it syncs the pagetable across all
2130 struct vm_struct *alloc_vm_area(size_t size)
2132 struct vm_struct *area;
2134 area = get_vm_area_caller(size, VM_IOREMAP,
2135 __builtin_return_address(0));
2140 * This ensures that page tables are constructed for this region
2141 * of kernel virtual address space and mapped into init_mm.
2143 if (apply_to_page_range(&init_mm, (unsigned long)area->addr,
2144 area->size, f, NULL)) {
2151 EXPORT_SYMBOL_GPL(alloc_vm_area);
2153 void free_vm_area(struct vm_struct *area)
2155 struct vm_struct *ret;
2156 ret = remove_vm_area(area->addr);
2157 BUG_ON(ret != area);
2160 EXPORT_SYMBOL_GPL(free_vm_area);
2163 static struct vmap_area *node_to_va(struct rb_node *n)
2165 return n ? rb_entry(n, struct vmap_area, rb_node) : NULL;
2169 * pvm_find_next_prev - find the next and prev vmap_area surrounding @end
2170 * @end: target address
2171 * @pnext: out arg for the next vmap_area
2172 * @pprev: out arg for the previous vmap_area
2174 * Returns: %true if either or both of next and prev are found,
2175 * %false if no vmap_area exists
2177 * Find vmap_areas end addresses of which enclose @end. ie. if not
2178 * NULL, *pnext->va_end > @end and *pprev->va_end <= @end.
2180 static bool pvm_find_next_prev(unsigned long end,
2181 struct vmap_area **pnext,
2182 struct vmap_area **pprev)
2184 struct rb_node *n = vmap_area_root.rb_node;
2185 struct vmap_area *va = NULL;
2188 va = rb_entry(n, struct vmap_area, rb_node);
2189 if (end < va->va_end)
2191 else if (end > va->va_end)
2200 if (va->va_end > end) {
2202 *pprev = node_to_va(rb_prev(&(*pnext)->rb_node));
2205 *pnext = node_to_va(rb_next(&(*pprev)->rb_node));
2211 * pvm_determine_end - find the highest aligned address between two vmap_areas
2212 * @pnext: in/out arg for the next vmap_area
2213 * @pprev: in/out arg for the previous vmap_area
2216 * Returns: determined end address
2218 * Find the highest aligned address between *@pnext and *@pprev below
2219 * VMALLOC_END. *@pnext and *@pprev are adjusted so that the aligned
2220 * down address is between the end addresses of the two vmap_areas.
2222 * Please note that the address returned by this function may fall
2223 * inside *@pnext vmap_area. The caller is responsible for checking
2226 static unsigned long pvm_determine_end(struct vmap_area **pnext,
2227 struct vmap_area **pprev,
2228 unsigned long align)
2230 const unsigned long vmalloc_end = VMALLOC_END & ~(align - 1);
2234 addr = min((*pnext)->va_start & ~(align - 1), vmalloc_end);
2238 while (*pprev && (*pprev)->va_end > addr) {
2240 *pprev = node_to_va(rb_prev(&(*pnext)->rb_node));
2247 * pcpu_get_vm_areas - allocate vmalloc areas for percpu allocator
2248 * @offsets: array containing offset of each area
2249 * @sizes: array containing size of each area
2250 * @nr_vms: the number of areas to allocate
2251 * @align: alignment, all entries in @offsets and @sizes must be aligned to this
2253 * Returns: kmalloc'd vm_struct pointer array pointing to allocated
2254 * vm_structs on success, %NULL on failure
2256 * Percpu allocator wants to use congruent vm areas so that it can
2257 * maintain the offsets among percpu areas. This function allocates
2258 * congruent vmalloc areas for it with GFP_KERNEL. These areas tend to
2259 * be scattered pretty far, distance between two areas easily going up
2260 * to gigabytes. To avoid interacting with regular vmallocs, these
2261 * areas are allocated from top.
2263 * Despite its complicated look, this allocator is rather simple. It
2264 * does everything top-down and scans areas from the end looking for
2265 * matching slot. While scanning, if any of the areas overlaps with
2266 * existing vmap_area, the base address is pulled down to fit the
2267 * area. Scanning is repeated till all the areas fit and then all
2268 * necessary data structres are inserted and the result is returned.
2270 struct vm_struct **pcpu_get_vm_areas(const unsigned long *offsets,
2271 const size_t *sizes, int nr_vms,
2274 const unsigned long vmalloc_start = ALIGN(VMALLOC_START, align);
2275 const unsigned long vmalloc_end = VMALLOC_END & ~(align - 1);
2276 struct vmap_area **vas, *prev, *next;
2277 struct vm_struct **vms;
2278 int area, area2, last_area, term_area;
2279 unsigned long base, start, end, last_end;
2280 bool purged = false;
2282 /* verify parameters and allocate data structures */
2283 BUG_ON(align & ~PAGE_MASK || !is_power_of_2(align));
2284 for (last_area = 0, area = 0; area < nr_vms; area++) {
2285 start = offsets[area];
2286 end = start + sizes[area];
2288 /* is everything aligned properly? */
2289 BUG_ON(!IS_ALIGNED(offsets[area], align));
2290 BUG_ON(!IS_ALIGNED(sizes[area], align));
2292 /* detect the area with the highest address */
2293 if (start > offsets[last_area])
2296 for (area2 = 0; area2 < nr_vms; area2++) {
2297 unsigned long start2 = offsets[area2];
2298 unsigned long end2 = start2 + sizes[area2];
2303 BUG_ON(start2 >= start && start2 < end);
2304 BUG_ON(end2 <= end && end2 > start);
2307 last_end = offsets[last_area] + sizes[last_area];
2309 if (vmalloc_end - vmalloc_start < last_end) {
2314 vms = kzalloc(sizeof(vms[0]) * nr_vms, GFP_KERNEL);
2315 vas = kzalloc(sizeof(vas[0]) * nr_vms, GFP_KERNEL);
2319 for (area = 0; area < nr_vms; area++) {
2320 vas[area] = kzalloc(sizeof(struct vmap_area), GFP_KERNEL);
2321 vms[area] = kzalloc(sizeof(struct vm_struct), GFP_KERNEL);
2322 if (!vas[area] || !vms[area])
2326 spin_lock(&vmap_area_lock);
2328 /* start scanning - we scan from the top, begin with the last area */
2329 area = term_area = last_area;
2330 start = offsets[area];
2331 end = start + sizes[area];
2333 if (!pvm_find_next_prev(vmap_area_pcpu_hole, &next, &prev)) {
2334 base = vmalloc_end - last_end;
2337 base = pvm_determine_end(&next, &prev, align) - end;
2340 BUG_ON(next && next->va_end <= base + end);
2341 BUG_ON(prev && prev->va_end > base + end);
2344 * base might have underflowed, add last_end before
2347 if (base + last_end < vmalloc_start + last_end) {
2348 spin_unlock(&vmap_area_lock);
2350 purge_vmap_area_lazy();
2358 * If next overlaps, move base downwards so that it's
2359 * right below next and then recheck.
2361 if (next && next->va_start < base + end) {
2362 base = pvm_determine_end(&next, &prev, align) - end;
2368 * If prev overlaps, shift down next and prev and move
2369 * base so that it's right below new next and then
2372 if (prev && prev->va_end > base + start) {
2374 prev = node_to_va(rb_prev(&next->rb_node));
2375 base = pvm_determine_end(&next, &prev, align) - end;
2381 * This area fits, move on to the previous one. If
2382 * the previous one is the terminal one, we're done.
2384 area = (area + nr_vms - 1) % nr_vms;
2385 if (area == term_area)
2387 start = offsets[area];
2388 end = start + sizes[area];
2389 pvm_find_next_prev(base + end, &next, &prev);
2392 /* we've found a fitting base, insert all va's */
2393 for (area = 0; area < nr_vms; area++) {
2394 struct vmap_area *va = vas[area];
2396 va->va_start = base + offsets[area];
2397 va->va_end = va->va_start + sizes[area];
2398 __insert_vmap_area(va);
2401 vmap_area_pcpu_hole = base + offsets[last_area];
2403 spin_unlock(&vmap_area_lock);
2405 /* insert all vm's */
2406 for (area = 0; area < nr_vms; area++)
2407 insert_vmalloc_vm(vms[area], vas[area], VM_ALLOC,
2414 for (area = 0; area < nr_vms; area++) {
2426 * pcpu_free_vm_areas - free vmalloc areas for percpu allocator
2427 * @vms: vm_struct pointer array returned by pcpu_get_vm_areas()
2428 * @nr_vms: the number of allocated areas
2430 * Free vm_structs and the array allocated by pcpu_get_vm_areas().
2432 void pcpu_free_vm_areas(struct vm_struct **vms, int nr_vms)
2436 for (i = 0; i < nr_vms; i++)
2437 free_vm_area(vms[i]);
2440 #endif /* CONFIG_SMP */
2442 #ifdef CONFIG_PROC_FS
2443 static void *s_start(struct seq_file *m, loff_t *pos)
2444 __acquires(&vmlist_lock)
2447 struct vm_struct *v;
2449 read_lock(&vmlist_lock);
2451 while (n > 0 && v) {
2462 static void *s_next(struct seq_file *m, void *p, loff_t *pos)
2464 struct vm_struct *v = p;
2470 static void s_stop(struct seq_file *m, void *p)
2471 __releases(&vmlist_lock)
2473 read_unlock(&vmlist_lock);
2476 static void show_numa_info(struct seq_file *m, struct vm_struct *v)
2479 unsigned int nr, *counters = m->private;
2484 memset(counters, 0, nr_node_ids * sizeof(unsigned int));
2486 for (nr = 0; nr < v->nr_pages; nr++)
2487 counters[page_to_nid(v->pages[nr])]++;
2489 for_each_node_state(nr, N_HIGH_MEMORY)
2491 seq_printf(m, " N%u=%u", nr, counters[nr]);
2495 static int s_show(struct seq_file *m, void *p)
2497 struct vm_struct *v = p;
2499 seq_printf(m, "0x%p-0x%p %7ld",
2500 v->addr, v->addr + v->size, v->size);
2503 seq_printf(m, " %pS", v->caller);
2506 seq_printf(m, " pages=%d", v->nr_pages);
2509 seq_printf(m, " phys=%llx", (unsigned long long)v->phys_addr);
2511 if (v->flags & VM_IOREMAP)
2512 seq_printf(m, " ioremap");
2514 if (v->flags & VM_ALLOC)
2515 seq_printf(m, " vmalloc");
2517 if (v->flags & VM_MAP)
2518 seq_printf(m, " vmap");
2520 if (v->flags & VM_USERMAP)
2521 seq_printf(m, " user");
2523 if (v->flags & VM_VPAGES)
2524 seq_printf(m, " vpages");
2526 show_numa_info(m, v);
2531 static const struct seq_operations vmalloc_op = {
2538 static int vmalloc_open(struct inode *inode, struct file *file)
2540 unsigned int *ptr = NULL;
2544 ptr = kmalloc(nr_node_ids * sizeof(unsigned int), GFP_KERNEL);
2548 ret = seq_open(file, &vmalloc_op);
2550 struct seq_file *m = file->private_data;
2557 static const struct file_operations proc_vmalloc_operations = {
2558 .open = vmalloc_open,
2560 .llseek = seq_lseek,
2561 .release = seq_release_private,
2564 static int __init proc_vmalloc_init(void)
2566 proc_create("vmallocinfo", S_IRUSR, NULL, &proc_vmalloc_operations);
2569 module_init(proc_vmalloc_init);