Subversion Repositories HelenOS

Rev

Rev 623 | Rev 629 | 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
 
368 jermar 30
#include <typedefs.h>
1 jermar 31
#include <arch/types.h>
32
#include <mm/heap.h>
33
#include <mm/frame.h>
34
#include <mm/vm.h>
35
#include <panic.h>
367 jermar 36
#include <debug.h>
368 jermar 37
#include <list.h>
1 jermar 38
#include <synch/spinlock.h>
115 jermar 39
#include <arch/asm.h>
195 vana 40
#include <arch.h>
533 bondari 41
#include <print.h>
536 bondari 42
#include <align.h>
115 jermar 43
 
623 jermar 44
SPINLOCK_INITIALIZE(zone_head_lock);    /**< this lock protects zone_head list */
624 jermar 45
LIST_INITIALIZE(zone_head);             /**< list of all zones in the system */
367 jermar 46
 
539 jermar 47
/** Blacklist containing non-available areas of memory.
48
 *
49
 * This blacklist is used to exclude frames that cannot be allocated
50
 * (e.g. kernel memory) from available memory map.
51
 */
533 bondari 52
region_t zone_blacklist[ZONE_BLACKLIST_SIZE];
53
count_t zone_blacklist_count = 0;
54
 
479 bondari 55
static struct buddy_system_operations  zone_buddy_system_operations = {
56
    .find_buddy = zone_buddy_find_buddy,
57
    .bisect = zone_buddy_bisect,
58
    .coalesce = zone_buddy_coalesce,
59
    .set_order = zone_buddy_set_order,
60
    .get_order = zone_buddy_get_order,
533 bondari 61
    .mark_busy = zone_buddy_mark_busy,
479 bondari 62
};
63
 
368 jermar 64
/** Initialize physical memory management
65
 *
66
 * Initialize physical memory managemnt.
67
 */
1 jermar 68
void frame_init(void)
69
{
125 jermar 70
    if (config.cpu_active == 1) {
537 jermar 71
        frame_region_not_free(KA2PA(config.base), config.kernel_size);
1 jermar 72
    }
73
 
74
    frame_arch_init();
75
}
76
 
537 jermar 77
/** Allocate power-of-two frames of physical memory.
368 jermar 78
 *
79
 * @param flags Flags for host zone selection and address processing.
537 jermar 80
 * @param order Allocate exactly 2^order frames.
368 jermar 81
 *
82
 * @return Allocated frame.
1 jermar 83
 */
533 bondari 84
__address frame_alloc(int flags, __u8 order)
1 jermar 85
{
413 jermar 86
    ipl_t ipl;
368 jermar 87
    link_t *cur, *tmp;
88
    zone_t *z;
89
    zone_t *zone = NULL;
90
    frame_t *frame = NULL;
91
    __address v;
1 jermar 92
 
93
loop:
413 jermar 94
    ipl = interrupts_disable();
368 jermar 95
    spinlock_lock(&zone_head_lock);
533 bondari 96
 
368 jermar 97
    /*
98
     * First, find suitable frame zone.
99
     */
100
    for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {
101
        z = list_get_instance(cur, zone_t, link);
1 jermar 102
 
368 jermar 103
        spinlock_lock(&z->lock);
533 bondari 104
 
105
        /* Check if the zone has 2^order frames area available  */
106
        if (buddy_system_can_alloc(z->buddy_system, order)) {
368 jermar 107
            zone = z;
108
            break;
1 jermar 109
        }
533 bondari 110
 
368 jermar 111
        spinlock_unlock(&z->lock);
1 jermar 112
    }
368 jermar 113
 
114
    if (!zone) {
115
        if (flags & FRAME_PANIC)
116
            panic("Can't allocate frame.\n");
117
 
118
        /*
119
         * TODO: Sleep until frames are available again.
120
         */
121
        spinlock_unlock(&zone_head_lock);
413 jermar 122
        interrupts_restore(ipl);
1 jermar 123
 
368 jermar 124
        panic("Sleep not implemented.\n");
125
        goto loop;
126
    }
1 jermar 127
 
368 jermar 128
 
533 bondari 129
    /* Allocate frames from zone buddy system */
539 jermar 130
    tmp = buddy_system_alloc(zone->buddy_system, order);
1 jermar 131
 
539 jermar 132
    ASSERT(tmp);
533 bondari 133
 
539 jermar 134
    /* Update zone information. */
135
    zone->free_count -= (1 << order);
136
    zone->busy_count += (1 << order);
137
 
138
    /* Frame will be actually a first frame of the block. */
139
    frame = list_get_instance(tmp, frame_t, buddy_link);
140
 
533 bondari 141
    /* get frame address */
479 bondari 142
    v = FRAME2ADDR(zone, frame);
533 bondari 143
 
539 jermar 144
    spinlock_unlock(&zone->lock);
145
    spinlock_unlock(&zone_head_lock);
146
    interrupts_restore(ipl);
147
 
148
 
368 jermar 149
    if (flags & FRAME_KA)
150
        v = PA2KA(v);
151
 
152
    return v;
1 jermar 153
}
154
 
