[deliverable/linux.git] / include / linux / slub_def.h

#ifndef _LINUX_SLUB_DEF_H
#define _LINUX_SLUB_DEF_H

/*
 * SLUB : A Slab allocator without object queues.
 *
 * (C) 2007 SGI, Christoph Lameter
 */
#include <linux/types.h>
#include <linux/gfp.h>
#include <linux/workqueue.h>
#include <linux/kobject.h>
#include <linux/kmemtrace.h>
#include <linux/kmemleak.h>

enum stat_item {
	ALLOC_FASTPATH,		/* Allocation from cpu slab */
	ALLOC_SLOWPATH,		/* Allocation by getting a new cpu slab */
	FREE_FASTPATH,		/* Free to cpu slub */
	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 */
	ALLOC_FROM_PARTIAL,	/* Cpu slab acquired from partial list */
	ALLOC_SLAB,		/* Cpu slab acquired from page allocator */
	ALLOC_REFILL,		/* Refill cpu slab from slab freelist */
	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 */
	ORDER_FALLBACK,		/* Number of times fallback was necessary */
	NR_SLUB_STAT_ITEMS };

struct kmem_cache_cpu {
	void **freelist;	/* Pointer to first free per cpu object */
	struct page *page;	/* The slab from which we are allocating */
	int node;		/* The node of the page (or -1 for debug) */
	unsigned int offset;	/* Freepointer offset (in word units) */
	unsigned int objsize;	/* Size of an object (from kmem_cache) */
#ifdef CONFIG_SLUB_STATS
	unsigned stat[NR_SLUB_STAT_ITEMS];
#endif
};

struct kmem_cache_node {
	spinlock_t list_lock;	/* Protect partial list and nr_partial */
	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
};

/*
 * 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;
};

/*
 * Slab cache management.
 */
struct kmem_cache {
	/* Used for retriving partial slabs etc */
	unsigned long flags;
	int size;		/* The size of an object including meta data */
	int objsize;		/* The size of an object without meta data */
	int offset;		/* Free pointer offset. */
	struct kmem_cache_order_objects oo;

	/*
	 * Avoid an extra cache line for UP, SMP and for the node local to
	 * struct kmem_cache.
	 */
	struct kmem_cache_node local_node;

	/* Allocation and freeing of slabs */
	struct kmem_cache_order_objects max;
	struct kmem_cache_order_objects min;
	gfp_t allocflags;	/* gfp flags to use on each alloc */
	int refcount;		/* Refcount for slab cache destroy */
	void (*ctor)(void *);
	int inuse;		/* Offset to metadata */
	int align;		/* Alignment */
	unsigned long min_partial;
	const char *name;	/* Name (only for display!) */
	struct list_head list;	/* List of slab caches */
#ifdef CONFIG_SLUB_DEBUG
	struct kobject kobj;	/* For sysfs */
#endif

#ifdef CONFIG_NUMA
	/*
	 * Defragmentation by allocating from a remote node.
	 */
	int remote_node_defrag_ratio;
	struct kmem_cache_node *node[MAX_NUMNODES];
#endif
#ifdef CONFIG_SMP
	struct kmem_cache_cpu *cpu_slab[NR_CPUS];
#else
	struct kmem_cache_cpu cpu_slab;
#endif
};

/*
 * Kmalloc subsystem.
 */
#if defined(ARCH_KMALLOC_MINALIGN) && ARCH_KMALLOC_MINALIGN > 8
#define KMALLOC_MIN_SIZE ARCH_KMALLOC_MINALIGN
#else
#define KMALLOC_MIN_SIZE 8
#endif

#define KMALLOC_SHIFT_LOW ilog2(KMALLOC_MIN_SIZE)

/*
 * Maximum kmalloc object size handled by SLUB. Larger object allocations
 * are passed through to the page allocator. The page allocator "fastpath"
 * is relatively slow so we need this value sufficiently high so that
 * performance critical objects are allocated through the SLUB fastpath.
 *
 * This should be dropped to PAGE_SIZE / 2 once the page allocator
 * "fastpath" becomes competitive with the slab allocator fastpaths.
 */
