[mirror_ubuntu-zesty-kernel.git] / mm / slab.h

#ifndef MM_SLAB_H
#define MM_SLAB_H
/*
 * Internal slab definitions
 */

#ifdef CONFIG_SLOB
/*
 * Common fields provided in kmem_cache by all slab allocators
 * This struct is either used directly by the allocator (SLOB)
 * or the allocator must include definitions for all fields
 * provided in kmem_cache_common in their definition of kmem_cache.
 *
 * Once we can do anonymous structs (C11 standard) we could put a
 * anonymous struct definition in these allocators so that the
 * separate allocations in the kmem_cache structure of SLAB and
 * SLUB is no longer needed.
 */
struct kmem_cache {
	unsigned int object_size;/* The original size of the object */
	unsigned int size;	/* The aligned/padded/added on size  */
	unsigned int align;	/* Alignment as calculated */
	unsigned long flags;	/* Active flags on the slab */
	const char *name;	/* Slab name for sysfs */
	int refcount;		/* Use counter */
	void (*ctor)(void *);	/* Called on object slot creation */
	struct list_head list;	/* List of all slab caches on the system */
};

#endif /* CONFIG_SLOB */

#ifdef CONFIG_SLAB
#include <linux/slab_def.h>
#endif

#ifdef CONFIG_SLUB
#include <linux/slub_def.h>
#endif

#include <linux/memcontrol.h>
#include <linux/fault-inject.h>
#include <linux/kmemcheck.h>
#include <linux/kasan.h>
#include <linux/kmemleak.h>
#include <linux/random.h>

/*
 * State of the slab allocator.
 *
 * This is used to describe the states of the allocator during bootup.
 * Allocators use this to gradually bootstrap themselves. Most allocators
 * have the problem that the structures used for managing slab caches are
 * allocated from slab caches themselves.
 */
enum slab_state {
	DOWN,			/* No slab functionality yet */
	PARTIAL,		/* SLUB: kmem_cache_node available */
	PARTIAL_NODE,		/* SLAB: kmalloc size for node struct available */
	UP,			/* Slab caches usable but not all extras yet */
	FULL			/* Everything is working */
};

extern enum slab_state slab_state;

/* The slab cache mutex protects the management structures during changes */
extern struct mutex slab_mutex;

/* The list of all slab caches on the system */
extern struct list_head slab_caches;

/* The slab cache that manages slab cache information */
extern struct kmem_cache *kmem_cache;

unsigned long calculate_alignment(unsigned long flags,
		unsigned long align, unsigned long size);

#ifndef CONFIG_SLOB
/* Kmalloc array related functions */
void setup_kmalloc_cache_index_table(void);
void create_kmalloc_caches(unsigned long);

/* Find the kmalloc slab corresponding for a certain size */
struct kmem_cache *kmalloc_slab(size_t, gfp_t);
#endif


/* Functions provided by the slab allocators */
extern int __kmem_cache_create(struct kmem_cache *, unsigned long flags);

extern struct kmem_cache *create_kmalloc_cache(const char *name, size_t size,
			unsigned long flags);
extern void create_boot_cache(struct kmem_cache *, const char *name,
			size_t size, unsigned long flags);

int slab_unmergeable(struct kmem_cache *s);
struct kmem_cache *find_mergeable(size_t size, size_t align,
		unsigned long flags, const char *name, void (*ctor)(void *));
#ifndef CONFIG_SLOB
struct kmem_cache *
__kmem_cache_alias(const char *name, size_t size, size_t align,
		   unsigned long flags, void (*ctor)(void *));

unsigned long kmem_cache_flags(unsigned long object_size,
	unsigned long flags, const char *name,
	void (*ctor)(void *));
#else
static inline struct kmem_cache *
__kmem_cache_alias(const char *name, size_t size, size_t align,
		   unsigned long flags, void (*ctor)(void *))
{ return NULL; }

static inline unsigned long kmem_cache_flags(unsigned long object_size,
	unsigned long flags, const char *name,
	void (*ctor)(void *))
{
	return flags;
}
#endif


/* Legal flag mask for kmem_cache_create(), for various configurations */
#define SLAB_CORE_FLAGS (SLAB_HWCACHE_ALIGN | SLAB_CACHE_DMA | SLAB_PANIC | \
			 SLAB_DESTROY_BY_RCU | SLAB_DEBUG_OBJECTS )

#if defined(CONFIG_DEBUG_SLAB)
#define SLAB_DEBUG_FLAGS (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER)
#elif defined(CONFIG_SLUB_DEBUG)
#define SLAB_DEBUG_FLAGS (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER | \
			  SLAB_TRACE | SLAB_CONSISTENCY_CHECKS)
