linux/mm/vmalloc.c
<<
4.11
4.11 >>4.
4.4.11
4.11 4.11 4.11
4. 4.11 Prefs 4. 11
11
4.411
411
11
11
11
   1/*
   2 *  linux/mm/vmalloc.c
   3 *
   4 *  Copyright (C) 1993  Linus Torvalds
   5 *  Support of BIGMEM added by Gerhard Wichert, Siemens AG, July 1999
   6 *  SMP-safe vmalloc/vfree/ioremap, Tigran Aivazian <tigran@veritas.com>, May 2000
   7 *  Major rework to support vmap/vunmap, Christoph Hellwig, SGI, August 2002
   8 *  Numa awareness, Christoph Lameter, SGI, June 2005
   9 */
  10
  11#include <linux/vmalloc.h>
  12#include <linux/mm.h>
  13#include <linux/module.h>
  14#include <linux/highmem.h>
  15#include <linux/sched.h>
  16#include <linux/slab.h>
  17#include <linux/spinlock.h>
  18#include <linux/interrupt.h>
  19#include <linux/proc_fs.h>
  20#include <linux/seq_file.h>
  21#include <linux/debugobjects.h>
  22#include <linux/kallsyms.h>
  23#include <linux/list.h>
  24#include <linux/rbtree.h>
  25#include <linux/radix-tree.h>
  26#include <linux/rcupdate.h>
  27#include <linux/pfn.h>
  28#include <linux/kmemleak.h>
  29#include <linux/atomic.h>
  30#include <asm/uaccess.h>
  31#include <asm/tlbflush.h>
  32#include <asm/shmparam.h>
  33
  34/*** Page table manipulation functions ***/
  35
  36static 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
  47static void vunmap_pmd_range(pud_t *pud, unsigned long addr, unsigned long end)
  48{
  49        pmd_t *pmd;
  50        unsigned long next;
  51
  52        pmd = pmd_offset(pud, addr);
  53        do {
  54                next = pmd_addr_end(addr, end);
  55                if (pmd_none_or_clear_bad(pmd))
  56                        continue;
  57                vunmap_pte_range(pmd, addr, next);
  58        } while (pmd++, addr = next, addr != end);
  59}
  60
  61static void vunmap_pud_range(pgd_t *pgd, unsigned long addr, unsigned long end)
  62{
  63        pud_t *pud;
  64        unsigned long next;
  65
  66        pud = pud_offset(pgd, addr);
  67        do {
  68                next = pud_addr_end(addr, end);
  69                if (pud_none_or_clear_bad(pud))
  70                        continue;
  71                vunmap_pmd_range(pud, addr, next);
  72        } while (pud++, addr = next, addr != end);
  73}
  74
  75static void vunmap_page_range(unsigned long addr, unsigned long end)
  76{
  77        pgd_t *pgd;
  78        unsigned long next;
  79
  80        BUG_ON(addr >= end);
  81        pgd = pgd_offset_k(addr);
  82        do {
  83                next = pgd_addr_end(addr, end);
  84                if (pgd_none_or_clear_bad(pgd))
  85                        continue;
  86                vunmap_pud_range(pgd, addr, next);
  87        } while (pgd++, addr = next, addr != end);
  88}
  89
  90static int vmap_pte_range(pmd_t *pmd, unsigned long addr,
  91                unsigned long end, pgprot_t prot, struct page **pages, int *nr)
  92{
  93        pte_t *pte;
  94
  95        /*
  96         * nr is a running index into the array which helps higher level
  97         * callers keep track of where we're up to.
  98         */
  99
 100        pte = pte_alloc_kernel(pmd, addr);
 101        if (!pte)
 102                return -ENOMEM;
 103        do {
 104                struct page *page = pages[*nr];
 105
 106                if (WARN_ON(!pte_none(*pte)))
 107                        return -EBUSY;
 108                if (WARN_ON(!page))
 109                        return -ENOMEM;
 110                set_pte_at(&init_mm, addr, pte, mk_pte(page, prot));
 111                (*nr)++;
 112        } while (pte++, addr += PAGE_SIZE, addr != end);
 113        return 0;
 114}
 115
 116static int vmap_pmd_range(pud_t *pud, unsigned long addr,
 117                unsigned long end, pgprot_t prot, struct page **pages, int *nr)
 118{
 119        pmd_t *pmd;
 120        unsigned long next;
 121
 122        pmd = pmd_alloc(&init_mm, pud, addr);
 123        if (!pmd)
 124                return -ENOMEM;
 125        do {
 126                next = pmd_addr_end(addr, end);
 127                if (vmap_pte_range(pmd, addr, next, prot, pages, nr))
 128                        return -ENOMEM;
 129        } while (pmd++, addr = next, addr != end);
 130        return 0;
 131}
 132
 133static int vmap_pud_range(pgd_t *pgd, unsigned long addr,
 134                unsigned long end, pgprot_t prot, struct page **pages, int *nr)
 135{
 136        pud_t *pud;
 137        unsigned long next;
 138
 139        pud = pud_alloc(&init_mm, pgd, addr);
 140        if (!pud)
 141                return -ENOMEM;
 142        do {
 143                next = pud_addr_end(addr, end);
 144                if (vmap_pmd_range(pud, addr, next, prot, pages, nr))
 145                        return -ENOMEM;
 146        } while (pud++, addr = next, addr != end);
 147        return 0;
 148}
 149
 150/*
 151 * Set up page tables in kva (addr, end). The ptes shall have prot "prot", and
 152 * will have pfns corresponding to the "pages" array.
 153 *
 154 * Ie. pte at addr+N*PAGE_SIZE shall point to pfn corresponding to pages[N]
 155 */
 156static int vmap_page_range_noflush(unsigned long start, unsigned long end,
 157                                   pgprot_t prot, struct page **pages)
 158{
 159        pgd_t *pgd;
 160        unsigned long next;
 161        unsigned long addr = start;
 162        int err = 0;
 163        int nr = 0;
 164
 165        BUG_ON(addr >= end);
 166        pgd = pgd_offset_k(addr);
 167        do {
 168                next = pgd_addr_end(addr, end);
 169                err = vmap_pud_range(pgd, addr, next, prot, pages, &nr);
 170                if (err)
 171                        return err;
 172        } while (pgd++, addr = next, addr != end);
 173
 174        return nr;
 175}
 176
 177static 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
 187int is_vmalloc_or_module_addr(const void *x)
 188{
 189        /*
 190         * ARM, x86-64 and sparc64 put modules in a special place,
 191         * and fall back on vmalloc() if that fails. Others
 192         * just put it in the vmalloc space.
 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
 202/*
 203 * Walk a vmap address to the struct page it maps.
 204 */
 205struct page *vmalloc_to_page(const void *vmalloc_addr)
 206{
 207        unsigned long addr = (unsigned long) vmalloc_addr;
 208        struct page *page = NULL;
 209        pgd_t *pgd = pgd_offset_k(addr);
 210
 211        /*
 212         * XXX we might need to change this if we add VIRTUAL_BUG_ON for
 213         * architectures that do not vmalloc module space
 214         */
 215        VIRTUAL_BUG_ON(!is_vmalloc_or_module_addr(vmalloc_addr));
 216
 217        if (!pgd_none(*pgd)) {
 218                pud_t *pud = pud_offset(pgd, addr);
 219                if (!pud_none(*pud)) {
 220                        pmd_t *pmd = pmd_offset(pud, addr);
 221                        if (!pmd_none(*pmd)) {
 222                                pte_t *ptep, pte;
 223
 224                                ptep = pte_offset_map(pmd, addr);
 225                                pte = *ptep;
 226                                if (pte_present(pte))
 227                                        page = pte_page(pte);
 228                                pte_unmap(ptep);
 229                        }
 230                }
 231        }
 232        return page;
 233}
 234EXPORT_SYMBOL(vmalloc_to_page);
 235
 236/*
 237 * Map a vmalloc()-space virtual address to the physical page frame number.
 238 */
 239unsigned long vmalloc_to_pfn(const void *vmalloc_addr)
 240{
 241        return page_to_pfn(vmalloc_to_page(vmalloc_addr));
 242}
 243EXPORT_SYMBOL(vmalloc_to_pfn);
 244
 245
 246/*** Global kva allocator ***/
 247
 248#define VM_LAZY_FREE    0x01
 249#define VM_LAZY_FREEING 0x02
 250#define VM_VM_AREA      0x04
 251
 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        struct vm_struct *vm;
 260        struct rcu_head rcu_head;
 261};
 262
 263static DEFINE_SPINLOCK(vmap_area_lock);
 264static LIST_HEAD(vmap_area_list);
 265static 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
 273static unsigned long vmap_area_pcpu_hole;
 274
 275static struct vmap_area *__find_vmap_area(unsigned long addr)
 276{
 277        struct rb_node *n = vmap_area_root.rb_node;
 278
 279        while (n) {
 280                struct vmap_area *va;
 281
 282                va = rb_entry(n, struct vmap_area, rb_node);
 283                if (addr < va->va_start)
 284                        n = n->rb_left;
 285                else if (addr > va->va_start)
 286                        n = n->rb_right;
 287                else
 288                        return va;
 289        }
 290
 291        return NULL;
 292}
 293
 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) {
 301                struct vmap_area *tmp_va;
 302
 303                parent = *p;
 304                tmp_va = rb_entry(parent, struct vmap_area, rb_node);
 305                if (va->va_start < tmp_va->va_end)
 306                        p = &(*p)->rb_left;
 307                else if (va->va_end > tmp_va->va_start)
 308                        p = &(*p)->rb_right;
 309                else
 310                        BUG();
 311        }
 312
 313        rb_link_node(&va->rb_node, parent, p);
 314        rb_insert_color(&va->rb_node, &vmap_area_root);
 315
 316        /* address-sort this list so it is usable like the vmlist */
 317        tmp = rb_prev(&va->rb_node);
 318        if (tmp) {
 319                struct vmap_area *prev;
 320                prev = rb_entry(tmp, struct vmap_area, rb_node);
 321                list_add_rcu(&va->list, &prev->list);
 322        } else
 323                list_add_rcu(&va->list, &vmap_area_list);
 324}
 325
 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;
 339        unsigned long addr;
 340        int purged = 0;
 341        struct vmap_area *first;
 342
 343        BUG_ON(!size);
 344        BUG_ON(size & ~PAGE_MASK);
 345        BUG_ON(!is_power_of_2(align));
 346
 347        va = kmalloc_node(sizeof(struct vmap_area),
 348                        gfp_mask & GFP_RECLAIM_MASK, node);
 349        if (unlikely(!va))
 350                return ERR_PTR(-ENOMEM);
 351
 352retry:
 353        spin_lock(&vmap_area_lock);
 354        /*
 355         * Invalidate cache if we have more permissive parameters.
 356         * cached_hole_size notes the largest hole noticed _below_
 357         * the vmap_area cached in free_vmap_cache: if size fits
 358         * into that hole, we want to scan from vstart to reuse
 359         * the hole instead of allocating above free_vmap_cache.
 360         * Note that __free_vmap_area may update free_vmap_cache
 361         * without updating cached_hole_size or cached_align.
 362         */
 363        if (!free_vmap_cache ||
 364                        size < cached_hole_size ||
 365                        vstart < cached_vstart ||
 366                        align < cached_align) {
 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;
 374
 375        /* find starting point for our search */
 376        if (free_vmap_cache) {
 377                first = rb_entry(free_vmap_cache, struct vmap_area, rb_node);
 378                addr = ALIGN(first->va_end, align);
 379                if (addr < vstart)
 380                        goto nocache;
 381                if (addr + size - 1 < addr)
 382                        goto overflow;
 383
 384        } else {
 385                addr = ALIGN(vstart, align);
 386                if (addr + size - 1 < addr)
 387                        goto overflow;
 388
 389                n = vmap_area_root.rb_node;
 390                first = NULL;
 391
 392                while (n) {
 393                        struct vmap_area *tmp;
 394                        tmp = rb_entry(n, struct vmap_area, rb_node);
 395                        if (tmp->va_end >= addr) {
 396                                first = tmp;
 397                                if (tmp->va_start <= addr)
 398                                        break;
 399                                n = n->rb_left;
 400                        } else
 401                                n = n->rb_right;
 402                }
 403
 404                if (!first)
 405                        goto found;
 406        }
 407
 408        /* from the starting point, walk areas until a suitable hole is found */
 409        while (addr + size > first->va_start && addr + size <= vend) {
 410                if (addr + cached_hole_size < first->va_start)
 411                        cached_hole_size = first->va_start - addr;
 412                addr = ALIGN(first->va_end, align);
 413                if (addr + size - 1 < addr)
 414                        goto overflow;
 415
 416                if (list_is_last(&first->list, &vmap_area_list))
 417                        goto found;
 418
 419                first = list_entry(first->list.next,
 420                                struct vmap_area, list);
 421        }
 422
 423found:
 424        if (addr + size > vend)
 425                goto overflow;
 426
 427        va->va_start = addr;
 428        va->va_end = addr + size;
 429        va->flags = 0;
 430        __insert_vmap_area(va);
 431        free_vmap_cache = &va->rb_node;
 432        spin_unlock(&vmap_area_lock);
 433
 434        BUG_ON(va->va_start & (align-1));
 435        BUG_ON(va->va_start < vstart);
 436        BUG_ON(va->va_end > vend);
 437
 438        return va;
 439
 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);
 453}
 454
 455static void __free_vmap_area(struct vmap_area *va)
 456{
 457        BUG_ON(RB_EMPTY_NODE(&va->rb_node));
 458
 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        }
 474        rb_erase(&va->rb_node, &vmap_area_root);
 475        RB_CLEAR_NODE(&va->rb_node);
 476        list_del_rcu(&va->list);
 477
 478        /*
 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
 487        kfree_rcu(va, rcu_head);
 488}
 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
 508static 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
 529/*
 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
 556/* for per-CPU blocks */
 557static void purge_fragmented_blocks_allcpus(void);
 558
 559/*
 560 * 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/*
 569 * 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{
 581        static DEFINE_SPINLOCK(purge_lock);
 582        LIST_HEAD(valist);
 583        struct vmap_area *va;
 584        struct vmap_area *n_va;
 585        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) {
 593                if (!spin_trylock(&purge_lock))
 594                        return;
 595        } else
 596                spin_lock(&purge_lock);
 597
 598        if (sync)
 599                purge_fragmented_blocks_allcpus();
 600
 601        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;
 609                        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
 616        if (nr)
 617                atomic_sub(nr, &vmap_lazy_nr);
 618
 619        if (nr || force_flush)
 620                flush_tlb_kernel_range(*start, *end);
 621
 622        if (nr) {
 623                spin_lock(&vmap_area_lock);
 624                list_for_each_entry_safe(va, n_va, &valist, purge_list)
 625                        __free_vmap_area(va);
 626                spin_unlock(&vmap_area_lock);
 627        }
 628        spin_unlock(&purge_lock);
 629}
 630
 631/*
 632 * 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/*
 643 * 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
 649        __purge_vmap_area_lazy(&start, &end, 1, 0);
 650}
 651
 652/*
 653 * Free a vmap area, caller ensuring that the area has been unmapped
 654 * and flush_cache_vunmap had been called for the correct range
 655 * previously.
 656 */
 657static void free_vmap_area_noflush(struct vmap_area *va)
 658{
 659        va->flags |= VM_LAZY_FREE;
 660        atomic_add((va->va_end - va->va_start) >> PAGE_SHIFT, &vmap_lazy_nr);
 661        if (unlikely(atomic_read(&vmap_lazy_nr) > lazy_max_pages()))
 662                try_purge_vmap_area_lazy();
 663}
 664
 665/*
 666 * 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/*
 676 * 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
 684static 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() */
 728#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))
 732
 733#define VMAP_BLOCK_SIZE         (VMAP_BBMAP_BITS * PAGE_SIZE)
 734
 735static bool vmap_initialized __read_mostly = false;
 736
 737struct vmap_block_queue {
 738        spinlock_t lock;
 739        struct list_head free;
 740};
 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);
 749        struct list_head free_list;
 750        struct rcu_head rcu_head;
 751        struct list_head purge;
 752};
 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);
 797        if (IS_ERR(va)) {
 798                kfree(vb);
 799                return ERR_CAST(va);
 800        }
 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);
 816
 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);
 827        list_add_rcu(&vb->free_list, &vbq->free);
 828        spin_unlock(&vbq->lock);
 829        put_cpu_var(vmap_block_queue);
 830
 831        return vb;
 832}
 833
 834static void free_vmap_block(struct vmap_block *vb)
 835{
 836        struct vmap_block *tmp;
 837        unsigned long vb_idx;
 838
 839        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
 845        free_vmap_area_noflush(vb->va);
 846        kfree_rcu(vb, rcu_head);
 847}
 848
 849static 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
 897static 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;
 903        int purge = 0;
 904
 905        BUG_ON(size & ~PAGE_MASK);
 906        BUG_ON(size > PAGE_SIZE*VMAP_MAX_ALLOC);
 907        if (WARN_ON(size == 0)) {
 908                /*
 909                 * Allocating 0 bytes isn't what caller wants since
 910                 * get_order(0) returns funny result. Just warn and terminate
 911                 * early.
 912                 */
 913                return NULL;
 914        }
 915        order = get_order(size);
 916
 917again:
 918        rcu_read_lock();
 919        vbq = &get_cpu_var(vmap_block_queue);
 920        list_for_each_entry_rcu(vb, &vbq->free, free_list) {
 921                int i;
 922
 923                spin_lock(&vb->lock);
 924                if (vb->free < 1UL << order)
 925                        goto next;
 926
 927                i = bitmap_find_free_region(vb->alloc_map,
 928                                                VMAP_BBMAP_BITS, order);
 929
 930                if (i < 0) {
 931                        if (vb->free + vb->dirty == VMAP_BBMAP_BITS) {
 932                                /* fragmented and no outstanding allocations */
 933                                BUG_ON(vb->dirty != VMAP_BBMAP_BITS);
 934                                purge = 1;
 935                        }
 936                        goto next;
 937                }
 938                addr = vb->va->va_start + (i << PAGE_SHIFT);
 939                BUG_ON(addr_to_vb_idx(addr) !=
 940                                addr_to_vb_idx(vb->va->va_start));
 941                vb->free -= 1UL << order;
 942                if (vb->free == 0) {
 943                        spin_lock(&vbq->lock);
 944                        list_del_rcu(&vb->free_list);
 945                        spin_unlock(&vbq->lock);
 946                }
 947                spin_unlock(&vb->lock);
 948                break;
 949next:
 950                spin_unlock(&vb->lock);
 951        }
 952
 953        if (purge)
 954                purge_fragmented_blocks_thiscpu();
 955
 956        put_cpu_var(vmap_block_queue);
 957        rcu_read_unlock();
 958
 959        if (!addr) {
 960                vb = new_vmap_block(gfp_mask);
 961                if (IS_ERR(vb))
 962                        return vb;
 963                goto again;
 964        }
 965
 966        return (void *)addr;
 967}
 968
 969static void vb_free(const void *addr, unsigned long size)
 970{
 971        unsigned long offset;
 972        unsigned long vb_idx;
 973        unsigned int order;
 974        struct vmap_block *vb;
 975
 976        BUG_ON(size & ~PAGE_MASK);
 977        BUG_ON(size > PAGE_SIZE*VMAP_MAX_ALLOC);
 978
 979        flush_cache_vunmap((unsigned long)addr, (unsigned long)addr + size);
 980
 981        order = get_order(size);
 982
 983        offset = (unsigned long)addr & (VMAP_BLOCK_SIZE - 1);
 984
 985        vb_idx = addr_to_vb_idx((unsigned long)addr);
 986        rcu_read_lock();
 987        vb = radix_tree_lookup(&vmap_block_tree, vb_idx);
 988        rcu_read_unlock();
 989        BUG_ON(!vb);
 990
 991        vunmap_page_range((unsigned long)addr, (unsigned long)addr + size);
 992
 993        spin_lock(&vb->lock);
 994        BUG_ON(bitmap_allocate_region(vb->dirty_map, offset >> PAGE_SHIFT, order));
 995
 996        vb->dirty += 1UL << order;
 997        if (vb->dirty == VMAP_BBMAP_BITS) {
 998                BUG_ON(vb->free);
 999                spin_unlock(&vb->lock);
1000                free_vmap_block(vb);
1001        } else
1002                spin_unlock(&vb->lock);
1003}
1004
1005/**
1006 * vm_unmap_aliases - unmap outstanding lazy aliases in the vmap layer
1007 *
1008 * The vmap/vmalloc layer lazily flushes kernel virtual mappings primarily
1009 * to amortize TLB flushing overheads. What this means is that any page you
1010 * have now, may, in a former life, have been mapped into kernel virtual
1011 * address by the vmap layer and so there might be some CPUs with TLB entries
1012 * still referencing that page (additional to the regular 1:1 kernel mapping).
1013 *
1014 * vm_unmap_aliases flushes all such lazy mappings. After it returns, we can
1015 * be sure that none of the pages we have control over will have any aliases
1016 * from the vmap layer.
1017 */
1018void vm_unmap_aliases(void)
1019{
1020        unsigned long start = ULONG_MAX, end = 0;
1021        int cpu;
1022        int flush = 0;
1023
1024        if (unlikely(!vmap_initialized))
1025                return;
1026
1027        for_each_possible_cpu(cpu) {
1028                struct vmap_block_queue *vbq = &per_cpu(vmap_block_queue, cpu);
1029                struct vmap_block *vb;
1030
1031                rcu_read_lock();
1032                list_for_each_entry_rcu(vb, &vbq->free, free_list) {
1033                        int i;
1034
1035                        spin_lock(&vb->lock);
1036                        i = find_first_bit(vb->dirty_map, VMAP_BBMAP_BITS);
1037                        while (i < VMAP_BBMAP_BITS) {
1038                                unsigned long s, e;
1039                                int j;
1040                                j = find_next_zero_bit(vb->dirty_map,
1041                                        VMAP_BBMAP_BITS, i);
1042
1043                                s = vb->va->va_start + (i << PAGE_SHIFT);
1044                                e = vb->va->va_start + (j << PAGE_SHIFT);
1045                                flush = 1;
1046
1047                                if (s < start)
1048                                        start = s;
1049                                if (e > end)
1050                                        end = e;
1051
1052                                i = j;
1053                                i = find_next_bit(vb->dirty_map,
1054                                                        VMAP_BBMAP_BITS, i);
1055                        }
1056                        spin_unlock(&vb->lock);
1057                }
1058                rcu_read_unlock();
1059        }
1060
1061        __purge_vmap_area_lazy(&start, &end, 1, flush);
1062}
1063EXPORT_SYMBOL_GPL(vm_unmap_aliases);
1064
1065/**
1066 * vm_unmap_ram - unmap linear kernel address space set up by vm_map_ram
1067 * @mem: the pointer returned by vm_map_ram
1068 * @count: the count passed to that vm_map_ram call (cannot unmap partial)
1069 */
1070void vm_unmap_ram(const void *mem, unsigned int count)
1071{
1072        unsigned long size = count << PAGE_SHIFT;
1073        unsigned long addr = (unsigned long)mem;
1074
1075        BUG_ON(!addr);
1076        BUG_ON(addr < VMALLOC_START);
1077        BUG_ON(addr > VMALLOC_END);
1078        BUG_ON(addr & (PAGE_SIZE-1));
1079
1080        debug_check_no_locks_freed(mem, size);
1081        vmap_debug_free_range(addr, addr+size);
1082
1083        if (likely(count <= VMAP_MAX_ALLOC))
1084                vb_free(mem, size);
1085        else
1086                free_unmap_vmap_area_addr(addr);
1087}
1088EXPORT_SYMBOL(vm_unmap_ram);
1089
1090/**
1091 * vm_map_ram - map pages linearly into kernel virtual address (vmalloc space)
1092 * @pages: an array of pointers to the pages to be mapped
1093 * @count: number of pages
1094 * @node: prefer to allocate data structures on this node
1095 * @prot: memory protection to use. PAGE_KERNEL for regular RAM
1096 *
1097 * Returns: a pointer to the address that has been mapped, or %NULL on failure
1098 */
1099void *vm_map_ram(struct page **pages, unsigned int count, int node, pgprot_t prot)
1100{
1101        unsigned long size = count << PAGE_SHIFT;
1102        unsigned long addr;
1103        void *mem;
1104
1105        if (likely(count <= VMAP_MAX_ALLOC)) {
1106                mem = vb_alloc(size, GFP_KERNEL);
1107                if (IS_ERR(mem))
1108                        return NULL;
1109                addr = (unsigned long)mem;
1110        } else {
1111                struct vmap_area *va;
1112                va = alloc_vmap_area(size, PAGE_SIZE,
1113                                VMALLOC_START, VMALLOC_END, node, GFP_KERNEL);
1114                if (IS_ERR(va))
1115                        return NULL;
1116
1117                addr = va->va_start;
1118                mem = (void *)addr;
1119        }
1120        if (vmap_page_range(addr, addr + size, prot, pages) < 0) {
1121                vm_unmap_ram(mem, count);
1122                return NULL;
1123        }
1124        return mem;
1125}
1126EXPORT_SYMBOL(vm_map_ram);
1127
1128/**
1129 * vm_area_add_early - add vmap area early during boot
1130 * @vm: vm_struct to add
1131 *
1132 * This function is used to add fixed kernel vm area to vmlist before
1133 * vmalloc_init() is called.  @vm->addr, @vm->size, and @vm->flags
1134 * should contain proper values and the other fields should be zero.
1135 *
1136 * DO NOT USE THIS FUNCTION UNLESS YOU KNOW WHAT YOU'RE DOING.
1137 */
1138void __init vm_area_add_early(struct vm_struct *vm)
1139{
1140        struct vm_struct *tmp, **p;
1141
1142        BUG_ON(vmap_initialized);
1143        for (p = &vmlist; (tmp = *p) != NULL; p = &tmp->next) {
1144                if (tmp->addr >= vm->addr) {
1145                        BUG_ON(tmp->addr < vm->addr + vm->size);
1146                        break;
1147                } else
1148                        BUG_ON(tmp->addr + tmp->size > vm->addr);
1149        }
1150        vm->next = *p;
1151        *p = vm;
1152}
1153
1154/**
1155 * vm_area_register_early - register vmap area early during boot
1156 * @vm: vm_struct to register
1157 * @align: requested alignment
1158 *
1159 * This function is used to register kernel vm area before
1160 * vmalloc_init() is called.  @vm->size and @vm->flags should contain
1161 * proper values on entry and other fields should be zero.  On return,
1162 * vm->addr contains the allocated address.
1163 *
1164 * DO NOT USE THIS FUNCTION UNLESS YOU KNOW WHAT YOU'RE DOING.
1165 */
1166void __init vm_area_register_early(struct vm_struct *vm, size_t align)
1167{
1168        static size_t vm_init_off __initdata;
1169        unsigned long addr;
1170
1171        addr = ALIGN(VMALLOC_START + vm_init_off, align);
1172        vm_init_off = PFN_ALIGN(addr + vm->size) - VMALLOC_START;
1173
1174        vm->addr = (void *)addr;
1175
1176        vm_area_add_early(vm);
1177}
1178
1179void __init vmalloc_init(void)
1180{
1181        struct vmap_area *va;
1182        struct vm_struct *tmp;
1183        int i;
1184
1185        for_each_possible_cpu(i) {
1186                struct vmap_block_queue *vbq;
1187
1188                vbq = &per_cpu(vmap_block_queue, i);
1189                spin_lock_init(&vbq->lock);
1190                INIT_LIST_HEAD(&vbq->free);
1191        }
1192
1193        /* Import existing vmlist entries. */
1194        for (tmp = vmlist; tmp; tmp = tmp->next) {
1195                va = kzalloc(sizeof(struct vmap_area), GFP_NOWAIT);
1196                va->flags = VM_VM_AREA;
1197                va->va_start = (unsigned long)tmp->addr;
1198                va->va_end = va->va_start + tmp->size;
1199                va->vm = tmp;
1200                __insert_vmap_area(va);
1201        }
1202
1203        vmap_area_pcpu_hole = VMALLOC_END;
1204
1205        vmap_initialized = true;
1206}
1207
1208/**
1209 * map_kernel_range_noflush - map kernel VM area with the specified pages
1210 * @addr: start of the VM area to map
1211 * @size: size of the VM area to map
1212 * @prot: page protection flags to use
1213 * @pages: pages to map
1214 *
1215 * Map PFN_UP(@size) pages at @addr.  The VM area @addr and @size
1216 * specify should have been allocated using get_vm_area() and its
1217 * friends.
1218 *
1219 * NOTE:
1220 * This function does NOT do any cache flushing.  The caller is
1221 * responsible for calling flush_cache_vmap() on to-be-mapped areas
1222 * before calling this function.
1223 *
1224 * RETURNS:
1225 * The number of pages mapped on success, -errno on failure.
1226 */
1227int map_kernel_range_noflush(unsigned long addr, unsigned long size,
1228                             pgprot_t prot, struct page **pages)
1229{
1230        return vmap_page_range_noflush(addr, addr + size, prot, pages);
1231}
1232
1233/**
1234 * unmap_kernel_range_noflush - unmap kernel VM area
1235 * @addr: start of the VM area to unmap
1236 * @size: size of the VM area to unmap
1237 *
1238 * Unmap PFN_UP(@size) pages at @addr.  The VM area @addr and @size
1239 * specify should have been allocated using get_vm_area() and its
1240 * friends.
1241 *
1242 * NOTE:
1243 * This function does NOT do any cache flushing.  The caller is
1244 * responsible for calling flush_cache_vunmap() on to-be-mapped areas
1245 * before calling this function and flush_tlb_kernel_range() after.
1246 */
1247void unmap_kernel_range_noflush(unsigned long addr, unsigned long size)
1248{
1249        vunmap_page_range(addr, addr + size);
1250}
1251EXPORT_SYMBOL_GPL(unmap_kernel_range_noflush);
1252
1253/**
1254 * unmap_kernel_range - unmap kernel VM area and flush cache and TLB
1255 * @addr: start of the VM area to unmap
1256 * @size: size of the VM area to unmap
1257 *
1258 * Similar to unmap_kernel_range_noflush() but flushes vcache before
1259 * the unmapping and tlb after.
1260 */
1261void unmap_kernel_range(unsigned long addr, unsigned long size)
1262{
1263        unsigned long end = addr + size;
1264
1265        flush_cache_vunmap(addr, end);
1266        vunmap_page_range(addr, end);
1267        flush_tlb_kernel_range(addr, end);
1268}
1269
1270int map_vm_area(struct vm_struct *area, pgprot_t prot, struct page ***pages)
1271{
1272        unsigned long addr = (unsigned long)area->addr;
1273        unsigned long end = addr + area->size - PAGE_SIZE;
1274        int err;
1275
1276        err = vmap_page_range(addr, end, prot, *pages);
1277        if (err > 0) {
1278                *pages += err;
1279                err = 0;
1280        }
1281
1282        return err;
1283}
1284EXPORT_SYMBOL_GPL(map_vm_area);
1285
1286/*** Old vmalloc interfaces ***/
1287DEFINE_RWLOCK(vmlist_lock);
1288struct vm_struct *vmlist;
1289
1290static void setup_vmalloc_vm(struct vm_struct *vm, struct vmap_area *va,
1291                              unsigned long flags, const void *caller)
1292{
1293        vm->flags = flags;
1294        vm->addr = (void *)va->va_start;
1295        vm->size = va->va_end - va->va_start;
1296        vm->caller = caller;
1297        va->vm = vm;
1298        va->flags |= VM_VM_AREA;
1299}
1300
1301static void insert_vmalloc_vmlist(struct vm_struct *vm)
1302{
1303        struct vm_struct *tmp, **p;
1304
1305        vm->flags &= ~VM_UNLIST;
1306        write_lock(&vmlist_lock);
1307        for (p = &vmlist; (tmp = *p) != NULL; p = &tmp->next) {
1308                if (tmp->addr >= vm->addr)
1309                        break;
1310        }
1311        vm->next = *p;
1312        *p = vm;
1313        write_unlock(&vmlist_lock);
1314}
1315
1316static void insert_vmalloc_vm(struct vm_struct *vm, struct vmap_area *va,
1317                              unsigned long flags, const void *caller)
1318{
1319        setup_vmalloc_vm(vm, va, flags, caller);
1320        insert_vmalloc_vmlist(vm);
1321}
1322
1323static struct vm_struct *__get_vm_area_node(unsigned long size,
1324                unsigned long align, unsigned long flags, unsigned long start,
1325                unsigned long end, int node, gfp_t gfp_mask, const void *caller)
1326{
1327        struct vmap_area *va;
1328        struct vm_struct *area;
1329
1330        BUG_ON(in_interrupt());
1331        if (flags & VM_IOREMAP) {
1332                int bit = fls(size);
1333
1334                if (bit > IOREMAP_MAX_ORDER)
1335                        bit = IOREMAP_MAX_ORDER;
1336                else if (bit < PAGE_SHIFT)
1337                        bit = PAGE_SHIFT;
1338
1339                align = 1ul << bit;
1340        }
1341
1342        size = PAGE_ALIGN(size);
1343        if (unlikely(!size))
1344                return NULL;
1345
1346        area = kzalloc_node(sizeof(*area), gfp_mask & GFP_RECLAIM_MASK, node);
1347        if (unlikely(!area))
1348                return NULL;
1349
1350        /*
1351         * We always allocate a guard page.
1352         */
1353        size += PAGE_SIZE;
1354
1355        va = alloc_vmap_area(size, align, start, end, node, gfp_mask);
1356        if (IS_ERR(va)) {
1357                kfree(area);
1358                return NULL;
1359        }
1360
1361        /*
1362         * When this function is called from __vmalloc_node_range,
1363         * we do not add vm_struct to vmlist here to avoid
1364         * accessing uninitialized members of vm_struct such as
1365         * pages and nr_pages fields. They will be set later.
1366         * To distinguish it from others, we use a VM_UNLIST flag.
1367         */
1368        if (flags & VM_UNLIST)
1369                setup_vmalloc_vm(area, va, flags, caller);
1370        else
1371                insert_vmalloc_vm(area, va, flags, caller);
1372
1373        return area;
1374}
1375
1376struct vm_struct *__get_vm_area(unsigned long size, unsigned long flags,
1377                                unsigned long start, unsigned long end)
1378{
1379        return __get_vm_area_node(size, 1, flags, start, end, -1, GFP_KERNEL,
1380                                                __builtin_return_address(0));
1381}
1382EXPORT_SYMBOL_GPL(__get_vm_area);
1383
1384struct vm_struct *__get_vm_area_caller(unsigned long size, unsigned long flags,
1385                                       unsigned long start, unsigned long end,
1386                                       const void *caller)
1387{
1388        return __get_vm_area_node(size, 1, flags, start, end, -1, GFP_KERNEL,
1389                                  caller);
1390}
1391
1392/**
1393 *      get_vm_area  -  reserve a contiguous kernel virtual area
1394 *      @size:          size of the area
1395 *      @flags:         %VM_IOREMAP for I/O mappings or VM_ALLOC
1396 *
1397 *      Search an area of @size in the kernel virtual mapping area,
1398 *      and reserved it for out purposes.  Returns the area descriptor
1399 *      on success or %NULL on failure.
1400 */
1401struct vm_struct *get_vm_area(unsigned long size, unsigned long flags)
1402{
1403        return __get_vm_area_node(size, 1, flags, VMALLOC_START, VMALLOC_END,
1404                                -1, GFP_KERNEL, __builtin_return_address(0));
1405}
1406
1407struct vm_struct *get_vm_area_caller(unsigned long size, unsigned long flags,
1408                                const void *caller)
1409{
1410        return __get_vm_area_node(size, 1, flags, VMALLOC_START, VMALLOC_END,
1411                                                -1, GFP_KERNEL, caller);
1412}
1413
1414/**
1415 *      find_vm_area  -  find a continuous kernel virtual area
1416 *      @addr:          base address
1417 *
1418 *      Search for the kernel VM area starting at @addr, and return it.
1419 *      It is up to the caller to do all required locking to keep the returned
1420 *      pointer valid.
1421 */
1422struct vm_struct *find_vm_area(const void *addr)
1423{
1424        struct vmap_area *va;
1425
1426        va = find_vmap_area((unsigned long)addr);
1427        if (va && va->flags & VM_VM_AREA)
1428                return va->vm;
1429
1430        return NULL;
1431}
1432
1433/**
1434 *      remove_vm_area  -  find and remove a continuous kernel virtual area
1435 *      @addr:          base address
1436 *
1437 *      Search for the kernel VM area starting at @addr, and remove it.
1438 *      This function returns the found VM area, but using it is NOT safe
1439 *      on SMP machines, except for its size or flags.
1440 */
1441struct vm_struct *remove_vm_area(const void *addr)
1442{
1443        struct vmap_area *va;
1444
1445        va = find_vmap_area((unsigned long)addr);
1446        if (va && va->flags & VM_VM_AREA) {
1447                struct vm_struct *vm = va->vm;
1448
1449                if (!(vm->flags & VM_UNLIST)) {
1450                        struct vm_struct *tmp, **p;
1451                        /*
1452                         * remove from list and disallow access to
1453                         * this vm_struct before unmap. (address range
1454                         * confliction is maintained by vmap.)
1455                         */
1456                        write_lock(&vmlist_lock);
1457                        for (p = &vmlist; (tmp = *p) != vm; p = &tmp->next)
1458                                ;
1459                        *p = tmp->next;
1460                        write_unlock(&vmlist_lock);
1461                }
1462
1463                vmap_debug_free_range(va->va_start, va->va_end);
1464                free_unmap_vmap_area(va);
1465                vm->size -= PAGE_SIZE;
1466
1467                return vm;
1468        }
1469        return NULL;
1470}
1471
1472static void __vunmap(const void *addr, int deallocate_pages)
1473{
1474        struct vm_struct *area;
1475
1476        if (!addr)
1477                return;
1478
1479        if ((PAGE_SIZE-1) & (unsigned long)addr) {
1480                WARN(1, KERN_ERR "Trying to vfree() bad address (%p)\n", addr);
1481                return;
1482        }
1483
1484        area = remove_vm_area(addr);
1485        if (unlikely(!area)) {
1486                WARN(1, KERN_ERR "Trying to vfree() nonexistent vm area (%p)\n",
1487                                addr);
1488                return;
1489        }
1490
1491        debug_check_no_locks_freed(addr, area->size);
1492        debug_check_no_obj_freed(addr, area->size);
1493
1494        if (deallocate_pages) {
1495                int i;
1496
1497                for (i = 0; i < area->nr_pages; i++) {
1498                        struct page *page = area->pages[i];
1499
1500                        BUG_ON(!page);
1501                        __free_page(page);
1502                }
1503
1504                if (area->flags & VM_VPAGES)
1505                        vfree(area->pages);
1506                else
1507                        kfree(area->pages);
1508        }
1509
1510        kfree(area);
1511        return;
1512}
1513
1514/**
1515 *      vfree  -  release memory allocated by vmalloc()
1516 *      @addr:          memory base address
1517 *
1518 *      Free the virtually continuous memory area starting at @addr, as
1519 *      obtained from vmalloc(), vmalloc_32() or __vmalloc(). If @addr is
1520 *      NULL, no operation is performed.
1521 *
1522 *      Must not be called in interrupt context.
1523 */
1524void vfree(const void *addr)
1525{
1526        BUG_ON(in_interrupt());
1527
1528        kmemleak_free(addr);
1529
1530        __vunmap(addr, 1);
1531}
1532EXPORT_SYMBOL(vfree);
1533
1534/**
1535 *      vunmap  -  release virtual mapping obtained by vmap()
1536 *      @addr:          memory base address
1537 *
1538 *      Free the virtually contiguous memory area starting at @addr,
1539 *      which was created from the page array passed to vmap().
1540 *
1541 *      Must not be called in interrupt context.
1542 */
1543void vunmap(const void *addr)
1544{
1545        BUG_ON(in_interrupt());
1546        might_sleep();
1547        __vunmap(addr, 0);
1548}
1549EXPORT_SYMBOL(vunmap);
1550
1551/**
1552 *      vmap  -  map an array of pages into virtually contiguous space
1553 *      @pages:         array of page pointers
1554 *      @count:         number of pages to map
1555 *      @flags:         vm_area->flags
1556 *      @prot:          page protection for the mapping
1557 *
1558 *      Maps @count pages from @pages into contiguous kernel virtual
1559 *      space.
1560 */
1561void *vmap(struct page **pages, unsigned int count,
1562                unsigned long flags, pgprot_t prot)
1563{
1564        struct vm_struct *area;
1565
1566        might_sleep();
1567
1568        if (count > totalram_pages)
1569                return NULL;
1570
1571        area = get_vm_area_caller((count << PAGE_SHIFT), flags,
1572                                        __builtin_return_address(0));
1573        if (!area)
1574                return NULL;
1575
1576        if (map_vm_area(area, prot, &pages)) {
1577                vunmap(area->addr);
1578                return NULL;
1579        }
1580
1581        return area->addr;
1582}
1583EXPORT_SYMBOL(vmap);
1584
1585static void *__vmalloc_node(unsigned long size, unsigned long align,
1586                            gfp_t gfp_mask, pgprot_t prot,
1587                            int node, const void *caller);
1588static void *__vmalloc_area_node(struct vm_struct *area, gfp_t gfp_mask,
1589                                 pgprot_t prot, int node, const void *caller)
1590{
1591        const int order = 0;
1592        struct page **pages;
1593        unsigned int nr_pages, array_size, i;
1594        gfp_t nested_gfp = (gfp_mask & GFP_RECLAIM_MASK) | __GFP_ZERO;
1595
1596        nr_pages = (area->size - PAGE_SIZE) >> PAGE_SHIFT;
1597        array_size = (nr_pages * sizeof(struct page *));
1598
1599        area->nr_pages = nr_pages;
1600        /* Please note that the recursion is strictly bounded. */
1601        if (array_size > PAGE_SIZE) {
1602                pages = __vmalloc_node(array_size, 1, nested_gfp|__GFP_HIGHMEM,
1603                                PAGE_KERNEL, node, caller);
1604                area->flags |= VM_VPAGES;
1605        } else {
1606                pages = kmalloc_node(array_size, nested_gfp, node);
1607        }
1608        area->pages = pages;
1609        area->caller = caller;
1610        if (!area->pages) {
1611                remove_vm_area(area->addr);
1612                kfree(area);
1613                return NULL;
1614        }
1615
1616        for (i = 0; i < area->nr_pages; i++) {
1617                struct page *page;
1618                gfp_t tmp_mask = gfp_mask | __GFP_NOWARN;
1619
1620                if (node < 0)
1621                        page = alloc_page(tmp_mask);
1622                else
1623                        page = alloc_pages_node(node, tmp_mask, order);
1624
1625                if (unlikely(!page)) {
1626                        /* Successfully allocated i pages, free them in __vunmap() */
1627                        area->nr_pages = i;
1628                        goto fail;
1629                }
1630                area->pages[i] = page;
1631        }
1632
1633        if (map_vm_area(area, prot, &pages))
1634                goto fail;
1635        return area->addr;
1636
1637fail:
1638        warn_alloc_failed(gfp_mask, order,
1639                          "vmalloc: allocation failure, allocated %ld of %ld bytes\n",
1640                          (area->nr_pages*PAGE_SIZE), area->size);
1641        vfree(area->addr);
1642        return NULL;
1643}
1644
1645/**
1646 *      __vmalloc_node_range  -  allocate virtually contiguous memory
1647 *      @size:          allocation size
1648 *      @align:         desired alignment
1649 *      @start:         vm area range start
1650 *      @end:           vm area range end
1651 *      @gfp_mask:      flags for the page level allocator
1652 *      @prot:          protection mask for the allocated pages
1653 *      @node:          node to use for allocation or -1
1654 *      @caller:        caller's return address
1655 *
1656 *      Allocate enough pages to cover @size from the page level
1657 *      allocator with @gfp_mask flags.  Map them into contiguous
1658 *      kernel virtual space, using a pagetable protection of @prot.
1659 */
void *(unsigned long size, unsigned long align,
1461             c_node(unsigned long va_c_node(unsigned long area, gfp_t gfp_mask,
1562             , &pgprot_t prot, int node, const void *caller)
1563{
1564        struct vm_struct *area;
1635<(const void *area;
1566(unsigned long nr_pages = area;
1567
1638        vfree(size);
1569        if (!PAG)">count > totalram_pages)
1640                goto fail;
fail;
1572 *pages = g=__vmalloc_node" clasass="sref">g=__vsref">vfree( |= gfp_mask | gfp_mask,
1603                     8        va_igned long area, node, gfp_mask, caller);
1574        if (!area)
1625                goto fail;
1636
1597        pages = __vmalloc_arem_area(area, gfp_mask, area, node, caller);
1568        if (!addr)
1569                return NULL;
1580
1581<5">1645 */
16521653g=__vr __sof">fe reassee her*      space.
1654 */
1545        (1636
1587<5">1645 */
1658 ref">mament"> */
1659g=__vr  funtablep theainmament"> */
1650
1651 */
1572 *n, 3f">area, g>caller);
1533
1594        return area;
1595
1637fail:
1597        warn_alloc_failed(gfp0fp_mask,
1628                          "vmalloc: allocat: %lu of %ld bytes\n",
1639                gned long n>caller);
1600<           return NULL;
1531}
1632
1653/**
1654
1555 *      @size:          allocation size
1536 *      @align:         desired alignment
1647 *      @gfp_mask:      flags for the page level allocator
1648 *      @prot:          protection mask for the allocated pages
1649 *      @node:          node to use for allocation or -1
1650 *      @caller:        caller's return address
1521 *
1652 *      Allocate enough pages to cover @size from the page level
1653 *      allocator with @gfp_mask flags.  Map them into contiguous
1654 *      kernel virtual space, using a pagetable protection of @prot.
1555 */
1585static void *__vmalloc_node(unsigned long size, unsigned long align,
1617                  gned long gfp_t gfp_mask, pgprot_t prot,
1618                 >prot, int node, const void *caller)
1563{
1600<           return vfree( |=  |= prot,
1621                      gned long gfp_mask, area, node, caller);
1582}
1533
gfp_t gfp_mask, pgprot_t 1563{
1626<           return __vmalloigned long , 1, gfp_mask, prot,
1627                      gned long __builtin_return_address(0));
1548}
1549EXPORT_SYMBOL(1580
1585/a>        (unsigned long 1580
1572                             >prot, int gfp_t 1563{
1594        return __vmalloigned long , 1, flags, PAGE_">1563{
1625     /a>                      gned long __builtin_return_address(0));
1548}
1567
1648/**
16491650 *      @size:          allocation size
1651 *      Allocate enough pages to cover @size from the page level
1652 *     andnmk flags.  Map them intont"> *      kernel vion of @prot.
165316541645
1646 */
1561void *1563{
1594        return , 1, __GFP_ress(0));
1548}
1549EXPORT_SYMBOL(1632
1653/**
16541655 *   :          allocation size
1656 *      Allocate enough pages to cover @size from the page level
1657 *     andnmk flags.  Map them intont"> *      kernel vion of @prot.
1658165916501651
1652 */
1561void *(unsigned long 1563{
1635        return 1563{
1586                      gned long __GFP_M_MASK) | __Gress(0));
1548}
1549EXPORT_SYMBOL((0));
1619
1650/**
1651/**
1652 *  :          allocation size
16531654fec165benmk plly      rel viomment">/**
1655
1646 */
1561void *1563{
1569        struct vm_struct *area;
1600<1">1561void *"+code=area" cl/a>"sref">area;
fail;
1572 *"+code=area" cl/a>"sre">pages = __vmalloc_node(1563{
1603                   gned long __GFP_M_MASK) | __G_">1563{
1634                   gned long PAGE_K-_size, 1, __builtin_return_address(0));
1545        if ("+code=area" cl/a>"sre">page)) {
1606                pages = ("+code=area" cl/a>"sre"ess(0));
1627                area->flags |= area;
1618<8">1548}
1594        return "+code=area" cl/a>"sref">area;
1548}
1549EXPORT_SYMBOL((0));
1632
1653/**
1654__vmament">/**
1555 *      @size:          allocation size
1536 *      @node:uma >__vmament">/**
1657/**
1658(0));
au9"commena href=_node_range  -  alloc them intont"> *      kernel vion of @prot.
1600<       8   re80"commenFtionss="p therol  pagmm/v7alloc.c#L1758" id="L1658" c8a1s="lin7"8nam79"L1651">1549
1632
 *     andnmk flags.  Map @prot.
1653/**
1654__vmalloc_nodesize, unsigned long 15551536__vmalloigned long , 1, __GFP_M_MASK) | PAGE_">1563{
1647__builtin_return_address(0));
16481649EXPORT_SYMBOL(__vmalloc_node16501521 *
1652 *      Allocate enohref="m a spe-ic >__vmament">/**
1653 *      allocator willocation sizspan>
1654 *      kernel virtuent">/**1555 */
1585stat8c voi81"comment"> *      @node:uma >_l"ess(0));
1617    8     81"comment"> *     andnmk flags. them intont"> *      kernel vion of @prot.
1618    8     81"commenode" bL1659" f="+code  ougzeroon of @prot.
1563{

1600<       8   re82"commenFtionss="p therol  pager the page leve andn pagetable ass="srof @prot.
1621    8     82"commen   nass="sref().  stead @prot. */1582}
 */
1533
__vmalloc_nodesize, unsigned long 1563{
1563{
1626<       8   re8             __GFP_M_MASK) | __G_">1563{
1627    8     82m/v7alloc.c#L1768" id="L1568" c8ass="lin7"8nam72"L1548">1548}
EXPORT_SYMBOL(__vmalloc_node15491580
PA_EXEfp_mask | PA_EXEfv7alloc.c#L1770" id="L1570" c8ass="lin7"8nam7="L1635">1585/a>     8  15AGE_KERNEL" class="sref">PA_EXEfp_mask | PA_EXEfv7alAGE_KERNEL" class="sref">PAGE_">1563{
1572    8     8      #endifloc.c#L1770" id="L1570" c8ass="lin7"8nam73"L1563">1563{
1594    8   re83"comment"> *      kernel vif="mm/v7alloc.c#L1794" id="L1594" c8ass="lin7"8nam73"L1625">1625    8/a>  83"comment"> *      @size:          a long 
1548}
 *      @node:uma >__vmamelocation size
1567
/**
1648/**
__vmamKot.
1649 *      kernel vion of @pa="mm/vmalloc.c#L1651" id="L1651" c8ass="lin7"8nam74"L1650">1650 *      @size:          aexeruof @prrot.
1651 *      Allocate enmm/v7alloc.c#L1758" id="L1658" c8ass="lin7"8nam74"L1652">1652 *     andnmk flags.  Mapr the page leve andn pagetable ass="srof @prot.
1653
1654164516461561void8*1563{
__vmalloigned long , 1, __GFP_M_MASK) | PA_EXEfp_mask | PA_EXEfv7al_loc.c#L1765" id="L1565" c8ass="lin7"8nam749L1594">1594    8   re84    gned long __builtin_return_address(0));
1548}
15491632
 |CONFIG_64BIemm/v7a&&_builtin_return_def>15arn_alloc_faileddef>15ade=size" class="srefCONFIG_ZONE_DMAnam73"L1572 |CONFIG_ZONE_DMAna/v7alloc.c#L1778" id="L1578" c8ass="lin7"8nam7="L1653">1653 |  |  | 1654 |CONFIG_64BIemm/v7a&&_builtin_return_def>15arn_alloc_faileddef>15ade=size" class="srefCONFIG_ZONE_DMAm73"L1572 |CONFIG_ZONE_DMA/v7alloc.c#L1778" id="L1578" c8ass="lin7"8nam7="L1655">1655 |  |  | 16561657 |  | 1658165916501651
1652 */

1561void8*
1563{
(0));
<32bitaPAa href="f @p1635    8   re86"comment"> *      @size:          ator
 *      kernel vion of @prot.
1586    8     86"comment"> */
1548}
 |="+code nag 15491619
, 1,  | PAGE_">1563{
1650__builtin_return_address(0));
16511652 ORT_SYMBOL" class="sref">EXPORT_SYMBOL( |="+code nag 16531654165532bitahref="mm/v7alloc.c#L1740" id="L1640" c8ass="lin7"8nam77"L1646">1646 */

1561void8*/**
1563{
fec165benmk plly 32bita href="f @pont">     rel viomment">mm/v7alloc.c#L1798" id="L1598" c8ass="lin7"8nam77"L1569">1569    8   st87"commena href=_node_range  -  **
1600<1">15618/a>vo88"comment"> *      @size:     "mm/v7alloc.c#L1777" id="L1577" c8ass="lin7"8nam78"L157">fail;
(0));
1572 *"+lloc.c#L1779" id="L1579" c8ass="lin7"8nam78"L1603">1603    8     8        gned lcode=vm_struct" class="sref">vm_struct *area;
1634    8     8        gned lde=area" cl/a>"sref">area;
1545    8   if88/v6alloc.c#L1696" id="L1596" c8ass="lin7"8nam78"L1606">1606    8     8     "sref">area;
__vmalloc_node( | __G_">1563{
PAGE_">1563{
1627    8     8     __builtin_return_address(0));
1618<8">15488/a>}
8a href="mm/v7a=area" cl/a>"sre">page)) {
1594    8   re88    gned long area;
("+code=area" cl/a>"sre"ess(0));
1548}
area;
flags |= area;
15491632
"sref">area;
16531654EXPORT_SYMBOL((0));
15551536 *      @node:uma/"mm/v7alloc.c#L1798" id="L1598" c8ass="lin7"8nam79"L1657">1657/**
15Ahrefpel vio href="mbuf#L17921658a89"commena href=_node_range  - "mm/v7alloc.c#L1777" id="L1577" c9ass="lin7"9nam7="L1600">1600<       9   re90/v7alloc.c#L1731" id="L1631" c9a1s="lin7"9nam79"L1651">1549"sref">bufrn_alloc_failedbuf/v7alAcharrea" cl/a>"sref">">area;
1632
1653;
165415551536"sre">pcounea;
1647;
1658"sref">">area;
1563{
16501563{
1521"sre">plengtha;
1652prot, iea" class="sreflengtha;
;
1653;
1654 *      @node:uma/"mm/v7alloc.c#L1798" id="L1598" c9ass="lin7"9nam71"L1555">1555 */
1585stat9c voi91"comment"> *      @node:uma ffffffffffffffff* L16k. Buta hr1617    9     91"comment"> *     andnmk flagffffffffffffffff* /v7ahmma

/vfre */
thly _debug_mm/vmalloc.c#L1651" id="L1651" c9a8s="lin7"9nam7="L1618">1618    9     91"commenode" bL1659" f="+codeffffffffffffffff* e=notftablermk ly
1563{

get sd="L /v7ahmma
in
thly accesef/span>
<"mm/v7alloc.c#L1759" id="L1659" c9ass="lin7"9nam72"L1600">1600<       9   re92"commenFtionss="p therol  paffffffffffffffff*"mm/v7alloc.c#L1777" id="L1577" c9ass="lin7"9nam7="L1621">1621    9     9           gned long <=area" cl/a>"sre">ppa;
1582}
prot, ient"> *      @node:uma/"mm/v7alloc.c#L1798" id="L1598" c9ass="lin7"9nam72"L1533">1533

1563{
 */
1626<       9   re9             "sref">**;
;
1627    9     9           gned long "sref">*emcpya;
"sref">**;
;
1548}
"sref">kun**<_atomirvmalloc_node;
15491580
"sref">*emsrea;
;
1585/a>     9  1572    9     9                  >proa" cl/a>"sref">">area;
;
1563{
;
1594    9   re93       gned long ;
1625    9/a>  9                   gneap_vm_area" clfcounea;
;
1548}
1567
"sref">efpi5arn_alloc_failedefpi5a/v7alloc.c#L1790" id="L1590" c9a8s="lin7"9nam73"L1648">164816491650"sref">bufrn_alloc_failedbuf/v7alAcharrea" cl/a>"sref">">area;
16511652;
165316541645"sre">pcounea;
1646;
1561void9*1563{
"sref">">area;
1563{
1594    9   re94    gned long 1563{
1548}
"sre">plengtha;
1549;
1632
"sref">pa;
;
1653 *      @node:uma/"mm/v7alloc.c#L1798" id="L1598" c9ass="lin7"9nam7="L1654">16541655 *   :          al                * L16k. Buta hr1656 *      Allocate e                * /v7ahmma

/vfre */
thly _debug_mm/vmalloc.c#L1651" id="L1651" c9ass="lin7"9nam7="L1657">1657 *     andnmk flag                * e=notftablermk ly
1658get sd="L /v7ahmma
in
thly accesef/span>
<"mm/v7alloc.c#L1759" id="L1659" c9ass="lin7"9nam7="L1659">16591650"sre">ppa;
1651 *      @node:uma/"mm/v7alloc.c#L1798" id="L1598" c9ass="lin7"9nam76"L1652">1652 */
1561void9*


<)mm/v7alloc.c#L1794" id="L1594" c9ass="lin7"9nam7="L1563">1563{
1635    9   re96                  gneeeeeeeeede=area" cl/a>"sref">**;
;
1586    9     9           gned long "sref">*emcpya;
;
"sref">lengtha;
1548}
"sref">kun**<_atomirvmalloc_node;
15491619
area;
;
1650;
1651;
1652proa" cl/a>"sref">counea;
;
16531594  a 9ref="93          gneode=area" cl/a>"sref">efpi5arn_alloc_failedefpi5a/v7alloc.c#L1794" 9d="L1594" c8ass="lin7"8na977"L1955">16pa9 clas97       gned l1993.c#L1787" id="L1640" c8ass="lin7"8na977"L1946">16a9 clas97       gned l1993.c#L1787" id="L1596" c8ass="lin7"8na977"L1941">1561void8*1563{
1569    8   st87"commennnnnn@"sran>
15fer
<"mm/v7alloc.c#L1776" 9d="L1576" c8ass="lin7"8na978"L1900">1600<1">15618/a>vo88"commennnnnn@srefan>
fec165bin
thly accesef/span>
<"mm/v7alloc.c#L1777" 9d="L1577" c8ass="lin7"8na978"L1981">1651coan>

<"mm/v7alloc.c#L1790" id="L1578" c8ass="lin7"8na978"L1982">165216531563{
co)..R 9refs 0s96 [el vi..el v+f">co) doesn 
<"mm/v7alloc.c#L1794" 9d="L1581" c8ass="lin7"8na978"L1985">1635    8   re86"comment"> *inclufff   yk flagsffff">/**alive
<"mm/v7alloc.c#L1787" id="L1596" c8ass="lin7"8na978"L1986">164616571563{
15fer.node" bLgivens="+coderang=
1569    8   st87"commennnnnno6 [el vi..el v+f">co) inclufff son7evali/efpiger
1600<1">15618/a>vo88"commennnnnnproan>
f ougo6 @"sr.node" bre
f os="+codeholeb,L" by d. I hrb+code -cato * n
thly accesef/span>
<"mm/v7alloc.c#L1788" 9d="L1588" c8ass="lin7"8na979"L1991">165116521653co) doesn /**aliven
thly accesef/span>
<"mm/v7alloc.c#L1724" 5d="L1602" c8ass="lin7"8na979"L1954">1654vm_xccesefr 9refs 0. @"srAshouldPbea       15fer.n
thly accesef/span>
<"mm/v7alloc.c#L1794" 9d="L1587" c8ass="lin7"8na979"L1955">15551536 *Note: In usl viopb,Lref=0y  f* we hrene="L aodebeca
<"mm/v7alloc.c#L1787" id="L1598" c8ass="lin7"8na979"L1957">1657*emc().n
thly accesef/span>
<"mm/v7alloc.c#L1785" 9d="L1576" c8ass="lin7"8na979"L1958">1658haveau9"commena href yk f/spmafff,eass/dev/k">*.n
thly accesef/span>
<"mm/v7all20.c#L1777"20.c#L1659" c8ass="li7c.8#20.c#>20.c">1555165116a9 clas97       gned l1920.3#L1777"20.="L1590" c8ass="lin7"8n20.=">20.3">16     "sref">bufrn_alloc_failedbuf/v7alAcharrea" cl/a>"sref">">area;
1635    8     8        gned lcode=vm_struct" class="sref">vm_struct *1586  n_alloc_failedbuf/v7avlAcharrea" cl/a>"srvef">">areaALLOCeh/a"mmad_nodcef"ar_struct" class="odcef"ar_">**;
"sref">bu_alloc_failedefpi5a/v7all20.7#L1777"20.="L1598" c8ass="lin7"8n20.=">20.8">1548}
;
"sreflentha;
;
1548}
;
"snunea;
20.9">16491548}
61void8*1651areas97                 >proa" cl/a>"sref">counea<&l;
1652proa" cl/a>"sref">counea<= -;
ar;
16531594  96    gned longn_al_    hss=ea" class="n_al_    loc_fa 8        gned lclist_    hss=ea" class="lclist_    f=**;
1635  /spaodepa;
arproa" cl/a>"sref">counea<&a> |CONFIG_64BIemm/v7a&amtmrd_node" bL1659"tmr5arn_G_64BIemm/v7a&amtmrd_node" bL1659"tmr5arn">pa;
;
"srenex>sre">ppa;
1586    9     c_failedbuf/v7avlAcharrea" cl/a>"srvef">">ar/a>;n_allor"96    gned longtmrd_node" bL1659"tmr5arnea;
ar;
1548}
"sref">">areapa;
"srvef">">ar/as97             tmrd_node" bL1659"tmr5arnea;
{
;
1548}
;
1619
"sref">">areal;
"srvef">">ar>ppa;
1548}
proa" cl/a>"sref">counea<== 0;
1651;
"srefm/vish=a">ar;
1582}
"sref">bu">pa1void8*ing"> ;
1653"sref">bu++;
1594    9   ressssssssLLOCeh/a"mmad_n+code=s)a" cl/a>"sref">">ar++;
1635    9   re96        goto proa" cl/a>"sref">counea--;
1586    9     pa9 clas97       gned l1920d7#L1777"20d="L1587" c9ass="lin7"9n20d=">20d8">1548}
"snunea">pa;
"srvef">">ar/as97             tmrd_node" bL1659"tmr5arnea;
{
1563{
ar;
1548}
"snunea"a>;
1594    8   re84    gn"mm/v6aa href="nharrea" cl/a>"snunea">pa;
;
1548}
;
flagCONFIG_64BIemm/v7a&amVM_IOREMAP=flags" class="VM_IOREMAPunea<;
1549"sref">bufrc_failedbuf/v7alAcharrea" cl/a>"sref">">area"mm/v6aa href="nharrea" cl/a>"snunea;
1582}
void8*1653"sref">*emsrea;
"snunea;
1594    9   re93       gned lref="+coea" class="srefbufrn_alloc_failedbufnharrea" cl/a>"snunea;
1625    9/a>  9               area;
"snunea;
1586    9     c_failedbuf/v7a    >proa" cl/a>"sref">counea;
"snunea;
1548}
pa9 clas97       gned l192038#L1777"20d="L1590" c9a8s="lin7"9n20d=">20d8">165a>;
"srefm/vish=a">ar:a9 clas97       gned l192039#L1777"20d="L1629" c9ass="lin7"9n20d=">20d4">1594  96    gned longn_al_un    hss=ea" class="n_al_un    loc_fa 8        gned lclist_    hss=ea" class="lclist_    f=**;
16531651"sref">bu">a;
**;
1582}
1653void8*1651"sref">bu"!a;
**/as97             reflenharrea" cl/a>"sreflentha<;
1625    9/a>  9              l+code=aa" cl/a>"sref">*emsrea;
"sreflentha"sref">bu"563{
**<;
16a9 clas97       gned l1920d7#L1777"20d="L1590" c9ass="lin7"9n20d=">20d7">1567
"sreflentha;
164816491651void8*1651
<"mm/v7all20d2#L1777"20d="L1590" c9ass="lin7"9n20d=">20d2">1652 */"sran>
15fer
<"mm/v7all20d3#L1777"20d="L1587" c9ass="lin7"9n20d=">20d3">16531654coan>

<"mm/v7all20d5#L1777"20d="L1651" c9ass="lin7"9n20d=">20d5">15551536 *R 9refs #fec1     >15AshouldPbeainca   * n
thly accesef/span>
<"mm/v7all20d7#L1777"20d="L1651" c9ass="lin7"9n20d=">20d7">1657co).n
thly accesef/span>
<"mm/v7all20d8#L1777"20d="L1651" c9ass="lin7"9n20d=">20d8">1658co) doesn /**vali/n
thly accesef/span>
<"mm/v7all20d9#L1777"20d="L1659" c9ass="lin7"9n20d=">20d="L1597" class=6ef">au9"commena href="mm/ve  ouefr 9refs 0.n
thly accesef/span>
<"mm/v7all206c#L1777"20d="L1577" c9ass="lin7"9n20d=">20d=">155516511652 *sd="Lhref@p15fer<   * bLgivensel vi I6 speciffpigrang=1653co) inclufff son7evali/efpigp1654
f ougo6 @"sr.node" bre
f os="+codeholeb,Lnonsd="L   hole.n
thly accesef/span>
<"mm/v7all2065#L1777"20d="L1577" c9ass="lin7"9n20d=">20d5">1635    8   re86"comment"> *IOREMAPe  ougzolt oucodeass="+codehole     nonsd="Lzoldonf @prot.
16461657co) doesn /**aliven
thly accesef/span>
<"mm/v7all20d8#L1777"20d="L1587" c9ass="lin7"9n20d=">20d3">1563{
vm_xccesefr 9refs 0. @"srAshouldPbea       15fer.n
thly accesef/span>
<"mm/v7all20d9#L1777"20d="L1629" c9ass="lin7"9n20d=">20d="L1597" class=6ef">au9"commen
thly accesef/span>
<"mm/v7all207c#L1777"20d="L1590" c9ass="lin7"9n20d=">20d=">1563{

<"mm/v7all20d1#L1777"20d="L1590" c9ass="lin7"9n20d=">20d1">1651*emc().n
thly accesef/span>
<"mm/v7all20d2#L1777"20d="L1590" c9ass="lin7"9n20d=">20d2">1652 *Tget i.have1653*.n
thly accesef/span>
<"mm/v7all2074#L1777"20   r_node" bL1659" f="+c20   >20d4">1654155516     "sref">bufrn_alloc_failedbuf/v7alAcharrea" cl/a>"sref">">area;
16pa;
1548}
  8     8        gned lcode=vm_struct" class="sref">vm_struct *1594  n_alloc_failedbuf/v7avlAcharrea" cl/a>"srvef">">ar_alloc_failedefpi5a/v7all208c#L1777"20d="L1576" c8ass="lin7"8n20d=">20d=">1594  ;
"snunea_alloc_failedbuf/reflenharrea" cl/a>"sreflentha<_alloc_failedefpi5a/v7all2081#L1777"20d="L1577" c8ass="lin7"8n20d=">20d1">165116a9 clas97       gned l192083#L1777"20d="L1579" c8ass="lin7"8n20d=">20d3">1653void8*1651areas97                 >proa" cl/a>"sref">counea<&l;
1625    9/a>  9                   gneap_vm_area" clfcounea<= -;
ar;
1586  lloc_failedbuf/reflenharrea" cl/a>"sreflenthapa;
;
1561void9*1586  lloc_failedbuf/n_al_    hss=ea" class="n_al_    loc_fa 8        gned lclist_    hss=ea" class="lclist_    f=**;
1594  /spaodepa;
arproa" cl/a>"sref">counea<&a> |CONFIG_64BIemm/v7a&amtmrd_node" bL1659"tmr5arn_G_64BIemm/v7a&amtmrd_node" bL1659"tmr5arn">pa;
;
"srenex>sre">ppa;
1625    9/a>  9              vlAcharrea" cl/a>"srvef">">ar/a>;n_allor"96    gned longtmrd_node" bL1659"tmr5arnea;
ar;
1621    9     9           gned lo+code=s)a" cl/a>"sref">">areapa;
"srvef">">ar/as97             tmrd_node" bL1659"tmr5arnea;
{
;
1582}
;
1653"sref">">areal;
"srvef">">ar>ppa;
1594    9   ressssssss96    goto proa" cl/a>"sref">counea<== 0;
1635    9   re96              goto;
"srefm/vish=a">ar;
1586    9     9           gned long "sref">bu++;
1548}
"sref">">ar++;
1548}
proa" cl/a>"sref">counea--;
20d9">15491625    9/a>  9              nharrea" cl/a>"snunea">pa;
"srvef">">ar/as97             tmrd_node" bL1659"tmr5arnea;
{
1563{
ar;
1621    9     9           gned lonharrea" cl/a>"snunea"a>;
1652pronharrea" cl/a>"snunea">pa;
;
1653;
flagCONFIG_64BIemm/v7a&amVM_IOREMAP=flags" class="VM_IOREMAPunea<;
1594    9   ressssssssLLOCeh/a"mmad_n++coe=node" class="srefALLOCeh/awritern_alloc_faLOCeh/awrited_nodcharrea" cl/a>"sref">bufrc_failedbuf/v7alAcharrea" cl/a>"sref">">area           >pronharrea" cl/a>"snunea;
1635    9   re96        goto 1586    9     pa9 clas97       gned l1921.7#L1777"21.="L1598" c8ass="lin7"8n21.=">2108">1548}
"snunea;
1563{
area;
"snunea;
2109">1619
"sref">counea;
"snunea;
1548}
pa9 clas97       gned l192111#L1777"21d="L1590" c9a1s="lin7"9n21d=">21d1">16/a>;
"srefm/vish=a">ar:a9 clas97       gned l1921d2#L1777"21d="L1578" c9ass="lin7"9n21d=">21d2">165216531594    9   rea 9ref=loc_failedefpi5a/v7ae=m0ll21d5#L1777"21d="L1598" c9ass="lin7"9n21d=">21d5">1635  a 9ref="93          gnreflenharrea" cl/a>"sreflentha;
15pa9 clas97       gned l192117#L1777"21d="L1651" c9ass="lin7"9n21d=">2111">1561void9*1563{
au9"commena hreretomif="mm/v_rang=< -  tom/f="mm/vea>;
bitaPuser7" cen
thly accesef/span>
<"mm/v7all212c#L1777"21d="L1659" c9ass="lin7"9n21d=">2120">1600<1">15618/a>vo88"commennnnnn@
<"an>


<)mm/v7all2121#L1777"21d="L1577" c9ass="lin7"9n21d=">2121">16511652 */pgoffan>
;
biinerprhrr before firstra>;
itaP ref=/span>

<)mm/v7all2123#L1777"21d="L1598" c9ass="lin7"9n21d=">2123">16531654
15551536 *Tget fffffffffcheckta hr16571563{

<"mm/v7all21d9#L1777"21d="L1587" c9a9s="lin7"9n21d=">212="L1597" class=6ef">au9"commen
thly accesef/span>
<"mm/v7all213c#L1777"21d="L1578" c9ass="lin7"9n21d=">2130">1600<1">15618/a>vo88"commennnnnnSimilar<   retomipfn_rang=()xpe=vman>="+cod.cf* /span>

<)mm/v7all2131#L1777"21d="L1587" c9ass="lin7"9n21d=">2131">1651159a9 clas94       gnretomif="mm/v_rang=hss=ea" class="n_tomif="mm/v_rang=loc_f  8     8        gned lcoccesode=vm_struct" class="sreccesode=vm_struct *area            gneeeeeeelAcharrea" cl/a>"sref">">areffffffffffffff*"mm/v7all2133#L1777"21d="L1590" c9ass="lin7"9n21d=">21d3">1653;
"srpgoff5arn;
1635    8     8        gned lcode=vm_struct" class="sref">vm_struct *"srecestha;
1586  ;
"sruef">">ar/a> *area;
;
1548}
;
 *area;
1563{
area;
;
16;
1594  96  ;3{
-1)gCONFIG;
"sref">">ar;
1625    9/a>  a 9ref=-e/v7ae=m href="EINVALe=s)a" cl/a>"srEINVALtha;
16;
1652"srecestha<1a> *"srefm/vd_sreccesoc_faLOCeh/awrited_nor1653"srecestha<;
1594    9   rea 9ref=-e/v7ae=m href="EINVALe=s)a" cl/a>"srEINVALtha;
15551653"srecestha;
flagCONFIG_64BIemm/v7a&amVM_ffffMAP=flags" class="VM_ffffMAPunea<<551548}
"srEINVALtha;
16;
1594  96  "mm/v6aa href="u+code=size" class="usref" gn1+    goto "srpgoff5arneal;
al;
ar>pa>;
"srecestha;
{
;
1625    9/a>  a 9ref=-e/v7ae=m href="EINVALe=s)a" cl/a>"srEINVALtha;
16;
1652area;
"srpgoff5arneal;
al;
ara;
1653;
1594    9   re  8     8        gned a>;
arrea" cl/a>"srpag=loc_ct *"srpag=loc_ca> *;
arrea" cl/a>"srf="mm/v_to_a>;
oc_faLOCeh/awrited_nor1635    9   re9a9 clas94       gnre_struct" class="re_tha;
16a9 clas97       gned l1921d7#L1777"21d="L1651" c9ass="lin7"9n21d=">2158">1548}
;
arrea" cl/a>"srf=_insert_a>;
oc_faLOCeh/awrited_nf="struct" class="sra">area"mm/v6aa href="ulAcharrea" cl/a>"sruef">">area"mm/v6aa href="a>;
arrea" cl/a>"srpag=loc_ea;
1548}
1594    8   re84    gna 9ref="93          gnre_struct" class="re_tha;
16531651"sruef">">ar/a;
a;
1652area;
a;
1653;
a;
1594  }spa9 clas94            u+code=size" class="usref" gn1a>;
<0ea;
15551586  lloc_failedbuf/f="struct" class="sra">area;
158|a>;
158|>;
a;
1561void9*1548}
a 9ref=loc_failedefpi5a/v7ae=m0ll21d9#L1777"21d="L1629" c9ass="lin7"9n21d=">21d="L15pa9 clas97       gned l19217c#L1777"21d="L1590" c9ass="lin7"9n21d=">21d=">156/v7ae=m href="EXPORT_SYMBOLe=s)a" cl/a>"srEXPORT_SYMBOLoc_faLOCeh/awrited_nretomif="mm/v_rang=hss=ea" class="n_tomif="mm/v_rang=loc_ea;
16;
165216531654155516     >;
"srf="mm/v_sync_"mmoc_fa    ;
16pa;
16481649165316statice9a9 clas94       gnfarrea" cl/a>"srfoc_faLOCeh/awrited_npte__struct" class="pte__loc_ct *"sref">">area            gneeeeeeehrefarrea" cl/a>"srhrefn
a<;
16pa;
1653"srhrefn
a;
16;
1625  96    goto 1586    9     *(t *1548}
 *1586  481594  a 9ref=loc_failedefpi5a/v7ae=m0ll219c#L1777"21d="L1587" c8ass="lin7"8n21d=">21d=">164816;
