1 | /*
|
---|
2 | * Copyright (C) 2001-2005 Jakub Jermar
|
---|
3 | * Copyright (C) 2005 Sergey Bondari
|
---|
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 |
|
---|
30 | /*
|
---|
31 | * Locking order
|
---|
32 | *
|
---|
33 | * In order to access particular zone, the process must first lock
|
---|
34 | * the zones.lock, then lock the zone and then unlock the zones.lock.
|
---|
35 | * This insures, that we can fiddle with the zones in runtime without
|
---|
36 | * affecting the processes.
|
---|
37 | *
|
---|
38 | */
|
---|
39 |
|
---|
40 | #include <typedefs.h>
|
---|
41 | #include <arch/types.h>
|
---|
42 | #include <mm/frame.h>
|
---|
43 | #include <mm/as.h>
|
---|
44 | #include <panic.h>
|
---|
45 | #include <debug.h>
|
---|
46 | #include <adt/list.h>
|
---|
47 | #include <synch/spinlock.h>
|
---|
48 | #include <arch/asm.h>
|
---|
49 | #include <arch.h>
|
---|
50 | #include <print.h>
|
---|
51 | #include <align.h>
|
---|
52 | #include <mm/slab.h>
|
---|
53 |
|
---|
54 | typedef struct {
|
---|
55 | count_t refcount; /**< tracking of shared frames */
|
---|
56 | __u8 buddy_order; /**< buddy system block order */
|
---|
57 | link_t buddy_link; /**< link to the next free block inside one order */
|
---|
58 | void *parent; /**< If allocated by slab, this points there */
|
---|
59 | }frame_t;
|
---|
60 |
|
---|
61 | typedef struct {
|
---|
62 | SPINLOCK_DECLARE(lock); /**< this lock protects everything below */
|
---|
63 | pfn_t base; /**< frame_no of the first frame in the frames array */
|
---|
64 | pfn_t count; /**< Size of zone */
|
---|
65 |
|
---|
66 | frame_t *frames; /**< array of frame_t structures in this zone */
|
---|
67 | count_t free_count; /**< number of free frame_t structures */
|
---|
68 | count_t busy_count; /**< number of busy frame_t structures */
|
---|
69 |
|
---|
70 | buddy_system_t * buddy_system; /**< buddy system for the zone */
|
---|
71 | int flags;
|
---|
72 | }zone_t;
|
---|
73 |
|
---|
74 | /*
|
---|
75 | * The zoneinfo.lock must be locked when accessing zoneinfo structure.
|
---|
76 | * Some of the attributes in zone_t structures are 'read-only'
|
---|
77 | */
|
---|
78 |
|
---|
79 | struct {
|
---|
80 | SPINLOCK_DECLARE(lock);
|
---|
81 | int count;
|
---|
82 | zone_t *info[ZONES_MAX];
|
---|
83 | }zones;
|
---|
84 |
|
---|
85 |
|
---|
86 | /*********************************/
|
---|
87 | /* Helper functions */
|
---|
88 | static inline index_t frame_index(zone_t *zone, frame_t *frame)
|
---|
89 | {
|
---|
90 | return (index_t)(frame - zone->frames);
|
---|
91 | }
|
---|
92 | static inline index_t frame_index_abs(zone_t *zone, frame_t *frame)
|
---|
93 | {
|
---|
94 | return (index_t)(frame - zone->frames) + zone->base;
|
---|
95 | }
|
---|
96 | static inline int frame_index_valid(zone_t *zone, index_t index)
|
---|
97 | {
|
---|
98 | return index >= 0 && index < zone->count;
|
---|
99 | }
|
---|
100 |
|
---|
101 | /** Compute pfn_t from frame_t pointer & zone pointer */
|
---|
102 | static pfn_t make_frame_index(zone_t *zone, frame_t *frame)
|
---|
103 | {
|
---|
104 | return frame - zone->frames;
|
---|
105 | }
|
---|
106 |
|
---|
107 | /** Initialize frame structure
|
---|
108 | *
|
---|
109 | * Initialize frame structure.
|
---|
110 | *
|
---|
111 | * @param frame Frame structure to be initialized.
|
---|
112 | */
|
---|
113 | static void frame_initialize(frame_t *frame)
|
---|
114 | {
|
---|
115 | frame->refcount = 1;
|
---|
116 | frame->buddy_order = 0;
|
---|
117 | }
|
---|
118 |
|
---|
119 | /*************************************/
|
---|
120 | /* Zoneinfo functions */
|
---|
121 |
|
---|
122 | /**
|
---|
123 | * Insert-sort zone into zones list
|
---|
124 | */
|
---|
125 | static void zones_add_zone(zone_t *zone)
|
---|
126 | {
|
---|
127 | int i;
|
---|
128 |
|
---|
129 | spinlock_lock(&zones.lock);
|
---|
130 | /* Try to merge */
|
---|
131 | if (zone->flags & ZONE_JOIN) {
|
---|
132 | for (i=0; i < zones.count; i++) {
|
---|
133 | spinlock_lock(&zones.info[i]->lock);
|
---|
134 |
|
---|
135 | /* Join forward, join backward */
|
---|
136 | panic("Not implemented");
|
---|
137 |
|
---|
138 | spinlock_unlock(&zones.info[i]->lock);
|
---|
139 | }
|
---|
140 | spinlock_unlock(&zones.lock);
|
---|
141 | } else {
|
---|
142 | if (zones.count+1 == ZONES_MAX)
|
---|
143 | panic("Maximum zone(%d) count exceeded.", ZONES_MAX);
|
---|
144 | zones.info[zones.count++] = zone;
|
---|
145 | }
|
---|
146 | spinlock_unlock(&zones.lock);
|
---|
147 | }
|
---|
148 |
|
---|
149 | /**
|
---|
150 | * Try to find a zone where can we find the frame
|
---|
151 | *
|
---|
152 | * @param hint Start searching in zone 'hint'
|
---|
153 | * @param lock Lock zone if true
|
---|
154 | *
|
---|
155 | * Assume interrupts disable
|
---|
156 | */
|
---|
157 | static zone_t * find_zone_and_lock(pfn_t frame, int *pzone)
|
---|
158 | {
|
---|
159 | int i;
|
---|
160 | int hint = pzone ? *pzone : 0;
|
---|
161 | zone_t *z;
|
---|
162 |
|
---|
163 | spinlock_lock(&zones.lock);
|
---|
164 |
|
---|
165 | if (hint >= zones.count || hint < 0)
|
---|
166 | hint = 0;
|
---|
167 |
|
---|
168 | i = hint;
|
---|
169 | do {
|
---|
170 | z = zones.info[i];
|
---|
171 | spinlock_lock(&z->lock);
|
---|
172 | if (z->base <= frame && z->base + z->count > frame) {
|
---|
173 | spinlock_unlock(&zones.lock); /* Unlock the global lock */
|
---|
174 | if (pzone)
|
---|
175 | *pzone = i;
|
---|
176 | return z;
|
---|
177 | }
|
---|
178 | spinlock_unlock(&z->lock);
|
---|
179 |
|
---|
180 | i++;
|
---|
181 | if (i >= zones.count)
|
---|
182 | i = 0;
|
---|
183 | } while(i != hint);
|
---|
184 |
|
---|
185 | spinlock_unlock(&zones.lock);
|
---|
186 | return NULL;
|
---|
187 | }
|
---|
188 |
|
---|
189 | /**
|
---|
190 | * Find AND LOCK zone that can allocate order frames
|
---|
191 | *
|
---|
192 | * Assume interrupts are disabled!!
|
---|
193 | *
|
---|
194 | * @param pzone Pointer to preferred zone or NULL, on return contains zone number
|
---|
195 | */
|
---|
196 | static zone_t * find_free_zone_lock(__u8 order, int *pzone)
|
---|
197 | {
|
---|
198 | int i;
|
---|
199 | zone_t *z;
|
---|
200 | int hint = pzone ? *pzone : 0;
|
---|
201 |
|
---|
202 | spinlock_lock(&zones.lock);
|
---|
203 | if (hint >= zones.count)
|
---|
204 | hint = 0;
|
---|
205 | i = hint;
|
---|
206 | do {
|
---|
207 | z = zones.info[i];
|
---|
208 |
|
---|
209 | spinlock_lock(&z->lock);
|
---|
210 |
|
---|
211 | /* Check if the zone has 2^order frames area available */
|
---|
212 | if (buddy_system_can_alloc(z->buddy_system, order)) {
|
---|
213 | spinlock_unlock(&zones.lock);
|
---|
214 | if (pzone)
|
---|
215 | *pzone = i;
|
---|
216 | return z;
|
---|
217 | }
|
---|
218 | spinlock_unlock(&z->lock);
|
---|
219 | if (++i >= zones.count)
|
---|
220 | i = 0;
|
---|
221 | } while(i != hint);
|
---|
222 | spinlock_unlock(&zones.lock);
|
---|
223 | return NULL;
|
---|
224 | }
|
---|
225 |
|
---|
226 | /********************************************/
|
---|
227 | /* Buddy system functions */
|
---|
228 |
|
---|
229 | /** Buddy system find_block implementation
|
---|
230 | *
|
---|
231 | * Find block that is parent of current list.
|
---|
232 | * That means go to lower addresses, until such block is found
|
---|
233 | *
|
---|
234 | * @param order - Order of parent must be different then this parameter!!
|
---|
235 | */
|
---|
236 | static link_t *zone_buddy_find_block(buddy_system_t *b, link_t *child,
|
---|
237 | __u8 order)
|
---|
238 | {
|
---|
239 | frame_t * frame;
|
---|
240 | zone_t * zone;
|
---|
241 | index_t index;
|
---|
242 |
|
---|
243 | frame = list_get_instance(child, frame_t, buddy_link);
|
---|
244 | zone = (zone_t *) b->data;
|
---|
245 |
|
---|
246 | index = frame_index(zone, frame);
|
---|
247 | do {
|
---|
248 | if (zone->frames[index].buddy_order != order) {
|
---|
249 | return &zone->frames[index].buddy_link;
|
---|
250 | }
|
---|
251 | } while(index-- > 0);
|
---|
252 | return NULL;
|
---|
253 | }
|
---|
254 |
|
---|
255 |
|
---|
256 |
|
---|
257 | /** Buddy system find_buddy implementation
|
---|
258 | *
|
---|
259 | * @param b Buddy system.
|
---|
260 | * @param block Block for which buddy should be found
|
---|
261 | *
|
---|
262 | * @return Buddy for given block if found
|
---|
263 | */
|
---|
264 | static link_t * zone_buddy_find_buddy(buddy_system_t *b, link_t * block)
|
---|
265 | {
|
---|
266 | frame_t * frame;
|
---|
267 | zone_t * zone;
|
---|
268 | index_t index;
|
---|
269 | bool is_left, is_right;
|
---|
270 |
|
---|
271 | frame = list_get_instance(block, frame_t, buddy_link);
|
---|
272 | zone = (zone_t *) b->data;
|
---|
273 | ASSERT(IS_BUDDY_ORDER_OK(frame_index_abs(zone, frame), frame->buddy_order));
|
---|
274 |
|
---|
275 | is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame);
|
---|
276 | is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame);
|
---|
277 |
|
---|
278 | ASSERT(is_left ^ is_right);
|
---|
279 | if (is_left) {
|
---|
280 | index = (frame_index(zone, frame)) + (1 << frame->buddy_order);
|
---|
281 | } else { // if (is_right)
|
---|
282 | index = (frame_index(zone, frame)) - (1 << frame->buddy_order);
|
---|
283 | }
|
---|
284 |
|
---|
285 |
|
---|
286 | if (frame_index_valid(zone, index)) {
|
---|
287 | if (zone->frames[index].buddy_order == frame->buddy_order &&
|
---|
288 | zone->frames[index].refcount == 0) {
|
---|
289 | return &zone->frames[index].buddy_link;
|
---|
290 | }
|
---|
291 | }
|
---|
292 |
|
---|
293 | return NULL;
|
---|
294 | }
|
---|
295 |
|
---|
296 | /** Buddy system bisect implementation
|
---|
297 | *
|
---|
298 | * @param b Buddy system.
|
---|
299 | * @param block Block to bisect
|
---|
300 | *
|
---|
301 | * @return right block
|
---|
302 | */
|
---|
303 | static link_t * zone_buddy_bisect(buddy_system_t *b, link_t * block) {
|
---|
304 | frame_t * frame_l, * frame_r;
|
---|
305 |
|
---|
306 | frame_l = list_get_instance(block, frame_t, buddy_link);
|
---|
307 | frame_r = (frame_l + (1 << (frame_l->buddy_order - 1)));
|
---|
308 |
|
---|
309 | return &frame_r->buddy_link;
|
---|
310 | }
|
---|
311 |
|
---|
312 | /** Buddy system coalesce implementation
|
---|
313 | *
|
---|
314 | * @param b Buddy system.
|
---|
315 | * @param block_1 First block
|
---|
316 | * @param block_2 First block's buddy
|
---|
317 | *
|
---|
318 | * @return Coalesced block (actually block that represents lower address)
|
---|
319 | */
|
---|
320 | static link_t * zone_buddy_coalesce(buddy_system_t *b, link_t * block_1,
|
---|
321 | link_t * block_2) {
|
---|
322 | frame_t *frame1, *frame2;
|
---|
323 |
|
---|
324 | frame1 = list_get_instance(block_1, frame_t, buddy_link);
|
---|
325 | frame2 = list_get_instance(block_2, frame_t, buddy_link);
|
---|
326 |
|
---|
327 | return frame1 < frame2 ? block_1 : block_2;
|
---|
328 | }
|
---|
329 |
|
---|
330 | /** Buddy system set_order implementation
|
---|
331 | *
|
---|
332 | * @param b Buddy system.
|
---|
333 | * @param block Buddy system block
|
---|
334 | * @param order Order to set
|
---|
335 | */
|
---|
336 | static void zone_buddy_set_order(buddy_system_t *b, link_t * block, __u8 order) {
|
---|
337 | frame_t * frame;
|
---|
338 | frame = list_get_instance(block, frame_t, buddy_link);
|
---|
339 | frame->buddy_order = order;
|
---|
340 | }
|
---|
341 |
|
---|
342 | /** Buddy system get_order implementation
|
---|
343 | *
|
---|
344 | * @param b Buddy system.
|
---|
345 | * @param block Buddy system block
|
---|
346 | *
|
---|
347 | * @return Order of block
|
---|
348 | */
|
---|
349 | static __u8 zone_buddy_get_order(buddy_system_t *b, link_t * block) {
|
---|
350 | frame_t * frame;
|
---|
351 | frame = list_get_instance(block, frame_t, buddy_link);
|
---|
352 | return frame->buddy_order;
|
---|
353 | }
|
---|
354 |
|
---|
355 | /** Buddy system mark_busy implementation
|
---|
356 | *
|
---|
357 | * @param b Buddy system
|
---|
358 | * @param block Buddy system block
|
---|
359 | *
|
---|
360 | */
|
---|
361 | static void zone_buddy_mark_busy(buddy_system_t *b, link_t * block) {
|
---|
362 | frame_t * frame;
|
---|
363 | frame = list_get_instance(block, frame_t, buddy_link);
|
---|
364 | frame->refcount = 1;
|
---|
365 | }
|
---|
366 |
|
---|
367 | /** Buddy system mark_available implementation
|
---|
368 | *
|
---|
369 | * @param b Buddy system
|
---|
370 | * @param block Buddy system block
|
---|
371 | *
|
---|
372 | */
|
---|
373 | static void zone_buddy_mark_available(buddy_system_t *b, link_t * block) {
|
---|
374 | frame_t * frame;
|
---|
375 | frame = list_get_instance(block, frame_t, buddy_link);
|
---|
376 | frame->refcount = 0;
|
---|
377 | }
|
---|
378 |
|
---|
379 | static struct buddy_system_operations zone_buddy_system_operations = {
|
---|
380 | .find_buddy = zone_buddy_find_buddy,
|
---|
381 | .bisect = zone_buddy_bisect,
|
---|
382 | .coalesce = zone_buddy_coalesce,
|
---|
383 | .set_order = zone_buddy_set_order,
|
---|
384 | .get_order = zone_buddy_get_order,
|
---|
385 | .mark_busy = zone_buddy_mark_busy,
|
---|
386 | .mark_available = zone_buddy_mark_available,
|
---|
387 | .find_block = zone_buddy_find_block
|
---|
388 | };
|
---|
389 |
|
---|
390 | /*************************************/
|
---|
391 | /* Zone functions */
|
---|
392 |
|
---|
393 | /** Allocate frame in particular zone
|
---|
394 | *
|
---|
395 | * Assume zone is locked
|
---|
396 | *
|
---|
397 | * @return Frame index in zone
|
---|
398 | */
|
---|
399 | static pfn_t zone_frame_alloc(zone_t *zone,__u8 order, int flags, int *status)
|
---|
400 | {
|
---|
401 | pfn_t v;
|
---|
402 | link_t *tmp;
|
---|
403 | frame_t *frame;
|
---|
404 |
|
---|
405 | /* Allocate frames from zone buddy system */
|
---|
406 | tmp = buddy_system_alloc(zone->buddy_system, order);
|
---|
407 |
|
---|
408 | ASSERT(tmp);
|
---|
409 |
|
---|
410 | /* Update zone information. */
|
---|
411 | zone->free_count -= (1 << order);
|
---|
412 | zone->busy_count += (1 << order);
|
---|
413 |
|
---|
414 | /* Frame will be actually a first frame of the block. */
|
---|
415 | frame = list_get_instance(tmp, frame_t, buddy_link);
|
---|
416 |
|
---|
417 | /* get frame address */
|
---|
418 | v = make_frame_index(zone, frame);
|
---|
419 | return v;
|
---|
420 | }
|
---|
421 |
|
---|
422 | /** Free frame from zone
|
---|
423 | *
|
---|
424 | * Assume zone is locked
|
---|
425 | */
|
---|
426 | static void zone_frame_free(zone_t *zone, pfn_t frame_idx)
|
---|
427 | {
|
---|
428 | frame_t *frame;
|
---|
429 | __u8 order;
|
---|
430 |
|
---|
431 | frame = &zone->frames[frame_idx];
|
---|
432 |
|
---|
433 | /* remember frame order */
|
---|
434 | order = frame->buddy_order;
|
---|
435 |
|
---|
436 | ASSERT(frame->refcount);
|
---|
437 |
|
---|
438 | if (!--frame->refcount) {
|
---|
439 | buddy_system_free(zone->buddy_system, &frame->buddy_link);
|
---|
440 | }
|
---|
441 |
|
---|
442 | /* Update zone information. */
|
---|
443 | zone->free_count += (1 << order);
|
---|
444 | zone->busy_count -= (1 << order);
|
---|
445 | }
|
---|
446 |
|
---|
447 | /** Return frame from zone */
|
---|
448 | static frame_t * zone_get_frame(zone_t *zone, pfn_t frame_idx)
|
---|
449 | {
|
---|
450 | ASSERT(frame_idx < zone->count);
|
---|
451 | return &zone->frames[frame_idx];
|
---|
452 | }
|
---|
453 |
|
---|
454 | /** Mark frame in zone unavailable to allocation */
|
---|
455 | static void zone_mark_unavailable(zone_t *zone, pfn_t frame_idx)
|
---|
456 | {
|
---|
457 | frame_t *frame;
|
---|
458 | link_t *link;
|
---|
459 |
|
---|
460 | frame = zone_get_frame(zone, frame_idx);
|
---|
461 | link = buddy_system_alloc_block(zone->buddy_system,
|
---|
462 | &frame->buddy_link);
|
---|
463 | ASSERT(link);
|
---|
464 | zone->free_count--;
|
---|
465 | }
|
---|
466 |
|
---|
467 | /** Create frame zone
|
---|
468 | *
|
---|
469 | * Create new frame zone.
|
---|
470 | *
|
---|
471 | * @param start Physical address of the first frame within the zone.
|
---|
472 | * @param size Size of the zone. Must be a multiple of FRAME_SIZE.
|
---|
473 | * @param conffram Address of configuration frame
|
---|
474 | * @param flags Zone flags.
|
---|
475 | *
|
---|
476 | * @return Initialized zone.
|
---|
477 | */
|
---|
478 | static zone_t * zone_construct(pfn_t start, pfn_t count,
|
---|
479 | zone_t *z, int flags)
|
---|
480 | {
|
---|
481 | int i;
|
---|
482 | __u8 max_order;
|
---|
483 |
|
---|
484 | spinlock_initialize(&z->lock, "zone_lock");
|
---|
485 | z->base = start;
|
---|
486 | z->count = count;
|
---|
487 | z->flags = flags;
|
---|
488 | z->free_count = count;
|
---|
489 | z->busy_count = 0;
|
---|
490 |
|
---|
491 | /*
|
---|
492 | * Compute order for buddy system, initialize
|
---|
493 | */
|
---|
494 | for (max_order = 0; count >> max_order; max_order++)
|
---|
495 | ;
|
---|
496 | z->buddy_system = (buddy_system_t *)&z[1];
|
---|
497 |
|
---|
498 | buddy_system_create(z->buddy_system, max_order,
|
---|
499 | &zone_buddy_system_operations,
|
---|
500 | (void *) z);
|
---|
501 |
|
---|
502 | /* Allocate frames _after_ the conframe */
|
---|
503 | /* Check sizes */
|
---|
504 | z->frames = (frame_t *)((void *)z->buddy_system+buddy_conf_size(max_order));
|
---|
505 |
|
---|
506 | for (i = 0; i<count; i++) {
|
---|
507 | frame_initialize(&z->frames[i]);
|
---|
508 | }
|
---|
509 | /* Stuffing frames */
|
---|
510 | for (i = 0; i < count; i++) {
|
---|
511 | z->frames[i].refcount = 0;
|
---|
512 | buddy_system_free(z->buddy_system, &z->frames[i].buddy_link);
|
---|
513 | }
|
---|
514 | return z;
|
---|
515 | }
|
---|
516 |
|
---|
517 |
|
---|
518 | /** Compute configuration data size for zone */
|
---|
519 | __address zone_conf_size(pfn_t start, pfn_t count)
|
---|
520 | {
|
---|
521 | int size = sizeof(zone_t) + count*sizeof(frame_t);
|
---|
522 | int max_order;
|
---|
523 |
|
---|
524 | for (max_order = 0; count >> max_order; max_order++)
|
---|
525 | ;
|
---|
526 | size += buddy_conf_size(max_order);
|
---|
527 | return size;
|
---|
528 | }
|
---|
529 |
|
---|
530 | /** Create and add zone to system
|
---|
531 | *
|
---|
532 | * @param confframe Where configuration frame is supposed to be.
|
---|
533 | * Always check, that we will not disturb kernel pages
|
---|
534 | * the kernel and possibly init.
|
---|
535 | * If confframe is given _outside_ this zone, it is expected,
|
---|
536 | * that the area is already marked BUSY and big enough
|
---|
537 | * to contain zone_conf_size() amount of data
|
---|
538 | */
|
---|
539 | void zone_create(pfn_t start, pfn_t count, pfn_t confframe, int flags)
|
---|
540 | {
|
---|
541 | zone_t *z;
|
---|
542 | __address addr,endaddr;
|
---|
543 | pfn_t confcount;
|
---|
544 | int i;
|
---|
545 |
|
---|
546 | /* Theoretically we could have here 0, practically make sure
|
---|
547 | * nobody tries to do that. If some platform requires, remove
|
---|
548 | * the assert
|
---|
549 | */
|
---|
550 | ASSERT(confframe);
|
---|
551 | /* If conframe is supposed to be inside our zone, then make sure
|
---|
552 | * it does not span kernel & init
|
---|
553 | */
|
---|
554 | confcount = SIZE2PFN(zone_conf_size(start,count));
|
---|
555 | if (confframe >= start && confframe < start+count) {
|
---|
556 | for (;confframe < start+count;confframe++) {
|
---|
557 | addr = PFN2ADDR(confframe);
|
---|
558 | endaddr = PFN2ADDR (confframe + confcount);
|
---|
559 | if (overlaps(addr, endaddr, KA2PA(config.base),
|
---|
560 | KA2PA(config.base+config.kernel_size)))
|
---|
561 | continue;
|
---|
562 | if (config.init_addr)
|
---|
563 | if (overlaps(addr,endaddr,
|
---|
564 | KA2PA(config.init_addr),
|
---|
565 | KA2PA(config.init_addr+config.init_size)))
|
---|
566 | continue;
|
---|
567 | break;
|
---|
568 | }
|
---|
569 | if (confframe >= start+count)
|
---|
570 | panic("Cannot find configuration data for zone.");
|
---|
571 | }
|
---|
572 |
|
---|
573 | z = zone_construct(start, count, (zone_t *)PA2KA(PFN2ADDR(confframe)), flags);
|
---|
574 | zones_add_zone(z);
|
---|
575 |
|
---|
576 | /* If confdata in zone, mark as unavailable */
|
---|
577 | if (confframe >= start && confframe < start+count)
|
---|
578 | for (i=confframe; i<confframe+confcount; i++) {
|
---|
579 | zone_mark_unavailable(z, i - z->base);
|
---|
580 | }
|
---|
581 | }
|
---|
582 |
|
---|
583 | /***************************************/
|
---|
584 | /* Frame functions */
|
---|
585 |
|
---|
586 | /** Set parent of frame */
|
---|
587 | void frame_set_parent(pfn_t pfn, void *data, int hint)
|
---|
588 | {
|
---|
589 | zone_t *zone = find_zone_and_lock(pfn, &hint);
|
---|
590 |
|
---|
591 | ASSERT(zone);
|
---|
592 |
|
---|
593 | zone_get_frame(zone, pfn-zone->base)->parent = data;
|
---|
594 | spinlock_unlock(&zone->lock);
|
---|
595 | }
|
---|
596 |
|
---|
597 | void * frame_get_parent(pfn_t pfn, int hint)
|
---|
598 | {
|
---|
599 | zone_t *zone = find_zone_and_lock(pfn, &hint);
|
---|
600 | void *res;
|
---|
601 |
|
---|
602 | ASSERT(zone);
|
---|
603 | res = zone_get_frame(zone, pfn - zone->base)->parent;
|
---|
604 |
|
---|
605 | spinlock_unlock(&zone->lock);
|
---|
606 | return res;
|
---|
607 | }
|
---|
608 |
|
---|
609 | /** Allocate power-of-two frames of physical memory.
|
---|
610 | *
|
---|
611 | * @param flags Flags for host zone selection and address processing.
|
---|
612 | * @param order Allocate exactly 2^order frames.
|
---|
613 | * @param pzone Preferred zone
|
---|
614 | *
|
---|
615 | * @return Allocated frame.
|
---|
616 | */
|
---|
617 | pfn_t frame_alloc_generic(__u8 order, int flags, int * status, int *pzone)
|
---|
618 | {
|
---|
619 | ipl_t ipl;
|
---|
620 | int freed;
|
---|
621 | pfn_t v;
|
---|
622 | zone_t *zone;
|
---|
623 |
|
---|
624 | loop:
|
---|
625 | ipl = interrupts_disable();
|
---|
626 | /*
|
---|
627 | * First, find suitable frame zone.
|
---|
628 | */
|
---|
629 | zone = find_free_zone_lock(order,pzone);
|
---|
630 | /* If no memory, reclaim some slab memory,
|
---|
631 | if it does not help, reclaim all */
|
---|
632 | if (!zone && !(flags & FRAME_NO_RECLAIM)) {
|
---|
633 | freed = slab_reclaim(0);
|
---|
634 | if (freed)
|
---|
635 | zone = find_free_zone_lock(order,pzone);
|
---|
636 | if (!zone) {
|
---|
637 | freed = slab_reclaim(SLAB_RECLAIM_ALL);
|
---|
638 | if (freed)
|
---|
639 | zone = find_free_zone_lock(order,pzone);
|
---|
640 | }
|
---|
641 | }
|
---|
642 | if (!zone) {
|
---|
643 | if (flags & FRAME_PANIC)
|
---|
644 | panic("Can't allocate frame.\n");
|
---|
645 |
|
---|
646 | /*
|
---|
647 | * TODO: Sleep until frames are available again.
|
---|
648 | */
|
---|
649 | interrupts_restore(ipl);
|
---|
650 |
|
---|
651 | if (flags & FRAME_ATOMIC) {
|
---|
652 | ASSERT(status != NULL);
|
---|
653 | if (status)
|
---|
654 | *status = FRAME_NO_MEMORY;
|
---|
655 | return NULL;
|
---|
656 | }
|
---|
657 |
|
---|
658 | panic("Sleep not implemented.\n");
|
---|
659 | goto loop;
|
---|
660 | }
|
---|
661 | v = zone_frame_alloc(zone,order,flags,status);
|
---|
662 | v += zone->base;
|
---|
663 |
|
---|
664 | spinlock_unlock(&zone->lock);
|
---|
665 | interrupts_restore(ipl);
|
---|
666 |
|
---|
667 | if (status)
|
---|
668 | *status = FRAME_OK;
|
---|
669 | return v;
|
---|
670 | }
|
---|
671 |
|
---|
672 | /** Free a frame.
|
---|
673 | *
|
---|
674 | * Find respective frame structrue for supplied addr.
|
---|
675 | * Decrement frame reference count.
|
---|
676 | * If it drops to zero, move the frame structure to free list.
|
---|
677 | *
|
---|
678 | * @param frame Frame no to be freed.
|
---|
679 | */
|
---|
680 | void frame_free(pfn_t pfn)
|
---|
681 | {
|
---|
682 | ipl_t ipl;
|
---|
683 | zone_t *zone;
|
---|
684 |
|
---|
685 | ipl = interrupts_disable();
|
---|
686 |
|
---|
687 | /*
|
---|
688 | * First, find host frame zone for addr.
|
---|
689 | */
|
---|
690 | zone = find_zone_and_lock(pfn,NULL);
|
---|
691 | ASSERT(zone);
|
---|
692 |
|
---|
693 | zone_frame_free(zone, pfn-zone->base);
|
---|
694 |
|
---|
695 | spinlock_unlock(&zone->lock);
|
---|
696 | interrupts_restore(ipl);
|
---|
697 | }
|
---|
698 |
|
---|
699 |
|
---|
700 |
|
---|
701 | /** Mark given range unavailable in frame zones */
|
---|
702 | void frame_mark_unavailable(pfn_t start, pfn_t count)
|
---|
703 | {
|
---|
704 | int i;
|
---|
705 | zone_t *zone;
|
---|
706 | int prefzone = 0;
|
---|
707 |
|
---|
708 | for (i=0; i<count; i++) {
|
---|
709 | zone = find_zone_and_lock(start+i,&prefzone);
|
---|
710 | if (!zone) /* PFN not found */
|
---|
711 | continue;
|
---|
712 | zone_mark_unavailable(zone, start+i-zone->base);
|
---|
713 |
|
---|
714 | spinlock_unlock(&zone->lock);
|
---|
715 | }
|
---|
716 | }
|
---|
717 |
|
---|
718 | /** Initialize physical memory management
|
---|
719 | *
|
---|
720 | * Initialize physical memory managemnt.
|
---|
721 | */
|
---|
722 | void frame_init(void)
|
---|
723 | {
|
---|
724 | if (config.cpu_active == 1) {
|
---|
725 | zones.count = 0;
|
---|
726 | spinlock_initialize(&zones.lock,"zones_glob_lock");
|
---|
727 | }
|
---|
728 | /* Tell the architecture to create some memory */
|
---|
729 | frame_arch_init();
|
---|
730 | if (config.cpu_active == 1) {
|
---|
731 | frame_mark_unavailable(ADDR2PFN(KA2PA(config.base)),
|
---|
732 | SIZE2PFN(config.kernel_size));
|
---|
733 | if (config.init_size > 0)
|
---|
734 | frame_mark_unavailable(ADDR2PFN(KA2PA(config.init_addr)),
|
---|
735 | SIZE2PFN(config.init_size));
|
---|
736 | }
|
---|
737 | }
|
---|
738 |
|
---|
739 |
|
---|
740 |
|
---|
741 | /** Prints list of zones
|
---|
742 | *
|
---|
743 | */
|
---|
744 | void zone_print_list(void) {
|
---|
745 | zone_t *zone = NULL;
|
---|
746 | int i;
|
---|
747 | ipl_t ipl;
|
---|
748 |
|
---|
749 | ipl = interrupts_disable();
|
---|
750 | spinlock_lock(&zones.lock);
|
---|
751 | printf("Base address\tFree Frames\tBusy Frames\n");
|
---|
752 | printf("------------\t-----------\t-----------\n");
|
---|
753 | for (i=0;i<zones.count;i++) {
|
---|
754 | zone = zones.info[i];
|
---|
755 | spinlock_lock(&zone->lock);
|
---|
756 | printf("%L\t%d\t\t%d\n",PFN2ADDR(zone->base),
|
---|
757 | zone->free_count, zone->busy_count);
|
---|
758 | spinlock_unlock(&zone->lock);
|
---|
759 | }
|
---|
760 | spinlock_unlock(&zones.lock);
|
---|
761 | interrupts_restore(ipl);
|
---|
762 | }
|
---|
763 |
|
---|
764 | /** Prints zone details
|
---|
765 | *
|
---|
766 | * @param base Zone base address
|
---|
767 | */
|
---|
768 | void zone_print_one(int znum) {
|
---|
769 | zone_t *zone = NULL;
|
---|
770 | ipl_t ipl;
|
---|
771 |
|
---|
772 | ipl = interrupts_disable();
|
---|
773 | spinlock_lock(&zones.lock);
|
---|
774 |
|
---|
775 | if (znum >= zones.count || znum < 0) {
|
---|
776 | printf("Zone number out of bounds.\n");
|
---|
777 | spinlock_unlock(&zones.lock);
|
---|
778 | interrupts_restore(ipl);
|
---|
779 | return;
|
---|
780 | }
|
---|
781 |
|
---|
782 | zone = zones.info[znum];
|
---|
783 |
|
---|
784 | spinlock_lock(&zone->lock);
|
---|
785 | printf("Memory zone information\n\n");
|
---|
786 | printf("Zone base address: %P\n", PFN2ADDR(zone->base));
|
---|
787 | printf("Zone size: %d frames (%dK)\n", zone->count, ((zone->count) * FRAME_SIZE) >> 10);
|
---|
788 | printf("Allocated space: %d frames (%dK)\n", zone->busy_count, (zone->busy_count * FRAME_SIZE) >> 10);
|
---|
789 | printf("Available space: %d (%dK)\n", zone->free_count, (zone->free_count * FRAME_SIZE) >> 10);
|
---|
790 |
|
---|
791 | printf("\nBuddy allocator structures:\n\n");
|
---|
792 | buddy_system_structure_print(zone->buddy_system, FRAME_SIZE);
|
---|
793 |
|
---|
794 | spinlock_unlock(&zone->lock);
|
---|
795 | spinlock_unlock(&zones.lock);
|
---|
796 | interrupts_restore(ipl);
|
---|
797 | }
|
---|
798 |
|
---|