Subversion Repositories HelenOS

Rev

Rev 538 | Rev 541 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
1 jermar 1
/*
2
 * Copyright (C) 2001-2004 Jakub Jermar
3
 * All rights reserved.
4
 *
5
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions
7
 * are met:
8
 *
9
 * - Redistributions of source code must retain the above copyright
10
 *   notice, this list of conditions and the following disclaimer.
11
 * - Redistributions in binary form must reproduce the above copyright
12
 *   notice, this list of conditions and the following disclaimer in the
13
 *   documentation and/or other materials provided with the distribution.
14
 * - The name of the author may not be used to endorse or promote products
15
 *   derived from this software without specific prior written permission.
16
 *
17
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
 */
28
 
368 jermar 29
#include <typedefs.h>
1 jermar 30
#include <arch/types.h>
31
#include <mm/heap.h>
32
#include <mm/frame.h>
33
#include <mm/vm.h>
34
#include <panic.h>
367 jermar 35
#include <debug.h>
368 jermar 36
#include <list.h>
1 jermar 37
#include <synch/spinlock.h>
115 jermar 38
#include <arch/asm.h>
195 vana 39
#include <arch.h>
533 bondari 40
#include <print.h>
536 bondari 41
#include <align.h>
115 jermar 42
 
367 jermar 43
spinlock_t zone_head_lock;       /**< this lock protects zone_head list */
44
link_t zone_head;                /**< list of all zones in the system */
45
 
539 jermar 46
/** Blacklist containing non-available areas of memory.
47
 *
48
 * This blacklist is used to exclude frames that cannot be allocated
49
 * (e.g. kernel memory) from available memory map.
50
 */
533 bondari 51
region_t zone_blacklist[ZONE_BLACKLIST_SIZE];
52
count_t zone_blacklist_count = 0;
53
 
479 bondari 54
static struct buddy_system_operations  zone_buddy_system_operations = {
55
    .find_buddy = zone_buddy_find_buddy,
56
    .bisect = zone_buddy_bisect,
57
    .coalesce = zone_buddy_coalesce,
58
    .set_order = zone_buddy_set_order,
59
    .get_order = zone_buddy_get_order,
533 bondari 60
    .mark_busy = zone_buddy_mark_busy,
479 bondari 61
};
62
 
368 jermar 63
/** Initialize physical memory management
64
 *
65
 * Initialize physical memory managemnt.
66
 */
