WebSVN – HelenOS – Diff – /trunk/kernel/generic/src/mm/frame.c


/*
 * Copyright (c) 2001-2005 Jakub Jermar
 * Copyright (c) 2005 Sergey Bondari
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
/** @addtogroup genericmm
 * @{
 */
 
/**
 * @file
 * @brief   Physical frame allocator.
 *
 * This file contains the physical frame allocator and memory zone management.
 * The frame allocator is built on top of the buddy allocator.
 *
 * @see buddy.c
 */
 
/*
 * Locking order
 *
 * In order to access particular zone, the process must first lock
 * the zones.lock, then lock the zone and then unlock the zones.lock.
 * This insures, that we can fiddle with the zones in runtime without
 * affecting the processes.
 *
 */
 
#include <arch/types.h>
#include <mm/frame.h>
#include <mm/as.h>
#include <panic.h>
#include <debug.h>
#include <adt/list.h>
#include <synch/spinlock.h>
#include <synch/mutex.h>
#include <synch/condvar.h>
#include <arch/asm.h>
#include <arch.h>
#include <print.h>
#include <align.h>
#include <mm/slab.h>
#include <bitops.h>
#include <macros.h>
#include <config.h>
 
typedef struct {
    count_t refcount;   /**< tracking of shared frames  */
    uint8_t buddy_order;    /**< buddy system block order */
    link_t buddy_link;  /**< link to the next free block inside one
                     order */
    void *parent;           /**< If allocated by slab, this points there */
} frame_t;
 
typedef struct {
    SPINLOCK_DECLARE(lock); /**< this lock protects everything below */
    pfn_t base;     /**< frame_no of the first frame in the frames
                     array */
    count_t count;          /**< Size of zone */
 
    frame_t *frames;    /**< array of frame_t structures in this
                     zone */
    count_t free_count; /**< number of free frame_t structures */
    count_t busy_count; /**< number of busy frame_t structures */
   
    buddy_system_t *buddy_system; /**< buddy system for the zone */
    int flags;
} zone_t;
 
/*
 * The zoneinfo.lock must be locked when accessing zoneinfo structure.
 * Some of the attributes in zone_t structures are 'read-only'
 */
 
typedef struct {
    SPINLOCK_DECLARE(lock);
    unsigned int count;
    zone_t *info[ZONES_MAX];
} zones_t;
 
static zones_t zones;
 
/*
 * Synchronization primitives used to sleep when there is no memory
 * available.
 */
mutex_t zones_mtx;
condvar_t zones_cv;
int new_freed_mem = false;
 
/********************/
/* Helper functions */
/********************/
 
static inline index_t frame_index(zone_t *zone, frame_t *frame)
{
    return (index_t) (frame - zone->frames);
}
 
static inline index_t frame_index_abs(zone_t *zone, frame_t *frame)
{
    return (index_t) (frame - zone->frames) + zone->base;
}
 
static inline int frame_index_valid(zone_t *zone, index_t index)
{
    return (index < zone->count);
}
 
/** Compute pfn_t from frame_t pointer & zone pointer */
static index_t make_frame_index(zone_t *zone, frame_t *frame)
{
    return (frame - zone->frames);
}
 
/** Initialize frame structure.
 *
 * @param framei    Frame structure to be initialized.
 */
static void frame_initialize(frame_t *frame)
{
    frame->refcount = 1;
    frame->buddy_order = 0;
}
 
/**********************/
/* Zoneinfo functions */
/**********************/
 
/** Insert-sort zone into zones list.
 *
 * @param newzone   New zone to be inserted into zone list.
 * @return      Zone number on success, -1 on error.
 */
static int zones_add_zone(zone_t *newzone)
{
    unsigned int i, j;
    ipl_t ipl;
    zone_t *z;
 
    ipl = interrupts_disable();
    spinlock_lock(&zones.lock);
   
    /* Try to merge */
    if (zones.count + 1 == ZONES_MAX) {
        printf("Maximum zone count %u exceeded!\n", ZONES_MAX);
        spinlock_unlock(&zones.lock);
        interrupts_restore(ipl);
        return -1;
    }
   
    for (i = 0; i < zones.count; i++) {
        /* Check for overflow */
        z = zones.info[i];
        if (overlaps(newzone->base, newzone->count, z->base,
            z->count)) {
            printf("Zones overlap!\n");
            return -1;
        }
        if (newzone->base < z->base)
            break;
    }
   
    /* Move other zones up */
    for (j = i; j < zones.count; j++)
        zones.info[j + 1] = zones.info[j];
   
    zones.info[i] = newzone;
    zones.count++;
   
    spinlock_unlock(&zones.lock);
    interrupts_restore(ipl);
 
    return i;
}
 
/**
 * Try to find a zone where can we find the frame.
 *
 * Assume interrupts are disabled.
 *
 * @param frame     Frame number contained in zone.
 * @param pzone     If not null, it is used as zone hint. Zone index is
 *          filled into the variable on success.
 * @return      Pointer to locked zone containing frame.
 */
static zone_t *find_zone_and_lock(pfn_t frame, unsigned int *pzone)
{
    unsigned int i;
    unsigned int hint = pzone ? *pzone : 0;
    zone_t *z;
   
    spinlock_lock(&zones.lock);
 
    if (hint >= zones.count)
        hint = 0;
   
    i = hint;
    do {
        z = zones.info[i];
        spinlock_lock(&z->lock);
        if (z->base <= frame && z->base + z->count > frame) {
            /* Unlock the global lock */
            spinlock_unlock(&zones.lock);
            if (pzone)
                *pzone = i;
            return z;
        }
        spinlock_unlock(&z->lock);
 
        i++;
        if (i >= zones.count)
            i = 0;
    } while(i != hint);
 
    spinlock_unlock(&zones.lock);
    return NULL;
}
 
/** @return True if zone can allocate specified order */
static int zone_can_alloc(zone_t *z, uint8_t order)
{
    return buddy_system_can_alloc(z->buddy_system, order);
}
 
/** Find and lock zone that can allocate order frames.
 *
 * Assume interrupts are disabled.
 *
 * @param order     Size (2^order) of free space we are trying to find.
 * @param pzone     Pointer to preferred zone or NULL, on return contains
 *          zone number.
 */
static zone_t *find_free_zone_and_lock(uint8_t order, unsigned int *pzone)
{
    unsigned int i;
    zone_t *z;
    unsigned int hint = pzone ? *pzone : 0;
   
    spinlock_lock(&zones.lock);
    if (hint >= zones.count)
        hint = 0;
    i = hint;
    do {
        z = zones.info[i];
       
        spinlock_lock(&z->lock);
 
        /* Check if the zone has 2^order frames area available  */
        if (zone_can_alloc(z, order)) {
            spinlock_unlock(&zones.lock);
            if (pzone)
                *pzone = i;
            return z;
        }
        spinlock_unlock(&z->lock);
        if (++i >= zones.count)
            i = 0;
    } while(i != hint);
    spinlock_unlock(&zones.lock);
    return NULL;
}
 
/**************************/
/* Buddy system functions */
/**************************/
 
/** Buddy system find_block implementation.
 *
 * Find block that is parent of current list.
 * That means go to lower addresses, until such block is found
 *
 * @param order     Order of parent must be different then this
 *          parameter!!
 */
static link_t *zone_buddy_find_block(buddy_system_t *b, link_t *child,
    uint8_t order)
{
    frame_t *frame;
    zone_t *zone;
    index_t index;
   
    frame = list_get_instance(child, frame_t, buddy_link);
    zone = (zone_t *) b->data;
 
    index = frame_index(zone, frame);
    do {
        if (zone->frames[index].buddy_order != order) {
            return &zone->frames[index].buddy_link;
        }
    } while(index-- > 0);
    return NULL;
}
 
static void zone_buddy_print_id(buddy_system_t *b, link_t *block)
{
    frame_t *frame;
    zone_t *zone;
    index_t index;
 
    frame = list_get_instance(block, frame_t, buddy_link);
    zone = (zone_t *) b->data;
    index = frame_index(zone, frame);
    printf("%" PRIi, index);
}                    
 
