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/notifier.h>
25 #include <linux/rbtree.h>
26 #include <linux/radix-tree.h>
27 #include <linux/rcupdate.h>
28 #include <linux/pfn.h>
29 #include <linux/kmemleak.h>
30 #include <linux/atomic.h>
31 #include <linux/compiler.h>
32 #include <linux/llist.h>
33 #include <linux/bitops.h>
35 #include <asm/uaccess.h>
36 #include <asm/tlbflush.h>
37 #include <asm/shmparam.h>
41 struct vfree_deferred {
42 struct llist_head list;
43 struct work_struct wq;
45 static DEFINE_PER_CPU(struct vfree_deferred, vfree_deferred);
47 static void __vunmap(const void *, int);
49 static void free_work(struct work_struct *w)
51 struct vfree_deferred *p = container_of(w, struct vfree_deferred, wq);
52 struct llist_node *llnode = llist_del_all(&p->list);
55 llnode = llist_next(llnode);
60 /*** Page table manipulation functions ***/
62 static void vunmap_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end)
66 pte = pte_offset_kernel(pmd, addr);
68 pte_t ptent = ptep_get_and_clear(&init_mm, addr, pte);
69 WARN_ON(!pte_none(ptent) && !pte_present(ptent));
70 } while (pte++, addr += PAGE_SIZE, addr != end);
73 static void vunmap_pmd_range(pud_t *pud, unsigned long addr, unsigned long end)
78 pmd = pmd_offset(pud, addr);
80 next = pmd_addr_end(addr, end);
81 if (pmd_clear_huge(pmd))
83 if (pmd_none_or_clear_bad(pmd))
85 vunmap_pte_range(pmd, addr, next);
86 } while (pmd++, addr = next, addr != end);
89 static void vunmap_pud_range(pgd_t *pgd, unsigned long addr, unsigned long end)
94 pud = pud_offset(pgd, addr);
96 next = pud_addr_end(addr, end);
97 if (pud_clear_huge(pud))
99 if (pud_none_or_clear_bad(pud))
101 vunmap_pmd_range(pud, addr, next);
102 } while (pud++, addr = next, addr != end);
105 static void vunmap_page_range(unsigned long addr, unsigned long end)
111 pgd = pgd_offset_k(addr);
113 next = pgd_addr_end(addr, end);
114 if (pgd_none_or_clear_bad(pgd))
116 vunmap_pud_range(pgd, addr, next);
117 } while (pgd++, addr = next, addr != end);
120 static int vmap_pte_range(pmd_t *pmd, unsigned long addr,
121 unsigned long end, pgprot_t prot, struct page **pages, int *nr)
126 * nr is a running index into the array which helps higher level
127 * callers keep track of where we're up to.
130 pte = pte_alloc_kernel(pmd, addr);
134 struct page *page = pages[*nr];
136 if (WARN_ON(!pte_none(*pte)))
140 set_pte_at(&init_mm, addr, pte, mk_pte(page, prot));
142 } while (pte++, addr += PAGE_SIZE, addr != end);
146 static int vmap_pmd_range(pud_t *pud, unsigned long addr,
147 unsigned long end, pgprot_t prot, struct page **pages, int *nr)
152 pmd = pmd_alloc(&init_mm, pud, addr);
156 next = pmd_addr_end(addr, end);
157 if (vmap_pte_range(pmd, addr, next, prot, pages, nr))
159 } while (pmd++, addr = next, addr != end);
163 static int vmap_pud_range(pgd_t *pgd, unsigned long addr,
164 unsigned long end, pgprot_t prot, struct page **pages, int *nr)
169 pud = pud_alloc(&init_mm, pgd, addr);
173 next = pud_addr_end(addr, end);
174 if (vmap_pmd_range(pud, addr, next, prot, pages, nr))
176 } while (pud++, addr = next, addr != end);
181 * Set up page tables in kva (addr, end). The ptes shall have prot "prot", and
182 * will have pfns corresponding to the "pages" array.
184 * Ie. pte at addr+N*PAGE_SIZE shall point to pfn corresponding to pages[N]
186 static int vmap_page_range_noflush(unsigned long start, unsigned long end,
187 pgprot_t prot, struct page **pages)
191 unsigned long addr = start;
196 pgd = pgd_offset_k(addr);
198 next = pgd_addr_end(addr, end);
199 err = vmap_pud_range(pgd, addr, next, prot, pages, &nr);
202 } while (pgd++, addr = next, addr != end);
207 static int vmap_page_range(unsigned long start, unsigned long end,
208 pgprot_t prot, struct page **pages)
212 ret = vmap_page_range_noflush(start, end, prot, pages);
213 flush_cache_vmap(start, end);
217 int is_vmalloc_or_module_addr(const void *x)
220 * ARM, x86-64 and sparc64 put modules in a special place,
221 * and fall back on vmalloc() if that fails. Others
222 * just put it in the vmalloc space.
224 #if defined(CONFIG_MODULES) && defined(MODULES_VADDR)
225 unsigned long addr = (unsigned long)x;
226 if (addr >= MODULES_VADDR && addr < MODULES_END)
229 return is_vmalloc_addr(x);
233 * Walk a vmap address to the struct page it maps.
235 struct page *vmalloc_to_page(const void *vmalloc_addr)
237 unsigned long addr = (unsigned long) vmalloc_addr;
238 struct page *page = NULL;
239 pgd_t *pgd = pgd_offset_k(addr);
242 * XXX we might need to change this if we add VIRTUAL_BUG_ON for
243 * architectures that do not vmalloc module space
245 VIRTUAL_BUG_ON(!is_vmalloc_or_module_addr(vmalloc_addr));
247 if (!pgd_none(*pgd)) {
248 pud_t *pud = pud_offset(pgd, addr);
249 if (!pud_none(*pud)) {
250 pmd_t *pmd = pmd_offset(pud, addr);
251 if (!pmd_none(*pmd)) {
254 ptep = pte_offset_map(pmd, addr);
256 if (pte_present(pte))
257 page = pte_page(pte);
264 EXPORT_SYMBOL(vmalloc_to_page);
267 * Map a vmalloc()-space virtual address to the physical page frame number.
269 unsigned long vmalloc_to_pfn(const void *vmalloc_addr)
271 return page_to_pfn(vmalloc_to_page(vmalloc_addr));
273 EXPORT_SYMBOL(vmalloc_to_pfn);
276 /*** Global kva allocator ***/
278 #define VM_VM_AREA 0x04
280 static DEFINE_SPINLOCK(vmap_area_lock);
281 /* Export for kexec only */
282 LIST_HEAD(vmap_area_list);
283 static LLIST_HEAD(vmap_purge_list);
284 static struct rb_root vmap_area_root = RB_ROOT;
286 /* The vmap cache globals are protected by vmap_area_lock */
287 static struct rb_node *free_vmap_cache;
288 static unsigned long cached_hole_size;
289 static unsigned long cached_vstart;
290 static unsigned long cached_align;
292 static unsigned long vmap_area_pcpu_hole;
294 static struct vmap_area *__find_vmap_area(unsigned long addr)
296 struct rb_node *n = vmap_area_root.rb_node;
299 struct vmap_area *va;
301 va = rb_entry(n, struct vmap_area, rb_node);
302 if (addr < va->va_start)
304 else if (addr >= va->va_end)
313 static void __insert_vmap_area(struct vmap_area *va)
315 struct rb_node **p = &vmap_area_root.rb_node;
316 struct rb_node *parent = NULL;
320 struct vmap_area *tmp_va;
323 tmp_va = rb_entry(parent, struct vmap_area, rb_node);
324 if (va->va_start < tmp_va->va_end)
326 else if (va->va_end > tmp_va->va_start)
332 rb_link_node(&va->rb_node, parent, p);
333 rb_insert_color(&va->rb_node, &vmap_area_root);
335 /* address-sort this list */
336 tmp = rb_prev(&va->rb_node);
338 struct vmap_area *prev;
339 prev = rb_entry(tmp, struct vmap_area, rb_node);
340 list_add_rcu(&va->list, &prev->list);
342 list_add_rcu(&va->list, &vmap_area_list);
345 static void purge_vmap_area_lazy(void);
347 static BLOCKING_NOTIFIER_HEAD(vmap_notify_list);
350 * Allocate a region of KVA of the specified size and alignment, within the
353 static struct vmap_area *alloc_vmap_area(unsigned long size,
355 unsigned long vstart, unsigned long vend,
356 int node, gfp_t gfp_mask)
358 struct vmap_area *va;
362 struct vmap_area *first;
365 BUG_ON(offset_in_page(size));
366 BUG_ON(!is_power_of_2(align));
368 might_sleep_if(gfpflags_allow_blocking(gfp_mask));
370 va = kmalloc_node(sizeof(struct vmap_area),
371 gfp_mask & GFP_RECLAIM_MASK, node);
373 return ERR_PTR(-ENOMEM);
376 * Only scan the relevant parts containing pointers to other objects
377 * to avoid false negatives.
379 kmemleak_scan_area(&va->rb_node, SIZE_MAX, gfp_mask & GFP_RECLAIM_MASK);
382 spin_lock(&vmap_area_lock);
384 * Invalidate cache if we have more permissive parameters.
385 * cached_hole_size notes the largest hole noticed _below_
386 * the vmap_area cached in free_vmap_cache: if size fits
387 * into that hole, we want to scan from vstart to reuse
388 * the hole instead of allocating above free_vmap_cache.
389 * Note that __free_vmap_area may update free_vmap_cache
390 * without updating cached_hole_size or cached_align.
392 if (!free_vmap_cache ||
393 size < cached_hole_size ||
394 vstart < cached_vstart ||
395 align < cached_align) {
397 cached_hole_size = 0;
398 free_vmap_cache = NULL;
400 /* record if we encounter less permissive parameters */
401 cached_vstart = vstart;
402 cached_align = align;
404 /* find starting point for our search */
405 if (free_vmap_cache) {
406 first = rb_entry(free_vmap_cache, struct vmap_area, rb_node);
407 addr = ALIGN(first->va_end, align);
410 if (addr + size < addr)
414 addr = ALIGN(vstart, align);
415 if (addr + size < addr)
418 n = vmap_area_root.rb_node;
422 struct vmap_area *tmp;
423 tmp = rb_entry(n, struct vmap_area, rb_node);
424 if (tmp->va_end >= addr) {
426 if (tmp->va_start <= addr)
437 /* from the starting point, walk areas until a suitable hole is found */
438 while (addr + size > first->va_start && addr + size <= vend) {
439 if (addr + cached_hole_size < first->va_start)
440 cached_hole_size = first->va_start - addr;
441 addr = ALIGN(first->va_end, align);
442 if (addr + size < addr)
445 if (list_is_last(&first->list, &vmap_area_list))
448 first = list_next_entry(first, list);
452 if (addr + size > vend)
456 va->va_end = addr + size;
458 __insert_vmap_area(va);
459 free_vmap_cache = &va->rb_node;
460 spin_unlock(&vmap_area_lock);
462 BUG_ON(!IS_ALIGNED(va->va_start, align));
463 BUG_ON(va->va_start < vstart);
464 BUG_ON(va->va_end > vend);
469 spin_unlock(&vmap_area_lock);
471 purge_vmap_area_lazy();
476 if (gfpflags_allow_blocking(gfp_mask)) {
477 unsigned long freed = 0;
478 blocking_notifier_call_chain(&vmap_notify_list, 0, &freed);
485 if (printk_ratelimit())
486 pr_warn("vmap allocation for size %lu failed: use vmalloc=<size> to increase size\n",
489 return ERR_PTR(-EBUSY);
492 int register_vmap_purge_notifier(struct notifier_block *nb)
494 return blocking_notifier_chain_register(&vmap_notify_list, nb);
496 EXPORT_SYMBOL_GPL(register_vmap_purge_notifier);
498 int unregister_vmap_purge_notifier(struct notifier_block *nb)
500 return blocking_notifier_chain_unregister(&vmap_notify_list, nb);
502 EXPORT_SYMBOL_GPL(unregister_vmap_purge_notifier);
504 static void __free_vmap_area(struct vmap_area *va)
506 BUG_ON(RB_EMPTY_NODE(&va->rb_node));
508 if (free_vmap_cache) {
509 if (va->va_end < cached_vstart) {
510 free_vmap_cache = NULL;
512 struct vmap_area *cache;
513 cache = rb_entry(free_vmap_cache, struct vmap_area, rb_node);
514 if (va->va_start <= cache->va_start) {
515 free_vmap_cache = rb_prev(&va->rb_node);
517 * We don't try to update cached_hole_size or
518 * cached_align, but it won't go very wrong.
523 rb_erase(&va->rb_node, &vmap_area_root);
524 RB_CLEAR_NODE(&va->rb_node);
525 list_del_rcu(&va->list);
528 * Track the highest possible candidate for pcpu area
529 * allocation. Areas outside of vmalloc area can be returned
530 * here too, consider only end addresses which fall inside
531 * vmalloc area proper.
533 if (va->va_end > VMALLOC_START && va->va_end <= VMALLOC_END)
534 vmap_area_pcpu_hole = max(vmap_area_pcpu_hole, va->va_end);
536 kfree_rcu(va, rcu_head);
540 * Free a region of KVA allocated by alloc_vmap_area
542 static void free_vmap_area(struct vmap_area *va)
544 spin_lock(&vmap_area_lock);
545 __free_vmap_area(va);
546 spin_unlock(&vmap_area_lock);
550 * Clear the pagetable entries of a given vmap_area
552 static void unmap_vmap_area(struct vmap_area *va)
554 vunmap_page_range(va->va_start, va->va_end);
557 static void vmap_debug_free_range(unsigned long start, unsigned long end)
560 * Unmap page tables and force a TLB flush immediately if pagealloc
561 * debugging is enabled. This catches use after free bugs similarly to
562 * those in linear kernel virtual address space after a page has been
565 * All the lazy freeing logic is still retained, in order to minimise
566 * intrusiveness of this debugging feature.
568 * This is going to be *slow* (linear kernel virtual address debugging
569 * doesn't do a broadcast TLB flush so it is a lot faster).
571 if (debug_pagealloc_enabled()) {
572 vunmap_page_range(start, end);
573 flush_tlb_kernel_range(start, end);
578 * lazy_max_pages is the maximum amount of virtual address space we gather up
579 * before attempting to purge with a TLB flush.
581 * There is a tradeoff here: a larger number will cover more kernel page tables
582 * and take slightly longer to purge, but it will linearly reduce the number of
583 * global TLB flushes that must be performed. It would seem natural to scale
584 * this number up linearly with the number of CPUs (because vmapping activity
585 * could also scale linearly with the number of CPUs), however it is likely
586 * that in practice, workloads might be constrained in other ways that mean
587 * vmap activity will not scale linearly with CPUs. Also, I want to be
588 * conservative and not introduce a big latency on huge systems, so go with
589 * a less aggressive log scale. It will still be an improvement over the old
590 * code, and it will be simple to change the scale factor if we find that it
591 * becomes a problem on bigger systems.
593 static unsigned long lazy_max_pages(void)
597 log = fls(num_online_cpus());
599 return log * (32UL * 1024 * 1024 / PAGE_SIZE);
602 static atomic_t vmap_lazy_nr = ATOMIC_INIT(0);
605 * Serialize vmap purging. There is no actual criticial section protected
606 * by this look, but we want to avoid concurrent calls for performance
607 * reasons and to make the pcpu_get_vm_areas more deterministic.
609 static DEFINE_SPINLOCK(vmap_purge_lock);
611 /* for per-CPU blocks */
612 static void purge_fragmented_blocks_allcpus(void);
615 * called before a call to iounmap() if the caller wants vm_area_struct's
618 void set_iounmap_nonlazy(void)
620 atomic_set(&vmap_lazy_nr, lazy_max_pages()+1);
624 * Purges all lazily-freed vmap areas.
626 static bool __purge_vmap_area_lazy(unsigned long start, unsigned long end)
628 struct llist_node *valist;
629 struct vmap_area *va;
630 struct vmap_area *n_va;
633 lockdep_assert_held(&vmap_purge_lock);
635 valist = llist_del_all(&vmap_purge_list);
636 llist_for_each_entry(va, valist, purge_list) {
637 if (va->va_start < start)
638 start = va->va_start;
639 if (va->va_end > end)
641 nr += (va->va_end - va->va_start) >> PAGE_SHIFT;
647 atomic_sub(nr, &vmap_lazy_nr);
648 flush_tlb_kernel_range(start, end);
650 spin_lock(&vmap_area_lock);
651 llist_for_each_entry_safe(va, n_va, valist, purge_list)
652 __free_vmap_area(va);
653 spin_unlock(&vmap_area_lock);
658 * Kick off a purge of the outstanding lazy areas. Don't bother if somebody
659 * is already purging.
661 static void try_purge_vmap_area_lazy(void)
663 if (spin_trylock(&vmap_purge_lock)) {
664 __purge_vmap_area_lazy(ULONG_MAX, 0);
665 spin_unlock(&vmap_purge_lock);
670 * Kick off a purge of the outstanding lazy areas.
672 static void purge_vmap_area_lazy(void)
674 spin_lock(&vmap_purge_lock);
675 purge_fragmented_blocks_allcpus();
676 __purge_vmap_area_lazy(ULONG_MAX, 0);
677 spin_unlock(&vmap_purge_lock);
681 * Free a vmap area, caller ensuring that the area has been unmapped
682 * and flush_cache_vunmap had been called for the correct range
685 static void free_vmap_area_noflush(struct vmap_area *va)
689 nr_lazy = atomic_add_return((va->va_end - va->va_start) >> PAGE_SHIFT,
692 /* After this point, we may free va at any time */
693 llist_add(&va->purge_list, &vmap_purge_list);
695 if (unlikely(nr_lazy > lazy_max_pages()))
696 try_purge_vmap_area_lazy();
700 * Free and unmap a vmap area
702 static void free_unmap_vmap_area(struct vmap_area *va)
704 flush_cache_vunmap(va->va_start, va->va_end);
706 free_vmap_area_noflush(va);
709 static struct vmap_area *find_vmap_area(unsigned long addr)
711 struct vmap_area *va;
713 spin_lock(&vmap_area_lock);
714 va = __find_vmap_area(addr);
715 spin_unlock(&vmap_area_lock);
720 /*** Per cpu kva allocator ***/
723 * vmap space is limited especially on 32 bit architectures. Ensure there is
724 * room for at least 16 percpu vmap blocks per CPU.
727 * If we had a constant VMALLOC_START and VMALLOC_END, we'd like to be able
728 * to #define VMALLOC_SPACE (VMALLOC_END-VMALLOC_START). Guess
729 * instead (we just need a rough idea)
731 #if BITS_PER_LONG == 32
732 #define VMALLOC_SPACE (128UL*1024*1024)
734 #define VMALLOC_SPACE (128UL*1024*1024*1024)
737 #define VMALLOC_PAGES (VMALLOC_SPACE / PAGE_SIZE)
738 #define VMAP_MAX_ALLOC BITS_PER_LONG /* 256K with 4K pages */
739 #define VMAP_BBMAP_BITS_MAX 1024 /* 4MB with 4K pages */
740 #define VMAP_BBMAP_BITS_MIN (VMAP_MAX_ALLOC*2)
741 #define VMAP_MIN(x, y) ((x) < (y) ? (x) : (y)) /* can't use min() */
742 #define VMAP_MAX(x, y) ((x) > (y) ? (x) : (y)) /* can't use max() */
743 #define VMAP_BBMAP_BITS \
744 VMAP_MIN(VMAP_BBMAP_BITS_MAX, \
745 VMAP_MAX(VMAP_BBMAP_BITS_MIN, \
746 VMALLOC_PAGES / roundup_pow_of_two(NR_CPUS) / 16))
748 #define VMAP_BLOCK_SIZE (VMAP_BBMAP_BITS * PAGE_SIZE)
750 static bool vmap_initialized __read_mostly = false;
752 struct vmap_block_queue {
754 struct list_head free;
759 struct vmap_area *va;
760 unsigned long free, dirty;
761 unsigned long dirty_min, dirty_max; /*< dirty range */
762 struct list_head free_list;
763 struct rcu_head rcu_head;
764 struct list_head purge;
767 /* Queue of free and dirty vmap blocks, for allocation and flushing purposes */
768 static DEFINE_PER_CPU(struct vmap_block_queue, vmap_block_queue);
771 * Radix tree of vmap blocks, indexed by address, to quickly find a vmap block
772 * in the free path. Could get rid of this if we change the API to return a
773 * "cookie" from alloc, to be passed to free. But no big deal yet.
775 static DEFINE_SPINLOCK(vmap_block_tree_lock);
776 static RADIX_TREE(vmap_block_tree, GFP_ATOMIC);
779 * We should probably have a fallback mechanism to allocate virtual memory
780 * out of partially filled vmap blocks. However vmap block sizing should be
781 * fairly reasonable according to the vmalloc size, so it shouldn't be a
785 static unsigned long addr_to_vb_idx(unsigned long addr)
787 addr -= VMALLOC_START & ~(VMAP_BLOCK_SIZE-1);
788 addr /= VMAP_BLOCK_SIZE;
792 static void *vmap_block_vaddr(unsigned long va_start, unsigned long pages_off)
796 addr = va_start + (pages_off << PAGE_SHIFT);
797 BUG_ON(addr_to_vb_idx(addr) != addr_to_vb_idx(va_start));
802 * new_vmap_block - allocates new vmap_block and occupies 2^order pages in this
803 * block. Of course pages number can't exceed VMAP_BBMAP_BITS
804 * @order: how many 2^order pages should be occupied in newly allocated block
805 * @gfp_mask: flags for the page level allocator
807 * Returns: virtual address in a newly allocated block or ERR_PTR(-errno)
809 static void *new_vmap_block(unsigned int order, gfp_t gfp_mask)
811 struct vmap_block_queue *vbq;
812 struct vmap_block *vb;
813 struct vmap_area *va;
814 unsigned long vb_idx;
818 node = numa_node_id();
820 vb = kmalloc_node(sizeof(struct vmap_block),
821 gfp_mask & GFP_RECLAIM_MASK, node);
823 return ERR_PTR(-ENOMEM);
825 va = alloc_vmap_area(VMAP_BLOCK_SIZE, VMAP_BLOCK_SIZE,
826 VMALLOC_START, VMALLOC_END,
833 err = radix_tree_preload(gfp_mask);
840 vaddr = vmap_block_vaddr(va->va_start, 0);
841 spin_lock_init(&vb->lock);
843 /* At least something should be left free */
844 BUG_ON(VMAP_BBMAP_BITS <= (1UL << order));
845 vb->free = VMAP_BBMAP_BITS - (1UL << order);
847 vb->dirty_min = VMAP_BBMAP_BITS;
849 INIT_LIST_HEAD(&vb->free_list);
851 vb_idx = addr_to_vb_idx(va->va_start);
852 spin_lock(&vmap_block_tree_lock);
853 err = radix_tree_insert(&vmap_block_tree, vb_idx, vb);
854 spin_unlock(&vmap_block_tree_lock);
856 radix_tree_preload_end();
858 vbq = &get_cpu_var(vmap_block_queue);
859 spin_lock(&vbq->lock);
860 list_add_tail_rcu(&vb->free_list, &vbq->free);
861 spin_unlock(&vbq->lock);
862 put_cpu_var(vmap_block_queue);
867 static void free_vmap_block(struct vmap_block *vb)
869 struct vmap_block *tmp;
870 unsigned long vb_idx;
872 vb_idx = addr_to_vb_idx(vb->va->va_start);
873 spin_lock(&vmap_block_tree_lock);
874 tmp = radix_tree_delete(&vmap_block_tree, vb_idx);
875 spin_unlock(&vmap_block_tree_lock);
878 free_vmap_area_noflush(vb->va);
879 kfree_rcu(vb, rcu_head);
882 static void purge_fragmented_blocks(int cpu)
885 struct vmap_block *vb;
886 struct vmap_block *n_vb;
887 struct vmap_block_queue *vbq = &per_cpu(vmap_block_queue, cpu);
890 list_for_each_entry_rcu(vb, &vbq->free, free_list) {
892 if (!(vb->free + vb->dirty == VMAP_BBMAP_BITS && vb->dirty != VMAP_BBMAP_BITS))
895 spin_lock(&vb->lock);
896 if (vb->free + vb->dirty == VMAP_BBMAP_BITS && vb->dirty != VMAP_BBMAP_BITS) {
897 vb->free = 0; /* prevent further allocs after releasing lock */
898 vb->dirty = VMAP_BBMAP_BITS; /* prevent purging it again */
900 vb->dirty_max = VMAP_BBMAP_BITS;
901 spin_lock(&vbq->lock);
902 list_del_rcu(&vb->free_list);
903 spin_unlock(&vbq->lock);
904 spin_unlock(&vb->lock);
905 list_add_tail(&vb->purge, &purge);
907 spin_unlock(&vb->lock);
911 list_for_each_entry_safe(vb, n_vb, &purge, purge) {
912 list_del(&vb->purge);
917 static void purge_fragmented_blocks_allcpus(void)
921 for_each_possible_cpu(cpu)
922 purge_fragmented_blocks(cpu);
925 static void *vb_alloc(unsigned long size, gfp_t gfp_mask)
927 struct vmap_block_queue *vbq;
928 struct vmap_block *vb;
932 BUG_ON(offset_in_page(size));
933 BUG_ON(size > PAGE_SIZE*VMAP_MAX_ALLOC);
934 if (WARN_ON(size == 0)) {
936 * Allocating 0 bytes isn't what caller wants since
937 * get_order(0) returns funny result. Just warn and terminate
942 order = get_order(size);
945 vbq = &get_cpu_var(vmap_block_queue);
946 list_for_each_entry_rcu(vb, &vbq->free, free_list) {
947 unsigned long pages_off;
949 spin_lock(&vb->lock);
950 if (vb->free < (1UL << order)) {
951 spin_unlock(&vb->lock);
955 pages_off = VMAP_BBMAP_BITS - vb->free;
956 vaddr = vmap_block_vaddr(vb->va->va_start, pages_off);
957 vb->free -= 1UL << order;
959 spin_lock(&vbq->lock);
960 list_del_rcu(&vb->free_list);
961 spin_unlock(&vbq->lock);
964 spin_unlock(&vb->lock);
968 put_cpu_var(vmap_block_queue);
971 /* Allocate new block if nothing was found */
973 vaddr = new_vmap_block(order, gfp_mask);
978 static void vb_free(const void *addr, unsigned long size)
980 unsigned long offset;
981 unsigned long vb_idx;
983 struct vmap_block *vb;
985 BUG_ON(offset_in_page(size));
986 BUG_ON(size > PAGE_SIZE*VMAP_MAX_ALLOC);
988 flush_cache_vunmap((unsigned long)addr, (unsigned long)addr + size);
990 order = get_order(size);
992 offset = (unsigned long)addr & (VMAP_BLOCK_SIZE - 1);
993 offset >>= PAGE_SHIFT;
995 vb_idx = addr_to_vb_idx((unsigned long)addr);
997 vb = radix_tree_lookup(&vmap_block_tree, vb_idx);
1001 vunmap_page_range((unsigned long)addr, (unsigned long)addr + size);
1003 spin_lock(&vb->lock);
1005 /* Expand dirty range */
1006 vb->dirty_min = min(vb->dirty_min, offset);
1007 vb->dirty_max = max(vb->dirty_max, offset + (1UL << order));
1009 vb->dirty += 1UL << order;
1010 if (vb->dirty == VMAP_BBMAP_BITS) {
1012 spin_unlock(&vb->lock);
1013 free_vmap_block(vb);
1015 spin_unlock(&vb->lock);
1019 * vm_unmap_aliases - unmap outstanding lazy aliases in the vmap layer
1021 * The vmap/vmalloc layer lazily flushes kernel virtual mappings primarily
1022 * to amortize TLB flushing overheads. What this means is that any page you
1023 * have now, may, in a former life, have been mapped into kernel virtual
1024 * address by the vmap layer and so there might be some CPUs with TLB entries
1025 * still referencing that page (additional to the regular 1:1 kernel mapping).
1027 * vm_unmap_aliases flushes all such lazy mappings. After it returns, we can
1028 * be sure that none of the pages we have control over will have any aliases
1029 * from the vmap layer.
1031 void vm_unmap_aliases(void)
1033 unsigned long start = ULONG_MAX, end = 0;
1037 if (unlikely(!vmap_initialized))
1040 for_each_possible_cpu(cpu) {
1041 struct vmap_block_queue *vbq = &per_cpu(vmap_block_queue, cpu);
1042 struct vmap_block *vb;
1045 list_for_each_entry_rcu(vb, &vbq->free, free_list) {
1046 spin_lock(&vb->lock);
1048 unsigned long va_start = vb->va->va_start;
1051 s = va_start + (vb->dirty_min << PAGE_SHIFT);
1052 e = va_start + (vb->dirty_max << PAGE_SHIFT);
1054 start = min(s, start);
1059 spin_unlock(&vb->lock);
1064 spin_lock(&vmap_purge_lock);
1065 purge_fragmented_blocks_allcpus();
1066 if (!__purge_vmap_area_lazy(start, end) && flush)
1067 flush_tlb_kernel_range(start, end);
1068 spin_unlock(&vmap_purge_lock);
1070 EXPORT_SYMBOL_GPL(vm_unmap_aliases);
1073 * vm_unmap_ram - unmap linear kernel address space set up by vm_map_ram
1074 * @mem: the pointer returned by vm_map_ram
1075 * @count: the count passed to that vm_map_ram call (cannot unmap partial)
1077 void vm_unmap_ram(const void *mem, unsigned int count)
1079 unsigned long size = (unsigned long)count << PAGE_SHIFT;
1080 unsigned long addr = (unsigned long)mem;
1081 struct vmap_area *va;
1084 BUG_ON(addr < VMALLOC_START);
1085 BUG_ON(addr > VMALLOC_END);
1086 BUG_ON(!PAGE_ALIGNED(addr));
1088 debug_check_no_locks_freed(mem, size);
1089 vmap_debug_free_range(addr, addr+size);
1091 if (likely(count <= VMAP_MAX_ALLOC)) {
1096 va = find_vmap_area(addr);
1098 free_unmap_vmap_area(va);
1100 EXPORT_SYMBOL(vm_unmap_ram);
1103 * vm_map_ram - map pages linearly into kernel virtual address (vmalloc space)
1104 * @pages: an array of pointers to the pages to be mapped
1105 * @count: number of pages
1106 * @node: prefer to allocate data structures on this node
1107 * @prot: memory protection to use. PAGE_KERNEL for regular RAM
1109 * If you use this function for less than VMAP_MAX_ALLOC pages, it could be
1110 * faster than vmap so it's good. But if you mix long-life and short-life
1111 * objects with vm_map_ram(), it could consume lots of address space through
1112 * fragmentation (especially on a 32bit machine). You could see failures in
1113 * the end. Please use this function for short-lived objects.
1115 * Returns: a pointer to the address that has been mapped, or %NULL on failure
1117 void *vm_map_ram(struct page **pages, unsigned int count, int node, pgprot_t prot)
1119 unsigned long size = (unsigned long)count << PAGE_SHIFT;
1123 if (likely(count <= VMAP_MAX_ALLOC)) {
1124 mem = vb_alloc(size, GFP_KERNEL);
1127 addr = (unsigned long)mem;
1129 struct vmap_area *va;
1130 va = alloc_vmap_area(size, PAGE_SIZE,
1131 VMALLOC_START, VMALLOC_END, node, GFP_KERNEL);
1135 addr = va->va_start;
1138 if (vmap_page_range(addr, addr + size, prot, pages) < 0) {
1139 vm_unmap_ram(mem, count);
1144 EXPORT_SYMBOL(vm_map_ram);
1146 static struct vm_struct *vmlist __initdata;
1148 * vm_area_add_early - add vmap area early during boot
1149 * @vm: vm_struct to add
1151 * This function is used to add fixed kernel vm area to vmlist before
1152 * vmalloc_init() is called. @vm->addr, @vm->size, and @vm->flags
1153 * should contain proper values and the other fields should be zero.
1155 * DO NOT USE THIS FUNCTION UNLESS YOU KNOW WHAT YOU'RE DOING.
1157 void __init vm_area_add_early(struct vm_struct *vm)
1159 struct vm_struct *tmp, **p;
1161 BUG_ON(vmap_initialized);
1162 for (p = &vmlist; (tmp = *p) != NULL; p = &tmp->next) {
1163 if (tmp->addr >= vm->addr) {
1164 BUG_ON(tmp->addr < vm->addr + vm->size);
1167 BUG_ON(tmp->addr + tmp->size > vm->addr);
1174 * vm_area_register_early - register vmap area early during boot
1175 * @vm: vm_struct to register
1176 * @align: requested alignment
1178 * This function is used to register kernel vm area before
1179 * vmalloc_init() is called. @vm->size and @vm->flags should contain
1180 * proper values on entry and other fields should be zero. On return,
1181 * vm->addr contains the allocated address.
1183 * DO NOT USE THIS FUNCTION UNLESS YOU KNOW WHAT YOU'RE DOING.
1185 void __init vm_area_register_early(struct vm_struct *vm, size_t align)
1187 static size_t vm_init_off __initdata;
1190 addr = ALIGN(VMALLOC_START + vm_init_off, align);
1191 vm_init_off = PFN_ALIGN(addr + vm->size) - VMALLOC_START;
1193 vm->addr = (void *)addr;
1195 vm_area_add_early(vm);
1198 void __init vmalloc_init(void)
1200 struct vmap_area *va;
1201 struct vm_struct *tmp;
1204 for_each_possible_cpu(i) {
1205 struct vmap_block_queue *vbq;
1206 struct vfree_deferred *p;
1208 vbq = &per_cpu(vmap_block_queue, i);
1209 spin_lock_init(&vbq->lock);
1210 INIT_LIST_HEAD(&vbq->free);
1211 p = &per_cpu(vfree_deferred, i);
1212 init_llist_head(&p->list);
1213 INIT_WORK(&p->wq, free_work);
1216 /* Import existing vmlist entries. */
1217 for (tmp = vmlist; tmp; tmp = tmp->next) {
1218 va = kzalloc(sizeof(struct vmap_area), GFP_NOWAIT);
1219 va->flags = VM_VM_AREA;
1220 va->va_start = (unsigned long)tmp->addr;
1221 va->va_end = va->va_start + tmp->size;
1223 __insert_vmap_area(va);
1226 vmap_area_pcpu_hole = VMALLOC_END;
1228 vmap_initialized = true;
1232 * map_kernel_range_noflush - map kernel VM area with the specified pages
1233 * @addr: start of the VM area to map
1234 * @size: size of the VM area to map
1235 * @prot: page protection flags to use
1236 * @pages: pages to map
1238 * Map PFN_UP(@size) pages at @addr. The VM area @addr and @size
1239 * specify should have been allocated using get_vm_area() and its
1243 * This function does NOT do any cache flushing. The caller is
1244 * responsible for calling flush_cache_vmap() on to-be-mapped areas
1245 * before calling this function.
1248 * The number of pages mapped on success, -errno on failure.
1250 int map_kernel_range_noflush(unsigned long addr, unsigned long size,
1251 pgprot_t prot, struct page **pages)
1253 return vmap_page_range_noflush(addr, addr + size, prot, pages);
1257 * unmap_kernel_range_noflush - unmap kernel VM area
1258 * @addr: start of the VM area to unmap
1259 * @size: size of the VM area to unmap
1261 * Unmap PFN_UP(@size) pages at @addr. The VM area @addr and @size
1262 * specify should have been allocated using get_vm_area() and its
1266 * This function does NOT do any cache flushing. The caller is
1267 * responsible for calling flush_cache_vunmap() on to-be-mapped areas
1268 * before calling this function and flush_tlb_kernel_range() after.
1270 void unmap_kernel_range_noflush(unsigned long addr, unsigned long size)
1272 vunmap_page_range(addr, addr + size);
1274 EXPORT_SYMBOL_GPL(unmap_kernel_range_noflush);
1277 * unmap_kernel_range - unmap kernel VM area and flush cache and TLB
1278 * @addr: start of the VM area to unmap
1279 * @size: size of the VM area to unmap
1281 * Similar to unmap_kernel_range_noflush() but flushes vcache before
1282 * the unmapping and tlb after.
1284 void unmap_kernel_range(unsigned long addr, unsigned long size)
1286 unsigned long end = addr + size;
1288 flush_cache_vunmap(addr, end);
1289 vunmap_page_range(addr, end);
1290 flush_tlb_kernel_range(addr, end);
1292 EXPORT_SYMBOL_GPL(unmap_kernel_range);
1294 int map_vm_area(struct vm_struct *area, pgprot_t prot, struct page **pages)
1296 unsigned long addr = (unsigned long)area->addr;
1297 unsigned long end = addr + get_vm_area_size(area);
1300 err = vmap_page_range(addr, end, prot, pages);
1302 return err > 0 ? 0 : err;
1304 EXPORT_SYMBOL_GPL(map_vm_area);
1306 static void setup_vmalloc_vm(struct vm_struct *vm, struct vmap_area *va,
1307 unsigned long flags, const void *caller)
1309 spin_lock(&vmap_area_lock);
1311 vm->addr = (void *)va->va_start;
1312 vm->size = va->va_end - va->va_start;
1313 vm->caller = caller;
1315 va->flags |= VM_VM_AREA;
1316 spin_unlock(&vmap_area_lock);
1319 static void clear_vm_uninitialized_flag(struct vm_struct *vm)
1322 * Before removing VM_UNINITIALIZED,
1323 * we should make sure that vm has proper values.
1324 * Pair with smp_rmb() in show_numa_info().
1327 vm->flags &= ~VM_UNINITIALIZED;
1330 static struct vm_struct *__get_vm_area_node(unsigned long size,
1331 unsigned long align, unsigned long flags, unsigned long start,
1332 unsigned long end, int node, gfp_t gfp_mask, const void *caller)
1334 struct vmap_area *va;
1335 struct vm_struct *area;
1337 BUG_ON(in_interrupt());
1338 size = PAGE_ALIGN(size);
1339 if (unlikely(!size))
1342 if (flags & VM_IOREMAP)
1343 align = 1ul << clamp_t(int, get_count_order_long(size),
1344 PAGE_SHIFT, IOREMAP_MAX_ORDER);
1346 area = kzalloc_node(sizeof(*area), gfp_mask & GFP_RECLAIM_MASK, node);
1347 if (unlikely(!area))
1350 if (!(flags & VM_NO_GUARD))
1353 va = alloc_vmap_area(size, align, start, end, node, gfp_mask);
1359 setup_vmalloc_vm(area, va, flags, caller);
1364 struct vm_struct *__get_vm_area(unsigned long size, unsigned long flags,
1365 unsigned long start, unsigned long end)
1367 return __get_vm_area_node(size, 1, flags, start, end, NUMA_NO_NODE,
1368 GFP_KERNEL, __builtin_return_address(0));
1370 EXPORT_SYMBOL_GPL(__get_vm_area);
1372 struct vm_struct *__get_vm_area_caller(unsigned long size, unsigned long flags,
1373 unsigned long start, unsigned long end,
1376 return __get_vm_area_node(size, 1, flags, start, end, NUMA_NO_NODE,
1377 GFP_KERNEL, caller);
1381 * get_vm_area - reserve a contiguous kernel virtual area
1382 * @size: size of the area
1383 * @flags: %VM_IOREMAP for I/O mappings or VM_ALLOC
1385 * Search an area of @size in the kernel virtual mapping area,
1386 * and reserved it for out purposes. Returns the area descriptor
1387 * on success or %NULL on failure.
1389 struct vm_struct *get_vm_area(unsigned long size, unsigned long flags)
1391 return __get_vm_area_node(size, 1, flags, VMALLOC_START, VMALLOC_END,
1392 NUMA_NO_NODE, GFP_KERNEL,
1393 __builtin_return_address(0));
1396 struct vm_struct *get_vm_area_caller(unsigned long size, unsigned long flags,
1399 return __get_vm_area_node(size, 1, flags, VMALLOC_START, VMALLOC_END,
1400 NUMA_NO_NODE, GFP_KERNEL, caller);
1404 * find_vm_area - find a continuous kernel virtual area
1405 * @addr: base address
1407 * Search for the kernel VM area starting at @addr, and return it.
1408 * It is up to the caller to do all required locking to keep the returned
1411 struct vm_struct *find_vm_area(const void *addr)
1413 struct vmap_area *va;
1415 va = find_vmap_area((unsigned long)addr);
1416 if (va && va->flags & VM_VM_AREA)
1423 * remove_vm_area - find and remove a continuous kernel virtual area
1424 * @addr: base address
1426 * Search for the kernel VM area starting at @addr, and remove it.
1427 * This function returns the found VM area, but using it is NOT safe
1428 * on SMP machines, except for its size or flags.
1430 struct vm_struct *remove_vm_area(const void *addr)
1432 struct vmap_area *va;
1434 va = find_vmap_area((unsigned long)addr);
1435 if (va && va->flags & VM_VM_AREA) {
1436 struct vm_struct *vm = va->vm;
1438 spin_lock(&vmap_area_lock);
1440 va->flags &= ~VM_VM_AREA;
1441 spin_unlock(&vmap_area_lock);
1443 vmap_debug_free_range(va->va_start, va->va_end);
1444 kasan_free_shadow(vm);
1445 free_unmap_vmap_area(va);
1452 static void __vunmap(const void *addr, int deallocate_pages)
1454 struct vm_struct *area;
1459 if (WARN(!PAGE_ALIGNED(addr), "Trying to vfree() bad address (%p)\n",
1463 area = remove_vm_area(addr);
1464 if (unlikely(!area)) {
1465 WARN(1, KERN_ERR "Trying to vfree() nonexistent vm area (%p)\n",
1470 debug_check_no_locks_freed(addr, get_vm_area_size(area));
1471 debug_check_no_obj_freed(addr, get_vm_area_size(area));
1473 if (deallocate_pages) {
1476 for (i = 0; i < area->nr_pages; i++) {
1477 struct page *page = area->pages[i];
1480 __free_pages(page, 0);
1483 kvfree(area->pages);
1491 * vfree - release memory allocated by vmalloc()
1492 * @addr: memory base address
1494 * Free the virtually continuous memory area starting at @addr, as
1495 * obtained from vmalloc(), vmalloc_32() or __vmalloc(). If @addr is
1496 * NULL, no operation is performed.
1498 * Must not be called in NMI context (strictly speaking, only if we don't
1499 * have CONFIG_ARCH_HAVE_NMI_SAFE_CMPXCHG, but making the calling
1500 * conventions for vfree() arch-depenedent would be a really bad idea)
1502 * NOTE: assumes that the object at *addr has a size >= sizeof(llist_node)
1504 void vfree(const void *addr)
1508 kmemleak_free(addr);
1512 if (unlikely(in_interrupt())) {
1513 struct vfree_deferred *p = this_cpu_ptr(&vfree_deferred);
1514 if (llist_add((struct llist_node *)addr, &p->list))
1515 schedule_work(&p->wq);
1519 EXPORT_SYMBOL(vfree);
1522 * vunmap - release virtual mapping obtained by vmap()
1523 * @addr: memory base address
1525 * Free the virtually contiguous memory area starting at @addr,
1526 * which was created from the page array passed to vmap().
1528 * Must not be called in interrupt context.
1530 void vunmap(const void *addr)
1532 BUG_ON(in_interrupt());
1537 EXPORT_SYMBOL(vunmap);
1540 * vmap - map an array of pages into virtually contiguous space
1541 * @pages: array of page pointers
1542 * @count: number of pages to map
1543 * @flags: vm_area->flags
1544 * @prot: page protection for the mapping
1546 * Maps @count pages from @pages into contiguous kernel virtual
1549 void *vmap(struct page **pages, unsigned int count,
1550 unsigned long flags, pgprot_t prot)
1552 struct vm_struct *area;
1553 unsigned long size; /* In bytes */
1557 if (count > totalram_pages)
1560 size = (unsigned long)count << PAGE_SHIFT;
1561 area = get_vm_area_caller(size, flags, __builtin_return_address(0));
1565 if (map_vm_area(area, prot, pages)) {
1572 EXPORT_SYMBOL(vmap);
1574 static void *__vmalloc_node(unsigned long size, unsigned long align,
1575 gfp_t gfp_mask, pgprot_t prot,
1576 int node, const void *caller);
1577 static void *__vmalloc_area_node(struct vm_struct *area, gfp_t gfp_mask,
1578 pgprot_t prot, int node)
1580 struct page **pages;
1581 unsigned int nr_pages, array_size, i;
1582 const gfp_t nested_gfp = (gfp_mask & GFP_RECLAIM_MASK) | __GFP_ZERO;
1583 const gfp_t alloc_mask = gfp_mask | __GFP_NOWARN;
1585 nr_pages = get_vm_area_size(area) >> PAGE_SHIFT;
1586 array_size = (nr_pages * sizeof(struct page *));
1588 area->nr_pages = nr_pages;
1589 /* Please note that the recursion is strictly bounded. */
1590 if (array_size > PAGE_SIZE) {
1591 pages = __vmalloc_node(array_size, 1, nested_gfp|__GFP_HIGHMEM,
1592 PAGE_KERNEL, node, area->caller);
1594 pages = kmalloc_node(array_size, nested_gfp, node);
1596 area->pages = pages;
1598 remove_vm_area(area->addr);
1603 for (i = 0; i < area->nr_pages; i++) {
1606 if (node == NUMA_NO_NODE)
1607 page = alloc_page(alloc_mask);
1609 page = alloc_pages_node(node, alloc_mask, 0);
1611 if (unlikely(!page)) {
1612 /* Successfully allocated i pages, free them in __vunmap() */
1616 area->pages[i] = page;
1617 if (gfpflags_allow_blocking(gfp_mask))
1621 if (map_vm_area(area, prot, pages))
1626 warn_alloc(gfp_mask,
1627 "vmalloc: allocation failure, allocated %ld of %ld bytes",
1628 (area->nr_pages*PAGE_SIZE), area->size);
1634 * __vmalloc_node_range - allocate virtually contiguous memory
1635 * @size: allocation size
1636 * @align: desired alignment
1637 * @start: vm area range start
1638 * @end: vm area range end
1639 * @gfp_mask: flags for the page level allocator
1640 * @prot: protection mask for the allocated pages
1641 * @vm_flags: additional vm area flags (e.g. %VM_NO_GUARD)
1642 * @node: node to use for allocation or NUMA_NO_NODE
1643 * @caller: caller's return address
1645 * Allocate enough pages to cover @size from the page level
1646 * allocator with @gfp_mask flags. Map them into contiguous
1647 * kernel virtual space, using a pagetable protection of @prot.
1649 void *__vmalloc_node_range(unsigned long size, unsigned long align,
1650 unsigned long start, unsigned long end, gfp_t gfp_mask,
1651 pgprot_t prot, unsigned long vm_flags, int node,
1654 struct vm_struct *area;
1656 unsigned long real_size = size;
1658 size = PAGE_ALIGN(size);
1659 if (!size || (size >> PAGE_SHIFT) > totalram_pages)
1662 area = __get_vm_area_node(size, align, VM_ALLOC | VM_UNINITIALIZED |
1663 vm_flags, start, end, node, gfp_mask, caller);
1667 addr = __vmalloc_area_node(area, gfp_mask, prot, node);
1672 * In this function, newly allocated vm_struct has VM_UNINITIALIZED
1673 * flag. It means that vm_struct is not fully initialized.
1674 * Now, it is fully initialized, so remove this flag here.
1676 clear_vm_uninitialized_flag(area);
1679 * A ref_count = 2 is needed because vm_struct allocated in
1680 * __get_vm_area_node() contains a reference to the virtual address of
1681 * the vmalloc'ed block.
1683 kmemleak_alloc(addr, real_size, 2, gfp_mask);
1688 warn_alloc(gfp_mask,
1689 "vmalloc: allocation failure: %lu bytes", real_size);
1694 * __vmalloc_node - allocate virtually contiguous memory
1695 * @size: allocation size
1696 * @align: desired alignment
1697 * @gfp_mask: flags for the page level allocator
1698 * @prot: protection mask for the allocated pages
1699 * @node: node to use for allocation or NUMA_NO_NODE
1700 * @caller: caller's return address
1702 * Allocate enough pages to cover @size from the page level
1703 * allocator with @gfp_mask flags. Map them into contiguous
1704 * kernel virtual space, using a pagetable protection of @prot.
1706 static void *__vmalloc_node(unsigned long size, unsigned long align,
1707 gfp_t gfp_mask, pgprot_t prot,
1708 int node, const void *caller)
1710 return __vmalloc_node_range(size, align, VMALLOC_START, VMALLOC_END,
1711 gfp_mask, prot, 0, node, caller);
1714 void *__vmalloc(unsigned long size, gfp_t gfp_mask, pgprot_t prot)
1716 return __vmalloc_node(size, 1, gfp_mask, prot, NUMA_NO_NODE,
1717 __builtin_return_address(0));
1719 EXPORT_SYMBOL(__vmalloc);
1721 static inline void *__vmalloc_node_flags(unsigned long size,
1722 int node, gfp_t flags)
1724 return __vmalloc_node(size, 1, flags, PAGE_KERNEL,
1725 node, __builtin_return_address(0));
1729 * vmalloc - allocate virtually contiguous memory
1730 * @size: allocation size
1731 * Allocate enough pages to cover @size from the page level
1732 * allocator and map them into contiguous kernel virtual space.
1734 * For tight control over page level allocator and protection flags
1735 * use __vmalloc() instead.
1737 void *vmalloc(unsigned long size)
1739 return __vmalloc_node_flags(size, NUMA_NO_NODE,
1740 GFP_KERNEL | __GFP_HIGHMEM);
1742 EXPORT_SYMBOL(vmalloc);
1745 * vzalloc - allocate virtually contiguous memory with zero fill
1746 * @size: allocation size
1747 * Allocate enough pages to cover @size from the page level
1748 * allocator and map them into contiguous kernel virtual space.
1749 * The memory allocated is set to zero.
1751 * For tight control over page level allocator and protection flags
1752 * use __vmalloc() instead.
1754 void *vzalloc(unsigned long size)
1756 return __vmalloc_node_flags(size, NUMA_NO_NODE,
1757 GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO);
1759 EXPORT_SYMBOL(vzalloc);
1762 * vmalloc_user - allocate zeroed virtually contiguous memory for userspace
1763 * @size: allocation size
1765 * The resulting memory area is zeroed so it can be mapped to userspace
1766 * without leaking data.
1768 void *vmalloc_user(unsigned long size)
1770 struct vm_struct *area;
1773 ret = __vmalloc_node(size, SHMLBA,
1774 GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO,
1775 PAGE_KERNEL, NUMA_NO_NODE,
1776 __builtin_return_address(0));
1778 area = find_vm_area(ret);
1779 area->flags |= VM_USERMAP;
1783 EXPORT_SYMBOL(vmalloc_user);
1786 * vmalloc_node - allocate memory on a specific node
1787 * @size: allocation size
1790 * Allocate enough pages to cover @size from the page level
1791 * allocator and map them into contiguous kernel virtual space.
1793 * For tight control over page level allocator and protection flags
1794 * use __vmalloc() instead.
1796 void *vmalloc_node(unsigned long size, int node)
1798 return __vmalloc_node(size, 1, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL,
1799 node, __builtin_return_address(0));
1801 EXPORT_SYMBOL(vmalloc_node);
1804 * vzalloc_node - allocate memory on a specific node with zero fill
1805 * @size: allocation size
1808 * Allocate enough pages to cover @size from the page level
1809 * allocator and map them into contiguous kernel virtual space.
1810 * The memory allocated is set to zero.
1812 * For tight control over page level allocator and protection flags
1813 * use __vmalloc_node() instead.
1815 void *vzalloc_node(unsigned long size, int node)
1817 return __vmalloc_node_flags(size, node,
1818 GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO);
1820 EXPORT_SYMBOL(vzalloc_node);
1822 #ifndef PAGE_KERNEL_EXEC
1823 # define PAGE_KERNEL_EXEC PAGE_KERNEL
1827 * vmalloc_exec - allocate virtually contiguous, executable memory
1828 * @size: allocation size
1830 * Kernel-internal function to allocate enough pages to cover @size
1831 * the page level allocator and map them into contiguous and
1832 * executable kernel virtual space.
1834 * For tight control over page level allocator and protection flags
1835 * use __vmalloc() instead.
1838 void *vmalloc_exec(unsigned long size)
1840 return __vmalloc_node(size, 1, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL_EXEC,
1841 NUMA_NO_NODE, __builtin_return_address(0));
1844 #if defined(CONFIG_64BIT) && defined(CONFIG_ZONE_DMA32)
1845 #define GFP_VMALLOC32 GFP_DMA32 | GFP_KERNEL
1846 #elif defined(CONFIG_64BIT) && defined(CONFIG_ZONE_DMA)
1847 #define GFP_VMALLOC32 GFP_DMA | GFP_KERNEL
1849 #define GFP_VMALLOC32 GFP_KERNEL
1853 * vmalloc_32 - allocate virtually contiguous memory (32bit addressable)
1854 * @size: allocation size
1856 * Allocate enough 32bit PA addressable pages to cover @size from the
1857 * page level allocator and map them into contiguous kernel virtual space.
1859 void *vmalloc_32(unsigned long size)
1861 return __vmalloc_node(size, 1, GFP_VMALLOC32, PAGE_KERNEL,
1862 NUMA_NO_NODE, __builtin_return_address(0));
1864 EXPORT_SYMBOL(vmalloc_32);
1867 * vmalloc_32_user - allocate zeroed virtually contiguous 32bit memory
1868 * @size: allocation size
1870 * The resulting memory area is 32bit addressable and zeroed so it can be
1871 * mapped to userspace without leaking data.
1873 void *vmalloc_32_user(unsigned long size)
1875 struct vm_struct *area;
1878 ret = __vmalloc_node(size, 1, GFP_VMALLOC32 | __GFP_ZERO, PAGE_KERNEL,
1879 NUMA_NO_NODE, __builtin_return_address(0));
1881 area = find_vm_area(ret);
1882 area->flags |= VM_USERMAP;
1886 EXPORT_SYMBOL(vmalloc_32_user);
1889 * small helper routine , copy contents to buf from addr.
1890 * If the page is not present, fill zero.
1893 static int aligned_vread(char *buf, char *addr, unsigned long count)
1899 unsigned long offset, length;
1901 offset = offset_in_page(addr);
1902 length = PAGE_SIZE - offset;
1905 p = vmalloc_to_page(addr);
1907 * To do safe access to this _mapped_ area, we need
1908 * lock. But adding lock here means that we need to add
1909 * overhead of vmalloc()/vfree() calles for this _debug_
1910 * interface, rarely used. Instead of that, we'll use
1911 * kmap() and get small overhead in this access function.
1915 * we can expect USER0 is not used (see vread/vwrite's
1916 * function description)
1918 void *map = kmap_atomic(p);
1919 memcpy(buf, map + offset, length);
1922 memset(buf, 0, length);
1932 static int aligned_vwrite(char *buf, char *addr, unsigned long count)
1938 unsigned long offset, length;
1940 offset = offset_in_page(addr);
1941 length = PAGE_SIZE - offset;
1944 p = vmalloc_to_page(addr);
1946 * To do safe access to this _mapped_ area, we need
1947 * lock. But adding lock here means that we need to add
1948 * overhead of vmalloc()/vfree() calles for this _debug_
1949 * interface, rarely used. Instead of that, we'll use
1950 * kmap() and get small overhead in this access function.
1954 * we can expect USER0 is not used (see vread/vwrite's
1955 * function description)
1957 void *map = kmap_atomic(p);
1958 memcpy(map + offset, buf, length);
1970 * vread() - read vmalloc area in a safe way.
1971 * @buf: buffer for reading data
1972 * @addr: vm address.
1973 * @count: number of bytes to be read.
1975 * Returns # of bytes which addr and buf should be increased.
1976 * (same number to @count). Returns 0 if [addr...addr+count) doesn't
1977 * includes any intersect with alive vmalloc area.
1979 * This function checks that addr is a valid vmalloc'ed area, and
1980 * copy data from that area to a given buffer. If the given memory range
1981 * of [addr...addr+count) includes some valid address, data is copied to
1982 * proper area of @buf. If there are memory holes, they'll be zero-filled.
1983 * IOREMAP area is treated as memory hole and no copy is done.
1985 * If [addr...addr+count) doesn't includes any intersects with alive
1986 * vm_struct area, returns 0. @buf should be kernel's buffer.
1988 * Note: In usual ops, vread() is never necessary because the caller
1989 * should know vmalloc() area is valid and can use memcpy().
1990 * This is for routines which have to access vmalloc area without
1991 * any informaion, as /dev/kmem.
1995 long vread(char *buf, char *addr, unsigned long count)
1997 struct vmap_area *va;
1998 struct vm_struct *vm;
1999 char *vaddr, *buf_start = buf;
2000 unsigned long buflen = count;
2003 /* Don't allow overflow */
2004 if ((unsigned long) addr + count < count)
2005 count = -(unsigned long) addr;
2007 spin_lock(&vmap_area_lock);
2008 list_for_each_entry(va, &vmap_area_list, list) {
2012 if (!(va->flags & VM_VM_AREA))
2016 vaddr = (char *) vm->addr;
2017 if (addr >= vaddr + get_vm_area_size(vm))
2019 while (addr < vaddr) {
2027 n = vaddr + get_vm_area_size(vm) - addr;
2030 if (!(vm->flags & VM_IOREMAP))
2031 aligned_vread(buf, addr, n);
2032 else /* IOREMAP area is treated as memory hole */
2039 spin_unlock(&vmap_area_lock);
2041 if (buf == buf_start)
2043 /* zero-fill memory holes */
2044 if (buf != buf_start + buflen)
2045 memset(buf, 0, buflen - (buf - buf_start));
2051 * vwrite() - write vmalloc area in a safe way.
2052 * @buf: buffer for source data
2053 * @addr: vm address.
2054 * @count: number of bytes to be read.
2056 * Returns # of bytes which addr and buf should be incresed.
2057 * (same number to @count).
2058 * If [addr...addr+count) doesn't includes any intersect with valid
2059 * vmalloc area, returns 0.
2061 * This function checks that addr is a valid vmalloc'ed area, and
2062 * copy data from a buffer to the given addr. If specified range of
2063 * [addr...addr+count) includes some valid address, data is copied from
2064 * proper area of @buf. If there are memory holes, no copy to hole.
2065 * IOREMAP area is treated as memory hole and no copy is done.
2067 * If [addr...addr+count) doesn't includes any intersects with alive
2068 * vm_struct area, returns 0. @buf should be kernel's buffer.
2070 * Note: In usual ops, vwrite() is never necessary because the caller
2071 * should know vmalloc() area is valid and can use memcpy().
2072 * This is for routines which have to access vmalloc area without
2073 * any informaion, as /dev/kmem.
2076 long vwrite(char *buf, char *addr, unsigned long count)
2078 struct vmap_area *va;
2079 struct vm_struct *vm;
2081 unsigned long n, buflen;
2084 /* Don't allow overflow */
2085 if ((unsigned long) addr + count < count)
2086 count = -(unsigned long) addr;
2089 spin_lock(&vmap_area_lock);
2090 list_for_each_entry(va, &vmap_area_list, list) {
2094 if (!(va->flags & VM_VM_AREA))
2098 vaddr = (char *) vm->addr;
2099 if (addr >= vaddr + get_vm_area_size(vm))
2101 while (addr < vaddr) {
2108 n = vaddr + get_vm_area_size(vm) - addr;
2111 if (!(vm->flags & VM_IOREMAP)) {
2112 aligned_vwrite(buf, addr, n);
2120 spin_unlock(&vmap_area_lock);
2127 * remap_vmalloc_range_partial - map vmalloc pages to userspace
2128 * @vma: vma to cover
2129 * @uaddr: target user address to start at
2130 * @kaddr: virtual address of vmalloc kernel memory
2131 * @size: size of map area
2133 * Returns: 0 for success, -Exxx on failure
2135 * This function checks that @kaddr is a valid vmalloc'ed area,
2136 * and that it is big enough to cover the range starting at
2137 * @uaddr in @vma. Will return failure if that criteria isn't
2140 * Similar to remap_pfn_range() (see mm/memory.c)
2142 int remap_vmalloc_range_partial(struct vm_area_struct *vma, unsigned long uaddr,
2143 void *kaddr, unsigned long size)
2145 struct vm_struct *area;
2147 size = PAGE_ALIGN(size);
2149 if (!PAGE_ALIGNED(uaddr) || !PAGE_ALIGNED(kaddr))
2152 area = find_vm_area(kaddr);
2156 if (!(area->flags & VM_USERMAP))
2159 if (kaddr + size > area->addr + area->size)
2163 struct page *page = vmalloc_to_page(kaddr);
2166 ret = vm_insert_page(vma, uaddr, page);
2175 vma->vm_flags |= VM_DONTEXPAND | VM_DONTDUMP;
2179 EXPORT_SYMBOL(remap_vmalloc_range_partial);
2182 * remap_vmalloc_range - map vmalloc pages to userspace
2183 * @vma: vma to cover (map full range of vma)
2184 * @addr: vmalloc memory
2185 * @pgoff: number of pages into addr before first page to map
2187 * Returns: 0 for success, -Exxx on failure
2189 * This function checks that addr is a valid vmalloc'ed area, and
2190 * that it is big enough to cover the vma. Will return failure if
2191 * that criteria isn't met.
2193 * Similar to remap_pfn_range() (see mm/memory.c)
2195 int remap_vmalloc_range(struct vm_area_struct *vma, void *addr,
2196 unsigned long pgoff)
2198 return remap_vmalloc_range_partial(vma, vma->vm_start,
2199 addr + (pgoff << PAGE_SHIFT),
2200 vma->vm_end - vma->vm_start);
2202 EXPORT_SYMBOL(remap_vmalloc_range);
2205 * Implement a stub for vmalloc_sync_all() if the architecture chose not to
2208 void __weak vmalloc_sync_all(void)
2213 static int f(pte_t *pte, pgtable_t table, unsigned long addr, void *data)
2225 * alloc_vm_area - allocate a range of kernel address space
2226 * @size: size of the area
2227 * @ptes: returns the PTEs for the address space
2229 * Returns: NULL on failure, vm_struct on success
2231 * This function reserves a range of kernel address space, and
2232 * allocates pagetables to map that range. No actual mappings
2235 * If @ptes is non-NULL, pointers to the PTEs (in init_mm)
2236 * allocated for the VM area are returned.
2238 struct vm_struct *alloc_vm_area(size_t size, pte_t **ptes)
2240 struct vm_struct *area;
2242 area = get_vm_area_caller(size, VM_IOREMAP,
2243 __builtin_return_address(0));
2248 * This ensures that page tables are constructed for this region
2249 * of kernel virtual address space and mapped into init_mm.
2251 if (apply_to_page_range(&init_mm, (unsigned long)area->addr,
2252 size, f, ptes ? &ptes : NULL)) {
2259 EXPORT_SYMBOL_GPL(alloc_vm_area);
2261 void free_vm_area(struct vm_struct *area)
2263 struct vm_struct *ret;
2264 ret = remove_vm_area(area->addr);
2265 BUG_ON(ret != area);
2268 EXPORT_SYMBOL_GPL(free_vm_area);
2271 static struct vmap_area *node_to_va(struct rb_node *n)
2273 return n ? rb_entry(n, struct vmap_area, rb_node) : NULL;
2277 * pvm_find_next_prev - find the next and prev vmap_area surrounding @end
2278 * @end: target address
2279 * @pnext: out arg for the next vmap_area
2280 * @pprev: out arg for the previous vmap_area
2282 * Returns: %true if either or both of next and prev are found,
2283 * %false if no vmap_area exists
2285 * Find vmap_areas end addresses of which enclose @end. ie. if not
2286 * NULL, *pnext->va_end > @end and *pprev->va_end <= @end.
2288 static bool pvm_find_next_prev(unsigned long end,
2289 struct vmap_area **pnext,
2290 struct vmap_area **pprev)
2292 struct rb_node *n = vmap_area_root.rb_node;
2293 struct vmap_area *va = NULL;
2296 va = rb_entry(n, struct vmap_area, rb_node);
2297 if (end < va->va_end)
2299 else if (end > va->va_end)
2308 if (va->va_end > end) {
2310 *pprev = node_to_va(rb_prev(&(*pnext)->rb_node));
2313 *pnext = node_to_va(rb_next(&(*pprev)->rb_node));
2319 * pvm_determine_end - find the highest aligned address between two vmap_areas
2320 * @pnext: in/out arg for the next vmap_area
2321 * @pprev: in/out arg for the previous vmap_area
2324 * Returns: determined end address
2326 * Find the highest aligned address between *@pnext and *@pprev below
2327 * VMALLOC_END. *@pnext and *@pprev are adjusted so that the aligned
2328 * down address is between the end addresses of the two vmap_areas.
2330 * Please note that the address returned by this function may fall
2331 * inside *@pnext vmap_area. The caller is responsible for checking
2334 static unsigned long pvm_determine_end(struct vmap_area **pnext,
2335 struct vmap_area **pprev,
2336 unsigned long align)
2338 const unsigned long vmalloc_end = VMALLOC_END & ~(align - 1);
2342 addr = min((*pnext)->va_start & ~(align - 1), vmalloc_end);
2346 while (*pprev && (*pprev)->va_end > addr) {
2348 *pprev = node_to_va(rb_prev(&(*pnext)->rb_node));
2355 * pcpu_get_vm_areas - allocate vmalloc areas for percpu allocator
2356 * @offsets: array containing offset of each area
2357 * @sizes: array containing size of each area
2358 * @nr_vms: the number of areas to allocate
2359 * @align: alignment, all entries in @offsets and @sizes must be aligned to this
2361 * Returns: kmalloc'd vm_struct pointer array pointing to allocated
2362 * vm_structs on success, %NULL on failure
2364 * Percpu allocator wants to use congruent vm areas so that it can
2365 * maintain the offsets among percpu areas. This function allocates
2366 * congruent vmalloc areas for it with GFP_KERNEL. These areas tend to
2367 * be scattered pretty far, distance between two areas easily going up
2368 * to gigabytes. To avoid interacting with regular vmallocs, these
2369 * areas are allocated from top.
2371 * Despite its complicated look, this allocator is rather simple. It
2372 * does everything top-down and scans areas from the end looking for
2373 * matching slot. While scanning, if any of the areas overlaps with
2374 * existing vmap_area, the base address is pulled down to fit the
2375 * area. Scanning is repeated till all the areas fit and then all
2376 * necessary data structres are inserted and the result is returned.
2378 struct vm_struct **pcpu_get_vm_areas(const unsigned long *offsets,
2379 const size_t *sizes, int nr_vms,
2382 const unsigned long vmalloc_start = ALIGN(VMALLOC_START, align);
2383 const unsigned long vmalloc_end = VMALLOC_END & ~(align - 1);
2384 struct vmap_area **vas, *prev, *next;
2385 struct vm_struct **vms;
2386 int area, area2, last_area, term_area;
2387 unsigned long base, start, end, last_end;
2388 bool purged = false;
2390 /* verify parameters and allocate data structures */
2391 BUG_ON(offset_in_page(align) || !is_power_of_2(align));
2392 for (last_area = 0, area = 0; area < nr_vms; area++) {
2393 start = offsets[area];
2394 end = start + sizes[area];
2396 /* is everything aligned properly? */
2397 BUG_ON(!IS_ALIGNED(offsets[area], align));
2398 BUG_ON(!IS_ALIGNED(sizes[area], align));
2400 /* detect the area with the highest address */
2401 if (start > offsets[last_area])
2404 for (area2 = 0; area2 < nr_vms; area2++) {
2405 unsigned long start2 = offsets[area2];
2406 unsigned long end2 = start2 + sizes[area2];
2411 BUG_ON(start2 >= start && start2 < end);
2412 BUG_ON(end2 <= end && end2 > start);
2415 last_end = offsets[last_area] + sizes[last_area];
2417 if (vmalloc_end - vmalloc_start < last_end) {
2422 vms = kcalloc(nr_vms, sizeof(vms[0]), GFP_KERNEL);
2423 vas = kcalloc(nr_vms, sizeof(vas[0]), GFP_KERNEL);
2427 for (area = 0; area < nr_vms; area++) {
2428 vas[area] = kzalloc(sizeof(struct vmap_area), GFP_KERNEL);
2429 vms[area] = kzalloc(sizeof(struct vm_struct), GFP_KERNEL);
2430 if (!vas[area] || !vms[area])
2434 spin_lock(&vmap_area_lock);
2436 /* start scanning - we scan from the top, begin with the last area */
2437 area = term_area = last_area;
2438 start = offsets[area];
2439 end = start + sizes[area];
2441 if (!pvm_find_next_prev(vmap_area_pcpu_hole, &next, &prev)) {
2442 base = vmalloc_end - last_end;
2445 base = pvm_determine_end(&next, &prev, align) - end;
2448 BUG_ON(next && next->va_end <= base + end);
2449 BUG_ON(prev && prev->va_end > base + end);
2452 * base might have underflowed, add last_end before
2455 if (base + last_end < vmalloc_start + last_end) {
2456 spin_unlock(&vmap_area_lock);
2458 purge_vmap_area_lazy();
2466 * If next overlaps, move base downwards so that it's
2467 * right below next and then recheck.
2469 if (next && next->va_start < base + end) {
2470 base = pvm_determine_end(&next, &prev, align) - end;
2476 * If prev overlaps, shift down next and prev and move
2477 * base so that it's right below new next and then
2480 if (prev && prev->va_end > base + start) {
2482 prev = node_to_va(rb_prev(&next->rb_node));
2483 base = pvm_determine_end(&next, &prev, align) - end;
2489 * This area fits, move on to the previous one. If
2490 * the previous one is the terminal one, we're done.
2492 area = (area + nr_vms - 1) % nr_vms;
2493 if (area == term_area)
2495 start = offsets[area];
2496 end = start + sizes[area];
2497 pvm_find_next_prev(base + end, &next, &prev);
2500 /* we've found a fitting base, insert all va's */
2501 for (area = 0; area < nr_vms; area++) {
2502 struct vmap_area *va = vas[area];
2504 va->va_start = base + offsets[area];
2505 va->va_end = va->va_start + sizes[area];
2506 __insert_vmap_area(va);
2509 vmap_area_pcpu_hole = base + offsets[last_area];
2511 spin_unlock(&vmap_area_lock);
2513 /* insert all vm's */
2514 for (area = 0; area < nr_vms; area++)
2515 setup_vmalloc_vm(vms[area], vas[area], VM_ALLOC,
2522 for (area = 0; area < nr_vms; area++) {
2533 * pcpu_free_vm_areas - free vmalloc areas for percpu allocator
2534 * @vms: vm_struct pointer array returned by pcpu_get_vm_areas()
2535 * @nr_vms: the number of allocated areas
2537 * Free vm_structs and the array allocated by pcpu_get_vm_areas().
2539 void pcpu_free_vm_areas(struct vm_struct **vms, int nr_vms)
2543 for (i = 0; i < nr_vms; i++)
2544 free_vm_area(vms[i]);
2547 #endif /* CONFIG_SMP */
2549 #ifdef CONFIG_PROC_FS
2550 static void *s_start(struct seq_file *m, loff_t *pos)
2551 __acquires(&vmap_area_lock)
2553 spin_lock(&vmap_area_lock);
2554 return seq_list_start(&vmap_area_list, *pos);
2557 static void *s_next(struct seq_file *m, void *p, loff_t *pos)
2559 return seq_list_next(p, &vmap_area_list, pos);
2562 static void s_stop(struct seq_file *m, void *p)
2563 __releases(&vmap_area_lock)
2565 spin_unlock(&vmap_area_lock);
2568 static void show_numa_info(struct seq_file *m, struct vm_struct *v)
2570 if (IS_ENABLED(CONFIG_NUMA)) {
2571 unsigned int nr, *counters = m->private;
2576 if (v->flags & VM_UNINITIALIZED)
2578 /* Pair with smp_wmb() in clear_vm_uninitialized_flag() */
2581 memset(counters, 0, nr_node_ids * sizeof(unsigned int));
2583 for (nr = 0; nr < v->nr_pages; nr++)
2584 counters[page_to_nid(v->pages[nr])]++;
2586 for_each_node_state(nr, N_HIGH_MEMORY)
2588 seq_printf(m, " N%u=%u", nr, counters[nr]);
2592 static int s_show(struct seq_file *m, void *p)
2594 struct vmap_area *va;
2595 struct vm_struct *v;
2597 va = list_entry(p, struct vmap_area, list);
2600 * s_show can encounter race with remove_vm_area, !VM_VM_AREA on
2601 * behalf of vmap area is being tear down or vm_map_ram allocation.
2603 if (!(va->flags & VM_VM_AREA))
2608 seq_printf(m, "0x%pK-0x%pK %7ld",
2609 v->addr, v->addr + v->size, v->size);
2612 seq_printf(m, " %pS", v->caller);
2615 seq_printf(m, " pages=%d", v->nr_pages);
2618 seq_printf(m, " phys=%llx", (unsigned long long)v->phys_addr);
2620 if (v->flags & VM_IOREMAP)
2621 seq_puts(m, " ioremap");
2623 if (v->flags & VM_ALLOC)
2624 seq_puts(m, " vmalloc");
2626 if (v->flags & VM_MAP)
2627 seq_puts(m, " vmap");
2629 if (v->flags & VM_USERMAP)
2630 seq_puts(m, " user");
2632 if (is_vmalloc_addr(v->pages))
2633 seq_puts(m, " vpages");
2635 show_numa_info(m, v);
2640 static const struct seq_operations vmalloc_op = {
2647 static int vmalloc_open(struct inode *inode, struct file *file)
2649 if (IS_ENABLED(CONFIG_NUMA))
2650 return seq_open_private(file, &vmalloc_op,
2651 nr_node_ids * sizeof(unsigned int));
2653 return seq_open(file, &vmalloc_op);
2656 static const struct file_operations proc_vmalloc_operations = {
2657 .open = vmalloc_open,
2659 .llseek = seq_lseek,
2660 .release = seq_release_private,
2663 static int __init proc_vmalloc_init(void)
2665 proc_create("vmallocinfo", S_IRUSR, NULL, &proc_vmalloc_operations);
2668 module_init(proc_vmalloc_init);