368 jermar 155
/** Free a frame.
156
 *
157
 * Find respective frame structrue for supplied addr.
158
 * Decrement frame reference count.
159
 * If it drops to zero, move the frame structure to free list.
160
 *
161
 * @param addr Address of the frame to be freed. It must be a multiple of FRAME_SIZE.
1 jermar 162
 */
163
void frame_free(__address addr)
164
{
413 jermar 165
    ipl_t ipl;
368 jermar 166
    link_t *cur;
167
    zone_t *z;
168
    zone_t *zone = NULL;
169
    frame_t *frame;
170
    ASSERT(addr % FRAME_SIZE == 0);
1 jermar 171
 
413 jermar 172
    ipl = interrupts_disable();
368 jermar 173
    spinlock_lock(&zone_head_lock);
1 jermar 174
 
368 jermar 175
    /*
176
     * First, find host frame zone for addr.
177
     */
178
    for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {
179
        z = list_get_instance(cur, zone_t, link);
180
 
181
        spinlock_lock(&z->lock);
182
 
183
        if (IS_KA(addr))
184
            addr = KA2PA(addr);
185
 
186
        /*
187
         * Check if addr belongs to z.
188
         */
189
        if ((addr >= z->base) && (addr <= z->base + (z->free_count + z->busy_count) * FRAME_SIZE)) {
190
            zone = z;
191
            break;
1 jermar 192
        }
368 jermar 193
        spinlock_unlock(&z->lock);
1 jermar 194
    }
195
 
368 jermar 196
    ASSERT(zone != NULL);
197
 
479 bondari 198
    frame = ADDR2FRAME(zone, addr);
533 bondari 199
 
368 jermar 200
    ASSERT(frame->refcount);
201
 
202
    if (!--frame->refcount) {
533 bondari 203
        buddy_system_free(zone->buddy_system, &frame->buddy_link);
368 jermar 204
    }
539 jermar 205
 
206
    /* Update zone information. */
207
    zone->free_count += (1 << frame->buddy_order);
208
    zone->busy_count -= (1 << frame->buddy_order);
368 jermar 209
 
539 jermar 210
    spinlock_unlock(&zone->lock);
368 jermar 211
    spinlock_unlock(&zone_head_lock);
413 jermar 212
    interrupts_restore(ipl);
1 jermar 213
}
214
 
368 jermar 215
/** Mark frame region not free.
216
 *
217
 * Mark frame region not free.
218
 *
537 jermar 219
 * @param base Base address of non-available region.
220
 * @param size Size of non-available region.
368 jermar 221
 */
533 bondari 222
void frame_region_not_free(__address base, size_t size)
1 jermar 223
{
537 jermar 224
    index_t index;
533 bondari 225
    index = zone_blacklist_count++;
537 jermar 226
 
227
    /* Force base to the nearest lower address frame boundary. */
564 jermar 228
    base = ALIGN_DOWN(base, FRAME_SIZE);
537 jermar 229
    /* Align size to frame boundary. */
564 jermar 230
    size = ALIGN_UP(size, FRAME_SIZE);
537 jermar 231
 
564 jermar 232
    ASSERT(index < ZONE_BLACKLIST_SIZE);
533 bondari 233
    zone_blacklist[index].base = base;
234
    zone_blacklist[index].size = size;
1 jermar 235
}
367 jermar 236
 
539 jermar 237
/** Create frame zones in region of available memory.
238
 *
239
 * Avoid any black listed areas of non-available memory.
240
 * Assume that the black listed areas cannot overlap
241
 * one another or cross available memory region boundaries.
242
 *
243
 * @param base Base address of available memory region.
244
 * @param size Size of the region.
245
 */