/** Buddy system find_buddy implementation.
 *
 * @param b     Buddy system.
 * @param block     Block for which buddy should be found.
 *
 * @return      Buddy for given block if found.
 */
static link_t *zone_buddy_find_buddy(buddy_system_t *b, link_t *block)
{
    frame_t *frame;
    zone_t *zone;
    index_t index;
    bool is_left, is_right;
 
    frame = list_get_instance(block, frame_t, buddy_link);
    zone = (zone_t *) b->data;
    ASSERT(IS_BUDDY_ORDER_OK(frame_index_abs(zone, frame),
        frame->buddy_order));
   
    is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame);
    is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame);
 
    ASSERT(is_left ^ is_right);
    if (is_left) {
        index = (frame_index(zone, frame)) +
            (1 << frame->buddy_order);
    } else {    /* if (is_right) */
        index = (frame_index(zone, frame)) -
            (1 << frame->buddy_order);
    }
   
    if (frame_index_valid(zone, index)) {
        if (zone->frames[index].buddy_order == frame->buddy_order &&
            zone->frames[index].refcount == 0) {
            return &zone->frames[index].buddy_link;
        }
    }
 
    return NULL;   
}
 
/** Buddy system bisect implementation.
 *
 * @param b     Buddy system.
 * @param block     Block to bisect.
 *
 * @return      Right block.
 */
static link_t *zone_buddy_bisect(buddy_system_t *b, link_t *block)
{
    frame_t *frame_l, *frame_r;
 
    frame_l = list_get_instance(block, frame_t, buddy_link);
    frame_r = (frame_l + (1 << (frame_l->buddy_order - 1)));
   
    return &frame_r->buddy_link;
}
 
/** Buddy system coalesce implementation.
 *
 * @param b     Buddy system.
 * @param block_1   First block.
 * @param block_2   First block's buddy.
 *
 * @return      Coalesced block (actually block that represents lower
 *          address).
 */
static link_t *zone_buddy_coalesce(buddy_system_t *b, link_t *block_1,
    link_t *block_2)
{
    frame_t *frame1, *frame2;
   
    frame1 = list_get_instance(block_1, frame_t, buddy_link);
    frame2 = list_get_instance(block_2, frame_t, buddy_link);
   
    return frame1 < frame2 ? block_1 : block_2;
}
 
/** Buddy system set_order implementation.
 *
 * @param b     Buddy system.
 * @param block     Buddy system block.
 * @param order     Order to set.
 */
static void zone_buddy_set_order(buddy_system_t *b, link_t *block,
    uint8_t order)
{
    frame_t *frame;
    frame = list_get_instance(block, frame_t, buddy_link);
    frame->buddy_order = order;
}
 
/** Buddy system get_order implementation.
 *
 * @param b     Buddy system.
 * @param block     Buddy system block.
 *
 * @return      Order of block.
 */
static uint8_t zone_buddy_get_order(buddy_system_t *b, link_t *block)
{
    frame_t *frame;
    frame = list_get_instance(block, frame_t, buddy_link);
    return frame->buddy_order;
}
 
/** Buddy system mark_busy implementation.
 *
 * @param b     Buddy system.
 * @param block     Buddy system block.
 */
static void zone_buddy_mark_busy(buddy_system_t *b, link_t * block)
{
    frame_t * frame;
 
    frame = list_get_instance(block, frame_t, buddy_link);
    frame->refcount = 1;
}
 
/** Buddy system mark_available implementation.
 *
 * @param b     Buddy system.
 * @param block     Buddy system block.
 */
static void zone_buddy_mark_available(buddy_system_t *b, link_t *block)
{
    frame_t *frame;
    frame = list_get_instance(block, frame_t, buddy_link);
    frame->refcount = 0;
}
 
static buddy_system_operations_t zone_buddy_system_operations = {
    .find_buddy = zone_buddy_find_buddy,
    .bisect = zone_buddy_bisect,
    .coalesce = zone_buddy_coalesce,
    .set_order = zone_buddy_set_order,
    .get_order = zone_buddy_get_order,
    .mark_busy = zone_buddy_mark_busy,
    .mark_available = zone_buddy_mark_available,
    .find_block = zone_buddy_find_block,
    .print_id = zone_buddy_print_id
};
 
/******************/
/* Zone functions */
/******************/
 
/** Allocate frame in particular zone.
 *
 * Assume zone is locked.
 * Panics if allocation is impossible.
 *
 * @param zone      Zone to allocate from.
 * @param order     Allocate exactly 2^order frames.
 *
 * @return      Frame index in zone.
 *
 */
static pfn_t zone_frame_alloc(zone_t *zone, uint8_t order)
{
    pfn_t v;
    link_t *tmp;
    frame_t *frame;
 
    /* Allocate frames from zone buddy system */
    tmp = buddy_system_alloc(zone->buddy_system, order);
   
    ASSERT(tmp);
   
    /* Update zone information. */
    zone->free_count -= (1 << order);
    zone->busy_count += (1 << order);
 
    /* Frame will be actually a first frame of the block. */
    frame = list_get_instance(tmp, frame_t, buddy_link);
   
    /* get frame address */
    v = make_frame_index(zone, frame);
    return v;
}
 
/** Free frame from zone.
 *
 * Assume zone is locked.
 *
 * @param zone      Pointer to zone from which the frame is to be freed.
 * @param frame_idx Frame index relative to zone.
 */
static void zone_frame_free(zone_t *zone, index_t frame_idx)
{
    frame_t *frame;
    uint8_t order;
 
    frame = &zone->frames[frame_idx];
   
    /* remember frame order */
    order = frame->buddy_order;
 
    ASSERT(frame->refcount);
 
    if (!--frame->refcount) {
        buddy_system_free(zone->buddy_system, &frame->buddy_link);
   
        /* Update zone information. */
        zone->free_count += (1 << order);
        zone->busy_count -= (1 << order);
    }
}
 
/** Return frame from zone. */
static frame_t * zone_get_frame(zone_t *zone, index_t frame_idx)
{
    ASSERT(frame_idx < zone->count);
    return &zone->frames[frame_idx];
}
 
/** Mark frame in zone unavailable to allocation. */
static void zone_mark_unavailable(zone_t *zone, index_t frame_idx)
{
    frame_t *frame;
    link_t *link;
 
    frame = zone_get_frame(zone, frame_idx);
    if (frame->refcount)
        return;
    link = buddy_system_alloc_block(zone->buddy_system,
        &frame->buddy_link);
    ASSERT(link);
    zone->free_count--;
}
 
/** Join two zones.
 *
 * Expect zone_t *z to point to space at least zone_conf_size large.
 *
 * Assume z1 & z2 are locked.
 *
 * @param z     Target zone structure pointer.
 * @param z1        Zone to merge.
 * @param z2        Zone to merge.
 */
static void _zone_merge(zone_t *z, zone_t *z1, zone_t *z2)
{
    uint8_t max_order;
    unsigned int i;
    int z2idx;
    pfn_t frame_idx;
    frame_t *frame;
 
    ASSERT(!overlaps(z1->base, z1->count, z2->base, z2->count));
    ASSERT(z1->base < z2->base);
 
    spinlock_initialize(&z->lock, "zone_lock");
    z->base = z1->base;
    z->count = z2->base + z2->count - z1->base;
    z->flags = z1->flags & z2->flags;
 
    z->free_count = z1->free_count + z2->free_count;
    z->busy_count = z1->busy_count + z2->busy_count;
   
    max_order = fnzb(z->count);
 
    z->buddy_system = (buddy_system_t *) &z[1];
    buddy_system_create(z->buddy_system, max_order,
        &zone_buddy_system_operations, (void *) z);
 
    z->frames = (frame_t *)((uint8_t *) z->buddy_system +
        buddy_conf_size(max_order));
    for (i = 0; i < z->count; i++) {
        /* This marks all frames busy */
        frame_initialize(&z->frames[i]);
    }
    /* Copy frames from both zones to preserve full frame orders,
     * parents etc. Set all free frames with refcount=0 to 1, because
     * we add all free frames to buddy allocator later again, clear
     * order to 0. Don't set busy frames with refcount=0, as they
     * will not be reallocated during merge and it would make later
     * problems with allocation/free.
     */
    for (i = 0; i < z1->count; i++)
        z->frames[i] = z1->frames[i];
    for (i = 0; i < z2->count; i++) {
        z2idx = i + (z2->base - z1->base);
        z->frames[z2idx] = z2->frames[i];
    }
    i = 0;
    while (i < z->count) {
        if (z->frames[i].refcount) {
            /* skip busy frames */
            i += 1 << z->frames[i].buddy_order;
        } else { /* Free frames, set refcount=1 */
            /* All free frames have refcount=0, we need not
             * to check the order */
            z->frames[i].refcount = 1;
            z->frames[i].buddy_order = 0;
            i++;
        }
    }
    /* Add free blocks from the 2 original zones */
    while (zone_can_alloc(z1, 0)) {
        frame_idx = zone_frame_alloc(z1, 0);
        frame = &z->frames[frame_idx];
        frame->refcount = 0;
        buddy_system_free(z->buddy_system, &frame->buddy_link);
    }
    while (zone_can_alloc(z2, 0)) {
        frame_idx = zone_frame_alloc(z2, 0);
        frame = &z->frames[frame_idx + (z2->base - z1->base)];
        frame->refcount = 0;
        buddy_system_free(z->buddy_system, &frame->buddy_link);
    }
}
 