#define SLUB_MAX_SIZE (2 * PAGE_SIZE)

#define SLUB_PAGE_SHIFT (PAGE_SHIFT + 2)

/*
 * We keep the general caches in an array of slab caches that are used for
 * 2^x bytes of allocations.
 */
extern struct kmem_cache kmalloc_caches[SLUB_PAGE_SHIFT];

/*
 * Sorry that the following has to be that ugly but some versions of GCC
 * have trouble with constant propagation and loops.
 */
static __always_inline int kmalloc_index(size_t size)
{
	if (!size)
		return 0;

	if (size <= KMALLOC_MIN_SIZE)
		return KMALLOC_SHIFT_LOW;

#if KMALLOC_MIN_SIZE <= 64
	if (size > 64 && size <= 96)
		return 1;
	if (size > 128 && size <= 192)
		return 2;
#endif
	if (size <=          8) return 3;
	if (size <=         16) return 4;
	if (size <=         32) return 5;
	if (size <=         64) return 6;
	if (size <=        128) return 7;
	if (size <=        256) return 8;
	if (size <=        512) return 9;
	if (size <=       1024) return 10;
	if (size <=   2 * 1024) return 11;
	if (size <=   4 * 1024) return 12;
/*
 * The following is only needed to support architectures with a larger page
 * size than 4k.
 */
	if (size <=   8 * 1024) return 13;
	if (size <=  16 * 1024) return 14;
	if (size <=  32 * 1024) return 15;
	if (size <=  64 * 1024) return 16;
	if (size <= 128 * 1024) return 17;
	if (size <= 256 * 1024) return 18;
	if (size <= 512 * 1024) return 19;
	if (size <= 1024 * 1024) return 20;
	if (size <=  2 * 1024 * 1024) return 21;
	return -1;

/*
 * What we really wanted to do and cannot do because of compiler issues is:
 *	int i;
 *	for (i = KMALLOC_SHIFT_LOW; i <= KMALLOC_SHIFT_HIGH; i++)
 *		if (size <= (1 << i))
 *			return i;
 */
}

/*
 * Find the slab cache for a given combination of allocation flags and size.
 *
 * This ought to end up with a global pointer to the right cache
 * in kmalloc_caches.
 */
static __always_inline struct kmem_cache *kmalloc_slab(size_t size)
{
	int index = kmalloc_index(size);

	if (index == 0)
		return NULL;

	return &kmalloc_caches[index];
}

#ifdef CONFIG_ZONE_DMA
#define SLUB_DMA __GFP_DMA
#else
/* Disable DMA functionality */
#define SLUB_DMA (__force gfp_t)0
#endif

void *kmem_cache_alloc(struct kmem_cache *, gfp_t);
void *__kmalloc(size_t size, gfp_t flags);

#ifdef CONFIG_KMEMTRACE
extern void *kmem_cache_alloc_notrace(struct kmem_cache *s, gfp_t gfpflags);
#else
static __always_inline void *
kmem_cache_alloc_notrace(struct kmem_cache *s, gfp_t gfpflags)
{
	return kmem_cache_alloc(s, gfpflags);
}
#endif

static __always_inline void *kmalloc_large(size_t size, gfp_t flags)
{
	unsigned int order = get_order(size);
	void *ret = (void *) __get_free_pages(flags | __GFP_COMP, order);

	kmemleak_alloc(ret, size, 1, flags);
	trace_kmalloc(_THIS_IP_, ret, size, PAGE_SIZE << order, flags);

	return ret;
}

static __always_inline void *kmalloc(size_t size, gfp_t flags)
{
	void *ret;

	if (__builtin_constant_p(size)) {
		if (size > SLUB_MAX_SIZE)
			return kmalloc_large(size, flags);

		if (!(flags & SLUB_DMA)) {
			struct kmem_cache *s = kmalloc_slab(size);

			if (!s)
				return ZERO_SIZE_PTR;

			ret = kmem_cache_alloc_notrace(s, flags);

			trace_kmalloc(_THIS_IP_, ret, size, s->size, flags);

			return ret;
		}
	}
	return __kmalloc(size, flags);
}