#else
#define SLAB_DEBUG_FLAGS (0)
#endif

#if defined(CONFIG_SLAB)
#define SLAB_CACHE_FLAGS (SLAB_MEM_SPREAD | SLAB_NOLEAKTRACE | \
			  SLAB_RECLAIM_ACCOUNT | SLAB_TEMPORARY | \
			  SLAB_NOTRACK | SLAB_ACCOUNT)
#elif defined(CONFIG_SLUB)
#define SLAB_CACHE_FLAGS (SLAB_NOLEAKTRACE | SLAB_RECLAIM_ACCOUNT | \
			  SLAB_TEMPORARY | SLAB_NOTRACK | SLAB_ACCOUNT)
#else
#define SLAB_CACHE_FLAGS (0)
#endif

/* Common flags available with current configuration */
#define CACHE_CREATE_MASK (SLAB_CORE_FLAGS | SLAB_DEBUG_FLAGS | SLAB_CACHE_FLAGS)

/* Common flags permitted for kmem_cache_create */
#define SLAB_FLAGS_PERMITTED (SLAB_CORE_FLAGS | \
			      SLAB_RED_ZONE | \
			      SLAB_POISON | \
			      SLAB_STORE_USER | \
			      SLAB_TRACE | \
			      SLAB_CONSISTENCY_CHECKS | \
			      SLAB_MEM_SPREAD | \
			      SLAB_NOLEAKTRACE | \
			      SLAB_RECLAIM_ACCOUNT | \
			      SLAB_TEMPORARY | \
			      SLAB_NOTRACK | \
			      SLAB_ACCOUNT)

int __kmem_cache_shutdown(struct kmem_cache *);
void __kmem_cache_release(struct kmem_cache *);
int __kmem_cache_shrink(struct kmem_cache *);
void slab_kmem_cache_release(struct kmem_cache *);

struct seq_file;
struct file;

struct slabinfo {
	unsigned long active_objs;
	unsigned long num_objs;
	unsigned long active_slabs;
	unsigned long num_slabs;
	unsigned long shared_avail;
	unsigned int limit;
	unsigned int batchcount;
	unsigned int shared;
	unsigned int objects_per_slab;
	unsigned int cache_order;
};

void get_slabinfo(struct kmem_cache *s, struct slabinfo *sinfo);
void slabinfo_show_stats(struct seq_file *m, struct kmem_cache *s);
ssize_t slabinfo_write(struct file *file, const char __user *buffer,
		       size_t count, loff_t *ppos);

/*
 * Generic implementation of bulk operations
 * These are useful for situations in which the allocator cannot
 * perform optimizations. In that case segments of the object listed
 * may be allocated or freed using these operations.
 */
void __kmem_cache_free_bulk(struct kmem_cache *, size_t, void **);
int __kmem_cache_alloc_bulk(struct kmem_cache *, gfp_t, size_t, void **);

#if defined(CONFIG_MEMCG) && !defined(CONFIG_SLOB)
/*
 * Iterate over all memcg caches of the given root cache. The caller must hold
 * slab_mutex.
 */
#define for_each_memcg_cache(iter, root) \
	list_for_each_entry(iter, &(root)->memcg_params.list, \
			    memcg_params.list)

static inline bool is_root_cache(struct kmem_cache *s)
{
	return s->memcg_params.is_root_cache;
}

static inline bool slab_equal_or_root(struct kmem_cache *s,
				      struct kmem_cache *p)
{
	return p == s || p == s->memcg_params.root_cache;
}

/*
 * We use suffixes to the name in memcg because we can't have caches
 * created in the system with the same name. But when we print them
 * locally, better refer to them with the base name
 */
static inline const char *cache_name(struct kmem_cache *s)
{
	if (!is_root_cache(s))
		s = s->memcg_params.root_cache;
	return s->name;
}

/*
 * Note, we protect with RCU only the memcg_caches array, not per-memcg caches.
 * That said the caller must assure the memcg's cache won't go away by either
 * taking a css reference to the owner cgroup, or holding the slab_mutex.
 */
static inline struct kmem_cache *
cache_from_memcg_idx(struct kmem_cache *s, int idx)
{
	struct kmem_cache *cachep;
	struct memcg_cache_array *arr;

	rcu_read_lock();
	arr = rcu_dereference(s->memcg_params.memcg_caches);

	/*
	 * Make sure we will access the up-to-date value. The code updating
	 * memcg_caches issues a write barrier to match this (see
	 * memcg_create_kmem_cache()).
	 */
	cachep = lockless_dereference(arr->entries[idx]);
	rcu_read_unlock();

	return cachep;
}

static inline struct kmem_cache *memcg_root_cache(struct kmem_cache *s)
{
	if (is_root_cache(s))
		return s;
	return s->memcg_params.root_cache;
}