/** Return old configuration frames into the zone.
 *
 * We have several cases
 * - the conf. data is outside of zone -> exit, shall we call frame_free??
 * - the conf. data was created by zone_create or
 *   updated with reduce_region -> free every frame
 *
 * @param newzone   The actual zone where freeing should occur.
 * @param oldzone   Pointer to old zone configuration data that should
 *          be freed from new zone.
 */
static void return_config_frames(zone_t *newzone, zone_t *oldzone)
{
    pfn_t pfn;
    frame_t *frame;
    count_t cframes;
    unsigned int i;
 
    pfn = ADDR2PFN((uintptr_t)KA2PA(oldzone));
    cframes = SIZE2FRAMES(zone_conf_size(oldzone->count));
   
    if (pfn < newzone->base || pfn >= newzone->base + newzone->count)
        return;
 
    frame = &newzone->frames[pfn - newzone->base];
    ASSERT(!frame->buddy_order);
 
    for (i = 0; i < cframes; i++) {
        newzone->busy_count++;
        zone_frame_free(newzone, pfn+i-newzone->base);
    }
}
 
/** Reduce allocated block to count of order 0 frames.
 *
 * The allocated block need 2^order frames of space. Reduce all frames
 * in block to order 0 and free the unneeded frames. This means, that
 * when freeing the previously allocated block starting with frame_idx,
 * you have to free every frame.
 *
 * @param zone
 * @param frame_idx     Index to block.
 * @param count         Allocated space in block.
 */
static void zone_reduce_region(zone_t *zone, pfn_t frame_idx, count_t count)
{
    count_t i;
    uint8_t order;
    frame_t *frame;
   
    ASSERT(frame_idx + count < zone->count);
 
    order = zone->frames[frame_idx].buddy_order;
    ASSERT((count_t) (1 << order) >= count);
 
    /* Reduce all blocks to order 0 */
    for (i = 0; i < (count_t) (1 << order); i++) {
        frame = &zone->frames[i + frame_idx];
        frame->buddy_order = 0;
        if (!frame->refcount)
            frame->refcount = 1;
        ASSERT(frame->refcount == 1);
    }
    /* Free unneeded frames */
    for (i = count; i < (count_t) (1 << order); i++) {
        zone_frame_free(zone, i + frame_idx);
    }
}
 
/** Merge zones z1 and z2.
 *
 * - the zones must be 2 zones with no zone existing in between,
 *   which means that z2 = z1+1
 *
 * - When you create a new zone, the frame allocator configuration does
 *   not to be 2^order size. Once the allocator is running it is no longer
 *   possible, merged configuration data occupies more space :-/
 */
void zone_merge(unsigned int z1, unsigned int z2)
{
    ipl_t ipl;
    zone_t *zone1, *zone2, *newzone;
    unsigned int cframes;
    uint8_t order;
    unsigned int i;
    pfn_t pfn;
 
    ipl = interrupts_disable();
    spinlock_lock(&zones.lock);
 
    if ((z1 >= zones.count) || (z2 >= zones.count))
        goto errout;
    /* We can join only 2 zones with none existing inbetween */
    if (z2-z1 != 1)
        goto errout;
 
    zone1 = zones.info[z1];
    zone2 = zones.info[z2];
    spinlock_lock(&zone1->lock);
    spinlock_lock(&zone2->lock);
 
    cframes = SIZE2FRAMES(zone_conf_size(zone2->base + zone2->count -
        zone1->base));
    if (cframes == 1)
        order = 0;
    else
        order = fnzb(cframes - 1) + 1;
 
    /* Allocate zonedata inside one of the zones */
    if (zone_can_alloc(zone1, order))
        pfn = zone1->base + zone_frame_alloc(zone1, order);
    else if (zone_can_alloc(zone2, order))
        pfn = zone2->base + zone_frame_alloc(zone2, order);
    else
        goto errout2;
 
    newzone = (zone_t *) PA2KA(PFN2ADDR(pfn));
 
    _zone_merge(newzone, zone1, zone2);
 
    /* Free unneeded config frames */
    zone_reduce_region(newzone, pfn - newzone->base,  cframes);
    /* Subtract zone information from busy frames */
    newzone->busy_count -= cframes;
 
    /* Replace existing zones in zoneinfo list */
    zones.info[z1] = newzone;
    for (i = z2 + 1; i < zones.count; i++)
        zones.info[i - 1] = zones.info[i];
    zones.count--;
 
    /* Free old zone information */
    return_config_frames(newzone, zone1);
    return_config_frames(newzone, zone2);
errout2:
    /* Nobody is allowed to enter to zone, so we are safe
     * to touch the spinlocks last time */
    spinlock_unlock(&zone1->lock);
    spinlock_unlock(&zone2->lock);
errout:
    spinlock_unlock(&zones.lock);
    interrupts_restore(ipl);
}
 
/** Merge all zones into one big zone.
 *
 * It is reasonable to do this on systems whose bios reports parts in chunks,
 * so that we could have 1 zone (it's faster).
 */
void zone_merge_all(void)
{
    int count = zones.count;
 
    while (zones.count > 1 && --count) {
        zone_merge(0,1);
        break;
    }
}
 
/** Create new frame zone.
 *
 * @param start     Physical address of the first frame within the zone.
 * @param count     Count of frames in zone.
 * @param z     Address of configuration information of zone.
 * @param flags     Zone flags.
 *
 * @return      Initialized zone.
 */
static void zone_construct(pfn_t start, count_t count, zone_t *z, int flags)
{
    unsigned int i;
    uint8_t max_order;
 
    spinlock_initialize(&z->lock, "zone_lock");
    z->base = start;
    z->count = count;
    z->flags = flags;
    z->free_count = count;
    z->busy_count = 0;
 
    /*
     * Compute order for buddy system, initialize
     */
    max_order = fnzb(count);
    z->buddy_system = (buddy_system_t *)&z[1];
   
    buddy_system_create(z->buddy_system, max_order,
        &zone_buddy_system_operations, (void *) z);
   
    /* Allocate frames _after_ the conframe */
    /* Check sizes */
    z->frames = (frame_t *)((uint8_t *) z->buddy_system +
        buddy_conf_size(max_order));
    for (i = 0; i < count; i++) {
        frame_initialize(&z->frames[i]);
    }
   
    /* Stuffing frames */
    for (i = 0; i < count; i++) {
        z->frames[i].refcount = 0;
        buddy_system_free(z->buddy_system, &z->frames[i].buddy_link);
    }
}
 
/** Compute configuration data size for zone.
 *
 * @param count     Size of zone in frames.
 * @return      Size of zone configuration info (in bytes).
 */
uintptr_t zone_conf_size(count_t count)
{
    int size = sizeof(zone_t) + count * sizeof(frame_t);
    int max_order;
 
    max_order = fnzb(count);
    size += buddy_conf_size(max_order);
    return size;
}
 
