]>
Commit | Line | Data |
---|---|---|
039363f3 CL |
1 | /* |
2 | * Slab allocator functions that are independent of the allocator strategy | |
3 | * | |
4 | * (C) 2012 Christoph Lameter <cl@linux.com> | |
5 | */ | |
6 | #include <linux/slab.h> | |
7 | ||
8 | #include <linux/mm.h> | |
9 | #include <linux/poison.h> | |
10 | #include <linux/interrupt.h> | |
11 | #include <linux/memory.h> | |
12 | #include <linux/compiler.h> | |
13 | #include <linux/module.h> | |
20cea968 CL |
14 | #include <linux/cpu.h> |
15 | #include <linux/uaccess.h> | |
b7454ad3 GC |
16 | #include <linux/seq_file.h> |
17 | #include <linux/proc_fs.h> | |
039363f3 CL |
18 | #include <asm/cacheflush.h> |
19 | #include <asm/tlbflush.h> | |
20 | #include <asm/page.h> | |
2633d7a0 | 21 | #include <linux/memcontrol.h> |
928cec9c AR |
22 | |
23 | #define CREATE_TRACE_POINTS | |
f1b6eb6e | 24 | #include <trace/events/kmem.h> |
039363f3 | 25 | |
97d06609 CL |
26 | #include "slab.h" |
27 | ||
28 | enum slab_state slab_state; | |
18004c5d CL |
29 | LIST_HEAD(slab_caches); |
30 | DEFINE_MUTEX(slab_mutex); | |
9b030cb8 | 31 | struct kmem_cache *kmem_cache; |
97d06609 | 32 | |
423c929c JK |
33 | /* |
34 | * Set of flags that will prevent slab merging | |
35 | */ | |
36 | #define SLAB_NEVER_MERGE (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER | \ | |
37 | SLAB_TRACE | SLAB_DESTROY_BY_RCU | SLAB_NOLEAKTRACE | \ | |
38 | SLAB_FAILSLAB) | |
39 | ||
3e810ae2 | 40 | #define SLAB_MERGE_SAME (SLAB_RECLAIM_ACCOUNT | SLAB_CACHE_DMA | SLAB_NOTRACK) |
423c929c JK |
41 | |
42 | /* | |
43 | * Merge control. If this is set then no merging of slab caches will occur. | |
44 | * (Could be removed. This was introduced to pacify the merge skeptics.) | |
45 | */ | |
46 | static int slab_nomerge; | |
47 | ||
48 | static int __init setup_slab_nomerge(char *str) | |
49 | { | |
50 | slab_nomerge = 1; | |
51 | return 1; | |
52 | } | |
53 | ||
54 | #ifdef CONFIG_SLUB | |
55 | __setup_param("slub_nomerge", slub_nomerge, setup_slab_nomerge, 0); | |
56 | #endif | |
57 | ||
58 | __setup("slab_nomerge", setup_slab_nomerge); | |
59 | ||
07f361b2 JK |
60 | /* |
61 | * Determine the size of a slab object | |
62 | */ | |
63 | unsigned int kmem_cache_size(struct kmem_cache *s) | |
64 | { | |
65 | return s->object_size; | |
66 | } | |
67 | EXPORT_SYMBOL(kmem_cache_size); | |
68 | ||
77be4b13 | 69 | #ifdef CONFIG_DEBUG_VM |
794b1248 | 70 | static int kmem_cache_sanity_check(const char *name, size_t size) |
039363f3 CL |
71 | { |
72 | struct kmem_cache *s = NULL; | |
73 | ||
039363f3 CL |
74 | if (!name || in_interrupt() || size < sizeof(void *) || |
75 | size > KMALLOC_MAX_SIZE) { | |
77be4b13 SK |
76 | pr_err("kmem_cache_create(%s) integrity check failed\n", name); |
77 | return -EINVAL; | |
039363f3 | 78 | } |
b920536a | 79 | |
20cea968 CL |
80 | list_for_each_entry(s, &slab_caches, list) { |
81 | char tmp; | |
82 | int res; | |
83 | ||
84 | /* | |
85 | * This happens when the module gets unloaded and doesn't | |
86 | * destroy its slab cache and no-one else reuses the vmalloc | |
87 | * area of the module. Print a warning. | |
88 | */ | |
89 | res = probe_kernel_address(s->name, tmp); | |
90 | if (res) { | |
77be4b13 | 91 | pr_err("Slab cache with size %d has lost its name\n", |
20cea968 CL |
92 | s->object_size); |
93 | continue; | |
94 | } | |
20cea968 CL |
95 | } |
96 | ||
97 | WARN_ON(strchr(name, ' ')); /* It confuses parsers */ | |
77be4b13 SK |
98 | return 0; |
99 | } | |
100 | #else | |
794b1248 | 101 | static inline int kmem_cache_sanity_check(const char *name, size_t size) |
77be4b13 SK |
102 | { |
103 | return 0; | |
104 | } | |
20cea968 CL |
105 | #endif |
106 | ||
484748f0 CL |
107 | void __kmem_cache_free_bulk(struct kmem_cache *s, size_t nr, void **p) |
108 | { | |
109 | size_t i; | |
110 | ||
111 | for (i = 0; i < nr; i++) | |
112 | kmem_cache_free(s, p[i]); | |
113 | } | |
114 | ||
115 | bool __kmem_cache_alloc_bulk(struct kmem_cache *s, gfp_t flags, size_t nr, | |
116 | void **p) | |
117 | { | |
118 | size_t i; | |
119 | ||
120 | for (i = 0; i < nr; i++) { | |
121 | void *x = p[i] = kmem_cache_alloc(s, flags); | |
122 | if (!x) { | |
123 | __kmem_cache_free_bulk(s, i, p); | |
124 | return false; | |
125 | } | |
126 | } | |
127 | return true; | |
128 | } | |
129 | ||
55007d84 | 130 | #ifdef CONFIG_MEMCG_KMEM |
f7ce3190 | 131 | void slab_init_memcg_params(struct kmem_cache *s) |
33a690c4 | 132 | { |
f7ce3190 | 133 | s->memcg_params.is_root_cache = true; |
426589f5 | 134 | INIT_LIST_HEAD(&s->memcg_params.list); |
f7ce3190 VD |
135 | RCU_INIT_POINTER(s->memcg_params.memcg_caches, NULL); |
136 | } | |
137 | ||
138 | static int init_memcg_params(struct kmem_cache *s, | |
139 | struct mem_cgroup *memcg, struct kmem_cache *root_cache) | |
140 | { | |
141 | struct memcg_cache_array *arr; | |
33a690c4 | 142 | |
f7ce3190 VD |
143 | if (memcg) { |
144 | s->memcg_params.is_root_cache = false; | |
145 | s->memcg_params.memcg = memcg; | |
146 | s->memcg_params.root_cache = root_cache; | |
33a690c4 | 147 | return 0; |
f7ce3190 | 148 | } |
33a690c4 | 149 | |
f7ce3190 | 150 | slab_init_memcg_params(s); |
33a690c4 | 151 | |
f7ce3190 VD |
152 | if (!memcg_nr_cache_ids) |
153 | return 0; | |
33a690c4 | 154 | |
f7ce3190 VD |
155 | arr = kzalloc(sizeof(struct memcg_cache_array) + |
156 | memcg_nr_cache_ids * sizeof(void *), | |
157 | GFP_KERNEL); | |
158 | if (!arr) | |
159 | return -ENOMEM; | |
33a690c4 | 160 | |
f7ce3190 | 161 | RCU_INIT_POINTER(s->memcg_params.memcg_caches, arr); |
33a690c4 VD |
162 | return 0; |
163 | } | |
164 | ||
f7ce3190 | 165 | static void destroy_memcg_params(struct kmem_cache *s) |
33a690c4 | 166 | { |
f7ce3190 VD |
167 | if (is_root_cache(s)) |
168 | kfree(rcu_access_pointer(s->memcg_params.memcg_caches)); | |
33a690c4 VD |
169 | } |
170 | ||
f7ce3190 | 171 | static int update_memcg_params(struct kmem_cache *s, int new_array_size) |
6f817f4c | 172 | { |
f7ce3190 | 173 | struct memcg_cache_array *old, *new; |
6f817f4c | 174 | |
f7ce3190 VD |
175 | if (!is_root_cache(s)) |
176 | return 0; | |
6f817f4c | 177 | |
f7ce3190 VD |
178 | new = kzalloc(sizeof(struct memcg_cache_array) + |
179 | new_array_size * sizeof(void *), GFP_KERNEL); | |
180 | if (!new) | |
6f817f4c VD |
181 | return -ENOMEM; |
182 | ||
f7ce3190 VD |
183 | old = rcu_dereference_protected(s->memcg_params.memcg_caches, |
184 | lockdep_is_held(&slab_mutex)); | |
185 | if (old) | |
186 | memcpy(new->entries, old->entries, | |
187 | memcg_nr_cache_ids * sizeof(void *)); | |
6f817f4c | 188 | |
f7ce3190 VD |
189 | rcu_assign_pointer(s->memcg_params.memcg_caches, new); |
190 | if (old) | |
191 | kfree_rcu(old, rcu); | |
6f817f4c VD |
192 | return 0; |
193 | } | |
194 | ||
55007d84 GC |
195 | int memcg_update_all_caches(int num_memcgs) |
196 | { | |
197 | struct kmem_cache *s; | |
198 | int ret = 0; | |
55007d84 | 199 | |
05257a1a | 200 | mutex_lock(&slab_mutex); |
55007d84 | 201 | list_for_each_entry(s, &slab_caches, list) { |
f7ce3190 | 202 | ret = update_memcg_params(s, num_memcgs); |
55007d84 | 203 | /* |
55007d84 GC |
204 | * Instead of freeing the memory, we'll just leave the caches |
205 | * up to this point in an updated state. | |
206 | */ | |
207 | if (ret) | |
05257a1a | 208 | break; |
55007d84 | 209 | } |
55007d84 GC |
210 | mutex_unlock(&slab_mutex); |
211 | return ret; | |
212 | } | |
33a690c4 | 213 | #else |
f7ce3190 VD |
214 | static inline int init_memcg_params(struct kmem_cache *s, |
215 | struct mem_cgroup *memcg, struct kmem_cache *root_cache) | |
33a690c4 VD |
216 | { |
217 | return 0; | |
218 | } | |
219 | ||
f7ce3190 | 220 | static inline void destroy_memcg_params(struct kmem_cache *s) |
33a690c4 VD |
221 | { |
222 | } | |
223 | #endif /* CONFIG_MEMCG_KMEM */ | |
55007d84 | 224 | |
423c929c JK |
225 | /* |
226 | * Find a mergeable slab cache | |
227 | */ | |
228 | int slab_unmergeable(struct kmem_cache *s) | |
229 | { | |
230 | if (slab_nomerge || (s->flags & SLAB_NEVER_MERGE)) | |
231 | return 1; | |
232 | ||
233 | if (!is_root_cache(s)) | |
234 | return 1; | |
235 | ||
236 | if (s->ctor) | |
237 | return 1; | |
238 | ||
239 | /* | |
240 | * We may have set a slab to be unmergeable during bootstrap. | |
241 | */ | |
242 | if (s->refcount < 0) | |
243 | return 1; | |
244 | ||
245 | return 0; | |
246 | } | |
247 | ||
248 | struct kmem_cache *find_mergeable(size_t size, size_t align, | |
249 | unsigned long flags, const char *name, void (*ctor)(void *)) | |
250 | { | |
251 | struct kmem_cache *s; | |
252 | ||
253 | if (slab_nomerge || (flags & SLAB_NEVER_MERGE)) | |
254 | return NULL; | |
255 | ||
256 | if (ctor) | |
257 | return NULL; | |
258 | ||
259 | size = ALIGN(size, sizeof(void *)); | |
260 | align = calculate_alignment(flags, align, size); | |
261 | size = ALIGN(size, align); | |
262 | flags = kmem_cache_flags(size, flags, name, NULL); | |
263 | ||
54362057 | 264 | list_for_each_entry_reverse(s, &slab_caches, list) { |
423c929c JK |
265 | if (slab_unmergeable(s)) |
266 | continue; | |
267 | ||
268 | if (size > s->size) | |
269 | continue; | |
270 | ||
271 | if ((flags & SLAB_MERGE_SAME) != (s->flags & SLAB_MERGE_SAME)) | |
272 | continue; | |
273 | /* | |
274 | * Check if alignment is compatible. | |
275 | * Courtesy of Adrian Drzewiecki | |
276 | */ | |
277 | if ((s->size & ~(align - 1)) != s->size) | |
278 | continue; | |
279 | ||
280 | if (s->size - size >= sizeof(void *)) | |
281 | continue; | |
282 | ||
95069ac8 JK |
283 | if (IS_ENABLED(CONFIG_SLAB) && align && |
284 | (align > s->align || s->align % align)) | |
285 | continue; | |
286 | ||
423c929c JK |
287 | return s; |
288 | } | |
289 | return NULL; | |
290 | } | |
291 | ||
45906855 CL |
292 | /* |
293 | * Figure out what the alignment of the objects will be given a set of | |
294 | * flags, a user specified alignment and the size of the objects. | |
295 | */ | |
296 | unsigned long calculate_alignment(unsigned long flags, | |
297 | unsigned long align, unsigned long size) | |
298 | { | |
299 | /* | |
300 | * If the user wants hardware cache aligned objects then follow that | |
301 | * suggestion if the object is sufficiently large. | |
302 | * | |
303 | * The hardware cache alignment cannot override the specified | |
304 | * alignment though. If that is greater then use it. | |
305 | */ | |
306 | if (flags & SLAB_HWCACHE_ALIGN) { | |
307 | unsigned long ralign = cache_line_size(); | |
308 | while (size <= ralign / 2) | |
309 | ralign /= 2; | |
310 | align = max(align, ralign); | |
311 | } | |
312 | ||
313 | if (align < ARCH_SLAB_MINALIGN) | |
314 | align = ARCH_SLAB_MINALIGN; | |
315 | ||
316 | return ALIGN(align, sizeof(void *)); | |
317 | } | |
318 | ||
c9a77a79 VD |
319 | static struct kmem_cache *create_cache(const char *name, |
320 | size_t object_size, size_t size, size_t align, | |
321 | unsigned long flags, void (*ctor)(void *), | |
322 | struct mem_cgroup *memcg, struct kmem_cache *root_cache) | |
794b1248 VD |
323 | { |
324 | struct kmem_cache *s; | |
325 | int err; | |
326 | ||
327 | err = -ENOMEM; | |
328 | s = kmem_cache_zalloc(kmem_cache, GFP_KERNEL); | |
329 | if (!s) | |
330 | goto out; | |
331 | ||
332 | s->name = name; | |
333 | s->object_size = object_size; | |
334 | s->size = size; | |
335 | s->align = align; | |
336 | s->ctor = ctor; | |
337 | ||
f7ce3190 | 338 | err = init_memcg_params(s, memcg, root_cache); |
794b1248 VD |
339 | if (err) |
340 | goto out_free_cache; | |
341 | ||
342 | err = __kmem_cache_create(s, flags); | |
343 | if (err) | |
344 | goto out_free_cache; | |
345 | ||
346 | s->refcount = 1; | |
347 | list_add(&s->list, &slab_caches); | |
794b1248 VD |
348 | out: |
349 | if (err) | |
350 | return ERR_PTR(err); | |
351 | return s; | |
352 | ||
353 | out_free_cache: | |
f7ce3190 | 354 | destroy_memcg_params(s); |
7c4da061 | 355 | kmem_cache_free(kmem_cache, s); |
794b1248 VD |
356 | goto out; |
357 | } | |
45906855 | 358 | |
77be4b13 SK |
359 | /* |
360 | * kmem_cache_create - Create a cache. | |
361 | * @name: A string which is used in /proc/slabinfo to identify this cache. | |
362 | * @size: The size of objects to be created in this cache. | |
363 | * @align: The required alignment for the objects. | |
364 | * @flags: SLAB flags | |
365 | * @ctor: A constructor for the objects. | |
366 | * | |
367 | * Returns a ptr to the cache on success, NULL on failure. | |
368 | * Cannot be called within a interrupt, but can be interrupted. | |
369 | * The @ctor is run when new pages are allocated by the cache. | |
370 | * | |
371 | * The flags are | |
372 | * | |
373 | * %SLAB_POISON - Poison the slab with a known test pattern (a5a5a5a5) | |
374 | * to catch references to uninitialised memory. | |
375 | * | |
376 | * %SLAB_RED_ZONE - Insert `Red' zones around the allocated memory to check | |
377 | * for buffer overruns. | |
378 | * | |
379 | * %SLAB_HWCACHE_ALIGN - Align the objects in this cache to a hardware | |
380 | * cacheline. This can be beneficial if you're counting cycles as closely | |
381 | * as davem. | |
382 | */ | |
2633d7a0 | 383 | struct kmem_cache * |
794b1248 VD |
384 | kmem_cache_create(const char *name, size_t size, size_t align, |
385 | unsigned long flags, void (*ctor)(void *)) | |
77be4b13 | 386 | { |
794b1248 | 387 | struct kmem_cache *s; |
3dec16ea | 388 | const char *cache_name; |
3965fc36 | 389 | int err; |
039363f3 | 390 | |
77be4b13 | 391 | get_online_cpus(); |
03afc0e2 | 392 | get_online_mems(); |
05257a1a | 393 | memcg_get_cache_ids(); |
03afc0e2 | 394 | |
77be4b13 | 395 | mutex_lock(&slab_mutex); |
686d550d | 396 | |
794b1248 | 397 | err = kmem_cache_sanity_check(name, size); |
3aa24f51 AM |
398 | if (err) { |
399 | s = NULL; /* suppress uninit var warning */ | |
3965fc36 | 400 | goto out_unlock; |
3aa24f51 | 401 | } |
686d550d | 402 | |
d8843922 GC |
403 | /* |
404 | * Some allocators will constraint the set of valid flags to a subset | |
405 | * of all flags. We expect them to define CACHE_CREATE_MASK in this | |
406 | * case, and we'll just provide them with a sanitized version of the | |
407 | * passed flags. | |
408 | */ | |
409 | flags &= CACHE_CREATE_MASK; | |
686d550d | 410 | |
794b1248 VD |
411 | s = __kmem_cache_alias(name, size, align, flags, ctor); |
412 | if (s) | |
3965fc36 | 413 | goto out_unlock; |
2633d7a0 | 414 | |
3dec16ea | 415 | cache_name = kstrdup_const(name, GFP_KERNEL); |
794b1248 VD |
416 | if (!cache_name) { |
417 | err = -ENOMEM; | |
418 | goto out_unlock; | |
419 | } | |
7c9adf5a | 420 | |
c9a77a79 VD |
421 | s = create_cache(cache_name, size, size, |
422 | calculate_alignment(flags, align, size), | |
423 | flags, ctor, NULL, NULL); | |
794b1248 VD |
424 | if (IS_ERR(s)) { |
425 | err = PTR_ERR(s); | |
3dec16ea | 426 | kfree_const(cache_name); |
794b1248 | 427 | } |
3965fc36 VD |
428 | |
429 | out_unlock: | |
20cea968 | 430 | mutex_unlock(&slab_mutex); |
03afc0e2 | 431 | |
05257a1a | 432 | memcg_put_cache_ids(); |
03afc0e2 | 433 | put_online_mems(); |
20cea968 CL |
434 | put_online_cpus(); |
435 | ||
ba3253c7 | 436 | if (err) { |
686d550d CL |
437 | if (flags & SLAB_PANIC) |
438 | panic("kmem_cache_create: Failed to create slab '%s'. Error %d\n", | |
439 | name, err); | |
440 | else { | |
441 | printk(KERN_WARNING "kmem_cache_create(%s) failed with error %d", | |
442 | name, err); | |
443 | dump_stack(); | |
444 | } | |
686d550d CL |
445 | return NULL; |
446 | } | |
039363f3 CL |
447 | return s; |
448 | } | |
794b1248 | 449 | EXPORT_SYMBOL(kmem_cache_create); |
2633d7a0 | 450 | |
c9a77a79 | 451 | static int shutdown_cache(struct kmem_cache *s, |
d5b3cf71 VD |
452 | struct list_head *release, bool *need_rcu_barrier) |
453 | { | |
454 | if (__kmem_cache_shutdown(s) != 0) { | |
455 | printk(KERN_ERR "kmem_cache_destroy %s: " | |
456 | "Slab cache still has objects\n", s->name); | |
457 | dump_stack(); | |
458 | return -EBUSY; | |
459 | } | |
460 | ||
461 | if (s->flags & SLAB_DESTROY_BY_RCU) | |
462 | *need_rcu_barrier = true; | |
463 | ||
464 | #ifdef CONFIG_MEMCG_KMEM | |
2a4db7eb | 465 | if (!is_root_cache(s)) |
426589f5 | 466 | list_del(&s->memcg_params.list); |
d5b3cf71 VD |
467 | #endif |
468 | list_move(&s->list, release); | |
469 | return 0; | |
470 | } | |
471 | ||
c9a77a79 | 472 | static void release_caches(struct list_head *release, bool need_rcu_barrier) |
d5b3cf71 VD |
473 | { |
474 | struct kmem_cache *s, *s2; | |
475 | ||
476 | if (need_rcu_barrier) | |
477 | rcu_barrier(); | |
478 | ||
479 | list_for_each_entry_safe(s, s2, release, list) { | |
480 | #ifdef SLAB_SUPPORTS_SYSFS | |
481 | sysfs_slab_remove(s); | |
482 | #else | |
483 | slab_kmem_cache_release(s); | |
484 | #endif | |
485 | } | |
486 | } | |
487 | ||
794b1248 VD |
488 | #ifdef CONFIG_MEMCG_KMEM |
489 | /* | |
776ed0f0 | 490 | * memcg_create_kmem_cache - Create a cache for a memory cgroup. |
794b1248 VD |
491 | * @memcg: The memory cgroup the new cache is for. |
492 | * @root_cache: The parent of the new cache. | |
493 | * | |
494 | * This function attempts to create a kmem cache that will serve allocation | |
495 | * requests going from @memcg to @root_cache. The new cache inherits properties | |
496 | * from its parent. | |
497 | */ | |
d5b3cf71 VD |
498 | void memcg_create_kmem_cache(struct mem_cgroup *memcg, |
499 | struct kmem_cache *root_cache) | |
2633d7a0 | 500 | { |
3e0350a3 | 501 | static char memcg_name_buf[NAME_MAX + 1]; /* protected by slab_mutex */ |
33398cf2 | 502 | struct cgroup_subsys_state *css = &memcg->css; |
f7ce3190 | 503 | struct memcg_cache_array *arr; |
bd673145 | 504 | struct kmem_cache *s = NULL; |
794b1248 | 505 | char *cache_name; |
f7ce3190 | 506 | int idx; |
794b1248 VD |
507 | |
508 | get_online_cpus(); | |
03afc0e2 VD |
509 | get_online_mems(); |
510 | ||
794b1248 VD |
511 | mutex_lock(&slab_mutex); |
512 | ||
2a4db7eb VD |
513 | /* |
514 | * The memory cgroup could have been deactivated while the cache | |
515 | * creation work was pending. | |
516 | */ | |
517 | if (!memcg_kmem_is_active(memcg)) | |
518 | goto out_unlock; | |
519 | ||
f7ce3190 VD |
520 | idx = memcg_cache_id(memcg); |
521 | arr = rcu_dereference_protected(root_cache->memcg_params.memcg_caches, | |
522 | lockdep_is_held(&slab_mutex)); | |
523 | ||
d5b3cf71 VD |
524 | /* |
525 | * Since per-memcg caches are created asynchronously on first | |
526 | * allocation (see memcg_kmem_get_cache()), several threads can try to | |
527 | * create the same cache, but only one of them may succeed. | |
528 | */ | |
f7ce3190 | 529 | if (arr->entries[idx]) |
d5b3cf71 VD |
530 | goto out_unlock; |
531 | ||
f1008365 | 532 | cgroup_name(css->cgroup, memcg_name_buf, sizeof(memcg_name_buf)); |
073ee1c6 | 533 | cache_name = kasprintf(GFP_KERNEL, "%s(%d:%s)", root_cache->name, |
f1008365 | 534 | css->id, memcg_name_buf); |
794b1248 VD |
535 | if (!cache_name) |
536 | goto out_unlock; | |
537 | ||
c9a77a79 VD |
538 | s = create_cache(cache_name, root_cache->object_size, |
539 | root_cache->size, root_cache->align, | |
540 | root_cache->flags, root_cache->ctor, | |
541 | memcg, root_cache); | |
d5b3cf71 VD |
542 | /* |
543 | * If we could not create a memcg cache, do not complain, because | |
544 | * that's not critical at all as we can always proceed with the root | |
545 | * cache. | |
546 | */ | |
bd673145 | 547 | if (IS_ERR(s)) { |
794b1248 | 548 | kfree(cache_name); |
d5b3cf71 | 549 | goto out_unlock; |
bd673145 | 550 | } |
794b1248 | 551 | |
426589f5 VD |
552 | list_add(&s->memcg_params.list, &root_cache->memcg_params.list); |
553 | ||
d5b3cf71 VD |
554 | /* |
555 | * Since readers won't lock (see cache_from_memcg_idx()), we need a | |
556 | * barrier here to ensure nobody will see the kmem_cache partially | |
557 | * initialized. | |
558 | */ | |
559 | smp_wmb(); | |
f7ce3190 | 560 | arr->entries[idx] = s; |
d5b3cf71 | 561 | |
794b1248 VD |
562 | out_unlock: |
563 | mutex_unlock(&slab_mutex); | |
03afc0e2 VD |
564 | |
565 | put_online_mems(); | |
794b1248 | 566 | put_online_cpus(); |
2633d7a0 | 567 | } |
b8529907 | 568 | |
2a4db7eb VD |
569 | void memcg_deactivate_kmem_caches(struct mem_cgroup *memcg) |
570 | { | |
571 | int idx; | |
572 | struct memcg_cache_array *arr; | |
d6e0b7fa | 573 | struct kmem_cache *s, *c; |
2a4db7eb VD |
574 | |
575 | idx = memcg_cache_id(memcg); | |
576 | ||
d6e0b7fa VD |
577 | get_online_cpus(); |
578 | get_online_mems(); | |
579 | ||
2a4db7eb VD |
580 | mutex_lock(&slab_mutex); |
581 | list_for_each_entry(s, &slab_caches, list) { | |
582 | if (!is_root_cache(s)) | |
583 | continue; | |
584 | ||
585 | arr = rcu_dereference_protected(s->memcg_params.memcg_caches, | |
586 | lockdep_is_held(&slab_mutex)); | |
d6e0b7fa VD |
587 | c = arr->entries[idx]; |
588 | if (!c) | |
589 | continue; | |
590 | ||
591 | __kmem_cache_shrink(c, true); | |
2a4db7eb VD |
592 | arr->entries[idx] = NULL; |
593 | } | |
594 | mutex_unlock(&slab_mutex); | |
d6e0b7fa VD |
595 | |
596 | put_online_mems(); | |
597 | put_online_cpus(); | |
2a4db7eb VD |
598 | } |
599 | ||
d5b3cf71 | 600 | void memcg_destroy_kmem_caches(struct mem_cgroup *memcg) |
b8529907 | 601 | { |
d5b3cf71 VD |
602 | LIST_HEAD(release); |
603 | bool need_rcu_barrier = false; | |
604 | struct kmem_cache *s, *s2; | |
b8529907 | 605 | |
d5b3cf71 VD |
606 | get_online_cpus(); |
607 | get_online_mems(); | |
b8529907 | 608 | |
b8529907 | 609 | mutex_lock(&slab_mutex); |
d5b3cf71 | 610 | list_for_each_entry_safe(s, s2, &slab_caches, list) { |
f7ce3190 | 611 | if (is_root_cache(s) || s->memcg_params.memcg != memcg) |
d5b3cf71 VD |
612 | continue; |
613 | /* | |
614 | * The cgroup is about to be freed and therefore has no charges | |
615 | * left. Hence, all its caches must be empty by now. | |
616 | */ | |
c9a77a79 | 617 | BUG_ON(shutdown_cache(s, &release, &need_rcu_barrier)); |
d5b3cf71 VD |
618 | } |
619 | mutex_unlock(&slab_mutex); | |
b8529907 | 620 | |
d5b3cf71 VD |
621 | put_online_mems(); |
622 | put_online_cpus(); | |
623 | ||
c9a77a79 | 624 | release_caches(&release, need_rcu_barrier); |
b8529907 | 625 | } |
794b1248 | 626 | #endif /* CONFIG_MEMCG_KMEM */ |
97d06609 | 627 | |
41a21285 CL |
628 | void slab_kmem_cache_release(struct kmem_cache *s) |
629 | { | |
f7ce3190 | 630 | destroy_memcg_params(s); |
3dec16ea | 631 | kfree_const(s->name); |
41a21285 CL |
632 | kmem_cache_free(kmem_cache, s); |
633 | } | |
634 | ||
945cf2b6 CL |
635 | void kmem_cache_destroy(struct kmem_cache *s) |
636 | { | |
426589f5 | 637 | struct kmem_cache *c, *c2; |
d5b3cf71 VD |
638 | LIST_HEAD(release); |
639 | bool need_rcu_barrier = false; | |
640 | bool busy = false; | |
641 | ||
3942d299 SS |
642 | if (unlikely(!s)) |
643 | return; | |
644 | ||
426589f5 VD |
645 | BUG_ON(!is_root_cache(s)); |
646 | ||
945cf2b6 | 647 | get_online_cpus(); |
03afc0e2 VD |
648 | get_online_mems(); |
649 | ||
945cf2b6 | 650 | mutex_lock(&slab_mutex); |
b8529907 | 651 | |
945cf2b6 | 652 | s->refcount--; |
b8529907 VD |
653 | if (s->refcount) |
654 | goto out_unlock; | |
655 | ||
426589f5 | 656 | for_each_memcg_cache_safe(c, c2, s) { |
c9a77a79 | 657 | if (shutdown_cache(c, &release, &need_rcu_barrier)) |
d5b3cf71 | 658 | busy = true; |
945cf2b6 | 659 | } |
b8529907 | 660 | |
d5b3cf71 | 661 | if (!busy) |
c9a77a79 | 662 | shutdown_cache(s, &release, &need_rcu_barrier); |
b8529907 VD |
663 | |
664 | out_unlock: | |
665 | mutex_unlock(&slab_mutex); | |
d5b3cf71 | 666 | |
03afc0e2 | 667 | put_online_mems(); |
945cf2b6 | 668 | put_online_cpus(); |
d5b3cf71 | 669 | |
c9a77a79 | 670 | release_caches(&release, need_rcu_barrier); |
945cf2b6 CL |
671 | } |
672 | EXPORT_SYMBOL(kmem_cache_destroy); | |
673 | ||
03afc0e2 VD |
674 | /** |
675 | * kmem_cache_shrink - Shrink a cache. | |
676 | * @cachep: The cache to shrink. | |
677 | * | |
678 | * Releases as many slabs as possible for a cache. | |
679 | * To help debugging, a zero exit status indicates all slabs were released. | |
680 | */ | |
681 | int kmem_cache_shrink(struct kmem_cache *cachep) | |
682 | { | |
683 | int ret; | |
684 | ||
685 | get_online_cpus(); | |
686 | get_online_mems(); | |
d6e0b7fa | 687 | ret = __kmem_cache_shrink(cachep, false); |
03afc0e2 VD |
688 | put_online_mems(); |
689 | put_online_cpus(); | |
690 | return ret; | |
691 | } | |
692 | EXPORT_SYMBOL(kmem_cache_shrink); | |
693 | ||
fda90124 | 694 | bool slab_is_available(void) |
97d06609 CL |
695 | { |
696 | return slab_state >= UP; | |
697 | } | |
b7454ad3 | 698 | |
45530c44 CL |
699 | #ifndef CONFIG_SLOB |
700 | /* Create a cache during boot when no slab services are available yet */ | |
701 | void __init create_boot_cache(struct kmem_cache *s, const char *name, size_t size, | |
702 | unsigned long flags) | |
703 | { | |
704 | int err; | |
705 | ||
706 | s->name = name; | |
707 | s->size = s->object_size = size; | |
45906855 | 708 | s->align = calculate_alignment(flags, ARCH_KMALLOC_MINALIGN, size); |
f7ce3190 VD |
709 | |
710 | slab_init_memcg_params(s); | |
711 | ||
45530c44 CL |
712 | err = __kmem_cache_create(s, flags); |
713 | ||
714 | if (err) | |
31ba7346 | 715 | panic("Creation of kmalloc slab %s size=%zu failed. Reason %d\n", |
45530c44 CL |
716 | name, size, err); |
717 | ||
718 | s->refcount = -1; /* Exempt from merging for now */ | |
719 | } | |
720 | ||
721 | struct kmem_cache *__init create_kmalloc_cache(const char *name, size_t size, | |
722 | unsigned long flags) | |
723 | { | |
724 | struct kmem_cache *s = kmem_cache_zalloc(kmem_cache, GFP_NOWAIT); | |
725 | ||
726 | if (!s) | |
727 | panic("Out of memory when creating slab %s\n", name); | |
728 | ||
729 | create_boot_cache(s, name, size, flags); | |
730 | list_add(&s->list, &slab_caches); | |
731 | s->refcount = 1; | |
732 | return s; | |
733 | } | |
734 | ||
9425c58e CL |
735 | struct kmem_cache *kmalloc_caches[KMALLOC_SHIFT_HIGH + 1]; |
736 | EXPORT_SYMBOL(kmalloc_caches); | |
737 | ||
738 | #ifdef CONFIG_ZONE_DMA | |
739 | struct kmem_cache *kmalloc_dma_caches[KMALLOC_SHIFT_HIGH + 1]; | |
740 | EXPORT_SYMBOL(kmalloc_dma_caches); | |
741 | #endif | |
742 | ||
2c59dd65 CL |
743 | /* |
744 | * Conversion table for small slabs sizes / 8 to the index in the | |
745 | * kmalloc array. This is necessary for slabs < 192 since we have non power | |
746 | * of two cache sizes there. The size of larger slabs can be determined using | |
747 | * fls. | |
748 | */ | |
749 | static s8 size_index[24] = { | |
750 | 3, /* 8 */ | |
751 | 4, /* 16 */ | |
752 | 5, /* 24 */ | |
753 | 5, /* 32 */ | |
754 | 6, /* 40 */ | |
755 | 6, /* 48 */ | |
756 | 6, /* 56 */ | |
757 | 6, /* 64 */ | |
758 | 1, /* 72 */ | |
759 | 1, /* 80 */ | |
760 | 1, /* 88 */ | |
761 | 1, /* 96 */ | |
762 | 7, /* 104 */ | |
763 | 7, /* 112 */ | |
764 | 7, /* 120 */ | |
765 | 7, /* 128 */ | |
766 | 2, /* 136 */ | |
767 | 2, /* 144 */ | |
768 | 2, /* 152 */ | |
769 | 2, /* 160 */ | |
770 | 2, /* 168 */ | |
771 | 2, /* 176 */ | |
772 | 2, /* 184 */ | |
773 | 2 /* 192 */ | |
774 | }; | |
775 | ||
776 | static inline int size_index_elem(size_t bytes) | |
777 | { | |
778 | return (bytes - 1) / 8; | |
779 | } | |
780 | ||
781 | /* | |
782 | * Find the kmem_cache structure that serves a given size of | |
783 | * allocation | |
784 | */ | |
785 | struct kmem_cache *kmalloc_slab(size_t size, gfp_t flags) | |
786 | { | |
787 | int index; | |
788 | ||
9de1bc87 | 789 | if (unlikely(size > KMALLOC_MAX_SIZE)) { |
907985f4 | 790 | WARN_ON_ONCE(!(flags & __GFP_NOWARN)); |
6286ae97 | 791 | return NULL; |
907985f4 | 792 | } |
6286ae97 | 793 | |
2c59dd65 CL |
794 | if (size <= 192) { |
795 | if (!size) | |
796 | return ZERO_SIZE_PTR; | |
797 | ||
798 | index = size_index[size_index_elem(size)]; | |
799 | } else | |
800 | index = fls(size - 1); | |
801 | ||
802 | #ifdef CONFIG_ZONE_DMA | |
b1e05416 | 803 | if (unlikely((flags & GFP_DMA))) |
2c59dd65 CL |
804 | return kmalloc_dma_caches[index]; |
805 | ||
806 | #endif | |
807 | return kmalloc_caches[index]; | |
808 | } | |
809 | ||
4066c33d GG |
810 | /* |
811 | * kmalloc_info[] is to make slub_debug=,kmalloc-xx option work at boot time. | |
812 | * kmalloc_index() supports up to 2^26=64MB, so the final entry of the table is | |
813 | * kmalloc-67108864. | |
814 | */ | |
815 | static struct { | |
816 | const char *name; | |
817 | unsigned long size; | |
818 | } const kmalloc_info[] __initconst = { | |
819 | {NULL, 0}, {"kmalloc-96", 96}, | |
820 | {"kmalloc-192", 192}, {"kmalloc-8", 8}, | |
821 | {"kmalloc-16", 16}, {"kmalloc-32", 32}, | |
822 | {"kmalloc-64", 64}, {"kmalloc-128", 128}, | |
823 | {"kmalloc-256", 256}, {"kmalloc-512", 512}, | |
824 | {"kmalloc-1024", 1024}, {"kmalloc-2048", 2048}, | |
825 | {"kmalloc-4096", 4096}, {"kmalloc-8192", 8192}, | |
826 | {"kmalloc-16384", 16384}, {"kmalloc-32768", 32768}, | |
827 | {"kmalloc-65536", 65536}, {"kmalloc-131072", 131072}, | |
828 | {"kmalloc-262144", 262144}, {"kmalloc-524288", 524288}, | |
829 | {"kmalloc-1048576", 1048576}, {"kmalloc-2097152", 2097152}, | |
830 | {"kmalloc-4194304", 4194304}, {"kmalloc-8388608", 8388608}, | |
831 | {"kmalloc-16777216", 16777216}, {"kmalloc-33554432", 33554432}, | |
832 | {"kmalloc-67108864", 67108864} | |
833 | }; | |
834 | ||
f97d5f63 | 835 | /* |
34cc6990 DS |
836 | * Patch up the size_index table if we have strange large alignment |
837 | * requirements for the kmalloc array. This is only the case for | |
838 | * MIPS it seems. The standard arches will not generate any code here. | |
839 | * | |
840 | * Largest permitted alignment is 256 bytes due to the way we | |
841 | * handle the index determination for the smaller caches. | |
842 | * | |
843 | * Make sure that nothing crazy happens if someone starts tinkering | |
844 | * around with ARCH_KMALLOC_MINALIGN | |
f97d5f63 | 845 | */ |
34cc6990 | 846 | void __init setup_kmalloc_cache_index_table(void) |
f97d5f63 CL |
847 | { |
848 | int i; | |
849 | ||
2c59dd65 CL |
850 | BUILD_BUG_ON(KMALLOC_MIN_SIZE > 256 || |
851 | (KMALLOC_MIN_SIZE & (KMALLOC_MIN_SIZE - 1))); | |
852 | ||
853 | for (i = 8; i < KMALLOC_MIN_SIZE; i += 8) { | |
854 | int elem = size_index_elem(i); | |
855 | ||
856 | if (elem >= ARRAY_SIZE(size_index)) | |
857 | break; | |
858 | size_index[elem] = KMALLOC_SHIFT_LOW; | |
859 | } | |
860 | ||
861 | if (KMALLOC_MIN_SIZE >= 64) { | |
862 | /* | |
863 | * The 96 byte size cache is not used if the alignment | |
864 | * is 64 byte. | |
865 | */ | |
866 | for (i = 64 + 8; i <= 96; i += 8) | |
867 | size_index[size_index_elem(i)] = 7; | |
868 | ||
869 | } | |
870 | ||
871 | if (KMALLOC_MIN_SIZE >= 128) { | |
872 | /* | |
873 | * The 192 byte sized cache is not used if the alignment | |
874 | * is 128 byte. Redirect kmalloc to use the 256 byte cache | |
875 | * instead. | |
876 | */ | |
877 | for (i = 128 + 8; i <= 192; i += 8) | |
878 | size_index[size_index_elem(i)] = 8; | |
879 | } | |
34cc6990 DS |
880 | } |
881 | ||
ae6f2462 | 882 | static void __init new_kmalloc_cache(int idx, unsigned long flags) |
a9730fca CL |
883 | { |
884 | kmalloc_caches[idx] = create_kmalloc_cache(kmalloc_info[idx].name, | |
885 | kmalloc_info[idx].size, flags); | |
886 | } | |
887 | ||
34cc6990 DS |
888 | /* |
889 | * Create the kmalloc array. Some of the regular kmalloc arrays | |
890 | * may already have been created because they were needed to | |
891 | * enable allocations for slab creation. | |
892 | */ | |
893 | void __init create_kmalloc_caches(unsigned long flags) | |
894 | { | |
895 | int i; | |
896 | ||
a9730fca CL |
897 | for (i = KMALLOC_SHIFT_LOW; i <= KMALLOC_SHIFT_HIGH; i++) { |
898 | if (!kmalloc_caches[i]) | |
899 | new_kmalloc_cache(i, flags); | |
f97d5f63 | 900 | |
956e46ef | 901 | /* |
a9730fca CL |
902 | * Caches that are not of the two-to-the-power-of size. |
903 | * These have to be created immediately after the | |
904 | * earlier power of two caches | |
956e46ef | 905 | */ |
a9730fca CL |
906 | if (KMALLOC_MIN_SIZE <= 32 && !kmalloc_caches[1] && i == 6) |
907 | new_kmalloc_cache(1, flags); | |
908 | if (KMALLOC_MIN_SIZE <= 64 && !kmalloc_caches[2] && i == 7) | |
909 | new_kmalloc_cache(2, flags); | |
8a965b3b CL |
910 | } |
911 | ||
f97d5f63 CL |
912 | /* Kmalloc array is now usable */ |
913 | slab_state = UP; | |
914 | ||
f97d5f63 CL |
915 | #ifdef CONFIG_ZONE_DMA |
916 | for (i = 0; i <= KMALLOC_SHIFT_HIGH; i++) { | |
917 | struct kmem_cache *s = kmalloc_caches[i]; | |
918 | ||
919 | if (s) { | |
920 | int size = kmalloc_size(i); | |
921 | char *n = kasprintf(GFP_NOWAIT, | |
922 | "dma-kmalloc-%d", size); | |
923 | ||
924 | BUG_ON(!n); | |
925 | kmalloc_dma_caches[i] = create_kmalloc_cache(n, | |
926 | size, SLAB_CACHE_DMA | flags); | |
927 | } | |
928 | } | |
929 | #endif | |
930 | } | |
45530c44 CL |
931 | #endif /* !CONFIG_SLOB */ |
932 | ||
cea371f4 VD |
933 | /* |
934 | * To avoid unnecessary overhead, we pass through large allocation requests | |
935 | * directly to the page allocator. We use __GFP_COMP, because we will need to | |
936 | * know the allocation order to free the pages properly in kfree. | |
937 | */ | |
52383431 VD |
938 | void *kmalloc_order(size_t size, gfp_t flags, unsigned int order) |
939 | { | |
940 | void *ret; | |
941 | struct page *page; | |
942 | ||
943 | flags |= __GFP_COMP; | |
944 | page = alloc_kmem_pages(flags, order); | |
945 | ret = page ? page_address(page) : NULL; | |
946 | kmemleak_alloc(ret, size, 1, flags); | |
0316bec2 | 947 | kasan_kmalloc_large(ret, size); |
52383431 VD |
948 | return ret; |
949 | } | |
950 | EXPORT_SYMBOL(kmalloc_order); | |
951 | ||
f1b6eb6e CL |
952 | #ifdef CONFIG_TRACING |
953 | void *kmalloc_order_trace(size_t size, gfp_t flags, unsigned int order) | |
954 | { | |
955 | void *ret = kmalloc_order(size, flags, order); | |
956 | trace_kmalloc(_RET_IP_, ret, size, PAGE_SIZE << order, flags); | |
957 | return ret; | |
958 | } | |
959 | EXPORT_SYMBOL(kmalloc_order_trace); | |
960 | #endif | |
45530c44 | 961 | |
b7454ad3 | 962 | #ifdef CONFIG_SLABINFO |
e9b4db2b WL |
963 | |
964 | #ifdef CONFIG_SLAB | |
965 | #define SLABINFO_RIGHTS (S_IWUSR | S_IRUSR) | |
966 | #else | |
967 | #define SLABINFO_RIGHTS S_IRUSR | |
968 | #endif | |
969 | ||
b047501c | 970 | static void print_slabinfo_header(struct seq_file *m) |
bcee6e2a GC |
971 | { |
972 | /* | |
973 | * Output format version, so at least we can change it | |
974 | * without _too_ many complaints. | |
975 | */ | |
976 | #ifdef CONFIG_DEBUG_SLAB | |
977 | seq_puts(m, "slabinfo - version: 2.1 (statistics)\n"); | |
978 | #else | |
979 | seq_puts(m, "slabinfo - version: 2.1\n"); | |
980 | #endif | |
981 | seq_puts(m, "# name <active_objs> <num_objs> <objsize> " | |
982 | "<objperslab> <pagesperslab>"); | |
983 | seq_puts(m, " : tunables <limit> <batchcount> <sharedfactor>"); | |
984 | seq_puts(m, " : slabdata <active_slabs> <num_slabs> <sharedavail>"); | |
985 | #ifdef CONFIG_DEBUG_SLAB | |
986 | seq_puts(m, " : globalstat <listallocs> <maxobjs> <grown> <reaped> " | |
987 | "<error> <maxfreeable> <nodeallocs> <remotefrees> <alienoverflow>"); | |
988 | seq_puts(m, " : cpustat <allochit> <allocmiss> <freehit> <freemiss>"); | |
989 | #endif | |
990 | seq_putc(m, '\n'); | |
991 | } | |
992 | ||
1df3b26f | 993 | void *slab_start(struct seq_file *m, loff_t *pos) |
b7454ad3 | 994 | { |
b7454ad3 | 995 | mutex_lock(&slab_mutex); |
b7454ad3 GC |
996 | return seq_list_start(&slab_caches, *pos); |
997 | } | |
998 | ||
276a2439 | 999 | void *slab_next(struct seq_file *m, void *p, loff_t *pos) |
b7454ad3 GC |
1000 | { |
1001 | return seq_list_next(p, &slab_caches, pos); | |
1002 | } | |
1003 | ||
276a2439 | 1004 | void slab_stop(struct seq_file *m, void *p) |
b7454ad3 GC |
1005 | { |
1006 | mutex_unlock(&slab_mutex); | |
1007 | } | |
1008 | ||
749c5415 GC |
1009 | static void |
1010 | memcg_accumulate_slabinfo(struct kmem_cache *s, struct slabinfo *info) | |
1011 | { | |
1012 | struct kmem_cache *c; | |
1013 | struct slabinfo sinfo; | |
749c5415 GC |
1014 | |
1015 | if (!is_root_cache(s)) | |
1016 | return; | |
1017 | ||
426589f5 | 1018 | for_each_memcg_cache(c, s) { |
749c5415 GC |
1019 | memset(&sinfo, 0, sizeof(sinfo)); |
1020 | get_slabinfo(c, &sinfo); | |
1021 | ||
1022 | info->active_slabs += sinfo.active_slabs; | |
1023 | info->num_slabs += sinfo.num_slabs; | |
1024 | info->shared_avail += sinfo.shared_avail; | |
1025 | info->active_objs += sinfo.active_objs; | |
1026 | info->num_objs += sinfo.num_objs; | |
1027 | } | |
1028 | } | |
1029 | ||
b047501c | 1030 | static void cache_show(struct kmem_cache *s, struct seq_file *m) |
b7454ad3 | 1031 | { |
0d7561c6 GC |
1032 | struct slabinfo sinfo; |
1033 | ||
1034 | memset(&sinfo, 0, sizeof(sinfo)); | |
1035 | get_slabinfo(s, &sinfo); | |
1036 | ||
749c5415 GC |
1037 | memcg_accumulate_slabinfo(s, &sinfo); |
1038 | ||
0d7561c6 | 1039 | seq_printf(m, "%-17s %6lu %6lu %6u %4u %4d", |
749c5415 | 1040 | cache_name(s), sinfo.active_objs, sinfo.num_objs, s->size, |
0d7561c6 GC |
1041 | sinfo.objects_per_slab, (1 << sinfo.cache_order)); |
1042 | ||
1043 | seq_printf(m, " : tunables %4u %4u %4u", | |
1044 | sinfo.limit, sinfo.batchcount, sinfo.shared); | |
1045 | seq_printf(m, " : slabdata %6lu %6lu %6lu", | |
1046 | sinfo.active_slabs, sinfo.num_slabs, sinfo.shared_avail); | |
1047 | slabinfo_show_stats(m, s); | |
1048 | seq_putc(m, '\n'); | |
b7454ad3 GC |
1049 | } |
1050 | ||
1df3b26f | 1051 | static int slab_show(struct seq_file *m, void *p) |
749c5415 GC |
1052 | { |
1053 | struct kmem_cache *s = list_entry(p, struct kmem_cache, list); | |
1054 | ||
1df3b26f VD |
1055 | if (p == slab_caches.next) |
1056 | print_slabinfo_header(m); | |
b047501c VD |
1057 | if (is_root_cache(s)) |
1058 | cache_show(s, m); | |
1059 | return 0; | |
1060 | } | |
1061 | ||
1062 | #ifdef CONFIG_MEMCG_KMEM | |
1063 | int memcg_slab_show(struct seq_file *m, void *p) | |
1064 | { | |
1065 | struct kmem_cache *s = list_entry(p, struct kmem_cache, list); | |
1066 | struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m)); | |
1067 | ||
1068 | if (p == slab_caches.next) | |
1069 | print_slabinfo_header(m); | |
f7ce3190 | 1070 | if (!is_root_cache(s) && s->memcg_params.memcg == memcg) |
b047501c VD |
1071 | cache_show(s, m); |
1072 | return 0; | |
749c5415 | 1073 | } |
b047501c | 1074 | #endif |
749c5415 | 1075 | |
b7454ad3 GC |
1076 | /* |
1077 | * slabinfo_op - iterator that generates /proc/slabinfo | |
1078 | * | |
1079 | * Output layout: | |
1080 | * cache-name | |
1081 | * num-active-objs | |
1082 | * total-objs | |
1083 | * object size | |
1084 | * num-active-slabs | |
1085 | * total-slabs | |
1086 | * num-pages-per-slab | |
1087 | * + further values on SMP and with statistics enabled | |
1088 | */ | |
1089 | static const struct seq_operations slabinfo_op = { | |
1df3b26f | 1090 | .start = slab_start, |
276a2439 WL |
1091 | .next = slab_next, |
1092 | .stop = slab_stop, | |
1df3b26f | 1093 | .show = slab_show, |
b7454ad3 GC |
1094 | }; |
1095 | ||
1096 | static int slabinfo_open(struct inode *inode, struct file *file) | |
1097 | { | |
1098 | return seq_open(file, &slabinfo_op); | |
1099 | } | |
1100 | ||
1101 | static const struct file_operations proc_slabinfo_operations = { | |
1102 | .open = slabinfo_open, | |
1103 | .read = seq_read, | |
1104 | .write = slabinfo_write, | |
1105 | .llseek = seq_lseek, | |
1106 | .release = seq_release, | |
1107 | }; | |
1108 | ||
1109 | static int __init slab_proc_init(void) | |
1110 | { | |
e9b4db2b WL |
1111 | proc_create("slabinfo", SLABINFO_RIGHTS, NULL, |
1112 | &proc_slabinfo_operations); | |
b7454ad3 GC |
1113 | return 0; |
1114 | } | |
1115 | module_init(slab_proc_init); | |
1116 | #endif /* CONFIG_SLABINFO */ | |
928cec9c AR |
1117 | |
1118 | static __always_inline void *__do_krealloc(const void *p, size_t new_size, | |
1119 | gfp_t flags) | |
1120 | { | |
1121 | void *ret; | |
1122 | size_t ks = 0; | |
1123 | ||
1124 | if (p) | |
1125 | ks = ksize(p); | |
1126 | ||
0316bec2 AR |
1127 | if (ks >= new_size) { |
1128 | kasan_krealloc((void *)p, new_size); | |
928cec9c | 1129 | return (void *)p; |
0316bec2 | 1130 | } |
928cec9c AR |
1131 | |
1132 | ret = kmalloc_track_caller(new_size, flags); | |
1133 | if (ret && p) | |
1134 | memcpy(ret, p, ks); | |
1135 | ||
1136 | return ret; | |
1137 | } | |
1138 | ||
1139 | /** | |
1140 | * __krealloc - like krealloc() but don't free @p. | |
1141 | * @p: object to reallocate memory for. | |
1142 | * @new_size: how many bytes of memory are required. | |
1143 | * @flags: the type of memory to allocate. | |
1144 | * | |
1145 | * This function is like krealloc() except it never frees the originally | |
1146 | * allocated buffer. Use this if you don't want to free the buffer immediately | |
1147 | * like, for example, with RCU. | |
1148 | */ | |
1149 | void *__krealloc(const void *p, size_t new_size, gfp_t flags) | |
1150 | { | |
1151 | if (unlikely(!new_size)) | |
1152 | return ZERO_SIZE_PTR; | |
1153 | ||
1154 | return __do_krealloc(p, new_size, flags); | |
1155 | ||
1156 | } | |
1157 | EXPORT_SYMBOL(__krealloc); | |
1158 | ||
1159 | /** | |
1160 | * krealloc - reallocate memory. The contents will remain unchanged. | |
1161 | * @p: object to reallocate memory for. | |
1162 | * @new_size: how many bytes of memory are required. | |
1163 | * @flags: the type of memory to allocate. | |
1164 | * | |
1165 | * The contents of the object pointed to are preserved up to the | |
1166 | * lesser of the new and old sizes. If @p is %NULL, krealloc() | |
1167 | * behaves exactly like kmalloc(). If @new_size is 0 and @p is not a | |
1168 | * %NULL pointer, the object pointed to is freed. | |
1169 | */ | |
1170 | void *krealloc(const void *p, size_t new_size, gfp_t flags) | |
1171 | { | |
1172 | void *ret; | |
1173 | ||
1174 | if (unlikely(!new_size)) { | |
1175 | kfree(p); | |
1176 | return ZERO_SIZE_PTR; | |
1177 | } | |
1178 | ||
1179 | ret = __do_krealloc(p, new_size, flags); | |
1180 | if (ret && p != ret) | |
1181 | kfree(p); | |
1182 | ||
1183 | return ret; | |
1184 | } | |
1185 | EXPORT_SYMBOL(krealloc); | |
1186 | ||
1187 | /** | |
1188 | * kzfree - like kfree but zero memory | |
1189 | * @p: object to free memory of | |
1190 | * | |
1191 | * The memory of the object @p points to is zeroed before freed. | |
1192 | * If @p is %NULL, kzfree() does nothing. | |
1193 | * | |
1194 | * Note: this function zeroes the whole allocated buffer which can be a good | |
1195 | * deal bigger than the requested buffer size passed to kmalloc(). So be | |
1196 | * careful when using this function in performance sensitive code. | |
1197 | */ | |
1198 | void kzfree(const void *p) | |
1199 | { | |
1200 | size_t ks; | |
1201 | void *mem = (void *)p; | |
1202 | ||
1203 | if (unlikely(ZERO_OR_NULL_PTR(mem))) | |
1204 | return; | |
1205 | ks = ksize(mem); | |
1206 | memset(mem, 0, ks); | |
1207 | kfree(mem); | |
1208 | } | |
1209 | EXPORT_SYMBOL(kzfree); | |
1210 | ||
1211 | /* Tracepoints definitions. */ | |
1212 | EXPORT_TRACEPOINT_SYMBOL(kmalloc); | |
1213 | EXPORT_TRACEPOINT_SYMBOL(kmem_cache_alloc); | |
1214 | EXPORT_TRACEPOINT_SYMBOL(kmalloc_node); | |
1215 | EXPORT_TRACEPOINT_SYMBOL(kmem_cache_alloc_node); | |
1216 | EXPORT_TRACEPOINT_SYMBOL(kfree); | |
1217 | EXPORT_TRACEPOINT_SYMBOL(kmem_cache_free); |