static __always_inline int memcg_charge_slab(struct page *page,
					     gfp_t gfp, int order,
					     struct kmem_cache *s)
{
	int ret;

	if (!memcg_kmem_enabled())
		return 0;
	if (is_root_cache(s))
		return 0;

	ret = memcg_kmem_charge_memcg(page, gfp, order, s->memcg_params.memcg);
	if (ret)
		return ret;

	memcg_kmem_update_page_stat(page,
			(s->flags & SLAB_RECLAIM_ACCOUNT) ?
			MEMCG_SLAB_RECLAIMABLE : MEMCG_SLAB_UNRECLAIMABLE,
			1 << order);
	return 0;
}

static __always_inline void memcg_uncharge_slab(struct page *page, int order,
						struct kmem_cache *s)
{
	if (!memcg_kmem_enabled())
		return;

	memcg_kmem_update_page_stat(page,
			(s->flags & SLAB_RECLAIM_ACCOUNT) ?
			MEMCG_SLAB_RECLAIMABLE : MEMCG_SLAB_UNRECLAIMABLE,
			-(1 << order));
	memcg_kmem_uncharge(page, order);
}

extern void slab_init_memcg_params(struct kmem_cache *);

#else /* CONFIG_MEMCG && !CONFIG_SLOB */

#define for_each_memcg_cache(iter, root) \
	for ((void)(iter), (void)(root); 0; )

static inline bool is_root_cache(struct kmem_cache *s)
{
	return true;
}

static inline bool slab_equal_or_root(struct kmem_cache *s,
				      struct kmem_cache *p)
{
	return true;
}

static inline const char *cache_name(struct kmem_cache *s)
{
	return s->name;
}

static inline struct kmem_cache *
cache_from_memcg_idx(struct kmem_cache *s, int idx)
{
	return NULL;
}

static inline struct kmem_cache *memcg_root_cache(struct kmem_cache *s)
{
	return s;
}

static inline int memcg_charge_slab(struct page *page, gfp_t gfp, int order,
				    struct kmem_cache *s)
{
	return 0;
}

static inline void memcg_uncharge_slab(struct page *page, int order,
				       struct kmem_cache *s)
{
}

static inline void slab_init_memcg_params(struct kmem_cache *s)
{
}
#endif /* CONFIG_MEMCG && !CONFIG_SLOB */

static inline struct kmem_cache *cache_from_obj(struct kmem_cache *s, void *x)
{
	struct kmem_cache *cachep;
	struct page *page;

	/*
	 * When kmemcg is not being used, both assignments should return the
	 * same value. but we don't want to pay the assignment price in that
	 * case. If it is not compiled in, the compiler should be smart enough
	 * to not do even the assignment. In that case, slab_equal_or_root
	 * will also be a constant.
	 */
	if (!memcg_kmem_enabled() &&
	    !unlikely(s->flags & SLAB_CONSISTENCY_CHECKS))
		return s;

	page = virt_to_head_page(x);
	cachep = page->slab_cache;
	if (slab_equal_or_root(cachep, s))
		return cachep;

	pr_err("%s: Wrong slab cache. %s but object is from %s\n",
	       __func__, s->name, cachep->name);
	WARN_ON_ONCE(1);
	return s;
}

static inline size_t slab_ksize(const struct kmem_cache *s)
{
#ifndef CONFIG_SLUB
	return s->object_size;

#else /* CONFIG_SLUB */
# ifdef CONFIG_SLUB_DEBUG
	/*
	 * Debugging requires use of the padding between object
	 * and whatever may come after it.
	 */
	if (s->flags & (SLAB_RED_ZONE | SLAB_POISON))
		return s->object_size;
# endif
	if (s->flags & SLAB_KASAN)
		return s->object_size;
	/*
	 * If we have the need to store the freelist pointer
	 * back there or track user information then we can
	 * only use the space before that information.
	 */
	if (s->flags & (SLAB_DESTROY_BY_RCU | SLAB_STORE_USER))
		return s->inuse;
	/*
	 * Else we can use all the padding etc for the allocation
	 */
	return s->size;
#endif
}

static inline struct kmem_cache *slab_pre_alloc_hook(struct kmem_cache *s,
						     gfp_t flags)
{
	flags &= gfp_allowed_mask;
	lockdep_trace_alloc(flags);
	might_sleep_if(gfpflags_allow_blocking(flags));

	if (should_failslab(s, flags))
		return NULL;

	if (memcg_kmem_enabled() &&
	    ((flags & __GFP_ACCOUNT) || (s->flags & SLAB_ACCOUNT)))
		return memcg_kmem_get_cache(s);

	return s;
}