/** Create and add zone to system.
 *
 * @param start     First frame number (absolute).
 * @param count     Size of zone in frames.
 * @param confframe Where configuration frames are supposed to be.
 *          Automatically checks, that we will not disturb the
 *          kernel and possibly init.  If confframe is given
 *          _outside_ this zone, it is expected, that the area is
 *          already marked BUSY and big enough to contain
 *          zone_conf_size() amount of data.  If the confframe is
 *          inside the area, the zone free frame information is
 *          modified not to include it.
 *
 * @return      Zone number or -1 on error.
 */
int zone_create(pfn_t start, count_t count, pfn_t confframe, int flags)
{
    zone_t *z;
    uintptr_t addr;
    count_t confcount;
    unsigned int i;
    int znum;
 
    /* Theoretically we could have here 0, practically make sure
     * nobody tries to do that. If some platform requires, remove
     * the assert
     */
    ASSERT(confframe);
    /* If conframe is supposed to be inside our zone, then make sure
     * it does not span kernel & init
     */
    confcount = SIZE2FRAMES(zone_conf_size(count));
    if (confframe >= start && confframe < start+count) {
        for (;confframe < start + count; confframe++) {
            addr = PFN2ADDR(confframe);
            if (overlaps(addr, PFN2ADDR(confcount),
                KA2PA(config.base), config.kernel_size))
                continue;
           
            if (overlaps(addr, PFN2ADDR(confcount),
                KA2PA(config.stack_base), config.stack_size))
                continue;
           
            bool overlap = false;
            count_t i;
            for (i = 0; i < init.cnt; i++)
                if (overlaps(addr, PFN2ADDR(confcount),
                    KA2PA(init.tasks[i].addr),
                    init.tasks[i].size)) {
                    overlap = true;
                    break;
                }
            if (overlap)
                continue;
           
            break;
        }
        if (confframe >= start + count)
            panic("Cannot find configuration data for zone.");
    }
 
    z = (zone_t *) PA2KA(PFN2ADDR(confframe));
    zone_construct(start, count, z, flags);
    znum = zones_add_zone(z);
    if (znum == -1)
        return -1;
 
    /* If confdata in zone, mark as unavailable */
    if (confframe >= start && confframe < start + count)
        for (i = confframe; i < confframe + confcount; i++) {
            zone_mark_unavailable(z, i - z->base);
        }
    return znum;
}
 
/***************************************/
/* Frame functions */
 
/** Set parent of frame. */
void frame_set_parent(pfn_t pfn, void *data, unsigned int hint)
{
    zone_t *zone = find_zone_and_lock(pfn, &hint);
 
    ASSERT(zone);
 
    zone_get_frame(zone, pfn-zone->base)->parent = data;
    spinlock_unlock(&zone->lock);
}
 
void *frame_get_parent(pfn_t pfn, unsigned int hint)
{
    zone_t *zone = find_zone_and_lock(pfn, &hint);
    void *res;
 
    ASSERT(zone);
    res = zone_get_frame(zone, pfn - zone->base)->parent;
   
    spinlock_unlock(&zone->lock);
    return res;
}
 
/** Allocate power-of-two frames of physical memory.
 *
 * @param order     Allocate exactly 2^order frames.
 * @param flags     Flags for host zone selection and address processing.
 * @param pzone     Preferred zone.
 *
 * @return      Physical address of the allocated frame.
 *
 */
void *frame_alloc_generic(uint8_t order, int flags, unsigned int *pzone)
{
    ipl_t ipl;
    int freed;
    pfn_t v;
    zone_t *zone;
   
loop:
    ipl = interrupts_disable();
   
    /*
     * First, find suitable frame zone.
     */
    zone = find_free_zone_and_lock(order, pzone);
   
    /* If no memory, reclaim some slab memory,
       if it does not help, reclaim all */
    if (!zone && !(flags & FRAME_NO_RECLAIM)) {
        freed = slab_reclaim(0);
        if (freed)
            zone = find_free_zone_and_lock(order, pzone);
        if (!zone) {
            freed = slab_reclaim(SLAB_RECLAIM_ALL);
            if (freed)
                zone = find_free_zone_and_lock(order, pzone);
        }
    }
    if (!zone) {
        /*
         * Sleep until some frames are available again.
         */
        if (flags & FRAME_ATOMIC) {
            interrupts_restore(ipl);
 
 
            return 0;
        }
       
#ifdef CONFIG_DEBUG
        printf("Thread %" PRIu64 " falling asleep, low memory.\n", THREAD->tid);
#endif
 
        mutex_lock(&zones_mtx);
        if (!new_freed_mem)
            condvar_wait(&zones_cv, &zones_mtx);
        new_freed_mem = false;
        mutex_unlock(&zones_mtx);
 
#ifdef CONFIG_DEBUG
        printf("Thread %" PRIu64 " woken up, memory available.\n", THREAD->tid);
#endif
 
        interrupts_restore(ipl);
        goto loop;
    }
   
    v = zone_frame_alloc(zone, order);
    v += zone->base;
 
    spinlock_unlock(&zone->lock);
    interrupts_restore(ipl);
 
    if (flags & FRAME_KA)
        return (void *)PA2KA(PFN2ADDR(v));
    return (void *)PFN2ADDR(v);
}
 
/** Free a frame.
 *
 * Find respective frame structure for supplied physical frame address.
 * Decrement frame reference count.
 * If it drops to zero, move the frame structure to free list.
 *
 * @param frame     Physical Address of of the frame to be freed.
 */
void frame_free(uintptr_t frame)
{
    ipl_t ipl;
    zone_t *zone;
    pfn_t pfn = ADDR2PFN(frame);
 
    ipl = interrupts_disable();
 
    /*
     * First, find host frame zone for addr.
     */
    zone = find_zone_and_lock(pfn, NULL);
    ASSERT(zone);
   
    zone_frame_free(zone, pfn - zone->base);
   
    spinlock_unlock(&zone->lock);
   
    /*
     * Signal that some memory has been freed.
     */
    mutex_lock(&zones_mtx);
    new_freed_mem = true;
    condvar_broadcast(&zones_cv);
    mutex_unlock(&zones_mtx);
 
    interrupts_restore(ipl);
}
 
/** Add reference to frame.
 *
 * Find respective frame structure for supplied PFN and
 * increment frame reference count.
 *
 * @param pfn       Frame number of the frame to be freed.
 */
void frame_reference_add(pfn_t pfn)
{
    ipl_t ipl;
    zone_t *zone;
    frame_t *frame;
 
    ipl = interrupts_disable();
   
    /*
     * First, find host frame zone for addr.
     */
    zone = find_zone_and_lock(pfn, NULL);
    ASSERT(zone);
   
    frame = &zone->frames[pfn - zone->base];
    frame->refcount++;
   
    spinlock_unlock(&zone->lock);
    interrupts_restore(ipl);
}
 
/** Mark given range unavailable in frame zones. */
void frame_mark_unavailable(pfn_t start, count_t count)
{
    unsigned int i;
    zone_t *zone;
    unsigned int prefzone = 0;
   
    for (i = 0; i < count; i++) {
        zone = find_zone_and_lock(start + i, &prefzone);
        if (!zone) /* PFN not found */
            continue;
        zone_mark_unavailable(zone, start + i - zone->base);
 
        spinlock_unlock(&zone->lock);
    }
}
 
