]>
Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
2e892f43 CL |
2 | * Written by Mark Hemment, 1996 (markhe@nextd.demon.co.uk). |
3 | * | |
cde53535 | 4 | * (C) SGI 2006, Christoph Lameter |
2e892f43 CL |
5 | * Cleaned up and restructured to ease the addition of alternative |
6 | * implementations of SLAB allocators. | |
f1b6eb6e CL |
7 | * (C) Linux Foundation 2008-2013 |
8 | * Unified interface for all slab allocators | |
1da177e4 LT |
9 | */ |
10 | ||
11 | #ifndef _LINUX_SLAB_H | |
12 | #define _LINUX_SLAB_H | |
13 | ||
1b1cec4b | 14 | #include <linux/gfp.h> |
1b1cec4b | 15 | #include <linux/types.h> |
1f458cbf GC |
16 | #include <linux/workqueue.h> |
17 | ||
1da177e4 | 18 | |
2e892f43 CL |
19 | /* |
20 | * Flags to pass to kmem_cache_create(). | |
124dee09 | 21 | * The ones marked DEBUG are only valid if CONFIG_DEBUG_SLAB is set. |
1da177e4 | 22 | */ |
55935a34 | 23 | #define SLAB_DEBUG_FREE 0x00000100UL /* DEBUG: Perform (expensive) checks on free */ |
55935a34 CL |
24 | #define SLAB_RED_ZONE 0x00000400UL /* DEBUG: Red zone objs in a cache */ |
25 | #define SLAB_POISON 0x00000800UL /* DEBUG: Poison objects */ | |
26 | #define SLAB_HWCACHE_ALIGN 0x00002000UL /* Align objs on cache lines */ | |
2e892f43 | 27 | #define SLAB_CACHE_DMA 0x00004000UL /* Use GFP_DMA memory */ |
2e892f43 | 28 | #define SLAB_STORE_USER 0x00010000UL /* DEBUG: Store the last owner for bug hunting */ |
2e892f43 | 29 | #define SLAB_PANIC 0x00040000UL /* Panic if kmem_cache_create() fails */ |
d7de4c1d PZ |
30 | /* |
31 | * SLAB_DESTROY_BY_RCU - **WARNING** READ THIS! | |
32 | * | |
33 | * This delays freeing the SLAB page by a grace period, it does _NOT_ | |
34 | * delay object freeing. This means that if you do kmem_cache_free() | |
35 | * that memory location is free to be reused at any time. Thus it may | |
36 | * be possible to see another object there in the same RCU grace period. | |
37 | * | |
38 | * This feature only ensures the memory location backing the object | |
39 | * stays valid, the trick to using this is relying on an independent | |
40 | * object validation pass. Something like: | |
41 | * | |
42 | * rcu_read_lock() | |
43 | * again: | |
44 | * obj = lockless_lookup(key); | |
45 | * if (obj) { | |
46 | * if (!try_get_ref(obj)) // might fail for free objects | |
47 | * goto again; | |
48 | * | |
49 | * if (obj->key != key) { // not the object we expected | |
50 | * put_ref(obj); | |
51 | * goto again; | |
52 | * } | |
53 | * } | |
54 | * rcu_read_unlock(); | |
55 | * | |
68126702 JK |
56 | * This is useful if we need to approach a kernel structure obliquely, |
57 | * from its address obtained without the usual locking. We can lock | |
58 | * the structure to stabilize it and check it's still at the given address, | |
59 | * only if we can be sure that the memory has not been meanwhile reused | |
60 | * for some other kind of object (which our subsystem's lock might corrupt). | |
61 | * | |
62 | * rcu_read_lock before reading the address, then rcu_read_unlock after | |
63 | * taking the spinlock within the structure expected at that address. | |
d7de4c1d | 64 | */ |
2e892f43 | 65 | #define SLAB_DESTROY_BY_RCU 0x00080000UL /* Defer freeing slabs to RCU */ |
101a5001 | 66 | #define SLAB_MEM_SPREAD 0x00100000UL /* Spread some memory over cpuset */ |
81819f0f | 67 | #define SLAB_TRACE 0x00200000UL /* Trace allocations and frees */ |
1da177e4 | 68 | |
30327acf TG |
69 | /* Flag to prevent checks on free */ |
70 | #ifdef CONFIG_DEBUG_OBJECTS | |
71 | # define SLAB_DEBUG_OBJECTS 0x00400000UL | |
72 | #else | |
73 | # define SLAB_DEBUG_OBJECTS 0x00000000UL | |
74 | #endif | |
75 | ||
d5cff635 CM |
76 | #define SLAB_NOLEAKTRACE 0x00800000UL /* Avoid kmemleak tracing */ |
77 | ||
2dff4405 VN |
78 | /* Don't track use of uninitialized memory */ |
79 | #ifdef CONFIG_KMEMCHECK | |
80 | # define SLAB_NOTRACK 0x01000000UL | |
81 | #else | |
82 | # define SLAB_NOTRACK 0x00000000UL | |
83 | #endif | |
4c13dd3b DM |
84 | #ifdef CONFIG_FAILSLAB |
85 | # define SLAB_FAILSLAB 0x02000000UL /* Fault injection mark */ | |
86 | #else | |
87 | # define SLAB_FAILSLAB 0x00000000UL | |
88 | #endif | |
2dff4405 | 89 | |
e12ba74d MG |
90 | /* The following flags affect the page allocator grouping pages by mobility */ |
91 | #define SLAB_RECLAIM_ACCOUNT 0x00020000UL /* Objects are reclaimable */ | |
92 | #define SLAB_TEMPORARY SLAB_RECLAIM_ACCOUNT /* Objects are short-lived */ | |
6cb8f913 CL |
93 | /* |
94 | * ZERO_SIZE_PTR will be returned for zero sized kmalloc requests. | |
95 | * | |
96 | * Dereferencing ZERO_SIZE_PTR will lead to a distinct access fault. | |
97 | * | |
98 | * ZERO_SIZE_PTR can be passed to kfree though in the same way that NULL can. | |
99 | * Both make kfree a no-op. | |
100 | */ | |
101 | #define ZERO_SIZE_PTR ((void *)16) | |
102 | ||
1d4ec7b1 | 103 | #define ZERO_OR_NULL_PTR(x) ((unsigned long)(x) <= \ |
6cb8f913 CL |
104 | (unsigned long)ZERO_SIZE_PTR) |
105 | ||
f1b6eb6e | 106 | #include <linux/kmemleak.h> |
0316bec2 | 107 | #include <linux/kasan.h> |
3b0efdfa | 108 | |
2633d7a0 | 109 | struct mem_cgroup; |
2e892f43 CL |
110 | /* |
111 | * struct kmem_cache related prototypes | |
112 | */ | |
113 | void __init kmem_cache_init(void); | |
81819f0f | 114 | int slab_is_available(void); |
1da177e4 | 115 | |
2e892f43 | 116 | struct kmem_cache *kmem_cache_create(const char *, size_t, size_t, |
ebe29738 | 117 | unsigned long, |
51cc5068 | 118 | void (*)(void *)); |
2e892f43 CL |
119 | void kmem_cache_destroy(struct kmem_cache *); |
120 | int kmem_cache_shrink(struct kmem_cache *); | |
2a4db7eb VD |
121 | |
122 | void memcg_create_kmem_cache(struct mem_cgroup *, struct kmem_cache *); | |
123 | void memcg_deactivate_kmem_caches(struct mem_cgroup *); | |
124 | void memcg_destroy_kmem_caches(struct mem_cgroup *); | |
2e892f43 | 125 | |
0a31bd5f CL |
126 | /* |
127 | * Please use this macro to create slab caches. Simply specify the | |
128 | * name of the structure and maybe some flags that are listed above. | |
129 | * | |
130 | * The alignment of the struct determines object alignment. If you | |
131 | * f.e. add ____cacheline_aligned_in_smp to the struct declaration | |
132 | * then the objects will be properly aligned in SMP configurations. | |
133 | */ | |
134 | #define KMEM_CACHE(__struct, __flags) kmem_cache_create(#__struct,\ | |
135 | sizeof(struct __struct), __alignof__(struct __struct),\ | |
20c2df83 | 136 | (__flags), NULL) |
0a31bd5f | 137 | |
34504667 CL |
138 | /* |
139 | * Common kmalloc functions provided by all allocators | |
140 | */ | |
141 | void * __must_check __krealloc(const void *, size_t, gfp_t); | |
142 | void * __must_check krealloc(const void *, size_t, gfp_t); | |
143 | void kfree(const void *); | |
144 | void kzfree(const void *); | |
145 | size_t ksize(const void *); | |
146 | ||
c601fd69 CL |
147 | /* |
148 | * Some archs want to perform DMA into kmalloc caches and need a guaranteed | |
149 | * alignment larger than the alignment of a 64-bit integer. | |
150 | * Setting ARCH_KMALLOC_MINALIGN in arch headers allows that. | |
151 | */ | |
152 | #if defined(ARCH_DMA_MINALIGN) && ARCH_DMA_MINALIGN > 8 | |
153 | #define ARCH_KMALLOC_MINALIGN ARCH_DMA_MINALIGN | |
154 | #define KMALLOC_MIN_SIZE ARCH_DMA_MINALIGN | |
155 | #define KMALLOC_SHIFT_LOW ilog2(ARCH_DMA_MINALIGN) | |
4066c33d GG |
156 | /* |
157 | * The KMALLOC_LOOP_LOW is the definition for the for loop index start number | |
158 | * to create the kmalloc_caches object in create_kmalloc_caches(). The first | |
159 | * and the second are 96 and 192. You can see that in the kmalloc_index(), if | |
160 | * the KMALLOC_MIN_SIZE <= 32, then return 1 (96). If KMALLOC_MIN_SIZE <= 64, | |
161 | * then return 2 (192). If the KMALLOC_MIN_SIZE is bigger than 64, we don't | |
162 | * need to initialize 96 and 192. Go directly to start the KMALLOC_SHIFT_LOW. | |
163 | */ | |
164 | #if KMALLOC_MIN_SIZE <= 32 | |
165 | #define KMALLOC_LOOP_LOW 1 | |
166 | #elif KMALLOC_MIN_SIZE <= 64 | |
167 | #define KMALLOC_LOOP_LOW 2 | |
168 | #else | |
169 | #define KMALLOC_LOOP_LOW KMALLOC_SHIFT_LOW | |
170 | #endif | |
171 | ||
c601fd69 CL |
172 | #else |
173 | #define ARCH_KMALLOC_MINALIGN __alignof__(unsigned long long) | |
4066c33d GG |
174 | /* |
175 | * The KMALLOC_MIN_SIZE of slub/slab/slob is 2^3/2^5/2^3. So, even slab is used. | |
176 | * The KMALLOC_MIN_SIZE <= 32. The kmalloc-96 and kmalloc-192 should also be | |
177 | * initialized. | |
178 | */ | |
179 | #define KMALLOC_LOOP_LOW 1 | |
c601fd69 CL |
180 | #endif |
181 | ||
0aa817f0 | 182 | /* |
95a05b42 CL |
183 | * Kmalloc array related definitions |
184 | */ | |
185 | ||
186 | #ifdef CONFIG_SLAB | |
187 | /* | |
188 | * The largest kmalloc size supported by the SLAB allocators is | |
0aa817f0 CL |
189 | * 32 megabyte (2^25) or the maximum allocatable page order if that is |
190 | * less than 32 MB. | |
191 | * | |
192 | * WARNING: Its not easy to increase this value since the allocators have | |
193 | * to do various tricks to work around compiler limitations in order to | |
194 | * ensure proper constant folding. | |
195 | */ | |
debee076 CL |
196 | #define KMALLOC_SHIFT_HIGH ((MAX_ORDER + PAGE_SHIFT - 1) <= 25 ? \ |
197 | (MAX_ORDER + PAGE_SHIFT - 1) : 25) | |
95a05b42 | 198 | #define KMALLOC_SHIFT_MAX KMALLOC_SHIFT_HIGH |
c601fd69 | 199 | #ifndef KMALLOC_SHIFT_LOW |
95a05b42 | 200 | #define KMALLOC_SHIFT_LOW 5 |
c601fd69 | 201 | #endif |
069e2b35 CL |
202 | #endif |
203 | ||
204 | #ifdef CONFIG_SLUB | |
95a05b42 | 205 | /* |
433a91ff DH |
206 | * SLUB directly allocates requests fitting in to an order-1 page |
207 | * (PAGE_SIZE*2). Larger requests are passed to the page allocator. | |
95a05b42 CL |
208 | */ |
209 | #define KMALLOC_SHIFT_HIGH (PAGE_SHIFT + 1) | |
210 | #define KMALLOC_SHIFT_MAX (MAX_ORDER + PAGE_SHIFT) | |
c601fd69 | 211 | #ifndef KMALLOC_SHIFT_LOW |
95a05b42 CL |
212 | #define KMALLOC_SHIFT_LOW 3 |
213 | #endif | |
c601fd69 | 214 | #endif |
0aa817f0 | 215 | |
069e2b35 CL |
216 | #ifdef CONFIG_SLOB |
217 | /* | |
433a91ff | 218 | * SLOB passes all requests larger than one page to the page allocator. |
069e2b35 CL |
219 | * No kmalloc array is necessary since objects of different sizes can |
220 | * be allocated from the same page. | |
221 | */ | |
069e2b35 | 222 | #define KMALLOC_SHIFT_HIGH PAGE_SHIFT |
433a91ff | 223 | #define KMALLOC_SHIFT_MAX 30 |
069e2b35 CL |
224 | #ifndef KMALLOC_SHIFT_LOW |
225 | #define KMALLOC_SHIFT_LOW 3 | |
226 | #endif | |
227 | #endif | |
228 | ||
95a05b42 CL |
229 | /* Maximum allocatable size */ |
230 | #define KMALLOC_MAX_SIZE (1UL << KMALLOC_SHIFT_MAX) | |
231 | /* Maximum size for which we actually use a slab cache */ | |
232 | #define KMALLOC_MAX_CACHE_SIZE (1UL << KMALLOC_SHIFT_HIGH) | |
233 | /* Maximum order allocatable via the slab allocagtor */ | |
234 | #define KMALLOC_MAX_ORDER (KMALLOC_SHIFT_MAX - PAGE_SHIFT) | |
0aa817f0 | 235 | |
ce6a5026 CL |
236 | /* |
237 | * Kmalloc subsystem. | |
238 | */ | |
c601fd69 | 239 | #ifndef KMALLOC_MIN_SIZE |
95a05b42 | 240 | #define KMALLOC_MIN_SIZE (1 << KMALLOC_SHIFT_LOW) |
ce6a5026 CL |
241 | #endif |
242 | ||
24f870d8 JK |
243 | /* |
244 | * This restriction comes from byte sized index implementation. | |
245 | * Page size is normally 2^12 bytes and, in this case, if we want to use | |
246 | * byte sized index which can represent 2^8 entries, the size of the object | |
247 | * should be equal or greater to 2^12 / 2^8 = 2^4 = 16. | |
248 | * If minimum size of kmalloc is less than 16, we use it as minimum object | |
249 | * size and give up to use byte sized index. | |
250 | */ | |
251 | #define SLAB_OBJ_MIN_SIZE (KMALLOC_MIN_SIZE < 16 ? \ | |
252 | (KMALLOC_MIN_SIZE) : 16) | |
253 | ||
069e2b35 | 254 | #ifndef CONFIG_SLOB |
9425c58e CL |
255 | extern struct kmem_cache *kmalloc_caches[KMALLOC_SHIFT_HIGH + 1]; |
256 | #ifdef CONFIG_ZONE_DMA | |
257 | extern struct kmem_cache *kmalloc_dma_caches[KMALLOC_SHIFT_HIGH + 1]; | |
258 | #endif | |
259 | ||
ce6a5026 CL |
260 | /* |
261 | * Figure out which kmalloc slab an allocation of a certain size | |
262 | * belongs to. | |
263 | * 0 = zero alloc | |
264 | * 1 = 65 .. 96 bytes | |
265 | * 2 = 120 .. 192 bytes | |
266 | * n = 2^(n-1) .. 2^n -1 | |
267 | */ | |
268 | static __always_inline int kmalloc_index(size_t size) | |
269 | { | |
270 | if (!size) | |
271 | return 0; | |
272 | ||
273 | if (size <= KMALLOC_MIN_SIZE) | |
274 | return KMALLOC_SHIFT_LOW; | |
275 | ||
276 | if (KMALLOC_MIN_SIZE <= 32 && size > 64 && size <= 96) | |
277 | return 1; | |
278 | if (KMALLOC_MIN_SIZE <= 64 && size > 128 && size <= 192) | |
279 | return 2; | |
280 | if (size <= 8) return 3; | |
281 | if (size <= 16) return 4; | |
282 | if (size <= 32) return 5; | |
283 | if (size <= 64) return 6; | |
284 | if (size <= 128) return 7; | |
285 | if (size <= 256) return 8; | |
286 | if (size <= 512) return 9; | |
287 | if (size <= 1024) return 10; | |
288 | if (size <= 2 * 1024) return 11; | |
289 | if (size <= 4 * 1024) return 12; | |
290 | if (size <= 8 * 1024) return 13; | |
291 | if (size <= 16 * 1024) return 14; | |
292 | if (size <= 32 * 1024) return 15; | |
293 | if (size <= 64 * 1024) return 16; | |
294 | if (size <= 128 * 1024) return 17; | |
295 | if (size <= 256 * 1024) return 18; | |
296 | if (size <= 512 * 1024) return 19; | |
297 | if (size <= 1024 * 1024) return 20; | |
298 | if (size <= 2 * 1024 * 1024) return 21; | |
299 | if (size <= 4 * 1024 * 1024) return 22; | |
300 | if (size <= 8 * 1024 * 1024) return 23; | |
301 | if (size <= 16 * 1024 * 1024) return 24; | |
302 | if (size <= 32 * 1024 * 1024) return 25; | |
303 | if (size <= 64 * 1024 * 1024) return 26; | |
304 | BUG(); | |
305 | ||
306 | /* Will never be reached. Needed because the compiler may complain */ | |
307 | return -1; | |
308 | } | |
069e2b35 | 309 | #endif /* !CONFIG_SLOB */ |
ce6a5026 | 310 | |
f1b6eb6e CL |
311 | void *__kmalloc(size_t size, gfp_t flags); |
312 | void *kmem_cache_alloc(struct kmem_cache *, gfp_t flags); | |
2a4db7eb | 313 | void kmem_cache_free(struct kmem_cache *, void *); |
f1b6eb6e CL |
314 | |
315 | #ifdef CONFIG_NUMA | |
316 | void *__kmalloc_node(size_t size, gfp_t flags, int node); | |
317 | void *kmem_cache_alloc_node(struct kmem_cache *, gfp_t flags, int node); | |
318 | #else | |
319 | static __always_inline void *__kmalloc_node(size_t size, gfp_t flags, int node) | |
320 | { | |
321 | return __kmalloc(size, flags); | |
322 | } | |
323 | ||
324 | static __always_inline void *kmem_cache_alloc_node(struct kmem_cache *s, gfp_t flags, int node) | |
325 | { | |
326 | return kmem_cache_alloc(s, flags); | |
327 | } | |
328 | #endif | |
329 | ||
330 | #ifdef CONFIG_TRACING | |
331 | extern void *kmem_cache_alloc_trace(struct kmem_cache *, gfp_t, size_t); | |
332 | ||
333 | #ifdef CONFIG_NUMA | |
334 | extern void *kmem_cache_alloc_node_trace(struct kmem_cache *s, | |
335 | gfp_t gfpflags, | |
336 | int node, size_t size); | |
337 | #else | |
338 | static __always_inline void * | |
339 | kmem_cache_alloc_node_trace(struct kmem_cache *s, | |
340 | gfp_t gfpflags, | |
341 | int node, size_t size) | |
342 | { | |
343 | return kmem_cache_alloc_trace(s, gfpflags, size); | |
344 | } | |
345 | #endif /* CONFIG_NUMA */ | |
346 | ||
347 | #else /* CONFIG_TRACING */ | |
348 | static __always_inline void *kmem_cache_alloc_trace(struct kmem_cache *s, | |
349 | gfp_t flags, size_t size) | |
350 | { | |
0316bec2 AR |
351 | void *ret = kmem_cache_alloc(s, flags); |
352 | ||
353 | kasan_kmalloc(s, ret, size); | |
354 | return ret; | |
f1b6eb6e CL |
355 | } |
356 | ||
357 | static __always_inline void * | |
358 | kmem_cache_alloc_node_trace(struct kmem_cache *s, | |
359 | gfp_t gfpflags, | |
360 | int node, size_t size) | |
361 | { | |
0316bec2 AR |
362 | void *ret = kmem_cache_alloc_node(s, gfpflags, node); |
363 | ||
364 | kasan_kmalloc(s, ret, size); | |
365 | return ret; | |
f1b6eb6e CL |
366 | } |
367 | #endif /* CONFIG_TRACING */ | |
368 | ||
52383431 | 369 | extern void *kmalloc_order(size_t size, gfp_t flags, unsigned int order); |
f1b6eb6e CL |
370 | |
371 | #ifdef CONFIG_TRACING | |
372 | extern void *kmalloc_order_trace(size_t size, gfp_t flags, unsigned int order); | |
373 | #else | |
374 | static __always_inline void * | |
375 | kmalloc_order_trace(size_t size, gfp_t flags, unsigned int order) | |
376 | { | |
377 | return kmalloc_order(size, flags, order); | |
378 | } | |
ce6a5026 CL |
379 | #endif |
380 | ||
f1b6eb6e CL |
381 | static __always_inline void *kmalloc_large(size_t size, gfp_t flags) |
382 | { | |
383 | unsigned int order = get_order(size); | |
384 | return kmalloc_order_trace(size, flags, order); | |
385 | } | |
386 | ||
387 | /** | |
388 | * kmalloc - allocate memory | |
389 | * @size: how many bytes of memory are required. | |
7e3528c3 | 390 | * @flags: the type of memory to allocate. |
f1b6eb6e CL |
391 | * |
392 | * kmalloc is the normal method of allocating memory | |
393 | * for objects smaller than page size in the kernel. | |
7e3528c3 RD |
394 | * |
395 | * The @flags argument may be one of: | |
396 | * | |
397 | * %GFP_USER - Allocate memory on behalf of user. May sleep. | |
398 | * | |
399 | * %GFP_KERNEL - Allocate normal kernel ram. May sleep. | |
400 | * | |
401 | * %GFP_ATOMIC - Allocation will not sleep. May use emergency pools. | |
402 | * For example, use this inside interrupt handlers. | |
403 | * | |
404 | * %GFP_HIGHUSER - Allocate pages from high memory. | |
405 | * | |
406 | * %GFP_NOIO - Do not do any I/O at all while trying to get memory. | |
407 | * | |
408 | * %GFP_NOFS - Do not make any fs calls while trying to get memory. | |
409 | * | |
410 | * %GFP_NOWAIT - Allocation will not sleep. | |
411 | * | |
e97ca8e5 | 412 | * %__GFP_THISNODE - Allocate node-local memory only. |
7e3528c3 RD |
413 | * |
414 | * %GFP_DMA - Allocation suitable for DMA. | |
415 | * Should only be used for kmalloc() caches. Otherwise, use a | |
416 | * slab created with SLAB_DMA. | |
417 | * | |
418 | * Also it is possible to set different flags by OR'ing | |
419 | * in one or more of the following additional @flags: | |
420 | * | |
421 | * %__GFP_COLD - Request cache-cold pages instead of | |
422 | * trying to return cache-warm pages. | |
423 | * | |
424 | * %__GFP_HIGH - This allocation has high priority and may use emergency pools. | |
425 | * | |
426 | * %__GFP_NOFAIL - Indicate that this allocation is in no way allowed to fail | |
427 | * (think twice before using). | |
428 | * | |
429 | * %__GFP_NORETRY - If memory is not immediately available, | |
430 | * then give up at once. | |
431 | * | |
432 | * %__GFP_NOWARN - If allocation fails, don't issue any warnings. | |
433 | * | |
434 | * %__GFP_REPEAT - If allocation fails initially, try once more before failing. | |
435 | * | |
436 | * There are other flags available as well, but these are not intended | |
437 | * for general use, and so are not documented here. For a full list of | |
438 | * potential flags, always refer to linux/gfp.h. | |
f1b6eb6e CL |
439 | */ |
440 | static __always_inline void *kmalloc(size_t size, gfp_t flags) | |
441 | { | |
442 | if (__builtin_constant_p(size)) { | |
443 | if (size > KMALLOC_MAX_CACHE_SIZE) | |
444 | return kmalloc_large(size, flags); | |
445 | #ifndef CONFIG_SLOB | |
446 | if (!(flags & GFP_DMA)) { | |
447 | int index = kmalloc_index(size); | |
448 | ||
449 | if (!index) | |
450 | return ZERO_SIZE_PTR; | |
451 | ||
452 | return kmem_cache_alloc_trace(kmalloc_caches[index], | |
453 | flags, size); | |
454 | } | |
455 | #endif | |
456 | } | |
457 | return __kmalloc(size, flags); | |
458 | } | |
459 | ||
ce6a5026 CL |
460 | /* |
461 | * Determine size used for the nth kmalloc cache. | |
462 | * return size or 0 if a kmalloc cache for that | |
463 | * size does not exist | |
464 | */ | |
465 | static __always_inline int kmalloc_size(int n) | |
466 | { | |
069e2b35 | 467 | #ifndef CONFIG_SLOB |
ce6a5026 CL |
468 | if (n > 2) |
469 | return 1 << n; | |
470 | ||
471 | if (n == 1 && KMALLOC_MIN_SIZE <= 32) | |
472 | return 96; | |
473 | ||
474 | if (n == 2 && KMALLOC_MIN_SIZE <= 64) | |
475 | return 192; | |
069e2b35 | 476 | #endif |
ce6a5026 CL |
477 | return 0; |
478 | } | |
ce6a5026 | 479 | |
f1b6eb6e CL |
480 | static __always_inline void *kmalloc_node(size_t size, gfp_t flags, int node) |
481 | { | |
482 | #ifndef CONFIG_SLOB | |
483 | if (__builtin_constant_p(size) && | |
23774a2f | 484 | size <= KMALLOC_MAX_CACHE_SIZE && !(flags & GFP_DMA)) { |
f1b6eb6e CL |
485 | int i = kmalloc_index(size); |
486 | ||
487 | if (!i) | |
488 | return ZERO_SIZE_PTR; | |
489 | ||
490 | return kmem_cache_alloc_node_trace(kmalloc_caches[i], | |
491 | flags, node, size); | |
492 | } | |
493 | #endif | |
494 | return __kmalloc_node(size, flags, node); | |
495 | } | |
496 | ||
90810645 CL |
497 | /* |
498 | * Setting ARCH_SLAB_MINALIGN in arch headers allows a different alignment. | |
499 | * Intended for arches that get misalignment faults even for 64 bit integer | |
500 | * aligned buffers. | |
501 | */ | |
3192b920 CL |
502 | #ifndef ARCH_SLAB_MINALIGN |
503 | #define ARCH_SLAB_MINALIGN __alignof__(unsigned long long) | |
504 | #endif | |
f7ce3190 VD |
505 | |
506 | struct memcg_cache_array { | |
507 | struct rcu_head rcu; | |
508 | struct kmem_cache *entries[0]; | |
509 | }; | |
510 | ||
ba6c496e GC |
511 | /* |
512 | * This is the main placeholder for memcg-related information in kmem caches. | |
ba6c496e GC |
513 | * Both the root cache and the child caches will have it. For the root cache, |
514 | * this will hold a dynamically allocated array large enough to hold | |
f8570263 VD |
515 | * information about the currently limited memcgs in the system. To allow the |
516 | * array to be accessed without taking any locks, on relocation we free the old | |
517 | * version only after a grace period. | |
ba6c496e GC |
518 | * |
519 | * Child caches will hold extra metadata needed for its operation. Fields are: | |
520 | * | |
521 | * @memcg: pointer to the memcg this cache belongs to | |
2633d7a0 | 522 | * @root_cache: pointer to the global, root cache, this cache was derived from |
426589f5 VD |
523 | * |
524 | * Both root and child caches of the same kind are linked into a list chained | |
525 | * through @list. | |
ba6c496e GC |
526 | */ |
527 | struct memcg_cache_params { | |
528 | bool is_root_cache; | |
426589f5 | 529 | struct list_head list; |
ba6c496e | 530 | union { |
f7ce3190 | 531 | struct memcg_cache_array __rcu *memcg_caches; |
2633d7a0 GC |
532 | struct { |
533 | struct mem_cgroup *memcg; | |
2633d7a0 GC |
534 | struct kmem_cache *root_cache; |
535 | }; | |
ba6c496e GC |
536 | }; |
537 | }; | |
538 | ||
2633d7a0 GC |
539 | int memcg_update_all_caches(int num_memcgs); |
540 | ||
e7efa615 MO |
541 | /** |
542 | * kmalloc_array - allocate memory for an array. | |
543 | * @n: number of elements. | |
544 | * @size: element size. | |
545 | * @flags: the type of memory to allocate (see kmalloc). | |
800590f5 | 546 | */ |
a8203725 | 547 | static inline void *kmalloc_array(size_t n, size_t size, gfp_t flags) |
1da177e4 | 548 | { |
a3860c1c | 549 | if (size != 0 && n > SIZE_MAX / size) |
6193a2ff | 550 | return NULL; |
a8203725 XW |
551 | return __kmalloc(n * size, flags); |
552 | } | |
553 | ||
554 | /** | |
555 | * kcalloc - allocate memory for an array. The memory is set to zero. | |
556 | * @n: number of elements. | |
557 | * @size: element size. | |
558 | * @flags: the type of memory to allocate (see kmalloc). | |
559 | */ | |
560 | static inline void *kcalloc(size_t n, size_t size, gfp_t flags) | |
561 | { | |
562 | return kmalloc_array(n, size, flags | __GFP_ZERO); | |
1da177e4 LT |
563 | } |
564 | ||
1d2c8eea CH |
565 | /* |
566 | * kmalloc_track_caller is a special version of kmalloc that records the | |
567 | * calling function of the routine calling it for slab leak tracking instead | |
568 | * of just the calling function (confusing, eh?). | |
569 | * It's useful when the call to kmalloc comes from a widely-used standard | |
570 | * allocator where we care about the real place the memory allocation | |
571 | * request comes from. | |
572 | */ | |
ce71e27c | 573 | extern void *__kmalloc_track_caller(size_t, gfp_t, unsigned long); |
1d2c8eea | 574 | #define kmalloc_track_caller(size, flags) \ |
ce71e27c | 575 | __kmalloc_track_caller(size, flags, _RET_IP_) |
1da177e4 | 576 | |
97e2bde4 | 577 | #ifdef CONFIG_NUMA |
ce71e27c | 578 | extern void *__kmalloc_node_track_caller(size_t, gfp_t, int, unsigned long); |
8b98c169 CH |
579 | #define kmalloc_node_track_caller(size, flags, node) \ |
580 | __kmalloc_node_track_caller(size, flags, node, \ | |
ce71e27c | 581 | _RET_IP_) |
2e892f43 | 582 | |
8b98c169 | 583 | #else /* CONFIG_NUMA */ |
8b98c169 CH |
584 | |
585 | #define kmalloc_node_track_caller(size, flags, node) \ | |
586 | kmalloc_track_caller(size, flags) | |
97e2bde4 | 587 | |
dfcd3610 | 588 | #endif /* CONFIG_NUMA */ |
10cef602 | 589 | |
81cda662 CL |
590 | /* |
591 | * Shortcuts | |
592 | */ | |
593 | static inline void *kmem_cache_zalloc(struct kmem_cache *k, gfp_t flags) | |
594 | { | |
595 | return kmem_cache_alloc(k, flags | __GFP_ZERO); | |
596 | } | |
597 | ||
598 | /** | |
599 | * kzalloc - allocate memory. The memory is set to zero. | |
600 | * @size: how many bytes of memory are required. | |
601 | * @flags: the type of memory to allocate (see kmalloc). | |
602 | */ | |
603 | static inline void *kzalloc(size_t size, gfp_t flags) | |
604 | { | |
605 | return kmalloc(size, flags | __GFP_ZERO); | |
606 | } | |
607 | ||
979b0fea JL |
608 | /** |
609 | * kzalloc_node - allocate zeroed memory from a particular memory node. | |
610 | * @size: how many bytes of memory are required. | |
611 | * @flags: the type of memory to allocate (see kmalloc). | |
612 | * @node: memory node from which to allocate | |
613 | */ | |
614 | static inline void *kzalloc_node(size_t size, gfp_t flags, int node) | |
615 | { | |
616 | return kmalloc_node(size, flags | __GFP_ZERO, node); | |
617 | } | |
618 | ||
07f361b2 | 619 | unsigned int kmem_cache_size(struct kmem_cache *s); |
7e85ee0c PE |
620 | void __init kmem_cache_init_late(void); |
621 | ||
1da177e4 | 622 | #endif /* _LINUX_SLAB_H */ |