static inline void slab_post_alloc_hook(struct kmem_cache *s, gfp_t flags,
					size_t size, void **p)
{
	size_t i;

	flags &= gfp_allowed_mask;
	for (i = 0; i < size; i++) {
		void *object = p[i];

		kmemcheck_slab_alloc(s, flags, object, slab_ksize(s));
		kmemleak_alloc_recursive(object, s->object_size, 1,
					 s->flags, flags);
		kasan_slab_alloc(s, object, flags);
	}

	if (memcg_kmem_enabled())
		memcg_kmem_put_cache(s);
}

#ifndef CONFIG_SLOB
/*
 * The slab lists for all objects.
 */
struct kmem_cache_node {
	spinlock_t list_lock;

#ifdef CONFIG_SLAB
	struct list_head slabs_partial;	/* partial list first, better asm code */
	struct list_head slabs_full;
	struct list_head slabs_free;
	unsigned long total_slabs;	/* length of all slab lists */
	unsigned long free_slabs;	/* length of free slab list only */
	unsigned long free_objects;
	unsigned int free_limit;
	unsigned int colour_next;	/* Per-node cache coloring */
	struct array_cache *shared;	/* shared per node */
	struct alien_cache **alien;	/* on other nodes */
	unsigned long next_reap;	/* updated without locking */
	int free_touched;		/* updated without locking */
#endif

#ifdef CONFIG_SLUB
	unsigned long nr_partial;
	struct list_head partial;
#ifdef CONFIG_SLUB_DEBUG
	atomic_long_t nr_slabs;
	atomic_long_t total_objects;
	struct list_head full;
#endif
#endif

};

static inline struct kmem_cache_node *get_node(struct kmem_cache *s, int node)
{
	return s->node[node];
}

/*
 * Iterator over all nodes. The body will be executed for each node that has
 * a kmem_cache_node structure allocated (which is true for all online nodes)
 */
#define for_each_kmem_cache_node(__s, __node, __n) \
	for (__node = 0; __node < nr_node_ids; __node++) \
		 if ((__n = get_node(__s, __node)))

#endif

void *slab_start(struct seq_file *m, loff_t *pos);
void *slab_next(struct seq_file *m, void *p, loff_t *pos);
void slab_stop(struct seq_file *m, void *p);
int memcg_slab_show(struct seq_file *m, void *p);

void ___cache_free(struct kmem_cache *cache, void *x, unsigned long addr);

#ifdef CONFIG_SLAB_FREELIST_RANDOM
int cache_random_seq_create(struct kmem_cache *cachep, unsigned int count,
			gfp_t gfp);
void cache_random_seq_destroy(struct kmem_cache *cachep);
#else
static inline int cache_random_seq_create(struct kmem_cache *cachep,
					unsigned int count, gfp_t gfp)
{
	return 0;
}
static inline void cache_random_seq_destroy(struct kmem_cache *cachep) { }
#endif /* CONFIG_SLAB_FREELIST_RANDOM */

#endif /* MM_SLAB_H */
Commit	Line	Data
97d06609 CL	1	#ifndef MM_SLAB_H
	2	#define MM_SLAB_H
	3	/*
	4	* Internal slab definitions
	5	*/
	6
07f361b2 JK	7	#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	*/
	19	struct 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>
11c7aec2 JDB	41	#include <linux/fault-inject.h>
	42	#include <linux/kmemcheck.h>
	43	#include <linux/kasan.h>
	44	#include <linux/kmemleak.h>
7c00fce9	45	#include <linux/random.h>
07f361b2	46
97d06609 CL	47	/*
	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	*/
	55	enum slab_state {
	56	DOWN, /* No slab functionality yet */
	57	PARTIAL, /* SLUB: kmem_cache_node available */
ce8eb6c4	58	PARTIAL_NODE, /* SLAB: kmalloc size for node struct available */
97d06609 CL	59	UP, /* Slab caches usable but not all extras yet */
	60	FULL /* Everything is working */
	61	};
	62
	63	extern enum slab_state slab_state;
	64
18004c5d CL	65	/* The slab cache mutex protects the management structures during changes */
18004c5d CL	66	extern struct mutex slab_mutex;
9b030cb8 CL	67
9b030cb8 CL	68	/* The list of all slab caches on the system */
18004c5d CL	69	extern struct list_head slab_caches;
18004c5d CL	70
9b030cb8 CL	71	/* The slab cache that manages slab cache information */
	72	extern struct kmem_cache *kmem_cache;
	73
45906855 CL	74	unsigned long calculate_alignment(unsigned long flags,
	75	unsigned long align, unsigned long size);
	76
