blob: 45c0356fdc8c086f8b392b5ff6c8813a01679a32 [file] [log] [blame]
Christoph Lameter2e892f42006-12-13 00:34:23 -08001#ifndef _LINUX_SLAB_DEF_H
2#define _LINUX_SLAB_DEF_H
3
4/*
5 * Definitions unique to the original Linux SLAB allocator.
6 *
7 * What we provide here is a way to optimize the frequent kmalloc
8 * calls in the kernel by selecting the appropriate general cache
9 * if kmalloc was called with a size that can be established at
10 * compile time.
11 */
12
13#include <linux/init.h>
14#include <asm/page.h> /* kmalloc_sizes.h needs PAGE_SIZE */
15#include <asm/cache.h> /* kmalloc_sizes.h needs L1_CACHE_BYTES */
16#include <linux/compiler.h>
Li Zefan039ca4e2010-05-26 17:22:17 +080017
David Woodhouse1f0ce8b32010-05-19 12:01:42 +010018/*
Pekka Enberg8eae9852008-05-09 20:32:44 +020019 * struct kmem_cache
20 *
21 * manages a cache.
22 */
23
24struct kmem_cache {
Eric Dumazetb56efcf2011-07-20 19:04:23 +020025/* 1) Cache tunables. Protected by cache_chain_mutex */
Pekka Enberg8eae9852008-05-09 20:32:44 +020026 unsigned int batchcount;
27 unsigned int limit;
28 unsigned int shared;
29
Christoph Lameter3b0efdf2012-06-13 10:24:57 -050030 unsigned int size;
Pekka Enberg8eae9852008-05-09 20:32:44 +020031 u32 reciprocal_buffer_size;
Eric Dumazetb56efcf2011-07-20 19:04:23 +020032/* 2) touched by every alloc & free from the backend */
Pekka Enberg8eae9852008-05-09 20:32:44 +020033
34 unsigned int flags; /* constant flags */
35 unsigned int num; /* # of objs per slab */
36
Eric Dumazetb56efcf2011-07-20 19:04:23 +020037/* 3) cache_grow/shrink */
Pekka Enberg8eae9852008-05-09 20:32:44 +020038 /* order of pgs per slab (2^n) */
39 unsigned int gfporder;
40
41 /* force GFP flags, e.g. GFP_DMA */
Glauber Costaa618e892012-06-14 16:17:21 +040042 gfp_t allocflags;
Pekka Enberg8eae9852008-05-09 20:32:44 +020043
44 size_t colour; /* cache colouring range */
45 unsigned int colour_off; /* colour offset */
46 struct kmem_cache *slabp_cache;
47 unsigned int slab_size;
Pekka Enberg8eae9852008-05-09 20:32:44 +020048
49 /* constructor func */
50 void (*ctor)(void *obj);
51
Eric Dumazetb56efcf2011-07-20 19:04:23 +020052/* 4) cache creation/removal */
Pekka Enberg8eae9852008-05-09 20:32:44 +020053 const char *name;
Christoph Lameter3b0efdf2012-06-13 10:24:57 -050054 struct list_head list;
55 int refcount;
56 int object_size;
57 int align;
Pekka Enberg8eae9852008-05-09 20:32:44 +020058
Eric Dumazetb56efcf2011-07-20 19:04:23 +020059/* 5) statistics */
Pekka Enberg8eae9852008-05-09 20:32:44 +020060#ifdef CONFIG_DEBUG_SLAB
61 unsigned long num_active;
62 unsigned long num_allocations;
63 unsigned long high_mark;
64 unsigned long grown;
65 unsigned long reaped;
66 unsigned long errors;
67 unsigned long max_freeable;
68 unsigned long node_allocs;
69 unsigned long node_frees;
70 unsigned long node_overflow;
71 atomic_t allochit;
72 atomic_t allocmiss;
73 atomic_t freehit;
74 atomic_t freemiss;
75
76 /*
77 * If debugging is enabled, then the allocator can add additional
Christoph Lameter3b0efdf2012-06-13 10:24:57 -050078 * fields and/or padding to every object. size contains the total
Pekka Enberg8eae9852008-05-09 20:32:44 +020079 * object size including these internal fields, the following two
80 * variables contain the offset to the user object and its size.
81 */
82 int obj_offset;
Pekka Enberg8eae9852008-05-09 20:32:44 +020083#endif /* CONFIG_DEBUG_SLAB */
84
Eric Dumazetb56efcf2011-07-20 19:04:23 +020085/* 6) per-cpu/per-node data, touched during every alloc/free */
Pekka Enberg8eae9852008-05-09 20:32:44 +020086 /*
Eric Dumazetb56efcf2011-07-20 19:04:23 +020087 * We put array[] at the end of kmem_cache, because we want to size
88 * this array to nr_cpu_ids slots instead of NR_CPUS
Pekka Enberg8eae9852008-05-09 20:32:44 +020089 * (see kmem_cache_init())
Eric Dumazetb56efcf2011-07-20 19:04:23 +020090 * We still use [NR_CPUS] and not [1] or [0] because cache_cache
91 * is statically defined, so we reserve the max number of cpus.
Christoph Lameter3c583462012-11-28 16:23:01 +000092 *
93 * We also need to guarantee that the list is able to accomodate a
94 * pointer for each node since "nodelists" uses the remainder of
95 * available pointers.
Pekka Enberg8eae9852008-05-09 20:32:44 +020096 */
Eric Dumazetb56efcf2011-07-20 19:04:23 +020097 struct kmem_list3 **nodelists;
Christoph Lameter3c583462012-11-28 16:23:01 +000098 struct array_cache *array[NR_CPUS + MAX_NUMNODES];
Pekka Enberg8eae9852008-05-09 20:32:44 +020099 /*
Eric Dumazetb56efcf2011-07-20 19:04:23 +0200100 * Do not add fields after array[]
Pekka Enberg8eae9852008-05-09 20:32:44 +0200101 */
102};
103
Christoph Lameter2e892f42006-12-13 00:34:23 -0800104/* Size description struct for general caches. */
105struct cache_sizes {
106 size_t cs_size;
107 struct kmem_cache *cs_cachep;
Christoph Lameter4b51d662007-02-10 01:43:10 -0800108#ifdef CONFIG_ZONE_DMA
Christoph Lameter2e892f42006-12-13 00:34:23 -0800109 struct kmem_cache *cs_dmacachep;
Christoph Lameter4b51d662007-02-10 01:43:10 -0800110#endif
Christoph Lameter2e892f42006-12-13 00:34:23 -0800111};
112extern struct cache_sizes malloc_sizes[];
113
Paul Mundt6193a2f2007-07-15 23:38:22 -0700114void *kmem_cache_alloc(struct kmem_cache *, gfp_t);
115void *__kmalloc(size_t size, gfp_t flags);
116
Li Zefan0f24f122009-12-11 15:45:30 +0800117#ifdef CONFIG_TRACING
Ezequiel Garcia40521472012-09-08 17:47:56 -0300118extern void *kmem_cache_alloc_trace(struct kmem_cache *, gfp_t, size_t);
Eduard - Gabriel Munteanu36555752008-08-10 20:14:05 +0300119#else
120static __always_inline void *
Ezequiel Garcia40521472012-09-08 17:47:56 -0300121kmem_cache_alloc_trace(struct kmem_cache *cachep, gfp_t flags, size_t size)
Christoph Lameter2e892f42006-12-13 00:34:23 -0800122{
Eduard - Gabriel Munteanu36555752008-08-10 20:14:05 +0300123 return kmem_cache_alloc(cachep, flags);
124}
Eduard - Gabriel Munteanu36555752008-08-10 20:14:05 +0300125#endif
126
127static __always_inline void *kmalloc(size_t size, gfp_t flags)
128{
129 struct kmem_cache *cachep;
130 void *ret;
131
Christoph Lameter2e892f42006-12-13 00:34:23 -0800132 if (__builtin_constant_p(size)) {
133 int i = 0;
Christoph Lameter6cb8f912007-07-17 04:03:22 -0700134
135 if (!size)
136 return ZERO_SIZE_PTR;
137
Christoph Lameter2e892f42006-12-13 00:34:23 -0800138#define CACHE(x) \
139 if (size <= x) \
140 goto found; \
141 else \
142 i++;
Joe Perches1c61fc42008-03-05 13:58:17 -0800143#include <linux/kmalloc_sizes.h>
Christoph Lameter2e892f42006-12-13 00:34:23 -0800144#undef CACHE
Jeff Mahoney1cf3eb22009-01-27 23:48:59 +0200145 return NULL;
Christoph Lameter2e892f42006-12-13 00:34:23 -0800146found:
Christoph Lameter4b51d662007-02-10 01:43:10 -0800147#ifdef CONFIG_ZONE_DMA
148 if (flags & GFP_DMA)
Eduard - Gabriel Munteanu36555752008-08-10 20:14:05 +0300149 cachep = malloc_sizes[i].cs_dmacachep;
150 else
Christoph Lameter4b51d662007-02-10 01:43:10 -0800151#endif
Eduard - Gabriel Munteanu36555752008-08-10 20:14:05 +0300152 cachep = malloc_sizes[i].cs_cachep;
153
Ezequiel Garcia40521472012-09-08 17:47:56 -0300154 ret = kmem_cache_alloc_trace(cachep, flags, size);
Eduard - Gabriel Munteanu36555752008-08-10 20:14:05 +0300155
156 return ret;
Christoph Lameter2e892f42006-12-13 00:34:23 -0800157 }
158 return __kmalloc(size, flags);
159}
160
Christoph Lameter2e892f42006-12-13 00:34:23 -0800161#ifdef CONFIG_NUMA
162extern void *__kmalloc_node(size_t size, gfp_t flags, int node);
Paul Mundt6193a2f2007-07-15 23:38:22 -0700163extern void *kmem_cache_alloc_node(struct kmem_cache *, gfp_t flags, int node);
Christoph Lameter2e892f42006-12-13 00:34:23 -0800164
Li Zefan0f24f122009-12-11 15:45:30 +0800165#ifdef CONFIG_TRACING
Ezequiel Garciadffa3f92012-09-26 09:21:33 -0300166extern void *kmem_cache_alloc_node_trace(struct kmem_cache *cachep,
Steven Rostedt85beb582010-11-24 16:23:34 -0500167 gfp_t flags,
Ezequiel Garciadffa3f92012-09-26 09:21:33 -0300168 int nodeid,
169 size_t size);
Eduard - Gabriel Munteanu36555752008-08-10 20:14:05 +0300170#else
171static __always_inline void *
Ezequiel Garciadffa3f92012-09-26 09:21:33 -0300172kmem_cache_alloc_node_trace(struct kmem_cache *cachep,
Steven Rostedt85beb582010-11-24 16:23:34 -0500173 gfp_t flags,
Ezequiel Garciadffa3f92012-09-26 09:21:33 -0300174 int nodeid,
175 size_t size)
Christoph Lameter2e892f42006-12-13 00:34:23 -0800176{
Eduard - Gabriel Munteanu36555752008-08-10 20:14:05 +0300177 return kmem_cache_alloc_node(cachep, flags, nodeid);
178}
179#endif
180
181static __always_inline void *kmalloc_node(size_t size, gfp_t flags, int node)
182{
183 struct kmem_cache *cachep;
Eduard - Gabriel Munteanu36555752008-08-10 20:14:05 +0300184
Christoph Lameter2e892f42006-12-13 00:34:23 -0800185 if (__builtin_constant_p(size)) {
186 int i = 0;
Christoph Lameter6cb8f912007-07-17 04:03:22 -0700187
188 if (!size)
189 return ZERO_SIZE_PTR;
190
Christoph Lameter2e892f42006-12-13 00:34:23 -0800191#define CACHE(x) \
192 if (size <= x) \
193 goto found; \
194 else \
195 i++;
Joe Perches1c61fc42008-03-05 13:58:17 -0800196#include <linux/kmalloc_sizes.h>
Christoph Lameter2e892f42006-12-13 00:34:23 -0800197#undef CACHE
Jeff Mahoney1cf3eb22009-01-27 23:48:59 +0200198 return NULL;
Christoph Lameter2e892f42006-12-13 00:34:23 -0800199found:
Christoph Lameter4b51d662007-02-10 01:43:10 -0800200#ifdef CONFIG_ZONE_DMA
201 if (flags & GFP_DMA)
Eduard - Gabriel Munteanu36555752008-08-10 20:14:05 +0300202 cachep = malloc_sizes[i].cs_dmacachep;
203 else
Christoph Lameter4b51d662007-02-10 01:43:10 -0800204#endif
Eduard - Gabriel Munteanu36555752008-08-10 20:14:05 +0300205 cachep = malloc_sizes[i].cs_cachep;
206
Ezequiel Garciadffa3f92012-09-26 09:21:33 -0300207 return kmem_cache_alloc_node_trace(cachep, flags, node, size);
Christoph Lameter2e892f42006-12-13 00:34:23 -0800208 }
209 return __kmalloc_node(size, flags, node);
210}
211
212#endif /* CONFIG_NUMA */
213
Christoph Lameter2e892f42006-12-13 00:34:23 -0800214#endif /* _LINUX_SLAB_DEF_H */