/** Initialize physical memory management. */
void frame_init(void)
{
    if (config.cpu_active == 1) {
        zones.count = 0;
        spinlock_initialize(&zones.lock, "zones.lock");
    }
    /* Tell the architecture to create some memory */
    frame_arch_init();
    if (config.cpu_active == 1) {
        frame_mark_unavailable(ADDR2PFN(KA2PA(config.base)),
            SIZE2FRAMES(config.kernel_size));
        frame_mark_unavailable(ADDR2PFN(KA2PA(config.stack_base)),
            SIZE2FRAMES(config.stack_size));
       
        count_t i;
        for (i = 0; i < init.cnt; i++) {
            pfn_t pfn = ADDR2PFN(KA2PA(init.tasks[i].addr));
            frame_mark_unavailable(pfn,
                SIZE2FRAMES(init.tasks[i].size));
        }
 
        if (ballocs.size)
            frame_mark_unavailable(ADDR2PFN(KA2PA(ballocs.base)),
                SIZE2FRAMES(ballocs.size));
 
        /* Black list first frame, as allocating NULL would
         * fail in some places */
        frame_mark_unavailable(0, 1);
    }
 
    mutex_initialize(&zones_mtx, MUTEX_ACTIVE); /* mimic spinlock */
    condvar_initialize(&zones_cv);
}
 
 
/** Return total size of all zones. */
uint64_t zone_total_size(void)
{
    zone_t *zone = NULL;
    unsigned int i;
    ipl_t ipl;
    uint64_t total = 0;
 
    ipl = interrupts_disable();
    spinlock_lock(&zones.lock);
   
    for (i = 0; i < zones.count; i++) {
        zone = zones.info[i];
        spinlock_lock(&zone->lock);
        total += (uint64_t) FRAMES2SIZE(zone->count);
        spinlock_unlock(&zone->lock);
    }
   
    spinlock_unlock(&zones.lock);
    interrupts_restore(ipl);
   
    return total;
}
 
/** Prints list of zones. */
void zone_print_list(void)
{
    zone_t *zone = NULL;
    unsigned int i;
    ipl_t ipl;
 
    ipl = interrupts_disable();
    spinlock_lock(&zones.lock);
 
#ifdef __32_BITS__  
    printf("#  base address free frames  busy frames\n");
    printf("-- ------------ ------------ ------------\n");
#endif
 
#ifdef __64_BITS__
    printf("#  base address         free frames  busy frames\n");
    printf("-- -------------------- ------------ ------------\n");
#endif
   
    for (i = 0; i < zones.count; i++) {
        zone = zones.info[i];
        spinlock_lock(&zone->lock);
 
#ifdef __32_BITS__
        printf("%-2u   %10p %12" PRIc " %12" PRIc "\n",
            i, PFN2ADDR(zone->base), zone->free_count,
            zone->busy_count);
#endif
 
#ifdef __64_BITS__
        printf("%-2u   %18p %12" PRIc " %12" PRIc "\n", i,
            PFN2ADDR(zone->base), zone->free_count, zone->busy_count);
#endif
       
        spinlock_unlock(&zone->lock);
    }
   
    spinlock_unlock(&zones.lock);
    interrupts_restore(ipl);
}
 
/** Prints zone details.
 *
 * @param num       Zone base address or zone number.
 */
void zone_print_one(unsigned int num)
{
    zone_t *zone = NULL;
    ipl_t ipl;
    unsigned int i;
 
    ipl = interrupts_disable();
    spinlock_lock(&zones.lock);
 
    for (i = 0; i < zones.count; i++) {
        if ((i == num) || (PFN2ADDR(zones.info[i]->base) == num)) {
            zone = zones.info[i];
            break;
        }
    }
    if (!zone) {
        printf("Zone not found.\n");
        goto out;
    }
   
    spinlock_lock(&zone->lock);
    printf("Memory zone information\n");
    printf("Zone base address: %p\n", PFN2ADDR(zone->base));
    printf("Zone size: %" PRIc " frames (%" PRIs " KB)\n", zone->count,
        SIZE2KB(FRAMES2SIZE(zone->count)));
    printf("Allocated space: %" PRIc " frames (%" PRIs " KB)\n",
        zone->busy_count, SIZE2KB(FRAMES2SIZE(zone->busy_count)));
    printf("Available space: %" PRIc " frames (%" PRIs " KB)\n",
        zone->free_count, SIZE2KB(FRAMES2SIZE(zone->free_count)));
    buddy_system_structure_print(zone->buddy_system, FRAME_SIZE);
    spinlock_unlock(&zone->lock);
   
out:
    spinlock_unlock(&zones.lock);
    interrupts_restore(ipl);
}
 
/** @}
 */
 
 