f97d5f63 CL	77	#ifndef CONFIG_SLOB
f97d5f63 CL	78	/* Kmalloc array related functions */
34cc6990	79	void setup_kmalloc_cache_index_table(void);
f97d5f63	80	void create_kmalloc_caches(unsigned long);
2c59dd65 CL	81
	82	/* Find the kmalloc slab corresponding for a certain size */
	83	struct kmem_cache *kmalloc_slab(size_t, gfp_t);
f97d5f63 CL	84	#endif
	85
	86
9b030cb8	87	/* Functions provided by the slab allocators */
8a13a4cc	88	extern int __kmem_cache_create(struct kmem_cache *, unsigned long flags);
97d06609	89
45530c44 CL	90	extern struct kmem_cache create_kmalloc_cache(const char name, size_t size,
	91	unsigned long flags);
	92	extern void create_boot_cache(struct kmem_cache , const char name,
	93	size_t size, unsigned long flags);
	94
423c929c JK	95	int slab_unmergeable(struct kmem_cache *s);
	96	struct kmem_cache *find_mergeable(size_t size, size_t align,
	97	unsigned long flags, const char name, void (ctor)(void *));
12220dea	98	#ifndef CONFIG_SLOB
2633d7a0	99	struct kmem_cache *
a44cb944 VD	100	__kmem_cache_alias(const char *name, size_t size, size_t align,
a44cb944 VD	101	unsigned long flags, void (ctor)(void ));
423c929c JK	102
	103	unsigned long kmem_cache_flags(unsigned long object_size,
	104	unsigned long flags, const char *name,
	105	void (ctor)(void ));
cbb79694	106	#else
2633d7a0	107	static inline struct kmem_cache *
a44cb944 VD	108	__kmem_cache_alias(const char *name, size_t size, size_t align,
a44cb944 VD	109	unsigned long flags, void (ctor)(void ))
cbb79694	110	{ return NULL; }
423c929c JK	111
	112	static 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	}
cbb79694 CL	118	#endif
	119
	120
d8843922 GC	121	/* 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 \| \
becfda68	129	SLAB_TRACE \| SLAB_CONSISTENCY_CHECKS)
d8843922 GC	130	#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 \| \
230e9fc2 VD	136	SLAB_RECLAIM_ACCOUNT \| SLAB_TEMPORARY \| \
230e9fc2 VD	137	SLAB_NOTRACK \| SLAB_ACCOUNT)
d8843922 GC	138	#elif defined(CONFIG_SLUB)
d8843922 GC	139	#define SLAB_CACHE_FLAGS (SLAB_NOLEAKTRACE \| SLAB_RECLAIM_ACCOUNT \| \
230e9fc2	140	SLAB_TEMPORARY \| SLAB_NOTRACK \| SLAB_ACCOUNT)
d8843922 GC	141	#else
	142	#define SLAB_CACHE_FLAGS (0)
	143	#endif
	144
e70954fd	145	/* Common flags available with current configuration */
d8843922 GC	146	#define CACHE_CREATE_MASK (SLAB_CORE_FLAGS \| SLAB_DEBUG_FLAGS \| SLAB_CACHE_FLAGS)
d8843922 GC	147
e70954fd TG	148	/* Common flags permitted for kmem_cache_create */
	149	#define SLAB_FLAGS_PERMITTED (SLAB_CORE_FLAGS \| \
	150	SLAB_RED_ZONE \| \
	151	SLAB_POISON \| \
	152	SLAB_STORE_USER \| \
	153	SLAB_TRACE \| \
	154	SLAB_CONSISTENCY_CHECKS \| \
	155	SLAB_MEM_SPREAD \| \
	156	SLAB_NOLEAKTRACE \| \
	157	SLAB_RECLAIM_ACCOUNT \| \
	158	SLAB_TEMPORARY \| \
	159	SLAB_NOTRACK \| \
	160	SLAB_ACCOUNT)
	161
945cf2b6	162	int __kmem_cache_shutdown(struct kmem_cache *);
52b4b950	163	void __kmem_cache_release(struct kmem_cache *);
89e364db	164	int __kmem_cache_shrink(struct kmem_cache *);
41a21285	165	void slab_kmem_cache_release(struct kmem_cache *);
945cf2b6	166
b7454ad3 GC	167	struct seq_file;
b7454ad3 GC	168	struct file;
b7454ad3	169
0d7561c6 GC	170	struct slabinfo {
	171	unsigned long active_objs;
	172	unsigned long num_objs;
	173	unsigned long active_slabs;
	174	unsigned long num_slabs;
	175	unsigned long shared_avail;
	176	unsigned int limit;
	177	unsigned int batchcount;
	178	unsigned int shared;
	179	unsigned int objects_per_slab;
	180	unsigned int cache_order;
	181	};
	182
	183	void get_slabinfo(struct kmem_cache s, struct slabinfo sinfo);
	184	void slabinfo_show_stats(struct seq_file m, struct kmem_cache s);
