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 initializations 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 'slab_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/slab.h>
92 #include <linux/poison.h>
93 #include <linux/swap.h>
94 #include <linux/cache.h>
95 #include <linux/interrupt.h>
96 #include <linux/init.h>
97 #include <linux/compiler.h>
98 #include <linux/cpuset.h>
99 #include <linux/proc_fs.h>
100 #include <linux/seq_file.h>
101 #include <linux/notifier.h>
102 #include <linux/kallsyms.h>
103 #include <linux/cpu.h>
104 #include <linux/sysctl.h>
105 #include <linux/module.h>
106 #include <linux/rcupdate.h>
107 #include <linux/string.h>
108 #include <linux/uaccess.h>
109 #include <linux/nodemask.h>
110 #include <linux/kmemleak.h>
111 #include <linux/mempolicy.h>
112 #include <linux/mutex.h>
113 #include <linux/fault-inject.h>
114 #include <linux/rtmutex.h>
115 #include <linux/reciprocal_div.h>
116 #include <linux/debugobjects.h>
117 #include <linux/kmemcheck.h>
118 #include <linux/memory.h>
119 #include <linux/prefetch.h>
121 #include <net/sock.h>
123 #include <asm/cacheflush.h>
124 #include <asm/tlbflush.h>
125 #include <asm/page.h>
127 #include <trace/events/kmem.h>
129 #include "internal.h"
132 * DEBUG - 1 for kmem_cache_create() to honour; SLAB_RED_ZONE & SLAB_POISON.
133 * 0 for faster, smaller code (especially in the critical paths).
135 * STATS - 1 to collect stats for /proc/slabinfo.
136 * 0 for faster, smaller code (especially in the critical paths).
138 * FORCED_DEBUG - 1 enables SLAB_RED_ZONE and SLAB_POISON (if possible)
141 #ifdef CONFIG_DEBUG_SLAB
144 #define FORCED_DEBUG 1
148 #define FORCED_DEBUG 0
151 /* Shouldn't this be in a header file somewhere? */
152 #define BYTES_PER_WORD sizeof(void *)
153 #define REDZONE_ALIGN max(BYTES_PER_WORD, __alignof__(unsigned long long))
155 #ifndef ARCH_KMALLOC_FLAGS
156 #define ARCH_KMALLOC_FLAGS SLAB_HWCACHE_ALIGN
160 * true if a page was allocated from pfmemalloc reserves for network-based
163 static bool pfmemalloc_active __read_mostly;
165 /* Legal flag mask for kmem_cache_create(). */
167 # define CREATE_MASK (SLAB_RED_ZONE | \
168 SLAB_POISON | SLAB_HWCACHE_ALIGN | \
171 SLAB_RECLAIM_ACCOUNT | SLAB_PANIC | \
172 SLAB_DESTROY_BY_RCU | SLAB_MEM_SPREAD | \
173 SLAB_DEBUG_OBJECTS | SLAB_NOLEAKTRACE | SLAB_NOTRACK)
175 # define CREATE_MASK (SLAB_HWCACHE_ALIGN | \
177 SLAB_RECLAIM_ACCOUNT | SLAB_PANIC | \
178 SLAB_DESTROY_BY_RCU | SLAB_MEM_SPREAD | \
179 SLAB_DEBUG_OBJECTS | SLAB_NOLEAKTRACE | SLAB_NOTRACK)
185 * Bufctl's are used for linking objs within a slab
188 * This implementation relies on "struct page" for locating the cache &
189 * slab an object belongs to.
190 * This allows the bufctl structure to be small (one int), but limits
191 * the number of objects a slab (not a cache) can contain when off-slab
192 * bufctls are used. The limit is the size of the largest general cache
193 * that does not use off-slab slabs.
194 * For 32bit archs with 4 kB pages, is this 56.
195 * This is not serious, as it is only for large objects, when it is unwise
196 * to have too many per slab.
197 * Note: This limit can be raised by introducing a general cache whose size
198 * is less than 512 (PAGE_SIZE<<3), but greater than 256.
201 typedef unsigned int kmem_bufctl_t;
202 #define BUFCTL_END (((kmem_bufctl_t)(~0U))-0)
203 #define BUFCTL_FREE (((kmem_bufctl_t)(~0U))-1)
204 #define BUFCTL_ACTIVE (((kmem_bufctl_t)(~0U))-2)
205 #define SLAB_LIMIT (((kmem_bufctl_t)(~0U))-3)
210 * slab_destroy on a SLAB_DESTROY_BY_RCU cache uses this structure to
211 * arrange for kmem_freepages to be called via RCU. This is useful if
212 * we need to approach a kernel structure obliquely, from its address
213 * obtained without the usual locking. We can lock the structure to
214 * stabilize it and check it's still at the given address, only if we
215 * can be sure that the memory has not been meanwhile reused for some
216 * other kind of object (which our subsystem's lock might corrupt).
218 * rcu_read_lock before reading the address, then rcu_read_unlock after
219 * taking the spinlock within the structure expected at that address.
222 struct rcu_head head;
223 struct kmem_cache *cachep;
230 * Manages the objs in a slab. Placed either at the beginning of mem allocated
231 * for a slab, or allocated from an general cache.
232 * Slabs are chained into three list: fully used, partial, fully free slabs.
237 struct list_head list;
238 unsigned long colouroff;
239 void *s_mem; /* including colour offset */
240 unsigned int inuse; /* num of objs active in slab */
242 unsigned short nodeid;
244 struct slab_rcu __slab_cover_slab_rcu;
252 * - LIFO ordering, to hand out cache-warm objects from _alloc
253 * - reduce the number of linked list operations
254 * - reduce spinlock operations
256 * The limit is stored in the per-cpu structure to reduce the data cache
263 unsigned int batchcount;
264 unsigned int touched;
267 * Must have this definition in here for the proper
268 * alignment of array_cache. Also simplifies accessing
271 * Entries should not be directly dereferenced as
272 * entries belonging to slabs marked pfmemalloc will
273 * have the lower bits set SLAB_OBJ_PFMEMALLOC
277 #define SLAB_OBJ_PFMEMALLOC 1
278 static inline bool is_obj_pfmemalloc(void *objp)
280 return (unsigned long)objp & SLAB_OBJ_PFMEMALLOC;
283 static inline void set_obj_pfmemalloc(void **objp)
285 *objp = (void *)((unsigned long)*objp | SLAB_OBJ_PFMEMALLOC);
289 static inline void clear_obj_pfmemalloc(void **objp)
291 *objp = (void *)((unsigned long)*objp & ~SLAB_OBJ_PFMEMALLOC);
295 * bootstrap: The caches do not work without cpuarrays anymore, but the
296 * cpuarrays are allocated from the generic caches...
298 #define BOOT_CPUCACHE_ENTRIES 1
299 struct arraycache_init {
300 struct array_cache cache;
301 void *entries[BOOT_CPUCACHE_ENTRIES];
305 * The slab lists for all objects.
308 struct list_head slabs_partial; /* partial list first, better asm code */
309 struct list_head slabs_full;
310 struct list_head slabs_free;
311 unsigned long free_objects;
312 unsigned int free_limit;
313 unsigned int colour_next; /* Per-node cache coloring */
314 spinlock_t list_lock;
315 struct array_cache *shared; /* shared per node */
316 struct array_cache **alien; /* on other nodes */
317 unsigned long next_reap; /* updated without locking */
318 int free_touched; /* updated without locking */
322 * Need this for bootstrapping a per node allocator.
324 #define NUM_INIT_LISTS (3 * MAX_NUMNODES)
325 static struct kmem_list3 __initdata initkmem_list3[NUM_INIT_LISTS];
326 #define CACHE_CACHE 0
327 #define SIZE_AC MAX_NUMNODES
328 #define SIZE_L3 (2 * MAX_NUMNODES)
330 static int drain_freelist(struct kmem_cache *cache,
331 struct kmem_list3 *l3, int tofree);
332 static void free_block(struct kmem_cache *cachep, void **objpp, int len,
334 static int enable_cpucache(struct kmem_cache *cachep, gfp_t gfp);
335 static void cache_reap(struct work_struct *unused);
338 * This function must be completely optimized away if a constant is passed to
339 * it. Mostly the same as what is in linux/slab.h except it returns an index.
341 static __always_inline int index_of(const size_t size)
343 extern void __bad_size(void);
345 if (__builtin_constant_p(size)) {
353 #include <linux/kmalloc_sizes.h>
361 static int slab_early_init = 1;
363 #define INDEX_AC index_of(sizeof(struct arraycache_init))
364 #define INDEX_L3 index_of(sizeof(struct kmem_list3))
366 static void kmem_list3_init(struct kmem_list3 *parent)
368 INIT_LIST_HEAD(&parent->slabs_full);
369 INIT_LIST_HEAD(&parent->slabs_partial);
370 INIT_LIST_HEAD(&parent->slabs_free);
371 parent->shared = NULL;
372 parent->alien = NULL;
373 parent->colour_next = 0;
374 spin_lock_init(&parent->list_lock);
375 parent->free_objects = 0;
376 parent->free_touched = 0;
379 #define MAKE_LIST(cachep, listp, slab, nodeid) \
381 INIT_LIST_HEAD(listp); \
382 list_splice(&(cachep->nodelists[nodeid]->slab), listp); \
385 #define MAKE_ALL_LISTS(cachep, ptr, nodeid) \
387 MAKE_LIST((cachep), (&(ptr)->slabs_full), slabs_full, nodeid); \
388 MAKE_LIST((cachep), (&(ptr)->slabs_partial), slabs_partial, nodeid); \
389 MAKE_LIST((cachep), (&(ptr)->slabs_free), slabs_free, nodeid); \
392 #define CFLGS_OFF_SLAB (0x80000000UL)
393 #define OFF_SLAB(x) ((x)->flags & CFLGS_OFF_SLAB)
395 #define BATCHREFILL_LIMIT 16
397 * Optimization question: fewer reaps means less probability for unnessary
398 * cpucache drain/refill cycles.
400 * OTOH the cpuarrays can contain lots of objects,
401 * which could lock up otherwise freeable slabs.
403 #define REAPTIMEOUT_CPUC (2*HZ)
404 #define REAPTIMEOUT_LIST3 (4*HZ)
407 #define STATS_INC_ACTIVE(x) ((x)->num_active++)
408 #define STATS_DEC_ACTIVE(x) ((x)->num_active--)
409 #define STATS_INC_ALLOCED(x) ((x)->num_allocations++)
410 #define STATS_INC_GROWN(x) ((x)->grown++)
411 #define STATS_ADD_REAPED(x,y) ((x)->reaped += (y))
412 #define STATS_SET_HIGH(x) \
414 if ((x)->num_active > (x)->high_mark) \
415 (x)->high_mark = (x)->num_active; \
417 #define STATS_INC_ERR(x) ((x)->errors++)
418 #define STATS_INC_NODEALLOCS(x) ((x)->node_allocs++)
419 #define STATS_INC_NODEFREES(x) ((x)->node_frees++)
420 #define STATS_INC_ACOVERFLOW(x) ((x)->node_overflow++)
421 #define STATS_SET_FREEABLE(x, i) \
423 if ((x)->max_freeable < i) \
424 (x)->max_freeable = i; \
426 #define STATS_INC_ALLOCHIT(x) atomic_inc(&(x)->allochit)
427 #define STATS_INC_ALLOCMISS(x) atomic_inc(&(x)->allocmiss)
428 #define STATS_INC_FREEHIT(x) atomic_inc(&(x)->freehit)
429 #define STATS_INC_FREEMISS(x) atomic_inc(&(x)->freemiss)
431 #define STATS_INC_ACTIVE(x) do { } while (0)
432 #define STATS_DEC_ACTIVE(x) do { } while (0)
433 #define STATS_INC_ALLOCED(x) do { } while (0)
434 #define STATS_INC_GROWN(x) do { } while (0)
435 #define STATS_ADD_REAPED(x,y) do { (void)(y); } while (0)
436 #define STATS_SET_HIGH(x) do { } while (0)
437 #define STATS_INC_ERR(x) do { } while (0)
438 #define STATS_INC_NODEALLOCS(x) do { } while (0)
439 #define STATS_INC_NODEFREES(x) do { } while (0)
440 #define STATS_INC_ACOVERFLOW(x) do { } while (0)
441 #define STATS_SET_FREEABLE(x, i) do { } while (0)
442 #define STATS_INC_ALLOCHIT(x) do { } while (0)
443 #define STATS_INC_ALLOCMISS(x) do { } while (0)
444 #define STATS_INC_FREEHIT(x) do { } while (0)
445 #define STATS_INC_FREEMISS(x) do { } while (0)
451 * memory layout of objects:
453 * 0 .. cachep->obj_offset - BYTES_PER_WORD - 1: padding. This ensures that
454 * the end of an object is aligned with the end of the real
455 * allocation. Catches writes behind the end of the allocation.
456 * cachep->obj_offset - BYTES_PER_WORD .. cachep->obj_offset - 1:
458 * cachep->obj_offset: The real object.
459 * cachep->size - 2* BYTES_PER_WORD: redzone word [BYTES_PER_WORD long]
460 * cachep->size - 1* BYTES_PER_WORD: last caller address
461 * [BYTES_PER_WORD long]
463 static int obj_offset(struct kmem_cache *cachep)
465 return cachep->obj_offset;
468 static unsigned long long *dbg_redzone1(struct kmem_cache *cachep, void *objp)
470 BUG_ON(!(cachep->flags & SLAB_RED_ZONE));
471 return (unsigned long long*) (objp + obj_offset(cachep) -
472 sizeof(unsigned long long));
475 static unsigned long long *dbg_redzone2(struct kmem_cache *cachep, void *objp)
477 BUG_ON(!(cachep->flags & SLAB_RED_ZONE));
478 if (cachep->flags & SLAB_STORE_USER)
479 return (unsigned long long *)(objp + cachep->size -
480 sizeof(unsigned long long) -
482 return (unsigned long long *) (objp + cachep->size -
483 sizeof(unsigned long long));
486 static void **dbg_userword(struct kmem_cache *cachep, void *objp)
488 BUG_ON(!(cachep->flags & SLAB_STORE_USER));
489 return (void **)(objp + cachep->size - BYTES_PER_WORD);
494 #define obj_offset(x) 0
495 #define dbg_redzone1(cachep, objp) ({BUG(); (unsigned long long *)NULL;})
496 #define dbg_redzone2(cachep, objp) ({BUG(); (unsigned long long *)NULL;})
497 #define dbg_userword(cachep, objp) ({BUG(); (void **)NULL;})
501 #ifdef CONFIG_TRACING
502 size_t slab_buffer_size(struct kmem_cache *cachep)
506 EXPORT_SYMBOL(slab_buffer_size);
510 * Do not go above this order unless 0 objects fit into the slab or
511 * overridden on the command line.
513 #define SLAB_MAX_ORDER_HI 1
514 #define SLAB_MAX_ORDER_LO 0
515 static int slab_max_order = SLAB_MAX_ORDER_LO;
516 static bool slab_max_order_set __initdata;
518 static inline struct kmem_cache *virt_to_cache(const void *obj)
520 struct page *page = virt_to_head_page(obj);
521 return page->slab_cache;
524 static inline struct slab *virt_to_slab(const void *obj)
526 struct page *page = virt_to_head_page(obj);
528 VM_BUG_ON(!PageSlab(page));
529 return page->slab_page;
532 static inline void *index_to_obj(struct kmem_cache *cache, struct slab *slab,
535 return slab->s_mem + cache->size * idx;
539 * We want to avoid an expensive divide : (offset / cache->size)
540 * Using the fact that size is a constant for a particular cache,
541 * we can replace (offset / cache->size) by
542 * reciprocal_divide(offset, cache->reciprocal_buffer_size)
544 static inline unsigned int obj_to_index(const struct kmem_cache *cache,
545 const struct slab *slab, void *obj)
547 u32 offset = (obj - slab->s_mem);
548 return reciprocal_divide(offset, cache->reciprocal_buffer_size);
552 * These are the default caches for kmalloc. Custom caches can have other sizes.
554 struct cache_sizes malloc_sizes[] = {
555 #define CACHE(x) { .cs_size = (x) },
556 #include <linux/kmalloc_sizes.h>
560 EXPORT_SYMBOL(malloc_sizes);
562 /* Must match cache_sizes above. Out of line to keep cache footprint low. */
568 static struct cache_names __initdata cache_names[] = {
569 #define CACHE(x) { .name = "size-" #x, .name_dma = "size-" #x "(DMA)" },
570 #include <linux/kmalloc_sizes.h>
575 static struct arraycache_init initarray_cache __initdata =
576 { {0, BOOT_CPUCACHE_ENTRIES, 1, 0} };
577 static struct arraycache_init initarray_generic =
578 { {0, BOOT_CPUCACHE_ENTRIES, 1, 0} };
580 /* internal cache of cache description objs */
581 static struct kmem_list3 *cache_cache_nodelists[MAX_NUMNODES];
582 static struct kmem_cache cache_cache = {
583 .nodelists = cache_cache_nodelists,
585 .limit = BOOT_CPUCACHE_ENTRIES,
587 .size = sizeof(struct kmem_cache),
588 .name = "kmem_cache",
591 #define BAD_ALIEN_MAGIC 0x01020304ul
593 #ifdef CONFIG_LOCKDEP
596 * Slab sometimes uses the kmalloc slabs to store the slab headers
597 * for other slabs "off slab".
598 * The locking for this is tricky in that it nests within the locks
599 * of all other slabs in a few places; to deal with this special
600 * locking we put on-slab caches into a separate lock-class.
602 * We set lock class for alien array caches which are up during init.
603 * The lock annotation will be lost if all cpus of a node goes down and
604 * then comes back up during hotplug
606 static struct lock_class_key on_slab_l3_key;
607 static struct lock_class_key on_slab_alc_key;
609 static struct lock_class_key debugobj_l3_key;
610 static struct lock_class_key debugobj_alc_key;
612 static void slab_set_lock_classes(struct kmem_cache *cachep,
613 struct lock_class_key *l3_key, struct lock_class_key *alc_key,
616 struct array_cache **alc;
617 struct kmem_list3 *l3;
620 l3 = cachep->nodelists[q];
624 lockdep_set_class(&l3->list_lock, l3_key);
627 * FIXME: This check for BAD_ALIEN_MAGIC
628 * should go away when common slab code is taught to
629 * work even without alien caches.
630 * Currently, non NUMA code returns BAD_ALIEN_MAGIC
631 * for alloc_alien_cache,
633 if (!alc || (unsigned long)alc == BAD_ALIEN_MAGIC)
637 lockdep_set_class(&alc[r]->lock, alc_key);
641 static void slab_set_debugobj_lock_classes_node(struct kmem_cache *cachep, int node)
643 slab_set_lock_classes(cachep, &debugobj_l3_key, &debugobj_alc_key, node);
646 static void slab_set_debugobj_lock_classes(struct kmem_cache *cachep)
650 for_each_online_node(node)
651 slab_set_debugobj_lock_classes_node(cachep, node);
654 static void init_node_lock_keys(int q)
656 struct cache_sizes *s = malloc_sizes;
661 for (s = malloc_sizes; s->cs_size != ULONG_MAX; s++) {
662 struct kmem_list3 *l3;
664 l3 = s->cs_cachep->nodelists[q];
665 if (!l3 || OFF_SLAB(s->cs_cachep))
668 slab_set_lock_classes(s->cs_cachep, &on_slab_l3_key,
669 &on_slab_alc_key, q);
673 static inline void init_lock_keys(void)
678 init_node_lock_keys(node);
681 static void init_node_lock_keys(int q)
685 static inline void init_lock_keys(void)
689 static void slab_set_debugobj_lock_classes_node(struct kmem_cache *cachep, int node)
693 static void slab_set_debugobj_lock_classes(struct kmem_cache *cachep)
698 static DEFINE_PER_CPU(struct delayed_work, slab_reap_work);
700 static inline struct array_cache *cpu_cache_get(struct kmem_cache *cachep)
702 return cachep->array[smp_processor_id()];
705 static inline struct kmem_cache *__find_general_cachep(size_t size,
708 struct cache_sizes *csizep = malloc_sizes;
711 /* This happens if someone tries to call
712 * kmem_cache_create(), or __kmalloc(), before
713 * the generic caches are initialized.
715 BUG_ON(malloc_sizes[INDEX_AC].cs_cachep == NULL);
718 return ZERO_SIZE_PTR;
720 while (size > csizep->cs_size)
724 * Really subtle: The last entry with cs->cs_size==ULONG_MAX
725 * has cs_{dma,}cachep==NULL. Thus no special case
726 * for large kmalloc calls required.
728 #ifdef CONFIG_ZONE_DMA
729 if (unlikely(gfpflags & GFP_DMA))
730 return csizep->cs_dmacachep;
732 return csizep->cs_cachep;
735 static struct kmem_cache *kmem_find_general_cachep(size_t size, gfp_t gfpflags)
737 return __find_general_cachep(size, gfpflags);
740 static size_t slab_mgmt_size(size_t nr_objs, size_t align)
742 return ALIGN(sizeof(struct slab)+nr_objs*sizeof(kmem_bufctl_t), align);
746 * Calculate the number of objects and left-over bytes for a given buffer size.
748 static void cache_estimate(unsigned long gfporder, size_t buffer_size,
749 size_t align, int flags, size_t *left_over,
754 size_t slab_size = PAGE_SIZE << gfporder;
757 * The slab management structure can be either off the slab or
758 * on it. For the latter case, the memory allocated for a
762 * - One kmem_bufctl_t for each object
763 * - Padding to respect alignment of @align
764 * - @buffer_size bytes for each object
766 * If the slab management structure is off the slab, then the
767 * alignment will already be calculated into the size. Because
768 * the slabs are all pages aligned, the objects will be at the
769 * correct alignment when allocated.
771 if (flags & CFLGS_OFF_SLAB) {
773 nr_objs = slab_size / buffer_size;
775 if (nr_objs > SLAB_LIMIT)
776 nr_objs = SLAB_LIMIT;
779 * Ignore padding for the initial guess. The padding
780 * is at most @align-1 bytes, and @buffer_size is at
781 * least @align. In the worst case, this result will
782 * be one greater than the number of objects that fit
783 * into the memory allocation when taking the padding
786 nr_objs = (slab_size - sizeof(struct slab)) /
787 (buffer_size + sizeof(kmem_bufctl_t));
790 * This calculated number will be either the right
791 * amount, or one greater than what we want.
793 if (slab_mgmt_size(nr_objs, align) + nr_objs*buffer_size
797 if (nr_objs > SLAB_LIMIT)
798 nr_objs = SLAB_LIMIT;
800 mgmt_size = slab_mgmt_size(nr_objs, align);
803 *left_over = slab_size - nr_objs*buffer_size - mgmt_size;
806 #define slab_error(cachep, msg) __slab_error(__func__, cachep, msg)
808 static void __slab_error(const char *function, struct kmem_cache *cachep,
811 printk(KERN_ERR "slab error in %s(): cache `%s': %s\n",
812 function, cachep->name, msg);
817 * By default on NUMA we use alien caches to stage the freeing of
818 * objects allocated from other nodes. This causes massive memory
819 * inefficiencies when using fake NUMA setup to split memory into a
820 * large number of small nodes, so it can be disabled on the command
824 static int use_alien_caches __read_mostly = 1;
825 static int __init noaliencache_setup(char *s)
827 use_alien_caches = 0;
830 __setup("noaliencache", noaliencache_setup);
832 static int __init slab_max_order_setup(char *str)
834 get_option(&str, &slab_max_order);
835 slab_max_order = slab_max_order < 0 ? 0 :
836 min(slab_max_order, MAX_ORDER - 1);
837 slab_max_order_set = true;
841 __setup("slab_max_order=", slab_max_order_setup);
845 * Special reaping functions for NUMA systems called from cache_reap().
846 * These take care of doing round robin flushing of alien caches (containing
847 * objects freed on different nodes from which they were allocated) and the
848 * flushing of remote pcps by calling drain_node_pages.
850 static DEFINE_PER_CPU(unsigned long, slab_reap_node);
852 static void init_reap_node(int cpu)
856 node = next_node(cpu_to_mem(cpu), node_online_map);
857 if (node == MAX_NUMNODES)
858 node = first_node(node_online_map);
860 per_cpu(slab_reap_node, cpu) = node;
863 static void next_reap_node(void)
865 int node = __this_cpu_read(slab_reap_node);
867 node = next_node(node, node_online_map);
868 if (unlikely(node >= MAX_NUMNODES))
869 node = first_node(node_online_map);
870 __this_cpu_write(slab_reap_node, node);
874 #define init_reap_node(cpu) do { } while (0)
875 #define next_reap_node(void) do { } while (0)
879 * Initiate the reap timer running on the target CPU. We run at around 1 to 2Hz
880 * via the workqueue/eventd.
881 * Add the CPU number into the expiration time to minimize the possibility of
882 * the CPUs getting into lockstep and contending for the global cache chain
885 static void __cpuinit start_cpu_timer(int cpu)
887 struct delayed_work *reap_work = &per_cpu(slab_reap_work, cpu);
890 * When this gets called from do_initcalls via cpucache_init(),
891 * init_workqueues() has already run, so keventd will be setup
894 if (keventd_up() && reap_work->work.func == NULL) {
896 INIT_DELAYED_WORK_DEFERRABLE(reap_work, cache_reap);
897 schedule_delayed_work_on(cpu, reap_work,
898 __round_jiffies_relative(HZ, cpu));
902 static struct array_cache *alloc_arraycache(int node, int entries,
903 int batchcount, gfp_t gfp)
905 int memsize = sizeof(void *) * entries + sizeof(struct array_cache);
906 struct array_cache *nc = NULL;
908 nc = kmalloc_node(memsize, gfp, node);
910 * The array_cache structures contain pointers to free object.
911 * However, when such objects are allocated or transferred to another
912 * cache the pointers are not cleared and they could be counted as
913 * valid references during a kmemleak scan. Therefore, kmemleak must
914 * not scan such objects.
916 kmemleak_no_scan(nc);
920 nc->batchcount = batchcount;
922 spin_lock_init(&nc->lock);
927 static inline bool is_slab_pfmemalloc(struct slab *slabp)
929 struct page *page = virt_to_page(slabp->s_mem);
931 return PageSlabPfmemalloc(page);
934 /* Clears pfmemalloc_active if no slabs have pfmalloc set */
935 static void recheck_pfmemalloc_active(struct kmem_cache *cachep,
936 struct array_cache *ac)
938 struct kmem_list3 *l3 = cachep->nodelists[numa_mem_id()];
942 if (!pfmemalloc_active)
945 spin_lock_irqsave(&l3->list_lock, flags);
946 list_for_each_entry(slabp, &l3->slabs_full, list)
947 if (is_slab_pfmemalloc(slabp))
950 list_for_each_entry(slabp, &l3->slabs_partial, list)
951 if (is_slab_pfmemalloc(slabp))
954 list_for_each_entry(slabp, &l3->slabs_free, list)
955 if (is_slab_pfmemalloc(slabp))
958 pfmemalloc_active = false;
960 spin_unlock_irqrestore(&l3->list_lock, flags);
963 static void *__ac_get_obj(struct kmem_cache *cachep, struct array_cache *ac,
964 gfp_t flags, bool force_refill)
967 void *objp = ac->entry[--ac->avail];
969 /* Ensure the caller is allowed to use objects from PFMEMALLOC slab */
970 if (unlikely(is_obj_pfmemalloc(objp))) {
971 struct kmem_list3 *l3;
973 if (gfp_pfmemalloc_allowed(flags)) {
974 clear_obj_pfmemalloc(&objp);
978 /* The caller cannot use PFMEMALLOC objects, find another one */
979 for (i = 1; i < ac->avail; i++) {
980 /* If a !PFMEMALLOC object is found, swap them */
981 if (!is_obj_pfmemalloc(ac->entry[i])) {
983 ac->entry[i] = ac->entry[ac->avail];
984 ac->entry[ac->avail] = objp;
990 * If there are empty slabs on the slabs_free list and we are
991 * being forced to refill the cache, mark this one !pfmemalloc.
993 l3 = cachep->nodelists[numa_mem_id()];
994 if (!list_empty(&l3->slabs_free) && force_refill) {
995 struct slab *slabp = virt_to_slab(objp);
996 ClearPageSlabPfmemalloc(virt_to_page(slabp->s_mem));
997 clear_obj_pfmemalloc(&objp);
998 recheck_pfmemalloc_active(cachep, ac);
1002 /* No !PFMEMALLOC objects available */
1010 static inline void *ac_get_obj(struct kmem_cache *cachep,
1011 struct array_cache *ac, gfp_t flags, bool force_refill)
1015 if (unlikely(sk_memalloc_socks()))
1016 objp = __ac_get_obj(cachep, ac, flags, force_refill);
1018 objp = ac->entry[--ac->avail];
1023 static void *__ac_put_obj(struct kmem_cache *cachep, struct array_cache *ac,
1026 if (unlikely(pfmemalloc_active)) {
1027 /* Some pfmemalloc slabs exist, check if this is one */
1028 struct page *page = virt_to_page(objp);
1029 if (PageSlabPfmemalloc(page))
1030 set_obj_pfmemalloc(&objp);
1036 static inline void ac_put_obj(struct kmem_cache *cachep, struct array_cache *ac,
1039 if (unlikely(sk_memalloc_socks()))
1040 objp = __ac_put_obj(cachep, ac, objp);
1042 ac->entry[ac->avail++] = objp;
1046 * Transfer objects in one arraycache to another.
1047 * Locking must be handled by the caller.
1049 * Return the number of entries transferred.
1051 static int transfer_objects(struct array_cache *to,
1052 struct array_cache *from, unsigned int max)
1054 /* Figure out how many entries to transfer */
1055 int nr = min3(from->avail, max, to->limit - to->avail);
1060 memcpy(to->entry + to->avail, from->entry + from->avail -nr,
1061 sizeof(void *) *nr);
1070 #define drain_alien_cache(cachep, alien) do { } while (0)
1071 #define reap_alien(cachep, l3) do { } while (0)
1073 static inline struct array_cache **alloc_alien_cache(int node, int limit, gfp_t gfp)
1075 return (struct array_cache **)BAD_ALIEN_MAGIC;
1078 static inline void free_alien_cache(struct array_cache **ac_ptr)
1082 static inline int cache_free_alien(struct kmem_cache *cachep, void *objp)
1087 static inline void *alternate_node_alloc(struct kmem_cache *cachep,
1093 static inline void *____cache_alloc_node(struct kmem_cache *cachep,
1094 gfp_t flags, int nodeid)
1099 #else /* CONFIG_NUMA */
1101 static void *____cache_alloc_node(struct kmem_cache *, gfp_t, int);
1102 static void *alternate_node_alloc(struct kmem_cache *, gfp_t);
1104 static struct array_cache **alloc_alien_cache(int node, int limit, gfp_t gfp)
1106 struct array_cache **ac_ptr;
1107 int memsize = sizeof(void *) * nr_node_ids;
1112 ac_ptr = kzalloc_node(memsize, gfp, node);
1115 if (i == node || !node_online(i))
1117 ac_ptr[i] = alloc_arraycache(node, limit, 0xbaadf00d, gfp);
1119 for (i--; i >= 0; i--)
1129 static void free_alien_cache(struct array_cache **ac_ptr)
1140 static void __drain_alien_cache(struct kmem_cache *cachep,
1141 struct array_cache *ac, int node)
1143 struct kmem_list3 *rl3 = cachep->nodelists[node];
1146 spin_lock(&rl3->list_lock);
1148 * Stuff objects into the remote nodes shared array first.
1149 * That way we could avoid the overhead of putting the objects
1150 * into the free lists and getting them back later.
1153 transfer_objects(rl3->shared, ac, ac->limit);
1155 free_block(cachep, ac->entry, ac->avail, node);
1157 spin_unlock(&rl3->list_lock);
1162 * Called from cache_reap() to regularly drain alien caches round robin.
1164 static void reap_alien(struct kmem_cache *cachep, struct kmem_list3 *l3)
1166 int node = __this_cpu_read(slab_reap_node);
1169 struct array_cache *ac = l3->alien[node];
1171 if (ac && ac->avail && spin_trylock_irq(&ac->lock)) {
1172 __drain_alien_cache(cachep, ac, node);
1173 spin_unlock_irq(&ac->lock);
1178 static void drain_alien_cache(struct kmem_cache *cachep,
1179 struct array_cache **alien)
1182 struct array_cache *ac;
1183 unsigned long flags;
1185 for_each_online_node(i) {
1188 spin_lock_irqsave(&ac->lock, flags);
1189 __drain_alien_cache(cachep, ac, i);
1190 spin_unlock_irqrestore(&ac->lock, flags);
1195 static inline int cache_free_alien(struct kmem_cache *cachep, void *objp)
1197 struct slab *slabp = virt_to_slab(objp);
1198 int nodeid = slabp->nodeid;
1199 struct kmem_list3 *l3;
1200 struct array_cache *alien = NULL;
1203 node = numa_mem_id();
1206 * Make sure we are not freeing a object from another node to the array
1207 * cache on this cpu.
1209 if (likely(slabp->nodeid == node))
1212 l3 = cachep->nodelists[node];
1213 STATS_INC_NODEFREES(cachep);
1214 if (l3->alien && l3->alien[nodeid]) {
1215 alien = l3->alien[nodeid];
1216 spin_lock(&alien->lock);
1217 if (unlikely(alien->avail == alien->limit)) {
1218 STATS_INC_ACOVERFLOW(cachep);
1219 __drain_alien_cache(cachep, alien, nodeid);
1221 ac_put_obj(cachep, alien, objp);
1222 spin_unlock(&alien->lock);
1224 spin_lock(&(cachep->nodelists[nodeid])->list_lock);
1225 free_block(cachep, &objp, 1, nodeid);
1226 spin_unlock(&(cachep->nodelists[nodeid])->list_lock);
1233 * Allocates and initializes nodelists for a node on each slab cache, used for
1234 * either memory or cpu hotplug. If memory is being hot-added, the kmem_list3
1235 * will be allocated off-node since memory is not yet online for the new node.
1236 * When hotplugging memory or a cpu, existing nodelists are not replaced if
1239 * Must hold slab_mutex.
1241 static int init_cache_nodelists_node(int node)
1243 struct kmem_cache *cachep;
1244 struct kmem_list3 *l3;
1245 const int memsize = sizeof(struct kmem_list3);
1247 list_for_each_entry(cachep, &slab_caches, list) {
1249 * Set up the size64 kmemlist for cpu before we can
1250 * begin anything. Make sure some other cpu on this
1251 * node has not already allocated this
1253 if (!cachep->nodelists[node]) {
1254 l3 = kmalloc_node(memsize, GFP_KERNEL, node);
1257 kmem_list3_init(l3);
1258 l3->next_reap = jiffies + REAPTIMEOUT_LIST3 +
1259 ((unsigned long)cachep) % REAPTIMEOUT_LIST3;
1262 * The l3s don't come and go as CPUs come and
1263 * go. slab_mutex is sufficient
1266 cachep->nodelists[node] = l3;
1269 spin_lock_irq(&cachep->nodelists[node]->list_lock);
1270 cachep->nodelists[node]->free_limit =
1271 (1 + nr_cpus_node(node)) *
1272 cachep->batchcount + cachep->num;
1273 spin_unlock_irq(&cachep->nodelists[node]->list_lock);
1278 static void __cpuinit cpuup_canceled(long cpu)
1280 struct kmem_cache *cachep;
1281 struct kmem_list3 *l3 = NULL;
1282 int node = cpu_to_mem(cpu);
1283 const struct cpumask *mask = cpumask_of_node(node);
1285 list_for_each_entry(cachep, &slab_caches, list) {
1286 struct array_cache *nc;
1287 struct array_cache *shared;
1288 struct array_cache **alien;
1290 /* cpu is dead; no one can alloc from it. */
1291 nc = cachep->array[cpu];
1292 cachep->array[cpu] = NULL;
1293 l3 = cachep->nodelists[node];
1296 goto free_array_cache;
1298 spin_lock_irq(&l3->list_lock);
1300 /* Free limit for this kmem_list3 */
1301 l3->free_limit -= cachep->batchcount;
1303 free_block(cachep, nc->entry, nc->avail, node);
1305 if (!cpumask_empty(mask)) {
1306 spin_unlock_irq(&l3->list_lock);
1307 goto free_array_cache;
1310 shared = l3->shared;
1312 free_block(cachep, shared->entry,
1313 shared->avail, node);
1320 spin_unlock_irq(&l3->list_lock);
1324 drain_alien_cache(cachep, alien);
1325 free_alien_cache(alien);
1331 * In the previous loop, all the objects were freed to
1332 * the respective cache's slabs, now we can go ahead and
1333 * shrink each nodelist to its limit.
1335 list_for_each_entry(cachep, &slab_caches, list) {
1336 l3 = cachep->nodelists[node];
1339 drain_freelist(cachep, l3, l3->free_objects);
1343 static int __cpuinit cpuup_prepare(long cpu)
1345 struct kmem_cache *cachep;
1346 struct kmem_list3 *l3 = NULL;
1347 int node = cpu_to_mem(cpu);
1351 * We need to do this right in the beginning since
1352 * alloc_arraycache's are going to use this list.
1353 * kmalloc_node allows us to add the slab to the right
1354 * kmem_list3 and not this cpu's kmem_list3
1356 err = init_cache_nodelists_node(node);
1361 * Now we can go ahead with allocating the shared arrays and
1364 list_for_each_entry(cachep, &slab_caches, list) {
1365 struct array_cache *nc;
1366 struct array_cache *shared = NULL;
1367 struct array_cache **alien = NULL;
1369 nc = alloc_arraycache(node, cachep->limit,
1370 cachep->batchcount, GFP_KERNEL);
1373 if (cachep->shared) {
1374 shared = alloc_arraycache(node,
1375 cachep->shared * cachep->batchcount,
1376 0xbaadf00d, GFP_KERNEL);
1382 if (use_alien_caches) {
1383 alien = alloc_alien_cache(node, cachep->limit, GFP_KERNEL);
1390 cachep->array[cpu] = nc;
1391 l3 = cachep->nodelists[node];
1394 spin_lock_irq(&l3->list_lock);
1397 * We are serialised from CPU_DEAD or
1398 * CPU_UP_CANCELLED by the cpucontrol lock
1400 l3->shared = shared;
1409 spin_unlock_irq(&l3->list_lock);
1411 free_alien_cache(alien);
1412 if (cachep->flags & SLAB_DEBUG_OBJECTS)
1413 slab_set_debugobj_lock_classes_node(cachep, node);
1415 init_node_lock_keys(node);
1419 cpuup_canceled(cpu);
1423 static int __cpuinit cpuup_callback(struct notifier_block *nfb,
1424 unsigned long action, void *hcpu)
1426 long cpu = (long)hcpu;
1430 case CPU_UP_PREPARE:
1431 case CPU_UP_PREPARE_FROZEN:
1432 mutex_lock(&slab_mutex);
1433 err = cpuup_prepare(cpu);
1434 mutex_unlock(&slab_mutex);
1437 case CPU_ONLINE_FROZEN:
1438 start_cpu_timer(cpu);
1440 #ifdef CONFIG_HOTPLUG_CPU
1441 case CPU_DOWN_PREPARE:
1442 case CPU_DOWN_PREPARE_FROZEN:
1444 * Shutdown cache reaper. Note that the slab_mutex is
1445 * held so that if cache_reap() is invoked it cannot do
1446 * anything expensive but will only modify reap_work
1447 * and reschedule the timer.
1449 cancel_delayed_work_sync(&per_cpu(slab_reap_work, cpu));
1450 /* Now the cache_reaper is guaranteed to be not running. */
1451 per_cpu(slab_reap_work, cpu).work.func = NULL;
1453 case CPU_DOWN_FAILED:
1454 case CPU_DOWN_FAILED_FROZEN:
1455 start_cpu_timer(cpu);
1458 case CPU_DEAD_FROZEN:
1460 * Even if all the cpus of a node are down, we don't free the
1461 * kmem_list3 of any cache. This to avoid a race between
1462 * cpu_down, and a kmalloc allocation from another cpu for
1463 * memory from the node of the cpu going down. The list3
1464 * structure is usually allocated from kmem_cache_create() and
1465 * gets destroyed at kmem_cache_destroy().
1469 case CPU_UP_CANCELED:
1470 case CPU_UP_CANCELED_FROZEN:
1471 mutex_lock(&slab_mutex);
1472 cpuup_canceled(cpu);
1473 mutex_unlock(&slab_mutex);
1476 return notifier_from_errno(err);
1479 static struct notifier_block __cpuinitdata cpucache_notifier = {
1480 &cpuup_callback, NULL, 0
1483 #if defined(CONFIG_NUMA) && defined(CONFIG_MEMORY_HOTPLUG)
1485 * Drains freelist for a node on each slab cache, used for memory hot-remove.
1486 * Returns -EBUSY if all objects cannot be drained so that the node is not
1489 * Must hold slab_mutex.
1491 static int __meminit drain_cache_nodelists_node(int node)
1493 struct kmem_cache *cachep;
1496 list_for_each_entry(cachep, &slab_caches, list) {
1497 struct kmem_list3 *l3;
1499 l3 = cachep->nodelists[node];
1503 drain_freelist(cachep, l3, l3->free_objects);
1505 if (!list_empty(&l3->slabs_full) ||
1506 !list_empty(&l3->slabs_partial)) {
1514 static int __meminit slab_memory_callback(struct notifier_block *self,
1515 unsigned long action, void *arg)
1517 struct memory_notify *mnb = arg;
1521 nid = mnb->status_change_nid;
1526 case MEM_GOING_ONLINE:
1527 mutex_lock(&slab_mutex);
1528 ret = init_cache_nodelists_node(nid);
1529 mutex_unlock(&slab_mutex);
1531 case MEM_GOING_OFFLINE:
1532 mutex_lock(&slab_mutex);
1533 ret = drain_cache_nodelists_node(nid);
1534 mutex_unlock(&slab_mutex);
1538 case MEM_CANCEL_ONLINE:
1539 case MEM_CANCEL_OFFLINE:
1543 return notifier_from_errno(ret);
1545 #endif /* CONFIG_NUMA && CONFIG_MEMORY_HOTPLUG */
1548 * swap the static kmem_list3 with kmalloced memory
1550 static void __init init_list(struct kmem_cache *cachep, struct kmem_list3 *list,
1553 struct kmem_list3 *ptr;
1555 ptr = kmalloc_node(sizeof(struct kmem_list3), GFP_NOWAIT, nodeid);
1558 memcpy(ptr, list, sizeof(struct kmem_list3));
1560 * Do not assume that spinlocks can be initialized via memcpy:
1562 spin_lock_init(&ptr->list_lock);
1564 MAKE_ALL_LISTS(cachep, ptr, nodeid);
1565 cachep->nodelists[nodeid] = ptr;
1569 * For setting up all the kmem_list3s for cache whose buffer_size is same as
1570 * size of kmem_list3.
1572 static void __init set_up_list3s(struct kmem_cache *cachep, int index)
1576 for_each_online_node(node) {
1577 cachep->nodelists[node] = &initkmem_list3[index + node];
1578 cachep->nodelists[node]->next_reap = jiffies +
1580 ((unsigned long)cachep) % REAPTIMEOUT_LIST3;
1585 * Initialisation. Called after the page allocator have been initialised and
1586 * before smp_init().
1588 void __init kmem_cache_init(void)
1591 struct cache_sizes *sizes;
1592 struct cache_names *names;
1597 if (num_possible_nodes() == 1)
1598 use_alien_caches = 0;
1600 for (i = 0; i < NUM_INIT_LISTS; i++) {
1601 kmem_list3_init(&initkmem_list3[i]);
1602 if (i < MAX_NUMNODES)
1603 cache_cache.nodelists[i] = NULL;
1605 set_up_list3s(&cache_cache, CACHE_CACHE);
1608 * Fragmentation resistance on low memory - only use bigger
1609 * page orders on machines with more than 32MB of memory if
1610 * not overridden on the command line.
1612 if (!slab_max_order_set && totalram_pages > (32 << 20) >> PAGE_SHIFT)
1613 slab_max_order = SLAB_MAX_ORDER_HI;
1615 /* Bootstrap is tricky, because several objects are allocated
1616 * from caches that do not exist yet:
1617 * 1) initialize the cache_cache cache: it contains the struct
1618 * kmem_cache structures of all caches, except cache_cache itself:
1619 * cache_cache is statically allocated.
1620 * Initially an __init data area is used for the head array and the
1621 * kmem_list3 structures, it's replaced with a kmalloc allocated
1622 * array at the end of the bootstrap.
1623 * 2) Create the first kmalloc cache.
1624 * The struct kmem_cache for the new cache is allocated normally.
1625 * An __init data area is used for the head array.
1626 * 3) Create the remaining kmalloc caches, with minimally sized
1628 * 4) Replace the __init data head arrays for cache_cache and the first
1629 * kmalloc cache with kmalloc allocated arrays.
1630 * 5) Replace the __init data for kmem_list3 for cache_cache and
1631 * the other cache's with kmalloc allocated memory.
1632 * 6) Resize the head arrays of the kmalloc caches to their final sizes.
1635 node = numa_mem_id();
1637 /* 1) create the cache_cache */
1638 INIT_LIST_HEAD(&slab_caches);
1639 list_add(&cache_cache.list, &slab_caches);
1640 cache_cache.colour_off = cache_line_size();
1641 cache_cache.array[smp_processor_id()] = &initarray_cache.cache;
1642 cache_cache.nodelists[node] = &initkmem_list3[CACHE_CACHE + node];
1645 * struct kmem_cache size depends on nr_node_ids & nr_cpu_ids
1647 cache_cache.size = offsetof(struct kmem_cache, array[nr_cpu_ids]) +
1648 nr_node_ids * sizeof(struct kmem_list3 *);
1649 cache_cache.object_size = cache_cache.size;
1650 cache_cache.size = ALIGN(cache_cache.size,
1652 cache_cache.reciprocal_buffer_size =
1653 reciprocal_value(cache_cache.size);
1655 for (order = 0; order < MAX_ORDER; order++) {
1656 cache_estimate(order, cache_cache.size,
1657 cache_line_size(), 0, &left_over, &cache_cache.num);
1658 if (cache_cache.num)
1661 BUG_ON(!cache_cache.num);
1662 cache_cache.gfporder = order;
1663 cache_cache.colour = left_over / cache_cache.colour_off;
1664 cache_cache.slab_size = ALIGN(cache_cache.num * sizeof(kmem_bufctl_t) +
1665 sizeof(struct slab), cache_line_size());
1667 /* 2+3) create the kmalloc caches */
1668 sizes = malloc_sizes;
1669 names = cache_names;
1672 * Initialize the caches that provide memory for the array cache and the
1673 * kmem_list3 structures first. Without this, further allocations will
1677 sizes[INDEX_AC].cs_cachep = __kmem_cache_create(names[INDEX_AC].name,
1678 sizes[INDEX_AC].cs_size,
1679 ARCH_KMALLOC_MINALIGN,
1680 ARCH_KMALLOC_FLAGS|SLAB_PANIC,
1683 if (INDEX_AC != INDEX_L3) {
1684 sizes[INDEX_L3].cs_cachep =
1685 __kmem_cache_create(names[INDEX_L3].name,
1686 sizes[INDEX_L3].cs_size,
1687 ARCH_KMALLOC_MINALIGN,
1688 ARCH_KMALLOC_FLAGS|SLAB_PANIC,
1692 slab_early_init = 0;
1694 while (sizes->cs_size != ULONG_MAX) {
1696 * For performance, all the general caches are L1 aligned.
1697 * This should be particularly beneficial on SMP boxes, as it
1698 * eliminates "false sharing".
1699 * Note for systems short on memory removing the alignment will
1700 * allow tighter packing of the smaller caches.
1702 if (!sizes->cs_cachep) {
1703 sizes->cs_cachep = __kmem_cache_create(names->name,
1705 ARCH_KMALLOC_MINALIGN,
1706 ARCH_KMALLOC_FLAGS|SLAB_PANIC,
1709 #ifdef CONFIG_ZONE_DMA
1710 sizes->cs_dmacachep = __kmem_cache_create(
1713 ARCH_KMALLOC_MINALIGN,
1714 ARCH_KMALLOC_FLAGS|SLAB_CACHE_DMA|
1721 /* 4) Replace the bootstrap head arrays */
1723 struct array_cache *ptr;
1725 ptr = kmalloc(sizeof(struct arraycache_init), GFP_NOWAIT);
1727 BUG_ON(cpu_cache_get(&cache_cache) != &initarray_cache.cache);
1728 memcpy(ptr, cpu_cache_get(&cache_cache),
1729 sizeof(struct arraycache_init));
1731 * Do not assume that spinlocks can be initialized via memcpy:
1733 spin_lock_init(&ptr->lock);
1735 cache_cache.array[smp_processor_id()] = ptr;
1737 ptr = kmalloc(sizeof(struct arraycache_init), GFP_NOWAIT);
1739 BUG_ON(cpu_cache_get(malloc_sizes[INDEX_AC].cs_cachep)
1740 != &initarray_generic.cache);
1741 memcpy(ptr, cpu_cache_get(malloc_sizes[INDEX_AC].cs_cachep),
1742 sizeof(struct arraycache_init));
1744 * Do not assume that spinlocks can be initialized via memcpy:
1746 spin_lock_init(&ptr->lock);
1748 malloc_sizes[INDEX_AC].cs_cachep->array[smp_processor_id()] =
1751 /* 5) Replace the bootstrap kmem_list3's */
1755 for_each_online_node(nid) {
1756 init_list(&cache_cache, &initkmem_list3[CACHE_CACHE + nid], nid);
1758 init_list(malloc_sizes[INDEX_AC].cs_cachep,
1759 &initkmem_list3[SIZE_AC + nid], nid);
1761 if (INDEX_AC != INDEX_L3) {
1762 init_list(malloc_sizes[INDEX_L3].cs_cachep,
1763 &initkmem_list3[SIZE_L3 + nid], nid);
1771 void __init kmem_cache_init_late(void)
1773 struct kmem_cache *cachep;
1777 /* 6) resize the head arrays to their final sizes */
1778 mutex_lock(&slab_mutex);
1779 list_for_each_entry(cachep, &slab_caches, list)
1780 if (enable_cpucache(cachep, GFP_NOWAIT))
1782 mutex_unlock(&slab_mutex);
1784 /* Annotate slab for lockdep -- annotate the malloc caches */
1791 * Register a cpu startup notifier callback that initializes
1792 * cpu_cache_get for all new cpus
1794 register_cpu_notifier(&cpucache_notifier);
1798 * Register a memory hotplug callback that initializes and frees
1801 hotplug_memory_notifier(slab_memory_callback, SLAB_CALLBACK_PRI);
1805 * The reap timers are started later, with a module init call: That part
1806 * of the kernel is not yet operational.
1810 static int __init cpucache_init(void)
1815 * Register the timers that return unneeded pages to the page allocator
1817 for_each_online_cpu(cpu)
1818 start_cpu_timer(cpu);
1824 __initcall(cpucache_init);
1826 static noinline void
1827 slab_out_of_memory(struct kmem_cache *cachep, gfp_t gfpflags, int nodeid)
1829 struct kmem_list3 *l3;
1831 unsigned long flags;
1835 "SLAB: Unable to allocate memory on node %d (gfp=0x%x)\n",
1837 printk(KERN_WARNING " cache: %s, object size: %d, order: %d\n",
1838 cachep->name, cachep->size, cachep->gfporder);
1840 for_each_online_node(node) {
1841 unsigned long active_objs = 0, num_objs = 0, free_objects = 0;
1842 unsigned long active_slabs = 0, num_slabs = 0;
1844 l3 = cachep->nodelists[node];
1848 spin_lock_irqsave(&l3->list_lock, flags);
1849 list_for_each_entry(slabp, &l3->slabs_full, list) {
1850 active_objs += cachep->num;
1853 list_for_each_entry(slabp, &l3->slabs_partial, list) {
1854 active_objs += slabp->inuse;
1857 list_for_each_entry(slabp, &l3->slabs_free, list)
1860 free_objects += l3->free_objects;
1861 spin_unlock_irqrestore(&l3->list_lock, flags);
1863 num_slabs += active_slabs;
1864 num_objs = num_slabs * cachep->num;
1866 " node %d: slabs: %ld/%ld, objs: %ld/%ld, free: %ld\n",
1867 node, active_slabs, num_slabs, active_objs, num_objs,
1873 * Interface to system's page allocator. No need to hold the cache-lock.
1875 * If we requested dmaable memory, we will get it. Even if we
1876 * did not request dmaable memory, we might get it, but that
1877 * would be relatively rare and ignorable.
1879 static void *kmem_getpages(struct kmem_cache *cachep, gfp_t flags, int nodeid)
1887 * Nommu uses slab's for process anonymous memory allocations, and thus
1888 * requires __GFP_COMP to properly refcount higher order allocations
1890 flags |= __GFP_COMP;
1893 flags |= cachep->allocflags;
1894 if (cachep->flags & SLAB_RECLAIM_ACCOUNT)
1895 flags |= __GFP_RECLAIMABLE;
1897 page = alloc_pages_exact_node(nodeid, flags | __GFP_NOTRACK, cachep->gfporder);
1899 if (!(flags & __GFP_NOWARN) && printk_ratelimit())
1900 slab_out_of_memory(cachep, flags, nodeid);
1904 /* Record if ALLOC_NO_WATERMARKS was set when allocating the slab */
1905 if (unlikely(page->pfmemalloc))
1906 pfmemalloc_active = true;
1908 nr_pages = (1 << cachep->gfporder);
1909 if (cachep->flags & SLAB_RECLAIM_ACCOUNT)
1910 add_zone_page_state(page_zone(page),
1911 NR_SLAB_RECLAIMABLE, nr_pages);
1913 add_zone_page_state(page_zone(page),
1914 NR_SLAB_UNRECLAIMABLE, nr_pages);
1915 for (i = 0; i < nr_pages; i++) {
1916 __SetPageSlab(page + i);
1918 if (page->pfmemalloc)
1919 SetPageSlabPfmemalloc(page + i);
1922 if (kmemcheck_enabled && !(cachep->flags & SLAB_NOTRACK)) {
1923 kmemcheck_alloc_shadow(page, cachep->gfporder, flags, nodeid);
1926 kmemcheck_mark_uninitialized_pages(page, nr_pages);
1928 kmemcheck_mark_unallocated_pages(page, nr_pages);
1931 return page_address(page);
1935 * Interface to system's page release.
1937 static void kmem_freepages(struct kmem_cache *cachep, void *addr)
1939 unsigned long i = (1 << cachep->gfporder);
1940 struct page *page = virt_to_page(addr);
1941 const unsigned long nr_freed = i;
1943 kmemcheck_free_shadow(page, cachep->gfporder);
1945 if (cachep->flags & SLAB_RECLAIM_ACCOUNT)
1946 sub_zone_page_state(page_zone(page),
1947 NR_SLAB_RECLAIMABLE, nr_freed);
1949 sub_zone_page_state(page_zone(page),
1950 NR_SLAB_UNRECLAIMABLE, nr_freed);
1952 BUG_ON(!PageSlab(page));
1953 __ClearPageSlabPfmemalloc(page);
1954 __ClearPageSlab(page);
1957 if (current->reclaim_state)
1958 current->reclaim_state->reclaimed_slab += nr_freed;
1959 free_pages((unsigned long)addr, cachep->gfporder);
1962 static void kmem_rcu_free(struct rcu_head *head)
1964 struct slab_rcu *slab_rcu = (struct slab_rcu *)head;
1965 struct kmem_cache *cachep = slab_rcu->cachep;
1967 kmem_freepages(cachep, slab_rcu->addr);
1968 if (OFF_SLAB(cachep))
1969 kmem_cache_free(cachep->slabp_cache, slab_rcu);
1974 #ifdef CONFIG_DEBUG_PAGEALLOC
1975 static void store_stackinfo(struct kmem_cache *cachep, unsigned long *addr,
1976 unsigned long caller)
1978 int size = cachep->object_size;
1980 addr = (unsigned long *)&((char *)addr)[obj_offset(cachep)];
1982 if (size < 5 * sizeof(unsigned long))
1985 *addr++ = 0x12345678;
1987 *addr++ = smp_processor_id();
1988 size -= 3 * sizeof(unsigned long);
1990 unsigned long *sptr = &caller;
1991 unsigned long svalue;
1993 while (!kstack_end(sptr)) {
1995 if (kernel_text_address(svalue)) {
1997 size -= sizeof(unsigned long);
1998 if (size <= sizeof(unsigned long))
2004 *addr++ = 0x87654321;
2008 static void poison_obj(struct kmem_cache *cachep, void *addr, unsigned char val)
2010 int size = cachep->object_size;
2011 addr = &((char *)addr)[obj_offset(cachep)];
2013 memset(addr, val, size);
2014 *(unsigned char *)(addr + size - 1) = POISON_END;
2017 static void dump_line(char *data, int offset, int limit)
2020 unsigned char error = 0;
2023 printk(KERN_ERR "%03x: ", offset);
2024 for (i = 0; i < limit; i++) {
2025 if (data[offset + i] != POISON_FREE) {
2026 error = data[offset + i];
2030 print_hex_dump(KERN_CONT, "", 0, 16, 1,
2031 &data[offset], limit, 1);
2033 if (bad_count == 1) {
2034 error ^= POISON_FREE;
2035 if (!(error & (error - 1))) {
2036 printk(KERN_ERR "Single bit error detected. Probably "
2039 printk(KERN_ERR "Run memtest86+ or a similar memory "
2042 printk(KERN_ERR "Run a memory test tool.\n");
2051 static void print_objinfo(struct kmem_cache *cachep, void *objp, int lines)
2056 if (cachep->flags & SLAB_RED_ZONE) {
2057 printk(KERN_ERR "Redzone: 0x%llx/0x%llx.\n",
2058 *dbg_redzone1(cachep, objp),
2059 *dbg_redzone2(cachep, objp));
2062 if (cachep->flags & SLAB_STORE_USER) {
2063 printk(KERN_ERR "Last user: [<%p>]",
2064 *dbg_userword(cachep, objp));
2065 print_symbol("(%s)",
2066 (unsigned long)*dbg_userword(cachep, objp));
2069 realobj = (char *)objp + obj_offset(cachep);
2070 size = cachep->object_size;
2071 for (i = 0; i < size && lines; i += 16, lines--) {
2074 if (i + limit > size)
2076 dump_line(realobj, i, limit);
2080 static void check_poison_obj(struct kmem_cache *cachep, void *objp)
2086 realobj = (char *)objp + obj_offset(cachep);
2087 size = cachep->object_size;
2089 for (i = 0; i < size; i++) {
2090 char exp = POISON_FREE;
2093 if (realobj[i] != exp) {
2099 "Slab corruption (%s): %s start=%p, len=%d\n",
2100 print_tainted(), cachep->name, realobj, size);
2101 print_objinfo(cachep, objp, 0);
2103 /* Hexdump the affected line */
2106 if (i + limit > size)
2108 dump_line(realobj, i, limit);
2111 /* Limit to 5 lines */
2117 /* Print some data about the neighboring objects, if they
2120 struct slab *slabp = virt_to_slab(objp);
2123 objnr = obj_to_index(cachep, slabp, objp);
2125 objp = index_to_obj(cachep, slabp, objnr - 1);
2126 realobj = (char *)objp + obj_offset(cachep);
2127 printk(KERN_ERR "Prev obj: start=%p, len=%d\n",
2129 print_objinfo(cachep, objp, 2);
2131 if (objnr + 1 < cachep->num) {
2132 objp = index_to_obj(cachep, slabp, objnr + 1);
2133 realobj = (char *)objp + obj_offset(cachep);
2134 printk(KERN_ERR "Next obj: start=%p, len=%d\n",
2136 print_objinfo(cachep, objp, 2);
2143 static void slab_destroy_debugcheck(struct kmem_cache *cachep, struct slab *slabp)
2146 for (i = 0; i < cachep->num; i++) {
2147 void *objp = index_to_obj(cachep, slabp, i);
2149 if (cachep->flags & SLAB_POISON) {
2150 #ifdef CONFIG_DEBUG_PAGEALLOC
2151 if (cachep->size % PAGE_SIZE == 0 &&
2153 kernel_map_pages(virt_to_page(objp),
2154 cachep->size / PAGE_SIZE, 1);
2156 check_poison_obj(cachep, objp);
2158 check_poison_obj(cachep, objp);
2161 if (cachep->flags & SLAB_RED_ZONE) {
2162 if (*dbg_redzone1(cachep, objp) != RED_INACTIVE)
2163 slab_error(cachep, "start of a freed object "
2165 if (*dbg_redzone2(cachep, objp) != RED_INACTIVE)
2166 slab_error(cachep, "end of a freed object "
2172 static void slab_destroy_debugcheck(struct kmem_cache *cachep, struct slab *slabp)
2178 * slab_destroy - destroy and release all objects in a slab
2179 * @cachep: cache pointer being destroyed
2180 * @slabp: slab pointer being destroyed
2182 * Destroy all the objs in a slab, and release the mem back to the system.
2183 * Before calling the slab must have been unlinked from the cache. The
2184 * cache-lock is not held/needed.
2186 static void slab_destroy(struct kmem_cache *cachep, struct slab *slabp)
2188 void *addr = slabp->s_mem - slabp->colouroff;
2190 slab_destroy_debugcheck(cachep, slabp);
2191 if (unlikely(cachep->flags & SLAB_DESTROY_BY_RCU)) {
2192 struct slab_rcu *slab_rcu;
2194 slab_rcu = (struct slab_rcu *)slabp;
2195 slab_rcu->cachep = cachep;
2196 slab_rcu->addr = addr;
2197 call_rcu(&slab_rcu->head, kmem_rcu_free);
2199 kmem_freepages(cachep, addr);
2200 if (OFF_SLAB(cachep))
2201 kmem_cache_free(cachep->slabp_cache, slabp);
2205 static void __kmem_cache_destroy(struct kmem_cache *cachep)
2208 struct kmem_list3 *l3;
2210 for_each_online_cpu(i)
2211 kfree(cachep->array[i]);
2213 /* NUMA: free the list3 structures */
2214 for_each_online_node(i) {
2215 l3 = cachep->nodelists[i];
2218 free_alien_cache(l3->alien);
2222 kmem_cache_free(&cache_cache, cachep);
2227 * calculate_slab_order - calculate size (page order) of slabs
2228 * @cachep: pointer to the cache that is being created
2229 * @size: size of objects to be created in this cache.
2230 * @align: required alignment for the objects.
2231 * @flags: slab allocation flags
2233 * Also calculates the number of objects per slab.
2235 * This could be made much more intelligent. For now, try to avoid using
2236 * high order pages for slabs. When the gfp() functions are more friendly
2237 * towards high-order requests, this should be changed.
2239 static size_t calculate_slab_order(struct kmem_cache *cachep,
2240 size_t size, size_t align, unsigned long flags)
2242 unsigned long offslab_limit;
2243 size_t left_over = 0;
2246 for (gfporder = 0; gfporder <= KMALLOC_MAX_ORDER; gfporder++) {
2250 cache_estimate(gfporder, size, align, flags, &remainder, &num);
2254 if (flags & CFLGS_OFF_SLAB) {
2256 * Max number of objs-per-slab for caches which
2257 * use off-slab slabs. Needed to avoid a possible
2258 * looping condition in cache_grow().
2260 offslab_limit = size - sizeof(struct slab);
2261 offslab_limit /= sizeof(kmem_bufctl_t);
2263 if (num > offslab_limit)
2267 /* Found something acceptable - save it away */
2269 cachep->gfporder = gfporder;
2270 left_over = remainder;
2273 * A VFS-reclaimable slab tends to have most allocations
2274 * as GFP_NOFS and we really don't want to have to be allocating
2275 * higher-order pages when we are unable to shrink dcache.
2277 if (flags & SLAB_RECLAIM_ACCOUNT)
2281 * Large number of objects is good, but very large slabs are
2282 * currently bad for the gfp()s.
2284 if (gfporder >= slab_max_order)
2288 * Acceptable internal fragmentation?
2290 if (left_over * 8 <= (PAGE_SIZE << gfporder))
2296 static int __init_refok setup_cpu_cache(struct kmem_cache *cachep, gfp_t gfp)
2298 if (slab_state >= FULL)
2299 return enable_cpucache(cachep, gfp);
2301 if (slab_state == DOWN) {
2303 * Note: the first kmem_cache_create must create the cache
2304 * that's used by kmalloc(24), otherwise the creation of
2305 * further caches will BUG().
2307 cachep->array[smp_processor_id()] = &initarray_generic.cache;
2310 * If the cache that's used by kmalloc(sizeof(kmem_list3)) is
2311 * the first cache, then we need to set up all its list3s,
2312 * otherwise the creation of further caches will BUG().
2314 set_up_list3s(cachep, SIZE_AC);
2315 if (INDEX_AC == INDEX_L3)
2316 slab_state = PARTIAL_L3;
2318 slab_state = PARTIAL_ARRAYCACHE;
2320 cachep->array[smp_processor_id()] =
2321 kmalloc(sizeof(struct arraycache_init), gfp);
2323 if (slab_state == PARTIAL_ARRAYCACHE) {
2324 set_up_list3s(cachep, SIZE_L3);
2325 slab_state = PARTIAL_L3;
2328 for_each_online_node(node) {
2329 cachep->nodelists[node] =
2330 kmalloc_node(sizeof(struct kmem_list3),
2332 BUG_ON(!cachep->nodelists[node]);
2333 kmem_list3_init(cachep->nodelists[node]);
2337 cachep->nodelists[numa_mem_id()]->next_reap =
2338 jiffies + REAPTIMEOUT_LIST3 +
2339 ((unsigned long)cachep) % REAPTIMEOUT_LIST3;
2341 cpu_cache_get(cachep)->avail = 0;
2342 cpu_cache_get(cachep)->limit = BOOT_CPUCACHE_ENTRIES;
2343 cpu_cache_get(cachep)->batchcount = 1;
2344 cpu_cache_get(cachep)->touched = 0;
2345 cachep->batchcount = 1;
2346 cachep->limit = BOOT_CPUCACHE_ENTRIES;
2351 * __kmem_cache_create - Create a cache.
2352 * @name: A string which is used in /proc/slabinfo to identify this cache.
2353 * @size: The size of objects to be created in this cache.
2354 * @align: The required alignment for the objects.
2355 * @flags: SLAB flags
2356 * @ctor: A constructor for the objects.
2358 * Returns a ptr to the cache on success, NULL on failure.
2359 * Cannot be called within a int, but can be interrupted.
2360 * The @ctor is run when new pages are allocated by the cache.
2362 * @name must be valid until the cache is destroyed. This implies that
2363 * the module calling this has to destroy the cache before getting unloaded.
2367 * %SLAB_POISON - Poison the slab with a known test pattern (a5a5a5a5)
2368 * to catch references to uninitialised memory.
2370 * %SLAB_RED_ZONE - Insert `Red' zones around the allocated memory to check
2371 * for buffer overruns.
2373 * %SLAB_HWCACHE_ALIGN - Align the objects in this cache to a hardware
2374 * cacheline. This can be beneficial if you're counting cycles as closely
2378 __kmem_cache_create (const char *name, size_t size, size_t align,
2379 unsigned long flags, void (*ctor)(void *))
2381 size_t left_over, slab_size, ralign;
2382 struct kmem_cache *cachep = NULL;
2388 * Enable redzoning and last user accounting, except for caches with
2389 * large objects, if the increased size would increase the object size
2390 * above the next power of two: caches with object sizes just above a
2391 * power of two have a significant amount of internal fragmentation.
2393 if (size < 4096 || fls(size - 1) == fls(size-1 + REDZONE_ALIGN +
2394 2 * sizeof(unsigned long long)))
2395 flags |= SLAB_RED_ZONE | SLAB_STORE_USER;
2396 if (!(flags & SLAB_DESTROY_BY_RCU))
2397 flags |= SLAB_POISON;
2399 if (flags & SLAB_DESTROY_BY_RCU)
2400 BUG_ON(flags & SLAB_POISON);
2403 * Always checks flags, a caller might be expecting debug support which
2406 BUG_ON(flags & ~CREATE_MASK);
2409 * Check that size is in terms of words. This is needed to avoid
2410 * unaligned accesses for some archs when redzoning is used, and makes
2411 * sure any on-slab bufctl's are also correctly aligned.
2413 if (size & (BYTES_PER_WORD - 1)) {
2414 size += (BYTES_PER_WORD - 1);
2415 size &= ~(BYTES_PER_WORD - 1);
2418 /* calculate the final buffer alignment: */
2420 /* 1) arch recommendation: can be overridden for debug */
2421 if (flags & SLAB_HWCACHE_ALIGN) {
2423 * Default alignment: as specified by the arch code. Except if
2424 * an object is really small, then squeeze multiple objects into
2427 ralign = cache_line_size();
2428 while (size <= ralign / 2)
2431 ralign = BYTES_PER_WORD;
2435 * Redzoning and user store require word alignment or possibly larger.
2436 * Note this will be overridden by architecture or caller mandated
2437 * alignment if either is greater than BYTES_PER_WORD.
2439 if (flags & SLAB_STORE_USER)
2440 ralign = BYTES_PER_WORD;
2442 if (flags & SLAB_RED_ZONE) {
2443 ralign = REDZONE_ALIGN;
2444 /* If redzoning, ensure that the second redzone is suitably
2445 * aligned, by adjusting the object size accordingly. */
2446 size += REDZONE_ALIGN - 1;
2447 size &= ~(REDZONE_ALIGN - 1);
2450 /* 2) arch mandated alignment */
2451 if (ralign < ARCH_SLAB_MINALIGN) {
2452 ralign = ARCH_SLAB_MINALIGN;
2454 /* 3) caller mandated alignment */
2455 if (ralign < align) {
2458 /* disable debug if necessary */
2459 if (ralign > __alignof__(unsigned long long))
2460 flags &= ~(SLAB_RED_ZONE | SLAB_STORE_USER);
2466 if (slab_is_available())
2471 /* Get cache's description obj. */
2472 cachep = kmem_cache_zalloc(&cache_cache, gfp);
2476 cachep->nodelists = (struct kmem_list3 **)&cachep->array[nr_cpu_ids];
2477 cachep->object_size = size;
2478 cachep->align = align;
2482 * Both debugging options require word-alignment which is calculated
2485 if (flags & SLAB_RED_ZONE) {
2486 /* add space for red zone words */
2487 cachep->obj_offset += sizeof(unsigned long long);
2488 size += 2 * sizeof(unsigned long long);
2490 if (flags & SLAB_STORE_USER) {
2491 /* user store requires one word storage behind the end of
2492 * the real object. But if the second red zone needs to be
2493 * aligned to 64 bits, we must allow that much space.
2495 if (flags & SLAB_RED_ZONE)
2496 size += REDZONE_ALIGN;
2498 size += BYTES_PER_WORD;
2500 #if FORCED_DEBUG && defined(CONFIG_DEBUG_PAGEALLOC)
2501 if (size >= malloc_sizes[INDEX_L3 + 1].cs_size
2502 && cachep->object_size > cache_line_size() && ALIGN(size, align) < PAGE_SIZE) {
2503 cachep->obj_offset += PAGE_SIZE - ALIGN(size, align);
2510 * Determine if the slab management is 'on' or 'off' slab.
2511 * (bootstrapping cannot cope with offslab caches so don't do
2512 * it too early on. Always use on-slab management when
2513 * SLAB_NOLEAKTRACE to avoid recursive calls into kmemleak)
2515 if ((size >= (PAGE_SIZE >> 3)) && !slab_early_init &&
2516 !(flags & SLAB_NOLEAKTRACE))
2518 * Size is large, assume best to place the slab management obj
2519 * off-slab (should allow better packing of objs).
2521 flags |= CFLGS_OFF_SLAB;
2523 size = ALIGN(size, align);
2525 left_over = calculate_slab_order(cachep, size, align, flags);
2529 "kmem_cache_create: couldn't create cache %s.\n", name);
2530 kmem_cache_free(&cache_cache, cachep);
2533 slab_size = ALIGN(cachep->num * sizeof(kmem_bufctl_t)
2534 + sizeof(struct slab), align);
2537 * If the slab has been placed off-slab, and we have enough space then
2538 * move it on-slab. This is at the expense of any extra colouring.
2540 if (flags & CFLGS_OFF_SLAB && left_over >= slab_size) {
2541 flags &= ~CFLGS_OFF_SLAB;
2542 left_over -= slab_size;
2545 if (flags & CFLGS_OFF_SLAB) {
2546 /* really off slab. No need for manual alignment */
2548 cachep->num * sizeof(kmem_bufctl_t) + sizeof(struct slab);
2550 #ifdef CONFIG_PAGE_POISONING
2551 /* If we're going to use the generic kernel_map_pages()
2552 * poisoning, then it's going to smash the contents of
2553 * the redzone and userword anyhow, so switch them off.
2555 if (size % PAGE_SIZE == 0 && flags & SLAB_POISON)
2556 flags &= ~(SLAB_RED_ZONE | SLAB_STORE_USER);
2560 cachep->colour_off = cache_line_size();
2561 /* Offset must be a multiple of the alignment. */
2562 if (cachep->colour_off < align)
2563 cachep->colour_off = align;
2564 cachep->colour = left_over / cachep->colour_off;
2565 cachep->slab_size = slab_size;
2566 cachep->flags = flags;
2567 cachep->allocflags = 0;
2568 if (CONFIG_ZONE_DMA_FLAG && (flags & SLAB_CACHE_DMA))
2569 cachep->allocflags |= GFP_DMA;
2570 cachep->size = size;
2571 cachep->reciprocal_buffer_size = reciprocal_value(size);
2573 if (flags & CFLGS_OFF_SLAB) {
2574 cachep->slabp_cache = kmem_find_general_cachep(slab_size, 0u);
2576 * This is a possibility for one of the malloc_sizes caches.
2577 * But since we go off slab only for object size greater than
2578 * PAGE_SIZE/8, and malloc_sizes gets created in ascending order,
2579 * this should not happen at all.
2580 * But leave a BUG_ON for some lucky dude.
2582 BUG_ON(ZERO_OR_NULL_PTR(cachep->slabp_cache));
2584 cachep->ctor = ctor;
2585 cachep->name = name;
2587 if (setup_cpu_cache(cachep, gfp)) {
2588 __kmem_cache_destroy(cachep);
2592 if (flags & SLAB_DEBUG_OBJECTS) {
2594 * Would deadlock through slab_destroy()->call_rcu()->
2595 * debug_object_activate()->kmem_cache_alloc().
2597 WARN_ON_ONCE(flags & SLAB_DESTROY_BY_RCU);
2599 slab_set_debugobj_lock_classes(cachep);
2602 /* cache setup completed, link it into the list */
2603 list_add(&cachep->list, &slab_caches);
2608 static void check_irq_off(void)
2610 BUG_ON(!irqs_disabled());
2613 static void check_irq_on(void)
2615 BUG_ON(irqs_disabled());
2618 static void check_spinlock_acquired(struct kmem_cache *cachep)
2622 assert_spin_locked(&cachep->nodelists[numa_mem_id()]->list_lock);
2626 static void check_spinlock_acquired_node(struct kmem_cache *cachep, int node)
2630 assert_spin_locked(&cachep->nodelists[node]->list_lock);
2635 #define check_irq_off() do { } while(0)
2636 #define check_irq_on() do { } while(0)
2637 #define check_spinlock_acquired(x) do { } while(0)
2638 #define check_spinlock_acquired_node(x, y) do { } while(0)
2641 static void drain_array(struct kmem_cache *cachep, struct kmem_list3 *l3,
2642 struct array_cache *ac,
2643 int force, int node);
2645 static void do_drain(void *arg)
2647 struct kmem_cache *cachep = arg;
2648 struct array_cache *ac;
2649 int node = numa_mem_id();
2652 ac = cpu_cache_get(cachep);
2653 spin_lock(&cachep->nodelists[node]->list_lock);
2654 free_block(cachep, ac->entry, ac->avail, node);
2655 spin_unlock(&cachep->nodelists[node]->list_lock);
2659 static void drain_cpu_caches(struct kmem_cache *cachep)
2661 struct kmem_list3 *l3;
2664 on_each_cpu(do_drain, cachep, 1);
2666 for_each_online_node(node) {
2667 l3 = cachep->nodelists[node];
2668 if (l3 && l3->alien)
2669 drain_alien_cache(cachep, l3->alien);
2672 for_each_online_node(node) {
2673 l3 = cachep->nodelists[node];
2675 drain_array(cachep, l3, l3->shared, 1, node);
2680 * Remove slabs from the list of free slabs.
2681 * Specify the number of slabs to drain in tofree.
2683 * Returns the actual number of slabs released.
2685 static int drain_freelist(struct kmem_cache *cache,
2686 struct kmem_list3 *l3, int tofree)
2688 struct list_head *p;
2693 while (nr_freed < tofree && !list_empty(&l3->slabs_free)) {
2695 spin_lock_irq(&l3->list_lock);
2696 p = l3->slabs_free.prev;
2697 if (p == &l3->slabs_free) {
2698 spin_unlock_irq(&l3->list_lock);
2702 slabp = list_entry(p, struct slab, list);
2704 BUG_ON(slabp->inuse);
2706 list_del(&slabp->list);
2708 * Safe to drop the lock. The slab is no longer linked
2711 l3->free_objects -= cache->num;
2712 spin_unlock_irq(&l3->list_lock);
2713 slab_destroy(cache, slabp);
2720 /* Called with slab_mutex held to protect against cpu hotplug */
2721 static int __cache_shrink(struct kmem_cache *cachep)
2724 struct kmem_list3 *l3;
2726 drain_cpu_caches(cachep);
2729 for_each_online_node(i) {
2730 l3 = cachep->nodelists[i];
2734 drain_freelist(cachep, l3, l3->free_objects);
2736 ret += !list_empty(&l3->slabs_full) ||
2737 !list_empty(&l3->slabs_partial);
2739 return (ret ? 1 : 0);
2743 * kmem_cache_shrink - Shrink a cache.
2744 * @cachep: The cache to shrink.
2746 * Releases as many slabs as possible for a cache.
2747 * To help debugging, a zero exit status indicates all slabs were released.
2749 int kmem_cache_shrink(struct kmem_cache *cachep)
2752 BUG_ON(!cachep || in_interrupt());
2755 mutex_lock(&slab_mutex);
2756 ret = __cache_shrink(cachep);
2757 mutex_unlock(&slab_mutex);
2761 EXPORT_SYMBOL(kmem_cache_shrink);
2764 * kmem_cache_destroy - delete a cache
2765 * @cachep: the cache to destroy
2767 * Remove a &struct kmem_cache object from the slab cache.
2769 * It is expected this function will be called by a module when it is
2770 * unloaded. This will remove the cache completely, and avoid a duplicate
2771 * cache being allocated each time a module is loaded and unloaded, if the
2772 * module doesn't have persistent in-kernel storage across loads and unloads.
2774 * The cache must be empty before calling this function.
2776 * The caller must guarantee that no one will allocate memory from the cache
2777 * during the kmem_cache_destroy().
2779 void kmem_cache_destroy(struct kmem_cache *cachep)
2781 BUG_ON(!cachep || in_interrupt());
2783 /* Find the cache in the chain of caches. */
2785 mutex_lock(&slab_mutex);
2787 * the chain is never empty, cache_cache is never destroyed
2789 list_del(&cachep->list);
2790 if (__cache_shrink(cachep)) {
2791 slab_error(cachep, "Can't free all objects");
2792 list_add(&cachep->list, &slab_caches);
2793 mutex_unlock(&slab_mutex);
2798 if (unlikely(cachep->flags & SLAB_DESTROY_BY_RCU))
2801 __kmem_cache_destroy(cachep);
2802 mutex_unlock(&slab_mutex);
2805 EXPORT_SYMBOL(kmem_cache_destroy);
2808 * Get the memory for a slab management obj.
2809 * For a slab cache when the slab descriptor is off-slab, slab descriptors
2810 * always come from malloc_sizes caches. The slab descriptor cannot
2811 * come from the same cache which is getting created because,
2812 * when we are searching for an appropriate cache for these
2813 * descriptors in kmem_cache_create, we search through the malloc_sizes array.
2814 * If we are creating a malloc_sizes cache here it would not be visible to
2815 * kmem_find_general_cachep till the initialization is complete.
2816 * Hence we cannot have slabp_cache same as the original cache.
2818 static struct slab *alloc_slabmgmt(struct kmem_cache *cachep, void *objp,
2819 int colour_off, gfp_t local_flags,
2824 if (OFF_SLAB(cachep)) {
2825 /* Slab management obj is off-slab. */
2826 slabp = kmem_cache_alloc_node(cachep->slabp_cache,
2827 local_flags, nodeid);
2829 * If the first object in the slab is leaked (it's allocated
2830 * but no one has a reference to it), we want to make sure
2831 * kmemleak does not treat the ->s_mem pointer as a reference
2832 * to the object. Otherwise we will not report the leak.
2834 kmemleak_scan_area(&slabp->list, sizeof(struct list_head),
2839 slabp = objp + colour_off;
2840 colour_off += cachep->slab_size;
2843 slabp->colouroff = colour_off;
2844 slabp->s_mem = objp + colour_off;
2845 slabp->nodeid = nodeid;
2850 static inline kmem_bufctl_t *slab_bufctl(struct slab *slabp)
2852 return (kmem_bufctl_t *) (slabp + 1);
2855 static void cache_init_objs(struct kmem_cache *cachep,
2860 for (i = 0; i < cachep->num; i++) {
2861 void *objp = index_to_obj(cachep, slabp, i);
2863 /* need to poison the objs? */
2864 if (cachep->flags & SLAB_POISON)
2865 poison_obj(cachep, objp, POISON_FREE);
2866 if (cachep->flags & SLAB_STORE_USER)
2867 *dbg_userword(cachep, objp) = NULL;
2869 if (cachep->flags & SLAB_RED_ZONE) {
2870 *dbg_redzone1(cachep, objp) = RED_INACTIVE;
2871 *dbg_redzone2(cachep, objp) = RED_INACTIVE;
2874 * Constructors are not allowed to allocate memory from the same
2875 * cache which they are a constructor for. Otherwise, deadlock.
2876 * They must also be threaded.
2878 if (cachep->ctor && !(cachep->flags & SLAB_POISON))
2879 cachep->ctor(objp + obj_offset(cachep));
2881 if (cachep->flags & SLAB_RED_ZONE) {
2882 if (*dbg_redzone2(cachep, objp) != RED_INACTIVE)
2883 slab_error(cachep, "constructor overwrote the"
2884 " end of an object");
2885 if (*dbg_redzone1(cachep, objp) != RED_INACTIVE)
2886 slab_error(cachep, "constructor overwrote the"
2887 " start of an object");
2889 if ((cachep->size % PAGE_SIZE) == 0 &&
2890 OFF_SLAB(cachep) && cachep->flags & SLAB_POISON)
2891 kernel_map_pages(virt_to_page(objp),
2892 cachep->size / PAGE_SIZE, 0);
2897 slab_bufctl(slabp)[i] = i + 1;
2899 slab_bufctl(slabp)[i - 1] = BUFCTL_END;
2902 static void kmem_flagcheck(struct kmem_cache *cachep, gfp_t flags)
2904 if (CONFIG_ZONE_DMA_FLAG) {
2905 if (flags & GFP_DMA)
2906 BUG_ON(!(cachep->allocflags & GFP_DMA));
2908 BUG_ON(cachep->allocflags & GFP_DMA);
2912 static void *slab_get_obj(struct kmem_cache *cachep, struct slab *slabp,
2915 void *objp = index_to_obj(cachep, slabp, slabp->free);
2919 next = slab_bufctl(slabp)[slabp->free];
2921 slab_bufctl(slabp)[slabp->free] = BUFCTL_FREE;
2922 WARN_ON(slabp->nodeid != nodeid);
2929 static void slab_put_obj(struct kmem_cache *cachep, struct slab *slabp,
2930 void *objp, int nodeid)
2932 unsigned int objnr = obj_to_index(cachep, slabp, objp);
2935 /* Verify that the slab belongs to the intended node */
2936 WARN_ON(slabp->nodeid != nodeid);
2938 if (slab_bufctl(slabp)[objnr] + 1 <= SLAB_LIMIT + 1) {
2939 printk(KERN_ERR "slab: double free detected in cache "
2940 "'%s', objp %p\n", cachep->name, objp);
2944 slab_bufctl(slabp)[objnr] = slabp->free;
2945 slabp->free = objnr;
2950 * Map pages beginning at addr to the given cache and slab. This is required
2951 * for the slab allocator to be able to lookup the cache and slab of a
2952 * virtual address for kfree, ksize, and slab debugging.
2954 static void slab_map_pages(struct kmem_cache *cache, struct slab *slab,
2960 page = virt_to_page(addr);
2963 if (likely(!PageCompound(page)))
2964 nr_pages <<= cache->gfporder;
2967 page->slab_cache = cache;
2968 page->slab_page = slab;
2970 } while (--nr_pages);
2974 * Grow (by 1) the number of slabs within a cache. This is called by
2975 * kmem_cache_alloc() when there are no active objs left in a cache.
2977 static int cache_grow(struct kmem_cache *cachep,
2978 gfp_t flags, int nodeid, void *objp)
2983 struct kmem_list3 *l3;
2986 * Be lazy and only check for valid flags here, keeping it out of the
2987 * critical path in kmem_cache_alloc().
2989 BUG_ON(flags & GFP_SLAB_BUG_MASK);
2990 local_flags = flags & (GFP_CONSTRAINT_MASK|GFP_RECLAIM_MASK);
2992 /* Take the l3 list lock to change the colour_next on this node */
2994 l3 = cachep->nodelists[nodeid];
2995 spin_lock(&l3->list_lock);
2997 /* Get colour for the slab, and cal the next value. */
2998 offset = l3->colour_next;
3000 if (l3->colour_next >= cachep->colour)
3001 l3->colour_next = 0;
3002 spin_unlock(&l3->list_lock);
3004 offset *= cachep->colour_off;
3006 if (local_flags & __GFP_WAIT)
3010 * The test for missing atomic flag is performed here, rather than
3011 * the more obvious place, simply to reduce the critical path length
3012 * in kmem_cache_alloc(). If a caller is seriously mis-behaving they
3013 * will eventually be caught here (where it matters).
3015 kmem_flagcheck(cachep, flags);
3018 * Get mem for the objs. Attempt to allocate a physical page from
3022 objp = kmem_getpages(cachep, local_flags, nodeid);
3026 /* Get slab management. */
3027 slabp = alloc_slabmgmt(cachep, objp, offset,
3028 local_flags & ~GFP_CONSTRAINT_MASK, nodeid);
3032 slab_map_pages(cachep, slabp, objp);
3034 cache_init_objs(cachep, slabp);
3036 if (local_flags & __GFP_WAIT)
3037 local_irq_disable();
3039 spin_lock(&l3->list_lock);
3041 /* Make slab active. */
3042 list_add_tail(&slabp->list, &(l3->slabs_free));
3043 STATS_INC_GROWN(cachep);
3044 l3->free_objects += cachep->num;
3045 spin_unlock(&l3->list_lock);
3048 kmem_freepages(cachep, objp);
3050 if (local_flags & __GFP_WAIT)
3051 local_irq_disable();
3058 * Perform extra freeing checks:
3059 * - detect bad pointers.
3060 * - POISON/RED_ZONE checking
3062 static void kfree_debugcheck(const void *objp)
3064 if (!virt_addr_valid(objp)) {
3065 printk(KERN_ERR "kfree_debugcheck: out of range ptr %lxh.\n",
3066 (unsigned long)objp);
3071 static inline void verify_redzone_free(struct kmem_cache *cache, void *obj)
3073 unsigned long long redzone1, redzone2;
3075 redzone1 = *dbg_redzone1(cache, obj);
3076 redzone2 = *dbg_redzone2(cache, obj);
3081 if (redzone1 == RED_ACTIVE && redzone2 == RED_ACTIVE)
3084 if (redzone1 == RED_INACTIVE && redzone2 == RED_INACTIVE)
3085 slab_error(cache, "double free detected");
3087 slab_error(cache, "memory outside object was overwritten");
3089 printk(KERN_ERR "%p: redzone 1:0x%llx, redzone 2:0x%llx.\n",
3090 obj, redzone1, redzone2);
3093 static void *cache_free_debugcheck(struct kmem_cache *cachep, void *objp,
3100 BUG_ON(virt_to_cache(objp) != cachep);
3102 objp -= obj_offset(cachep);
3103 kfree_debugcheck(objp);
3104 page = virt_to_head_page(objp);
3106 slabp = page->slab_page;
3108 if (cachep->flags & SLAB_RED_ZONE) {
3109 verify_redzone_free(cachep, objp);
3110 *dbg_redzone1(cachep, objp) = RED_INACTIVE;
3111 *dbg_redzone2(cachep, objp) = RED_INACTIVE;
3113 if (cachep->flags & SLAB_STORE_USER)
3114 *dbg_userword(cachep, objp) = caller;
3116 objnr = obj_to_index(cachep, slabp, objp);
3118 BUG_ON(objnr >= cachep->num);
3119 BUG_ON(objp != index_to_obj(cachep, slabp, objnr));
3121 #ifdef CONFIG_DEBUG_SLAB_LEAK
3122 slab_bufctl(slabp)[objnr] = BUFCTL_FREE;
3124 if (cachep->flags & SLAB_POISON) {
3125 #ifdef CONFIG_DEBUG_PAGEALLOC
3126 if ((cachep->size % PAGE_SIZE)==0 && OFF_SLAB(cachep)) {
3127 store_stackinfo(cachep, objp, (unsigned long)caller);
3128 kernel_map_pages(virt_to_page(objp),
3129 cachep->size / PAGE_SIZE, 0);
3131 poison_obj(cachep, objp, POISON_FREE);
3134 poison_obj(cachep, objp, POISON_FREE);
3140 static void check_slabp(struct kmem_cache *cachep, struct slab *slabp)
3145 /* Check slab's freelist to see if this obj is there. */
3146 for (i = slabp->free; i != BUFCTL_END; i = slab_bufctl(slabp)[i]) {
3148 if (entries > cachep->num || i >= cachep->num)
3151 if (entries != cachep->num - slabp->inuse) {
3153 printk(KERN_ERR "slab: Internal list corruption detected in "
3154 "cache '%s'(%d), slabp %p(%d). Tainted(%s). Hexdump:\n",
3155 cachep->name, cachep->num, slabp, slabp->inuse,
3157 print_hex_dump(KERN_ERR, "", DUMP_PREFIX_OFFSET, 16, 1, slabp,
3158 sizeof(*slabp) + cachep->num * sizeof(kmem_bufctl_t),
3164 #define kfree_debugcheck(x) do { } while(0)
3165 #define cache_free_debugcheck(x,objp,z) (objp)
3166 #define check_slabp(x,y) do { } while(0)
3169 static void *cache_alloc_refill(struct kmem_cache *cachep, gfp_t flags,
3173 struct kmem_list3 *l3;
3174 struct array_cache *ac;
3178 node = numa_mem_id();
3179 if (unlikely(force_refill))
3182 ac = cpu_cache_get(cachep);
3183 batchcount = ac->batchcount;
3184 if (!ac->touched && batchcount > BATCHREFILL_LIMIT) {
3186 * If there was little recent activity on this cache, then
3187 * perform only a partial refill. Otherwise we could generate
3190 batchcount = BATCHREFILL_LIMIT;
3192 l3 = cachep->nodelists[node];
3194 BUG_ON(ac->avail > 0 || !l3);
3195 spin_lock(&l3->list_lock);
3197 /* See if we can refill from the shared array */
3198 if (l3->shared && transfer_objects(ac, l3->shared, batchcount)) {
3199 l3->shared->touched = 1;
3203 while (batchcount > 0) {
3204 struct list_head *entry;
3206 /* Get slab alloc is to come from. */
3207 entry = l3->slabs_partial.next;
3208 if (entry == &l3->slabs_partial) {
3209 l3->free_touched = 1;
3210 entry = l3->slabs_free.next;
3211 if (entry == &l3->slabs_free)
3215 slabp = list_entry(entry, struct slab, list);
3216 check_slabp(cachep, slabp);
3217 check_spinlock_acquired(cachep);
3220 * The slab was either on partial or free list so
3221 * there must be at least one object available for
3224 BUG_ON(slabp->inuse >= cachep->num);
3226 while (slabp->inuse < cachep->num && batchcount--) {
3227 STATS_INC_ALLOCED(cachep);
3228 STATS_INC_ACTIVE(cachep);
3229 STATS_SET_HIGH(cachep);
3231 ac_put_obj(cachep, ac, slab_get_obj(cachep, slabp,
3234 check_slabp(cachep, slabp);
3236 /* move slabp to correct slabp list: */
3237 list_del(&slabp->list);
3238 if (slabp->free == BUFCTL_END)
3239 list_add(&slabp->list, &l3->slabs_full);
3241 list_add(&slabp->list, &l3->slabs_partial);
3245 l3->free_objects -= ac->avail;
3247 spin_unlock(&l3->list_lock);
3249 if (unlikely(!ac->avail)) {
3252 x = cache_grow(cachep, flags | GFP_THISNODE, node, NULL);
3254 /* cache_grow can reenable interrupts, then ac could change. */
3255 ac = cpu_cache_get(cachep);
3257 /* no objects in sight? abort */
3258 if (!x && (ac->avail == 0 || force_refill))
3261 if (!ac->avail) /* objects refilled by interrupt? */
3266 return ac_get_obj(cachep, ac, flags, force_refill);
3269 static inline void cache_alloc_debugcheck_before(struct kmem_cache *cachep,
3272 might_sleep_if(flags & __GFP_WAIT);
3274 kmem_flagcheck(cachep, flags);
3279 static void *cache_alloc_debugcheck_after(struct kmem_cache *cachep,
3280 gfp_t flags, void *objp, void *caller)
3284 if (cachep->flags & SLAB_POISON) {
3285 #ifdef CONFIG_DEBUG_PAGEALLOC
3286 if ((cachep->size % PAGE_SIZE) == 0 && OFF_SLAB(cachep))
3287 kernel_map_pages(virt_to_page(objp),
3288 cachep->size / PAGE_SIZE, 1);
3290 check_poison_obj(cachep, objp);
3292 check_poison_obj(cachep, objp);
3294 poison_obj(cachep, objp, POISON_INUSE);
3296 if (cachep->flags & SLAB_STORE_USER)
3297 *dbg_userword(cachep, objp) = caller;
3299 if (cachep->flags & SLAB_RED_ZONE) {
3300 if (*dbg_redzone1(cachep, objp) != RED_INACTIVE ||
3301 *dbg_redzone2(cachep, objp) != RED_INACTIVE) {
3302 slab_error(cachep, "double free, or memory outside"
3303 " object was overwritten");
3305 "%p: redzone 1:0x%llx, redzone 2:0x%llx\n",
3306 objp, *dbg_redzone1(cachep, objp),
3307 *dbg_redzone2(cachep, objp));
3309 *dbg_redzone1(cachep, objp) = RED_ACTIVE;
3310 *dbg_redzone2(cachep, objp) = RED_ACTIVE;
3312 #ifdef CONFIG_DEBUG_SLAB_LEAK
3317 slabp = virt_to_head_page(objp)->slab_page;
3318 objnr = (unsigned)(objp - slabp->s_mem) / cachep->size;
3319 slab_bufctl(slabp)[objnr] = BUFCTL_ACTIVE;
3322 objp += obj_offset(cachep);
3323 if (cachep->ctor && cachep->flags & SLAB_POISON)
3325 if (ARCH_SLAB_MINALIGN &&
3326 ((unsigned long)objp & (ARCH_SLAB_MINALIGN-1))) {
3327 printk(KERN_ERR "0x%p: not aligned to ARCH_SLAB_MINALIGN=%d\n",
3328 objp, (int)ARCH_SLAB_MINALIGN);
3333 #define cache_alloc_debugcheck_after(a,b,objp,d) (objp)
3336 static bool slab_should_failslab(struct kmem_cache *cachep, gfp_t flags)
3338 if (cachep == &cache_cache)
3341 return should_failslab(cachep->object_size, flags, cachep->flags);
3344 static inline void *____cache_alloc(struct kmem_cache *cachep, gfp_t flags)
3347 struct array_cache *ac;
3348 bool force_refill = false;
3352 ac = cpu_cache_get(cachep);
3353 if (likely(ac->avail)) {
3355 objp = ac_get_obj(cachep, ac, flags, false);
3358 * Allow for the possibility all avail objects are not allowed
3359 * by the current flags
3362 STATS_INC_ALLOCHIT(cachep);
3365 force_refill = true;
3368 STATS_INC_ALLOCMISS(cachep);
3369 objp = cache_alloc_refill(cachep, flags, force_refill);
3371 * the 'ac' may be updated by cache_alloc_refill(),
3372 * and kmemleak_erase() requires its correct value.
3374 ac = cpu_cache_get(cachep);
3378 * To avoid a false negative, if an object that is in one of the
3379 * per-CPU caches is leaked, we need to make sure kmemleak doesn't
3380 * treat the array pointers as a reference to the object.
3383 kmemleak_erase(&ac->entry[ac->avail]);
3389 * Try allocating on another node if PF_SPREAD_SLAB|PF_MEMPOLICY.
3391 * If we are in_interrupt, then process context, including cpusets and
3392 * mempolicy, may not apply and should not be used for allocation policy.
3394 static void *alternate_node_alloc(struct kmem_cache *cachep, gfp_t flags)
3396 int nid_alloc, nid_here;
3398 if (in_interrupt() || (flags & __GFP_THISNODE))
3400 nid_alloc = nid_here = numa_mem_id();
3401 if (cpuset_do_slab_mem_spread() && (cachep->flags & SLAB_MEM_SPREAD))
3402 nid_alloc = cpuset_slab_spread_node();
3403 else if (current->mempolicy)
3404 nid_alloc = slab_node();
3405 if (nid_alloc != nid_here)
3406 return ____cache_alloc_node(cachep, flags, nid_alloc);
3411 * Fallback function if there was no memory available and no objects on a
3412 * certain node and fall back is permitted. First we scan all the
3413 * available nodelists for available objects. If that fails then we
3414 * perform an allocation without specifying a node. This allows the page
3415 * allocator to do its reclaim / fallback magic. We then insert the
3416 * slab into the proper nodelist and then allocate from it.
3418 static void *fallback_alloc(struct kmem_cache *cache, gfp_t flags)
3420 struct zonelist *zonelist;
3424 enum zone_type high_zoneidx = gfp_zone(flags);
3427 unsigned int cpuset_mems_cookie;
3429 if (flags & __GFP_THISNODE)
3432 local_flags = flags & (GFP_CONSTRAINT_MASK|GFP_RECLAIM_MASK);
3435 cpuset_mems_cookie = get_mems_allowed();
3436 zonelist = node_zonelist(slab_node(), flags);
3440 * Look through allowed nodes for objects available
3441 * from existing per node queues.
3443 for_each_zone_zonelist(zone, z, zonelist, high_zoneidx) {
3444 nid = zone_to_nid(zone);
3446 if (cpuset_zone_allowed_hardwall(zone, flags) &&
3447 cache->nodelists[nid] &&
3448 cache->nodelists[nid]->free_objects) {
3449 obj = ____cache_alloc_node(cache,
3450 flags | GFP_THISNODE, nid);
3458 * This allocation will be performed within the constraints
3459 * of the current cpuset / memory policy requirements.
3460 * We may trigger various forms of reclaim on the allowed
3461 * set and go into memory reserves if necessary.
3463 if (local_flags & __GFP_WAIT)
3465 kmem_flagcheck(cache, flags);
3466 obj = kmem_getpages(cache, local_flags, numa_mem_id());
3467 if (local_flags & __GFP_WAIT)
3468 local_irq_disable();
3471 * Insert into the appropriate per node queues
3473 nid = page_to_nid(virt_to_page(obj));
3474 if (cache_grow(cache, flags, nid, obj)) {
3475 obj = ____cache_alloc_node(cache,
3476 flags | GFP_THISNODE, nid);
3479 * Another processor may allocate the
3480 * objects in the slab since we are
3481 * not holding any locks.
3485 /* cache_grow already freed obj */
3491 if (unlikely(!put_mems_allowed(cpuset_mems_cookie) && !obj))
3497 * A interface to enable slab creation on nodeid
3499 static void *____cache_alloc_node(struct kmem_cache *cachep, gfp_t flags,
3502 struct list_head *entry;
3504 struct kmem_list3 *l3;
3508 l3 = cachep->nodelists[nodeid];
3513 spin_lock(&l3->list_lock);
3514 entry = l3->slabs_partial.next;
3515 if (entry == &l3->slabs_partial) {
3516 l3->free_touched = 1;
3517 entry = l3->slabs_free.next;
3518 if (entry == &l3->slabs_free)
3522 slabp = list_entry(entry, struct slab, list);
3523 check_spinlock_acquired_node(cachep, nodeid);
3524 check_slabp(cachep, slabp);
3526 STATS_INC_NODEALLOCS(cachep);
3527 STATS_INC_ACTIVE(cachep);
3528 STATS_SET_HIGH(cachep);
3530 BUG_ON(slabp->inuse == cachep->num);
3532 obj = slab_get_obj(cachep, slabp, nodeid);
3533 check_slabp(cachep, slabp);
3535 /* move slabp to correct slabp list: */
3536 list_del(&slabp->list);
3538 if (slabp->free == BUFCTL_END)
3539 list_add(&slabp->list, &l3->slabs_full);
3541 list_add(&slabp->list, &l3->slabs_partial);
3543 spin_unlock(&l3->list_lock);
3547 spin_unlock(&l3->list_lock);
3548 x = cache_grow(cachep, flags | GFP_THISNODE, nodeid, NULL);
3552 return fallback_alloc(cachep, flags);
3559 * kmem_cache_alloc_node - Allocate an object on the specified node
3560 * @cachep: The cache to allocate from.
3561 * @flags: See kmalloc().
3562 * @nodeid: node number of the target node.
3563 * @caller: return address of caller, used for debug information
3565 * Identical to kmem_cache_alloc but it will allocate memory on the given
3566 * node, which can improve the performance for cpu bound structures.
3568 * Fallback to other node is possible if __GFP_THISNODE is not set.
3570 static __always_inline void *
3571 __cache_alloc_node(struct kmem_cache *cachep, gfp_t flags, int nodeid,
3574 unsigned long save_flags;
3576 int slab_node = numa_mem_id();
3578 flags &= gfp_allowed_mask;
3580 lockdep_trace_alloc(flags);
3582 if (slab_should_failslab(cachep, flags))
3585 cache_alloc_debugcheck_before(cachep, flags);
3586 local_irq_save(save_flags);
3588 if (nodeid == NUMA_NO_NODE)
3591 if (unlikely(!cachep->nodelists[nodeid])) {
3592 /* Node not bootstrapped yet */
3593 ptr = fallback_alloc(cachep, flags);
3597 if (nodeid == slab_node) {
3599 * Use the locally cached objects if possible.
3600 * However ____cache_alloc does not allow fallback
3601 * to other nodes. It may fail while we still have
3602 * objects on other nodes available.
3604 ptr = ____cache_alloc(cachep, flags);
3608 /* ___cache_alloc_node can fall back to other nodes */
3609 ptr = ____cache_alloc_node(cachep, flags, nodeid);
3611 local_irq_restore(save_flags);
3612 ptr = cache_alloc_debugcheck_after(cachep, flags, ptr, caller);
3613 kmemleak_alloc_recursive(ptr, cachep->object_size, 1, cachep->flags,
3617 kmemcheck_slab_alloc(cachep, flags, ptr, cachep->object_size);
3619 if (unlikely((flags & __GFP_ZERO) && ptr))
3620 memset(ptr, 0, cachep->object_size);
3625 static __always_inline void *
3626 __do_cache_alloc(struct kmem_cache *cache, gfp_t flags)
3630 if (unlikely(current->flags & (PF_SPREAD_SLAB | PF_MEMPOLICY))) {
3631 objp = alternate_node_alloc(cache, flags);
3635 objp = ____cache_alloc(cache, flags);
3638 * We may just have run out of memory on the local node.
3639 * ____cache_alloc_node() knows how to locate memory on other nodes
3642 objp = ____cache_alloc_node(cache, flags, numa_mem_id());
3649 static __always_inline void *
3650 __do_cache_alloc(struct kmem_cache *cachep, gfp_t flags)
3652 return ____cache_alloc(cachep, flags);
3655 #endif /* CONFIG_NUMA */
3657 static __always_inline void *
3658 __cache_alloc(struct kmem_cache *cachep, gfp_t flags, void *caller)
3660 unsigned long save_flags;
3663 flags &= gfp_allowed_mask;
3665 lockdep_trace_alloc(flags);
3667 if (slab_should_failslab(cachep, flags))
3670 cache_alloc_debugcheck_before(cachep, flags);
3671 local_irq_save(save_flags);
3672 objp = __do_cache_alloc(cachep, flags);
3673 local_irq_restore(save_flags);
3674 objp = cache_alloc_debugcheck_after(cachep, flags, objp, caller);
3675 kmemleak_alloc_recursive(objp, cachep->object_size, 1, cachep->flags,
3680 kmemcheck_slab_alloc(cachep, flags, objp, cachep->object_size);
3682 if (unlikely((flags & __GFP_ZERO) && objp))
3683 memset(objp, 0, cachep->object_size);
3689 * Caller needs to acquire correct kmem_list's list_lock
3691 static void free_block(struct kmem_cache *cachep, void **objpp, int nr_objects,
3695 struct kmem_list3 *l3;
3697 for (i = 0; i < nr_objects; i++) {
3701 clear_obj_pfmemalloc(&objpp[i]);
3704 slabp = virt_to_slab(objp);
3705 l3 = cachep->nodelists[node];
3706 list_del(&slabp->list);
3707 check_spinlock_acquired_node(cachep, node);
3708 check_slabp(cachep, slabp);
3709 slab_put_obj(cachep, slabp, objp, node);
3710 STATS_DEC_ACTIVE(cachep);
3712 check_slabp(cachep, slabp);
3714 /* fixup slab chains */
3715 if (slabp->inuse == 0) {
3716 if (l3->free_objects > l3->free_limit) {
3717 l3->free_objects -= cachep->num;
3718 /* No need to drop any previously held
3719 * lock here, even if we have a off-slab slab
3720 * descriptor it is guaranteed to come from
3721 * a different cache, refer to comments before
3724 slab_destroy(cachep, slabp);
3726 list_add(&slabp->list, &l3->slabs_free);
3729 /* Unconditionally move a slab to the end of the
3730 * partial list on free - maximum time for the
3731 * other objects to be freed, too.
3733 list_add_tail(&slabp->list, &l3->slabs_partial);
3738 static void cache_flusharray(struct kmem_cache *cachep, struct array_cache *ac)
3741 struct kmem_list3 *l3;
3742 int node = numa_mem_id();
3744 batchcount = ac->batchcount;
3746 BUG_ON(!batchcount || batchcount > ac->avail);
3749 l3 = cachep->nodelists[node];
3750 spin_lock(&l3->list_lock);
3752 struct array_cache *shared_array = l3->shared;
3753 int max = shared_array->limit - shared_array->avail;
3755 if (batchcount > max)
3757 memcpy(&(shared_array->entry[shared_array->avail]),
3758 ac->entry, sizeof(void *) * batchcount);
3759 shared_array->avail += batchcount;
3764 free_block(cachep, ac->entry, batchcount, node);
3769 struct list_head *p;
3771 p = l3->slabs_free.next;
3772 while (p != &(l3->slabs_free)) {
3775 slabp = list_entry(p, struct slab, list);
3776 BUG_ON(slabp->inuse);
3781 STATS_SET_FREEABLE(cachep, i);
3784 spin_unlock(&l3->list_lock);
3785 ac->avail -= batchcount;
3786 memmove(ac->entry, &(ac->entry[batchcount]), sizeof(void *)*ac->avail);
3790 * Release an obj back to its cache. If the obj has a constructed state, it must
3791 * be in this state _before_ it is released. Called with disabled ints.
3793 static inline void __cache_free(struct kmem_cache *cachep, void *objp,
3796 struct array_cache *ac = cpu_cache_get(cachep);
3799 kmemleak_free_recursive(objp, cachep->flags);
3800 objp = cache_free_debugcheck(cachep, objp, caller);
3802 kmemcheck_slab_free(cachep, objp, cachep->object_size);
3805 * Skip calling cache_free_alien() when the platform is not numa.
3806 * This will avoid cache misses that happen while accessing slabp (which
3807 * is per page memory reference) to get nodeid. Instead use a global
3808 * variable to skip the call, which is mostly likely to be present in
3811 if (nr_online_nodes > 1 && cache_free_alien(cachep, objp))
3814 if (likely(ac->avail < ac->limit)) {
3815 STATS_INC_FREEHIT(cachep);
3817 STATS_INC_FREEMISS(cachep);
3818 cache_flusharray(cachep, ac);
3821 ac_put_obj(cachep, ac, objp);
3825 * kmem_cache_alloc - Allocate an object
3826 * @cachep: The cache to allocate from.
3827 * @flags: See kmalloc().
3829 * Allocate an object from this cache. The flags are only relevant
3830 * if the cache has no available objects.
3832 void *kmem_cache_alloc(struct kmem_cache *cachep, gfp_t flags)
3834 void *ret = __cache_alloc(cachep, flags, __builtin_return_address(0));
3836 trace_kmem_cache_alloc(_RET_IP_, ret,
3837 cachep->object_size, cachep->size, flags);
3841 EXPORT_SYMBOL(kmem_cache_alloc);
3843 #ifdef CONFIG_TRACING
3845 kmem_cache_alloc_trace(size_t size, struct kmem_cache *cachep, gfp_t flags)
3849 ret = __cache_alloc(cachep, flags, __builtin_return_address(0));
3851 trace_kmalloc(_RET_IP_, ret,
3852 size, slab_buffer_size(cachep), flags);
3855 EXPORT_SYMBOL(kmem_cache_alloc_trace);
3859 void *kmem_cache_alloc_node(struct kmem_cache *cachep, gfp_t flags, int nodeid)
3861 void *ret = __cache_alloc_node(cachep, flags, nodeid,
3862 __builtin_return_address(0));
3864 trace_kmem_cache_alloc_node(_RET_IP_, ret,
3865 cachep->object_size, cachep->size,
3870 EXPORT_SYMBOL(kmem_cache_alloc_node);
3872 #ifdef CONFIG_TRACING
3873 void *kmem_cache_alloc_node_trace(size_t size,
3874 struct kmem_cache *cachep,
3880 ret = __cache_alloc_node(cachep, flags, nodeid,
3881 __builtin_return_address(0));
3882 trace_kmalloc_node(_RET_IP_, ret,
3883 size, slab_buffer_size(cachep),
3887 EXPORT_SYMBOL(kmem_cache_alloc_node_trace);
3890 static __always_inline void *
3891 __do_kmalloc_node(size_t size, gfp_t flags, int node, void *caller)
3893 struct kmem_cache *cachep;
3895 cachep = kmem_find_general_cachep(size, flags);
3896 if (unlikely(ZERO_OR_NULL_PTR(cachep)))
3898 return kmem_cache_alloc_node_trace(size, cachep, flags, node);
3901 #if defined(CONFIG_DEBUG_SLAB) || defined(CONFIG_TRACING)
3902 void *__kmalloc_node(size_t size, gfp_t flags, int node)
3904 return __do_kmalloc_node(size, flags, node,
3905 __builtin_return_address(0));
3907 EXPORT_SYMBOL(__kmalloc_node);
3909 void *__kmalloc_node_track_caller(size_t size, gfp_t flags,
3910 int node, unsigned long caller)
3912 return __do_kmalloc_node(size, flags, node, (void *)caller);
3914 EXPORT_SYMBOL(__kmalloc_node_track_caller);
3916 void *__kmalloc_node(size_t size, gfp_t flags, int node)
3918 return __do_kmalloc_node(size, flags, node, NULL);
3920 EXPORT_SYMBOL(__kmalloc_node);
3921 #endif /* CONFIG_DEBUG_SLAB || CONFIG_TRACING */
3922 #endif /* CONFIG_NUMA */
3925 * __do_kmalloc - allocate memory
3926 * @size: how many bytes of memory are required.
3927 * @flags: the type of memory to allocate (see kmalloc).
3928 * @caller: function caller for debug tracking of the caller
3930 static __always_inline void *__do_kmalloc(size_t size, gfp_t flags,
3933 struct kmem_cache *cachep;
3936 /* If you want to save a few bytes .text space: replace
3938 * Then kmalloc uses the uninlined functions instead of the inline
3941 cachep = __find_general_cachep(size, flags);
3942 if (unlikely(ZERO_OR_NULL_PTR(cachep)))
3944 ret = __cache_alloc(cachep, flags, caller);
3946 trace_kmalloc((unsigned long) caller, ret,
3947 size, cachep->size, flags);
3953 #if defined(CONFIG_DEBUG_SLAB) || defined(CONFIG_TRACING)
3954 void *__kmalloc(size_t size, gfp_t flags)
3956 return __do_kmalloc(size, flags, __builtin_return_address(0));
3958 EXPORT_SYMBOL(__kmalloc);
3960 void *__kmalloc_track_caller(size_t size, gfp_t flags, unsigned long caller)
3962 return __do_kmalloc(size, flags, (void *)caller);
3964 EXPORT_SYMBOL(__kmalloc_track_caller);
3967 void *__kmalloc(size_t size, gfp_t flags)
3969 return __do_kmalloc(size, flags, NULL);
3971 EXPORT_SYMBOL(__kmalloc);
3975 * kmem_cache_free - Deallocate an object
3976 * @cachep: The cache the allocation was from.
3977 * @objp: The previously allocated object.
3979 * Free an object which was previously allocated from this
3982 void kmem_cache_free(struct kmem_cache *cachep, void *objp)
3984 unsigned long flags;
3986 local_irq_save(flags);
3987 debug_check_no_locks_freed(objp, cachep->object_size);
3988 if (!(cachep->flags & SLAB_DEBUG_OBJECTS))
3989 debug_check_no_obj_freed(objp, cachep->object_size);
3990 __cache_free(cachep, objp, __builtin_return_address(0));
3991 local_irq_restore(flags);
3993 trace_kmem_cache_free(_RET_IP_, objp);
3995 EXPORT_SYMBOL(kmem_cache_free);
3998 * kfree - free previously allocated memory
3999 * @objp: pointer returned by kmalloc.
4001 * If @objp is NULL, no operation is performed.
4003 * Don't free memory not originally allocated by kmalloc()
4004 * or you will run into trouble.
4006 void kfree(const void *objp)
4008 struct kmem_cache *c;
4009 unsigned long flags;
4011 trace_kfree(_RET_IP_, objp);
4013 if (unlikely(ZERO_OR_NULL_PTR(objp)))
4015 local_irq_save(flags);
4016 kfree_debugcheck(objp);
4017 c = virt_to_cache(objp);
4018 debug_check_no_locks_freed(objp, c->object_size);
4020 debug_check_no_obj_freed(objp, c->object_size);
4021 __cache_free(c, (void *)objp, __builtin_return_address(0));
4022 local_irq_restore(flags);
4024 EXPORT_SYMBOL(kfree);
4026 unsigned int kmem_cache_size(struct kmem_cache *cachep)
4028 return cachep->object_size;
4030 EXPORT_SYMBOL(kmem_cache_size);
4033 * This initializes kmem_list3 or resizes various caches for all nodes.
4035 static int alloc_kmemlist(struct kmem_cache *cachep, gfp_t gfp)
4038 struct kmem_list3 *l3;
4039 struct array_cache *new_shared;
4040 struct array_cache **new_alien = NULL;
4042 for_each_online_node(node) {
4044 if (use_alien_caches) {
4045 new_alien = alloc_alien_cache(node, cachep->limit, gfp);
4051 if (cachep->shared) {
4052 new_shared = alloc_arraycache(node,
4053 cachep->shared*cachep->batchcount,
4056 free_alien_cache(new_alien);
4061 l3 = cachep->nodelists[node];
4063 struct array_cache *shared = l3->shared;
4065 spin_lock_irq(&l3->list_lock);
4068 free_block(cachep, shared->entry,
4069 shared->avail, node);
4071 l3->shared = new_shared;
4073 l3->alien = new_alien;
4076 l3->free_limit = (1 + nr_cpus_node(node)) *
4077 cachep->batchcount + cachep->num;
4078 spin_unlock_irq(&l3->list_lock);
4080 free_alien_cache(new_alien);
4083 l3 = kmalloc_node(sizeof(struct kmem_list3), gfp, node);
4085 free_alien_cache(new_alien);
4090 kmem_list3_init(l3);
4091 l3->next_reap = jiffies + REAPTIMEOUT_LIST3 +
4092 ((unsigned long)cachep) % REAPTIMEOUT_LIST3;
4093 l3->shared = new_shared;
4094 l3->alien = new_alien;
4095 l3->free_limit = (1 + nr_cpus_node(node)) *
4096 cachep->batchcount + cachep->num;
4097 cachep->nodelists[node] = l3;
4102 if (!cachep->list.next) {
4103 /* Cache is not active yet. Roll back what we did */
4106 if (cachep->nodelists[node]) {
4107 l3 = cachep->nodelists[node];
4110 free_alien_cache(l3->alien);
4112 cachep->nodelists[node] = NULL;
4120 struct ccupdate_struct {
4121 struct kmem_cache *cachep;
4122 struct array_cache *new[0];
4125 static void do_ccupdate_local(void *info)
4127 struct ccupdate_struct *new = info;
4128 struct array_cache *old;
4131 old = cpu_cache_get(new->cachep);
4133 new->cachep->array[smp_processor_id()] = new->new[smp_processor_id()];
4134 new->new[smp_processor_id()] = old;
4137 /* Always called with the slab_mutex held */
4138 static int do_tune_cpucache(struct kmem_cache *cachep, int limit,
4139 int batchcount, int shared, gfp_t gfp)
4141 struct ccupdate_struct *new;
4144 new = kzalloc(sizeof(*new) + nr_cpu_ids * sizeof(struct array_cache *),
4149 for_each_online_cpu(i) {
4150 new->new[i] = alloc_arraycache(cpu_to_mem(i), limit,
4153 for (i--; i >= 0; i--)
4159 new->cachep = cachep;
4161 on_each_cpu(do_ccupdate_local, (void *)new, 1);
4164 cachep->batchcount = batchcount;
4165 cachep->limit = limit;
4166 cachep->shared = shared;
4168 for_each_online_cpu(i) {
4169 struct array_cache *ccold = new->new[i];
4172 spin_lock_irq(&cachep->nodelists[cpu_to_mem(i)]->list_lock);
4173 free_block(cachep, ccold->entry, ccold->avail, cpu_to_mem(i));
4174 spin_unlock_irq(&cachep->nodelists[cpu_to_mem(i)]->list_lock);
4178 return alloc_kmemlist(cachep, gfp);
4181 /* Called with slab_mutex held always */
4182 static int enable_cpucache(struct kmem_cache *cachep, gfp_t gfp)
4188 * The head array serves three purposes:
4189 * - create a LIFO ordering, i.e. return objects that are cache-warm
4190 * - reduce the number of spinlock operations.
4191 * - reduce the number of linked list operations on the slab and
4192 * bufctl chains: array operations are cheaper.
4193 * The numbers are guessed, we should auto-tune as described by
4196 if (cachep->size > 131072)
4198 else if (cachep->size > PAGE_SIZE)
4200 else if (cachep->size > 1024)
4202 else if (cachep->size > 256)
4208 * CPU bound tasks (e.g. network routing) can exhibit cpu bound
4209 * allocation behaviour: Most allocs on one cpu, most free operations
4210 * on another cpu. For these cases, an efficient object passing between
4211 * cpus is necessary. This is provided by a shared array. The array
4212 * replaces Bonwick's magazine layer.
4213 * On uniprocessor, it's functionally equivalent (but less efficient)
4214 * to a larger limit. Thus disabled by default.
4217 if (cachep->size <= PAGE_SIZE && num_possible_cpus() > 1)
4222 * With debugging enabled, large batchcount lead to excessively long
4223 * periods with disabled local interrupts. Limit the batchcount
4228 err = do_tune_cpucache(cachep, limit, (limit + 1) / 2, shared, gfp);
4230 printk(KERN_ERR "enable_cpucache failed for %s, error %d.\n",
4231 cachep->name, -err);
4236 * Drain an array if it contains any elements taking the l3 lock only if
4237 * necessary. Note that the l3 listlock also protects the array_cache
4238 * if drain_array() is used on the shared array.
4240 static void drain_array(struct kmem_cache *cachep, struct kmem_list3 *l3,
4241 struct array_cache *ac, int force, int node)
4245 if (!ac || !ac->avail)
4247 if (ac->touched && !force) {
4250 spin_lock_irq(&l3->list_lock);
4252 tofree = force ? ac->avail : (ac->limit + 4) / 5;
4253 if (tofree > ac->avail)
4254 tofree = (ac->avail + 1) / 2;
4255 free_block(cachep, ac->entry, tofree, node);
4256 ac->avail -= tofree;
4257 memmove(ac->entry, &(ac->entry[tofree]),
4258 sizeof(void *) * ac->avail);
4260 spin_unlock_irq(&l3->list_lock);
4265 * cache_reap - Reclaim memory from caches.
4266 * @w: work descriptor
4268 * Called from workqueue/eventd every few seconds.
4270 * - clear the per-cpu caches for this CPU.
4271 * - return freeable pages to the main free memory pool.
4273 * If we cannot acquire the cache chain mutex then just give up - we'll try
4274 * again on the next iteration.
4276 static void cache_reap(struct work_struct *w)
4278 struct kmem_cache *searchp;
4279 struct kmem_list3 *l3;
4280 int node = numa_mem_id();
4281 struct delayed_work *work = to_delayed_work(w);
4283 if (!mutex_trylock(&slab_mutex))
4284 /* Give up. Setup the next iteration. */
4287 list_for_each_entry(searchp, &slab_caches, list) {
4291 * We only take the l3 lock if absolutely necessary and we
4292 * have established with reasonable certainty that
4293 * we can do some work if the lock was obtained.
4295 l3 = searchp->nodelists[node];
4297 reap_alien(searchp, l3);
4299 drain_array(searchp, l3, cpu_cache_get(searchp), 0, node);
4302 * These are racy checks but it does not matter
4303 * if we skip one check or scan twice.
4305 if (time_after(l3->next_reap, jiffies))
4308 l3->next_reap = jiffies + REAPTIMEOUT_LIST3;
4310 drain_array(searchp, l3, l3->shared, 0, node);
4312 if (l3->free_touched)
4313 l3->free_touched = 0;
4317 freed = drain_freelist(searchp, l3, (l3->free_limit +
4318 5 * searchp->num - 1) / (5 * searchp->num));
4319 STATS_ADD_REAPED(searchp, freed);
4325 mutex_unlock(&slab_mutex);
4328 /* Set up the next iteration */
4329 schedule_delayed_work(work, round_jiffies_relative(REAPTIMEOUT_CPUC));
4332 #ifdef CONFIG_SLABINFO
4334 static void print_slabinfo_header(struct seq_file *m)
4337 * Output format version, so at least we can change it
4338 * without _too_ many complaints.
4341 seq_puts(m, "slabinfo - version: 2.1 (statistics)\n");
4343 seq_puts(m, "slabinfo - version: 2.1\n");
4345 seq_puts(m, "# name <active_objs> <num_objs> <objsize> "
4346 "<objperslab> <pagesperslab>");
4347 seq_puts(m, " : tunables <limit> <batchcount> <sharedfactor>");
4348 seq_puts(m, " : slabdata <active_slabs> <num_slabs> <sharedavail>");
4350 seq_puts(m, " : globalstat <listallocs> <maxobjs> <grown> <reaped> "
4351 "<error> <maxfreeable> <nodeallocs> <remotefrees> <alienoverflow>");
4352 seq_puts(m, " : cpustat <allochit> <allocmiss> <freehit> <freemiss>");
4357 static void *s_start(struct seq_file *m, loff_t *pos)
4361 mutex_lock(&slab_mutex);
4363 print_slabinfo_header(m);
4365 return seq_list_start(&slab_caches, *pos);
4368 static void *s_next(struct seq_file *m, void *p, loff_t *pos)
4370 return seq_list_next(p, &slab_caches, pos);
4373 static void s_stop(struct seq_file *m, void *p)
4375 mutex_unlock(&slab_mutex);
4378 static int s_show(struct seq_file *m, void *p)
4380 struct kmem_cache *cachep = list_entry(p, struct kmem_cache, list);
4382 unsigned long active_objs;
4383 unsigned long num_objs;
4384 unsigned long active_slabs = 0;
4385 unsigned long num_slabs, free_objects = 0, shared_avail = 0;
4389 struct kmem_list3 *l3;
4393 for_each_online_node(node) {
4394 l3 = cachep->nodelists[node];
4399 spin_lock_irq(&l3->list_lock);
4401 list_for_each_entry(slabp, &l3->slabs_full, list) {
4402 if (slabp->inuse != cachep->num && !error)
4403 error = "slabs_full accounting error";
4404 active_objs += cachep->num;
4407 list_for_each_entry(slabp, &l3->slabs_partial, list) {
4408 if (slabp->inuse == cachep->num && !error)
4409 error = "slabs_partial inuse accounting error";
4410 if (!slabp->inuse && !error)
4411 error = "slabs_partial/inuse accounting error";
4412 active_objs += slabp->inuse;
4415 list_for_each_entry(slabp, &l3->slabs_free, list) {
4416 if (slabp->inuse && !error)
4417 error = "slabs_free/inuse accounting error";
4420 free_objects += l3->free_objects;
4422 shared_avail += l3->shared->avail;
4424 spin_unlock_irq(&l3->list_lock);
4426 num_slabs += active_slabs;
4427 num_objs = num_slabs * cachep->num;
4428 if (num_objs - active_objs != free_objects && !error)
4429 error = "free_objects accounting error";
4431 name = cachep->name;
4433 printk(KERN_ERR "slab: cache %s error: %s\n", name, error);
4435 seq_printf(m, "%-17s %6lu %6lu %6u %4u %4d",
4436 name, active_objs, num_objs, cachep->size,
4437 cachep->num, (1 << cachep->gfporder));
4438 seq_printf(m, " : tunables %4u %4u %4u",
4439 cachep->limit, cachep->batchcount, cachep->shared);
4440 seq_printf(m, " : slabdata %6lu %6lu %6lu",
4441 active_slabs, num_slabs, shared_avail);
4444 unsigned long high = cachep->high_mark;
4445 unsigned long allocs = cachep->num_allocations;
4446 unsigned long grown = cachep->grown;
4447 unsigned long reaped = cachep->reaped;
4448 unsigned long errors = cachep->errors;
4449 unsigned long max_freeable = cachep->max_freeable;
4450 unsigned long node_allocs = cachep->node_allocs;
4451 unsigned long node_frees = cachep->node_frees;
4452 unsigned long overflows = cachep->node_overflow;
4454 seq_printf(m, " : globalstat %7lu %6lu %5lu %4lu "
4455 "%4lu %4lu %4lu %4lu %4lu",
4456 allocs, high, grown,
4457 reaped, errors, max_freeable, node_allocs,
4458 node_frees, overflows);
4462 unsigned long allochit = atomic_read(&cachep->allochit);
4463 unsigned long allocmiss = atomic_read(&cachep->allocmiss);
4464 unsigned long freehit = atomic_read(&cachep->freehit);
4465 unsigned long freemiss = atomic_read(&cachep->freemiss);
4467 seq_printf(m, " : cpustat %6lu %6lu %6lu %6lu",
4468 allochit, allocmiss, freehit, freemiss);
4476 * slabinfo_op - iterator that generates /proc/slabinfo
4485 * num-pages-per-slab
4486 * + further values on SMP and with statistics enabled
4489 static const struct seq_operations slabinfo_op = {
4496 #define MAX_SLABINFO_WRITE 128
4498 * slabinfo_write - Tuning for the slab allocator
4500 * @buffer: user buffer
4501 * @count: data length
4504 static ssize_t slabinfo_write(struct file *file, const char __user *buffer,
4505 size_t count, loff_t *ppos)
4507 char kbuf[MAX_SLABINFO_WRITE + 1], *tmp;
4508 int limit, batchcount, shared, res;
4509 struct kmem_cache *cachep;
4511 if (count > MAX_SLABINFO_WRITE)
4513 if (copy_from_user(&kbuf, buffer, count))
4515 kbuf[MAX_SLABINFO_WRITE] = '\0';
4517 tmp = strchr(kbuf, ' ');
4522 if (sscanf(tmp, " %d %d %d", &limit, &batchcount, &shared) != 3)
4525 /* Find the cache in the chain of caches. */
4526 mutex_lock(&slab_mutex);
4528 list_for_each_entry(cachep, &slab_caches, list) {
4529 if (!strcmp(cachep->name, kbuf)) {
4530 if (limit < 1 || batchcount < 1 ||
4531 batchcount > limit || shared < 0) {
4534 res = do_tune_cpucache(cachep, limit,
4541 mutex_unlock(&slab_mutex);
4547 static int slabinfo_open(struct inode *inode, struct file *file)
4549 return seq_open(file, &slabinfo_op);
4552 static const struct file_operations proc_slabinfo_operations = {
4553 .open = slabinfo_open,
4555 .write = slabinfo_write,
4556 .llseek = seq_lseek,
4557 .release = seq_release,
4560 #ifdef CONFIG_DEBUG_SLAB_LEAK
4562 static void *leaks_start(struct seq_file *m, loff_t *pos)
4564 mutex_lock(&slab_mutex);
4565 return seq_list_start(&slab_caches, *pos);
4568 static inline int add_caller(unsigned long *n, unsigned long v)
4578 unsigned long *q = p + 2 * i;
4592 memmove(p + 2, p, n[1] * 2 * sizeof(unsigned long) - ((void *)p - (void *)n));
4598 static void handle_slab(unsigned long *n, struct kmem_cache *c, struct slab *s)
4604 for (i = 0, p = s->s_mem; i < c->num; i++, p += c->size) {
4605 if (slab_bufctl(s)[i] != BUFCTL_ACTIVE)
4607 if (!add_caller(n, (unsigned long)*dbg_userword(c, p)))
4612 static void show_symbol(struct seq_file *m, unsigned long address)
4614 #ifdef CONFIG_KALLSYMS
4615 unsigned long offset, size;
4616 char modname[MODULE_NAME_LEN], name[KSYM_NAME_LEN];
4618 if (lookup_symbol_attrs(address, &size, &offset, modname, name) == 0) {
4619 seq_printf(m, "%s+%#lx/%#lx", name, offset, size);
4621 seq_printf(m, " [%s]", modname);
4625 seq_printf(m, "%p", (void *)address);
4628 static int leaks_show(struct seq_file *m, void *p)
4630 struct kmem_cache *cachep = list_entry(p, struct kmem_cache, list);
4632 struct kmem_list3 *l3;
4634 unsigned long *n = m->private;
4638 if (!(cachep->flags & SLAB_STORE_USER))
4640 if (!(cachep->flags & SLAB_RED_ZONE))
4643 /* OK, we can do it */
4647 for_each_online_node(node) {
4648 l3 = cachep->nodelists[node];
4653 spin_lock_irq(&l3->list_lock);
4655 list_for_each_entry(slabp, &l3->slabs_full, list)
4656 handle_slab(n, cachep, slabp);
4657 list_for_each_entry(slabp, &l3->slabs_partial, list)
4658 handle_slab(n, cachep, slabp);
4659 spin_unlock_irq(&l3->list_lock);
4661 name = cachep->name;
4663 /* Increase the buffer size */
4664 mutex_unlock(&slab_mutex);
4665 m->private = kzalloc(n[0] * 4 * sizeof(unsigned long), GFP_KERNEL);
4667 /* Too bad, we are really out */
4669 mutex_lock(&slab_mutex);
4672 *(unsigned long *)m->private = n[0] * 2;
4674 mutex_lock(&slab_mutex);
4675 /* Now make sure this entry will be retried */
4679 for (i = 0; i < n[1]; i++) {
4680 seq_printf(m, "%s: %lu ", name, n[2*i+3]);
4681 show_symbol(m, n[2*i+2]);
4688 static const struct seq_operations slabstats_op = {
4689 .start = leaks_start,
4695 static int slabstats_open(struct inode *inode, struct file *file)
4697 unsigned long *n = kzalloc(PAGE_SIZE, GFP_KERNEL);
4700 ret = seq_open(file, &slabstats_op);
4702 struct seq_file *m = file->private_data;
4703 *n = PAGE_SIZE / (2 * sizeof(unsigned long));
4712 static const struct file_operations proc_slabstats_operations = {
4713 .open = slabstats_open,
4715 .llseek = seq_lseek,
4716 .release = seq_release_private,
4720 static int __init slab_proc_init(void)
4722 proc_create("slabinfo",S_IWUSR|S_IRUSR,NULL,&proc_slabinfo_operations);
4723 #ifdef CONFIG_DEBUG_SLAB_LEAK
4724 proc_create("slab_allocators", 0, NULL, &proc_slabstats_operations);
4728 module_init(slab_proc_init);
4732 * ksize - get the actual amount of memory allocated for a given object
4733 * @objp: Pointer to the object
4735 * kmalloc may internally round up allocations and return more memory
4736 * than requested. ksize() can be used to determine the actual amount of
4737 * memory allocated. The caller may use this additional memory, even though
4738 * a smaller amount of memory was initially specified with the kmalloc call.
4739 * The caller must guarantee that objp points to a valid object previously
4740 * allocated with either kmalloc() or kmem_cache_alloc(). The object
4741 * must not be freed during the duration of the call.
4743 size_t ksize(const void *objp)
4746 if (unlikely(objp == ZERO_SIZE_PTR))
4749 return virt_to_cache(objp)->object_size;
4751 EXPORT_SYMBOL(ksize);