]>
Commit | Line | Data |
---|---|---|
2e892f43 CL |
1 | #ifndef _LINUX_SLAB_DEF_H |
2 | #define _LINUX_SLAB_DEF_H | |
3 | ||
4 | /* | |
5 | * Definitions unique to the original Linux SLAB allocator. | |
6 | * | |
7 | * What we provide here is a way to optimize the frequent kmalloc | |
8 | * calls in the kernel by selecting the appropriate general cache | |
9 | * if kmalloc was called with a size that can be established at | |
10 | * compile time. | |
11 | */ | |
12 | ||
13 | #include <linux/init.h> | |
14 | #include <asm/page.h> /* kmalloc_sizes.h needs PAGE_SIZE */ | |
15 | #include <asm/cache.h> /* kmalloc_sizes.h needs L1_CACHE_BYTES */ | |
16 | #include <linux/compiler.h> | |
039ca4e7 | 17 | |
8eae985f PE |
18 | /* |
19 | * struct kmem_cache | |
20 | * | |
21 | * manages a cache. | |
22 | */ | |
23 | ||
24 | struct kmem_cache { | |
b56efcf0 | 25 | /* 1) Cache tunables. Protected by cache_chain_mutex */ |
8eae985f PE |
26 | unsigned int batchcount; |
27 | unsigned int limit; | |
28 | unsigned int shared; | |
29 | ||
3b0efdfa | 30 | unsigned int size; |
8eae985f | 31 | u32 reciprocal_buffer_size; |
b56efcf0 | 32 | /* 2) touched by every alloc & free from the backend */ |
8eae985f PE |
33 | |
34 | unsigned int flags; /* constant flags */ | |
35 | unsigned int num; /* # of objs per slab */ | |
36 | ||
b56efcf0 | 37 | /* 3) cache_grow/shrink */ |
8eae985f PE |
38 | /* order of pgs per slab (2^n) */ |
39 | unsigned int gfporder; | |
40 | ||
41 | /* force GFP flags, e.g. GFP_DMA */ | |
a618e89f | 42 | gfp_t allocflags; |
8eae985f PE |
43 | |
44 | size_t colour; /* cache colouring range */ | |
45 | unsigned int colour_off; /* colour offset */ | |
46 | struct kmem_cache *slabp_cache; | |
47 | unsigned int slab_size; | |
8eae985f PE |
48 | |
49 | /* constructor func */ | |
50 | void (*ctor)(void *obj); | |
51 | ||
b56efcf0 | 52 | /* 4) cache creation/removal */ |
8eae985f | 53 | const char *name; |
3b0efdfa CL |
54 | struct list_head list; |
55 | int refcount; | |
56 | int object_size; | |
57 | int align; | |
8eae985f | 58 | |
b56efcf0 | 59 | /* 5) statistics */ |
8eae985f PE |
60 | #ifdef CONFIG_DEBUG_SLAB |
61 | unsigned long num_active; | |
62 | unsigned long num_allocations; | |
63 | unsigned long high_mark; | |
64 | unsigned long grown; | |
65 | unsigned long reaped; | |
66 | unsigned long errors; | |
67 | unsigned long max_freeable; | |
68 | unsigned long node_allocs; | |
69 | unsigned long node_frees; | |
70 | unsigned long node_overflow; | |
71 | atomic_t allochit; | |
72 | atomic_t allocmiss; | |
73 | atomic_t freehit; | |
74 | atomic_t freemiss; | |
75 | ||
76 | /* | |
77 | * If debugging is enabled, then the allocator can add additional | |
3b0efdfa | 78 | * fields and/or padding to every object. size contains the total |
8eae985f PE |
79 | * object size including these internal fields, the following two |
80 | * variables contain the offset to the user object and its size. | |
81 | */ | |
82 | int obj_offset; | |
8eae985f | 83 | #endif /* CONFIG_DEBUG_SLAB */ |
ba6c496e GC |
84 | #ifdef CONFIG_MEMCG_KMEM |
85 | struct memcg_cache_params *memcg_params; | |
86 | #endif | |
8eae985f | 87 | |
b56efcf0 | 88 | /* 6) per-cpu/per-node data, touched during every alloc/free */ |
8eae985f | 89 | /* |
b56efcf0 ED |
90 | * We put array[] at the end of kmem_cache, because we want to size |
91 | * this array to nr_cpu_ids slots instead of NR_CPUS | |
8eae985f | 92 | * (see kmem_cache_init()) |
b56efcf0 ED |
93 | * We still use [NR_CPUS] and not [1] or [0] because cache_cache |
94 | * is statically defined, so we reserve the max number of cpus. | |
3c583465 CL |
95 | * |
96 | * We also need to guarantee that the list is able to accomodate a | |
97 | * pointer for each node since "nodelists" uses the remainder of | |
98 | * available pointers. | |
8eae985f | 99 | */ |
b56efcf0 | 100 | struct kmem_list3 **nodelists; |
3c583465 | 101 | struct array_cache *array[NR_CPUS + MAX_NUMNODES]; |
8eae985f | 102 | /* |
b56efcf0 | 103 | * Do not add fields after array[] |
8eae985f PE |
104 | */ |
105 | }; | |
106 | ||
2e892f43 CL |
107 | /* Size description struct for general caches. */ |
108 | struct cache_sizes { | |
109 | size_t cs_size; | |
110 | struct kmem_cache *cs_cachep; | |
4b51d669 | 111 | #ifdef CONFIG_ZONE_DMA |
2e892f43 | 112 | struct kmem_cache *cs_dmacachep; |
4b51d669 | 113 | #endif |
2e892f43 CL |
114 | }; |
115 | extern struct cache_sizes malloc_sizes[]; | |
116 | ||
6193a2ff PM |
117 | void *kmem_cache_alloc(struct kmem_cache *, gfp_t); |
118 | void *__kmalloc(size_t size, gfp_t flags); | |
119 | ||
0f24f128 | 120 | #ifdef CONFIG_TRACING |
4052147c | 121 | extern void *kmem_cache_alloc_trace(struct kmem_cache *, gfp_t, size_t); |
36555751 EGM |
122 | #else |
123 | static __always_inline void * | |
4052147c | 124 | kmem_cache_alloc_trace(struct kmem_cache *cachep, gfp_t flags, size_t size) |
2e892f43 | 125 | { |
36555751 EGM |
126 | return kmem_cache_alloc(cachep, flags); |
127 | } | |
36555751 EGM |
128 | #endif |
129 | ||
130 | static __always_inline void *kmalloc(size_t size, gfp_t flags) | |
131 | { | |
132 | struct kmem_cache *cachep; | |
133 | void *ret; | |
134 | ||
2e892f43 CL |
135 | if (__builtin_constant_p(size)) { |
136 | int i = 0; | |
6cb8f913 CL |
137 | |
138 | if (!size) | |
139 | return ZERO_SIZE_PTR; | |
140 | ||
2e892f43 CL |
141 | #define CACHE(x) \ |
142 | if (size <= x) \ | |
143 | goto found; \ | |
144 | else \ | |
145 | i++; | |
1c61fc40 | 146 | #include <linux/kmalloc_sizes.h> |
2e892f43 | 147 | #undef CACHE |
1cf3eb2f | 148 | return NULL; |
2e892f43 | 149 | found: |
4b51d669 CL |
150 | #ifdef CONFIG_ZONE_DMA |
151 | if (flags & GFP_DMA) | |
36555751 EGM |
152 | cachep = malloc_sizes[i].cs_dmacachep; |
153 | else | |
4b51d669 | 154 | #endif |
36555751 EGM |
155 | cachep = malloc_sizes[i].cs_cachep; |
156 | ||
4052147c | 157 | ret = kmem_cache_alloc_trace(cachep, flags, size); |
36555751 EGM |
158 | |
159 | return ret; | |
2e892f43 CL |
160 | } |
161 | return __kmalloc(size, flags); | |
162 | } | |
163 | ||
2e892f43 CL |
164 | #ifdef CONFIG_NUMA |
165 | extern void *__kmalloc_node(size_t size, gfp_t flags, int node); | |
6193a2ff | 166 | extern void *kmem_cache_alloc_node(struct kmem_cache *, gfp_t flags, int node); |
2e892f43 | 167 | |
0f24f128 | 168 | #ifdef CONFIG_TRACING |
dffa3f98 | 169 | extern void *kmem_cache_alloc_node_trace(struct kmem_cache *cachep, |
85beb586 | 170 | gfp_t flags, |
dffa3f98 EG |
171 | int nodeid, |
172 | size_t size); | |
36555751 EGM |
173 | #else |
174 | static __always_inline void * | |
dffa3f98 | 175 | kmem_cache_alloc_node_trace(struct kmem_cache *cachep, |
85beb586 | 176 | gfp_t flags, |
dffa3f98 EG |
177 | int nodeid, |
178 | size_t size) | |
36555751 EGM |
179 | { |
180 | return kmem_cache_alloc_node(cachep, flags, nodeid); | |
181 | } | |
182 | #endif | |
183 | ||
184 | static __always_inline void *kmalloc_node(size_t size, gfp_t flags, int node) | |
2e892f43 | 185 | { |
36555751 | 186 | struct kmem_cache *cachep; |
36555751 | 187 | |
2e892f43 CL |
188 | if (__builtin_constant_p(size)) { |
189 | int i = 0; | |
6cb8f913 CL |
190 | |
191 | if (!size) | |
192 | return ZERO_SIZE_PTR; | |
193 | ||
2e892f43 CL |
194 | #define CACHE(x) \ |
195 | if (size <= x) \ | |
196 | goto found; \ | |
197 | else \ | |
198 | i++; | |
1c61fc40 | 199 | #include <linux/kmalloc_sizes.h> |
2e892f43 | 200 | #undef CACHE |
1cf3eb2f | 201 | return NULL; |
2e892f43 | 202 | found: |
4b51d669 CL |
203 | #ifdef CONFIG_ZONE_DMA |
204 | if (flags & GFP_DMA) | |
36555751 EGM |
205 | cachep = malloc_sizes[i].cs_dmacachep; |
206 | else | |
4b51d669 | 207 | #endif |
36555751 EGM |
208 | cachep = malloc_sizes[i].cs_cachep; |
209 | ||
dffa3f98 | 210 | return kmem_cache_alloc_node_trace(cachep, flags, node, size); |
2e892f43 CL |
211 | } |
212 | return __kmalloc_node(size, flags, node); | |
213 | } | |
214 | ||
215 | #endif /* CONFIG_NUMA */ | |
216 | ||
217 | #endif /* _LINUX_SLAB_DEF_H */ |