Subversion Repositories HelenOS-historic

Rev

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