Rev 3191 | Rev 4346 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 3191 | Rev 3211 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2001-2005 Jakub Jermar |
2 | * Copyright (c) 2001-2005 Jakub Jermar |
3 | * Copyright (c) 2005 Sergey Bondari |
3 | * Copyright (c) 2005 Sergey Bondari |
4 | * All rights reserved. |
4 | * All rights reserved. |
5 | * |
5 | * |
6 | * Redistribution and use in source and binary forms, with or without |
6 | * Redistribution and use in source and binary forms, with or without |
7 | * modification, are permitted provided that the following conditions |
7 | * modification, are permitted provided that the following conditions |
8 | * are met: |
8 | * are met: |
9 | * |
9 | * |
10 | * - Redistributions of source code must retain the above copyright |
10 | * - Redistributions of source code must retain the above copyright |
11 | * notice, this list of conditions and the following disclaimer. |
11 | * notice, this list of conditions and the following disclaimer. |
12 | * - Redistributions in binary form must reproduce the above copyright |
12 | * - Redistributions in binary form must reproduce the above copyright |
13 | * notice, this list of conditions and the following disclaimer in the |
13 | * notice, this list of conditions and the following disclaimer in the |
14 | * documentation and/or other materials provided with the distribution. |
14 | * documentation and/or other materials provided with the distribution. |
15 | * - The name of the author may not be used to endorse or promote products |
15 | * - The name of the author may not be used to endorse or promote products |
16 | * derived from this software without specific prior written permission. |
16 | * derived from this software without specific prior written permission. |
17 | * |
17 | * |
18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
19 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
23 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
28 | */ |
28 | */ |
29 | 29 | ||
30 | /** @addtogroup genericmm |
30 | /** @addtogroup genericmm |
31 | * @{ |
31 | * @{ |
32 | */ |
32 | */ |
33 | 33 | ||
34 | /** |
34 | /** |
35 | * @file |
35 | * @file |
36 | * @brief Physical frame allocator. |
36 | * @brief Physical frame allocator. |
37 | * |
37 | * |
38 | * This file contains the physical frame allocator and memory zone management. |
38 | * This file contains the physical frame allocator and memory zone management. |
39 | * The frame allocator is built on top of the buddy allocator. |
39 | * The frame allocator is built on top of the buddy allocator. |
40 | * |
40 | * |
41 | * @see buddy.c |
41 | * @see buddy.c |
42 | */ |
42 | */ |
43 | 43 | ||
44 | /* |
44 | /* |
45 | * Locking order |
45 | * Locking order |
46 | * |
46 | * |
47 | * In order to access particular zone, the process must first lock |
47 | * In order to access particular zone, the process must first lock |
48 | * the zones.lock, then lock the zone and then unlock the zones.lock. |
48 | * the zones.lock, then lock the zone and then unlock the zones.lock. |
49 | * This insures, that we can fiddle with the zones in runtime without |
49 | * This insures, that we can fiddle with the zones in runtime without |
50 | * affecting the processes. |
50 | * affecting the processes. |
51 | * |
51 | * |
52 | */ |
52 | */ |
53 | 53 | ||
54 | #include <arch/types.h> |
54 | #include <arch/types.h> |
55 | #include <mm/frame.h> |
55 | #include <mm/frame.h> |
56 | #include <mm/as.h> |
56 | #include <mm/as.h> |
57 | #include <panic.h> |
57 | #include <panic.h> |
58 | #include <debug.h> |
58 | #include <debug.h> |
59 | #include <adt/list.h> |
59 | #include <adt/list.h> |
60 | #include <synch/spinlock.h> |
60 | #include <synch/spinlock.h> |
61 | #include <synch/mutex.h> |
61 | #include <synch/mutex.h> |
62 | #include <synch/condvar.h> |
62 | #include <synch/condvar.h> |
63 | #include <arch/asm.h> |
63 | #include <arch/asm.h> |
64 | #include <arch.h> |
64 | #include <arch.h> |
65 | #include <print.h> |
65 | #include <print.h> |
66 | #include <align.h> |
66 | #include <align.h> |
67 | #include <mm/slab.h> |
67 | #include <mm/slab.h> |
68 | #include <bitops.h> |
68 | #include <bitops.h> |
69 | #include <macros.h> |
69 | #include <macros.h> |
70 | #include <config.h> |
70 | #include <config.h> |
71 | 71 | ||
72 | typedef struct { |
72 | typedef struct { |
73 | count_t refcount; /**< tracking of shared frames */ |
73 | count_t refcount; /**< tracking of shared frames */ |
74 | uint8_t buddy_order; /**< buddy system block order */ |
74 | uint8_t buddy_order; /**< buddy system block order */ |
75 | link_t buddy_link; /**< link to the next free block inside one |
75 | link_t buddy_link; /**< link to the next free block inside one |
76 | order */ |
76 | order */ |
77 | void *parent; /**< If allocated by slab, this points there */ |
77 | void *parent; /**< If allocated by slab, this points there */ |
78 | } frame_t; |
78 | } frame_t; |
79 | 79 | ||
80 | typedef struct { |
80 | typedef struct { |
81 | SPINLOCK_DECLARE(lock); /**< this lock protects everything below */ |
81 | SPINLOCK_DECLARE(lock); /**< this lock protects everything below */ |
82 | pfn_t base; /**< frame_no of the first frame in the frames |
82 | pfn_t base; /**< frame_no of the first frame in the frames |
83 | array */ |
83 | array */ |
84 | count_t count; /**< Size of zone */ |
84 | count_t count; /**< Size of zone */ |
85 | 85 | ||
86 | frame_t *frames; /**< array of frame_t structures in this |
86 | frame_t *frames; /**< array of frame_t structures in this |
87 | zone */ |
87 | zone */ |
88 | count_t free_count; /**< number of free frame_t structures */ |
88 | count_t free_count; /**< number of free frame_t structures */ |
89 | count_t busy_count; /**< number of busy frame_t structures */ |
89 | count_t busy_count; /**< number of busy frame_t structures */ |
90 | 90 | ||
91 | buddy_system_t *buddy_system; /**< buddy system for the zone */ |
91 | buddy_system_t *buddy_system; /**< buddy system for the zone */ |
92 | int flags; |
92 | int flags; |
93 | } zone_t; |
93 | } zone_t; |
94 | 94 | ||
95 | /* |
95 | /* |
96 | * The zoneinfo.lock must be locked when accessing zoneinfo structure. |
96 | * The zoneinfo.lock must be locked when accessing zoneinfo structure. |
97 | * Some of the attributes in zone_t structures are 'read-only' |
97 | * Some of the attributes in zone_t structures are 'read-only' |
98 | */ |
98 | */ |
99 | 99 | ||
100 | typedef struct { |
100 | typedef struct { |
101 | SPINLOCK_DECLARE(lock); |
101 | SPINLOCK_DECLARE(lock); |
102 | unsigned int count; |
102 | unsigned int count; |
103 | zone_t *info[ZONES_MAX]; |
103 | zone_t *info[ZONES_MAX]; |
104 | } zones_t; |
104 | } zones_t; |
105 | 105 | ||
106 | static zones_t zones; |
106 | static zones_t zones; |
107 | 107 | ||
108 | /* |
108 | /* |
109 | * Synchronization primitives used to sleep when there is no memory |
109 | * Synchronization primitives used to sleep when there is no memory |
110 | * available. |
110 | * available. |
111 | */ |
111 | */ |
112 | mutex_t mem_avail_mtx; |
112 | mutex_t mem_avail_mtx; |
113 | condvar_t mem_avail_cv; |
113 | condvar_t mem_avail_cv; |
114 | unsigned long mem_avail_frames = 0; /**< Number of available frames. */ |
114 | unsigned long mem_avail_frames = 0; /**< Number of available frames. */ |
115 | unsigned long mem_avail_gen = 0; /**< Generation counter. */ |
115 | unsigned long mem_avail_gen = 0; /**< Generation counter. */ |
116 | 116 | ||
117 | /********************/ |
117 | /********************/ |
118 | /* Helper functions */ |
118 | /* Helper functions */ |
119 | /********************/ |
119 | /********************/ |
120 | 120 | ||
121 | static inline index_t frame_index(zone_t *zone, frame_t *frame) |
121 | static inline index_t frame_index(zone_t *zone, frame_t *frame) |
122 | { |
122 | { |
123 | return (index_t) (frame - zone->frames); |
123 | return (index_t) (frame - zone->frames); |
124 | } |
124 | } |
125 | 125 | ||
126 | static inline index_t frame_index_abs(zone_t *zone, frame_t *frame) |
126 | static inline index_t frame_index_abs(zone_t *zone, frame_t *frame) |
127 | { |
127 | { |
128 | return (index_t) (frame - zone->frames) + zone->base; |
128 | return (index_t) (frame - zone->frames) + zone->base; |
129 | } |
129 | } |
130 | 130 | ||
131 | static inline int frame_index_valid(zone_t *zone, index_t index) |
131 | static inline int frame_index_valid(zone_t *zone, index_t index) |
132 | { |
132 | { |
133 | return (index < zone->count); |
133 | return (index < zone->count); |
134 | } |
134 | } |
135 | 135 | ||
136 | /** Compute pfn_t from frame_t pointer & zone pointer */ |
136 | /** Compute pfn_t from frame_t pointer & zone pointer */ |
137 | static index_t make_frame_index(zone_t *zone, frame_t *frame) |
137 | static index_t make_frame_index(zone_t *zone, frame_t *frame) |
138 | { |
138 | { |
139 | return (frame - zone->frames); |
139 | return (frame - zone->frames); |
140 | } |
140 | } |
141 | 141 | ||
142 | /** Initialize frame structure. |
142 | /** Initialize frame structure. |
143 | * |
143 | * |
144 | * @param frame Frame structure to be initialized. |
144 | * @param frame Frame structure to be initialized. |
145 | */ |
145 | */ |
146 | static void frame_initialize(frame_t *frame) |
146 | static void frame_initialize(frame_t *frame) |
147 | { |
147 | { |
148 | frame->refcount = 1; |
148 | frame->refcount = 1; |
149 | frame->buddy_order = 0; |
149 | frame->buddy_order = 0; |
150 | } |
150 | } |
151 | 151 | ||
152 | /**********************/ |
152 | /**********************/ |
153 | /* Zoneinfo functions */ |
153 | /* Zoneinfo functions */ |
154 | /**********************/ |
154 | /**********************/ |
155 | 155 | ||
156 | /** Insert-sort zone into zones list. |
156 | /** Insert-sort zone into zones list. |
157 | * |
157 | * |
158 | * @param newzone New zone to be inserted into zone list. |
158 | * @param newzone New zone to be inserted into zone list. |
159 | * @return Zone number on success, -1 on error. |
159 | * @return Zone number on success, -1 on error. |
160 | */ |
160 | */ |
161 | static int zones_add_zone(zone_t *newzone) |
161 | static int zones_add_zone(zone_t *newzone) |
162 | { |
162 | { |
163 | unsigned int i, j; |
163 | unsigned int i, j; |
164 | ipl_t ipl; |
164 | ipl_t ipl; |
165 | zone_t *z; |
165 | zone_t *z; |
166 | 166 | ||
167 | ipl = interrupts_disable(); |
167 | ipl = interrupts_disable(); |
168 | spinlock_lock(&zones.lock); |
168 | spinlock_lock(&zones.lock); |
169 | 169 | ||
170 | /* Try to merge */ |
170 | /* Try to merge */ |
171 | if (zones.count + 1 == ZONES_MAX) { |
171 | if (zones.count + 1 == ZONES_MAX) { |
172 | printf("Maximum zone count %u exceeded!\n", ZONES_MAX); |
172 | printf("Maximum zone count %u exceeded!\n", ZONES_MAX); |
173 | spinlock_unlock(&zones.lock); |
173 | spinlock_unlock(&zones.lock); |
174 | interrupts_restore(ipl); |
174 | interrupts_restore(ipl); |
175 | return -1; |
175 | return -1; |
176 | } |
176 | } |
177 | 177 | ||
178 | for (i = 0; i < zones.count; i++) { |
178 | for (i = 0; i < zones.count; i++) { |
179 | /* Check for overflow */ |
179 | /* Check for overflow */ |
180 | z = zones.info[i]; |
180 | z = zones.info[i]; |
181 | if (overlaps(newzone->base, newzone->count, z->base, |
181 | if (overlaps(newzone->base, newzone->count, z->base, |
182 | z->count)) { |
182 | z->count)) { |
183 | printf("Zones overlap!\n"); |
183 | printf("Zones overlap!\n"); |
184 | return -1; |
184 | return -1; |
185 | } |
185 | } |
186 | if (newzone->base < z->base) |
186 | if (newzone->base < z->base) |
187 | break; |
187 | break; |
188 | } |
188 | } |
189 | 189 | ||
190 | /* Move other zones up */ |
190 | /* Move other zones up */ |
191 | for (j = i; j < zones.count; j++) |
191 | for (j = i; j < zones.count; j++) |
192 | zones.info[j + 1] = zones.info[j]; |
192 | zones.info[j + 1] = zones.info[j]; |
193 | 193 | ||
194 | zones.info[i] = newzone; |
194 | zones.info[i] = newzone; |
195 | zones.count++; |
195 | zones.count++; |
196 | 196 | ||
197 | spinlock_unlock(&zones.lock); |
197 | spinlock_unlock(&zones.lock); |
198 | interrupts_restore(ipl); |
198 | interrupts_restore(ipl); |
199 | 199 | ||
200 | return i; |
200 | return i; |
201 | } |
201 | } |
202 | 202 | ||
203 | /** |
- | |
204 | * Try to find a zone where can we find the frame. |
203 | /** Try to find a zone where can we find the frame. |
205 | * |
204 | * |
206 | * Assume interrupts are disabled. |
205 | * Assume interrupts are disabled. |
207 | * |
206 | * |
208 | * @param frame Frame number contained in zone. |
207 | * @param frame Frame number contained in zone. |
209 | * @param pzone If not null, it is used as zone hint. Zone index is |
208 | * @param pzone If not null, it is used as zone hint. Zone index is |
210 | * filled into the variable on success. |
209 | * filled into the variable on success. |
211 | * @return Pointer to locked zone containing frame. |
210 | * @return Pointer to locked zone containing frame. |
212 | */ |
211 | */ |
213 | static zone_t *find_zone_and_lock(pfn_t frame, unsigned int *pzone) |
212 | static zone_t *find_zone_and_lock(pfn_t frame, unsigned int *pzone) |
214 | { |
213 | { |
215 | unsigned int i; |
214 | unsigned int i; |
216 | unsigned int hint = pzone ? *pzone : 0; |
215 | unsigned int hint = pzone ? *pzone : 0; |
217 | zone_t *z; |
216 | zone_t *z; |
218 | 217 | ||
219 | spinlock_lock(&zones.lock); |
218 | spinlock_lock(&zones.lock); |
220 | 219 | ||
221 | if (hint >= zones.count) |
220 | if (hint >= zones.count) |
222 | hint = 0; |
221 | hint = 0; |
223 | 222 | ||
224 | i = hint; |
223 | i = hint; |
225 | do { |
224 | do { |
226 | z = zones.info[i]; |
225 | z = zones.info[i]; |
227 | spinlock_lock(&z->lock); |
226 | spinlock_lock(&z->lock); |
228 | if (z->base <= frame && z->base + z->count > frame) { |
227 | if (z->base <= frame && z->base + z->count > frame) { |
229 | /* Unlock the global lock */ |
228 | /* Unlock the global lock */ |
230 | spinlock_unlock(&zones.lock); |
229 | spinlock_unlock(&zones.lock); |
231 | if (pzone) |
230 | if (pzone) |
232 | *pzone = i; |
231 | *pzone = i; |
233 | return z; |
232 | return z; |
234 | } |
233 | } |
235 | spinlock_unlock(&z->lock); |
234 | spinlock_unlock(&z->lock); |
236 | 235 | ||
237 | i++; |
236 | i++; |
238 | if (i >= zones.count) |
237 | if (i >= zones.count) |
239 | i = 0; |
238 | i = 0; |
240 | } while(i != hint); |
239 | } while (i != hint); |
241 | 240 | ||
242 | spinlock_unlock(&zones.lock); |
241 | spinlock_unlock(&zones.lock); |
243 | return NULL; |
242 | return NULL; |
244 | } |
243 | } |
245 | 244 | ||
246 | /** @return True if zone can allocate specified order */ |
245 | /** @return True if zone can allocate specified order */ |
247 | static int zone_can_alloc(zone_t *z, uint8_t order) |
246 | static int zone_can_alloc(zone_t *z, uint8_t order) |
248 | { |
247 | { |
249 | return buddy_system_can_alloc(z->buddy_system, order); |
248 | return buddy_system_can_alloc(z->buddy_system, order); |
250 | } |
249 | } |
251 | 250 | ||
252 | /** Find and lock zone that can allocate order frames. |
251 | /** Find and lock zone that can allocate order frames. |
253 | * |
252 | * |
254 | * Assume interrupts are disabled. |
253 | * Assume interrupts are disabled. |
255 | * |
254 | * |
256 | * @param order Size (2^order) of free space we are trying to find. |
255 | * @param order Size (2^order) of free space we are trying to find. |
- | 256 | * @param flags Required flags of the target zone. |
|
257 | * @param pzone Pointer to preferred zone or NULL, on return contains |
257 | * @param pzone Pointer to preferred zone or NULL, on return contains |
258 | * zone number. |
258 | * zone number. |
259 | */ |
259 | */ |
- | 260 | static zone_t * |
|
260 | static zone_t *find_free_zone_and_lock(uint8_t order, unsigned int *pzone) |
261 | find_free_zone_and_lock(uint8_t order, int flags, unsigned int *pzone) |
261 | { |
262 | { |
262 | unsigned int i; |
263 | unsigned int i; |
263 | zone_t *z; |
264 | zone_t *z; |
264 | unsigned int hint = pzone ? *pzone : 0; |
265 | unsigned int hint = pzone ? *pzone : 0; |
265 | 266 | ||
- | 267 | /* Mask off flags that are not applicable. */ |
|
- | 268 | flags &= FRAME_LOW_4_GiB; |
|
- | 269 | ||
266 | spinlock_lock(&zones.lock); |
270 | spinlock_lock(&zones.lock); |
267 | if (hint >= zones.count) |
271 | if (hint >= zones.count) |
268 | hint = 0; |
272 | hint = 0; |
269 | i = hint; |
273 | i = hint; |
270 | do { |
274 | do { |
271 | z = zones.info[i]; |
275 | z = zones.info[i]; |
272 | 276 | ||
273 | spinlock_lock(&z->lock); |
277 | spinlock_lock(&z->lock); |
274 | 278 | ||
- | 279 | /* |
|
- | 280 | * Check whether the zone meets the search criteria. |
|
- | 281 | */ |
|
- | 282 | if ((z->flags & flags) == flags) { |
|
- | 283 | /* |
|
275 | /* Check if the zone has 2^order frames area available */ |
284 | * Check if the zone has 2^order frames area available. |
- | 285 | */ |
|
276 | if (zone_can_alloc(z, order)) { |
286 | if (zone_can_alloc(z, order)) { |
277 | spinlock_unlock(&zones.lock); |
287 | spinlock_unlock(&zones.lock); |
278 | if (pzone) |
288 | if (pzone) |
279 | *pzone = i; |
289 | *pzone = i; |
280 | return z; |
290 | return z; |
- | 291 | } |
|
281 | } |
292 | } |
282 | spinlock_unlock(&z->lock); |
293 | spinlock_unlock(&z->lock); |
283 | if (++i >= zones.count) |
294 | if (++i >= zones.count) |
284 | i = 0; |
295 | i = 0; |
285 | } while(i != hint); |
296 | } while (i != hint); |
286 | spinlock_unlock(&zones.lock); |
297 | spinlock_unlock(&zones.lock); |
287 | return NULL; |
298 | return NULL; |
288 | } |
299 | } |
289 | 300 | ||
290 | /**************************/ |
301 | /**************************/ |
291 | /* Buddy system functions */ |
302 | /* Buddy system functions */ |
292 | /**************************/ |
303 | /**************************/ |
293 | 304 | ||
294 | /** Buddy system find_block implementation. |
305 | /** Buddy system find_block implementation. |
295 | * |
306 | * |
296 | * Find block that is parent of current list. |
307 | * Find block that is parent of current list. |
297 | * That means go to lower addresses, until such block is found |
308 | * That means go to lower addresses, until such block is found |
298 | * |
309 | * |
299 | * @param order Order of parent must be different then this |
310 | * @param order Order of parent must be different then this |
300 | * parameter!! |
311 | * parameter!! |
301 | */ |
312 | */ |
302 | static link_t *zone_buddy_find_block(buddy_system_t *b, link_t *child, |
313 | static link_t *zone_buddy_find_block(buddy_system_t *b, link_t *child, |
303 | uint8_t order) |
314 | uint8_t order) |
304 | { |
315 | { |
305 | frame_t *frame; |
316 | frame_t *frame; |
306 | zone_t *zone; |
317 | zone_t *zone; |
307 | index_t index; |
318 | index_t index; |
308 | 319 | ||
309 | frame = list_get_instance(child, frame_t, buddy_link); |
320 | frame = list_get_instance(child, frame_t, buddy_link); |
310 | zone = (zone_t *) b->data; |
321 | zone = (zone_t *) b->data; |
311 | 322 | ||
312 | index = frame_index(zone, frame); |
323 | index = frame_index(zone, frame); |
313 | do { |
324 | do { |
314 | if (zone->frames[index].buddy_order != order) { |
325 | if (zone->frames[index].buddy_order != order) { |
315 | return &zone->frames[index].buddy_link; |
326 | return &zone->frames[index].buddy_link; |
316 | } |
327 | } |
317 | } while(index-- > 0); |
328 | } while(index-- > 0); |
318 | return NULL; |
329 | return NULL; |
319 | } |
330 | } |
320 | 331 | ||
321 | static void zone_buddy_print_id(buddy_system_t *b, link_t *block) |
- | |
322 | { |
- | |
323 | frame_t *frame; |
- | |
324 | zone_t *zone; |
- | |
325 | index_t index; |
- | |
326 | - | ||
327 | frame = list_get_instance(block, frame_t, buddy_link); |
- | |
328 | zone = (zone_t *) b->data; |
- | |
329 | index = frame_index(zone, frame); |
- | |
330 | printf("%" PRIi, index); |
- | |
331 | } |
- | |
332 | - | ||
333 | /** Buddy system find_buddy implementation. |
332 | /** Buddy system find_buddy implementation. |
334 | * |
333 | * |
335 | * @param b Buddy system. |
334 | * @param b Buddy system. |
336 | * @param block Block for which buddy should be found. |
335 | * @param block Block for which buddy should be found. |
337 | * |
336 | * |
338 | * @return Buddy for given block if found. |
337 | * @return Buddy for given block if found. |
339 | */ |
338 | */ |
340 | static link_t *zone_buddy_find_buddy(buddy_system_t *b, link_t *block) |
339 | static link_t *zone_buddy_find_buddy(buddy_system_t *b, link_t *block) |
341 | { |
340 | { |
342 | frame_t *frame; |
341 | frame_t *frame; |
343 | zone_t *zone; |
342 | zone_t *zone; |
344 | index_t index; |
343 | index_t index; |
345 | bool is_left, is_right; |
344 | bool is_left, is_right; |
346 | 345 | ||
347 | frame = list_get_instance(block, frame_t, buddy_link); |
346 | frame = list_get_instance(block, frame_t, buddy_link); |
348 | zone = (zone_t *) b->data; |
347 | zone = (zone_t *) b->data; |
349 | ASSERT(IS_BUDDY_ORDER_OK(frame_index_abs(zone, frame), |
348 | ASSERT(IS_BUDDY_ORDER_OK(frame_index_abs(zone, frame), |
350 | frame->buddy_order)); |
349 | frame->buddy_order)); |
351 | 350 | ||
352 | is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame); |
351 | is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame); |
353 | is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame); |
352 | is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame); |
354 | 353 | ||
355 | ASSERT(is_left ^ is_right); |
354 | ASSERT(is_left ^ is_right); |
356 | if (is_left) { |
355 | if (is_left) { |
357 | index = (frame_index(zone, frame)) + |
356 | index = (frame_index(zone, frame)) + |
358 | (1 << frame->buddy_order); |
357 | (1 << frame->buddy_order); |
359 | } else { /* if (is_right) */ |
358 | } else { /* if (is_right) */ |
360 | index = (frame_index(zone, frame)) - |
359 | index = (frame_index(zone, frame)) - |
361 | (1 << frame->buddy_order); |
360 | (1 << frame->buddy_order); |
362 | } |
361 | } |
363 | 362 | ||
364 | if (frame_index_valid(zone, index)) { |
363 | if (frame_index_valid(zone, index)) { |
365 | if (zone->frames[index].buddy_order == frame->buddy_order && |
364 | if (zone->frames[index].buddy_order == frame->buddy_order && |
366 | zone->frames[index].refcount == 0) { |
365 | zone->frames[index].refcount == 0) { |
367 | return &zone->frames[index].buddy_link; |
366 | return &zone->frames[index].buddy_link; |
368 | } |
367 | } |
369 | } |
368 | } |
370 | 369 | ||
371 | return NULL; |
370 | return NULL; |
372 | } |
371 | } |
373 | 372 | ||
374 | /** Buddy system bisect implementation. |
373 | /** Buddy system bisect implementation. |
375 | * |
374 | * |
376 | * @param b Buddy system. |
375 | * @param b Buddy system. |
377 | * @param block Block to bisect. |
376 | * @param block Block to bisect. |
378 | * |
377 | * |
379 | * @return Right block. |
378 | * @return Right block. |
380 | */ |
379 | */ |
381 | static link_t *zone_buddy_bisect(buddy_system_t *b, link_t *block) |
380 | static link_t *zone_buddy_bisect(buddy_system_t *b, link_t *block) |
382 | { |
381 | { |
383 | frame_t *frame_l, *frame_r; |
382 | frame_t *frame_l, *frame_r; |
384 | 383 | ||
385 | frame_l = list_get_instance(block, frame_t, buddy_link); |
384 | frame_l = list_get_instance(block, frame_t, buddy_link); |
386 | frame_r = (frame_l + (1 << (frame_l->buddy_order - 1))); |
385 | frame_r = (frame_l + (1 << (frame_l->buddy_order - 1))); |
387 | 386 | ||
388 | return &frame_r->buddy_link; |
387 | return &frame_r->buddy_link; |
389 | } |
388 | } |
390 | 389 | ||
391 | /** Buddy system coalesce implementation. |
390 | /** Buddy system coalesce implementation. |
392 | * |
391 | * |
393 | * @param b Buddy system. |
392 | * @param b Buddy system. |
394 | * @param block_1 First block. |
393 | * @param block_1 First block. |
395 | * @param block_2 First block's buddy. |
394 | * @param block_2 First block's buddy. |
396 | * |
395 | * |
397 | * @return Coalesced block (actually block that represents lower |
396 | * @return Coalesced block (actually block that represents lower |
398 | * address). |
397 | * address). |
399 | */ |
398 | */ |
400 | static link_t *zone_buddy_coalesce(buddy_system_t *b, link_t *block_1, |
399 | static link_t *zone_buddy_coalesce(buddy_system_t *b, link_t *block_1, |
401 | link_t *block_2) |
400 | link_t *block_2) |
402 | { |
401 | { |
403 | frame_t *frame1, *frame2; |
402 | frame_t *frame1, *frame2; |
404 | 403 | ||
405 | frame1 = list_get_instance(block_1, frame_t, buddy_link); |
404 | frame1 = list_get_instance(block_1, frame_t, buddy_link); |
406 | frame2 = list_get_instance(block_2, frame_t, buddy_link); |
405 | frame2 = list_get_instance(block_2, frame_t, buddy_link); |
407 | 406 | ||
408 | return frame1 < frame2 ? block_1 : block_2; |
407 | return frame1 < frame2 ? block_1 : block_2; |
409 | } |
408 | } |
410 | 409 | ||
411 | /** Buddy system set_order implementation. |
410 | /** Buddy system set_order implementation. |
412 | * |
411 | * |
413 | * @param b Buddy system. |
412 | * @param b Buddy system. |
414 | * @param block Buddy system block. |
413 | * @param block Buddy system block. |
415 | * @param order Order to set. |
414 | * @param order Order to set. |
416 | */ |
415 | */ |
417 | static void zone_buddy_set_order(buddy_system_t *b, link_t *block, |
416 | static void zone_buddy_set_order(buddy_system_t *b, link_t *block, |
418 | uint8_t order) |
417 | uint8_t order) |
419 | { |
418 | { |
420 | frame_t *frame; |
419 | frame_t *frame; |
421 | frame = list_get_instance(block, frame_t, buddy_link); |
420 | frame = list_get_instance(block, frame_t, buddy_link); |
422 | frame->buddy_order = order; |
421 | frame->buddy_order = order; |
423 | } |
422 | } |
424 | 423 | ||
425 | /** Buddy system get_order implementation. |
424 | /** Buddy system get_order implementation. |
426 | * |
425 | * |
427 | * @param b Buddy system. |
426 | * @param b Buddy system. |
428 | * @param block Buddy system block. |
427 | * @param block Buddy system block. |
429 | * |
428 | * |
430 | * @return Order of block. |
429 | * @return Order of block. |
431 | */ |
430 | */ |
432 | static uint8_t zone_buddy_get_order(buddy_system_t *b, link_t *block) |
431 | static uint8_t zone_buddy_get_order(buddy_system_t *b, link_t *block) |
433 | { |
432 | { |
434 | frame_t *frame; |
433 | frame_t *frame; |
435 | frame = list_get_instance(block, frame_t, buddy_link); |
434 | frame = list_get_instance(block, frame_t, buddy_link); |
436 | return frame->buddy_order; |
435 | return frame->buddy_order; |
437 | } |
436 | } |
438 | 437 | ||
439 | /** Buddy system mark_busy implementation. |
438 | /** Buddy system mark_busy implementation. |
440 | * |
439 | * |
441 | * @param b Buddy system. |
440 | * @param b Buddy system. |
442 | * @param block Buddy system block. |
441 | * @param block Buddy system block. |
443 | */ |
442 | */ |
444 | static void zone_buddy_mark_busy(buddy_system_t *b, link_t * block) |
443 | static void zone_buddy_mark_busy(buddy_system_t *b, link_t * block) |
445 | { |
444 | { |
446 | frame_t * frame; |
445 | frame_t * frame; |
447 | 446 | ||
448 | frame = list_get_instance(block, frame_t, buddy_link); |
447 | frame = list_get_instance(block, frame_t, buddy_link); |
449 | frame->refcount = 1; |
448 | frame->refcount = 1; |
450 | } |
449 | } |
451 | 450 | ||
452 | /** Buddy system mark_available implementation. |
451 | /** Buddy system mark_available implementation. |
453 | * |
452 | * |
454 | * @param b Buddy system. |
453 | * @param b Buddy system. |
455 | * @param block Buddy system block. |
454 | * @param block Buddy system block. |
456 | */ |
455 | */ |
457 | static void zone_buddy_mark_available(buddy_system_t *b, link_t *block) |
456 | static void zone_buddy_mark_available(buddy_system_t *b, link_t *block) |
458 | { |
457 | { |
459 | frame_t *frame; |
458 | frame_t *frame; |
460 | frame = list_get_instance(block, frame_t, buddy_link); |
459 | frame = list_get_instance(block, frame_t, buddy_link); |
461 | frame->refcount = 0; |
460 | frame->refcount = 0; |
462 | } |
461 | } |
463 | 462 | ||
464 | static buddy_system_operations_t zone_buddy_system_operations = { |
463 | static buddy_system_operations_t zone_buddy_system_operations = { |
465 | .find_buddy = zone_buddy_find_buddy, |
464 | .find_buddy = zone_buddy_find_buddy, |
466 | .bisect = zone_buddy_bisect, |
465 | .bisect = zone_buddy_bisect, |
467 | .coalesce = zone_buddy_coalesce, |
466 | .coalesce = zone_buddy_coalesce, |
468 | .set_order = zone_buddy_set_order, |
467 | .set_order = zone_buddy_set_order, |
469 | .get_order = zone_buddy_get_order, |
468 | .get_order = zone_buddy_get_order, |
470 | .mark_busy = zone_buddy_mark_busy, |
469 | .mark_busy = zone_buddy_mark_busy, |
471 | .mark_available = zone_buddy_mark_available, |
470 | .mark_available = zone_buddy_mark_available, |
472 | .find_block = zone_buddy_find_block, |
471 | .find_block = zone_buddy_find_block |
473 | .print_id = zone_buddy_print_id |
- | |
474 | }; |
472 | }; |
475 | 473 | ||
476 | /******************/ |
474 | /******************/ |
477 | /* Zone functions */ |
475 | /* Zone functions */ |
478 | /******************/ |
476 | /******************/ |
479 | 477 | ||
480 | /** Allocate frame in particular zone. |
478 | /** Allocate frame in particular zone. |
481 | * |
479 | * |
482 | * Assume zone is locked. |
480 | * Assume zone is locked. |
483 | * Panics if allocation is impossible. |
481 | * Panics if allocation is impossible. |
484 | * |
482 | * |
485 | * @param zone Zone to allocate from. |
483 | * @param zone Zone to allocate from. |
486 | * @param order Allocate exactly 2^order frames. |
484 | * @param order Allocate exactly 2^order frames. |
487 | * |
485 | * |
488 | * @return Frame index in zone. |
486 | * @return Frame index in zone. |
489 | * |
487 | * |
490 | */ |
488 | */ |
491 | static pfn_t zone_frame_alloc(zone_t *zone, uint8_t order) |
489 | static pfn_t zone_frame_alloc(zone_t *zone, uint8_t order) |
492 | { |
490 | { |
493 | pfn_t v; |
491 | pfn_t v; |
494 | link_t *tmp; |
492 | link_t *tmp; |
495 | frame_t *frame; |
493 | frame_t *frame; |
496 | 494 | ||
497 | /* Allocate frames from zone buddy system */ |
495 | /* Allocate frames from zone buddy system */ |
498 | tmp = buddy_system_alloc(zone->buddy_system, order); |
496 | tmp = buddy_system_alloc(zone->buddy_system, order); |
499 | 497 | ||
500 | ASSERT(tmp); |
498 | ASSERT(tmp); |
501 | 499 | ||
502 | /* Update zone information. */ |
500 | /* Update zone information. */ |
503 | zone->free_count -= (1 << order); |
501 | zone->free_count -= (1 << order); |
504 | zone->busy_count += (1 << order); |
502 | zone->busy_count += (1 << order); |
505 | 503 | ||
506 | /* Frame will be actually a first frame of the block. */ |
504 | /* Frame will be actually a first frame of the block. */ |
507 | frame = list_get_instance(tmp, frame_t, buddy_link); |
505 | frame = list_get_instance(tmp, frame_t, buddy_link); |
508 | 506 | ||
509 | /* get frame address */ |
507 | /* get frame address */ |
510 | v = make_frame_index(zone, frame); |
508 | v = make_frame_index(zone, frame); |
511 | return v; |
509 | return v; |
512 | } |
510 | } |
513 | 511 | ||
514 | /** Free frame from zone. |
512 | /** Free frame from zone. |
515 | * |
513 | * |
516 | * Assume zone is locked. |
514 | * Assume zone is locked. |
517 | * |
515 | * |
518 | * @param zone Pointer to zone from which the frame is to be freed. |
516 | * @param zone Pointer to zone from which the frame is to be freed. |
519 | * @param frame_idx Frame index relative to zone. |
517 | * @param frame_idx Frame index relative to zone. |
520 | */ |
518 | */ |
521 | static void zone_frame_free(zone_t *zone, index_t frame_idx) |
519 | static void zone_frame_free(zone_t *zone, index_t frame_idx) |
522 | { |
520 | { |
523 | frame_t *frame; |
521 | frame_t *frame; |
524 | uint8_t order; |
522 | uint8_t order; |
525 | 523 | ||
526 | frame = &zone->frames[frame_idx]; |
524 | frame = &zone->frames[frame_idx]; |
527 | 525 | ||
528 | /* remember frame order */ |
526 | /* remember frame order */ |
529 | order = frame->buddy_order; |
527 | order = frame->buddy_order; |
530 | 528 | ||
531 | ASSERT(frame->refcount); |
529 | ASSERT(frame->refcount); |
532 | 530 | ||
533 | if (!--frame->refcount) { |
531 | if (!--frame->refcount) { |
534 | buddy_system_free(zone->buddy_system, &frame->buddy_link); |
532 | buddy_system_free(zone->buddy_system, &frame->buddy_link); |
535 | 533 | ||
536 | /* Update zone information. */ |
534 | /* Update zone information. */ |
537 | zone->free_count += (1 << order); |
535 | zone->free_count += (1 << order); |
538 | zone->busy_count -= (1 << order); |
536 | zone->busy_count -= (1 << order); |
539 | } |
537 | } |
540 | } |
538 | } |
541 | 539 | ||
542 | /** Return frame from zone. */ |
540 | /** Return frame from zone. */ |
543 | static frame_t *zone_get_frame(zone_t *zone, index_t frame_idx) |
541 | static frame_t *zone_get_frame(zone_t *zone, index_t frame_idx) |
544 | { |
542 | { |
545 | ASSERT(frame_idx < zone->count); |
543 | ASSERT(frame_idx < zone->count); |
546 | return &zone->frames[frame_idx]; |
544 | return &zone->frames[frame_idx]; |
547 | } |
545 | } |
548 | 546 | ||
549 | /** Mark frame in zone unavailable to allocation. */ |
547 | /** Mark frame in zone unavailable to allocation. */ |
550 | static void zone_mark_unavailable(zone_t *zone, index_t frame_idx) |
548 | static void zone_mark_unavailable(zone_t *zone, index_t frame_idx) |
551 | { |
549 | { |
552 | frame_t *frame; |
550 | frame_t *frame; |
553 | link_t *link; |
551 | link_t *link; |
554 | 552 | ||
555 | frame = zone_get_frame(zone, frame_idx); |
553 | frame = zone_get_frame(zone, frame_idx); |
556 | if (frame->refcount) |
554 | if (frame->refcount) |
557 | return; |
555 | return; |
558 | link = buddy_system_alloc_block(zone->buddy_system, |
556 | link = buddy_system_alloc_block(zone->buddy_system, |
559 | &frame->buddy_link); |
557 | &frame->buddy_link); |
560 | ASSERT(link); |
558 | ASSERT(link); |
561 | zone->free_count--; |
559 | zone->free_count--; |
562 | 560 | ||
563 | mutex_lock(&mem_avail_mtx); |
561 | mutex_lock(&mem_avail_mtx); |
564 | mem_avail_frames--; |
562 | mem_avail_frames--; |
565 | mutex_unlock(&mem_avail_mtx); |
563 | mutex_unlock(&mem_avail_mtx); |
566 | } |
564 | } |
567 | 565 | ||
568 | /** Join two zones. |
566 | /** Join two zones. |
569 | * |
567 | * |
570 | * Expect zone_t *z to point to space at least zone_conf_size large. |
568 | * Expect zone_t *z to point to space at least zone_conf_size large. |
571 | * |
569 | * |
572 | * Assume z1 & z2 are locked. |
570 | * Assume z1 & z2 are locked. |
573 | * |
571 | * |
574 | * @param z Target zone structure pointer. |
572 | * @param z Target zone structure pointer. |
575 | * @param z1 Zone to merge. |
573 | * @param z1 Zone to merge. |
576 | * @param z2 Zone to merge. |
574 | * @param z2 Zone to merge. |
577 | */ |
575 | */ |
578 | static void _zone_merge(zone_t *z, zone_t *z1, zone_t *z2) |
576 | static void _zone_merge(zone_t *z, zone_t *z1, zone_t *z2) |
579 | { |
577 | { |
580 | uint8_t max_order; |
578 | uint8_t max_order; |
581 | unsigned int i; |
579 | unsigned int i; |
582 | int z2idx; |
580 | int z2idx; |
583 | pfn_t frame_idx; |
581 | pfn_t frame_idx; |
584 | frame_t *frame; |
582 | frame_t *frame; |
585 | 583 | ||
586 | ASSERT(!overlaps(z1->base, z1->count, z2->base, z2->count)); |
584 | ASSERT(!overlaps(z1->base, z1->count, z2->base, z2->count)); |
587 | ASSERT(z1->base < z2->base); |
585 | ASSERT(z1->base < z2->base); |
588 | 586 | ||
589 | spinlock_initialize(&z->lock, "zone_lock"); |
587 | spinlock_initialize(&z->lock, "zone_lock"); |
590 | z->base = z1->base; |
588 | z->base = z1->base; |
591 | z->count = z2->base + z2->count - z1->base; |
589 | z->count = z2->base + z2->count - z1->base; |
592 | z->flags = z1->flags & z2->flags; |
590 | z->flags = z1->flags & z2->flags; |
593 | 591 | ||
594 | z->free_count = z1->free_count + z2->free_count; |
592 | z->free_count = z1->free_count + z2->free_count; |
595 | z->busy_count = z1->busy_count + z2->busy_count; |
593 | z->busy_count = z1->busy_count + z2->busy_count; |
596 | 594 | ||
597 | max_order = fnzb(z->count); |
595 | max_order = fnzb(z->count); |
598 | 596 | ||
599 | z->buddy_system = (buddy_system_t *) &z[1]; |
597 | z->buddy_system = (buddy_system_t *) &z[1]; |
600 | buddy_system_create(z->buddy_system, max_order, |
598 | buddy_system_create(z->buddy_system, max_order, |
601 | &zone_buddy_system_operations, (void *) z); |
599 | &zone_buddy_system_operations, (void *) z); |
602 | 600 | ||
603 | z->frames = (frame_t *)((uint8_t *) z->buddy_system + |
601 | z->frames = (frame_t *)((uint8_t *) z->buddy_system + |
604 | buddy_conf_size(max_order)); |
602 | buddy_conf_size(max_order)); |
605 | for (i = 0; i < z->count; i++) { |
603 | for (i = 0; i < z->count; i++) { |
606 | /* This marks all frames busy */ |
604 | /* This marks all frames busy */ |
607 | frame_initialize(&z->frames[i]); |
605 | frame_initialize(&z->frames[i]); |
608 | } |
606 | } |
609 | /* Copy frames from both zones to preserve full frame orders, |
607 | /* Copy frames from both zones to preserve full frame orders, |
610 | * parents etc. Set all free frames with refcount=0 to 1, because |
608 | * parents etc. Set all free frames with refcount=0 to 1, because |
611 | * we add all free frames to buddy allocator later again, clear |
609 | * we add all free frames to buddy allocator later again, clear |
612 | * order to 0. Don't set busy frames with refcount=0, as they |
610 | * order to 0. Don't set busy frames with refcount=0, as they |
613 | * will not be reallocated during merge and it would make later |
611 | * will not be reallocated during merge and it would make later |
614 | * problems with allocation/free. |
612 | * problems with allocation/free. |
615 | */ |
613 | */ |
616 | for (i = 0; i < z1->count; i++) |
614 | for (i = 0; i < z1->count; i++) |
617 | z->frames[i] = z1->frames[i]; |
615 | z->frames[i] = z1->frames[i]; |
618 | for (i = 0; i < z2->count; i++) { |
616 | for (i = 0; i < z2->count; i++) { |
619 | z2idx = i + (z2->base - z1->base); |
617 | z2idx = i + (z2->base - z1->base); |
620 | z->frames[z2idx] = z2->frames[i]; |
618 | z->frames[z2idx] = z2->frames[i]; |
621 | } |
619 | } |
622 | i = 0; |
620 | i = 0; |
623 | while (i < z->count) { |
621 | while (i < z->count) { |
624 | if (z->frames[i].refcount) { |
622 | if (z->frames[i].refcount) { |
625 | /* skip busy frames */ |
623 | /* skip busy frames */ |
626 | i += 1 << z->frames[i].buddy_order; |
624 | i += 1 << z->frames[i].buddy_order; |
627 | } else { /* Free frames, set refcount=1 */ |
625 | } else { /* Free frames, set refcount=1 */ |
628 | /* All free frames have refcount=0, we need not |
626 | /* All free frames have refcount=0, we need not |
629 | * to check the order */ |
627 | * to check the order */ |
630 | z->frames[i].refcount = 1; |
628 | z->frames[i].refcount = 1; |
631 | z->frames[i].buddy_order = 0; |
629 | z->frames[i].buddy_order = 0; |
632 | i++; |
630 | i++; |
633 | } |
631 | } |
634 | } |
632 | } |
635 | /* Add free blocks from the 2 original zones */ |
633 | /* Add free blocks from the 2 original zones */ |
636 | while (zone_can_alloc(z1, 0)) { |
634 | while (zone_can_alloc(z1, 0)) { |
637 | frame_idx = zone_frame_alloc(z1, 0); |
635 | frame_idx = zone_frame_alloc(z1, 0); |
638 | frame = &z->frames[frame_idx]; |
636 | frame = &z->frames[frame_idx]; |
639 | frame->refcount = 0; |
637 | frame->refcount = 0; |
640 | buddy_system_free(z->buddy_system, &frame->buddy_link); |
638 | buddy_system_free(z->buddy_system, &frame->buddy_link); |
641 | } |
639 | } |
642 | while (zone_can_alloc(z2, 0)) { |
640 | while (zone_can_alloc(z2, 0)) { |
643 | frame_idx = zone_frame_alloc(z2, 0); |
641 | frame_idx = zone_frame_alloc(z2, 0); |
644 | frame = &z->frames[frame_idx + (z2->base - z1->base)]; |
642 | frame = &z->frames[frame_idx + (z2->base - z1->base)]; |
645 | frame->refcount = 0; |
643 | frame->refcount = 0; |
646 | buddy_system_free(z->buddy_system, &frame->buddy_link); |
644 | buddy_system_free(z->buddy_system, &frame->buddy_link); |
647 | } |
645 | } |
648 | } |
646 | } |
649 | 647 | ||
650 | /** Return old configuration frames into the zone. |
648 | /** Return old configuration frames into the zone. |
651 | * |
649 | * |
652 | * We have several cases |
650 | * We have several cases |
653 | * - the conf. data is outside of zone -> exit, shall we call frame_free?? |
651 | * - the conf. data is outside of zone -> exit, shall we call frame_free?? |
654 | * - the conf. data was created by zone_create or |
652 | * - the conf. data was created by zone_create or |
655 | * updated with reduce_region -> free every frame |
653 | * updated with reduce_region -> free every frame |
656 | * |
654 | * |
657 | * @param newzone The actual zone where freeing should occur. |
655 | * @param newzone The actual zone where freeing should occur. |
658 | * @param oldzone Pointer to old zone configuration data that should |
656 | * @param oldzone Pointer to old zone configuration data that should |
659 | * be freed from new zone. |
657 | * be freed from new zone. |
660 | */ |
658 | */ |
661 | static void return_config_frames(zone_t *newzone, zone_t *oldzone) |
659 | static void return_config_frames(zone_t *newzone, zone_t *oldzone) |
662 | { |
660 | { |
663 | pfn_t pfn; |
661 | pfn_t pfn; |
664 | frame_t *frame; |
662 | frame_t *frame; |
665 | count_t cframes; |
663 | count_t cframes; |
666 | unsigned int i; |
664 | unsigned int i; |
667 | 665 | ||
668 | pfn = ADDR2PFN((uintptr_t)KA2PA(oldzone)); |
666 | pfn = ADDR2PFN((uintptr_t)KA2PA(oldzone)); |
669 | cframes = SIZE2FRAMES(zone_conf_size(oldzone->count)); |
667 | cframes = SIZE2FRAMES(zone_conf_size(oldzone->count)); |
670 | 668 | ||
671 | if (pfn < newzone->base || pfn >= newzone->base + newzone->count) |
669 | if (pfn < newzone->base || pfn >= newzone->base + newzone->count) |
672 | return; |
670 | return; |
673 | 671 | ||
674 | frame = &newzone->frames[pfn - newzone->base]; |
672 | frame = &newzone->frames[pfn - newzone->base]; |
675 | ASSERT(!frame->buddy_order); |
673 | ASSERT(!frame->buddy_order); |
676 | 674 | ||
677 | for (i = 0; i < cframes; i++) { |
675 | for (i = 0; i < cframes; i++) { |
678 | newzone->busy_count++; |
676 | newzone->busy_count++; |
679 | zone_frame_free(newzone, pfn+i-newzone->base); |
677 | zone_frame_free(newzone, pfn+i-newzone->base); |
680 | } |
678 | } |
681 | } |
679 | } |
682 | 680 | ||
683 | /** Reduce allocated block to count of order 0 frames. |
681 | /** Reduce allocated block to count of order 0 frames. |
684 | * |
682 | * |
685 | * The allocated block need 2^order frames of space. Reduce all frames |
683 | * The allocated block need 2^order frames of space. Reduce all frames |
686 | * in block to order 0 and free the unneeded frames. This means, that |
684 | * in block to order 0 and free the unneeded frames. This means, that |
687 | * when freeing the previously allocated block starting with frame_idx, |
685 | * when freeing the previously allocated block starting with frame_idx, |
688 | * you have to free every frame. |
686 | * you have to free every frame. |
689 | * |
687 | * |
690 | * @param zone |
688 | * @param zone |
691 | * @param frame_idx Index to block. |
689 | * @param frame_idx Index to block. |
692 | * @param count Allocated space in block. |
690 | * @param count Allocated space in block. |
693 | */ |
691 | */ |
694 | static void zone_reduce_region(zone_t *zone, pfn_t frame_idx, count_t count) |
692 | static void zone_reduce_region(zone_t *zone, pfn_t frame_idx, count_t count) |
695 | { |
693 | { |
696 | count_t i; |
694 | count_t i; |
697 | uint8_t order; |
695 | uint8_t order; |
698 | frame_t *frame; |
696 | frame_t *frame; |
699 | 697 | ||
700 | ASSERT(frame_idx + count < zone->count); |
698 | ASSERT(frame_idx + count < zone->count); |
701 | 699 | ||
702 | order = zone->frames[frame_idx].buddy_order; |
700 | order = zone->frames[frame_idx].buddy_order; |
703 | ASSERT((count_t) (1 << order) >= count); |
701 | ASSERT((count_t) (1 << order) >= count); |
704 | 702 | ||
705 | /* Reduce all blocks to order 0 */ |
703 | /* Reduce all blocks to order 0 */ |
706 | for (i = 0; i < (count_t) (1 << order); i++) { |
704 | for (i = 0; i < (count_t) (1 << order); i++) { |
707 | frame = &zone->frames[i + frame_idx]; |
705 | frame = &zone->frames[i + frame_idx]; |
708 | frame->buddy_order = 0; |
706 | frame->buddy_order = 0; |
709 | if (!frame->refcount) |
707 | if (!frame->refcount) |
710 | frame->refcount = 1; |
708 | frame->refcount = 1; |
711 | ASSERT(frame->refcount == 1); |
709 | ASSERT(frame->refcount == 1); |
712 | } |
710 | } |
713 | /* Free unneeded frames */ |
711 | /* Free unneeded frames */ |
714 | for (i = count; i < (count_t) (1 << order); i++) { |
712 | for (i = count; i < (count_t) (1 << order); i++) { |
715 | zone_frame_free(zone, i + frame_idx); |
713 | zone_frame_free(zone, i + frame_idx); |
716 | } |
714 | } |
717 | } |
715 | } |
718 | 716 | ||
719 | /** Merge zones z1 and z2. |
717 | /** Merge zones z1 and z2. |
720 | * |
718 | * |
721 | * - the zones must be 2 zones with no zone existing in between, |
719 | * - the zones must be 2 zones with no zone existing in between, |
722 | * which means that z2 = z1+1 |
720 | * which means that z2 = z1+1 |
723 | * |
721 | * |
724 | * - When you create a new zone, the frame allocator configuration does |
722 | * - When you create a new zone, the frame allocator configuration does |
725 | * not to be 2^order size. Once the allocator is running it is no longer |
723 | * not to be 2^order size. Once the allocator is running it is no longer |
726 | * possible, merged configuration data occupies more space :-/ |
724 | * possible, merged configuration data occupies more space :-/ |
727 | */ |
725 | */ |
728 | void zone_merge(unsigned int z1, unsigned int z2) |
726 | void zone_merge(unsigned int z1, unsigned int z2) |
729 | { |
727 | { |
730 | ipl_t ipl; |
728 | ipl_t ipl; |
731 | zone_t *zone1, *zone2, *newzone; |
729 | zone_t *zone1, *zone2, *newzone; |
732 | unsigned int cframes; |
730 | unsigned int cframes; |
733 | uint8_t order; |
731 | uint8_t order; |
734 | unsigned int i; |
732 | unsigned int i; |
735 | pfn_t pfn; |
733 | pfn_t pfn; |
736 | 734 | ||
737 | ipl = interrupts_disable(); |
735 | ipl = interrupts_disable(); |
738 | spinlock_lock(&zones.lock); |
736 | spinlock_lock(&zones.lock); |
739 | 737 | ||
740 | if ((z1 >= zones.count) || (z2 >= zones.count)) |
738 | if ((z1 >= zones.count) || (z2 >= zones.count)) |
741 | goto errout; |
739 | goto errout; |
742 | /* We can join only 2 zones with none existing inbetween */ |
740 | /* We can join only 2 zones with none existing inbetween */ |
743 | if (z2 - z1 != 1) |
741 | if (z2 - z1 != 1) |
744 | goto errout; |
742 | goto errout; |
745 | 743 | ||
746 | zone1 = zones.info[z1]; |
744 | zone1 = zones.info[z1]; |
747 | zone2 = zones.info[z2]; |
745 | zone2 = zones.info[z2]; |
748 | spinlock_lock(&zone1->lock); |
746 | spinlock_lock(&zone1->lock); |
749 | spinlock_lock(&zone2->lock); |
747 | spinlock_lock(&zone2->lock); |
750 | 748 | ||
751 | cframes = SIZE2FRAMES(zone_conf_size(zone2->base + zone2->count - |
749 | cframes = SIZE2FRAMES(zone_conf_size(zone2->base + zone2->count - |
752 | zone1->base)); |
750 | zone1->base)); |
753 | if (cframes == 1) |
751 | if (cframes == 1) |
754 | order = 0; |
752 | order = 0; |
755 | else |
753 | else |
756 | order = fnzb(cframes - 1) + 1; |
754 | order = fnzb(cframes - 1) + 1; |
757 | 755 | ||
758 | /* Allocate zonedata inside one of the zones */ |
756 | /* Allocate zonedata inside one of the zones */ |
759 | if (zone_can_alloc(zone1, order)) |
757 | if (zone_can_alloc(zone1, order)) |
760 | pfn = zone1->base + zone_frame_alloc(zone1, order); |
758 | pfn = zone1->base + zone_frame_alloc(zone1, order); |
761 | else if (zone_can_alloc(zone2, order)) |
759 | else if (zone_can_alloc(zone2, order)) |
762 | pfn = zone2->base + zone_frame_alloc(zone2, order); |
760 | pfn = zone2->base + zone_frame_alloc(zone2, order); |
763 | else |
761 | else |
764 | goto errout2; |
762 | goto errout2; |
765 | 763 | ||
766 | newzone = (zone_t *) PA2KA(PFN2ADDR(pfn)); |
764 | newzone = (zone_t *) PA2KA(PFN2ADDR(pfn)); |
767 | 765 | ||
768 | _zone_merge(newzone, zone1, zone2); |
766 | _zone_merge(newzone, zone1, zone2); |
769 | 767 | ||
770 | /* Free unneeded config frames */ |
768 | /* Free unneeded config frames */ |
771 | zone_reduce_region(newzone, pfn - newzone->base, cframes); |
769 | zone_reduce_region(newzone, pfn - newzone->base, cframes); |
772 | /* Subtract zone information from busy frames */ |
770 | /* Subtract zone information from busy frames */ |
773 | newzone->busy_count -= cframes; |
771 | newzone->busy_count -= cframes; |
774 | 772 | ||
775 | /* Replace existing zones in zoneinfo list */ |
773 | /* Replace existing zones in zoneinfo list */ |
776 | zones.info[z1] = newzone; |
774 | zones.info[z1] = newzone; |
777 | for (i = z2 + 1; i < zones.count; i++) |
775 | for (i = z2 + 1; i < zones.count; i++) |
778 | zones.info[i - 1] = zones.info[i]; |
776 | zones.info[i - 1] = zones.info[i]; |
779 | zones.count--; |
777 | zones.count--; |
780 | 778 | ||
781 | /* Free old zone information */ |
779 | /* Free old zone information */ |
782 | return_config_frames(newzone, zone1); |
780 | return_config_frames(newzone, zone1); |
783 | return_config_frames(newzone, zone2); |
781 | return_config_frames(newzone, zone2); |
784 | errout2: |
782 | errout2: |
785 | /* Nobody is allowed to enter to zone, so we are safe |
783 | /* Nobody is allowed to enter to zone, so we are safe |
786 | * to touch the spinlocks last time */ |
784 | * to touch the spinlocks last time */ |
787 | spinlock_unlock(&zone1->lock); |
785 | spinlock_unlock(&zone1->lock); |
788 | spinlock_unlock(&zone2->lock); |
786 | spinlock_unlock(&zone2->lock); |
789 | errout: |
787 | errout: |
790 | spinlock_unlock(&zones.lock); |
788 | spinlock_unlock(&zones.lock); |
791 | interrupts_restore(ipl); |
789 | interrupts_restore(ipl); |
792 | } |
790 | } |
793 | 791 | ||
794 | /** Merge all zones into one big zone. |
792 | /** Merge all zones into one big zone. |
795 | * |
793 | * |
796 | * It is reasonable to do this on systems whose bios reports parts in chunks, |
794 | * It is reasonable to do this on systems whose bios reports parts in chunks, |
797 | * so that we could have 1 zone (it's faster). |
795 | * so that we could have 1 zone (it's faster). |
798 | */ |
796 | */ |
799 | void zone_merge_all(void) |
797 | void zone_merge_all(void) |
800 | { |
798 | { |
801 | int count = zones.count; |
799 | int count = zones.count; |
802 | 800 | ||
803 | while (zones.count > 1 && --count) { |
801 | while (zones.count > 1 && --count) { |
804 | zone_merge(0, 1); |
802 | zone_merge(0, 1); |
805 | break; |
803 | break; |
806 | } |
804 | } |
807 | } |
805 | } |
808 | 806 | ||
809 | /** Create new frame zone. |
807 | /** Create new frame zone. |
810 | * |
808 | * |
811 | * @param start Physical address of the first frame within the zone. |
809 | * @param start Physical address of the first frame within the zone. |
812 | * @param count Count of frames in zone. |
810 | * @param count Count of frames in zone. |
813 | * @param z Address of configuration information of zone. |
811 | * @param z Address of configuration information of zone. |
814 | * @param flags Zone flags. |
812 | * @param flags Zone flags. |
815 | * |
813 | * |
816 | * @return Initialized zone. |
814 | * @return Initialized zone. |
817 | */ |
815 | */ |
818 | static void zone_construct(pfn_t start, count_t count, zone_t *z, int flags) |
816 | static void zone_construct(pfn_t start, count_t count, zone_t *z, int flags) |
819 | { |
817 | { |
820 | unsigned int i; |
818 | unsigned int i; |
821 | uint8_t max_order; |
819 | uint8_t max_order; |
822 | 820 | ||
823 | spinlock_initialize(&z->lock, "zone_lock"); |
821 | spinlock_initialize(&z->lock, "zone_lock"); |
824 | z->base = start; |
822 | z->base = start; |
825 | z->count = count; |
823 | z->count = count; |
- | 824 | ||
- | 825 | /* Mask off flags that are calculated automatically. */ |
|
- | 826 | flags &= ~FRAME_LOW_4_GiB; |
|
- | 827 | /* Determine calculated flags. */ |
|
- | 828 | if (z->base + count < (1ULL << (32 - FRAME_WIDTH))) /* 4 GiB */ |
|
- | 829 | flags |= FRAME_LOW_4_GiB; |
|
- | 830 | ||
826 | z->flags = flags; |
831 | z->flags = flags; |
- | 832 | ||
827 | z->free_count = count; |
833 | z->free_count = count; |
828 | z->busy_count = 0; |
834 | z->busy_count = 0; |
829 | 835 | ||
830 | /* |
836 | /* |
831 | * Compute order for buddy system, initialize |
837 | * Compute order for buddy system, initialize |
832 | */ |
838 | */ |
833 | max_order = fnzb(count); |
839 | max_order = fnzb(count); |
834 | z->buddy_system = (buddy_system_t *)&z[1]; |
840 | z->buddy_system = (buddy_system_t *)&z[1]; |
835 | 841 | ||
836 | buddy_system_create(z->buddy_system, max_order, |
842 | buddy_system_create(z->buddy_system, max_order, |
837 | &zone_buddy_system_operations, (void *) z); |
843 | &zone_buddy_system_operations, (void *) z); |
838 | 844 | ||
839 | /* Allocate frames _after_ the conframe */ |
845 | /* Allocate frames _after_ the conframe */ |
840 | /* Check sizes */ |
846 | /* Check sizes */ |
841 | z->frames = (frame_t *)((uint8_t *) z->buddy_system + |
847 | z->frames = (frame_t *)((uint8_t *) z->buddy_system + |
842 | buddy_conf_size(max_order)); |
848 | buddy_conf_size(max_order)); |
843 | for (i = 0; i < count; i++) { |
849 | for (i = 0; i < count; i++) { |
844 | frame_initialize(&z->frames[i]); |
850 | frame_initialize(&z->frames[i]); |
845 | } |
851 | } |
846 | 852 | ||
847 | /* Stuffing frames */ |
853 | /* Stuffing frames */ |
848 | for (i = 0; i < count; i++) { |
854 | for (i = 0; i < count; i++) { |
849 | z->frames[i].refcount = 0; |
855 | z->frames[i].refcount = 0; |
850 | buddy_system_free(z->buddy_system, &z->frames[i].buddy_link); |
856 | buddy_system_free(z->buddy_system, &z->frames[i].buddy_link); |
851 | } |
857 | } |
852 | } |
858 | } |
853 | 859 | ||
854 | /** Compute configuration data size for zone. |
860 | /** Compute configuration data size for zone. |
855 | * |
861 | * |
856 | * @param count Size of zone in frames. |
862 | * @param count Size of zone in frames. |
857 | * @return Size of zone configuration info (in bytes). |
863 | * @return Size of zone configuration info (in bytes). |
858 | */ |
864 | */ |
859 | uintptr_t zone_conf_size(count_t count) |
865 | uintptr_t zone_conf_size(count_t count) |
860 | { |
866 | { |
861 | int size = sizeof(zone_t) + count * sizeof(frame_t); |
867 | int size = sizeof(zone_t) + count * sizeof(frame_t); |
862 | int max_order; |
868 | int max_order; |
863 | 869 | ||
864 | max_order = fnzb(count); |
870 | max_order = fnzb(count); |
865 | size += buddy_conf_size(max_order); |
871 | size += buddy_conf_size(max_order); |
866 | return size; |
872 | return size; |
867 | } |
873 | } |
868 | 874 | ||
869 | /** Create and add zone to system. |
875 | /** Create and add zone to system. |
870 | * |
876 | * |
871 | * @param start First frame number (absolute). |
877 | * @param start First frame number (absolute). |
872 | * @param count Size of zone in frames. |
878 | * @param count Size of zone in frames. |
873 | * @param confframe Where configuration frames are supposed to be. |
879 | * @param confframe Where configuration frames are supposed to be. |
874 | * Automatically checks, that we will not disturb the |
880 | * Automatically checks, that we will not disturb the |
875 | * kernel and possibly init. If confframe is given |
881 | * kernel and possibly init. If confframe is given |
876 | * _outside_ this zone, it is expected, that the area is |
882 | * _outside_ this zone, it is expected, that the area is |
877 | * already marked BUSY and big enough to contain |
883 | * already marked BUSY and big enough to contain |
878 | * zone_conf_size() amount of data. If the confframe is |
884 | * zone_conf_size() amount of data. If the confframe is |
879 | * inside the area, the zone free frame information is |
885 | * inside the area, the zone free frame information is |
880 | * modified not to include it. |
886 | * modified not to include it. |
881 | * |
887 | * |
882 | * @return Zone number or -1 on error. |
888 | * @return Zone number or -1 on error. |
883 | */ |
889 | */ |
884 | int zone_create(pfn_t start, count_t count, pfn_t confframe, int flags) |
890 | int zone_create(pfn_t start, count_t count, pfn_t confframe, int flags) |
885 | { |
891 | { |
886 | zone_t *z; |
892 | zone_t *z; |
887 | uintptr_t addr; |
893 | uintptr_t addr; |
888 | count_t confcount; |
894 | count_t confcount; |
889 | unsigned int i; |
895 | unsigned int i; |
890 | int znum; |
896 | int znum; |
891 | 897 | ||
892 | /* Theoretically we could have here 0, practically make sure |
898 | /* Theoretically we could have here 0, practically make sure |
893 | * nobody tries to do that. If some platform requires, remove |
899 | * nobody tries to do that. If some platform requires, remove |
894 | * the assert |
900 | * the assert |
895 | */ |
901 | */ |
896 | ASSERT(confframe); |
902 | ASSERT(confframe); |
897 | /* If conframe is supposed to be inside our zone, then make sure |
903 | /* If conframe is supposed to be inside our zone, then make sure |
898 | * it does not span kernel & init |
904 | * it does not span kernel & init |
899 | */ |
905 | */ |
900 | confcount = SIZE2FRAMES(zone_conf_size(count)); |
906 | confcount = SIZE2FRAMES(zone_conf_size(count)); |
901 | if (confframe >= start && confframe < start + count) { |
907 | if (confframe >= start && confframe < start + count) { |
902 | for (; confframe < start + count; confframe++) { |
908 | for (; confframe < start + count; confframe++) { |
903 | addr = PFN2ADDR(confframe); |
909 | addr = PFN2ADDR(confframe); |
904 | if (overlaps(addr, PFN2ADDR(confcount), |
910 | if (overlaps(addr, PFN2ADDR(confcount), |
905 | KA2PA(config.base), config.kernel_size)) |
911 | KA2PA(config.base), config.kernel_size)) |
906 | continue; |
912 | continue; |
907 | 913 | ||
908 | if (overlaps(addr, PFN2ADDR(confcount), |
914 | if (overlaps(addr, PFN2ADDR(confcount), |
909 | KA2PA(config.stack_base), config.stack_size)) |
915 | KA2PA(config.stack_base), config.stack_size)) |
910 | continue; |
916 | continue; |
911 | 917 | ||
912 | bool overlap = false; |
918 | bool overlap = false; |
913 | count_t i; |
919 | count_t i; |
914 | for (i = 0; i < init.cnt; i++) |
920 | for (i = 0; i < init.cnt; i++) |
915 | if (overlaps(addr, PFN2ADDR(confcount), |
921 | if (overlaps(addr, PFN2ADDR(confcount), |
916 | KA2PA(init.tasks[i].addr), |
922 | KA2PA(init.tasks[i].addr), |
917 | init.tasks[i].size)) { |
923 | init.tasks[i].size)) { |
918 | overlap = true; |
924 | overlap = true; |
919 | break; |
925 | break; |
920 | } |
926 | } |
921 | if (overlap) |
927 | if (overlap) |
922 | continue; |
928 | continue; |
923 | 929 | ||
924 | break; |
930 | break; |
925 | } |
931 | } |
926 | if (confframe >= start + count) |
932 | if (confframe >= start + count) |
927 | panic("Cannot find configuration data for zone."); |
933 | panic("Cannot find configuration data for zone."); |
928 | } |
934 | } |
929 | 935 | ||
930 | z = (zone_t *) PA2KA(PFN2ADDR(confframe)); |
936 | z = (zone_t *) PA2KA(PFN2ADDR(confframe)); |
931 | zone_construct(start, count, z, flags); |
937 | zone_construct(start, count, z, flags); |
932 | znum = zones_add_zone(z); |
938 | znum = zones_add_zone(z); |
933 | if (znum == -1) |
939 | if (znum == -1) |
934 | return -1; |
940 | return -1; |
935 | 941 | ||
936 | mutex_lock(&mem_avail_mtx); |
942 | mutex_lock(&mem_avail_mtx); |
937 | mem_avail_frames += count; |
943 | mem_avail_frames += count; |
938 | mutex_unlock(&mem_avail_mtx); |
944 | mutex_unlock(&mem_avail_mtx); |
939 | 945 | ||
940 | /* If confdata in zone, mark as unavailable */ |
946 | /* If confdata in zone, mark as unavailable */ |
941 | if (confframe >= start && confframe < start + count) |
947 | if (confframe >= start && confframe < start + count) |
942 | for (i = confframe; i < confframe + confcount; i++) { |
948 | for (i = confframe; i < confframe + confcount; i++) { |
943 | zone_mark_unavailable(z, i - z->base); |
949 | zone_mark_unavailable(z, i - z->base); |
944 | } |
950 | } |
945 | 951 | ||
946 | return znum; |
952 | return znum; |
947 | } |
953 | } |
948 | 954 | ||
949 | /***************************************/ |
955 | /***************************************/ |
950 | /* Frame functions */ |
956 | /* Frame functions */ |
951 | 957 | ||
952 | /** Set parent of frame. */ |
958 | /** Set parent of frame. */ |
953 | void frame_set_parent(pfn_t pfn, void *data, unsigned int hint) |
959 | void frame_set_parent(pfn_t pfn, void *data, unsigned int hint) |
954 | { |
960 | { |
955 | zone_t *zone = find_zone_and_lock(pfn, &hint); |
961 | zone_t *zone = find_zone_and_lock(pfn, &hint); |
956 | 962 | ||
957 | ASSERT(zone); |
963 | ASSERT(zone); |
958 | 964 | ||
959 | zone_get_frame(zone, pfn - zone->base)->parent = data; |
965 | zone_get_frame(zone, pfn - zone->base)->parent = data; |
960 | spinlock_unlock(&zone->lock); |
966 | spinlock_unlock(&zone->lock); |
961 | } |
967 | } |
962 | 968 | ||
963 | void *frame_get_parent(pfn_t pfn, unsigned int hint) |
969 | void *frame_get_parent(pfn_t pfn, unsigned int hint) |
964 | { |
970 | { |
965 | zone_t *zone = find_zone_and_lock(pfn, &hint); |
971 | zone_t *zone = find_zone_and_lock(pfn, &hint); |
966 | void *res; |
972 | void *res; |
967 | 973 | ||
968 | ASSERT(zone); |
974 | ASSERT(zone); |
969 | res = zone_get_frame(zone, pfn - zone->base)->parent; |
975 | res = zone_get_frame(zone, pfn - zone->base)->parent; |
970 | 976 | ||
971 | spinlock_unlock(&zone->lock); |
977 | spinlock_unlock(&zone->lock); |
972 | return res; |
978 | return res; |
973 | } |
979 | } |
974 | 980 | ||
975 | /** Allocate power-of-two frames of physical memory. |
981 | /** Allocate power-of-two frames of physical memory. |
976 | * |
982 | * |
977 | * @param order Allocate exactly 2^order frames. |
983 | * @param order Allocate exactly 2^order frames. |
978 | * @param flags Flags for host zone selection and address processing. |
984 | * @param flags Flags for host zone selection and address processing. |
979 | * @param pzone Preferred zone. |
985 | * @param pzone Preferred zone. |
980 | * |
986 | * |
981 | * @return Physical address of the allocated frame. |
987 | * @return Physical address of the allocated frame. |
982 | * |
988 | * |
983 | */ |
989 | */ |
984 | void *frame_alloc_generic(uint8_t order, int flags, unsigned int *pzone) |
990 | void *frame_alloc_generic(uint8_t order, int flags, unsigned int *pzone) |
985 | { |
991 | { |
986 | ipl_t ipl; |
992 | ipl_t ipl; |
987 | int freed; |
993 | int freed; |
988 | pfn_t v; |
994 | pfn_t v; |
989 | zone_t *zone; |
995 | zone_t *zone; |
990 | unsigned long gen = 0; |
996 | unsigned long gen = 0; |
991 | 997 | ||
992 | loop: |
998 | loop: |
993 | ipl = interrupts_disable(); |
999 | ipl = interrupts_disable(); |
994 | 1000 | ||
995 | /* |
1001 | /* |
996 | * First, find suitable frame zone. |
1002 | * First, find suitable frame zone. |
997 | */ |
1003 | */ |
998 | zone = find_free_zone_and_lock(order, pzone); |
1004 | zone = find_free_zone_and_lock(order, flags, pzone); |
999 | 1005 | ||
1000 | /* If no memory, reclaim some slab memory, |
1006 | /* If no memory, reclaim some slab memory, |
1001 | if it does not help, reclaim all */ |
1007 | if it does not help, reclaim all */ |
1002 | if (!zone && !(flags & FRAME_NO_RECLAIM)) { |
1008 | if (!zone && !(flags & FRAME_NO_RECLAIM)) { |
1003 | freed = slab_reclaim(0); |
1009 | freed = slab_reclaim(0); |
1004 | if (freed) |
1010 | if (freed) |
1005 | zone = find_free_zone_and_lock(order, pzone); |
1011 | zone = find_free_zone_and_lock(order, flags, pzone); |
1006 | if (!zone) { |
1012 | if (!zone) { |
1007 | freed = slab_reclaim(SLAB_RECLAIM_ALL); |
1013 | freed = slab_reclaim(SLAB_RECLAIM_ALL); |
1008 | if (freed) |
1014 | if (freed) |
1009 | zone = find_free_zone_and_lock(order, pzone); |
1015 | zone = find_free_zone_and_lock(order, flags, |
- | 1016 | pzone); |
|
1010 | } |
1017 | } |
1011 | } |
1018 | } |
1012 | if (!zone) { |
1019 | if (!zone) { |
1013 | /* |
1020 | /* |
1014 | * Sleep until some frames are available again. |
1021 | * Sleep until some frames are available again. |
1015 | */ |
1022 | */ |
1016 | if (flags & FRAME_ATOMIC) { |
1023 | if (flags & FRAME_ATOMIC) { |
1017 | interrupts_restore(ipl); |
1024 | interrupts_restore(ipl); |
1018 | return 0; |
1025 | return 0; |
1019 | } |
1026 | } |
1020 | 1027 | ||
1021 | #ifdef CONFIG_DEBUG |
1028 | #ifdef CONFIG_DEBUG |
1022 | unsigned long avail; |
1029 | unsigned long avail; |
1023 | 1030 | ||
1024 | mutex_lock(&mem_avail_mtx); |
1031 | mutex_lock(&mem_avail_mtx); |
1025 | avail = mem_avail_frames; |
1032 | avail = mem_avail_frames; |
1026 | mutex_unlock(&mem_avail_mtx); |
1033 | mutex_unlock(&mem_avail_mtx); |
1027 | 1034 | ||
1028 | printf("Thread %" PRIu64 " waiting for %u frames, " |
1035 | printf("Thread %" PRIu64 " waiting for %u frames, " |
1029 | "%u available.\n", THREAD->tid, 1ULL << order, avail); |
1036 | "%u available.\n", THREAD->tid, 1ULL << order, avail); |
1030 | #endif |
1037 | #endif |
1031 | 1038 | ||
1032 | mutex_lock(&mem_avail_mtx); |
1039 | mutex_lock(&mem_avail_mtx); |
1033 | while ((mem_avail_frames < (1ULL << order)) || |
1040 | while ((mem_avail_frames < (1ULL << order)) || |
1034 | gen == mem_avail_gen) |
1041 | gen == mem_avail_gen) |
1035 | condvar_wait(&mem_avail_cv, &mem_avail_mtx); |
1042 | condvar_wait(&mem_avail_cv, &mem_avail_mtx); |
1036 | gen = mem_avail_gen; |
1043 | gen = mem_avail_gen; |
1037 | mutex_unlock(&mem_avail_mtx); |
1044 | mutex_unlock(&mem_avail_mtx); |
1038 | 1045 | ||
1039 | #ifdef CONFIG_DEBUG |
1046 | #ifdef CONFIG_DEBUG |
1040 | mutex_lock(&mem_avail_mtx); |
1047 | mutex_lock(&mem_avail_mtx); |
1041 | avail = mem_avail_frames; |
1048 | avail = mem_avail_frames; |
1042 | mutex_unlock(&mem_avail_mtx); |
1049 | mutex_unlock(&mem_avail_mtx); |
1043 | 1050 | ||
1044 | printf("Thread %" PRIu64 " woken up, %u frames available.\n", |
1051 | printf("Thread %" PRIu64 " woken up, %u frames available.\n", |
1045 | THREAD->tid, avail); |
1052 | THREAD->tid, avail); |
1046 | #endif |
1053 | #endif |
1047 | 1054 | ||
1048 | interrupts_restore(ipl); |
1055 | interrupts_restore(ipl); |
1049 | goto loop; |
1056 | goto loop; |
1050 | } |
1057 | } |
1051 | 1058 | ||
1052 | v = zone_frame_alloc(zone, order); |
1059 | v = zone_frame_alloc(zone, order); |
1053 | v += zone->base; |
1060 | v += zone->base; |
1054 | 1061 | ||
1055 | spinlock_unlock(&zone->lock); |
1062 | spinlock_unlock(&zone->lock); |
1056 | 1063 | ||
1057 | mutex_lock(&mem_avail_mtx); |
1064 | mutex_lock(&mem_avail_mtx); |
1058 | mem_avail_frames -= (1ULL << order); |
1065 | mem_avail_frames -= (1ULL << order); |
1059 | mutex_unlock(&mem_avail_mtx); |
1066 | mutex_unlock(&mem_avail_mtx); |
1060 | 1067 | ||
1061 | interrupts_restore(ipl); |
1068 | interrupts_restore(ipl); |
1062 | 1069 | ||
1063 | if (flags & FRAME_KA) |
1070 | if (flags & FRAME_KA) |
1064 | return (void *)PA2KA(PFN2ADDR(v)); |
1071 | return (void *)PA2KA(PFN2ADDR(v)); |
1065 | return (void *)PFN2ADDR(v); |
1072 | return (void *)PFN2ADDR(v); |
1066 | } |
1073 | } |
1067 | 1074 | ||
1068 | /** Free a frame. |
1075 | /** Free a frame. |
1069 | * |
1076 | * |
1070 | * Find respective frame structure for supplied physical frame address. |
1077 | * Find respective frame structure for supplied physical frame address. |
1071 | * Decrement frame reference count. |
1078 | * Decrement frame reference count. |
1072 | * If it drops to zero, move the frame structure to free list. |
1079 | * If it drops to zero, move the frame structure to free list. |
1073 | * |
1080 | * |
1074 | * @param frame Physical Address of of the frame to be freed. |
1081 | * @param frame Physical Address of of the frame to be freed. |
1075 | */ |
1082 | */ |
1076 | void frame_free(uintptr_t frame) |
1083 | void frame_free(uintptr_t frame) |
1077 | { |
1084 | { |
1078 | ipl_t ipl; |
1085 | ipl_t ipl; |
1079 | zone_t *zone; |
1086 | zone_t *zone; |
1080 | pfn_t pfn = ADDR2PFN(frame); |
1087 | pfn_t pfn = ADDR2PFN(frame); |
1081 | 1088 | ||
1082 | ipl = interrupts_disable(); |
1089 | ipl = interrupts_disable(); |
1083 | 1090 | ||
1084 | /* |
1091 | /* |
1085 | * First, find host frame zone for addr. |
1092 | * First, find host frame zone for addr. |
1086 | */ |
1093 | */ |
1087 | zone = find_zone_and_lock(pfn, NULL); |
1094 | zone = find_zone_and_lock(pfn, NULL); |
1088 | ASSERT(zone); |
1095 | ASSERT(zone); |
1089 | 1096 | ||
1090 | zone_frame_free(zone, pfn - zone->base); |
1097 | zone_frame_free(zone, pfn - zone->base); |
1091 | 1098 | ||
1092 | spinlock_unlock(&zone->lock); |
1099 | spinlock_unlock(&zone->lock); |
1093 | 1100 | ||
1094 | /* |
1101 | /* |
1095 | * Signal that some memory has been freed. |
1102 | * Signal that some memory has been freed. |
1096 | */ |
1103 | */ |
1097 | mutex_lock(&mem_avail_mtx); |
1104 | mutex_lock(&mem_avail_mtx); |
1098 | mem_avail_frames++; |
1105 | mem_avail_frames++; |
1099 | mem_avail_gen++; |
1106 | mem_avail_gen++; |
1100 | condvar_broadcast(&mem_avail_cv); |
1107 | condvar_broadcast(&mem_avail_cv); |
1101 | mutex_unlock(&mem_avail_mtx); |
1108 | mutex_unlock(&mem_avail_mtx); |
1102 | 1109 | ||
1103 | interrupts_restore(ipl); |
1110 | interrupts_restore(ipl); |
1104 | } |
1111 | } |
1105 | 1112 | ||
1106 | /** Add reference to frame. |
1113 | /** Add reference to frame. |
1107 | * |
1114 | * |
1108 | * Find respective frame structure for supplied PFN and |
1115 | * Find respective frame structure for supplied PFN and |
1109 | * increment frame reference count. |
1116 | * increment frame reference count. |
1110 | * |
1117 | * |
1111 | * @param pfn Frame number of the frame to be freed. |
1118 | * @param pfn Frame number of the frame to be freed. |
1112 | */ |
1119 | */ |
1113 | void frame_reference_add(pfn_t pfn) |
1120 | void frame_reference_add(pfn_t pfn) |
1114 | { |
1121 | { |
1115 | ipl_t ipl; |
1122 | ipl_t ipl; |
1116 | zone_t *zone; |
1123 | zone_t *zone; |
1117 | frame_t *frame; |
1124 | frame_t *frame; |
1118 | 1125 | ||
1119 | ipl = interrupts_disable(); |
1126 | ipl = interrupts_disable(); |
1120 | 1127 | ||
1121 | /* |
1128 | /* |
1122 | * First, find host frame zone for addr. |
1129 | * First, find host frame zone for addr. |
1123 | */ |
1130 | */ |
1124 | zone = find_zone_and_lock(pfn, NULL); |
1131 | zone = find_zone_and_lock(pfn, NULL); |
1125 | ASSERT(zone); |
1132 | ASSERT(zone); |
1126 | 1133 | ||
1127 | frame = &zone->frames[pfn - zone->base]; |
1134 | frame = &zone->frames[pfn - zone->base]; |
1128 | frame->refcount++; |
1135 | frame->refcount++; |
1129 | 1136 | ||
1130 | spinlock_unlock(&zone->lock); |
1137 | spinlock_unlock(&zone->lock); |
1131 | interrupts_restore(ipl); |
1138 | interrupts_restore(ipl); |
1132 | } |
1139 | } |
1133 | 1140 | ||
1134 | /** Mark given range unavailable in frame zones. */ |
1141 | /** Mark given range unavailable in frame zones. */ |
1135 | void frame_mark_unavailable(pfn_t start, count_t count) |
1142 | void frame_mark_unavailable(pfn_t start, count_t count) |
1136 | { |
1143 | { |
1137 | unsigned int i; |
1144 | unsigned int i; |
1138 | zone_t *zone; |
1145 | zone_t *zone; |
1139 | unsigned int prefzone = 0; |
1146 | unsigned int prefzone = 0; |
1140 | 1147 | ||
1141 | for (i = 0; i < count; i++) { |
1148 | for (i = 0; i < count; i++) { |
1142 | zone = find_zone_and_lock(start + i, &prefzone); |
1149 | zone = find_zone_and_lock(start + i, &prefzone); |
1143 | if (!zone) /* PFN not found */ |
1150 | if (!zone) /* PFN not found */ |
1144 | continue; |
1151 | continue; |
1145 | zone_mark_unavailable(zone, start + i - zone->base); |
1152 | zone_mark_unavailable(zone, start + i - zone->base); |
1146 | 1153 | ||
1147 | spinlock_unlock(&zone->lock); |
1154 | spinlock_unlock(&zone->lock); |
1148 | } |
1155 | } |
1149 | } |
1156 | } |
1150 | 1157 | ||
1151 | /** Initialize physical memory management. */ |
1158 | /** Initialize physical memory management. */ |
1152 | void frame_init(void) |
1159 | void frame_init(void) |
1153 | { |
1160 | { |
1154 | if (config.cpu_active == 1) { |
1161 | if (config.cpu_active == 1) { |
1155 | zones.count = 0; |
1162 | zones.count = 0; |
1156 | spinlock_initialize(&zones.lock, "zones.lock"); |
1163 | spinlock_initialize(&zones.lock, "zones.lock"); |
1157 | mutex_initialize(&mem_avail_mtx, MUTEX_ACTIVE); |
1164 | mutex_initialize(&mem_avail_mtx, MUTEX_ACTIVE); |
1158 | condvar_initialize(&mem_avail_cv); |
1165 | condvar_initialize(&mem_avail_cv); |
1159 | } |
1166 | } |
1160 | /* Tell the architecture to create some memory */ |
1167 | /* Tell the architecture to create some memory */ |
1161 | frame_arch_init(); |
1168 | frame_arch_init(); |
1162 | if (config.cpu_active == 1) { |
1169 | if (config.cpu_active == 1) { |
1163 | frame_mark_unavailable(ADDR2PFN(KA2PA(config.base)), |
1170 | frame_mark_unavailable(ADDR2PFN(KA2PA(config.base)), |
1164 | SIZE2FRAMES(config.kernel_size)); |
1171 | SIZE2FRAMES(config.kernel_size)); |
1165 | frame_mark_unavailable(ADDR2PFN(KA2PA(config.stack_base)), |
1172 | frame_mark_unavailable(ADDR2PFN(KA2PA(config.stack_base)), |
1166 | SIZE2FRAMES(config.stack_size)); |
1173 | SIZE2FRAMES(config.stack_size)); |
1167 | 1174 | ||
1168 | count_t i; |
1175 | count_t i; |
1169 | for (i = 0; i < init.cnt; i++) { |
1176 | for (i = 0; i < init.cnt; i++) { |
1170 | pfn_t pfn = ADDR2PFN(KA2PA(init.tasks[i].addr)); |
1177 | pfn_t pfn = ADDR2PFN(KA2PA(init.tasks[i].addr)); |
1171 | frame_mark_unavailable(pfn, |
1178 | frame_mark_unavailable(pfn, |
1172 | SIZE2FRAMES(init.tasks[i].size)); |
1179 | SIZE2FRAMES(init.tasks[i].size)); |
1173 | } |
1180 | } |
1174 | 1181 | ||
1175 | if (ballocs.size) |
1182 | if (ballocs.size) |
1176 | frame_mark_unavailable(ADDR2PFN(KA2PA(ballocs.base)), |
1183 | frame_mark_unavailable(ADDR2PFN(KA2PA(ballocs.base)), |
1177 | SIZE2FRAMES(ballocs.size)); |
1184 | SIZE2FRAMES(ballocs.size)); |
1178 | 1185 | ||
1179 | /* Black list first frame, as allocating NULL would |
1186 | /* Black list first frame, as allocating NULL would |
1180 | * fail in some places */ |
1187 | * fail in some places */ |
1181 | frame_mark_unavailable(0, 1); |
1188 | frame_mark_unavailable(0, 1); |
1182 | } |
1189 | } |
1183 | } |
1190 | } |
1184 | 1191 | ||
1185 | 1192 | ||
1186 | /** Return total size of all zones. */ |
1193 | /** Return total size of all zones. */ |
1187 | uint64_t zone_total_size(void) |
1194 | uint64_t zone_total_size(void) |
1188 | { |
1195 | { |
1189 | zone_t *zone = NULL; |
1196 | zone_t *zone = NULL; |
1190 | unsigned int i; |
1197 | unsigned int i; |
1191 | ipl_t ipl; |
1198 | ipl_t ipl; |
1192 | uint64_t total = 0; |
1199 | uint64_t total = 0; |
1193 | 1200 | ||
1194 | ipl = interrupts_disable(); |
1201 | ipl = interrupts_disable(); |
1195 | spinlock_lock(&zones.lock); |
1202 | spinlock_lock(&zones.lock); |
1196 | 1203 | ||
1197 | for (i = 0; i < zones.count; i++) { |
1204 | for (i = 0; i < zones.count; i++) { |
1198 | zone = zones.info[i]; |
1205 | zone = zones.info[i]; |
1199 | spinlock_lock(&zone->lock); |
1206 | spinlock_lock(&zone->lock); |
1200 | total += (uint64_t) FRAMES2SIZE(zone->count); |
1207 | total += (uint64_t) FRAMES2SIZE(zone->count); |
1201 | spinlock_unlock(&zone->lock); |
1208 | spinlock_unlock(&zone->lock); |
1202 | } |
1209 | } |
1203 | 1210 | ||
1204 | spinlock_unlock(&zones.lock); |
1211 | spinlock_unlock(&zones.lock); |
1205 | interrupts_restore(ipl); |
1212 | interrupts_restore(ipl); |
1206 | 1213 | ||
1207 | return total; |
1214 | return total; |
1208 | } |
1215 | } |
1209 | 1216 | ||
1210 | /** Prints list of zones. */ |
1217 | /** Prints list of zones. */ |
1211 | void zone_print_list(void) |
1218 | void zone_print_list(void) |
1212 | { |
1219 | { |
1213 | zone_t *zone = NULL; |
1220 | zone_t *zone = NULL; |
1214 | unsigned int i; |
1221 | unsigned int i; |
1215 | ipl_t ipl; |
1222 | ipl_t ipl; |
1216 | 1223 | ||
1217 | ipl = interrupts_disable(); |
- | |
1218 | spinlock_lock(&zones.lock); |
- | |
1219 | - | ||
1220 | #ifdef __32_BITS__ |
1224 | #ifdef __32_BITS__ |
1221 | printf("# base address free frames busy frames\n"); |
1225 | printf("# base address free frames busy frames\n"); |
1222 | printf("-- ------------ ------------ ------------\n"); |
1226 | printf("-- ------------ ------------ ------------\n"); |
1223 | #endif |
1227 | #endif |
1224 | 1228 | ||
1225 | #ifdef __64_BITS__ |
1229 | #ifdef __64_BITS__ |
1226 | printf("# base address free frames busy frames\n"); |
1230 | printf("# base address free frames busy frames\n"); |
1227 | printf("-- -------------------- ------------ ------------\n"); |
1231 | printf("-- -------------------- ------------ ------------\n"); |
1228 | #endif |
1232 | #endif |
1229 | 1233 | ||
- | 1234 | /* |
|
- | 1235 | * Because printing may require allocation of memory, we may not hold |
|
- | 1236 | * the frame allocator locks when printing zone statistics. Therefore, |
|
- | 1237 | * we simply gather the statistics under the protection of the locks and |
|
- | 1238 | * print the statistics when the locks have been released. |
|
- | 1239 | * |
|
- | 1240 | * When someone adds/removes zones while we are printing the statistics, |
|
- | 1241 | * we may end up with inaccurate output (e.g. a zone being skipped from |
|
- | 1242 | * the listing). |
|
- | 1243 | */ |
|
- | 1244 | ||
1230 | for (i = 0; i < zones.count; i++) { |
1245 | for (i = 0; ; i++) { |
- | 1246 | uintptr_t base; |
|
- | 1247 | count_t free_count; |
|
- | 1248 | count_t busy_count; |
|
- | 1249 | ||
- | 1250 | ipl = interrupts_disable(); |
|
- | 1251 | spinlock_lock(&zones.lock); |
|
- | 1252 | ||
- | 1253 | if (i >= zones.count) { |
|
- | 1254 | spinlock_unlock(&zones.lock); |
|
- | 1255 | interrupts_restore(ipl); |
|
- | 1256 | break; |
|
- | 1257 | } |
|
- | 1258 | ||
1231 | zone = zones.info[i]; |
1259 | zone = zones.info[i]; |
1232 | spinlock_lock(&zone->lock); |
1260 | spinlock_lock(&zone->lock); |
1233 | 1261 | ||
- | 1262 | base = PFN2ADDR(zone->base); |
|
- | 1263 | free_count = zone->free_count; |
|
- | 1264 | busy_count = zone->busy_count; |
|
- | 1265 | ||
- | 1266 | spinlock_unlock(&zone->lock); |
|
- | 1267 | ||
- | 1268 | spinlock_unlock(&zones.lock); |
|
- | 1269 | interrupts_restore(ipl); |
|
- | 1270 | ||
1234 | #ifdef __32_BITS__ |
1271 | #ifdef __32_BITS__ |
1235 | printf("%-2u %10p %12" PRIc " %12" PRIc "\n", |
1272 | printf("%-2u %10p %12" PRIc " %12" PRIc "\n", i, base, |
1236 | i, PFN2ADDR(zone->base), zone->free_count, |
- | |
1237 | zone->busy_count); |
1273 | free_count, busy_count); |
1238 | #endif |
1274 | #endif |
1239 | 1275 | ||
1240 | #ifdef __64_BITS__ |
1276 | #ifdef __64_BITS__ |
1241 | printf("%-2u %18p %12" PRIc " %12" PRIc "\n", i, |
1277 | printf("%-2u %18p %12" PRIc " %12" PRIc "\n", i, base, |
1242 | PFN2ADDR(zone->base), zone->free_count, zone->busy_count); |
1278 | free_count, busy_count); |
1243 | #endif |
1279 | #endif |
1244 | 1280 | ||
1245 | spinlock_unlock(&zone->lock); |
- | |
1246 | } |
1281 | } |
1247 | - | ||
1248 | spinlock_unlock(&zones.lock); |
- | |
1249 | interrupts_restore(ipl); |
- | |
1250 | } |
1282 | } |
1251 | 1283 | ||
1252 | /** Prints zone details. |
1284 | /** Prints zone details. |
1253 | * |
1285 | * |
1254 | * @param num Zone base address or zone number. |
1286 | * @param num Zone base address or zone number. |
1255 | */ |
1287 | */ |
1256 | void zone_print_one(unsigned int num) |
1288 | void zone_print_one(unsigned int num) |
1257 | { |
1289 | { |
1258 | zone_t *zone = NULL; |
1290 | zone_t *zone = NULL; |
1259 | ipl_t ipl; |
1291 | ipl_t ipl; |
1260 | unsigned int i; |
1292 | unsigned int i; |
- | 1293 | uintptr_t base; |
|
- | 1294 | count_t count; |
|
- | 1295 | count_t busy_count; |
|
- | 1296 | count_t free_count; |
|
1261 | 1297 | ||
1262 | ipl = interrupts_disable(); |
1298 | ipl = interrupts_disable(); |
1263 | spinlock_lock(&zones.lock); |
1299 | spinlock_lock(&zones.lock); |
1264 | 1300 | ||
1265 | for (i = 0; i < zones.count; i++) { |
1301 | for (i = 0; i < zones.count; i++) { |
1266 | if ((i == num) || (PFN2ADDR(zones.info[i]->base) == num)) { |
1302 | if ((i == num) || (PFN2ADDR(zones.info[i]->base) == num)) { |
1267 | zone = zones.info[i]; |
1303 | zone = zones.info[i]; |
1268 | break; |
1304 | break; |
1269 | } |
1305 | } |
1270 | } |
1306 | } |
1271 | if (!zone) { |
1307 | if (!zone) { |
- | 1308 | spinlock_unlock(&zones.lock); |
|
- | 1309 | interrupts_restore(ipl); |
|
1272 | printf("Zone not found.\n"); |
1310 | printf("Zone not found.\n"); |
1273 | goto out; |
1311 | return; |
1274 | } |
1312 | } |
1275 | 1313 | ||
1276 | spinlock_lock(&zone->lock); |
1314 | spinlock_lock(&zone->lock); |
1277 | printf("Memory zone information\n"); |
- | |
1278 | printf("Zone base address: %p\n", PFN2ADDR(zone->base)); |
1315 | base = PFN2ADDR(zone->base); |
1279 | printf("Zone size: %" PRIc " frames (%" PRIs " KB)\n", zone->count, |
- | |
1280 | SIZE2KB(FRAMES2SIZE(zone->count))); |
1316 | count = zone->count; |
1281 | printf("Allocated space: %" PRIc " frames (%" PRIs " KB)\n", |
- | |
1282 | zone->busy_count, SIZE2KB(FRAMES2SIZE(zone->busy_count))); |
1317 | busy_count = zone->busy_count; |
1283 | printf("Available space: %" PRIc " frames (%" PRIs " KB)\n", |
- | |
1284 | zone->free_count, SIZE2KB(FRAMES2SIZE(zone->free_count))); |
1318 | free_count = zone->free_count; |
1285 | buddy_system_structure_print(zone->buddy_system, FRAME_SIZE); |
- | |
1286 | spinlock_unlock(&zone->lock); |
1319 | spinlock_unlock(&zone->lock); |
1287 | - | ||
1288 | out: |
- | |
1289 | spinlock_unlock(&zones.lock); |
1320 | spinlock_unlock(&zones.lock); |
1290 | interrupts_restore(ipl); |
1321 | interrupts_restore(ipl); |
- | 1322 | ||
- | 1323 | printf("Zone base address: %p\n", base); |
|
- | 1324 | printf("Zone size: %" PRIc " frames (%" PRIs " KiB)\n", count, |
|
- | 1325 | SIZE2KB(FRAMES2SIZE(count))); |
|
- | 1326 | printf("Allocated space: %" PRIc " frames (%" PRIs " KiB)\n", |
|
- | 1327 | busy_count, SIZE2KB(FRAMES2SIZE(busy_count))); |
|
- | 1328 | printf("Available space: %" PRIc " frames (%" PRIs " KiB)\n", |
|
- | 1329 | free_count, SIZE2KB(FRAMES2SIZE(free_count))); |
|
1291 | } |
1330 | } |
1292 | 1331 | ||
1293 | /** @} |
1332 | /** @} |
1294 | */ |
1333 | */ |
1295 | 1334 | ||
1296 | 1335 |