blob: 50d29d716db4ce5bf7fd1fe599943d97f1f6fc20 [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>
41
Christoph Lameter97d06602012-07-06 15:25:11 -050042/*
43 * State of the slab allocator.
44 *
45 * This is used to describe the states of the allocator during bootup.
46 * Allocators use this to gradually bootstrap themselves. Most allocators
47 * have the problem that the structures used for managing slab caches are
48 * allocated from slab caches themselves.
49 */
50enum slab_state {
51 DOWN, /* No slab functionality yet */
52 PARTIAL, /* SLUB: kmem_cache_node available */
53 PARTIAL_ARRAYCACHE, /* SLAB: kmalloc size for arraycache available */
Christoph Lameterce8eb6c2013-01-10 19:14:19 +000054 PARTIAL_NODE, /* SLAB: kmalloc size for node struct available */
Christoph Lameter97d06602012-07-06 15:25:11 -050055 UP, /* Slab caches usable but not all extras yet */
56 FULL /* Everything is working */
57};
58
59extern enum slab_state slab_state;
60
Christoph Lameter18004c52012-07-06 15:25:12 -050061/* The slab cache mutex protects the management structures during changes */
62extern struct mutex slab_mutex;
Christoph Lameter9b030cb2012-09-05 00:20:33 +000063
64/* The list of all slab caches on the system */
Christoph Lameter18004c52012-07-06 15:25:12 -050065extern struct list_head slab_caches;
66
Christoph Lameter9b030cb2012-09-05 00:20:33 +000067/* The slab cache that manages slab cache information */
68extern struct kmem_cache *kmem_cache;
69
Christoph Lameter45906852012-11-28 16:23:16 +000070unsigned long calculate_alignment(unsigned long flags,
71 unsigned long align, unsigned long size);
72
Christoph Lameterf97d5f62013-01-10 19:12:17 +000073#ifndef CONFIG_SLOB
74/* Kmalloc array related functions */
75void create_kmalloc_caches(unsigned long);
Christoph Lameter2c59dd62013-01-10 19:14:19 +000076
77/* Find the kmalloc slab corresponding for a certain size */
78struct kmem_cache *kmalloc_slab(size_t, gfp_t);
Christoph Lameterf97d5f62013-01-10 19:12:17 +000079#endif
80
81
Christoph Lameter9b030cb2012-09-05 00:20:33 +000082/* Functions provided by the slab allocators */
Christoph Lameter8a13a4c2012-09-04 23:18:33 +000083extern int __kmem_cache_create(struct kmem_cache *, unsigned long flags);
Christoph Lameter97d06602012-07-06 15:25:11 -050084
Christoph Lameter45530c42012-11-28 16:23:07 +000085extern struct kmem_cache *create_kmalloc_cache(const char *name, size_t size,
86 unsigned long flags);
87extern void create_boot_cache(struct kmem_cache *, const char *name,
88 size_t size, unsigned long flags);
89
Glauber Costa2633d7a2012-12-18 14:22:34 -080090struct mem_cgroup;
Joonsoo Kim423c9292014-10-09 15:26:22 -070091
92int slab_unmergeable(struct kmem_cache *s);
93struct kmem_cache *find_mergeable(size_t size, size_t align,
94 unsigned long flags, const char *name, void (*ctor)(void *));
Joonsoo Kim12220de2014-10-09 15:26:24 -070095#ifndef CONFIG_SLOB
Glauber Costa2633d7a2012-12-18 14:22:34 -080096struct kmem_cache *
Vladimir Davydova44cb942014-04-07 15:39:23 -070097__kmem_cache_alias(const char *name, size_t size, size_t align,
98 unsigned long flags, void (*ctor)(void *));
Joonsoo Kim423c9292014-10-09 15:26:22 -070099
100unsigned long kmem_cache_flags(unsigned long object_size,
101 unsigned long flags, const char *name,
102 void (*ctor)(void *));
Christoph Lametercbb79692012-09-05 00:18:32 +0000103#else
Glauber Costa2633d7a2012-12-18 14:22:34 -0800104static inline struct kmem_cache *
Vladimir Davydova44cb942014-04-07 15:39:23 -0700105__kmem_cache_alias(const char *name, size_t size, size_t align,
106 unsigned long flags, void (*ctor)(void *))
Christoph Lametercbb79692012-09-05 00:18:32 +0000107{ return NULL; }
Joonsoo Kim423c9292014-10-09 15:26:22 -0700108
109static inline unsigned long kmem_cache_flags(unsigned long object_size,
110 unsigned long flags, const char *name,
111 void (*ctor)(void *))
112{
113 return flags;
114}
Christoph Lametercbb79692012-09-05 00:18:32 +0000115#endif
116
117
Glauber Costad8843922012-10-17 15:36:51 +0400118/* Legal flag mask for kmem_cache_create(), for various configurations */
119#define SLAB_CORE_FLAGS (SLAB_HWCACHE_ALIGN | SLAB_CACHE_DMA | SLAB_PANIC | \
120 SLAB_DESTROY_BY_RCU | SLAB_DEBUG_OBJECTS )
121
122#if defined(CONFIG_DEBUG_SLAB)
123#define SLAB_DEBUG_FLAGS (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER)
124#elif defined(CONFIG_SLUB_DEBUG)
125#define SLAB_DEBUG_FLAGS (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER | \
126 SLAB_TRACE | SLAB_DEBUG_FREE)
127#else
128#define SLAB_DEBUG_FLAGS (0)
129#endif
130
131#if defined(CONFIG_SLAB)
132#define SLAB_CACHE_FLAGS (SLAB_MEM_SPREAD | SLAB_NOLEAKTRACE | \
133 SLAB_RECLAIM_ACCOUNT | SLAB_TEMPORARY | SLAB_NOTRACK)
134#elif defined(CONFIG_SLUB)
135#define SLAB_CACHE_FLAGS (SLAB_NOLEAKTRACE | SLAB_RECLAIM_ACCOUNT | \
136 SLAB_TEMPORARY | SLAB_NOTRACK)
137#else
138#define SLAB_CACHE_FLAGS (0)
139#endif
140
141#define CACHE_CREATE_MASK (SLAB_CORE_FLAGS | SLAB_DEBUG_FLAGS | SLAB_CACHE_FLAGS)
142
Christoph Lameter945cf2b2012-09-04 23:18:33 +0000143int __kmem_cache_shutdown(struct kmem_cache *);
Vladimir Davydov03afc0e2014-06-04 16:07:20 -0700144int __kmem_cache_shrink(struct kmem_cache *);
Christoph Lameter41a21282014-05-06 12:50:08 -0700145void slab_kmem_cache_release(struct kmem_cache *);
Christoph Lameter945cf2b2012-09-04 23:18:33 +0000146
Glauber Costab7454ad2012-10-19 18:20:25 +0400147struct seq_file;
148struct file;
Glauber Costab7454ad2012-10-19 18:20:25 +0400149
Glauber Costa0d7561c2012-10-19 18:20:27 +0400150struct slabinfo {
151 unsigned long active_objs;
152 unsigned long num_objs;
153 unsigned long active_slabs;
154 unsigned long num_slabs;
155 unsigned long shared_avail;
156 unsigned int limit;
157 unsigned int batchcount;
158 unsigned int shared;
159 unsigned int objects_per_slab;
160 unsigned int cache_order;
161};
162
163void get_slabinfo(struct kmem_cache *s, struct slabinfo *sinfo);
164void slabinfo_show_stats(struct seq_file *m, struct kmem_cache *s);
Glauber Costab7454ad2012-10-19 18:20:25 +0400165ssize_t slabinfo_write(struct file *file, const char __user *buffer,
166 size_t count, loff_t *ppos);
Glauber Costaba6c4962012-12-18 14:22:27 -0800167
168#ifdef CONFIG_MEMCG_KMEM
169static inline bool is_root_cache(struct kmem_cache *s)
170{
171 return !s->memcg_params || s->memcg_params->is_root_cache;
172}
Glauber Costa2633d7a2012-12-18 14:22:34 -0800173
Glauber Costab9ce5ef2012-12-18 14:22:46 -0800174static inline bool slab_equal_or_root(struct kmem_cache *s,
175 struct kmem_cache *p)
176{
177 return (p == s) ||
178 (s->memcg_params && (p == s->memcg_params->root_cache));
179}
Glauber Costa749c5412012-12-18 14:23:01 -0800180
181/*
182 * We use suffixes to the name in memcg because we can't have caches
183 * created in the system with the same name. But when we print them
184 * locally, better refer to them with the base name
185 */
186static inline const char *cache_name(struct kmem_cache *s)
187{
188 if (!is_root_cache(s))
189 return s->memcg_params->root_cache->name;
190 return s->name;
191}
192
Vladimir Davydovf8570262014-01-23 15:53:06 -0800193/*
194 * Note, we protect with RCU only the memcg_caches array, not per-memcg caches.
195 * That said the caller must assure the memcg's cache won't go away. Since once
196 * created a memcg's cache is destroyed only along with the root cache, it is
197 * true if we are going to allocate from the cache or hold a reference to the
198 * root cache by other means. Otherwise, we should hold either the slab_mutex
199 * or the memcg's slab_caches_mutex while calling this function and accessing
200 * the returned value.
201 */
Qiang Huang2ade4de2013-11-12 15:08:23 -0800202static inline struct kmem_cache *
203cache_from_memcg_idx(struct kmem_cache *s, int idx)
Glauber Costa749c5412012-12-18 14:23:01 -0800204{
Vladimir Davydov959c8962014-01-23 15:52:59 -0800205 struct kmem_cache *cachep;
Vladimir Davydovf8570262014-01-23 15:53:06 -0800206 struct memcg_cache_params *params;
Vladimir Davydov959c8962014-01-23 15:52:59 -0800207
Andrey Vagin6f6b8952013-08-28 16:35:20 -0700208 if (!s->memcg_params)
209 return NULL;
Vladimir Davydovf8570262014-01-23 15:53:06 -0800210
211 rcu_read_lock();
212 params = rcu_dereference(s->memcg_params);
213 cachep = params->memcg_caches[idx];
214 rcu_read_unlock();
Vladimir Davydov959c8962014-01-23 15:52:59 -0800215
216 /*
217 * Make sure we will access the up-to-date value. The code updating
218 * memcg_caches issues a write barrier to match this (see
219 * memcg_register_cache()).
220 */
221 smp_read_barrier_depends();
222 return cachep;
Glauber Costa749c5412012-12-18 14:23:01 -0800223}
Glauber Costa943a4512012-12-18 14:23:03 -0800224
225static inline struct kmem_cache *memcg_root_cache(struct kmem_cache *s)
226{
227 if (is_root_cache(s))
228 return s;
229 return s->memcg_params->root_cache;
230}
Vladimir Davydov5dfb4172014-06-04 16:06:38 -0700231
232static __always_inline int memcg_charge_slab(struct kmem_cache *s,
233 gfp_t gfp, int order)
234{
235 if (!memcg_kmem_enabled())
236 return 0;
237 if (is_root_cache(s))
238 return 0;
Vladimir Davydovc67a8a62014-06-04 16:07:39 -0700239 return __memcg_charge_slab(s, gfp, order);
Vladimir Davydov5dfb4172014-06-04 16:06:38 -0700240}
241
242static __always_inline void memcg_uncharge_slab(struct kmem_cache *s, int order)
243{
244 if (!memcg_kmem_enabled())
245 return;
246 if (is_root_cache(s))
247 return;
Vladimir Davydovc67a8a62014-06-04 16:07:39 -0700248 __memcg_uncharge_slab(s, order);
Vladimir Davydov5dfb4172014-06-04 16:06:38 -0700249}
Glauber Costaba6c4962012-12-18 14:22:27 -0800250#else
251static inline bool is_root_cache(struct kmem_cache *s)
252{
253 return true;
254}
255
Glauber Costab9ce5ef2012-12-18 14:22:46 -0800256static inline bool slab_equal_or_root(struct kmem_cache *s,
257 struct kmem_cache *p)
258{
259 return true;
260}
Glauber Costa749c5412012-12-18 14:23:01 -0800261
262static inline const char *cache_name(struct kmem_cache *s)
263{
264 return s->name;
265}
266
Qiang Huang2ade4de2013-11-12 15:08:23 -0800267static inline struct kmem_cache *
268cache_from_memcg_idx(struct kmem_cache *s, int idx)
Glauber Costa749c5412012-12-18 14:23:01 -0800269{
270 return NULL;
271}
Glauber Costa943a4512012-12-18 14:23:03 -0800272
273static inline struct kmem_cache *memcg_root_cache(struct kmem_cache *s)
274{
275 return s;
276}
Vladimir Davydov5dfb4172014-06-04 16:06:38 -0700277
278static inline int memcg_charge_slab(struct kmem_cache *s, gfp_t gfp, int order)
279{
280 return 0;
281}
282
283static inline void memcg_uncharge_slab(struct kmem_cache *s, int order)
284{
285}
Glauber Costaba6c4962012-12-18 14:22:27 -0800286#endif
Glauber Costab9ce5ef2012-12-18 14:22:46 -0800287
288static inline struct kmem_cache *cache_from_obj(struct kmem_cache *s, void *x)
289{
290 struct kmem_cache *cachep;
291 struct page *page;
292
293 /*
294 * When kmemcg is not being used, both assignments should return the
295 * same value. but we don't want to pay the assignment price in that
296 * case. If it is not compiled in, the compiler should be smart enough
297 * to not do even the assignment. In that case, slab_equal_or_root
298 * will also be a constant.
299 */
300 if (!memcg_kmem_enabled() && !unlikely(s->flags & SLAB_DEBUG_FREE))
301 return s;
302
303 page = virt_to_head_page(x);
304 cachep = page->slab_cache;
305 if (slab_equal_or_root(cachep, s))
306 return cachep;
307
308 pr_err("%s: Wrong slab cache. %s but object is from %s\n",
Joe Perchesc42e5712014-08-06 16:04:53 -0700309 __func__, cachep->name, s->name);
Glauber Costab9ce5ef2012-12-18 14:22:46 -0800310 WARN_ON_ONCE(1);
311 return s;
312}
Christoph Lameterca349562013-01-10 19:14:19 +0000313
Christoph Lameter44c53562014-08-06 16:04:07 -0700314#ifndef CONFIG_SLOB
Christoph Lameterca349562013-01-10 19:14:19 +0000315/*
316 * The slab lists for all objects.
317 */
318struct kmem_cache_node {
319 spinlock_t list_lock;
320
321#ifdef CONFIG_SLAB
322 struct list_head slabs_partial; /* partial list first, better asm code */
323 struct list_head slabs_full;
324 struct list_head slabs_free;
325 unsigned long free_objects;
326 unsigned int free_limit;
327 unsigned int colour_next; /* Per-node cache coloring */
328 struct array_cache *shared; /* shared per node */
Joonsoo Kimc8522a32014-08-06 16:04:29 -0700329 struct alien_cache **alien; /* on other nodes */
Christoph Lameterca349562013-01-10 19:14:19 +0000330 unsigned long next_reap; /* updated without locking */
331 int free_touched; /* updated without locking */
332#endif
333
334#ifdef CONFIG_SLUB
335 unsigned long nr_partial;
336 struct list_head partial;
337#ifdef CONFIG_SLUB_DEBUG
338 atomic_long_t nr_slabs;
339 atomic_long_t total_objects;
340 struct list_head full;
341#endif
342#endif
343
344};
Wanpeng Lie25839f2013-07-04 08:33:23 +0800345
Christoph Lameter44c53562014-08-06 16:04:07 -0700346static inline struct kmem_cache_node *get_node(struct kmem_cache *s, int node)
347{
348 return s->node[node];
349}
350
351/*
352 * Iterator over all nodes. The body will be executed for each node that has
353 * a kmem_cache_node structure allocated (which is true for all online nodes)
354 */
355#define for_each_kmem_cache_node(__s, __node, __n) \
Mikulas Patocka91635822014-10-09 15:26:20 -0700356 for (__node = 0; __node < nr_node_ids; __node++) \
357 if ((__n = get_node(__s, __node)))
Christoph Lameter44c53562014-08-06 16:04:07 -0700358
359#endif
360
Wanpeng Li276a2432013-07-08 08:08:28 +0800361void *slab_next(struct seq_file *m, void *p, loff_t *pos);
362void slab_stop(struct seq_file *m, void *p);
Andrey Ryabinin5240ab42014-08-06 16:04:14 -0700363
364#endif /* MM_SLAB_H */