3 * Written by Mark Hemment, 1996/97.
4 * (markhe@nextd.demon.co.uk)
6 * kmem_cache_destroy() + some cleanup - 1999 Andrea Arcangeli
8 * Major cleanup, different bufctl logic, per-cpu arrays
9 * (c) 2000 Manfred Spraul
11 * Cleanup, make the head arrays unconditional, preparation for NUMA
12 * (c) 2002 Manfred Spraul
14 * An implementation of the Slab Allocator as described in outline in;
15 * UNIX Internals: The New Frontiers by Uresh Vahalia
16 * Pub: Prentice Hall ISBN 0-13-101908-2
17 * or with a little more detail in;
18 * The Slab Allocator: An Object-Caching Kernel Memory Allocator
19 * Jeff Bonwick (Sun Microsystems).
20 * Presented at: USENIX Summer 1994 Technical Conference
22 * The memory is organized in caches, one cache for each object type.
23 * (e.g. inode_cache, dentry_cache, buffer_head, vm_area_struct)
24 * Each cache consists out of many slabs (they are small (usually one
25 * page long) and always contiguous), and each slab contains multiple
26 * initialized objects.
28 * This means, that your constructor is used only for newly allocated
29 * slabs and you must pass objects with the same intializations to
32 * Each cache can only support one memory type (GFP_DMA, GFP_HIGHMEM,
33 * normal). If you need a special memory type, then must create a new
34 * cache for that memory type.
36 * In order to reduce fragmentation, the slabs are sorted in 3 groups:
37 * full slabs with 0 free objects
39 * empty slabs with no allocated objects
41 * If partial slabs exist, then new allocations come from these slabs,
42 * otherwise from empty slabs or new slabs are allocated.
44 * kmem_cache_destroy() CAN CRASH if you try to allocate from the cache
45 * during kmem_cache_destroy(). The caller must prevent concurrent allocs.
47 * Each cache has a short per-cpu head array, most allocs
48 * and frees go into that array, and if that array overflows, then 1/2
49 * of the entries in the array are given back into the global cache.
50 * The head array is strictly LIFO and should improve the cache hit rates.
51 * On SMP, it additionally reduces the spinlock operations.
53 * The c_cpuarray may not be read with enabled local interrupts -
54 * it's changed with a smp_call_function().
56 * SMP synchronization:
57 * constructors and destructors are called without any locking.
58 * Several members in struct kmem_cache and struct slab never change, they
59 * are accessed without any locking.
60 * The per-cpu arrays are never accessed from the wrong cpu, no locking,
61 * and local interrupts are disabled so slab code is preempt-safe.
62 * The non-constant members are protected with a per-cache irq spinlock.
64 * Many thanks to Mark Hemment, who wrote another per-cpu slab patch
65 * in 2000 - many ideas in the current implementation are derived from
68 * Further notes from the original documentation:
70 * 11 April '97. Started multi-threading - markhe
71 * The global cache-chain is protected by the mutex 'cache_chain_mutex'.
72 * The sem is only needed when accessing/extending the cache-chain, which
73 * can never happen inside an interrupt (kmem_cache_create(),
74 * kmem_cache_shrink() and kmem_cache_reap()).
76 * At present, each engine can be growing a cache. This should be blocked.
78 * 15 March 2005. NUMA slab allocator.
79 * Shai Fultheim <shai@scalex86.org>.
80 * Shobhit Dayal <shobhit@calsoftinc.com>
81 * Alok N Kataria <alokk@calsoftinc.com>
82 * Christoph Lameter <christoph@lameter.com>
84 * Modified the slab allocator to be node aware on NUMA systems.
85 * Each node has its own list of partial, free and full slabs.
86 * All object allocations for a node occur from node specific slab lists.
89 #include <linux/config.h>
90 #include <linux/slab.h>
92 #include <linux/swap.h>
93 #include <linux/cache.h>
94 #include <linux/interrupt.h>
95 #include <linux/init.h>
96 #include <linux/compiler.h>
97 #include <linux/cpuset.h>
98 #include <linux/seq_file.h>
99 #include <linux/notifier.h>
100 #include <linux/kallsyms.h>
101 #include <linux/cpu.h>
102 #include <linux/sysctl.h>
103 #include <linux/module.h>
104 #include <linux/rcupdate.h>
105 #include <linux/string.h>
106 #include <linux/nodemask.h>
107 #include <linux/mempolicy.h>
108 #include <linux/mutex.h>
110 #include <asm/uaccess.h>
111 #include <asm/cacheflush.h>
112 #include <asm/tlbflush.h>
113 #include <asm/page.h>
116 * DEBUG - 1 for kmem_cache_create() to honour; SLAB_DEBUG_INITIAL,
117 * SLAB_RED_ZONE & SLAB_POISON.
118 * 0 for faster, smaller code (especially in the critical paths).
120 * STATS - 1 to collect stats for /proc/slabinfo.
121 * 0 for faster, smaller code (especially in the critical paths).
123 * FORCED_DEBUG - 1 enables SLAB_RED_ZONE and SLAB_POISON (if possible)
126 #ifdef CONFIG_DEBUG_SLAB
129 #define FORCED_DEBUG 1
133 #define FORCED_DEBUG 0
136 /* Shouldn't this be in a header file somewhere? */
137 #define BYTES_PER_WORD sizeof(void *)
139 #ifndef cache_line_size
140 #define cache_line_size() L1_CACHE_BYTES
143 #ifndef ARCH_KMALLOC_MINALIGN
145 * Enforce a minimum alignment for the kmalloc caches.
146 * Usually, the kmalloc caches are cache_line_size() aligned, except when
147 * DEBUG and FORCED_DEBUG are enabled, then they are BYTES_PER_WORD aligned.
148 * Some archs want to perform DMA into kmalloc caches and need a guaranteed
149 * alignment larger than BYTES_PER_WORD. ARCH_KMALLOC_MINALIGN allows that.
150 * Note that this flag disables some debug features.
152 #define ARCH_KMALLOC_MINALIGN 0
155 #ifndef ARCH_SLAB_MINALIGN
157 * Enforce a minimum alignment for all caches.
158 * Intended for archs that get misalignment faults even for BYTES_PER_WORD
159 * aligned buffers. Includes ARCH_KMALLOC_MINALIGN.
160 * If possible: Do not enable this flag for CONFIG_DEBUG_SLAB, it disables
161 * some debug features.
163 #define ARCH_SLAB_MINALIGN 0
166 #ifndef ARCH_KMALLOC_FLAGS
167 #define ARCH_KMALLOC_FLAGS SLAB_HWCACHE_ALIGN
170 /* Legal flag mask for kmem_cache_create(). */
172 # define CREATE_MASK (SLAB_DEBUG_INITIAL | SLAB_RED_ZONE | \
173 SLAB_POISON | SLAB_HWCACHE_ALIGN | \
175 SLAB_MUST_HWCACHE_ALIGN | SLAB_STORE_USER | \
176 SLAB_RECLAIM_ACCOUNT | SLAB_PANIC | \
177 SLAB_DESTROY_BY_RCU | SLAB_MEM_SPREAD)
179 # define CREATE_MASK (SLAB_HWCACHE_ALIGN | \
180 SLAB_CACHE_DMA | SLAB_MUST_HWCACHE_ALIGN | \
181 SLAB_RECLAIM_ACCOUNT | SLAB_PANIC | \
182 SLAB_DESTROY_BY_RCU | SLAB_MEM_SPREAD)
188 * Bufctl's are used for linking objs within a slab
191 * This implementation relies on "struct page" for locating the cache &
192 * slab an object belongs to.
193 * This allows the bufctl structure to be small (one int), but limits
194 * the number of objects a slab (not a cache) can contain when off-slab
195 * bufctls are used. The limit is the size of the largest general cache
196 * that does not use off-slab slabs.
197 * For 32bit archs with 4 kB pages, is this 56.
198 * This is not serious, as it is only for large objects, when it is unwise
199 * to have too many per slab.
200 * Note: This limit can be raised by introducing a general cache whose size
201 * is less than 512 (PAGE_SIZE<<3), but greater than 256.
204 typedef unsigned int kmem_bufctl_t;
205 #define BUFCTL_END (((kmem_bufctl_t)(~0U))-0)
206 #define BUFCTL_FREE (((kmem_bufctl_t)(~0U))-1)
207 #define BUFCTL_ACTIVE (((kmem_bufctl_t)(~0U))-2)
208 #define SLAB_LIMIT (((kmem_bufctl_t)(~0U))-3)
210 /* Max number of objs-per-slab for caches which use off-slab slabs.
211 * Needed to avoid a possible looping condition in cache_grow().
213 static unsigned long offslab_limit;
218 * Manages the objs in a slab. Placed either at the beginning of mem allocated
219 * for a slab, or allocated from an general cache.
220 * Slabs are chained into three list: fully used, partial, fully free slabs.
223 struct list_head list;
224 unsigned long colouroff;
225 void *s_mem; /* including colour offset */
226 unsigned int inuse; /* num of objs active in slab */
228 unsigned short nodeid;
234 * slab_destroy on a SLAB_DESTROY_BY_RCU cache uses this structure to
235 * arrange for kmem_freepages to be called via RCU. This is useful if
236 * we need to approach a kernel structure obliquely, from its address
237 * obtained without the usual locking. We can lock the structure to
238 * stabilize it and check it's still at the given address, only if we
239 * can be sure that the memory has not been meanwhile reused for some
240 * other kind of object (which our subsystem's lock might corrupt).
242 * rcu_read_lock before reading the address, then rcu_read_unlock after
243 * taking the spinlock within the structure expected at that address.
245 * We assume struct slab_rcu can overlay struct slab when destroying.
248 struct rcu_head head;
249 struct kmem_cache *cachep;
257 * - LIFO ordering, to hand out cache-warm objects from _alloc
258 * - reduce the number of linked list operations
259 * - reduce spinlock operations
261 * The limit is stored in the per-cpu structure to reduce the data cache
268 unsigned int batchcount;
269 unsigned int touched;
272 * Must have this definition in here for the proper
273 * alignment of array_cache. Also simplifies accessing
275 * [0] is for gcc 2.95. It should really be [].
280 * bootstrap: The caches do not work without cpuarrays anymore, but the
281 * cpuarrays are allocated from the generic caches...
283 #define BOOT_CPUCACHE_ENTRIES 1
284 struct arraycache_init {
285 struct array_cache cache;
286 void *entries[BOOT_CPUCACHE_ENTRIES];
290 * The slab lists for all objects.
293 struct list_head slabs_partial; /* partial list first, better asm code */
294 struct list_head slabs_full;
295 struct list_head slabs_free;
296 unsigned long free_objects;
297 unsigned int free_limit;
298 unsigned int colour_next; /* Per-node cache coloring */
299 spinlock_t list_lock;
300 struct array_cache *shared; /* shared per node */
301 struct array_cache **alien; /* on other nodes */
302 unsigned long next_reap; /* updated without locking */
303 int free_touched; /* updated without locking */
307 * Need this for bootstrapping a per node allocator.
309 #define NUM_INIT_LISTS (2 * MAX_NUMNODES + 1)
310 struct kmem_list3 __initdata initkmem_list3[NUM_INIT_LISTS];
311 #define CACHE_CACHE 0
313 #define SIZE_L3 (1 + MAX_NUMNODES)
316 * This function must be completely optimized away if a constant is passed to
317 * it. Mostly the same as what is in linux/slab.h except it returns an index.
319 static __always_inline int index_of(const size_t size)
321 extern void __bad_size(void);
323 if (__builtin_constant_p(size)) {
331 #include "linux/kmalloc_sizes.h"
339 #define INDEX_AC index_of(sizeof(struct arraycache_init))
340 #define INDEX_L3 index_of(sizeof(struct kmem_list3))
342 static void kmem_list3_init(struct kmem_list3 *parent)
344 INIT_LIST_HEAD(&parent->slabs_full);
345 INIT_LIST_HEAD(&parent->slabs_partial);
346 INIT_LIST_HEAD(&parent->slabs_free);
347 parent->shared = NULL;
348 parent->alien = NULL;
349 parent->colour_next = 0;
350 spin_lock_init(&parent->list_lock);
351 parent->free_objects = 0;
352 parent->free_touched = 0;
355 #define MAKE_LIST(cachep, listp, slab, nodeid) \
357 INIT_LIST_HEAD(listp); \
358 list_splice(&(cachep->nodelists[nodeid]->slab), listp); \
361 #define MAKE_ALL_LISTS(cachep, ptr, nodeid) \
363 MAKE_LIST((cachep), (&(ptr)->slabs_full), slabs_full, nodeid); \
364 MAKE_LIST((cachep), (&(ptr)->slabs_partial), slabs_partial, nodeid); \
365 MAKE_LIST((cachep), (&(ptr)->slabs_free), slabs_free, nodeid); \
375 /* 1) per-cpu data, touched during every alloc/free */
376 struct array_cache *array[NR_CPUS];
377 /* 2) Cache tunables. Protected by cache_chain_mutex */
378 unsigned int batchcount;
382 unsigned int buffer_size;
383 /* 3) touched by every alloc & free from the backend */
384 struct kmem_list3 *nodelists[MAX_NUMNODES];
386 unsigned int flags; /* constant flags */
387 unsigned int num; /* # of objs per slab */
389 /* 4) cache_grow/shrink */
390 /* order of pgs per slab (2^n) */
391 unsigned int gfporder;
393 /* force GFP flags, e.g. GFP_DMA */
396 size_t colour; /* cache colouring range */
397 unsigned int colour_off; /* colour offset */
398 struct kmem_cache *slabp_cache;
399 unsigned int slab_size;
400 unsigned int dflags; /* dynamic flags */
402 /* constructor func */
403 void (*ctor) (void *, struct kmem_cache *, unsigned long);
405 /* de-constructor func */
406 void (*dtor) (void *, struct kmem_cache *, unsigned long);
408 /* 5) cache creation/removal */
410 struct list_head next;
414 unsigned long num_active;
415 unsigned long num_allocations;
416 unsigned long high_mark;
418 unsigned long reaped;
419 unsigned long errors;
420 unsigned long max_freeable;
421 unsigned long node_allocs;
422 unsigned long node_frees;
430 * If debugging is enabled, then the allocator can add additional
431 * fields and/or padding to every object. buffer_size contains the total
432 * object size including these internal fields, the following two
433 * variables contain the offset to the user object and its size.
440 #define CFLGS_OFF_SLAB (0x80000000UL)
441 #define OFF_SLAB(x) ((x)->flags & CFLGS_OFF_SLAB)
443 #define BATCHREFILL_LIMIT 16
445 * Optimization question: fewer reaps means less probability for unnessary
446 * cpucache drain/refill cycles.
448 * OTOH the cpuarrays can contain lots of objects,
449 * which could lock up otherwise freeable slabs.
451 #define REAPTIMEOUT_CPUC (2*HZ)
452 #define REAPTIMEOUT_LIST3 (4*HZ)
455 #define STATS_INC_ACTIVE(x) ((x)->num_active++)
456 #define STATS_DEC_ACTIVE(x) ((x)->num_active--)
457 #define STATS_INC_ALLOCED(x) ((x)->num_allocations++)
458 #define STATS_INC_GROWN(x) ((x)->grown++)
459 #define STATS_INC_REAPED(x) ((x)->reaped++)
460 #define STATS_SET_HIGH(x) \
462 if ((x)->num_active > (x)->high_mark) \
463 (x)->high_mark = (x)->num_active; \
465 #define STATS_INC_ERR(x) ((x)->errors++)
466 #define STATS_INC_NODEALLOCS(x) ((x)->node_allocs++)
467 #define STATS_INC_NODEFREES(x) ((x)->node_frees++)
468 #define STATS_SET_FREEABLE(x, i) \
470 if ((x)->max_freeable < i) \
471 (x)->max_freeable = i; \
473 #define STATS_INC_ALLOCHIT(x) atomic_inc(&(x)->allochit)
474 #define STATS_INC_ALLOCMISS(x) atomic_inc(&(x)->allocmiss)
475 #define STATS_INC_FREEHIT(x) atomic_inc(&(x)->freehit)
476 #define STATS_INC_FREEMISS(x) atomic_inc(&(x)->freemiss)
478 #define STATS_INC_ACTIVE(x) do { } while (0)
479 #define STATS_DEC_ACTIVE(x) do { } while (0)
480 #define STATS_INC_ALLOCED(x) do { } while (0)
481 #define STATS_INC_GROWN(x) do { } while (0)
482 #define STATS_INC_REAPED(x) do { } while (0)
483 #define STATS_SET_HIGH(x) do { } while (0)
484 #define STATS_INC_ERR(x) do { } while (0)
485 #define STATS_INC_NODEALLOCS(x) do { } while (0)
486 #define STATS_INC_NODEFREES(x) do { } while (0)
487 #define STATS_SET_FREEABLE(x, i) do { } while (0)
488 #define STATS_INC_ALLOCHIT(x) do { } while (0)
489 #define STATS_INC_ALLOCMISS(x) do { } while (0)
490 #define STATS_INC_FREEHIT(x) do { } while (0)
491 #define STATS_INC_FREEMISS(x) do { } while (0)
496 * Magic nums for obj red zoning.
497 * Placed in the first word before and the first word after an obj.
499 #define RED_INACTIVE 0x5A2CF071UL /* when obj is inactive */
500 #define RED_ACTIVE 0x170FC2A5UL /* when obj is active */
502 /* ...and for poisoning */
503 #define POISON_INUSE 0x5a /* for use-uninitialised poisoning */
504 #define POISON_FREE 0x6b /* for use-after-free poisoning */
505 #define POISON_END 0xa5 /* end-byte of poisoning */
508 * memory layout of objects:
510 * 0 .. cachep->obj_offset - BYTES_PER_WORD - 1: padding. This ensures that
511 * the end of an object is aligned with the end of the real
512 * allocation. Catches writes behind the end of the allocation.
513 * cachep->obj_offset - BYTES_PER_WORD .. cachep->obj_offset - 1:
515 * cachep->obj_offset: The real object.
516 * cachep->buffer_size - 2* BYTES_PER_WORD: redzone word [BYTES_PER_WORD long]
517 * cachep->buffer_size - 1* BYTES_PER_WORD: last caller address
518 * [BYTES_PER_WORD long]
520 static int obj_offset(struct kmem_cache *cachep)
522 return cachep->obj_offset;
525 static int obj_size(struct kmem_cache *cachep)
527 return cachep->obj_size;
530 static unsigned long *dbg_redzone1(struct kmem_cache *cachep, void *objp)
532 BUG_ON(!(cachep->flags & SLAB_RED_ZONE));
533 return (unsigned long*) (objp+obj_offset(cachep)-BYTES_PER_WORD);
536 static unsigned long *dbg_redzone2(struct kmem_cache *cachep, void *objp)
538 BUG_ON(!(cachep->flags & SLAB_RED_ZONE));
539 if (cachep->flags & SLAB_STORE_USER)
540 return (unsigned long *)(objp + cachep->buffer_size -
542 return (unsigned long *)(objp + cachep->buffer_size - BYTES_PER_WORD);
545 static void **dbg_userword(struct kmem_cache *cachep, void *objp)
547 BUG_ON(!(cachep->flags & SLAB_STORE_USER));
548 return (void **)(objp + cachep->buffer_size - BYTES_PER_WORD);
553 #define obj_offset(x) 0
554 #define obj_size(cachep) (cachep->buffer_size)
555 #define dbg_redzone1(cachep, objp) ({BUG(); (unsigned long *)NULL;})
556 #define dbg_redzone2(cachep, objp) ({BUG(); (unsigned long *)NULL;})
557 #define dbg_userword(cachep, objp) ({BUG(); (void **)NULL;})
562 * Maximum size of an obj (in 2^order pages) and absolute limit for the gfp
565 #if defined(CONFIG_LARGE_ALLOCS)
566 #define MAX_OBJ_ORDER 13 /* up to 32Mb */
567 #define MAX_GFP_ORDER 13 /* up to 32Mb */
568 #elif defined(CONFIG_MMU)
569 #define MAX_OBJ_ORDER 5 /* 32 pages */
570 #define MAX_GFP_ORDER 5 /* 32 pages */
572 #define MAX_OBJ_ORDER 8 /* up to 1Mb */
573 #define MAX_GFP_ORDER 8 /* up to 1Mb */
577 * Do not go above this order unless 0 objects fit into the slab.
579 #define BREAK_GFP_ORDER_HI 1
580 #define BREAK_GFP_ORDER_LO 0
581 static int slab_break_gfp_order = BREAK_GFP_ORDER_LO;
584 * Functions for storing/retrieving the cachep and or slab from the page
585 * allocator. These are used to find the slab an obj belongs to. With kfree(),
586 * these are used to find the cache which an obj belongs to.
588 static inline void page_set_cache(struct page *page, struct kmem_cache *cache)
590 page->lru.next = (struct list_head *)cache;
593 static inline struct kmem_cache *page_get_cache(struct page *page)
595 if (unlikely(PageCompound(page)))
596 page = (struct page *)page_private(page);
597 return (struct kmem_cache *)page->lru.next;
600 static inline void page_set_slab(struct page *page, struct slab *slab)
602 page->lru.prev = (struct list_head *)slab;
605 static inline struct slab *page_get_slab(struct page *page)
607 if (unlikely(PageCompound(page)))
608 page = (struct page *)page_private(page);
609 return (struct slab *)page->lru.prev;
612 static inline struct kmem_cache *virt_to_cache(const void *obj)
614 struct page *page = virt_to_page(obj);
615 return page_get_cache(page);
618 static inline struct slab *virt_to_slab(const void *obj)
620 struct page *page = virt_to_page(obj);
621 return page_get_slab(page);
624 static inline void *index_to_obj(struct kmem_cache *cache, struct slab *slab,
627 return slab->s_mem + cache->buffer_size * idx;
630 static inline unsigned int obj_to_index(struct kmem_cache *cache,
631 struct slab *slab, void *obj)
633 return (unsigned)(obj - slab->s_mem) / cache->buffer_size;
637 * These are the default caches for kmalloc. Custom caches can have other sizes.
639 struct cache_sizes malloc_sizes[] = {
640 #define CACHE(x) { .cs_size = (x) },
641 #include <linux/kmalloc_sizes.h>
645 EXPORT_SYMBOL(malloc_sizes);
647 /* Must match cache_sizes above. Out of line to keep cache footprint low. */
653 static struct cache_names __initdata cache_names[] = {
654 #define CACHE(x) { .name = "size-" #x, .name_dma = "size-" #x "(DMA)" },
655 #include <linux/kmalloc_sizes.h>
660 static struct arraycache_init initarray_cache __initdata =
661 { {0, BOOT_CPUCACHE_ENTRIES, 1, 0} };
662 static struct arraycache_init initarray_generic =
663 { {0, BOOT_CPUCACHE_ENTRIES, 1, 0} };
665 /* internal cache of cache description objs */
666 static struct kmem_cache cache_cache = {
668 .limit = BOOT_CPUCACHE_ENTRIES,
670 .buffer_size = sizeof(struct kmem_cache),
671 .name = "kmem_cache",
673 .obj_size = sizeof(struct kmem_cache),
677 /* Guard access to the cache-chain. */
678 static DEFINE_MUTEX(cache_chain_mutex);
679 static struct list_head cache_chain;
682 * vm_enough_memory() looks at this to determine how many slab-allocated pages
683 * are possibly freeable under pressure
685 * SLAB_RECLAIM_ACCOUNT turns this on per-slab
687 atomic_t slab_reclaim_pages;
690 * chicken and egg problem: delay the per-cpu array allocation
691 * until the general caches are up.
700 static DEFINE_PER_CPU(struct work_struct, reap_work);
702 static void free_block(struct kmem_cache *cachep, void **objpp, int len,
704 static void enable_cpucache(struct kmem_cache *cachep);
705 static void cache_reap(void *unused);
706 static int __node_shrink(struct kmem_cache *cachep, int node);
708 static inline struct array_cache *cpu_cache_get(struct kmem_cache *cachep)
710 return cachep->array[smp_processor_id()];
713 static inline struct kmem_cache *__find_general_cachep(size_t size,
716 struct cache_sizes *csizep = malloc_sizes;
719 /* This happens if someone tries to call
720 * kmem_cache_create(), or __kmalloc(), before
721 * the generic caches are initialized.
723 BUG_ON(malloc_sizes[INDEX_AC].cs_cachep == NULL);
725 while (size > csizep->cs_size)
729 * Really subtle: The last entry with cs->cs_size==ULONG_MAX
730 * has cs_{dma,}cachep==NULL. Thus no special case
731 * for large kmalloc calls required.
733 if (unlikely(gfpflags & GFP_DMA))
734 return csizep->cs_dmacachep;
735 return csizep->cs_cachep;
738 struct kmem_cache *kmem_find_general_cachep(size_t size, gfp_t gfpflags)
740 return __find_general_cachep(size, gfpflags);
742 EXPORT_SYMBOL(kmem_find_general_cachep);
744 static size_t slab_mgmt_size(size_t nr_objs, size_t align)
746 return ALIGN(sizeof(struct slab)+nr_objs*sizeof(kmem_bufctl_t), align);
750 * Calculate the number of objects and left-over bytes for a given buffer size.
752 static void cache_estimate(unsigned long gfporder, size_t buffer_size,
753 size_t align, int flags, size_t *left_over,
758 size_t slab_size = PAGE_SIZE << gfporder;
761 * The slab management structure can be either off the slab or
762 * on it. For the latter case, the memory allocated for a
766 * - One kmem_bufctl_t for each object
767 * - Padding to respect alignment of @align
768 * - @buffer_size bytes for each object
770 * If the slab management structure is off the slab, then the
771 * alignment will already be calculated into the size. Because
772 * the slabs are all pages aligned, the objects will be at the
773 * correct alignment when allocated.
775 if (flags & CFLGS_OFF_SLAB) {
777 nr_objs = slab_size / buffer_size;
779 if (nr_objs > SLAB_LIMIT)
780 nr_objs = SLAB_LIMIT;
783 * Ignore padding for the initial guess. The padding
784 * is at most @align-1 bytes, and @buffer_size is at
785 * least @align. In the worst case, this result will
786 * be one greater than the number of objects that fit
787 * into the memory allocation when taking the padding
790 nr_objs = (slab_size - sizeof(struct slab)) /
791 (buffer_size + sizeof(kmem_bufctl_t));
794 * This calculated number will be either the right
795 * amount, or one greater than what we want.
797 if (slab_mgmt_size(nr_objs, align) + nr_objs*buffer_size
801 if (nr_objs > SLAB_LIMIT)
802 nr_objs = SLAB_LIMIT;
804 mgmt_size = slab_mgmt_size(nr_objs, align);
807 *left_over = slab_size - nr_objs*buffer_size - mgmt_size;
810 #define slab_error(cachep, msg) __slab_error(__FUNCTION__, cachep, msg)
812 static void __slab_error(const char *function, struct kmem_cache *cachep,
815 printk(KERN_ERR "slab error in %s(): cache `%s': %s\n",
816 function, cachep->name, msg);
822 * Special reaping functions for NUMA systems called from cache_reap().
823 * These take care of doing round robin flushing of alien caches (containing
824 * objects freed on different nodes from which they were allocated) and the
825 * flushing of remote pcps by calling drain_node_pages.
827 static DEFINE_PER_CPU(unsigned long, reap_node);
829 static void init_reap_node(int cpu)
833 node = next_node(cpu_to_node(cpu), node_online_map);
834 if (node == MAX_NUMNODES)
835 node = first_node(node_online_map);
837 __get_cpu_var(reap_node) = node;
840 static void next_reap_node(void)
842 int node = __get_cpu_var(reap_node);
845 * Also drain per cpu pages on remote zones
847 if (node != numa_node_id())
848 drain_node_pages(node);
850 node = next_node(node, node_online_map);
851 if (unlikely(node >= MAX_NUMNODES))
852 node = first_node(node_online_map);
853 __get_cpu_var(reap_node) = node;
857 #define init_reap_node(cpu) do { } while (0)
858 #define next_reap_node(void) do { } while (0)
862 * Initiate the reap timer running on the target CPU. We run at around 1 to 2Hz
863 * via the workqueue/eventd.
864 * Add the CPU number into the expiration time to minimize the possibility of
865 * the CPUs getting into lockstep and contending for the global cache chain
868 static void __devinit start_cpu_timer(int cpu)
870 struct work_struct *reap_work = &per_cpu(reap_work, cpu);
873 * When this gets called from do_initcalls via cpucache_init(),
874 * init_workqueues() has already run, so keventd will be setup
877 if (keventd_up() && reap_work->func == NULL) {
879 INIT_WORK(reap_work, cache_reap, NULL);
880 schedule_delayed_work_on(cpu, reap_work, HZ + 3 * cpu);
884 static struct array_cache *alloc_arraycache(int node, int entries,
887 int memsize = sizeof(void *) * entries + sizeof(struct array_cache);
888 struct array_cache *nc = NULL;
890 nc = kmalloc_node(memsize, GFP_KERNEL, node);
894 nc->batchcount = batchcount;
896 spin_lock_init(&nc->lock);
902 * Transfer objects in one arraycache to another.
903 * Locking must be handled by the caller.
905 * Return the number of entries transferred.
907 static int transfer_objects(struct array_cache *to,
908 struct array_cache *from, unsigned int max)
910 /* Figure out how many entries to transfer */
911 int nr = min(min(from->avail, max), to->limit - to->avail);
916 memcpy(to->entry + to->avail, from->entry + from->avail -nr,
926 static void *__cache_alloc_node(struct kmem_cache *, gfp_t, int);
927 static void *alternate_node_alloc(struct kmem_cache *, gfp_t);
929 static struct array_cache **alloc_alien_cache(int node, int limit)
931 struct array_cache **ac_ptr;
932 int memsize = sizeof(void *) * MAX_NUMNODES;
937 ac_ptr = kmalloc_node(memsize, GFP_KERNEL, node);
940 if (i == node || !node_online(i)) {
944 ac_ptr[i] = alloc_arraycache(node, limit, 0xbaadf00d);
946 for (i--; i <= 0; i--)
956 static void free_alien_cache(struct array_cache **ac_ptr)
967 static void __drain_alien_cache(struct kmem_cache *cachep,
968 struct array_cache *ac, int node)
970 struct kmem_list3 *rl3 = cachep->nodelists[node];
973 spin_lock(&rl3->list_lock);
974 free_block(cachep, ac->entry, ac->avail, node);
976 spin_unlock(&rl3->list_lock);
981 * Called from cache_reap() to regularly drain alien caches round robin.
983 static void reap_alien(struct kmem_cache *cachep, struct kmem_list3 *l3)
985 int node = __get_cpu_var(reap_node);
988 struct array_cache *ac = l3->alien[node];
989 if (ac && ac->avail) {
990 spin_lock_irq(&ac->lock);
991 __drain_alien_cache(cachep, ac, node);
992 spin_unlock_irq(&ac->lock);
997 static void drain_alien_cache(struct kmem_cache *cachep,
998 struct array_cache **alien)
1001 struct array_cache *ac;
1002 unsigned long flags;
1004 for_each_online_node(i) {
1007 spin_lock_irqsave(&ac->lock, flags);
1008 __drain_alien_cache(cachep, ac, i);
1009 spin_unlock_irqrestore(&ac->lock, flags);
1015 #define drain_alien_cache(cachep, alien) do { } while (0)
1016 #define reap_alien(cachep, l3) do { } while (0)
1018 static inline struct array_cache **alloc_alien_cache(int node, int limit)
1020 return (struct array_cache **) 0x01020304ul;
1023 static inline void free_alien_cache(struct array_cache **ac_ptr)
1029 static int __devinit cpuup_callback(struct notifier_block *nfb,
1030 unsigned long action, void *hcpu)
1032 long cpu = (long)hcpu;
1033 struct kmem_cache *cachep;
1034 struct kmem_list3 *l3 = NULL;
1035 int node = cpu_to_node(cpu);
1036 int memsize = sizeof(struct kmem_list3);
1039 case CPU_UP_PREPARE:
1040 mutex_lock(&cache_chain_mutex);
1042 * We need to do this right in the beginning since
1043 * alloc_arraycache's are going to use this list.
1044 * kmalloc_node allows us to add the slab to the right
1045 * kmem_list3 and not this cpu's kmem_list3
1048 list_for_each_entry(cachep, &cache_chain, next) {
1050 * Set up the size64 kmemlist for cpu before we can
1051 * begin anything. Make sure some other cpu on this
1052 * node has not already allocated this
1054 if (!cachep->nodelists[node]) {
1055 l3 = kmalloc_node(memsize, GFP_KERNEL, node);
1058 kmem_list3_init(l3);
1059 l3->next_reap = jiffies + REAPTIMEOUT_LIST3 +
1060 ((unsigned long)cachep) % REAPTIMEOUT_LIST3;
1063 * The l3s don't come and go as CPUs come and
1064 * go. cache_chain_mutex is sufficient
1067 cachep->nodelists[node] = l3;
1070 spin_lock_irq(&cachep->nodelists[node]->list_lock);
1071 cachep->nodelists[node]->free_limit =
1072 (1 + nr_cpus_node(node)) *
1073 cachep->batchcount + cachep->num;
1074 spin_unlock_irq(&cachep->nodelists[node]->list_lock);
1078 * Now we can go ahead with allocating the shared arrays and
1081 list_for_each_entry(cachep, &cache_chain, next) {
1082 struct array_cache *nc;
1083 struct array_cache *shared;
1084 struct array_cache **alien;
1086 nc = alloc_arraycache(node, cachep->limit,
1087 cachep->batchcount);
1090 shared = alloc_arraycache(node,
1091 cachep->shared * cachep->batchcount,
1096 alien = alloc_alien_cache(node, cachep->limit);
1099 cachep->array[cpu] = nc;
1100 l3 = cachep->nodelists[node];
1103 spin_lock_irq(&l3->list_lock);
1106 * We are serialised from CPU_DEAD or
1107 * CPU_UP_CANCELLED by the cpucontrol lock
1109 l3->shared = shared;
1118 spin_unlock_irq(&l3->list_lock);
1120 free_alien_cache(alien);
1122 mutex_unlock(&cache_chain_mutex);
1125 start_cpu_timer(cpu);
1127 #ifdef CONFIG_HOTPLUG_CPU
1130 * Even if all the cpus of a node are down, we don't free the
1131 * kmem_list3 of any cache. This to avoid a race between
1132 * cpu_down, and a kmalloc allocation from another cpu for
1133 * memory from the node of the cpu going down. The list3
1134 * structure is usually allocated from kmem_cache_create() and
1135 * gets destroyed at kmem_cache_destroy().
1138 case CPU_UP_CANCELED:
1139 mutex_lock(&cache_chain_mutex);
1140 list_for_each_entry(cachep, &cache_chain, next) {
1141 struct array_cache *nc;
1142 struct array_cache *shared;
1143 struct array_cache **alien;
1146 mask = node_to_cpumask(node);
1147 /* cpu is dead; no one can alloc from it. */
1148 nc = cachep->array[cpu];
1149 cachep->array[cpu] = NULL;
1150 l3 = cachep->nodelists[node];
1153 goto free_array_cache;
1155 spin_lock_irq(&l3->list_lock);
1157 /* Free limit for this kmem_list3 */
1158 l3->free_limit -= cachep->batchcount;
1160 free_block(cachep, nc->entry, nc->avail, node);
1162 if (!cpus_empty(mask)) {
1163 spin_unlock_irq(&l3->list_lock);
1164 goto free_array_cache;
1167 shared = l3->shared;
1169 free_block(cachep, l3->shared->entry,
1170 l3->shared->avail, node);
1177 spin_unlock_irq(&l3->list_lock);
1181 drain_alien_cache(cachep, alien);
1182 free_alien_cache(alien);
1188 * In the previous loop, all the objects were freed to
1189 * the respective cache's slabs, now we can go ahead and
1190 * shrink each nodelist to its limit.
1192 list_for_each_entry(cachep, &cache_chain, next) {
1193 l3 = cachep->nodelists[node];
1196 spin_lock_irq(&l3->list_lock);
1197 /* free slabs belonging to this node */
1198 __node_shrink(cachep, node);
1199 spin_unlock_irq(&l3->list_lock);
1201 mutex_unlock(&cache_chain_mutex);
1207 mutex_unlock(&cache_chain_mutex);
1211 static struct notifier_block cpucache_notifier = { &cpuup_callback, NULL, 0 };
1214 * swap the static kmem_list3 with kmalloced memory
1216 static void init_list(struct kmem_cache *cachep, struct kmem_list3 *list,
1219 struct kmem_list3 *ptr;
1221 BUG_ON(cachep->nodelists[nodeid] != list);
1222 ptr = kmalloc_node(sizeof(struct kmem_list3), GFP_KERNEL, nodeid);
1225 local_irq_disable();
1226 memcpy(ptr, list, sizeof(struct kmem_list3));
1227 MAKE_ALL_LISTS(cachep, ptr, nodeid);
1228 cachep->nodelists[nodeid] = ptr;
1233 * Initialisation. Called after the page allocator have been initialised and
1234 * before smp_init().
1236 void __init kmem_cache_init(void)
1239 struct cache_sizes *sizes;
1240 struct cache_names *names;
1244 for (i = 0; i < NUM_INIT_LISTS; i++) {
1245 kmem_list3_init(&initkmem_list3[i]);
1246 if (i < MAX_NUMNODES)
1247 cache_cache.nodelists[i] = NULL;
1251 * Fragmentation resistance on low memory - only use bigger
1252 * page orders on machines with more than 32MB of memory.
1254 if (num_physpages > (32 << 20) >> PAGE_SHIFT)
1255 slab_break_gfp_order = BREAK_GFP_ORDER_HI;
1257 /* Bootstrap is tricky, because several objects are allocated
1258 * from caches that do not exist yet:
1259 * 1) initialize the cache_cache cache: it contains the struct
1260 * kmem_cache structures of all caches, except cache_cache itself:
1261 * cache_cache is statically allocated.
1262 * Initially an __init data area is used for the head array and the
1263 * kmem_list3 structures, it's replaced with a kmalloc allocated
1264 * array at the end of the bootstrap.
1265 * 2) Create the first kmalloc cache.
1266 * The struct kmem_cache for the new cache is allocated normally.
1267 * An __init data area is used for the head array.
1268 * 3) Create the remaining kmalloc caches, with minimally sized
1270 * 4) Replace the __init data head arrays for cache_cache and the first
1271 * kmalloc cache with kmalloc allocated arrays.
1272 * 5) Replace the __init data for kmem_list3 for cache_cache and
1273 * the other cache's with kmalloc allocated memory.
1274 * 6) Resize the head arrays of the kmalloc caches to their final sizes.
1277 /* 1) create the cache_cache */
1278 INIT_LIST_HEAD(&cache_chain);
1279 list_add(&cache_cache.next, &cache_chain);
1280 cache_cache.colour_off = cache_line_size();
1281 cache_cache.array[smp_processor_id()] = &initarray_cache.cache;
1282 cache_cache.nodelists[numa_node_id()] = &initkmem_list3[CACHE_CACHE];
1284 cache_cache.buffer_size = ALIGN(cache_cache.buffer_size,
1287 for (order = 0; order < MAX_ORDER; order++) {
1288 cache_estimate(order, cache_cache.buffer_size,
1289 cache_line_size(), 0, &left_over, &cache_cache.num);
1290 if (cache_cache.num)
1293 if (!cache_cache.num)
1295 cache_cache.gfporder = order;
1296 cache_cache.colour = left_over / cache_cache.colour_off;
1297 cache_cache.slab_size = ALIGN(cache_cache.num * sizeof(kmem_bufctl_t) +
1298 sizeof(struct slab), cache_line_size());
1300 /* 2+3) create the kmalloc caches */
1301 sizes = malloc_sizes;
1302 names = cache_names;
1305 * Initialize the caches that provide memory for the array cache and the
1306 * kmem_list3 structures first. Without this, further allocations will
1310 sizes[INDEX_AC].cs_cachep = kmem_cache_create(names[INDEX_AC].name,
1311 sizes[INDEX_AC].cs_size,
1312 ARCH_KMALLOC_MINALIGN,
1313 ARCH_KMALLOC_FLAGS|SLAB_PANIC,
1316 if (INDEX_AC != INDEX_L3) {
1317 sizes[INDEX_L3].cs_cachep =
1318 kmem_cache_create(names[INDEX_L3].name,
1319 sizes[INDEX_L3].cs_size,
1320 ARCH_KMALLOC_MINALIGN,
1321 ARCH_KMALLOC_FLAGS|SLAB_PANIC,
1325 while (sizes->cs_size != ULONG_MAX) {
1327 * For performance, all the general caches are L1 aligned.
1328 * This should be particularly beneficial on SMP boxes, as it
1329 * eliminates "false sharing".
1330 * Note for systems short on memory removing the alignment will
1331 * allow tighter packing of the smaller caches.
1333 if (!sizes->cs_cachep) {
1334 sizes->cs_cachep = kmem_cache_create(names->name,
1336 ARCH_KMALLOC_MINALIGN,
1337 ARCH_KMALLOC_FLAGS|SLAB_PANIC,
1341 /* Inc off-slab bufctl limit until the ceiling is hit. */
1342 if (!(OFF_SLAB(sizes->cs_cachep))) {
1343 offslab_limit = sizes->cs_size - sizeof(struct slab);
1344 offslab_limit /= sizeof(kmem_bufctl_t);
1347 sizes->cs_dmacachep = kmem_cache_create(names->name_dma,
1349 ARCH_KMALLOC_MINALIGN,
1350 ARCH_KMALLOC_FLAGS|SLAB_CACHE_DMA|
1356 /* 4) Replace the bootstrap head arrays */
1360 ptr = kmalloc(sizeof(struct arraycache_init), GFP_KERNEL);
1362 local_irq_disable();
1363 BUG_ON(cpu_cache_get(&cache_cache) != &initarray_cache.cache);
1364 memcpy(ptr, cpu_cache_get(&cache_cache),
1365 sizeof(struct arraycache_init));
1366 cache_cache.array[smp_processor_id()] = ptr;
1369 ptr = kmalloc(sizeof(struct arraycache_init), GFP_KERNEL);
1371 local_irq_disable();
1372 BUG_ON(cpu_cache_get(malloc_sizes[INDEX_AC].cs_cachep)
1373 != &initarray_generic.cache);
1374 memcpy(ptr, cpu_cache_get(malloc_sizes[INDEX_AC].cs_cachep),
1375 sizeof(struct arraycache_init));
1376 malloc_sizes[INDEX_AC].cs_cachep->array[smp_processor_id()] =
1380 /* 5) Replace the bootstrap kmem_list3's */
1383 /* Replace the static kmem_list3 structures for the boot cpu */
1384 init_list(&cache_cache, &initkmem_list3[CACHE_CACHE],
1387 for_each_online_node(node) {
1388 init_list(malloc_sizes[INDEX_AC].cs_cachep,
1389 &initkmem_list3[SIZE_AC + node], node);
1391 if (INDEX_AC != INDEX_L3) {
1392 init_list(malloc_sizes[INDEX_L3].cs_cachep,
1393 &initkmem_list3[SIZE_L3 + node],
1399 /* 6) resize the head arrays to their final sizes */
1401 struct kmem_cache *cachep;
1402 mutex_lock(&cache_chain_mutex);
1403 list_for_each_entry(cachep, &cache_chain, next)
1404 enable_cpucache(cachep);
1405 mutex_unlock(&cache_chain_mutex);
1409 g_cpucache_up = FULL;
1412 * Register a cpu startup notifier callback that initializes
1413 * cpu_cache_get for all new cpus
1415 register_cpu_notifier(&cpucache_notifier);
1418 * The reap timers are started later, with a module init call: That part
1419 * of the kernel is not yet operational.
1423 static int __init cpucache_init(void)
1428 * Register the timers that return unneeded pages to the page allocator
1430 for_each_online_cpu(cpu)
1431 start_cpu_timer(cpu);
1434 __initcall(cpucache_init);
1437 * Interface to system's page allocator. No need to hold the cache-lock.
1439 * If we requested dmaable memory, we will get it. Even if we
1440 * did not request dmaable memory, we might get it, but that
1441 * would be relatively rare and ignorable.
1443 static void *kmem_getpages(struct kmem_cache *cachep, gfp_t flags, int nodeid)
1449 flags |= cachep->gfpflags;
1450 page = alloc_pages_node(nodeid, flags, cachep->gfporder);
1453 addr = page_address(page);
1455 i = (1 << cachep->gfporder);
1456 if (cachep->flags & SLAB_RECLAIM_ACCOUNT)
1457 atomic_add(i, &slab_reclaim_pages);
1458 add_page_state(nr_slab, i);
1460 __SetPageSlab(page);
1467 * Interface to system's page release.
1469 static void kmem_freepages(struct kmem_cache *cachep, void *addr)
1471 unsigned long i = (1 << cachep->gfporder);
1472 struct page *page = virt_to_page(addr);
1473 const unsigned long nr_freed = i;
1476 BUG_ON(!PageSlab(page));
1477 __ClearPageSlab(page);
1480 sub_page_state(nr_slab, nr_freed);
1481 if (current->reclaim_state)
1482 current->reclaim_state->reclaimed_slab += nr_freed;
1483 free_pages((unsigned long)addr, cachep->gfporder);
1484 if (cachep->flags & SLAB_RECLAIM_ACCOUNT)
1485 atomic_sub(1 << cachep->gfporder, &slab_reclaim_pages);
1488 static void kmem_rcu_free(struct rcu_head *head)
1490 struct slab_rcu *slab_rcu = (struct slab_rcu *)head;
1491 struct kmem_cache *cachep = slab_rcu->cachep;
1493 kmem_freepages(cachep, slab_rcu->addr);
1494 if (OFF_SLAB(cachep))
1495 kmem_cache_free(cachep->slabp_cache, slab_rcu);
1500 #ifdef CONFIG_DEBUG_PAGEALLOC
1501 static void store_stackinfo(struct kmem_cache *cachep, unsigned long *addr,
1502 unsigned long caller)
1504 int size = obj_size(cachep);
1506 addr = (unsigned long *)&((char *)addr)[obj_offset(cachep)];
1508 if (size < 5 * sizeof(unsigned long))
1511 *addr++ = 0x12345678;
1513 *addr++ = smp_processor_id();
1514 size -= 3 * sizeof(unsigned long);
1516 unsigned long *sptr = &caller;
1517 unsigned long svalue;
1519 while (!kstack_end(sptr)) {
1521 if (kernel_text_address(svalue)) {
1523 size -= sizeof(unsigned long);
1524 if (size <= sizeof(unsigned long))
1530 *addr++ = 0x87654321;
1534 static void poison_obj(struct kmem_cache *cachep, void *addr, unsigned char val)
1536 int size = obj_size(cachep);
1537 addr = &((char *)addr)[obj_offset(cachep)];
1539 memset(addr, val, size);
1540 *(unsigned char *)(addr + size - 1) = POISON_END;
1543 static void dump_line(char *data, int offset, int limit)
1546 printk(KERN_ERR "%03x:", offset);
1547 for (i = 0; i < limit; i++)
1548 printk(" %02x", (unsigned char)data[offset + i]);
1555 static void print_objinfo(struct kmem_cache *cachep, void *objp, int lines)
1560 if (cachep->flags & SLAB_RED_ZONE) {
1561 printk(KERN_ERR "Redzone: 0x%lx/0x%lx.\n",
1562 *dbg_redzone1(cachep, objp),
1563 *dbg_redzone2(cachep, objp));
1566 if (cachep->flags & SLAB_STORE_USER) {
1567 printk(KERN_ERR "Last user: [<%p>]",
1568 *dbg_userword(cachep, objp));
1569 print_symbol("(%s)",
1570 (unsigned long)*dbg_userword(cachep, objp));
1573 realobj = (char *)objp + obj_offset(cachep);
1574 size = obj_size(cachep);
1575 for (i = 0; i < size && lines; i += 16, lines--) {
1578 if (i + limit > size)
1580 dump_line(realobj, i, limit);
1584 static void check_poison_obj(struct kmem_cache *cachep, void *objp)
1590 realobj = (char *)objp + obj_offset(cachep);
1591 size = obj_size(cachep);
1593 for (i = 0; i < size; i++) {
1594 char exp = POISON_FREE;
1597 if (realobj[i] != exp) {
1603 "Slab corruption: start=%p, len=%d\n",
1605 print_objinfo(cachep, objp, 0);
1607 /* Hexdump the affected line */
1610 if (i + limit > size)
1612 dump_line(realobj, i, limit);
1615 /* Limit to 5 lines */
1621 /* Print some data about the neighboring objects, if they
1624 struct slab *slabp = virt_to_slab(objp);
1627 objnr = obj_to_index(cachep, slabp, objp);
1629 objp = index_to_obj(cachep, slabp, objnr - 1);
1630 realobj = (char *)objp + obj_offset(cachep);
1631 printk(KERN_ERR "Prev obj: start=%p, len=%d\n",
1633 print_objinfo(cachep, objp, 2);
1635 if (objnr + 1 < cachep->num) {
1636 objp = index_to_obj(cachep, slabp, objnr + 1);
1637 realobj = (char *)objp + obj_offset(cachep);
1638 printk(KERN_ERR "Next obj: start=%p, len=%d\n",
1640 print_objinfo(cachep, objp, 2);
1648 * slab_destroy_objs - destroy a slab and its objects
1649 * @cachep: cache pointer being destroyed
1650 * @slabp: slab pointer being destroyed
1652 * Call the registered destructor for each object in a slab that is being
1655 static void slab_destroy_objs(struct kmem_cache *cachep, struct slab *slabp)
1658 for (i = 0; i < cachep->num; i++) {
1659 void *objp = index_to_obj(cachep, slabp, i);
1661 if (cachep->flags & SLAB_POISON) {
1662 #ifdef CONFIG_DEBUG_PAGEALLOC
1663 if (cachep->buffer_size % PAGE_SIZE == 0 &&
1665 kernel_map_pages(virt_to_page(objp),
1666 cachep->buffer_size / PAGE_SIZE, 1);
1668 check_poison_obj(cachep, objp);
1670 check_poison_obj(cachep, objp);
1673 if (cachep->flags & SLAB_RED_ZONE) {
1674 if (*dbg_redzone1(cachep, objp) != RED_INACTIVE)
1675 slab_error(cachep, "start of a freed object "
1677 if (*dbg_redzone2(cachep, objp) != RED_INACTIVE)
1678 slab_error(cachep, "end of a freed object "
1681 if (cachep->dtor && !(cachep->flags & SLAB_POISON))
1682 (cachep->dtor) (objp + obj_offset(cachep), cachep, 0);
1686 static void slab_destroy_objs(struct kmem_cache *cachep, struct slab *slabp)
1690 for (i = 0; i < cachep->num; i++) {
1691 void *objp = index_to_obj(cachep, slabp, i);
1692 (cachep->dtor) (objp, cachep, 0);
1699 * slab_destroy - destroy and release all objects in a slab
1700 * @cachep: cache pointer being destroyed
1701 * @slabp: slab pointer being destroyed
1703 * Destroy all the objs in a slab, and release the mem back to the system.
1704 * Before calling the slab must have been unlinked from the cache. The
1705 * cache-lock is not held/needed.
1707 static void slab_destroy(struct kmem_cache *cachep, struct slab *slabp)
1709 void *addr = slabp->s_mem - slabp->colouroff;
1711 slab_destroy_objs(cachep, slabp);
1712 if (unlikely(cachep->flags & SLAB_DESTROY_BY_RCU)) {
1713 struct slab_rcu *slab_rcu;
1715 slab_rcu = (struct slab_rcu *)slabp;
1716 slab_rcu->cachep = cachep;
1717 slab_rcu->addr = addr;
1718 call_rcu(&slab_rcu->head, kmem_rcu_free);
1720 kmem_freepages(cachep, addr);
1721 if (OFF_SLAB(cachep))
1722 kmem_cache_free(cachep->slabp_cache, slabp);
1727 * For setting up all the kmem_list3s for cache whose buffer_size is same as
1728 * size of kmem_list3.
1730 static void set_up_list3s(struct kmem_cache *cachep, int index)
1734 for_each_online_node(node) {
1735 cachep->nodelists[node] = &initkmem_list3[index + node];
1736 cachep->nodelists[node]->next_reap = jiffies +
1738 ((unsigned long)cachep) % REAPTIMEOUT_LIST3;
1743 * calculate_slab_order - calculate size (page order) of slabs
1744 * @cachep: pointer to the cache that is being created
1745 * @size: size of objects to be created in this cache.
1746 * @align: required alignment for the objects.
1747 * @flags: slab allocation flags
1749 * Also calculates the number of objects per slab.
1751 * This could be made much more intelligent. For now, try to avoid using
1752 * high order pages for slabs. When the gfp() functions are more friendly
1753 * towards high-order requests, this should be changed.
1755 static size_t calculate_slab_order(struct kmem_cache *cachep,
1756 size_t size, size_t align, unsigned long flags)
1758 size_t left_over = 0;
1761 for (gfporder = 0; gfporder <= MAX_GFP_ORDER; gfporder++) {
1765 cache_estimate(gfporder, size, align, flags, &remainder, &num);
1769 /* More than offslab_limit objects will cause problems */
1770 if ((flags & CFLGS_OFF_SLAB) && num > offslab_limit)
1773 /* Found something acceptable - save it away */
1775 cachep->gfporder = gfporder;
1776 left_over = remainder;
1779 * A VFS-reclaimable slab tends to have most allocations
1780 * as GFP_NOFS and we really don't want to have to be allocating
1781 * higher-order pages when we are unable to shrink dcache.
1783 if (flags & SLAB_RECLAIM_ACCOUNT)
1787 * Large number of objects is good, but very large slabs are
1788 * currently bad for the gfp()s.
1790 if (gfporder >= slab_break_gfp_order)
1794 * Acceptable internal fragmentation?
1796 if (left_over * 8 <= (PAGE_SIZE << gfporder))
1802 static void setup_cpu_cache(struct kmem_cache *cachep)
1804 if (g_cpucache_up == FULL) {
1805 enable_cpucache(cachep);
1808 if (g_cpucache_up == NONE) {
1810 * Note: the first kmem_cache_create must create the cache
1811 * that's used by kmalloc(24), otherwise the creation of
1812 * further caches will BUG().
1814 cachep->array[smp_processor_id()] = &initarray_generic.cache;
1817 * If the cache that's used by kmalloc(sizeof(kmem_list3)) is
1818 * the first cache, then we need to set up all its list3s,
1819 * otherwise the creation of further caches will BUG().
1821 set_up_list3s(cachep, SIZE_AC);
1822 if (INDEX_AC == INDEX_L3)
1823 g_cpucache_up = PARTIAL_L3;
1825 g_cpucache_up = PARTIAL_AC;
1827 cachep->array[smp_processor_id()] =
1828 kmalloc(sizeof(struct arraycache_init), GFP_KERNEL);
1830 if (g_cpucache_up == PARTIAL_AC) {
1831 set_up_list3s(cachep, SIZE_L3);
1832 g_cpucache_up = PARTIAL_L3;
1835 for_each_online_node(node) {
1836 cachep->nodelists[node] =
1837 kmalloc_node(sizeof(struct kmem_list3),
1839 BUG_ON(!cachep->nodelists[node]);
1840 kmem_list3_init(cachep->nodelists[node]);
1844 cachep->nodelists[numa_node_id()]->next_reap =
1845 jiffies + REAPTIMEOUT_LIST3 +
1846 ((unsigned long)cachep) % REAPTIMEOUT_LIST3;
1848 cpu_cache_get(cachep)->avail = 0;
1849 cpu_cache_get(cachep)->limit = BOOT_CPUCACHE_ENTRIES;
1850 cpu_cache_get(cachep)->batchcount = 1;
1851 cpu_cache_get(cachep)->touched = 0;
1852 cachep->batchcount = 1;
1853 cachep->limit = BOOT_CPUCACHE_ENTRIES;
1857 * kmem_cache_create - Create a cache.
1858 * @name: A string which is used in /proc/slabinfo to identify this cache.
1859 * @size: The size of objects to be created in this cache.
1860 * @align: The required alignment for the objects.
1861 * @flags: SLAB flags
1862 * @ctor: A constructor for the objects.
1863 * @dtor: A destructor for the objects.
1865 * Returns a ptr to the cache on success, NULL on failure.
1866 * Cannot be called within a int, but can be interrupted.
1867 * The @ctor is run when new pages are allocated by the cache
1868 * and the @dtor is run before the pages are handed back.
1870 * @name must be valid until the cache is destroyed. This implies that
1871 * the module calling this has to destroy the cache before getting unloaded.
1875 * %SLAB_POISON - Poison the slab with a known test pattern (a5a5a5a5)
1876 * to catch references to uninitialised memory.
1878 * %SLAB_RED_ZONE - Insert `Red' zones around the allocated memory to check
1879 * for buffer overruns.
1881 * %SLAB_HWCACHE_ALIGN - Align the objects in this cache to a hardware
1882 * cacheline. This can be beneficial if you're counting cycles as closely
1886 kmem_cache_create (const char *name, size_t size, size_t align,
1887 unsigned long flags,
1888 void (*ctor)(void*, struct kmem_cache *, unsigned long),
1889 void (*dtor)(void*, struct kmem_cache *, unsigned long))
1891 size_t left_over, slab_size, ralign;
1892 struct kmem_cache *cachep = NULL;
1893 struct list_head *p;
1896 * Sanity checks... these are all serious usage bugs.
1898 if (!name || in_interrupt() || (size < BYTES_PER_WORD) ||
1899 (size > (1 << MAX_OBJ_ORDER) * PAGE_SIZE) || (dtor && !ctor)) {
1900 printk(KERN_ERR "%s: Early error in slab %s\n", __FUNCTION__,
1906 * Prevent CPUs from coming and going.
1907 * lock_cpu_hotplug() nests outside cache_chain_mutex
1911 mutex_lock(&cache_chain_mutex);
1913 list_for_each(p, &cache_chain) {
1914 struct kmem_cache *pc = list_entry(p, struct kmem_cache, next);
1915 mm_segment_t old_fs = get_fs();
1920 * This happens when the module gets unloaded and doesn't
1921 * destroy its slab cache and no-one else reuses the vmalloc
1922 * area of the module. Print a warning.
1925 res = __get_user(tmp, pc->name);
1928 printk("SLAB: cache with size %d has lost its name\n",
1933 if (!strcmp(pc->name, name)) {
1934 printk("kmem_cache_create: duplicate cache %s\n", name);
1941 WARN_ON(strchr(name, ' ')); /* It confuses parsers */
1942 if ((flags & SLAB_DEBUG_INITIAL) && !ctor) {
1943 /* No constructor, but inital state check requested */
1944 printk(KERN_ERR "%s: No con, but init state check "
1945 "requested - %s\n", __FUNCTION__, name);
1946 flags &= ~SLAB_DEBUG_INITIAL;
1950 * Enable redzoning and last user accounting, except for caches with
1951 * large objects, if the increased size would increase the object size
1952 * above the next power of two: caches with object sizes just above a
1953 * power of two have a significant amount of internal fragmentation.
1955 if (size < 4096 || fls(size - 1) == fls(size-1 + 3 * BYTES_PER_WORD))
1956 flags |= SLAB_RED_ZONE | SLAB_STORE_USER;
1957 if (!(flags & SLAB_DESTROY_BY_RCU))
1958 flags |= SLAB_POISON;
1960 if (flags & SLAB_DESTROY_BY_RCU)
1961 BUG_ON(flags & SLAB_POISON);
1963 if (flags & SLAB_DESTROY_BY_RCU)
1967 * Always checks flags, a caller might be expecting debug support which
1970 if (flags & ~CREATE_MASK)
1974 * Check that size is in terms of words. This is needed to avoid
1975 * unaligned accesses for some archs when redzoning is used, and makes
1976 * sure any on-slab bufctl's are also correctly aligned.
1978 if (size & (BYTES_PER_WORD - 1)) {
1979 size += (BYTES_PER_WORD - 1);
1980 size &= ~(BYTES_PER_WORD - 1);
1983 /* calculate the final buffer alignment: */
1985 /* 1) arch recommendation: can be overridden for debug */
1986 if (flags & SLAB_HWCACHE_ALIGN) {
1988 * Default alignment: as specified by the arch code. Except if
1989 * an object is really small, then squeeze multiple objects into
1992 ralign = cache_line_size();
1993 while (size <= ralign / 2)
1996 ralign = BYTES_PER_WORD;
1998 /* 2) arch mandated alignment: disables debug if necessary */
1999 if (ralign < ARCH_SLAB_MINALIGN) {
2000 ralign = ARCH_SLAB_MINALIGN;
2001 if (ralign > BYTES_PER_WORD)
2002 flags &= ~(SLAB_RED_ZONE | SLAB_STORE_USER);
2004 /* 3) caller mandated alignment: disables debug if necessary */
2005 if (ralign < align) {
2007 if (ralign > BYTES_PER_WORD)
2008 flags &= ~(SLAB_RED_ZONE | SLAB_STORE_USER);
2011 * 4) Store it. Note that the debug code below can reduce
2012 * the alignment to BYTES_PER_WORD.
2016 /* Get cache's description obj. */
2017 cachep = kmem_cache_zalloc(&cache_cache, SLAB_KERNEL);
2022 cachep->obj_size = size;
2024 if (flags & SLAB_RED_ZONE) {
2025 /* redzoning only works with word aligned caches */
2026 align = BYTES_PER_WORD;
2028 /* add space for red zone words */
2029 cachep->obj_offset += BYTES_PER_WORD;
2030 size += 2 * BYTES_PER_WORD;
2032 if (flags & SLAB_STORE_USER) {
2033 /* user store requires word alignment and
2034 * one word storage behind the end of the real
2037 align = BYTES_PER_WORD;
2038 size += BYTES_PER_WORD;
2040 #if FORCED_DEBUG && defined(CONFIG_DEBUG_PAGEALLOC)
2041 if (size >= malloc_sizes[INDEX_L3 + 1].cs_size
2042 && cachep->obj_size > cache_line_size() && size < PAGE_SIZE) {
2043 cachep->obj_offset += PAGE_SIZE - size;
2049 /* Determine if the slab management is 'on' or 'off' slab. */
2050 if (size >= (PAGE_SIZE >> 3))
2052 * Size is large, assume best to place the slab management obj
2053 * off-slab (should allow better packing of objs).
2055 flags |= CFLGS_OFF_SLAB;
2057 size = ALIGN(size, align);
2059 left_over = calculate_slab_order(cachep, size, align, flags);
2062 printk("kmem_cache_create: couldn't create cache %s.\n", name);
2063 kmem_cache_free(&cache_cache, cachep);
2067 slab_size = ALIGN(cachep->num * sizeof(kmem_bufctl_t)
2068 + sizeof(struct slab), align);
2071 * If the slab has been placed off-slab, and we have enough space then
2072 * move it on-slab. This is at the expense of any extra colouring.
2074 if (flags & CFLGS_OFF_SLAB && left_over >= slab_size) {
2075 flags &= ~CFLGS_OFF_SLAB;
2076 left_over -= slab_size;
2079 if (flags & CFLGS_OFF_SLAB) {
2080 /* really off slab. No need for manual alignment */
2082 cachep->num * sizeof(kmem_bufctl_t) + sizeof(struct slab);
2085 cachep->colour_off = cache_line_size();
2086 /* Offset must be a multiple of the alignment. */
2087 if (cachep->colour_off < align)
2088 cachep->colour_off = align;
2089 cachep->colour = left_over / cachep->colour_off;
2090 cachep->slab_size = slab_size;
2091 cachep->flags = flags;
2092 cachep->gfpflags = 0;
2093 if (flags & SLAB_CACHE_DMA)
2094 cachep->gfpflags |= GFP_DMA;
2095 cachep->buffer_size = size;
2097 if (flags & CFLGS_OFF_SLAB)
2098 cachep->slabp_cache = kmem_find_general_cachep(slab_size, 0u);
2099 cachep->ctor = ctor;
2100 cachep->dtor = dtor;
2101 cachep->name = name;
2104 setup_cpu_cache(cachep);
2106 /* cache setup completed, link it into the list */
2107 list_add(&cachep->next, &cache_chain);
2109 if (!cachep && (flags & SLAB_PANIC))
2110 panic("kmem_cache_create(): failed to create slab `%s'\n",
2112 mutex_unlock(&cache_chain_mutex);
2113 unlock_cpu_hotplug();
2116 EXPORT_SYMBOL(kmem_cache_create);
2119 static void check_irq_off(void)
2121 BUG_ON(!irqs_disabled());
2124 static void check_irq_on(void)
2126 BUG_ON(irqs_disabled());
2129 static void check_spinlock_acquired(struct kmem_cache *cachep)
2133 assert_spin_locked(&cachep->nodelists[numa_node_id()]->list_lock);
2137 static void check_spinlock_acquired_node(struct kmem_cache *cachep, int node)
2141 assert_spin_locked(&cachep->nodelists[node]->list_lock);
2146 #define check_irq_off() do { } while(0)
2147 #define check_irq_on() do { } while(0)
2148 #define check_spinlock_acquired(x) do { } while(0)
2149 #define check_spinlock_acquired_node(x, y) do { } while(0)
2152 static void drain_array(struct kmem_cache *cachep, struct kmem_list3 *l3,
2153 struct array_cache *ac,
2154 int force, int node);
2156 static void do_drain(void *arg)
2158 struct kmem_cache *cachep = arg;
2159 struct array_cache *ac;
2160 int node = numa_node_id();
2163 ac = cpu_cache_get(cachep);
2164 spin_lock(&cachep->nodelists[node]->list_lock);
2165 free_block(cachep, ac->entry, ac->avail, node);
2166 spin_unlock(&cachep->nodelists[node]->list_lock);
2170 static void drain_cpu_caches(struct kmem_cache *cachep)
2172 struct kmem_list3 *l3;
2175 on_each_cpu(do_drain, cachep, 1, 1);
2177 for_each_online_node(node) {
2178 l3 = cachep->nodelists[node];
2180 drain_array(cachep, l3, l3->shared, 1, node);
2182 drain_alien_cache(cachep, l3->alien);
2187 static int __node_shrink(struct kmem_cache *cachep, int node)
2190 struct kmem_list3 *l3 = cachep->nodelists[node];
2194 struct list_head *p;
2196 p = l3->slabs_free.prev;
2197 if (p == &l3->slabs_free)
2200 slabp = list_entry(l3->slabs_free.prev, struct slab, list);
2205 list_del(&slabp->list);
2207 l3->free_objects -= cachep->num;
2208 spin_unlock_irq(&l3->list_lock);
2209 slab_destroy(cachep, slabp);
2210 spin_lock_irq(&l3->list_lock);
2212 ret = !list_empty(&l3->slabs_full) || !list_empty(&l3->slabs_partial);
2216 static int __cache_shrink(struct kmem_cache *cachep)
2219 struct kmem_list3 *l3;
2221 drain_cpu_caches(cachep);
2224 for_each_online_node(i) {
2225 l3 = cachep->nodelists[i];
2227 spin_lock_irq(&l3->list_lock);
2228 ret += __node_shrink(cachep, i);
2229 spin_unlock_irq(&l3->list_lock);
2232 return (ret ? 1 : 0);
2236 * kmem_cache_shrink - Shrink a cache.
2237 * @cachep: The cache to shrink.
2239 * Releases as many slabs as possible for a cache.
2240 * To help debugging, a zero exit status indicates all slabs were released.
2242 int kmem_cache_shrink(struct kmem_cache *cachep)
2244 if (!cachep || in_interrupt())
2247 return __cache_shrink(cachep);
2249 EXPORT_SYMBOL(kmem_cache_shrink);
2252 * kmem_cache_destroy - delete a cache
2253 * @cachep: the cache to destroy
2255 * Remove a struct kmem_cache object from the slab cache.
2256 * Returns 0 on success.
2258 * It is expected this function will be called by a module when it is
2259 * unloaded. This will remove the cache completely, and avoid a duplicate
2260 * cache being allocated each time a module is loaded and unloaded, if the
2261 * module doesn't have persistent in-kernel storage across loads and unloads.
2263 * The cache must be empty before calling this function.
2265 * The caller must guarantee that noone will allocate memory from the cache
2266 * during the kmem_cache_destroy().
2268 int kmem_cache_destroy(struct kmem_cache *cachep)
2271 struct kmem_list3 *l3;
2273 if (!cachep || in_interrupt())
2276 /* Don't let CPUs to come and go */
2279 /* Find the cache in the chain of caches. */
2280 mutex_lock(&cache_chain_mutex);
2282 * the chain is never empty, cache_cache is never destroyed
2284 list_del(&cachep->next);
2285 mutex_unlock(&cache_chain_mutex);
2287 if (__cache_shrink(cachep)) {
2288 slab_error(cachep, "Can't free all objects");
2289 mutex_lock(&cache_chain_mutex);
2290 list_add(&cachep->next, &cache_chain);
2291 mutex_unlock(&cache_chain_mutex);
2292 unlock_cpu_hotplug();
2296 if (unlikely(cachep->flags & SLAB_DESTROY_BY_RCU))
2299 for_each_online_cpu(i)
2300 kfree(cachep->array[i]);
2302 /* NUMA: free the list3 structures */
2303 for_each_online_node(i) {
2304 l3 = cachep->nodelists[i];
2307 free_alien_cache(l3->alien);
2311 kmem_cache_free(&cache_cache, cachep);
2312 unlock_cpu_hotplug();
2315 EXPORT_SYMBOL(kmem_cache_destroy);
2317 /* Get the memory for a slab management obj. */
2318 static struct slab *alloc_slabmgmt(struct kmem_cache *cachep, void *objp,
2319 int colour_off, gfp_t local_flags)
2323 if (OFF_SLAB(cachep)) {
2324 /* Slab management obj is off-slab. */
2325 slabp = kmem_cache_alloc(cachep->slabp_cache, local_flags);
2329 slabp = objp + colour_off;
2330 colour_off += cachep->slab_size;
2333 slabp->colouroff = colour_off;
2334 slabp->s_mem = objp + colour_off;
2338 static inline kmem_bufctl_t *slab_bufctl(struct slab *slabp)
2340 return (kmem_bufctl_t *) (slabp + 1);
2343 static void cache_init_objs(struct kmem_cache *cachep,
2344 struct slab *slabp, unsigned long ctor_flags)
2348 for (i = 0; i < cachep->num; i++) {
2349 void *objp = index_to_obj(cachep, slabp, i);
2351 /* need to poison the objs? */
2352 if (cachep->flags & SLAB_POISON)
2353 poison_obj(cachep, objp, POISON_FREE);
2354 if (cachep->flags & SLAB_STORE_USER)
2355 *dbg_userword(cachep, objp) = NULL;
2357 if (cachep->flags & SLAB_RED_ZONE) {
2358 *dbg_redzone1(cachep, objp) = RED_INACTIVE;
2359 *dbg_redzone2(cachep, objp) = RED_INACTIVE;
2362 * Constructors are not allowed to allocate memory from the same
2363 * cache which they are a constructor for. Otherwise, deadlock.
2364 * They must also be threaded.
2366 if (cachep->ctor && !(cachep->flags & SLAB_POISON))
2367 cachep->ctor(objp + obj_offset(cachep), cachep,
2370 if (cachep->flags & SLAB_RED_ZONE) {
2371 if (*dbg_redzone2(cachep, objp) != RED_INACTIVE)
2372 slab_error(cachep, "constructor overwrote the"
2373 " end of an object");
2374 if (*dbg_redzone1(cachep, objp) != RED_INACTIVE)
2375 slab_error(cachep, "constructor overwrote the"
2376 " start of an object");
2378 if ((cachep->buffer_size % PAGE_SIZE) == 0 &&
2379 OFF_SLAB(cachep) && cachep->flags & SLAB_POISON)
2380 kernel_map_pages(virt_to_page(objp),
2381 cachep->buffer_size / PAGE_SIZE, 0);
2384 cachep->ctor(objp, cachep, ctor_flags);
2386 slab_bufctl(slabp)[i] = i + 1;
2388 slab_bufctl(slabp)[i - 1] = BUFCTL_END;
2392 static void kmem_flagcheck(struct kmem_cache *cachep, gfp_t flags)
2394 if (flags & SLAB_DMA)
2395 BUG_ON(!(cachep->gfpflags & GFP_DMA));
2397 BUG_ON(cachep->gfpflags & GFP_DMA);
2400 static void *slab_get_obj(struct kmem_cache *cachep, struct slab *slabp,
2403 void *objp = index_to_obj(cachep, slabp, slabp->free);
2407 next = slab_bufctl(slabp)[slabp->free];
2409 slab_bufctl(slabp)[slabp->free] = BUFCTL_FREE;
2410 WARN_ON(slabp->nodeid != nodeid);
2417 static void slab_put_obj(struct kmem_cache *cachep, struct slab *slabp,
2418 void *objp, int nodeid)
2420 unsigned int objnr = obj_to_index(cachep, slabp, objp);
2423 /* Verify that the slab belongs to the intended node */
2424 WARN_ON(slabp->nodeid != nodeid);
2426 if (slab_bufctl(slabp)[objnr] + 1 <= SLAB_LIMIT + 1) {
2427 printk(KERN_ERR "slab: double free detected in cache "
2428 "'%s', objp %p\n", cachep->name, objp);
2432 slab_bufctl(slabp)[objnr] = slabp->free;
2433 slabp->free = objnr;
2437 static void set_slab_attr(struct kmem_cache *cachep, struct slab *slabp,
2443 /* Nasty!!!!!! I hope this is OK. */
2444 page = virt_to_page(objp);
2447 if (likely(!PageCompound(page)))
2448 i <<= cachep->gfporder;
2450 page_set_cache(page, cachep);
2451 page_set_slab(page, slabp);
2457 * Grow (by 1) the number of slabs within a cache. This is called by
2458 * kmem_cache_alloc() when there are no active objs left in a cache.
2460 static int cache_grow(struct kmem_cache *cachep, gfp_t flags, int nodeid)
2466 unsigned long ctor_flags;
2467 struct kmem_list3 *l3;
2470 * Be lazy and only check for valid flags here, keeping it out of the
2471 * critical path in kmem_cache_alloc().
2473 if (flags & ~(SLAB_DMA | SLAB_LEVEL_MASK | SLAB_NO_GROW))
2475 if (flags & SLAB_NO_GROW)
2478 ctor_flags = SLAB_CTOR_CONSTRUCTOR;
2479 local_flags = (flags & SLAB_LEVEL_MASK);
2480 if (!(local_flags & __GFP_WAIT))
2482 * Not allowed to sleep. Need to tell a constructor about
2483 * this - it might need to know...
2485 ctor_flags |= SLAB_CTOR_ATOMIC;
2487 /* Take the l3 list lock to change the colour_next on this node */
2489 l3 = cachep->nodelists[nodeid];
2490 spin_lock(&l3->list_lock);
2492 /* Get colour for the slab, and cal the next value. */
2493 offset = l3->colour_next;
2495 if (l3->colour_next >= cachep->colour)
2496 l3->colour_next = 0;
2497 spin_unlock(&l3->list_lock);
2499 offset *= cachep->colour_off;
2501 if (local_flags & __GFP_WAIT)
2505 * The test for missing atomic flag is performed here, rather than
2506 * the more obvious place, simply to reduce the critical path length
2507 * in kmem_cache_alloc(). If a caller is seriously mis-behaving they
2508 * will eventually be caught here (where it matters).
2510 kmem_flagcheck(cachep, flags);
2513 * Get mem for the objs. Attempt to allocate a physical page from
2516 objp = kmem_getpages(cachep, flags, nodeid);
2520 /* Get slab management. */
2521 slabp = alloc_slabmgmt(cachep, objp, offset, local_flags);
2525 slabp->nodeid = nodeid;
2526 set_slab_attr(cachep, slabp, objp);
2528 cache_init_objs(cachep, slabp, ctor_flags);
2530 if (local_flags & __GFP_WAIT)
2531 local_irq_disable();
2533 spin_lock(&l3->list_lock);
2535 /* Make slab active. */
2536 list_add_tail(&slabp->list, &(l3->slabs_free));
2537 STATS_INC_GROWN(cachep);
2538 l3->free_objects += cachep->num;
2539 spin_unlock(&l3->list_lock);
2542 kmem_freepages(cachep, objp);
2544 if (local_flags & __GFP_WAIT)
2545 local_irq_disable();
2552 * Perform extra freeing checks:
2553 * - detect bad pointers.
2554 * - POISON/RED_ZONE checking
2555 * - destructor calls, for caches with POISON+dtor
2557 static void kfree_debugcheck(const void *objp)
2561 if (!virt_addr_valid(objp)) {
2562 printk(KERN_ERR "kfree_debugcheck: out of range ptr %lxh.\n",
2563 (unsigned long)objp);
2566 page = virt_to_page(objp);
2567 if (!PageSlab(page)) {
2568 printk(KERN_ERR "kfree_debugcheck: bad ptr %lxh.\n",
2569 (unsigned long)objp);
2574 static void *cache_free_debugcheck(struct kmem_cache *cachep, void *objp,
2581 objp -= obj_offset(cachep);
2582 kfree_debugcheck(objp);
2583 page = virt_to_page(objp);
2585 if (page_get_cache(page) != cachep) {
2586 printk(KERN_ERR "mismatch in kmem_cache_free: expected "
2587 "cache %p, got %p\n",
2588 page_get_cache(page), cachep);
2589 printk(KERN_ERR "%p is %s.\n", cachep, cachep->name);
2590 printk(KERN_ERR "%p is %s.\n", page_get_cache(page),
2591 page_get_cache(page)->name);
2594 slabp = page_get_slab(page);
2596 if (cachep->flags & SLAB_RED_ZONE) {
2597 if (*dbg_redzone1(cachep, objp) != RED_ACTIVE ||
2598 *dbg_redzone2(cachep, objp) != RED_ACTIVE) {
2599 slab_error(cachep, "double free, or memory outside"
2600 " object was overwritten");
2601 printk(KERN_ERR "%p: redzone 1:0x%lx, "
2602 "redzone 2:0x%lx.\n",
2603 objp, *dbg_redzone1(cachep, objp),
2604 *dbg_redzone2(cachep, objp));
2606 *dbg_redzone1(cachep, objp) = RED_INACTIVE;
2607 *dbg_redzone2(cachep, objp) = RED_INACTIVE;
2609 if (cachep->flags & SLAB_STORE_USER)
2610 *dbg_userword(cachep, objp) = caller;
2612 objnr = obj_to_index(cachep, slabp, objp);
2614 BUG_ON(objnr >= cachep->num);
2615 BUG_ON(objp != index_to_obj(cachep, slabp, objnr));
2617 if (cachep->flags & SLAB_DEBUG_INITIAL) {
2619 * Need to call the slab's constructor so the caller can
2620 * perform a verify of its state (debugging). Called without
2621 * the cache-lock held.
2623 cachep->ctor(objp + obj_offset(cachep),
2624 cachep, SLAB_CTOR_CONSTRUCTOR | SLAB_CTOR_VERIFY);
2626 if (cachep->flags & SLAB_POISON && cachep->dtor) {
2627 /* we want to cache poison the object,
2628 * call the destruction callback
2630 cachep->dtor(objp + obj_offset(cachep), cachep, 0);
2632 #ifdef CONFIG_DEBUG_SLAB_LEAK
2633 slab_bufctl(slabp)[objnr] = BUFCTL_FREE;
2635 if (cachep->flags & SLAB_POISON) {
2636 #ifdef CONFIG_DEBUG_PAGEALLOC
2637 if ((cachep->buffer_size % PAGE_SIZE)==0 && OFF_SLAB(cachep)) {
2638 store_stackinfo(cachep, objp, (unsigned long)caller);
2639 kernel_map_pages(virt_to_page(objp),
2640 cachep->buffer_size / PAGE_SIZE, 0);
2642 poison_obj(cachep, objp, POISON_FREE);
2645 poison_obj(cachep, objp, POISON_FREE);
2651 static void check_slabp(struct kmem_cache *cachep, struct slab *slabp)
2656 /* Check slab's freelist to see if this obj is there. */
2657 for (i = slabp->free; i != BUFCTL_END; i = slab_bufctl(slabp)[i]) {
2659 if (entries > cachep->num || i >= cachep->num)
2662 if (entries != cachep->num - slabp->inuse) {
2664 printk(KERN_ERR "slab: Internal list corruption detected in "
2665 "cache '%s'(%d), slabp %p(%d). Hexdump:\n",
2666 cachep->name, cachep->num, slabp, slabp->inuse);
2668 i < sizeof(*slabp) + cachep->num * sizeof(kmem_bufctl_t);
2671 printk("\n%03x:", i);
2672 printk(" %02x", ((unsigned char *)slabp)[i]);
2679 #define kfree_debugcheck(x) do { } while(0)
2680 #define cache_free_debugcheck(x,objp,z) (objp)
2681 #define check_slabp(x,y) do { } while(0)
2684 static void *cache_alloc_refill(struct kmem_cache *cachep, gfp_t flags)
2687 struct kmem_list3 *l3;
2688 struct array_cache *ac;
2691 ac = cpu_cache_get(cachep);
2693 batchcount = ac->batchcount;
2694 if (!ac->touched && batchcount > BATCHREFILL_LIMIT) {
2696 * If there was little recent activity on this cache, then
2697 * perform only a partial refill. Otherwise we could generate
2700 batchcount = BATCHREFILL_LIMIT;
2702 l3 = cachep->nodelists[numa_node_id()];
2704 BUG_ON(ac->avail > 0 || !l3);
2705 spin_lock(&l3->list_lock);
2707 /* See if we can refill from the shared array */
2708 if (l3->shared && transfer_objects(ac, l3->shared, batchcount))
2711 while (batchcount > 0) {
2712 struct list_head *entry;
2714 /* Get slab alloc is to come from. */
2715 entry = l3->slabs_partial.next;
2716 if (entry == &l3->slabs_partial) {
2717 l3->free_touched = 1;
2718 entry = l3->slabs_free.next;
2719 if (entry == &l3->slabs_free)
2723 slabp = list_entry(entry, struct slab, list);
2724 check_slabp(cachep, slabp);
2725 check_spinlock_acquired(cachep);
2726 while (slabp->inuse < cachep->num && batchcount--) {
2727 STATS_INC_ALLOCED(cachep);
2728 STATS_INC_ACTIVE(cachep);
2729 STATS_SET_HIGH(cachep);
2731 ac->entry[ac->avail++] = slab_get_obj(cachep, slabp,
2734 check_slabp(cachep, slabp);
2736 /* move slabp to correct slabp list: */
2737 list_del(&slabp->list);
2738 if (slabp->free == BUFCTL_END)
2739 list_add(&slabp->list, &l3->slabs_full);
2741 list_add(&slabp->list, &l3->slabs_partial);
2745 l3->free_objects -= ac->avail;
2747 spin_unlock(&l3->list_lock);
2749 if (unlikely(!ac->avail)) {
2751 x = cache_grow(cachep, flags, numa_node_id());
2753 /* cache_grow can reenable interrupts, then ac could change. */
2754 ac = cpu_cache_get(cachep);
2755 if (!x && ac->avail == 0) /* no objects in sight? abort */
2758 if (!ac->avail) /* objects refilled by interrupt? */
2762 return ac->entry[--ac->avail];
2765 static inline void cache_alloc_debugcheck_before(struct kmem_cache *cachep,
2768 might_sleep_if(flags & __GFP_WAIT);
2770 kmem_flagcheck(cachep, flags);
2775 static void *cache_alloc_debugcheck_after(struct kmem_cache *cachep,
2776 gfp_t flags, void *objp, void *caller)
2780 if (cachep->flags & SLAB_POISON) {
2781 #ifdef CONFIG_DEBUG_PAGEALLOC
2782 if ((cachep->buffer_size % PAGE_SIZE) == 0 && OFF_SLAB(cachep))
2783 kernel_map_pages(virt_to_page(objp),
2784 cachep->buffer_size / PAGE_SIZE, 1);
2786 check_poison_obj(cachep, objp);
2788 check_poison_obj(cachep, objp);
2790 poison_obj(cachep, objp, POISON_INUSE);
2792 if (cachep->flags & SLAB_STORE_USER)
2793 *dbg_userword(cachep, objp) = caller;
2795 if (cachep->flags & SLAB_RED_ZONE) {
2796 if (*dbg_redzone1(cachep, objp) != RED_INACTIVE ||
2797 *dbg_redzone2(cachep, objp) != RED_INACTIVE) {
2798 slab_error(cachep, "double free, or memory outside"
2799 " object was overwritten");
2801 "%p: redzone 1:0x%lx, redzone 2:0x%lx\n",
2802 objp, *dbg_redzone1(cachep, objp),
2803 *dbg_redzone2(cachep, objp));
2805 *dbg_redzone1(cachep, objp) = RED_ACTIVE;
2806 *dbg_redzone2(cachep, objp) = RED_ACTIVE;
2808 #ifdef CONFIG_DEBUG_SLAB_LEAK
2813 slabp = page_get_slab(virt_to_page(objp));
2814 objnr = (unsigned)(objp - slabp->s_mem) / cachep->buffer_size;
2815 slab_bufctl(slabp)[objnr] = BUFCTL_ACTIVE;
2818 objp += obj_offset(cachep);
2819 if (cachep->ctor && cachep->flags & SLAB_POISON) {
2820 unsigned long ctor_flags = SLAB_CTOR_CONSTRUCTOR;
2822 if (!(flags & __GFP_WAIT))
2823 ctor_flags |= SLAB_CTOR_ATOMIC;
2825 cachep->ctor(objp, cachep, ctor_flags);
2830 #define cache_alloc_debugcheck_after(a,b,objp,d) (objp)
2833 static inline void *____cache_alloc(struct kmem_cache *cachep, gfp_t flags)
2836 struct array_cache *ac;
2839 if (unlikely(current->flags & (PF_SPREAD_SLAB | PF_MEMPOLICY))) {
2840 objp = alternate_node_alloc(cachep, flags);
2847 ac = cpu_cache_get(cachep);
2848 if (likely(ac->avail)) {
2849 STATS_INC_ALLOCHIT(cachep);
2851 objp = ac->entry[--ac->avail];
2853 STATS_INC_ALLOCMISS(cachep);
2854 objp = cache_alloc_refill(cachep, flags);
2859 static __always_inline void *__cache_alloc(struct kmem_cache *cachep,
2860 gfp_t flags, void *caller)
2862 unsigned long save_flags;
2865 cache_alloc_debugcheck_before(cachep, flags);
2867 local_irq_save(save_flags);
2868 objp = ____cache_alloc(cachep, flags);
2869 local_irq_restore(save_flags);
2870 objp = cache_alloc_debugcheck_after(cachep, flags, objp,
2878 * Try allocating on another node if PF_SPREAD_SLAB|PF_MEMPOLICY.
2880 * If we are in_interrupt, then process context, including cpusets and
2881 * mempolicy, may not apply and should not be used for allocation policy.
2883 static void *alternate_node_alloc(struct kmem_cache *cachep, gfp_t flags)
2885 int nid_alloc, nid_here;
2889 nid_alloc = nid_here = numa_node_id();
2890 if (cpuset_do_slab_mem_spread() && (cachep->flags & SLAB_MEM_SPREAD))
2891 nid_alloc = cpuset_mem_spread_node();
2892 else if (current->mempolicy)
2893 nid_alloc = slab_node(current->mempolicy);
2894 if (nid_alloc != nid_here)
2895 return __cache_alloc_node(cachep, flags, nid_alloc);
2900 * A interface to enable slab creation on nodeid
2902 static void *__cache_alloc_node(struct kmem_cache *cachep, gfp_t flags,
2905 struct list_head *entry;
2907 struct kmem_list3 *l3;
2911 l3 = cachep->nodelists[nodeid];
2916 spin_lock(&l3->list_lock);
2917 entry = l3->slabs_partial.next;
2918 if (entry == &l3->slabs_partial) {
2919 l3->free_touched = 1;
2920 entry = l3->slabs_free.next;
2921 if (entry == &l3->slabs_free)
2925 slabp = list_entry(entry, struct slab, list);
2926 check_spinlock_acquired_node(cachep, nodeid);
2927 check_slabp(cachep, slabp);
2929 STATS_INC_NODEALLOCS(cachep);
2930 STATS_INC_ACTIVE(cachep);
2931 STATS_SET_HIGH(cachep);
2933 BUG_ON(slabp->inuse == cachep->num);
2935 obj = slab_get_obj(cachep, slabp, nodeid);
2936 check_slabp(cachep, slabp);
2938 /* move slabp to correct slabp list: */
2939 list_del(&slabp->list);
2941 if (slabp->free == BUFCTL_END)
2942 list_add(&slabp->list, &l3->slabs_full);
2944 list_add(&slabp->list, &l3->slabs_partial);
2946 spin_unlock(&l3->list_lock);
2950 spin_unlock(&l3->list_lock);
2951 x = cache_grow(cachep, flags, nodeid);
2963 * Caller needs to acquire correct kmem_list's list_lock
2965 static void free_block(struct kmem_cache *cachep, void **objpp, int nr_objects,
2969 struct kmem_list3 *l3;
2971 for (i = 0; i < nr_objects; i++) {
2972 void *objp = objpp[i];
2975 slabp = virt_to_slab(objp);
2976 l3 = cachep->nodelists[node];
2977 list_del(&slabp->list);
2978 check_spinlock_acquired_node(cachep, node);
2979 check_slabp(cachep, slabp);
2980 slab_put_obj(cachep, slabp, objp, node);
2981 STATS_DEC_ACTIVE(cachep);
2983 check_slabp(cachep, slabp);
2985 /* fixup slab chains */
2986 if (slabp->inuse == 0) {
2987 if (l3->free_objects > l3->free_limit) {
2988 l3->free_objects -= cachep->num;
2989 slab_destroy(cachep, slabp);
2991 list_add(&slabp->list, &l3->slabs_free);
2994 /* Unconditionally move a slab to the end of the
2995 * partial list on free - maximum time for the
2996 * other objects to be freed, too.
2998 list_add_tail(&slabp->list, &l3->slabs_partial);
3003 static void cache_flusharray(struct kmem_cache *cachep, struct array_cache *ac)
3006 struct kmem_list3 *l3;
3007 int node = numa_node_id();
3009 batchcount = ac->batchcount;
3011 BUG_ON(!batchcount || batchcount > ac->avail);
3014 l3 = cachep->nodelists[node];
3015 spin_lock(&l3->list_lock);
3017 struct array_cache *shared_array = l3->shared;
3018 int max = shared_array->limit - shared_array->avail;
3020 if (batchcount > max)
3022 memcpy(&(shared_array->entry[shared_array->avail]),
3023 ac->entry, sizeof(void *) * batchcount);
3024 shared_array->avail += batchcount;
3029 free_block(cachep, ac->entry, batchcount, node);
3034 struct list_head *p;
3036 p = l3->slabs_free.next;
3037 while (p != &(l3->slabs_free)) {
3040 slabp = list_entry(p, struct slab, list);
3041 BUG_ON(slabp->inuse);
3046 STATS_SET_FREEABLE(cachep, i);
3049 spin_unlock(&l3->list_lock);
3050 ac->avail -= batchcount;
3051 memmove(ac->entry, &(ac->entry[batchcount]), sizeof(void *)*ac->avail);
3055 * Release an obj back to its cache. If the obj has a constructed state, it must
3056 * be in this state _before_ it is released. Called with disabled ints.
3058 static inline void __cache_free(struct kmem_cache *cachep, void *objp)
3060 struct array_cache *ac = cpu_cache_get(cachep);
3063 objp = cache_free_debugcheck(cachep, objp, __builtin_return_address(0));
3065 /* Make sure we are not freeing a object from another
3066 * node to the array cache on this cpu.
3071 slabp = virt_to_slab(objp);
3072 if (unlikely(slabp->nodeid != numa_node_id())) {
3073 struct array_cache *alien = NULL;
3074 int nodeid = slabp->nodeid;
3075 struct kmem_list3 *l3;
3077 l3 = cachep->nodelists[numa_node_id()];
3078 STATS_INC_NODEFREES(cachep);
3079 if (l3->alien && l3->alien[nodeid]) {
3080 alien = l3->alien[nodeid];
3081 spin_lock(&alien->lock);
3082 if (unlikely(alien->avail == alien->limit))
3083 __drain_alien_cache(cachep,
3085 alien->entry[alien->avail++] = objp;
3086 spin_unlock(&alien->lock);
3088 spin_lock(&(cachep->nodelists[nodeid])->
3090 free_block(cachep, &objp, 1, nodeid);
3091 spin_unlock(&(cachep->nodelists[nodeid])->
3098 if (likely(ac->avail < ac->limit)) {
3099 STATS_INC_FREEHIT(cachep);
3100 ac->entry[ac->avail++] = objp;
3103 STATS_INC_FREEMISS(cachep);
3104 cache_flusharray(cachep, ac);
3105 ac->entry[ac->avail++] = objp;
3110 * kmem_cache_alloc - Allocate an object
3111 * @cachep: The cache to allocate from.
3112 * @flags: See kmalloc().
3114 * Allocate an object from this cache. The flags are only relevant
3115 * if the cache has no available objects.
3117 void *kmem_cache_alloc(struct kmem_cache *cachep, gfp_t flags)
3119 return __cache_alloc(cachep, flags, __builtin_return_address(0));
3121 EXPORT_SYMBOL(kmem_cache_alloc);
3124 * kmem_cache_alloc - Allocate an object. The memory is set to zero.
3125 * @cache: The cache to allocate from.
3126 * @flags: See kmalloc().
3128 * Allocate an object from this cache and set the allocated memory to zero.
3129 * The flags are only relevant if the cache has no available objects.
3131 void *kmem_cache_zalloc(struct kmem_cache *cache, gfp_t flags)
3133 void *ret = __cache_alloc(cache, flags, __builtin_return_address(0));
3135 memset(ret, 0, obj_size(cache));
3138 EXPORT_SYMBOL(kmem_cache_zalloc);
3141 * kmem_ptr_validate - check if an untrusted pointer might
3143 * @cachep: the cache we're checking against
3144 * @ptr: pointer to validate
3146 * This verifies that the untrusted pointer looks sane:
3147 * it is _not_ a guarantee that the pointer is actually
3148 * part of the slab cache in question, but it at least
3149 * validates that the pointer can be dereferenced and
3150 * looks half-way sane.
3152 * Currently only used for dentry validation.
3154 int fastcall kmem_ptr_validate(struct kmem_cache *cachep, void *ptr)
3156 unsigned long addr = (unsigned long)ptr;
3157 unsigned long min_addr = PAGE_OFFSET;
3158 unsigned long align_mask = BYTES_PER_WORD - 1;
3159 unsigned long size = cachep->buffer_size;
3162 if (unlikely(addr < min_addr))
3164 if (unlikely(addr > (unsigned long)high_memory - size))
3166 if (unlikely(addr & align_mask))
3168 if (unlikely(!kern_addr_valid(addr)))
3170 if (unlikely(!kern_addr_valid(addr + size - 1)))
3172 page = virt_to_page(ptr);
3173 if (unlikely(!PageSlab(page)))
3175 if (unlikely(page_get_cache(page) != cachep))
3184 * kmem_cache_alloc_node - Allocate an object on the specified node
3185 * @cachep: The cache to allocate from.
3186 * @flags: See kmalloc().
3187 * @nodeid: node number of the target node.
3189 * Identical to kmem_cache_alloc, except that this function is slow
3190 * and can sleep. And it will allocate memory on the given node, which
3191 * can improve the performance for cpu bound structures.
3192 * New and improved: it will now make sure that the object gets
3193 * put on the correct node list so that there is no false sharing.
3195 void *kmem_cache_alloc_node(struct kmem_cache *cachep, gfp_t flags, int nodeid)
3197 unsigned long save_flags;
3200 cache_alloc_debugcheck_before(cachep, flags);
3201 local_irq_save(save_flags);
3203 if (nodeid == -1 || nodeid == numa_node_id() ||
3204 !cachep->nodelists[nodeid])
3205 ptr = ____cache_alloc(cachep, flags);
3207 ptr = __cache_alloc_node(cachep, flags, nodeid);
3208 local_irq_restore(save_flags);
3210 ptr = cache_alloc_debugcheck_after(cachep, flags, ptr,
3211 __builtin_return_address(0));
3215 EXPORT_SYMBOL(kmem_cache_alloc_node);
3217 void *kmalloc_node(size_t size, gfp_t flags, int node)
3219 struct kmem_cache *cachep;
3221 cachep = kmem_find_general_cachep(size, flags);
3222 if (unlikely(cachep == NULL))
3224 return kmem_cache_alloc_node(cachep, flags, node);
3226 EXPORT_SYMBOL(kmalloc_node);
3230 * kmalloc - allocate memory
3231 * @size: how many bytes of memory are required.
3232 * @flags: the type of memory to allocate.
3233 * @caller: function caller for debug tracking of the caller
3235 * kmalloc is the normal method of allocating memory
3238 * The @flags argument may be one of:
3240 * %GFP_USER - Allocate memory on behalf of user. May sleep.
3242 * %GFP_KERNEL - Allocate normal kernel ram. May sleep.
3244 * %GFP_ATOMIC - Allocation will not sleep. Use inside interrupt handlers.
3246 * Additionally, the %GFP_DMA flag may be set to indicate the memory
3247 * must be suitable for DMA. This can mean different things on different
3248 * platforms. For example, on i386, it means that the memory must come
3249 * from the first 16MB.
3251 static __always_inline void *__do_kmalloc(size_t size, gfp_t flags,
3254 struct kmem_cache *cachep;
3256 /* If you want to save a few bytes .text space: replace
3258 * Then kmalloc uses the uninlined functions instead of the inline
3261 cachep = __find_general_cachep(size, flags);
3262 if (unlikely(cachep == NULL))
3264 return __cache_alloc(cachep, flags, caller);
3268 void *__kmalloc(size_t size, gfp_t flags)
3270 #ifndef CONFIG_DEBUG_SLAB
3271 return __do_kmalloc(size, flags, NULL);
3273 return __do_kmalloc(size, flags, __builtin_return_address(0));
3276 EXPORT_SYMBOL(__kmalloc);
3278 #ifdef CONFIG_DEBUG_SLAB
3279 void *__kmalloc_track_caller(size_t size, gfp_t flags, void *caller)
3281 return __do_kmalloc(size, flags, caller);
3283 EXPORT_SYMBOL(__kmalloc_track_caller);
3288 * __alloc_percpu - allocate one copy of the object for every present
3289 * cpu in the system, zeroing them.
3290 * Objects should be dereferenced using the per_cpu_ptr macro only.
3292 * @size: how many bytes of memory are required.
3294 void *__alloc_percpu(size_t size)
3297 struct percpu_data *pdata = kmalloc(sizeof(*pdata), GFP_KERNEL);
3303 * Cannot use for_each_online_cpu since a cpu may come online
3304 * and we have no way of figuring out how to fix the array
3305 * that we have allocated then....
3308 int node = cpu_to_node(i);
3310 if (node_online(node))
3311 pdata->ptrs[i] = kmalloc_node(size, GFP_KERNEL, node);
3313 pdata->ptrs[i] = kmalloc(size, GFP_KERNEL);
3315 if (!pdata->ptrs[i])
3317 memset(pdata->ptrs[i], 0, size);
3320 /* Catch derefs w/o wrappers */
3321 return (void *)(~(unsigned long)pdata);
3325 if (!cpu_possible(i))
3327 kfree(pdata->ptrs[i]);
3332 EXPORT_SYMBOL(__alloc_percpu);
3336 * kmem_cache_free - Deallocate an object
3337 * @cachep: The cache the allocation was from.
3338 * @objp: The previously allocated object.
3340 * Free an object which was previously allocated from this
3343 void kmem_cache_free(struct kmem_cache *cachep, void *objp)
3345 unsigned long flags;
3347 local_irq_save(flags);
3348 __cache_free(cachep, objp);
3349 local_irq_restore(flags);
3351 EXPORT_SYMBOL(kmem_cache_free);
3354 * kfree - free previously allocated memory
3355 * @objp: pointer returned by kmalloc.
3357 * If @objp is NULL, no operation is performed.
3359 * Don't free memory not originally allocated by kmalloc()
3360 * or you will run into trouble.
3362 void kfree(const void *objp)
3364 struct kmem_cache *c;
3365 unsigned long flags;
3367 if (unlikely(!objp))
3369 local_irq_save(flags);
3370 kfree_debugcheck(objp);
3371 c = virt_to_cache(objp);
3372 mutex_debug_check_no_locks_freed(objp, obj_size(c));
3373 __cache_free(c, (void *)objp);
3374 local_irq_restore(flags);
3376 EXPORT_SYMBOL(kfree);
3380 * free_percpu - free previously allocated percpu memory
3381 * @objp: pointer returned by alloc_percpu.
3383 * Don't free memory not originally allocated by alloc_percpu()
3384 * The complemented objp is to check for that.
3386 void free_percpu(const void *objp)
3389 struct percpu_data *p = (struct percpu_data *)(~(unsigned long)objp);
3392 * We allocate for all cpus so we cannot use for online cpu here.
3398 EXPORT_SYMBOL(free_percpu);
3401 unsigned int kmem_cache_size(struct kmem_cache *cachep)
3403 return obj_size(cachep);
3405 EXPORT_SYMBOL(kmem_cache_size);
3407 const char *kmem_cache_name(struct kmem_cache *cachep)
3409 return cachep->name;
3411 EXPORT_SYMBOL_GPL(kmem_cache_name);
3414 * This initializes kmem_list3 for all nodes.
3416 static int alloc_kmemlist(struct kmem_cache *cachep)
3419 struct kmem_list3 *l3;
3422 for_each_online_node(node) {
3423 struct array_cache *nc = NULL, *new;
3424 struct array_cache **new_alien = NULL;
3426 new_alien = alloc_alien_cache(node, cachep->limit);
3430 new = alloc_arraycache(node, cachep->shared*cachep->batchcount,
3434 l3 = cachep->nodelists[node];
3436 spin_lock_irq(&l3->list_lock);
3438 nc = cachep->nodelists[node]->shared;
3440 free_block(cachep, nc->entry, nc->avail, node);
3443 if (!cachep->nodelists[node]->alien) {
3444 l3->alien = new_alien;
3447 l3->free_limit = (1 + nr_cpus_node(node)) *
3448 cachep->batchcount + cachep->num;
3449 spin_unlock_irq(&l3->list_lock);
3451 free_alien_cache(new_alien);
3454 l3 = kmalloc_node(sizeof(struct kmem_list3), GFP_KERNEL, node);
3458 kmem_list3_init(l3);
3459 l3->next_reap = jiffies + REAPTIMEOUT_LIST3 +
3460 ((unsigned long)cachep) % REAPTIMEOUT_LIST3;
3462 l3->alien = new_alien;
3463 l3->free_limit = (1 + nr_cpus_node(node)) *
3464 cachep->batchcount + cachep->num;
3465 cachep->nodelists[node] = l3;
3473 struct ccupdate_struct {
3474 struct kmem_cache *cachep;
3475 struct array_cache *new[NR_CPUS];
3478 static void do_ccupdate_local(void *info)
3480 struct ccupdate_struct *new = info;
3481 struct array_cache *old;
3484 old = cpu_cache_get(new->cachep);
3486 new->cachep->array[smp_processor_id()] = new->new[smp_processor_id()];
3487 new->new[smp_processor_id()] = old;
3490 /* Always called with the cache_chain_mutex held */
3491 static int do_tune_cpucache(struct kmem_cache *cachep, int limit,
3492 int batchcount, int shared)
3494 struct ccupdate_struct new;
3497 memset(&new.new, 0, sizeof(new.new));
3498 for_each_online_cpu(i) {
3499 new.new[i] = alloc_arraycache(cpu_to_node(i), limit,
3502 for (i--; i >= 0; i--)
3507 new.cachep = cachep;
3509 on_each_cpu(do_ccupdate_local, (void *)&new, 1, 1);
3512 cachep->batchcount = batchcount;
3513 cachep->limit = limit;
3514 cachep->shared = shared;
3516 for_each_online_cpu(i) {
3517 struct array_cache *ccold = new.new[i];
3520 spin_lock_irq(&cachep->nodelists[cpu_to_node(i)]->list_lock);
3521 free_block(cachep, ccold->entry, ccold->avail, cpu_to_node(i));
3522 spin_unlock_irq(&cachep->nodelists[cpu_to_node(i)]->list_lock);
3526 err = alloc_kmemlist(cachep);
3528 printk(KERN_ERR "alloc_kmemlist failed for %s, error %d.\n",
3529 cachep->name, -err);
3535 /* Called with cache_chain_mutex held always */
3536 static void enable_cpucache(struct kmem_cache *cachep)
3542 * The head array serves three purposes:
3543 * - create a LIFO ordering, i.e. return objects that are cache-warm
3544 * - reduce the number of spinlock operations.
3545 * - reduce the number of linked list operations on the slab and
3546 * bufctl chains: array operations are cheaper.
3547 * The numbers are guessed, we should auto-tune as described by
3550 if (cachep->buffer_size > 131072)
3552 else if (cachep->buffer_size > PAGE_SIZE)
3554 else if (cachep->buffer_size > 1024)
3556 else if (cachep->buffer_size > 256)
3562 * CPU bound tasks (e.g. network routing) can exhibit cpu bound
3563 * allocation behaviour: Most allocs on one cpu, most free operations
3564 * on another cpu. For these cases, an efficient object passing between
3565 * cpus is necessary. This is provided by a shared array. The array
3566 * replaces Bonwick's magazine layer.
3567 * On uniprocessor, it's functionally equivalent (but less efficient)
3568 * to a larger limit. Thus disabled by default.
3572 if (cachep->buffer_size <= PAGE_SIZE)
3578 * With debugging enabled, large batchcount lead to excessively long
3579 * periods with disabled local interrupts. Limit the batchcount
3584 err = do_tune_cpucache(cachep, limit, (limit + 1) / 2, shared);
3586 printk(KERN_ERR "enable_cpucache failed for %s, error %d.\n",
3587 cachep->name, -err);
3591 * Drain an array if it contains any elements taking the l3 lock only if
3592 * necessary. Note that the l3 listlock also protects the array_cache
3593 * if drain_array() is used on the shared array.
3595 void drain_array(struct kmem_cache *cachep, struct kmem_list3 *l3,
3596 struct array_cache *ac, int force, int node)
3600 if (!ac || !ac->avail)
3602 if (ac->touched && !force) {
3605 spin_lock_irq(&l3->list_lock);
3607 tofree = force ? ac->avail : (ac->limit + 4) / 5;
3608 if (tofree > ac->avail)
3609 tofree = (ac->avail + 1) / 2;
3610 free_block(cachep, ac->entry, tofree, node);
3611 ac->avail -= tofree;
3612 memmove(ac->entry, &(ac->entry[tofree]),
3613 sizeof(void *) * ac->avail);
3615 spin_unlock_irq(&l3->list_lock);
3620 * cache_reap - Reclaim memory from caches.
3621 * @unused: unused parameter
3623 * Called from workqueue/eventd every few seconds.
3625 * - clear the per-cpu caches for this CPU.
3626 * - return freeable pages to the main free memory pool.
3628 * If we cannot acquire the cache chain mutex then just give up - we'll try
3629 * again on the next iteration.
3631 static void cache_reap(void *unused)
3633 struct list_head *walk;
3634 struct kmem_list3 *l3;
3635 int node = numa_node_id();
3637 if (!mutex_trylock(&cache_chain_mutex)) {
3638 /* Give up. Setup the next iteration. */
3639 schedule_delayed_work(&__get_cpu_var(reap_work),
3644 list_for_each(walk, &cache_chain) {
3645 struct kmem_cache *searchp;
3646 struct list_head *p;
3650 searchp = list_entry(walk, struct kmem_cache, next);
3654 * We only take the l3 lock if absolutely necessary and we
3655 * have established with reasonable certainty that
3656 * we can do some work if the lock was obtained.
3658 l3 = searchp->nodelists[node];
3660 reap_alien(searchp, l3);
3662 drain_array(searchp, l3, cpu_cache_get(searchp), 0, node);
3665 * These are racy checks but it does not matter
3666 * if we skip one check or scan twice.
3668 if (time_after(l3->next_reap, jiffies))
3671 l3->next_reap = jiffies + REAPTIMEOUT_LIST3;
3673 drain_array(searchp, l3, l3->shared, 0, node);
3675 if (l3->free_touched) {
3676 l3->free_touched = 0;
3680 tofree = (l3->free_limit + 5 * searchp->num - 1) /
3684 * Do not lock if there are no free blocks.
3686 if (list_empty(&l3->slabs_free))
3689 spin_lock_irq(&l3->list_lock);
3690 p = l3->slabs_free.next;
3691 if (p == &(l3->slabs_free)) {
3692 spin_unlock_irq(&l3->list_lock);
3696 slabp = list_entry(p, struct slab, list);
3697 BUG_ON(slabp->inuse);
3698 list_del(&slabp->list);
3699 STATS_INC_REAPED(searchp);
3702 * Safe to drop the lock. The slab is no longer linked
3703 * to the cache. searchp cannot disappear, we hold
3706 l3->free_objects -= searchp->num;
3707 spin_unlock_irq(&l3->list_lock);
3708 slab_destroy(searchp, slabp);
3709 } while (--tofree > 0);
3714 mutex_unlock(&cache_chain_mutex);
3716 /* Set up the next iteration */
3717 schedule_delayed_work(&__get_cpu_var(reap_work), REAPTIMEOUT_CPUC);
3720 #ifdef CONFIG_PROC_FS
3722 static void print_slabinfo_header(struct seq_file *m)
3725 * Output format version, so at least we can change it
3726 * without _too_ many complaints.
3729 seq_puts(m, "slabinfo - version: 2.1 (statistics)\n");
3731 seq_puts(m, "slabinfo - version: 2.1\n");
3733 seq_puts(m, "# name <active_objs> <num_objs> <objsize> "
3734 "<objperslab> <pagesperslab>");
3735 seq_puts(m, " : tunables <limit> <batchcount> <sharedfactor>");
3736 seq_puts(m, " : slabdata <active_slabs> <num_slabs> <sharedavail>");
3738 seq_puts(m, " : globalstat <listallocs> <maxobjs> <grown> <reaped> "
3739 "<error> <maxfreeable> <nodeallocs> <remotefrees>");
3740 seq_puts(m, " : cpustat <allochit> <allocmiss> <freehit> <freemiss>");
3745 static void *s_start(struct seq_file *m, loff_t *pos)
3748 struct list_head *p;
3750 mutex_lock(&cache_chain_mutex);
3752 print_slabinfo_header(m);
3753 p = cache_chain.next;
3756 if (p == &cache_chain)
3759 return list_entry(p, struct kmem_cache, next);
3762 static void *s_next(struct seq_file *m, void *p, loff_t *pos)
3764 struct kmem_cache *cachep = p;
3766 return cachep->next.next == &cache_chain ?
3767 NULL : list_entry(cachep->next.next, struct kmem_cache, next);
3770 static void s_stop(struct seq_file *m, void *p)
3772 mutex_unlock(&cache_chain_mutex);
3775 static int s_show(struct seq_file *m, void *p)
3777 struct kmem_cache *cachep = p;
3778 struct list_head *q;
3780 unsigned long active_objs;
3781 unsigned long num_objs;
3782 unsigned long active_slabs = 0;
3783 unsigned long num_slabs, free_objects = 0, shared_avail = 0;
3787 struct kmem_list3 *l3;
3791 for_each_online_node(node) {
3792 l3 = cachep->nodelists[node];
3797 spin_lock_irq(&l3->list_lock);
3799 list_for_each(q, &l3->slabs_full) {
3800 slabp = list_entry(q, struct slab, list);
3801 if (slabp->inuse != cachep->num && !error)
3802 error = "slabs_full accounting error";
3803 active_objs += cachep->num;
3806 list_for_each(q, &l3->slabs_partial) {
3807 slabp = list_entry(q, struct slab, list);
3808 if (slabp->inuse == cachep->num && !error)
3809 error = "slabs_partial inuse accounting error";
3810 if (!slabp->inuse && !error)
3811 error = "slabs_partial/inuse accounting error";
3812 active_objs += slabp->inuse;
3815 list_for_each(q, &l3->slabs_free) {
3816 slabp = list_entry(q, struct slab, list);
3817 if (slabp->inuse && !error)
3818 error = "slabs_free/inuse accounting error";
3821 free_objects += l3->free_objects;
3823 shared_avail += l3->shared->avail;
3825 spin_unlock_irq(&l3->list_lock);
3827 num_slabs += active_slabs;
3828 num_objs = num_slabs * cachep->num;
3829 if (num_objs - active_objs != free_objects && !error)
3830 error = "free_objects accounting error";
3832 name = cachep->name;
3834 printk(KERN_ERR "slab: cache %s error: %s\n", name, error);
3836 seq_printf(m, "%-17s %6lu %6lu %6u %4u %4d",
3837 name, active_objs, num_objs, cachep->buffer_size,
3838 cachep->num, (1 << cachep->gfporder));
3839 seq_printf(m, " : tunables %4u %4u %4u",
3840 cachep->limit, cachep->batchcount, cachep->shared);
3841 seq_printf(m, " : slabdata %6lu %6lu %6lu",
3842 active_slabs, num_slabs, shared_avail);
3845 unsigned long high = cachep->high_mark;
3846 unsigned long allocs = cachep->num_allocations;
3847 unsigned long grown = cachep->grown;
3848 unsigned long reaped = cachep->reaped;
3849 unsigned long errors = cachep->errors;
3850 unsigned long max_freeable = cachep->max_freeable;
3851 unsigned long node_allocs = cachep->node_allocs;
3852 unsigned long node_frees = cachep->node_frees;
3854 seq_printf(m, " : globalstat %7lu %6lu %5lu %4lu \
3855 %4lu %4lu %4lu %4lu", allocs, high, grown,
3856 reaped, errors, max_freeable, node_allocs,
3861 unsigned long allochit = atomic_read(&cachep->allochit);
3862 unsigned long allocmiss = atomic_read(&cachep->allocmiss);
3863 unsigned long freehit = atomic_read(&cachep->freehit);
3864 unsigned long freemiss = atomic_read(&cachep->freemiss);
3866 seq_printf(m, " : cpustat %6lu %6lu %6lu %6lu",
3867 allochit, allocmiss, freehit, freemiss);
3875 * slabinfo_op - iterator that generates /proc/slabinfo
3884 * num-pages-per-slab
3885 * + further values on SMP and with statistics enabled
3888 struct seq_operations slabinfo_op = {
3895 #define MAX_SLABINFO_WRITE 128
3897 * slabinfo_write - Tuning for the slab allocator
3899 * @buffer: user buffer
3900 * @count: data length
3903 ssize_t slabinfo_write(struct file *file, const char __user * buffer,
3904 size_t count, loff_t *ppos)
3906 char kbuf[MAX_SLABINFO_WRITE + 1], *tmp;
3907 int limit, batchcount, shared, res;
3908 struct list_head *p;
3910 if (count > MAX_SLABINFO_WRITE)
3912 if (copy_from_user(&kbuf, buffer, count))
3914 kbuf[MAX_SLABINFO_WRITE] = '\0';
3916 tmp = strchr(kbuf, ' ');
3921 if (sscanf(tmp, " %d %d %d", &limit, &batchcount, &shared) != 3)
3924 /* Find the cache in the chain of caches. */
3925 mutex_lock(&cache_chain_mutex);
3927 list_for_each(p, &cache_chain) {
3928 struct kmem_cache *cachep;
3930 cachep = list_entry(p, struct kmem_cache, next);
3931 if (!strcmp(cachep->name, kbuf)) {
3932 if (limit < 1 || batchcount < 1 ||
3933 batchcount > limit || shared < 0) {
3936 res = do_tune_cpucache(cachep, limit,
3937 batchcount, shared);
3942 mutex_unlock(&cache_chain_mutex);
3948 #ifdef CONFIG_DEBUG_SLAB_LEAK
3950 static void *leaks_start(struct seq_file *m, loff_t *pos)
3953 struct list_head *p;
3955 mutex_lock(&cache_chain_mutex);
3956 p = cache_chain.next;
3959 if (p == &cache_chain)
3962 return list_entry(p, struct kmem_cache, next);
3965 static inline int add_caller(unsigned long *n, unsigned long v)
3975 unsigned long *q = p + 2 * i;
3989 memmove(p + 2, p, n[1] * 2 * sizeof(unsigned long) - ((void *)p - (void *)n));
3995 static void handle_slab(unsigned long *n, struct kmem_cache *c, struct slab *s)
4001 for (i = 0, p = s->s_mem; i < c->num; i++, p += c->buffer_size) {
4002 if (slab_bufctl(s)[i] != BUFCTL_ACTIVE)
4004 if (!add_caller(n, (unsigned long)*dbg_userword(c, p)))
4009 static void show_symbol(struct seq_file *m, unsigned long address)
4011 #ifdef CONFIG_KALLSYMS
4014 unsigned long offset, size;
4015 char namebuf[KSYM_NAME_LEN+1];
4017 name = kallsyms_lookup(address, &size, &offset, &modname, namebuf);
4020 seq_printf(m, "%s+%#lx/%#lx", name, offset, size);
4022 seq_printf(m, " [%s]", modname);
4026 seq_printf(m, "%p", (void *)address);
4029 static int leaks_show(struct seq_file *m, void *p)
4031 struct kmem_cache *cachep = p;
4032 struct list_head *q;
4034 struct kmem_list3 *l3;
4036 unsigned long *n = m->private;
4040 if (!(cachep->flags & SLAB_STORE_USER))
4042 if (!(cachep->flags & SLAB_RED_ZONE))
4045 /* OK, we can do it */
4049 for_each_online_node(node) {
4050 l3 = cachep->nodelists[node];
4055 spin_lock_irq(&l3->list_lock);
4057 list_for_each(q, &l3->slabs_full) {
4058 slabp = list_entry(q, struct slab, list);
4059 handle_slab(n, cachep, slabp);
4061 list_for_each(q, &l3->slabs_partial) {
4062 slabp = list_entry(q, struct slab, list);
4063 handle_slab(n, cachep, slabp);
4065 spin_unlock_irq(&l3->list_lock);
4067 name = cachep->name;
4069 /* Increase the buffer size */
4070 mutex_unlock(&cache_chain_mutex);
4071 m->private = kzalloc(n[0] * 4 * sizeof(unsigned long), GFP_KERNEL);
4073 /* Too bad, we are really out */
4075 mutex_lock(&cache_chain_mutex);
4078 *(unsigned long *)m->private = n[0] * 2;
4080 mutex_lock(&cache_chain_mutex);
4081 /* Now make sure this entry will be retried */
4085 for (i = 0; i < n[1]; i++) {
4086 seq_printf(m, "%s: %lu ", name, n[2*i+3]);
4087 show_symbol(m, n[2*i+2]);
4093 struct seq_operations slabstats_op = {
4094 .start = leaks_start,
4103 * ksize - get the actual amount of memory allocated for a given object
4104 * @objp: Pointer to the object
4106 * kmalloc may internally round up allocations and return more memory
4107 * than requested. ksize() can be used to determine the actual amount of
4108 * memory allocated. The caller may use this additional memory, even though
4109 * a smaller amount of memory was initially specified with the kmalloc call.
4110 * The caller must guarantee that objp points to a valid object previously
4111 * allocated with either kmalloc() or kmem_cache_alloc(). The object
4112 * must not be freed during the duration of the call.
4114 unsigned int ksize(const void *objp)
4116 if (unlikely(objp == NULL))
4119 return obj_size(virt_to_cache(objp));