#ifdef CONFIG_NUMA
void *__kmalloc_node(size_t size, gfp_t flags, int node);
void *kmem_cache_alloc_node(struct kmem_cache *, gfp_t flags, int node);

#ifdef CONFIG_KMEMTRACE
extern void *kmem_cache_alloc_node_notrace(struct kmem_cache *s,
					   gfp_t gfpflags,
					   int node);
#else
static __always_inline void *
kmem_cache_alloc_node_notrace(struct kmem_cache *s,
			      gfp_t gfpflags,
			      int node)
{
	return kmem_cache_alloc_node(s, gfpflags, node);
}
#endif

static __always_inline void *kmalloc_node(size_t size, gfp_t flags, int node)
{
	void *ret;

	if (__builtin_constant_p(size) &&
		size <= SLUB_MAX_SIZE && !(flags & SLUB_DMA)) {
			struct kmem_cache *s = kmalloc_slab(size);

		if (!s)
			return ZERO_SIZE_PTR;

		ret = kmem_cache_alloc_node_notrace(s, flags, node);

		trace_kmalloc_node(_THIS_IP_, ret,
				   size, s->size, flags, node);

		return ret;
	}
	return __kmalloc_node(size, flags, node);
}
#endif

void __init kmem_cache_init_late(void);

#endif /* _LINUX_SLUB_DEF_H */
Commit	Line	Data
81819f0f CL	1	#ifndef _LINUX_SLUB_DEF_H
	2	#define _LINUX_SLUB_DEF_H
	3
	4	/*
	5	* SLUB : A Slab allocator without object queues.
	6	*
cde53535	7	* (C) 2007 SGI, Christoph Lameter
81819f0f CL	8	*/
	9	#include <linux/types.h>
	10	#include <linux/gfp.h>
	11	#include <linux/workqueue.h>
	12	#include <linux/kobject.h>
02af61bb	13	#include <linux/kmemtrace.h>
e4f7c0b4	14	#include <linux/kmemleak.h>
81819f0f	15
8ff12cfc CL	16	enum stat_item {
	17	ALLOC_FASTPATH, /* Allocation from cpu slab */
	18	ALLOC_SLOWPATH, /* Allocation by getting a new cpu slab */
	19	FREE_FASTPATH, /* Free to cpu slub */
	20	FREE_SLOWPATH, /* Freeing not to cpu slab */
	21	FREE_FROZEN, /* Freeing to frozen slab */
	22	FREE_ADD_PARTIAL, /* Freeing moves slab to partial list */
	23	FREE_REMOVE_PARTIAL, /* Freeing removes last object */
	24	ALLOC_FROM_PARTIAL, /* Cpu slab acquired from partial list */
	25	ALLOC_SLAB, /* Cpu slab acquired from page allocator */
	26	ALLOC_REFILL, /* Refill cpu slab from slab freelist */
	27	FREE_SLAB, /* Slab freed to the page allocator */
	28	CPUSLAB_FLUSH, /* Abandoning of the cpu slab */
	29	DEACTIVATE_FULL, /* Cpu slab was full when deactivated */
	30	DEACTIVATE_EMPTY, /* Cpu slab was empty when deactivated */
	31	DEACTIVATE_TO_HEAD, /* Cpu slab was moved to the head of partials */
	32	DEACTIVATE_TO_TAIL, /* Cpu slab was moved to the tail of partials */
	33	DEACTIVATE_REMOTE_FREES,/* Slab contained remotely freed objects */
65c3376a	34	ORDER_FALLBACK, /* Number of times fallback was necessary */
8ff12cfc CL	35	NR_SLUB_STAT_ITEMS };
8ff12cfc CL	36
dfb4f096	37	struct kmem_cache_cpu {
da89b79e CL	38	void *freelist; / Pointer to first free per cpu object */
	39	struct page page; / The slab from which we are allocating */
	40	int node; /* The node of the page (or -1 for debug) */
	41	unsigned int offset; /* Freepointer offset (in word units) */
	42	unsigned int objsize; /* Size of an object (from kmem_cache) */
8ff12cfc CL	43	#ifdef CONFIG_SLUB_STATS
	44	unsigned stat[NR_SLUB_STAT_ITEMS];
	45	#endif
4c93c355	46	};
dfb4f096	47
81819f0f CL	48	struct kmem_cache_node {
	49	spinlock_t list_lock; /* Protect partial list and nr_partial */
	50	unsigned long nr_partial;
81819f0f	51	struct list_head partial;
0c710013	52	#ifdef CONFIG_SLUB_DEBUG
0f389ec6	53	atomic_long_t nr_slabs;
205ab99d	54	atomic_long_t total_objects;
643b1138	55	struct list_head full;
0c710013	56	#endif
81819f0f CL	57	};
81819f0f CL	58
834f3d11 CL	59	/*
	60	* Word size structure that can be atomically updated or read and that
	61	* contains both the order and the number of objects that a slab of the
	62	* given order would contain.
	63	*/
	64	struct kmem_cache_order_objects {
	65	unsigned long x;
	66	};
	67