b7454ad3 GC	185	ssize_t slabinfo_write(struct file file, const char __user buffer,
b7454ad3 GC	186	size_t count, loff_t *ppos);
ba6c496e	187
484748f0 CL	188	/*
	189	* Generic implementation of bulk operations
	190	* These are useful for situations in which the allocator cannot
9f706d68	191	* perform optimizations. In that case segments of the object listed
484748f0 CL	192	* may be allocated or freed using these operations.
	193	*/
	194	void __kmem_cache_free_bulk(struct kmem_cache , size_t, void *);
865762a8	195	int __kmem_cache_alloc_bulk(struct kmem_cache , gfp_t, size_t, void *);
484748f0	196
127424c8	197	#if defined(CONFIG_MEMCG) && !defined(CONFIG_SLOB)
426589f5 VD	198	/*
	199	* Iterate over all memcg caches of the given root cache. The caller must hold
	200	* slab_mutex.
	201	*/
	202	#define for_each_memcg_cache(iter, root) \
	203	list_for_each_entry(iter, &(root)->memcg_params.list, \
	204	memcg_params.list)
	205
ba6c496e GC	206	static inline bool is_root_cache(struct kmem_cache *s)
ba6c496e GC	207	{
f7ce3190	208	return s->memcg_params.is_root_cache;
ba6c496e	209	}
2633d7a0	210
b9ce5ef4	211	static inline bool slab_equal_or_root(struct kmem_cache *s,
f7ce3190	212	struct kmem_cache *p)
b9ce5ef4	213	{
f7ce3190	214	return p == s \|\| p == s->memcg_params.root_cache;
b9ce5ef4	215	}
749c5415 GC	216
	217	/*
	218	* We use suffixes to the name in memcg because we can't have caches
	219	* created in the system with the same name. But when we print them
	220	* locally, better refer to them with the base name
	221	*/
	222	static inline const char cache_name(struct kmem_cache s)
	223	{
	224	if (!is_root_cache(s))
f7ce3190	225	s = s->memcg_params.root_cache;
749c5415 GC	226	return s->name;
	227	}
	228
f8570263 VD	229	/*
f8570263 VD	230	* Note, we protect with RCU only the memcg_caches array, not per-memcg caches.
f7ce3190 VD	231	* That said the caller must assure the memcg's cache won't go away by either
f7ce3190 VD	232	* taking a css reference to the owner cgroup, or holding the slab_mutex.
f8570263	233	*/
2ade4de8 QH	234	static inline struct kmem_cache *
2ade4de8 QH	235	cache_from_memcg_idx(struct kmem_cache *s, int idx)
749c5415	236	{
959c8963	237	struct kmem_cache *cachep;
f7ce3190	238	struct memcg_cache_array *arr;
f8570263 VD	239
f8570263 VD	240	rcu_read_lock();
f7ce3190	241	arr = rcu_dereference(s->memcg_params.memcg_caches);
959c8963 VD	242
	243	/*
	244	* Make sure we will access the up-to-date value. The code updating
	245	* memcg_caches issues a write barrier to match this (see
f7ce3190	246	* memcg_create_kmem_cache()).
959c8963	247	*/
f7ce3190	248	cachep = lockless_dereference(arr->entries[idx]);
8df0c2dc PK	249	rcu_read_unlock();
8df0c2dc PK	250
959c8963	251	return cachep;
749c5415	252	}
943a451a GC	253
	254	static inline struct kmem_cache memcg_root_cache(struct kmem_cache s)
	255	{
	256	if (is_root_cache(s))
	257	return s;
f7ce3190	258	return s->memcg_params.root_cache;
943a451a	259	}
5dfb4175	260
f3ccb2c4 VD	261	static __always_inline int memcg_charge_slab(struct page *page,
	262	gfp_t gfp, int order,
	263	struct kmem_cache *s)
5dfb4175	264	{
27ee57c9 VD	265	int ret;
27ee57c9 VD	266
5dfb4175 VD	267	if (!memcg_kmem_enabled())
	268	return 0;
	269	if (is_root_cache(s))
	270	return 0;
27ee57c9	271
45264778	272	ret = memcg_kmem_charge_memcg(page, gfp, order, s->memcg_params.memcg);
27ee57c9 VD	273	if (ret)
	274	return ret;
	275
	276	memcg_kmem_update_page_stat(page,
	277	(s->flags & SLAB_RECLAIM_ACCOUNT) ?
	278	MEMCG_SLAB_RECLAIMABLE : MEMCG_SLAB_UNRECLAIMABLE,
	279	1 << order);
	280	return 0;
	281	}
	282
	283	static __always_inline void memcg_uncharge_slab(struct page *page, int order,
	284	struct kmem_cache *s)
	285	{
45264778 VD	286	if (!memcg_kmem_enabled())
	287	return;
	288
27ee57c9 VD	289	memcg_kmem_update_page_stat(page,
	290	(s->flags & SLAB_RECLAIM_ACCOUNT) ?
	291	MEMCG_SLAB_RECLAIMABLE : MEMCG_SLAB_UNRECLAIMABLE,
	292	-(1 << order));
	293	memcg_kmem_uncharge(page, order);
5dfb4175	294	}
f7ce3190 VD	295
	296	extern void slab_init_memcg_params(struct kmem_cache *);
	297