16521653
<"mm/v7all2194#L1777"21d="L1602" c8ass="lin7"8n21d=">2154">1654

<"mm/v7all2195#L1777"21d="L1587" c8ass="lin7"8n21d=">2155">1555

<"mm/v7all2196#L1777"21d="L1596" c8ass="lin7"8n21d=">2136">15361657vm_xon sud="L n
thly accesef/span>
<"mm/v7all2198#L1777"21d="L1576" c8ass="lin7"8n21d=">2158">165821d="L1597" class=6ef">au9"commena hreTget fffffffffa   rvff  grang=1555
<"mm/v7all22.1#L1777"22.="L1588" c8ass="lin7"8n22.=">22.1">1651
165216531654
155515  8     8        gned lcode=vm_struct" class="sref">vm_struct *"sremm/v_sreccesoc_faLOCeh/awrited_nsref__struct" class="sref__loc_c"mm/v6aa href="+code=size" class="sref" gnea"mm/v6aa href="ate__struct" class="pte__loc_ct*"mm/v6aa href="atee=flags" class="ateen
a<;
16pa;
1548}
  8     8        gned lcode=vm_struct" class="sref">vm_struct *"srecestha;
22.9">16491548}
6/a> *"srecestha *"srg=t_srecces_a
16511652"srecestha *"srNULLn
a<;
1653"srNULLn
a;
16;
1635  521536vm_2d
<"mm/v7all22d7#L1777"22d="L1651" c9ass="lin7"9n22d=">2217">1657
1563{
1594  96  "mm/v6aa href="reply_to_a>;
_rang=hss=ea" class="reply_to_a>;
_rang=oc_faa 8        gned 9ait_mmhss=ea" class="9ait_mm" gnea;
"srecestha;
"sref">">areffffffffffffff*"mm/v7all222c#L1777"22d="L1659" c9ass="lin7"9n22d=">22d=">1548}
"srfoc_fea"mm/v6aa href="atee=flags" class="ateen
a< ? a 8        gned atee=flags" class="ateen
a< :> *"srNULLn
a<<;
1651"srefmree_sreccesoc_faLOCeh/awrited_nccesarrea" cl/a>"srecestha<;
1582}
"srNULLn
a;
165316;
1635  a 9ref="93          gnccesarrea" cl/a>"srecestha;
15pa9 clas97       gned l1922d7#L1777"22d="L1587" c9ass="lin7"9n22d=">2227">165/v7ae=m href="EXPORT_SYMBOL_GPLe=s)a" cl/a>"srEXPORT_SYMBOL_GPLoc_faLOCeh/awrited_ncmm/v_sreccesarrea" cl/a>"sremm/v_sreccesoc_f;
16;
"srefmree_sreccesoc_fa  8     8        gned lcode=vm_struct" class="sref">vm_struct *"srecestha<;
16pa;
1549vm_struct *1652"srefremove_sreccesoc_faLOCeh/awrited_nccesarrea" cl/a>"srecestha;
"sref">">ar;
1653"srBUG_ONoc_faLOCeh/awrited_nre_struct" class="re_tha;
"srecestha<;
1594  /a>;
"srkmreeoc_faLOCeh/awrited_nccesarrea" cl/a>"srecestha<;
16pa9 clas97       gned l192236#L1777"22d="L1590" c9ass="lin7"9n22d=">22d6">155/v7ae=m href="EXPORT_SYMBOL_GPLe=s)a" cl/a>"srEXPORT_SYMBOL_GPLoc_faLOCeh/awrited_nfree_sreccesrea" cl/a>"srefmree_sreccesoc_f;
1561void9*16#ifdef /a>;
1561void9*15statice  8     8        gned lcapeccesrea" cl/a>"sreflcapeccesstruct *"srefnef=_to_vsoc_fa  8     8        gned rb_nef=struct" class="rb_nef=struct *"srefntha<;
16pa;
1651"snunea"?  8        gned rb_7"crystruct" class="rb_7"cryoc_faLOCeh/awrited_nnharrea" cl/a>"snunea_a  8     8        gned lcapeccesrea" cl/a>"sreflcapeccesstruea"mm/v6aa href="rb_nef=struct" class="rb_nef=stru) :> *"srNULLn
a;
16pa9 clas97       gned l192243#L1777"22d="L1590" c9ass="lin7"9n22d=">2243">16a9 clas97       gned l192244#L1777"22d="L1590" c9ass="lin7"9n22d=">2244">16541555153616571563{
au9"commen
thly accesef/span>
<"mm/v7all225c#L1777"22d="L1590" c9ass="lin7"9n22d=">22d=">1651void8*
<"mm/v7all2251#L1777"22d="L1578" c9ass="lin7"9n22d=">22d1">1651165216531654155515statice *"srboomloc_c"mm/v6aa href="psrev/vd_nex>_prev=flags" class="asrev/vd_nex>_prevoc_fa;
effffffffffffff*"mm/v7all22d7#L1777"22d="L1651" c9ass="lin7"9n22d=">2258">1548}
"sreflcapeccesstruct*"mm/v6aa href="anex>proa" cl/a>"srepnex>sre"effffffffffffff*"mm/v7all22d8#L1777"22d="L1651" c9ass="lin7"9n22d=">2258">1548}
"sreflcapeccesstruct*"mm/v6aa href="aprev=flags" class="aprevoc_f;
15pa;
1548}
  8     8        gned rb_nef=struct" class="rb_nef=struct *"srefntha *1549"sreflcapeccesstruct *"srefvstha *"srNULLn