533 bondari 246
void zone_create_in_region(__address base, size_t size) {
247
    int i;
248
    zone_t * z;
537 jermar 249
    __address s;
250
    size_t sz;
533 bondari 251
 
252
    ASSERT(base % FRAME_SIZE == 0);
253
    ASSERT(size % FRAME_SIZE == 0);
254
 
537 jermar 255
    if (!size)
256
        return;
257
 
533 bondari 258
    for (i = 0; i < zone_blacklist_count; i++) {
259
        if (zone_blacklist[i].base >= base && zone_blacklist[i].base < base + size) {
260
            s = base; sz = zone_blacklist[i].base - base;
261
            ASSERT(base != s || sz != size);
262
            zone_create_in_region(s, sz);
263
 
264
            s = zone_blacklist[i].base + zone_blacklist[i].size;
265
            sz = (base + size) - (zone_blacklist[i].base + zone_blacklist[i].size);
266
            ASSERT(base != s || sz != size);
267
            zone_create_in_region(s, sz);
268
            return;
269
 
270
        }
271
    }
272
 
273
    z = zone_create(base, size, 0);
274
 
275
    if (!z) {
564 jermar 276
        panic("Cannot allocate zone (base=%P, size=%d).\n", base, size);
533 bondari 277
    }
278
 
279
    zone_attach(z);
280
}
281
 
282
 
367 jermar 283
/** Create frame zone
284
 *
285
 * Create new frame zone.
286
 *
287
 * @param start Physical address of the first frame within the zone.
288
 * @param size Size of the zone. Must be a multiple of FRAME_SIZE.
289
 * @param flags Zone flags.
290
 *
291
 * @return Initialized zone.
292
 */
533 bondari 293
zone_t * zone_create(__address start, size_t size, int flags)
367 jermar 294
{
295
    zone_t *z;
296
    count_t cnt;
297
    int i;
479 bondari 298
    __u8 max_order;
533 bondari 299
 
367 jermar 300
    ASSERT(start % FRAME_SIZE == 0);
301
    ASSERT(size % FRAME_SIZE == 0);
302
 
303
    cnt = size / FRAME_SIZE;
304
 
374 jermar 305
    z = (zone_t *) early_malloc(sizeof(zone_t));
367 jermar 306
    if (z) {
307
        link_initialize(&z->link);
552 palkovsky 308
        spinlock_initialize(&z->lock, "zone_lock");
367 jermar 309
 
310
        z->base = start;
311
        z->flags = flags;
312
 
313
        z->free_count = cnt;
314
        z->busy_count = 0;
315
 
374 jermar 316
        z->frames = (frame_t *) early_malloc(cnt * sizeof(frame_t));
367 jermar 317
        if (!z->frames) {
375 jermar 318
            early_free(z);
367 jermar 319
            return NULL;
320
        }
321
 
322
        for (i = 0; i<cnt; i++) {
323
            frame_initialize(&z->frames[i], z);
324
        }
325
 
479 bondari 326
        /*
327
         * Create buddy system for the zone
328
         */
537 jermar 329
        for (max_order = 0; cnt >> max_order; max_order++)
330
            ;
489 jermar 331
        z->buddy_system = buddy_system_create(max_order, &zone_buddy_system_operations, (void *) z);
533 bondari 332
 
333
        /* Stuffing frames */
334
        for (i = 0; i<cnt; i++) {
335
            z->frames[i].refcount = 0;
336
            buddy_system_free(z->buddy_system, &z->frames[i].buddy_link);  
337
        }
367 jermar 338
    }
339
    return z;
340
}
341
 
342
/** Attach frame zone
343
 *
344
 * Attach frame zone to zone list.
345
 *
346
 * @param zone Zone to be attached.
347
 */
348
void zone_attach(zone_t *zone)
349
{
413 jermar 350
    ipl_t ipl;
367 jermar 351
 
413 jermar 352
    ipl = interrupts_disable();
367 jermar 353
    spinlock_lock(&zone_head_lock);
354
 
355
    list_append(&zone->link, &zone_head);
356
 
357
    spinlock_unlock(&zone_head_lock);
413 jermar 358
    interrupts_restore(ipl);
367 jermar 359
}
360
 
361
/** Initialize frame structure
362
 *
363
 * Initialize frame structure.
364
 *
365
 * @param frame Frame structure to be initialized.
366
 * @param zone Host frame zone.
367
 */
368
void frame_initialize(frame_t *frame, zone_t *zone)
369
{
533 bondari 370
    frame->refcount = 1;
371
    frame->buddy_order = 0;
367 jermar 372
}
479 bondari 373
 
374
 
375
/** Buddy system find_buddy implementation
489 jermar 376
 *
377
 * @param b Buddy system.
480 bondari 378
 * @param block Block for which buddy should be found
479 bondari 379
 *
480 bondari 380
 * @return Buddy for given block if found
479 bondari 381
 */
