[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/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 */
	CMPXCHG_DOUBLE_CPU_FAIL,/* Failure of this_cpu_cmpxchg_double */
	NR_SLUB_STAT_ITEMS };

struct kmem_cache_cpu {
	void **freelist;	/* Pointer to next available object */
#ifdef CONFIG_CMPXCHG_LOCAL
	unsigned long tid;	/* Globally unique transaction id */
#endif
	struct page *page;	/* The slab from which we are allocating */
	int node;		/* The node of the page (or -1 for debug) */
#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 {
	struct kmem_cache_cpu __percpu *cpu_slab;
	/* Used for retriving partial slabs etc */
	unsigned long flags;
	unsigned long min_partial;
	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;

	/* 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 */
	int reserved;		/* Reserved bytes at the end of slabs */
	const char *name;	/* Name (only for display!) */
	struct list_head list;	/* List of slab caches */
#ifdef CONFIG_SYSFS
	struct kobject kobj;	/* For sysfs */
#endif

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

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

#define KMALLOC_SHIFT_LOW ilog2(KMALLOC_MIN_SIZE)

#ifdef ARCH_DMA_MINALIGN
#define ARCH_KMALLOC_MINALIGN ARCH_DMA_MINALIGN
#else
#define ARCH_KMALLOC_MINALIGN __alignof__(unsigned long long)
#endif

#ifndef ARCH_SLAB_MINALIGN
#define ARCH_SLAB_MINALIGN __alignof__(unsigned long long)
#endif

/*
 * 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)

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

/*
 * 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 <= 32 && size > 64 && size <= 96)
		return 1;
	if (KMALLOC_MIN_SIZE <= 64 && size > 128 && size <= 192)
		return 2;
	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];
}

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

static __always_inline void *
kmalloc_order(size_t size, gfp_t flags, unsigned int order)
{
	void *ret = (void *) __get_free_pages(flags | __GFP_COMP, order);
	kmemleak_alloc(ret, size, 1, flags);
	return ret;
}

#ifdef CONFIG_TRACING
extern void *
kmem_cache_alloc_trace(struct kmem_cache *s, gfp_t gfpflags, size_t size);
extern void *kmalloc_order_trace(size_t size, gfp_t flags, unsigned int order);
#else
static __always_inline void *
kmem_cache_alloc_trace(struct kmem_cache *s, gfp_t gfpflags, size_t size)
{
	return kmem_cache_alloc(s, gfpflags);
}

static __always_inline void *
kmalloc_order_trace(size_t size, gfp_t flags, unsigned int order)
{
	return kmalloc_order(size, flags, order);
}
#endif

static __always_inline void *kmalloc_large(size_t size, gfp_t flags)
{
	unsigned int order = get_order(size);
	return kmalloc_order_trace(size, flags, order);
}

static __always_inline void *kmalloc(size_t size, gfp_t flags)
{
	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;

			return kmem_cache_alloc_trace(s, flags, size);
		}
	}
	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_TRACING
extern void *kmem_cache_alloc_node_trace(struct kmem_cache *s,
					   gfp_t gfpflags,
					   int node, size_t size);
#else
static __always_inline void *
kmem_cache_alloc_node_trace(struct kmem_cache *s,
			      gfp_t gfpflags,
			      int node, size_t size)
{
	return kmem_cache_alloc_node(s, gfpflags, node);
}
#endif

static __always_inline void *kmalloc_node(size_t size, gfp_t flags, int node)
{
	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;

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

#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>
	13
4a92379b	14	#include <linux/kmemleak.h>
039ca4e7	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 */
4fdccdfb	35	CMPXCHG_DOUBLE_CPU_FAIL,/* Failure of this_cpu_cmpxchg_double */
8ff12cfc CL	36	NR_SLUB_STAT_ITEMS };
8ff12cfc CL	37
dfb4f096	38	struct kmem_cache_cpu {
8a5ec0ba CL	39	void *freelist; / Pointer to next available object */
	40	#ifdef CONFIG_CMPXCHG_LOCAL
	41	unsigned long tid; /* Globally unique transaction id */
	42	#endif
da89b79e CL	43	struct page page; / The slab from which we are allocating */
da89b79e CL	44	int node; /* The node of the page (or -1 for debug) */
8ff12cfc CL	45	#ifdef CONFIG_SLUB_STATS
	46	unsigned stat[NR_SLUB_STAT_ITEMS];
	47	#endif
4c93c355	48	};
dfb4f096	49
81819f0f CL	50	struct kmem_cache_node {
	51	spinlock_t list_lock; /* Protect partial list and nr_partial */
	52	unsigned long nr_partial;
81819f0f	53	struct list_head partial;
0c710013	54	#ifdef CONFIG_SLUB_DEBUG
0f389ec6	55	atomic_long_t nr_slabs;
205ab99d	56	atomic_long_t total_objects;
643b1138	57	struct list_head full;
0c710013	58	#endif
81819f0f CL	59	};
81819f0f CL	60
834f3d11 CL	61	/*
	62	* Word size structure that can be atomically updated or read and that
	63	* contains both the order and the number of objects that a slab of the
	64	* given order would contain.
	65	*/
	66	struct kmem_cache_order_objects {
	67	unsigned long x;
	68	};
	69
