Rev 764 | Rev 766 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 764 | Rev 765 | ||
---|---|---|---|
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 | #include <synch/spinlock.h> |
29 | #include <synch/spinlock.h> |
30 | #include <mm/slab.h> |
30 | #include <mm/slab.h> |
31 | #include <list.h> |
31 | #include <list.h> |
32 | #include <memstr.h> |
32 | #include <memstr.h> |
33 | #include <align.h> |
33 | #include <align.h> |
34 | #include <mm/heap.h> |
34 | #include <mm/heap.h> |
35 | #include <mm/frame.h> |
35 | #include <mm/frame.h> |
36 | #include <config.h> |
36 | #include <config.h> |
37 | #include <print.h> |
37 | #include <print.h> |
38 | #include <arch.h> |
38 | #include <arch.h> |
39 | #include <panic.h> |
39 | #include <panic.h> |
40 | #include <debug.h> |
40 | #include <debug.h> |
41 | 41 | ||
42 | SPINLOCK_INITIALIZE(slab_cache_lock); |
42 | SPINLOCK_INITIALIZE(slab_cache_lock); |
43 | LIST_INITIALIZE(slab_cache_list); |
43 | LIST_INITIALIZE(slab_cache_list); |
44 | 44 | ||
45 | slab_cache_t mag_cache; |
45 | slab_cache_t mag_cache; |
46 | 46 | ||
47 | 47 | ||
48 | typedef struct { |
48 | typedef struct { |
49 | slab_cache_t *cache; /**< Pointer to parent cache */ |
49 | slab_cache_t *cache; /**< Pointer to parent cache */ |
50 | link_t link; /* List of full/partial slabs */ |
50 | link_t link; /* List of full/partial slabs */ |
51 | void *start; /**< Start address of first available item */ |
51 | void *start; /**< Start address of first available item */ |
52 | count_t available; /**< Count of available items in this slab */ |
52 | count_t available; /**< Count of available items in this slab */ |
53 | index_t nextavail; /**< The index of next available item */ |
53 | index_t nextavail; /**< The index of next available item */ |
54 | }slab_t; |
54 | }slab_t; |
55 | 55 | ||
56 | /**************************************/ |
56 | /**************************************/ |
57 | /* SLAB allocation functions */ |
57 | /* SLAB allocation functions */ |
58 | 58 | ||
59 | /** |
59 | /** |
60 | * Allocate frames for slab space and initialize |
60 | * Allocate frames for slab space and initialize |
61 | * |
61 | * |
62 | * TODO: Change slab_t allocation to slab_alloc(????), malloc with flags!! |
62 | * TODO: Change slab_t allocation to slab_alloc(????), malloc with flags!! |
63 | */ |
63 | */ |
64 | static slab_t * slab_space_alloc(slab_cache_t *cache, int flags) |
64 | static slab_t * slab_space_alloc(slab_cache_t *cache, int flags) |
65 | { |
65 | { |
66 | void *data; |
66 | void *data; |
67 | slab_t *slab; |
67 | slab_t *slab; |
68 | size_t fsize; |
68 | size_t fsize; |
69 | int i; |
69 | int i; |
70 | zone_t *zone = NULL; |
70 | zone_t *zone = NULL; |
71 | int status; |
71 | int status; |
72 | frame_t *frame; |
72 | frame_t *frame; |
73 | 73 | ||
74 | data = (void *)frame_alloc(FRAME_KA | flags, cache->order, &status, &zone); |
74 | data = (void *)frame_alloc(FRAME_KA | flags, cache->order, &status, &zone); |
75 | if (status != FRAME_OK) { |
75 | if (status != FRAME_OK) { |
76 | return NULL; |
76 | return NULL; |
77 | } |
77 | } |
78 | if (! cache->flags & SLAB_CACHE_SLINSIDE) { |
78 | if (! cache->flags & SLAB_CACHE_SLINSIDE) { |
79 | slab = malloc(sizeof(*slab)); // , flags); |
79 | slab = malloc(sizeof(*slab)); // , flags); |
80 | if (!slab) { |
80 | if (!slab) { |
81 | frame_free((__address)data); |
81 | frame_free((__address)data); |
82 | return NULL; |
82 | return NULL; |
83 | } |
83 | } |
84 | } else { |
84 | } else { |
85 | fsize = (PAGE_SIZE << cache->order); |
85 | fsize = (PAGE_SIZE << cache->order); |
86 | slab = data + fsize - sizeof(*slab); |
86 | slab = data + fsize - sizeof(*slab); |
87 | } |
87 | } |
88 | 88 | ||
89 | /* Fill in slab structures */ |
89 | /* Fill in slab structures */ |
90 | /* TODO: some better way of accessing the frame */ |
90 | /* TODO: some better way of accessing the frame */ |
91 | for (i=0; i< (1<<cache->order); i++) { |
91 | for (i=0; i< (1<<cache->order); i++) { |
92 | frame = ADDR2FRAME(zone, KA2PA((__address)(data+i*PAGE_SIZE))); |
92 | frame = ADDR2FRAME(zone, KA2PA((__address)(data+i*PAGE_SIZE))); |
93 | frame->parent = slab; |
93 | frame->parent = slab; |
94 | } |
94 | } |
95 | 95 | ||
96 | slab->start = data; |
96 | slab->start = data; |
97 | slab->available = cache->objects; |
97 | slab->available = cache->objects; |
98 | slab->nextavail = 0; |
98 | slab->nextavail = 0; |
99 | 99 | ||
100 | for (i=0; i<cache->objects;i++) |
100 | for (i=0; i<cache->objects;i++) |
101 | *((int *) (slab->start + i*cache->size)) = i+1; |
101 | *((int *) (slab->start + i*cache->size)) = i+1; |
102 | 102 | ||
103 | atomic_inc(&cache->allocated_slabs); |
103 | atomic_inc(&cache->allocated_slabs); |
104 | 104 | ||
105 | return slab; |
105 | return slab; |
106 | } |
106 | } |
107 | 107 | ||
108 | /** |
108 | /** |
109 | * Free space associated with SLAB |
109 | * Free space associated with SLAB |
110 | * |
110 | * |
111 | * @return number of freed frames |
111 | * @return number of freed frames |
112 | */ |
112 | */ |
113 | static count_t slab_space_free(slab_cache_t *cache, slab_t *slab) |
113 | static count_t slab_space_free(slab_cache_t *cache, slab_t *slab) |
114 | { |
114 | { |
115 | frame_free((__address)slab->start); |
115 | frame_free((__address)slab->start); |
116 | if (! cache->flags & SLAB_CACHE_SLINSIDE) |
116 | if (! cache->flags & SLAB_CACHE_SLINSIDE) |
117 | free(slab); |
117 | free(slab); |
118 | 118 | ||
119 | atomic_dec(&cache->allocated_slabs); |
119 | atomic_dec(&cache->allocated_slabs); |
120 | 120 | ||
121 | return 1 << cache->order; |
121 | return 1 << cache->order; |
122 | } |
122 | } |
123 | 123 | ||
124 | /** Map object to slab structure */ |
124 | /** Map object to slab structure */ |
125 | static slab_t * obj2slab(void *obj) |
125 | static slab_t * obj2slab(void *obj) |
126 | { |
126 | { |
127 | frame_t *frame; |
127 | frame_t *frame; |
128 | 128 | ||
129 | frame = frame_addr2frame((__address)obj); |
129 | frame = frame_addr2frame((__address)obj); |
130 | return (slab_t *)frame->parent; |
130 | return (slab_t *)frame->parent; |
131 | } |
131 | } |
132 | 132 | ||
133 | /**************************************/ |
133 | /**************************************/ |
134 | /* SLAB functions */ |
134 | /* SLAB functions */ |
135 | 135 | ||
136 | 136 | ||
137 | /** |
137 | /** |
138 | * Return object to slab and call a destructor |
138 | * Return object to slab and call a destructor |
139 | * |
139 | * |
140 | * Assume the cache->lock is held; |
140 | * Assume the cache->lock is held; |
141 | * |
141 | * |
142 | * @param slab If the caller knows directly slab of the object, otherwise NULL |
142 | * @param slab If the caller knows directly slab of the object, otherwise NULL |
143 | * |
143 | * |
144 | * @return Number of freed pages |
144 | * @return Number of freed pages |
145 | */ |
145 | */ |
146 | static count_t slab_obj_destroy(slab_cache_t *cache, void *obj, |
146 | static count_t slab_obj_destroy(slab_cache_t *cache, void *obj, |
147 | slab_t *slab) |
147 | slab_t *slab) |
148 | { |
148 | { |
149 | count_t frames = 0; |
149 | count_t frames = 0; |
150 | 150 | ||
151 | if (!slab) |
151 | if (!slab) |
152 | slab = obj2slab(obj); |
152 | slab = obj2slab(obj); |
153 | 153 | ||
154 | spinlock_lock(&cache->lock); |
154 | spinlock_lock(&cache->lock); |
155 | 155 | ||
156 | *((int *)obj) = slab->nextavail; |
156 | *((int *)obj) = slab->nextavail; |
157 | slab->nextavail = (obj - slab->start)/cache->size; |
157 | slab->nextavail = (obj - slab->start)/cache->size; |
158 | slab->available++; |
158 | slab->available++; |
159 | 159 | ||
160 | /* Move it to correct list */ |
160 | /* Move it to correct list */ |
161 | if (slab->available == 1) { |
161 | if (slab->available == 1) { |
162 | /* It was in full, move to partial */ |
162 | /* It was in full, move to partial */ |
163 | list_remove(&slab->link); |
163 | list_remove(&slab->link); |
164 | list_prepend(&slab->link, &cache->partial_slabs); |
164 | list_prepend(&slab->link, &cache->partial_slabs); |
165 | } |
165 | } |
166 | if (slab->available == cache->objects) { |
166 | if (slab->available == cache->objects) { |
167 | /* Free associated memory */ |
167 | /* Free associated memory */ |
168 | list_remove(&slab->link); |
168 | list_remove(&slab->link); |
169 | /* Avoid deadlock */ |
169 | /* Avoid deadlock */ |
170 | spinlock_unlock(&cache->lock); |
170 | spinlock_unlock(&cache->lock); |
171 | frames = slab_space_free(cache, slab); |
171 | frames = slab_space_free(cache, slab); |
172 | spinlock_lock(&cache->lock); |
172 | spinlock_lock(&cache->lock); |
173 | } |
173 | } |
174 | 174 | ||
175 | spinlock_unlock(&cache->lock); |
175 | spinlock_unlock(&cache->lock); |
176 | 176 | ||
177 | return frames; |
177 | return frames; |
178 | } |
178 | } |
179 | 179 | ||
180 | /** |
180 | /** |
181 | * Take new object from slab or create new if needed |
181 | * Take new object from slab or create new if needed |
182 | * |
182 | * |
183 | * Assume cache->lock is held. |
183 | * Assume cache->lock is held. |
184 | * |
184 | * |
185 | * @return Object address or null |
185 | * @return Object address or null |
186 | */ |
186 | */ |
187 | static void * slab_obj_create(slab_cache_t *cache, int flags) |
187 | static void * slab_obj_create(slab_cache_t *cache, int flags) |
188 | { |
188 | { |
189 | slab_t *slab; |
189 | slab_t *slab; |
190 | void *obj; |
190 | void *obj; |
191 | 191 | ||
192 | if (list_empty(&cache->partial_slabs)) { |
192 | if (list_empty(&cache->partial_slabs)) { |
193 | /* Allow recursion and reclaiming |
193 | /* Allow recursion and reclaiming |
194 | * - this should work, as the SLAB control structures |
194 | * - this should work, as the SLAB control structures |
195 | * are small and do not need to allocte with anything |
195 | * are small and do not need to allocte with anything |
196 | * other ten frame_alloc when they are allocating, |
196 | * other ten frame_alloc when they are allocating, |
197 | * that's why we should get recursion at most 1-level deep |
197 | * that's why we should get recursion at most 1-level deep |
198 | */ |
198 | */ |
199 | spinlock_unlock(&cache->lock); |
199 | spinlock_unlock(&cache->lock); |
200 | slab = slab_space_alloc(cache, flags); |
200 | slab = slab_space_alloc(cache, flags); |
201 | spinlock_lock(&cache->lock); |
201 | spinlock_lock(&cache->lock); |
202 | if (!slab) { |
202 | if (!slab) { |
203 | return NULL; |
203 | return NULL; |
204 | } |
204 | } |
205 | } else { |
205 | } else { |
206 | slab = list_get_instance(cache->partial_slabs.next, |
206 | slab = list_get_instance(cache->partial_slabs.next, |
207 | slab_t, |
207 | slab_t, |
208 | link); |
208 | link); |
209 | list_remove(&slab->link); |
209 | list_remove(&slab->link); |
210 | } |
210 | } |
211 | obj = slab->start + slab->nextavail * cache->size; |
211 | obj = slab->start + slab->nextavail * cache->size; |
212 | slab->nextavail = *((int *)obj); |
212 | slab->nextavail = *((int *)obj); |
213 | slab->available--; |
213 | slab->available--; |
214 | if (! slab->available) |
214 | if (! slab->available) |
215 | list_prepend(&slab->link, &cache->full_slabs); |
215 | list_prepend(&slab->link, &cache->full_slabs); |
216 | else |
216 | else |
217 | list_prepend(&slab->link, &cache->partial_slabs); |
217 | list_prepend(&slab->link, &cache->partial_slabs); |
218 | return obj; |
218 | return obj; |
219 | } |
219 | } |
220 | 220 | ||
221 | /**************************************/ |
221 | /**************************************/ |
222 | /* CPU-Cache slab functions */ |
222 | /* CPU-Cache slab functions */ |
223 | 223 | ||
224 | /** |
224 | /** |
225 | * Free all objects in magazine and free memory associated with magazine |
225 | * Free all objects in magazine and free memory associated with magazine |
226 | * |
226 | * |
227 | * Assume mag_cache[cpu].lock is locked |
227 | * Assume mag_cache[cpu].lock is locked |
228 | * |
228 | * |
229 | * @return Number of freed pages |
229 | * @return Number of freed pages |
230 | */ |
230 | */ |
231 | static count_t magazine_destroy(slab_cache_t *cache, |
231 | static count_t magazine_destroy(slab_cache_t *cache, |
232 | slab_magazine_t *mag) |
232 | slab_magazine_t *mag) |
233 | { |
233 | { |
234 | int i; |
234 | int i; |
235 | count_t frames = 0; |
235 | count_t frames = 0; |
236 | 236 | ||
237 | for (i=0;i < mag->busy; i++) |
237 | for (i=0;i < mag->busy; i++) |
238 | frames += slab_obj_destroy(cache, mag->objs[i], NULL); |
238 | frames += slab_obj_destroy(cache, mag->objs[i], NULL); |
239 | 239 | ||
240 | slab_free(&mag_cache, mag); |
240 | slab_free(&mag_cache, mag); |
241 | 241 | ||
242 | return frames; |
242 | return frames; |
243 | } |
243 | } |
244 | 244 | ||
245 | /** |
245 | /** |
246 | * Try to find object in CPU-cache magazines |
246 | * Try to find object in CPU-cache magazines |
247 | * |
247 | * |
248 | * @return Pointer to object or NULL if not available |
248 | * @return Pointer to object or NULL if not available |
249 | */ |
249 | */ |
250 | static void * magazine_obj_get(slab_cache_t *cache) |
250 | static void * magazine_obj_get(slab_cache_t *cache) |
251 | { |
251 | { |
252 | slab_magazine_t *mag; |
252 | slab_magazine_t *mag; |
253 | 253 | ||
254 | spinlock_lock(&cache->mag_cache[CPU->id].lock); |
254 | spinlock_lock(&cache->mag_cache[CPU->id].lock); |
255 | 255 | ||
256 | mag = cache->mag_cache[CPU->id].current; |
256 | mag = cache->mag_cache[CPU->id].current; |
257 | if (!mag) |
257 | if (!mag) |
258 | goto out; |
258 | goto out; |
259 | 259 | ||
260 | if (!mag->busy) { |
260 | if (!mag->busy) { |
261 | /* If current is empty && last exists && not empty, exchange */ |
261 | /* If current is empty && last exists && not empty, exchange */ |
262 | if (cache->mag_cache[CPU->id].last \ |
262 | if (cache->mag_cache[CPU->id].last \ |
263 | && cache->mag_cache[CPU->id].last->busy) { |
263 | && cache->mag_cache[CPU->id].last->busy) { |
264 | cache->mag_cache[CPU->id].current = cache->mag_cache[CPU->id].last; |
264 | cache->mag_cache[CPU->id].current = cache->mag_cache[CPU->id].last; |
265 | cache->mag_cache[CPU->id].last = mag; |
265 | cache->mag_cache[CPU->id].last = mag; |
266 | mag = cache->mag_cache[CPU->id].current; |
266 | mag = cache->mag_cache[CPU->id].current; |
267 | goto gotit; |
267 | goto gotit; |
268 | } |
268 | } |
269 | /* If still not busy, exchange current with some from |
269 | /* If still not busy, exchange current with some from |
270 | * other full magazines */ |
270 | * other full magazines */ |
271 | spinlock_lock(&cache->lock); |
271 | spinlock_lock(&cache->lock); |
272 | if (list_empty(&cache->magazines)) { |
272 | if (list_empty(&cache->magazines)) { |
273 | spinlock_unlock(&cache->lock); |
273 | spinlock_unlock(&cache->lock); |
274 | goto out; |
274 | goto out; |
275 | } |
275 | } |
276 | /* Free current magazine and take one from list */ |
276 | /* Free current magazine and take one from list */ |
277 | slab_free(&mag_cache, mag); |
277 | slab_free(&mag_cache, mag); |
278 | mag = list_get_instance(cache->magazines.next, |
278 | mag = list_get_instance(cache->magazines.next, |
279 | slab_magazine_t, |
279 | slab_magazine_t, |
280 | link); |
280 | link); |
281 | list_remove(&mag->link); |
281 | list_remove(&mag->link); |
282 | 282 | ||
283 | spinlock_unlock(&cache->lock); |
283 | spinlock_unlock(&cache->lock); |
284 | } |
284 | } |
285 | gotit: |
285 | gotit: |
286 | spinlock_unlock(&cache->mag_cache[CPU->id].lock); |
286 | spinlock_unlock(&cache->mag_cache[CPU->id].lock); |
287 | return mag->objs[--mag->busy]; |
287 | return mag->objs[--mag->busy]; |
288 | out: |
288 | out: |
289 | spinlock_unlock(&cache->mag_cache[CPU->id].lock); |
289 | spinlock_unlock(&cache->mag_cache[CPU->id].lock); |
290 | return NULL; |
290 | return NULL; |
291 | } |
291 | } |
292 | 292 | ||
293 | /** |
293 | /** |
294 | * Put object into CPU-cache magazine |
294 | * Put object into CPU-cache magazine |
295 | * |
295 | * |
296 | * We have 2 magazines bound to processor. |
296 | * We have 2 magazines bound to processor. |
297 | * First try the current. |
297 | * First try the current. |
298 | * If full, try the last. |
298 | * If full, try the last. |
299 | * If full, put to magazines list. |
299 | * If full, put to magazines list. |
300 | * allocate new, exchange last & current |
300 | * allocate new, exchange last & current |
301 | * |
301 | * |
302 | * @return 0 - success, -1 - could not get memory |
302 | * @return 0 - success, -1 - could not get memory |
303 | */ |
303 | */ |
304 | static int magazine_obj_put(slab_cache_t *cache, void *obj) |
304 | static int magazine_obj_put(slab_cache_t *cache, void *obj) |
305 | { |
305 | { |
306 | slab_magazine_t *mag; |
306 | slab_magazine_t *mag; |
307 | 307 | ||
308 | spinlock_lock(&cache->mag_cache[CPU->id].lock); |
308 | spinlock_lock(&cache->mag_cache[CPU->id].lock); |
309 | 309 | ||
310 | mag = cache->mag_cache[CPU->id].current; |
310 | mag = cache->mag_cache[CPU->id].current; |
311 | if (!mag) { |
311 | if (!mag) { |
312 | /* We do not want to sleep just because of caching */ |
312 | /* We do not want to sleep just because of caching */ |
313 | /* Especially we do not want reclaiming to start, as |
313 | /* Especially we do not want reclaiming to start, as |
314 | * this would deadlock */ |
314 | * this would deadlock */ |
315 | mag = slab_alloc(&mag_cache, FRAME_ATOMIC | FRAME_NO_RECLAIM); |
315 | mag = slab_alloc(&mag_cache, FRAME_ATOMIC | FRAME_NO_RECLAIM); |
316 | if (!mag) /* Allocation failed, give up on caching */ |
316 | if (!mag) /* Allocation failed, give up on caching */ |
317 | goto errout; |
317 | goto errout; |
318 | 318 | ||
319 | cache->mag_cache[CPU->id].current = mag; |
319 | cache->mag_cache[CPU->id].current = mag; |
320 | mag->size = SLAB_MAG_SIZE; |
320 | mag->size = SLAB_MAG_SIZE; |
321 | mag->busy = 0; |
321 | mag->busy = 0; |
322 | } else if (mag->busy == mag->size) { |
322 | } else if (mag->busy == mag->size) { |
323 | /* If the last is full | empty, allocate new */ |
323 | /* If the last is full | empty, allocate new */ |
324 | mag = cache->mag_cache[CPU->id].last; |
324 | mag = cache->mag_cache[CPU->id].last; |
325 | if (!mag || mag->size == mag->busy) { |
325 | if (!mag || mag->size == mag->busy) { |
326 | if (mag) |
326 | if (mag) |
327 | list_prepend(&mag->link, &cache->magazines); |
327 | list_prepend(&mag->link, &cache->magazines); |
328 | 328 | ||
329 | mag = slab_alloc(&mag_cache, FRAME_ATOMIC | FRAME_NO_RECLAIM); |
329 | mag = slab_alloc(&mag_cache, FRAME_ATOMIC | FRAME_NO_RECLAIM); |
330 | if (!mag) |
330 | if (!mag) |
331 | goto errout; |
331 | goto errout; |
332 | 332 | ||
333 | mag->size = SLAB_MAG_SIZE; |
333 | mag->size = SLAB_MAG_SIZE; |
334 | mag->busy = 0; |
334 | mag->busy = 0; |
335 | cache->mag_cache[CPU->id].last = mag; |
335 | cache->mag_cache[CPU->id].last = mag; |
336 | } |
336 | } |
337 | /* Exchange the 2 */ |
337 | /* Exchange the 2 */ |
338 | cache->mag_cache[CPU->id].last = cache->mag_cache[CPU->id].current; |
338 | cache->mag_cache[CPU->id].last = cache->mag_cache[CPU->id].current; |
339 | cache->mag_cache[CPU->id].current = mag; |
339 | cache->mag_cache[CPU->id].current = mag; |
340 | } |
340 | } |
341 | mag->objs[mag->busy++] = obj; |
341 | mag->objs[mag->busy++] = obj; |
342 | 342 | ||
343 | spinlock_unlock(&cache->mag_cache[CPU->id].lock); |
343 | spinlock_unlock(&cache->mag_cache[CPU->id].lock); |
344 | return 0; |
344 | return 0; |
345 | errout: |
345 | errout: |
346 | spinlock_unlock(&cache->mag_cache[CPU->id].lock); |
346 | spinlock_unlock(&cache->mag_cache[CPU->id].lock); |
347 | return -1; |
347 | return -1; |
348 | } |
348 | } |
349 | 349 | ||
350 | 350 | ||
351 | /**************************************/ |
351 | /**************************************/ |
352 | /* SLAB CACHE functions */ |
352 | /* SLAB CACHE functions */ |
353 | 353 | ||
354 | /** Return number of objects that fit in certain cache size */ |
354 | /** Return number of objects that fit in certain cache size */ |
355 | static int comp_objects(slab_cache_t *cache) |
355 | static int comp_objects(slab_cache_t *cache) |
356 | { |
356 | { |
357 | if (cache->flags & SLAB_CACHE_SLINSIDE) |
357 | if (cache->flags & SLAB_CACHE_SLINSIDE) |
358 | return ((PAGE_SIZE << cache->order) - sizeof(slab_t)) / cache->size; |
358 | return ((PAGE_SIZE << cache->order) - sizeof(slab_t)) / cache->size; |
359 | else |
359 | else |
360 | return (PAGE_SIZE << cache->order) / cache->size; |
360 | return (PAGE_SIZE << cache->order) / cache->size; |
361 | } |
361 | } |
362 | 362 | ||
363 | /** Return wasted space in slab */ |
363 | /** Return wasted space in slab */ |
364 | static int badness(slab_cache_t *cache) |
364 | static int badness(slab_cache_t *cache) |
365 | { |
365 | { |
366 | int objects; |
366 | int objects; |
367 | int ssize; |
367 | int ssize; |
368 | 368 | ||
369 | objects = comp_objects(cache); |
369 | objects = comp_objects(cache); |
370 | ssize = PAGE_SIZE << cache->order; |
370 | ssize = PAGE_SIZE << cache->order; |
371 | if (cache->flags & SLAB_CACHE_SLINSIDE) |
371 | if (cache->flags & SLAB_CACHE_SLINSIDE) |
372 | ssize -= sizeof(slab_t); |
372 | ssize -= sizeof(slab_t); |
373 | return ssize - objects*cache->size; |
373 | return ssize - objects*cache->size; |
374 | } |
374 | } |
375 | 375 | ||
376 | /** Initialize allocated memory as a slab cache */ |
376 | /** Initialize allocated memory as a slab cache */ |
377 | static void |
377 | static void |
378 | _slab_cache_create(slab_cache_t *cache, |
378 | _slab_cache_create(slab_cache_t *cache, |
379 | char *name, |
379 | char *name, |
380 | size_t size, |
380 | size_t size, |
381 | size_t align, |
381 | size_t align, |
382 | int (*constructor)(void *obj, int kmflag), |
382 | int (*constructor)(void *obj, int kmflag), |
383 | void (*destructor)(void *obj), |
383 | void (*destructor)(void *obj), |
384 | int flags) |
384 | int flags) |
385 | { |
385 | { |
386 | int i; |
386 | int i; |
387 | 387 | ||
388 | memsetb((__address)cache, sizeof(*cache), 0); |
388 | memsetb((__address)cache, sizeof(*cache), 0); |
389 | cache->name = name; |
389 | cache->name = name; |
390 | 390 | ||
391 | if (align) |
391 | if (align) |
392 | size = ALIGN_UP(size, align); |
392 | size = ALIGN_UP(size, align); |
393 | cache->size = size; |
393 | cache->size = size; |
394 | 394 | ||
395 | cache->constructor = constructor; |
395 | cache->constructor = constructor; |
396 | cache->destructor = destructor; |
396 | cache->destructor = destructor; |
397 | cache->flags = flags; |
397 | cache->flags = flags; |
398 | 398 | ||
399 | list_initialize(&cache->full_slabs); |
399 | list_initialize(&cache->full_slabs); |
400 | list_initialize(&cache->partial_slabs); |
400 | list_initialize(&cache->partial_slabs); |
401 | list_initialize(&cache->magazines); |
401 | list_initialize(&cache->magazines); |
402 | spinlock_initialize(&cache->lock, "cachelock"); |
402 | spinlock_initialize(&cache->lock, "cachelock"); |
403 | if (! cache->flags & SLAB_CACHE_NOMAGAZINE) { |
403 | if (! cache->flags & SLAB_CACHE_NOMAGAZINE) { |
404 | for (i=0; i< config.cpu_count; i++) |
404 | for (i=0; i< config.cpu_count; i++) |
405 | spinlock_initialize(&cache->mag_cache[i].lock, |
405 | spinlock_initialize(&cache->mag_cache[i].lock, |
406 | "cpucachelock"); |
406 | "cpucachelock"); |
407 | } |
407 | } |
408 | 408 | ||
409 | /* Compute slab sizes, object counts in slabs etc. */ |
409 | /* Compute slab sizes, object counts in slabs etc. */ |
410 | if (cache->size < SLAB_INSIDE_SIZE) |
410 | if (cache->size < SLAB_INSIDE_SIZE) |
411 | cache->flags |= SLAB_CACHE_SLINSIDE; |
411 | cache->flags |= SLAB_CACHE_SLINSIDE; |
412 | 412 | ||
413 | /* Minimum slab order */ |
413 | /* Minimum slab order */ |
414 | cache->order = (cache->size / PAGE_SIZE) + 1; |
414 | cache->order = (cache->size >> PAGE_WIDTH) + 1; |
415 | 415 | ||
416 | while (badness(cache) > SLAB_MAX_BADNESS(cache)) { |
416 | while (badness(cache) > SLAB_MAX_BADNESS(cache)) { |
417 | cache->order += 1; |
417 | cache->order += 1; |
418 | } |
418 | } |
419 | 419 | ||
420 | cache->objects = comp_objects(cache); |
420 | cache->objects = comp_objects(cache); |
421 | 421 | ||
422 | spinlock_lock(&slab_cache_lock); |
422 | spinlock_lock(&slab_cache_lock); |
423 | 423 | ||
424 | list_append(&cache->link, &slab_cache_list); |
424 | list_append(&cache->link, &slab_cache_list); |
425 | 425 | ||
426 | spinlock_unlock(&slab_cache_lock); |
426 | spinlock_unlock(&slab_cache_lock); |
427 | } |
427 | } |
428 | 428 | ||
429 | /** Create slab cache */ |
429 | /** Create slab cache */ |
430 | slab_cache_t * slab_cache_create(char *name, |
430 | slab_cache_t * slab_cache_create(char *name, |
431 | size_t size, |
431 | size_t size, |
432 | size_t align, |
432 | size_t align, |
433 | int (*constructor)(void *obj, int kmflag), |
433 | int (*constructor)(void *obj, int kmflag), |
434 | void (*destructor)(void *obj), |
434 | void (*destructor)(void *obj), |
435 | int flags) |
435 | int flags) |
436 | { |
436 | { |
437 | slab_cache_t *cache; |
437 | slab_cache_t *cache; |
438 | 438 | ||
439 | cache = malloc(sizeof(*cache) + config.cpu_count*sizeof(cache->mag_cache[0])); |
439 | cache = malloc(sizeof(*cache) + config.cpu_count*sizeof(cache->mag_cache[0])); |
440 | _slab_cache_create(cache, name, size, align, constructor, destructor, |
440 | _slab_cache_create(cache, name, size, align, constructor, destructor, |
441 | flags); |
441 | flags); |
442 | return cache; |
442 | return cache; |
443 | } |
443 | } |
444 | 444 | ||
445 | /** |
445 | /** |
446 | * Reclaim space occupied by objects that are already free |
446 | * Reclaim space occupied by objects that are already free |
447 | * |
447 | * |
448 | * @param flags If contains SLAB_RECLAIM_ALL, do aggressive freeing |
448 | * @param flags If contains SLAB_RECLAIM_ALL, do aggressive freeing |
449 | * @return Number of freed pages |
449 | * @return Number of freed pages |
450 | * |
450 | * |
451 | * TODO: Add light reclaim |
451 | * TODO: Add light reclaim |
452 | */ |
452 | */ |
453 | static count_t _slab_reclaim(slab_cache_t *cache, int flags) |
453 | static count_t _slab_reclaim(slab_cache_t *cache, int flags) |
454 | { |
454 | { |
455 | int i; |
455 | int i; |
456 | slab_magazine_t *mag; |
456 | slab_magazine_t *mag; |
457 | link_t *cur; |
457 | link_t *cur; |
458 | count_t frames = 0; |
458 | count_t frames = 0; |
459 | 459 | ||
460 | if (cache->flags & SLAB_CACHE_NOMAGAZINE) |
460 | if (cache->flags & SLAB_CACHE_NOMAGAZINE) |
461 | return 0; /* Nothing to do */ |
461 | return 0; /* Nothing to do */ |
462 | 462 | ||
463 | /* First lock all cpu caches, then the complete cache lock */ |
463 | /* First lock all cpu caches, then the complete cache lock */ |
464 | for (i=0; i < config.cpu_count; i++) |
464 | for (i=0; i < config.cpu_count; i++) |
465 | spinlock_lock(&cache->mag_cache[i].lock); |
465 | spinlock_lock(&cache->mag_cache[i].lock); |
466 | spinlock_lock(&cache->lock); |
466 | spinlock_lock(&cache->lock); |
467 | 467 | ||
468 | if (flags & SLAB_RECLAIM_ALL) { |
468 | if (flags & SLAB_RECLAIM_ALL) { |
469 | /* Aggressive memfree */ |
469 | /* Aggressive memfree */ |
470 | 470 | ||
471 | /* Destroy CPU magazines */ |
471 | /* Destroy CPU magazines */ |
472 | for (i=0; i<config.cpu_count; i++) { |
472 | for (i=0; i<config.cpu_count; i++) { |
473 | mag = cache->mag_cache[i].current; |
473 | mag = cache->mag_cache[i].current; |
474 | if (mag) |
474 | if (mag) |
475 | frames += magazine_destroy(cache, mag); |
475 | frames += magazine_destroy(cache, mag); |
476 | cache->mag_cache[i].current = NULL; |
476 | cache->mag_cache[i].current = NULL; |
477 | 477 | ||
478 | mag = cache->mag_cache[i].last; |
478 | mag = cache->mag_cache[i].last; |
479 | if (mag) |
479 | if (mag) |
480 | frames += magazine_destroy(cache, mag); |
480 | frames += magazine_destroy(cache, mag); |
481 | cache->mag_cache[i].last = NULL; |
481 | cache->mag_cache[i].last = NULL; |
482 | } |
482 | } |
483 | } |
483 | } |
484 | /* Destroy full magazines */ |
484 | /* Destroy full magazines */ |
485 | cur=cache->magazines.prev; |
485 | cur=cache->magazines.prev; |
486 | while (cur!=&cache->magazines) { |
486 | while (cur!=&cache->magazines) { |
487 | mag = list_get_instance(cur, slab_magazine_t, link); |
487 | mag = list_get_instance(cur, slab_magazine_t, link); |
488 | 488 | ||
489 | cur = cur->prev; |
489 | cur = cur->prev; |
490 | list_remove(cur->next); |
490 | list_remove(cur->next); |
491 | frames += magazine_destroy(cache,mag); |
491 | frames += magazine_destroy(cache,mag); |
492 | /* If we do not do full reclaim, break |
492 | /* If we do not do full reclaim, break |
493 | * as soon as something is freed */ |
493 | * as soon as something is freed */ |
494 | if (!(flags & SLAB_RECLAIM_ALL) && frames) |
494 | if (!(flags & SLAB_RECLAIM_ALL) && frames) |
495 | break; |
495 | break; |
496 | } |
496 | } |
497 | 497 | ||
498 | spinlock_unlock(&cache->lock); |
498 | spinlock_unlock(&cache->lock); |
499 | for (i=0; i < config.cpu_count; i++) |
499 | for (i=0; i < config.cpu_count; i++) |
500 | spinlock_unlock(&cache->mag_cache[i].lock); |
500 | spinlock_unlock(&cache->mag_cache[i].lock); |
501 | 501 | ||
502 | return frames; |
502 | return frames; |
503 | } |
503 | } |
504 | 504 | ||
505 | /** Check that there are no slabs and remove cache from system */ |
505 | /** Check that there are no slabs and remove cache from system */ |
506 | void slab_cache_destroy(slab_cache_t *cache) |
506 | void slab_cache_destroy(slab_cache_t *cache) |
507 | { |
507 | { |
508 | /* Do not lock anything, we assume the software is correct and |
508 | /* Do not lock anything, we assume the software is correct and |
509 | * does not touch the cache when it decides to destroy it */ |
509 | * does not touch the cache when it decides to destroy it */ |
510 | 510 | ||
511 | /* Destroy all magazines */ |
511 | /* Destroy all magazines */ |
512 | _slab_reclaim(cache, SLAB_RECLAIM_ALL); |
512 | _slab_reclaim(cache, SLAB_RECLAIM_ALL); |
513 | 513 | ||
514 | /* All slabs must be empty */ |
514 | /* All slabs must be empty */ |
515 | if (!list_empty(&cache->full_slabs) \ |
515 | if (!list_empty(&cache->full_slabs) \ |
516 | || !list_empty(&cache->partial_slabs)) |
516 | || !list_empty(&cache->partial_slabs)) |
517 | panic("Destroying cache that is not empty."); |
517 | panic("Destroying cache that is not empty."); |
518 | 518 | ||
519 | spinlock_lock(&slab_cache_lock); |
519 | spinlock_lock(&slab_cache_lock); |
520 | list_remove(&cache->link); |
520 | list_remove(&cache->link); |
521 | spinlock_unlock(&slab_cache_lock); |
521 | spinlock_unlock(&slab_cache_lock); |
522 | 522 | ||
523 | free(cache); |
523 | free(cache); |
524 | } |
524 | } |
525 | 525 | ||
526 | /** Allocate new object from cache - if no flags given, always returns |
526 | /** Allocate new object from cache - if no flags given, always returns |
527 | memory */ |
527 | memory */ |
528 | void * slab_alloc(slab_cache_t *cache, int flags) |
528 | void * slab_alloc(slab_cache_t *cache, int flags) |
529 | { |
529 | { |
530 | ipl_t ipl; |
530 | ipl_t ipl; |
531 | void *result = NULL; |
531 | void *result = NULL; |
532 | 532 | ||
533 | /* Disable interrupts to avoid deadlocks with interrupt handlers */ |
533 | /* Disable interrupts to avoid deadlocks with interrupt handlers */ |
534 | ipl = interrupts_disable(); |
534 | ipl = interrupts_disable(); |
535 | 535 | ||
536 | if (!cache->flags & SLAB_CACHE_NOMAGAZINE) |
536 | if (!cache->flags & SLAB_CACHE_NOMAGAZINE) |
537 | result = magazine_obj_get(cache); |
537 | result = magazine_obj_get(cache); |
538 | 538 | ||
539 | if (!result) { |
539 | if (!result) { |
540 | spinlock_lock(&cache->lock); |
540 | spinlock_lock(&cache->lock); |
541 | result = slab_obj_create(cache, flags); |
541 | result = slab_obj_create(cache, flags); |
542 | spinlock_unlock(&cache->lock); |
542 | spinlock_unlock(&cache->lock); |
543 | } |
543 | } |
544 | 544 | ||
545 | if (result) |
545 | if (result) |
546 | atomic_inc(&cache->allocated_objs); |
546 | atomic_inc(&cache->allocated_objs); |
547 | 547 | ||
548 | interrupts_restore(ipl); |
548 | interrupts_restore(ipl); |
549 | 549 | ||
550 | 550 | ||
551 | return result; |
551 | return result; |
552 | } |
552 | } |
553 | 553 | ||
554 | /** Return object to cache */ |
554 | /** Return object to cache */ |
555 | void slab_free(slab_cache_t *cache, void *obj) |
555 | void slab_free(slab_cache_t *cache, void *obj) |
556 | { |
556 | { |
557 | ipl_t ipl; |
557 | ipl_t ipl; |
558 | 558 | ||
559 | ipl = interrupts_disable(); |
559 | ipl = interrupts_disable(); |
560 | 560 | ||
561 | if ((cache->flags & SLAB_CACHE_NOMAGAZINE) \ |
561 | if ((cache->flags & SLAB_CACHE_NOMAGAZINE) \ |
562 | || magazine_obj_put(cache, obj)) { |
562 | || magazine_obj_put(cache, obj)) { |
563 | 563 | ||
564 | spinlock_lock(&cache->lock); |
564 | spinlock_lock(&cache->lock); |
565 | slab_obj_destroy(cache, obj, NULL); |
565 | slab_obj_destroy(cache, obj, NULL); |
566 | spinlock_unlock(&cache->lock); |
566 | spinlock_unlock(&cache->lock); |
567 | } |
567 | } |
568 | atomic_dec(&cache->allocated_objs); |
568 | atomic_dec(&cache->allocated_objs); |
569 | interrupts_restore(ipl); |
569 | interrupts_restore(ipl); |
570 | } |
570 | } |
571 | 571 | ||
572 | /* Go through all caches and reclaim what is possible */ |
572 | /* Go through all caches and reclaim what is possible */ |
573 | count_t slab_reclaim(int flags) |
573 | count_t slab_reclaim(int flags) |
574 | { |
574 | { |
575 | slab_cache_t *cache; |
575 | slab_cache_t *cache; |
576 | link_t *cur; |
576 | link_t *cur; |
577 | count_t frames = 0; |
577 | count_t frames = 0; |
578 | 578 | ||
579 | spinlock_lock(&slab_cache_lock); |
579 | spinlock_lock(&slab_cache_lock); |
580 | 580 | ||
581 | for (cur = slab_cache_list.next;cur!=&slab_cache_list; cur=cur->next) { |
581 | for (cur = slab_cache_list.next;cur!=&slab_cache_list; cur=cur->next) { |
582 | cache = list_get_instance(cur, slab_cache_t, link); |
582 | cache = list_get_instance(cur, slab_cache_t, link); |
583 | frames += _slab_reclaim(cache, flags); |
583 | frames += _slab_reclaim(cache, flags); |
584 | } |
584 | } |
585 | 585 | ||
586 | spinlock_unlock(&slab_cache_lock); |
586 | spinlock_unlock(&slab_cache_lock); |
587 | 587 | ||
588 | return frames; |
588 | return frames; |
589 | } |
589 | } |
590 | 590 | ||
591 | 591 | ||
592 | /* Print list of slabs */ |
592 | /* Print list of slabs */ |
593 | void slab_print_list(void) |
593 | void slab_print_list(void) |
594 | { |
594 | { |
595 | slab_cache_t *cache; |
595 | slab_cache_t *cache; |
596 | link_t *cur; |
596 | link_t *cur; |
597 | 597 | ||
598 | spinlock_lock(&slab_cache_lock); |
598 | spinlock_lock(&slab_cache_lock); |
599 | printf("SLAB name\tOsize\tOrder\tOcnt\tSlabs\tAllocobjs\n"); |
599 | printf("SLAB name\tOsize\tOrder\tOcnt\tSlabs\tAllocobjs\n"); |
600 | for (cur = slab_cache_list.next;cur!=&slab_cache_list; cur=cur->next) { |
600 | for (cur = slab_cache_list.next;cur!=&slab_cache_list; cur=cur->next) { |
601 | cache = list_get_instance(cur, slab_cache_t, link); |
601 | cache = list_get_instance(cur, slab_cache_t, link); |
602 | printf("%s\t%d\t%d\t%d\t%d\t%d\n", cache->name, cache->size, |
602 | printf("%s\t%d\t%d\t%d\t%d\t%d\n", cache->name, cache->size, |
603 | cache->order, cache->objects, |
603 | cache->order, cache->objects, |
604 | atomic_get(&cache->allocated_slabs), |
604 | atomic_get(&cache->allocated_slabs), |
605 | atomic_get(&cache->allocated_objs)); |
605 | atomic_get(&cache->allocated_objs)); |
606 | } |
606 | } |
607 | spinlock_unlock(&slab_cache_lock); |
607 | spinlock_unlock(&slab_cache_lock); |
608 | } |
608 | } |
609 | 609 | ||
610 | void slab_cache_init(void) |
610 | void slab_cache_init(void) |
611 | { |
611 | { |
612 | /* Initialize magazine cache */ |
612 | /* Initialize magazine cache */ |
613 | _slab_cache_create(&mag_cache, |
613 | _slab_cache_create(&mag_cache, |
614 | "slab_magazine", |
614 | "slab_magazine", |
615 | sizeof(slab_magazine_t)+SLAB_MAG_SIZE*sizeof(void*), |
615 | sizeof(slab_magazine_t)+SLAB_MAG_SIZE*sizeof(void*), |
616 | sizeof(__address), |
616 | sizeof(__address), |
617 | NULL, NULL, |
617 | NULL, NULL, |
618 | SLAB_CACHE_NOMAGAZINE); |
618 | SLAB_CACHE_NOMAGAZINE); |
619 | 619 | ||
620 | /* Initialize structures for malloc */ |
620 | /* Initialize structures for malloc */ |
621 | } |
621 | } |
622 | 622 |