blob: bc05fdc3edce106b12e5113ad8c8777de6de217d [file] [log] [blame]
Christoph Lameter97d06602012-07-06 15:25:11 -05001#ifndef MM_SLAB_H
2#define MM_SLAB_H
3/*
4 * Internal slab definitions
5 */
6
Joonsoo Kim07f361b2014-10-09 15:26:00 -07007#ifdef CONFIG_SLOB
8/*
9 * Common fields provided in kmem_cache by all slab allocators
10 * This struct is either used directly by the allocator (SLOB)
11 * or the allocator must include definitions for all fields
12 * provided in kmem_cache_common in their definition of kmem_cache.
13 *
14 * Once we can do anonymous structs (C11 standard) we could put a
15 * anonymous struct definition in these allocators so that the
16 * separate allocations in the kmem_cache structure of SLAB and
17 * SLUB is no longer needed.
18 */
19struct kmem_cache {
20 unsigned int object_size;/* The original size of the object */
21 unsigned int size; /* The aligned/padded/added on size */
22 unsigned int align; /* Alignment as calculated */
23 unsigned long flags; /* Active flags on the slab */
24 const char *name; /* Slab name for sysfs */
25 int refcount; /* Use counter */
26 void (*ctor)(void *); /* Called on object slot creation */
27 struct list_head list; /* List of all slab caches on the system */
28};
29
30#endif /* CONFIG_SLOB */
31
32#ifdef CONFIG_SLAB
33#include <linux/slab_def.h>
34#endif
35
36#ifdef CONFIG_SLUB
37#include <linux/slub_def.h>
38#endif
39
40#include <linux/memcontrol.h>
Jesper Dangaard Brouer11c7aec2016-03-15 14:53:35 -070041#include <linux/fault-inject.h>
42#include <linux/kmemcheck.h>
43#include <linux/kasan.h>
44#include <linux/kmemleak.h>
Thomas Garnier7c00fce2016-07-26 15:21:56 -070045#include <linux/random.h>
Joonsoo Kim07f361b2014-10-09 15:26:00 -070046
Christoph Lameter97d06602012-07-06 15:25:11 -050047/*
48 * State of the slab allocator.
49 *
50 * This is used to describe the states of the allocator during bootup.
51 * Allocators use this to gradually bootstrap themselves. Most allocators
52 * have the problem that the structures used for managing slab caches are
53 * allocated from slab caches themselves.
54 */
55enum slab_state {
56 DOWN, /* No slab functionality yet */
57 PARTIAL, /* SLUB: kmem_cache_node available */
Christoph Lameterce8eb6c2013-01-10 19:14:19 +000058 PARTIAL_NODE, /* SLAB: kmalloc size for node struct available */
Christoph Lameter97d06602012-07-06 15:25:11 -050059 UP, /* Slab caches usable but not all extras yet */
60 FULL /* Everything is working */
61};
62
63extern enum slab_state slab_state;
64
Christoph Lameter18004c52012-07-06 15:25:12 -050065/* The slab cache mutex protects the management structures during changes */
66extern struct mutex slab_mutex;
Christoph Lameter9b030cb2012-09-05 00:20:33 +000067
68/* The list of all slab caches on the system */
Christoph Lameter18004c52012-07-06 15:25:12 -050069extern struct list_head slab_caches;
70
Christoph Lameter9b030cb2012-09-05 00:20:33 +000071/* The slab cache that manages slab cache information */
72extern struct kmem_cache *kmem_cache;
73
Christoph Lameter45906852012-11-28 16:23:16 +000074unsigned long calculate_alignment(unsigned long flags,
75 unsigned long align, unsigned long size);
76
Christoph Lameterf97d5f62013-01-10 19:12:17 +000077#ifndef CONFIG_SLOB
78/* Kmalloc array related functions */
Daniel Sanders34cc6992015-06-24 16:55:57 -070079void setup_kmalloc_cache_index_table(void);
Christoph Lameterf97d5f62013-01-10 19:12:17 +000080void create_kmalloc_caches(unsigned long);
Christoph Lameter2c59dd62013-01-10 19:14:19 +000081
82/* Find the kmalloc slab corresponding for a certain size */
83struct kmem_cache *kmalloc_slab(size_t, gfp_t);
Christoph Lameterf97d5f62013-01-10 19:12:17 +000084#endif
85
86
Christoph Lameter9b030cb2012-09-05 00:20:33 +000087/* Functions provided by the slab allocators */
Christoph Lameter8a13a4c2012-09-04 23:18:33 +000088extern int __kmem_cache_create(struct kmem_cache *, unsigned long flags);
Christoph Lameter97d06602012-07-06 15:25:11 -050089
Christoph Lameter45530c42012-11-28 16:23:07 +000090extern struct kmem_cache *create_kmalloc_cache(const char *name, size_t size,
91 unsigned long flags);
92extern void create_boot_cache(struct kmem_cache *, const char *name,
93 size_t size, unsigned long flags);
94
Joonsoo Kim423c9292014-10-09 15:26:22 -070095int slab_unmergeable(struct kmem_cache *s);
96struct kmem_cache *find_mergeable(size_t size, size_t align,
97 unsigned long flags, const char *name, void (*ctor)(void *));
Joonsoo Kim12220de2014-10-09 15:26:24 -070098#ifndef CONFIG_SLOB
Glauber Costa2633d7a2012-12-18 14:22:34 -080099struct kmem_cache *
Vladimir Davydova44cb942014-04-07 15:39:23 -0700100__kmem_cache_alias(const char *name, size_t size, size_t align,
101 unsigned long flags, void (*ctor)(void *));
Joonsoo Kim423c9292014-10-09 15:26:22 -0700102
103unsigned long kmem_cache_flags(unsigned long object_size,
104 unsigned long flags, const char *name,
105 void (*ctor)(void *));
Christoph Lametercbb79692012-09-05 00:18:32 +0000106#else
Glauber Costa2633d7a2012-12-18 14:22:34 -0800107static inline struct kmem_cache *
Vladimir Davydova44cb942014-04-07 15:39:23 -0700108__kmem_cache_alias(const char *name, size_t size, size_t align,
109 unsigned long flags, void (*ctor)(void *))
Christoph Lametercbb79692012-09-05 00:18:32 +0000110{ return NULL; }
Joonsoo Kim423c9292014-10-09 15:26:22 -0700111
112static inline unsigned long kmem_cache_flags(unsigned long object_size,
113 unsigned long flags, const char *name,
114 void (*ctor)(void *))
115{
116 return flags;
117}
Christoph Lametercbb79692012-09-05 00:18:32 +0000118#endif
119
120
Glauber Costad8843922012-10-17 15:36:51 +0400121/* Legal flag mask for kmem_cache_create(), for various configurations */
122#define SLAB_CORE_FLAGS (SLAB_HWCACHE_ALIGN | SLAB_CACHE_DMA | SLAB_PANIC | \
123 SLAB_DESTROY_BY_RCU | SLAB_DEBUG_OBJECTS )
124
125#if defined(CONFIG_DEBUG_SLAB)
126#define SLAB_DEBUG_FLAGS (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER)
127#elif defined(CONFIG_SLUB_DEBUG)
128#define SLAB_DEBUG_FLAGS (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER | \
Laura Abbottbecfda62016-03-15 14:55:06 -0700129 SLAB_TRACE | SLAB_CONSISTENCY_CHECKS)
Glauber Costad8843922012-10-17 15:36:51 +0400130#else
131#define SLAB_DEBUG_FLAGS (0)
132#endif
133
134#if defined(CONFIG_SLAB)
135#define SLAB_CACHE_FLAGS (SLAB_MEM_SPREAD | SLAB_NOLEAKTRACE | \
Vladimir Davydov230e9fc2016-01-14 15:18:15 -0800136 SLAB_RECLAIM_ACCOUNT | SLAB_TEMPORARY | \
137 SLAB_NOTRACK | SLAB_ACCOUNT)
Glauber Costad8843922012-10-17 15:36:51 +0400138#elif defined(CONFIG_SLUB)
139#define SLAB_CACHE_FLAGS (SLAB_NOLEAKTRACE | SLAB_RECLAIM_ACCOUNT | \
Vladimir Davydov230e9fc2016-01-14 15:18:15 -0800140 SLAB_TEMPORARY | SLAB_NOTRACK | SLAB_ACCOUNT)
Glauber Costad8843922012-10-17 15:36:51 +0400141#else
142#define SLAB_CACHE_FLAGS (0)
143#endif
144
145#define CACHE_CREATE_MASK (SLAB_CORE_FLAGS | SLAB_DEBUG_FLAGS | SLAB_CACHE_FLAGS)
146
Christoph Lameter945cf2b2012-09-04 23:18:33 +0000147int __kmem_cache_shutdown(struct kmem_cache *);
Dmitry Safonov52b4b952016-02-17 13:11:37 -0800148void __kmem_cache_release(struct kmem_cache *);
Vladimir Davydovd6e0b7f2015-02-12 14:59:47 -0800149int __kmem_cache_shrink(struct kmem_cache *, bool);
Christoph Lameter41a21282014-05-06 12:50:08 -0700150void slab_kmem_cache_release(struct kmem_cache *);
Christoph Lameter945cf2b2012-09-04 23:18:33 +0000151
Glauber Costab7454ad2012-10-19 18:20:25 +0400152struct seq_file;
153struct file;
Glauber Costab7454ad2012-10-19 18:20:25 +0400154
Glauber Costa0d7561c2012-10-19 18:20:27 +0400155struct slabinfo {
156 unsigned long active_objs;
157 unsigned long num_objs;
158 unsigned long active_slabs;
159 unsigned long num_slabs;
160 unsigned long shared_avail;
161 unsigned int limit;
162 unsigned int batchcount;
163 unsigned int shared;
164 unsigned int objects_per_slab;
165 unsigned int cache_order;
166};
167
168void get_slabinfo(struct kmem_cache *s, struct slabinfo *sinfo);
169void slabinfo_show_stats(struct seq_file *m, struct kmem_cache *s);
Glauber Costab7454ad2012-10-19 18:20:25 +0400170ssize_t slabinfo_write(struct file *file, const char __user *buffer,
171 size_t count, loff_t *ppos);
Glauber Costaba6c4962012-12-18 14:22:27 -0800172
Christoph Lameter484748f2015-09-04 15:45:34 -0700173/*
174 * Generic implementation of bulk operations
175 * These are useful for situations in which the allocator cannot
Jesper Dangaard Brouer9f706d62016-03-15 14:54:03 -0700176 * perform optimizations. In that case segments of the object listed
Christoph Lameter484748f2015-09-04 15:45:34 -0700177 * may be allocated or freed using these operations.
178 */
179void __kmem_cache_free_bulk(struct kmem_cache *, size_t, void **);
Jesper Dangaard Brouer865762a2015-11-20 15:57:58 -0800180int __kmem_cache_alloc_bulk(struct kmem_cache *, gfp_t, size_t, void **);
Christoph Lameter484748f2015-09-04 15:45:34 -0700181
Johannes Weiner127424c2016-01-20 15:02:32 -0800182#if defined(CONFIG_MEMCG) && !defined(CONFIG_SLOB)
Vladimir Davydov426589f2015-02-12 14:59:23 -0800183/*
184 * Iterate over all memcg caches of the given root cache. The caller must hold
185 * slab_mutex.
186 */
187#define for_each_memcg_cache(iter, root) \
188 list_for_each_entry(iter, &(root)->memcg_params.list, \
189 memcg_params.list)
190
Glauber Costaba6c4962012-12-18 14:22:27 -0800191static inline bool is_root_cache(struct kmem_cache *s)
192{
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800193 return s->memcg_params.is_root_cache;
Glauber Costaba6c4962012-12-18 14:22:27 -0800194}
Glauber Costa2633d7a2012-12-18 14:22:34 -0800195
Glauber Costab9ce5ef2012-12-18 14:22:46 -0800196static inline bool slab_equal_or_root(struct kmem_cache *s,
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800197 struct kmem_cache *p)
Glauber Costab9ce5ef2012-12-18 14:22:46 -0800198{
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800199 return p == s || p == s->memcg_params.root_cache;
Glauber Costab9ce5ef2012-12-18 14:22:46 -0800200}
Glauber Costa749c5412012-12-18 14:23:01 -0800201
202/*
203 * We use suffixes to the name in memcg because we can't have caches
204 * created in the system with the same name. But when we print them
205 * locally, better refer to them with the base name
206 */
207static inline const char *cache_name(struct kmem_cache *s)
208{
209 if (!is_root_cache(s))
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800210 s = s->memcg_params.root_cache;
Glauber Costa749c5412012-12-18 14:23:01 -0800211 return s->name;
212}
213
Vladimir Davydovf8570262014-01-23 15:53:06 -0800214/*
215 * Note, we protect with RCU only the memcg_caches array, not per-memcg caches.
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800216 * That said the caller must assure the memcg's cache won't go away by either
217 * taking a css reference to the owner cgroup, or holding the slab_mutex.
Vladimir Davydovf8570262014-01-23 15:53:06 -0800218 */
Qiang Huang2ade4de2013-11-12 15:08:23 -0800219static inline struct kmem_cache *
220cache_from_memcg_idx(struct kmem_cache *s, int idx)
Glauber Costa749c5412012-12-18 14:23:01 -0800221{
Vladimir Davydov959c8962014-01-23 15:52:59 -0800222 struct kmem_cache *cachep;
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800223 struct memcg_cache_array *arr;
Vladimir Davydovf8570262014-01-23 15:53:06 -0800224
225 rcu_read_lock();
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800226 arr = rcu_dereference(s->memcg_params.memcg_caches);
Vladimir Davydov959c8962014-01-23 15:52:59 -0800227
228 /*
229 * Make sure we will access the up-to-date value. The code updating
230 * memcg_caches issues a write barrier to match this (see
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800231 * memcg_create_kmem_cache()).
Vladimir Davydov959c8962014-01-23 15:52:59 -0800232 */
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800233 cachep = lockless_dereference(arr->entries[idx]);
Pranith Kumar8df0c2d2014-12-10 15:42:28 -0800234 rcu_read_unlock();
235
Vladimir Davydov959c8962014-01-23 15:52:59 -0800236 return cachep;
Glauber Costa749c5412012-12-18 14:23:01 -0800237}
Glauber Costa943a4512012-12-18 14:23:03 -0800238
239static inline struct kmem_cache *memcg_root_cache(struct kmem_cache *s)
240{
241 if (is_root_cache(s))
242 return s;
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800243 return s->memcg_params.root_cache;
Glauber Costa943a4512012-12-18 14:23:03 -0800244}
Vladimir Davydov5dfb4172014-06-04 16:06:38 -0700245
Vladimir Davydovf3ccb2c42015-11-05 18:49:01 -0800246static __always_inline int memcg_charge_slab(struct page *page,
247 gfp_t gfp, int order,
248 struct kmem_cache *s)
Vladimir Davydov5dfb4172014-06-04 16:06:38 -0700249{
Vladimir Davydov27ee57c2016-03-17 14:17:35 -0700250 int ret;
251
Vladimir Davydov5dfb4172014-06-04 16:06:38 -0700252 if (!memcg_kmem_enabled())
253 return 0;
254 if (is_root_cache(s))
255 return 0;
Vladimir Davydov27ee57c2016-03-17 14:17:35 -0700256
Vladimir Davydov45264772016-07-26 15:24:21 -0700257 ret = memcg_kmem_charge_memcg(page, gfp, order, s->memcg_params.memcg);
Vladimir Davydov27ee57c2016-03-17 14:17:35 -0700258 if (ret)
259 return ret;
260
261 memcg_kmem_update_page_stat(page,
262 (s->flags & SLAB_RECLAIM_ACCOUNT) ?
263 MEMCG_SLAB_RECLAIMABLE : MEMCG_SLAB_UNRECLAIMABLE,
264 1 << order);
265 return 0;
266}
267
268static __always_inline void memcg_uncharge_slab(struct page *page, int order,
269 struct kmem_cache *s)
270{
Vladimir Davydov45264772016-07-26 15:24:21 -0700271 if (!memcg_kmem_enabled())
272 return;
273
Vladimir Davydov27ee57c2016-03-17 14:17:35 -0700274 memcg_kmem_update_page_stat(page,
275 (s->flags & SLAB_RECLAIM_ACCOUNT) ?
276 MEMCG_SLAB_RECLAIMABLE : MEMCG_SLAB_UNRECLAIMABLE,
277 -(1 << order));
278 memcg_kmem_uncharge(page, order);
Vladimir Davydov5dfb4172014-06-04 16:06:38 -0700279}
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800280
281extern void slab_init_memcg_params(struct kmem_cache *);
282
Johannes Weiner127424c2016-01-20 15:02:32 -0800283#else /* CONFIG_MEMCG && !CONFIG_SLOB */
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800284
Vladimir Davydov426589f2015-02-12 14:59:23 -0800285#define for_each_memcg_cache(iter, root) \
286 for ((void)(iter), (void)(root); 0; )
Vladimir Davydov426589f2015-02-12 14:59:23 -0800287
Glauber Costaba6c4962012-12-18 14:22:27 -0800288static inline bool is_root_cache(struct kmem_cache *s)
289{
290 return true;
291}
292
Glauber Costab9ce5ef2012-12-18 14:22:46 -0800293static inline bool slab_equal_or_root(struct kmem_cache *s,
294 struct kmem_cache *p)
295{
296 return true;
297}
Glauber Costa749c5412012-12-18 14:23:01 -0800298
299static inline const char *cache_name(struct kmem_cache *s)
300{
301 return s->name;
302}
303
Qiang Huang2ade4de2013-11-12 15:08:23 -0800304static inline struct kmem_cache *
305cache_from_memcg_idx(struct kmem_cache *s, int idx)
Glauber Costa749c5412012-12-18 14:23:01 -0800306{
307 return NULL;
308}
Glauber Costa943a4512012-12-18 14:23:03 -0800309
310static inline struct kmem_cache *memcg_root_cache(struct kmem_cache *s)
311{
312 return s;
313}
Vladimir Davydov5dfb4172014-06-04 16:06:38 -0700314
Vladimir Davydovf3ccb2c42015-11-05 18:49:01 -0800315static inline int memcg_charge_slab(struct page *page, gfp_t gfp, int order,
316 struct kmem_cache *s)
Vladimir Davydov5dfb4172014-06-04 16:06:38 -0700317{
318 return 0;
319}
320
Vladimir Davydov27ee57c2016-03-17 14:17:35 -0700321static inline void memcg_uncharge_slab(struct page *page, int order,
322 struct kmem_cache *s)
323{
324}
325
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800326static inline void slab_init_memcg_params(struct kmem_cache *s)
327{
328}
Johannes Weiner127424c2016-01-20 15:02:32 -0800329#endif /* CONFIG_MEMCG && !CONFIG_SLOB */
Glauber Costab9ce5ef2012-12-18 14:22:46 -0800330
331static inline struct kmem_cache *cache_from_obj(struct kmem_cache *s, void *x)
332{
333 struct kmem_cache *cachep;
334 struct page *page;
335
336 /*
337 * When kmemcg is not being used, both assignments should return the
338 * same value. but we don't want to pay the assignment price in that
339 * case. If it is not compiled in, the compiler should be smart enough
340 * to not do even the assignment. In that case, slab_equal_or_root
341 * will also be a constant.
342 */
Laura Abbottbecfda62016-03-15 14:55:06 -0700343 if (!memcg_kmem_enabled() &&
344 !unlikely(s->flags & SLAB_CONSISTENCY_CHECKS))
Glauber Costab9ce5ef2012-12-18 14:22:46 -0800345 return s;
346
347 page = virt_to_head_page(x);
348 cachep = page->slab_cache;
349 if (slab_equal_or_root(cachep, s))
350 return cachep;
351
352 pr_err("%s: Wrong slab cache. %s but object is from %s\n",
Daniel Borkmann2d16e0fd2015-09-04 15:45:57 -0700353 __func__, s->name, cachep->name);
Glauber Costab9ce5ef2012-12-18 14:22:46 -0800354 WARN_ON_ONCE(1);
355 return s;
356}
Christoph Lameterca349562013-01-10 19:14:19 +0000357
Jesper Dangaard Brouer11c7aec2016-03-15 14:53:35 -0700358static inline size_t slab_ksize(const struct kmem_cache *s)
359{
360#ifndef CONFIG_SLUB
361 return s->object_size;
362
363#else /* CONFIG_SLUB */
364# ifdef CONFIG_SLUB_DEBUG
365 /*
366 * Debugging requires use of the padding between object
367 * and whatever may come after it.
368 */
369 if (s->flags & (SLAB_RED_ZONE | SLAB_POISON))
370 return s->object_size;
371# endif
Alexander Potapenko80a92012016-07-28 15:49:07 -0700372 if (s->flags & SLAB_KASAN)
373 return s->object_size;
Jesper Dangaard Brouer11c7aec2016-03-15 14:53:35 -0700374 /*
375 * If we have the need to store the freelist pointer
376 * back there or track user information then we can
377 * only use the space before that information.
378 */
379 if (s->flags & (SLAB_DESTROY_BY_RCU | SLAB_STORE_USER))
380 return s->inuse;
381 /*
382 * Else we can use all the padding etc for the allocation
383 */
384 return s->size;
385#endif
386}
387
388static inline struct kmem_cache *slab_pre_alloc_hook(struct kmem_cache *s,
389 gfp_t flags)
390{
391 flags &= gfp_allowed_mask;
392 lockdep_trace_alloc(flags);
393 might_sleep_if(gfpflags_allow_blocking(flags));
394
Jesper Dangaard Brouerfab99632016-03-15 14:53:38 -0700395 if (should_failslab(s, flags))
Jesper Dangaard Brouer11c7aec2016-03-15 14:53:35 -0700396 return NULL;
397
Vladimir Davydov45264772016-07-26 15:24:21 -0700398 if (memcg_kmem_enabled() &&
399 ((flags & __GFP_ACCOUNT) || (s->flags & SLAB_ACCOUNT)))
400 return memcg_kmem_get_cache(s);
401
402 return s;
Jesper Dangaard Brouer11c7aec2016-03-15 14:53:35 -0700403}
404
405static inline void slab_post_alloc_hook(struct kmem_cache *s, gfp_t flags,
406 size_t size, void **p)
407{
408 size_t i;
409
410 flags &= gfp_allowed_mask;
411 for (i = 0; i < size; i++) {
412 void *object = p[i];
413
414 kmemcheck_slab_alloc(s, flags, object, slab_ksize(s));
415 kmemleak_alloc_recursive(object, s->object_size, 1,
416 s->flags, flags);
Alexander Potapenko505f5dc2016-03-25 14:22:02 -0700417 kasan_slab_alloc(s, object, flags);
Jesper Dangaard Brouer11c7aec2016-03-15 14:53:35 -0700418 }
Vladimir Davydov45264772016-07-26 15:24:21 -0700419
420 if (memcg_kmem_enabled())
421 memcg_kmem_put_cache(s);
Jesper Dangaard Brouer11c7aec2016-03-15 14:53:35 -0700422}
423
Christoph Lameter44c53562014-08-06 16:04:07 -0700424#ifndef CONFIG_SLOB
Christoph Lameterca349562013-01-10 19:14:19 +0000425/*
426 * The slab lists for all objects.
427 */
428struct kmem_cache_node {
429 spinlock_t list_lock;
430
431#ifdef CONFIG_SLAB
432 struct list_head slabs_partial; /* partial list first, better asm code */
433 struct list_head slabs_full;
434 struct list_head slabs_free;
Aruna Ramakrishna07a63c42016-10-27 17:46:32 -0700435 unsigned long num_slabs;
Christoph Lameterca349562013-01-10 19:14:19 +0000436 unsigned long free_objects;
437 unsigned int free_limit;
438 unsigned int colour_next; /* Per-node cache coloring */
439 struct array_cache *shared; /* shared per node */
Joonsoo Kimc8522a32014-08-06 16:04:29 -0700440 struct alien_cache **alien; /* on other nodes */
Christoph Lameterca349562013-01-10 19:14:19 +0000441 unsigned long next_reap; /* updated without locking */
442 int free_touched; /* updated without locking */
443#endif
444
445#ifdef CONFIG_SLUB
446 unsigned long nr_partial;
447 struct list_head partial;
448#ifdef CONFIG_SLUB_DEBUG
449 atomic_long_t nr_slabs;
450 atomic_long_t total_objects;
451 struct list_head full;
452#endif
453#endif
454
455};
Wanpeng Lie25839f2013-07-04 08:33:23 +0800456
Christoph Lameter44c53562014-08-06 16:04:07 -0700457static inline struct kmem_cache_node *get_node(struct kmem_cache *s, int node)
458{
459 return s->node[node];
460}
461
462/*
463 * Iterator over all nodes. The body will be executed for each node that has
464 * a kmem_cache_node structure allocated (which is true for all online nodes)
465 */
466#define for_each_kmem_cache_node(__s, __node, __n) \
Mikulas Patocka91635822014-10-09 15:26:20 -0700467 for (__node = 0; __node < nr_node_ids; __node++) \
468 if ((__n = get_node(__s, __node)))
Christoph Lameter44c53562014-08-06 16:04:07 -0700469
470#endif
471
Vladimir Davydov1df3b262014-12-10 15:42:16 -0800472void *slab_start(struct seq_file *m, loff_t *pos);
Wanpeng Li276a2432013-07-08 08:08:28 +0800473void *slab_next(struct seq_file *m, void *p, loff_t *pos);
474void slab_stop(struct seq_file *m, void *p);
Vladimir Davydovb0475012014-12-10 15:44:19 -0800475int memcg_slab_show(struct seq_file *m, void *p);
Andrey Ryabinin5240ab42014-08-06 16:04:14 -0700476
Alexander Potapenko55834c52016-05-20 16:59:11 -0700477void ___cache_free(struct kmem_cache *cache, void *x, unsigned long addr);
478
Thomas Garnier7c00fce2016-07-26 15:21:56 -0700479#ifdef CONFIG_SLAB_FREELIST_RANDOM
480int cache_random_seq_create(struct kmem_cache *cachep, unsigned int count,
481 gfp_t gfp);
482void cache_random_seq_destroy(struct kmem_cache *cachep);
483#else
484static inline int cache_random_seq_create(struct kmem_cache *cachep,
485 unsigned int count, gfp_t gfp)
486{
487 return 0;
488}
489static inline void cache_random_seq_destroy(struct kmem_cache *cachep) { }
490#endif /* CONFIG_SLAB_FREELIST_RANDOM */
491
Andrey Ryabinin5240ab42014-08-06 16:04:14 -0700492#endif /* MM_SLAB_H */