81819f0f CL	70	/*
	71	* Slab cache management.
	72	*/
	73	struct kmem_cache {
1b5ad248	74	struct kmem_cache_cpu __percpu *cpu_slab;
81819f0f CL	75	/* Used for retriving partial slabs etc */
81819f0f CL	76	unsigned long flags;
1a757fe5	77	unsigned long min_partial;
81819f0f CL	78	int size; /* The size of an object including meta data */
	79	int objsize; /* The size of an object without meta data */
	80	int offset; /* Free pointer offset. */
834f3d11	81	struct kmem_cache_order_objects oo;
81819f0f	82
81819f0f	83	/* Allocation and freeing of slabs */
205ab99d	84	struct kmem_cache_order_objects max;
65c3376a	85	struct kmem_cache_order_objects min;
b7a49f0d	86	gfp_t allocflags; /* gfp flags to use on each alloc */
81819f0f	87	int refcount; /* Refcount for slab cache destroy */
51cc5068	88	void (ctor)(void );
81819f0f CL	89	int inuse; /* Offset to metadata */
81819f0f CL	90	int align; /* Alignment */
ab9a0f19	91	int reserved; /* Reserved bytes at the end of slabs */
81819f0f CL	92	const char name; / Name (only for display!) */
81819f0f CL	93	struct list_head list; /* List of slab caches */
ab4d5ed5	94	#ifdef CONFIG_SYSFS
81819f0f	95	struct kobject kobj; /* For sysfs */
0c710013	96	#endif
81819f0f CL	97
81819f0f CL	98	#ifdef CONFIG_NUMA
9824601e CL	99	/*
	100	* Defragmentation by allocating from a remote node.
	101	*/
	102	int remote_node_defrag_ratio;
81819f0f	103	#endif
7340cc84	104	struct kmem_cache_node *node[MAX_NUMNODES];
81819f0f CL	105	};
	106
	107	/*
	108	* Kmalloc subsystem.
	109	*/
a6eb9fe1 FT	110	#if defined(ARCH_DMA_MINALIGN) && ARCH_DMA_MINALIGN > 8
a6eb9fe1 FT	111	#define KMALLOC_MIN_SIZE ARCH_DMA_MINALIGN
4b356be0 CL	112	#else
	113	#define KMALLOC_MIN_SIZE 8
	114	#endif
	115
	116	#define KMALLOC_SHIFT_LOW ilog2(KMALLOC_MIN_SIZE)
81819f0f	117
a6eb9fe1 FT	118	#ifdef ARCH_DMA_MINALIGN
	119	#define ARCH_KMALLOC_MINALIGN ARCH_DMA_MINALIGN
	120	#else
4581ced3 DW	121	#define ARCH_KMALLOC_MINALIGN __alignof__(unsigned long long)
	122	#endif
	123
	124	#ifndef ARCH_SLAB_MINALIGN
	125	#define ARCH_SLAB_MINALIGN __alignof__(unsigned long long)
	126	#endif
	127
