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