blob: 7ef0903058eeb110246b350aa02154257a3202b6 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
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 Lameter930fc452005-10-29 18:15:41 -07008 * Numa awareness, Christoph Lameter, SGI, June 2005
Linus Torvalds1da177e2005-04-16 15:20:36 -07009 */
10
Nick Piggindb64fe02008-10-18 20:27:03 -070011#include <linux/vmalloc.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070012#include <linux/mm.h>
13#include <linux/module.h>
14#include <linux/highmem.h>
Alexey Dobriyand43c36d2009-10-07 17:09:06 +040015#include <linux/sched.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070016#include <linux/slab.h>
17#include <linux/spinlock.h>
18#include <linux/interrupt.h>
Alexey Dobriyan5f6a6a92008-10-06 03:50:47 +040019#include <linux/proc_fs.h>
Christoph Lametera10aa572008-04-28 02:12:40 -070020#include <linux/seq_file.h>
Thomas Gleixner3ac7fe52008-04-30 00:55:01 -070021#include <linux/debugobjects.h>
Christoph Lameter23016962008-04-28 02:12:42 -070022#include <linux/kallsyms.h>
Nick Piggindb64fe02008-10-18 20:27:03 -070023#include <linux/list.h>
24#include <linux/rbtree.h>
25#include <linux/radix-tree.h>
26#include <linux/rcupdate.h>
Tejun Heof0aa6612009-02-20 16:29:08 +090027#include <linux/pfn.h>
Catalin Marinas89219d32009-06-11 13:23:19 +010028#include <linux/kmemleak.h>
Arun Sharma60063492011-07-26 16:09:06 -070029#include <linux/atomic.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070030#include <asm/uaccess.h>
31#include <asm/tlbflush.h>
David Miller2dca6992009-09-21 12:22:34 -070032#include <asm/shmparam.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070033
Nick Piggindb64fe02008-10-18 20:27:03 -070034/*** Page table manipulation functions ***/
Adrian Bunkb2213852006-09-25 23:31:02 -070035
Linus Torvalds1da177e2005-04-16 15:20:36 -070036static 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 Piggindb64fe02008-10-18 20:27:03 -070047static void vunmap_pmd_range(pud_t *pud, unsigned long addr, unsigned long end)
Linus Torvalds1da177e2005-04-16 15:20:36 -070048{
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 Piggindb64fe02008-10-18 20:27:03 -070061static void vunmap_pud_range(pgd_t *pgd, unsigned long addr, unsigned long end)
Linus Torvalds1da177e2005-04-16 15:20:36 -070062{
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 Piggindb64fe02008-10-18 20:27:03 -070075static void vunmap_page_range(unsigned long addr, unsigned long end)
Linus Torvalds1da177e2005-04-16 15:20:36 -070076{
77 pgd_t *pgd;
78 unsigned long next;
Linus Torvalds1da177e2005-04-16 15:20:36 -070079
80 BUG_ON(addr >= end);
81 pgd = pgd_offset_k(addr);
Linus Torvalds1da177e2005-04-16 15:20:36 -070082 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 Torvalds1da177e2005-04-16 15:20:36 -070088}
89
90static int vmap_pte_range(pmd_t *pmd, unsigned long addr,
Nick Piggindb64fe02008-10-18 20:27:03 -070091 unsigned long end, pgprot_t prot, struct page **pages, int *nr)
Linus Torvalds1da177e2005-04-16 15:20:36 -070092{
93 pte_t *pte;
94
Nick Piggindb64fe02008-10-18 20:27:03 -070095 /*
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 Dickins872fec12005-10-29 18:16:21 -0700100 pte = pte_alloc_kernel(pmd, addr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700101 if (!pte)
102 return -ENOMEM;
103 do {
Nick Piggindb64fe02008-10-18 20:27:03 -0700104 struct page *page = pages[*nr];
105
106 if (WARN_ON(!pte_none(*pte)))
107 return -EBUSY;
108 if (WARN_ON(!page))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700109 return -ENOMEM;
110 set_pte_at(&init_mm, addr, pte, mk_pte(page, prot));
Nick Piggindb64fe02008-10-18 20:27:03 -0700111 (*nr)++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700112 } while (pte++, addr += PAGE_SIZE, addr != end);
113 return 0;
114}
115
Nick Piggindb64fe02008-10-18 20:27:03 -0700116static int vmap_pmd_range(pud_t *pud, unsigned long addr,
117 unsigned long end, pgprot_t prot, struct page **pages, int *nr)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700118{
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 Piggindb64fe02008-10-18 20:27:03 -0700127 if (vmap_pte_range(pmd, addr, next, prot, pages, nr))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700128 return -ENOMEM;
129 } while (pmd++, addr = next, addr != end);
130 return 0;
131}
132
Nick Piggindb64fe02008-10-18 20:27:03 -0700133static int vmap_pud_range(pgd_t *pgd, unsigned long addr,
134 unsigned long end, pgprot_t prot, struct page **pages, int *nr)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700135{
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 Piggindb64fe02008-10-18 20:27:03 -0700144 if (vmap_pmd_range(pud, addr, next, prot, pages, nr))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700145 return -ENOMEM;
146 } while (pud++, addr = next, addr != end);
147 return 0;
148}
149
Nick Piggindb64fe02008-10-18 20:27:03 -0700150/*
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 Heo8fc48982009-02-20 16:29:08 +0900156static int vmap_page_range_noflush(unsigned long start, unsigned long end,
157 pgprot_t prot, struct page **pages)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700158{
159 pgd_t *pgd;
160 unsigned long next;
Adam Lackorzynski2e4e27c2009-01-04 12:00:46 -0800161 unsigned long addr = start;
Nick Piggindb64fe02008-10-18 20:27:03 -0700162 int err = 0;
163 int nr = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700164
165 BUG_ON(addr >= end);
166 pgd = pgd_offset_k(addr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700167 do {
168 next = pgd_addr_end(addr, end);
Nick Piggindb64fe02008-10-18 20:27:03 -0700169 err = vmap_pud_range(pgd, addr, next, prot, pages, &nr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700170 if (err)
Figo.zhangbf88c8c2009-09-21 17:01:47 -0700171 return err;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700172 } while (pgd++, addr = next, addr != end);
Nick Piggindb64fe02008-10-18 20:27:03 -0700173
Nick Piggindb64fe02008-10-18 20:27:03 -0700174 return nr;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700175}
176
Tejun Heo8fc48982009-02-20 16:29:08 +0900177static 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 Hiroyuki81ac3ad2009-09-22 16:45:49 -0700187int is_vmalloc_or_module_addr(const void *x)
Linus Torvalds73bdf0a2008-10-15 08:35:12 -0700188{
189 /*
Russell Kingab4f2ee2008-11-06 17:11:07 +0000190 * ARM, x86-64 and sparc64 put modules in a special place,
Linus Torvalds73bdf0a2008-10-15 08:35:12 -0700191 * 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 Lameter48667e72008-02-04 22:28:31 -0800202/*
Nick Piggindb64fe02008-10-18 20:27:03 -0700203 * Walk a vmap address to the struct page it maps.
Christoph Lameter48667e72008-02-04 22:28:31 -0800204 */
Christoph Lameterb3bdda02008-02-04 22:28:32 -0800205struct page *vmalloc_to_page(const void *vmalloc_addr)
Christoph Lameter48667e72008-02-04 22:28:31 -0800206{
207 unsigned long addr = (unsigned long) vmalloc_addr;
208 struct page *page = NULL;
209 pgd_t *pgd = pgd_offset_k(addr);
Christoph Lameter48667e72008-02-04 22:28:31 -0800210
Ingo Molnar7aa413d2008-06-19 13:28:11 +0200211 /*
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 Torvalds73bdf0a2008-10-15 08:35:12 -0700215 VIRTUAL_BUG_ON(!is_vmalloc_or_module_addr(vmalloc_addr));
Jiri Slaby59ea7462008-06-12 13:56:40 +0200216
Christoph Lameter48667e72008-02-04 22:28:31 -0800217 if (!pgd_none(*pgd)) {
Nick Piggindb64fe02008-10-18 20:27:03 -0700218 pud_t *pud = pud_offset(pgd, addr);
Christoph Lameter48667e72008-02-04 22:28:31 -0800219 if (!pud_none(*pud)) {
Nick Piggindb64fe02008-10-18 20:27:03 -0700220 pmd_t *pmd = pmd_offset(pud, addr);
Christoph Lameter48667e72008-02-04 22:28:31 -0800221 if (!pmd_none(*pmd)) {
Nick Piggindb64fe02008-10-18 20:27:03 -0700222 pte_t *ptep, pte;
223
Christoph Lameter48667e72008-02-04 22:28:31 -0800224 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}
234EXPORT_SYMBOL(vmalloc_to_page);
235
236/*
237 * Map a vmalloc()-space virtual address to the physical page frame number.
238 */
Christoph Lameterb3bdda02008-02-04 22:28:32 -0800239unsigned long vmalloc_to_pfn(const void *vmalloc_addr)
Christoph Lameter48667e72008-02-04 22:28:31 -0800240{
241 return page_to_pfn(vmalloc_to_page(vmalloc_addr));
242}
243EXPORT_SYMBOL(vmalloc_to_pfn);
244
Nick Piggindb64fe02008-10-18 20:27:03 -0700245
246/*** Global kva allocator ***/
247
248#define VM_LAZY_FREE 0x01
249#define VM_LAZY_FREEING 0x02
250#define VM_VM_AREA 0x04
251
252struct 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
263static DEFINE_SPINLOCK(vmap_area_lock);
Nick Piggindb64fe02008-10-18 20:27:03 -0700264static LIST_HEAD(vmap_area_list);
Nick Piggin89699602011-03-22 16:30:36 -0700265static struct rb_root vmap_area_root = RB_ROOT;
266
267/* The vmap cache globals are protected by vmap_area_lock */
268static struct rb_node *free_vmap_cache;
269static unsigned long cached_hole_size;
270static unsigned long cached_vstart;
271static unsigned long cached_align;
272
Tejun Heoca23e402009-08-14 15:00:52 +0900273static unsigned long vmap_area_pcpu_hole;
Nick Piggindb64fe02008-10-18 20:27:03 -0700274
275static struct vmap_area *__find_vmap_area(unsigned long addr)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700276{
Nick Piggindb64fe02008-10-18 20:27:03 -0700277 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
294static 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 Kim170168d2010-10-26 14:22:02 -0700301 struct vmap_area *tmp_va;
Nick Piggindb64fe02008-10-18 20:27:03 -0700302
303 parent = *p;
Namhyung Kim170168d2010-10-26 14:22:02 -0700304 tmp_va = rb_entry(parent, struct vmap_area, rb_node);
305 if (va->va_start < tmp_va->va_end)
Nick Piggindb64fe02008-10-18 20:27:03 -0700306 p = &(*p)->rb_left;
Namhyung Kim170168d2010-10-26 14:22:02 -0700307 else if (va->va_end > tmp_va->va_start)
Nick Piggindb64fe02008-10-18 20:27:03 -0700308 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
326static 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 */
332static 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 Torvalds1da177e2005-04-16 15:20:36 -0700339 unsigned long addr;
Nick Piggindb64fe02008-10-18 20:27:03 -0700340 int purged = 0;
Nick Piggin89699602011-03-22 16:30:36 -0700341 struct vmap_area *first;
Nick Piggindb64fe02008-10-18 20:27:03 -0700342
Nick Piggin77669702009-02-27 14:03:03 -0800343 BUG_ON(!size);
Nick Piggindb64fe02008-10-18 20:27:03 -0700344 BUG_ON(size & ~PAGE_MASK);
Nick Piggin89699602011-03-22 16:30:36 -0700345 BUG_ON(!is_power_of_2(align));
Nick Piggindb64fe02008-10-18 20:27:03 -0700346
Nick Piggindb64fe02008-10-18 20:27:03 -0700347 va = kmalloc_node(sizeof(struct vmap_area),
348 gfp_mask & GFP_RECLAIM_MASK, node);
349 if (unlikely(!va))
350 return ERR_PTR(-ENOMEM);
351
352retry:
353 spin_lock(&vmap_area_lock);
Nick Piggin89699602011-03-22 16:30:36 -0700354 /*
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) {
367nocache:
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 Piggin77669702009-02-27 14:03:03 -0800374
Nick Piggin89699602011-03-22 16:30:36 -0700375 /* find starting point for our search */
376 if (free_vmap_cache) {
377 first = rb_entry(free_vmap_cache, struct vmap_area, rb_node);
Johannes Weiner248ac0e2011-05-24 17:11:43 -0700378 addr = ALIGN(first->va_end, align);
Nick Piggin89699602011-03-22 16:30:36 -0700379 if (addr < vstart)
380 goto nocache;
381 if (addr + size - 1 < addr)
382 goto overflow;
Nick Piggindb64fe02008-10-18 20:27:03 -0700383
Nick Piggin89699602011-03-22 16:30:36 -0700384 } 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 Piggindb64fe02008-10-18 20:27:03 -0700393 struct vmap_area *tmp;
394 tmp = rb_entry(n, struct vmap_area, rb_node);
395 if (tmp->va_end >= addr) {
Nick Piggindb64fe02008-10-18 20:27:03 -0700396 first = tmp;
Nick Piggin89699602011-03-22 16:30:36 -0700397 if (tmp->va_start <= addr)
398 break;
399 n = n->rb_left;
400 } else
Nick Piggindb64fe02008-10-18 20:27:03 -0700401 n = n->rb_right;
Nick Piggin89699602011-03-22 16:30:36 -0700402 }
Nick Piggindb64fe02008-10-18 20:27:03 -0700403
404 if (!first)
405 goto found;
Nick Piggindb64fe02008-10-18 20:27:03 -0700406 }
Nick Piggin89699602011-03-22 16:30:36 -0700407
408 /* from the starting point, walk areas until a suitable hole is found */
Johannes Weiner248ac0e2011-05-24 17:11:43 -0700409 while (addr + size > first->va_start && addr + size <= vend) {
Nick Piggin89699602011-03-22 16:30:36 -0700410 if (addr + cached_hole_size < first->va_start)
411 cached_hole_size = first->va_start - addr;
Johannes Weiner248ac0e2011-05-24 17:11:43 -0700412 addr = ALIGN(first->va_end, align);
Nick Piggin89699602011-03-22 16:30:36 -0700413 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 Piggindb64fe02008-10-18 20:27:03 -0700423found:
Nick Piggin89699602011-03-22 16:30:36 -0700424 if (addr + size > vend)
425 goto overflow;
Nick Piggindb64fe02008-10-18 20:27:03 -0700426
427 va->va_start = addr;
428 va->va_end = addr + size;
429 va->flags = 0;
430 __insert_vmap_area(va);
Nick Piggin89699602011-03-22 16:30:36 -0700431 free_vmap_cache = &va->rb_node;
Nick Piggindb64fe02008-10-18 20:27:03 -0700432 spin_unlock(&vmap_area_lock);
433
Nick Piggin89699602011-03-22 16:30:36 -0700434 BUG_ON(va->va_start & (align-1));
435 BUG_ON(va->va_start < vstart);
436 BUG_ON(va->va_end > vend);
437
Nick Piggindb64fe02008-10-18 20:27:03 -0700438 return va;
Nick Piggin89699602011-03-22 16:30:36 -0700439
440overflow:
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 Piggindb64fe02008-10-18 20:27:03 -0700453}
454
Nick Piggindb64fe02008-10-18 20:27:03 -0700455static void __free_vmap_area(struct vmap_area *va)
456{
457 BUG_ON(RB_EMPTY_NODE(&va->rb_node));
Nick Piggin89699602011-03-22 16:30:36 -0700458
459 if (free_vmap_cache) {
460 if (va->va_end < cached_vstart) {
461 free_vmap_cache = NULL;
462 } else {
463 struct vmap_area *cache;
464 cache = rb_entry(free_vmap_cache, struct vmap_area, rb_node);
465 if (va->va_start <= cache->va_start) {
466 free_vmap_cache = rb_prev(&va->rb_node);
467 /*
468 * We don't try to update cached_hole_size or
469 * cached_align, but it won't go very wrong.
470 */
471 }
472 }
473 }
Nick Piggindb64fe02008-10-18 20:27:03 -0700474 rb_erase(&va->rb_node, &vmap_area_root);
475 RB_CLEAR_NODE(&va->rb_node);
476 list_del_rcu(&va->list);
477
Tejun Heoca23e402009-08-14 15:00:52 +0900478 /*
479 * Track the highest possible candidate for pcpu area
480 * allocation. Areas outside of vmalloc area can be returned
481 * here too, consider only end addresses which fall inside
482 * vmalloc area proper.
483 */
484 if (va->va_end > VMALLOC_START && va->va_end <= VMALLOC_END)
485 vmap_area_pcpu_hole = max(vmap_area_pcpu_hole, va->va_end);
486
Lai Jiangshan14769de2011-03-18 12:12:19 +0800487 kfree_rcu(va, rcu_head);
Nick Piggindb64fe02008-10-18 20:27:03 -0700488}
489
490/*
491 * Free a region of KVA allocated by alloc_vmap_area
492 */
493static void free_vmap_area(struct vmap_area *va)
494{
495 spin_lock(&vmap_area_lock);
496 __free_vmap_area(va);
497 spin_unlock(&vmap_area_lock);
498}
499
500/*
501 * Clear the pagetable entries of a given vmap_area
502 */
503static void unmap_vmap_area(struct vmap_area *va)
504{
505 vunmap_page_range(va->va_start, va->va_end);
506}
507
Nick Piggincd528582009-01-06 14:39:20 -0800508static void vmap_debug_free_range(unsigned long start, unsigned long end)
509{
510 /*
511 * Unmap page tables and force a TLB flush immediately if
512 * CONFIG_DEBUG_PAGEALLOC is set. This catches use after free
513 * bugs similarly to those in linear kernel virtual address
514 * space after a page has been freed.
515 *
516 * All the lazy freeing logic is still retained, in order to
517 * minimise intrusiveness of this debugging feature.
518 *
519 * This is going to be *slow* (linear kernel virtual address
520 * debugging doesn't do a broadcast TLB flush so it is a lot
521 * faster).
522 */
523#ifdef CONFIG_DEBUG_PAGEALLOC
524 vunmap_page_range(start, end);
525 flush_tlb_kernel_range(start, end);
526#endif
527}
528
Nick Piggindb64fe02008-10-18 20:27:03 -0700529/*
530 * lazy_max_pages is the maximum amount of virtual address space we gather up
531 * before attempting to purge with a TLB flush.
532 *
533 * There is a tradeoff here: a larger number will cover more kernel page tables
534 * and take slightly longer to purge, but it will linearly reduce the number of
535 * global TLB flushes that must be performed. It would seem natural to scale
536 * this number up linearly with the number of CPUs (because vmapping activity
537 * could also scale linearly with the number of CPUs), however it is likely
538 * that in practice, workloads might be constrained in other ways that mean
539 * vmap activity will not scale linearly with CPUs. Also, I want to be
540 * conservative and not introduce a big latency on huge systems, so go with
541 * a less aggressive log scale. It will still be an improvement over the old
542 * code, and it will be simple to change the scale factor if we find that it
543 * becomes a problem on bigger systems.
544 */
545static unsigned long lazy_max_pages(void)
546{
547 unsigned int log;
548
549 log = fls(num_online_cpus());
550
551 return log * (32UL * 1024 * 1024 / PAGE_SIZE);
552}
553
554static atomic_t vmap_lazy_nr = ATOMIC_INIT(0);
555
Nick Piggin02b709d2010-02-01 22:25:57 +1100556/* for per-CPU blocks */
557static void purge_fragmented_blocks_allcpus(void);
558
Nick Piggindb64fe02008-10-18 20:27:03 -0700559/*
Cliff Wickman3ee48b62010-09-16 11:44:02 -0500560 * called before a call to iounmap() if the caller wants vm_area_struct's
561 * immediately freed.
562 */
563void set_iounmap_nonlazy(void)
564{
565 atomic_set(&vmap_lazy_nr, lazy_max_pages()+1);
566}
567
568/*
Nick Piggindb64fe02008-10-18 20:27:03 -0700569 * Purges all lazily-freed vmap areas.
570 *
571 * If sync is 0 then don't purge if there is already a purge in progress.
572 * If force_flush is 1, then flush kernel TLBs between *start and *end even
573 * if we found no lazy vmap areas to unmap (callers can use this to optimise
574 * their own TLB flushing).
575 * Returns with *start = min(*start, lowest purged address)
576 * *end = max(*end, highest purged address)
577 */
578static void __purge_vmap_area_lazy(unsigned long *start, unsigned long *end,
579 int sync, int force_flush)
580{
Andrew Morton46666d82009-01-15 13:51:15 -0800581 static DEFINE_SPINLOCK(purge_lock);
Nick Piggindb64fe02008-10-18 20:27:03 -0700582 LIST_HEAD(valist);
583 struct vmap_area *va;
Vegard Nossumcbb76672009-02-27 14:03:04 -0800584 struct vmap_area *n_va;
Nick Piggindb64fe02008-10-18 20:27:03 -0700585 int nr = 0;
586
587 /*
588 * If sync is 0 but force_flush is 1, we'll go sync anyway but callers
589 * should not expect such behaviour. This just simplifies locking for
590 * the case that isn't actually used at the moment anyway.
591 */
592 if (!sync && !force_flush) {
Andrew Morton46666d82009-01-15 13:51:15 -0800593 if (!spin_trylock(&purge_lock))
Nick Piggindb64fe02008-10-18 20:27:03 -0700594 return;
595 } else
Andrew Morton46666d82009-01-15 13:51:15 -0800596 spin_lock(&purge_lock);
Nick Piggindb64fe02008-10-18 20:27:03 -0700597
Nick Piggin02b709d2010-02-01 22:25:57 +1100598 if (sync)
599 purge_fragmented_blocks_allcpus();
600
Nick Piggindb64fe02008-10-18 20:27:03 -0700601 rcu_read_lock();
602 list_for_each_entry_rcu(va, &vmap_area_list, list) {
603 if (va->flags & VM_LAZY_FREE) {
604 if (va->va_start < *start)
605 *start = va->va_start;
606 if (va->va_end > *end)
607 *end = va->va_end;
608 nr += (va->va_end - va->va_start) >> PAGE_SHIFT;
Nick Piggindb64fe02008-10-18 20:27:03 -0700609 list_add_tail(&va->purge_list, &valist);
610 va->flags |= VM_LAZY_FREEING;
611 va->flags &= ~VM_LAZY_FREE;
612 }
613 }
614 rcu_read_unlock();
615
Yongseok Koh88f50042010-01-19 17:33:49 +0900616 if (nr)
Nick Piggindb64fe02008-10-18 20:27:03 -0700617 atomic_sub(nr, &vmap_lazy_nr);
Nick Piggindb64fe02008-10-18 20:27:03 -0700618
619 if (nr || force_flush)
620 flush_tlb_kernel_range(*start, *end);
621
622 if (nr) {
623 spin_lock(&vmap_area_lock);
Vegard Nossumcbb76672009-02-27 14:03:04 -0800624 list_for_each_entry_safe(va, n_va, &valist, purge_list)
Nick Piggindb64fe02008-10-18 20:27:03 -0700625 __free_vmap_area(va);
626 spin_unlock(&vmap_area_lock);
627 }
Andrew Morton46666d82009-01-15 13:51:15 -0800628 spin_unlock(&purge_lock);
Nick Piggindb64fe02008-10-18 20:27:03 -0700629}
630
631/*
Nick Piggin496850e2008-11-19 15:36:33 -0800632 * Kick off a purge of the outstanding lazy areas. Don't bother if somebody
633 * is already purging.
634 */
635static void try_purge_vmap_area_lazy(void)
636{
637 unsigned long start = ULONG_MAX, end = 0;
638
639 __purge_vmap_area_lazy(&start, &end, 0, 0);
640}
641
642/*
Nick Piggindb64fe02008-10-18 20:27:03 -0700643 * Kick off a purge of the outstanding lazy areas.
644 */
645static void purge_vmap_area_lazy(void)
646{
647 unsigned long start = ULONG_MAX, end = 0;
648
Nick Piggin496850e2008-11-19 15:36:33 -0800649 __purge_vmap_area_lazy(&start, &end, 1, 0);
Nick Piggindb64fe02008-10-18 20:27:03 -0700650}
651
652/*
Jeremy Fitzhardinge64141da2010-12-02 14:31:18 -0800653 * Free a vmap area, caller ensuring that the area has been unmapped
654 * and flush_cache_vunmap had been called for the correct range
655 * previously.
Nick Piggindb64fe02008-10-18 20:27:03 -0700656 */
Jeremy Fitzhardinge64141da2010-12-02 14:31:18 -0800657static void free_vmap_area_noflush(struct vmap_area *va)
Nick Piggindb64fe02008-10-18 20:27:03 -0700658{
659 va->flags |= VM_LAZY_FREE;
660 atomic_add((va->va_end - va->va_start) >> PAGE_SHIFT, &vmap_lazy_nr);
661 if (unlikely(atomic_read(&vmap_lazy_nr) > lazy_max_pages()))
Nick Piggin496850e2008-11-19 15:36:33 -0800662 try_purge_vmap_area_lazy();
Nick Piggindb64fe02008-10-18 20:27:03 -0700663}
664
Nick Pigginb29acbd2008-12-01 13:13:47 -0800665/*
Jeremy Fitzhardinge64141da2010-12-02 14:31:18 -0800666 * Free and unmap a vmap area, caller ensuring flush_cache_vunmap had been
667 * called for the correct range previously.
668 */
669static void free_unmap_vmap_area_noflush(struct vmap_area *va)
670{
671 unmap_vmap_area(va);
672 free_vmap_area_noflush(va);
673}
674
675/*
Nick Pigginb29acbd2008-12-01 13:13:47 -0800676 * Free and unmap a vmap area
677 */
678static void free_unmap_vmap_area(struct vmap_area *va)
679{
680 flush_cache_vunmap(va->va_start, va->va_end);
681 free_unmap_vmap_area_noflush(va);
682}
683
Nick Piggindb64fe02008-10-18 20:27:03 -0700684static struct vmap_area *find_vmap_area(unsigned long addr)
685{
686 struct vmap_area *va;
687
688 spin_lock(&vmap_area_lock);
689 va = __find_vmap_area(addr);
690 spin_unlock(&vmap_area_lock);
691
692 return va;
693}
694
695static void free_unmap_vmap_area_addr(unsigned long addr)
696{
697 struct vmap_area *va;
698
699 va = find_vmap_area(addr);
700 BUG_ON(!va);
701 free_unmap_vmap_area(va);
702}
703
704
705/*** Per cpu kva allocator ***/
706
707/*
708 * vmap space is limited especially on 32 bit architectures. Ensure there is
709 * room for at least 16 percpu vmap blocks per CPU.
710 */
711/*
712 * If we had a constant VMALLOC_START and VMALLOC_END, we'd like to be able
713 * to #define VMALLOC_SPACE (VMALLOC_END-VMALLOC_START). Guess
714 * instead (we just need a rough idea)
715 */
716#if BITS_PER_LONG == 32
717#define VMALLOC_SPACE (128UL*1024*1024)
718#else
719#define VMALLOC_SPACE (128UL*1024*1024*1024)
720#endif
721
722#define VMALLOC_PAGES (VMALLOC_SPACE / PAGE_SIZE)
723#define VMAP_MAX_ALLOC BITS_PER_LONG /* 256K with 4K pages */
724#define VMAP_BBMAP_BITS_MAX 1024 /* 4MB with 4K pages */
725#define VMAP_BBMAP_BITS_MIN (VMAP_MAX_ALLOC*2)
726#define VMAP_MIN(x, y) ((x) < (y) ? (x) : (y)) /* can't use min() */
727#define VMAP_MAX(x, y) ((x) > (y) ? (x) : (y)) /* can't use max() */
Clemens Ladischf982f912011-06-21 22:09:50 +0200728#define VMAP_BBMAP_BITS \
729 VMAP_MIN(VMAP_BBMAP_BITS_MAX, \
730 VMAP_MAX(VMAP_BBMAP_BITS_MIN, \
731 VMALLOC_PAGES / roundup_pow_of_two(NR_CPUS) / 16))
Nick Piggindb64fe02008-10-18 20:27:03 -0700732
733#define VMAP_BLOCK_SIZE (VMAP_BBMAP_BITS * PAGE_SIZE)
734
Jeremy Fitzhardinge9b463332008-10-28 19:22:34 +1100735static bool vmap_initialized __read_mostly = false;
736
Nick Piggindb64fe02008-10-18 20:27:03 -0700737struct vmap_block_queue {
738 spinlock_t lock;
739 struct list_head free;
Nick Piggindb64fe02008-10-18 20:27:03 -0700740};
741
742struct vmap_block {
743 spinlock_t lock;
744 struct vmap_area *va;
745 struct vmap_block_queue *vbq;
746 unsigned long free, dirty;
747 DECLARE_BITMAP(alloc_map, VMAP_BBMAP_BITS);
748 DECLARE_BITMAP(dirty_map, VMAP_BBMAP_BITS);
Nick Pigginde560422010-02-01 22:24:18 +1100749 struct list_head free_list;
750 struct rcu_head rcu_head;
Nick Piggin02b709d2010-02-01 22:25:57 +1100751 struct list_head purge;
Nick Piggindb64fe02008-10-18 20:27:03 -0700752};
753
754/* Queue of free and dirty vmap blocks, for allocation and flushing purposes */
755static DEFINE_PER_CPU(struct vmap_block_queue, vmap_block_queue);
756
757/*
758 * Radix tree of vmap blocks, indexed by address, to quickly find a vmap block
759 * in the free path. Could get rid of this if we change the API to return a
760 * "cookie" from alloc, to be passed to free. But no big deal yet.
761 */
762static DEFINE_SPINLOCK(vmap_block_tree_lock);
763static RADIX_TREE(vmap_block_tree, GFP_ATOMIC);
764
765/*
766 * We should probably have a fallback mechanism to allocate virtual memory
767 * out of partially filled vmap blocks. However vmap block sizing should be
768 * fairly reasonable according to the vmalloc size, so it shouldn't be a
769 * big problem.
770 */
771
772static unsigned long addr_to_vb_idx(unsigned long addr)
773{
774 addr -= VMALLOC_START & ~(VMAP_BLOCK_SIZE-1);
775 addr /= VMAP_BLOCK_SIZE;
776 return addr;
777}
778
779static struct vmap_block *new_vmap_block(gfp_t gfp_mask)
780{
781 struct vmap_block_queue *vbq;
782 struct vmap_block *vb;
783 struct vmap_area *va;
784 unsigned long vb_idx;
785 int node, err;
786
787 node = numa_node_id();
788
789 vb = kmalloc_node(sizeof(struct vmap_block),
790 gfp_mask & GFP_RECLAIM_MASK, node);
791 if (unlikely(!vb))
792 return ERR_PTR(-ENOMEM);
793
794 va = alloc_vmap_area(VMAP_BLOCK_SIZE, VMAP_BLOCK_SIZE,
795 VMALLOC_START, VMALLOC_END,
796 node, gfp_mask);
Tobias Klauserddf9c6d2011-01-13 15:46:15 -0800797 if (IS_ERR(va)) {
Nick Piggindb64fe02008-10-18 20:27:03 -0700798 kfree(vb);
Julia Lawalle7d86342010-08-09 17:18:28 -0700799 return ERR_CAST(va);
Nick Piggindb64fe02008-10-18 20:27:03 -0700800 }
801
802 err = radix_tree_preload(gfp_mask);
803 if (unlikely(err)) {
804 kfree(vb);
805 free_vmap_area(va);
806 return ERR_PTR(err);
807 }
808
809 spin_lock_init(&vb->lock);
810 vb->va = va;
811 vb->free = VMAP_BBMAP_BITS;
812 vb->dirty = 0;
813 bitmap_zero(vb->alloc_map, VMAP_BBMAP_BITS);
814 bitmap_zero(vb->dirty_map, VMAP_BBMAP_BITS);
815 INIT_LIST_HEAD(&vb->free_list);
Nick Piggindb64fe02008-10-18 20:27:03 -0700816
817 vb_idx = addr_to_vb_idx(va->va_start);
818 spin_lock(&vmap_block_tree_lock);
819 err = radix_tree_insert(&vmap_block_tree, vb_idx, vb);
820 spin_unlock(&vmap_block_tree_lock);
821 BUG_ON(err);
822 radix_tree_preload_end();
823
824 vbq = &get_cpu_var(vmap_block_queue);
825 vb->vbq = vbq;
826 spin_lock(&vbq->lock);
Nick Pigginde560422010-02-01 22:24:18 +1100827 list_add_rcu(&vb->free_list, &vbq->free);
Nick Piggindb64fe02008-10-18 20:27:03 -0700828 spin_unlock(&vbq->lock);
Tejun Heo3f04ba82009-10-29 22:34:12 +0900829 put_cpu_var(vmap_block_queue);
Nick Piggindb64fe02008-10-18 20:27:03 -0700830
831 return vb;
832}
833
Nick Piggindb64fe02008-10-18 20:27:03 -0700834static void free_vmap_block(struct vmap_block *vb)
835{
836 struct vmap_block *tmp;
837 unsigned long vb_idx;
838
Nick Piggindb64fe02008-10-18 20:27:03 -0700839 vb_idx = addr_to_vb_idx(vb->va->va_start);
840 spin_lock(&vmap_block_tree_lock);
841 tmp = radix_tree_delete(&vmap_block_tree, vb_idx);
842 spin_unlock(&vmap_block_tree_lock);
843 BUG_ON(tmp != vb);
844
Jeremy Fitzhardinge64141da2010-12-02 14:31:18 -0800845 free_vmap_area_noflush(vb->va);
Lai Jiangshan22a3c7d2011-03-18 12:13:08 +0800846 kfree_rcu(vb, rcu_head);
Nick Piggindb64fe02008-10-18 20:27:03 -0700847}
848
Nick Piggin02b709d2010-02-01 22:25:57 +1100849static void purge_fragmented_blocks(int cpu)
850{
851 LIST_HEAD(purge);
852 struct vmap_block *vb;
853 struct vmap_block *n_vb;
854 struct vmap_block_queue *vbq = &per_cpu(vmap_block_queue, cpu);
855
856 rcu_read_lock();
857 list_for_each_entry_rcu(vb, &vbq->free, free_list) {
858
859 if (!(vb->free + vb->dirty == VMAP_BBMAP_BITS && vb->dirty != VMAP_BBMAP_BITS))
860 continue;
861
862 spin_lock(&vb->lock);
863 if (vb->free + vb->dirty == VMAP_BBMAP_BITS && vb->dirty != VMAP_BBMAP_BITS) {
864 vb->free = 0; /* prevent further allocs after releasing lock */
865 vb->dirty = VMAP_BBMAP_BITS; /* prevent purging it again */
866 bitmap_fill(vb->alloc_map, VMAP_BBMAP_BITS);
867 bitmap_fill(vb->dirty_map, VMAP_BBMAP_BITS);
868 spin_lock(&vbq->lock);
869 list_del_rcu(&vb->free_list);
870 spin_unlock(&vbq->lock);
871 spin_unlock(&vb->lock);
872 list_add_tail(&vb->purge, &purge);
873 } else
874 spin_unlock(&vb->lock);
875 }
876 rcu_read_unlock();
877
878 list_for_each_entry_safe(vb, n_vb, &purge, purge) {
879 list_del(&vb->purge);
880 free_vmap_block(vb);
881 }
882}
883
884static void purge_fragmented_blocks_thiscpu(void)
885{
886 purge_fragmented_blocks(smp_processor_id());
887}
888
889static void purge_fragmented_blocks_allcpus(void)
890{
891 int cpu;
892
893 for_each_possible_cpu(cpu)
894 purge_fragmented_blocks(cpu);
895}
896
Nick Piggindb64fe02008-10-18 20:27:03 -0700897static void *vb_alloc(unsigned long size, gfp_t gfp_mask)
898{
899 struct vmap_block_queue *vbq;
900 struct vmap_block *vb;
901 unsigned long addr = 0;
902 unsigned int order;
Nick Piggin02b709d2010-02-01 22:25:57 +1100903 int purge = 0;
Nick Piggindb64fe02008-10-18 20:27:03 -0700904
905 BUG_ON(size & ~PAGE_MASK);
906 BUG_ON(size > PAGE_SIZE*VMAP_MAX_ALLOC);
907 order = get_order(size);
908
909again:
910 rcu_read_lock();
911 vbq = &get_cpu_var(vmap_block_queue);
912 list_for_each_entry_rcu(vb, &vbq->free, free_list) {
913 int i;
914
915 spin_lock(&vb->lock);
Nick Piggin02b709d2010-02-01 22:25:57 +1100916 if (vb->free < 1UL << order)
917 goto next;
918
Nick Piggindb64fe02008-10-18 20:27:03 -0700919 i = bitmap_find_free_region(vb->alloc_map,
920 VMAP_BBMAP_BITS, order);
921
Nick Piggin02b709d2010-02-01 22:25:57 +1100922 if (i < 0) {
923 if (vb->free + vb->dirty == VMAP_BBMAP_BITS) {
924 /* fragmented and no outstanding allocations */
925 BUG_ON(vb->dirty != VMAP_BBMAP_BITS);
926 purge = 1;
Nick Piggindb64fe02008-10-18 20:27:03 -0700927 }
Nick Piggin02b709d2010-02-01 22:25:57 +1100928 goto next;
929 }
930 addr = vb->va->va_start + (i << PAGE_SHIFT);
931 BUG_ON(addr_to_vb_idx(addr) !=
932 addr_to_vb_idx(vb->va->va_start));
933 vb->free -= 1UL << order;
934 if (vb->free == 0) {
935 spin_lock(&vbq->lock);
936 list_del_rcu(&vb->free_list);
937 spin_unlock(&vbq->lock);
Nick Piggindb64fe02008-10-18 20:27:03 -0700938 }
939 spin_unlock(&vb->lock);
Nick Piggin02b709d2010-02-01 22:25:57 +1100940 break;
941next:
942 spin_unlock(&vb->lock);
Nick Piggindb64fe02008-10-18 20:27:03 -0700943 }
Nick Piggin02b709d2010-02-01 22:25:57 +1100944
945 if (purge)
946 purge_fragmented_blocks_thiscpu();
947
Tejun Heo3f04ba82009-10-29 22:34:12 +0900948 put_cpu_var(vmap_block_queue);
Nick Piggindb64fe02008-10-18 20:27:03 -0700949 rcu_read_unlock();
950
951 if (!addr) {
952 vb = new_vmap_block(gfp_mask);
953 if (IS_ERR(vb))
954 return vb;
955 goto again;
956 }
957
958 return (void *)addr;
959}
960
961static void vb_free(const void *addr, unsigned long size)
962{
963 unsigned long offset;
964 unsigned long vb_idx;
965 unsigned int order;
966 struct vmap_block *vb;
967
968 BUG_ON(size & ~PAGE_MASK);
969 BUG_ON(size > PAGE_SIZE*VMAP_MAX_ALLOC);
Nick Pigginb29acbd2008-12-01 13:13:47 -0800970
971 flush_cache_vunmap((unsigned long)addr, (unsigned long)addr + size);
972
Nick Piggindb64fe02008-10-18 20:27:03 -0700973 order = get_order(size);
974
975 offset = (unsigned long)addr & (VMAP_BLOCK_SIZE - 1);
976
977 vb_idx = addr_to_vb_idx((unsigned long)addr);
978 rcu_read_lock();
979 vb = radix_tree_lookup(&vmap_block_tree, vb_idx);
980 rcu_read_unlock();
981 BUG_ON(!vb);
982
Jeremy Fitzhardinge64141da2010-12-02 14:31:18 -0800983 vunmap_page_range((unsigned long)addr, (unsigned long)addr + size);
984
Nick Piggindb64fe02008-10-18 20:27:03 -0700985 spin_lock(&vb->lock);
Nick Pigginde560422010-02-01 22:24:18 +1100986 BUG_ON(bitmap_allocate_region(vb->dirty_map, offset >> PAGE_SHIFT, order));
MinChan Kimd0868172009-03-31 15:19:26 -0700987
Nick Piggindb64fe02008-10-18 20:27:03 -0700988 vb->dirty += 1UL << order;
989 if (vb->dirty == VMAP_BBMAP_BITS) {
Nick Pigginde560422010-02-01 22:24:18 +1100990 BUG_ON(vb->free);
Nick Piggindb64fe02008-10-18 20:27:03 -0700991 spin_unlock(&vb->lock);
992 free_vmap_block(vb);
993 } else
994 spin_unlock(&vb->lock);
995}
996
997/**
998 * vm_unmap_aliases - unmap outstanding lazy aliases in the vmap layer
999 *
1000 * The vmap/vmalloc layer lazily flushes kernel virtual mappings primarily
1001 * to amortize TLB flushing overheads. What this means is that any page you
1002 * have now, may, in a former life, have been mapped into kernel virtual
1003 * address by the vmap layer and so there might be some CPUs with TLB entries
1004 * still referencing that page (additional to the regular 1:1 kernel mapping).
1005 *
1006 * vm_unmap_aliases flushes all such lazy mappings. After it returns, we can
1007 * be sure that none of the pages we have control over will have any aliases
1008 * from the vmap layer.
1009 */
1010void vm_unmap_aliases(void)
1011{
1012 unsigned long start = ULONG_MAX, end = 0;
1013 int cpu;
1014 int flush = 0;
1015
Jeremy Fitzhardinge9b463332008-10-28 19:22:34 +11001016 if (unlikely(!vmap_initialized))
1017 return;
1018
Nick Piggindb64fe02008-10-18 20:27:03 -07001019 for_each_possible_cpu(cpu) {
1020 struct vmap_block_queue *vbq = &per_cpu(vmap_block_queue, cpu);
1021 struct vmap_block *vb;
1022
1023 rcu_read_lock();
1024 list_for_each_entry_rcu(vb, &vbq->free, free_list) {
1025 int i;
1026
1027 spin_lock(&vb->lock);
1028 i = find_first_bit(vb->dirty_map, VMAP_BBMAP_BITS);
1029 while (i < VMAP_BBMAP_BITS) {
1030 unsigned long s, e;
1031 int j;
1032 j = find_next_zero_bit(vb->dirty_map,
1033 VMAP_BBMAP_BITS, i);
1034
1035 s = vb->va->va_start + (i << PAGE_SHIFT);
1036 e = vb->va->va_start + (j << PAGE_SHIFT);
Nick Piggindb64fe02008-10-18 20:27:03 -07001037 flush = 1;
1038
1039 if (s < start)
1040 start = s;
1041 if (e > end)
1042 end = e;
1043
1044 i = j;
1045 i = find_next_bit(vb->dirty_map,
1046 VMAP_BBMAP_BITS, i);
1047 }
1048 spin_unlock(&vb->lock);
1049 }
1050 rcu_read_unlock();
1051 }
1052
1053 __purge_vmap_area_lazy(&start, &end, 1, flush);
1054}
1055EXPORT_SYMBOL_GPL(vm_unmap_aliases);
1056
1057/**
1058 * vm_unmap_ram - unmap linear kernel address space set up by vm_map_ram
1059 * @mem: the pointer returned by vm_map_ram
1060 * @count: the count passed to that vm_map_ram call (cannot unmap partial)
1061 */
1062void vm_unmap_ram(const void *mem, unsigned int count)
1063{
1064 unsigned long size = count << PAGE_SHIFT;
1065 unsigned long addr = (unsigned long)mem;
1066
1067 BUG_ON(!addr);
1068 BUG_ON(addr < VMALLOC_START);
1069 BUG_ON(addr > VMALLOC_END);
1070 BUG_ON(addr & (PAGE_SIZE-1));
1071
1072 debug_check_no_locks_freed(mem, size);
Nick Piggincd528582009-01-06 14:39:20 -08001073 vmap_debug_free_range(addr, addr+size);
Nick Piggindb64fe02008-10-18 20:27:03 -07001074
1075 if (likely(count <= VMAP_MAX_ALLOC))
1076 vb_free(mem, size);
1077 else
1078 free_unmap_vmap_area_addr(addr);
1079}
1080EXPORT_SYMBOL(vm_unmap_ram);
1081
1082/**
1083 * vm_map_ram - map pages linearly into kernel virtual address (vmalloc space)
1084 * @pages: an array of pointers to the pages to be mapped
1085 * @count: number of pages
1086 * @node: prefer to allocate data structures on this node
1087 * @prot: memory protection to use. PAGE_KERNEL for regular RAM
Randy Dunlape99c97a2008-10-29 14:01:09 -07001088 *
1089 * Returns: a pointer to the address that has been mapped, or %NULL on failure
Nick Piggindb64fe02008-10-18 20:27:03 -07001090 */
1091void *vm_map_ram(struct page **pages, unsigned int count, int node, pgprot_t prot)
1092{
1093 unsigned long size = count << PAGE_SHIFT;
1094 unsigned long addr;
1095 void *mem;
1096
1097 if (likely(count <= VMAP_MAX_ALLOC)) {
1098 mem = vb_alloc(size, GFP_KERNEL);
1099 if (IS_ERR(mem))
1100 return NULL;
1101 addr = (unsigned long)mem;
1102 } else {
1103 struct vmap_area *va;
1104 va = alloc_vmap_area(size, PAGE_SIZE,
1105 VMALLOC_START, VMALLOC_END, node, GFP_KERNEL);
1106 if (IS_ERR(va))
1107 return NULL;
1108
1109 addr = va->va_start;
1110 mem = (void *)addr;
1111 }
1112 if (vmap_page_range(addr, addr + size, prot, pages) < 0) {
1113 vm_unmap_ram(mem, count);
1114 return NULL;
1115 }
1116 return mem;
1117}
1118EXPORT_SYMBOL(vm_map_ram);
1119
Tejun Heof0aa6612009-02-20 16:29:08 +09001120/**
1121 * vm_area_register_early - register vmap area early during boot
1122 * @vm: vm_struct to register
Tejun Heoc0c0a292009-02-24 11:57:21 +09001123 * @align: requested alignment
Tejun Heof0aa6612009-02-20 16:29:08 +09001124 *
1125 * This function is used to register kernel vm area before
1126 * vmalloc_init() is called. @vm->size and @vm->flags should contain
1127 * proper values on entry and other fields should be zero. On return,
1128 * vm->addr contains the allocated address.
1129 *
1130 * DO NOT USE THIS FUNCTION UNLESS YOU KNOW WHAT YOU'RE DOING.
1131 */
Tejun Heoc0c0a292009-02-24 11:57:21 +09001132void __init vm_area_register_early(struct vm_struct *vm, size_t align)
Tejun Heof0aa6612009-02-20 16:29:08 +09001133{
1134 static size_t vm_init_off __initdata;
Tejun Heoc0c0a292009-02-24 11:57:21 +09001135 unsigned long addr;
Tejun Heof0aa6612009-02-20 16:29:08 +09001136
Tejun Heoc0c0a292009-02-24 11:57:21 +09001137 addr = ALIGN(VMALLOC_START + vm_init_off, align);
1138 vm_init_off = PFN_ALIGN(addr + vm->size) - VMALLOC_START;
1139
1140 vm->addr = (void *)addr;
Tejun Heof0aa6612009-02-20 16:29:08 +09001141
1142 vm->next = vmlist;
1143 vmlist = vm;
1144}
1145
Nick Piggindb64fe02008-10-18 20:27:03 -07001146void __init vmalloc_init(void)
1147{
Ivan Kokshaysky822c18f2009-01-15 13:50:48 -08001148 struct vmap_area *va;
1149 struct vm_struct *tmp;
Nick Piggindb64fe02008-10-18 20:27:03 -07001150 int i;
1151
1152 for_each_possible_cpu(i) {
1153 struct vmap_block_queue *vbq;
1154
1155 vbq = &per_cpu(vmap_block_queue, i);
1156 spin_lock_init(&vbq->lock);
1157 INIT_LIST_HEAD(&vbq->free);
Nick Piggindb64fe02008-10-18 20:27:03 -07001158 }
Jeremy Fitzhardinge9b463332008-10-28 19:22:34 +11001159
Ivan Kokshaysky822c18f2009-01-15 13:50:48 -08001160 /* Import existing vmlist entries. */
1161 for (tmp = vmlist; tmp; tmp = tmp->next) {
Pekka Enberg43ebdac2009-05-25 15:01:35 +03001162 va = kzalloc(sizeof(struct vmap_area), GFP_NOWAIT);
Ivan Kokshaysky822c18f2009-01-15 13:50:48 -08001163 va->flags = tmp->flags | VM_VM_AREA;
1164 va->va_start = (unsigned long)tmp->addr;
1165 va->va_end = va->va_start + tmp->size;
1166 __insert_vmap_area(va);
1167 }
Tejun Heoca23e402009-08-14 15:00:52 +09001168
1169 vmap_area_pcpu_hole = VMALLOC_END;
1170
Jeremy Fitzhardinge9b463332008-10-28 19:22:34 +11001171 vmap_initialized = true;
Nick Piggindb64fe02008-10-18 20:27:03 -07001172}
1173
Tejun Heo8fc48982009-02-20 16:29:08 +09001174/**
1175 * map_kernel_range_noflush - map kernel VM area with the specified pages
1176 * @addr: start of the VM area to map
1177 * @size: size of the VM area to map
1178 * @prot: page protection flags to use
1179 * @pages: pages to map
1180 *
1181 * Map PFN_UP(@size) pages at @addr. The VM area @addr and @size
1182 * specify should have been allocated using get_vm_area() and its
1183 * friends.
1184 *
1185 * NOTE:
1186 * This function does NOT do any cache flushing. The caller is
1187 * responsible for calling flush_cache_vmap() on to-be-mapped areas
1188 * before calling this function.
1189 *
1190 * RETURNS:
1191 * The number of pages mapped on success, -errno on failure.
1192 */
1193int map_kernel_range_noflush(unsigned long addr, unsigned long size,
1194 pgprot_t prot, struct page **pages)
1195{
1196 return vmap_page_range_noflush(addr, addr + size, prot, pages);
1197}
1198
1199/**
1200 * unmap_kernel_range_noflush - unmap kernel VM area
1201 * @addr: start of the VM area to unmap
1202 * @size: size of the VM area to unmap
1203 *
1204 * Unmap PFN_UP(@size) pages at @addr. The VM area @addr and @size
1205 * specify should have been allocated using get_vm_area() and its
1206 * friends.
1207 *
1208 * NOTE:
1209 * This function does NOT do any cache flushing. The caller is
1210 * responsible for calling flush_cache_vunmap() on to-be-mapped areas
1211 * before calling this function and flush_tlb_kernel_range() after.
1212 */
1213void unmap_kernel_range_noflush(unsigned long addr, unsigned long size)
1214{
1215 vunmap_page_range(addr, addr + size);
1216}
Huang Ying81e88fd2011-01-12 14:44:55 +08001217EXPORT_SYMBOL_GPL(unmap_kernel_range_noflush);
Tejun Heo8fc48982009-02-20 16:29:08 +09001218
1219/**
1220 * unmap_kernel_range - unmap kernel VM area and flush cache and TLB
1221 * @addr: start of the VM area to unmap
1222 * @size: size of the VM area to unmap
1223 *
1224 * Similar to unmap_kernel_range_noflush() but flushes vcache before
1225 * the unmapping and tlb after.
1226 */
Nick Piggindb64fe02008-10-18 20:27:03 -07001227void unmap_kernel_range(unsigned long addr, unsigned long size)
1228{
1229 unsigned long end = addr + size;
Tejun Heof6fcba72009-02-20 15:38:48 -08001230
1231 flush_cache_vunmap(addr, end);
Nick Piggindb64fe02008-10-18 20:27:03 -07001232 vunmap_page_range(addr, end);
1233 flush_tlb_kernel_range(addr, end);
1234}
1235
1236int map_vm_area(struct vm_struct *area, pgprot_t prot, struct page ***pages)
1237{
1238 unsigned long addr = (unsigned long)area->addr;
1239 unsigned long end = addr + area->size - PAGE_SIZE;
1240 int err;
1241
1242 err = vmap_page_range(addr, end, prot, *pages);
1243 if (err > 0) {
1244 *pages += err;
1245 err = 0;
1246 }
1247
1248 return err;
1249}
1250EXPORT_SYMBOL_GPL(map_vm_area);
1251
1252/*** Old vmalloc interfaces ***/
1253DEFINE_RWLOCK(vmlist_lock);
1254struct vm_struct *vmlist;
1255
Tejun Heocf88c792009-08-14 15:00:52 +09001256static void insert_vmalloc_vm(struct vm_struct *vm, struct vmap_area *va,
1257 unsigned long flags, void *caller)
1258{
1259 struct vm_struct *tmp, **p;
1260
1261 vm->flags = flags;
1262 vm->addr = (void *)va->va_start;
1263 vm->size = va->va_end - va->va_start;
1264 vm->caller = caller;
1265 va->private = vm;
1266 va->flags |= VM_VM_AREA;
1267
1268 write_lock(&vmlist_lock);
1269 for (p = &vmlist; (tmp = *p) != NULL; p = &tmp->next) {
1270 if (tmp->addr >= vm->addr)
1271 break;
1272 }
1273 vm->next = *p;
1274 *p = vm;
1275 write_unlock(&vmlist_lock);
1276}
1277
Nick Piggindb64fe02008-10-18 20:27:03 -07001278static struct vm_struct *__get_vm_area_node(unsigned long size,
David Miller2dca6992009-09-21 12:22:34 -07001279 unsigned long align, unsigned long flags, unsigned long start,
1280 unsigned long end, int node, gfp_t gfp_mask, void *caller)
Nick Piggindb64fe02008-10-18 20:27:03 -07001281{
1282 static struct vmap_area *va;
1283 struct vm_struct *area;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001284
Giridhar Pemmasani52fd24c2006-10-28 10:38:34 -07001285 BUG_ON(in_interrupt());
Linus Torvalds1da177e2005-04-16 15:20:36 -07001286 if (flags & VM_IOREMAP) {
1287 int bit = fls(size);
1288
1289 if (bit > IOREMAP_MAX_ORDER)
1290 bit = IOREMAP_MAX_ORDER;
1291 else if (bit < PAGE_SHIFT)
1292 bit = PAGE_SHIFT;
1293
1294 align = 1ul << bit;
1295 }
Nick Piggindb64fe02008-10-18 20:27:03 -07001296
Linus Torvalds1da177e2005-04-16 15:20:36 -07001297 size = PAGE_ALIGN(size);
OGAWA Hirofumi31be8302006-11-16 01:19:29 -08001298 if (unlikely(!size))
1299 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001300
Tejun Heocf88c792009-08-14 15:00:52 +09001301 area = kzalloc_node(sizeof(*area), gfp_mask & GFP_RECLAIM_MASK, node);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001302 if (unlikely(!area))
1303 return NULL;
1304
Linus Torvalds1da177e2005-04-16 15:20:36 -07001305 /*
1306 * We always allocate a guard page.
1307 */
1308 size += PAGE_SIZE;
1309
Nick Piggindb64fe02008-10-18 20:27:03 -07001310 va = alloc_vmap_area(size, align, start, end, node, gfp_mask);
1311 if (IS_ERR(va)) {
1312 kfree(area);
1313 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001314 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001315
Tejun Heocf88c792009-08-14 15:00:52 +09001316 insert_vmalloc_vm(area, va, flags, caller);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001317 return area;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001318}
1319
Christoph Lameter930fc452005-10-29 18:15:41 -07001320struct vm_struct *__get_vm_area(unsigned long size, unsigned long flags,
1321 unsigned long start, unsigned long end)
1322{
David Miller2dca6992009-09-21 12:22:34 -07001323 return __get_vm_area_node(size, 1, flags, start, end, -1, GFP_KERNEL,
Christoph Lameter23016962008-04-28 02:12:42 -07001324 __builtin_return_address(0));
Christoph Lameter930fc452005-10-29 18:15:41 -07001325}
Rusty Russell5992b6d2007-07-19 01:49:21 -07001326EXPORT_SYMBOL_GPL(__get_vm_area);
Christoph Lameter930fc452005-10-29 18:15:41 -07001327
Benjamin Herrenschmidtc2968612009-02-18 14:48:12 -08001328struct vm_struct *__get_vm_area_caller(unsigned long size, unsigned long flags,
1329 unsigned long start, unsigned long end,
1330 void *caller)
1331{
David Miller2dca6992009-09-21 12:22:34 -07001332 return __get_vm_area_node(size, 1, flags, start, end, -1, GFP_KERNEL,
Benjamin Herrenschmidtc2968612009-02-18 14:48:12 -08001333 caller);
1334}
1335
Linus Torvalds1da177e2005-04-16 15:20:36 -07001336/**
Simon Arlott183ff222007-10-20 01:27:18 +02001337 * get_vm_area - reserve a contiguous kernel virtual area
Linus Torvalds1da177e2005-04-16 15:20:36 -07001338 * @size: size of the area
1339 * @flags: %VM_IOREMAP for I/O mappings or VM_ALLOC
1340 *
1341 * Search an area of @size in the kernel virtual mapping area,
1342 * and reserved it for out purposes. Returns the area descriptor
1343 * on success or %NULL on failure.
1344 */
1345struct vm_struct *get_vm_area(unsigned long size, unsigned long flags)
1346{
David Miller2dca6992009-09-21 12:22:34 -07001347 return __get_vm_area_node(size, 1, flags, VMALLOC_START, VMALLOC_END,
Christoph Lameter23016962008-04-28 02:12:42 -07001348 -1, GFP_KERNEL, __builtin_return_address(0));
1349}
1350
1351struct vm_struct *get_vm_area_caller(unsigned long size, unsigned long flags,
1352 void *caller)
1353{
David Miller2dca6992009-09-21 12:22:34 -07001354 return __get_vm_area_node(size, 1, flags, VMALLOC_START, VMALLOC_END,
Christoph Lameter23016962008-04-28 02:12:42 -07001355 -1, GFP_KERNEL, caller);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001356}
1357
Nick Piggindb64fe02008-10-18 20:27:03 -07001358static struct vm_struct *find_vm_area(const void *addr)
Nick Piggin83342312006-06-23 02:03:20 -07001359{
Nick Piggindb64fe02008-10-18 20:27:03 -07001360 struct vmap_area *va;
Nick Piggin83342312006-06-23 02:03:20 -07001361
Nick Piggindb64fe02008-10-18 20:27:03 -07001362 va = find_vmap_area((unsigned long)addr);
1363 if (va && va->flags & VM_VM_AREA)
1364 return va->private;
Nick Piggin83342312006-06-23 02:03:20 -07001365
Andi Kleen7856dfe2005-05-20 14:27:57 -07001366 return NULL;
Andi Kleen7856dfe2005-05-20 14:27:57 -07001367}
1368
Linus Torvalds1da177e2005-04-16 15:20:36 -07001369/**
Simon Arlott183ff222007-10-20 01:27:18 +02001370 * remove_vm_area - find and remove a continuous kernel virtual area
Linus Torvalds1da177e2005-04-16 15:20:36 -07001371 * @addr: base address
1372 *
1373 * Search for the kernel VM area starting at @addr, and remove it.
1374 * This function returns the found VM area, but using it is NOT safe
Andi Kleen7856dfe2005-05-20 14:27:57 -07001375 * on SMP machines, except for its size or flags.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001376 */
Christoph Lameterb3bdda02008-02-04 22:28:32 -08001377struct vm_struct *remove_vm_area(const void *addr)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001378{
Nick Piggindb64fe02008-10-18 20:27:03 -07001379 struct vmap_area *va;
1380
1381 va = find_vmap_area((unsigned long)addr);
1382 if (va && va->flags & VM_VM_AREA) {
1383 struct vm_struct *vm = va->private;
1384 struct vm_struct *tmp, **p;
KAMEZAWA Hiroyukidd32c272009-09-21 17:02:32 -07001385 /*
1386 * remove from list and disallow access to this vm_struct
1387 * before unmap. (address range confliction is maintained by
1388 * vmap.)
1389 */
Nick Piggindb64fe02008-10-18 20:27:03 -07001390 write_lock(&vmlist_lock);
1391 for (p = &vmlist; (tmp = *p) != vm; p = &tmp->next)
1392 ;
1393 *p = tmp->next;
1394 write_unlock(&vmlist_lock);
1395
KAMEZAWA Hiroyukidd32c272009-09-21 17:02:32 -07001396 vmap_debug_free_range(va->va_start, va->va_end);
1397 free_unmap_vmap_area(va);
1398 vm->size -= PAGE_SIZE;
1399
Nick Piggindb64fe02008-10-18 20:27:03 -07001400 return vm;
1401 }
1402 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001403}
1404
Christoph Lameterb3bdda02008-02-04 22:28:32 -08001405static void __vunmap(const void *addr, int deallocate_pages)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001406{
1407 struct vm_struct *area;
1408
1409 if (!addr)
1410 return;
1411
1412 if ((PAGE_SIZE-1) & (unsigned long)addr) {
Arjan van de Ven4c8573e2008-07-25 19:45:37 -07001413 WARN(1, KERN_ERR "Trying to vfree() bad address (%p)\n", addr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001414 return;
1415 }
1416
1417 area = remove_vm_area(addr);
1418 if (unlikely(!area)) {
Arjan van de Ven4c8573e2008-07-25 19:45:37 -07001419 WARN(1, KERN_ERR "Trying to vfree() nonexistent vm area (%p)\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -07001420 addr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001421 return;
1422 }
1423
Ingo Molnar9a11b49a2006-07-03 00:24:33 -07001424 debug_check_no_locks_freed(addr, area->size);
Thomas Gleixner3ac7fe52008-04-30 00:55:01 -07001425 debug_check_no_obj_freed(addr, area->size);
Ingo Molnar9a11b49a2006-07-03 00:24:33 -07001426
Linus Torvalds1da177e2005-04-16 15:20:36 -07001427 if (deallocate_pages) {
1428 int i;
1429
1430 for (i = 0; i < area->nr_pages; i++) {
Christoph Lameterbf53d6f2008-02-04 22:28:34 -08001431 struct page *page = area->pages[i];
1432
1433 BUG_ON(!page);
1434 __free_page(page);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001435 }
1436
Jan Kiszka8757d5f2006-07-14 00:23:56 -07001437 if (area->flags & VM_VPAGES)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001438 vfree(area->pages);
1439 else
1440 kfree(area->pages);
1441 }
1442
1443 kfree(area);
1444 return;
1445}
1446
1447/**
1448 * vfree - release memory allocated by vmalloc()
Linus Torvalds1da177e2005-04-16 15:20:36 -07001449 * @addr: memory base address
1450 *
Simon Arlott183ff222007-10-20 01:27:18 +02001451 * Free the virtually continuous memory area starting at @addr, as
Pekka Enberg80e93ef2005-09-09 13:10:16 -07001452 * obtained from vmalloc(), vmalloc_32() or __vmalloc(). If @addr is
1453 * NULL, no operation is performed.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001454 *
Pekka Enberg80e93ef2005-09-09 13:10:16 -07001455 * Must not be called in interrupt context.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001456 */
Christoph Lameterb3bdda02008-02-04 22:28:32 -08001457void vfree(const void *addr)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001458{
1459 BUG_ON(in_interrupt());
Catalin Marinas89219d32009-06-11 13:23:19 +01001460
1461 kmemleak_free(addr);
1462
Linus Torvalds1da177e2005-04-16 15:20:36 -07001463 __vunmap(addr, 1);
1464}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001465EXPORT_SYMBOL(vfree);
1466
1467/**
1468 * vunmap - release virtual mapping obtained by vmap()
Linus Torvalds1da177e2005-04-16 15:20:36 -07001469 * @addr: memory base address
1470 *
1471 * Free the virtually contiguous memory area starting at @addr,
1472 * which was created from the page array passed to vmap().
1473 *
Pekka Enberg80e93ef2005-09-09 13:10:16 -07001474 * Must not be called in interrupt context.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001475 */
Christoph Lameterb3bdda02008-02-04 22:28:32 -08001476void vunmap(const void *addr)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001477{
1478 BUG_ON(in_interrupt());
Peter Zijlstra34754b62009-02-25 16:04:03 +01001479 might_sleep();
Linus Torvalds1da177e2005-04-16 15:20:36 -07001480 __vunmap(addr, 0);
1481}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001482EXPORT_SYMBOL(vunmap);
1483
1484/**
1485 * vmap - map an array of pages into virtually contiguous space
Linus Torvalds1da177e2005-04-16 15:20:36 -07001486 * @pages: array of page pointers
1487 * @count: number of pages to map
1488 * @flags: vm_area->flags
1489 * @prot: page protection for the mapping
1490 *
1491 * Maps @count pages from @pages into contiguous kernel virtual
1492 * space.
1493 */
1494void *vmap(struct page **pages, unsigned int count,
1495 unsigned long flags, pgprot_t prot)
1496{
1497 struct vm_struct *area;
1498
Peter Zijlstra34754b62009-02-25 16:04:03 +01001499 might_sleep();
1500
Jan Beulich44813742009-09-21 17:03:05 -07001501 if (count > totalram_pages)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001502 return NULL;
1503
Christoph Lameter23016962008-04-28 02:12:42 -07001504 area = get_vm_area_caller((count << PAGE_SHIFT), flags,
1505 __builtin_return_address(0));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001506 if (!area)
1507 return NULL;
Christoph Lameter23016962008-04-28 02:12:42 -07001508
Linus Torvalds1da177e2005-04-16 15:20:36 -07001509 if (map_vm_area(area, prot, &pages)) {
1510 vunmap(area->addr);
1511 return NULL;
1512 }
1513
1514 return area->addr;
1515}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001516EXPORT_SYMBOL(vmap);
1517
David Miller2dca6992009-09-21 12:22:34 -07001518static void *__vmalloc_node(unsigned long size, unsigned long align,
1519 gfp_t gfp_mask, pgprot_t prot,
Nick Piggindb64fe02008-10-18 20:27:03 -07001520 int node, void *caller);
Adrian Bunke31d9eb2008-02-04 22:29:09 -08001521static void *__vmalloc_area_node(struct vm_struct *area, gfp_t gfp_mask,
Christoph Lameter23016962008-04-28 02:12:42 -07001522 pgprot_t prot, int node, void *caller)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001523{
Dave Hansen22943ab2011-05-24 17:12:18 -07001524 const int order = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001525 struct page **pages;
1526 unsigned int nr_pages, array_size, i;
Jan Beulich976d6df2009-12-14 17:58:39 -08001527 gfp_t nested_gfp = (gfp_mask & GFP_RECLAIM_MASK) | __GFP_ZERO;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001528
1529 nr_pages = (area->size - PAGE_SIZE) >> PAGE_SHIFT;
1530 array_size = (nr_pages * sizeof(struct page *));
1531
1532 area->nr_pages = nr_pages;
1533 /* Please note that the recursion is strictly bounded. */
Jan Kiszka8757d5f2006-07-14 00:23:56 -07001534 if (array_size > PAGE_SIZE) {
Jan Beulich976d6df2009-12-14 17:58:39 -08001535 pages = __vmalloc_node(array_size, 1, nested_gfp|__GFP_HIGHMEM,
Christoph Lameter23016962008-04-28 02:12:42 -07001536 PAGE_KERNEL, node, caller);
Jan Kiszka8757d5f2006-07-14 00:23:56 -07001537 area->flags |= VM_VPAGES;
Andrew Morton286e1ea2006-10-17 00:09:57 -07001538 } else {
Jan Beulich976d6df2009-12-14 17:58:39 -08001539 pages = kmalloc_node(array_size, nested_gfp, node);
Andrew Morton286e1ea2006-10-17 00:09:57 -07001540 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001541 area->pages = pages;
Christoph Lameter23016962008-04-28 02:12:42 -07001542 area->caller = caller;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001543 if (!area->pages) {
1544 remove_vm_area(area->addr);
1545 kfree(area);
1546 return NULL;
1547 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001548
1549 for (i = 0; i < area->nr_pages; i++) {
Christoph Lameterbf53d6f2008-02-04 22:28:34 -08001550 struct page *page;
Dave Hansen22943ab2011-05-24 17:12:18 -07001551 gfp_t tmp_mask = gfp_mask | __GFP_NOWARN;
Christoph Lameterbf53d6f2008-02-04 22:28:34 -08001552
Christoph Lameter930fc452005-10-29 18:15:41 -07001553 if (node < 0)
Dave Hansen22943ab2011-05-24 17:12:18 -07001554 page = alloc_page(tmp_mask);
Christoph Lameter930fc452005-10-29 18:15:41 -07001555 else
Dave Hansen22943ab2011-05-24 17:12:18 -07001556 page = alloc_pages_node(node, tmp_mask, order);
Christoph Lameterbf53d6f2008-02-04 22:28:34 -08001557
1558 if (unlikely(!page)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001559 /* Successfully allocated i pages, free them in __vunmap() */
1560 area->nr_pages = i;
1561 goto fail;
1562 }
Christoph Lameterbf53d6f2008-02-04 22:28:34 -08001563 area->pages[i] = page;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001564 }
1565
1566 if (map_vm_area(area, prot, &pages))
1567 goto fail;
1568 return area->addr;
1569
1570fail:
Dave Hansen22943ab2011-05-24 17:12:18 -07001571 warn_alloc_failed(gfp_mask, order, "vmalloc: allocation failure, "
1572 "allocated %ld of %ld bytes\n",
1573 (area->nr_pages*PAGE_SIZE), area->size);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001574 vfree(area->addr);
1575 return NULL;
1576}
1577
David Rientjesd0a21262011-01-13 15:46:02 -08001578/**
1579 * __vmalloc_node_range - allocate virtually contiguous memory
1580 * @size: allocation size
1581 * @align: desired alignment
1582 * @start: vm area range start
1583 * @end: vm area range end
1584 * @gfp_mask: flags for the page level allocator
1585 * @prot: protection mask for the allocated pages
1586 * @node: node to use for allocation or -1
1587 * @caller: caller's return address
1588 *
1589 * Allocate enough pages to cover @size from the page level
1590 * allocator with @gfp_mask flags. Map them into contiguous
1591 * kernel virtual space, using a pagetable protection of @prot.
1592 */
1593void *__vmalloc_node_range(unsigned long size, unsigned long align,
1594 unsigned long start, unsigned long end, gfp_t gfp_mask,
1595 pgprot_t prot, int node, void *caller)
Christoph Lameter930fc452005-10-29 18:15:41 -07001596{
David Rientjesd0a21262011-01-13 15:46:02 -08001597 struct vm_struct *area;
1598 void *addr;
1599 unsigned long real_size = size;
1600
1601 size = PAGE_ALIGN(size);
1602 if (!size || (size >> PAGE_SHIFT) > totalram_pages)
1603 return NULL;
1604
1605 area = __get_vm_area_node(size, align, VM_ALLOC, start, end, node,
1606 gfp_mask, caller);
1607
1608 if (!area)
1609 return NULL;
1610
1611 addr = __vmalloc_area_node(area, gfp_mask, prot, node, caller);
Catalin Marinas89219d32009-06-11 13:23:19 +01001612
1613 /*
1614 * A ref_count = 3 is needed because the vm_struct and vmap_area
1615 * structures allocated in the __get_vm_area_node() function contain
1616 * references to the virtual address of the vmalloc'ed block.
1617 */
David Rientjesd0a21262011-01-13 15:46:02 -08001618 kmemleak_alloc(addr, real_size, 3, gfp_mask);
Catalin Marinas89219d32009-06-11 13:23:19 +01001619
1620 return addr;
Christoph Lameter930fc452005-10-29 18:15:41 -07001621}
1622
Linus Torvalds1da177e2005-04-16 15:20:36 -07001623/**
Christoph Lameter930fc452005-10-29 18:15:41 -07001624 * __vmalloc_node - allocate virtually contiguous memory
Linus Torvalds1da177e2005-04-16 15:20:36 -07001625 * @size: allocation size
David Miller2dca6992009-09-21 12:22:34 -07001626 * @align: desired alignment
Linus Torvalds1da177e2005-04-16 15:20:36 -07001627 * @gfp_mask: flags for the page level allocator
1628 * @prot: protection mask for the allocated pages
Randy Dunlapd44e0782005-11-07 01:01:10 -08001629 * @node: node to use for allocation or -1
Randy Dunlapc85d1942008-05-01 04:34:48 -07001630 * @caller: caller's return address
Linus Torvalds1da177e2005-04-16 15:20:36 -07001631 *
1632 * Allocate enough pages to cover @size from the page level
1633 * allocator with @gfp_mask flags. Map them into contiguous
1634 * kernel virtual space, using a pagetable protection of @prot.
1635 */
David Miller2dca6992009-09-21 12:22:34 -07001636static void *__vmalloc_node(unsigned long size, unsigned long align,
1637 gfp_t gfp_mask, pgprot_t prot,
1638 int node, void *caller)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001639{
David Rientjesd0a21262011-01-13 15:46:02 -08001640 return __vmalloc_node_range(size, align, VMALLOC_START, VMALLOC_END,
1641 gfp_mask, prot, node, caller);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001642}
1643
Christoph Lameter930fc452005-10-29 18:15:41 -07001644void *__vmalloc(unsigned long size, gfp_t gfp_mask, pgprot_t prot)
1645{
David Miller2dca6992009-09-21 12:22:34 -07001646 return __vmalloc_node(size, 1, gfp_mask, prot, -1,
Christoph Lameter23016962008-04-28 02:12:42 -07001647 __builtin_return_address(0));
Christoph Lameter930fc452005-10-29 18:15:41 -07001648}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001649EXPORT_SYMBOL(__vmalloc);
1650
Dave Younge1ca7782010-10-26 14:22:06 -07001651static inline void *__vmalloc_node_flags(unsigned long size,
1652 int node, gfp_t flags)
1653{
1654 return __vmalloc_node(size, 1, flags, PAGE_KERNEL,
1655 node, __builtin_return_address(0));
1656}
1657
Linus Torvalds1da177e2005-04-16 15:20:36 -07001658/**
1659 * vmalloc - allocate virtually contiguous memory
Linus Torvalds1da177e2005-04-16 15:20:36 -07001660 * @size: allocation size
Linus Torvalds1da177e2005-04-16 15:20:36 -07001661 * Allocate enough pages to cover @size from the page level
1662 * allocator and map them into contiguous kernel virtual space.
1663 *
Michael Opdenackerc1c88972006-10-03 23:21:02 +02001664 * For tight control over page level allocator and protection flags
Linus Torvalds1da177e2005-04-16 15:20:36 -07001665 * use __vmalloc() instead.
1666 */
1667void *vmalloc(unsigned long size)
1668{
Dave Younge1ca7782010-10-26 14:22:06 -07001669 return __vmalloc_node_flags(size, -1, GFP_KERNEL | __GFP_HIGHMEM);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001670}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001671EXPORT_SYMBOL(vmalloc);
1672
Christoph Lameter930fc452005-10-29 18:15:41 -07001673/**
Dave Younge1ca7782010-10-26 14:22:06 -07001674 * vzalloc - allocate virtually contiguous memory with zero fill
1675 * @size: allocation size
1676 * Allocate enough pages to cover @size from the page level
1677 * allocator and map them into contiguous kernel virtual space.
1678 * The memory allocated is set to zero.
1679 *
1680 * For tight control over page level allocator and protection flags
1681 * use __vmalloc() instead.
1682 */
1683void *vzalloc(unsigned long size)
1684{
1685 return __vmalloc_node_flags(size, -1,
1686 GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO);
1687}
1688EXPORT_SYMBOL(vzalloc);
1689
1690/**
Rolf Eike Beeread04082006-09-27 01:50:13 -07001691 * vmalloc_user - allocate zeroed virtually contiguous memory for userspace
1692 * @size: allocation size
Nick Piggin83342312006-06-23 02:03:20 -07001693 *
Rolf Eike Beeread04082006-09-27 01:50:13 -07001694 * The resulting memory area is zeroed so it can be mapped to userspace
1695 * without leaking data.
Nick Piggin83342312006-06-23 02:03:20 -07001696 */
1697void *vmalloc_user(unsigned long size)
1698{
1699 struct vm_struct *area;
1700 void *ret;
1701
David Miller2dca6992009-09-21 12:22:34 -07001702 ret = __vmalloc_node(size, SHMLBA,
1703 GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO,
Glauber Costa84877842009-01-06 14:39:19 -08001704 PAGE_KERNEL, -1, __builtin_return_address(0));
Eric Dumazet2b4ac442006-11-10 12:27:48 -08001705 if (ret) {
Nick Piggindb64fe02008-10-18 20:27:03 -07001706 area = find_vm_area(ret);
Eric Dumazet2b4ac442006-11-10 12:27:48 -08001707 area->flags |= VM_USERMAP;
Eric Dumazet2b4ac442006-11-10 12:27:48 -08001708 }
Nick Piggin83342312006-06-23 02:03:20 -07001709 return ret;
1710}
1711EXPORT_SYMBOL(vmalloc_user);
1712
1713/**
Christoph Lameter930fc452005-10-29 18:15:41 -07001714 * vmalloc_node - allocate memory on a specific node
Christoph Lameter930fc452005-10-29 18:15:41 -07001715 * @size: allocation size
Randy Dunlapd44e0782005-11-07 01:01:10 -08001716 * @node: numa node
Christoph Lameter930fc452005-10-29 18:15:41 -07001717 *
1718 * Allocate enough pages to cover @size from the page level
1719 * allocator and map them into contiguous kernel virtual space.
1720 *
Michael Opdenackerc1c88972006-10-03 23:21:02 +02001721 * For tight control over page level allocator and protection flags
Christoph Lameter930fc452005-10-29 18:15:41 -07001722 * use __vmalloc() instead.
1723 */
1724void *vmalloc_node(unsigned long size, int node)
1725{
David Miller2dca6992009-09-21 12:22:34 -07001726 return __vmalloc_node(size, 1, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL,
Christoph Lameter23016962008-04-28 02:12:42 -07001727 node, __builtin_return_address(0));
Christoph Lameter930fc452005-10-29 18:15:41 -07001728}
1729EXPORT_SYMBOL(vmalloc_node);
1730
Dave Younge1ca7782010-10-26 14:22:06 -07001731/**
1732 * vzalloc_node - allocate memory on a specific node with zero fill
1733 * @size: allocation size
1734 * @node: numa node
1735 *
1736 * Allocate enough pages to cover @size from the page level
1737 * allocator and map them into contiguous kernel virtual space.
1738 * The memory allocated is set to zero.
1739 *
1740 * For tight control over page level allocator and protection flags
1741 * use __vmalloc_node() instead.
1742 */
1743void *vzalloc_node(unsigned long size, int node)
1744{
1745 return __vmalloc_node_flags(size, node,
1746 GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO);
1747}
1748EXPORT_SYMBOL(vzalloc_node);
1749
Pavel Pisa4dc3b162005-05-01 08:59:25 -07001750#ifndef PAGE_KERNEL_EXEC
1751# define PAGE_KERNEL_EXEC PAGE_KERNEL
1752#endif
1753
Linus Torvalds1da177e2005-04-16 15:20:36 -07001754/**
1755 * vmalloc_exec - allocate virtually contiguous, executable memory
Linus Torvalds1da177e2005-04-16 15:20:36 -07001756 * @size: allocation size
1757 *
1758 * Kernel-internal function to allocate enough pages to cover @size
1759 * the page level allocator and map them into contiguous and
1760 * executable kernel virtual space.
1761 *
Michael Opdenackerc1c88972006-10-03 23:21:02 +02001762 * For tight control over page level allocator and protection flags
Linus Torvalds1da177e2005-04-16 15:20:36 -07001763 * use __vmalloc() instead.
1764 */
1765
Linus Torvalds1da177e2005-04-16 15:20:36 -07001766void *vmalloc_exec(unsigned long size)
1767{
David Miller2dca6992009-09-21 12:22:34 -07001768 return __vmalloc_node(size, 1, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL_EXEC,
Glauber Costa84877842009-01-06 14:39:19 -08001769 -1, __builtin_return_address(0));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001770}
1771
Andi Kleen0d08e0d2007-05-02 19:27:12 +02001772#if defined(CONFIG_64BIT) && defined(CONFIG_ZONE_DMA32)
Benjamin Herrenschmidt7ac674f2007-07-19 01:49:10 -07001773#define GFP_VMALLOC32 GFP_DMA32 | GFP_KERNEL
Andi Kleen0d08e0d2007-05-02 19:27:12 +02001774#elif defined(CONFIG_64BIT) && defined(CONFIG_ZONE_DMA)
Benjamin Herrenschmidt7ac674f2007-07-19 01:49:10 -07001775#define GFP_VMALLOC32 GFP_DMA | GFP_KERNEL
Andi Kleen0d08e0d2007-05-02 19:27:12 +02001776#else
1777#define GFP_VMALLOC32 GFP_KERNEL
1778#endif
1779
Linus Torvalds1da177e2005-04-16 15:20:36 -07001780/**
1781 * vmalloc_32 - allocate virtually contiguous memory (32bit addressable)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001782 * @size: allocation size
1783 *
1784 * Allocate enough 32bit PA addressable pages to cover @size from the
1785 * page level allocator and map them into contiguous kernel virtual space.
1786 */
1787void *vmalloc_32(unsigned long size)
1788{
David Miller2dca6992009-09-21 12:22:34 -07001789 return __vmalloc_node(size, 1, GFP_VMALLOC32, PAGE_KERNEL,
Glauber Costa84877842009-01-06 14:39:19 -08001790 -1, __builtin_return_address(0));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001791}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001792EXPORT_SYMBOL(vmalloc_32);
1793
Nick Piggin83342312006-06-23 02:03:20 -07001794/**
Rolf Eike Beeread04082006-09-27 01:50:13 -07001795 * vmalloc_32_user - allocate zeroed virtually contiguous 32bit memory
Nick Piggin83342312006-06-23 02:03:20 -07001796 * @size: allocation size
Rolf Eike Beeread04082006-09-27 01:50:13 -07001797 *
1798 * The resulting memory area is 32bit addressable and zeroed so it can be
1799 * mapped to userspace without leaking data.
Nick Piggin83342312006-06-23 02:03:20 -07001800 */
1801void *vmalloc_32_user(unsigned long size)
1802{
1803 struct vm_struct *area;
1804 void *ret;
1805
David Miller2dca6992009-09-21 12:22:34 -07001806 ret = __vmalloc_node(size, 1, GFP_VMALLOC32 | __GFP_ZERO, PAGE_KERNEL,
Glauber Costa84877842009-01-06 14:39:19 -08001807 -1, __builtin_return_address(0));
Eric Dumazet2b4ac442006-11-10 12:27:48 -08001808 if (ret) {
Nick Piggindb64fe02008-10-18 20:27:03 -07001809 area = find_vm_area(ret);
Eric Dumazet2b4ac442006-11-10 12:27:48 -08001810 area->flags |= VM_USERMAP;
Eric Dumazet2b4ac442006-11-10 12:27:48 -08001811 }
Nick Piggin83342312006-06-23 02:03:20 -07001812 return ret;
1813}
1814EXPORT_SYMBOL(vmalloc_32_user);
1815
KAMEZAWA Hiroyukid0107eb2009-09-21 17:02:34 -07001816/*
1817 * small helper routine , copy contents to buf from addr.
1818 * If the page is not present, fill zero.
1819 */
1820
1821static int aligned_vread(char *buf, char *addr, unsigned long count)
1822{
1823 struct page *p;
1824 int copied = 0;
1825
1826 while (count) {
1827 unsigned long offset, length;
1828
1829 offset = (unsigned long)addr & ~PAGE_MASK;
1830 length = PAGE_SIZE - offset;
1831 if (length > count)
1832 length = count;
1833 p = vmalloc_to_page(addr);
1834 /*
1835 * To do safe access to this _mapped_ area, we need
1836 * lock. But adding lock here means that we need to add
1837 * overhead of vmalloc()/vfree() calles for this _debug_
1838 * interface, rarely used. Instead of that, we'll use
1839 * kmap() and get small overhead in this access function.
1840 */
1841 if (p) {
1842 /*
1843 * we can expect USER0 is not used (see vread/vwrite's
1844 * function description)
1845 */
1846 void *map = kmap_atomic(p, KM_USER0);
1847 memcpy(buf, map + offset, length);
1848 kunmap_atomic(map, KM_USER0);
1849 } else
1850 memset(buf, 0, length);
1851
1852 addr += length;
1853 buf += length;
1854 copied += length;
1855 count -= length;
1856 }
1857 return copied;
1858}
1859
1860static int aligned_vwrite(char *buf, char *addr, unsigned long count)
1861{
1862 struct page *p;
1863 int copied = 0;
1864
1865 while (count) {
1866 unsigned long offset, length;
1867
1868 offset = (unsigned long)addr & ~PAGE_MASK;
1869 length = PAGE_SIZE - offset;
1870 if (length > count)
1871 length = count;
1872 p = vmalloc_to_page(addr);
1873 /*
1874 * To do safe access to this _mapped_ area, we need
1875 * lock. But adding lock here means that we need to add
1876 * overhead of vmalloc()/vfree() calles for this _debug_
1877 * interface, rarely used. Instead of that, we'll use
1878 * kmap() and get small overhead in this access function.
1879 */
1880 if (p) {
1881 /*
1882 * we can expect USER0 is not used (see vread/vwrite's
1883 * function description)
1884 */
1885 void *map = kmap_atomic(p, KM_USER0);
1886 memcpy(map + offset, buf, length);
1887 kunmap_atomic(map, KM_USER0);
1888 }
1889 addr += length;
1890 buf += length;
1891 copied += length;
1892 count -= length;
1893 }
1894 return copied;
1895}
1896
1897/**
1898 * vread() - read vmalloc area in a safe way.
1899 * @buf: buffer for reading data
1900 * @addr: vm address.
1901 * @count: number of bytes to be read.
1902 *
1903 * Returns # of bytes which addr and buf should be increased.
1904 * (same number to @count). Returns 0 if [addr...addr+count) doesn't
1905 * includes any intersect with alive vmalloc area.
1906 *
1907 * This function checks that addr is a valid vmalloc'ed area, and
1908 * copy data from that area to a given buffer. If the given memory range
1909 * of [addr...addr+count) includes some valid address, data is copied to
1910 * proper area of @buf. If there are memory holes, they'll be zero-filled.
1911 * IOREMAP area is treated as memory hole and no copy is done.
1912 *
1913 * If [addr...addr+count) doesn't includes any intersects with alive
1914 * vm_struct area, returns 0.
1915 * @buf should be kernel's buffer. Because this function uses KM_USER0,
1916 * the caller should guarantee KM_USER0 is not used.
1917 *
1918 * Note: In usual ops, vread() is never necessary because the caller
1919 * should know vmalloc() area is valid and can use memcpy().
1920 * This is for routines which have to access vmalloc area without
1921 * any informaion, as /dev/kmem.
1922 *
1923 */
1924
Linus Torvalds1da177e2005-04-16 15:20:36 -07001925long vread(char *buf, char *addr, unsigned long count)
1926{
1927 struct vm_struct *tmp;
1928 char *vaddr, *buf_start = buf;
KAMEZAWA Hiroyukid0107eb2009-09-21 17:02:34 -07001929 unsigned long buflen = count;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001930 unsigned long n;
1931
1932 /* Don't allow overflow */
1933 if ((unsigned long) addr + count < count)
1934 count = -(unsigned long) addr;
1935
1936 read_lock(&vmlist_lock);
KAMEZAWA Hiroyukid0107eb2009-09-21 17:02:34 -07001937 for (tmp = vmlist; count && tmp; tmp = tmp->next) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001938 vaddr = (char *) tmp->addr;
1939 if (addr >= vaddr + tmp->size - PAGE_SIZE)
1940 continue;
1941 while (addr < vaddr) {
1942 if (count == 0)
1943 goto finished;
1944 *buf = '\0';
1945 buf++;
1946 addr++;
1947 count--;
1948 }
1949 n = vaddr + tmp->size - PAGE_SIZE - addr;
KAMEZAWA Hiroyukid0107eb2009-09-21 17:02:34 -07001950 if (n > count)
1951 n = count;
1952 if (!(tmp->flags & VM_IOREMAP))
1953 aligned_vread(buf, addr, n);
1954 else /* IOREMAP area is treated as memory hole */
1955 memset(buf, 0, n);
1956 buf += n;
1957 addr += n;
1958 count -= n;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001959 }
1960finished:
1961 read_unlock(&vmlist_lock);
KAMEZAWA Hiroyukid0107eb2009-09-21 17:02:34 -07001962
1963 if (buf == buf_start)
1964 return 0;
1965 /* zero-fill memory holes */
1966 if (buf != buf_start + buflen)
1967 memset(buf, 0, buflen - (buf - buf_start));
1968
1969 return buflen;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001970}
1971
KAMEZAWA Hiroyukid0107eb2009-09-21 17:02:34 -07001972/**
1973 * vwrite() - write vmalloc area in a safe way.
1974 * @buf: buffer for source data
1975 * @addr: vm address.
1976 * @count: number of bytes to be read.
1977 *
1978 * Returns # of bytes which addr and buf should be incresed.
1979 * (same number to @count).
1980 * If [addr...addr+count) doesn't includes any intersect with valid
1981 * vmalloc area, returns 0.
1982 *
1983 * This function checks that addr is a valid vmalloc'ed area, and
1984 * copy data from a buffer to the given addr. If specified range of
1985 * [addr...addr+count) includes some valid address, data is copied from
1986 * proper area of @buf. If there are memory holes, no copy to hole.
1987 * IOREMAP area is treated as memory hole and no copy is done.
1988 *
1989 * If [addr...addr+count) doesn't includes any intersects with alive
1990 * vm_struct area, returns 0.
1991 * @buf should be kernel's buffer. Because this function uses KM_USER0,
1992 * the caller should guarantee KM_USER0 is not used.
1993 *
1994 * Note: In usual ops, vwrite() is never necessary because the caller
1995 * should know vmalloc() area is valid and can use memcpy().
1996 * This is for routines which have to access vmalloc area without
1997 * any informaion, as /dev/kmem.
KAMEZAWA Hiroyukid0107eb2009-09-21 17:02:34 -07001998 */
1999
Linus Torvalds1da177e2005-04-16 15:20:36 -07002000long vwrite(char *buf, char *addr, unsigned long count)
2001{
2002 struct vm_struct *tmp;
KAMEZAWA Hiroyukid0107eb2009-09-21 17:02:34 -07002003 char *vaddr;
2004 unsigned long n, buflen;
2005 int copied = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002006
2007 /* Don't allow overflow */
2008 if ((unsigned long) addr + count < count)
2009 count = -(unsigned long) addr;
KAMEZAWA Hiroyukid0107eb2009-09-21 17:02:34 -07002010 buflen = count;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002011
2012 read_lock(&vmlist_lock);
KAMEZAWA Hiroyukid0107eb2009-09-21 17:02:34 -07002013 for (tmp = vmlist; count && tmp; tmp = tmp->next) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002014 vaddr = (char *) tmp->addr;
2015 if (addr >= vaddr + tmp->size - PAGE_SIZE)
2016 continue;
2017 while (addr < vaddr) {
2018 if (count == 0)
2019 goto finished;
2020 buf++;
2021 addr++;
2022 count--;
2023 }
2024 n = vaddr + tmp->size - PAGE_SIZE - addr;
KAMEZAWA Hiroyukid0107eb2009-09-21 17:02:34 -07002025 if (n > count)
2026 n = count;
2027 if (!(tmp->flags & VM_IOREMAP)) {
2028 aligned_vwrite(buf, addr, n);
2029 copied++;
2030 }
2031 buf += n;
2032 addr += n;
2033 count -= n;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002034 }
2035finished:
2036 read_unlock(&vmlist_lock);
KAMEZAWA Hiroyukid0107eb2009-09-21 17:02:34 -07002037 if (!copied)
2038 return 0;
2039 return buflen;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002040}
Nick Piggin83342312006-06-23 02:03:20 -07002041
2042/**
2043 * remap_vmalloc_range - map vmalloc pages to userspace
Nick Piggin83342312006-06-23 02:03:20 -07002044 * @vma: vma to cover (map full range of vma)
2045 * @addr: vmalloc memory
2046 * @pgoff: number of pages into addr before first page to map
Randy Dunlap76824862008-03-19 17:00:40 -07002047 *
2048 * Returns: 0 for success, -Exxx on failure
Nick Piggin83342312006-06-23 02:03:20 -07002049 *
2050 * This function checks that addr is a valid vmalloc'ed area, and
2051 * that it is big enough to cover the vma. Will return failure if
2052 * that criteria isn't met.
2053 *
Robert P. J. Day72fd4a32007-02-10 01:45:59 -08002054 * Similar to remap_pfn_range() (see mm/memory.c)
Nick Piggin83342312006-06-23 02:03:20 -07002055 */
2056int remap_vmalloc_range(struct vm_area_struct *vma, void *addr,
2057 unsigned long pgoff)
2058{
2059 struct vm_struct *area;
2060 unsigned long uaddr = vma->vm_start;
2061 unsigned long usize = vma->vm_end - vma->vm_start;
Nick Piggin83342312006-06-23 02:03:20 -07002062
2063 if ((PAGE_SIZE-1) & (unsigned long)addr)
2064 return -EINVAL;
2065
Nick Piggindb64fe02008-10-18 20:27:03 -07002066 area = find_vm_area(addr);
Nick Piggin83342312006-06-23 02:03:20 -07002067 if (!area)
Nick Piggindb64fe02008-10-18 20:27:03 -07002068 return -EINVAL;
Nick Piggin83342312006-06-23 02:03:20 -07002069
2070 if (!(area->flags & VM_USERMAP))
Nick Piggindb64fe02008-10-18 20:27:03 -07002071 return -EINVAL;
Nick Piggin83342312006-06-23 02:03:20 -07002072
2073 if (usize + (pgoff << PAGE_SHIFT) > area->size - PAGE_SIZE)
Nick Piggindb64fe02008-10-18 20:27:03 -07002074 return -EINVAL;
Nick Piggin83342312006-06-23 02:03:20 -07002075
2076 addr += pgoff << PAGE_SHIFT;
2077 do {
2078 struct page *page = vmalloc_to_page(addr);
Nick Piggindb64fe02008-10-18 20:27:03 -07002079 int ret;
2080
Nick Piggin83342312006-06-23 02:03:20 -07002081 ret = vm_insert_page(vma, uaddr, page);
2082 if (ret)
2083 return ret;
2084
2085 uaddr += PAGE_SIZE;
2086 addr += PAGE_SIZE;
2087 usize -= PAGE_SIZE;
2088 } while (usize > 0);
2089
2090 /* Prevent "things" like memory migration? VM_flags need a cleanup... */
2091 vma->vm_flags |= VM_RESERVED;
2092
Nick Piggindb64fe02008-10-18 20:27:03 -07002093 return 0;
Nick Piggin83342312006-06-23 02:03:20 -07002094}
2095EXPORT_SYMBOL(remap_vmalloc_range);
2096
Christoph Hellwig1eeb66a2007-05-08 00:27:03 -07002097/*
2098 * Implement a stub for vmalloc_sync_all() if the architecture chose not to
2099 * have one.
2100 */
2101void __attribute__((weak)) vmalloc_sync_all(void)
2102{
2103}
Jeremy Fitzhardinge5f4352f2007-07-17 18:37:04 -07002104
2105
Martin Schwidefsky2f569af2008-02-08 04:22:04 -08002106static int f(pte_t *pte, pgtable_t table, unsigned long addr, void *data)
Jeremy Fitzhardinge5f4352f2007-07-17 18:37:04 -07002107{
2108 /* apply_to_page_range() does all the hard work. */
2109 return 0;
2110}
2111
2112/**
2113 * alloc_vm_area - allocate a range of kernel address space
2114 * @size: size of the area
Randy Dunlap76824862008-03-19 17:00:40 -07002115 *
2116 * Returns: NULL on failure, vm_struct on success
Jeremy Fitzhardinge5f4352f2007-07-17 18:37:04 -07002117 *
2118 * This function reserves a range of kernel address space, and
2119 * allocates pagetables to map that range. No actual mappings
2120 * are created. If the kernel address space is not shared
2121 * between processes, it syncs the pagetable across all
2122 * processes.
2123 */
2124struct vm_struct *alloc_vm_area(size_t size)
2125{
2126 struct vm_struct *area;
2127
Christoph Lameter23016962008-04-28 02:12:42 -07002128 area = get_vm_area_caller(size, VM_IOREMAP,
2129 __builtin_return_address(0));
Jeremy Fitzhardinge5f4352f2007-07-17 18:37:04 -07002130 if (area == NULL)
2131 return NULL;
2132
2133 /*
2134 * This ensures that page tables are constructed for this region
2135 * of kernel virtual address space and mapped into init_mm.
2136 */
2137 if (apply_to_page_range(&init_mm, (unsigned long)area->addr,
2138 area->size, f, NULL)) {
2139 free_vm_area(area);
2140 return NULL;
2141 }
2142
Jeremy Fitzhardinge5f4352f2007-07-17 18:37:04 -07002143 return area;
2144}
2145EXPORT_SYMBOL_GPL(alloc_vm_area);
2146
2147void free_vm_area(struct vm_struct *area)
2148{
2149 struct vm_struct *ret;
2150 ret = remove_vm_area(area->addr);
2151 BUG_ON(ret != area);
2152 kfree(area);
2153}
2154EXPORT_SYMBOL_GPL(free_vm_area);
Christoph Lametera10aa572008-04-28 02:12:40 -07002155
Tejun Heo4f8b02b2010-09-03 18:22:47 +02002156#ifdef CONFIG_SMP
Tejun Heoca23e402009-08-14 15:00:52 +09002157static struct vmap_area *node_to_va(struct rb_node *n)
2158{
2159 return n ? rb_entry(n, struct vmap_area, rb_node) : NULL;
2160}
2161
2162/**
2163 * pvm_find_next_prev - find the next and prev vmap_area surrounding @end
2164 * @end: target address
2165 * @pnext: out arg for the next vmap_area
2166 * @pprev: out arg for the previous vmap_area
2167 *
2168 * Returns: %true if either or both of next and prev are found,
2169 * %false if no vmap_area exists
2170 *
2171 * Find vmap_areas end addresses of which enclose @end. ie. if not
2172 * NULL, *pnext->va_end > @end and *pprev->va_end <= @end.
2173 */
2174static bool pvm_find_next_prev(unsigned long end,
2175 struct vmap_area **pnext,
2176 struct vmap_area **pprev)
2177{
2178 struct rb_node *n = vmap_area_root.rb_node;
2179 struct vmap_area *va = NULL;
2180
2181 while (n) {
2182 va = rb_entry(n, struct vmap_area, rb_node);
2183 if (end < va->va_end)
2184 n = n->rb_left;
2185 else if (end > va->va_end)
2186 n = n->rb_right;
2187 else
2188 break;
2189 }
2190
2191 if (!va)
2192 return false;
2193
2194 if (va->va_end > end) {
2195 *pnext = va;
2196 *pprev = node_to_va(rb_prev(&(*pnext)->rb_node));
2197 } else {
2198 *pprev = va;
2199 *pnext = node_to_va(rb_next(&(*pprev)->rb_node));
2200 }
2201 return true;
2202}
2203
2204/**
2205 * pvm_determine_end - find the highest aligned address between two vmap_areas
2206 * @pnext: in/out arg for the next vmap_area
2207 * @pprev: in/out arg for the previous vmap_area
2208 * @align: alignment
2209 *
2210 * Returns: determined end address
2211 *
2212 * Find the highest aligned address between *@pnext and *@pprev below
2213 * VMALLOC_END. *@pnext and *@pprev are adjusted so that the aligned
2214 * down address is between the end addresses of the two vmap_areas.
2215 *
2216 * Please note that the address returned by this function may fall
2217 * inside *@pnext vmap_area. The caller is responsible for checking
2218 * that.
2219 */
2220static unsigned long pvm_determine_end(struct vmap_area **pnext,
2221 struct vmap_area **pprev,
2222 unsigned long align)
2223{
2224 const unsigned long vmalloc_end = VMALLOC_END & ~(align - 1);
2225 unsigned long addr;
2226
2227 if (*pnext)
2228 addr = min((*pnext)->va_start & ~(align - 1), vmalloc_end);
2229 else
2230 addr = vmalloc_end;
2231
2232 while (*pprev && (*pprev)->va_end > addr) {
2233 *pnext = *pprev;
2234 *pprev = node_to_va(rb_prev(&(*pnext)->rb_node));
2235 }
2236
2237 return addr;
2238}
2239
2240/**
2241 * pcpu_get_vm_areas - allocate vmalloc areas for percpu allocator
2242 * @offsets: array containing offset of each area
2243 * @sizes: array containing size of each area
2244 * @nr_vms: the number of areas to allocate
2245 * @align: alignment, all entries in @offsets and @sizes must be aligned to this
Tejun Heoca23e402009-08-14 15:00:52 +09002246 *
2247 * Returns: kmalloc'd vm_struct pointer array pointing to allocated
2248 * vm_structs on success, %NULL on failure
2249 *
2250 * Percpu allocator wants to use congruent vm areas so that it can
2251 * maintain the offsets among percpu areas. This function allocates
David Rientjesec3f64f2011-01-13 15:46:01 -08002252 * congruent vmalloc areas for it with GFP_KERNEL. These areas tend to
2253 * be scattered pretty far, distance between two areas easily going up
2254 * to gigabytes. To avoid interacting with regular vmallocs, these
2255 * areas are allocated from top.
Tejun Heoca23e402009-08-14 15:00:52 +09002256 *
2257 * Despite its complicated look, this allocator is rather simple. It
2258 * does everything top-down and scans areas from the end looking for
2259 * matching slot. While scanning, if any of the areas overlaps with
2260 * existing vmap_area, the base address is pulled down to fit the
2261 * area. Scanning is repeated till all the areas fit and then all
2262 * necessary data structres are inserted and the result is returned.
2263 */
2264struct vm_struct **pcpu_get_vm_areas(const unsigned long *offsets,
2265 const size_t *sizes, int nr_vms,
David Rientjesec3f64f2011-01-13 15:46:01 -08002266 size_t align)
Tejun Heoca23e402009-08-14 15:00:52 +09002267{
2268 const unsigned long vmalloc_start = ALIGN(VMALLOC_START, align);
2269 const unsigned long vmalloc_end = VMALLOC_END & ~(align - 1);
2270 struct vmap_area **vas, *prev, *next;
2271 struct vm_struct **vms;
2272 int area, area2, last_area, term_area;
2273 unsigned long base, start, end, last_end;
2274 bool purged = false;
2275
Tejun Heoca23e402009-08-14 15:00:52 +09002276 /* verify parameters and allocate data structures */
2277 BUG_ON(align & ~PAGE_MASK || !is_power_of_2(align));
2278 for (last_area = 0, area = 0; area < nr_vms; area++) {
2279 start = offsets[area];
2280 end = start + sizes[area];
2281
2282 /* is everything aligned properly? */
2283 BUG_ON(!IS_ALIGNED(offsets[area], align));
2284 BUG_ON(!IS_ALIGNED(sizes[area], align));
2285
2286 /* detect the area with the highest address */
2287 if (start > offsets[last_area])
2288 last_area = area;
2289
2290 for (area2 = 0; area2 < nr_vms; area2++) {
2291 unsigned long start2 = offsets[area2];
2292 unsigned long end2 = start2 + sizes[area2];
2293
2294 if (area2 == area)
2295 continue;
2296
2297 BUG_ON(start2 >= start && start2 < end);
2298 BUG_ON(end2 <= end && end2 > start);
2299 }
2300 }
2301 last_end = offsets[last_area] + sizes[last_area];
2302
2303 if (vmalloc_end - vmalloc_start < last_end) {
2304 WARN_ON(true);
2305 return NULL;
2306 }
2307
David Rientjesec3f64f2011-01-13 15:46:01 -08002308 vms = kzalloc(sizeof(vms[0]) * nr_vms, GFP_KERNEL);
2309 vas = kzalloc(sizeof(vas[0]) * nr_vms, GFP_KERNEL);
Tejun Heoca23e402009-08-14 15:00:52 +09002310 if (!vas || !vms)
2311 goto err_free;
2312
2313 for (area = 0; area < nr_vms; area++) {
David Rientjesec3f64f2011-01-13 15:46:01 -08002314 vas[area] = kzalloc(sizeof(struct vmap_area), GFP_KERNEL);
2315 vms[area] = kzalloc(sizeof(struct vm_struct), GFP_KERNEL);
Tejun Heoca23e402009-08-14 15:00:52 +09002316 if (!vas[area] || !vms[area])
2317 goto err_free;
2318 }
2319retry:
2320 spin_lock(&vmap_area_lock);
2321
2322 /* start scanning - we scan from the top, begin with the last area */
2323 area = term_area = last_area;
2324 start = offsets[area];
2325 end = start + sizes[area];
2326
2327 if (!pvm_find_next_prev(vmap_area_pcpu_hole, &next, &prev)) {
2328 base = vmalloc_end - last_end;
2329 goto found;
2330 }
2331 base = pvm_determine_end(&next, &prev, align) - end;
2332
2333 while (true) {
2334 BUG_ON(next && next->va_end <= base + end);
2335 BUG_ON(prev && prev->va_end > base + end);
2336
2337 /*
2338 * base might have underflowed, add last_end before
2339 * comparing.
2340 */
2341 if (base + last_end < vmalloc_start + last_end) {
2342 spin_unlock(&vmap_area_lock);
2343 if (!purged) {
2344 purge_vmap_area_lazy();
2345 purged = true;
2346 goto retry;
2347 }
2348 goto err_free;
2349 }
2350
2351 /*
2352 * If next overlaps, move base downwards so that it's
2353 * right below next and then recheck.
2354 */
2355 if (next && next->va_start < base + end) {
2356 base = pvm_determine_end(&next, &prev, align) - end;
2357 term_area = area;
2358 continue;
2359 }
2360
2361 /*
2362 * If prev overlaps, shift down next and prev and move
2363 * base so that it's right below new next and then
2364 * recheck.
2365 */
2366 if (prev && prev->va_end > base + start) {
2367 next = prev;
2368 prev = node_to_va(rb_prev(&next->rb_node));
2369 base = pvm_determine_end(&next, &prev, align) - end;
2370 term_area = area;
2371 continue;
2372 }
2373
2374 /*
2375 * This area fits, move on to the previous one. If
2376 * the previous one is the terminal one, we're done.
2377 */
2378 area = (area + nr_vms - 1) % nr_vms;
2379 if (area == term_area)
2380 break;
2381 start = offsets[area];
2382 end = start + sizes[area];
2383 pvm_find_next_prev(base + end, &next, &prev);
2384 }
2385found:
2386 /* we've found a fitting base, insert all va's */
2387 for (area = 0; area < nr_vms; area++) {
2388 struct vmap_area *va = vas[area];
2389
2390 va->va_start = base + offsets[area];
2391 va->va_end = va->va_start + sizes[area];
2392 __insert_vmap_area(va);
2393 }
2394
2395 vmap_area_pcpu_hole = base + offsets[last_area];
2396
2397 spin_unlock(&vmap_area_lock);
2398
2399 /* insert all vm's */
2400 for (area = 0; area < nr_vms; area++)
2401 insert_vmalloc_vm(vms[area], vas[area], VM_ALLOC,
2402 pcpu_get_vm_areas);
2403
2404 kfree(vas);
2405 return vms;
2406
2407err_free:
2408 for (area = 0; area < nr_vms; area++) {
2409 if (vas)
2410 kfree(vas[area]);
2411 if (vms)
2412 kfree(vms[area]);
2413 }
2414 kfree(vas);
2415 kfree(vms);
2416 return NULL;
2417}
2418
2419/**
2420 * pcpu_free_vm_areas - free vmalloc areas for percpu allocator
2421 * @vms: vm_struct pointer array returned by pcpu_get_vm_areas()
2422 * @nr_vms: the number of allocated areas
2423 *
2424 * Free vm_structs and the array allocated by pcpu_get_vm_areas().
2425 */
2426void pcpu_free_vm_areas(struct vm_struct **vms, int nr_vms)
2427{
2428 int i;
2429
2430 for (i = 0; i < nr_vms; i++)
2431 free_vm_area(vms[i]);
2432 kfree(vms);
2433}
Tejun Heo4f8b02b2010-09-03 18:22:47 +02002434#endif /* CONFIG_SMP */
Christoph Lametera10aa572008-04-28 02:12:40 -07002435
2436#ifdef CONFIG_PROC_FS
2437static void *s_start(struct seq_file *m, loff_t *pos)
Namhyung Kime199b5d2010-10-26 14:22:03 -07002438 __acquires(&vmlist_lock)
Christoph Lametera10aa572008-04-28 02:12:40 -07002439{
2440 loff_t n = *pos;
2441 struct vm_struct *v;
2442
2443 read_lock(&vmlist_lock);
2444 v = vmlist;
2445 while (n > 0 && v) {
2446 n--;
2447 v = v->next;
2448 }
2449 if (!n)
2450 return v;
2451
2452 return NULL;
2453
2454}
2455
2456static void *s_next(struct seq_file *m, void *p, loff_t *pos)
2457{
2458 struct vm_struct *v = p;
2459
2460 ++*pos;
2461 return v->next;
2462}
2463
2464static void s_stop(struct seq_file *m, void *p)
Namhyung Kime199b5d2010-10-26 14:22:03 -07002465 __releases(&vmlist_lock)
Christoph Lametera10aa572008-04-28 02:12:40 -07002466{
2467 read_unlock(&vmlist_lock);
2468}
2469
Eric Dumazeta47a1262008-07-23 21:27:38 -07002470static void show_numa_info(struct seq_file *m, struct vm_struct *v)
2471{
2472 if (NUMA_BUILD) {
2473 unsigned int nr, *counters = m->private;
2474
2475 if (!counters)
2476 return;
2477
2478 memset(counters, 0, nr_node_ids * sizeof(unsigned int));
2479
2480 for (nr = 0; nr < v->nr_pages; nr++)
2481 counters[page_to_nid(v->pages[nr])]++;
2482
2483 for_each_node_state(nr, N_HIGH_MEMORY)
2484 if (counters[nr])
2485 seq_printf(m, " N%u=%u", nr, counters[nr]);
2486 }
2487}
2488
Christoph Lametera10aa572008-04-28 02:12:40 -07002489static int s_show(struct seq_file *m, void *p)
2490{
2491 struct vm_struct *v = p;
2492
2493 seq_printf(m, "0x%p-0x%p %7ld",
2494 v->addr, v->addr + v->size, v->size);
2495
Joe Perches62c70bc2011-01-13 15:45:52 -08002496 if (v->caller)
2497 seq_printf(m, " %pS", v->caller);
Christoph Lameter23016962008-04-28 02:12:42 -07002498
Christoph Lametera10aa572008-04-28 02:12:40 -07002499 if (v->nr_pages)
2500 seq_printf(m, " pages=%d", v->nr_pages);
2501
2502 if (v->phys_addr)
Kenji Kaneshigeffa71f32010-06-18 12:22:40 +09002503 seq_printf(m, " phys=%llx", (unsigned long long)v->phys_addr);
Christoph Lametera10aa572008-04-28 02:12:40 -07002504
2505 if (v->flags & VM_IOREMAP)
2506 seq_printf(m, " ioremap");
2507
2508 if (v->flags & VM_ALLOC)
2509 seq_printf(m, " vmalloc");
2510
2511 if (v->flags & VM_MAP)
2512 seq_printf(m, " vmap");
2513
2514 if (v->flags & VM_USERMAP)
2515 seq_printf(m, " user");
2516
2517 if (v->flags & VM_VPAGES)
2518 seq_printf(m, " vpages");
2519
Eric Dumazeta47a1262008-07-23 21:27:38 -07002520 show_numa_info(m, v);
Christoph Lametera10aa572008-04-28 02:12:40 -07002521 seq_putc(m, '\n');
2522 return 0;
2523}
2524
Alexey Dobriyan5f6a6a92008-10-06 03:50:47 +04002525static const struct seq_operations vmalloc_op = {
Christoph Lametera10aa572008-04-28 02:12:40 -07002526 .start = s_start,
2527 .next = s_next,
2528 .stop = s_stop,
2529 .show = s_show,
2530};
Alexey Dobriyan5f6a6a92008-10-06 03:50:47 +04002531
2532static int vmalloc_open(struct inode *inode, struct file *file)
2533{
2534 unsigned int *ptr = NULL;
2535 int ret;
2536
Kulikov Vasiliy51980ac2010-08-09 17:19:58 -07002537 if (NUMA_BUILD) {
Alexey Dobriyan5f6a6a92008-10-06 03:50:47 +04002538 ptr = kmalloc(nr_node_ids * sizeof(unsigned int), GFP_KERNEL);
Kulikov Vasiliy51980ac2010-08-09 17:19:58 -07002539 if (ptr == NULL)
2540 return -ENOMEM;
2541 }
Alexey Dobriyan5f6a6a92008-10-06 03:50:47 +04002542 ret = seq_open(file, &vmalloc_op);
2543 if (!ret) {
2544 struct seq_file *m = file->private_data;
2545 m->private = ptr;
2546 } else
2547 kfree(ptr);
2548 return ret;
2549}
2550
2551static const struct file_operations proc_vmalloc_operations = {
2552 .open = vmalloc_open,
2553 .read = seq_read,
2554 .llseek = seq_lseek,
2555 .release = seq_release_private,
2556};
2557
2558static int __init proc_vmalloc_init(void)
2559{
2560 proc_create("vmallocinfo", S_IRUSR, NULL, &proc_vmalloc_operations);
2561 return 0;
2562}
2563module_init(proc_vmalloc_init);
Christoph Lametera10aa572008-04-28 02:12:40 -07002564#endif
2565