81819f0f CL	68	/*
	69	* Slab cache management.
	70	*/
	71	struct kmem_cache {
	72	/* Used for retriving partial slabs etc */
	73	unsigned long flags;
	74	int size; /* The size of an object including meta data */
	75	int objsize; /* The size of an object without meta data */
	76	int offset; /* Free pointer offset. */
834f3d11	77	struct kmem_cache_order_objects oo;
81819f0f CL	78
	79	/*
	80	* Avoid an extra cache line for UP, SMP and for the node local to
	81	* struct kmem_cache.
	82	*/
	83	struct kmem_cache_node local_node;
	84
	85	/* Allocation and freeing of slabs */
205ab99d	86	struct kmem_cache_order_objects max;
65c3376a	87	struct kmem_cache_order_objects min;
b7a49f0d	88	gfp_t allocflags; /* gfp flags to use on each alloc */
81819f0f	89	int refcount; /* Refcount for slab cache destroy */
51cc5068	90	void (ctor)(void );
81819f0f CL	91	int inuse; /* Offset to metadata */
81819f0f CL	92	int align; /* Alignment */
3b89d7d8	93	unsigned long min_partial;
81819f0f CL	94	const char name; / Name (only for display!) */
81819f0f CL	95	struct list_head list; /* List of slab caches */
0c710013	96	#ifdef CONFIG_SLUB_DEBUG
81819f0f	97	struct kobject kobj; /* For sysfs */
0c710013	98	#endif
81819f0f CL	99
81819f0f CL	100	#ifdef CONFIG_NUMA
9824601e CL	101	/*
	102	* Defragmentation by allocating from a remote node.
	103	*/
	104	int remote_node_defrag_ratio;
81819f0f CL	105	struct kmem_cache_node *node[MAX_NUMNODES];
81819f0f CL	106	#endif
4c93c355 CL	107	#ifdef CONFIG_SMP
	108	struct kmem_cache_cpu *cpu_slab[NR_CPUS];
	109	#else
	110	struct kmem_cache_cpu cpu_slab;
	111	#endif
81819f0f CL	112	};
	113
	114	/*
	115	* Kmalloc subsystem.
	116	*/
4b356be0 CL	117	#if defined(ARCH_KMALLOC_MINALIGN) && ARCH_KMALLOC_MINALIGN > 8
	118	#define KMALLOC_MIN_SIZE ARCH_KMALLOC_MINALIGN
	119	#else
	120	#define KMALLOC_MIN_SIZE 8
	121	#endif
	122
	123	#define KMALLOC_SHIFT_LOW ilog2(KMALLOC_MIN_SIZE)
81819f0f	124
ffadd4d0 CL	125	/*
	126	* Maximum kmalloc object size handled by SLUB. Larger object allocations
	127	* are passed through to the page allocator. The page allocator "fastpath"
	128	* is relatively slow so we need this value sufficiently high so that
	129	* performance critical objects are allocated through the SLUB fastpath.
	130	*
	131	* This should be dropped to PAGE_SIZE / 2 once the page allocator
	132	* "fastpath" becomes competitive with the slab allocator fastpaths.
	133	*/