a;
16a9 clas97       gned l192263#L1777"22d="L1561" c9ass="lin7"9n22d=">2263">1653"srefntha<;
1594  94  /a>;
"srefvstha *"snunea_a  8     8        gned lcapeccesrea" cl/a>"sreflcapeccesstruea"mm/v6aa href="rb_nef=struct" class="rb_nef=stru)a;
1635    9   re96  "mm/v6aa href="enclass="srefALLOCencE_">eal;
"srefvstha;
;
1586    9     9           gned long "srefntha *"srefntha;
1548}
ea>;
"srefvstha;
;
1548}
"srefntha *"srefntha;
1594    8   reelse;
1548}
;
154916a9 clas97       gned l1922d3#L1777"22d="L1590" c9ass="lin7"9n22d=">2273">1653"srefvstha<;
1594    9   rea 9ref=LOCeh/awrited_nfalserea" cl/a>"srefmalsen
a;
15551653"srefvstha;
ea>;
;
1548}
"srepnex>sre"">pa;
"srefvstha;
1548}
"srefnef=_to_vsoc_fa>;
proa" cl/a>"srepnex>sre")ea;
1594  }=elsespa;
1548}
"srefvstha;
1651"srepnex>sre"">pa;
"srefnef=_to_vsoc_fa>;
"srerb_nex>oc_faa(t *1549165316pa9 clas97       gned l192285#L1777"22d="L1581" c8ass="lin7"8n22d=">2285">1555153616571563{
: in/ou_xccgau9"commen@pprev: in/ou_xccg1651void8*16511652165316541555153616571658
<"mm/v7all2299#L1777"22d="L1659" c8ass="li7c.8#22d=">22d="L1597" class=6ef">au9"commeninside *@pnex>
<"mm/v7all23.c#L1777"23.c#L1659" c8ass="li7c.8#23.c#>23.c">1555165116statice;
"sreflcapeccesstruct*"mm/v6aa href="anex>proa" cl/a>"srepnex>sre"effffffffffffff*"mm/v7all23.3#L1777"23.="L1590" c8ass="lin7"8n23.=">2303">1653"sreflcapeccesstruct*"mm/v6aa href="aprev=flags" class="aprevoc_feffffffffffffff*"mm/v7all23.4#L1777"23.="L1602" c8ass="lin7"8n23.=">2304">1594    9   resssssssssssssssssssssss;
15pa;
1586  conf"s;
pa;
eaONFIG~aLOCeh/awrited_ncmawr=flags" class="l/awrtha<1- 1)a;
1548}
;
ar;
16;
2304">1594  96  t *"srepnex>sre");
1548}
ar">pa;
proa" cl/a>"srepnex>sre")ea;
;
1651;
1652area> *;
16a9 clas97       gned l1923d4#L1777"23d="L1587" c9ass="lin7"9n23d=">2314">1594  pa9 cla*"mm/v6aa href="aprev=flags" class="aprevoc_fcaONFICONFIG;t *ea>;
"sref">">ar;
1635    9   re*"mm/v6aa href="anex>proa" cl/a>"srepnex>sre"">pt *1586    9     *"mm/v6aa href="aprev=flags" class="aprevoc_fca> *"srefnef=_to_vsoc_fa>;
proa" cl/a>"srepnex>sre")ea;
1548}
pa9 clas97       gned l1923d8#L1777"23d="L1651" c9a8s="lin7"9n23d=">2318">16;
1594  a 9ref="mm/v6aa href=" ar;
164816;
16521653165415551536
<"mm/v7all2327#L1777"23d="L1587" c9ass="lin7"9n23d=">2327">16571563{
au9"commenR 9refsank="mm/v vm_xpo flag ccray po fling erprmm/vatbtst kernel vion of @pa="mm/vmall233c#L1777"23d="L1578" c9ass="lin7"9n23d=">2330">1600<1">15618/a>vo88"commennnnnnnnnnrdef">vm_sxon sud="L ,a%NULL on failurest kernel vion of @pa="mm/vmall2331#L1777"23d="L1587" c9ass="lin7"9n23d=">2331">1651165216531654155515361657
<"mm/v7all2338#L1777"23d="L1590" c9a8s="lin7"9n23d=">2333">1563{
au9"commenDespitbLits<">aplivatbt look,a" et "mm/vator et ra" br simple.reImst kernel vion of @pa="mm/vmall234c#L1777"23d="L1570" c9ass="lin7"9n23d=">2340">1600<1">15618/a>vo88"commendofs every" eng erp-downPfn/1651165216531654
155515  8     8        gned lcode=vm_struct" class="sref">vm_structt *"srepcpu_g=t_sreccessoc_faconf"s;
 *"sreoffsetsoc_feffffffffffffff*"mm/v7all2347#L1777"23d="L1590" c9ass="lin7"9n23d=">2348">1548}
 *"srefnr_srsoc_feffffffffffffff*"mm/v7all2348#L1777"23d="L1638" c9ass="lin7"9n23d=">2348">1548}
15pa;
1625  conf"s;
 *"srALIGNoc_fa>;
1625  conf"s;
pa;
eaONFIG~aLOCeh/awrited_ncmawr=flags" class="l/awrtha<1- 1)a;
1652"sreflcapeccesstruct*"mm/v6aa href="vssproa" cl/a>"srevasoc_feet *proa" cl/a>"srenex>sre"a;
1653vm_structt *"srefsrsoc_fa;
1594  9a9 clas94       gnccesarrea" cl/a>"srecestha"sreces2tha"srefea"teccestha"sreftermeccesoc_fa;
1635  ;
"srefbsbethaee"mm/v6aa href="ea"teenclass="srefALLOCea"teencoc_fa;
1586  lloc_failedbuf/boomarrea" cl/a>"srboomloc_c"mm/v6aa href="purgec=flags" class="aurgecsre"">pa;
"srefmalsen
a;
1561void9*1548}
521594  a;
"srBUG_ONoc_faLOCeh/awrited_ncmawr=flags" class="l/awrtha<1aONFIG~LOCeh/awrited_na hrSMASK=flags" class="a hrSMASKtha<1|| !  goto "sris_power_of_2oc_faLOCeh/awrited_ncmawr=flags" class="l/awrtha<))a;
1548}
/spaaLOCeh/awrited_nea"teccesrea" cl/a>"srefea"teccestha<">p0ee"mm/v6aa href="lcesarrea" cl/a>"srecestha<">p0
"srecestha<"al;
"srefnr_srsoc_f
"srecestha<++;
1651pa;
"sreoffsetsoc_f[a href=length/vlcesarrea" cl/a>"srecestha<]a;
1652e>pa;
"srecestha<]a;
16a9 clas97       gned l192364#L1777"23d="L1594" c9ass="lin7"9n23d=">2364">1594  94  /21635    9   rea;
"srBUG_ONoc_fa!  goto "sreoffsetsoc_f[a href=length/vlcesarrea" cl/a>"srecestha<]ee"mm/v6aa href="l/awr=flags" class="l/awrtha<<)a;
1586    9     a;
"srBUG_ONoc_fa!  goto "srecestha<]ee"mm/v6aa href="l/awr=flags" class="l/awrtha<<)a;
1561void9*1548}
1594    8   rep6  a href=length/vf"ar_struct" class="f"ar_oc_f"a>;
"sreoffsetsoc_f[a href=length/vea"teccesrea" cl/a>"srefea"teccestha<];
1548}
"srefea"teccestha<">pa href=length/vlcesarrea" cl/a>"srecestha;
16;
1652"sreces2tha<">p0
"sreces2tha<"al;
"srefnr_srsoc_f
"sreces2tha<++;
1653;
"srf"ar_2oc_f">pa;
"sreoffsetsoc_f[a href=length/vlces2arrea" cl/a>"sreces2tha<]a;
1594    9   ressssssss;
"srenc2E_">e>pa;
"srf"ar_2oc_f"+s97             srefsstruct" class="srefsoc_f[a href=length/vlces2arrea" cl/a>"sreces2tha<]a;
15551586    9     9       9           gned lo+ces2arrea" cl/a>"sreces2tha<">a;
"srecestha<<551548}
;
16;
1594    8   reeeeeeeeea;
"srBUG_ONoc_faLOCeh/awrited_nf"ar_2arrea" cl/a>"srf"ar_2oc_f"a>;
>pa;
"srf"ar_2oc_f"al;
;
1548}
;
"srBUG_ONoc_faLOCeh/awrited_nenc2arrea" cl/a>"srenc2E_">eal/a>p97             enclass="srefALLOCencE_">eaONFICONFIGLOCeh/awrited_nenc2arrea" cl/a>"srenc2E_">ea>;
;
165115491653pa;
"sreoffsetsoc_f[a href=length/vea"teccesrea" cl/a>"srefea"teccestha<]"+s97             srefsstruct" class="srefsoc_f[a href=length/vea"teccesrea" cl/a>"srefea"teccestha<]a;
16;
1635  p6  a href=length/vt=t/v7aeenclass="srefALLOCrrt/v7aeencsre""-="mm/v6aa href="f=t/v7aef"ar_struct" class="s=t/v7aef"ar_oc_fcal;
;
1586    9     a;
"srWARN_ONoc_faLOCeh/awrited_n 8 estruct" class=" 8 etha<;
1548}
"srNULLn
a;
154916491548}
6/a> *"srefsrsoc_f">pa;
"srefkcs93/voc_faLOCeh/awrited_nnr_srsrea" cl/a>"srefnr_srsoc_fe srefof a href=length/vt=srea" cl/a>"srefsrsoc_f[0])ea"mm/v6aa href="GFP_KERNELrea" cl/a>"srefGFP_KERNELtha<;
1548}
6/a> *"srevasoc_f">pa;
"srefkcs93/voc_faLOCeh/awrited_nnr_srsrea" cl/a>"srefnr_srsoc_fe srefof a href=length/vtssproa" cl/a>"srevasoc_f[0])ea"mm/v6aa href="GFP_KERNELrea" cl/a>"srefGFP_KERNELtha<;
1652"srevasoc_f"|| !  goto "srefsrsoc_f<551653"srerr_mree2n
a;
16;
1635  /spaaLOCeh/awrited_nlcesarrea" cl/a>"srecestha<">p0
"srecestha<"al;
"srefnr_srsoc_f
"srecestha<++;
1586    9     a;
"srevasoc_f[a href=length/vlcesarrea" cl/a>"srecestha<]">pa;
"srefkzs93/voc_fasrefof   8     8        gned lcapeccesrea" cl/a>"sreflcapeccesstru)ea"mm/v6aa href="GFP_KERNELrea" cl/a>"srefGFP_KERNELtha<;
1548}
"srefsrsoc_f[a href=length/vlcesarrea" cl/a>"srecestha<]">pa;
"srefkzs93/voc_fasrefof   8     8        gned lcode=vm_struct" class="sref">vm_stru)ea"mm/v6aa href="GFP_KERNELrea" cl/a>"srefGFP_KERNELtha<;
1548}
"srevasoc_f[a href=length/vlcesarrea" cl/a>"srecestha<]"|| !  goto "srefsrsoc_f[a href=length/vlcesarrea" cl/a>"srecestha<]<552394">1594    8   reeeeeeeeegotoGLOCeh/awrited_nerr_mreearrea" cl/a>"srerr_mreen
a;
1548}
pa9 clas97       gned l1924.1#L1777"24.="L1588" c8ass="lin7"8n24.=">24.1">165OCeh/awrited_na 9rystruct" class="recryoc_f:a9 clas97       gned l1924.2#L1777"24.="L1602" c8ass="lin7"8n24.=">2402">165216a9 clas97       gned l1924.4#L1777"24.="L1602" c8ass="lin7"8n24.=">2404">1594  /21652"srecestha<">pLOCeh/awrited_n ermeccesrea" cl/a>"sreftermeccesoc_f">pLOCeh/awrited_nea"teccesrea" cl/a>"srefea"teccestha;
1586  lloc_failedbuf/f"ar_struct" class="f"ar_oc_f">pa;
"sreoffsetsoc_f[a href=length/vlcesarrea" cl/a>"srecestha<]a;
1548}
97             enclass="srefALLOCencE_">e>pa;
"srecestha<]a;
16;
2404">1594  96  !  goto _prev=flags" class="asrev/vd_nex>_prevoc_fa 8        gned lcapecces_pcpu_holearrea" cl/a>"srlcapecces_pcpu_holeoc_fe a 8        gned nex>proa" cl/a>"srenex>sre"e a 8        gned arev=flags" class="arevoc_f);
1548}
"srefbsbetha *;
165115491653"srefbsbetha *"srenex>sre"e a 8        gned arev=flags" class="arevoc_fee"mm/v6aa href="l/awr=flags" class="l/awrtha<<"-="mm/v6aa href="enclass="srefALLOCencE_">a;
16;
1635  pa9 clas94             8 estruct" class=" 8 etha<;
1586    9     a;
"srBUG_ONoc_faLOCeh/awrited_nnex>proa" cl/a>"srenex>sre"eaONFICONFIGLOCeh/awrited_nnex>proa" cl/a>"srenex>sre"ea;
eal/a>p97             bsberea" cl/a>"srefbsbetha;
1548}
"srBUG_ONoc_faLOCeh/awrited_narev=flags" class="arevoc_feaONFICONFIGLOCeh/awrited_narev=flags" class="arevoc_fea;
ea>;
"srefbsbetha;
16;
1594    8   re/21600<1">15618/a>vo88"commmmmmmmmmmmmmmmmm* bsbe migh_ have underflowed, hec ea"teenc beforest kernel vion of @pa="mm/vmall2421#L1777"24d="L1577" c9ass="lin7"9n24d=">2421">1651aparing @prot.
16521653"srefbsbetha;
1594    9   resssssssslloc_failedbuf/spin_unnedkstruct" class="spin_unnedkoc_faa 8        gned lcapecces_nedkstruct" class="lcapecces_nedktha<;
1635    9   repa9 clasp6  !  goto ;
1586    9     9       sssssssslloc_failedbuf/aurge_lcapecces_nazystruct" class="aurge_lcapecces_nazyoc_fa;
1548}
pLOCeh/awrited_n 8 estruct" class=" 8 etha;
1548}
1594    8   reeeeeeeeepa9 clas97       gned l19243c#L1777"24d="L1578" c9ass="lin7"9n24d=">243=">1548}
"srerr_mreen
a;
165116a9 clas97       gned l192433#L1777"24d="L1590" c9ass="lin7"9n24d=">2433">165316541555
15361548}
proa" cl/a>"srenex>sre"eaONFICONFIGLOCeh/awrited_nnex>proa" cl/a>"srenex>sre"ea;
"srefbsbetha;
1548}
"srefbsbetha *"srenex>sre"e a 8        gned arev=flags" class="arevoc_fee"mm/v6aa href="l/awr=flags" class="l/awrtha<<"-="mm/v6aa href="enclass="srefALLOCencE_">a;
1594    8   reeeeeeeeea;
"sreftermeccesoc_f">pLOCeh/awrited_nlcesarrea" cl/a>"srecestha;
1548}
;
165116a9 clas97       gned l192443#L1777"24d="L1590" c9ass="lin7"9n24d=">2443">165316541555153616571548}
ea>;
"srefbsbetha;
1594    8   reeeeeeeeea;
proa" cl/a>"srenex>sre"ea> *1548}
;
"srefnef=_to_vsoc_fa>;
"srenex>sre"ea;
1651;
"srefbsbetha *"srenex>sre"e a 8        gned arev=flags" class="arevoc_fee"mm/v6aa href="l/awr=flags" class="l/awrtha<<"-="mm/v6aa href="enclass="srefALLOCencE_">a;
1652;
"sreftermeccesoc_f">pLOCeh/awrited_nlcesarrea" cl/a>"srecestha;
1653;
1594    9   re4815551586    9     a216571563{
au9"commmmmmmmmmmmmmmmmm*ffffffffffffffffffffff*"mm/v7all246c#L1777"24d="L1577" c9ass="lin7"9n24d=">246=">1548}
"srecestha<">paLOCeh/awrited_nlcesarrea" cl/a>"srecestha<"+s97             nr_srsrea" cl/a>"srefnr_srsoc_f1- 1)a%"srefnr_srsoc_f
ffffffffffffff*"mm/v7all2461#L1777"24d="L1586" c9ass="lin7"9n24d=">2461">1651"srecestha<">>pLOCeh/awrited_n ermeccesrea" cl/a>"sreftermeccesoc_f<5516521653pa;
"sreoffsetsoc_f[a href=length/vlcesarrea" cl/a>"srecestha<]a;
1594  94  /mm/v6aa href="enclass="srefALLOCencE_">e>pa;
"srecestha<]a;
1635    9   rea;
_prev=flags" class="asrev/vd_nex>_prevoc_fa 8        gned bsberea" cl/a>"srefbsbethae a 8        gned nex>proa" cl/a>"srenex>sre"e a 8        gned arev=flags" class="arevoc_f)a;
1586  4815 8        gned foundlass="srefALLOCfoundoc_f:a9 clas97       gned l1924d8#L1777"24d="L1587" c9ass="lin7"9n24d=">2468">1548}
521594  /spaaLOCeh/awrited_nlcesarrea" cl/a>"srecestha<">p0
"srecestha<"al;
"srefnr_srsoc_f
"srecestha<++;
1548}
"sreflcapeccesstruct>;
e>pa;
"srevasoc_f[a href=length/vlcesarrea" cl/a>"srecestha<]a;
16;
1652;
ea;
p97             bsberea" cl/a>"srefbsbetha"sreoffsetsoc_f[a href=length/vlcesarrea" cl/a>"srecestha<]a;
1653;
ea;
e>pa;
ea;
"srecestha<]a;
1594    9   rea href=length/v__insert_lcapeccesrea" cl/a>"sref__insert_lcapeccesoc_fa 8        gned tllass="srefALLOCraE_">)a;
1586  481581548}
97             lcapecces_pcpu_holearrea" cl/a>"srlcapecces_pcpu_holeoc_fe>p97             bsberea" cl/a>"srefbsbetha"sreoffsetsoc_f[a href=length/vla"teccesrea" cl/a>"srefea"teccestha<]a;
16;
1594  a;
15;
16511549"srecestha<">p0
"srecestha<"al;
"srefnr_srsoc_f
"srecestha<++1653;
"srinsert_lca/v7aevmoc_fa 8        gned t=srea" cl/a>"srefsrsoc_f[a href=length/vlcesarrea" cl/a>"srecestha<]ea"mm/v6aa href="flsproa" cl/a>"srevasoc_f[a href=length/vlcesarrea" cl/a>"srecestha<]ea"mm/v6aa href="VM_ALLOCarrea" cl/a>"srVM_ALLOCsre"effffffffffffff*"mm/v7all24d4#L1777"24d="L1580" c8ass="lin7"8n24d=">2484">1594    9   ressssssss;
"srepcpu_g=t_sreccessoc_f;
15551586  lloc_failedbuf/kmreearrea" cl/a>"srkmreen
a< a href=length/vtssproa" cl/a>"srevasoc_f;
1548}
a 9ref="93          gnsrsrea" cl/a>"srefsrsoc_fa;
16;
1697             err_mreearrea" cl/a>"srerr_mreen
a<:a9 clas97       gned l19249c#L1777"24d="L1587" c8ass="lin7"8n24d=">249=">1548}
/spaaLOCeh/awrited_nlcesarrea" cl/a>"srecestha<">p0
"srecestha<"al;
"srefnr_srsoc_f
"srecestha<++;
1651"srkmreen
a< a href=length/vtssproa" cl/a>"srevasoc_f[a href=length/vlcesarrea" cl/a>"srecestha<];
1652;
"srkmreen
a< a href=length/vt=srea" cl/a>"srefsrsoc_f[a href=length/vlcesarrea" cl/a>"srecestha<];
16531697             err_mree2arrea" cl/a>"srerr_mree2n
a<:a9 clas97       gned l192495#L1777"24d="L1587" c8ass="lin7"8n24d=">2495">1635  lloc_failedbuf/kmreearrea" cl/a>"srkmreen
a< a href=length/vtssproa" cl/a>"srevasoc_f;
1586  lloc_failedbuf/kmreearrea" cl/a>"srkmreen
a< a href=length/vt=srea" cl/a>"srefsrsoc_f;
1548}
a 9ref="93          gnNULLarrea" cl/a>"srNULLn
a;
15482499">16491600<1">15618/a>vo88"com/*tfffffffffffffffffffff*"mm/v7all25.1#L1777"25.="L1588" c8ass="lin7"8n25.=">2501">16511652vm_ po fler ccray re9refod by pcpu_g=t_sreccess()fffffffffffffffffffff*"mm/v7all25.3#L1777"25.="L1590" c8ass="lin7"8n25.=">2503">165316541555vm_saavda" b ccray amm/vatbt by pcpu_g=t_sreccess().fffffffffffffffffffff*"mm/v7all25.6#L1777"25.="L1596" c8ass="lin7"8n25.=">2506">153615     >;
"srepcpu_mree_sreccessn
a<   8     8        gned lcode=vm_struct" class="sref">vm_structt *"srefsrsoc_fee9a9 clas94       gnnr_srsrea" cl/a>"srefnr_srsoc_f16pa;
2504">1594  9a9 clas94       gniarrea" cl/a>"srin
a;
15;
1651"srin
a<">p0
"srin
a<"al;
"srefnr_srsoc_f
"srin
a<++1652;
"srefsrsoc_f[a href=length/viarrea" cl/a>"srin
a<];
1653"srkmreen
a< a href=length/vt=srea" cl/a>"srefsrsoc_f;
164816#endif"sr5UG_ONoc_faLOCeh/awrited_n5rev=f5ags" c#ifdef>;
16481594<5a>   58   restatic   gne_fsrecestha<]"srefsrsoc_fee9a9 clas9seq_fi            offseseq_fi  ref=length/vlcesarreah/vlcesarrea" clm"25.="d="L1598" c8ass=off/v7all2349#L1777"=off/vref=length/vlcesarreapovm_structt *lists="lihref=t/v7alall25.9#L1777"25.="Lsbe migh_ 5ave underflowed, hec ea"t5enc b5forests94       gniarrea" cl/a>"s>aparing @5rot.
 *"srevasoc_feet *"srefnr_srsococ_feet *lists="lihref=s93m/v7all25d5#L1777"25d="Lflass="srefags" class="aurgecsre";52vasoc_f;