1 jermar 67
void frame_init(void)
68
{
125 jermar 69
    if (config.cpu_active == 1) {
367 jermar 70
        zone_init();
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. */
228
    base &= ~(FRAME_SIZE - 1);
229
    /* Align size to frame boundary. */
230
    size = ALIGN(size, FRAME_SIZE);
231
 
533 bondari 232
    ASSERT(zone_blacklist_count <= ZONE_BLACKLIST_SIZE);
233
    zone_blacklist[index].base = base;
234
    zone_blacklist[index].size = size;
1 jermar 235
}
367 jermar 236
 
368 jermar 237
 
367 jermar 238
/** Initialize zonekeeping
239
 *
240
 * Initialize zonekeeping.
241
 */
242
void zone_init(void)
243
{
244
    spinlock_initialize(&zone_head_lock);
245
    list_initialize(&zone_head);
246
}
247
 
539 jermar 248
/** Create frame zones in region of available memory.
249
 *
250
 * Avoid any black listed areas of non-available memory.
251
 * Assume that the black listed areas cannot overlap
252
 * one another or cross available memory region boundaries.
253
 *
254
 * @param base Base address of available memory region.
255
 * @param size Size of the region.
256
 */
533 bondari 257
void zone_create_in_region(__address base, size_t size) {
258
    int i;
259
    zone_t * z;
537 jermar 260
    __address s;
261
    size_t sz;
533 bondari 262
 
263
    ASSERT(base % FRAME_SIZE == 0);
264
    ASSERT(size % FRAME_SIZE == 0);
265
 
537 jermar 266
    if (!size)
267
        return;
268
 
533 bondari 269
    for (i = 0; i < zone_blacklist_count; i++) {
270
        if (zone_blacklist[i].base >= base && zone_blacklist[i].base < base + size) {
271
            s = base; sz = zone_blacklist[i].base - base;
272
            ASSERT(base != s || sz != size);
273
            zone_create_in_region(s, sz);
274
 
275
            s = zone_blacklist[i].base + zone_blacklist[i].size;
276
            sz = (base + size) - (zone_blacklist[i].base + zone_blacklist[i].size);
277
            ASSERT(base != s || sz != size);
278
            zone_create_in_region(s, sz);
279
            return;
280
 
281
        }
282
    }
283
 
284
    z = zone_create(base, size, 0);
285
 
286
    if (!z) {
287
        panic("Cannot allocate zone (%dB).\n", size);
288
    }
289
 
290
    zone_attach(z);
291
}
292
 
293
 
367 jermar 294
/** Create frame zone
295
 *
296
 * Create new frame zone.
297
 *
298
 * @param start Physical address of the first frame within the zone.
299
 * @param size Size of the zone. Must be a multiple of FRAME_SIZE.
300
 * @param flags Zone flags.
301
 *
302
 * @return Initialized zone.
303
 */
533 bondari 304
zone_t * zone_create(__address start, size_t size, int flags)
367 jermar 305
{
306
    zone_t *z;
307
    count_t cnt;
308
    int i;
479 bondari 309
    __u8 max_order;
533 bondari 310
 
311
    /* hack for bug #10 */
312
    // if (start == 0x100000) size -= (FRAME_SIZE * 256);
313
 
314
    // printf("ZONE_CREATE()   %X - %X (%d kbytes)          \n", start, start+size, size/1024); 
367 jermar 315
    ASSERT(start % FRAME_SIZE == 0);
316
    ASSERT(size % FRAME_SIZE == 0);
317
 
318
    cnt = size / FRAME_SIZE;
319
 
374 jermar 320
    z = (zone_t *) early_malloc(sizeof(zone_t));
367 jermar 321
    if (z) {
322
        link_initialize(&z->link);
323
        spinlock_initialize(&z->lock);
324
 
325
        z->base = start;
326
        z->flags = flags;
327
 
328
        z->free_count = cnt;
329
        z->busy_count = 0;
330
 
374 jermar 331
        z->frames = (frame_t *) early_malloc(cnt * sizeof(frame_t));
367 jermar 332
        if (!z->frames) {
375 jermar 333
            early_free(z);
367 jermar 334
            return NULL;
335
        }
336
 
337
        for (i = 0; i<cnt; i++) {
338
            frame_initialize(&z->frames[i], z);
339
        }
340
 
479 bondari 341
        /*
342
         * Create buddy system for the zone
343
         */
537 jermar 344
        for (max_order = 0; cnt >> max_order; max_order++)
345
            ;
489 jermar 346
        z->buddy_system = buddy_system_create(max_order, &zone_buddy_system_operations, (void *) z);
533 bondari 347
 
348
        /* Stuffing frames */
349
        for (i = 0; i<cnt; i++) {
350
            z->frames[i].refcount = 0;
351
            buddy_system_free(z->buddy_system, &z->frames[i].buddy_link);  
352
        }
367 jermar 353
    }
354
    return z;
355
}
356
 
357
/** Attach frame zone
358
 *
359
 * Attach frame zone to zone list.
360
 *
361
 * @param zone Zone to be attached.
362
 */
363
void zone_attach(zone_t *zone)
364
{
413 jermar 365
    ipl_t ipl;
367 jermar 366
 
413 jermar 367
    ipl = interrupts_disable();
367 jermar 368
    spinlock_lock(&zone_head_lock);
369
 
370
    list_append(&zone->link, &zone_head);
371
 
372
    spinlock_unlock(&zone_head_lock);
413 jermar 373
    interrupts_restore(ipl);
367 jermar 374
}
375
 
376
/** Initialize frame structure
377
 *
378
 * Initialize frame structure.
379
 *
380
 * @param frame Frame structure to be initialized.
381
 * @param zone Host frame zone.
382
 */
383
void frame_initialize(frame_t *frame, zone_t *zone)
384
{
533 bondari 385
    frame->refcount = 1;
386
    frame->buddy_order = 0;
367 jermar 387
}
479 bondari 388
 
389
 
390
/** Buddy system find_buddy implementation
489 jermar 391
 *
392
 * @param b Buddy system.
480 bondari 393
 * @param block Block for which buddy should be found
479 bondari 394
 *
480 bondari 395
 * @return Buddy for given block if found
479 bondari 396
 */
489 jermar 397
link_t * zone_buddy_find_buddy(buddy_system_t *b, link_t * block) {
539 jermar 398
    frame_t * frame;
480 bondari 399
    zone_t * zone;
533 bondari 400
    count_t index;
480 bondari 401
    bool is_left, is_right;
479 bondari 402
 
480 bondari 403
    frame = list_get_instance(block, frame_t, buddy_link);
533 bondari 404
    zone = (zone_t *) b->data;
480 bondari 405
 
406
    is_left = IS_BUDDY_LEFT_BLOCK(zone, frame);
538 jermar 407
    is_right = !is_left;
480 bondari 408
 
533 bondari 409
    /*
410
     * test left buddy
411
     */
412
    if (is_left) {
413
        index = (FRAME_INDEX(zone, frame)) + (1 << frame->buddy_order);
414
    } else if (is_right) {
415
        index = (FRAME_INDEX(zone, frame)) - (1 << frame->buddy_order);
416
    }
417
 
418
    if (FRAME_INDEX_VALID(zone, index)) {
419
        if (    zone->frames[index].buddy_order == frame->buddy_order &&
420
            zone->frames[index].refcount == 0) {
421
            return &zone->frames[index].buddy_link;
480 bondari 422
        }
423
    }
424
 
539 jermar 425
    return NULL;   
479 bondari 426
}
427
 
428
/** Buddy system bisect implementation
429
 *
489 jermar 430
 * @param b Buddy system.
480 bondari 431
 * @param block Block to bisect
432
 *
433
 * @return right block
479 bondari 434
 */
489 jermar 435
link_t * zone_buddy_bisect(buddy_system_t *b, link_t * block) {
480 bondari 436
    frame_t * frame_l, * frame_r;
437
    frame_l = list_get_instance(block, frame_t, buddy_link);
533 bondari 438
    frame_r = (frame_l + (1 << (frame_l->buddy_order - 1)));
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;
452
    frame1 = list_get_instance(block_1, frame_t, buddy_link);
453
    frame2 = list_get_instance(block_2, frame_t, buddy_link);
533 bondari 454
    return frame1 < frame2 ? block_1 : block_2;
479 bondari 455
}
456
 
457
/** Buddy system set_order implementation
489 jermar 458
 *
459
 * @param b Buddy system.
480 bondari 460
 * @param block Buddy system block
461
 * @param order Order to set
479 bondari 462
 */
489 jermar 463
void zone_buddy_set_order(buddy_system_t *b, link_t * block, __u8 order) {
480 bondari 464
    frame_t * frame;
465
    frame = list_get_instance(block, frame_t, buddy_link);
466
    frame->buddy_order = order;
479 bondari 467
}
468
 
469
/** Buddy system get_order implementation
489 jermar 470
 *
471
 * @param b Buddy system.
480 bondari 472
 * @param block Buddy system block
479 bondari 473
 *
480 bondari 474
 * @return Order of block
479 bondari 475
 */
489 jermar 476
__u8 zone_buddy_get_order(buddy_system_t *b, link_t * block) {
480 bondari 477
    frame_t * frame;
478
    frame = list_get_instance(block, frame_t, buddy_link);
479
    return frame->buddy_order;
479 bondari 480
}
533 bondari 481
 
482
/** Buddy system mark_busy implementation
483
 *
484
 * @param b Buddy system
485
 * @param block Buddy system block
486
 *
487
 */
488
void zone_buddy_mark_busy(buddy_system_t *b, link_t * block) {
489
    frame_t * frame;
490
    frame = list_get_instance(block, frame_t, buddy_link);
491
    frame->refcount = 1;
492
}