Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | /* |
| 2 | * linux/mm/vmalloc.c |
| 3 | * |
| 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 |
Christoph Lameter | 930fc45 | 2005-10-29 18:15:41 -0700 | [diff] [blame] | 8 | * Numa awareness, Christoph Lameter, SGI, June 2005 |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 9 | */ |
| 10 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 11 | #include <linux/vmalloc.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 12 | #include <linux/mm.h> |
| 13 | #include <linux/module.h> |
| 14 | #include <linux/highmem.h> |
Alexey Dobriyan | d43c36d | 2009-10-07 17:09:06 +0400 | [diff] [blame] | 15 | #include <linux/sched.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 16 | #include <linux/slab.h> |
| 17 | #include <linux/spinlock.h> |
| 18 | #include <linux/interrupt.h> |
Alexey Dobriyan | 5f6a6a9 | 2008-10-06 03:50:47 +0400 | [diff] [blame] | 19 | #include <linux/proc_fs.h> |
Christoph Lameter | a10aa57 | 2008-04-28 02:12:40 -0700 | [diff] [blame] | 20 | #include <linux/seq_file.h> |
Thomas Gleixner | 3ac7fe5 | 2008-04-30 00:55:01 -0700 | [diff] [blame] | 21 | #include <linux/debugobjects.h> |
Christoph Lameter | 2301696 | 2008-04-28 02:12:42 -0700 | [diff] [blame] | 22 | #include <linux/kallsyms.h> |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 23 | #include <linux/list.h> |
| 24 | #include <linux/rbtree.h> |
| 25 | #include <linux/radix-tree.h> |
| 26 | #include <linux/rcupdate.h> |
Tejun Heo | f0aa661 | 2009-02-20 16:29:08 +0900 | [diff] [blame] | 27 | #include <linux/pfn.h> |
Catalin Marinas | 89219d3 | 2009-06-11 13:23:19 +0100 | [diff] [blame] | 28 | #include <linux/kmemleak.h> |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 29 | #include <asm/atomic.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 30 | #include <asm/uaccess.h> |
| 31 | #include <asm/tlbflush.h> |
David Miller | 2dca699 | 2009-09-21 12:22:34 -0700 | [diff] [blame] | 32 | #include <asm/shmparam.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 33 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 34 | /*** Page table manipulation functions ***/ |
Adrian Bunk | b221385 | 2006-09-25 23:31:02 -0700 | [diff] [blame] | 35 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 36 | static void vunmap_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end) |
| 37 | { |
| 38 | pte_t *pte; |
| 39 | |
| 40 | pte = pte_offset_kernel(pmd, addr); |
| 41 | do { |
| 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); |
| 45 | } |
| 46 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 47 | static void vunmap_pmd_range(pud_t *pud, unsigned long addr, unsigned long end) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 48 | { |
| 49 | pmd_t *pmd; |
| 50 | unsigned long next; |
| 51 | |
| 52 | pmd = pmd_offset(pud, addr); |
| 53 | do { |
| 54 | next = pmd_addr_end(addr, end); |
| 55 | if (pmd_none_or_clear_bad(pmd)) |
| 56 | continue; |
| 57 | vunmap_pte_range(pmd, addr, next); |
| 58 | } while (pmd++, addr = next, addr != end); |
| 59 | } |
| 60 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 61 | static void vunmap_pud_range(pgd_t *pgd, unsigned long addr, unsigned long end) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 62 | { |
| 63 | pud_t *pud; |
| 64 | unsigned long next; |
| 65 | |
| 66 | pud = pud_offset(pgd, addr); |
| 67 | do { |
| 68 | next = pud_addr_end(addr, end); |
| 69 | if (pud_none_or_clear_bad(pud)) |
| 70 | continue; |
| 71 | vunmap_pmd_range(pud, addr, next); |
| 72 | } while (pud++, addr = next, addr != end); |
| 73 | } |
| 74 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 75 | static void vunmap_page_range(unsigned long addr, unsigned long end) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 76 | { |
| 77 | pgd_t *pgd; |
| 78 | unsigned long next; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 79 | |
| 80 | BUG_ON(addr >= end); |
| 81 | pgd = pgd_offset_k(addr); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 82 | do { |
| 83 | next = pgd_addr_end(addr, end); |
| 84 | if (pgd_none_or_clear_bad(pgd)) |
| 85 | continue; |
| 86 | vunmap_pud_range(pgd, addr, next); |
| 87 | } while (pgd++, addr = next, addr != end); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 88 | } |
| 89 | |
| 90 | static int vmap_pte_range(pmd_t *pmd, unsigned long addr, |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 91 | unsigned long end, pgprot_t prot, struct page **pages, int *nr) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 92 | { |
| 93 | pte_t *pte; |
| 94 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 95 | /* |
| 96 | * nr is a running index into the array which helps higher level |
| 97 | * callers keep track of where we're up to. |
| 98 | */ |
| 99 | |
Hugh Dickins | 872fec1 | 2005-10-29 18:16:21 -0700 | [diff] [blame] | 100 | pte = pte_alloc_kernel(pmd, addr); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 101 | if (!pte) |
| 102 | return -ENOMEM; |
| 103 | do { |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 104 | struct page *page = pages[*nr]; |
| 105 | |
| 106 | if (WARN_ON(!pte_none(*pte))) |
| 107 | return -EBUSY; |
| 108 | if (WARN_ON(!page)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 109 | return -ENOMEM; |
| 110 | set_pte_at(&init_mm, addr, pte, mk_pte(page, prot)); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 111 | (*nr)++; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 112 | } while (pte++, addr += PAGE_SIZE, addr != end); |
| 113 | return 0; |
| 114 | } |
| 115 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 116 | static int vmap_pmd_range(pud_t *pud, unsigned long addr, |
| 117 | unsigned long end, pgprot_t prot, struct page **pages, int *nr) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 118 | { |
| 119 | pmd_t *pmd; |
| 120 | unsigned long next; |
| 121 | |
| 122 | pmd = pmd_alloc(&init_mm, pud, addr); |
| 123 | if (!pmd) |
| 124 | return -ENOMEM; |
| 125 | do { |
| 126 | next = pmd_addr_end(addr, end); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 127 | if (vmap_pte_range(pmd, addr, next, prot, pages, nr)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 128 | return -ENOMEM; |
| 129 | } while (pmd++, addr = next, addr != end); |
| 130 | return 0; |
| 131 | } |
| 132 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 133 | static int vmap_pud_range(pgd_t *pgd, unsigned long addr, |
| 134 | unsigned long end, pgprot_t prot, struct page **pages, int *nr) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 135 | { |
| 136 | pud_t *pud; |
| 137 | unsigned long next; |
| 138 | |
| 139 | pud = pud_alloc(&init_mm, pgd, addr); |
| 140 | if (!pud) |
| 141 | return -ENOMEM; |
| 142 | do { |
| 143 | next = pud_addr_end(addr, end); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 144 | if (vmap_pmd_range(pud, addr, next, prot, pages, nr)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 145 | return -ENOMEM; |
| 146 | } while (pud++, addr = next, addr != end); |
| 147 | return 0; |
| 148 | } |
| 149 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 150 | /* |
| 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. |
| 153 | * |
| 154 | * Ie. pte at addr+N*PAGE_SIZE shall point to pfn corresponding to pages[N] |
| 155 | */ |
Tejun Heo | 8fc4898 | 2009-02-20 16:29:08 +0900 | [diff] [blame] | 156 | static int vmap_page_range_noflush(unsigned long start, unsigned long end, |
| 157 | pgprot_t prot, struct page **pages) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 158 | { |
| 159 | pgd_t *pgd; |
| 160 | unsigned long next; |
Adam Lackorzynski | 2e4e27c | 2009-01-04 12:00:46 -0800 | [diff] [blame] | 161 | unsigned long addr = start; |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 162 | int err = 0; |
| 163 | int nr = 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 164 | |
| 165 | BUG_ON(addr >= end); |
| 166 | pgd = pgd_offset_k(addr); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 167 | do { |
| 168 | next = pgd_addr_end(addr, end); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 169 | err = vmap_pud_range(pgd, addr, next, prot, pages, &nr); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 170 | if (err) |
Figo.zhang | bf88c8c | 2009-09-21 17:01:47 -0700 | [diff] [blame] | 171 | return err; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 172 | } while (pgd++, addr = next, addr != end); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 173 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 174 | return nr; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 175 | } |
| 176 | |
Tejun Heo | 8fc4898 | 2009-02-20 16:29:08 +0900 | [diff] [blame] | 177 | static int vmap_page_range(unsigned long start, unsigned long end, |
| 178 | pgprot_t prot, struct page **pages) |
| 179 | { |
| 180 | int ret; |
| 181 | |
| 182 | ret = vmap_page_range_noflush(start, end, prot, pages); |
| 183 | flush_cache_vmap(start, end); |
| 184 | return ret; |
| 185 | } |
| 186 | |
KAMEZAWA Hiroyuki | 81ac3ad | 2009-09-22 16:45:49 -0700 | [diff] [blame] | 187 | int is_vmalloc_or_module_addr(const void *x) |
Linus Torvalds | 73bdf0a | 2008-10-15 08:35:12 -0700 | [diff] [blame] | 188 | { |
| 189 | /* |
Russell King | ab4f2ee | 2008-11-06 17:11:07 +0000 | [diff] [blame] | 190 | * ARM, x86-64 and sparc64 put modules in a special place, |
Linus Torvalds | 73bdf0a | 2008-10-15 08:35:12 -0700 | [diff] [blame] | 191 | * and fall back on vmalloc() if that fails. Others |
| 192 | * just put it in the vmalloc space. |
| 193 | */ |
| 194 | #if defined(CONFIG_MODULES) && defined(MODULES_VADDR) |
| 195 | unsigned long addr = (unsigned long)x; |
| 196 | if (addr >= MODULES_VADDR && addr < MODULES_END) |
| 197 | return 1; |
| 198 | #endif |
| 199 | return is_vmalloc_addr(x); |
| 200 | } |
| 201 | |
Christoph Lameter | 48667e7 | 2008-02-04 22:28:31 -0800 | [diff] [blame] | 202 | /* |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 203 | * Walk a vmap address to the struct page it maps. |
Christoph Lameter | 48667e7 | 2008-02-04 22:28:31 -0800 | [diff] [blame] | 204 | */ |
Christoph Lameter | b3bdda0 | 2008-02-04 22:28:32 -0800 | [diff] [blame] | 205 | struct page *vmalloc_to_page(const void *vmalloc_addr) |
Christoph Lameter | 48667e7 | 2008-02-04 22:28:31 -0800 | [diff] [blame] | 206 | { |
| 207 | unsigned long addr = (unsigned long) vmalloc_addr; |
| 208 | struct page *page = NULL; |
| 209 | pgd_t *pgd = pgd_offset_k(addr); |
Christoph Lameter | 48667e7 | 2008-02-04 22:28:31 -0800 | [diff] [blame] | 210 | |
Ingo Molnar | 7aa413d | 2008-06-19 13:28:11 +0200 | [diff] [blame] | 211 | /* |
| 212 | * XXX we might need to change this if we add VIRTUAL_BUG_ON for |
| 213 | * architectures that do not vmalloc module space |
| 214 | */ |
Linus Torvalds | 73bdf0a | 2008-10-15 08:35:12 -0700 | [diff] [blame] | 215 | VIRTUAL_BUG_ON(!is_vmalloc_or_module_addr(vmalloc_addr)); |
Jiri Slaby | 59ea746 | 2008-06-12 13:56:40 +0200 | [diff] [blame] | 216 | |
Christoph Lameter | 48667e7 | 2008-02-04 22:28:31 -0800 | [diff] [blame] | 217 | if (!pgd_none(*pgd)) { |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 218 | pud_t *pud = pud_offset(pgd, addr); |
Christoph Lameter | 48667e7 | 2008-02-04 22:28:31 -0800 | [diff] [blame] | 219 | if (!pud_none(*pud)) { |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 220 | pmd_t *pmd = pmd_offset(pud, addr); |
Christoph Lameter | 48667e7 | 2008-02-04 22:28:31 -0800 | [diff] [blame] | 221 | if (!pmd_none(*pmd)) { |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 222 | pte_t *ptep, pte; |
| 223 | |
Christoph Lameter | 48667e7 | 2008-02-04 22:28:31 -0800 | [diff] [blame] | 224 | ptep = pte_offset_map(pmd, addr); |
| 225 | pte = *ptep; |
| 226 | if (pte_present(pte)) |
| 227 | page = pte_page(pte); |
| 228 | pte_unmap(ptep); |
| 229 | } |
| 230 | } |
| 231 | } |
| 232 | return page; |
| 233 | } |
| 234 | EXPORT_SYMBOL(vmalloc_to_page); |
| 235 | |
| 236 | /* |
| 237 | * Map a vmalloc()-space virtual address to the physical page frame number. |
| 238 | */ |
Christoph Lameter | b3bdda0 | 2008-02-04 22:28:32 -0800 | [diff] [blame] | 239 | unsigned long vmalloc_to_pfn(const void *vmalloc_addr) |
Christoph Lameter | 48667e7 | 2008-02-04 22:28:31 -0800 | [diff] [blame] | 240 | { |
| 241 | return page_to_pfn(vmalloc_to_page(vmalloc_addr)); |
| 242 | } |
| 243 | EXPORT_SYMBOL(vmalloc_to_pfn); |
| 244 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 245 | |
| 246 | /*** Global kva allocator ***/ |
| 247 | |
| 248 | #define VM_LAZY_FREE 0x01 |
| 249 | #define VM_LAZY_FREEING 0x02 |
| 250 | #define VM_VM_AREA 0x04 |
| 251 | |
| 252 | struct vmap_area { |
| 253 | unsigned long va_start; |
| 254 | unsigned long va_end; |
| 255 | unsigned long flags; |
| 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 */ |
| 259 | void *private; |
| 260 | struct rcu_head rcu_head; |
| 261 | }; |
| 262 | |
| 263 | static DEFINE_SPINLOCK(vmap_area_lock); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 264 | static LIST_HEAD(vmap_area_list); |
Nick Piggin | 8969960 | 2011-03-22 16:30:36 -0700 | [diff] [blame] | 265 | static struct rb_root vmap_area_root = RB_ROOT; |
| 266 | |
| 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; |
| 272 | |
Tejun Heo | ca23e40 | 2009-08-14 15:00:52 +0900 | [diff] [blame] | 273 | static unsigned long vmap_area_pcpu_hole; |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 274 | |
| 275 | static struct vmap_area *__find_vmap_area(unsigned long addr) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 276 | { |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 277 | struct rb_node *n = vmap_area_root.rb_node; |
| 278 | |
| 279 | while (n) { |
| 280 | struct vmap_area *va; |
| 281 | |
| 282 | va = rb_entry(n, struct vmap_area, rb_node); |
| 283 | if (addr < va->va_start) |
| 284 | n = n->rb_left; |
| 285 | else if (addr > va->va_start) |
| 286 | n = n->rb_right; |
| 287 | else |
| 288 | return va; |
| 289 | } |
| 290 | |
| 291 | return NULL; |
| 292 | } |
| 293 | |
| 294 | static void __insert_vmap_area(struct vmap_area *va) |
| 295 | { |
| 296 | struct rb_node **p = &vmap_area_root.rb_node; |
| 297 | struct rb_node *parent = NULL; |
| 298 | struct rb_node *tmp; |
| 299 | |
| 300 | while (*p) { |
Namhyung Kim | 170168d | 2010-10-26 14:22:02 -0700 | [diff] [blame] | 301 | struct vmap_area *tmp_va; |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 302 | |
| 303 | parent = *p; |
Namhyung Kim | 170168d | 2010-10-26 14:22:02 -0700 | [diff] [blame] | 304 | tmp_va = rb_entry(parent, struct vmap_area, rb_node); |
| 305 | if (va->va_start < tmp_va->va_end) |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 306 | p = &(*p)->rb_left; |
Namhyung Kim | 170168d | 2010-10-26 14:22:02 -0700 | [diff] [blame] | 307 | else if (va->va_end > tmp_va->va_start) |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 308 | p = &(*p)->rb_right; |
| 309 | else |
| 310 | BUG(); |
| 311 | } |
| 312 | |
| 313 | rb_link_node(&va->rb_node, parent, p); |
| 314 | rb_insert_color(&va->rb_node, &vmap_area_root); |
| 315 | |
| 316 | /* address-sort this list so it is usable like the vmlist */ |
| 317 | tmp = rb_prev(&va->rb_node); |
| 318 | if (tmp) { |
| 319 | struct vmap_area *prev; |
| 320 | prev = rb_entry(tmp, struct vmap_area, rb_node); |
| 321 | list_add_rcu(&va->list, &prev->list); |
| 322 | } else |
| 323 | list_add_rcu(&va->list, &vmap_area_list); |
| 324 | } |
| 325 | |
| 326 | static void purge_vmap_area_lazy(void); |
| 327 | |
| 328 | /* |
| 329 | * Allocate a region of KVA of the specified size and alignment, within the |
| 330 | * vstart and vend. |
| 331 | */ |
| 332 | static struct vmap_area *alloc_vmap_area(unsigned long size, |
| 333 | unsigned long align, |
| 334 | unsigned long vstart, unsigned long vend, |
| 335 | int node, gfp_t gfp_mask) |
| 336 | { |
| 337 | struct vmap_area *va; |
| 338 | struct rb_node *n; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 339 | unsigned long addr; |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 340 | int purged = 0; |
Nick Piggin | 8969960 | 2011-03-22 16:30:36 -0700 | [diff] [blame] | 341 | struct vmap_area *first; |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 342 | |
Nick Piggin | 7766970 | 2009-02-27 14:03:03 -0800 | [diff] [blame] | 343 | BUG_ON(!size); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 344 | BUG_ON(size & ~PAGE_MASK); |
Nick Piggin | 8969960 | 2011-03-22 16:30:36 -0700 | [diff] [blame] | 345 | BUG_ON(!is_power_of_2(align)); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 346 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 347 | va = kmalloc_node(sizeof(struct vmap_area), |
| 348 | gfp_mask & GFP_RECLAIM_MASK, node); |
| 349 | if (unlikely(!va)) |
| 350 | return ERR_PTR(-ENOMEM); |
| 351 | |
| 352 | retry: |
| 353 | spin_lock(&vmap_area_lock); |
Nick Piggin | 8969960 | 2011-03-22 16:30:36 -0700 | [diff] [blame] | 354 | /* |
| 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. |
| 362 | */ |
| 363 | if (!free_vmap_cache || |
| 364 | size < cached_hole_size || |
| 365 | vstart < cached_vstart || |
| 366 | align < cached_align) { |
| 367 | nocache: |
| 368 | cached_hole_size = 0; |
| 369 | free_vmap_cache = NULL; |
| 370 | } |
| 371 | /* record if we encounter less permissive parameters */ |
| 372 | cached_vstart = vstart; |
| 373 | cached_align = align; |
Nick Piggin | 7766970 | 2009-02-27 14:03:03 -0800 | [diff] [blame] | 374 | |
Nick Piggin | 8969960 | 2011-03-22 16:30:36 -0700 | [diff] [blame] | 375 | /* find starting point for our search */ |
| 376 | if (free_vmap_cache) { |
| 377 | first = rb_entry(free_vmap_cache, struct vmap_area, rb_node); |
Johannes Weiner | 248ac0e | 2011-05-24 17:11:43 -0700 | [diff] [blame] | 378 | addr = ALIGN(first->va_end, align); |
Nick Piggin | 8969960 | 2011-03-22 16:30:36 -0700 | [diff] [blame] | 379 | if (addr < vstart) |
| 380 | goto nocache; |
| 381 | if (addr + size - 1 < addr) |
| 382 | goto overflow; |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 383 | |
Nick Piggin | 8969960 | 2011-03-22 16:30:36 -0700 | [diff] [blame] | 384 | } else { |
| 385 | addr = ALIGN(vstart, align); |
| 386 | if (addr + size - 1 < addr) |
| 387 | goto overflow; |
| 388 | |
| 389 | n = vmap_area_root.rb_node; |
| 390 | first = NULL; |
| 391 | |
| 392 | while (n) { |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 393 | struct vmap_area *tmp; |
| 394 | tmp = rb_entry(n, struct vmap_area, rb_node); |
| 395 | if (tmp->va_end >= addr) { |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 396 | first = tmp; |
Nick Piggin | 8969960 | 2011-03-22 16:30:36 -0700 | [diff] [blame] | 397 | if (tmp->va_start <= addr) |
| 398 | break; |
| 399 | n = n->rb_left; |
| 400 | } else |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 401 | n = n->rb_right; |
Nick Piggin | 8969960 | 2011-03-22 16:30:36 -0700 | [diff] [blame] | 402 | } |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 403 | |
| 404 | if (!first) |
| 405 | goto found; |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 406 | } |
Nick Piggin | 8969960 | 2011-03-22 16:30:36 -0700 | [diff] [blame] | 407 | |
| 408 | /* from the starting point, walk areas until a suitable hole is found */ |
Johannes Weiner | 248ac0e | 2011-05-24 17:11:43 -0700 | [diff] [blame] | 409 | while (addr + size > first->va_start && addr + size <= vend) { |
Nick Piggin | 8969960 | 2011-03-22 16:30:36 -0700 | [diff] [blame] | 410 | if (addr + cached_hole_size < first->va_start) |
| 411 | cached_hole_size = first->va_start - addr; |
Johannes Weiner | 248ac0e | 2011-05-24 17:11:43 -0700 | [diff] [blame] | 412 | addr = ALIGN(first->va_end, align); |
Nick Piggin | 8969960 | 2011-03-22 16:30:36 -0700 | [diff] [blame] | 413 | if (addr + size - 1 < addr) |
| 414 | goto overflow; |
| 415 | |
| 416 | n = rb_next(&first->rb_node); |
| 417 | if (n) |
| 418 | first = rb_entry(n, struct vmap_area, rb_node); |
| 419 | else |
| 420 | goto found; |
| 421 | } |
| 422 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 423 | found: |
Nick Piggin | 8969960 | 2011-03-22 16:30:36 -0700 | [diff] [blame] | 424 | if (addr + size > vend) |
| 425 | goto overflow; |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 426 | |
| 427 | va->va_start = addr; |
| 428 | va->va_end = addr + size; |
| 429 | va->flags = 0; |
| 430 | __insert_vmap_area(va); |
Nick Piggin | 8969960 | 2011-03-22 16:30:36 -0700 | [diff] [blame] | 431 | free_vmap_cache = &va->rb_node; |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 432 | spin_unlock(&vmap_area_lock); |
| 433 | |
Nick Piggin | 8969960 | 2011-03-22 16:30:36 -0700 | [diff] [blame] | 434 | BUG_ON(va->va_start & (align-1)); |
| 435 | BUG_ON(va->va_start < vstart); |
| 436 | BUG_ON(va->va_end > vend); |
| 437 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 438 | return va; |
Nick Piggin | 8969960 | 2011-03-22 16:30:36 -0700 | [diff] [blame] | 439 | |
| 440 | overflow: |
| 441 | spin_unlock(&vmap_area_lock); |
| 442 | if (!purged) { |
| 443 | purge_vmap_area_lazy(); |
| 444 | purged = 1; |
| 445 | goto retry; |
| 446 | } |
| 447 | if (printk_ratelimit()) |
| 448 | printk(KERN_WARNING |
| 449 | "vmap allocation for size %lu failed: " |
| 450 | "use vmalloc=<size> to increase size.\n", size); |
| 451 | kfree(va); |
| 452 | return ERR_PTR(-EBUSY); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 453 | } |
| 454 | |
| 455 | static void rcu_free_va(struct rcu_head *head) |
| 456 | { |
| 457 | struct vmap_area *va = container_of(head, struct vmap_area, rcu_head); |
| 458 | |
| 459 | kfree(va); |
| 460 | } |
| 461 | |
| 462 | static void __free_vmap_area(struct vmap_area *va) |
| 463 | { |
| 464 | BUG_ON(RB_EMPTY_NODE(&va->rb_node)); |
Nick Piggin | 8969960 | 2011-03-22 16:30:36 -0700 | [diff] [blame] | 465 | |
| 466 | if (free_vmap_cache) { |
| 467 | if (va->va_end < cached_vstart) { |
| 468 | free_vmap_cache = NULL; |
| 469 | } else { |
| 470 | struct vmap_area *cache; |
| 471 | cache = rb_entry(free_vmap_cache, struct vmap_area, rb_node); |
| 472 | if (va->va_start <= cache->va_start) { |
| 473 | free_vmap_cache = rb_prev(&va->rb_node); |
| 474 | /* |
| 475 | * We don't try to update cached_hole_size or |
| 476 | * cached_align, but it won't go very wrong. |
| 477 | */ |
| 478 | } |
| 479 | } |
| 480 | } |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 481 | rb_erase(&va->rb_node, &vmap_area_root); |
| 482 | RB_CLEAR_NODE(&va->rb_node); |
| 483 | list_del_rcu(&va->list); |
| 484 | |
Tejun Heo | ca23e40 | 2009-08-14 15:00:52 +0900 | [diff] [blame] | 485 | /* |
| 486 | * Track the highest possible candidate for pcpu area |
| 487 | * allocation. Areas outside of vmalloc area can be returned |
| 488 | * here too, consider only end addresses which fall inside |
| 489 | * vmalloc area proper. |
| 490 | */ |
| 491 | if (va->va_end > VMALLOC_START && va->va_end <= VMALLOC_END) |
| 492 | vmap_area_pcpu_hole = max(vmap_area_pcpu_hole, va->va_end); |
| 493 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 494 | call_rcu(&va->rcu_head, rcu_free_va); |
| 495 | } |
| 496 | |
| 497 | /* |
| 498 | * Free a region of KVA allocated by alloc_vmap_area |
| 499 | */ |
| 500 | static void free_vmap_area(struct vmap_area *va) |
| 501 | { |
| 502 | spin_lock(&vmap_area_lock); |
| 503 | __free_vmap_area(va); |
| 504 | spin_unlock(&vmap_area_lock); |
| 505 | } |
| 506 | |
| 507 | /* |
| 508 | * Clear the pagetable entries of a given vmap_area |
| 509 | */ |
| 510 | static void unmap_vmap_area(struct vmap_area *va) |
| 511 | { |
| 512 | vunmap_page_range(va->va_start, va->va_end); |
| 513 | } |
| 514 | |
Nick Piggin | cd52858 | 2009-01-06 14:39:20 -0800 | [diff] [blame] | 515 | static void vmap_debug_free_range(unsigned long start, unsigned long end) |
| 516 | { |
| 517 | /* |
| 518 | * Unmap page tables and force a TLB flush immediately if |
| 519 | * CONFIG_DEBUG_PAGEALLOC is set. This catches use after free |
| 520 | * bugs similarly to those in linear kernel virtual address |
| 521 | * space after a page has been freed. |
| 522 | * |
| 523 | * All the lazy freeing logic is still retained, in order to |
| 524 | * minimise intrusiveness of this debugging feature. |
| 525 | * |
| 526 | * This is going to be *slow* (linear kernel virtual address |
| 527 | * debugging doesn't do a broadcast TLB flush so it is a lot |
| 528 | * faster). |
| 529 | */ |
| 530 | #ifdef CONFIG_DEBUG_PAGEALLOC |
| 531 | vunmap_page_range(start, end); |
| 532 | flush_tlb_kernel_range(start, end); |
| 533 | #endif |
| 534 | } |
| 535 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 536 | /* |
| 537 | * lazy_max_pages is the maximum amount of virtual address space we gather up |
| 538 | * before attempting to purge with a TLB flush. |
| 539 | * |
| 540 | * There is a tradeoff here: a larger number will cover more kernel page tables |
| 541 | * and take slightly longer to purge, but it will linearly reduce the number of |
| 542 | * global TLB flushes that must be performed. It would seem natural to scale |
| 543 | * this number up linearly with the number of CPUs (because vmapping activity |
| 544 | * could also scale linearly with the number of CPUs), however it is likely |
| 545 | * that in practice, workloads might be constrained in other ways that mean |
| 546 | * vmap activity will not scale linearly with CPUs. Also, I want to be |
| 547 | * conservative and not introduce a big latency on huge systems, so go with |
| 548 | * a less aggressive log scale. It will still be an improvement over the old |
| 549 | * code, and it will be simple to change the scale factor if we find that it |
| 550 | * becomes a problem on bigger systems. |
| 551 | */ |
| 552 | static unsigned long lazy_max_pages(void) |
| 553 | { |
| 554 | unsigned int log; |
| 555 | |
| 556 | log = fls(num_online_cpus()); |
| 557 | |
| 558 | return log * (32UL * 1024 * 1024 / PAGE_SIZE); |
| 559 | } |
| 560 | |
| 561 | static atomic_t vmap_lazy_nr = ATOMIC_INIT(0); |
| 562 | |
Nick Piggin | 02b709d | 2010-02-01 22:25:57 +1100 | [diff] [blame] | 563 | /* for per-CPU blocks */ |
| 564 | static void purge_fragmented_blocks_allcpus(void); |
| 565 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 566 | /* |
Cliff Wickman | 3ee48b6 | 2010-09-16 11:44:02 -0500 | [diff] [blame] | 567 | * called before a call to iounmap() if the caller wants vm_area_struct's |
| 568 | * immediately freed. |
| 569 | */ |
| 570 | void set_iounmap_nonlazy(void) |
| 571 | { |
| 572 | atomic_set(&vmap_lazy_nr, lazy_max_pages()+1); |
| 573 | } |
| 574 | |
| 575 | /* |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 576 | * Purges all lazily-freed vmap areas. |
| 577 | * |
| 578 | * If sync is 0 then don't purge if there is already a purge in progress. |
| 579 | * If force_flush is 1, then flush kernel TLBs between *start and *end even |
| 580 | * if we found no lazy vmap areas to unmap (callers can use this to optimise |
| 581 | * their own TLB flushing). |
| 582 | * Returns with *start = min(*start, lowest purged address) |
| 583 | * *end = max(*end, highest purged address) |
| 584 | */ |
| 585 | static void __purge_vmap_area_lazy(unsigned long *start, unsigned long *end, |
| 586 | int sync, int force_flush) |
| 587 | { |
Andrew Morton | 46666d8 | 2009-01-15 13:51:15 -0800 | [diff] [blame] | 588 | static DEFINE_SPINLOCK(purge_lock); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 589 | LIST_HEAD(valist); |
| 590 | struct vmap_area *va; |
Vegard Nossum | cbb7667 | 2009-02-27 14:03:04 -0800 | [diff] [blame] | 591 | struct vmap_area *n_va; |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 592 | int nr = 0; |
| 593 | |
| 594 | /* |
| 595 | * If sync is 0 but force_flush is 1, we'll go sync anyway but callers |
| 596 | * should not expect such behaviour. This just simplifies locking for |
| 597 | * the case that isn't actually used at the moment anyway. |
| 598 | */ |
| 599 | if (!sync && !force_flush) { |
Andrew Morton | 46666d8 | 2009-01-15 13:51:15 -0800 | [diff] [blame] | 600 | if (!spin_trylock(&purge_lock)) |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 601 | return; |
| 602 | } else |
Andrew Morton | 46666d8 | 2009-01-15 13:51:15 -0800 | [diff] [blame] | 603 | spin_lock(&purge_lock); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 604 | |
Nick Piggin | 02b709d | 2010-02-01 22:25:57 +1100 | [diff] [blame] | 605 | if (sync) |
| 606 | purge_fragmented_blocks_allcpus(); |
| 607 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 608 | rcu_read_lock(); |
| 609 | list_for_each_entry_rcu(va, &vmap_area_list, list) { |
| 610 | if (va->flags & VM_LAZY_FREE) { |
| 611 | if (va->va_start < *start) |
| 612 | *start = va->va_start; |
| 613 | if (va->va_end > *end) |
| 614 | *end = va->va_end; |
| 615 | nr += (va->va_end - va->va_start) >> PAGE_SHIFT; |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 616 | list_add_tail(&va->purge_list, &valist); |
| 617 | va->flags |= VM_LAZY_FREEING; |
| 618 | va->flags &= ~VM_LAZY_FREE; |
| 619 | } |
| 620 | } |
| 621 | rcu_read_unlock(); |
| 622 | |
Yongseok Koh | 88f5004 | 2010-01-19 17:33:49 +0900 | [diff] [blame] | 623 | if (nr) |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 624 | atomic_sub(nr, &vmap_lazy_nr); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 625 | |
| 626 | if (nr || force_flush) |
| 627 | flush_tlb_kernel_range(*start, *end); |
| 628 | |
| 629 | if (nr) { |
| 630 | spin_lock(&vmap_area_lock); |
Vegard Nossum | cbb7667 | 2009-02-27 14:03:04 -0800 | [diff] [blame] | 631 | list_for_each_entry_safe(va, n_va, &valist, purge_list) |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 632 | __free_vmap_area(va); |
| 633 | spin_unlock(&vmap_area_lock); |
| 634 | } |
Andrew Morton | 46666d8 | 2009-01-15 13:51:15 -0800 | [diff] [blame] | 635 | spin_unlock(&purge_lock); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 636 | } |
| 637 | |
| 638 | /* |
Nick Piggin | 496850e | 2008-11-19 15:36:33 -0800 | [diff] [blame] | 639 | * Kick off a purge of the outstanding lazy areas. Don't bother if somebody |
| 640 | * is already purging. |
| 641 | */ |
| 642 | static void try_purge_vmap_area_lazy(void) |
| 643 | { |
| 644 | unsigned long start = ULONG_MAX, end = 0; |
| 645 | |
| 646 | __purge_vmap_area_lazy(&start, &end, 0, 0); |
| 647 | } |
| 648 | |
| 649 | /* |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 650 | * Kick off a purge of the outstanding lazy areas. |
| 651 | */ |
| 652 | static void purge_vmap_area_lazy(void) |
| 653 | { |
| 654 | unsigned long start = ULONG_MAX, end = 0; |
| 655 | |
Nick Piggin | 496850e | 2008-11-19 15:36:33 -0800 | [diff] [blame] | 656 | __purge_vmap_area_lazy(&start, &end, 1, 0); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 657 | } |
| 658 | |
| 659 | /* |
Jeremy Fitzhardinge | 64141da | 2010-12-02 14:31:18 -0800 | [diff] [blame] | 660 | * Free a vmap area, caller ensuring that the area has been unmapped |
| 661 | * and flush_cache_vunmap had been called for the correct range |
| 662 | * previously. |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 663 | */ |
Jeremy Fitzhardinge | 64141da | 2010-12-02 14:31:18 -0800 | [diff] [blame] | 664 | static void free_vmap_area_noflush(struct vmap_area *va) |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 665 | { |
| 666 | va->flags |= VM_LAZY_FREE; |
| 667 | atomic_add((va->va_end - va->va_start) >> PAGE_SHIFT, &vmap_lazy_nr); |
| 668 | if (unlikely(atomic_read(&vmap_lazy_nr) > lazy_max_pages())) |
Nick Piggin | 496850e | 2008-11-19 15:36:33 -0800 | [diff] [blame] | 669 | try_purge_vmap_area_lazy(); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 670 | } |
| 671 | |
Nick Piggin | b29acbd | 2008-12-01 13:13:47 -0800 | [diff] [blame] | 672 | /* |
Jeremy Fitzhardinge | 64141da | 2010-12-02 14:31:18 -0800 | [diff] [blame] | 673 | * Free and unmap a vmap area, caller ensuring flush_cache_vunmap had been |
| 674 | * called for the correct range previously. |
| 675 | */ |
| 676 | static void free_unmap_vmap_area_noflush(struct vmap_area *va) |
| 677 | { |
| 678 | unmap_vmap_area(va); |
| 679 | free_vmap_area_noflush(va); |
| 680 | } |
| 681 | |
| 682 | /* |
Nick Piggin | b29acbd | 2008-12-01 13:13:47 -0800 | [diff] [blame] | 683 | * Free and unmap a vmap area |
| 684 | */ |
| 685 | static void free_unmap_vmap_area(struct vmap_area *va) |
| 686 | { |
| 687 | flush_cache_vunmap(va->va_start, va->va_end); |
| 688 | free_unmap_vmap_area_noflush(va); |
| 689 | } |
| 690 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 691 | static struct vmap_area *find_vmap_area(unsigned long addr) |
| 692 | { |
| 693 | struct vmap_area *va; |
| 694 | |
| 695 | spin_lock(&vmap_area_lock); |
| 696 | va = __find_vmap_area(addr); |
| 697 | spin_unlock(&vmap_area_lock); |
| 698 | |
| 699 | return va; |
| 700 | } |
| 701 | |
| 702 | static void free_unmap_vmap_area_addr(unsigned long addr) |
| 703 | { |
| 704 | struct vmap_area *va; |
| 705 | |
| 706 | va = find_vmap_area(addr); |
| 707 | BUG_ON(!va); |
| 708 | free_unmap_vmap_area(va); |
| 709 | } |
| 710 | |
| 711 | |
| 712 | /*** Per cpu kva allocator ***/ |
| 713 | |
| 714 | /* |
| 715 | * vmap space is limited especially on 32 bit architectures. Ensure there is |
| 716 | * room for at least 16 percpu vmap blocks per CPU. |
| 717 | */ |
| 718 | /* |
| 719 | * If we had a constant VMALLOC_START and VMALLOC_END, we'd like to be able |
| 720 | * to #define VMALLOC_SPACE (VMALLOC_END-VMALLOC_START). Guess |
| 721 | * instead (we just need a rough idea) |
| 722 | */ |
| 723 | #if BITS_PER_LONG == 32 |
| 724 | #define VMALLOC_SPACE (128UL*1024*1024) |
| 725 | #else |
| 726 | #define VMALLOC_SPACE (128UL*1024*1024*1024) |
| 727 | #endif |
| 728 | |
| 729 | #define VMALLOC_PAGES (VMALLOC_SPACE / PAGE_SIZE) |
| 730 | #define VMAP_MAX_ALLOC BITS_PER_LONG /* 256K with 4K pages */ |
| 731 | #define VMAP_BBMAP_BITS_MAX 1024 /* 4MB with 4K pages */ |
| 732 | #define VMAP_BBMAP_BITS_MIN (VMAP_MAX_ALLOC*2) |
| 733 | #define VMAP_MIN(x, y) ((x) < (y) ? (x) : (y)) /* can't use min() */ |
| 734 | #define VMAP_MAX(x, y) ((x) > (y) ? (x) : (y)) /* can't use max() */ |
| 735 | #define VMAP_BBMAP_BITS VMAP_MIN(VMAP_BBMAP_BITS_MAX, \ |
| 736 | VMAP_MAX(VMAP_BBMAP_BITS_MIN, \ |
| 737 | VMALLOC_PAGES / NR_CPUS / 16)) |
| 738 | |
| 739 | #define VMAP_BLOCK_SIZE (VMAP_BBMAP_BITS * PAGE_SIZE) |
| 740 | |
Jeremy Fitzhardinge | 9b46333 | 2008-10-28 19:22:34 +1100 | [diff] [blame] | 741 | static bool vmap_initialized __read_mostly = false; |
| 742 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 743 | struct vmap_block_queue { |
| 744 | spinlock_t lock; |
| 745 | struct list_head free; |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 746 | }; |
| 747 | |
| 748 | struct vmap_block { |
| 749 | spinlock_t lock; |
| 750 | struct vmap_area *va; |
| 751 | struct vmap_block_queue *vbq; |
| 752 | unsigned long free, dirty; |
| 753 | DECLARE_BITMAP(alloc_map, VMAP_BBMAP_BITS); |
| 754 | DECLARE_BITMAP(dirty_map, VMAP_BBMAP_BITS); |
Nick Piggin | de56042 | 2010-02-01 22:24:18 +1100 | [diff] [blame] | 755 | struct list_head free_list; |
| 756 | struct rcu_head rcu_head; |
Nick Piggin | 02b709d | 2010-02-01 22:25:57 +1100 | [diff] [blame] | 757 | struct list_head purge; |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 758 | }; |
| 759 | |
| 760 | /* Queue of free and dirty vmap blocks, for allocation and flushing purposes */ |
| 761 | static DEFINE_PER_CPU(struct vmap_block_queue, vmap_block_queue); |
| 762 | |
| 763 | /* |
| 764 | * Radix tree of vmap blocks, indexed by address, to quickly find a vmap block |
| 765 | * in the free path. Could get rid of this if we change the API to return a |
| 766 | * "cookie" from alloc, to be passed to free. But no big deal yet. |
| 767 | */ |
| 768 | static DEFINE_SPINLOCK(vmap_block_tree_lock); |
| 769 | static RADIX_TREE(vmap_block_tree, GFP_ATOMIC); |
| 770 | |
| 771 | /* |
| 772 | * We should probably have a fallback mechanism to allocate virtual memory |
| 773 | * out of partially filled vmap blocks. However vmap block sizing should be |
| 774 | * fairly reasonable according to the vmalloc size, so it shouldn't be a |
| 775 | * big problem. |
| 776 | */ |
| 777 | |
| 778 | static unsigned long addr_to_vb_idx(unsigned long addr) |
| 779 | { |
| 780 | addr -= VMALLOC_START & ~(VMAP_BLOCK_SIZE-1); |
| 781 | addr /= VMAP_BLOCK_SIZE; |
| 782 | return addr; |
| 783 | } |
| 784 | |
| 785 | static struct vmap_block *new_vmap_block(gfp_t gfp_mask) |
| 786 | { |
| 787 | struct vmap_block_queue *vbq; |
| 788 | struct vmap_block *vb; |
| 789 | struct vmap_area *va; |
| 790 | unsigned long vb_idx; |
| 791 | int node, err; |
| 792 | |
| 793 | node = numa_node_id(); |
| 794 | |
| 795 | vb = kmalloc_node(sizeof(struct vmap_block), |
| 796 | gfp_mask & GFP_RECLAIM_MASK, node); |
| 797 | if (unlikely(!vb)) |
| 798 | return ERR_PTR(-ENOMEM); |
| 799 | |
| 800 | va = alloc_vmap_area(VMAP_BLOCK_SIZE, VMAP_BLOCK_SIZE, |
| 801 | VMALLOC_START, VMALLOC_END, |
| 802 | node, gfp_mask); |
Tobias Klauser | ddf9c6d | 2011-01-13 15:46:15 -0800 | [diff] [blame] | 803 | if (IS_ERR(va)) { |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 804 | kfree(vb); |
Julia Lawall | e7d8634 | 2010-08-09 17:18:28 -0700 | [diff] [blame] | 805 | return ERR_CAST(va); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 806 | } |
| 807 | |
| 808 | err = radix_tree_preload(gfp_mask); |
| 809 | if (unlikely(err)) { |
| 810 | kfree(vb); |
| 811 | free_vmap_area(va); |
| 812 | return ERR_PTR(err); |
| 813 | } |
| 814 | |
| 815 | spin_lock_init(&vb->lock); |
| 816 | vb->va = va; |
| 817 | vb->free = VMAP_BBMAP_BITS; |
| 818 | vb->dirty = 0; |
| 819 | bitmap_zero(vb->alloc_map, VMAP_BBMAP_BITS); |
| 820 | bitmap_zero(vb->dirty_map, VMAP_BBMAP_BITS); |
| 821 | INIT_LIST_HEAD(&vb->free_list); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 822 | |
| 823 | vb_idx = addr_to_vb_idx(va->va_start); |
| 824 | spin_lock(&vmap_block_tree_lock); |
| 825 | err = radix_tree_insert(&vmap_block_tree, vb_idx, vb); |
| 826 | spin_unlock(&vmap_block_tree_lock); |
| 827 | BUG_ON(err); |
| 828 | radix_tree_preload_end(); |
| 829 | |
| 830 | vbq = &get_cpu_var(vmap_block_queue); |
| 831 | vb->vbq = vbq; |
| 832 | spin_lock(&vbq->lock); |
Nick Piggin | de56042 | 2010-02-01 22:24:18 +1100 | [diff] [blame] | 833 | list_add_rcu(&vb->free_list, &vbq->free); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 834 | spin_unlock(&vbq->lock); |
Tejun Heo | 3f04ba8 | 2009-10-29 22:34:12 +0900 | [diff] [blame] | 835 | put_cpu_var(vmap_block_queue); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 836 | |
| 837 | return vb; |
| 838 | } |
| 839 | |
| 840 | static void rcu_free_vb(struct rcu_head *head) |
| 841 | { |
| 842 | struct vmap_block *vb = container_of(head, struct vmap_block, rcu_head); |
| 843 | |
| 844 | kfree(vb); |
| 845 | } |
| 846 | |
| 847 | static void free_vmap_block(struct vmap_block *vb) |
| 848 | { |
| 849 | struct vmap_block *tmp; |
| 850 | unsigned long vb_idx; |
| 851 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 852 | vb_idx = addr_to_vb_idx(vb->va->va_start); |
| 853 | spin_lock(&vmap_block_tree_lock); |
| 854 | tmp = radix_tree_delete(&vmap_block_tree, vb_idx); |
| 855 | spin_unlock(&vmap_block_tree_lock); |
| 856 | BUG_ON(tmp != vb); |
| 857 | |
Jeremy Fitzhardinge | 64141da | 2010-12-02 14:31:18 -0800 | [diff] [blame] | 858 | free_vmap_area_noflush(vb->va); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 859 | call_rcu(&vb->rcu_head, rcu_free_vb); |
| 860 | } |
| 861 | |
Nick Piggin | 02b709d | 2010-02-01 22:25:57 +1100 | [diff] [blame] | 862 | static void purge_fragmented_blocks(int cpu) |
| 863 | { |
| 864 | LIST_HEAD(purge); |
| 865 | struct vmap_block *vb; |
| 866 | struct vmap_block *n_vb; |
| 867 | struct vmap_block_queue *vbq = &per_cpu(vmap_block_queue, cpu); |
| 868 | |
| 869 | rcu_read_lock(); |
| 870 | list_for_each_entry_rcu(vb, &vbq->free, free_list) { |
| 871 | |
| 872 | if (!(vb->free + vb->dirty == VMAP_BBMAP_BITS && vb->dirty != VMAP_BBMAP_BITS)) |
| 873 | continue; |
| 874 | |
| 875 | spin_lock(&vb->lock); |
| 876 | if (vb->free + vb->dirty == VMAP_BBMAP_BITS && vb->dirty != VMAP_BBMAP_BITS) { |
| 877 | vb->free = 0; /* prevent further allocs after releasing lock */ |
| 878 | vb->dirty = VMAP_BBMAP_BITS; /* prevent purging it again */ |
| 879 | bitmap_fill(vb->alloc_map, VMAP_BBMAP_BITS); |
| 880 | bitmap_fill(vb->dirty_map, VMAP_BBMAP_BITS); |
| 881 | spin_lock(&vbq->lock); |
| 882 | list_del_rcu(&vb->free_list); |
| 883 | spin_unlock(&vbq->lock); |
| 884 | spin_unlock(&vb->lock); |
| 885 | list_add_tail(&vb->purge, &purge); |
| 886 | } else |
| 887 | spin_unlock(&vb->lock); |
| 888 | } |
| 889 | rcu_read_unlock(); |
| 890 | |
| 891 | list_for_each_entry_safe(vb, n_vb, &purge, purge) { |
| 892 | list_del(&vb->purge); |
| 893 | free_vmap_block(vb); |
| 894 | } |
| 895 | } |
| 896 | |
| 897 | static void purge_fragmented_blocks_thiscpu(void) |
| 898 | { |
| 899 | purge_fragmented_blocks(smp_processor_id()); |
| 900 | } |
| 901 | |
| 902 | static void purge_fragmented_blocks_allcpus(void) |
| 903 | { |
| 904 | int cpu; |
| 905 | |
| 906 | for_each_possible_cpu(cpu) |
| 907 | purge_fragmented_blocks(cpu); |
| 908 | } |
| 909 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 910 | static void *vb_alloc(unsigned long size, gfp_t gfp_mask) |
| 911 | { |
| 912 | struct vmap_block_queue *vbq; |
| 913 | struct vmap_block *vb; |
| 914 | unsigned long addr = 0; |
| 915 | unsigned int order; |
Nick Piggin | 02b709d | 2010-02-01 22:25:57 +1100 | [diff] [blame] | 916 | int purge = 0; |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 917 | |
| 918 | BUG_ON(size & ~PAGE_MASK); |
| 919 | BUG_ON(size > PAGE_SIZE*VMAP_MAX_ALLOC); |
| 920 | order = get_order(size); |
| 921 | |
| 922 | again: |
| 923 | rcu_read_lock(); |
| 924 | vbq = &get_cpu_var(vmap_block_queue); |
| 925 | list_for_each_entry_rcu(vb, &vbq->free, free_list) { |
| 926 | int i; |
| 927 | |
| 928 | spin_lock(&vb->lock); |
Nick Piggin | 02b709d | 2010-02-01 22:25:57 +1100 | [diff] [blame] | 929 | if (vb->free < 1UL << order) |
| 930 | goto next; |
| 931 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 932 | i = bitmap_find_free_region(vb->alloc_map, |
| 933 | VMAP_BBMAP_BITS, order); |
| 934 | |
Nick Piggin | 02b709d | 2010-02-01 22:25:57 +1100 | [diff] [blame] | 935 | if (i < 0) { |
| 936 | if (vb->free + vb->dirty == VMAP_BBMAP_BITS) { |
| 937 | /* fragmented and no outstanding allocations */ |
| 938 | BUG_ON(vb->dirty != VMAP_BBMAP_BITS); |
| 939 | purge = 1; |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 940 | } |
Nick Piggin | 02b709d | 2010-02-01 22:25:57 +1100 | [diff] [blame] | 941 | goto next; |
| 942 | } |
| 943 | addr = vb->va->va_start + (i << PAGE_SHIFT); |
| 944 | BUG_ON(addr_to_vb_idx(addr) != |
| 945 | addr_to_vb_idx(vb->va->va_start)); |
| 946 | vb->free -= 1UL << order; |
| 947 | if (vb->free == 0) { |
| 948 | spin_lock(&vbq->lock); |
| 949 | list_del_rcu(&vb->free_list); |
| 950 | spin_unlock(&vbq->lock); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 951 | } |
| 952 | spin_unlock(&vb->lock); |
Nick Piggin | 02b709d | 2010-02-01 22:25:57 +1100 | [diff] [blame] | 953 | break; |
| 954 | next: |
| 955 | spin_unlock(&vb->lock); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 956 | } |
Nick Piggin | 02b709d | 2010-02-01 22:25:57 +1100 | [diff] [blame] | 957 | |
| 958 | if (purge) |
| 959 | purge_fragmented_blocks_thiscpu(); |
| 960 | |
Tejun Heo | 3f04ba8 | 2009-10-29 22:34:12 +0900 | [diff] [blame] | 961 | put_cpu_var(vmap_block_queue); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 962 | rcu_read_unlock(); |
| 963 | |
| 964 | if (!addr) { |
| 965 | vb = new_vmap_block(gfp_mask); |
| 966 | if (IS_ERR(vb)) |
| 967 | return vb; |
| 968 | goto again; |
| 969 | } |
| 970 | |
| 971 | return (void *)addr; |
| 972 | } |
| 973 | |
| 974 | static void vb_free(const void *addr, unsigned long size) |
| 975 | { |
| 976 | unsigned long offset; |
| 977 | unsigned long vb_idx; |
| 978 | unsigned int order; |
| 979 | struct vmap_block *vb; |
| 980 | |
| 981 | BUG_ON(size & ~PAGE_MASK); |
| 982 | BUG_ON(size > PAGE_SIZE*VMAP_MAX_ALLOC); |
Nick Piggin | b29acbd | 2008-12-01 13:13:47 -0800 | [diff] [blame] | 983 | |
| 984 | flush_cache_vunmap((unsigned long)addr, (unsigned long)addr + size); |
| 985 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 986 | order = get_order(size); |
| 987 | |
| 988 | offset = (unsigned long)addr & (VMAP_BLOCK_SIZE - 1); |
| 989 | |
| 990 | vb_idx = addr_to_vb_idx((unsigned long)addr); |
| 991 | rcu_read_lock(); |
| 992 | vb = radix_tree_lookup(&vmap_block_tree, vb_idx); |
| 993 | rcu_read_unlock(); |
| 994 | BUG_ON(!vb); |
| 995 | |
Jeremy Fitzhardinge | 64141da | 2010-12-02 14:31:18 -0800 | [diff] [blame] | 996 | vunmap_page_range((unsigned long)addr, (unsigned long)addr + size); |
| 997 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 998 | spin_lock(&vb->lock); |
Nick Piggin | de56042 | 2010-02-01 22:24:18 +1100 | [diff] [blame] | 999 | BUG_ON(bitmap_allocate_region(vb->dirty_map, offset >> PAGE_SHIFT, order)); |
MinChan Kim | d086817 | 2009-03-31 15:19:26 -0700 | [diff] [blame] | 1000 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1001 | vb->dirty += 1UL << order; |
| 1002 | if (vb->dirty == VMAP_BBMAP_BITS) { |
Nick Piggin | de56042 | 2010-02-01 22:24:18 +1100 | [diff] [blame] | 1003 | BUG_ON(vb->free); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1004 | spin_unlock(&vb->lock); |
| 1005 | free_vmap_block(vb); |
| 1006 | } else |
| 1007 | spin_unlock(&vb->lock); |
| 1008 | } |
| 1009 | |
| 1010 | /** |
| 1011 | * vm_unmap_aliases - unmap outstanding lazy aliases in the vmap layer |
| 1012 | * |
| 1013 | * The vmap/vmalloc layer lazily flushes kernel virtual mappings primarily |
| 1014 | * to amortize TLB flushing overheads. What this means is that any page you |
| 1015 | * have now, may, in a former life, have been mapped into kernel virtual |
| 1016 | * address by the vmap layer and so there might be some CPUs with TLB entries |
| 1017 | * still referencing that page (additional to the regular 1:1 kernel mapping). |
| 1018 | * |
| 1019 | * vm_unmap_aliases flushes all such lazy mappings. After it returns, we can |
| 1020 | * be sure that none of the pages we have control over will have any aliases |
| 1021 | * from the vmap layer. |
| 1022 | */ |
| 1023 | void vm_unmap_aliases(void) |
| 1024 | { |
| 1025 | unsigned long start = ULONG_MAX, end = 0; |
| 1026 | int cpu; |
| 1027 | int flush = 0; |
| 1028 | |
Jeremy Fitzhardinge | 9b46333 | 2008-10-28 19:22:34 +1100 | [diff] [blame] | 1029 | if (unlikely(!vmap_initialized)) |
| 1030 | return; |
| 1031 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1032 | for_each_possible_cpu(cpu) { |
| 1033 | struct vmap_block_queue *vbq = &per_cpu(vmap_block_queue, cpu); |
| 1034 | struct vmap_block *vb; |
| 1035 | |
| 1036 | rcu_read_lock(); |
| 1037 | list_for_each_entry_rcu(vb, &vbq->free, free_list) { |
| 1038 | int i; |
| 1039 | |
| 1040 | spin_lock(&vb->lock); |
| 1041 | i = find_first_bit(vb->dirty_map, VMAP_BBMAP_BITS); |
| 1042 | while (i < VMAP_BBMAP_BITS) { |
| 1043 | unsigned long s, e; |
| 1044 | int j; |
| 1045 | j = find_next_zero_bit(vb->dirty_map, |
| 1046 | VMAP_BBMAP_BITS, i); |
| 1047 | |
| 1048 | s = vb->va->va_start + (i << PAGE_SHIFT); |
| 1049 | e = vb->va->va_start + (j << PAGE_SHIFT); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1050 | flush = 1; |
| 1051 | |
| 1052 | if (s < start) |
| 1053 | start = s; |
| 1054 | if (e > end) |
| 1055 | end = e; |
| 1056 | |
| 1057 | i = j; |
| 1058 | i = find_next_bit(vb->dirty_map, |
| 1059 | VMAP_BBMAP_BITS, i); |
| 1060 | } |
| 1061 | spin_unlock(&vb->lock); |
| 1062 | } |
| 1063 | rcu_read_unlock(); |
| 1064 | } |
| 1065 | |
| 1066 | __purge_vmap_area_lazy(&start, &end, 1, flush); |
| 1067 | } |
| 1068 | EXPORT_SYMBOL_GPL(vm_unmap_aliases); |
| 1069 | |
| 1070 | /** |
| 1071 | * vm_unmap_ram - unmap linear kernel address space set up by vm_map_ram |
| 1072 | * @mem: the pointer returned by vm_map_ram |
| 1073 | * @count: the count passed to that vm_map_ram call (cannot unmap partial) |
| 1074 | */ |
| 1075 | void vm_unmap_ram(const void *mem, unsigned int count) |
| 1076 | { |
| 1077 | unsigned long size = count << PAGE_SHIFT; |
| 1078 | unsigned long addr = (unsigned long)mem; |
| 1079 | |
| 1080 | BUG_ON(!addr); |
| 1081 | BUG_ON(addr < VMALLOC_START); |
| 1082 | BUG_ON(addr > VMALLOC_END); |
| 1083 | BUG_ON(addr & (PAGE_SIZE-1)); |
| 1084 | |
| 1085 | debug_check_no_locks_freed(mem, size); |
Nick Piggin | cd52858 | 2009-01-06 14:39:20 -0800 | [diff] [blame] | 1086 | vmap_debug_free_range(addr, addr+size); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1087 | |
| 1088 | if (likely(count <= VMAP_MAX_ALLOC)) |
| 1089 | vb_free(mem, size); |
| 1090 | else |
| 1091 | free_unmap_vmap_area_addr(addr); |
| 1092 | } |
| 1093 | EXPORT_SYMBOL(vm_unmap_ram); |
| 1094 | |
| 1095 | /** |
| 1096 | * vm_map_ram - map pages linearly into kernel virtual address (vmalloc space) |
| 1097 | * @pages: an array of pointers to the pages to be mapped |
| 1098 | * @count: number of pages |
| 1099 | * @node: prefer to allocate data structures on this node |
| 1100 | * @prot: memory protection to use. PAGE_KERNEL for regular RAM |
Randy Dunlap | e99c97a | 2008-10-29 14:01:09 -0700 | [diff] [blame] | 1101 | * |
| 1102 | * Returns: a pointer to the address that has been mapped, or %NULL on failure |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1103 | */ |
| 1104 | void *vm_map_ram(struct page **pages, unsigned int count, int node, pgprot_t prot) |
| 1105 | { |
| 1106 | unsigned long size = count << PAGE_SHIFT; |
| 1107 | unsigned long addr; |
| 1108 | void *mem; |
| 1109 | |
| 1110 | if (likely(count <= VMAP_MAX_ALLOC)) { |
| 1111 | mem = vb_alloc(size, GFP_KERNEL); |
| 1112 | if (IS_ERR(mem)) |
| 1113 | return NULL; |
| 1114 | addr = (unsigned long)mem; |
| 1115 | } else { |
| 1116 | struct vmap_area *va; |
| 1117 | va = alloc_vmap_area(size, PAGE_SIZE, |
| 1118 | VMALLOC_START, VMALLOC_END, node, GFP_KERNEL); |
| 1119 | if (IS_ERR(va)) |
| 1120 | return NULL; |
| 1121 | |
| 1122 | addr = va->va_start; |
| 1123 | mem = (void *)addr; |
| 1124 | } |
| 1125 | if (vmap_page_range(addr, addr + size, prot, pages) < 0) { |
| 1126 | vm_unmap_ram(mem, count); |
| 1127 | return NULL; |
| 1128 | } |
| 1129 | return mem; |
| 1130 | } |
| 1131 | EXPORT_SYMBOL(vm_map_ram); |
| 1132 | |
Tejun Heo | f0aa661 | 2009-02-20 16:29:08 +0900 | [diff] [blame] | 1133 | /** |
| 1134 | * vm_area_register_early - register vmap area early during boot |
| 1135 | * @vm: vm_struct to register |
Tejun Heo | c0c0a29 | 2009-02-24 11:57:21 +0900 | [diff] [blame] | 1136 | * @align: requested alignment |
Tejun Heo | f0aa661 | 2009-02-20 16:29:08 +0900 | [diff] [blame] | 1137 | * |
| 1138 | * This function is used to register kernel vm area before |
| 1139 | * vmalloc_init() is called. @vm->size and @vm->flags should contain |
| 1140 | * proper values on entry and other fields should be zero. On return, |
| 1141 | * vm->addr contains the allocated address. |
| 1142 | * |
| 1143 | * DO NOT USE THIS FUNCTION UNLESS YOU KNOW WHAT YOU'RE DOING. |
| 1144 | */ |
Tejun Heo | c0c0a29 | 2009-02-24 11:57:21 +0900 | [diff] [blame] | 1145 | void __init vm_area_register_early(struct vm_struct *vm, size_t align) |
Tejun Heo | f0aa661 | 2009-02-20 16:29:08 +0900 | [diff] [blame] | 1146 | { |
| 1147 | static size_t vm_init_off __initdata; |
Tejun Heo | c0c0a29 | 2009-02-24 11:57:21 +0900 | [diff] [blame] | 1148 | unsigned long addr; |
Tejun Heo | f0aa661 | 2009-02-20 16:29:08 +0900 | [diff] [blame] | 1149 | |
Tejun Heo | c0c0a29 | 2009-02-24 11:57:21 +0900 | [diff] [blame] | 1150 | addr = ALIGN(VMALLOC_START + vm_init_off, align); |
| 1151 | vm_init_off = PFN_ALIGN(addr + vm->size) - VMALLOC_START; |
| 1152 | |
| 1153 | vm->addr = (void *)addr; |
Tejun Heo | f0aa661 | 2009-02-20 16:29:08 +0900 | [diff] [blame] | 1154 | |
| 1155 | vm->next = vmlist; |
| 1156 | vmlist = vm; |
| 1157 | } |
| 1158 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1159 | void __init vmalloc_init(void) |
| 1160 | { |
Ivan Kokshaysky | 822c18f | 2009-01-15 13:50:48 -0800 | [diff] [blame] | 1161 | struct vmap_area *va; |
| 1162 | struct vm_struct *tmp; |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1163 | int i; |
| 1164 | |
| 1165 | for_each_possible_cpu(i) { |
| 1166 | struct vmap_block_queue *vbq; |
| 1167 | |
| 1168 | vbq = &per_cpu(vmap_block_queue, i); |
| 1169 | spin_lock_init(&vbq->lock); |
| 1170 | INIT_LIST_HEAD(&vbq->free); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1171 | } |
Jeremy Fitzhardinge | 9b46333 | 2008-10-28 19:22:34 +1100 | [diff] [blame] | 1172 | |
Ivan Kokshaysky | 822c18f | 2009-01-15 13:50:48 -0800 | [diff] [blame] | 1173 | /* Import existing vmlist entries. */ |
| 1174 | for (tmp = vmlist; tmp; tmp = tmp->next) { |
Pekka Enberg | 43ebdac | 2009-05-25 15:01:35 +0300 | [diff] [blame] | 1175 | va = kzalloc(sizeof(struct vmap_area), GFP_NOWAIT); |
Ivan Kokshaysky | 822c18f | 2009-01-15 13:50:48 -0800 | [diff] [blame] | 1176 | va->flags = tmp->flags | VM_VM_AREA; |
| 1177 | va->va_start = (unsigned long)tmp->addr; |
| 1178 | va->va_end = va->va_start + tmp->size; |
| 1179 | __insert_vmap_area(va); |
| 1180 | } |
Tejun Heo | ca23e40 | 2009-08-14 15:00:52 +0900 | [diff] [blame] | 1181 | |
| 1182 | vmap_area_pcpu_hole = VMALLOC_END; |
| 1183 | |
Jeremy Fitzhardinge | 9b46333 | 2008-10-28 19:22:34 +1100 | [diff] [blame] | 1184 | vmap_initialized = true; |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1185 | } |
| 1186 | |
Tejun Heo | 8fc4898 | 2009-02-20 16:29:08 +0900 | [diff] [blame] | 1187 | /** |
| 1188 | * map_kernel_range_noflush - map kernel VM area with the specified pages |
| 1189 | * @addr: start of the VM area to map |
| 1190 | * @size: size of the VM area to map |
| 1191 | * @prot: page protection flags to use |
| 1192 | * @pages: pages to map |
| 1193 | * |
| 1194 | * Map PFN_UP(@size) pages at @addr. The VM area @addr and @size |
| 1195 | * specify should have been allocated using get_vm_area() and its |
| 1196 | * friends. |
| 1197 | * |
| 1198 | * NOTE: |
| 1199 | * This function does NOT do any cache flushing. The caller is |
| 1200 | * responsible for calling flush_cache_vmap() on to-be-mapped areas |
| 1201 | * before calling this function. |
| 1202 | * |
| 1203 | * RETURNS: |
| 1204 | * The number of pages mapped on success, -errno on failure. |
| 1205 | */ |
| 1206 | int map_kernel_range_noflush(unsigned long addr, unsigned long size, |
| 1207 | pgprot_t prot, struct page **pages) |
| 1208 | { |
| 1209 | return vmap_page_range_noflush(addr, addr + size, prot, pages); |
| 1210 | } |
| 1211 | |
| 1212 | /** |
| 1213 | * unmap_kernel_range_noflush - unmap kernel VM area |
| 1214 | * @addr: start of the VM area to unmap |
| 1215 | * @size: size of the VM area to unmap |
| 1216 | * |
| 1217 | * Unmap PFN_UP(@size) pages at @addr. The VM area @addr and @size |
| 1218 | * specify should have been allocated using get_vm_area() and its |
| 1219 | * friends. |
| 1220 | * |
| 1221 | * NOTE: |
| 1222 | * This function does NOT do any cache flushing. The caller is |
| 1223 | * responsible for calling flush_cache_vunmap() on to-be-mapped areas |
| 1224 | * before calling this function and flush_tlb_kernel_range() after. |
| 1225 | */ |
| 1226 | void unmap_kernel_range_noflush(unsigned long addr, unsigned long size) |
| 1227 | { |
| 1228 | vunmap_page_range(addr, addr + size); |
| 1229 | } |
Huang Ying | 81e88fd | 2011-01-12 14:44:55 +0800 | [diff] [blame] | 1230 | EXPORT_SYMBOL_GPL(unmap_kernel_range_noflush); |
Tejun Heo | 8fc4898 | 2009-02-20 16:29:08 +0900 | [diff] [blame] | 1231 | |
| 1232 | /** |
| 1233 | * unmap_kernel_range - unmap kernel VM area and flush cache and TLB |
| 1234 | * @addr: start of the VM area to unmap |
| 1235 | * @size: size of the VM area to unmap |
| 1236 | * |
| 1237 | * Similar to unmap_kernel_range_noflush() but flushes vcache before |
| 1238 | * the unmapping and tlb after. |
| 1239 | */ |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1240 | void unmap_kernel_range(unsigned long addr, unsigned long size) |
| 1241 | { |
| 1242 | unsigned long end = addr + size; |
Tejun Heo | f6fcba7 | 2009-02-20 15:38:48 -0800 | [diff] [blame] | 1243 | |
| 1244 | flush_cache_vunmap(addr, end); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1245 | vunmap_page_range(addr, end); |
| 1246 | flush_tlb_kernel_range(addr, end); |
| 1247 | } |
| 1248 | |
| 1249 | int map_vm_area(struct vm_struct *area, pgprot_t prot, struct page ***pages) |
| 1250 | { |
| 1251 | unsigned long addr = (unsigned long)area->addr; |
| 1252 | unsigned long end = addr + area->size - PAGE_SIZE; |
| 1253 | int err; |
| 1254 | |
| 1255 | err = vmap_page_range(addr, end, prot, *pages); |
| 1256 | if (err > 0) { |
| 1257 | *pages += err; |
| 1258 | err = 0; |
| 1259 | } |
| 1260 | |
| 1261 | return err; |
| 1262 | } |
| 1263 | EXPORT_SYMBOL_GPL(map_vm_area); |
| 1264 | |
| 1265 | /*** Old vmalloc interfaces ***/ |
| 1266 | DEFINE_RWLOCK(vmlist_lock); |
| 1267 | struct vm_struct *vmlist; |
| 1268 | |
Tejun Heo | cf88c79 | 2009-08-14 15:00:52 +0900 | [diff] [blame] | 1269 | static void insert_vmalloc_vm(struct vm_struct *vm, struct vmap_area *va, |
| 1270 | unsigned long flags, void *caller) |
| 1271 | { |
| 1272 | struct vm_struct *tmp, **p; |
| 1273 | |
| 1274 | vm->flags = flags; |
| 1275 | vm->addr = (void *)va->va_start; |
| 1276 | vm->size = va->va_end - va->va_start; |
| 1277 | vm->caller = caller; |
| 1278 | va->private = vm; |
| 1279 | va->flags |= VM_VM_AREA; |
| 1280 | |
| 1281 | write_lock(&vmlist_lock); |
| 1282 | for (p = &vmlist; (tmp = *p) != NULL; p = &tmp->next) { |
| 1283 | if (tmp->addr >= vm->addr) |
| 1284 | break; |
| 1285 | } |
| 1286 | vm->next = *p; |
| 1287 | *p = vm; |
| 1288 | write_unlock(&vmlist_lock); |
| 1289 | } |
| 1290 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1291 | static struct vm_struct *__get_vm_area_node(unsigned long size, |
David Miller | 2dca699 | 2009-09-21 12:22:34 -0700 | [diff] [blame] | 1292 | unsigned long align, unsigned long flags, unsigned long start, |
| 1293 | unsigned long end, int node, gfp_t gfp_mask, void *caller) |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1294 | { |
| 1295 | static struct vmap_area *va; |
| 1296 | struct vm_struct *area; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1297 | |
Giridhar Pemmasani | 52fd24c | 2006-10-28 10:38:34 -0700 | [diff] [blame] | 1298 | BUG_ON(in_interrupt()); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1299 | if (flags & VM_IOREMAP) { |
| 1300 | int bit = fls(size); |
| 1301 | |
| 1302 | if (bit > IOREMAP_MAX_ORDER) |
| 1303 | bit = IOREMAP_MAX_ORDER; |
| 1304 | else if (bit < PAGE_SHIFT) |
| 1305 | bit = PAGE_SHIFT; |
| 1306 | |
| 1307 | align = 1ul << bit; |
| 1308 | } |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1309 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1310 | size = PAGE_ALIGN(size); |
OGAWA Hirofumi | 31be830 | 2006-11-16 01:19:29 -0800 | [diff] [blame] | 1311 | if (unlikely(!size)) |
| 1312 | return NULL; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1313 | |
Tejun Heo | cf88c79 | 2009-08-14 15:00:52 +0900 | [diff] [blame] | 1314 | area = kzalloc_node(sizeof(*area), gfp_mask & GFP_RECLAIM_MASK, node); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1315 | if (unlikely(!area)) |
| 1316 | return NULL; |
| 1317 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1318 | /* |
| 1319 | * We always allocate a guard page. |
| 1320 | */ |
| 1321 | size += PAGE_SIZE; |
| 1322 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1323 | va = alloc_vmap_area(size, align, start, end, node, gfp_mask); |
| 1324 | if (IS_ERR(va)) { |
| 1325 | kfree(area); |
| 1326 | return NULL; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1327 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1328 | |
Tejun Heo | cf88c79 | 2009-08-14 15:00:52 +0900 | [diff] [blame] | 1329 | insert_vmalloc_vm(area, va, flags, caller); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1330 | return area; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1331 | } |
| 1332 | |
Christoph Lameter | 930fc45 | 2005-10-29 18:15:41 -0700 | [diff] [blame] | 1333 | struct vm_struct *__get_vm_area(unsigned long size, unsigned long flags, |
| 1334 | unsigned long start, unsigned long end) |
| 1335 | { |
David Miller | 2dca699 | 2009-09-21 12:22:34 -0700 | [diff] [blame] | 1336 | return __get_vm_area_node(size, 1, flags, start, end, -1, GFP_KERNEL, |
Christoph Lameter | 2301696 | 2008-04-28 02:12:42 -0700 | [diff] [blame] | 1337 | __builtin_return_address(0)); |
Christoph Lameter | 930fc45 | 2005-10-29 18:15:41 -0700 | [diff] [blame] | 1338 | } |
Rusty Russell | 5992b6d | 2007-07-19 01:49:21 -0700 | [diff] [blame] | 1339 | EXPORT_SYMBOL_GPL(__get_vm_area); |
Christoph Lameter | 930fc45 | 2005-10-29 18:15:41 -0700 | [diff] [blame] | 1340 | |
Benjamin Herrenschmidt | c296861 | 2009-02-18 14:48:12 -0800 | [diff] [blame] | 1341 | struct vm_struct *__get_vm_area_caller(unsigned long size, unsigned long flags, |
| 1342 | unsigned long start, unsigned long end, |
| 1343 | void *caller) |
| 1344 | { |
David Miller | 2dca699 | 2009-09-21 12:22:34 -0700 | [diff] [blame] | 1345 | return __get_vm_area_node(size, 1, flags, start, end, -1, GFP_KERNEL, |
Benjamin Herrenschmidt | c296861 | 2009-02-18 14:48:12 -0800 | [diff] [blame] | 1346 | caller); |
| 1347 | } |
| 1348 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1349 | /** |
Simon Arlott | 183ff22 | 2007-10-20 01:27:18 +0200 | [diff] [blame] | 1350 | * get_vm_area - reserve a contiguous kernel virtual area |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1351 | * @size: size of the area |
| 1352 | * @flags: %VM_IOREMAP for I/O mappings or VM_ALLOC |
| 1353 | * |
| 1354 | * Search an area of @size in the kernel virtual mapping area, |
| 1355 | * and reserved it for out purposes. Returns the area descriptor |
| 1356 | * on success or %NULL on failure. |
| 1357 | */ |
| 1358 | struct vm_struct *get_vm_area(unsigned long size, unsigned long flags) |
| 1359 | { |
David Miller | 2dca699 | 2009-09-21 12:22:34 -0700 | [diff] [blame] | 1360 | return __get_vm_area_node(size, 1, flags, VMALLOC_START, VMALLOC_END, |
Christoph Lameter | 2301696 | 2008-04-28 02:12:42 -0700 | [diff] [blame] | 1361 | -1, GFP_KERNEL, __builtin_return_address(0)); |
| 1362 | } |
| 1363 | |
| 1364 | struct vm_struct *get_vm_area_caller(unsigned long size, unsigned long flags, |
| 1365 | void *caller) |
| 1366 | { |
David Miller | 2dca699 | 2009-09-21 12:22:34 -0700 | [diff] [blame] | 1367 | return __get_vm_area_node(size, 1, flags, VMALLOC_START, VMALLOC_END, |
Christoph Lameter | 2301696 | 2008-04-28 02:12:42 -0700 | [diff] [blame] | 1368 | -1, GFP_KERNEL, caller); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1369 | } |
| 1370 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1371 | static struct vm_struct *find_vm_area(const void *addr) |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 1372 | { |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1373 | struct vmap_area *va; |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 1374 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1375 | va = find_vmap_area((unsigned long)addr); |
| 1376 | if (va && va->flags & VM_VM_AREA) |
| 1377 | return va->private; |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 1378 | |
Andi Kleen | 7856dfe | 2005-05-20 14:27:57 -0700 | [diff] [blame] | 1379 | return NULL; |
Andi Kleen | 7856dfe | 2005-05-20 14:27:57 -0700 | [diff] [blame] | 1380 | } |
| 1381 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1382 | /** |
Simon Arlott | 183ff22 | 2007-10-20 01:27:18 +0200 | [diff] [blame] | 1383 | * remove_vm_area - find and remove a continuous kernel virtual area |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1384 | * @addr: base address |
| 1385 | * |
| 1386 | * Search for the kernel VM area starting at @addr, and remove it. |
| 1387 | * This function returns the found VM area, but using it is NOT safe |
Andi Kleen | 7856dfe | 2005-05-20 14:27:57 -0700 | [diff] [blame] | 1388 | * on SMP machines, except for its size or flags. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1389 | */ |
Christoph Lameter | b3bdda0 | 2008-02-04 22:28:32 -0800 | [diff] [blame] | 1390 | struct vm_struct *remove_vm_area(const void *addr) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1391 | { |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1392 | struct vmap_area *va; |
| 1393 | |
| 1394 | va = find_vmap_area((unsigned long)addr); |
| 1395 | if (va && va->flags & VM_VM_AREA) { |
| 1396 | struct vm_struct *vm = va->private; |
| 1397 | struct vm_struct *tmp, **p; |
KAMEZAWA Hiroyuki | dd32c27 | 2009-09-21 17:02:32 -0700 | [diff] [blame] | 1398 | /* |
| 1399 | * remove from list and disallow access to this vm_struct |
| 1400 | * before unmap. (address range confliction is maintained by |
| 1401 | * vmap.) |
| 1402 | */ |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1403 | write_lock(&vmlist_lock); |
| 1404 | for (p = &vmlist; (tmp = *p) != vm; p = &tmp->next) |
| 1405 | ; |
| 1406 | *p = tmp->next; |
| 1407 | write_unlock(&vmlist_lock); |
| 1408 | |
KAMEZAWA Hiroyuki | dd32c27 | 2009-09-21 17:02:32 -0700 | [diff] [blame] | 1409 | vmap_debug_free_range(va->va_start, va->va_end); |
| 1410 | free_unmap_vmap_area(va); |
| 1411 | vm->size -= PAGE_SIZE; |
| 1412 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1413 | return vm; |
| 1414 | } |
| 1415 | return NULL; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1416 | } |
| 1417 | |
Christoph Lameter | b3bdda0 | 2008-02-04 22:28:32 -0800 | [diff] [blame] | 1418 | static void __vunmap(const void *addr, int deallocate_pages) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1419 | { |
| 1420 | struct vm_struct *area; |
| 1421 | |
| 1422 | if (!addr) |
| 1423 | return; |
| 1424 | |
| 1425 | if ((PAGE_SIZE-1) & (unsigned long)addr) { |
Arjan van de Ven | 4c8573e | 2008-07-25 19:45:37 -0700 | [diff] [blame] | 1426 | WARN(1, KERN_ERR "Trying to vfree() bad address (%p)\n", addr); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1427 | return; |
| 1428 | } |
| 1429 | |
| 1430 | area = remove_vm_area(addr); |
| 1431 | if (unlikely(!area)) { |
Arjan van de Ven | 4c8573e | 2008-07-25 19:45:37 -0700 | [diff] [blame] | 1432 | WARN(1, KERN_ERR "Trying to vfree() nonexistent vm area (%p)\n", |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1433 | addr); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1434 | return; |
| 1435 | } |
| 1436 | |
Ingo Molnar | 9a11b49a | 2006-07-03 00:24:33 -0700 | [diff] [blame] | 1437 | debug_check_no_locks_freed(addr, area->size); |
Thomas Gleixner | 3ac7fe5 | 2008-04-30 00:55:01 -0700 | [diff] [blame] | 1438 | debug_check_no_obj_freed(addr, area->size); |
Ingo Molnar | 9a11b49a | 2006-07-03 00:24:33 -0700 | [diff] [blame] | 1439 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1440 | if (deallocate_pages) { |
| 1441 | int i; |
| 1442 | |
| 1443 | for (i = 0; i < area->nr_pages; i++) { |
Christoph Lameter | bf53d6f | 2008-02-04 22:28:34 -0800 | [diff] [blame] | 1444 | struct page *page = area->pages[i]; |
| 1445 | |
| 1446 | BUG_ON(!page); |
| 1447 | __free_page(page); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1448 | } |
| 1449 | |
Jan Kiszka | 8757d5f | 2006-07-14 00:23:56 -0700 | [diff] [blame] | 1450 | if (area->flags & VM_VPAGES) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1451 | vfree(area->pages); |
| 1452 | else |
| 1453 | kfree(area->pages); |
| 1454 | } |
| 1455 | |
| 1456 | kfree(area); |
| 1457 | return; |
| 1458 | } |
| 1459 | |
| 1460 | /** |
| 1461 | * vfree - release memory allocated by vmalloc() |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1462 | * @addr: memory base address |
| 1463 | * |
Simon Arlott | 183ff22 | 2007-10-20 01:27:18 +0200 | [diff] [blame] | 1464 | * Free the virtually continuous memory area starting at @addr, as |
Pekka Enberg | 80e93ef | 2005-09-09 13:10:16 -0700 | [diff] [blame] | 1465 | * obtained from vmalloc(), vmalloc_32() or __vmalloc(). If @addr is |
| 1466 | * NULL, no operation is performed. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1467 | * |
Pekka Enberg | 80e93ef | 2005-09-09 13:10:16 -0700 | [diff] [blame] | 1468 | * Must not be called in interrupt context. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1469 | */ |
Christoph Lameter | b3bdda0 | 2008-02-04 22:28:32 -0800 | [diff] [blame] | 1470 | void vfree(const void *addr) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1471 | { |
| 1472 | BUG_ON(in_interrupt()); |
Catalin Marinas | 89219d3 | 2009-06-11 13:23:19 +0100 | [diff] [blame] | 1473 | |
| 1474 | kmemleak_free(addr); |
| 1475 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1476 | __vunmap(addr, 1); |
| 1477 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1478 | EXPORT_SYMBOL(vfree); |
| 1479 | |
| 1480 | /** |
| 1481 | * vunmap - release virtual mapping obtained by vmap() |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1482 | * @addr: memory base address |
| 1483 | * |
| 1484 | * Free the virtually contiguous memory area starting at @addr, |
| 1485 | * which was created from the page array passed to vmap(). |
| 1486 | * |
Pekka Enberg | 80e93ef | 2005-09-09 13:10:16 -0700 | [diff] [blame] | 1487 | * Must not be called in interrupt context. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1488 | */ |
Christoph Lameter | b3bdda0 | 2008-02-04 22:28:32 -0800 | [diff] [blame] | 1489 | void vunmap(const void *addr) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1490 | { |
| 1491 | BUG_ON(in_interrupt()); |
Peter Zijlstra | 34754b6 | 2009-02-25 16:04:03 +0100 | [diff] [blame] | 1492 | might_sleep(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1493 | __vunmap(addr, 0); |
| 1494 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1495 | EXPORT_SYMBOL(vunmap); |
| 1496 | |
| 1497 | /** |
| 1498 | * vmap - map an array of pages into virtually contiguous space |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1499 | * @pages: array of page pointers |
| 1500 | * @count: number of pages to map |
| 1501 | * @flags: vm_area->flags |
| 1502 | * @prot: page protection for the mapping |
| 1503 | * |
| 1504 | * Maps @count pages from @pages into contiguous kernel virtual |
| 1505 | * space. |
| 1506 | */ |
| 1507 | void *vmap(struct page **pages, unsigned int count, |
| 1508 | unsigned long flags, pgprot_t prot) |
| 1509 | { |
| 1510 | struct vm_struct *area; |
| 1511 | |
Peter Zijlstra | 34754b6 | 2009-02-25 16:04:03 +0100 | [diff] [blame] | 1512 | might_sleep(); |
| 1513 | |
Jan Beulich | 4481374 | 2009-09-21 17:03:05 -0700 | [diff] [blame] | 1514 | if (count > totalram_pages) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1515 | return NULL; |
| 1516 | |
Christoph Lameter | 2301696 | 2008-04-28 02:12:42 -0700 | [diff] [blame] | 1517 | area = get_vm_area_caller((count << PAGE_SHIFT), flags, |
| 1518 | __builtin_return_address(0)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1519 | if (!area) |
| 1520 | return NULL; |
Christoph Lameter | 2301696 | 2008-04-28 02:12:42 -0700 | [diff] [blame] | 1521 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1522 | if (map_vm_area(area, prot, &pages)) { |
| 1523 | vunmap(area->addr); |
| 1524 | return NULL; |
| 1525 | } |
| 1526 | |
| 1527 | return area->addr; |
| 1528 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1529 | EXPORT_SYMBOL(vmap); |
| 1530 | |
David Miller | 2dca699 | 2009-09-21 12:22:34 -0700 | [diff] [blame] | 1531 | static void *__vmalloc_node(unsigned long size, unsigned long align, |
| 1532 | gfp_t gfp_mask, pgprot_t prot, |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1533 | int node, void *caller); |
Adrian Bunk | e31d9eb | 2008-02-04 22:29:09 -0800 | [diff] [blame] | 1534 | static void *__vmalloc_area_node(struct vm_struct *area, gfp_t gfp_mask, |
Christoph Lameter | 2301696 | 2008-04-28 02:12:42 -0700 | [diff] [blame] | 1535 | pgprot_t prot, int node, void *caller) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1536 | { |
Dave Hansen | 22943ab | 2011-05-24 17:12:18 -0700 | [diff] [blame] | 1537 | const int order = 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1538 | struct page **pages; |
| 1539 | unsigned int nr_pages, array_size, i; |
Jan Beulich | 976d6df | 2009-12-14 17:58:39 -0800 | [diff] [blame] | 1540 | gfp_t nested_gfp = (gfp_mask & GFP_RECLAIM_MASK) | __GFP_ZERO; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1541 | |
| 1542 | nr_pages = (area->size - PAGE_SIZE) >> PAGE_SHIFT; |
| 1543 | array_size = (nr_pages * sizeof(struct page *)); |
| 1544 | |
| 1545 | area->nr_pages = nr_pages; |
| 1546 | /* Please note that the recursion is strictly bounded. */ |
Jan Kiszka | 8757d5f | 2006-07-14 00:23:56 -0700 | [diff] [blame] | 1547 | if (array_size > PAGE_SIZE) { |
Jan Beulich | 976d6df | 2009-12-14 17:58:39 -0800 | [diff] [blame] | 1548 | pages = __vmalloc_node(array_size, 1, nested_gfp|__GFP_HIGHMEM, |
Christoph Lameter | 2301696 | 2008-04-28 02:12:42 -0700 | [diff] [blame] | 1549 | PAGE_KERNEL, node, caller); |
Jan Kiszka | 8757d5f | 2006-07-14 00:23:56 -0700 | [diff] [blame] | 1550 | area->flags |= VM_VPAGES; |
Andrew Morton | 286e1ea | 2006-10-17 00:09:57 -0700 | [diff] [blame] | 1551 | } else { |
Jan Beulich | 976d6df | 2009-12-14 17:58:39 -0800 | [diff] [blame] | 1552 | pages = kmalloc_node(array_size, nested_gfp, node); |
Andrew Morton | 286e1ea | 2006-10-17 00:09:57 -0700 | [diff] [blame] | 1553 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1554 | area->pages = pages; |
Christoph Lameter | 2301696 | 2008-04-28 02:12:42 -0700 | [diff] [blame] | 1555 | area->caller = caller; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1556 | if (!area->pages) { |
| 1557 | remove_vm_area(area->addr); |
| 1558 | kfree(area); |
| 1559 | return NULL; |
| 1560 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1561 | |
| 1562 | for (i = 0; i < area->nr_pages; i++) { |
Christoph Lameter | bf53d6f | 2008-02-04 22:28:34 -0800 | [diff] [blame] | 1563 | struct page *page; |
Dave Hansen | 22943ab | 2011-05-24 17:12:18 -0700 | [diff] [blame] | 1564 | gfp_t tmp_mask = gfp_mask | __GFP_NOWARN; |
Christoph Lameter | bf53d6f | 2008-02-04 22:28:34 -0800 | [diff] [blame] | 1565 | |
Christoph Lameter | 930fc45 | 2005-10-29 18:15:41 -0700 | [diff] [blame] | 1566 | if (node < 0) |
Dave Hansen | 22943ab | 2011-05-24 17:12:18 -0700 | [diff] [blame] | 1567 | page = alloc_page(tmp_mask); |
Christoph Lameter | 930fc45 | 2005-10-29 18:15:41 -0700 | [diff] [blame] | 1568 | else |
Dave Hansen | 22943ab | 2011-05-24 17:12:18 -0700 | [diff] [blame] | 1569 | page = alloc_pages_node(node, tmp_mask, order); |
Christoph Lameter | bf53d6f | 2008-02-04 22:28:34 -0800 | [diff] [blame] | 1570 | |
| 1571 | if (unlikely(!page)) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1572 | /* Successfully allocated i pages, free them in __vunmap() */ |
| 1573 | area->nr_pages = i; |
| 1574 | goto fail; |
| 1575 | } |
Christoph Lameter | bf53d6f | 2008-02-04 22:28:34 -0800 | [diff] [blame] | 1576 | area->pages[i] = page; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1577 | } |
| 1578 | |
| 1579 | if (map_vm_area(area, prot, &pages)) |
| 1580 | goto fail; |
| 1581 | return area->addr; |
| 1582 | |
| 1583 | fail: |
Dave Hansen | 22943ab | 2011-05-24 17:12:18 -0700 | [diff] [blame] | 1584 | warn_alloc_failed(gfp_mask, order, "vmalloc: allocation failure, " |
| 1585 | "allocated %ld of %ld bytes\n", |
| 1586 | (area->nr_pages*PAGE_SIZE), area->size); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1587 | vfree(area->addr); |
| 1588 | return NULL; |
| 1589 | } |
| 1590 | |
David Rientjes | d0a2126 | 2011-01-13 15:46:02 -0800 | [diff] [blame] | 1591 | /** |
| 1592 | * __vmalloc_node_range - allocate virtually contiguous memory |
| 1593 | * @size: allocation size |
| 1594 | * @align: desired alignment |
| 1595 | * @start: vm area range start |
| 1596 | * @end: vm area range end |
| 1597 | * @gfp_mask: flags for the page level allocator |
| 1598 | * @prot: protection mask for the allocated pages |
| 1599 | * @node: node to use for allocation or -1 |
| 1600 | * @caller: caller's return address |
| 1601 | * |
| 1602 | * Allocate enough pages to cover @size from the page level |
| 1603 | * allocator with @gfp_mask flags. Map them into contiguous |
| 1604 | * kernel virtual space, using a pagetable protection of @prot. |
| 1605 | */ |
| 1606 | void *__vmalloc_node_range(unsigned long size, unsigned long align, |
| 1607 | unsigned long start, unsigned long end, gfp_t gfp_mask, |
| 1608 | pgprot_t prot, int node, void *caller) |
Christoph Lameter | 930fc45 | 2005-10-29 18:15:41 -0700 | [diff] [blame] | 1609 | { |
David Rientjes | d0a2126 | 2011-01-13 15:46:02 -0800 | [diff] [blame] | 1610 | struct vm_struct *area; |
| 1611 | void *addr; |
| 1612 | unsigned long real_size = size; |
| 1613 | |
| 1614 | size = PAGE_ALIGN(size); |
| 1615 | if (!size || (size >> PAGE_SHIFT) > totalram_pages) |
| 1616 | return NULL; |
| 1617 | |
| 1618 | area = __get_vm_area_node(size, align, VM_ALLOC, start, end, node, |
| 1619 | gfp_mask, caller); |
| 1620 | |
| 1621 | if (!area) |
| 1622 | return NULL; |
| 1623 | |
| 1624 | addr = __vmalloc_area_node(area, gfp_mask, prot, node, caller); |
Catalin Marinas | 89219d3 | 2009-06-11 13:23:19 +0100 | [diff] [blame] | 1625 | |
| 1626 | /* |
| 1627 | * A ref_count = 3 is needed because the vm_struct and vmap_area |
| 1628 | * structures allocated in the __get_vm_area_node() function contain |
| 1629 | * references to the virtual address of the vmalloc'ed block. |
| 1630 | */ |
David Rientjes | d0a2126 | 2011-01-13 15:46:02 -0800 | [diff] [blame] | 1631 | kmemleak_alloc(addr, real_size, 3, gfp_mask); |
Catalin Marinas | 89219d3 | 2009-06-11 13:23:19 +0100 | [diff] [blame] | 1632 | |
| 1633 | return addr; |
Christoph Lameter | 930fc45 | 2005-10-29 18:15:41 -0700 | [diff] [blame] | 1634 | } |
| 1635 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1636 | /** |
Christoph Lameter | 930fc45 | 2005-10-29 18:15:41 -0700 | [diff] [blame] | 1637 | * __vmalloc_node - allocate virtually contiguous memory |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1638 | * @size: allocation size |
David Miller | 2dca699 | 2009-09-21 12:22:34 -0700 | [diff] [blame] | 1639 | * @align: desired alignment |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1640 | * @gfp_mask: flags for the page level allocator |
| 1641 | * @prot: protection mask for the allocated pages |
Randy Dunlap | d44e078 | 2005-11-07 01:01:10 -0800 | [diff] [blame] | 1642 | * @node: node to use for allocation or -1 |
Randy Dunlap | c85d194 | 2008-05-01 04:34:48 -0700 | [diff] [blame] | 1643 | * @caller: caller's return address |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1644 | * |
| 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. |
| 1648 | */ |
David Miller | 2dca699 | 2009-09-21 12:22:34 -0700 | [diff] [blame] | 1649 | static void *__vmalloc_node(unsigned long size, unsigned long align, |
| 1650 | gfp_t gfp_mask, pgprot_t prot, |
| 1651 | int node, void *caller) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1652 | { |
David Rientjes | d0a2126 | 2011-01-13 15:46:02 -0800 | [diff] [blame] | 1653 | return __vmalloc_node_range(size, align, VMALLOC_START, VMALLOC_END, |
| 1654 | gfp_mask, prot, node, caller); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1655 | } |
| 1656 | |
Christoph Lameter | 930fc45 | 2005-10-29 18:15:41 -0700 | [diff] [blame] | 1657 | void *__vmalloc(unsigned long size, gfp_t gfp_mask, pgprot_t prot) |
| 1658 | { |
David Miller | 2dca699 | 2009-09-21 12:22:34 -0700 | [diff] [blame] | 1659 | return __vmalloc_node(size, 1, gfp_mask, prot, -1, |
Christoph Lameter | 2301696 | 2008-04-28 02:12:42 -0700 | [diff] [blame] | 1660 | __builtin_return_address(0)); |
Christoph Lameter | 930fc45 | 2005-10-29 18:15:41 -0700 | [diff] [blame] | 1661 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1662 | EXPORT_SYMBOL(__vmalloc); |
| 1663 | |
Dave Young | e1ca778 | 2010-10-26 14:22:06 -0700 | [diff] [blame] | 1664 | static inline void *__vmalloc_node_flags(unsigned long size, |
| 1665 | int node, gfp_t flags) |
| 1666 | { |
| 1667 | return __vmalloc_node(size, 1, flags, PAGE_KERNEL, |
| 1668 | node, __builtin_return_address(0)); |
| 1669 | } |
| 1670 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1671 | /** |
| 1672 | * vmalloc - allocate virtually contiguous memory |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1673 | * @size: allocation size |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1674 | * Allocate enough pages to cover @size from the page level |
| 1675 | * allocator and map them into contiguous kernel virtual space. |
| 1676 | * |
Michael Opdenacker | c1c8897 | 2006-10-03 23:21:02 +0200 | [diff] [blame] | 1677 | * For tight control over page level allocator and protection flags |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1678 | * use __vmalloc() instead. |
| 1679 | */ |
| 1680 | void *vmalloc(unsigned long size) |
| 1681 | { |
Dave Young | e1ca778 | 2010-10-26 14:22:06 -0700 | [diff] [blame] | 1682 | return __vmalloc_node_flags(size, -1, GFP_KERNEL | __GFP_HIGHMEM); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1683 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1684 | EXPORT_SYMBOL(vmalloc); |
| 1685 | |
Christoph Lameter | 930fc45 | 2005-10-29 18:15:41 -0700 | [diff] [blame] | 1686 | /** |
Dave Young | e1ca778 | 2010-10-26 14:22:06 -0700 | [diff] [blame] | 1687 | * vzalloc - allocate virtually contiguous memory with zero fill |
| 1688 | * @size: allocation size |
| 1689 | * Allocate enough pages to cover @size from the page level |
| 1690 | * allocator and map them into contiguous kernel virtual space. |
| 1691 | * The memory allocated is set to zero. |
| 1692 | * |
| 1693 | * For tight control over page level allocator and protection flags |
| 1694 | * use __vmalloc() instead. |
| 1695 | */ |
| 1696 | void *vzalloc(unsigned long size) |
| 1697 | { |
| 1698 | return __vmalloc_node_flags(size, -1, |
| 1699 | GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO); |
| 1700 | } |
| 1701 | EXPORT_SYMBOL(vzalloc); |
| 1702 | |
| 1703 | /** |
Rolf Eike Beer | ead0408 | 2006-09-27 01:50:13 -0700 | [diff] [blame] | 1704 | * vmalloc_user - allocate zeroed virtually contiguous memory for userspace |
| 1705 | * @size: allocation size |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 1706 | * |
Rolf Eike Beer | ead0408 | 2006-09-27 01:50:13 -0700 | [diff] [blame] | 1707 | * The resulting memory area is zeroed so it can be mapped to userspace |
| 1708 | * without leaking data. |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 1709 | */ |
| 1710 | void *vmalloc_user(unsigned long size) |
| 1711 | { |
| 1712 | struct vm_struct *area; |
| 1713 | void *ret; |
| 1714 | |
David Miller | 2dca699 | 2009-09-21 12:22:34 -0700 | [diff] [blame] | 1715 | ret = __vmalloc_node(size, SHMLBA, |
| 1716 | GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO, |
Glauber Costa | 8487784 | 2009-01-06 14:39:19 -0800 | [diff] [blame] | 1717 | PAGE_KERNEL, -1, __builtin_return_address(0)); |
Eric Dumazet | 2b4ac44 | 2006-11-10 12:27:48 -0800 | [diff] [blame] | 1718 | if (ret) { |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1719 | area = find_vm_area(ret); |
Eric Dumazet | 2b4ac44 | 2006-11-10 12:27:48 -0800 | [diff] [blame] | 1720 | area->flags |= VM_USERMAP; |
Eric Dumazet | 2b4ac44 | 2006-11-10 12:27:48 -0800 | [diff] [blame] | 1721 | } |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 1722 | return ret; |
| 1723 | } |
| 1724 | EXPORT_SYMBOL(vmalloc_user); |
| 1725 | |
| 1726 | /** |
Christoph Lameter | 930fc45 | 2005-10-29 18:15:41 -0700 | [diff] [blame] | 1727 | * vmalloc_node - allocate memory on a specific node |
Christoph Lameter | 930fc45 | 2005-10-29 18:15:41 -0700 | [diff] [blame] | 1728 | * @size: allocation size |
Randy Dunlap | d44e078 | 2005-11-07 01:01:10 -0800 | [diff] [blame] | 1729 | * @node: numa node |
Christoph Lameter | 930fc45 | 2005-10-29 18:15:41 -0700 | [diff] [blame] | 1730 | * |
| 1731 | * Allocate enough pages to cover @size from the page level |
| 1732 | * allocator and map them into contiguous kernel virtual space. |
| 1733 | * |
Michael Opdenacker | c1c8897 | 2006-10-03 23:21:02 +0200 | [diff] [blame] | 1734 | * For tight control over page level allocator and protection flags |
Christoph Lameter | 930fc45 | 2005-10-29 18:15:41 -0700 | [diff] [blame] | 1735 | * use __vmalloc() instead. |
| 1736 | */ |
| 1737 | void *vmalloc_node(unsigned long size, int node) |
| 1738 | { |
David Miller | 2dca699 | 2009-09-21 12:22:34 -0700 | [diff] [blame] | 1739 | return __vmalloc_node(size, 1, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL, |
Christoph Lameter | 2301696 | 2008-04-28 02:12:42 -0700 | [diff] [blame] | 1740 | node, __builtin_return_address(0)); |
Christoph Lameter | 930fc45 | 2005-10-29 18:15:41 -0700 | [diff] [blame] | 1741 | } |
| 1742 | EXPORT_SYMBOL(vmalloc_node); |
| 1743 | |
Dave Young | e1ca778 | 2010-10-26 14:22:06 -0700 | [diff] [blame] | 1744 | /** |
| 1745 | * vzalloc_node - allocate memory on a specific node with zero fill |
| 1746 | * @size: allocation size |
| 1747 | * @node: numa node |
| 1748 | * |
| 1749 | * Allocate enough pages to cover @size from the page level |
| 1750 | * allocator and map them into contiguous kernel virtual space. |
| 1751 | * The memory allocated is set to zero. |
| 1752 | * |
| 1753 | * For tight control over page level allocator and protection flags |
| 1754 | * use __vmalloc_node() instead. |
| 1755 | */ |
| 1756 | void *vzalloc_node(unsigned long size, int node) |
| 1757 | { |
| 1758 | return __vmalloc_node_flags(size, node, |
| 1759 | GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO); |
| 1760 | } |
| 1761 | EXPORT_SYMBOL(vzalloc_node); |
| 1762 | |
Pavel Pisa | 4dc3b16 | 2005-05-01 08:59:25 -0700 | [diff] [blame] | 1763 | #ifndef PAGE_KERNEL_EXEC |
| 1764 | # define PAGE_KERNEL_EXEC PAGE_KERNEL |
| 1765 | #endif |
| 1766 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1767 | /** |
| 1768 | * vmalloc_exec - allocate virtually contiguous, executable memory |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1769 | * @size: allocation size |
| 1770 | * |
| 1771 | * Kernel-internal function to allocate enough pages to cover @size |
| 1772 | * the page level allocator and map them into contiguous and |
| 1773 | * executable kernel virtual space. |
| 1774 | * |
Michael Opdenacker | c1c8897 | 2006-10-03 23:21:02 +0200 | [diff] [blame] | 1775 | * For tight control over page level allocator and protection flags |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1776 | * use __vmalloc() instead. |
| 1777 | */ |
| 1778 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1779 | void *vmalloc_exec(unsigned long size) |
| 1780 | { |
David Miller | 2dca699 | 2009-09-21 12:22:34 -0700 | [diff] [blame] | 1781 | return __vmalloc_node(size, 1, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL_EXEC, |
Glauber Costa | 8487784 | 2009-01-06 14:39:19 -0800 | [diff] [blame] | 1782 | -1, __builtin_return_address(0)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1783 | } |
| 1784 | |
Andi Kleen | 0d08e0d | 2007-05-02 19:27:12 +0200 | [diff] [blame] | 1785 | #if defined(CONFIG_64BIT) && defined(CONFIG_ZONE_DMA32) |
Benjamin Herrenschmidt | 7ac674f | 2007-07-19 01:49:10 -0700 | [diff] [blame] | 1786 | #define GFP_VMALLOC32 GFP_DMA32 | GFP_KERNEL |
Andi Kleen | 0d08e0d | 2007-05-02 19:27:12 +0200 | [diff] [blame] | 1787 | #elif defined(CONFIG_64BIT) && defined(CONFIG_ZONE_DMA) |
Benjamin Herrenschmidt | 7ac674f | 2007-07-19 01:49:10 -0700 | [diff] [blame] | 1788 | #define GFP_VMALLOC32 GFP_DMA | GFP_KERNEL |
Andi Kleen | 0d08e0d | 2007-05-02 19:27:12 +0200 | [diff] [blame] | 1789 | #else |
| 1790 | #define GFP_VMALLOC32 GFP_KERNEL |
| 1791 | #endif |
| 1792 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1793 | /** |
| 1794 | * vmalloc_32 - allocate virtually contiguous memory (32bit addressable) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1795 | * @size: allocation size |
| 1796 | * |
| 1797 | * Allocate enough 32bit PA addressable pages to cover @size from the |
| 1798 | * page level allocator and map them into contiguous kernel virtual space. |
| 1799 | */ |
| 1800 | void *vmalloc_32(unsigned long size) |
| 1801 | { |
David Miller | 2dca699 | 2009-09-21 12:22:34 -0700 | [diff] [blame] | 1802 | return __vmalloc_node(size, 1, GFP_VMALLOC32, PAGE_KERNEL, |
Glauber Costa | 8487784 | 2009-01-06 14:39:19 -0800 | [diff] [blame] | 1803 | -1, __builtin_return_address(0)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1804 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1805 | EXPORT_SYMBOL(vmalloc_32); |
| 1806 | |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 1807 | /** |
Rolf Eike Beer | ead0408 | 2006-09-27 01:50:13 -0700 | [diff] [blame] | 1808 | * vmalloc_32_user - allocate zeroed virtually contiguous 32bit memory |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 1809 | * @size: allocation size |
Rolf Eike Beer | ead0408 | 2006-09-27 01:50:13 -0700 | [diff] [blame] | 1810 | * |
| 1811 | * The resulting memory area is 32bit addressable and zeroed so it can be |
| 1812 | * mapped to userspace without leaking data. |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 1813 | */ |
| 1814 | void *vmalloc_32_user(unsigned long size) |
| 1815 | { |
| 1816 | struct vm_struct *area; |
| 1817 | void *ret; |
| 1818 | |
David Miller | 2dca699 | 2009-09-21 12:22:34 -0700 | [diff] [blame] | 1819 | ret = __vmalloc_node(size, 1, GFP_VMALLOC32 | __GFP_ZERO, PAGE_KERNEL, |
Glauber Costa | 8487784 | 2009-01-06 14:39:19 -0800 | [diff] [blame] | 1820 | -1, __builtin_return_address(0)); |
Eric Dumazet | 2b4ac44 | 2006-11-10 12:27:48 -0800 | [diff] [blame] | 1821 | if (ret) { |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 1822 | area = find_vm_area(ret); |
Eric Dumazet | 2b4ac44 | 2006-11-10 12:27:48 -0800 | [diff] [blame] | 1823 | area->flags |= VM_USERMAP; |
Eric Dumazet | 2b4ac44 | 2006-11-10 12:27:48 -0800 | [diff] [blame] | 1824 | } |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 1825 | return ret; |
| 1826 | } |
| 1827 | EXPORT_SYMBOL(vmalloc_32_user); |
| 1828 | |
KAMEZAWA Hiroyuki | d0107eb | 2009-09-21 17:02:34 -0700 | [diff] [blame] | 1829 | /* |
| 1830 | * small helper routine , copy contents to buf from addr. |
| 1831 | * If the page is not present, fill zero. |
| 1832 | */ |
| 1833 | |
| 1834 | static int aligned_vread(char *buf, char *addr, unsigned long count) |
| 1835 | { |
| 1836 | struct page *p; |
| 1837 | int copied = 0; |
| 1838 | |
| 1839 | while (count) { |
| 1840 | unsigned long offset, length; |
| 1841 | |
| 1842 | offset = (unsigned long)addr & ~PAGE_MASK; |
| 1843 | length = PAGE_SIZE - offset; |
| 1844 | if (length > count) |
| 1845 | length = count; |
| 1846 | p = vmalloc_to_page(addr); |
| 1847 | /* |
| 1848 | * To do safe access to this _mapped_ area, we need |
| 1849 | * lock. But adding lock here means that we need to add |
| 1850 | * overhead of vmalloc()/vfree() calles for this _debug_ |
| 1851 | * interface, rarely used. Instead of that, we'll use |
| 1852 | * kmap() and get small overhead in this access function. |
| 1853 | */ |
| 1854 | if (p) { |
| 1855 | /* |
| 1856 | * we can expect USER0 is not used (see vread/vwrite's |
| 1857 | * function description) |
| 1858 | */ |
| 1859 | void *map = kmap_atomic(p, KM_USER0); |
| 1860 | memcpy(buf, map + offset, length); |
| 1861 | kunmap_atomic(map, KM_USER0); |
| 1862 | } else |
| 1863 | memset(buf, 0, length); |
| 1864 | |
| 1865 | addr += length; |
| 1866 | buf += length; |
| 1867 | copied += length; |
| 1868 | count -= length; |
| 1869 | } |
| 1870 | return copied; |
| 1871 | } |
| 1872 | |
| 1873 | static int aligned_vwrite(char *buf, char *addr, unsigned long count) |
| 1874 | { |
| 1875 | struct page *p; |
| 1876 | int copied = 0; |
| 1877 | |
| 1878 | while (count) { |
| 1879 | unsigned long offset, length; |
| 1880 | |
| 1881 | offset = (unsigned long)addr & ~PAGE_MASK; |
| 1882 | length = PAGE_SIZE - offset; |
| 1883 | if (length > count) |
| 1884 | length = count; |
| 1885 | p = vmalloc_to_page(addr); |
| 1886 | /* |
| 1887 | * To do safe access to this _mapped_ area, we need |
| 1888 | * lock. But adding lock here means that we need to add |
| 1889 | * overhead of vmalloc()/vfree() calles for this _debug_ |
| 1890 | * interface, rarely used. Instead of that, we'll use |
| 1891 | * kmap() and get small overhead in this access function. |
| 1892 | */ |
| 1893 | if (p) { |
| 1894 | /* |
| 1895 | * we can expect USER0 is not used (see vread/vwrite's |
| 1896 | * function description) |
| 1897 | */ |
| 1898 | void *map = kmap_atomic(p, KM_USER0); |
| 1899 | memcpy(map + offset, buf, length); |
| 1900 | kunmap_atomic(map, KM_USER0); |
| 1901 | } |
| 1902 | addr += length; |
| 1903 | buf += length; |
| 1904 | copied += length; |
| 1905 | count -= length; |
| 1906 | } |
| 1907 | return copied; |
| 1908 | } |
| 1909 | |
| 1910 | /** |
| 1911 | * vread() - read vmalloc area in a safe way. |
| 1912 | * @buf: buffer for reading data |
| 1913 | * @addr: vm address. |
| 1914 | * @count: number of bytes to be read. |
| 1915 | * |
| 1916 | * Returns # of bytes which addr and buf should be increased. |
| 1917 | * (same number to @count). Returns 0 if [addr...addr+count) doesn't |
| 1918 | * includes any intersect with alive vmalloc area. |
| 1919 | * |
| 1920 | * This function checks that addr is a valid vmalloc'ed area, and |
| 1921 | * copy data from that area to a given buffer. If the given memory range |
| 1922 | * of [addr...addr+count) includes some valid address, data is copied to |
| 1923 | * proper area of @buf. If there are memory holes, they'll be zero-filled. |
| 1924 | * IOREMAP area is treated as memory hole and no copy is done. |
| 1925 | * |
| 1926 | * If [addr...addr+count) doesn't includes any intersects with alive |
| 1927 | * vm_struct area, returns 0. |
| 1928 | * @buf should be kernel's buffer. Because this function uses KM_USER0, |
| 1929 | * the caller should guarantee KM_USER0 is not used. |
| 1930 | * |
| 1931 | * Note: In usual ops, vread() is never necessary because the caller |
| 1932 | * should know vmalloc() area is valid and can use memcpy(). |
| 1933 | * This is for routines which have to access vmalloc area without |
| 1934 | * any informaion, as /dev/kmem. |
| 1935 | * |
| 1936 | */ |
| 1937 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1938 | long vread(char *buf, char *addr, unsigned long count) |
| 1939 | { |
| 1940 | struct vm_struct *tmp; |
| 1941 | char *vaddr, *buf_start = buf; |
KAMEZAWA Hiroyuki | d0107eb | 2009-09-21 17:02:34 -0700 | [diff] [blame] | 1942 | unsigned long buflen = count; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1943 | unsigned long n; |
| 1944 | |
| 1945 | /* Don't allow overflow */ |
| 1946 | if ((unsigned long) addr + count < count) |
| 1947 | count = -(unsigned long) addr; |
| 1948 | |
| 1949 | read_lock(&vmlist_lock); |
KAMEZAWA Hiroyuki | d0107eb | 2009-09-21 17:02:34 -0700 | [diff] [blame] | 1950 | for (tmp = vmlist; count && tmp; tmp = tmp->next) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1951 | vaddr = (char *) tmp->addr; |
| 1952 | if (addr >= vaddr + tmp->size - PAGE_SIZE) |
| 1953 | continue; |
| 1954 | while (addr < vaddr) { |
| 1955 | if (count == 0) |
| 1956 | goto finished; |
| 1957 | *buf = '\0'; |
| 1958 | buf++; |
| 1959 | addr++; |
| 1960 | count--; |
| 1961 | } |
| 1962 | n = vaddr + tmp->size - PAGE_SIZE - addr; |
KAMEZAWA Hiroyuki | d0107eb | 2009-09-21 17:02:34 -0700 | [diff] [blame] | 1963 | if (n > count) |
| 1964 | n = count; |
| 1965 | if (!(tmp->flags & VM_IOREMAP)) |
| 1966 | aligned_vread(buf, addr, n); |
| 1967 | else /* IOREMAP area is treated as memory hole */ |
| 1968 | memset(buf, 0, n); |
| 1969 | buf += n; |
| 1970 | addr += n; |
| 1971 | count -= n; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1972 | } |
| 1973 | finished: |
| 1974 | read_unlock(&vmlist_lock); |
KAMEZAWA Hiroyuki | d0107eb | 2009-09-21 17:02:34 -0700 | [diff] [blame] | 1975 | |
| 1976 | if (buf == buf_start) |
| 1977 | return 0; |
| 1978 | /* zero-fill memory holes */ |
| 1979 | if (buf != buf_start + buflen) |
| 1980 | memset(buf, 0, buflen - (buf - buf_start)); |
| 1981 | |
| 1982 | return buflen; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1983 | } |
| 1984 | |
KAMEZAWA Hiroyuki | d0107eb | 2009-09-21 17:02:34 -0700 | [diff] [blame] | 1985 | /** |
| 1986 | * vwrite() - write vmalloc area in a safe way. |
| 1987 | * @buf: buffer for source data |
| 1988 | * @addr: vm address. |
| 1989 | * @count: number of bytes to be read. |
| 1990 | * |
| 1991 | * Returns # of bytes which addr and buf should be incresed. |
| 1992 | * (same number to @count). |
| 1993 | * If [addr...addr+count) doesn't includes any intersect with valid |
| 1994 | * vmalloc area, returns 0. |
| 1995 | * |
| 1996 | * This function checks that addr is a valid vmalloc'ed area, and |
| 1997 | * copy data from a buffer to the given addr. If specified range of |
| 1998 | * [addr...addr+count) includes some valid address, data is copied from |
| 1999 | * proper area of @buf. If there are memory holes, no copy to hole. |
| 2000 | * IOREMAP area is treated as memory hole and no copy is done. |
| 2001 | * |
| 2002 | * If [addr...addr+count) doesn't includes any intersects with alive |
| 2003 | * vm_struct area, returns 0. |
| 2004 | * @buf should be kernel's buffer. Because this function uses KM_USER0, |
| 2005 | * the caller should guarantee KM_USER0 is not used. |
| 2006 | * |
| 2007 | * Note: In usual ops, vwrite() is never necessary because the caller |
| 2008 | * should know vmalloc() area is valid and can use memcpy(). |
| 2009 | * This is for routines which have to access vmalloc area without |
| 2010 | * any informaion, as /dev/kmem. |
KAMEZAWA Hiroyuki | d0107eb | 2009-09-21 17:02:34 -0700 | [diff] [blame] | 2011 | */ |
| 2012 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2013 | long vwrite(char *buf, char *addr, unsigned long count) |
| 2014 | { |
| 2015 | struct vm_struct *tmp; |
KAMEZAWA Hiroyuki | d0107eb | 2009-09-21 17:02:34 -0700 | [diff] [blame] | 2016 | char *vaddr; |
| 2017 | unsigned long n, buflen; |
| 2018 | int copied = 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2019 | |
| 2020 | /* Don't allow overflow */ |
| 2021 | if ((unsigned long) addr + count < count) |
| 2022 | count = -(unsigned long) addr; |
KAMEZAWA Hiroyuki | d0107eb | 2009-09-21 17:02:34 -0700 | [diff] [blame] | 2023 | buflen = count; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2024 | |
| 2025 | read_lock(&vmlist_lock); |
KAMEZAWA Hiroyuki | d0107eb | 2009-09-21 17:02:34 -0700 | [diff] [blame] | 2026 | for (tmp = vmlist; count && tmp; tmp = tmp->next) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2027 | vaddr = (char *) tmp->addr; |
| 2028 | if (addr >= vaddr + tmp->size - PAGE_SIZE) |
| 2029 | continue; |
| 2030 | while (addr < vaddr) { |
| 2031 | if (count == 0) |
| 2032 | goto finished; |
| 2033 | buf++; |
| 2034 | addr++; |
| 2035 | count--; |
| 2036 | } |
| 2037 | n = vaddr + tmp->size - PAGE_SIZE - addr; |
KAMEZAWA Hiroyuki | d0107eb | 2009-09-21 17:02:34 -0700 | [diff] [blame] | 2038 | if (n > count) |
| 2039 | n = count; |
| 2040 | if (!(tmp->flags & VM_IOREMAP)) { |
| 2041 | aligned_vwrite(buf, addr, n); |
| 2042 | copied++; |
| 2043 | } |
| 2044 | buf += n; |
| 2045 | addr += n; |
| 2046 | count -= n; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2047 | } |
| 2048 | finished: |
| 2049 | read_unlock(&vmlist_lock); |
KAMEZAWA Hiroyuki | d0107eb | 2009-09-21 17:02:34 -0700 | [diff] [blame] | 2050 | if (!copied) |
| 2051 | return 0; |
| 2052 | return buflen; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2053 | } |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 2054 | |
| 2055 | /** |
| 2056 | * remap_vmalloc_range - map vmalloc pages to userspace |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 2057 | * @vma: vma to cover (map full range of vma) |
| 2058 | * @addr: vmalloc memory |
| 2059 | * @pgoff: number of pages into addr before first page to map |
Randy Dunlap | 7682486 | 2008-03-19 17:00:40 -0700 | [diff] [blame] | 2060 | * |
| 2061 | * Returns: 0 for success, -Exxx on failure |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 2062 | * |
| 2063 | * This function checks that addr is a valid vmalloc'ed area, and |
| 2064 | * that it is big enough to cover the vma. Will return failure if |
| 2065 | * that criteria isn't met. |
| 2066 | * |
Robert P. J. Day | 72fd4a3 | 2007-02-10 01:45:59 -0800 | [diff] [blame] | 2067 | * Similar to remap_pfn_range() (see mm/memory.c) |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 2068 | */ |
| 2069 | int remap_vmalloc_range(struct vm_area_struct *vma, void *addr, |
| 2070 | unsigned long pgoff) |
| 2071 | { |
| 2072 | struct vm_struct *area; |
| 2073 | unsigned long uaddr = vma->vm_start; |
| 2074 | unsigned long usize = vma->vm_end - vma->vm_start; |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 2075 | |
| 2076 | if ((PAGE_SIZE-1) & (unsigned long)addr) |
| 2077 | return -EINVAL; |
| 2078 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 2079 | area = find_vm_area(addr); |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 2080 | if (!area) |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 2081 | return -EINVAL; |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 2082 | |
| 2083 | if (!(area->flags & VM_USERMAP)) |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 2084 | return -EINVAL; |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 2085 | |
| 2086 | if (usize + (pgoff << PAGE_SHIFT) > area->size - PAGE_SIZE) |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 2087 | return -EINVAL; |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 2088 | |
| 2089 | addr += pgoff << PAGE_SHIFT; |
| 2090 | do { |
| 2091 | struct page *page = vmalloc_to_page(addr); |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 2092 | int ret; |
| 2093 | |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 2094 | ret = vm_insert_page(vma, uaddr, page); |
| 2095 | if (ret) |
| 2096 | return ret; |
| 2097 | |
| 2098 | uaddr += PAGE_SIZE; |
| 2099 | addr += PAGE_SIZE; |
| 2100 | usize -= PAGE_SIZE; |
| 2101 | } while (usize > 0); |
| 2102 | |
| 2103 | /* Prevent "things" like memory migration? VM_flags need a cleanup... */ |
| 2104 | vma->vm_flags |= VM_RESERVED; |
| 2105 | |
Nick Piggin | db64fe0 | 2008-10-18 20:27:03 -0700 | [diff] [blame] | 2106 | return 0; |
Nick Piggin | 8334231 | 2006-06-23 02:03:20 -0700 | [diff] [blame] | 2107 | } |
| 2108 | EXPORT_SYMBOL(remap_vmalloc_range); |
| 2109 | |
Christoph Hellwig | 1eeb66a | 2007-05-08 00:27:03 -0700 | [diff] [blame] | 2110 | /* |
| 2111 | * Implement a stub for vmalloc_sync_all() if the architecture chose not to |
| 2112 | * have one. |
| 2113 | */ |
| 2114 | void __attribute__((weak)) vmalloc_sync_all(void) |
| 2115 | { |
| 2116 | } |
Jeremy Fitzhardinge | 5f4352f | 2007-07-17 18:37:04 -0700 | [diff] [blame] | 2117 | |
| 2118 | |
Martin Schwidefsky | 2f569af | 2008-02-08 04:22:04 -0800 | [diff] [blame] | 2119 | static int f(pte_t *pte, pgtable_t table, unsigned long addr, void *data) |
Jeremy Fitzhardinge | 5f4352f | 2007-07-17 18:37:04 -0700 | [diff] [blame] | 2120 | { |
| 2121 | /* apply_to_page_range() does all the hard work. */ |
| 2122 | return 0; |
| 2123 | } |
| 2124 | |
| 2125 | /** |
| 2126 | * alloc_vm_area - allocate a range of kernel address space |
| 2127 | * @size: size of the area |
Randy Dunlap | 7682486 | 2008-03-19 17:00:40 -0700 | [diff] [blame] | 2128 | * |
| 2129 | * Returns: NULL on failure, vm_struct on success |
Jeremy Fitzhardinge | 5f4352f | 2007-07-17 18:37:04 -0700 | [diff] [blame] | 2130 | * |
| 2131 | * This function reserves a range of kernel address space, and |
| 2132 | * allocates pagetables to map that range. No actual mappings |
| 2133 | * are created. If the kernel address space is not shared |
| 2134 | * between processes, it syncs the pagetable across all |
| 2135 | * processes. |
| 2136 | */ |
| 2137 | struct vm_struct *alloc_vm_area(size_t size) |
| 2138 | { |
| 2139 | struct vm_struct *area; |
| 2140 | |
Christoph Lameter | 2301696 | 2008-04-28 02:12:42 -0700 | [diff] [blame] | 2141 | area = get_vm_area_caller(size, VM_IOREMAP, |
| 2142 | __builtin_return_address(0)); |
Jeremy Fitzhardinge | 5f4352f | 2007-07-17 18:37:04 -0700 | [diff] [blame] | 2143 | if (area == NULL) |
| 2144 | return NULL; |
| 2145 | |
| 2146 | /* |
| 2147 | * This ensures that page tables are constructed for this region |
| 2148 | * of kernel virtual address space and mapped into init_mm. |
| 2149 | */ |
| 2150 | if (apply_to_page_range(&init_mm, (unsigned long)area->addr, |
| 2151 | area->size, f, NULL)) { |
| 2152 | free_vm_area(area); |
| 2153 | return NULL; |
| 2154 | } |
| 2155 | |
| 2156 | /* Make sure the pagetables are constructed in process kernel |
| 2157 | mappings */ |
| 2158 | vmalloc_sync_all(); |
| 2159 | |
| 2160 | return area; |
| 2161 | } |
| 2162 | EXPORT_SYMBOL_GPL(alloc_vm_area); |
| 2163 | |
| 2164 | void free_vm_area(struct vm_struct *area) |
| 2165 | { |
| 2166 | struct vm_struct *ret; |
| 2167 | ret = remove_vm_area(area->addr); |
| 2168 | BUG_ON(ret != area); |
| 2169 | kfree(area); |
| 2170 | } |
| 2171 | EXPORT_SYMBOL_GPL(free_vm_area); |
Christoph Lameter | a10aa57 | 2008-04-28 02:12:40 -0700 | [diff] [blame] | 2172 | |
Tejun Heo | 4f8b02b | 2010-09-03 18:22:47 +0200 | [diff] [blame] | 2173 | #ifdef CONFIG_SMP |
Tejun Heo | ca23e40 | 2009-08-14 15:00:52 +0900 | [diff] [blame] | 2174 | static struct vmap_area *node_to_va(struct rb_node *n) |
| 2175 | { |
| 2176 | return n ? rb_entry(n, struct vmap_area, rb_node) : NULL; |
| 2177 | } |
| 2178 | |
| 2179 | /** |
| 2180 | * pvm_find_next_prev - find the next and prev vmap_area surrounding @end |
| 2181 | * @end: target address |
| 2182 | * @pnext: out arg for the next vmap_area |
| 2183 | * @pprev: out arg for the previous vmap_area |
| 2184 | * |
| 2185 | * Returns: %true if either or both of next and prev are found, |
| 2186 | * %false if no vmap_area exists |
| 2187 | * |
| 2188 | * Find vmap_areas end addresses of which enclose @end. ie. if not |
| 2189 | * NULL, *pnext->va_end > @end and *pprev->va_end <= @end. |
| 2190 | */ |
| 2191 | static bool pvm_find_next_prev(unsigned long end, |
| 2192 | struct vmap_area **pnext, |
| 2193 | struct vmap_area **pprev) |
| 2194 | { |
| 2195 | struct rb_node *n = vmap_area_root.rb_node; |
| 2196 | struct vmap_area *va = NULL; |
| 2197 | |
| 2198 | while (n) { |
| 2199 | va = rb_entry(n, struct vmap_area, rb_node); |
| 2200 | if (end < va->va_end) |
| 2201 | n = n->rb_left; |
| 2202 | else if (end > va->va_end) |
| 2203 | n = n->rb_right; |
| 2204 | else |
| 2205 | break; |
| 2206 | } |
| 2207 | |
| 2208 | if (!va) |
| 2209 | return false; |
| 2210 | |
| 2211 | if (va->va_end > end) { |
| 2212 | *pnext = va; |
| 2213 | *pprev = node_to_va(rb_prev(&(*pnext)->rb_node)); |
| 2214 | } else { |
| 2215 | *pprev = va; |
| 2216 | *pnext = node_to_va(rb_next(&(*pprev)->rb_node)); |
| 2217 | } |
| 2218 | return true; |
| 2219 | } |
| 2220 | |
| 2221 | /** |
| 2222 | * pvm_determine_end - find the highest aligned address between two vmap_areas |
| 2223 | * @pnext: in/out arg for the next vmap_area |
| 2224 | * @pprev: in/out arg for the previous vmap_area |
| 2225 | * @align: alignment |
| 2226 | * |
| 2227 | * Returns: determined end address |
| 2228 | * |
| 2229 | * Find the highest aligned address between *@pnext and *@pprev below |
| 2230 | * VMALLOC_END. *@pnext and *@pprev are adjusted so that the aligned |
| 2231 | * down address is between the end addresses of the two vmap_areas. |
| 2232 | * |
| 2233 | * Please note that the address returned by this function may fall |
| 2234 | * inside *@pnext vmap_area. The caller is responsible for checking |
| 2235 | * that. |
| 2236 | */ |
| 2237 | static unsigned long pvm_determine_end(struct vmap_area **pnext, |
| 2238 | struct vmap_area **pprev, |
| 2239 | unsigned long align) |
| 2240 | { |
| 2241 | const unsigned long vmalloc_end = VMALLOC_END & ~(align - 1); |
| 2242 | unsigned long addr; |
| 2243 | |
| 2244 | if (*pnext) |
| 2245 | addr = min((*pnext)->va_start & ~(align - 1), vmalloc_end); |
| 2246 | else |
| 2247 | addr = vmalloc_end; |
| 2248 | |
| 2249 | while (*pprev && (*pprev)->va_end > addr) { |
| 2250 | *pnext = *pprev; |
| 2251 | *pprev = node_to_va(rb_prev(&(*pnext)->rb_node)); |
| 2252 | } |
| 2253 | |
| 2254 | return addr; |
| 2255 | } |
| 2256 | |
| 2257 | /** |
| 2258 | * pcpu_get_vm_areas - allocate vmalloc areas for percpu allocator |
| 2259 | * @offsets: array containing offset of each area |
| 2260 | * @sizes: array containing size of each area |
| 2261 | * @nr_vms: the number of areas to allocate |
| 2262 | * @align: alignment, all entries in @offsets and @sizes must be aligned to this |
Tejun Heo | ca23e40 | 2009-08-14 15:00:52 +0900 | [diff] [blame] | 2263 | * |
| 2264 | * Returns: kmalloc'd vm_struct pointer array pointing to allocated |
| 2265 | * vm_structs on success, %NULL on failure |
| 2266 | * |
| 2267 | * Percpu allocator wants to use congruent vm areas so that it can |
| 2268 | * maintain the offsets among percpu areas. This function allocates |
David Rientjes | ec3f64f | 2011-01-13 15:46:01 -0800 | [diff] [blame] | 2269 | * congruent vmalloc areas for it with GFP_KERNEL. These areas tend to |
| 2270 | * be scattered pretty far, distance between two areas easily going up |
| 2271 | * to gigabytes. To avoid interacting with regular vmallocs, these |
| 2272 | * areas are allocated from top. |
Tejun Heo | ca23e40 | 2009-08-14 15:00:52 +0900 | [diff] [blame] | 2273 | * |
| 2274 | * Despite its complicated look, this allocator is rather simple. It |
| 2275 | * does everything top-down and scans areas from the end looking for |
| 2276 | * matching slot. While scanning, if any of the areas overlaps with |
| 2277 | * existing vmap_area, the base address is pulled down to fit the |
| 2278 | * area. Scanning is repeated till all the areas fit and then all |
| 2279 | * necessary data structres are inserted and the result is returned. |
| 2280 | */ |
| 2281 | struct vm_struct **pcpu_get_vm_areas(const unsigned long *offsets, |
| 2282 | const size_t *sizes, int nr_vms, |
David Rientjes | ec3f64f | 2011-01-13 15:46:01 -0800 | [diff] [blame] | 2283 | size_t align) |
Tejun Heo | ca23e40 | 2009-08-14 15:00:52 +0900 | [diff] [blame] | 2284 | { |
| 2285 | const unsigned long vmalloc_start = ALIGN(VMALLOC_START, align); |
| 2286 | const unsigned long vmalloc_end = VMALLOC_END & ~(align - 1); |
| 2287 | struct vmap_area **vas, *prev, *next; |
| 2288 | struct vm_struct **vms; |
| 2289 | int area, area2, last_area, term_area; |
| 2290 | unsigned long base, start, end, last_end; |
| 2291 | bool purged = false; |
| 2292 | |
Tejun Heo | ca23e40 | 2009-08-14 15:00:52 +0900 | [diff] [blame] | 2293 | /* verify parameters and allocate data structures */ |
| 2294 | BUG_ON(align & ~PAGE_MASK || !is_power_of_2(align)); |
| 2295 | for (last_area = 0, area = 0; area < nr_vms; area++) { |
| 2296 | start = offsets[area]; |
| 2297 | end = start + sizes[area]; |
| 2298 | |
| 2299 | /* is everything aligned properly? */ |
| 2300 | BUG_ON(!IS_ALIGNED(offsets[area], align)); |
| 2301 | BUG_ON(!IS_ALIGNED(sizes[area], align)); |
| 2302 | |
| 2303 | /* detect the area with the highest address */ |
| 2304 | if (start > offsets[last_area]) |
| 2305 | last_area = area; |
| 2306 | |
| 2307 | for (area2 = 0; area2 < nr_vms; area2++) { |
| 2308 | unsigned long start2 = offsets[area2]; |
| 2309 | unsigned long end2 = start2 + sizes[area2]; |
| 2310 | |
| 2311 | if (area2 == area) |
| 2312 | continue; |
| 2313 | |
| 2314 | BUG_ON(start2 >= start && start2 < end); |
| 2315 | BUG_ON(end2 <= end && end2 > start); |
| 2316 | } |
| 2317 | } |
| 2318 | last_end = offsets[last_area] + sizes[last_area]; |
| 2319 | |
| 2320 | if (vmalloc_end - vmalloc_start < last_end) { |
| 2321 | WARN_ON(true); |
| 2322 | return NULL; |
| 2323 | } |
| 2324 | |
David Rientjes | ec3f64f | 2011-01-13 15:46:01 -0800 | [diff] [blame] | 2325 | vms = kzalloc(sizeof(vms[0]) * nr_vms, GFP_KERNEL); |
| 2326 | vas = kzalloc(sizeof(vas[0]) * nr_vms, GFP_KERNEL); |
Tejun Heo | ca23e40 | 2009-08-14 15:00:52 +0900 | [diff] [blame] | 2327 | if (!vas || !vms) |
| 2328 | goto err_free; |
| 2329 | |
| 2330 | for (area = 0; area < nr_vms; area++) { |
David Rientjes | ec3f64f | 2011-01-13 15:46:01 -0800 | [diff] [blame] | 2331 | vas[area] = kzalloc(sizeof(struct vmap_area), GFP_KERNEL); |
| 2332 | vms[area] = kzalloc(sizeof(struct vm_struct), GFP_KERNEL); |
Tejun Heo | ca23e40 | 2009-08-14 15:00:52 +0900 | [diff] [blame] | 2333 | if (!vas[area] || !vms[area]) |
| 2334 | goto err_free; |
| 2335 | } |
| 2336 | retry: |
| 2337 | spin_lock(&vmap_area_lock); |
| 2338 | |
| 2339 | /* start scanning - we scan from the top, begin with the last area */ |
| 2340 | area = term_area = last_area; |
| 2341 | start = offsets[area]; |
| 2342 | end = start + sizes[area]; |
| 2343 | |
| 2344 | if (!pvm_find_next_prev(vmap_area_pcpu_hole, &next, &prev)) { |
| 2345 | base = vmalloc_end - last_end; |
| 2346 | goto found; |
| 2347 | } |
| 2348 | base = pvm_determine_end(&next, &prev, align) - end; |
| 2349 | |
| 2350 | while (true) { |
| 2351 | BUG_ON(next && next->va_end <= base + end); |
| 2352 | BUG_ON(prev && prev->va_end > base + end); |
| 2353 | |
| 2354 | /* |
| 2355 | * base might have underflowed, add last_end before |
| 2356 | * comparing. |
| 2357 | */ |
| 2358 | if (base + last_end < vmalloc_start + last_end) { |
| 2359 | spin_unlock(&vmap_area_lock); |
| 2360 | if (!purged) { |
| 2361 | purge_vmap_area_lazy(); |
| 2362 | purged = true; |
| 2363 | goto retry; |
| 2364 | } |
| 2365 | goto err_free; |
| 2366 | } |
| 2367 | |
| 2368 | /* |
| 2369 | * If next overlaps, move base downwards so that it's |
| 2370 | * right below next and then recheck. |
| 2371 | */ |
| 2372 | if (next && next->va_start < base + end) { |
| 2373 | base = pvm_determine_end(&next, &prev, align) - end; |
| 2374 | term_area = area; |
| 2375 | continue; |
| 2376 | } |
| 2377 | |
| 2378 | /* |
| 2379 | * If prev overlaps, shift down next and prev and move |
| 2380 | * base so that it's right below new next and then |
| 2381 | * recheck. |
| 2382 | */ |
| 2383 | if (prev && prev->va_end > base + start) { |
| 2384 | next = prev; |
| 2385 | prev = node_to_va(rb_prev(&next->rb_node)); |
| 2386 | base = pvm_determine_end(&next, &prev, align) - end; |
| 2387 | term_area = area; |
| 2388 | continue; |
| 2389 | } |
| 2390 | |
| 2391 | /* |
| 2392 | * This area fits, move on to the previous one. If |
| 2393 | * the previous one is the terminal one, we're done. |
| 2394 | */ |
| 2395 | area = (area + nr_vms - 1) % nr_vms; |
| 2396 | if (area == term_area) |
| 2397 | break; |
| 2398 | start = offsets[area]; |
| 2399 | end = start + sizes[area]; |
| 2400 | pvm_find_next_prev(base + end, &next, &prev); |
| 2401 | } |
| 2402 | found: |
| 2403 | /* we've found a fitting base, insert all va's */ |
| 2404 | for (area = 0; area < nr_vms; area++) { |
| 2405 | struct vmap_area *va = vas[area]; |
| 2406 | |
| 2407 | va->va_start = base + offsets[area]; |
| 2408 | va->va_end = va->va_start + sizes[area]; |
| 2409 | __insert_vmap_area(va); |
| 2410 | } |
| 2411 | |
| 2412 | vmap_area_pcpu_hole = base + offsets[last_area]; |
| 2413 | |
| 2414 | spin_unlock(&vmap_area_lock); |
| 2415 | |
| 2416 | /* insert all vm's */ |
| 2417 | for (area = 0; area < nr_vms; area++) |
| 2418 | insert_vmalloc_vm(vms[area], vas[area], VM_ALLOC, |
| 2419 | pcpu_get_vm_areas); |
| 2420 | |
| 2421 | kfree(vas); |
| 2422 | return vms; |
| 2423 | |
| 2424 | err_free: |
| 2425 | for (area = 0; area < nr_vms; area++) { |
| 2426 | if (vas) |
| 2427 | kfree(vas[area]); |
| 2428 | if (vms) |
| 2429 | kfree(vms[area]); |
| 2430 | } |
| 2431 | kfree(vas); |
| 2432 | kfree(vms); |
| 2433 | return NULL; |
| 2434 | } |
| 2435 | |
| 2436 | /** |
| 2437 | * pcpu_free_vm_areas - free vmalloc areas for percpu allocator |
| 2438 | * @vms: vm_struct pointer array returned by pcpu_get_vm_areas() |
| 2439 | * @nr_vms: the number of allocated areas |
| 2440 | * |
| 2441 | * Free vm_structs and the array allocated by pcpu_get_vm_areas(). |
| 2442 | */ |
| 2443 | void pcpu_free_vm_areas(struct vm_struct **vms, int nr_vms) |
| 2444 | { |
| 2445 | int i; |
| 2446 | |
| 2447 | for (i = 0; i < nr_vms; i++) |
| 2448 | free_vm_area(vms[i]); |
| 2449 | kfree(vms); |
| 2450 | } |
Tejun Heo | 4f8b02b | 2010-09-03 18:22:47 +0200 | [diff] [blame] | 2451 | #endif /* CONFIG_SMP */ |
Christoph Lameter | a10aa57 | 2008-04-28 02:12:40 -0700 | [diff] [blame] | 2452 | |
| 2453 | #ifdef CONFIG_PROC_FS |
| 2454 | static void *s_start(struct seq_file *m, loff_t *pos) |
Namhyung Kim | e199b5d | 2010-10-26 14:22:03 -0700 | [diff] [blame] | 2455 | __acquires(&vmlist_lock) |
Christoph Lameter | a10aa57 | 2008-04-28 02:12:40 -0700 | [diff] [blame] | 2456 | { |
| 2457 | loff_t n = *pos; |
| 2458 | struct vm_struct *v; |
| 2459 | |
| 2460 | read_lock(&vmlist_lock); |
| 2461 | v = vmlist; |
| 2462 | while (n > 0 && v) { |
| 2463 | n--; |
| 2464 | v = v->next; |
| 2465 | } |
| 2466 | if (!n) |
| 2467 | return v; |
| 2468 | |
| 2469 | return NULL; |
| 2470 | |
| 2471 | } |
| 2472 | |
| 2473 | static void *s_next(struct seq_file *m, void *p, loff_t *pos) |
| 2474 | { |
| 2475 | struct vm_struct *v = p; |
| 2476 | |
| 2477 | ++*pos; |
| 2478 | return v->next; |
| 2479 | } |
| 2480 | |
| 2481 | static void s_stop(struct seq_file *m, void *p) |
Namhyung Kim | e199b5d | 2010-10-26 14:22:03 -0700 | [diff] [blame] | 2482 | __releases(&vmlist_lock) |
Christoph Lameter | a10aa57 | 2008-04-28 02:12:40 -0700 | [diff] [blame] | 2483 | { |
| 2484 | read_unlock(&vmlist_lock); |
| 2485 | } |
| 2486 | |
Eric Dumazet | a47a126 | 2008-07-23 21:27:38 -0700 | [diff] [blame] | 2487 | static void show_numa_info(struct seq_file *m, struct vm_struct *v) |
| 2488 | { |
| 2489 | if (NUMA_BUILD) { |
| 2490 | unsigned int nr, *counters = m->private; |
| 2491 | |
| 2492 | if (!counters) |
| 2493 | return; |
| 2494 | |
| 2495 | memset(counters, 0, nr_node_ids * sizeof(unsigned int)); |
| 2496 | |
| 2497 | for (nr = 0; nr < v->nr_pages; nr++) |
| 2498 | counters[page_to_nid(v->pages[nr])]++; |
| 2499 | |
| 2500 | for_each_node_state(nr, N_HIGH_MEMORY) |
| 2501 | if (counters[nr]) |
| 2502 | seq_printf(m, " N%u=%u", nr, counters[nr]); |
| 2503 | } |
| 2504 | } |
| 2505 | |
Christoph Lameter | a10aa57 | 2008-04-28 02:12:40 -0700 | [diff] [blame] | 2506 | static int s_show(struct seq_file *m, void *p) |
| 2507 | { |
| 2508 | struct vm_struct *v = p; |
| 2509 | |
| 2510 | seq_printf(m, "0x%p-0x%p %7ld", |
| 2511 | v->addr, v->addr + v->size, v->size); |
| 2512 | |
Joe Perches | 62c70bc | 2011-01-13 15:45:52 -0800 | [diff] [blame] | 2513 | if (v->caller) |
| 2514 | seq_printf(m, " %pS", v->caller); |
Christoph Lameter | 2301696 | 2008-04-28 02:12:42 -0700 | [diff] [blame] | 2515 | |
Christoph Lameter | a10aa57 | 2008-04-28 02:12:40 -0700 | [diff] [blame] | 2516 | if (v->nr_pages) |
| 2517 | seq_printf(m, " pages=%d", v->nr_pages); |
| 2518 | |
| 2519 | if (v->phys_addr) |
Kenji Kaneshige | ffa71f3 | 2010-06-18 12:22:40 +0900 | [diff] [blame] | 2520 | seq_printf(m, " phys=%llx", (unsigned long long)v->phys_addr); |
Christoph Lameter | a10aa57 | 2008-04-28 02:12:40 -0700 | [diff] [blame] | 2521 | |
| 2522 | if (v->flags & VM_IOREMAP) |
| 2523 | seq_printf(m, " ioremap"); |
| 2524 | |
| 2525 | if (v->flags & VM_ALLOC) |
| 2526 | seq_printf(m, " vmalloc"); |
| 2527 | |
| 2528 | if (v->flags & VM_MAP) |
| 2529 | seq_printf(m, " vmap"); |
| 2530 | |
| 2531 | if (v->flags & VM_USERMAP) |
| 2532 | seq_printf(m, " user"); |
| 2533 | |
| 2534 | if (v->flags & VM_VPAGES) |
| 2535 | seq_printf(m, " vpages"); |
| 2536 | |
Eric Dumazet | a47a126 | 2008-07-23 21:27:38 -0700 | [diff] [blame] | 2537 | show_numa_info(m, v); |
Christoph Lameter | a10aa57 | 2008-04-28 02:12:40 -0700 | [diff] [blame] | 2538 | seq_putc(m, '\n'); |
| 2539 | return 0; |
| 2540 | } |
| 2541 | |
Alexey Dobriyan | 5f6a6a9 | 2008-10-06 03:50:47 +0400 | [diff] [blame] | 2542 | static const struct seq_operations vmalloc_op = { |
Christoph Lameter | a10aa57 | 2008-04-28 02:12:40 -0700 | [diff] [blame] | 2543 | .start = s_start, |
| 2544 | .next = s_next, |
| 2545 | .stop = s_stop, |
| 2546 | .show = s_show, |
| 2547 | }; |
Alexey Dobriyan | 5f6a6a9 | 2008-10-06 03:50:47 +0400 | [diff] [blame] | 2548 | |
| 2549 | static int vmalloc_open(struct inode *inode, struct file *file) |
| 2550 | { |
| 2551 | unsigned int *ptr = NULL; |
| 2552 | int ret; |
| 2553 | |
Kulikov Vasiliy | 51980ac | 2010-08-09 17:19:58 -0700 | [diff] [blame] | 2554 | if (NUMA_BUILD) { |
Alexey Dobriyan | 5f6a6a9 | 2008-10-06 03:50:47 +0400 | [diff] [blame] | 2555 | ptr = kmalloc(nr_node_ids * sizeof(unsigned int), GFP_KERNEL); |
Kulikov Vasiliy | 51980ac | 2010-08-09 17:19:58 -0700 | [diff] [blame] | 2556 | if (ptr == NULL) |
| 2557 | return -ENOMEM; |
| 2558 | } |
Alexey Dobriyan | 5f6a6a9 | 2008-10-06 03:50:47 +0400 | [diff] [blame] | 2559 | ret = seq_open(file, &vmalloc_op); |
| 2560 | if (!ret) { |
| 2561 | struct seq_file *m = file->private_data; |
| 2562 | m->private = ptr; |
| 2563 | } else |
| 2564 | kfree(ptr); |
| 2565 | return ret; |
| 2566 | } |
| 2567 | |
| 2568 | static const struct file_operations proc_vmalloc_operations = { |
| 2569 | .open = vmalloc_open, |
| 2570 | .read = seq_read, |
| 2571 | .llseek = seq_lseek, |
| 2572 | .release = seq_release_private, |
| 2573 | }; |
| 2574 | |
| 2575 | static int __init proc_vmalloc_init(void) |
| 2576 | { |
| 2577 | proc_create("vmallocinfo", S_IRUSR, NULL, &proc_vmalloc_operations); |
| 2578 | return 0; |
| 2579 | } |
| 2580 | module_init(proc_vmalloc_init); |
Christoph Lameter | a10aa57 | 2008-04-28 02:12:40 -0700 | [diff] [blame] | 2581 | #endif |
| 2582 | |