2007-05-07 04:49:36 +07:00
|
|
|
#ifndef _LINUX_SLUB_DEF_H
|
|
|
|
#define _LINUX_SLUB_DEF_H
|
|
|
|
|
|
|
|
/*
|
|
|
|
* SLUB : A Slab allocator without object queues.
|
|
|
|
*
|
2008-07-04 23:59:22 +07:00
|
|
|
* (C) 2007 SGI, Christoph Lameter
|
2007-05-07 04:49:36 +07:00
|
|
|
*/
|
|
|
|
#include <linux/kobject.h>
|
|
|
|
|
2008-02-08 08:47:41 +07:00
|
|
|
enum stat_item {
|
|
|
|
ALLOC_FASTPATH, /* Allocation from cpu slab */
|
|
|
|
ALLOC_SLOWPATH, /* Allocation by getting a new cpu slab */
|
2013-11-08 19:47:36 +07:00
|
|
|
FREE_FASTPATH, /* Free to cpu slab */
|
2008-02-08 08:47:41 +07:00
|
|
|
FREE_SLOWPATH, /* Freeing not to cpu slab */
|
|
|
|
FREE_FROZEN, /* Freeing to frozen slab */
|
|
|
|
FREE_ADD_PARTIAL, /* Freeing moves slab to partial list */
|
|
|
|
FREE_REMOVE_PARTIAL, /* Freeing removes last object */
|
2012-02-03 22:34:56 +07:00
|
|
|
ALLOC_FROM_PARTIAL, /* Cpu slab acquired from node partial list */
|
2008-02-08 08:47:41 +07:00
|
|
|
ALLOC_SLAB, /* Cpu slab acquired from page allocator */
|
|
|
|
ALLOC_REFILL, /* Refill cpu slab from slab freelist */
|
2011-06-02 00:25:57 +07:00
|
|
|
ALLOC_NODE_MISMATCH, /* Switching cpu slab */
|
2008-02-08 08:47:41 +07:00
|
|
|
FREE_SLAB, /* Slab freed to the page allocator */
|
|
|
|
CPUSLAB_FLUSH, /* Abandoning of the cpu slab */
|
|
|
|
DEACTIVATE_FULL, /* Cpu slab was full when deactivated */
|
|
|
|
DEACTIVATE_EMPTY, /* Cpu slab was empty when deactivated */
|
|
|
|
DEACTIVATE_TO_HEAD, /* Cpu slab was moved to the head of partials */
|
|
|
|
DEACTIVATE_TO_TAIL, /* Cpu slab was moved to the tail of partials */
|
|
|
|
DEACTIVATE_REMOTE_FREES,/* Slab contained remotely freed objects */
|
2011-06-02 00:25:58 +07:00
|
|
|
DEACTIVATE_BYPASS, /* Implicit deactivation */
|
2008-04-14 23:11:40 +07:00
|
|
|
ORDER_FALLBACK, /* Number of times fallback was necessary */
|
2011-03-23 01:35:00 +07:00
|
|
|
CMPXCHG_DOUBLE_CPU_FAIL,/* Failure of this_cpu_cmpxchg_double */
|
2011-06-02 00:25:49 +07:00
|
|
|
CMPXCHG_DOUBLE_FAIL, /* Number of times that cmpxchg double did not match */
|
2011-08-10 04:12:27 +07:00
|
|
|
CPU_PARTIAL_ALLOC, /* Used cpu partial on alloc */
|
2012-02-03 22:34:56 +07:00
|
|
|
CPU_PARTIAL_FREE, /* Refill cpu partial on free */
|
|
|
|
CPU_PARTIAL_NODE, /* Refill cpu partial from node partial */
|
|
|
|
CPU_PARTIAL_DRAIN, /* Drain cpu partial to node partial */
|
2008-02-08 08:47:41 +07:00
|
|
|
NR_SLUB_STAT_ITEMS };
|
|
|
|
|
2007-10-16 15:26:05 +07:00
|
|
|
struct kmem_cache_cpu {
|
2011-02-26 00:38:54 +07:00
|
|
|
void **freelist; /* Pointer to next available object */
|
|
|
|
unsigned long tid; /* Globally unique transaction id */
|
2008-01-08 14:20:31 +07:00
|
|
|
struct page *page; /* The slab from which we are allocating */
|
2011-08-10 04:12:27 +07:00
|
|
|
struct page *partial; /* Partially allocated frozen slabs */
|
2008-02-08 08:47:41 +07:00
|
|
|
#ifdef CONFIG_SLUB_STATS
|
|
|
|
unsigned stat[NR_SLUB_STAT_ITEMS];
|
|
|
|
#endif
|
2007-10-16 15:26:08 +07:00
|
|
|
};
|
2007-10-16 15:26:05 +07:00
|
|
|
|
2008-04-14 23:11:31 +07:00
|
|
|
/*
|
|
|
|
* Word size structure that can be atomically updated or read and that
|
|
|
|
* contains both the order and the number of objects that a slab of the
|
|
|
|
* given order would contain.
|
|
|
|
*/
|
|
|
|
struct kmem_cache_order_objects {
|
|
|
|
unsigned long x;
|
|
|
|
};
|
|
|
|
|
2007-05-07 04:49:36 +07:00
|
|
|
/*
|
|
|
|
* Slab cache management.
|
|
|
|
*/
|
|
|
|
struct kmem_cache {
|
2010-08-07 19:29:22 +07:00
|
|
|
struct kmem_cache_cpu __percpu *cpu_slab;
|
2007-05-07 04:49:36 +07:00
|
|
|
/* Used for retriving partial slabs etc */
|
|
|
|
unsigned long flags;
|
2011-02-26 00:38:51 +07:00
|
|
|
unsigned long min_partial;
|
2007-05-07 04:49:36 +07:00
|
|
|
int size; /* The size of an object including meta data */
|
2012-06-13 22:24:57 +07:00
|
|
|
int object_size; /* The size of an object without meta data */
|
2007-05-07 04:49:36 +07:00
|
|
|
int offset; /* Free pointer offset. */
|
2011-09-01 10:32:18 +07:00
|
|
|
int cpu_partial; /* Number of per cpu partial objects to keep around */
|
2008-04-14 23:11:31 +07:00
|
|
|
struct kmem_cache_order_objects oo;
|
2007-05-07 04:49:36 +07:00
|
|
|
|
|
|
|
/* Allocation and freeing of slabs */
|
2008-04-14 23:11:40 +07:00
|
|
|
struct kmem_cache_order_objects max;
|
2008-04-14 23:11:40 +07:00
|
|
|
struct kmem_cache_order_objects min;
|
2008-02-15 05:21:32 +07:00
|
|
|
gfp_t allocflags; /* gfp flags to use on each alloc */
|
2007-05-07 04:49:36 +07:00
|
|
|
int refcount; /* Refcount for slab cache destroy */
|
2008-07-26 09:45:34 +07:00
|
|
|
void (*ctor)(void *);
|
2007-05-07 04:49:36 +07:00
|
|
|
int inuse; /* Offset to metadata */
|
|
|
|
int align; /* Alignment */
|
2011-03-10 14:21:48 +07:00
|
|
|
int reserved; /* Reserved bytes at the end of slabs */
|
2007-05-07 04:49:36 +07:00
|
|
|
const char *name; /* Name (only for display!) */
|
|
|
|
struct list_head list; /* List of slab caches */
|
2016-03-16 04:55:12 +07:00
|
|
|
int red_left_pad; /* Left redzone padding size */
|
2010-10-06 01:57:26 +07:00
|
|
|
#ifdef CONFIG_SYSFS
|
2007-05-07 04:49:36 +07:00
|
|
|
struct kobject kobj; /* For sysfs */
|
2007-07-17 18:03:24 +07:00
|
|
|
#endif
|
2016-01-21 06:02:32 +07:00
|
|
|
#ifdef CONFIG_MEMCG
|
2015-02-13 05:59:20 +07:00
|
|
|
struct memcg_cache_params memcg_params;
|
slub: slub-specific propagation changes
SLUB allows us to tune a particular cache behavior with sysfs-based
tunables. When creating a new memcg cache copy, we'd like to preserve any
tunables the parent cache already had.
This can be done by tapping into the store attribute function provided by
the allocator. We of course don't need to mess with read-only fields.
Since the attributes can have multiple types and are stored internally by
sysfs, the best strategy is to issue a ->show() in the root cache, and
then ->store() in the memcg cache.
The drawback of that, is that sysfs can allocate up to a page in buffering
for show(), that we are likely not to need, but also can't guarantee. To
avoid always allocating a page for that, we can update the caches at store
time with the maximum attribute size ever stored to the root cache. We
will then get a buffer big enough to hold it. The corolary to this, is
that if no stores happened, nothing will be propagated.
It can also happen that a root cache has its tunables updated during
normal system operation. In this case, we will propagate the change to
all caches that are already active.
[akpm@linux-foundation.org: tweak code to avoid __maybe_unused]
Signed-off-by: Glauber Costa <glommer@parallels.com>
Cc: Christoph Lameter <cl@linux.com>
Cc: David Rientjes <rientjes@google.com>
Cc: Frederic Weisbecker <fweisbec@redhat.com>
Cc: Greg Thelen <gthelen@google.com>
Cc: Johannes Weiner <hannes@cmpxchg.org>
Cc: JoonSoo Kim <js1304@gmail.com>
Cc: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Cc: Mel Gorman <mel@csn.ul.ie>
Cc: Michal Hocko <mhocko@suse.cz>
Cc: Pekka Enberg <penberg@cs.helsinki.fi>
Cc: Rik van Riel <riel@redhat.com>
Cc: Suleiman Souhlal <suleiman@google.com>
Cc: Tejun Heo <tj@kernel.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2012-12-19 05:23:05 +07:00
|
|
|
int max_attr_size; /* for propagation, maximum size of a stored attr */
|
2014-04-08 05:39:31 +07:00
|
|
|
#ifdef CONFIG_SYSFS
|
|
|
|
struct kset *memcg_kset;
|
|
|
|
#endif
|
2012-12-19 05:22:27 +07:00
|
|
|
#endif
|
2007-05-07 04:49:36 +07:00
|
|
|
|
|
|
|
#ifdef CONFIG_NUMA
|
2008-01-08 14:20:26 +07:00
|
|
|
/*
|
|
|
|
* Defragmentation by allocating from a remote node.
|
|
|
|
*/
|
|
|
|
int remote_node_defrag_ratio;
|
2007-05-07 04:49:36 +07:00
|
|
|
#endif
|
2010-09-28 20:10:26 +07:00
|
|
|
struct kmem_cache_node *node[MAX_NUMNODES];
|
2007-05-07 04:49:36 +07:00
|
|
|
};
|
|
|
|
|
2014-05-07 02:50:08 +07:00
|
|
|
#ifdef CONFIG_SYSFS
|
|
|
|
#define SLAB_SUPPORTS_SYSFS
|
|
|
|
void sysfs_slab_remove(struct kmem_cache *);
|
|
|
|
#else
|
|
|
|
static inline void sysfs_slab_remove(struct kmem_cache *s)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2015-02-14 05:39:35 +07:00
|
|
|
void object_err(struct kmem_cache *s, struct page *page,
|
|
|
|
u8 *object, char *reason);
|
|
|
|
|
2016-03-26 04:21:59 +07:00
|
|
|
static inline void *nearest_obj(struct kmem_cache *cache, struct page *page,
|
|
|
|
void *x) {
|
|
|
|
void *object = x - (x - page_address(page)) % cache->size;
|
|
|
|
void *last_object = page_address(page) +
|
|
|
|
(page->objects - 1) * cache->size;
|
|
|
|
if (unlikely(object > last_object))
|
|
|
|
return last_object;
|
|
|
|
else
|
|
|
|
return object;
|
|
|
|
}
|
|
|
|
|
2007-05-07 04:49:36 +07:00
|
|
|
#endif /* _LINUX_SLUB_DEF_H */
|