489 jermar 382
link_t * zone_buddy_find_buddy(buddy_system_t *b, link_t * block) {
539 jermar 383
    frame_t * frame;
480 bondari 384
    zone_t * zone;
564 jermar 385
    index_t index;
480 bondari 386
    bool is_left, is_right;
479 bondari 387
 
480 bondari 388
    frame = list_get_instance(block, frame_t, buddy_link);
533 bondari 389
    zone = (zone_t *) b->data;
480 bondari 390
 
564 jermar 391
    ASSERT(IS_BUDDY_ORDER_OK(FRAME_INDEX(zone, frame), frame->buddy_order));
392
 
480 bondari 393
    is_left = IS_BUDDY_LEFT_BLOCK(zone, frame);
564 jermar 394
    is_right = IS_BUDDY_RIGHT_BLOCK(zone, frame);
480 bondari 395
 
564 jermar 396
    ASSERT(is_left ^ is_right);
397
 
533 bondari 398
    if (is_left) {
399
        index = (FRAME_INDEX(zone, frame)) + (1 << frame->buddy_order);
615 palkovsky 400
    } else { // if (is_right)
533 bondari 401
        index = (FRAME_INDEX(zone, frame)) - (1 << frame->buddy_order);
402
    }
403
 
404
    if (FRAME_INDEX_VALID(zone, index)) {
405
        if (    zone->frames[index].buddy_order == frame->buddy_order &&
406
            zone->frames[index].refcount == 0) {
407
            return &zone->frames[index].buddy_link;
480 bondari 408
        }
409
    }
410
 
539 jermar 411
    return NULL;   
479 bondari 412
}
413
 
414
/** Buddy system bisect implementation
415
 *
489 jermar 416
 * @param b Buddy system.
480 bondari 417
 * @param block Block to bisect
418
 *
419
 * @return right block
479 bondari 420
 */
489 jermar 421
link_t * zone_buddy_bisect(buddy_system_t *b, link_t * block) {
480 bondari 422
    frame_t * frame_l, * frame_r;
564 jermar 423
 
480 bondari 424
    frame_l = list_get_instance(block, frame_t, buddy_link);
533 bondari 425
    frame_r = (frame_l + (1 << (frame_l->buddy_order - 1)));
564 jermar 426
 
480 bondari 427
    return &frame_r->buddy_link;
479 bondari 428
}
429
 
430
/** Buddy system coalesce implementation
431
 *
489 jermar 432
 * @param b Buddy system.
480 bondari 433
 * @param block_1 First block
434
 * @param block_2 First block's buddy
435
 *
436
 * @return Coalesced block (actually block that represents lower address)
479 bondari 437
 */
489 jermar 438
link_t * zone_buddy_coalesce(buddy_system_t *b, link_t * block_1, link_t * block_2) {
480 bondari 439
    frame_t * frame1, * frame2;
564 jermar 440
 
480 bondari 441
    frame1 = list_get_instance(block_1, frame_t, buddy_link);
442
    frame2 = list_get_instance(block_2, frame_t, buddy_link);
564 jermar 443
 
533 bondari 444
    return frame1 < frame2 ? block_1 : block_2;
479 bondari 445
}
446
 
447
/** Buddy system set_order implementation
489 jermar 448
 *
449
 * @param b Buddy system.
480 bondari 450
 * @param block Buddy system block
451
 * @param order Order to set
479 bondari 452
 */
489 jermar 453
void zone_buddy_set_order(buddy_system_t *b, link_t * block, __u8 order) {
480 bondari 454
    frame_t * frame;
455
    frame = list_get_instance(block, frame_t, buddy_link);
456
    frame->buddy_order = order;
479 bondari 457
}
458
 
459
/** Buddy system get_order implementation
489 jermar 460
 *
461
 * @param b Buddy system.
480 bondari 462
 * @param block Buddy system block
479 bondari 463
 *
480 bondari 464
 * @return Order of block
479 bondari 465
 */
489 jermar 466
__u8 zone_buddy_get_order(buddy_system_t *b, link_t * block) {
480 bondari 467
    frame_t * frame;
468
    frame = list_get_instance(block, frame_t, buddy_link);
469
    return frame->buddy_order;
479 bondari 470
}
533 bondari 471
 
472
/** Buddy system mark_busy implementation
473
 *
474
 * @param b Buddy system
475
 * @param block Buddy system block
476
 *
477
 */
478
void zone_buddy_mark_busy(buddy_system_t *b, link_t * block) {
479
    frame_t * frame;
480
    frame = list_get_instance(block, frame_t, buddy_link);
481
    frame->refcount = 1;
482
}