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;
168 * Bufctl's are used for linking objs within a slab
171 * This implementation relies on "struct page" for locating the cache &
172 * slab an object belongs to.
173 * This allows the bufctl structure to be small (one int), but limits
174 * the number of objects a slab (not a cache) can contain when off-slab
175 * bufctls are used. The limit is the size of the largest general cache
176 * that does not use off-slab slabs.
177 * For 32bit archs with 4 kB pages, is this 56.
178 * This is not serious, as it is only for large objects, when it is unwise
179 * to have too many per slab.
180 * Note: This limit can be raised by introducing a general cache whose size
181 * is less than 512 (PAGE_SIZE<<3), but greater than 256.
184 typedef unsigned int kmem_bufctl_t;
185 #define BUFCTL_END (((kmem_bufctl_t)(~0U))-0)
186 #define BUFCTL_FREE (((kmem_bufctl_t)(~0U))-1)
187 #define BUFCTL_ACTIVE (((kmem_bufctl_t)(~0U))-2)
188 #define SLAB_LIMIT (((kmem_bufctl_t)(~0U))-3)
193 * slab_destroy on a SLAB_DESTROY_BY_RCU cache uses this structure to
194 * arrange for kmem_freepages to be called via RCU. This is useful if
195 * we need to approach a kernel structure obliquely, from its address
196 * obtained without the usual locking. We can lock the structure to
197 * stabilize it and check it's still at the given address, only if we
198 * can be sure that the memory has not been meanwhile reused for some
199 * other kind of object (which our subsystem's lock might corrupt).
201 * rcu_read_lock before reading the address, then rcu_read_unlock after
202 * taking the spinlock within the structure expected at that address.
205 struct rcu_head head;
206 struct kmem_cache *cachep;
213 * Manages the objs in a slab. Placed either at the beginning of mem allocated
214 * for a slab, or allocated from an general cache.
215 * Slabs are chained into three list: fully used, partial, fully free slabs.
220 struct list_head list;
221 unsigned long colouroff;
222 void *s_mem; /* including colour offset */
223 unsigned int inuse; /* num of objs active in slab */
225 unsigned short nodeid;
227 struct slab_rcu __slab_cover_slab_rcu;
235 * - LIFO ordering, to hand out cache-warm objects from _alloc
236 * - reduce the number of linked list operations
237 * - reduce spinlock operations
239 * The limit is stored in the per-cpu structure to reduce the data cache
246 unsigned int batchcount;
247 unsigned int touched;
250 * Must have this definition in here for the proper
251 * alignment of array_cache. Also simplifies accessing
254 * Entries should not be directly dereferenced as
255 * entries belonging to slabs marked pfmemalloc will
256 * have the lower bits set SLAB_OBJ_PFMEMALLOC
260 #define SLAB_OBJ_PFMEMALLOC 1
261 static inline bool is_obj_pfmemalloc(void *objp)
263 return (unsigned long)objp & SLAB_OBJ_PFMEMALLOC;
266 static inline void set_obj_pfmemalloc(void **objp)
268 *objp = (void *)((unsigned long)*objp | SLAB_OBJ_PFMEMALLOC);
272 static inline void clear_obj_pfmemalloc(void **objp)
274 *objp = (void *)((unsigned long)*objp & ~SLAB_OBJ_PFMEMALLOC);
278 * bootstrap: The caches do not work without cpuarrays anymore, but the
279 * cpuarrays are allocated from the generic caches...
281 #define BOOT_CPUCACHE_ENTRIES 1
282 struct arraycache_init {
283 struct array_cache cache;
284 void *entries[BOOT_CPUCACHE_ENTRIES];
288 * The slab lists for all objects.
291 struct list_head slabs_partial; /* partial list first, better asm code */
292 struct list_head slabs_full;
293 struct list_head slabs_free;
294 unsigned long free_objects;
295 unsigned int free_limit;
296 unsigned int colour_next; /* Per-node cache coloring */
297 spinlock_t list_lock;
298 struct array_cache *shared; /* shared per node */
299 struct array_cache **alien; /* on other nodes */
300 unsigned long next_reap; /* updated without locking */
301 int free_touched; /* updated without locking */
305 * Need this for bootstrapping a per node allocator.
307 #define NUM_INIT_LISTS (3 * MAX_NUMNODES)
308 static struct kmem_list3 __initdata initkmem_list3[NUM_INIT_LISTS];
309 #define CACHE_CACHE 0
310 #define SIZE_AC MAX_NUMNODES
311 #define SIZE_L3 (2 * MAX_NUMNODES)
313 static int drain_freelist(struct kmem_cache *cache,
314 struct kmem_list3 *l3, int tofree);
315 static void free_block(struct kmem_cache *cachep, void **objpp, int len,
317 static int enable_cpucache(struct kmem_cache *cachep, gfp_t gfp);
318 static void cache_reap(struct work_struct *unused);
321 * This function must be completely optimized away if a constant is passed to
322 * it. Mostly the same as what is in linux/slab.h except it returns an index.
324 static __always_inline int index_of(const size_t size)
326 extern void __bad_size(void);
328 if (__builtin_constant_p(size)) {
336 #include <linux/kmalloc_sizes.h>
344 static int slab_early_init = 1;
346 #define INDEX_AC index_of(sizeof(struct arraycache_init))
347 #define INDEX_L3 index_of(sizeof(struct kmem_list3))
349 static void kmem_list3_init(struct kmem_list3 *parent)
351 INIT_LIST_HEAD(&parent->slabs_full);
352 INIT_LIST_HEAD(&parent->slabs_partial);
353 INIT_LIST_HEAD(&parent->slabs_free);
354 parent->shared = NULL;
355 parent->alien = NULL;
356 parent->colour_next = 0;
357 spin_lock_init(&parent->list_lock);
358 parent->free_objects = 0;
359 parent->free_touched = 0;
362 #define MAKE_LIST(cachep, listp, slab, nodeid) \
364 INIT_LIST_HEAD(listp); \
365 list_splice(&(cachep->nodelists[nodeid]->slab), listp); \
368 #define MAKE_ALL_LISTS(cachep, ptr, nodeid) \
370 MAKE_LIST((cachep), (&(ptr)->slabs_full), slabs_full, nodeid); \
371 MAKE_LIST((cachep), (&(ptr)->slabs_partial), slabs_partial, nodeid); \
372 MAKE_LIST((cachep), (&(ptr)->slabs_free), slabs_free, nodeid); \
375 #define CFLGS_OFF_SLAB (0x80000000UL)
376 #define OFF_SLAB(x) ((x)->flags & CFLGS_OFF_SLAB)
378 #define BATCHREFILL_LIMIT 16
380 * Optimization question: fewer reaps means less probability for unnessary
381 * cpucache drain/refill cycles.
383 * OTOH the cpuarrays can contain lots of objects,
384 * which could lock up otherwise freeable slabs.
386 #define REAPTIMEOUT_CPUC (2*HZ)
387 #define REAPTIMEOUT_LIST3 (4*HZ)
390 #define STATS_INC_ACTIVE(x) ((x)->num_active++)
391 #define STATS_DEC_ACTIVE(x) ((x)->num_active--)
392 #define STATS_INC_ALLOCED(x) ((x)->num_allocations++)
393 #define STATS_INC_GROWN(x) ((x)->grown++)
394 #define STATS_ADD_REAPED(x,y) ((x)->reaped += (y))
395 #define STATS_SET_HIGH(x) \
397 if ((x)->num_active > (x)->high_mark) \
398 (x)->high_mark = (x)->num_active; \
400 #define STATS_INC_ERR(x) ((x)->errors++)
401 #define STATS_INC_NODEALLOCS(x) ((x)->node_allocs++)
402 #define STATS_INC_NODEFREES(x) ((x)->node_frees++)
403 #define STATS_INC_ACOVERFLOW(x) ((x)->node_overflow++)
404 #define STATS_SET_FREEABLE(x, i) \
406 if ((x)->max_freeable < i) \
407 (x)->max_freeable = i; \
409 #define STATS_INC_ALLOCHIT(x) atomic_inc(&(x)->allochit)
410 #define STATS_INC_ALLOCMISS(x) atomic_inc(&(x)->allocmiss)
411 #define STATS_INC_FREEHIT(x) atomic_inc(&(x)->freehit)
412 #define STATS_INC_FREEMISS(x) atomic_inc(&(x)->freemiss)
414 #define STATS_INC_ACTIVE(x) do { } while (0)
415 #define STATS_DEC_ACTIVE(x) do { } while (0)
416 #define STATS_INC_ALLOCED(x) do { } while (0)
417 #define STATS_INC_GROWN(x) do { } while (0)
418 #define STATS_ADD_REAPED(x,y) do { (void)(y); } while (0)
419 #define STATS_SET_HIGH(x) do { } while (0)
420 #define STATS_INC_ERR(x) do { } while (0)
421 #define STATS_INC_NODEALLOCS(x) do { } while (0)
422 #define STATS_INC_NODEFREES(x) do { } while (0)
423 #define STATS_INC_ACOVERFLOW(x) do { } while (0)
424 #define STATS_SET_FREEABLE(x, i) do { } while (0)
425 #define STATS_INC_ALLOCHIT(x) do { } while (0)
426 #define STATS_INC_ALLOCMISS(x) do { } while (0)
427 #define STATS_INC_FREEHIT(x) do { } while (0)
428 #define STATS_INC_FREEMISS(x) do { } while (0)
434 * memory layout of objects:
436 * 0 .. cachep->obj_offset - BYTES_PER_WORD - 1: padding. This ensures that
437 * the end of an object is aligned with the end of the real
438 * allocation. Catches writes behind the end of the allocation.
439 * cachep->obj_offset - BYTES_PER_WORD .. cachep->obj_offset - 1:
441 * cachep->obj_offset: The real object.
442 * cachep->size - 2* BYTES_PER_WORD: redzone word [BYTES_PER_WORD long]
443 * cachep->size - 1* BYTES_PER_WORD: last caller address
444 * [BYTES_PER_WORD long]
446 static int obj_offset(struct kmem_cache *cachep)
448 return cachep->obj_offset;
451 static unsigned long long *dbg_redzone1(struct kmem_cache *cachep, void *objp)
453 BUG_ON(!(cachep->flags & SLAB_RED_ZONE));
454 return (unsigned long long*) (objp + obj_offset(cachep) -
455 sizeof(unsigned long long));
458 static unsigned long long *dbg_redzone2(struct kmem_cache *cachep, void *objp)
460 BUG_ON(!(cachep->flags & SLAB_RED_ZONE));
461 if (cachep->flags & SLAB_STORE_USER)
462 return (unsigned long long *)(objp + cachep->size -
463 sizeof(unsigned long long) -
465 return (unsigned long long *) (objp + cachep->size -
466 sizeof(unsigned long long));
469 static void **dbg_userword(struct kmem_cache *cachep, void *objp)
471 BUG_ON(!(cachep->flags & SLAB_STORE_USER));
472 return (void **)(objp + cachep->size - BYTES_PER_WORD);
477 #define obj_offset(x) 0
478 #define dbg_redzone1(cachep, objp) ({BUG(); (unsigned long long *)NULL;})
479 #define dbg_redzone2(cachep, objp) ({BUG(); (unsigned long long *)NULL;})
480 #define dbg_userword(cachep, objp) ({BUG(); (void **)NULL;})
485 * Do not go above this order unless 0 objects fit into the slab or
486 * overridden on the command line.
488 #define SLAB_MAX_ORDER_HI 1
489 #define SLAB_MAX_ORDER_LO 0
490 static int slab_max_order = SLAB_MAX_ORDER_LO;
491 static bool slab_max_order_set __initdata;
493 static inline struct kmem_cache *virt_to_cache(const void *obj)
495 struct page *page = virt_to_head_page(obj);
496 return page->slab_cache;
499 static inline struct slab *virt_to_slab(const void *obj)
501 struct page *page = virt_to_head_page(obj);
503 VM_BUG_ON(!PageSlab(page));
504 return page->slab_page;
507 static inline void *index_to_obj(struct kmem_cache *cache, struct slab *slab,
510 return slab->s_mem + cache->size * idx;
514 * We want to avoid an expensive divide : (offset / cache->size)
515 * Using the fact that size is a constant for a particular cache,
516 * we can replace (offset / cache->size) by
517 * reciprocal_divide(offset, cache->reciprocal_buffer_size)
519 static inline unsigned int obj_to_index(const struct kmem_cache *cache,
520 const struct slab *slab, void *obj)
522 u32 offset = (obj - slab->s_mem);
523 return reciprocal_divide(offset, cache->reciprocal_buffer_size);
527 * These are the default caches for kmalloc. Custom caches can have other sizes.
529 struct cache_sizes malloc_sizes[] = {
530 #define CACHE(x) { .cs_size = (x) },
531 #include <linux/kmalloc_sizes.h>
535 EXPORT_SYMBOL(malloc_sizes);
537 /* Must match cache_sizes above. Out of line to keep cache footprint low. */
543 static struct cache_names __initdata cache_names[] = {
544 #define CACHE(x) { .name = "size-" #x, .name_dma = "size-" #x "(DMA)" },
545 #include <linux/kmalloc_sizes.h>
550 static struct arraycache_init initarray_cache __initdata =
551 { {0, BOOT_CPUCACHE_ENTRIES, 1, 0} };
552 static struct arraycache_init initarray_generic =
553 { {0, BOOT_CPUCACHE_ENTRIES, 1, 0} };
555 /* internal cache of cache description objs */
556 static struct kmem_cache kmem_cache_boot = {
558 .limit = BOOT_CPUCACHE_ENTRIES,
560 .size = sizeof(struct kmem_cache),
561 .name = "kmem_cache",
564 #define BAD_ALIEN_MAGIC 0x01020304ul
566 #ifdef CONFIG_LOCKDEP
569 * Slab sometimes uses the kmalloc slabs to store the slab headers
570 * for other slabs "off slab".
571 * The locking for this is tricky in that it nests within the locks
572 * of all other slabs in a few places; to deal with this special
573 * locking we put on-slab caches into a separate lock-class.
575 * We set lock class for alien array caches which are up during init.
576 * The lock annotation will be lost if all cpus of a node goes down and
577 * then comes back up during hotplug
579 static struct lock_class_key on_slab_l3_key;
580 static struct lock_class_key on_slab_alc_key;
582 static struct lock_class_key debugobj_l3_key;
583 static struct lock_class_key debugobj_alc_key;
585 static void slab_set_lock_classes(struct kmem_cache *cachep,
586 struct lock_class_key *l3_key, struct lock_class_key *alc_key,
589 struct array_cache **alc;
590 struct kmem_list3 *l3;
593 l3 = cachep->nodelists[q];
597 lockdep_set_class(&l3->list_lock, l3_key);
600 * FIXME: This check for BAD_ALIEN_MAGIC
601 * should go away when common slab code is taught to
602 * work even without alien caches.
603 * Currently, non NUMA code returns BAD_ALIEN_MAGIC
604 * for alloc_alien_cache,
606 if (!alc || (unsigned long)alc == BAD_ALIEN_MAGIC)
610 lockdep_set_class(&alc[r]->lock, alc_key);
614 static void slab_set_debugobj_lock_classes_node(struct kmem_cache *cachep, int node)
616 slab_set_lock_classes(cachep, &debugobj_l3_key, &debugobj_alc_key, node);
619 static void slab_set_debugobj_lock_classes(struct kmem_cache *cachep)
623 for_each_online_node(node)
624 slab_set_debugobj_lock_classes_node(cachep, node);
627 static void init_node_lock_keys(int q)
629 struct cache_sizes *s = malloc_sizes;
634 for (s = malloc_sizes; s->cs_size != ULONG_MAX; s++) {
635 struct kmem_list3 *l3;
637 l3 = s->cs_cachep->nodelists[q];
638 if (!l3 || OFF_SLAB(s->cs_cachep))
641 slab_set_lock_classes(s->cs_cachep, &on_slab_l3_key,
642 &on_slab_alc_key, q);
646 static inline void init_lock_keys(void)
651 init_node_lock_keys(node);
654 static void init_node_lock_keys(int q)
658 static inline void init_lock_keys(void)
662 static void slab_set_debugobj_lock_classes_node(struct kmem_cache *cachep, int node)
666 static void slab_set_debugobj_lock_classes(struct kmem_cache *cachep)
671 static DEFINE_PER_CPU(struct delayed_work, slab_reap_work);
673 static inline struct array_cache *cpu_cache_get(struct kmem_cache *cachep)
675 return cachep->array[smp_processor_id()];
678 static inline struct kmem_cache *__find_general_cachep(size_t size,
681 struct cache_sizes *csizep = malloc_sizes;
684 /* This happens if someone tries to call
685 * kmem_cache_create(), or __kmalloc(), before
686 * the generic caches are initialized.
688 BUG_ON(malloc_sizes[INDEX_AC].cs_cachep == NULL);
691 return ZERO_SIZE_PTR;
693 while (size > csizep->cs_size)
697 * Really subtle: The last entry with cs->cs_size==ULONG_MAX
698 * has cs_{dma,}cachep==NULL. Thus no special case
699 * for large kmalloc calls required.
701 #ifdef CONFIG_ZONE_DMA
702 if (unlikely(gfpflags & GFP_DMA))
703 return csizep->cs_dmacachep;
705 return csizep->cs_cachep;
708 static struct kmem_cache *kmem_find_general_cachep(size_t size, gfp_t gfpflags)
710 return __find_general_cachep(size, gfpflags);
713 static size_t slab_mgmt_size(size_t nr_objs, size_t align)
715 return ALIGN(sizeof(struct slab)+nr_objs*sizeof(kmem_bufctl_t), align);
719 * Calculate the number of objects and left-over bytes for a given buffer size.
721 static void cache_estimate(unsigned long gfporder, size_t buffer_size,
722 size_t align, int flags, size_t *left_over,
727 size_t slab_size = PAGE_SIZE << gfporder;
730 * The slab management structure can be either off the slab or
731 * on it. For the latter case, the memory allocated for a
735 * - One kmem_bufctl_t for each object
736 * - Padding to respect alignment of @align
737 * - @buffer_size bytes for each object
739 * If the slab management structure is off the slab, then the
740 * alignment will already be calculated into the size. Because
741 * the slabs are all pages aligned, the objects will be at the
742 * correct alignment when allocated.
744 if (flags & CFLGS_OFF_SLAB) {
746 nr_objs = slab_size / buffer_size;
748 if (nr_objs > SLAB_LIMIT)
749 nr_objs = SLAB_LIMIT;
752 * Ignore padding for the initial guess. The padding
753 * is at most @align-1 bytes, and @buffer_size is at
754 * least @align. In the worst case, this result will
755 * be one greater than the number of objects that fit
756 * into the memory allocation when taking the padding
759 nr_objs = (slab_size - sizeof(struct slab)) /
760 (buffer_size + sizeof(kmem_bufctl_t));
763 * This calculated number will be either the right
764 * amount, or one greater than what we want.
766 if (slab_mgmt_size(nr_objs, align) + nr_objs*buffer_size
770 if (nr_objs > SLAB_LIMIT)
771 nr_objs = SLAB_LIMIT;
773 mgmt_size = slab_mgmt_size(nr_objs, align);
776 *left_over = slab_size - nr_objs*buffer_size - mgmt_size;
780 #define slab_error(cachep, msg) __slab_error(__func__, cachep, msg)
782 static void __slab_error(const char *function, struct kmem_cache *cachep,
785 printk(KERN_ERR "slab error in %s(): cache `%s': %s\n",
786 function, cachep->name, msg);
788 add_taint(TAINT_BAD_PAGE);
793 * By default on NUMA we use alien caches to stage the freeing of
794 * objects allocated from other nodes. This causes massive memory
795 * inefficiencies when using fake NUMA setup to split memory into a
796 * large number of small nodes, so it can be disabled on the command
800 static int use_alien_caches __read_mostly = 1;
801 static int __init noaliencache_setup(char *s)
803 use_alien_caches = 0;
806 __setup("noaliencache", noaliencache_setup);
808 static int __init slab_max_order_setup(char *str)
810 get_option(&str, &slab_max_order);
811 slab_max_order = slab_max_order < 0 ? 0 :
812 min(slab_max_order, MAX_ORDER - 1);
813 slab_max_order_set = true;
817 __setup("slab_max_order=", slab_max_order_setup);
821 * Special reaping functions for NUMA systems called from cache_reap().
822 * These take care of doing round robin flushing of alien caches (containing
823 * objects freed on different nodes from which they were allocated) and the
824 * flushing of remote pcps by calling drain_node_pages.
826 static DEFINE_PER_CPU(unsigned long, slab_reap_node);
828 static void init_reap_node(int cpu)
832 node = next_node(cpu_to_mem(cpu), node_online_map);
833 if (node == MAX_NUMNODES)
834 node = first_node(node_online_map);
836 per_cpu(slab_reap_node, cpu) = node;
839 static void next_reap_node(void)
841 int node = __this_cpu_read(slab_reap_node);
843 node = next_node(node, node_online_map);
844 if (unlikely(node >= MAX_NUMNODES))
845 node = first_node(node_online_map);
846 __this_cpu_write(slab_reap_node, node);
850 #define init_reap_node(cpu) do { } while (0)
851 #define next_reap_node(void) do { } while (0)
855 * Initiate the reap timer running on the target CPU. We run at around 1 to 2Hz
856 * via the workqueue/eventd.
857 * Add the CPU number into the expiration time to minimize the possibility of
858 * the CPUs getting into lockstep and contending for the global cache chain
861 static void __cpuinit start_cpu_timer(int cpu)
863 struct delayed_work *reap_work = &per_cpu(slab_reap_work, cpu);
866 * When this gets called from do_initcalls via cpucache_init(),
867 * init_workqueues() has already run, so keventd will be setup
870 if (keventd_up() && reap_work->work.func == NULL) {
872 INIT_DEFERRABLE_WORK(reap_work, cache_reap);
873 schedule_delayed_work_on(cpu, reap_work,
874 __round_jiffies_relative(HZ, cpu));
878 static struct array_cache *alloc_arraycache(int node, int entries,
879 int batchcount, gfp_t gfp)
881 int memsize = sizeof(void *) * entries + sizeof(struct array_cache);
882 struct array_cache *nc = NULL;
884 nc = kmalloc_node(memsize, gfp, node);
886 * The array_cache structures contain pointers to free object.
887 * However, when such objects are allocated or transferred to another
888 * cache the pointers are not cleared and they could be counted as
889 * valid references during a kmemleak scan. Therefore, kmemleak must
890 * not scan such objects.
892 kmemleak_no_scan(nc);
896 nc->batchcount = batchcount;
898 spin_lock_init(&nc->lock);
903 static inline bool is_slab_pfmemalloc(struct slab *slabp)
905 struct page *page = virt_to_page(slabp->s_mem);
907 return PageSlabPfmemalloc(page);
910 /* Clears pfmemalloc_active if no slabs have pfmalloc set */
911 static void recheck_pfmemalloc_active(struct kmem_cache *cachep,
912 struct array_cache *ac)
914 struct kmem_list3 *l3 = cachep->nodelists[numa_mem_id()];
918 if (!pfmemalloc_active)
921 spin_lock_irqsave(&l3->list_lock, flags);
922 list_for_each_entry(slabp, &l3->slabs_full, list)
923 if (is_slab_pfmemalloc(slabp))
926 list_for_each_entry(slabp, &l3->slabs_partial, list)
927 if (is_slab_pfmemalloc(slabp))
930 list_for_each_entry(slabp, &l3->slabs_free, list)
931 if (is_slab_pfmemalloc(slabp))
934 pfmemalloc_active = false;
936 spin_unlock_irqrestore(&l3->list_lock, flags);
939 static void *__ac_get_obj(struct kmem_cache *cachep, struct array_cache *ac,
940 gfp_t flags, bool force_refill)
943 void *objp = ac->entry[--ac->avail];
945 /* Ensure the caller is allowed to use objects from PFMEMALLOC slab */
946 if (unlikely(is_obj_pfmemalloc(objp))) {
947 struct kmem_list3 *l3;
949 if (gfp_pfmemalloc_allowed(flags)) {
950 clear_obj_pfmemalloc(&objp);
954 /* The caller cannot use PFMEMALLOC objects, find another one */
955 for (i = 0; i < ac->avail; i++) {
956 /* If a !PFMEMALLOC object is found, swap them */
957 if (!is_obj_pfmemalloc(ac->entry[i])) {
959 ac->entry[i] = ac->entry[ac->avail];
960 ac->entry[ac->avail] = objp;
966 * If there are empty slabs on the slabs_free list and we are
967 * being forced to refill the cache, mark this one !pfmemalloc.
969 l3 = cachep->nodelists[numa_mem_id()];
970 if (!list_empty(&l3->slabs_free) && force_refill) {
971 struct slab *slabp = virt_to_slab(objp);
972 ClearPageSlabPfmemalloc(virt_to_head_page(slabp->s_mem));
973 clear_obj_pfmemalloc(&objp);
974 recheck_pfmemalloc_active(cachep, ac);
978 /* No !PFMEMALLOC objects available */
986 static inline void *ac_get_obj(struct kmem_cache *cachep,
987 struct array_cache *ac, gfp_t flags, bool force_refill)
991 if (unlikely(sk_memalloc_socks()))
992 objp = __ac_get_obj(cachep, ac, flags, force_refill);
994 objp = ac->entry[--ac->avail];
999 static void *__ac_put_obj(struct kmem_cache *cachep, struct array_cache *ac,
1002 if (unlikely(pfmemalloc_active)) {
1003 /* Some pfmemalloc slabs exist, check if this is one */
1004 struct page *page = virt_to_head_page(objp);
1005 if (PageSlabPfmemalloc(page))
1006 set_obj_pfmemalloc(&objp);
1012 static inline void ac_put_obj(struct kmem_cache *cachep, struct array_cache *ac,
1015 if (unlikely(sk_memalloc_socks()))
1016 objp = __ac_put_obj(cachep, ac, objp);
1018 ac->entry[ac->avail++] = objp;
1022 * Transfer objects in one arraycache to another.
1023 * Locking must be handled by the caller.
1025 * Return the number of entries transferred.
1027 static int transfer_objects(struct array_cache *to,
1028 struct array_cache *from, unsigned int max)
1030 /* Figure out how many entries to transfer */
1031 int nr = min3(from->avail, max, to->limit - to->avail);
1036 memcpy(to->entry + to->avail, from->entry + from->avail -nr,
1037 sizeof(void *) *nr);
1046 #define drain_alien_cache(cachep, alien) do { } while (0)
1047 #define reap_alien(cachep, l3) do { } while (0)
1049 static inline struct array_cache **alloc_alien_cache(int node, int limit, gfp_t gfp)
1051 return (struct array_cache **)BAD_ALIEN_MAGIC;
1054 static inline void free_alien_cache(struct array_cache **ac_ptr)
1058 static inline int cache_free_alien(struct kmem_cache *cachep, void *objp)
1063 static inline void *alternate_node_alloc(struct kmem_cache *cachep,
1069 static inline void *____cache_alloc_node(struct kmem_cache *cachep,
1070 gfp_t flags, int nodeid)
1075 #else /* CONFIG_NUMA */
1077 static void *____cache_alloc_node(struct kmem_cache *, gfp_t, int);
1078 static void *alternate_node_alloc(struct kmem_cache *, gfp_t);
1080 static struct array_cache **alloc_alien_cache(int node, int limit, gfp_t gfp)
1082 struct array_cache **ac_ptr;
1083 int memsize = sizeof(void *) * nr_node_ids;
1088 ac_ptr = kzalloc_node(memsize, gfp, node);
1091 if (i == node || !node_online(i))
1093 ac_ptr[i] = alloc_arraycache(node, limit, 0xbaadf00d, gfp);
1095 for (i--; i >= 0; i--)
1105 static void free_alien_cache(struct array_cache **ac_ptr)
1116 static void __drain_alien_cache(struct kmem_cache *cachep,
1117 struct array_cache *ac, int node)
1119 struct kmem_list3 *rl3 = cachep->nodelists[node];
1122 spin_lock(&rl3->list_lock);
1124 * Stuff objects into the remote nodes shared array first.
1125 * That way we could avoid the overhead of putting the objects
1126 * into the free lists and getting them back later.
1129 transfer_objects(rl3->shared, ac, ac->limit);
1131 free_block(cachep, ac->entry, ac->avail, node);
1133 spin_unlock(&rl3->list_lock);
1138 * Called from cache_reap() to regularly drain alien caches round robin.
1140 static void reap_alien(struct kmem_cache *cachep, struct kmem_list3 *l3)
1142 int node = __this_cpu_read(slab_reap_node);
1145 struct array_cache *ac = l3->alien[node];
1147 if (ac && ac->avail && spin_trylock_irq(&ac->lock)) {
1148 __drain_alien_cache(cachep, ac, node);
1149 spin_unlock_irq(&ac->lock);
1154 static void drain_alien_cache(struct kmem_cache *cachep,
1155 struct array_cache **alien)
1158 struct array_cache *ac;
1159 unsigned long flags;
1161 for_each_online_node(i) {
1164 spin_lock_irqsave(&ac->lock, flags);
1165 __drain_alien_cache(cachep, ac, i);
1166 spin_unlock_irqrestore(&ac->lock, flags);
1171 static inline int cache_free_alien(struct kmem_cache *cachep, void *objp)
1173 struct slab *slabp = virt_to_slab(objp);
1174 int nodeid = slabp->nodeid;
1175 struct kmem_list3 *l3;
1176 struct array_cache *alien = NULL;
1179 node = numa_mem_id();
1182 * Make sure we are not freeing a object from another node to the array
1183 * cache on this cpu.
1185 if (likely(slabp->nodeid == node))
1188 l3 = cachep->nodelists[node];
1189 STATS_INC_NODEFREES(cachep);
1190 if (l3->alien && l3->alien[nodeid]) {
1191 alien = l3->alien[nodeid];
1192 spin_lock(&alien->lock);
1193 if (unlikely(alien->avail == alien->limit)) {
1194 STATS_INC_ACOVERFLOW(cachep);
1195 __drain_alien_cache(cachep, alien, nodeid);
1197 ac_put_obj(cachep, alien, objp);
1198 spin_unlock(&alien->lock);
1200 spin_lock(&(cachep->nodelists[nodeid])->list_lock);
1201 free_block(cachep, &objp, 1, nodeid);
1202 spin_unlock(&(cachep->nodelists[nodeid])->list_lock);
1209 * Allocates and initializes nodelists for a node on each slab cache, used for
1210 * either memory or cpu hotplug. If memory is being hot-added, the kmem_list3
1211 * will be allocated off-node since memory is not yet online for the new node.
1212 * When hotplugging memory or a cpu, existing nodelists are not replaced if
1215 * Must hold slab_mutex.
1217 static int init_cache_nodelists_node(int node)
1219 struct kmem_cache *cachep;
1220 struct kmem_list3 *l3;
1221 const int memsize = sizeof(struct kmem_list3);
1223 list_for_each_entry(cachep, &slab_caches, list) {
1225 * Set up the size64 kmemlist for cpu before we can
1226 * begin anything. Make sure some other cpu on this
1227 * node has not already allocated this
1229 if (!cachep->nodelists[node]) {
1230 l3 = kmalloc_node(memsize, GFP_KERNEL, node);
1233 kmem_list3_init(l3);
1234 l3->next_reap = jiffies + REAPTIMEOUT_LIST3 +
1235 ((unsigned long)cachep) % REAPTIMEOUT_LIST3;
1238 * The l3s don't come and go as CPUs come and
1239 * go. slab_mutex is sufficient
1242 cachep->nodelists[node] = l3;
1245 spin_lock_irq(&cachep->nodelists[node]->list_lock);
1246 cachep->nodelists[node]->free_limit =
1247 (1 + nr_cpus_node(node)) *
1248 cachep->batchcount + cachep->num;
1249 spin_unlock_irq(&cachep->nodelists[node]->list_lock);
1254 static void __cpuinit cpuup_canceled(long cpu)
1256 struct kmem_cache *cachep;
1257 struct kmem_list3 *l3 = NULL;
1258 int node = cpu_to_mem(cpu);
1259 const struct cpumask *mask = cpumask_of_node(node);
1261 list_for_each_entry(cachep, &slab_caches, list) {
1262 struct array_cache *nc;
1263 struct array_cache *shared;
1264 struct array_cache **alien;
1266 /* cpu is dead; no one can alloc from it. */
1267 nc = cachep->array[cpu];
1268 cachep->array[cpu] = NULL;
1269 l3 = cachep->nodelists[node];
1272 goto free_array_cache;
1274 spin_lock_irq(&l3->list_lock);
1276 /* Free limit for this kmem_list3 */
1277 l3->free_limit -= cachep->batchcount;
1279 free_block(cachep, nc->entry, nc->avail, node);
1281 if (!cpumask_empty(mask)) {
1282 spin_unlock_irq(&l3->list_lock);
1283 goto free_array_cache;
1286 shared = l3->shared;
1288 free_block(cachep, shared->entry,
1289 shared->avail, node);
1296 spin_unlock_irq(&l3->list_lock);
1300 drain_alien_cache(cachep, alien);
1301 free_alien_cache(alien);
1307 * In the previous loop, all the objects were freed to
1308 * the respective cache's slabs, now we can go ahead and
1309 * shrink each nodelist to its limit.
1311 list_for_each_entry(cachep, &slab_caches, list) {
1312 l3 = cachep->nodelists[node];
1315 drain_freelist(cachep, l3, l3->free_objects);
1319 static int __cpuinit cpuup_prepare(long cpu)
1321 struct kmem_cache *cachep;
1322 struct kmem_list3 *l3 = NULL;
1323 int node = cpu_to_mem(cpu);
1327 * We need to do this right in the beginning since
1328 * alloc_arraycache's are going to use this list.
1329 * kmalloc_node allows us to add the slab to the right
1330 * kmem_list3 and not this cpu's kmem_list3
1332 err = init_cache_nodelists_node(node);
1337 * Now we can go ahead with allocating the shared arrays and
1340 list_for_each_entry(cachep, &slab_caches, list) {
1341 struct array_cache *nc;
1342 struct array_cache *shared = NULL;
1343 struct array_cache **alien = NULL;
1345 nc = alloc_arraycache(node, cachep->limit,
1346 cachep->batchcount, GFP_KERNEL);
1349 if (cachep->shared) {
1350 shared = alloc_arraycache(node,
1351 cachep->shared * cachep->batchcount,
1352 0xbaadf00d, GFP_KERNEL);
1358 if (use_alien_caches) {
1359 alien = alloc_alien_cache(node, cachep->limit, GFP_KERNEL);
1366 cachep->array[cpu] = nc;
1367 l3 = cachep->nodelists[node];
1370 spin_lock_irq(&l3->list_lock);
1373 * We are serialised from CPU_DEAD or
1374 * CPU_UP_CANCELLED by the cpucontrol lock
1376 l3->shared = shared;
1385 spin_unlock_irq(&l3->list_lock);
1387 free_alien_cache(alien);
1388 if (cachep->flags & SLAB_DEBUG_OBJECTS)
1389 slab_set_debugobj_lock_classes_node(cachep, node);
1391 init_node_lock_keys(node);
1395 cpuup_canceled(cpu);
1399 static int __cpuinit cpuup_callback(struct notifier_block *nfb,
1400 unsigned long action, void *hcpu)
1402 long cpu = (long)hcpu;
1406 case CPU_UP_PREPARE:
1407 case CPU_UP_PREPARE_FROZEN:
1408 mutex_lock(&slab_mutex);
1409 err = cpuup_prepare(cpu);
1410 mutex_unlock(&slab_mutex);
1413 case CPU_ONLINE_FROZEN:
1414 start_cpu_timer(cpu);
1416 #ifdef CONFIG_HOTPLUG_CPU
1417 case CPU_DOWN_PREPARE:
1418 case CPU_DOWN_PREPARE_FROZEN:
1420 * Shutdown cache reaper. Note that the slab_mutex is
1421 * held so that if cache_reap() is invoked it cannot do
1422 * anything expensive but will only modify reap_work
1423 * and reschedule the timer.
1425 cancel_delayed_work_sync(&per_cpu(slab_reap_work, cpu));
1426 /* Now the cache_reaper is guaranteed to be not running. */
1427 per_cpu(slab_reap_work, cpu).work.func = NULL;
1429 case CPU_DOWN_FAILED:
1430 case CPU_DOWN_FAILED_FROZEN:
1431 start_cpu_timer(cpu);
1434 case CPU_DEAD_FROZEN:
1436 * Even if all the cpus of a node are down, we don't free the
1437 * kmem_list3 of any cache. This to avoid a race between
1438 * cpu_down, and a kmalloc allocation from another cpu for
1439 * memory from the node of the cpu going down. The list3
1440 * structure is usually allocated from kmem_cache_create() and
1441 * gets destroyed at kmem_cache_destroy().
1445 case CPU_UP_CANCELED:
1446 case CPU_UP_CANCELED_FROZEN:
1447 mutex_lock(&slab_mutex);
1448 cpuup_canceled(cpu);
1449 mutex_unlock(&slab_mutex);
1452 return notifier_from_errno(err);
1455 static struct notifier_block __cpuinitdata cpucache_notifier = {
1456 &cpuup_callback, NULL, 0
1459 #if defined(CONFIG_NUMA) && defined(CONFIG_MEMORY_HOTPLUG)
1461 * Drains freelist for a node on each slab cache, used for memory hot-remove.
1462 * Returns -EBUSY if all objects cannot be drained so that the node is not
1465 * Must hold slab_mutex.
1467 static int __meminit drain_cache_nodelists_node(int node)
1469 struct kmem_cache *cachep;
1472 list_for_each_entry(cachep, &slab_caches, list) {
1473 struct kmem_list3 *l3;
1475 l3 = cachep->nodelists[node];
1479 drain_freelist(cachep, l3, l3->free_objects);
1481 if (!list_empty(&l3->slabs_full) ||
1482 !list_empty(&l3->slabs_partial)) {
1490 static int __meminit slab_memory_callback(struct notifier_block *self,
1491 unsigned long action, void *arg)
1493 struct memory_notify *mnb = arg;
1497 nid = mnb->status_change_nid;
1502 case MEM_GOING_ONLINE:
1503 mutex_lock(&slab_mutex);
1504 ret = init_cache_nodelists_node(nid);
1505 mutex_unlock(&slab_mutex);
1507 case MEM_GOING_OFFLINE:
1508 mutex_lock(&slab_mutex);
1509 ret = drain_cache_nodelists_node(nid);
1510 mutex_unlock(&slab_mutex);
1514 case MEM_CANCEL_ONLINE:
1515 case MEM_CANCEL_OFFLINE:
1519 return notifier_from_errno(ret);
1521 #endif /* CONFIG_NUMA && CONFIG_MEMORY_HOTPLUG */
1524 * swap the static kmem_list3 with kmalloced memory
1526 static void __init init_list(struct kmem_cache *cachep, struct kmem_list3 *list,
1529 struct kmem_list3 *ptr;
1531 ptr = kmalloc_node(sizeof(struct kmem_list3), GFP_NOWAIT, nodeid);
1534 memcpy(ptr, list, sizeof(struct kmem_list3));
1536 * Do not assume that spinlocks can be initialized via memcpy:
1538 spin_lock_init(&ptr->list_lock);
1540 MAKE_ALL_LISTS(cachep, ptr, nodeid);
1541 cachep->nodelists[nodeid] = ptr;
1545 * For setting up all the kmem_list3s for cache whose buffer_size is same as
1546 * size of kmem_list3.
1548 static void __init set_up_list3s(struct kmem_cache *cachep, int index)
1552 for_each_online_node(node) {
1553 cachep->nodelists[node] = &initkmem_list3[index + node];
1554 cachep->nodelists[node]->next_reap = jiffies +
1556 ((unsigned long)cachep) % REAPTIMEOUT_LIST3;
1561 * The memory after the last cpu cache pointer is used for the
1562 * the nodelists pointer.
1564 static void setup_nodelists_pointer(struct kmem_cache *cachep)
1566 cachep->nodelists = (struct kmem_list3 **)&cachep->array[nr_cpu_ids];
1570 * Initialisation. Called after the page allocator have been initialised and
1571 * before smp_init().
1573 void __init kmem_cache_init(void)
1576 struct cache_sizes *sizes;
1577 struct cache_names *names;
1582 kmem_cache = &kmem_cache_boot;
1583 setup_nodelists_pointer(kmem_cache);
1585 if (num_possible_nodes() == 1)
1586 use_alien_caches = 0;
1588 for (i = 0; i < NUM_INIT_LISTS; i++)
1589 kmem_list3_init(&initkmem_list3[i]);
1591 set_up_list3s(kmem_cache, CACHE_CACHE);
1594 * Fragmentation resistance on low memory - only use bigger
1595 * page orders on machines with more than 32MB of memory if
1596 * not overridden on the command line.
1598 if (!slab_max_order_set && totalram_pages > (32 << 20) >> PAGE_SHIFT)
1599 slab_max_order = SLAB_MAX_ORDER_HI;
1601 /* Bootstrap is tricky, because several objects are allocated
1602 * from caches that do not exist yet:
1603 * 1) initialize the kmem_cache cache: it contains the struct
1604 * kmem_cache structures of all caches, except kmem_cache itself:
1605 * kmem_cache is statically allocated.
1606 * Initially an __init data area is used for the head array and the
1607 * kmem_list3 structures, it's replaced with a kmalloc allocated
1608 * array at the end of the bootstrap.
1609 * 2) Create the first kmalloc cache.
1610 * The struct kmem_cache for the new cache is allocated normally.
1611 * An __init data area is used for the head array.
1612 * 3) Create the remaining kmalloc caches, with minimally sized
1614 * 4) Replace the __init data head arrays for kmem_cache and the first
1615 * kmalloc cache with kmalloc allocated arrays.
1616 * 5) Replace the __init data for kmem_list3 for kmem_cache and
1617 * the other cache's with kmalloc allocated memory.
1618 * 6) Resize the head arrays of the kmalloc caches to their final sizes.
1621 node = numa_mem_id();
1623 /* 1) create the kmem_cache */
1624 INIT_LIST_HEAD(&slab_caches);
1625 list_add(&kmem_cache->list, &slab_caches);
1626 kmem_cache->colour_off = cache_line_size();
1627 kmem_cache->array[smp_processor_id()] = &initarray_cache.cache;
1630 * struct kmem_cache size depends on nr_node_ids & nr_cpu_ids
1632 kmem_cache->size = offsetof(struct kmem_cache, array[nr_cpu_ids]) +
1633 nr_node_ids * sizeof(struct kmem_list3 *);
1634 kmem_cache->object_size = kmem_cache->size;
1635 kmem_cache->size = ALIGN(kmem_cache->object_size,
1637 kmem_cache->reciprocal_buffer_size =
1638 reciprocal_value(kmem_cache->size);
1640 for (order = 0; order < MAX_ORDER; order++) {
1641 cache_estimate(order, kmem_cache->size,
1642 cache_line_size(), 0, &left_over, &kmem_cache->num);
1643 if (kmem_cache->num)
1646 BUG_ON(!kmem_cache->num);
1647 kmem_cache->gfporder = order;
1648 kmem_cache->colour = left_over / kmem_cache->colour_off;
1649 kmem_cache->slab_size = ALIGN(kmem_cache->num * sizeof(kmem_bufctl_t) +
1650 sizeof(struct slab), cache_line_size());
1652 /* 2+3) create the kmalloc caches */
1653 sizes = malloc_sizes;
1654 names = cache_names;
1657 * Initialize the caches that provide memory for the array cache and the
1658 * kmem_list3 structures first. Without this, further allocations will
1662 sizes[INDEX_AC].cs_cachep = kmem_cache_zalloc(kmem_cache, GFP_NOWAIT);
1663 sizes[INDEX_AC].cs_cachep->name = names[INDEX_AC].name;
1664 sizes[INDEX_AC].cs_cachep->size = sizes[INDEX_AC].cs_size;
1665 sizes[INDEX_AC].cs_cachep->object_size = sizes[INDEX_AC].cs_size;
1666 sizes[INDEX_AC].cs_cachep->align = ARCH_KMALLOC_MINALIGN;
1667 __kmem_cache_create(sizes[INDEX_AC].cs_cachep, ARCH_KMALLOC_FLAGS|SLAB_PANIC);
1668 list_add(&sizes[INDEX_AC].cs_cachep->list, &slab_caches);
1670 if (INDEX_AC != INDEX_L3) {
1671 sizes[INDEX_L3].cs_cachep = kmem_cache_zalloc(kmem_cache, GFP_NOWAIT);
1672 sizes[INDEX_L3].cs_cachep->name = names[INDEX_L3].name;
1673 sizes[INDEX_L3].cs_cachep->size = sizes[INDEX_L3].cs_size;
1674 sizes[INDEX_L3].cs_cachep->object_size = sizes[INDEX_L3].cs_size;
1675 sizes[INDEX_L3].cs_cachep->align = ARCH_KMALLOC_MINALIGN;
1676 __kmem_cache_create(sizes[INDEX_L3].cs_cachep, ARCH_KMALLOC_FLAGS|SLAB_PANIC);
1677 list_add(&sizes[INDEX_L3].cs_cachep->list, &slab_caches);
1680 slab_early_init = 0;
1682 while (sizes->cs_size != ULONG_MAX) {
1684 * For performance, all the general caches are L1 aligned.
1685 * This should be particularly beneficial on SMP boxes, as it
1686 * eliminates "false sharing".
1687 * Note for systems short on memory removing the alignment will
1688 * allow tighter packing of the smaller caches.
1690 if (!sizes->cs_cachep) {
1691 sizes->cs_cachep = kmem_cache_zalloc(kmem_cache, GFP_NOWAIT);
1692 sizes->cs_cachep->name = names->name;
1693 sizes->cs_cachep->size = sizes->cs_size;
1694 sizes->cs_cachep->object_size = sizes->cs_size;
1695 sizes->cs_cachep->align = ARCH_KMALLOC_MINALIGN;
1696 __kmem_cache_create(sizes->cs_cachep, ARCH_KMALLOC_FLAGS|SLAB_PANIC);
1697 list_add(&sizes->cs_cachep->list, &slab_caches);
1699 #ifdef CONFIG_ZONE_DMA
1700 sizes->cs_dmacachep = kmem_cache_zalloc(kmem_cache, GFP_NOWAIT);
1701 sizes->cs_dmacachep->name = names->name_dma;
1702 sizes->cs_dmacachep->size = sizes->cs_size;
1703 sizes->cs_dmacachep->object_size = sizes->cs_size;
1704 sizes->cs_dmacachep->align = ARCH_KMALLOC_MINALIGN;
1705 __kmem_cache_create(sizes->cs_dmacachep,
1706 ARCH_KMALLOC_FLAGS|SLAB_CACHE_DMA| SLAB_PANIC);
1707 list_add(&sizes->cs_dmacachep->list, &slab_caches);
1712 /* 4) Replace the bootstrap head arrays */
1714 struct array_cache *ptr;
1716 ptr = kmalloc(sizeof(struct arraycache_init), GFP_NOWAIT);
1718 BUG_ON(cpu_cache_get(kmem_cache) != &initarray_cache.cache);
1719 memcpy(ptr, cpu_cache_get(kmem_cache),
1720 sizeof(struct arraycache_init));
1722 * Do not assume that spinlocks can be initialized via memcpy:
1724 spin_lock_init(&ptr->lock);
1726 kmem_cache->array[smp_processor_id()] = ptr;
1728 ptr = kmalloc(sizeof(struct arraycache_init), GFP_NOWAIT);
1730 BUG_ON(cpu_cache_get(malloc_sizes[INDEX_AC].cs_cachep)
1731 != &initarray_generic.cache);
1732 memcpy(ptr, cpu_cache_get(malloc_sizes[INDEX_AC].cs_cachep),
1733 sizeof(struct arraycache_init));
1735 * Do not assume that spinlocks can be initialized via memcpy:
1737 spin_lock_init(&ptr->lock);
1739 malloc_sizes[INDEX_AC].cs_cachep->array[smp_processor_id()] =
1742 /* 5) Replace the bootstrap kmem_list3's */
1746 for_each_online_node(nid) {
1747 init_list(kmem_cache, &initkmem_list3[CACHE_CACHE + nid], nid);
1749 init_list(malloc_sizes[INDEX_AC].cs_cachep,
1750 &initkmem_list3[SIZE_AC + nid], nid);
1752 if (INDEX_AC != INDEX_L3) {
1753 init_list(malloc_sizes[INDEX_L3].cs_cachep,
1754 &initkmem_list3[SIZE_L3 + nid], nid);
1762 void __init kmem_cache_init_late(void)
1764 struct kmem_cache *cachep;
1768 /* 6) resize the head arrays to their final sizes */
1769 mutex_lock(&slab_mutex);
1770 list_for_each_entry(cachep, &slab_caches, list)
1771 if (enable_cpucache(cachep, GFP_NOWAIT))
1773 mutex_unlock(&slab_mutex);
1775 /* Annotate slab for lockdep -- annotate the malloc caches */
1782 * Register a cpu startup notifier callback that initializes
1783 * cpu_cache_get for all new cpus
1785 register_cpu_notifier(&cpucache_notifier);
1789 * Register a memory hotplug callback that initializes and frees
1792 hotplug_memory_notifier(slab_memory_callback, SLAB_CALLBACK_PRI);
1796 * The reap timers are started later, with a module init call: That part
1797 * of the kernel is not yet operational.
1801 static int __init cpucache_init(void)
1806 * Register the timers that return unneeded pages to the page allocator
1808 for_each_online_cpu(cpu)
1809 start_cpu_timer(cpu);
1815 __initcall(cpucache_init);
1817 static noinline void
1818 slab_out_of_memory(struct kmem_cache *cachep, gfp_t gfpflags, int nodeid)
1820 struct kmem_list3 *l3;
1822 unsigned long flags;
1826 "SLAB: Unable to allocate memory on node %d (gfp=0x%x)\n",
1828 printk(KERN_WARNING " cache: %s, object size: %d, order: %d\n",
1829 cachep->name, cachep->size, cachep->gfporder);
1831 for_each_online_node(node) {
1832 unsigned long active_objs = 0, num_objs = 0, free_objects = 0;
1833 unsigned long active_slabs = 0, num_slabs = 0;
1835 l3 = cachep->nodelists[node];
1839 spin_lock_irqsave(&l3->list_lock, flags);
1840 list_for_each_entry(slabp, &l3->slabs_full, list) {
1841 active_objs += cachep->num;
1844 list_for_each_entry(slabp, &l3->slabs_partial, list) {
1845 active_objs += slabp->inuse;
1848 list_for_each_entry(slabp, &l3->slabs_free, list)
1851 free_objects += l3->free_objects;
1852 spin_unlock_irqrestore(&l3->list_lock, flags);
1854 num_slabs += active_slabs;
1855 num_objs = num_slabs * cachep->num;
1857 " node %d: slabs: %ld/%ld, objs: %ld/%ld, free: %ld\n",
1858 node, active_slabs, num_slabs, active_objs, num_objs,
1864 * Interface to system's page allocator. No need to hold the cache-lock.
1866 * If we requested dmaable memory, we will get it. Even if we
1867 * did not request dmaable memory, we might get it, but that
1868 * would be relatively rare and ignorable.
1870 static void *kmem_getpages(struct kmem_cache *cachep, gfp_t flags, int nodeid)
1878 * Nommu uses slab's for process anonymous memory allocations, and thus
1879 * requires __GFP_COMP to properly refcount higher order allocations
1881 flags |= __GFP_COMP;
1884 flags |= cachep->allocflags;
1885 if (cachep->flags & SLAB_RECLAIM_ACCOUNT)
1886 flags |= __GFP_RECLAIMABLE;
1888 page = alloc_pages_exact_node(nodeid, flags | __GFP_NOTRACK, cachep->gfporder);
1890 if (!(flags & __GFP_NOWARN) && printk_ratelimit())
1891 slab_out_of_memory(cachep, flags, nodeid);
1895 /* Record if ALLOC_NO_WATERMARKS was set when allocating the slab */
1896 if (unlikely(page->pfmemalloc))
1897 pfmemalloc_active = true;
1899 nr_pages = (1 << cachep->gfporder);
1900 if (cachep->flags & SLAB_RECLAIM_ACCOUNT)
1901 add_zone_page_state(page_zone(page),
1902 NR_SLAB_RECLAIMABLE, nr_pages);
1904 add_zone_page_state(page_zone(page),
1905 NR_SLAB_UNRECLAIMABLE, nr_pages);
1906 for (i = 0; i < nr_pages; i++) {
1907 __SetPageSlab(page + i);
1909 if (page->pfmemalloc)
1910 SetPageSlabPfmemalloc(page + i);
1913 if (kmemcheck_enabled && !(cachep->flags & SLAB_NOTRACK)) {
1914 kmemcheck_alloc_shadow(page, cachep->gfporder, flags, nodeid);
1917 kmemcheck_mark_uninitialized_pages(page, nr_pages);
1919 kmemcheck_mark_unallocated_pages(page, nr_pages);
1922 return page_address(page);
1926 * Interface to system's page release.
1928 static void kmem_freepages(struct kmem_cache *cachep, void *addr)
1930 unsigned long i = (1 << cachep->gfporder);
1931 struct page *page = virt_to_page(addr);
1932 const unsigned long nr_freed = i;
1934 kmemcheck_free_shadow(page, cachep->gfporder);
1936 if (cachep->flags & SLAB_RECLAIM_ACCOUNT)
1937 sub_zone_page_state(page_zone(page),
1938 NR_SLAB_RECLAIMABLE, nr_freed);
1940 sub_zone_page_state(page_zone(page),
1941 NR_SLAB_UNRECLAIMABLE, nr_freed);
1943 BUG_ON(!PageSlab(page));
1944 __ClearPageSlabPfmemalloc(page);
1945 __ClearPageSlab(page);
1948 if (current->reclaim_state)
1949 current->reclaim_state->reclaimed_slab += nr_freed;
1950 free_pages((unsigned long)addr, cachep->gfporder);
1953 static void kmem_rcu_free(struct rcu_head *head)
1955 struct slab_rcu *slab_rcu = (struct slab_rcu *)head;
1956 struct kmem_cache *cachep = slab_rcu->cachep;
1958 kmem_freepages(cachep, slab_rcu->addr);
1959 if (OFF_SLAB(cachep))
1960 kmem_cache_free(cachep->slabp_cache, slab_rcu);
1965 #ifdef CONFIG_DEBUG_PAGEALLOC
1966 static void store_stackinfo(struct kmem_cache *cachep, unsigned long *addr,
1967 unsigned long caller)
1969 int size = cachep->object_size;
1971 addr = (unsigned long *)&((char *)addr)[obj_offset(cachep)];
1973 if (size < 5 * sizeof(unsigned long))
1976 *addr++ = 0x12345678;
1978 *addr++ = smp_processor_id();
1979 size -= 3 * sizeof(unsigned long);
1981 unsigned long *sptr = &caller;
1982 unsigned long svalue;
1984 while (!kstack_end(sptr)) {
1986 if (kernel_text_address(svalue)) {
1988 size -= sizeof(unsigned long);
1989 if (size <= sizeof(unsigned long))
1995 *addr++ = 0x87654321;
1999 static void poison_obj(struct kmem_cache *cachep, void *addr, unsigned char val)
2001 int size = cachep->object_size;
2002 addr = &((char *)addr)[obj_offset(cachep)];
2004 memset(addr, val, size);
2005 *(unsigned char *)(addr + size - 1) = POISON_END;
2008 static void dump_line(char *data, int offset, int limit)
2011 unsigned char error = 0;
2014 printk(KERN_ERR "%03x: ", offset);
2015 for (i = 0; i < limit; i++) {
2016 if (data[offset + i] != POISON_FREE) {
2017 error = data[offset + i];
2021 print_hex_dump(KERN_CONT, "", 0, 16, 1,
2022 &data[offset], limit, 1);
2024 if (bad_count == 1) {
2025 error ^= POISON_FREE;
2026 if (!(error & (error - 1))) {
2027 printk(KERN_ERR "Single bit error detected. Probably "
2030 printk(KERN_ERR "Run memtest86+ or a similar memory "
2033 printk(KERN_ERR "Run a memory test tool.\n");
2042 static void print_objinfo(struct kmem_cache *cachep, void *objp, int lines)
2047 if (cachep->flags & SLAB_RED_ZONE) {
2048 printk(KERN_ERR "Redzone: 0x%llx/0x%llx.\n",
2049 *dbg_redzone1(cachep, objp),
2050 *dbg_redzone2(cachep, objp));
2053 if (cachep->flags & SLAB_STORE_USER) {
2054 printk(KERN_ERR "Last user: [<%p>]",
2055 *dbg_userword(cachep, objp));
2056 print_symbol("(%s)",
2057 (unsigned long)*dbg_userword(cachep, objp));
2060 realobj = (char *)objp + obj_offset(cachep);
2061 size = cachep->object_size;
2062 for (i = 0; i < size && lines; i += 16, lines--) {
2065 if (i + limit > size)
2067 dump_line(realobj, i, limit);
2071 static void check_poison_obj(struct kmem_cache *cachep, void *objp)
2077 realobj = (char *)objp + obj_offset(cachep);
2078 size = cachep->object_size;
2080 for (i = 0; i < size; i++) {
2081 char exp = POISON_FREE;
2084 if (realobj[i] != exp) {
2090 "Slab corruption (%s): %s start=%p, len=%d\n",
2091 print_tainted(), cachep->name, realobj, size);
2092 print_objinfo(cachep, objp, 0);
2094 /* Hexdump the affected line */
2097 if (i + limit > size)
2099 dump_line(realobj, i, limit);
2102 /* Limit to 5 lines */
2108 /* Print some data about the neighboring objects, if they
2111 struct slab *slabp = virt_to_slab(objp);
2114 objnr = obj_to_index(cachep, slabp, objp);
2116 objp = index_to_obj(cachep, slabp, objnr - 1);
2117 realobj = (char *)objp + obj_offset(cachep);
2118 printk(KERN_ERR "Prev obj: start=%p, len=%d\n",
2120 print_objinfo(cachep, objp, 2);
2122 if (objnr + 1 < cachep->num) {
2123 objp = index_to_obj(cachep, slabp, objnr + 1);
2124 realobj = (char *)objp + obj_offset(cachep);
2125 printk(KERN_ERR "Next obj: start=%p, len=%d\n",
2127 print_objinfo(cachep, objp, 2);
2134 static void slab_destroy_debugcheck(struct kmem_cache *cachep, struct slab *slabp)
2137 for (i = 0; i < cachep->num; i++) {
2138 void *objp = index_to_obj(cachep, slabp, i);
2140 if (cachep->flags & SLAB_POISON) {
2141 #ifdef CONFIG_DEBUG_PAGEALLOC
2142 if (cachep->size % PAGE_SIZE == 0 &&
2144 kernel_map_pages(virt_to_page(objp),
2145 cachep->size / PAGE_SIZE, 1);
2147 check_poison_obj(cachep, objp);
2149 check_poison_obj(cachep, objp);
2152 if (cachep->flags & SLAB_RED_ZONE) {
2153 if (*dbg_redzone1(cachep, objp) != RED_INACTIVE)
2154 slab_error(cachep, "start of a freed object "
2156 if (*dbg_redzone2(cachep, objp) != RED_INACTIVE)
2157 slab_error(cachep, "end of a freed object "
2163 static void slab_destroy_debugcheck(struct kmem_cache *cachep, struct slab *slabp)
2169 * slab_destroy - destroy and release all objects in a slab
2170 * @cachep: cache pointer being destroyed
2171 * @slabp: slab pointer being destroyed
2173 * Destroy all the objs in a slab, and release the mem back to the system.
2174 * Before calling the slab must have been unlinked from the cache. The
2175 * cache-lock is not held/needed.
2177 static void slab_destroy(struct kmem_cache *cachep, struct slab *slabp)
2179 void *addr = slabp->s_mem - slabp->colouroff;
2181 slab_destroy_debugcheck(cachep, slabp);
2182 if (unlikely(cachep->flags & SLAB_DESTROY_BY_RCU)) {
2183 struct slab_rcu *slab_rcu;
2185 slab_rcu = (struct slab_rcu *)slabp;
2186 slab_rcu->cachep = cachep;
2187 slab_rcu->addr = addr;
2188 call_rcu(&slab_rcu->head, kmem_rcu_free);
2190 kmem_freepages(cachep, addr);
2191 if (OFF_SLAB(cachep))
2192 kmem_cache_free(cachep->slabp_cache, slabp);
2197 * calculate_slab_order - calculate size (page order) of slabs
2198 * @cachep: pointer to the cache that is being created
2199 * @size: size of objects to be created in this cache.
2200 * @align: required alignment for the objects.
2201 * @flags: slab allocation flags
2203 * Also calculates the number of objects per slab.
2205 * This could be made much more intelligent. For now, try to avoid using
2206 * high order pages for slabs. When the gfp() functions are more friendly
2207 * towards high-order requests, this should be changed.
2209 static size_t calculate_slab_order(struct kmem_cache *cachep,
2210 size_t size, size_t align, unsigned long flags)
2212 unsigned long offslab_limit;
2213 size_t left_over = 0;
2216 for (gfporder = 0; gfporder <= KMALLOC_MAX_ORDER; gfporder++) {
2220 cache_estimate(gfporder, size, align, flags, &remainder, &num);
2224 if (flags & CFLGS_OFF_SLAB) {
2226 * Max number of objs-per-slab for caches which
2227 * use off-slab slabs. Needed to avoid a possible
2228 * looping condition in cache_grow().
2230 offslab_limit = size - sizeof(struct slab);
2231 offslab_limit /= sizeof(kmem_bufctl_t);
2233 if (num > offslab_limit)
2237 /* Found something acceptable - save it away */
2239 cachep->gfporder = gfporder;
2240 left_over = remainder;
2243 * A VFS-reclaimable slab tends to have most allocations
2244 * as GFP_NOFS and we really don't want to have to be allocating
2245 * higher-order pages when we are unable to shrink dcache.
2247 if (flags & SLAB_RECLAIM_ACCOUNT)
2251 * Large number of objects is good, but very large slabs are
2252 * currently bad for the gfp()s.
2254 if (gfporder >= slab_max_order)
2258 * Acceptable internal fragmentation?
2260 if (left_over * 8 <= (PAGE_SIZE << gfporder))
2266 static int __init_refok setup_cpu_cache(struct kmem_cache *cachep, gfp_t gfp)
2268 if (slab_state >= FULL)
2269 return enable_cpucache(cachep, gfp);
2271 if (slab_state == DOWN) {
2273 * Note: the first kmem_cache_create must create the cache
2274 * that's used by kmalloc(24), otherwise the creation of
2275 * further caches will BUG().
2277 cachep->array[smp_processor_id()] = &initarray_generic.cache;
2280 * If the cache that's used by kmalloc(sizeof(kmem_list3)) is
2281 * the first cache, then we need to set up all its list3s,
2282 * otherwise the creation of further caches will BUG().
2284 set_up_list3s(cachep, SIZE_AC);
2285 if (INDEX_AC == INDEX_L3)
2286 slab_state = PARTIAL_L3;
2288 slab_state = PARTIAL_ARRAYCACHE;
2290 cachep->array[smp_processor_id()] =
2291 kmalloc(sizeof(struct arraycache_init), gfp);
2293 if (slab_state == PARTIAL_ARRAYCACHE) {
2294 set_up_list3s(cachep, SIZE_L3);
2295 slab_state = PARTIAL_L3;
2298 for_each_online_node(node) {
2299 cachep->nodelists[node] =
2300 kmalloc_node(sizeof(struct kmem_list3),
2302 BUG_ON(!cachep->nodelists[node]);
2303 kmem_list3_init(cachep->nodelists[node]);
2307 cachep->nodelists[numa_mem_id()]->next_reap =
2308 jiffies + REAPTIMEOUT_LIST3 +
2309 ((unsigned long)cachep) % REAPTIMEOUT_LIST3;
2311 cpu_cache_get(cachep)->avail = 0;
2312 cpu_cache_get(cachep)->limit = BOOT_CPUCACHE_ENTRIES;
2313 cpu_cache_get(cachep)->batchcount = 1;
2314 cpu_cache_get(cachep)->touched = 0;
2315 cachep->batchcount = 1;
2316 cachep->limit = BOOT_CPUCACHE_ENTRIES;
2321 * __kmem_cache_create - Create a cache.
2322 * @cachep: cache management descriptor
2323 * @flags: SLAB flags
2325 * Returns a ptr to the cache on success, NULL on failure.
2326 * Cannot be called within a int, but can be interrupted.
2327 * The @ctor is run when new pages are allocated by the cache.
2331 * %SLAB_POISON - Poison the slab with a known test pattern (a5a5a5a5)
2332 * to catch references to uninitialised memory.
2334 * %SLAB_RED_ZONE - Insert `Red' zones around the allocated memory to check
2335 * for buffer overruns.
2337 * %SLAB_HWCACHE_ALIGN - Align the objects in this cache to a hardware
2338 * cacheline. This can be beneficial if you're counting cycles as closely
2342 __kmem_cache_create (struct kmem_cache *cachep, unsigned long flags)
2344 size_t left_over, slab_size, ralign;
2347 size_t size = cachep->size;
2352 * Enable redzoning and last user accounting, except for caches with
2353 * large objects, if the increased size would increase the object size
2354 * above the next power of two: caches with object sizes just above a
2355 * power of two have a significant amount of internal fragmentation.
2357 if (size < 4096 || fls(size - 1) == fls(size-1 + REDZONE_ALIGN +
2358 2 * sizeof(unsigned long long)))
2359 flags |= SLAB_RED_ZONE | SLAB_STORE_USER;
2360 if (!(flags & SLAB_DESTROY_BY_RCU))
2361 flags |= SLAB_POISON;
2363 if (flags & SLAB_DESTROY_BY_RCU)
2364 BUG_ON(flags & SLAB_POISON);
2368 * Check that size is in terms of words. This is needed to avoid
2369 * unaligned accesses for some archs when redzoning is used, and makes
2370 * sure any on-slab bufctl's are also correctly aligned.
2372 if (size & (BYTES_PER_WORD - 1)) {
2373 size += (BYTES_PER_WORD - 1);
2374 size &= ~(BYTES_PER_WORD - 1);
2377 /* calculate the final buffer alignment: */
2379 /* 1) arch recommendation: can be overridden for debug */
2380 if (flags & SLAB_HWCACHE_ALIGN) {
2382 * Default alignment: as specified by the arch code. Except if
2383 * an object is really small, then squeeze multiple objects into
2386 ralign = cache_line_size();
2387 while (size <= ralign / 2)
2390 ralign = BYTES_PER_WORD;
2394 * Redzoning and user store require word alignment or possibly larger.
2395 * Note this will be overridden by architecture or caller mandated
2396 * alignment if either is greater than BYTES_PER_WORD.
2398 if (flags & SLAB_STORE_USER)
2399 ralign = BYTES_PER_WORD;
2401 if (flags & SLAB_RED_ZONE) {
2402 ralign = REDZONE_ALIGN;
2403 /* If redzoning, ensure that the second redzone is suitably
2404 * aligned, by adjusting the object size accordingly. */
2405 size += REDZONE_ALIGN - 1;
2406 size &= ~(REDZONE_ALIGN - 1);
2409 /* 2) arch mandated alignment */
2410 if (ralign < ARCH_SLAB_MINALIGN) {
2411 ralign = ARCH_SLAB_MINALIGN;
2413 /* 3) caller mandated alignment */
2414 if (ralign < cachep->align) {
2415 ralign = cachep->align;
2417 /* disable debug if necessary */
2418 if (ralign > __alignof__(unsigned long long))
2419 flags &= ~(SLAB_RED_ZONE | SLAB_STORE_USER);
2423 cachep->align = ralign;
2425 if (slab_is_available())
2430 setup_nodelists_pointer(cachep);
2434 * Both debugging options require word-alignment which is calculated
2437 if (flags & SLAB_RED_ZONE) {
2438 /* add space for red zone words */
2439 cachep->obj_offset += sizeof(unsigned long long);
2440 size += 2 * sizeof(unsigned long long);
2442 if (flags & SLAB_STORE_USER) {
2443 /* user store requires one word storage behind the end of
2444 * the real object. But if the second red zone needs to be
2445 * aligned to 64 bits, we must allow that much space.
2447 if (flags & SLAB_RED_ZONE)
2448 size += REDZONE_ALIGN;
2450 size += BYTES_PER_WORD;
2452 #if FORCED_DEBUG && defined(CONFIG_DEBUG_PAGEALLOC)
2453 if (size >= malloc_sizes[INDEX_L3 + 1].cs_size
2454 && cachep->object_size > cache_line_size()
2455 && ALIGN(size, cachep->align) < PAGE_SIZE) {
2456 cachep->obj_offset += PAGE_SIZE - ALIGN(size, cachep->align);
2463 * Determine if the slab management is 'on' or 'off' slab.
2464 * (bootstrapping cannot cope with offslab caches so don't do
2465 * it too early on. Always use on-slab management when
2466 * SLAB_NOLEAKTRACE to avoid recursive calls into kmemleak)
2468 if ((size >= (PAGE_SIZE >> 3)) && !slab_early_init &&
2469 !(flags & SLAB_NOLEAKTRACE))
2471 * Size is large, assume best to place the slab management obj
2472 * off-slab (should allow better packing of objs).
2474 flags |= CFLGS_OFF_SLAB;
2476 size = ALIGN(size, cachep->align);
2478 left_over = calculate_slab_order(cachep, size, cachep->align, flags);
2483 slab_size = ALIGN(cachep->num * sizeof(kmem_bufctl_t)
2484 + sizeof(struct slab), cachep->align);
2487 * If the slab has been placed off-slab, and we have enough space then
2488 * move it on-slab. This is at the expense of any extra colouring.
2490 if (flags & CFLGS_OFF_SLAB && left_over >= slab_size) {
2491 flags &= ~CFLGS_OFF_SLAB;
2492 left_over -= slab_size;
2495 if (flags & CFLGS_OFF_SLAB) {
2496 /* really off slab. No need for manual alignment */
2498 cachep->num * sizeof(kmem_bufctl_t) + sizeof(struct slab);
2500 #ifdef CONFIG_PAGE_POISONING
2501 /* If we're going to use the generic kernel_map_pages()
2502 * poisoning, then it's going to smash the contents of
2503 * the redzone and userword anyhow, so switch them off.
2505 if (size % PAGE_SIZE == 0 && flags & SLAB_POISON)
2506 flags &= ~(SLAB_RED_ZONE | SLAB_STORE_USER);
2510 cachep->colour_off = cache_line_size();
2511 /* Offset must be a multiple of the alignment. */
2512 if (cachep->colour_off < cachep->align)
2513 cachep->colour_off = cachep->align;
2514 cachep->colour = left_over / cachep->colour_off;
2515 cachep->slab_size = slab_size;
2516 cachep->flags = flags;
2517 cachep->allocflags = 0;
2518 if (CONFIG_ZONE_DMA_FLAG && (flags & SLAB_CACHE_DMA))
2519 cachep->allocflags |= GFP_DMA;
2520 cachep->size = size;
2521 cachep->reciprocal_buffer_size = reciprocal_value(size);
2523 if (flags & CFLGS_OFF_SLAB) {
2524 cachep->slabp_cache = kmem_find_general_cachep(slab_size, 0u);
2526 * This is a possibility for one of the malloc_sizes caches.
2527 * But since we go off slab only for object size greater than
2528 * PAGE_SIZE/8, and malloc_sizes gets created in ascending order,
2529 * this should not happen at all.
2530 * But leave a BUG_ON for some lucky dude.
2532 BUG_ON(ZERO_OR_NULL_PTR(cachep->slabp_cache));
2535 err = setup_cpu_cache(cachep, gfp);
2537 __kmem_cache_shutdown(cachep);
2541 if (flags & SLAB_DEBUG_OBJECTS) {
2543 * Would deadlock through slab_destroy()->call_rcu()->
2544 * debug_object_activate()->kmem_cache_alloc().
2546 WARN_ON_ONCE(flags & SLAB_DESTROY_BY_RCU);
2548 slab_set_debugobj_lock_classes(cachep);
2555 static void check_irq_off(void)
2557 BUG_ON(!irqs_disabled());
2560 static void check_irq_on(void)
2562 BUG_ON(irqs_disabled());
2565 static void check_spinlock_acquired(struct kmem_cache *cachep)
2569 assert_spin_locked(&cachep->nodelists[numa_mem_id()]->list_lock);
2573 static void check_spinlock_acquired_node(struct kmem_cache *cachep, int node)
2577 assert_spin_locked(&cachep->nodelists[node]->list_lock);
2582 #define check_irq_off() do { } while(0)
2583 #define check_irq_on() do { } while(0)
2584 #define check_spinlock_acquired(x) do { } while(0)
2585 #define check_spinlock_acquired_node(x, y) do { } while(0)
2588 static void drain_array(struct kmem_cache *cachep, struct kmem_list3 *l3,
2589 struct array_cache *ac,
2590 int force, int node);
2592 static void do_drain(void *arg)
2594 struct kmem_cache *cachep = arg;
2595 struct array_cache *ac;
2596 int node = numa_mem_id();
2599 ac = cpu_cache_get(cachep);
2600 spin_lock(&cachep->nodelists[node]->list_lock);
2601 free_block(cachep, ac->entry, ac->avail, node);
2602 spin_unlock(&cachep->nodelists[node]->list_lock);
2606 static void drain_cpu_caches(struct kmem_cache *cachep)
2608 struct kmem_list3 *l3;
2611 on_each_cpu(do_drain, cachep, 1);
2613 for_each_online_node(node) {
2614 l3 = cachep->nodelists[node];
2615 if (l3 && l3->alien)
2616 drain_alien_cache(cachep, l3->alien);
2619 for_each_online_node(node) {
2620 l3 = cachep->nodelists[node];
2622 drain_array(cachep, l3, l3->shared, 1, node);
2627 * Remove slabs from the list of free slabs.
2628 * Specify the number of slabs to drain in tofree.
2630 * Returns the actual number of slabs released.
2632 static int drain_freelist(struct kmem_cache *cache,
2633 struct kmem_list3 *l3, int tofree)
2635 struct list_head *p;
2640 while (nr_freed < tofree && !list_empty(&l3->slabs_free)) {
2642 spin_lock_irq(&l3->list_lock);
2643 p = l3->slabs_free.prev;
2644 if (p == &l3->slabs_free) {
2645 spin_unlock_irq(&l3->list_lock);
2649 slabp = list_entry(p, struct slab, list);
2651 BUG_ON(slabp->inuse);
2653 list_del(&slabp->list);
2655 * Safe to drop the lock. The slab is no longer linked
2658 l3->free_objects -= cache->num;
2659 spin_unlock_irq(&l3->list_lock);
2660 slab_destroy(cache, slabp);
2667 /* Called with slab_mutex held to protect against cpu hotplug */
2668 static int __cache_shrink(struct kmem_cache *cachep)
2671 struct kmem_list3 *l3;
2673 drain_cpu_caches(cachep);
2676 for_each_online_node(i) {
2677 l3 = cachep->nodelists[i];
2681 drain_freelist(cachep, l3, l3->free_objects);
2683 ret += !list_empty(&l3->slabs_full) ||
2684 !list_empty(&l3->slabs_partial);
2686 return (ret ? 1 : 0);
2690 * kmem_cache_shrink - Shrink a cache.
2691 * @cachep: The cache to shrink.
2693 * Releases as many slabs as possible for a cache.
2694 * To help debugging, a zero exit status indicates all slabs were released.
2696 int kmem_cache_shrink(struct kmem_cache *cachep)
2699 BUG_ON(!cachep || in_interrupt());
2702 mutex_lock(&slab_mutex);
2703 ret = __cache_shrink(cachep);
2704 mutex_unlock(&slab_mutex);
2708 EXPORT_SYMBOL(kmem_cache_shrink);
2710 int __kmem_cache_shutdown(struct kmem_cache *cachep)
2713 struct kmem_list3 *l3;
2714 int rc = __cache_shrink(cachep);
2719 for_each_online_cpu(i)
2720 kfree(cachep->array[i]);
2722 /* NUMA: free the list3 structures */
2723 for_each_online_node(i) {
2724 l3 = cachep->nodelists[i];
2727 free_alien_cache(l3->alien);
2735 * Get the memory for a slab management obj.
2736 * For a slab cache when the slab descriptor is off-slab, slab descriptors
2737 * always come from malloc_sizes caches. The slab descriptor cannot
2738 * come from the same cache which is getting created because,
2739 * when we are searching for an appropriate cache for these
2740 * descriptors in kmem_cache_create, we search through the malloc_sizes array.
2741 * If we are creating a malloc_sizes cache here it would not be visible to
2742 * kmem_find_general_cachep till the initialization is complete.
2743 * Hence we cannot have slabp_cache same as the original cache.
2745 static struct slab *alloc_slabmgmt(struct kmem_cache *cachep, void *objp,
2746 int colour_off, gfp_t local_flags,
2751 if (OFF_SLAB(cachep)) {
2752 /* Slab management obj is off-slab. */
2753 slabp = kmem_cache_alloc_node(cachep->slabp_cache,
2754 local_flags, nodeid);
2756 * If the first object in the slab is leaked (it's allocated
2757 * but no one has a reference to it), we want to make sure
2758 * kmemleak does not treat the ->s_mem pointer as a reference
2759 * to the object. Otherwise we will not report the leak.
2761 kmemleak_scan_area(&slabp->list, sizeof(struct list_head),
2766 slabp = objp + colour_off;
2767 colour_off += cachep->slab_size;
2770 slabp->colouroff = colour_off;
2771 slabp->s_mem = objp + colour_off;
2772 slabp->nodeid = nodeid;
2777 static inline kmem_bufctl_t *slab_bufctl(struct slab *slabp)
2779 return (kmem_bufctl_t *) (slabp + 1);
2782 static void cache_init_objs(struct kmem_cache *cachep,
2787 for (i = 0; i < cachep->num; i++) {
2788 void *objp = index_to_obj(cachep, slabp, i);
2790 /* need to poison the objs? */
2791 if (cachep->flags & SLAB_POISON)
2792 poison_obj(cachep, objp, POISON_FREE);
2793 if (cachep->flags & SLAB_STORE_USER)
2794 *dbg_userword(cachep, objp) = NULL;
2796 if (cachep->flags & SLAB_RED_ZONE) {
2797 *dbg_redzone1(cachep, objp) = RED_INACTIVE;
2798 *dbg_redzone2(cachep, objp) = RED_INACTIVE;
2801 * Constructors are not allowed to allocate memory from the same
2802 * cache which they are a constructor for. Otherwise, deadlock.
2803 * They must also be threaded.
2805 if (cachep->ctor && !(cachep->flags & SLAB_POISON))
2806 cachep->ctor(objp + obj_offset(cachep));
2808 if (cachep->flags & SLAB_RED_ZONE) {
2809 if (*dbg_redzone2(cachep, objp) != RED_INACTIVE)
2810 slab_error(cachep, "constructor overwrote the"
2811 " end of an object");
2812 if (*dbg_redzone1(cachep, objp) != RED_INACTIVE)
2813 slab_error(cachep, "constructor overwrote the"
2814 " start of an object");
2816 if ((cachep->size % PAGE_SIZE) == 0 &&
2817 OFF_SLAB(cachep) && cachep->flags & SLAB_POISON)
2818 kernel_map_pages(virt_to_page(objp),
2819 cachep->size / PAGE_SIZE, 0);
2824 slab_bufctl(slabp)[i] = i + 1;
2826 slab_bufctl(slabp)[i - 1] = BUFCTL_END;
2829 static void kmem_flagcheck(struct kmem_cache *cachep, gfp_t flags)
2831 if (CONFIG_ZONE_DMA_FLAG) {
2832 if (flags & GFP_DMA)
2833 BUG_ON(!(cachep->allocflags & GFP_DMA));
2835 BUG_ON(cachep->allocflags & GFP_DMA);
2839 static void *slab_get_obj(struct kmem_cache *cachep, struct slab *slabp,
2842 void *objp = index_to_obj(cachep, slabp, slabp->free);
2846 next = slab_bufctl(slabp)[slabp->free];
2848 slab_bufctl(slabp)[slabp->free] = BUFCTL_FREE;
2849 WARN_ON(slabp->nodeid != nodeid);
2856 static void slab_put_obj(struct kmem_cache *cachep, struct slab *slabp,
2857 void *objp, int nodeid)
2859 unsigned int objnr = obj_to_index(cachep, slabp, objp);
2862 /* Verify that the slab belongs to the intended node */
2863 WARN_ON(slabp->nodeid != nodeid);
2865 if (slab_bufctl(slabp)[objnr] + 1 <= SLAB_LIMIT + 1) {
2866 printk(KERN_ERR "slab: double free detected in cache "
2867 "'%s', objp %p\n", cachep->name, objp);
2871 slab_bufctl(slabp)[objnr] = slabp->free;
2872 slabp->free = objnr;
2877 * Map pages beginning at addr to the given cache and slab. This is required
2878 * for the slab allocator to be able to lookup the cache and slab of a
2879 * virtual address for kfree, ksize, and slab debugging.
2881 static void slab_map_pages(struct kmem_cache *cache, struct slab *slab,
2887 page = virt_to_page(addr);
2890 if (likely(!PageCompound(page)))
2891 nr_pages <<= cache->gfporder;
2894 page->slab_cache = cache;
2895 page->slab_page = slab;
2897 } while (--nr_pages);
2901 * Grow (by 1) the number of slabs within a cache. This is called by
2902 * kmem_cache_alloc() when there are no active objs left in a cache.
2904 static int cache_grow(struct kmem_cache *cachep,
2905 gfp_t flags, int nodeid, void *objp)
2910 struct kmem_list3 *l3;
2913 * Be lazy and only check for valid flags here, keeping it out of the
2914 * critical path in kmem_cache_alloc().
2916 BUG_ON(flags & GFP_SLAB_BUG_MASK);
2917 local_flags = flags & (GFP_CONSTRAINT_MASK|GFP_RECLAIM_MASK);
2919 /* Take the l3 list lock to change the colour_next on this node */
2921 l3 = cachep->nodelists[nodeid];
2922 spin_lock(&l3->list_lock);
2924 /* Get colour for the slab, and cal the next value. */
2925 offset = l3->colour_next;
2927 if (l3->colour_next >= cachep->colour)
2928 l3->colour_next = 0;
2929 spin_unlock(&l3->list_lock);
2931 offset *= cachep->colour_off;
2933 if (local_flags & __GFP_WAIT)
2937 * The test for missing atomic flag is performed here, rather than
2938 * the more obvious place, simply to reduce the critical path length
2939 * in kmem_cache_alloc(). If a caller is seriously mis-behaving they
2940 * will eventually be caught here (where it matters).
2942 kmem_flagcheck(cachep, flags);
2945 * Get mem for the objs. Attempt to allocate a physical page from
2949 objp = kmem_getpages(cachep, local_flags, nodeid);
2953 /* Get slab management. */
2954 slabp = alloc_slabmgmt(cachep, objp, offset,
2955 local_flags & ~GFP_CONSTRAINT_MASK, nodeid);
2959 slab_map_pages(cachep, slabp, objp);
2961 cache_init_objs(cachep, slabp);
2963 if (local_flags & __GFP_WAIT)
2964 local_irq_disable();
2966 spin_lock(&l3->list_lock);
2968 /* Make slab active. */
2969 list_add_tail(&slabp->list, &(l3->slabs_free));
2970 STATS_INC_GROWN(cachep);
2971 l3->free_objects += cachep->num;
2972 spin_unlock(&l3->list_lock);
2975 kmem_freepages(cachep, objp);
2977 if (local_flags & __GFP_WAIT)
2978 local_irq_disable();
2985 * Perform extra freeing checks:
2986 * - detect bad pointers.
2987 * - POISON/RED_ZONE checking
2989 static void kfree_debugcheck(const void *objp)
2991 if (!virt_addr_valid(objp)) {
2992 printk(KERN_ERR "kfree_debugcheck: out of range ptr %lxh.\n",
2993 (unsigned long)objp);
2998 static inline void verify_redzone_free(struct kmem_cache *cache, void *obj)
3000 unsigned long long redzone1, redzone2;
3002 redzone1 = *dbg_redzone1(cache, obj);
3003 redzone2 = *dbg_redzone2(cache, obj);
3008 if (redzone1 == RED_ACTIVE && redzone2 == RED_ACTIVE)
3011 if (redzone1 == RED_INACTIVE && redzone2 == RED_INACTIVE)
3012 slab_error(cache, "double free detected");
3014 slab_error(cache, "memory outside object was overwritten");
3016 printk(KERN_ERR "%p: redzone 1:0x%llx, redzone 2:0x%llx.\n",
3017 obj, redzone1, redzone2);
3020 static void *cache_free_debugcheck(struct kmem_cache *cachep, void *objp,
3021 unsigned long caller)
3027 BUG_ON(virt_to_cache(objp) != cachep);
3029 objp -= obj_offset(cachep);
3030 kfree_debugcheck(objp);
3031 page = virt_to_head_page(objp);
3033 slabp = page->slab_page;
3035 if (cachep->flags & SLAB_RED_ZONE) {
3036 verify_redzone_free(cachep, objp);
3037 *dbg_redzone1(cachep, objp) = RED_INACTIVE;
3038 *dbg_redzone2(cachep, objp) = RED_INACTIVE;
3040 if (cachep->flags & SLAB_STORE_USER)
3041 *dbg_userword(cachep, objp) = (void *)caller;
3043 objnr = obj_to_index(cachep, slabp, objp);
3045 BUG_ON(objnr >= cachep->num);
3046 BUG_ON(objp != index_to_obj(cachep, slabp, objnr));
3048 #ifdef CONFIG_DEBUG_SLAB_LEAK
3049 slab_bufctl(slabp)[objnr] = BUFCTL_FREE;
3051 if (cachep->flags & SLAB_POISON) {
3052 #ifdef CONFIG_DEBUG_PAGEALLOC
3053 if ((cachep->size % PAGE_SIZE)==0 && OFF_SLAB(cachep)) {
3054 store_stackinfo(cachep, objp, caller);
3055 kernel_map_pages(virt_to_page(objp),
3056 cachep->size / PAGE_SIZE, 0);
3058 poison_obj(cachep, objp, POISON_FREE);
3061 poison_obj(cachep, objp, POISON_FREE);
3067 static void check_slabp(struct kmem_cache *cachep, struct slab *slabp)
3072 /* Check slab's freelist to see if this obj is there. */
3073 for (i = slabp->free; i != BUFCTL_END; i = slab_bufctl(slabp)[i]) {
3075 if (entries > cachep->num || i >= cachep->num)
3078 if (entries != cachep->num - slabp->inuse) {
3080 printk(KERN_ERR "slab: Internal list corruption detected in "
3081 "cache '%s'(%d), slabp %p(%d). Tainted(%s). Hexdump:\n",
3082 cachep->name, cachep->num, slabp, slabp->inuse,
3084 print_hex_dump(KERN_ERR, "", DUMP_PREFIX_OFFSET, 16, 1, slabp,
3085 sizeof(*slabp) + cachep->num * sizeof(kmem_bufctl_t),
3091 #define kfree_debugcheck(x) do { } while(0)
3092 #define cache_free_debugcheck(x,objp,z) (objp)
3093 #define check_slabp(x,y) do { } while(0)
3096 static void *cache_alloc_refill(struct kmem_cache *cachep, gfp_t flags,
3100 struct kmem_list3 *l3;
3101 struct array_cache *ac;
3105 node = numa_mem_id();
3106 if (unlikely(force_refill))
3109 ac = cpu_cache_get(cachep);
3110 batchcount = ac->batchcount;
3111 if (!ac->touched && batchcount > BATCHREFILL_LIMIT) {
3113 * If there was little recent activity on this cache, then
3114 * perform only a partial refill. Otherwise we could generate
3117 batchcount = BATCHREFILL_LIMIT;
3119 l3 = cachep->nodelists[node];
3121 BUG_ON(ac->avail > 0 || !l3);
3122 spin_lock(&l3->list_lock);
3124 /* See if we can refill from the shared array */
3125 if (l3->shared && transfer_objects(ac, l3->shared, batchcount)) {
3126 l3->shared->touched = 1;
3130 while (batchcount > 0) {
3131 struct list_head *entry;
3133 /* Get slab alloc is to come from. */
3134 entry = l3->slabs_partial.next;
3135 if (entry == &l3->slabs_partial) {
3136 l3->free_touched = 1;
3137 entry = l3->slabs_free.next;
3138 if (entry == &l3->slabs_free)
3142 slabp = list_entry(entry, struct slab, list);
3143 check_slabp(cachep, slabp);
3144 check_spinlock_acquired(cachep);
3147 * The slab was either on partial or free list so
3148 * there must be at least one object available for
3151 BUG_ON(slabp->inuse >= cachep->num);
3153 while (slabp->inuse < cachep->num && batchcount--) {
3154 STATS_INC_ALLOCED(cachep);
3155 STATS_INC_ACTIVE(cachep);
3156 STATS_SET_HIGH(cachep);
3158 ac_put_obj(cachep, ac, slab_get_obj(cachep, slabp,
3161 check_slabp(cachep, slabp);
3163 /* move slabp to correct slabp list: */
3164 list_del(&slabp->list);
3165 if (slabp->free == BUFCTL_END)
3166 list_add(&slabp->list, &l3->slabs_full);
3168 list_add(&slabp->list, &l3->slabs_partial);
3172 l3->free_objects -= ac->avail;
3174 spin_unlock(&l3->list_lock);
3176 if (unlikely(!ac->avail)) {
3179 x = cache_grow(cachep, flags | GFP_THISNODE, node, NULL);
3181 /* cache_grow can reenable interrupts, then ac could change. */
3182 ac = cpu_cache_get(cachep);
3183 node = numa_mem_id();
3185 /* no objects in sight? abort */
3186 if (!x && (ac->avail == 0 || force_refill))
3189 if (!ac->avail) /* objects refilled by interrupt? */
3194 return ac_get_obj(cachep, ac, flags, force_refill);
3197 static inline void cache_alloc_debugcheck_before(struct kmem_cache *cachep,
3200 might_sleep_if(flags & __GFP_WAIT);
3202 kmem_flagcheck(cachep, flags);
3207 static void *cache_alloc_debugcheck_after(struct kmem_cache *cachep,
3208 gfp_t flags, void *objp, unsigned long caller)
3212 if (cachep->flags & SLAB_POISON) {
3213 #ifdef CONFIG_DEBUG_PAGEALLOC
3214 if ((cachep->size % PAGE_SIZE) == 0 && OFF_SLAB(cachep))
3215 kernel_map_pages(virt_to_page(objp),
3216 cachep->size / PAGE_SIZE, 1);
3218 check_poison_obj(cachep, objp);
3220 check_poison_obj(cachep, objp);
3222 poison_obj(cachep, objp, POISON_INUSE);
3224 if (cachep->flags & SLAB_STORE_USER)
3225 *dbg_userword(cachep, objp) = (void *)caller;
3227 if (cachep->flags & SLAB_RED_ZONE) {
3228 if (*dbg_redzone1(cachep, objp) != RED_INACTIVE ||
3229 *dbg_redzone2(cachep, objp) != RED_INACTIVE) {
3230 slab_error(cachep, "double free, or memory outside"
3231 " object was overwritten");
3233 "%p: redzone 1:0x%llx, redzone 2:0x%llx\n",
3234 objp, *dbg_redzone1(cachep, objp),
3235 *dbg_redzone2(cachep, objp));
3237 *dbg_redzone1(cachep, objp) = RED_ACTIVE;
3238 *dbg_redzone2(cachep, objp) = RED_ACTIVE;
3240 #ifdef CONFIG_DEBUG_SLAB_LEAK
3245 slabp = virt_to_head_page(objp)->slab_page;
3246 objnr = (unsigned)(objp - slabp->s_mem) / cachep->size;
3247 slab_bufctl(slabp)[objnr] = BUFCTL_ACTIVE;
3250 objp += obj_offset(cachep);
3251 if (cachep->ctor && cachep->flags & SLAB_POISON)
3253 if (ARCH_SLAB_MINALIGN &&
3254 ((unsigned long)objp & (ARCH_SLAB_MINALIGN-1))) {
3255 printk(KERN_ERR "0x%p: not aligned to ARCH_SLAB_MINALIGN=%d\n",
3256 objp, (int)ARCH_SLAB_MINALIGN);
3261 #define cache_alloc_debugcheck_after(a,b,objp,d) (objp)
3264 static bool slab_should_failslab(struct kmem_cache *cachep, gfp_t flags)
3266 if (cachep == kmem_cache)
3269 return should_failslab(cachep->object_size, flags, cachep->flags);
3272 static inline void *____cache_alloc(struct kmem_cache *cachep, gfp_t flags)
3275 struct array_cache *ac;
3276 bool force_refill = false;
3280 ac = cpu_cache_get(cachep);
3281 if (likely(ac->avail)) {
3283 objp = ac_get_obj(cachep, ac, flags, false);
3286 * Allow for the possibility all avail objects are not allowed
3287 * by the current flags
3290 STATS_INC_ALLOCHIT(cachep);
3293 force_refill = true;
3296 STATS_INC_ALLOCMISS(cachep);
3297 objp = cache_alloc_refill(cachep, flags, force_refill);
3299 * the 'ac' may be updated by cache_alloc_refill(),
3300 * and kmemleak_erase() requires its correct value.
3302 ac = cpu_cache_get(cachep);
3306 * To avoid a false negative, if an object that is in one of the
3307 * per-CPU caches is leaked, we need to make sure kmemleak doesn't
3308 * treat the array pointers as a reference to the object.
3311 kmemleak_erase(&ac->entry[ac->avail]);
3317 * Try allocating on another node if PF_SPREAD_SLAB|PF_MEMPOLICY.
3319 * If we are in_interrupt, then process context, including cpusets and
3320 * mempolicy, may not apply and should not be used for allocation policy.
3322 static void *alternate_node_alloc(struct kmem_cache *cachep, gfp_t flags)
3324 int nid_alloc, nid_here;
3326 if (in_interrupt() || (flags & __GFP_THISNODE))
3328 nid_alloc = nid_here = numa_mem_id();
3329 if (cpuset_do_slab_mem_spread() && (cachep->flags & SLAB_MEM_SPREAD))
3330 nid_alloc = cpuset_slab_spread_node();
3331 else if (current->mempolicy)
3332 nid_alloc = slab_node();
3333 if (nid_alloc != nid_here)
3334 return ____cache_alloc_node(cachep, flags, nid_alloc);
3339 * Fallback function if there was no memory available and no objects on a
3340 * certain node and fall back is permitted. First we scan all the
3341 * available nodelists for available objects. If that fails then we
3342 * perform an allocation without specifying a node. This allows the page
3343 * allocator to do its reclaim / fallback magic. We then insert the
3344 * slab into the proper nodelist and then allocate from it.
3346 static void *fallback_alloc(struct kmem_cache *cache, gfp_t flags)
3348 struct zonelist *zonelist;
3352 enum zone_type high_zoneidx = gfp_zone(flags);
3355 unsigned int cpuset_mems_cookie;
3357 if (flags & __GFP_THISNODE)
3360 local_flags = flags & (GFP_CONSTRAINT_MASK|GFP_RECLAIM_MASK);
3363 cpuset_mems_cookie = get_mems_allowed();
3364 zonelist = node_zonelist(slab_node(), flags);
3368 * Look through allowed nodes for objects available
3369 * from existing per node queues.
3371 for_each_zone_zonelist(zone, z, zonelist, high_zoneidx) {
3372 nid = zone_to_nid(zone);
3374 if (cpuset_zone_allowed_hardwall(zone, flags) &&
3375 cache->nodelists[nid] &&
3376 cache->nodelists[nid]->free_objects) {
3377 obj = ____cache_alloc_node(cache,
3378 flags | GFP_THISNODE, nid);
3386 * This allocation will be performed within the constraints
3387 * of the current cpuset / memory policy requirements.
3388 * We may trigger various forms of reclaim on the allowed
3389 * set and go into memory reserves if necessary.
3391 if (local_flags & __GFP_WAIT)
3393 kmem_flagcheck(cache, flags);
3394 obj = kmem_getpages(cache, local_flags, numa_mem_id());
3395 if (local_flags & __GFP_WAIT)
3396 local_irq_disable();
3399 * Insert into the appropriate per node queues
3401 nid = page_to_nid(virt_to_page(obj));
3402 if (cache_grow(cache, flags, nid, obj)) {
3403 obj = ____cache_alloc_node(cache,
3404 flags | GFP_THISNODE, nid);
3407 * Another processor may allocate the
3408 * objects in the slab since we are
3409 * not holding any locks.
3413 /* cache_grow already freed obj */
3419 if (unlikely(!put_mems_allowed(cpuset_mems_cookie) && !obj))
3425 * A interface to enable slab creation on nodeid
3427 static void *____cache_alloc_node(struct kmem_cache *cachep, gfp_t flags,
3430 struct list_head *entry;
3432 struct kmem_list3 *l3;
3436 l3 = cachep->nodelists[nodeid];
3441 spin_lock(&l3->list_lock);
3442 entry = l3->slabs_partial.next;
3443 if (entry == &l3->slabs_partial) {
3444 l3->free_touched = 1;
3445 entry = l3->slabs_free.next;
3446 if (entry == &l3->slabs_free)
3450 slabp = list_entry(entry, struct slab, list);
3451 check_spinlock_acquired_node(cachep, nodeid);
3452 check_slabp(cachep, slabp);
3454 STATS_INC_NODEALLOCS(cachep);
3455 STATS_INC_ACTIVE(cachep);
3456 STATS_SET_HIGH(cachep);
3458 BUG_ON(slabp->inuse == cachep->num);
3460 obj = slab_get_obj(cachep, slabp, nodeid);
3461 check_slabp(cachep, slabp);
3463 /* move slabp to correct slabp list: */
3464 list_del(&slabp->list);
3466 if (slabp->free == BUFCTL_END)
3467 list_add(&slabp->list, &l3->slabs_full);
3469 list_add(&slabp->list, &l3->slabs_partial);
3471 spin_unlock(&l3->list_lock);
3475 spin_unlock(&l3->list_lock);
3476 x = cache_grow(cachep, flags | GFP_THISNODE, nodeid, NULL);
3480 return fallback_alloc(cachep, flags);
3487 * kmem_cache_alloc_node - Allocate an object on the specified node
3488 * @cachep: The cache to allocate from.
3489 * @flags: See kmalloc().
3490 * @nodeid: node number of the target node.
3491 * @caller: return address of caller, used for debug information
3493 * Identical to kmem_cache_alloc but it will allocate memory on the given
3494 * node, which can improve the performance for cpu bound structures.
3496 * Fallback to other node is possible if __GFP_THISNODE is not set.
3498 static __always_inline void *
3499 slab_alloc_node(struct kmem_cache *cachep, gfp_t flags, int nodeid,
3500 unsigned long caller)
3502 unsigned long save_flags;
3504 int slab_node = numa_mem_id();
3506 flags &= gfp_allowed_mask;
3508 lockdep_trace_alloc(flags);
3510 if (slab_should_failslab(cachep, flags))
3513 cache_alloc_debugcheck_before(cachep, flags);
3514 local_irq_save(save_flags);
3516 if (nodeid == NUMA_NO_NODE)
3519 if (unlikely(!cachep->nodelists[nodeid])) {
3520 /* Node not bootstrapped yet */
3521 ptr = fallback_alloc(cachep, flags);
3525 if (nodeid == slab_node) {
3527 * Use the locally cached objects if possible.
3528 * However ____cache_alloc does not allow fallback
3529 * to other nodes. It may fail while we still have
3530 * objects on other nodes available.
3532 ptr = ____cache_alloc(cachep, flags);
3536 /* ___cache_alloc_node can fall back to other nodes */
3537 ptr = ____cache_alloc_node(cachep, flags, nodeid);
3539 local_irq_restore(save_flags);
3540 ptr = cache_alloc_debugcheck_after(cachep, flags, ptr, caller);
3541 kmemleak_alloc_recursive(ptr, cachep->object_size, 1, cachep->flags,
3545 kmemcheck_slab_alloc(cachep, flags, ptr, cachep->object_size);
3547 if (unlikely((flags & __GFP_ZERO) && ptr))
3548 memset(ptr, 0, cachep->object_size);
3553 static __always_inline void *
3554 __do_cache_alloc(struct kmem_cache *cache, gfp_t flags)
3558 if (unlikely(current->flags & (PF_SPREAD_SLAB | PF_MEMPOLICY))) {
3559 objp = alternate_node_alloc(cache, flags);
3563 objp = ____cache_alloc(cache, flags);
3566 * We may just have run out of memory on the local node.
3567 * ____cache_alloc_node() knows how to locate memory on other nodes
3570 objp = ____cache_alloc_node(cache, flags, numa_mem_id());
3577 static __always_inline void *
3578 __do_cache_alloc(struct kmem_cache *cachep, gfp_t flags)
3580 return ____cache_alloc(cachep, flags);
3583 #endif /* CONFIG_NUMA */
3585 static __always_inline void *
3586 slab_alloc(struct kmem_cache *cachep, gfp_t flags, unsigned long caller)
3588 unsigned long save_flags;
3591 flags &= gfp_allowed_mask;
3593 lockdep_trace_alloc(flags);
3595 if (slab_should_failslab(cachep, flags))
3598 cache_alloc_debugcheck_before(cachep, flags);
3599 local_irq_save(save_flags);
3600 objp = __do_cache_alloc(cachep, flags);
3601 local_irq_restore(save_flags);
3602 objp = cache_alloc_debugcheck_after(cachep, flags, objp, caller);
3603 kmemleak_alloc_recursive(objp, cachep->object_size, 1, cachep->flags,
3608 kmemcheck_slab_alloc(cachep, flags, objp, cachep->object_size);
3610 if (unlikely((flags & __GFP_ZERO) && objp))
3611 memset(objp, 0, cachep->object_size);
3617 * Caller needs to acquire correct kmem_list's list_lock
3619 static void free_block(struct kmem_cache *cachep, void **objpp, int nr_objects,
3623 struct kmem_list3 *l3;
3625 for (i = 0; i < nr_objects; i++) {
3629 clear_obj_pfmemalloc(&objpp[i]);
3632 slabp = virt_to_slab(objp);
3633 l3 = cachep->nodelists[node];
3634 list_del(&slabp->list);
3635 check_spinlock_acquired_node(cachep, node);
3636 check_slabp(cachep, slabp);
3637 slab_put_obj(cachep, slabp, objp, node);
3638 STATS_DEC_ACTIVE(cachep);
3640 check_slabp(cachep, slabp);
3642 /* fixup slab chains */
3643 if (slabp->inuse == 0) {
3644 if (l3->free_objects > l3->free_limit) {
3645 l3->free_objects -= cachep->num;
3646 /* No need to drop any previously held
3647 * lock here, even if we have a off-slab slab
3648 * descriptor it is guaranteed to come from
3649 * a different cache, refer to comments before
3652 slab_destroy(cachep, slabp);
3654 list_add(&slabp->list, &l3->slabs_free);
3657 /* Unconditionally move a slab to the end of the
3658 * partial list on free - maximum time for the
3659 * other objects to be freed, too.
3661 list_add_tail(&slabp->list, &l3->slabs_partial);
3666 static void cache_flusharray(struct kmem_cache *cachep, struct array_cache *ac)
3669 struct kmem_list3 *l3;
3670 int node = numa_mem_id();
3672 batchcount = ac->batchcount;
3674 BUG_ON(!batchcount || batchcount > ac->avail);
3677 l3 = cachep->nodelists[node];
3678 spin_lock(&l3->list_lock);
3680 struct array_cache *shared_array = l3->shared;
3681 int max = shared_array->limit - shared_array->avail;
3683 if (batchcount > max)
3685 memcpy(&(shared_array->entry[shared_array->avail]),
3686 ac->entry, sizeof(void *) * batchcount);
3687 shared_array->avail += batchcount;
3692 free_block(cachep, ac->entry, batchcount, node);
3697 struct list_head *p;
3699 p = l3->slabs_free.next;
3700 while (p != &(l3->slabs_free)) {
3703 slabp = list_entry(p, struct slab, list);
3704 BUG_ON(slabp->inuse);
3709 STATS_SET_FREEABLE(cachep, i);
3712 spin_unlock(&l3->list_lock);
3713 ac->avail -= batchcount;
3714 memmove(ac->entry, &(ac->entry[batchcount]), sizeof(void *)*ac->avail);
3718 * Release an obj back to its cache. If the obj has a constructed state, it must
3719 * be in this state _before_ it is released. Called with disabled ints.
3721 static inline void __cache_free(struct kmem_cache *cachep, void *objp,
3722 unsigned long caller)
3724 struct array_cache *ac = cpu_cache_get(cachep);
3727 kmemleak_free_recursive(objp, cachep->flags);
3728 objp = cache_free_debugcheck(cachep, objp, caller);
3730 kmemcheck_slab_free(cachep, objp, cachep->object_size);
3733 * Skip calling cache_free_alien() when the platform is not numa.
3734 * This will avoid cache misses that happen while accessing slabp (which
3735 * is per page memory reference) to get nodeid. Instead use a global
3736 * variable to skip the call, which is mostly likely to be present in
3739 if (nr_online_nodes > 1 && cache_free_alien(cachep, objp))
3742 if (likely(ac->avail < ac->limit)) {
3743 STATS_INC_FREEHIT(cachep);
3745 STATS_INC_FREEMISS(cachep);
3746 cache_flusharray(cachep, ac);
3749 ac_put_obj(cachep, ac, objp);
3753 * kmem_cache_alloc - Allocate an object
3754 * @cachep: The cache to allocate from.
3755 * @flags: See kmalloc().
3757 * Allocate an object from this cache. The flags are only relevant
3758 * if the cache has no available objects.
3760 void *kmem_cache_alloc(struct kmem_cache *cachep, gfp_t flags)
3762 void *ret = slab_alloc(cachep, flags, _RET_IP_);
3764 trace_kmem_cache_alloc(_RET_IP_, ret,
3765 cachep->object_size, cachep->size, flags);
3769 EXPORT_SYMBOL(kmem_cache_alloc);
3771 #ifdef CONFIG_TRACING
3773 kmem_cache_alloc_trace(struct kmem_cache *cachep, gfp_t flags, size_t size)
3777 ret = slab_alloc(cachep, flags, _RET_IP_);
3779 trace_kmalloc(_RET_IP_, ret,
3780 size, cachep->size, flags);
3783 EXPORT_SYMBOL(kmem_cache_alloc_trace);
3787 void *kmem_cache_alloc_node(struct kmem_cache *cachep, gfp_t flags, int nodeid)
3789 void *ret = slab_alloc_node(cachep, flags, nodeid, _RET_IP_);
3791 trace_kmem_cache_alloc_node(_RET_IP_, ret,
3792 cachep->object_size, cachep->size,
3797 EXPORT_SYMBOL(kmem_cache_alloc_node);
3799 #ifdef CONFIG_TRACING
3800 void *kmem_cache_alloc_node_trace(struct kmem_cache *cachep,
3807 ret = slab_alloc_node(cachep, flags, nodeid, _RET_IP_);
3809 trace_kmalloc_node(_RET_IP_, ret,
3814 EXPORT_SYMBOL(kmem_cache_alloc_node_trace);
3817 static __always_inline void *
3818 __do_kmalloc_node(size_t size, gfp_t flags, int node, unsigned long caller)
3820 struct kmem_cache *cachep;
3822 cachep = kmem_find_general_cachep(size, flags);
3823 if (unlikely(ZERO_OR_NULL_PTR(cachep)))
3825 return kmem_cache_alloc_node_trace(cachep, flags, node, size);
3828 #if defined(CONFIG_DEBUG_SLAB) || defined(CONFIG_TRACING)
3829 void *__kmalloc_node(size_t size, gfp_t flags, int node)
3831 return __do_kmalloc_node(size, flags, node, _RET_IP_);
3833 EXPORT_SYMBOL(__kmalloc_node);
3835 void *__kmalloc_node_track_caller(size_t size, gfp_t flags,
3836 int node, unsigned long caller)
3838 return __do_kmalloc_node(size, flags, node, caller);
3840 EXPORT_SYMBOL(__kmalloc_node_track_caller);
3842 void *__kmalloc_node(size_t size, gfp_t flags, int node)
3844 return __do_kmalloc_node(size, flags, node, 0);
3846 EXPORT_SYMBOL(__kmalloc_node);
3847 #endif /* CONFIG_DEBUG_SLAB || CONFIG_TRACING */
3848 #endif /* CONFIG_NUMA */
3851 * __do_kmalloc - allocate memory
3852 * @size: how many bytes of memory are required.
3853 * @flags: the type of memory to allocate (see kmalloc).
3854 * @caller: function caller for debug tracking of the caller
3856 static __always_inline void *__do_kmalloc(size_t size, gfp_t flags,
3857 unsigned long caller)
3859 struct kmem_cache *cachep;
3862 /* If you want to save a few bytes .text space: replace
3864 * Then kmalloc uses the uninlined functions instead of the inline
3867 cachep = __find_general_cachep(size, flags);
3868 if (unlikely(ZERO_OR_NULL_PTR(cachep)))
3870 ret = slab_alloc(cachep, flags, caller);
3872 trace_kmalloc(caller, ret,
3873 size, cachep->size, flags);
3879 #if defined(CONFIG_DEBUG_SLAB) || defined(CONFIG_TRACING)
3880 void *__kmalloc(size_t size, gfp_t flags)
3882 return __do_kmalloc(size, flags, _RET_IP_);
3884 EXPORT_SYMBOL(__kmalloc);
3886 void *__kmalloc_track_caller(size_t size, gfp_t flags, unsigned long caller)
3888 return __do_kmalloc(size, flags, caller);
3890 EXPORT_SYMBOL(__kmalloc_track_caller);
3893 void *__kmalloc(size_t size, gfp_t flags)
3895 return __do_kmalloc(size, flags, 0);
3897 EXPORT_SYMBOL(__kmalloc);
3901 * kmem_cache_free - Deallocate an object
3902 * @cachep: The cache the allocation was from.
3903 * @objp: The previously allocated object.
3905 * Free an object which was previously allocated from this
3908 void kmem_cache_free(struct kmem_cache *cachep, void *objp)
3910 unsigned long flags;
3912 local_irq_save(flags);
3913 debug_check_no_locks_freed(objp, cachep->object_size);
3914 if (!(cachep->flags & SLAB_DEBUG_OBJECTS))
3915 debug_check_no_obj_freed(objp, cachep->object_size);
3916 __cache_free(cachep, objp, _RET_IP_);
3917 local_irq_restore(flags);
3919 trace_kmem_cache_free(_RET_IP_, objp);
3921 EXPORT_SYMBOL(kmem_cache_free);
3924 * kfree - free previously allocated memory
3925 * @objp: pointer returned by kmalloc.
3927 * If @objp is NULL, no operation is performed.
3929 * Don't free memory not originally allocated by kmalloc()
3930 * or you will run into trouble.
3932 void kfree(const void *objp)
3934 struct kmem_cache *c;
3935 unsigned long flags;
3937 trace_kfree(_RET_IP_, objp);
3939 if (unlikely(ZERO_OR_NULL_PTR(objp)))
3941 local_irq_save(flags);
3942 kfree_debugcheck(objp);
3943 c = virt_to_cache(objp);
3944 debug_check_no_locks_freed(objp, c->object_size);
3946 debug_check_no_obj_freed(objp, c->object_size);
3947 __cache_free(c, (void *)objp, _RET_IP_);
3948 local_irq_restore(flags);
3950 EXPORT_SYMBOL(kfree);
3953 * This initializes kmem_list3 or resizes various caches for all nodes.
3955 static int alloc_kmemlist(struct kmem_cache *cachep, gfp_t gfp)
3958 struct kmem_list3 *l3;
3959 struct array_cache *new_shared;
3960 struct array_cache **new_alien = NULL;
3962 for_each_online_node(node) {
3964 if (use_alien_caches) {
3965 new_alien = alloc_alien_cache(node, cachep->limit, gfp);
3971 if (cachep->shared) {
3972 new_shared = alloc_arraycache(node,
3973 cachep->shared*cachep->batchcount,
3976 free_alien_cache(new_alien);
3981 l3 = cachep->nodelists[node];
3983 struct array_cache *shared = l3->shared;
3985 spin_lock_irq(&l3->list_lock);
3988 free_block(cachep, shared->entry,
3989 shared->avail, node);
3991 l3->shared = new_shared;
3993 l3->alien = new_alien;
3996 l3->free_limit = (1 + nr_cpus_node(node)) *
3997 cachep->batchcount + cachep->num;
3998 spin_unlock_irq(&l3->list_lock);
4000 free_alien_cache(new_alien);
4003 l3 = kmalloc_node(sizeof(struct kmem_list3), gfp, node);
4005 free_alien_cache(new_alien);
4010 kmem_list3_init(l3);
4011 l3->next_reap = jiffies + REAPTIMEOUT_LIST3 +
4012 ((unsigned long)cachep) % REAPTIMEOUT_LIST3;
4013 l3->shared = new_shared;
4014 l3->alien = new_alien;
4015 l3->free_limit = (1 + nr_cpus_node(node)) *
4016 cachep->batchcount + cachep->num;
4017 cachep->nodelists[node] = l3;
4022 if (!cachep->list.next) {
4023 /* Cache is not active yet. Roll back what we did */
4026 if (cachep->nodelists[node]) {
4027 l3 = cachep->nodelists[node];
4030 free_alien_cache(l3->alien);
4032 cachep->nodelists[node] = NULL;
4040 struct ccupdate_struct {
4041 struct kmem_cache *cachep;
4042 struct array_cache *new[0];
4045 static void do_ccupdate_local(void *info)
4047 struct ccupdate_struct *new = info;
4048 struct array_cache *old;
4051 old = cpu_cache_get(new->cachep);
4053 new->cachep->array[smp_processor_id()] = new->new[smp_processor_id()];
4054 new->new[smp_processor_id()] = old;
4057 /* Always called with the slab_mutex held */
4058 static int do_tune_cpucache(struct kmem_cache *cachep, int limit,
4059 int batchcount, int shared, gfp_t gfp)
4061 struct ccupdate_struct *new;
4064 new = kzalloc(sizeof(*new) + nr_cpu_ids * sizeof(struct array_cache *),
4069 for_each_online_cpu(i) {
4070 new->new[i] = alloc_arraycache(cpu_to_mem(i), limit,
4073 for (i--; i >= 0; i--)
4079 new->cachep = cachep;
4081 on_each_cpu(do_ccupdate_local, (void *)new, 1);
4084 cachep->batchcount = batchcount;
4085 cachep->limit = limit;
4086 cachep->shared = shared;
4088 for_each_online_cpu(i) {
4089 struct array_cache *ccold = new->new[i];
4092 spin_lock_irq(&cachep->nodelists[cpu_to_mem(i)]->list_lock);
4093 free_block(cachep, ccold->entry, ccold->avail, cpu_to_mem(i));
4094 spin_unlock_irq(&cachep->nodelists[cpu_to_mem(i)]->list_lock);
4098 return alloc_kmemlist(cachep, gfp);
4101 /* Called with slab_mutex held always */
4102 static int enable_cpucache(struct kmem_cache *cachep, gfp_t gfp)
4108 * The head array serves three purposes:
4109 * - create a LIFO ordering, i.e. return objects that are cache-warm
4110 * - reduce the number of spinlock operations.
4111 * - reduce the number of linked list operations on the slab and
4112 * bufctl chains: array operations are cheaper.
4113 * The numbers are guessed, we should auto-tune as described by
4116 if (cachep->size > 131072)
4118 else if (cachep->size > PAGE_SIZE)
4120 else if (cachep->size > 1024)
4122 else if (cachep->size > 256)
4128 * CPU bound tasks (e.g. network routing) can exhibit cpu bound
4129 * allocation behaviour: Most allocs on one cpu, most free operations
4130 * on another cpu. For these cases, an efficient object passing between
4131 * cpus is necessary. This is provided by a shared array. The array
4132 * replaces Bonwick's magazine layer.
4133 * On uniprocessor, it's functionally equivalent (but less efficient)
4134 * to a larger limit. Thus disabled by default.
4137 if (cachep->size <= PAGE_SIZE && num_possible_cpus() > 1)
4142 * With debugging enabled, large batchcount lead to excessively long
4143 * periods with disabled local interrupts. Limit the batchcount
4148 err = do_tune_cpucache(cachep, limit, (limit + 1) / 2, shared, gfp);
4150 printk(KERN_ERR "enable_cpucache failed for %s, error %d.\n",
4151 cachep->name, -err);
4156 * Drain an array if it contains any elements taking the l3 lock only if
4157 * necessary. Note that the l3 listlock also protects the array_cache
4158 * if drain_array() is used on the shared array.
4160 static void drain_array(struct kmem_cache *cachep, struct kmem_list3 *l3,
4161 struct array_cache *ac, int force, int node)
4165 if (!ac || !ac->avail)
4167 if (ac->touched && !force) {
4170 spin_lock_irq(&l3->list_lock);
4172 tofree = force ? ac->avail : (ac->limit + 4) / 5;
4173 if (tofree > ac->avail)
4174 tofree = (ac->avail + 1) / 2;
4175 free_block(cachep, ac->entry, tofree, node);
4176 ac->avail -= tofree;
4177 memmove(ac->entry, &(ac->entry[tofree]),
4178 sizeof(void *) * ac->avail);
4180 spin_unlock_irq(&l3->list_lock);
4185 * cache_reap - Reclaim memory from caches.
4186 * @w: work descriptor
4188 * Called from workqueue/eventd every few seconds.
4190 * - clear the per-cpu caches for this CPU.
4191 * - return freeable pages to the main free memory pool.
4193 * If we cannot acquire the cache chain mutex then just give up - we'll try
4194 * again on the next iteration.
4196 static void cache_reap(struct work_struct *w)
4198 struct kmem_cache *searchp;
4199 struct kmem_list3 *l3;
4200 int node = numa_mem_id();
4201 struct delayed_work *work = to_delayed_work(w);
4203 if (!mutex_trylock(&slab_mutex))
4204 /* Give up. Setup the next iteration. */
4207 list_for_each_entry(searchp, &slab_caches, list) {
4211 * We only take the l3 lock if absolutely necessary and we
4212 * have established with reasonable certainty that
4213 * we can do some work if the lock was obtained.
4215 l3 = searchp->nodelists[node];
4217 reap_alien(searchp, l3);
4219 drain_array(searchp, l3, cpu_cache_get(searchp), 0, node);
4222 * These are racy checks but it does not matter
4223 * if we skip one check or scan twice.
4225 if (time_after(l3->next_reap, jiffies))
4228 l3->next_reap = jiffies + REAPTIMEOUT_LIST3;
4230 drain_array(searchp, l3, l3->shared, 0, node);
4232 if (l3->free_touched)
4233 l3->free_touched = 0;
4237 freed = drain_freelist(searchp, l3, (l3->free_limit +
4238 5 * searchp->num - 1) / (5 * searchp->num));
4239 STATS_ADD_REAPED(searchp, freed);
4245 mutex_unlock(&slab_mutex);
4248 /* Set up the next iteration */
4249 schedule_delayed_work(work, round_jiffies_relative(REAPTIMEOUT_CPUC));
4252 #ifdef CONFIG_SLABINFO
4253 void get_slabinfo(struct kmem_cache *cachep, struct slabinfo *sinfo)
4256 unsigned long active_objs;
4257 unsigned long num_objs;
4258 unsigned long active_slabs = 0;
4259 unsigned long num_slabs, free_objects = 0, shared_avail = 0;
4263 struct kmem_list3 *l3;
4267 for_each_online_node(node) {
4268 l3 = cachep->nodelists[node];
4273 spin_lock_irq(&l3->list_lock);
4275 list_for_each_entry(slabp, &l3->slabs_full, list) {
4276 if (slabp->inuse != cachep->num && !error)
4277 error = "slabs_full accounting error";
4278 active_objs += cachep->num;
4281 list_for_each_entry(slabp, &l3->slabs_partial, list) {
4282 if (slabp->inuse == cachep->num && !error)
4283 error = "slabs_partial inuse accounting error";
4284 if (!slabp->inuse && !error)
4285 error = "slabs_partial/inuse accounting error";
4286 active_objs += slabp->inuse;
4289 list_for_each_entry(slabp, &l3->slabs_free, list) {
4290 if (slabp->inuse && !error)
4291 error = "slabs_free/inuse accounting error";
4294 free_objects += l3->free_objects;
4296 shared_avail += l3->shared->avail;
4298 spin_unlock_irq(&l3->list_lock);
4300 num_slabs += active_slabs;
4301 num_objs = num_slabs * cachep->num;
4302 if (num_objs - active_objs != free_objects && !error)
4303 error = "free_objects accounting error";
4305 name = cachep->name;
4307 printk(KERN_ERR "slab: cache %s error: %s\n", name, error);
4309 sinfo->active_objs = active_objs;
4310 sinfo->num_objs = num_objs;
4311 sinfo->active_slabs = active_slabs;
4312 sinfo->num_slabs = num_slabs;
4313 sinfo->shared_avail = shared_avail;
4314 sinfo->limit = cachep->limit;
4315 sinfo->batchcount = cachep->batchcount;
4316 sinfo->shared = cachep->shared;
4317 sinfo->objects_per_slab = cachep->num;
4318 sinfo->cache_order = cachep->gfporder;
4321 void slabinfo_show_stats(struct seq_file *m, struct kmem_cache *cachep)
4325 unsigned long high = cachep->high_mark;
4326 unsigned long allocs = cachep->num_allocations;
4327 unsigned long grown = cachep->grown;
4328 unsigned long reaped = cachep->reaped;
4329 unsigned long errors = cachep->errors;
4330 unsigned long max_freeable = cachep->max_freeable;
4331 unsigned long node_allocs = cachep->node_allocs;
4332 unsigned long node_frees = cachep->node_frees;
4333 unsigned long overflows = cachep->node_overflow;
4335 seq_printf(m, " : globalstat %7lu %6lu %5lu %4lu "
4336 "%4lu %4lu %4lu %4lu %4lu",
4337 allocs, high, grown,
4338 reaped, errors, max_freeable, node_allocs,
4339 node_frees, overflows);
4343 unsigned long allochit = atomic_read(&cachep->allochit);
4344 unsigned long allocmiss = atomic_read(&cachep->allocmiss);
4345 unsigned long freehit = atomic_read(&cachep->freehit);
4346 unsigned long freemiss = atomic_read(&cachep->freemiss);
4348 seq_printf(m, " : cpustat %6lu %6lu %6lu %6lu",
4349 allochit, allocmiss, freehit, freemiss);
4354 #define MAX_SLABINFO_WRITE 128
4356 * slabinfo_write - Tuning for the slab allocator
4358 * @buffer: user buffer
4359 * @count: data length
4362 ssize_t slabinfo_write(struct file *file, const char __user *buffer,
4363 size_t count, loff_t *ppos)
4365 char kbuf[MAX_SLABINFO_WRITE + 1], *tmp;
4366 int limit, batchcount, shared, res;
4367 struct kmem_cache *cachep;
4369 if (count > MAX_SLABINFO_WRITE)
4371 if (copy_from_user(&kbuf, buffer, count))
4373 kbuf[MAX_SLABINFO_WRITE] = '\0';
4375 tmp = strchr(kbuf, ' ');
4380 if (sscanf(tmp, " %d %d %d", &limit, &batchcount, &shared) != 3)
4383 /* Find the cache in the chain of caches. */
4384 mutex_lock(&slab_mutex);
4386 list_for_each_entry(cachep, &slab_caches, list) {
4387 if (!strcmp(cachep->name, kbuf)) {
4388 if (limit < 1 || batchcount < 1 ||
4389 batchcount > limit || shared < 0) {
4392 res = do_tune_cpucache(cachep, limit,
4399 mutex_unlock(&slab_mutex);
4405 #ifdef CONFIG_DEBUG_SLAB_LEAK
4407 static void *leaks_start(struct seq_file *m, loff_t *pos)
4409 mutex_lock(&slab_mutex);
4410 return seq_list_start(&slab_caches, *pos);
4413 static inline int add_caller(unsigned long *n, unsigned long v)
4423 unsigned long *q = p + 2 * i;
4437 memmove(p + 2, p, n[1] * 2 * sizeof(unsigned long) - ((void *)p - (void *)n));
4443 static void handle_slab(unsigned long *n, struct kmem_cache *c, struct slab *s)
4449 for (i = 0, p = s->s_mem; i < c->num; i++, p += c->size) {
4450 if (slab_bufctl(s)[i] != BUFCTL_ACTIVE)
4452 if (!add_caller(n, (unsigned long)*dbg_userword(c, p)))
4457 static void show_symbol(struct seq_file *m, unsigned long address)
4459 #ifdef CONFIG_KALLSYMS
4460 unsigned long offset, size;
4461 char modname[MODULE_NAME_LEN], name[KSYM_NAME_LEN];
4463 if (lookup_symbol_attrs(address, &size, &offset, modname, name) == 0) {
4464 seq_printf(m, "%s+%#lx/%#lx", name, offset, size);
4466 seq_printf(m, " [%s]", modname);
4470 seq_printf(m, "%p", (void *)address);
4473 static int leaks_show(struct seq_file *m, void *p)
4475 struct kmem_cache *cachep = list_entry(p, struct kmem_cache, list);
4477 struct kmem_list3 *l3;
4479 unsigned long *n = m->private;
4483 if (!(cachep->flags & SLAB_STORE_USER))
4485 if (!(cachep->flags & SLAB_RED_ZONE))
4488 /* OK, we can do it */
4492 for_each_online_node(node) {
4493 l3 = cachep->nodelists[node];
4498 spin_lock_irq(&l3->list_lock);
4500 list_for_each_entry(slabp, &l3->slabs_full, list)
4501 handle_slab(n, cachep, slabp);
4502 list_for_each_entry(slabp, &l3->slabs_partial, list)
4503 handle_slab(n, cachep, slabp);
4504 spin_unlock_irq(&l3->list_lock);
4506 name = cachep->name;
4508 /* Increase the buffer size */
4509 mutex_unlock(&slab_mutex);
4510 m->private = kzalloc(n[0] * 4 * sizeof(unsigned long), GFP_KERNEL);
4512 /* Too bad, we are really out */
4514 mutex_lock(&slab_mutex);
4517 *(unsigned long *)m->private = n[0] * 2;
4519 mutex_lock(&slab_mutex);
4520 /* Now make sure this entry will be retried */
4524 for (i = 0; i < n[1]; i++) {
4525 seq_printf(m, "%s: %lu ", name, n[2*i+3]);
4526 show_symbol(m, n[2*i+2]);
4533 static void *s_next(struct seq_file *m, void *p, loff_t *pos)
4535 return seq_list_next(p, &slab_caches, pos);
4538 static void s_stop(struct seq_file *m, void *p)
4540 mutex_unlock(&slab_mutex);
4543 static const struct seq_operations slabstats_op = {
4544 .start = leaks_start,
4550 static int slabstats_open(struct inode *inode, struct file *file)
4552 unsigned long *n = kzalloc(PAGE_SIZE, GFP_KERNEL);
4555 ret = seq_open(file, &slabstats_op);
4557 struct seq_file *m = file->private_data;
4558 *n = PAGE_SIZE / (2 * sizeof(unsigned long));
4567 static const struct file_operations proc_slabstats_operations = {
4568 .open = slabstats_open,
4570 .llseek = seq_lseek,
4571 .release = seq_release_private,
4575 static int __init slab_proc_init(void)
4577 #ifdef CONFIG_DEBUG_SLAB_LEAK
4578 proc_create("slab_allocators", 0, NULL, &proc_slabstats_operations);
4582 module_init(slab_proc_init);
4586 * ksize - get the actual amount of memory allocated for a given object
4587 * @objp: Pointer to the object
4589 * kmalloc may internally round up allocations and return more memory
4590 * than requested. ksize() can be used to determine the actual amount of
4591 * memory allocated. The caller may use this additional memory, even though
4592 * a smaller amount of memory was initially specified with the kmalloc call.
4593 * The caller must guarantee that objp points to a valid object previously
4594 * allocated with either kmalloc() or kmem_cache_alloc(). The object
4595 * must not be freed during the duration of the call.
4597 size_t ksize(const void *objp)
4600 if (unlikely(objp == ZERO_SIZE_PTR))
4603 return virt_to_cache(objp)->object_size;
4605 EXPORT_SYMBOL(ksize);