51735a7c	134	#define SLUB_MAX_SIZE (2 * PAGE_SIZE)
ffadd4d0	135
51735a7c	136	#define SLUB_PAGE_SHIFT (PAGE_SHIFT + 2)
ffadd4d0	137
81819f0f CL	138	/*
	139	* We keep the general caches in an array of slab caches that are used for
	140	* 2^x bytes of allocations.
	141	*/
ffadd4d0	142	extern struct kmem_cache kmalloc_caches[SLUB_PAGE_SHIFT];
81819f0f CL	143
	144	/*
	145	* Sorry that the following has to be that ugly but some versions of GCC
	146	* have trouble with constant propagation and loops.
	147	*/
aa137f9d	148	static __always_inline int kmalloc_index(size_t size)
81819f0f	149	{
272c1d21 CL	150	if (!size)
272c1d21 CL	151	return 0;
614410d5	152
4b356be0 CL	153	if (size <= KMALLOC_MIN_SIZE)
	154	return KMALLOC_SHIFT_LOW;
	155
41d54d3b	156	#if KMALLOC_MIN_SIZE <= 64
81819f0f CL	157	if (size > 64 && size <= 96)
	158	return 1;
	159	if (size > 128 && size <= 192)
	160	return 2;
41d54d3b	161	#endif
81819f0f CL	162	if (size <= 8) return 3;
	163	if (size <= 16) return 4;
	164	if (size <= 32) return 5;
	165	if (size <= 64) return 6;
	166	if (size <= 128) return 7;
	167	if (size <= 256) return 8;
	168	if (size <= 512) return 9;
	169	if (size <= 1024) return 10;
	170	if (size <= 2 * 1024) return 11;
6446faa2	171	if (size <= 4 * 1024) return 12;
aadb4bc4 CL	172	/*
	173	* The following is only needed to support architectures with a larger page
	174	* size than 4k.
	175	*/
81819f0f CL	176	if (size <= 8 * 1024) return 13;
	177	if (size <= 16 * 1024) return 14;
	178	if (size <= 32 * 1024) return 15;
	179	if (size <= 64 * 1024) return 16;
	180	if (size <= 128 * 1024) return 17;
	181	if (size <= 256 * 1024) return 18;
aadb4bc4	182	if (size <= 512 * 1024) return 19;
81819f0f	183	if (size <= 1024 * 1024) return 20;
81819f0f	184	if (size <= 2 * 1024 * 1024) return 21;
81819f0f CL	185	return -1;
	186
	187	/*
	188	* What we really wanted to do and cannot do because of compiler issues is:
	189	* int i;
	190	* for (i = KMALLOC_SHIFT_LOW; i <= KMALLOC_SHIFT_HIGH; i++)
	191	* if (size <= (1 << i))
	192	* return i;
	193	*/
	194	}
	195
	196	/*
	197	* Find the slab cache for a given combination of allocation flags and size.
	198	*
	199	* This ought to end up with a global pointer to the right cache
	200	* in kmalloc_caches.
	201	*/
aa137f9d	202	static __always_inline struct kmem_cache *kmalloc_slab(size_t size)
81819f0f CL	203	{
	204	int index = kmalloc_index(size);
	205
	206	if (index == 0)
	207	return NULL;
	208
81819f0f CL	209	return &kmalloc_caches[index];
	210	}
	211
	212	#ifdef CONFIG_ZONE_DMA
	213	#define SLUB_DMA __GFP_DMA
	214	#else
	215	/* Disable DMA functionality */
d046943c	216	#define SLUB_DMA (__force gfp_t)0
81819f0f CL	217	#endif
81819f0f CL	218
6193a2ff PM	219	void kmem_cache_alloc(struct kmem_cache , gfp_t);
	220	void *__kmalloc(size_t size, gfp_t flags);
	221
5b882be4 EGM	222	#ifdef CONFIG_KMEMTRACE
	223	extern void kmem_cache_alloc_notrace(struct kmem_cache s, gfp_t gfpflags);
	224	#else
	225	static __always_inline void *
	226	kmem_cache_alloc_notrace(struct kmem_cache *s, gfp_t gfpflags)
	227	{
	228	return kmem_cache_alloc(s, gfpflags);
	229	}
	230	#endif
	231
