blob: 86d7c7d860f92c3a46d505a4b327c76e34f5415a [file] [log] [blame]
Greg Kroah-Hartmanb2441312017-11-01 15:07:57 +01001/* SPDX-License-Identifier: GPL-2.0 */
Christoph Lameter97d06602012-07-06 15:25:11 -05002#ifndef MM_SLAB_H
3#define MM_SLAB_H
4/*
5 * Internal slab definitions
6 */
7
Joonsoo Kim07f361b2014-10-09 15:26:00 -07008#ifdef CONFIG_SLOB
9/*
10 * Common fields provided in kmem_cache by all slab allocators
11 * This struct is either used directly by the allocator (SLOB)
12 * or the allocator must include definitions for all fields
13 * provided in kmem_cache_common in their definition of kmem_cache.
14 *
15 * Once we can do anonymous structs (C11 standard) we could put a
16 * anonymous struct definition in these allocators so that the
17 * separate allocations in the kmem_cache structure of SLAB and
18 * SLUB is no longer needed.
19 */
20struct kmem_cache {
21 unsigned int object_size;/* The original size of the object */
22 unsigned int size; /* The aligned/padded/added on size */
23 unsigned int align; /* Alignment as calculated */
24 unsigned long flags; /* Active flags on the slab */
25 const char *name; /* Slab name for sysfs */
26 int refcount; /* Use counter */
27 void (*ctor)(void *); /* Called on object slot creation */
28 struct list_head list; /* List of all slab caches on the system */
29};
30
31#endif /* CONFIG_SLOB */
32
33#ifdef CONFIG_SLAB
34#include <linux/slab_def.h>
35#endif
36
37#ifdef CONFIG_SLUB
38#include <linux/slub_def.h>
39#endif
40
41#include <linux/memcontrol.h>
Jesper Dangaard Brouer11c7aec2016-03-15 14:53:35 -070042#include <linux/fault-inject.h>
43#include <linux/kmemcheck.h>
44#include <linux/kasan.h>
45#include <linux/kmemleak.h>
Thomas Garnier7c00fce2016-07-26 15:21:56 -070046#include <linux/random.h>
Peter Zijlstrad92a8cf2017-03-03 10:13:38 +010047#include <linux/sched/mm.h>
Joonsoo Kim07f361b2014-10-09 15:26:00 -070048
Christoph Lameter97d06602012-07-06 15:25:11 -050049/*
50 * State of the slab allocator.
51 *
52 * This is used to describe the states of the allocator during bootup.
53 * Allocators use this to gradually bootstrap themselves. Most allocators
54 * have the problem that the structures used for managing slab caches are
55 * allocated from slab caches themselves.
56 */
57enum slab_state {
58 DOWN, /* No slab functionality yet */
59 PARTIAL, /* SLUB: kmem_cache_node available */
Christoph Lameterce8eb6c2013-01-10 19:14:19 +000060 PARTIAL_NODE, /* SLAB: kmalloc size for node struct available */
Christoph Lameter97d06602012-07-06 15:25:11 -050061 UP, /* Slab caches usable but not all extras yet */
62 FULL /* Everything is working */
63};
64
65extern enum slab_state slab_state;
66
Christoph Lameter18004c52012-07-06 15:25:12 -050067/* The slab cache mutex protects the management structures during changes */
68extern struct mutex slab_mutex;
Christoph Lameter9b030cb2012-09-05 00:20:33 +000069
70/* The list of all slab caches on the system */
Christoph Lameter18004c52012-07-06 15:25:12 -050071extern struct list_head slab_caches;
72
Christoph Lameter9b030cb2012-09-05 00:20:33 +000073/* The slab cache that manages slab cache information */
74extern struct kmem_cache *kmem_cache;
75
Vlastimil Babkaaf3b5f82017-02-22 15:41:05 -080076/* A table of kmalloc cache names and sizes */
77extern const struct kmalloc_info_struct {
78 const char *name;
79 unsigned long size;
80} kmalloc_info[];
81
Christoph Lameter45906852012-11-28 16:23:16 +000082unsigned long calculate_alignment(unsigned long flags,
83 unsigned long align, unsigned long size);
84
Christoph Lameterf97d5f62013-01-10 19:12:17 +000085#ifndef CONFIG_SLOB
86/* Kmalloc array related functions */
Daniel Sanders34cc6992015-06-24 16:55:57 -070087void setup_kmalloc_cache_index_table(void);
Christoph Lameterf97d5f62013-01-10 19:12:17 +000088void create_kmalloc_caches(unsigned long);
Christoph Lameter2c59dd62013-01-10 19:14:19 +000089
90/* Find the kmalloc slab corresponding for a certain size */
91struct kmem_cache *kmalloc_slab(size_t, gfp_t);
Christoph Lameterf97d5f62013-01-10 19:12:17 +000092#endif
93
94
Christoph Lameter9b030cb2012-09-05 00:20:33 +000095/* Functions provided by the slab allocators */
Christoph Lameter8a13a4c2012-09-04 23:18:33 +000096extern int __kmem_cache_create(struct kmem_cache *, unsigned long flags);
Christoph Lameter97d06602012-07-06 15:25:11 -050097
Christoph Lameter45530c42012-11-28 16:23:07 +000098extern struct kmem_cache *create_kmalloc_cache(const char *name, size_t size,
99 unsigned long flags);
100extern void create_boot_cache(struct kmem_cache *, const char *name,
101 size_t size, unsigned long flags);
102
Joonsoo Kim423c9292014-10-09 15:26:22 -0700103int slab_unmergeable(struct kmem_cache *s);
104struct kmem_cache *find_mergeable(size_t size, size_t align,
105 unsigned long flags, const char *name, void (*ctor)(void *));
Joonsoo Kim12220de2014-10-09 15:26:24 -0700106#ifndef CONFIG_SLOB
Glauber Costa2633d7a2012-12-18 14:22:34 -0800107struct 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 *));
Joonsoo Kim423c9292014-10-09 15:26:22 -0700110
111unsigned long kmem_cache_flags(unsigned long object_size,
112 unsigned long flags, const char *name,
113 void (*ctor)(void *));
Christoph Lametercbb79692012-09-05 00:18:32 +0000114#else
Glauber Costa2633d7a2012-12-18 14:22:34 -0800115static inline struct kmem_cache *
Vladimir Davydova44cb942014-04-07 15:39:23 -0700116__kmem_cache_alias(const char *name, size_t size, size_t align,
117 unsigned long flags, void (*ctor)(void *))
Christoph Lametercbb79692012-09-05 00:18:32 +0000118{ return NULL; }
Joonsoo Kim423c9292014-10-09 15:26:22 -0700119
120static inline unsigned long kmem_cache_flags(unsigned long object_size,
121 unsigned long flags, const char *name,
122 void (*ctor)(void *))
123{
124 return flags;
125}
Christoph Lametercbb79692012-09-05 00:18:32 +0000126#endif
127
128
Glauber Costad8843922012-10-17 15:36:51 +0400129/* Legal flag mask for kmem_cache_create(), for various configurations */
130#define SLAB_CORE_FLAGS (SLAB_HWCACHE_ALIGN | SLAB_CACHE_DMA | SLAB_PANIC | \
Paul E. McKenney5f0d5a32017-01-18 02:53:44 -0800131 SLAB_TYPESAFE_BY_RCU | SLAB_DEBUG_OBJECTS )
Glauber Costad8843922012-10-17 15:36:51 +0400132
133#if defined(CONFIG_DEBUG_SLAB)
134#define SLAB_DEBUG_FLAGS (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER)
135#elif defined(CONFIG_SLUB_DEBUG)
136#define SLAB_DEBUG_FLAGS (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER | \
Laura Abbottbecfda62016-03-15 14:55:06 -0700137 SLAB_TRACE | SLAB_CONSISTENCY_CHECKS)
Glauber Costad8843922012-10-17 15:36:51 +0400138#else
139#define SLAB_DEBUG_FLAGS (0)
140#endif
141
142#if defined(CONFIG_SLAB)
143#define SLAB_CACHE_FLAGS (SLAB_MEM_SPREAD | SLAB_NOLEAKTRACE | \
Vladimir Davydov230e9fc2016-01-14 15:18:15 -0800144 SLAB_RECLAIM_ACCOUNT | SLAB_TEMPORARY | \
145 SLAB_NOTRACK | SLAB_ACCOUNT)
Glauber Costad8843922012-10-17 15:36:51 +0400146#elif defined(CONFIG_SLUB)
147#define SLAB_CACHE_FLAGS (SLAB_NOLEAKTRACE | SLAB_RECLAIM_ACCOUNT | \
Vladimir Davydov230e9fc2016-01-14 15:18:15 -0800148 SLAB_TEMPORARY | SLAB_NOTRACK | SLAB_ACCOUNT)
Glauber Costad8843922012-10-17 15:36:51 +0400149#else
150#define SLAB_CACHE_FLAGS (0)
151#endif
152
Thomas Garniere70954f2016-12-12 16:41:38 -0800153/* Common flags available with current configuration */
Glauber Costad8843922012-10-17 15:36:51 +0400154#define CACHE_CREATE_MASK (SLAB_CORE_FLAGS | SLAB_DEBUG_FLAGS | SLAB_CACHE_FLAGS)
155
Thomas Garniere70954f2016-12-12 16:41:38 -0800156/* Common flags permitted for kmem_cache_create */
157#define SLAB_FLAGS_PERMITTED (SLAB_CORE_FLAGS | \
158 SLAB_RED_ZONE | \
159 SLAB_POISON | \
160 SLAB_STORE_USER | \
161 SLAB_TRACE | \
162 SLAB_CONSISTENCY_CHECKS | \
163 SLAB_MEM_SPREAD | \
164 SLAB_NOLEAKTRACE | \
165 SLAB_RECLAIM_ACCOUNT | \
166 SLAB_TEMPORARY | \
167 SLAB_NOTRACK | \
168 SLAB_ACCOUNT)
169
Christoph Lameter945cf2b2012-09-04 23:18:33 +0000170int __kmem_cache_shutdown(struct kmem_cache *);
Dmitry Safonov52b4b952016-02-17 13:11:37 -0800171void __kmem_cache_release(struct kmem_cache *);
Tejun Heoc9fc5862017-02-22 15:41:27 -0800172int __kmem_cache_shrink(struct kmem_cache *);
173void __kmemcg_cache_deactivate(struct kmem_cache *s);
Christoph Lameter41a21282014-05-06 12:50:08 -0700174void slab_kmem_cache_release(struct kmem_cache *);
Christoph Lameter945cf2b2012-09-04 23:18:33 +0000175
Glauber Costab7454ad2012-10-19 18:20:25 +0400176struct seq_file;
177struct file;
Glauber Costab7454ad2012-10-19 18:20:25 +0400178
Glauber Costa0d7561c2012-10-19 18:20:27 +0400179struct slabinfo {
180 unsigned long active_objs;
181 unsigned long num_objs;
182 unsigned long active_slabs;
183 unsigned long num_slabs;
184 unsigned long shared_avail;
185 unsigned int limit;
186 unsigned int batchcount;
187 unsigned int shared;
188 unsigned int objects_per_slab;
189 unsigned int cache_order;
190};
191
192void get_slabinfo(struct kmem_cache *s, struct slabinfo *sinfo);
193void slabinfo_show_stats(struct seq_file *m, struct kmem_cache *s);
Glauber Costab7454ad2012-10-19 18:20:25 +0400194ssize_t slabinfo_write(struct file *file, const char __user *buffer,
195 size_t count, loff_t *ppos);
Glauber Costaba6c4962012-12-18 14:22:27 -0800196
Christoph Lameter484748f2015-09-04 15:45:34 -0700197/*
198 * Generic implementation of bulk operations
199 * These are useful for situations in which the allocator cannot
Jesper Dangaard Brouer9f706d62016-03-15 14:54:03 -0700200 * perform optimizations. In that case segments of the object listed
Christoph Lameter484748f2015-09-04 15:45:34 -0700201 * may be allocated or freed using these operations.
202 */
203void __kmem_cache_free_bulk(struct kmem_cache *, size_t, void **);
Jesper Dangaard Brouer865762a2015-11-20 15:57:58 -0800204int __kmem_cache_alloc_bulk(struct kmem_cache *, gfp_t, size_t, void **);
Christoph Lameter484748f2015-09-04 15:45:34 -0700205
Johannes Weiner127424c2016-01-20 15:02:32 -0800206#if defined(CONFIG_MEMCG) && !defined(CONFIG_SLOB)
Tejun Heo510ded32017-02-22 15:41:24 -0800207
208/* List of all root caches. */
209extern struct list_head slab_root_caches;
210#define root_caches_node memcg_params.__root_caches_node
211
Vladimir Davydov426589f2015-02-12 14:59:23 -0800212/*
213 * Iterate over all memcg caches of the given root cache. The caller must hold
214 * slab_mutex.
215 */
216#define for_each_memcg_cache(iter, root) \
Tejun Heo9eeadc82017-02-22 15:41:17 -0800217 list_for_each_entry(iter, &(root)->memcg_params.children, \
218 memcg_params.children_node)
Vladimir Davydov426589f2015-02-12 14:59:23 -0800219
Glauber Costaba6c4962012-12-18 14:22:27 -0800220static inline bool is_root_cache(struct kmem_cache *s)
221{
Tejun Heo9eeadc82017-02-22 15:41:17 -0800222 return !s->memcg_params.root_cache;
Glauber Costaba6c4962012-12-18 14:22:27 -0800223}
Glauber Costa2633d7a2012-12-18 14:22:34 -0800224
Glauber Costab9ce5ef2012-12-18 14:22:46 -0800225static inline bool slab_equal_or_root(struct kmem_cache *s,
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800226 struct kmem_cache *p)
Glauber Costab9ce5ef2012-12-18 14:22:46 -0800227{
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800228 return p == s || p == s->memcg_params.root_cache;
Glauber Costab9ce5ef2012-12-18 14:22:46 -0800229}
Glauber Costa749c5412012-12-18 14:23:01 -0800230
231/*
232 * We use suffixes to the name in memcg because we can't have caches
233 * created in the system with the same name. But when we print them
234 * locally, better refer to them with the base name
235 */
236static inline const char *cache_name(struct kmem_cache *s)
237{
238 if (!is_root_cache(s))
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800239 s = s->memcg_params.root_cache;
Glauber Costa749c5412012-12-18 14:23:01 -0800240 return s->name;
241}
242
Vladimir Davydovf8570262014-01-23 15:53:06 -0800243/*
244 * Note, we protect with RCU only the memcg_caches array, not per-memcg caches.
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800245 * That said the caller must assure the memcg's cache won't go away by either
246 * taking a css reference to the owner cgroup, or holding the slab_mutex.
Vladimir Davydovf8570262014-01-23 15:53:06 -0800247 */
Qiang Huang2ade4de2013-11-12 15:08:23 -0800248static inline struct kmem_cache *
249cache_from_memcg_idx(struct kmem_cache *s, int idx)
Glauber Costa749c5412012-12-18 14:23:01 -0800250{
Vladimir Davydov959c8962014-01-23 15:52:59 -0800251 struct kmem_cache *cachep;
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800252 struct memcg_cache_array *arr;
Vladimir Davydovf8570262014-01-23 15:53:06 -0800253
254 rcu_read_lock();
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800255 arr = rcu_dereference(s->memcg_params.memcg_caches);
Vladimir Davydov959c8962014-01-23 15:52:59 -0800256
257 /*
258 * Make sure we will access the up-to-date value. The code updating
259 * memcg_caches issues a write barrier to match this (see
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800260 * memcg_create_kmem_cache()).
Vladimir Davydov959c8962014-01-23 15:52:59 -0800261 */
Will Deacon506458e2017-10-24 11:22:48 +0100262 cachep = READ_ONCE(arr->entries[idx]);
Pranith Kumar8df0c2d2014-12-10 15:42:28 -0800263 rcu_read_unlock();
264
Vladimir Davydov959c8962014-01-23 15:52:59 -0800265 return cachep;
Glauber Costa749c5412012-12-18 14:23:01 -0800266}
Glauber Costa943a4512012-12-18 14:23:03 -0800267
268static inline struct kmem_cache *memcg_root_cache(struct kmem_cache *s)
269{
270 if (is_root_cache(s))
271 return s;
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800272 return s->memcg_params.root_cache;
Glauber Costa943a4512012-12-18 14:23:03 -0800273}
Vladimir Davydov5dfb4172014-06-04 16:06:38 -0700274
Vladimir Davydovf3ccb2c42015-11-05 18:49:01 -0800275static __always_inline int memcg_charge_slab(struct page *page,
276 gfp_t gfp, int order,
277 struct kmem_cache *s)
Vladimir Davydov5dfb4172014-06-04 16:06:38 -0700278{
279 if (!memcg_kmem_enabled())
280 return 0;
281 if (is_root_cache(s))
282 return 0;
Johannes Weiner7779f212017-07-06 15:40:55 -0700283 return memcg_kmem_charge_memcg(page, gfp, order, s->memcg_params.memcg);
Vladimir Davydov27ee57c2016-03-17 14:17:35 -0700284}
285
286static __always_inline void memcg_uncharge_slab(struct page *page, int order,
287 struct kmem_cache *s)
288{
Vladimir Davydov45264772016-07-26 15:24:21 -0700289 if (!memcg_kmem_enabled())
290 return;
Vladimir Davydov27ee57c2016-03-17 14:17:35 -0700291 memcg_kmem_uncharge(page, order);
Vladimir Davydov5dfb4172014-06-04 16:06:38 -0700292}
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800293
294extern void slab_init_memcg_params(struct kmem_cache *);
Tejun Heo510ded32017-02-22 15:41:24 -0800295extern void memcg_link_cache(struct kmem_cache *s);
Tejun Heo01fb58b2017-02-22 15:41:30 -0800296extern void slab_deactivate_memcg_cache_rcu_sched(struct kmem_cache *s,
297 void (*deact_fn)(struct kmem_cache *));
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800298
Johannes Weiner127424c2016-01-20 15:02:32 -0800299#else /* CONFIG_MEMCG && !CONFIG_SLOB */
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800300
Tejun Heo510ded32017-02-22 15:41:24 -0800301/* If !memcg, all caches are root. */
302#define slab_root_caches slab_caches
303#define root_caches_node list
304
Vladimir Davydov426589f2015-02-12 14:59:23 -0800305#define for_each_memcg_cache(iter, root) \
306 for ((void)(iter), (void)(root); 0; )
Vladimir Davydov426589f2015-02-12 14:59:23 -0800307
Glauber Costaba6c4962012-12-18 14:22:27 -0800308static inline bool is_root_cache(struct kmem_cache *s)
309{
310 return true;
311}
312
Glauber Costab9ce5ef2012-12-18 14:22:46 -0800313static inline bool slab_equal_or_root(struct kmem_cache *s,
314 struct kmem_cache *p)
315{
316 return true;
317}
Glauber Costa749c5412012-12-18 14:23:01 -0800318
319static inline const char *cache_name(struct kmem_cache *s)
320{
321 return s->name;
322}
323
Qiang Huang2ade4de2013-11-12 15:08:23 -0800324static inline struct kmem_cache *
325cache_from_memcg_idx(struct kmem_cache *s, int idx)
Glauber Costa749c5412012-12-18 14:23:01 -0800326{
327 return NULL;
328}
Glauber Costa943a4512012-12-18 14:23:03 -0800329
330static inline struct kmem_cache *memcg_root_cache(struct kmem_cache *s)
331{
332 return s;
333}
Vladimir Davydov5dfb4172014-06-04 16:06:38 -0700334
Vladimir Davydovf3ccb2c42015-11-05 18:49:01 -0800335static inline int memcg_charge_slab(struct page *page, gfp_t gfp, int order,
336 struct kmem_cache *s)
Vladimir Davydov5dfb4172014-06-04 16:06:38 -0700337{
338 return 0;
339}
340
Vladimir Davydov27ee57c2016-03-17 14:17:35 -0700341static inline void memcg_uncharge_slab(struct page *page, int order,
342 struct kmem_cache *s)
343{
344}
345
Vladimir Davydovf7ce3192015-02-12 14:59:20 -0800346static inline void slab_init_memcg_params(struct kmem_cache *s)
347{
348}
Tejun Heo510ded32017-02-22 15:41:24 -0800349
350static inline void memcg_link_cache(struct kmem_cache *s)
351{
352}
353
Johannes Weiner127424c2016-01-20 15:02:32 -0800354#endif /* CONFIG_MEMCG && !CONFIG_SLOB */
Glauber Costab9ce5ef2012-12-18 14:22:46 -0800355
356static inline struct kmem_cache *cache_from_obj(struct kmem_cache *s, void *x)
357{
358 struct kmem_cache *cachep;
359 struct page *page;
360
361 /*
362 * When kmemcg is not being used, both assignments should return the
363 * same value. but we don't want to pay the assignment price in that
364 * case. If it is not compiled in, the compiler should be smart enough
365 * to not do even the assignment. In that case, slab_equal_or_root
366 * will also be a constant.
367 */
Laura Abbottbecfda62016-03-15 14:55:06 -0700368 if (!memcg_kmem_enabled() &&
369 !unlikely(s->flags & SLAB_CONSISTENCY_CHECKS))
Glauber Costab9ce5ef2012-12-18 14:22:46 -0800370 return s;
371
372 page = virt_to_head_page(x);
373 cachep = page->slab_cache;
374 if (slab_equal_or_root(cachep, s))
375 return cachep;
376
377 pr_err("%s: Wrong slab cache. %s but object is from %s\n",
Daniel Borkmann2d16e0fd2015-09-04 15:45:57 -0700378 __func__, s->name, cachep->name);
Glauber Costab9ce5ef2012-12-18 14:22:46 -0800379 WARN_ON_ONCE(1);
380 return s;
381}
Christoph Lameterca349562013-01-10 19:14:19 +0000382
Jesper Dangaard Brouer11c7aec2016-03-15 14:53:35 -0700383static inline size_t slab_ksize(const struct kmem_cache *s)
384{
385#ifndef CONFIG_SLUB
386 return s->object_size;
387
388#else /* CONFIG_SLUB */
389# ifdef CONFIG_SLUB_DEBUG
390 /*
391 * Debugging requires use of the padding between object
392 * and whatever may come after it.
393 */
394 if (s->flags & (SLAB_RED_ZONE | SLAB_POISON))
395 return s->object_size;
396# endif
Alexander Potapenko80a92012016-07-28 15:49:07 -0700397 if (s->flags & SLAB_KASAN)
398 return s->object_size;
Jesper Dangaard Brouer11c7aec2016-03-15 14:53:35 -0700399 /*
400 * If we have the need to store the freelist pointer
401 * back there or track user information then we can
402 * only use the space before that information.
403 */
Paul E. McKenney5f0d5a32017-01-18 02:53:44 -0800404 if (s->flags & (SLAB_TYPESAFE_BY_RCU | SLAB_STORE_USER))
Jesper Dangaard Brouer11c7aec2016-03-15 14:53:35 -0700405 return s->inuse;
406 /*
407 * Else we can use all the padding etc for the allocation
408 */
409 return s->size;
410#endif
411}
412
413static inline struct kmem_cache *slab_pre_alloc_hook(struct kmem_cache *s,
414 gfp_t flags)
415{
416 flags &= gfp_allowed_mask;
Peter Zijlstrad92a8cf2017-03-03 10:13:38 +0100417
418 fs_reclaim_acquire(flags);
419 fs_reclaim_release(flags);
420
Jesper Dangaard Brouer11c7aec2016-03-15 14:53:35 -0700421 might_sleep_if(gfpflags_allow_blocking(flags));
422
Jesper Dangaard Brouerfab99632016-03-15 14:53:38 -0700423 if (should_failslab(s, flags))
Jesper Dangaard Brouer11c7aec2016-03-15 14:53:35 -0700424 return NULL;
425
Vladimir Davydov45264772016-07-26 15:24:21 -0700426 if (memcg_kmem_enabled() &&
427 ((flags & __GFP_ACCOUNT) || (s->flags & SLAB_ACCOUNT)))
428 return memcg_kmem_get_cache(s);
429
430 return s;
Jesper Dangaard Brouer11c7aec2016-03-15 14:53:35 -0700431}
432
433static inline void slab_post_alloc_hook(struct kmem_cache *s, gfp_t flags,
434 size_t size, void **p)
435{
436 size_t i;
437
438 flags &= gfp_allowed_mask;
439 for (i = 0; i < size; i++) {
440 void *object = p[i];
441
442 kmemcheck_slab_alloc(s, flags, object, slab_ksize(s));
443 kmemleak_alloc_recursive(object, s->object_size, 1,
444 s->flags, flags);
Alexander Potapenko505f5dc2016-03-25 14:22:02 -0700445 kasan_slab_alloc(s, object, flags);
Jesper Dangaard Brouer11c7aec2016-03-15 14:53:35 -0700446 }
Vladimir Davydov45264772016-07-26 15:24:21 -0700447
448 if (memcg_kmem_enabled())
449 memcg_kmem_put_cache(s);
Jesper Dangaard Brouer11c7aec2016-03-15 14:53:35 -0700450}
451
Christoph Lameter44c53562014-08-06 16:04:07 -0700452#ifndef CONFIG_SLOB
Christoph Lameterca349562013-01-10 19:14:19 +0000453/*
454 * The slab lists for all objects.
455 */
456struct kmem_cache_node {
457 spinlock_t list_lock;
458
459#ifdef CONFIG_SLAB
460 struct list_head slabs_partial; /* partial list first, better asm code */
461 struct list_head slabs_full;
462 struct list_head slabs_free;
David Rientjesbf00bd32016-12-12 16:41:44 -0800463 unsigned long total_slabs; /* length of all slab lists */
464 unsigned long free_slabs; /* length of free slab list only */
Christoph Lameterca349562013-01-10 19:14:19 +0000465 unsigned long free_objects;
466 unsigned int free_limit;
467 unsigned int colour_next; /* Per-node cache coloring */
468 struct array_cache *shared; /* shared per node */
Joonsoo Kimc8522a32014-08-06 16:04:29 -0700469 struct alien_cache **alien; /* on other nodes */
Christoph Lameterca349562013-01-10 19:14:19 +0000470 unsigned long next_reap; /* updated without locking */
471 int free_touched; /* updated without locking */
472#endif
473
474#ifdef CONFIG_SLUB
475 unsigned long nr_partial;
476 struct list_head partial;
477#ifdef CONFIG_SLUB_DEBUG
478 atomic_long_t nr_slabs;
479 atomic_long_t total_objects;
480 struct list_head full;
481#endif
482#endif
483
484};
Wanpeng Lie25839f2013-07-04 08:33:23 +0800485
Christoph Lameter44c53562014-08-06 16:04:07 -0700486static inline struct kmem_cache_node *get_node(struct kmem_cache *s, int node)
487{
488 return s->node[node];
489}
490
491/*
492 * Iterator over all nodes. The body will be executed for each node that has
493 * a kmem_cache_node structure allocated (which is true for all online nodes)
494 */
495#define for_each_kmem_cache_node(__s, __node, __n) \
Mikulas Patocka91635822014-10-09 15:26:20 -0700496 for (__node = 0; __node < nr_node_ids; __node++) \
497 if ((__n = get_node(__s, __node)))
Christoph Lameter44c53562014-08-06 16:04:07 -0700498
499#endif
500
Vladimir Davydov1df3b262014-12-10 15:42:16 -0800501void *slab_start(struct seq_file *m, loff_t *pos);
Wanpeng Li276a2432013-07-08 08:08:28 +0800502void *slab_next(struct seq_file *m, void *p, loff_t *pos);
503void slab_stop(struct seq_file *m, void *p);
Tejun Heobc2791f2017-02-22 15:41:21 -0800504void *memcg_slab_start(struct seq_file *m, loff_t *pos);
505void *memcg_slab_next(struct seq_file *m, void *p, loff_t *pos);
506void memcg_slab_stop(struct seq_file *m, void *p);
Vladimir Davydovb0475012014-12-10 15:44:19 -0800507int memcg_slab_show(struct seq_file *m, void *p);
Andrey Ryabinin5240ab42014-08-06 16:04:14 -0700508
Alexander Potapenko55834c52016-05-20 16:59:11 -0700509void ___cache_free(struct kmem_cache *cache, void *x, unsigned long addr);
510
Thomas Garnier7c00fce2016-07-26 15:21:56 -0700511#ifdef CONFIG_SLAB_FREELIST_RANDOM
512int cache_random_seq_create(struct kmem_cache *cachep, unsigned int count,
513 gfp_t gfp);
514void cache_random_seq_destroy(struct kmem_cache *cachep);
515#else
516static inline int cache_random_seq_create(struct kmem_cache *cachep,
517 unsigned int count, gfp_t gfp)
518{
519 return 0;
520}
521static inline void cache_random_seq_destroy(struct kmem_cache *cachep) { }
522#endif /* CONFIG_SLAB_FREELIST_RANDOM */
523
Andrey Ryabinin5240ab42014-08-06 16:04:14 -0700524#endif /* MM_SLAB_H */