ffadd4d0 CL	128	/*
	129	* Maximum kmalloc object size handled by SLUB. Larger object allocations
	130	* are passed through to the page allocator. The page allocator "fastpath"
	131	* is relatively slow so we need this value sufficiently high so that
	132	* performance critical objects are allocated through the SLUB fastpath.
	133	*
	134	* This should be dropped to PAGE_SIZE / 2 once the page allocator
	135	* "fastpath" becomes competitive with the slab allocator fastpaths.
	136	*/
51735a7c	137	#define SLUB_MAX_SIZE (2 * PAGE_SIZE)
ffadd4d0	138
51735a7c	139	#define SLUB_PAGE_SHIFT (PAGE_SHIFT + 2)
ffadd4d0	140
756dee75 CL	141	#ifdef CONFIG_ZONE_DMA
756dee75 CL	142	#define SLUB_DMA __GFP_DMA
756dee75 CL	143	#else
	144	/* Disable DMA functionality */
	145	#define SLUB_DMA (__force gfp_t)0
756dee75 CL	146	#endif
756dee75 CL	147
81819f0f CL	148	/*
	149	* We keep the general caches in an array of slab caches that are used for
	150	* 2^x bytes of allocations.
	151	*/
51df1142	152	extern struct kmem_cache *kmalloc_caches[SLUB_PAGE_SHIFT];
81819f0f CL	153
	154	/*
	155	* Sorry that the following has to be that ugly but some versions of GCC
	156	* have trouble with constant propagation and loops.
	157	*/
aa137f9d	158	static __always_inline int kmalloc_index(size_t size)
81819f0f	159	{
272c1d21 CL	160	if (!size)
272c1d21 CL	161	return 0;
614410d5	162
4b356be0 CL	163	if (size <= KMALLOC_MIN_SIZE)
	164	return KMALLOC_SHIFT_LOW;
	165
acdfcd04	166	if (KMALLOC_MIN_SIZE <= 32 && size > 64 && size <= 96)
81819f0f	167	return 1;
acdfcd04	168	if (KMALLOC_MIN_SIZE <= 64 && size > 128 && size <= 192)
81819f0f CL	169	return 2;
	170	if (size <= 8) return 3;
	171	if (size <= 16) return 4;
	172	if (size <= 32) return 5;
	173	if (size <= 64) return 6;
	174	if (size <= 128) return 7;
	175	if (size <= 256) return 8;
	176	if (size <= 512) return 9;
	177	if (size <= 1024) return 10;
	178	if (size <= 2 * 1024) return 11;
6446faa2	179	if (size <= 4 * 1024) return 12;
aadb4bc4 CL	180	/*
	181	* The following is only needed to support architectures with a larger page
	182	* size than 4k.
	183	*/
81819f0f CL	184	if (size <= 8 * 1024) return 13;
	185	if (size <= 16 * 1024) return 14;
	186	if (size <= 32 * 1024) return 15;
	187	if (size <= 64 * 1024) return 16;
	188	if (size <= 128 * 1024) return 17;
	189	if (size <= 256 * 1024) return 18;
aadb4bc4	190	if (size <= 512 * 1024) return 19;
81819f0f	191	if (size <= 1024 * 1024) return 20;
81819f0f	192	if (size <= 2 * 1024 * 1024) return 21;
81819f0f CL	193	return -1;
	194
	195	/*
	196	* What we really wanted to do and cannot do because of compiler issues is:
	197	* int i;
	198	* for (i = KMALLOC_SHIFT_LOW; i <= KMALLOC_SHIFT_HIGH; i++)
	199	* if (size <= (1 << i))
	200	* return i;
	201	*/
	202	}
	203
	204	/*
	205	* Find the slab cache for a given combination of allocation flags and size.
	206	*
	207	* This ought to end up with a global pointer to the right cache
	208	* in kmalloc_caches.
	209	*/
aa137f9d	210	static __always_inline struct kmem_cache *kmalloc_slab(size_t size)
81819f0f CL	211	{
	212	int index = kmalloc_index(size);
	213
	214	if (index == 0)
	215	return NULL;
	216
51df1142	217	return kmalloc_caches[index];
81819f0f CL	218	}
81819f0f CL	219
6193a2ff PM	220	void kmem_cache_alloc(struct kmem_cache , gfp_t);
	221	void *__kmalloc(size_t size, gfp_t flags);
	222