127424c8	298	#else /* CONFIG_MEMCG && !CONFIG_SLOB */
f7ce3190	299
426589f5 VD	300	#define for_each_memcg_cache(iter, root) \
426589f5 VD	301	for ((void)(iter), (void)(root); 0; )
426589f5	302
ba6c496e GC	303	static inline bool is_root_cache(struct kmem_cache *s)
	304	{
	305	return true;
	306	}
	307
b9ce5ef4 GC	308	static inline bool slab_equal_or_root(struct kmem_cache *s,
	309	struct kmem_cache *p)
	310	{
	311	return true;
	312	}
749c5415 GC	313
	314	static inline const char cache_name(struct kmem_cache s)
	315	{
	316	return s->name;
	317	}
	318
2ade4de8 QH	319	static inline struct kmem_cache *
2ade4de8 QH	320	cache_from_memcg_idx(struct kmem_cache *s, int idx)
749c5415 GC	321	{
	322	return NULL;
	323	}
943a451a GC	324
	325	static inline struct kmem_cache memcg_root_cache(struct kmem_cache s)
	326	{
	327	return s;
	328	}
5dfb4175	329
f3ccb2c4 VD	330	static inline int memcg_charge_slab(struct page *page, gfp_t gfp, int order,
f3ccb2c4 VD	331	struct kmem_cache *s)
5dfb4175 VD	332	{
	333	return 0;
	334	}
	335
27ee57c9 VD	336	static inline void memcg_uncharge_slab(struct page *page, int order,
	337	struct kmem_cache *s)
	338	{
	339	}
	340
f7ce3190 VD	341	static inline void slab_init_memcg_params(struct kmem_cache *s)
	342	{
	343	}
127424c8	344	#endif /* CONFIG_MEMCG && !CONFIG_SLOB */
b9ce5ef4 GC	345
	346	static inline struct kmem_cache cache_from_obj(struct kmem_cache s, void *x)
	347	{
	348	struct kmem_cache *cachep;
	349	struct page *page;
	350
	351	/*
	352	* When kmemcg is not being used, both assignments should return the
	353	* same value. but we don't want to pay the assignment price in that
	354	* case. If it is not compiled in, the compiler should be smart enough
	355	* to not do even the assignment. In that case, slab_equal_or_root
	356	* will also be a constant.
	357	*/
becfda68 LA	358	if (!memcg_kmem_enabled() &&
becfda68 LA	359	!unlikely(s->flags & SLAB_CONSISTENCY_CHECKS))
b9ce5ef4 GC	360	return s;
	361
	362	page = virt_to_head_page(x);
	363	cachep = page->slab_cache;
	364	if (slab_equal_or_root(cachep, s))
	365	return cachep;
	366
	367	pr_err("%s: Wrong slab cache. %s but object is from %s\n",
2d16e0fd	368	__func__, s->name, cachep->name);
b9ce5ef4 GC	369	WARN_ON_ONCE(1);
	370	return s;
	371	}
