blob: e2e98af703ea9fdcbab4bcd034bc82a1482c9ca6 [file] [log] [blame]
Christoph Lameter039363f2012-07-06 15:25:10 -05001/*
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>
Christoph Lameter20cea962012-07-06 15:25:13 -050014#include <linux/cpu.h>
15#include <linux/uaccess.h>
Glauber Costab7454ad2012-10-19 18:20:25 +040016#include <linux/seq_file.h>
17#include <linux/proc_fs.h>
Christoph Lameter039363f2012-07-06 15:25:10 -050018#include <asm/cacheflush.h>
19#include <asm/tlbflush.h>
20#include <asm/page.h>
Glauber Costa2633d7a2012-12-18 14:22:34 -080021#include <linux/memcontrol.h>
Christoph Lameterf1b6eb62013-09-04 16:35:34 +000022#include <trace/events/kmem.h>
Christoph Lameter039363f2012-07-06 15:25:10 -050023
Christoph Lameter97d06602012-07-06 15:25:11 -050024#include "slab.h"
25
26enum slab_state slab_state;
Christoph Lameter18004c52012-07-06 15:25:12 -050027LIST_HEAD(slab_caches);
28DEFINE_MUTEX(slab_mutex);
Christoph Lameter9b030cb2012-09-05 00:20:33 +000029struct kmem_cache *kmem_cache;
Christoph Lameter97d06602012-07-06 15:25:11 -050030
Shuah Khan77be4b12012-08-16 00:09:46 -070031#ifdef CONFIG_DEBUG_VM
Glauber Costa2633d7a2012-12-18 14:22:34 -080032static int kmem_cache_sanity_check(struct mem_cgroup *memcg, const char *name,
33 size_t size)
Shuah Khan77be4b12012-08-16 00:09:46 -070034{
35 struct kmem_cache *s = NULL;
36
37 if (!name || in_interrupt() || size < sizeof(void *) ||
38 size > KMALLOC_MAX_SIZE) {
39 pr_err("kmem_cache_create(%s) integrity check failed\n", name);
40 return -EINVAL;
41 }
42
43 list_for_each_entry(s, &slab_caches, list) {
44 char tmp;
45 int res;
46
47 /*
48 * This happens when the module gets unloaded and doesn't
49 * destroy its slab cache and no-one else reuses the vmalloc
50 * area of the module. Print a warning.
51 */
52 res = probe_kernel_address(s->name, tmp);
53 if (res) {
54 pr_err("Slab cache with size %d has lost its name\n",
55 s->object_size);
56 continue;
57 }
58
Christoph Lameter3e374912013-09-21 21:56:34 +000059#if !defined(CONFIG_SLUB) || !defined(CONFIG_SLUB_DEBUG_ON)
Glauber Costa2633d7a2012-12-18 14:22:34 -080060 /*
61 * For simplicity, we won't check this in the list of memcg
62 * caches. We have control over memcg naming, and if there
63 * aren't duplicates in the global list, there won't be any
64 * duplicates in the memcg lists as well.
65 */
66 if (!memcg && !strcmp(s->name, name)) {
Shuah Khan77be4b12012-08-16 00:09:46 -070067 pr_err("%s (%s): Cache name already exists.\n",
68 __func__, name);
69 dump_stack();
70 s = NULL;
71 return -EINVAL;
72 }
Christoph Lameter3e374912013-09-21 21:56:34 +000073#endif
Shuah Khan77be4b12012-08-16 00:09:46 -070074 }
75
76 WARN_ON(strchr(name, ' ')); /* It confuses parsers */
77 return 0;
78}
79#else
Glauber Costa2633d7a2012-12-18 14:22:34 -080080static inline int kmem_cache_sanity_check(struct mem_cgroup *memcg,
81 const char *name, size_t size)
Shuah Khan77be4b12012-08-16 00:09:46 -070082{
83 return 0;
84}
85#endif
86
Glauber Costa55007d82012-12-18 14:22:38 -080087#ifdef CONFIG_MEMCG_KMEM
88int memcg_update_all_caches(int num_memcgs)
89{
90 struct kmem_cache *s;
91 int ret = 0;
92 mutex_lock(&slab_mutex);
93
94 list_for_each_entry(s, &slab_caches, list) {
95 if (!is_root_cache(s))
96 continue;
97
98 ret = memcg_update_cache_size(s, num_memcgs);
99 /*
100 * See comment in memcontrol.c, memcg_update_cache_size:
101 * Instead of freeing the memory, we'll just leave the caches
102 * up to this point in an updated state.
103 */
104 if (ret)
105 goto out;
106 }
107
108 memcg_update_array_size(num_memcgs);
109out:
110 mutex_unlock(&slab_mutex);
111 return ret;
112}
113#endif
114
Christoph Lameter039363f2012-07-06 15:25:10 -0500115/*
Christoph Lameter45906852012-11-28 16:23:16 +0000116 * Figure out what the alignment of the objects will be given a set of
117 * flags, a user specified alignment and the size of the objects.
118 */
119unsigned long calculate_alignment(unsigned long flags,
120 unsigned long align, unsigned long size)
121{
122 /*
123 * If the user wants hardware cache aligned objects then follow that
124 * suggestion if the object is sufficiently large.
125 *
126 * The hardware cache alignment cannot override the specified
127 * alignment though. If that is greater then use it.
128 */
129 if (flags & SLAB_HWCACHE_ALIGN) {
130 unsigned long ralign = cache_line_size();
131 while (size <= ralign / 2)
132 ralign /= 2;
133 align = max(align, ralign);
134 }
135
136 if (align < ARCH_SLAB_MINALIGN)
137 align = ARCH_SLAB_MINALIGN;
138
139 return ALIGN(align, sizeof(void *));
140}
141
142
143/*
Christoph Lameter039363f2012-07-06 15:25:10 -0500144 * kmem_cache_create - Create a cache.
145 * @name: A string which is used in /proc/slabinfo to identify this cache.
146 * @size: The size of objects to be created in this cache.
147 * @align: The required alignment for the objects.
148 * @flags: SLAB flags
149 * @ctor: A constructor for the objects.
150 *
151 * Returns a ptr to the cache on success, NULL on failure.
152 * Cannot be called within a interrupt, but can be interrupted.
153 * The @ctor is run when new pages are allocated by the cache.
154 *
155 * The flags are
156 *
157 * %SLAB_POISON - Poison the slab with a known test pattern (a5a5a5a5)
158 * to catch references to uninitialised memory.
159 *
160 * %SLAB_RED_ZONE - Insert `Red' zones around the allocated memory to check
161 * for buffer overruns.
162 *
163 * %SLAB_HWCACHE_ALIGN - Align the objects in this cache to a hardware
164 * cacheline. This can be beneficial if you're counting cycles as closely
165 * as davem.
166 */
167
Glauber Costa2633d7a2012-12-18 14:22:34 -0800168struct kmem_cache *
169kmem_cache_create_memcg(struct mem_cgroup *memcg, const char *name, size_t size,
Glauber Costa943a4512012-12-18 14:23:03 -0800170 size_t align, unsigned long flags, void (*ctor)(void *),
171 struct kmem_cache *parent_cache)
Christoph Lameter039363f2012-07-06 15:25:10 -0500172{
173 struct kmem_cache *s = NULL;
Christoph Lameter686d5502012-09-05 00:20:33 +0000174 int err = 0;
Christoph Lameter039363f2012-07-06 15:25:10 -0500175
Pekka Enbergb9205362012-08-16 10:12:18 +0300176 get_online_cpus();
177 mutex_lock(&slab_mutex);
Christoph Lameter686d5502012-09-05 00:20:33 +0000178
Glauber Costa2633d7a2012-12-18 14:22:34 -0800179 if (!kmem_cache_sanity_check(memcg, name, size) == 0)
Christoph Lameter686d5502012-09-05 00:20:33 +0000180 goto out_locked;
181
Glauber Costad8843922012-10-17 15:36:51 +0400182 /*
183 * Some allocators will constraint the set of valid flags to a subset
184 * of all flags. We expect them to define CACHE_CREATE_MASK in this
185 * case, and we'll just provide them with a sanitized version of the
186 * passed flags.
187 */
188 flags &= CACHE_CREATE_MASK;
Christoph Lameter686d5502012-09-05 00:20:33 +0000189
Glauber Costa2633d7a2012-12-18 14:22:34 -0800190 s = __kmem_cache_alias(memcg, name, size, align, flags, ctor);
Christoph Lametercbb79692012-09-05 00:18:32 +0000191 if (s)
192 goto out_locked;
193
Christoph Lameter278b1bb2012-09-05 00:20:34 +0000194 s = kmem_cache_zalloc(kmem_cache, GFP_KERNEL);
Christoph Lameterdb265ec2012-09-04 23:18:33 +0000195 if (s) {
Christoph Lameter8a13a4c2012-09-04 23:18:33 +0000196 s->object_size = s->size = size;
Christoph Lameter45906852012-11-28 16:23:16 +0000197 s->align = calculate_alignment(flags, align, size);
Christoph Lameter8a13a4c2012-09-04 23:18:33 +0000198 s->ctor = ctor;
Glauber Costa2633d7a2012-12-18 14:22:34 -0800199
Glauber Costa943a4512012-12-18 14:23:03 -0800200 if (memcg_register_cache(memcg, s, parent_cache)) {
Glauber Costa2633d7a2012-12-18 14:22:34 -0800201 kmem_cache_free(kmem_cache, s);
202 err = -ENOMEM;
203 goto out_locked;
204 }
205
Christoph Lameter8a13a4c2012-09-04 23:18:33 +0000206 s->name = kstrdup(name, GFP_KERNEL);
207 if (!s->name) {
208 kmem_cache_free(kmem_cache, s);
209 err = -ENOMEM;
210 goto out_locked;
211 }
212
213 err = __kmem_cache_create(s, flags);
Christoph Lametercce89f42012-09-04 23:38:33 +0000214 if (!err) {
Christoph Lametercce89f42012-09-04 23:38:33 +0000215 s->refcount = 1;
Christoph Lameterdb265ec2012-09-04 23:18:33 +0000216 list_add(&s->list, &slab_caches);
Glauber Costa2633d7a2012-12-18 14:22:34 -0800217 memcg_cache_list_add(memcg, s);
Christoph Lametercce89f42012-09-04 23:38:33 +0000218 } else {
Christoph Lameter8a13a4c2012-09-04 23:18:33 +0000219 kfree(s->name);
Christoph Lameter278b1bb2012-09-05 00:20:34 +0000220 kmem_cache_free(kmem_cache, s);
221 }
Christoph Lameter8a13a4c2012-09-04 23:18:33 +0000222 } else
Christoph Lameter278b1bb2012-09-05 00:20:34 +0000223 err = -ENOMEM;
Christoph Lameter7c9adf52012-09-04 23:38:33 +0000224
Christoph Lameter686d5502012-09-05 00:20:33 +0000225out_locked:
Christoph Lameter20cea962012-07-06 15:25:13 -0500226 mutex_unlock(&slab_mutex);
227 put_online_cpus();
228
Christoph Lameter686d5502012-09-05 00:20:33 +0000229 if (err) {
230
231 if (flags & SLAB_PANIC)
232 panic("kmem_cache_create: Failed to create slab '%s'. Error %d\n",
233 name, err);
234 else {
235 printk(KERN_WARNING "kmem_cache_create(%s) failed with error %d",
236 name, err);
237 dump_stack();
238 }
239
240 return NULL;
241 }
Christoph Lameter039363f2012-07-06 15:25:10 -0500242
243 return s;
244}
Glauber Costa2633d7a2012-12-18 14:22:34 -0800245
246struct kmem_cache *
247kmem_cache_create(const char *name, size_t size, size_t align,
248 unsigned long flags, void (*ctor)(void *))
249{
Glauber Costa943a4512012-12-18 14:23:03 -0800250 return kmem_cache_create_memcg(NULL, name, size, align, flags, ctor, NULL);
Glauber Costa2633d7a2012-12-18 14:22:34 -0800251}
Christoph Lameter039363f2012-07-06 15:25:10 -0500252EXPORT_SYMBOL(kmem_cache_create);
Christoph Lameter97d06602012-07-06 15:25:11 -0500253
Christoph Lameter945cf2b2012-09-04 23:18:33 +0000254void kmem_cache_destroy(struct kmem_cache *s)
255{
Glauber Costa7cf27982012-12-18 14:22:55 -0800256 /* Destroy all the children caches if we aren't a memcg cache */
257 kmem_cache_destroy_memcg_children(s);
258
Christoph Lameter945cf2b2012-09-04 23:18:33 +0000259 get_online_cpus();
260 mutex_lock(&slab_mutex);
261 s->refcount--;
262 if (!s->refcount) {
263 list_del(&s->list);
264
265 if (!__kmem_cache_shutdown(s)) {
Jiri Kosina210ed9d2012-10-08 09:26:01 +0200266 mutex_unlock(&slab_mutex);
Christoph Lameter945cf2b2012-09-04 23:18:33 +0000267 if (s->flags & SLAB_DESTROY_BY_RCU)
268 rcu_barrier();
269
Glauber Costa2633d7a2012-12-18 14:22:34 -0800270 memcg_release_cache(s);
Christoph Lameterdb265ec2012-09-04 23:18:33 +0000271 kfree(s->name);
Christoph Lameter8f4c7652012-09-05 00:18:32 +0000272 kmem_cache_free(kmem_cache, s);
Christoph Lameter945cf2b2012-09-04 23:18:33 +0000273 } else {
274 list_add(&s->list, &slab_caches);
Jiri Kosina210ed9d2012-10-08 09:26:01 +0200275 mutex_unlock(&slab_mutex);
Christoph Lameter945cf2b2012-09-04 23:18:33 +0000276 printk(KERN_ERR "kmem_cache_destroy %s: Slab cache still has objects\n",
277 s->name);
278 dump_stack();
279 }
Jiri Kosina210ed9d2012-10-08 09:26:01 +0200280 } else {
281 mutex_unlock(&slab_mutex);
Christoph Lameter945cf2b2012-09-04 23:18:33 +0000282 }
Christoph Lameter945cf2b2012-09-04 23:18:33 +0000283 put_online_cpus();
284}
285EXPORT_SYMBOL(kmem_cache_destroy);
286
Christoph Lameter97d06602012-07-06 15:25:11 -0500287int slab_is_available(void)
288{
289 return slab_state >= UP;
290}
Glauber Costab7454ad2012-10-19 18:20:25 +0400291
Christoph Lameter45530c42012-11-28 16:23:07 +0000292#ifndef CONFIG_SLOB
293/* Create a cache during boot when no slab services are available yet */
294void __init create_boot_cache(struct kmem_cache *s, const char *name, size_t size,
295 unsigned long flags)
296{
297 int err;
298
299 s->name = name;
300 s->size = s->object_size = size;
Christoph Lameter45906852012-11-28 16:23:16 +0000301 s->align = calculate_alignment(flags, ARCH_KMALLOC_MINALIGN, size);
Christoph Lameter45530c42012-11-28 16:23:07 +0000302 err = __kmem_cache_create(s, flags);
303
304 if (err)
Christoph Lameter31ba7342013-01-10 19:00:53 +0000305 panic("Creation of kmalloc slab %s size=%zu failed. Reason %d\n",
Christoph Lameter45530c42012-11-28 16:23:07 +0000306 name, size, err);
307
308 s->refcount = -1; /* Exempt from merging for now */
309}
310
311struct kmem_cache *__init create_kmalloc_cache(const char *name, size_t size,
312 unsigned long flags)
313{
314 struct kmem_cache *s = kmem_cache_zalloc(kmem_cache, GFP_NOWAIT);
315
316 if (!s)
317 panic("Out of memory when creating slab %s\n", name);
318
319 create_boot_cache(s, name, size, flags);
320 list_add(&s->list, &slab_caches);
321 s->refcount = 1;
322 return s;
323}
324
Christoph Lameter9425c582013-01-10 19:12:17 +0000325struct kmem_cache *kmalloc_caches[KMALLOC_SHIFT_HIGH + 1];
326EXPORT_SYMBOL(kmalloc_caches);
327
328#ifdef CONFIG_ZONE_DMA
329struct kmem_cache *kmalloc_dma_caches[KMALLOC_SHIFT_HIGH + 1];
330EXPORT_SYMBOL(kmalloc_dma_caches);
331#endif
332
Christoph Lameterf97d5f62013-01-10 19:12:17 +0000333/*
Christoph Lameter2c59dd62013-01-10 19:14:19 +0000334 * Conversion table for small slabs sizes / 8 to the index in the
335 * kmalloc array. This is necessary for slabs < 192 since we have non power
336 * of two cache sizes there. The size of larger slabs can be determined using
337 * fls.
338 */
339static s8 size_index[24] = {
340 3, /* 8 */
341 4, /* 16 */
342 5, /* 24 */
343 5, /* 32 */
344 6, /* 40 */
345 6, /* 48 */
346 6, /* 56 */
347 6, /* 64 */
348 1, /* 72 */
349 1, /* 80 */
350 1, /* 88 */
351 1, /* 96 */
352 7, /* 104 */
353 7, /* 112 */
354 7, /* 120 */
355 7, /* 128 */
356 2, /* 136 */
357 2, /* 144 */
358 2, /* 152 */
359 2, /* 160 */
360 2, /* 168 */
361 2, /* 176 */
362 2, /* 184 */
363 2 /* 192 */
364};
365
366static inline int size_index_elem(size_t bytes)
367{
368 return (bytes - 1) / 8;
369}
370
371/*
372 * Find the kmem_cache structure that serves a given size of
373 * allocation
374 */
375struct kmem_cache *kmalloc_slab(size_t size, gfp_t flags)
376{
377 int index;
378
Joonsoo Kim9de1bc82013-08-02 11:02:42 +0900379 if (unlikely(size > KMALLOC_MAX_SIZE)) {
Sasha Levin907985f2013-06-10 15:18:00 -0400380 WARN_ON_ONCE(!(flags & __GFP_NOWARN));
Christoph Lameter6286ae92013-05-03 15:43:18 +0000381 return NULL;
Sasha Levin907985f2013-06-10 15:18:00 -0400382 }
Christoph Lameter6286ae92013-05-03 15:43:18 +0000383
Christoph Lameter2c59dd62013-01-10 19:14:19 +0000384 if (size <= 192) {
385 if (!size)
386 return ZERO_SIZE_PTR;
387
388 index = size_index[size_index_elem(size)];
389 } else
390 index = fls(size - 1);
391
392#ifdef CONFIG_ZONE_DMA
Joonsoo Kimb1e05412013-02-04 23:46:46 +0900393 if (unlikely((flags & GFP_DMA)))
Christoph Lameter2c59dd62013-01-10 19:14:19 +0000394 return kmalloc_dma_caches[index];
395
396#endif
397 return kmalloc_caches[index];
398}
399
400/*
Christoph Lameterf97d5f62013-01-10 19:12:17 +0000401 * Create the kmalloc array. Some of the regular kmalloc arrays
402 * may already have been created because they were needed to
403 * enable allocations for slab creation.
404 */
405void __init create_kmalloc_caches(unsigned long flags)
406{
407 int i;
408
Christoph Lameter2c59dd62013-01-10 19:14:19 +0000409 /*
410 * Patch up the size_index table if we have strange large alignment
411 * requirements for the kmalloc array. This is only the case for
412 * MIPS it seems. The standard arches will not generate any code here.
413 *
414 * Largest permitted alignment is 256 bytes due to the way we
415 * handle the index determination for the smaller caches.
416 *
417 * Make sure that nothing crazy happens if someone starts tinkering
418 * around with ARCH_KMALLOC_MINALIGN
419 */
420 BUILD_BUG_ON(KMALLOC_MIN_SIZE > 256 ||
421 (KMALLOC_MIN_SIZE & (KMALLOC_MIN_SIZE - 1)));
422
423 for (i = 8; i < KMALLOC_MIN_SIZE; i += 8) {
424 int elem = size_index_elem(i);
425
426 if (elem >= ARRAY_SIZE(size_index))
427 break;
428 size_index[elem] = KMALLOC_SHIFT_LOW;
429 }
430
431 if (KMALLOC_MIN_SIZE >= 64) {
432 /*
433 * The 96 byte size cache is not used if the alignment
434 * is 64 byte.
435 */
436 for (i = 64 + 8; i <= 96; i += 8)
437 size_index[size_index_elem(i)] = 7;
438
439 }
440
441 if (KMALLOC_MIN_SIZE >= 128) {
442 /*
443 * The 192 byte sized cache is not used if the alignment
444 * is 128 byte. Redirect kmalloc to use the 256 byte cache
445 * instead.
446 */
447 for (i = 128 + 8; i <= 192; i += 8)
448 size_index[size_index_elem(i)] = 8;
449 }
Christoph Lameter8a965b32013-05-03 18:04:18 +0000450 for (i = KMALLOC_SHIFT_LOW; i <= KMALLOC_SHIFT_HIGH; i++) {
451 if (!kmalloc_caches[i]) {
Christoph Lameterf97d5f62013-01-10 19:12:17 +0000452 kmalloc_caches[i] = create_kmalloc_cache(NULL,
453 1 << i, flags);
Christoph Lameter8a965b32013-05-03 18:04:18 +0000454 }
Chris Mason956e46e2013-05-08 15:56:28 -0400455
456 /*
457 * Caches that are not of the two-to-the-power-of size.
458 * These have to be created immediately after the
459 * earlier power of two caches
460 */
461 if (KMALLOC_MIN_SIZE <= 32 && !kmalloc_caches[1] && i == 6)
462 kmalloc_caches[1] = create_kmalloc_cache(NULL, 96, flags);
463
464 if (KMALLOC_MIN_SIZE <= 64 && !kmalloc_caches[2] && i == 7)
465 kmalloc_caches[2] = create_kmalloc_cache(NULL, 192, flags);
Christoph Lameter8a965b32013-05-03 18:04:18 +0000466 }
467
Christoph Lameterf97d5f62013-01-10 19:12:17 +0000468 /* Kmalloc array is now usable */
469 slab_state = UP;
470
471 for (i = 0; i <= KMALLOC_SHIFT_HIGH; i++) {
472 struct kmem_cache *s = kmalloc_caches[i];
473 char *n;
474
475 if (s) {
476 n = kasprintf(GFP_NOWAIT, "kmalloc-%d", kmalloc_size(i));
477
478 BUG_ON(!n);
479 s->name = n;
480 }
481 }
482
483#ifdef CONFIG_ZONE_DMA
484 for (i = 0; i <= KMALLOC_SHIFT_HIGH; i++) {
485 struct kmem_cache *s = kmalloc_caches[i];
486
487 if (s) {
488 int size = kmalloc_size(i);
489 char *n = kasprintf(GFP_NOWAIT,
490 "dma-kmalloc-%d", size);
491
492 BUG_ON(!n);
493 kmalloc_dma_caches[i] = create_kmalloc_cache(n,
494 size, SLAB_CACHE_DMA | flags);
495 }
496 }
497#endif
498}
Christoph Lameter45530c42012-11-28 16:23:07 +0000499#endif /* !CONFIG_SLOB */
500
Christoph Lameterf1b6eb62013-09-04 16:35:34 +0000501#ifdef CONFIG_TRACING
502void *kmalloc_order_trace(size_t size, gfp_t flags, unsigned int order)
503{
504 void *ret = kmalloc_order(size, flags, order);
505 trace_kmalloc(_RET_IP_, ret, size, PAGE_SIZE << order, flags);
506 return ret;
507}
508EXPORT_SYMBOL(kmalloc_order_trace);
509#endif
Christoph Lameter45530c42012-11-28 16:23:07 +0000510
Glauber Costab7454ad2012-10-19 18:20:25 +0400511#ifdef CONFIG_SLABINFO
Wanpeng Lie9b4db22013-07-04 08:33:24 +0800512
513#ifdef CONFIG_SLAB
514#define SLABINFO_RIGHTS (S_IWUSR | S_IRUSR)
515#else
516#define SLABINFO_RIGHTS S_IRUSR
517#endif
518
Glauber Costa749c5412012-12-18 14:23:01 -0800519void print_slabinfo_header(struct seq_file *m)
Glauber Costabcee6e22012-10-19 18:20:26 +0400520{
521 /*
522 * Output format version, so at least we can change it
523 * without _too_ many complaints.
524 */
525#ifdef CONFIG_DEBUG_SLAB
526 seq_puts(m, "slabinfo - version: 2.1 (statistics)\n");
527#else
528 seq_puts(m, "slabinfo - version: 2.1\n");
529#endif
530 seq_puts(m, "# name <active_objs> <num_objs> <objsize> "
531 "<objperslab> <pagesperslab>");
532 seq_puts(m, " : tunables <limit> <batchcount> <sharedfactor>");
533 seq_puts(m, " : slabdata <active_slabs> <num_slabs> <sharedavail>");
534#ifdef CONFIG_DEBUG_SLAB
535 seq_puts(m, " : globalstat <listallocs> <maxobjs> <grown> <reaped> "
536 "<error> <maxfreeable> <nodeallocs> <remotefrees> <alienoverflow>");
537 seq_puts(m, " : cpustat <allochit> <allocmiss> <freehit> <freemiss>");
538#endif
539 seq_putc(m, '\n');
540}
541
Glauber Costab7454ad2012-10-19 18:20:25 +0400542static void *s_start(struct seq_file *m, loff_t *pos)
543{
544 loff_t n = *pos;
545
546 mutex_lock(&slab_mutex);
547 if (!n)
548 print_slabinfo_header(m);
549
550 return seq_list_start(&slab_caches, *pos);
551}
552
Wanpeng Li276a2432013-07-08 08:08:28 +0800553void *slab_next(struct seq_file *m, void *p, loff_t *pos)
Glauber Costab7454ad2012-10-19 18:20:25 +0400554{
555 return seq_list_next(p, &slab_caches, pos);
556}
557
Wanpeng Li276a2432013-07-08 08:08:28 +0800558void slab_stop(struct seq_file *m, void *p)
Glauber Costab7454ad2012-10-19 18:20:25 +0400559{
560 mutex_unlock(&slab_mutex);
561}
562
Glauber Costa749c5412012-12-18 14:23:01 -0800563static void
564memcg_accumulate_slabinfo(struct kmem_cache *s, struct slabinfo *info)
Glauber Costab7454ad2012-10-19 18:20:25 +0400565{
Glauber Costa749c5412012-12-18 14:23:01 -0800566 struct kmem_cache *c;
567 struct slabinfo sinfo;
568 int i;
569
570 if (!is_root_cache(s))
571 return;
572
573 for_each_memcg_cache_index(i) {
574 c = cache_from_memcg(s, i);
575 if (!c)
576 continue;
577
578 memset(&sinfo, 0, sizeof(sinfo));
579 get_slabinfo(c, &sinfo);
580
581 info->active_slabs += sinfo.active_slabs;
582 info->num_slabs += sinfo.num_slabs;
583 info->shared_avail += sinfo.shared_avail;
584 info->active_objs += sinfo.active_objs;
585 info->num_objs += sinfo.num_objs;
586 }
587}
588
589int cache_show(struct kmem_cache *s, struct seq_file *m)
590{
Glauber Costa0d7561c2012-10-19 18:20:27 +0400591 struct slabinfo sinfo;
592
593 memset(&sinfo, 0, sizeof(sinfo));
594 get_slabinfo(s, &sinfo);
595
Glauber Costa749c5412012-12-18 14:23:01 -0800596 memcg_accumulate_slabinfo(s, &sinfo);
597
Glauber Costa0d7561c2012-10-19 18:20:27 +0400598 seq_printf(m, "%-17s %6lu %6lu %6u %4u %4d",
Glauber Costa749c5412012-12-18 14:23:01 -0800599 cache_name(s), sinfo.active_objs, sinfo.num_objs, s->size,
Glauber Costa0d7561c2012-10-19 18:20:27 +0400600 sinfo.objects_per_slab, (1 << sinfo.cache_order));
601
602 seq_printf(m, " : tunables %4u %4u %4u",
603 sinfo.limit, sinfo.batchcount, sinfo.shared);
604 seq_printf(m, " : slabdata %6lu %6lu %6lu",
605 sinfo.active_slabs, sinfo.num_slabs, sinfo.shared_avail);
606 slabinfo_show_stats(m, s);
607 seq_putc(m, '\n');
608 return 0;
Glauber Costab7454ad2012-10-19 18:20:25 +0400609}
610
Glauber Costa749c5412012-12-18 14:23:01 -0800611static int s_show(struct seq_file *m, void *p)
612{
613 struct kmem_cache *s = list_entry(p, struct kmem_cache, list);
614
615 if (!is_root_cache(s))
616 return 0;
617 return cache_show(s, m);
618}
619
Glauber Costab7454ad2012-10-19 18:20:25 +0400620/*
621 * slabinfo_op - iterator that generates /proc/slabinfo
622 *
623 * Output layout:
624 * cache-name
625 * num-active-objs
626 * total-objs
627 * object size
628 * num-active-slabs
629 * total-slabs
630 * num-pages-per-slab
631 * + further values on SMP and with statistics enabled
632 */
633static const struct seq_operations slabinfo_op = {
634 .start = s_start,
Wanpeng Li276a2432013-07-08 08:08:28 +0800635 .next = slab_next,
636 .stop = slab_stop,
Glauber Costab7454ad2012-10-19 18:20:25 +0400637 .show = s_show,
638};
639
640static int slabinfo_open(struct inode *inode, struct file *file)
641{
642 return seq_open(file, &slabinfo_op);
643}
644
645static const struct file_operations proc_slabinfo_operations = {
646 .open = slabinfo_open,
647 .read = seq_read,
648 .write = slabinfo_write,
649 .llseek = seq_lseek,
650 .release = seq_release,
651};
652
653static int __init slab_proc_init(void)
654{
Wanpeng Lie9b4db22013-07-04 08:33:24 +0800655 proc_create("slabinfo", SLABINFO_RIGHTS, NULL,
656 &proc_slabinfo_operations);
Glauber Costab7454ad2012-10-19 18:20:25 +0400657 return 0;
658}
659module_init(slab_proc_init);
660#endif /* CONFIG_SLABINFO */