Rev 3185	Rev 3187
1	/*	1	/*
2	* Copyright (c) 2001-2005 Jakub Jermar	2	* Copyright (c) 2001-2005 Jakub Jermar
3	* Copyright (c) 2005 Sergey Bondari	3	* Copyright (c) 2005 Sergey Bondari
4	* All rights reserved.	4	* All rights reserved.
5	*	5	*
6	* Redistribution and use in source and binary forms, with or without	6	* Redistribution and use in source and binary forms, with or without
7	* modification, are permitted provided that the following conditions	7	* modification, are permitted provided that the following conditions
8	* are met:	8	* are met:
9	*	9	*
10	* - Redistributions of source code must retain the above copyright	10	* - Redistributions of source code must retain the above copyright
11	* notice, this list of conditions and the following disclaimer.	11	* notice, this list of conditions and the following disclaimer.
12	* - Redistributions in binary form must reproduce the above copyright	12	* - Redistributions in binary form must reproduce the above copyright
13	* notice, this list of conditions and the following disclaimer in the	13	* notice, this list of conditions and the following disclaimer in the
14	* documentation and/or other materials provided with the distribution.	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	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.	16	* derived from this software without specific prior written permission.
17	*	17	*
18	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	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	19	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
20	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	20	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
21	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	21	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
22	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	22	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
23	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	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	24	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	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	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.	27	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28	*/	28	*/
29		29
30	/** @addtogroup genericmm	30	/** @addtogroup genericmm
31	* @{	31	* @{
32	*/	32	*/
33		33
34	/**	34	/**
35	* @file	35	* @file
36	* @brief Physical frame allocator.	36	* @brief Physical frame allocator.
37	*	37	*
38	* This file contains the physical frame allocator and memory zone management.	38	* This file contains the physical frame allocator and memory zone management.
39	* The frame allocator is built on top of the buddy allocator.	39	* The frame allocator is built on top of the buddy allocator.
40	*	40	*
41	* @see buddy.c	41	* @see buddy.c
42	*/	42	*/
43		43
44	/*	44	/*
45	* Locking order	45	* Locking order
46	*	46	*
47	* In order to access particular zone, the process must first lock	47	* In order to access particular zone, the process must first lock
48	* the zones.lock, then lock the zone and then unlock the zones.lock.	48	* the zones.lock, then lock the zone and then unlock the zones.lock.
49	* This insures, that we can fiddle with the zones in runtime without	49	* This insures, that we can fiddle with the zones in runtime without
50	* affecting the processes.	50	* affecting the processes.
51	*	51	*
52	*/	52	*/
53		53
54	#include <arch/types.h>	54	#include <arch/types.h>
55	#include <mm/frame.h>	55	#include <mm/frame.h>
56	#include <mm/as.h>	56	#include <mm/as.h>
57	#include <panic.h>	57	#include <panic.h>
58	#include <debug.h>	58	#include <debug.h>
59	#include <adt/list.h>	59	#include <adt/list.h>
60	#include <synch/spinlock.h>	60	#include <synch/spinlock.h>
-		61	#include <synch/mutex.h>
-		62	#include <synch/condvar.h>
61	#include <arch/asm.h>	63	#include <arch/asm.h>
62	#include <arch.h>	64	#include <arch.h>
63	#include <print.h>	65	#include <print.h>
64	#include <align.h>	66	#include <align.h>
65	#include <mm/slab.h>	67	#include <mm/slab.h>
66	#include <bitops.h>	68	#include <bitops.h>
67	#include <macros.h>	69	#include <macros.h>
68	#include <config.h>	70	#include <config.h>
69		71
70	typedef struct {	72	typedef struct {
71	count_t refcount; /*< tracking of shared frames /	73	count_t refcount; /*< tracking of shared frames /
72	uint8_t buddy_order; /*< buddy system block order /	74	uint8_t buddy_order; /*< buddy system block order /
73	link_t buddy_link; /**< link to the next free block inside one	75	link_t buddy_link; /**< link to the next free block inside one
74	order */	76	order */
75	void parent; /< If allocated by slab, this points there /	77	void parent; /< If allocated by slab, this points there /
76	} frame_t;	78	} frame_t;
77		79
78	typedef struct {	80	typedef struct {
79	SPINLOCK_DECLARE(lock); /*< this lock protects everything below /	81	SPINLOCK_DECLARE(lock); /*< this lock protects everything below /
80	pfn_t base; /**< frame_no of the first frame in the frames	82	pfn_t base; /**< frame_no of the first frame in the frames
81	array */	83	array */
82	count_t count; /*< Size of zone /	84	count_t count; /*< Size of zone /
83		85
84	frame_t frames; /*< array of frame_t structures in this	86	frame_t frames; /*< array of frame_t structures in this
85	zone */	87	zone */
86	count_t free_count; /*< number of free frame_t structures /	88	count_t free_count; /*< number of free frame_t structures /
87	count_t busy_count; /*< number of busy frame_t structures /	89	count_t busy_count; /*< number of busy frame_t structures /
88		90
89	buddy_system_t buddy_system; /< buddy system for the zone /	91	buddy_system_t buddy_system; /< buddy system for the zone /
90	int flags;	92	int flags;
91	} zone_t;	93	} zone_t;
92		94
93	/*	95	/*
94	* The zoneinfo.lock must be locked when accessing zoneinfo structure.	96	* The zoneinfo.lock must be locked when accessing zoneinfo structure.
95	* Some of the attributes in zone_t structures are 'read-only'	97	* Some of the attributes in zone_t structures are 'read-only'
96	*/	98	*/
97		99
98	typedef struct {	100	typedef struct {
99	SPINLOCK_DECLARE(lock);	101	SPINLOCK_DECLARE(lock);
100	unsigned int count;	102	unsigned int count;
101	zone_t *info[ZONES_MAX];	103	zone_t *info[ZONES_MAX];
102	} zones_t;	104	} zones_t;
103		105
104	static zones_t zones;	106	static zones_t zones;
105		107
-		108	/*
-		109	* Synchronization primitives used to sleep when there is no memory
-		110	* available.
-		111	*/
-		112	mutex_t zones_mtx;
-		113	condvar_t zones_cv;
-		114	int new_freed_mem = false;
106		115
107	/********************/	116	/********************/
108	/* Helper functions */	117	/* Helper functions */
109	/********************/	118	/********************/
110		119
111	static inline index_t frame_index(zone_t zone, frame_t frame)	120	static inline index_t frame_index(zone_t zone, frame_t frame)
112	{	121	{
113	return (index_t) (frame - zone->frames);	122	return (index_t) (frame - zone->frames);
114	}	123	}
115		124
116	static inline index_t frame_index_abs(zone_t zone, frame_t frame)	125	static inline index_t frame_index_abs(zone_t zone, frame_t frame)
117	{	126	{
118	return (index_t) (frame - zone->frames) + zone->base;	127	return (index_t) (frame - zone->frames) + zone->base;
119	}	128	}
120		129
121	static inline int frame_index_valid(zone_t *zone, index_t index)	130	static inline int frame_index_valid(zone_t *zone, index_t index)
122	{	131	{
123	return (index < zone->count);	132	return (index < zone->count);
124	}	133	}
125		134
126	/** Compute pfn_t from frame_t pointer & zone pointer */	135	/** Compute pfn_t from frame_t pointer & zone pointer */
127	static index_t make_frame_index(zone_t zone, frame_t frame)	136	static index_t make_frame_index(zone_t zone, frame_t frame)
128	{	137	{
129	return (frame - zone->frames);	138	return (frame - zone->frames);
130	}	139	}
131		140
132	/** Initialize frame structure.	141	/** Initialize frame structure.
133	*	142	*
134	* @param framei Frame structure to be initialized.	143	* @param framei Frame structure to be initialized.
135	*/	144	*/
136	static void frame_initialize(frame_t *frame)	145	static void frame_initialize(frame_t *frame)
137	{	146	{
138	frame->refcount = 1;	147	frame->refcount = 1;
139	frame->buddy_order = 0;	148	frame->buddy_order = 0;
140	}	149	}
141		150
142	/**********************/	151	/**********************/
143	/* Zoneinfo functions */	152	/* Zoneinfo functions */
144	/**********************/	153	/**********************/
145		154
146	/** Insert-sort zone into zones list.	155	/** Insert-sort zone into zones list.
147	*	156	*
148	* @param newzone New zone to be inserted into zone list.	157	* @param newzone New zone to be inserted into zone list.
149	* @return Zone number on success, -1 on error.	158	* @return Zone number on success, -1 on error.
150	*/	159	*/
151	static int zones_add_zone(zone_t *newzone)	160	static int zones_add_zone(zone_t *newzone)
152	{	161	{
153	unsigned int i, j;	162	unsigned int i, j;
154	ipl_t ipl;	163	ipl_t ipl;
155	zone_t *z;	164	zone_t *z;
156		165
157	ipl = interrupts_disable();	166	ipl = interrupts_disable();
158	spinlock_lock(&zones.lock);	167	spinlock_lock(&zones.lock);
159		168
160	/* Try to merge */	169	/* Try to merge */
161	if (zones.count + 1 == ZONES_MAX) {	170	if (zones.count + 1 == ZONES_MAX) {
162	printf("Maximum zone count %u exceeded!\n", ZONES_MAX);	171	printf("Maximum zone count %u exceeded!\n", ZONES_MAX);
163	spinlock_unlock(&zones.lock);	172	spinlock_unlock(&zones.lock);
164	interrupts_restore(ipl);	173	interrupts_restore(ipl);
165	return -1;	174	return -1;
166	}	175	}
167		176
168	for (i = 0; i < zones.count; i++) {	177	for (i = 0; i < zones.count; i++) {
169	/* Check for overflow */	178	/* Check for overflow */
170	z = zones.info[i];	179	z = zones.info[i];
171	if (overlaps(newzone->base, newzone->count, z->base,	180	if (overlaps(newzone->base, newzone->count, z->base,
172	z->count)) {	181	z->count)) {
173	printf("Zones overlap!\n");	182	printf("Zones overlap!\n");
174	return -1;	183	return -1;
175	}	184	}
176	if (newzone->base < z->base)	185	if (newzone->base < z->base)
177	break;	186	break;
178	}	187	}
179		188
180	/* Move other zones up */	189	/* Move other zones up */
181	for (j = i; j < zones.count; j++)	190	for (j = i; j < zones.count; j++)
182	zones.info[j + 1] = zones.info[j];	191	zones.info[j + 1] = zones.info[j];
183		192
184	zones.info[i] = newzone;	193	zones.info[i] = newzone;
185	zones.count++;	194	zones.count++;
186		195
187	spinlock_unlock(&zones.lock);	196	spinlock_unlock(&zones.lock);
188	interrupts_restore(ipl);	197	interrupts_restore(ipl);
189		198
190	return i;	199	return i;
191	}	200	}
192		201
193	/**	202	/**
194	* Try to find a zone where can we find the frame.	203	* Try to find a zone where can we find the frame.
195	*	204	*
196	* Assume interrupts are disabled.	205	* Assume interrupts are disabled.
197	*	206	*
198	* @param frame Frame number contained in zone.	207	* @param frame Frame number contained in zone.
199	* @param pzone If not null, it is used as zone hint. Zone index is	208	* @param pzone If not null, it is used as zone hint. Zone index is
200	* filled into the variable on success.	209	* filled into the variable on success.
201	* @return Pointer to locked zone containing frame.	210	* @return Pointer to locked zone containing frame.
202	*/	211	*/
203	static zone_t find_zone_and_lock(pfn_t frame, unsigned int pzone)	212	static zone_t find_zone_and_lock(pfn_t frame, unsigned int pzone)
204	{	213	{
205	unsigned int i;	214	unsigned int i;
206	unsigned int hint = pzone ? *pzone : 0;	215	unsigned int hint = pzone ? *pzone : 0;
207	zone_t *z;	216	zone_t *z;
208		217
209	spinlock_lock(&zones.lock);	218	spinlock_lock(&zones.lock);
210		219
211	if (hint >= zones.count)	220	if (hint >= zones.count)
212	hint = 0;	221	hint = 0;
213		222
214	i = hint;	223	i = hint;
215	do {	224	do {
216	z = zones.info[i];	225	z = zones.info[i];
217	spinlock_lock(&z->lock);	226	spinlock_lock(&z->lock);
218	if (z->base <= frame && z->base + z->count > frame) {	227	if (z->base <= frame && z->base + z->count > frame) {
219	/* Unlock the global lock */	228	/* Unlock the global lock */
220	spinlock_unlock(&zones.lock);	229	spinlock_unlock(&zones.lock);
221	if (pzone)	230	if (pzone)
222	*pzone = i;	231	*pzone = i;
223	return z;	232	return z;
224	}	233	}
225	spinlock_unlock(&z->lock);	234	spinlock_unlock(&z->lock);
226		235
227	i++;	236	i++;
228	if (i >= zones.count)	237	if (i >= zones.count)
229	i = 0;	238	i = 0;
230	} while(i != hint);	239	} while(i != hint);
231		240
232	spinlock_unlock(&zones.lock);	241	spinlock_unlock(&zones.lock);
233	return NULL;	242	return NULL;
234	}	243	}
235		244
236	/** @return True if zone can allocate specified order */	245	/** @return True if zone can allocate specified order */
237	static int zone_can_alloc(zone_t *z, uint8_t order)	246	static int zone_can_alloc(zone_t *z, uint8_t order)
238	{	247	{
239	return buddy_system_can_alloc(z->buddy_system, order);	248	return buddy_system_can_alloc(z->buddy_system, order);
240	}	249	}
241		250
242	/** Find and lock zone that can allocate order frames.	251	/** Find and lock zone that can allocate order frames.
243	*	252	*
244	* Assume interrupts are disabled.	253	* Assume interrupts are disabled.
245	*	254	*
246	* @param order Size (2^order) of free space we are trying to find.	255	* @param order Size (2^order) of free space we are trying to find.
247	* @param pzone Pointer to preferred zone or NULL, on return contains	256	* @param pzone Pointer to preferred zone or NULL, on return contains
248	* zone number.	257	* zone number.
249	*/	258	*/
250	static zone_t find_free_zone_and_lock(uint8_t order, unsigned int pzone)	259	static zone_t find_free_zone_and_lock(uint8_t order, unsigned int pzone)
251	{	260	{
252	unsigned int i;	261	unsigned int i;
253	zone_t *z;	262	zone_t *z;
254	unsigned int hint = pzone ? *pzone : 0;	263	unsigned int hint = pzone ? *pzone : 0;
255		264
256	spinlock_lock(&zones.lock);	265	spinlock_lock(&zones.lock);
257	if (hint >= zones.count)	266	if (hint >= zones.count)
258	hint = 0;	267	hint = 0;
259	i = hint;	268	i = hint;
260	do {	269	do {
261	z = zones.info[i];	270	z = zones.info[i];
262		271
263	spinlock_lock(&z->lock);	272	spinlock_lock(&z->lock);
264		273
265	/* Check if the zone has 2^order frames area available */	274	/* Check if the zone has 2^order frames area available */
266	if (zone_can_alloc(z, order)) {	275	if (zone_can_alloc(z, order)) {
267	spinlock_unlock(&zones.lock);	276	spinlock_unlock(&zones.lock);
268	if (pzone)	277	if (pzone)
269	*pzone = i;	278	*pzone = i;
270	return z;	279	return z;
271	}	280	}
272	spinlock_unlock(&z->lock);	281	spinlock_unlock(&z->lock);
273	if (++i >= zones.count)	282	if (++i >= zones.count)
274	i = 0;	283	i = 0;
275	} while(i != hint);	284	} while(i != hint);
276	spinlock_unlock(&zones.lock);	285	spinlock_unlock(&zones.lock);
277	return NULL;	286	return NULL;
278	}	287	}
279		288
280	/**************************/	289	/**************************/
281	/* Buddy system functions */	290	/* Buddy system functions */
282	/**************************/	291	/**************************/
283		292
284	/** Buddy system find_block implementation.	293	/** Buddy system find_block implementation.
285	*	294	*
286	* Find block that is parent of current list.	295	* Find block that is parent of current list.
287	* That means go to lower addresses, until such block is found	296	* That means go to lower addresses, until such block is found
288	*	297	*
289	* @param order Order of parent must be different then this	298	* @param order Order of parent must be different then this
290	* parameter!!	299	* parameter!!
291	*/	300	*/
292	static link_t zone_buddy_find_block(buddy_system_t b, link_t *child,	301	static link_t zone_buddy_find_block(buddy_system_t b, link_t *child,
293	uint8_t order)	302	uint8_t order)
294	{	303	{
295	frame_t *frame;	304	frame_t *frame;
296	zone_t *zone;	305	zone_t *zone;
297	index_t index;	306	index_t index;
298		307
299	frame = list_get_instance(child, frame_t, buddy_link);	308	frame = list_get_instance(child, frame_t, buddy_link);
300	zone = (zone_t *) b->data;	309	zone = (zone_t *) b->data;
301		310
302	index = frame_index(zone, frame);	311	index = frame_index(zone, frame);
303	do {	312	do {
304	if (zone->frames[index].buddy_order != order) {	313	if (zone->frames[index].buddy_order != order) {
305	return &zone->frames[index].buddy_link;	314	return &zone->frames[index].buddy_link;
306	}	315	}
307	} while(index-- > 0);	316	} while(index-- > 0);
308	return NULL;	317	return NULL;
309	}	318	}
310		319
311	static void zone_buddy_print_id(buddy_system_t b, link_t block)	320	static void zone_buddy_print_id(buddy_system_t b, link_t block)
312	{	321	{
313	frame_t *frame;	322	frame_t *frame;
314	zone_t *zone;	323	zone_t *zone;
315	index_t index;	324	index_t index;
316		325
317	frame = list_get_instance(block, frame_t, buddy_link);	326	frame = list_get_instance(block, frame_t, buddy_link);
318	zone = (zone_t *) b->data;	327	zone = (zone_t *) b->data;
319	index = frame_index(zone, frame);	328	index = frame_index(zone, frame);
320	printf("%" PRIi, index);	329	printf("%" PRIi, index);
321	}	330	}
322		331
323	/** Buddy system find_buddy implementation.	332	/** Buddy system find_buddy implementation.
324	*	333	*
325	* @param b Buddy system.	334	* @param b Buddy system.
326	* @param block Block for which buddy should be found.	335	* @param block Block for which buddy should be found.
327	*	336	*
328	* @return Buddy for given block if found.	337	* @return Buddy for given block if found.
329	*/	338	*/
330	static link_t zone_buddy_find_buddy(buddy_system_t b, link_t *block)	339	static link_t zone_buddy_find_buddy(buddy_system_t b, link_t *block)
331	{	340	{
332	frame_t *frame;	341	frame_t *frame;
333	zone_t *zone;	342	zone_t *zone;
334	index_t index;	343	index_t index;
335	bool is_left, is_right;	344	bool is_left, is_right;
336		345
337	frame = list_get_instance(block, frame_t, buddy_link);	346	frame = list_get_instance(block, frame_t, buddy_link);
338	zone = (zone_t *) b->data;	347	zone = (zone_t *) b->data;
339	ASSERT(IS_BUDDY_ORDER_OK(frame_index_abs(zone, frame),	348	ASSERT(IS_BUDDY_ORDER_OK(frame_index_abs(zone, frame),
340	frame->buddy_order));	349	frame->buddy_order));
341		350
342	is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame);	351	is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame);
343	is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame);	352	is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame);
344		353
345	ASSERT(is_left ^ is_right);	354	ASSERT(is_left ^ is_right);
346	if (is_left) {	355	if (is_left) {
347	index = (frame_index(zone, frame)) +	356	index = (frame_index(zone, frame)) +
348	(1 << frame->buddy_order);	357	(1 << frame->buddy_order);
349	} else { /* if (is_right) */	358	} else { /* if (is_right) */
350	index = (frame_index(zone, frame)) -	359	index = (frame_index(zone, frame)) -
351	(1 << frame->buddy_order);	360	(1 << frame->buddy_order);
352	}	361	}
353		362
354	if (frame_index_valid(zone, index)) {	363	if (frame_index_valid(zone, index)) {
355	if (zone->frames[index].buddy_order == frame->buddy_order &&	364	if (zone->frames[index].buddy_order == frame->buddy_order &&
356	zone->frames[index].refcount == 0) {	365	zone->frames[index].refcount == 0) {
357	return &zone->frames[index].buddy_link;	366	return &zone->frames[index].buddy_link;
358	}	367	}
359	}	368	}
360		369
361	return NULL;	370	return NULL;
362	}	371	}
363		372
364	/** Buddy system bisect implementation.	373	/** Buddy system bisect implementation.
365	*	374	*
366	* @param b Buddy system.	375	* @param b Buddy system.
367	* @param block Block to bisect.	376	* @param block Block to bisect.
368	*	377	*
369	* @return Right block.	378	* @return Right block.
370	*/	379	*/
371	static link_t zone_buddy_bisect(buddy_system_t b, link_t *block)	380	static link_t zone_buddy_bisect(buddy_system_t b, link_t *block)
372	{	381	{
373	frame_t frame_l, frame_r;	382	frame_t frame_l, frame_r;
374		383
375	frame_l = list_get_instance(block, frame_t, buddy_link);	384	frame_l = list_get_instance(block, frame_t, buddy_link);
376	frame_r = (frame_l + (1 << (frame_l->buddy_order - 1)));	385	frame_r = (frame_l + (1 << (frame_l->buddy_order - 1)));
377		386
378	return &frame_r->buddy_link;	387	return &frame_r->buddy_link;
379	}	388	}
380		389
381	/** Buddy system coalesce implementation.	390	/** Buddy system coalesce implementation.
382	*	391	*
383	* @param b Buddy system.	392	* @param b Buddy system.
384	* @param block_1 First block.	393	* @param block_1 First block.
385	* @param block_2 First block's buddy.	394	* @param block_2 First block's buddy.
386	*	395	*
387	* @return Coalesced block (actually block that represents lower	396	* @return Coalesced block (actually block that represents lower
388	* address).	397	* address).
389	*/	398	*/
390	static link_t zone_buddy_coalesce(buddy_system_t b, link_t *block_1,	399	static link_t zone_buddy_coalesce(buddy_system_t b, link_t *block_1,
391	link_t *block_2)	400	link_t *block_2)
392	{	401	{
393	frame_t frame1, frame2;	402	frame_t frame1, frame2;
394		403
395	frame1 = list_get_instance(block_1, frame_t, buddy_link);	404	frame1 = list_get_instance(block_1, frame_t, buddy_link);
396	frame2 = list_get_instance(block_2, frame_t, buddy_link);	405	frame2 = list_get_instance(block_2, frame_t, buddy_link);
397		406
398	return frame1 < frame2 ? block_1 : block_2;	407	return frame1 < frame2 ? block_1 : block_2;
399	}	408	}
400		409
401	/** Buddy system set_order implementation.	410	/** Buddy system set_order implementation.
402	*	411	*
403	* @param b Buddy system.	412	* @param b Buddy system.
404	* @param block Buddy system block.	413	* @param block Buddy system block.
405	* @param order Order to set.	414	* @param order Order to set.
406	*/	415	*/
407	static void zone_buddy_set_order(buddy_system_t b, link_t block,	416	static void zone_buddy_set_order(buddy_system_t b, link_t block,
408	uint8_t order)	417	uint8_t order)
409	{	418	{
410	frame_t *frame;	419	frame_t *frame;
411	frame = list_get_instance(block, frame_t, buddy_link);	420	frame = list_get_instance(block, frame_t, buddy_link);
412	frame->buddy_order = order;	421	frame->buddy_order = order;
413	}	422	}
414		423
415	/** Buddy system get_order implementation.	424	/** Buddy system get_order implementation.
416	*	425	*
417	* @param b Buddy system.	426	* @param b Buddy system.
418	* @param block Buddy system block.	427	* @param block Buddy system block.
419	*	428	*
420	* @return Order of block.	429	* @return Order of block.
421	*/	430	*/
422	static uint8_t zone_buddy_get_order(buddy_system_t b, link_t block)	431	static uint8_t zone_buddy_get_order(buddy_system_t b, link_t block)
423	{	432	{
424	frame_t *frame;	433	frame_t *frame;
425	frame = list_get_instance(block, frame_t, buddy_link);	434	frame = list_get_instance(block, frame_t, buddy_link);
426	return frame->buddy_order;	435	return frame->buddy_order;
427	}	436	}
428		437
429	/** Buddy system mark_busy implementation.	438	/** Buddy system mark_busy implementation.
430	*	439	*
431	* @param b Buddy system.	440	* @param b Buddy system.
432	* @param block Buddy system block.	441	* @param block Buddy system block.
433	*/	442	*/
434	static void zone_buddy_mark_busy(buddy_system_t b, link_t block)	443	static void zone_buddy_mark_busy(buddy_system_t b, link_t block)
435	{	444	{
436	frame_t * frame;	445	frame_t * frame;
437		446
438	frame = list_get_instance(block, frame_t, buddy_link);	447	frame = list_get_instance(block, frame_t, buddy_link);
439	frame->refcount = 1;	448	frame->refcount = 1;
440	}	449	}
441		450
442	/** Buddy system mark_available implementation.	451	/** Buddy system mark_available implementation.
443	*	452	*
444	* @param b Buddy system.	453	* @param b Buddy system.
445	* @param block Buddy system block.	454	* @param block Buddy system block.
446	*/	455	*/
447	static void zone_buddy_mark_available(buddy_system_t b, link_t block)	456	static void zone_buddy_mark_available(buddy_system_t b, link_t block)
448	{	457	{
449	frame_t *frame;	458	frame_t *frame;
450	frame = list_get_instance(block, frame_t, buddy_link);	459	frame = list_get_instance(block, frame_t, buddy_link);
451	frame->refcount = 0;	460	frame->refcount = 0;
452	}	461	}
453		462
454	static buddy_system_operations_t zone_buddy_system_operations = {	463	static buddy_system_operations_t zone_buddy_system_operations = {
455	.find_buddy = zone_buddy_find_buddy,	464	.find_buddy = zone_buddy_find_buddy,
456	.bisect = zone_buddy_bisect,	465	.bisect = zone_buddy_bisect,
457	.coalesce = zone_buddy_coalesce,	466	.coalesce = zone_buddy_coalesce,
458	.set_order = zone_buddy_set_order,	467	.set_order = zone_buddy_set_order,
459	.get_order = zone_buddy_get_order,	468	.get_order = zone_buddy_get_order,
460	.mark_busy = zone_buddy_mark_busy,	469	.mark_busy = zone_buddy_mark_busy,
461	.mark_available = zone_buddy_mark_available,	470	.mark_available = zone_buddy_mark_available,
462	.find_block = zone_buddy_find_block,	471	.find_block = zone_buddy_find_block,
463	.print_id = zone_buddy_print_id	472	.print_id = zone_buddy_print_id
464	};	473	};
465		474
466	/******************/	475	/******************/
467	/* Zone functions */	476	/* Zone functions */
468	/******************/	477	/******************/
469		478
470	/** Allocate frame in particular zone.	479	/** Allocate frame in particular zone.
471	*	480	*
472	* Assume zone is locked.	481	* Assume zone is locked.
473	* Panics if allocation is impossible.	482	* Panics if allocation is impossible.
474	*	483	*
475	* @param zone Zone to allocate from.	484	* @param zone Zone to allocate from.
476	* @param order Allocate exactly 2^order frames.	485	* @param order Allocate exactly 2^order frames.
477	*	486	*
478	* @return Frame index in zone.	487	* @return Frame index in zone.
479	*	488	*
480	*/	489	*/
481	static pfn_t zone_frame_alloc(zone_t *zone, uint8_t order)	490	static pfn_t zone_frame_alloc(zone_t *zone, uint8_t order)
482	{	491	{
483	pfn_t v;	492	pfn_t v;
484	link_t *tmp;	493	link_t *tmp;
485	frame_t *frame;	494	frame_t *frame;
486		495
487	/* Allocate frames from zone buddy system */	496	/* Allocate frames from zone buddy system */
488	tmp = buddy_system_alloc(zone->buddy_system, order);	497	tmp = buddy_system_alloc(zone->buddy_system, order);
489		498
490	ASSERT(tmp);	499	ASSERT(tmp);
491		500

Subversion Repositories HelenOS

(root)/trunk/kernel/generic/src/mm/frame.c @ 1981 – Rev 3185 → 3187