Rev 1787 | Rev 2052 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1787 | Rev 1950 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (C) 2006 Ondrej Palkovsky |
2 | * Copyright (C) 2006 Ondrej Palkovsky |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
13 | * documentation and/or other materials provided with the distribution. |
14 | * - The name of the author may not be used to endorse or promote products |
14 | * - The name of the author may not be used to endorse or promote products |
15 | * derived from this software without specific prior written permission. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | /** @addtogroup genericmm |
29 | /** @addtogroup genericmm |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | 32 | ||
33 | /** |
33 | /** |
34 | * @file |
34 | * @file |
35 | * @brief Slab allocator. |
35 | * @brief Slab allocator. |
36 | * |
36 | * |
37 | * The slab allocator is closely modelled after OpenSolaris slab allocator. |
37 | * The slab allocator is closely modelled after OpenSolaris slab allocator. |
38 | * @see http://www.usenix.org/events/usenix01/full_papers/bonwick/bonwick_html/ |
38 | * @see http://www.usenix.org/events/usenix01/full_papers/bonwick/bonwick_html/ |
39 | * |
39 | * |
40 | * with the following exceptions: |
40 | * with the following exceptions: |
41 | * @li empty slabs are deallocated immediately |
41 | * @li empty slabs are deallocated immediately |
42 | * (in Linux they are kept in linked list, in Solaris ???) |
42 | * (in Linux they are kept in linked list, in Solaris ???) |
43 | * @li empty magazines are deallocated when not needed |
43 | * @li empty magazines are deallocated when not needed |
44 | * (in Solaris they are held in linked list in slab cache) |
44 | * (in Solaris they are held in linked list in slab cache) |
45 | * |
45 | * |
46 | * Following features are not currently supported but would be easy to do: |
46 | * Following features are not currently supported but would be easy to do: |
47 | * @li cache coloring |
47 | * @li cache coloring |
48 | * @li dynamic magazine growing (different magazine sizes are already |
48 | * @li dynamic magazine growing (different magazine sizes are already |
49 | * supported, but we would need to adjust allocation strategy) |
49 | * supported, but we would need to adjust allocation strategy) |
50 | * |
50 | * |
51 | * The slab allocator supports per-CPU caches ('magazines') to facilitate |
51 | * The slab allocator supports per-CPU caches ('magazines') to facilitate |
52 | * good SMP scaling. |
52 | * good SMP scaling. |
53 | * |
53 | * |
54 | * When a new object is being allocated, it is first checked, if it is |
54 | * When a new object is being allocated, it is first checked, if it is |
55 | * available in a CPU-bound magazine. If it is not found there, it is |
55 | * available in a CPU-bound magazine. If it is not found there, it is |
56 | * allocated from a CPU-shared slab - if a partially full one is found, |
56 | * allocated from a CPU-shared slab - if a partially full one is found, |
57 | * it is used, otherwise a new one is allocated. |
57 | * it is used, otherwise a new one is allocated. |
58 | * |
58 | * |
59 | * When an object is being deallocated, it is put to a CPU-bound magazine. |
59 | * When an object is being deallocated, it is put to a CPU-bound magazine. |
60 | * If there is no such magazine, a new one is allocated (if this fails, |
60 | * If there is no such magazine, a new one is allocated (if this fails, |
61 | * the object is deallocated into slab). If the magazine is full, it is |
61 | * the object is deallocated into slab). If the magazine is full, it is |
62 | * put into cpu-shared list of magazines and a new one is allocated. |
62 | * put into cpu-shared list of magazines and a new one is allocated. |
63 | * |
63 | * |
64 | * The CPU-bound magazine is actually a pair of magazines in order to avoid |
64 | * The CPU-bound magazine is actually a pair of magazines in order to avoid |
65 | * thrashing when somebody is allocating/deallocating 1 item at the magazine |
65 | * thrashing when somebody is allocating/deallocating 1 item at the magazine |
66 | * size boundary. LIFO order is enforced, which should avoid fragmentation |
66 | * size boundary. LIFO order is enforced, which should avoid fragmentation |
67 | * as much as possible. |
67 | * as much as possible. |
68 | * |
68 | * |
69 | * Every cache contains list of full slabs and list of partially full slabs. |
69 | * Every cache contains list of full slabs and list of partially full slabs. |
70 | * Empty slabs are immediately freed (thrashing will be avoided because |
70 | * Empty slabs are immediately freed (thrashing will be avoided because |
71 | * of magazines). |
71 | * of magazines). |
72 | * |
72 | * |
73 | * The slab information structure is kept inside the data area, if possible. |
73 | * The slab information structure is kept inside the data area, if possible. |
74 | * The cache can be marked that it should not use magazines. This is used |
74 | * The cache can be marked that it should not use magazines. This is used |
75 | * only for slab related caches to avoid deadlocks and infinite recursion |
75 | * only for slab related caches to avoid deadlocks and infinite recursion |
76 | * (the slab allocator uses itself for allocating all it's control structures). |
76 | * (the slab allocator uses itself for allocating all it's control structures). |
77 | * |
77 | * |
78 | * The slab allocator allocates a lot of space and does not free it. When |
78 | * The slab allocator allocates a lot of space and does not free it. When |
79 | * the frame allocator fails to allocate a frame, it calls slab_reclaim(). |
79 | * the frame allocator fails to allocate a frame, it calls slab_reclaim(). |
80 | * It tries 'light reclaim' first, then brutal reclaim. The light reclaim |
80 | * It tries 'light reclaim' first, then brutal reclaim. The light reclaim |
81 | * releases slabs from cpu-shared magazine-list, until at least 1 slab |
81 | * releases slabs from cpu-shared magazine-list, until at least 1 slab |
82 | * is deallocated in each cache (this algorithm should probably change). |
82 | * is deallocated in each cache (this algorithm should probably change). |
83 | * The brutal reclaim removes all cached objects, even from CPU-bound |
83 | * The brutal reclaim removes all cached objects, even from CPU-bound |
84 | * magazines. |
84 | * magazines. |
85 | * |
85 | * |
86 | * @todo |
86 | * @todo |
87 | * For better CPU-scaling the magazine allocation strategy should |
87 | * For better CPU-scaling the magazine allocation strategy should |
88 | * be extended. Currently, if the cache does not have magazine, it asks |
88 | * be extended. Currently, if the cache does not have magazine, it asks |
89 | * for non-cpu cached magazine cache to provide one. It might be feasible |
89 | * for non-cpu cached magazine cache to provide one. It might be feasible |
90 | * to add cpu-cached magazine cache (which would allocate it's magazines |
90 | * to add cpu-cached magazine cache (which would allocate it's magazines |
91 | * from non-cpu-cached mag. cache). This would provide a nice per-cpu |
91 | * from non-cpu-cached mag. cache). This would provide a nice per-cpu |
92 | * buffer. The other possibility is to use the per-cache |
92 | * buffer. The other possibility is to use the per-cache |
93 | * 'empty-magazine-list', which decreases competing for 1 per-system |
93 | * 'empty-magazine-list', which decreases competing for 1 per-system |
94 | * magazine cache. |
94 | * magazine cache. |
95 | * |
95 | * |
96 | * @todo |
96 | * @todo |
97 | * it might be good to add granularity of locks even to slab level, |
97 | * it might be good to add granularity of locks even to slab level, |
98 | * we could then try_spinlock over all partial slabs and thus improve |
98 | * we could then try_spinlock over all partial slabs and thus improve |
99 | * scalability even on slab level |
99 | * scalability even on slab level |
100 | */ |
100 | */ |
101 | 101 | ||
102 | #include <synch/spinlock.h> |
102 | #include <synch/spinlock.h> |
103 | #include <mm/slab.h> |
103 | #include <mm/slab.h> |
104 | #include <adt/list.h> |
104 | #include <adt/list.h> |
105 | #include <memstr.h> |
105 | #include <memstr.h> |
106 | #include <align.h> |
106 | #include <align.h> |
107 | #include <mm/frame.h> |
107 | #include <mm/frame.h> |
108 | #include <config.h> |
108 | #include <config.h> |
109 | #include <print.h> |
109 | #include <print.h> |
110 | #include <arch.h> |
110 | #include <arch.h> |
111 | #include <panic.h> |
111 | #include <panic.h> |
112 | #include <debug.h> |
112 | #include <debug.h> |
113 | #include <bitops.h> |
113 | #include <bitops.h> |
114 | 114 | ||
115 | SPINLOCK_INITIALIZE(slab_cache_lock); |
115 | SPINLOCK_INITIALIZE(slab_cache_lock); |
116 | static LIST_INITIALIZE(slab_cache_list); |
116 | static LIST_INITIALIZE(slab_cache_list); |
117 | 117 | ||
118 | /** Magazine cache */ |
118 | /** Magazine cache */ |
119 | static slab_cache_t mag_cache; |
119 | static slab_cache_t mag_cache; |
120 | /** Cache for cache descriptors */ |
120 | /** Cache for cache descriptors */ |
121 | static slab_cache_t slab_cache_cache; |
121 | static slab_cache_t slab_cache_cache; |
122 | /** Cache for external slab descriptors |
122 | /** Cache for external slab descriptors |
123 | * This time we want per-cpu cache, so do not make it static |
123 | * This time we want per-cpu cache, so do not make it static |
124 | * - using slab for internal slab structures will not deadlock, |
124 | * - using slab for internal slab structures will not deadlock, |
125 | * as all slab structures are 'small' - control structures of |
125 | * as all slab structures are 'small' - control structures of |
126 | * their caches do not require further allocation |
126 | * their caches do not require further allocation |
127 | */ |
127 | */ |
128 | static slab_cache_t *slab_extern_cache; |
128 | static slab_cache_t *slab_extern_cache; |
129 | /** Caches for malloc */ |
129 | /** Caches for malloc */ |
130 | static slab_cache_t *malloc_caches[SLAB_MAX_MALLOC_W-SLAB_MIN_MALLOC_W+1]; |
130 | static slab_cache_t *malloc_caches[SLAB_MAX_MALLOC_W-SLAB_MIN_MALLOC_W+1]; |
131 | char *malloc_names[] = { |
131 | char *malloc_names[] = { |
132 | "malloc-16","malloc-32","malloc-64","malloc-128", |
132 | "malloc-16","malloc-32","malloc-64","malloc-128", |
133 | "malloc-256","malloc-512","malloc-1K","malloc-2K", |
133 | "malloc-256","malloc-512","malloc-1K","malloc-2K", |
134 | "malloc-4K","malloc-8K","malloc-16K","malloc-32K", |
134 | "malloc-4K","malloc-8K","malloc-16K","malloc-32K", |
135 | "malloc-64K","malloc-128K","malloc-256K" |
135 | "malloc-64K","malloc-128K","malloc-256K" |
136 | }; |
136 | }; |
137 | 137 | ||
138 | /** Slab descriptor */ |
138 | /** Slab descriptor */ |
139 | typedef struct { |
139 | typedef struct { |
140 | slab_cache_t *cache; /**< Pointer to parent cache */ |
140 | slab_cache_t *cache; /**< Pointer to parent cache. */ |
141 | link_t link; /* List of full/partial slabs */ |
141 | link_t link; /**< List of full/partial slabs. */ |
142 | void *start; /**< Start address of first available item */ |
142 | void *start; /**< Start address of first available item. */ |
143 | count_t available; /**< Count of available items in this slab */ |
143 | count_t available; /**< Count of available items in this slab. */ |
144 | index_t nextavail; /**< The index of next available item */ |
144 | index_t nextavail; /**< The index of next available item. */ |
145 | }slab_t; |
145 | }slab_t; |
146 | 146 | ||
147 | #ifdef CONFIG_DEBUG |
147 | #ifdef CONFIG_DEBUG |
148 | static int _slab_initialized = 0; |
148 | static int _slab_initialized = 0; |
149 | #endif |
149 | #endif |
150 | 150 | ||
151 | /**************************************/ |
151 | /**************************************/ |
152 | /* Slab allocation functions */ |
152 | /* Slab allocation functions */ |
153 | 153 | ||
154 | /** |
154 | /** |
155 | * Allocate frames for slab space and initialize |
155 | * Allocate frames for slab space and initialize |
156 | * |
156 | * |
157 | */ |
157 | */ |
158 | static slab_t * slab_space_alloc(slab_cache_t *cache, int flags) |
158 | static slab_t * slab_space_alloc(slab_cache_t *cache, int flags) |
159 | { |
159 | { |
160 | void *data; |
160 | void *data; |
161 | slab_t *slab; |
161 | slab_t *slab; |
162 | size_t fsize; |
162 | size_t fsize; |
163 | int i; |
163 | int i; |
164 | int zone=0; |
164 | int zone=0; |
165 | 165 | ||
166 | data = frame_alloc_generic(cache->order, FRAME_KA | flags, &zone); |
166 | data = frame_alloc_generic(cache->order, FRAME_KA | flags, &zone); |
167 | if (!data) { |
167 | if (!data) { |
168 | return NULL; |
168 | return NULL; |
169 | } |
169 | } |
170 | if (! (cache->flags & SLAB_CACHE_SLINSIDE)) { |
170 | if (! (cache->flags & SLAB_CACHE_SLINSIDE)) { |
171 | slab = slab_alloc(slab_extern_cache, flags); |
171 | slab = slab_alloc(slab_extern_cache, flags); |
172 | if (!slab) { |
172 | if (!slab) { |
173 | frame_free(KA2PA(data)); |
173 | frame_free(KA2PA(data)); |
174 | return NULL; |
174 | return NULL; |
175 | } |
175 | } |
176 | } else { |
176 | } else { |
177 | fsize = (PAGE_SIZE << cache->order); |
177 | fsize = (PAGE_SIZE << cache->order); |
178 | slab = data + fsize - sizeof(*slab); |
178 | slab = data + fsize - sizeof(*slab); |
179 | } |
179 | } |
180 | 180 | ||
181 | /* Fill in slab structures */ |
181 | /* Fill in slab structures */ |
182 | for (i=0; i < (1 << cache->order); i++) |
182 | for (i=0; i < (1 << cache->order); i++) |
183 | frame_set_parent(ADDR2PFN(KA2PA(data))+i, slab, zone); |
183 | frame_set_parent(ADDR2PFN(KA2PA(data))+i, slab, zone); |
184 | 184 | ||
185 | slab->start = data; |
185 | slab->start = data; |
186 | slab->available = cache->objects; |
186 | slab->available = cache->objects; |
187 | slab->nextavail = 0; |
187 | slab->nextavail = 0; |
188 | slab->cache = cache; |
188 | slab->cache = cache; |
189 | 189 | ||
190 | for (i=0; i<cache->objects;i++) |
190 | for (i=0; i<cache->objects;i++) |
191 | *((int *) (slab->start + i*cache->size)) = i+1; |
191 | *((int *) (slab->start + i*cache->size)) = i+1; |
192 | 192 | ||
193 | atomic_inc(&cache->allocated_slabs); |
193 | atomic_inc(&cache->allocated_slabs); |
194 | return slab; |
194 | return slab; |
195 | } |
195 | } |
196 | 196 | ||
197 | /** |
197 | /** |
198 | * Deallocate space associated with slab |
198 | * Deallocate space associated with slab |
199 | * |
199 | * |
200 | * @return number of freed frames |
200 | * @return number of freed frames |
201 | */ |
201 | */ |
202 | static count_t slab_space_free(slab_cache_t *cache, slab_t *slab) |
202 | static count_t slab_space_free(slab_cache_t *cache, slab_t *slab) |
203 | { |
203 | { |
204 | frame_free(KA2PA(slab->start)); |
204 | frame_free(KA2PA(slab->start)); |
205 | if (! (cache->flags & SLAB_CACHE_SLINSIDE)) |
205 | if (! (cache->flags & SLAB_CACHE_SLINSIDE)) |
206 | slab_free(slab_extern_cache, slab); |
206 | slab_free(slab_extern_cache, slab); |
207 | 207 | ||
208 | atomic_dec(&cache->allocated_slabs); |
208 | atomic_dec(&cache->allocated_slabs); |
209 | 209 | ||
210 | return 1 << cache->order; |
210 | return 1 << cache->order; |
211 | } |
211 | } |
212 | 212 | ||
213 | /** Map object to slab structure */ |
213 | /** Map object to slab structure */ |
214 | static slab_t * obj2slab(void *obj) |
214 | static slab_t * obj2slab(void *obj) |
215 | { |
215 | { |
216 | return (slab_t *)frame_get_parent(ADDR2PFN(KA2PA(obj)), 0); |
216 | return (slab_t *)frame_get_parent(ADDR2PFN(KA2PA(obj)), 0); |
217 | } |
217 | } |
218 | 218 | ||
219 | /**************************************/ |
219 | /**************************************/ |
220 | /* Slab functions */ |
220 | /* Slab functions */ |
221 | 221 | ||
222 | 222 | ||
223 | /** |
223 | /** |
224 | * Return object to slab and call a destructor |
224 | * Return object to slab and call a destructor |
225 | * |
225 | * |
226 | * @param slab If the caller knows directly slab of the object, otherwise NULL |
226 | * @param slab If the caller knows directly slab of the object, otherwise NULL |
227 | * |
227 | * |
228 | * @return Number of freed pages |
228 | * @return Number of freed pages |
229 | */ |
229 | */ |
230 | static count_t slab_obj_destroy(slab_cache_t *cache, void *obj, |
230 | static count_t slab_obj_destroy(slab_cache_t *cache, void *obj, |
231 | slab_t *slab) |
231 | slab_t *slab) |
232 | { |
232 | { |
233 | int freed = 0; |
233 | int freed = 0; |
234 | 234 | ||
235 | if (!slab) |
235 | if (!slab) |
236 | slab = obj2slab(obj); |
236 | slab = obj2slab(obj); |
237 | 237 | ||
238 | ASSERT(slab->cache == cache); |
238 | ASSERT(slab->cache == cache); |
239 | 239 | ||
240 | if (cache->destructor) |
240 | if (cache->destructor) |
241 | freed = cache->destructor(obj); |
241 | freed = cache->destructor(obj); |
242 | 242 | ||
243 | spinlock_lock(&cache->slablock); |
243 | spinlock_lock(&cache->slablock); |
244 | ASSERT(slab->available < cache->objects); |
244 | ASSERT(slab->available < cache->objects); |
245 | 245 | ||
246 | *((int *)obj) = slab->nextavail; |
246 | *((int *)obj) = slab->nextavail; |
247 | slab->nextavail = (obj - slab->start)/cache->size; |
247 | slab->nextavail = (obj - slab->start)/cache->size; |
248 | slab->available++; |
248 | slab->available++; |
249 | 249 | ||
250 | /* Move it to correct list */ |
250 | /* Move it to correct list */ |
251 | if (slab->available == cache->objects) { |
251 | if (slab->available == cache->objects) { |
252 | /* Free associated memory */ |
252 | /* Free associated memory */ |
253 | list_remove(&slab->link); |
253 | list_remove(&slab->link); |
254 | spinlock_unlock(&cache->slablock); |
254 | spinlock_unlock(&cache->slablock); |
255 | 255 | ||
256 | return freed + slab_space_free(cache, slab); |
256 | return freed + slab_space_free(cache, slab); |
257 | 257 | ||
258 | } else if (slab->available == 1) { |
258 | } else if (slab->available == 1) { |
259 | /* It was in full, move to partial */ |
259 | /* It was in full, move to partial */ |
260 | list_remove(&slab->link); |
260 | list_remove(&slab->link); |
261 | list_prepend(&slab->link, &cache->partial_slabs); |
261 | list_prepend(&slab->link, &cache->partial_slabs); |
262 | } |
262 | } |
263 | spinlock_unlock(&cache->slablock); |
263 | spinlock_unlock(&cache->slablock); |
264 | return freed; |
264 | return freed; |
265 | } |
265 | } |
266 | 266 | ||
267 | /** |
267 | /** |
268 | * Take new object from slab or create new if needed |
268 | * Take new object from slab or create new if needed |
269 | * |
269 | * |
270 | * @return Object address or null |
270 | * @return Object address or null |
271 | */ |
271 | */ |
272 | static void * slab_obj_create(slab_cache_t *cache, int flags) |
272 | static void * slab_obj_create(slab_cache_t *cache, int flags) |
273 | { |
273 | { |
274 | slab_t *slab; |
274 | slab_t *slab; |
275 | void *obj; |
275 | void *obj; |
276 | 276 | ||
277 | spinlock_lock(&cache->slablock); |
277 | spinlock_lock(&cache->slablock); |
278 | 278 | ||
279 | if (list_empty(&cache->partial_slabs)) { |
279 | if (list_empty(&cache->partial_slabs)) { |
280 | /* Allow recursion and reclaiming |
280 | /* Allow recursion and reclaiming |
281 | * - this should work, as the slab control structures |
281 | * - this should work, as the slab control structures |
282 | * are small and do not need to allocate with anything |
282 | * are small and do not need to allocate with anything |
283 | * other than frame_alloc when they are allocating, |
283 | * other than frame_alloc when they are allocating, |
284 | * that's why we should get recursion at most 1-level deep |
284 | * that's why we should get recursion at most 1-level deep |
285 | */ |
285 | */ |
286 | spinlock_unlock(&cache->slablock); |
286 | spinlock_unlock(&cache->slablock); |
287 | slab = slab_space_alloc(cache, flags); |
287 | slab = slab_space_alloc(cache, flags); |
288 | if (!slab) |
288 | if (!slab) |
289 | return NULL; |
289 | return NULL; |
290 | spinlock_lock(&cache->slablock); |
290 | spinlock_lock(&cache->slablock); |
291 | } else { |
291 | } else { |
292 | slab = list_get_instance(cache->partial_slabs.next, |
292 | slab = list_get_instance(cache->partial_slabs.next, slab_t, link); |
293 | slab_t, |
- | |
294 | link); |
- | |
295 | list_remove(&slab->link); |
293 | list_remove(&slab->link); |
296 | } |
294 | } |
297 | obj = slab->start + slab->nextavail * cache->size; |
295 | obj = slab->start + slab->nextavail * cache->size; |
298 | slab->nextavail = *((int *)obj); |
296 | slab->nextavail = *((int *)obj); |
299 | slab->available--; |
297 | slab->available--; |
300 | 298 | ||
301 | if (! slab->available) |
299 | if (!slab->available) |
302 | list_prepend(&slab->link, &cache->full_slabs); |
300 | list_prepend(&slab->link, &cache->full_slabs); |
303 | else |
301 | else |
304 | list_prepend(&slab->link, &cache->partial_slabs); |
302 | list_prepend(&slab->link, &cache->partial_slabs); |
305 | 303 | ||
306 | spinlock_unlock(&cache->slablock); |
304 | spinlock_unlock(&cache->slablock); |
307 | 305 | ||
308 | if (cache->constructor && cache->constructor(obj, flags)) { |
306 | if (cache->constructor && cache->constructor(obj, flags)) { |
309 | /* Bad, bad, construction failed */ |
307 | /* Bad, bad, construction failed */ |
310 | slab_obj_destroy(cache, obj, slab); |
308 | slab_obj_destroy(cache, obj, slab); |
311 | return NULL; |
309 | return NULL; |
312 | } |
310 | } |
313 | return obj; |
311 | return obj; |
314 | } |
312 | } |
315 | 313 | ||
316 | /**************************************/ |
314 | /**************************************/ |
317 | /* CPU-Cache slab functions */ |
315 | /* CPU-Cache slab functions */ |
318 | 316 | ||
319 | /** |
317 | /** |
320 | * Finds a full magazine in cache, takes it from list |
318 | * Finds a full magazine in cache, takes it from list |
321 | * and returns it |
319 | * and returns it |
322 | * |
320 | * |
323 | * @param first If true, return first, else last mag |
321 | * @param first If true, return first, else last mag |
324 | */ |
322 | */ |
325 | static slab_magazine_t * get_mag_from_cache(slab_cache_t *cache, |
323 | static slab_magazine_t * get_mag_from_cache(slab_cache_t *cache, |
326 | int first) |
324 | int first) |
327 | { |
325 | { |
328 | slab_magazine_t *mag = NULL; |
326 | slab_magazine_t *mag = NULL; |
329 | link_t *cur; |
327 | link_t *cur; |
330 | 328 | ||
331 | spinlock_lock(&cache->maglock); |
329 | spinlock_lock(&cache->maglock); |
332 | if (!list_empty(&cache->magazines)) { |
330 | if (!list_empty(&cache->magazines)) { |
333 | if (first) |
331 | if (first) |
334 | cur = cache->magazines.next; |
332 | cur = cache->magazines.next; |
335 | else |
333 | else |
336 | cur = cache->magazines.prev; |
334 | cur = cache->magazines.prev; |
337 | mag = list_get_instance(cur, slab_magazine_t, link); |
335 | mag = list_get_instance(cur, slab_magazine_t, link); |
338 | list_remove(&mag->link); |
336 | list_remove(&mag->link); |
339 | atomic_dec(&cache->magazine_counter); |
337 | atomic_dec(&cache->magazine_counter); |
340 | } |
338 | } |
341 | spinlock_unlock(&cache->maglock); |
339 | spinlock_unlock(&cache->maglock); |
342 | return mag; |
340 | return mag; |
343 | } |
341 | } |
344 | 342 | ||
345 | /** Prepend magazine to magazine list in cache */ |
343 | /** Prepend magazine to magazine list in cache */ |
346 | static void put_mag_to_cache(slab_cache_t *cache, slab_magazine_t *mag) |
344 | static void put_mag_to_cache(slab_cache_t *cache, slab_magazine_t *mag) |
347 | { |
345 | { |
348 | spinlock_lock(&cache->maglock); |
346 | spinlock_lock(&cache->maglock); |
349 | 347 | ||
350 | list_prepend(&mag->link, &cache->magazines); |
348 | list_prepend(&mag->link, &cache->magazines); |
351 | atomic_inc(&cache->magazine_counter); |
349 | atomic_inc(&cache->magazine_counter); |
352 | 350 | ||
353 | spinlock_unlock(&cache->maglock); |
351 | spinlock_unlock(&cache->maglock); |
354 | } |
352 | } |
355 | 353 | ||
356 | /** |
354 | /** |
357 | * Free all objects in magazine and free memory associated with magazine |
355 | * Free all objects in magazine and free memory associated with magazine |
358 | * |
356 | * |
359 | * @return Number of freed pages |
357 | * @return Number of freed pages |
360 | */ |
358 | */ |
361 | static count_t magazine_destroy(slab_cache_t *cache, |
359 | static count_t magazine_destroy(slab_cache_t *cache, |
362 | slab_magazine_t *mag) |
360 | slab_magazine_t *mag) |
363 | { |
361 | { |
364 | int i; |
362 | int i; |
365 | count_t frames = 0; |
363 | count_t frames = 0; |
366 | 364 | ||
367 | for (i=0;i < mag->busy; i++) { |
365 | for (i=0;i < mag->busy; i++) { |
368 | frames += slab_obj_destroy(cache, mag->objs[i], NULL); |
366 | frames += slab_obj_destroy(cache, mag->objs[i], NULL); |
369 | atomic_dec(&cache->cached_objs); |
367 | atomic_dec(&cache->cached_objs); |
370 | } |
368 | } |
371 | 369 | ||
372 | slab_free(&mag_cache, mag); |
370 | slab_free(&mag_cache, mag); |
373 | 371 | ||
374 | return frames; |
372 | return frames; |
375 | } |
373 | } |
376 | 374 | ||
377 | /** |
375 | /** |
378 | * Find full magazine, set it as current and return it |
376 | * Find full magazine, set it as current and return it |
379 | * |
377 | * |
380 | * Assume cpu_magazine lock is held |
378 | * Assume cpu_magazine lock is held |
381 | */ |
379 | */ |
382 | static slab_magazine_t * get_full_current_mag(slab_cache_t *cache) |
380 | static slab_magazine_t * get_full_current_mag(slab_cache_t *cache) |
383 | { |
381 | { |
384 | slab_magazine_t *cmag, *lastmag, *newmag; |
382 | slab_magazine_t *cmag, *lastmag, *newmag; |
385 | 383 | ||
386 | cmag = cache->mag_cache[CPU->id].current; |
384 | cmag = cache->mag_cache[CPU->id].current; |
387 | lastmag = cache->mag_cache[CPU->id].last; |
385 | lastmag = cache->mag_cache[CPU->id].last; |
388 | if (cmag) { /* First try local CPU magazines */ |
386 | if (cmag) { /* First try local CPU magazines */ |
389 | if (cmag->busy) |
387 | if (cmag->busy) |
390 | return cmag; |
388 | return cmag; |
391 | 389 | ||
392 | if (lastmag && lastmag->busy) { |
390 | if (lastmag && lastmag->busy) { |
393 | cache->mag_cache[CPU->id].current = lastmag; |
391 | cache->mag_cache[CPU->id].current = lastmag; |
394 | cache->mag_cache[CPU->id].last = cmag; |
392 | cache->mag_cache[CPU->id].last = cmag; |
395 | return lastmag; |
393 | return lastmag; |
396 | } |
394 | } |
397 | } |
395 | } |
398 | /* Local magazines are empty, import one from magazine list */ |
396 | /* Local magazines are empty, import one from magazine list */ |
399 | newmag = get_mag_from_cache(cache, 1); |
397 | newmag = get_mag_from_cache(cache, 1); |
400 | if (!newmag) |
398 | if (!newmag) |
401 | return NULL; |
399 | return NULL; |
402 | 400 | ||
403 | if (lastmag) |
401 | if (lastmag) |
404 | magazine_destroy(cache, lastmag); |
402 | magazine_destroy(cache, lastmag); |
405 | 403 | ||
406 | cache->mag_cache[CPU->id].last = cmag; |
404 | cache->mag_cache[CPU->id].last = cmag; |
407 | cache->mag_cache[CPU->id].current = newmag; |
405 | cache->mag_cache[CPU->id].current = newmag; |
408 | return newmag; |
406 | return newmag; |
409 | } |
407 | } |
410 | 408 | ||
411 | /** |
409 | /** |
412 | * Try to find object in CPU-cache magazines |
410 | * Try to find object in CPU-cache magazines |
413 | * |
411 | * |
414 | * @return Pointer to object or NULL if not available |
412 | * @return Pointer to object or NULL if not available |
415 | */ |
413 | */ |
416 | static void * magazine_obj_get(slab_cache_t *cache) |
414 | static void * magazine_obj_get(slab_cache_t *cache) |
417 | { |
415 | { |
418 | slab_magazine_t *mag; |
416 | slab_magazine_t *mag; |
419 | void *obj; |
417 | void *obj; |
420 | 418 | ||
421 | if (!CPU) |
419 | if (!CPU) |
422 | return NULL; |
420 | return NULL; |
423 | 421 | ||
424 | spinlock_lock(&cache->mag_cache[CPU->id].lock); |
422 | spinlock_lock(&cache->mag_cache[CPU->id].lock); |
425 | 423 | ||
426 | mag = get_full_current_mag(cache); |
424 | mag = get_full_current_mag(cache); |
427 | if (!mag) { |
425 | if (!mag) { |
428 | spinlock_unlock(&cache->mag_cache[CPU->id].lock); |
426 | spinlock_unlock(&cache->mag_cache[CPU->id].lock); |
429 | return NULL; |
427 | return NULL; |
430 | } |
428 | } |
431 | obj = mag->objs[--mag->busy]; |
429 | obj = mag->objs[--mag->busy]; |
432 | spinlock_unlock(&cache->mag_cache[CPU->id].lock); |
430 | spinlock_unlock(&cache->mag_cache[CPU->id].lock); |
433 | atomic_dec(&cache->cached_objs); |
431 | atomic_dec(&cache->cached_objs); |
434 | 432 | ||
435 | return obj; |
433 | return obj; |
436 | } |
434 | } |
437 | 435 | ||
438 | /** |
436 | /** |
439 | * Assure that the current magazine is empty, return pointer to it, or NULL if |
437 | * Assure that the current magazine is empty, return pointer to it, or NULL if |
440 | * no empty magazine is available and cannot be allocated |
438 | * no empty magazine is available and cannot be allocated |
441 | * |
439 | * |
442 | * Assume mag_cache[CPU->id].lock is held |
440 | * Assume mag_cache[CPU->id].lock is held |
443 | * |
441 | * |
444 | * We have 2 magazines bound to processor. |
442 | * We have 2 magazines bound to processor. |
445 | * First try the current. |
443 | * First try the current. |
446 | * If full, try the last. |
444 | * If full, try the last. |
447 | * If full, put to magazines list. |
445 | * If full, put to magazines list. |
448 | * allocate new, exchange last & current |
446 | * allocate new, exchange last & current |
449 | * |
447 | * |
450 | */ |
448 | */ |
451 | static slab_magazine_t * make_empty_current_mag(slab_cache_t *cache) |
449 | static slab_magazine_t * make_empty_current_mag(slab_cache_t *cache) |
452 | { |
450 | { |
453 | slab_magazine_t *cmag,*lastmag,*newmag; |
451 | slab_magazine_t *cmag,*lastmag,*newmag; |
454 | 452 | ||
455 | cmag = cache->mag_cache[CPU->id].current; |
453 | cmag = cache->mag_cache[CPU->id].current; |
456 | lastmag = cache->mag_cache[CPU->id].last; |
454 | lastmag = cache->mag_cache[CPU->id].last; |
457 | 455 | ||
458 | if (cmag) { |
456 | if (cmag) { |
459 | if (cmag->busy < cmag->size) |
457 | if (cmag->busy < cmag->size) |
460 | return cmag; |
458 | return cmag; |
461 | if (lastmag && lastmag->busy < lastmag->size) { |
459 | if (lastmag && lastmag->busy < lastmag->size) { |
462 | cache->mag_cache[CPU->id].last = cmag; |
460 | cache->mag_cache[CPU->id].last = cmag; |
463 | cache->mag_cache[CPU->id].current = lastmag; |
461 | cache->mag_cache[CPU->id].current = lastmag; |
464 | return lastmag; |
462 | return lastmag; |
465 | } |
463 | } |
466 | } |
464 | } |
467 | /* current | last are full | nonexistent, allocate new */ |
465 | /* current | last are full | nonexistent, allocate new */ |
468 | /* We do not want to sleep just because of caching */ |
466 | /* We do not want to sleep just because of caching */ |
469 | /* Especially we do not want reclaiming to start, as |
467 | /* Especially we do not want reclaiming to start, as |
470 | * this would deadlock */ |
468 | * this would deadlock */ |
471 | newmag = slab_alloc(&mag_cache, FRAME_ATOMIC | FRAME_NO_RECLAIM); |
469 | newmag = slab_alloc(&mag_cache, FRAME_ATOMIC | FRAME_NO_RECLAIM); |
472 | if (!newmag) |
470 | if (!newmag) |
473 | return NULL; |
471 | return NULL; |
474 | newmag->size = SLAB_MAG_SIZE; |
472 | newmag->size = SLAB_MAG_SIZE; |
475 | newmag->busy = 0; |
473 | newmag->busy = 0; |
476 | 474 | ||
477 | /* Flush last to magazine list */ |
475 | /* Flush last to magazine list */ |
478 | if (lastmag) |
476 | if (lastmag) |
479 | put_mag_to_cache(cache, lastmag); |
477 | put_mag_to_cache(cache, lastmag); |
480 | 478 | ||
481 | /* Move current as last, save new as current */ |
479 | /* Move current as last, save new as current */ |
482 | cache->mag_cache[CPU->id].last = cmag; |
480 | cache->mag_cache[CPU->id].last = cmag; |
483 | cache->mag_cache[CPU->id].current = newmag; |
481 | cache->mag_cache[CPU->id].current = newmag; |
484 | 482 | ||
485 | return newmag; |
483 | return newmag; |
486 | } |
484 | } |
487 | 485 | ||
488 | /** |
486 | /** |
489 | * Put object into CPU-cache magazine |
487 | * Put object into CPU-cache magazine |
490 | * |
488 | * |
491 | * @return 0 - success, -1 - could not get memory |
489 | * @return 0 - success, -1 - could not get memory |
492 | */ |
490 | */ |
493 | static int magazine_obj_put(slab_cache_t *cache, void *obj) |
491 | static int magazine_obj_put(slab_cache_t *cache, void *obj) |
494 | { |
492 | { |
495 | slab_magazine_t *mag; |
493 | slab_magazine_t *mag; |
496 | 494 | ||
497 | if (!CPU) |
495 | if (!CPU) |
498 | return -1; |
496 | return -1; |
499 | 497 | ||
500 | spinlock_lock(&cache->mag_cache[CPU->id].lock); |
498 | spinlock_lock(&cache->mag_cache[CPU->id].lock); |
501 | 499 | ||
502 | mag = make_empty_current_mag(cache); |
500 | mag = make_empty_current_mag(cache); |
503 | if (!mag) { |
501 | if (!mag) { |
504 | spinlock_unlock(&cache->mag_cache[CPU->id].lock); |
502 | spinlock_unlock(&cache->mag_cache[CPU->id].lock); |
505 | return -1; |
503 | return -1; |
506 | } |
504 | } |
507 | 505 | ||
508 | mag->objs[mag->busy++] = obj; |
506 | mag->objs[mag->busy++] = obj; |
509 | 507 | ||
510 | spinlock_unlock(&cache->mag_cache[CPU->id].lock); |
508 | spinlock_unlock(&cache->mag_cache[CPU->id].lock); |
511 | atomic_inc(&cache->cached_objs); |
509 | atomic_inc(&cache->cached_objs); |
512 | return 0; |
510 | return 0; |
513 | } |
511 | } |
514 | 512 | ||
515 | 513 | ||
516 | /**************************************/ |
514 | /**************************************/ |
517 | /* Slab cache functions */ |
515 | /* Slab cache functions */ |
518 | 516 | ||
519 | /** Return number of objects that fit in certain cache size */ |
517 | /** Return number of objects that fit in certain cache size */ |
520 | static int comp_objects(slab_cache_t *cache) |
518 | static int comp_objects(slab_cache_t *cache) |
521 | { |
519 | { |
522 | if (cache->flags & SLAB_CACHE_SLINSIDE) |
520 | if (cache->flags & SLAB_CACHE_SLINSIDE) |
523 | return ((PAGE_SIZE << cache->order) - sizeof(slab_t)) / cache->size; |
521 | return ((PAGE_SIZE << cache->order) - sizeof(slab_t)) / cache->size; |
524 | else |
522 | else |
525 | return (PAGE_SIZE << cache->order) / cache->size; |
523 | return (PAGE_SIZE << cache->order) / cache->size; |
526 | } |
524 | } |
527 | 525 | ||
528 | /** Return wasted space in slab */ |
526 | /** Return wasted space in slab */ |
529 | static int badness(slab_cache_t *cache) |
527 | static int badness(slab_cache_t *cache) |
530 | { |
528 | { |
531 | int objects; |
529 | int objects; |
532 | int ssize; |
530 | int ssize; |
533 | 531 | ||
534 | objects = comp_objects(cache); |
532 | objects = comp_objects(cache); |
535 | ssize = PAGE_SIZE << cache->order; |
533 | ssize = PAGE_SIZE << cache->order; |
536 | if (cache->flags & SLAB_CACHE_SLINSIDE) |
534 | if (cache->flags & SLAB_CACHE_SLINSIDE) |
537 | ssize -= sizeof(slab_t); |
535 | ssize -= sizeof(slab_t); |
538 | return ssize - objects*cache->size; |
536 | return ssize - objects*cache->size; |
539 | } |
537 | } |
540 | 538 | ||
541 | /** |
539 | /** |
542 | * Initialize mag_cache structure in slab cache |
540 | * Initialize mag_cache structure in slab cache |
543 | */ |
541 | */ |
544 | static void make_magcache(slab_cache_t *cache) |
542 | static void make_magcache(slab_cache_t *cache) |
545 | { |
543 | { |
546 | int i; |
544 | int i; |
547 | 545 | ||
548 | ASSERT(_slab_initialized >= 2); |
546 | ASSERT(_slab_initialized >= 2); |
549 | 547 | ||
550 | cache->mag_cache = malloc(sizeof(slab_mag_cache_t)*config.cpu_count,0); |
548 | cache->mag_cache = malloc(sizeof(slab_mag_cache_t)*config.cpu_count,0); |
551 | for (i=0; i < config.cpu_count; i++) { |
549 | for (i=0; i < config.cpu_count; i++) { |
552 | memsetb((uintptr_t)&cache->mag_cache[i], |
550 | memsetb((uintptr_t)&cache->mag_cache[i], |
553 | sizeof(cache->mag_cache[i]), 0); |
551 | sizeof(cache->mag_cache[i]), 0); |
554 | spinlock_initialize(&cache->mag_cache[i].lock, |
552 | spinlock_initialize(&cache->mag_cache[i].lock, |
555 | "slab_maglock_cpu"); |
553 | "slab_maglock_cpu"); |
556 | } |
554 | } |
557 | } |
555 | } |
558 | 556 | ||
559 | /** Initialize allocated memory as a slab cache */ |
557 | /** Initialize allocated memory as a slab cache */ |
560 | static void |
558 | static void |
561 | _slab_cache_create(slab_cache_t *cache, |
559 | _slab_cache_create(slab_cache_t *cache, |
562 | char *name, |
560 | char *name, |
563 | size_t size, |
561 | size_t size, |
564 | size_t align, |
562 | size_t align, |
565 | int (*constructor)(void *obj, int kmflag), |
563 | int (*constructor)(void *obj, int kmflag), |
566 | int (*destructor)(void *obj), |
564 | int (*destructor)(void *obj), |
567 | int flags) |
565 | int flags) |
568 | { |
566 | { |
569 | int pages; |
567 | int pages; |
570 | ipl_t ipl; |
568 | ipl_t ipl; |
571 | 569 | ||
572 | memsetb((uintptr_t)cache, sizeof(*cache), 0); |
570 | memsetb((uintptr_t)cache, sizeof(*cache), 0); |
573 | cache->name = name; |
571 | cache->name = name; |
574 | 572 | ||
575 | if (align < sizeof(unative_t)) |
573 | if (align < sizeof(unative_t)) |
576 | align = sizeof(unative_t); |
574 | align = sizeof(unative_t); |
577 | size = ALIGN_UP(size, align); |
575 | size = ALIGN_UP(size, align); |
578 | 576 | ||
579 | cache->size = size; |
577 | cache->size = size; |
580 | 578 | ||
581 | cache->constructor = constructor; |
579 | cache->constructor = constructor; |
582 | cache->destructor = destructor; |
580 | cache->destructor = destructor; |
583 | cache->flags = flags; |
581 | cache->flags = flags; |
584 | 582 | ||
585 | list_initialize(&cache->full_slabs); |
583 | list_initialize(&cache->full_slabs); |
586 | list_initialize(&cache->partial_slabs); |
584 | list_initialize(&cache->partial_slabs); |
587 | list_initialize(&cache->magazines); |
585 | list_initialize(&cache->magazines); |
588 | spinlock_initialize(&cache->slablock, "slab_lock"); |
586 | spinlock_initialize(&cache->slablock, "slab_lock"); |
589 | spinlock_initialize(&cache->maglock, "slab_maglock"); |
587 | spinlock_initialize(&cache->maglock, "slab_maglock"); |
590 | if (! (cache->flags & SLAB_CACHE_NOMAGAZINE)) |
588 | if (! (cache->flags & SLAB_CACHE_NOMAGAZINE)) |
591 | make_magcache(cache); |
589 | make_magcache(cache); |
592 | 590 | ||
593 | /* Compute slab sizes, object counts in slabs etc. */ |
591 | /* Compute slab sizes, object counts in slabs etc. */ |
594 | if (cache->size < SLAB_INSIDE_SIZE) |
592 | if (cache->size < SLAB_INSIDE_SIZE) |
595 | cache->flags |= SLAB_CACHE_SLINSIDE; |
593 | cache->flags |= SLAB_CACHE_SLINSIDE; |
596 | 594 | ||
597 | /* Minimum slab order */ |
595 | /* Minimum slab order */ |
598 | pages = SIZE2FRAMES(cache->size); |
596 | pages = SIZE2FRAMES(cache->size); |
599 | /* We need the 2^order >= pages */ |
597 | /* We need the 2^order >= pages */ |
600 | if (pages == 1) |
598 | if (pages == 1) |
601 | cache->order = 0; |
599 | cache->order = 0; |
602 | else |
600 | else |
603 | cache->order = fnzb(pages-1)+1; |
601 | cache->order = fnzb(pages-1)+1; |
604 | 602 | ||
605 | while (badness(cache) > SLAB_MAX_BADNESS(cache)) { |
603 | while (badness(cache) > SLAB_MAX_BADNESS(cache)) { |
606 | cache->order += 1; |
604 | cache->order += 1; |
607 | } |
605 | } |
608 | cache->objects = comp_objects(cache); |
606 | cache->objects = comp_objects(cache); |
609 | /* If info fits in, put it inside */ |
607 | /* If info fits in, put it inside */ |
610 | if (badness(cache) > sizeof(slab_t)) |
608 | if (badness(cache) > sizeof(slab_t)) |
611 | cache->flags |= SLAB_CACHE_SLINSIDE; |
609 | cache->flags |= SLAB_CACHE_SLINSIDE; |
612 | 610 | ||
613 | /* Add cache to cache list */ |
611 | /* Add cache to cache list */ |
614 | ipl = interrupts_disable(); |
612 | ipl = interrupts_disable(); |
615 | spinlock_lock(&slab_cache_lock); |
613 | spinlock_lock(&slab_cache_lock); |
616 | 614 | ||
617 | list_append(&cache->link, &slab_cache_list); |
615 | list_append(&cache->link, &slab_cache_list); |
618 | 616 | ||
619 | spinlock_unlock(&slab_cache_lock); |
617 | spinlock_unlock(&slab_cache_lock); |
620 | interrupts_restore(ipl); |
618 | interrupts_restore(ipl); |
621 | } |
619 | } |
622 | 620 | ||
623 | /** Create slab cache */ |
621 | /** Create slab cache */ |
624 | slab_cache_t * slab_cache_create(char *name, |
622 | slab_cache_t * slab_cache_create(char *name, |
625 | size_t size, |
623 | size_t size, |
626 | size_t align, |
624 | size_t align, |
627 | int (*constructor)(void *obj, int kmflag), |
625 | int (*constructor)(void *obj, int kmflag), |
628 | int (*destructor)(void *obj), |
626 | int (*destructor)(void *obj), |
629 | int flags) |
627 | int flags) |
630 | { |
628 | { |
631 | slab_cache_t *cache; |
629 | slab_cache_t *cache; |
632 | 630 | ||
633 | cache = slab_alloc(&slab_cache_cache, 0); |
631 | cache = slab_alloc(&slab_cache_cache, 0); |
634 | _slab_cache_create(cache, name, size, align, constructor, destructor, |
632 | _slab_cache_create(cache, name, size, align, constructor, destructor, |
635 | flags); |
633 | flags); |
636 | return cache; |
634 | return cache; |
637 | } |
635 | } |
638 | 636 | ||
639 | /** |
637 | /** |
640 | * Reclaim space occupied by objects that are already free |
638 | * Reclaim space occupied by objects that are already free |
641 | * |
639 | * |
642 | * @param flags If contains SLAB_RECLAIM_ALL, do aggressive freeing |
640 | * @param flags If contains SLAB_RECLAIM_ALL, do aggressive freeing |
643 | * @return Number of freed pages |
641 | * @return Number of freed pages |
644 | */ |
642 | */ |
645 | static count_t _slab_reclaim(slab_cache_t *cache, int flags) |
643 | static count_t _slab_reclaim(slab_cache_t *cache, int flags) |
646 | { |
644 | { |
647 | int i; |
645 | int i; |
648 | slab_magazine_t *mag; |
646 | slab_magazine_t *mag; |
649 | count_t frames = 0; |
647 | count_t frames = 0; |
650 | int magcount; |
648 | int magcount; |
651 | 649 | ||
652 | if (cache->flags & SLAB_CACHE_NOMAGAZINE) |
650 | if (cache->flags & SLAB_CACHE_NOMAGAZINE) |
653 | return 0; /* Nothing to do */ |
651 | return 0; /* Nothing to do */ |
654 | 652 | ||
655 | /* We count up to original magazine count to avoid |
653 | /* We count up to original magazine count to avoid |
656 | * endless loop |
654 | * endless loop |
657 | */ |
655 | */ |
658 | magcount = atomic_get(&cache->magazine_counter); |
656 | magcount = atomic_get(&cache->magazine_counter); |
659 | while (magcount-- && (mag=get_mag_from_cache(cache,0))) { |
657 | while (magcount-- && (mag=get_mag_from_cache(cache,0))) { |
660 | frames += magazine_destroy(cache,mag); |
658 | frames += magazine_destroy(cache,mag); |
661 | if (!(flags & SLAB_RECLAIM_ALL) && frames) |
659 | if (!(flags & SLAB_RECLAIM_ALL) && frames) |
662 | break; |
660 | break; |
663 | } |
661 | } |
664 | 662 | ||
665 | if (flags & SLAB_RECLAIM_ALL) { |
663 | if (flags & SLAB_RECLAIM_ALL) { |
666 | /* Free cpu-bound magazines */ |
664 | /* Free cpu-bound magazines */ |
667 | /* Destroy CPU magazines */ |
665 | /* Destroy CPU magazines */ |
668 | for (i=0; i<config.cpu_count; i++) { |
666 | for (i=0; i<config.cpu_count; i++) { |
669 | spinlock_lock(&cache->mag_cache[i].lock); |
667 | spinlock_lock(&cache->mag_cache[i].lock); |
670 | 668 | ||
671 | mag = cache->mag_cache[i].current; |
669 | mag = cache->mag_cache[i].current; |
672 | if (mag) |
670 | if (mag) |
673 | frames += magazine_destroy(cache, mag); |
671 | frames += magazine_destroy(cache, mag); |
674 | cache->mag_cache[i].current = NULL; |
672 | cache->mag_cache[i].current = NULL; |
675 | 673 | ||
676 | mag = cache->mag_cache[i].last; |
674 | mag = cache->mag_cache[i].last; |
677 | if (mag) |
675 | if (mag) |
678 | frames += magazine_destroy(cache, mag); |
676 | frames += magazine_destroy(cache, mag); |
679 | cache->mag_cache[i].last = NULL; |
677 | cache->mag_cache[i].last = NULL; |
680 | 678 | ||
681 | spinlock_unlock(&cache->mag_cache[i].lock); |
679 | spinlock_unlock(&cache->mag_cache[i].lock); |
682 | } |
680 | } |
683 | } |
681 | } |
684 | 682 | ||
685 | return frames; |
683 | return frames; |
686 | } |
684 | } |
687 | 685 | ||
688 | /** Check that there are no slabs and remove cache from system */ |
686 | /** Check that there are no slabs and remove cache from system */ |
689 | void slab_cache_destroy(slab_cache_t *cache) |
687 | void slab_cache_destroy(slab_cache_t *cache) |
690 | { |
688 | { |
691 | ipl_t ipl; |
689 | ipl_t ipl; |
692 | 690 | ||
693 | /* First remove cache from link, so that we don't need |
691 | /* First remove cache from link, so that we don't need |
694 | * to disable interrupts later |
692 | * to disable interrupts later |
695 | */ |
693 | */ |
696 | 694 | ||
697 | ipl = interrupts_disable(); |
695 | ipl = interrupts_disable(); |
698 | spinlock_lock(&slab_cache_lock); |
696 | spinlock_lock(&slab_cache_lock); |
699 | 697 | ||
700 | list_remove(&cache->link); |
698 | list_remove(&cache->link); |
701 | 699 | ||
702 | spinlock_unlock(&slab_cache_lock); |
700 | spinlock_unlock(&slab_cache_lock); |
703 | interrupts_restore(ipl); |
701 | interrupts_restore(ipl); |
704 | 702 | ||
705 | /* Do not lock anything, we assume the software is correct and |
703 | /* Do not lock anything, we assume the software is correct and |
706 | * does not touch the cache when it decides to destroy it */ |
704 | * does not touch the cache when it decides to destroy it */ |
707 | 705 | ||
708 | /* Destroy all magazines */ |
706 | /* Destroy all magazines */ |
709 | _slab_reclaim(cache, SLAB_RECLAIM_ALL); |
707 | _slab_reclaim(cache, SLAB_RECLAIM_ALL); |
710 | 708 | ||
711 | /* All slabs must be empty */ |
709 | /* All slabs must be empty */ |
712 | if (!list_empty(&cache->full_slabs) \ |
710 | if (!list_empty(&cache->full_slabs) \ |
713 | || !list_empty(&cache->partial_slabs)) |
711 | || !list_empty(&cache->partial_slabs)) |
714 | panic("Destroying cache that is not empty."); |
712 | panic("Destroying cache that is not empty."); |
715 | 713 | ||
716 | if (!(cache->flags & SLAB_CACHE_NOMAGAZINE)) |
714 | if (!(cache->flags & SLAB_CACHE_NOMAGAZINE)) |
717 | free(cache->mag_cache); |
715 | free(cache->mag_cache); |
718 | slab_free(&slab_cache_cache, cache); |
716 | slab_free(&slab_cache_cache, cache); |
719 | } |
717 | } |
720 | 718 | ||
721 | /** Allocate new object from cache - if no flags given, always returns |
719 | /** Allocate new object from cache - if no flags given, always returns |
722 | memory */ |
720 | memory */ |
723 | void * slab_alloc(slab_cache_t *cache, int flags) |
721 | void * slab_alloc(slab_cache_t *cache, int flags) |
724 | { |
722 | { |
725 | ipl_t ipl; |
723 | ipl_t ipl; |
726 | void *result = NULL; |
724 | void *result = NULL; |
727 | 725 | ||
728 | /* Disable interrupts to avoid deadlocks with interrupt handlers */ |
726 | /* Disable interrupts to avoid deadlocks with interrupt handlers */ |
729 | ipl = interrupts_disable(); |
727 | ipl = interrupts_disable(); |
730 | 728 | ||
731 | if (!(cache->flags & SLAB_CACHE_NOMAGAZINE)) { |
729 | if (!(cache->flags & SLAB_CACHE_NOMAGAZINE)) { |
732 | result = magazine_obj_get(cache); |
730 | result = magazine_obj_get(cache); |
733 | } |
731 | } |
734 | if (!result) |
732 | if (!result) |
735 | result = slab_obj_create(cache, flags); |
733 | result = slab_obj_create(cache, flags); |
736 | 734 | ||
737 | interrupts_restore(ipl); |
735 | interrupts_restore(ipl); |
738 | 736 | ||
739 | if (result) |
737 | if (result) |
740 | atomic_inc(&cache->allocated_objs); |
738 | atomic_inc(&cache->allocated_objs); |
741 | 739 | ||
742 | return result; |
740 | return result; |
743 | } |
741 | } |
744 | 742 | ||
745 | /** Return object to cache, use slab if known */ |
743 | /** Return object to cache, use slab if known */ |
746 | static void _slab_free(slab_cache_t *cache, void *obj, slab_t *slab) |
744 | static void _slab_free(slab_cache_t *cache, void *obj, slab_t *slab) |
747 | { |
745 | { |
748 | ipl_t ipl; |
746 | ipl_t ipl; |
749 | 747 | ||
750 | ipl = interrupts_disable(); |
748 | ipl = interrupts_disable(); |
751 | 749 | ||
752 | if ((cache->flags & SLAB_CACHE_NOMAGAZINE) \ |
750 | if ((cache->flags & SLAB_CACHE_NOMAGAZINE) \ |
753 | || magazine_obj_put(cache, obj)) { |
751 | || magazine_obj_put(cache, obj)) { |
754 | 752 | ||
755 | slab_obj_destroy(cache, obj, slab); |
753 | slab_obj_destroy(cache, obj, slab); |
756 | 754 | ||
757 | } |
755 | } |
758 | interrupts_restore(ipl); |
756 | interrupts_restore(ipl); |
759 | atomic_dec(&cache->allocated_objs); |
757 | atomic_dec(&cache->allocated_objs); |
760 | } |
758 | } |
761 | 759 | ||
762 | /** Return slab object to cache */ |
760 | /** Return slab object to cache */ |
763 | void slab_free(slab_cache_t *cache, void *obj) |
761 | void slab_free(slab_cache_t *cache, void *obj) |
764 | { |
762 | { |
765 | _slab_free(cache,obj,NULL); |
763 | _slab_free(cache,obj,NULL); |
766 | } |
764 | } |
767 | 765 | ||
768 | /* Go through all caches and reclaim what is possible */ |
766 | /* Go through all caches and reclaim what is possible */ |
769 | count_t slab_reclaim(int flags) |
767 | count_t slab_reclaim(int flags) |
770 | { |
768 | { |
771 | slab_cache_t *cache; |
769 | slab_cache_t *cache; |
772 | link_t *cur; |
770 | link_t *cur; |
773 | count_t frames = 0; |
771 | count_t frames = 0; |
774 | 772 | ||
775 | spinlock_lock(&slab_cache_lock); |
773 | spinlock_lock(&slab_cache_lock); |
776 | 774 | ||
777 | /* TODO: Add assert, that interrupts are disabled, otherwise |
775 | /* TODO: Add assert, that interrupts are disabled, otherwise |
778 | * memory allocation from interrupts can deadlock. |
776 | * memory allocation from interrupts can deadlock. |
779 | */ |
777 | */ |
780 | 778 | ||
781 | for (cur = slab_cache_list.next;cur!=&slab_cache_list; cur=cur->next) { |
779 | for (cur = slab_cache_list.next;cur!=&slab_cache_list; cur=cur->next) { |
782 | cache = list_get_instance(cur, slab_cache_t, link); |
780 | cache = list_get_instance(cur, slab_cache_t, link); |
783 | frames += _slab_reclaim(cache, flags); |
781 | frames += _slab_reclaim(cache, flags); |
784 | } |
782 | } |
785 | 783 | ||
786 | spinlock_unlock(&slab_cache_lock); |
784 | spinlock_unlock(&slab_cache_lock); |
787 | 785 | ||
788 | return frames; |
786 | return frames; |
789 | } |
787 | } |
790 | 788 | ||
791 | 789 | ||
792 | /* Print list of slabs */ |
790 | /* Print list of slabs */ |
793 | void slab_print_list(void) |
791 | void slab_print_list(void) |
794 | { |
792 | { |
795 | slab_cache_t *cache; |
793 | slab_cache_t *cache; |
796 | link_t *cur; |
794 | link_t *cur; |
797 | ipl_t ipl; |
795 | ipl_t ipl; |
798 | 796 | ||
799 | ipl = interrupts_disable(); |
797 | ipl = interrupts_disable(); |
800 | spinlock_lock(&slab_cache_lock); |
798 | spinlock_lock(&slab_cache_lock); |
801 | printf("slab name\t Osize\t Pages\t Obj/pg\t Slabs\t Cached\tAllocobjs\tCtl\n"); |
799 | printf("slab name\t Osize\t Pages\t Obj/pg\t Slabs\t Cached\tAllocobjs\tCtl\n"); |
802 | for (cur = slab_cache_list.next;cur!=&slab_cache_list; cur=cur->next) { |
800 | for (cur = slab_cache_list.next;cur!=&slab_cache_list; cur=cur->next) { |
803 | cache = list_get_instance(cur, slab_cache_t, link); |
801 | cache = list_get_instance(cur, slab_cache_t, link); |
804 | printf("%s\t%7zd\t%7zd\t%7zd\t%7zd\t%7zd\t%7zd\t\t%s\n", cache->name, cache->size, |
802 | printf("%s\t%7zd\t%7zd\t%7zd\t%7zd\t%7zd\t%7zd\t\t%s\n", cache->name, cache->size, |
805 | (1 << cache->order), cache->objects, |
803 | (1 << cache->order), cache->objects, |
806 | atomic_get(&cache->allocated_slabs), |
804 | atomic_get(&cache->allocated_slabs), |
807 | atomic_get(&cache->cached_objs), |
805 | atomic_get(&cache->cached_objs), |
808 | atomic_get(&cache->allocated_objs), |
806 | atomic_get(&cache->allocated_objs), |
809 | cache->flags & SLAB_CACHE_SLINSIDE ? "In" : "Out"); |
807 | cache->flags & SLAB_CACHE_SLINSIDE ? "In" : "Out"); |
810 | } |
808 | } |
811 | spinlock_unlock(&slab_cache_lock); |
809 | spinlock_unlock(&slab_cache_lock); |
812 | interrupts_restore(ipl); |
810 | interrupts_restore(ipl); |
813 | } |
811 | } |
814 | 812 | ||
815 | void slab_cache_init(void) |
813 | void slab_cache_init(void) |
816 | { |
814 | { |
817 | int i, size; |
815 | int i, size; |
818 | 816 | ||
819 | /* Initialize magazine cache */ |
817 | /* Initialize magazine cache */ |
820 | _slab_cache_create(&mag_cache, |
818 | _slab_cache_create(&mag_cache, |
821 | "slab_magazine", |
819 | "slab_magazine", |
822 | sizeof(slab_magazine_t)+SLAB_MAG_SIZE*sizeof(void*), |
820 | sizeof(slab_magazine_t)+SLAB_MAG_SIZE*sizeof(void*), |
823 | sizeof(uintptr_t), |
821 | sizeof(uintptr_t), |
824 | NULL, NULL, |
822 | NULL, NULL, |
825 | SLAB_CACHE_NOMAGAZINE | SLAB_CACHE_SLINSIDE); |
823 | SLAB_CACHE_NOMAGAZINE | SLAB_CACHE_SLINSIDE); |
826 | /* Initialize slab_cache cache */ |
824 | /* Initialize slab_cache cache */ |
827 | _slab_cache_create(&slab_cache_cache, |
825 | _slab_cache_create(&slab_cache_cache, |
828 | "slab_cache", |
826 | "slab_cache", |
829 | sizeof(slab_cache_cache), |
827 | sizeof(slab_cache_cache), |
830 | sizeof(uintptr_t), |
828 | sizeof(uintptr_t), |
831 | NULL, NULL, |
829 | NULL, NULL, |
832 | SLAB_CACHE_NOMAGAZINE | SLAB_CACHE_SLINSIDE); |
830 | SLAB_CACHE_NOMAGAZINE | SLAB_CACHE_SLINSIDE); |
833 | /* Initialize external slab cache */ |
831 | /* Initialize external slab cache */ |
834 | slab_extern_cache = slab_cache_create("slab_extern", |
832 | slab_extern_cache = slab_cache_create("slab_extern", |
835 | sizeof(slab_t), |
833 | sizeof(slab_t), |
836 | 0, NULL, NULL, |
834 | 0, NULL, NULL, |
837 | SLAB_CACHE_SLINSIDE | SLAB_CACHE_MAGDEFERRED); |
835 | SLAB_CACHE_SLINSIDE | SLAB_CACHE_MAGDEFERRED); |
838 | 836 | ||
839 | /* Initialize structures for malloc */ |
837 | /* Initialize structures for malloc */ |
840 | for (i=0, size=(1<<SLAB_MIN_MALLOC_W); |
838 | for (i=0, size=(1<<SLAB_MIN_MALLOC_W); |
841 | i < (SLAB_MAX_MALLOC_W-SLAB_MIN_MALLOC_W+1); |
839 | i < (SLAB_MAX_MALLOC_W-SLAB_MIN_MALLOC_W+1); |
842 | i++, size <<= 1) { |
840 | i++, size <<= 1) { |
843 | malloc_caches[i] = slab_cache_create(malloc_names[i], |
841 | malloc_caches[i] = slab_cache_create(malloc_names[i], |
844 | size, 0, |
842 | size, 0, |
845 | NULL,NULL, SLAB_CACHE_MAGDEFERRED); |
843 | NULL,NULL, SLAB_CACHE_MAGDEFERRED); |
846 | } |
844 | } |
847 | #ifdef CONFIG_DEBUG |
845 | #ifdef CONFIG_DEBUG |
848 | _slab_initialized = 1; |
846 | _slab_initialized = 1; |
849 | #endif |
847 | #endif |
850 | } |
848 | } |
851 | 849 | ||
852 | /** Enable cpu_cache |
850 | /** Enable cpu_cache |
853 | * |
851 | * |
854 | * Kernel calls this function, when it knows the real number of |
852 | * Kernel calls this function, when it knows the real number of |
855 | * processors. |
853 | * processors. |
856 | * Allocate slab for cpucache and enable it on all existing |
854 | * Allocate slab for cpucache and enable it on all existing |
857 | * slabs that are SLAB_CACHE_MAGDEFERRED |
855 | * slabs that are SLAB_CACHE_MAGDEFERRED |
858 | */ |
856 | */ |
859 | void slab_enable_cpucache(void) |
857 | void slab_enable_cpucache(void) |
860 | { |
858 | { |
861 | link_t *cur; |
859 | link_t *cur; |
862 | slab_cache_t *s; |
860 | slab_cache_t *s; |
863 | 861 | ||
864 | #ifdef CONFIG_DEBUG |
862 | #ifdef CONFIG_DEBUG |
865 | _slab_initialized = 2; |
863 | _slab_initialized = 2; |
866 | #endif |
864 | #endif |
867 | 865 | ||
868 | spinlock_lock(&slab_cache_lock); |
866 | spinlock_lock(&slab_cache_lock); |
869 | 867 | ||
870 | for (cur=slab_cache_list.next; cur != &slab_cache_list;cur=cur->next){ |
868 | for (cur=slab_cache_list.next; cur != &slab_cache_list;cur=cur->next){ |
871 | s = list_get_instance(cur, slab_cache_t, link); |
869 | s = list_get_instance(cur, slab_cache_t, link); |
872 | if ((s->flags & SLAB_CACHE_MAGDEFERRED) != SLAB_CACHE_MAGDEFERRED) |
870 | if ((s->flags & SLAB_CACHE_MAGDEFERRED) != SLAB_CACHE_MAGDEFERRED) |
873 | continue; |
871 | continue; |
874 | make_magcache(s); |
872 | make_magcache(s); |
875 | s->flags &= ~SLAB_CACHE_MAGDEFERRED; |
873 | s->flags &= ~SLAB_CACHE_MAGDEFERRED; |
876 | } |
874 | } |
877 | 875 | ||
878 | spinlock_unlock(&slab_cache_lock); |
876 | spinlock_unlock(&slab_cache_lock); |
879 | } |
877 | } |
880 | 878 | ||
881 | /**************************************/ |
879 | /**************************************/ |
882 | /* kalloc/kfree functions */ |
880 | /* kalloc/kfree functions */ |
883 | void * malloc(unsigned int size, int flags) |
881 | void * malloc(unsigned int size, int flags) |
884 | { |
882 | { |
885 | int idx; |
883 | int idx; |
886 | 884 | ||
887 | ASSERT(_slab_initialized); |
885 | ASSERT(_slab_initialized); |
888 | ASSERT(size && size <= (1 << SLAB_MAX_MALLOC_W)); |
886 | ASSERT(size && size <= (1 << SLAB_MAX_MALLOC_W)); |
889 | 887 | ||
890 | if (size < (1 << SLAB_MIN_MALLOC_W)) |
888 | if (size < (1 << SLAB_MIN_MALLOC_W)) |
891 | size = (1 << SLAB_MIN_MALLOC_W); |
889 | size = (1 << SLAB_MIN_MALLOC_W); |
892 | 890 | ||
893 | idx = fnzb(size-1) - SLAB_MIN_MALLOC_W + 1; |
891 | idx = fnzb(size-1) - SLAB_MIN_MALLOC_W + 1; |
894 | 892 | ||
895 | return slab_alloc(malloc_caches[idx], flags); |
893 | return slab_alloc(malloc_caches[idx], flags); |
896 | } |
894 | } |
897 | 895 | ||
898 | void free(void *obj) |
896 | void free(void *obj) |
899 | { |
897 | { |
900 | slab_t *slab; |
898 | slab_t *slab; |
901 | 899 | ||
902 | if (!obj) return; |
900 | if (!obj) |
- | 901 | return; |
|
903 | 902 | ||
904 | slab = obj2slab(obj); |
903 | slab = obj2slab(obj); |
905 | _slab_free(slab->cache, obj, slab); |
904 | _slab_free(slab->cache, obj, slab); |
906 | } |
905 | } |
907 | 906 | ||
908 | /** @} |
907 | /** @} |
909 | */ |
908 | */ |
910 | 909 |