ca34956b	372
11c7aec2 JDB	373	static inline size_t slab_ksize(const struct kmem_cache *s)
	374	{
	375	#ifndef CONFIG_SLUB
	376	return s->object_size;
	377
	378	#else /* CONFIG_SLUB */
	379	# ifdef CONFIG_SLUB_DEBUG
	380	/*
	381	* Debugging requires use of the padding between object
	382	* and whatever may come after it.
	383	*/
	384	if (s->flags & (SLAB_RED_ZONE \| SLAB_POISON))
	385	return s->object_size;
	386	# endif
80a9201a AP	387	if (s->flags & SLAB_KASAN)
80a9201a AP	388	return s->object_size;
11c7aec2 JDB	389	/*
	390	* If we have the need to store the freelist pointer
	391	* back there or track user information then we can
	392	* only use the space before that information.
	393	*/
	394	if (s->flags & (SLAB_DESTROY_BY_RCU \| SLAB_STORE_USER))
	395	return s->inuse;
	396	/*
	397	* Else we can use all the padding etc for the allocation
	398	*/
	399	return s->size;
	400	#endif
	401	}
	402
	403	static inline struct kmem_cache slab_pre_alloc_hook(struct kmem_cache s,
	404	gfp_t flags)
	405	{
	406	flags &= gfp_allowed_mask;
	407	lockdep_trace_alloc(flags);
	408	might_sleep_if(gfpflags_allow_blocking(flags));
	409
fab9963a	410	if (should_failslab(s, flags))
11c7aec2 JDB	411	return NULL;
11c7aec2 JDB	412
45264778 VD	413	if (memcg_kmem_enabled() &&
	414	((flags & __GFP_ACCOUNT) \|\| (s->flags & SLAB_ACCOUNT)))
	415	return memcg_kmem_get_cache(s);
	416
	417	return s;
11c7aec2 JDB	418	}
	419
	420	static inline void slab_post_alloc_hook(struct kmem_cache *s, gfp_t flags,
	421	size_t size, void **p)
	422	{
	423	size_t i;
	424
	425	flags &= gfp_allowed_mask;
	426	for (i = 0; i < size; i++) {
	427	void *object = p[i];
	428
	429	kmemcheck_slab_alloc(s, flags, object, slab_ksize(s));
	430	kmemleak_alloc_recursive(object, s->object_size, 1,
	431	s->flags, flags);
505f5dcb	432	kasan_slab_alloc(s, object, flags);
11c7aec2	433	}
45264778 VD	434
	435	if (memcg_kmem_enabled())
	436	memcg_kmem_put_cache(s);
11c7aec2 JDB	437	}
11c7aec2 JDB	438
44c5356f	439	#ifndef CONFIG_SLOB
ca34956b CL	440	/*
	441	* The slab lists for all objects.
	442	*/
	443	struct kmem_cache_node {
	444	spinlock_t list_lock;
	445
	446	#ifdef CONFIG_SLAB
	447	struct list_head slabs_partial; /* partial list first, better asm code */
	448	struct list_head slabs_full;
	449	struct list_head slabs_free;
bf00bd34 DR	450	unsigned long total_slabs; /* length of all slab lists */
bf00bd34 DR	451	unsigned long free_slabs; /* length of free slab list only */
ca34956b CL	452	unsigned long free_objects;
	453	unsigned int free_limit;
	454	unsigned int colour_next; /* Per-node cache coloring */
	455	struct array_cache shared; / shared per node */
c8522a3a	456	struct alien_cache *alien; / on other nodes */
ca34956b CL	457	unsigned long next_reap; /* updated without locking */
	458	int free_touched; /* updated without locking */
	459	#endif
	460
	461	#ifdef CONFIG_SLUB
	462	unsigned long nr_partial;
	463	struct list_head partial;
	464	#ifdef CONFIG_SLUB_DEBUG
	465	atomic_long_t nr_slabs;
	466	atomic_long_t total_objects;
	467	struct list_head full;
	468	#endif
	469	#endif
	470
	471	};
e25839f6	472
44c5356f CL	473	static inline struct kmem_cache_node get_node(struct kmem_cache s, int node)
	474	{
	475	return s->node[node];
	476	}
	477
	478	/*
	479	* Iterator over all nodes. The body will be executed for each node that has
	480	* a kmem_cache_node structure allocated (which is true for all online nodes)
	481	*/
	482	#define for_each_kmem_cache_node(__s, __node, __n) \
9163582c MP	483	for (__node = 0; __node < nr_node_ids; __node++) \
9163582c MP	484	if ((__n = get_node(__s, __node)))
44c5356f CL	485
	486	#endif
	487
1df3b26f	488	void slab_start(struct seq_file m, loff_t *pos);
276a2439 WL	489	void slab_next(struct seq_file m, void p, loff_t pos);
276a2439 WL	490	void slab_stop(struct seq_file m, void p);
b047501c	491	int memcg_slab_show(struct seq_file m, void p);
5240ab40	492
55834c59 AP	493	void ___cache_free(struct kmem_cache cache, void x, unsigned long addr);
55834c59 AP	494
7c00fce9 TG	495	#ifdef CONFIG_SLAB_FREELIST_RANDOM
	496	int cache_random_seq_create(struct kmem_cache *cachep, unsigned int count,
	497	gfp_t gfp);
	498	void cache_random_seq_destroy(struct kmem_cache *cachep);
	499	#else
	500	static inline int cache_random_seq_create(struct kmem_cache *cachep,
	501	unsigned int count, gfp_t gfp)
	502	{
	503	return 0;
	504	}
	505	static inline void cache_random_seq_destroy(struct kmem_cache *cachep) { }
	506	#endif /* CONFIG_SLAB_FREELIST_RANDOM */
	507
5240ab40	508	#endif /* MM_SLAB_H */