Subversion Repositories HelenOS-historic

Rev

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