4a92379b RK	223	static __always_inline void *
	224	kmalloc_order(size_t size, gfp_t flags, unsigned int order)
	225	{
	226	void ret = (void ) __get_free_pages(flags \| __GFP_COMP, order);
	227	kmemleak_alloc(ret, size, 1, flags);
	228	return ret;
	229	}
	230
0f24f128	231	#ifdef CONFIG_TRACING
4a92379b RK	232	extern void *
	233	kmem_cache_alloc_trace(struct kmem_cache *s, gfp_t gfpflags, size_t size);
	234	extern void *kmalloc_order_trace(size_t size, gfp_t flags, unsigned int order);
5b882be4 EGM	235	#else
5b882be4 EGM	236	static __always_inline void *
4a92379b	237	kmem_cache_alloc_trace(struct kmem_cache *s, gfp_t gfpflags, size_t size)
5b882be4 EGM	238	{
	239	return kmem_cache_alloc(s, gfpflags);
	240	}
4a92379b RK	241
	242	static __always_inline void *
	243	kmalloc_order_trace(size_t size, gfp_t flags, unsigned int order)
	244	{
	245	return kmalloc_order(size, flags, order);
	246	}
5b882be4 EGM	247	#endif
5b882be4 EGM	248
eada35ef PE	249	static __always_inline void *kmalloc_large(size_t size, gfp_t flags)
eada35ef PE	250	{
5b882be4	251	unsigned int order = get_order(size);
4a92379b	252	return kmalloc_order_trace(size, flags, order);
eada35ef PE	253	}
eada35ef PE	254
aa137f9d	255	static __always_inline void *kmalloc(size_t size, gfp_t flags)
81819f0f	256	{
aadb4bc4	257	if (__builtin_constant_p(size)) {
ffadd4d0	258	if (size > SLUB_MAX_SIZE)
eada35ef	259	return kmalloc_large(size, flags);
81819f0f	260
aadb4bc4 CL	261	if (!(flags & SLUB_DMA)) {
	262	struct kmem_cache *s = kmalloc_slab(size);
	263
	264	if (!s)
	265	return ZERO_SIZE_PTR;
81819f0f	266
4a92379b	267	return kmem_cache_alloc_trace(s, flags, size);
aadb4bc4 CL	268	}
	269	}
	270	return __kmalloc(size, flags);
81819f0f CL	271	}
81819f0f CL	272
81819f0f	273	#ifdef CONFIG_NUMA
6193a2ff PM	274	void *__kmalloc_node(size_t size, gfp_t flags, int node);
6193a2ff PM	275	void kmem_cache_alloc_node(struct kmem_cache , gfp_t flags, int node);
81819f0f	276
0f24f128	277	#ifdef CONFIG_TRACING
4a92379b	278	extern void kmem_cache_alloc_node_trace(struct kmem_cache s,
5b882be4	279	gfp_t gfpflags,
4a92379b	280	int node, size_t size);
5b882be4 EGM	281	#else
5b882be4 EGM	282	static __always_inline void *
4a92379b	283	kmem_cache_alloc_node_trace(struct kmem_cache *s,
5b882be4	284	gfp_t gfpflags,
4a92379b	285	int node, size_t size)
5b882be4 EGM	286	{
	287	return kmem_cache_alloc_node(s, gfpflags, node);
	288	}
	289	#endif
	290
aa137f9d	291	static __always_inline void *kmalloc_node(size_t size, gfp_t flags, int node)
81819f0f	292	{
aadb4bc4	293	if (__builtin_constant_p(size) &&
ffadd4d0	294	size <= SLUB_MAX_SIZE && !(flags & SLUB_DMA)) {
aadb4bc4	295	struct kmem_cache *s = kmalloc_slab(size);
81819f0f CL	296
81819f0f CL	297	if (!s)
272c1d21	298	return ZERO_SIZE_PTR;
81819f0f	299
4a92379b	300	return kmem_cache_alloc_node_trace(s, flags, node, size);
aadb4bc4 CL	301	}
aadb4bc4 CL	302	return __kmalloc_node(size, flags, node);
81819f0f CL	303	}
	304	#endif
	305
	306	#endif /* _LINUX_SLUB_DEF_H */