listhrefs93m/v7all25d5#L1777"25d="Lfsea>;
pLOC5h/awrited_n 8 estruct" c9ass="lin7"9nv512#L1777"25d="Lsrso--s93m/v7all25d5#L1777"25d="Lf659" c8ass 9rystruct" class="recryo5_fa;
2353">1653243=">1spa8 clas8="comot CONFIG_SR_nerr_mree5rrea" cl/a>"srerr_mreen
a5a5
16a9 clas97      85" c8ass="lin7"8n24d="nnr_srsrea" cl/ahrefs93m/v7all25d5#L1777"25d="L590" c9ass5"lin7"9n24d=">2433">1653<5a>1548
"s5enex>sre"eaONFICONFIGLOCe5/awri5ed_nnestatic   gne_f2353">1653ha<]"srefsrsoc_fee9a9 clas9seq_fi            offseseq_fi  ref=length/vlcesarreah/vlcesarrea" clm"25.="  gne_f *<"25.="d="L1598" c8ass=off/v7all2349#L1777"=off/vref=length/vlcesarreapovm_structt * *"smeccesrea"5cl/a>"sreftermeccesoc_f">5LOCeh5awrited_nlcesa"srevasoc_feet *"srefnr_srsococ_feet *proa" cl/a>"srm_structt *<"25.s93m/v7all2499#L1777"24d="5href=**"442#L1777"34d="L1586" c9ass="lin7"9n5 c9as5442">16a9 clas97++gth/vlcesarreapovm_structt *16532353">1653 *<"th/vo_<]"srefsrsoc_fee9a9 clas9seq_fi            offseseq_fi  ref=length/vlcesarreah/vlcesarrea" clm"25.="  gne_f *<"25.="/v7alall25.9#L1777"25.="Lerheck @prot5
lists="lihref=t/v7alall25.9#L1777"25.="Lsbffffffffff5fffffff*"mm/v7all2448#L1757"24d5"L16384       gniarrea" cl/a>"smes" class="5revoc_feaONFICONFIGLOCeh/5write5_narev=flags" _feet *;
ds="es_nedktha<;
lists="lihref=s93m/v7all25d5#L1777"25d="Lflroa" cl/a>5srenex>sre"ea> *"44ea" cl/a>"5refbsbetha *"srefnr_srsococ_feet *"sreftermeccesoc_f">pL5Ceh/a5rited_4       gniarrea" cl/a>"smeef=**2eccesoc_f<5515481555 *proa" cl/a>"srmvlcesarrea" clm"25.="srefsoc_f[a href=ld=privat         offseseprivat    8        gned lcode=vm_st5ne1" c9ass="5in7"9n24d=">2456">1586"srerr_m5ffffffffff5fffffff*"mm/v7all246c#L1757"24d551659" c9ass="lin7"9n24roa" cl/a>"srmvemsenr_srsrea" cl/a>vemsen c9ass="lin7"9n25d="cou0" cl24d4#L1777"24__cou0" clef n, 0d="L1598" c8ass=onr;
"sreces5ha<">paLOCeh/awrited_nlce5arrea56LOCeh/awrited_niarrea" cl/a>"44" cl/a>"sr5cestha<">>pLOCeh/awrited_5 erme5cesrea" cl/a>"sreftermef=length/vnr_srsrea252#L1777"25d="L1575.="f
;
1653"sni8 c9ass="lin7"9n25d=">r_srsrea" cl/ahref="srefsoc_f[a href=ld=pagll24d4#L1777"24__pagll9ass"lin7"9n25d=">25252#L1777"25d="L1575.="])]++eeeeeeea;
pa;
e>pa;
1548;
&quo="sNL1586u=L1586u&quo=""23d="Ld="L1598" c8ass=onr2#L1777"25d="L1575.="  soc_f<55;
p0
vo88"com/*tfffffffffffffffffffcesrea" cl5a>"sreflcapeccesstruct>;
5a hre5="mm/satic   576" c8ass="lin7"8ns_qhowstructt *<"th/how<]"srefsrsoc_fee9a9 clas9seq_fi            offseseq_fi  ref=length/vlcesarreah/vlcesarrea" clm"25.="  gne_f *<"25.="/v7alall25.9#L1777"25.="Ler0" c9ass="5in7"9n24d=">2472">1652;loc_failedbuf/kmreearrea5hrLLOCraE_">5a;
"srevasoc_feet *"srefnr_srsococ_feet *proa" cl/a>"srm_structt *<"25.s93m/v7all2499#L1777"24d="5hrLLOCraE_">5a;
"sref__insert_lcapecc5soc_f57        gneoc_feet *;q_fiprintf        offseseq_fiprintf c9ass="lin7"9n25d="vlcesarrea" clm"25.="d="a<;
&quo="0xL1586pK-0xL1586pK"L15867ld&quo=""23d="Ld8 clas8="comot f"ar_lsv5n_eprev=flag5 c8ass="lin7"8n24d=">24765>158<578        gned bsberea" cl/a>"srefbsb>r_srsrea" cl/ahref="srefsoc_f[a href=ld=add52#L1777"25d="L1add55.="  soc_f<55r_srsrea" cl/ahref="srefsoc_f[a href=ld=add52#L1777"25d="L1add55.=""teccestha<]a;>r_srsrea" cl/ahref="srefsoc_f[a href=ld=GFP_        offseseqFP_5.="  soc_f<55r_srsrea" cl/ahref="srefsoc_f[a href=ld=GFP_        offseseqFP_5.=")eeeeeeea;
15485srlcapecces_pcpu_holeoc_f5>p97 5           bsb"L15s="lin7"9n25d=">r_srsrea" cl/ahref="srefsoc_f[a href=ld=a>"se52#L1777"25d="L1a>"se55.="/v7alall25.9#L1777"25.="Ler0uvda" fit5in7"8n24d=">2474">1594;
&quo="sL1586pS&quo=""23d="Ld="L1598" c8ass=o>r_srsrea" cl/ahref="srefsoc_f[a href=ld=a>"se52#L1777"25d="L1a>"se55.="/eeeeeeea;
 8        5ned l57>vo88"com/*tfffffffffffffffffff7" c8ass="5in7"8n24d=">24d1">1651"srevasoc_f[a href=length/vlcesarrq_fiprintf        offseseq_fiprintf c9ass="lin7"9n25d="vlcesarrea" clm"25.="d="a<;
&quo="spagll=L1586d&quo=""23d="Ld="L1598" c8ass=o>r_srsrea" cl/ahref="srefsoc_f[a href=ld="r_pagll24d4#L1777"24__"r_pagll9ass/eeeeeeea;
p0
"srinsert_lca/v7aevm5c_fa 58in7"9n24d=">2eccesoc_f<55r_srsrea" cl/ahref="srefsoc_f[a href=ld=phys_add52#L1777"25d="L1phys_add59ass/v7alall25.9#L1777"25.="Lervccesrea" 5=t_sreccessproa" cl/a>"sr5pcpu_5=t_sreccessoc_f;length/vlcesarrq_fiprintf        offseseq_fiprintf c9ass="lin7"9n25d="vlcesarrea" clm"25.="d="a<;
&quo="sphys=L1586llx&quo=""23d="Ld=Rsrf"ar_2olongolong)soc_f<55r_srsrea" cl/ahref="srefsoc_f[a href=ld=phys_add52#L1777"25d="L1phys_add59ass/eeeeeeea;
2486">1586"sr5mreen
a< a5href=length/vtssproa" cl/5>"sre5asoc_f;
eccesoc_f<55r_srsrea" cl/ahref="srefsoc_f[a href=ld=flagl24d4#L1777"24__flagl5.="fscE_">ea>;
5a;
;
&quo="sioremap&quo=""23d="L/eeeeeeea;
1697   5     5   err_mreearrea" cl/a>"srerr_m5een
a<:a9 5las97       gned l19249c#51777"58      gned lcapecsoc_f<55r_srsrea" cl/ahref="srefsoc_f[a href=ld=flagl24d4#L1777"24__flagl5.="fscE_">ea>;
2484">1594    9   res/v7alall25.9#L1777"25.="Ler"srecestha5">p0
"srecestha<"+s97             nrq_fiprintf        offseseq_fiprintf c9ass="lin7"9n25d="vlcesarrea" clm"25.="d="a<;
&quo="s1777"25&quo=""23d="L/eeeeeeea;
"srkmr5en
a< a href=length/vtssp5oa" c59las>;
"srkmr5en
a< a href=length/vt=sr5a" cl5a>"srefsrsoc_fapecsoc_f<55r_srsrea" cl/ahref="srefsoc_f[a href=ld=flagl24d4#L1777"24__flagl5.="fscE_">ea>;
;
&quo="s177p&quo=""23d="L/eeeeeeea;
"sre5asoc_f;
apecsoc_f<55r_srsrea" cl/ahref="srefsoc_f[a href=ld=flagl24d4#L1777"24__flagl5.="fscE_">ea>;
;
&quo="suser&quo=""23d="L/eeeeeeea;
5a;
;
1649;
apecsoc_f<55r_srsrea" cl/ahref="srefsoc_f[a href=ld=flagl24d4#L1777"24__flagl5.="fscE_">ea>;
16481600<1"515618591659" c9ass="lin7"9n24roa" cl/a>"srmq_fiprintf        offseseq_fiprintf c9ass="lin7"9n25d="vlcesarrea" clm"25.="d="a<;
&quo="s1pagll&quo=""23d="L/eeeeeeea;
"46- mreesvm"6m/v ccess /spapercpua"mm/6atorf60kcs93/voc_faLOCeh/awrited_=othow_numa_info        offseseqhow_numa_info<]"srs="lin7"9n25d="vlcesarrea" clm"25.="d="oc_f<55r_srsrea" cl/ahref="/eeeeeeea;
;
&/a><\n&/a><"23d="L/eeeeeeea;
24946fff*"601590" c9ass1576" c8a0eeeeeeea;
"sr6ff*"mm/v7a6l25.7#L1777"25.="L1598" c6ass="6in7"8natic   constsrevasoc_feet * * *<"  " cl/_o_efs9ex>loc_failedbuf/kmreearrea5h6cl/a>"srep6pu_mree_sreccessn
a<   8 6   8 60writed_n 8 es._feet *"srecestha<]a;
srecestha<]"sd8 clas8="comot f"ar_lsv5n659" c8ass=6li7c.8#25.=">2504">1594  9a608rited_n 8 es._feet *2353">1653ha<]"sd8 clas8="comot f"ar_lsv5n659" c8ass=6l7c.8#25.c#>2500">1600<1"677"256="L1590" c9ass._feet * *<"tto_efs9ex>;
 *<"th/vo_<]"sd8 clas8="comot f"ar_lsv5n60" c9a1s="6in7"9n25d=">2511">1651 * *<"thow<]"sex>;
 *<"th/how<]"sd8 clas8="comot f"ar_lsv5n60 mreesvm"6a href=length/viarrea" cl6a>"sr6n
a<"a}eeeeeeea;
1651 *1651 *2515">16#end6f;
2498">1548;
e76" c8ass="lin7"8nrenr_srsrea" cl/a>re    8        gned lcode=vm_st5n6cl/a>"sr5U6_ONoc_faLOCeh/awrited_n5r6v=f5a611777"eeeeeea;
1594<5a6   58618oc_f;
apecsoc_f<551548"srm_t52#L1777"25d="L1ptr<]"sex>;
1548;
"srecestha<"+s97revoc_fea;
;
2498">1548"srevasoc_f[a href= c9ass1576" c8a-;
1548"sa8 clas8="comot CONFIG_SRc6mreen
a< f6sbetha;
re    8ex>;
 *<"  " cl/_o_efs9/eeeeeeea;
re    8slloc_failedbuf/kmreearrea5h6ass="srefa6s" class="aurgecsre";52628        gned bsbereaefsrsoc_fee9a9 clas9seq_fi            offseseq_fi  ref=length/vlcesarreah/vlcesarrea" clm"25.="ex>;
"srin
aprivat _date   8        gned lcode=vm_st5n6fa9hrefas86apecces_nazystruct" cla5s6"au5g621651" c9ass="lin7"9n2             nrvlcesarrea" clm"25.="srefsoc_f[a href=ld=privat         offseseprivat    8ex>proa" cl/a>"srm_t52#L1777"25d="L1ptr<]"s        gned lcode=vm_st5n6fl/a>"sr5U6lags" class="aurgecsre"5>6LOC5h6awrited_n 8 es} else       gned lcode=vm_st5n6f9" c8ass"6rystruct" class="recryo5_6a6
;
243=">1sp76" c8ass="lin7"8n24d=renr_srsrea" cl/a>re    8        gned lcode=vm_st5n6err_mree5r6ea" cl/a>"srerr_mreen
a5a6/a>5
6a hrefa8 clas8="comot CONFIG_SRc62#L1777"546="L1582" c9ass="lin7"9n546=">5463las>;
1653<5a6 * *loc_failedbuf/kmreearrea5h6ffffffff5f6ffffff*"mm/v7all2434#L1576"245=6L1590" c9ass15._feet * *read c9aq_fi
ds=<]"sd8 clas8="comot f"ar_lsv5n6nss="srefa6x> *llsee7 c9a248=">q_filsee7<]"sd8 clas8="comot f"ar_lsv5n6na9hrefas86fffffff*"mm/v7all2437#L5767"253636590" c9ass15._feet *releasl590" c9ass15fALLOCea"teencoc_q_fi
dleasl_privat         offseseq_fi
dleasl_privat <]"sd8 clas8="comot f"ar_lsv5n6n"5>6LOC5h6ex>sre"eaONFICONFIGLOCe5/6i5ed_6ateencoc_q_eeea;
 *"srerr_m5een
6ea"5cl/a>"6reftermeccesoc_f">5LOCeh56write6_nlces  576" c8ass="lin7"8n  " c24d=isrea" cl/a>re   24d=is_feet *re   "m" cl/_o_erid=iss="li"s>apari677"34d="L1686" c9ass="lin7"9n5 c9as5642">164/voc_faLOCeh/awrited_=othow_"m" cc]"s     offseseprivat " cc]"s  s="lin>;
&quo="s1pagl/a>"s>]"sr""23d="Ld="L1598" c8ass=o>r_srS_IRUSR   offseseprivaS_IRUSR="oc_f<55r_sr8">1548loeeea;
2443">1653re   moduerid=iss="lin7"9n25d="_t52#Lm" cl/_o_erid=isrea" cl/a>re   "m" cl/_o_erid=iss="leeea;



The orig>245=LXR software25068asscapecces_http://sourceforge.net/projects/lxr">LXR ouneu=isyv7alc9t1" cex onie/v745=versfs92506capecces_pailto:lxr@l24ux.noee7xr@l24ux.nov7al.
1649