Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 | /* * Copyright (c) 2000-2005 Silicon Graphics, Inc. * All Rights Reserved. * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License as * published by the Free Software Foundation. * * This program is distributed in the hope that it would be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ #include <linux/mm.h> #include <linux/vmalloc.h> #include <linux/highmem.h> #include <linux/swap.h> #include <linux/blkdev.h> #include <linux/backing-dev.h> #include "time.h" #include "kmem.h" #define MAX_VMALLOCS 6 #define MAX_SLAB_SIZE 0x20000 void * kmem_alloc(size_t size, unsigned int __nocast flags) { int retries = 0; gfp_t lflags = kmem_flags_convert(flags); void *ptr; #ifdef DEBUG if (unlikely(!(flags & KM_LARGE) && (size > PAGE_SIZE))) { printk(KERN_WARNING "Large %s attempt, size=%ld\n", __func__, (long)size); dump_stack(); } #endif do { if (size < MAX_SLAB_SIZE || retries > MAX_VMALLOCS) ptr = kmalloc(size, lflags); else ptr = __vmalloc(size, lflags, PAGE_KERNEL); if (ptr || (flags & (KM_MAYFAIL|KM_NOSLEEP))) return ptr; if (!(++retries % 100)) printk(KERN_ERR "XFS: possible memory allocation " "deadlock in %s (mode:0x%x)\n", __func__, lflags); congestion_wait(WRITE, HZ/50); } while (1); } void * kmem_zalloc(size_t size, unsigned int __nocast flags) { void *ptr; ptr = kmem_alloc(size, flags); if (ptr) memset((char *)ptr, 0, (int)size); return ptr; } void * kmem_zalloc_greedy(size_t *size, size_t minsize, size_t maxsize, unsigned int __nocast flags) { void *ptr; size_t kmsize = maxsize; unsigned int kmflags = (flags & ~KM_SLEEP) | KM_NOSLEEP; while (!(ptr = kmem_zalloc(kmsize, kmflags))) { if ((kmsize <= minsize) && (flags & KM_NOSLEEP)) break; if ((kmsize >>= 1) <= minsize) { kmsize = minsize; kmflags = flags; } } if (ptr) *size = kmsize; return ptr; } void kmem_free(const void *ptr) { if (!is_vmalloc_addr(ptr)) { kfree(ptr); } else { vfree(ptr); } } void * kmem_realloc(const void *ptr, size_t newsize, size_t oldsize, unsigned int __nocast flags) { void *new; new = kmem_alloc(newsize, flags); if (ptr) { if (new) memcpy(new, ptr, ((oldsize < newsize) ? oldsize : newsize)); kmem_free(ptr); } return new; } void * kmem_zone_alloc(kmem_zone_t *zone, unsigned int __nocast flags) { int retries = 0; gfp_t lflags = kmem_flags_convert(flags); void *ptr; do { ptr = kmem_cache_alloc(zone, lflags); if (ptr || (flags & (KM_MAYFAIL|KM_NOSLEEP))) return ptr; if (!(++retries % 100)) printk(KERN_ERR "XFS: possible memory allocation " "deadlock in %s (mode:0x%x)\n", __func__, lflags); congestion_wait(WRITE, HZ/50); } while (1); } void * kmem_zone_zalloc(kmem_zone_t *zone, unsigned int __nocast flags) { void *ptr; ptr = kmem_zone_alloc(zone, flags); if (ptr) memset((char *)ptr, 0, kmem_cache_size(zone)); return ptr; } |