Subversion Repositories HelenOS

Rev

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