eada35ef PE	232	static __always_inline void *kmalloc_large(size_t size, gfp_t flags)
eada35ef PE	233	{
5b882be4 EGM	234	unsigned int order = get_order(size);
	235	void ret = (void ) __get_free_pages(flags \| __GFP_COMP, order);
	236
e4f7c0b4	237	kmemleak_alloc(ret, size, 1, flags);
ca2b84cb	238	trace_kmalloc(_THIS_IP_, ret, size, PAGE_SIZE << order, flags);
5b882be4 EGM	239
5b882be4 EGM	240	return ret;
eada35ef PE	241	}
eada35ef PE	242
aa137f9d	243	static __always_inline void *kmalloc(size_t size, gfp_t flags)
81819f0f	244	{
5b882be4 EGM	245	void *ret;
5b882be4 EGM	246
aadb4bc4	247	if (__builtin_constant_p(size)) {
ffadd4d0	248	if (size > SLUB_MAX_SIZE)
eada35ef	249	return kmalloc_large(size, flags);
81819f0f	250
aadb4bc4 CL	251	if (!(flags & SLUB_DMA)) {
	252	struct kmem_cache *s = kmalloc_slab(size);
	253
	254	if (!s)
	255	return ZERO_SIZE_PTR;
81819f0f	256
5b882be4 EGM	257	ret = kmem_cache_alloc_notrace(s, flags);
5b882be4 EGM	258
ca2b84cb	259	trace_kmalloc(_THIS_IP_, ret, size, s->size, flags);
5b882be4 EGM	260
5b882be4 EGM	261	return ret;
aadb4bc4 CL	262	}
	263	}
	264	return __kmalloc(size, flags);
81819f0f CL	265	}
81819f0f CL	266
81819f0f	267	#ifdef CONFIG_NUMA
6193a2ff PM	268	void *__kmalloc_node(size_t size, gfp_t flags, int node);
6193a2ff PM	269	void kmem_cache_alloc_node(struct kmem_cache , gfp_t flags, int node);
81819f0f	270
5b882be4 EGM	271	#ifdef CONFIG_KMEMTRACE
	272	extern void kmem_cache_alloc_node_notrace(struct kmem_cache s,
	273	gfp_t gfpflags,
	274	int node);
	275	#else
	276	static __always_inline void *
	277	kmem_cache_alloc_node_notrace(struct kmem_cache *s,
	278	gfp_t gfpflags,
	279	int node)
	280	{
	281	return kmem_cache_alloc_node(s, gfpflags, node);
	282	}
	283	#endif
	284
aa137f9d	285	static __always_inline void *kmalloc_node(size_t size, gfp_t flags, int node)
81819f0f	286	{
5b882be4 EGM	287	void *ret;
5b882be4 EGM	288
aadb4bc4	289	if (__builtin_constant_p(size) &&
ffadd4d0	290	size <= SLUB_MAX_SIZE && !(flags & SLUB_DMA)) {
aadb4bc4	291	struct kmem_cache *s = kmalloc_slab(size);
81819f0f CL	292
81819f0f CL	293	if (!s)
272c1d21	294	return ZERO_SIZE_PTR;
81819f0f	295
5b882be4 EGM	296	ret = kmem_cache_alloc_node_notrace(s, flags, node);
5b882be4 EGM	297
ca2b84cb EGM	298	trace_kmalloc_node(_THIS_IP_, ret,
ca2b84cb EGM	299	size, s->size, flags, node);
5b882be4 EGM	300
5b882be4 EGM	301	return ret;
aadb4bc4 CL	302	}
aadb4bc4 CL	303	return __kmalloc_node(size, flags, node);
81819f0f CL	304	}
	305	#endif
	306
7e85ee0c PE	307	void __init kmem_cache_init_late(void);
7e85ee0c PE	308
81819f0f	309	#endif /* _LINUX_SLUB_DEF_H */