WebSVN – HelenOS – Diff – /tags/0.2.0.4/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 <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;
 
 
/*********************************/
/* 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 >= 0 && 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
 *
 * Initialize frame structure.
 *
 * @param frame 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)
        panic("Maximum zone(%d) count exceeded.", ZONES_MAX);
    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)
        hint = 0;
   
    i = hint;
    do {
        z = zones.info[i];
        spinlock_lock(&z->lock);
        if (z->base <= frame && z->base + z->count > frame) {
            spinlock_unlock(&zones.lock); /* Unlock the global 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("%zd", 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 2 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 < 0 || z1 >= zones.count || z2 < 0 || 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 frame zone
 *
 * 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) {
        /*
         * TODO: Sleep until frames are available again.
         */
        interrupts_restore(ipl);
 
        if (flags & FRAME_ATOMIC)
            return 0;
       
        panic("Sleep not implemented.\n");
        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);
    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
 *
 * Initialize physical memory managemnt.
 */
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++)
            frame_mark_unavailable(ADDR2PFN(KA2PA(init.tasks[i].addr)), 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);
    }
}
 
 
 
/** 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);
    printf("#  base address free frames  busy frames\n");
    printf("-- ------------ ------------ ------------\n");
    for (i = 0; i < zones.count; i++) {
        zone = zones.info[i];
        spinlock_lock(&zone->lock);
        printf("%-2d %12p %12zd %12zd\n", i, PFN2ADDR(zone->base), zone->free_count, zone->busy_count);
        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", sizeof(uintptr_t) * 2, PFN2ADDR(zone->base));
    printf("Zone size: %zd frames (%zdK)\n", zone->count, ((zone->count) * FRAME_SIZE) >> 10);
    printf("Allocated space: %zd frames (%zdK)\n", zone->busy_count, (zone->busy_count * FRAME_SIZE) >> 10);
    printf("Available space: %zd frames (%zdK)\n", zone->free_count, (zone->free_count * FRAME_SIZE) >> 10);
    buddy_system_structure_print(zone->buddy_system, FRAME_SIZE);
   
    spinlock_unlock(&zone->lock);
out:
    spinlock_unlock(&zones.lock);
    interrupts_restore(ipl);
}
 
/** @}
 */
 

Rev 2128	Rev 2130
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 <arch/asm.h>	61	#include <arch/asm.h>
62	#include <arch.h>	62	#include <arch.h>
63	#include <print.h>	63	#include <print.h>
64	#include <align.h>	64	#include <align.h>
65	#include <mm/slab.h>	65	#include <mm/slab.h>
66	#include <bitops.h>	66	#include <bitops.h>
67	#include <macros.h>	67	#include <macros.h>
68	#include <config.h>	68	#include <config.h>
69		69
70	typedef struct {	70	typedef struct {
71	count_t refcount; /*< tracking of shared frames /	71	count_t refcount; /*< tracking of shared frames /
72	uint8_t buddy_order; /*< buddy system block order /	72	uint8_t buddy_order; /*< buddy system block order /
73	link_t buddy_link; /*< link to the next free block inside one order /	73	link_t buddy_link; /*< link to the next free block inside one order /
74	void parent; /< If allocated by slab, this points there /	74	void parent; /< If allocated by slab, this points there /
75	} frame_t;	75	} frame_t;
76		76
77	typedef struct {	77	typedef struct {
78	SPINLOCK_DECLARE(lock); /*< this lock protects everything below /	78	SPINLOCK_DECLARE(lock); /*< this lock protects everything below /
79	pfn_t base; /*< frame_no of the first frame in the frames array /	79	pfn_t base; /*< frame_no of the first frame in the frames array /
80	count_t count; /*< Size of zone /	80	count_t count; /*< Size of zone /
81		81
82	frame_t frames; /< array of frame_t structures in this zone /	82	frame_t frames; /< array of frame_t structures in this zone /
83	count_t free_count; /*< number of free frame_t structures /	83	count_t free_count; /*< number of free frame_t structures /
84	count_t busy_count; /*< number of busy frame_t structures /	84	count_t busy_count; /*< number of busy frame_t structures /
85		85
86	buddy_system_t buddy_system; /< buddy system for the zone /	86	buddy_system_t buddy_system; /< buddy system for the zone /
87	int flags;	87	int flags;
88	} zone_t;	88	} zone_t;
89		89
90	/*	90	/*
91	* The zoneinfo.lock must be locked when accessing zoneinfo structure.	91	* The zoneinfo.lock must be locked when accessing zoneinfo structure.
92	* Some of the attributes in zone_t structures are 'read-only'	92	* Some of the attributes in zone_t structures are 'read-only'
93	*/	93	*/
94		94
95	typedef struct {	95	typedef struct {
96	SPINLOCK_DECLARE(lock);	96	SPINLOCK_DECLARE(lock);
97	unsigned int count;	97	unsigned int count;
98	zone_t *info[ZONES_MAX];	98	zone_t *info[ZONES_MAX];
99	} zones_t;	99	} zones_t;
100		100
101	static zones_t zones;	101	static zones_t zones;
102		102
103		103
104	/*********************************/	104	/*********************************/
105	/* Helper functions */	105	/* Helper functions */
106	static inline index_t frame_index(zone_t zone, frame_t frame)	106	static inline index_t frame_index(zone_t zone, frame_t frame)
107	{	107	{
108	return (index_t)(frame - zone->frames);	108	return (index_t)(frame - zone->frames);
109	}	109	}
110	static inline index_t frame_index_abs(zone_t zone, frame_t frame)	110	static inline index_t frame_index_abs(zone_t zone, frame_t frame)
111	{	111	{
112	return (index_t)(frame - zone->frames) + zone->base;	112	return (index_t)(frame - zone->frames) + zone->base;
113	}	113	}
114	static inline int frame_index_valid(zone_t *zone, index_t index)	114	static inline int frame_index_valid(zone_t *zone, index_t index)
115	{	115	{
116	return index >= 0 && index < zone->count;	116	return index >= 0 && index < zone->count;
117	}	117	}
118		118
119	/** Compute pfn_t from frame_t pointer & zone pointer */	119	/** Compute pfn_t from frame_t pointer & zone pointer */
120	static index_t make_frame_index(zone_t zone, frame_t frame)	120	static index_t make_frame_index(zone_t zone, frame_t frame)
121	{	121	{
122	return frame - zone->frames;	122	return frame - zone->frames;
123	}	123	}
124		124
125	/** Initialize frame structure	125	/** Initialize frame structure
126	*	126	*
127	* Initialize frame structure.	127	* Initialize frame structure.
128	*	128	*
129	* @param frame Frame structure to be initialized.	129	* @param frame Frame structure to be initialized.
130	*/	130	*/
131	static void frame_initialize(frame_t *frame)	131	static void frame_initialize(frame_t *frame)
132	{	132	{
133	frame->refcount = 1;	133	frame->refcount = 1;
134	frame->buddy_order = 0;	134	frame->buddy_order = 0;
135	}	135	}
136		136
137	/*************************************/	137	/*************************************/
138	/* Zoneinfo functions */	138	/* Zoneinfo functions */
139		139
140	/**	140	/**
141	* Insert-sort zone into zones list	141	* Insert-sort zone into zones list
142	*	142	*
143	* @param newzone New zone to be inserted into zone list	143	* @param newzone New zone to be inserted into zone list
144	* @return zone number on success, -1 on error	144	* @return zone number on success, -1 on error
145	*/	145	*/
146	static int zones_add_zone(zone_t *newzone)	146	static int zones_add_zone(zone_t *newzone)
147	{	147	{
148	unsigned int i, j;	148	unsigned int i, j;
149	ipl_t ipl;	149	ipl_t ipl;
150	zone_t *z;	150	zone_t *z;
151		151
152	ipl = interrupts_disable();	152	ipl = interrupts_disable();
153	spinlock_lock(&zones.lock);	153	spinlock_lock(&zones.lock);
154	/* Try to merge */	154	/* Try to merge */
155	if (zones.count + 1 == ZONES_MAX)	155	if (zones.count + 1 == ZONES_MAX)
156	panic("Maximum zone(%d) count exceeded.", ZONES_MAX);	156	panic("Maximum zone(%d) count exceeded.", ZONES_MAX);
157	for (i = 0; i < zones.count; i++) {	157	for (i = 0; i < zones.count; i++) {
158	/* Check for overflow */	158	/* Check for overflow */
159	z = zones.info[i];	159	z = zones.info[i];
160	if (overlaps(newzone->base,newzone->count,	160	if (overlaps(newzone->base,newzone->count,
161	z->base, z->count)) {	161	z->base, z->count)) {
162	printf("Zones overlap!\n");	162	printf("Zones overlap!\n");
163	return -1;	163	return -1;
164	}	164	}
165	if (newzone->base < z->base)	165	if (newzone->base < z->base)
166	break;	166	break;
167	}	167	}
168	/* Move other zones up */	168	/* Move other zones up */
169	for (j = i;j < zones.count; j++)	169	for (j = i;j < zones.count; j++)
170	zones.info[j + 1] = zones.info[j];	170	zones.info[j + 1] = zones.info[j];
171	zones.info[i] = newzone;	171	zones.info[i] = newzone;
172	zones.count++;	172	zones.count++;
173	spinlock_unlock(&zones.lock);	173	spinlock_unlock(&zones.lock);
174	interrupts_restore(ipl);	174	interrupts_restore(ipl);
175		175
176	return i;	176	return i;
177	}	177	}
178		178
179	/**	179	/**
180	* Try to find a zone where can we find the frame	180	* Try to find a zone where can we find the frame
181		181
182	* Assume interrupts are disabled.	182	* Assume interrupts are disabled.
183		183
184	* @param frame Frame number contained in zone	184	* @param frame Frame number contained in zone
185	* @param pzone If not null, it is used as zone hint. Zone index	185	* @param pzone If not null, it is used as zone hint. Zone index
186	* is filled into the variable on success.	186	* is filled into the variable on success.
187	* @return Pointer to locked zone containing frame	187	* @return Pointer to locked zone containing frame
188	*/	188	*/
189	static zone_t * find_zone_and_lock(pfn_t frame, unsigned int *pzone)	189	static zone_t * find_zone_and_lock(pfn_t frame, unsigned int *pzone)
190	{	190	{
191	unsigned int i;	191	unsigned int i;
192	unsigned int hint = pzone ? *pzone : 0;	192	unsigned int hint = pzone ? *pzone : 0;
193	zone_t *z;	193	zone_t *z;
194		194
195	spinlock_lock(&zones.lock);	195	spinlock_lock(&zones.lock);
196		196
197	if (hint >= zones.count \|\| hint < 0)	197	if (hint >= zones.count \|\| hint < 0)
198	hint = 0;	198	hint = 0;
199		199
200	i = hint;	200	i = hint;
201	do {	201	do {
202	z = zones.info[i];	202	z = zones.info[i];
203	spinlock_lock(&z->lock);	203	spinlock_lock(&z->lock);
204	if (z->base <= frame && z->base + z->count > frame) {	204	if (z->base <= frame && z->base + z->count > frame) {
205	spinlock_unlock(&zones.lock); /* Unlock the global lock */	205	spinlock_unlock(&zones.lock); /* Unlock the global lock */
206	if (pzone)	206	if (pzone)
207	*pzone = i;	207	*pzone = i;
208	return z;	208	return z;
209	}	209	}
210	spinlock_unlock(&z->lock);	210	spinlock_unlock(&z->lock);
211		211
212	i++;	212	i++;
213	if (i >= zones.count)	213	if (i >= zones.count)
214	i = 0;	214	i = 0;
215	} while(i != hint);	215	} while(i != hint);
216		216
217	spinlock_unlock(&zones.lock);	217	spinlock_unlock(&zones.lock);
218	return NULL;	218	return NULL;
219	}	219	}
220		220
221	/** @return True if zone can allocate specified order */	221	/** @return True if zone can allocate specified order */
222	static int zone_can_alloc(zone_t *z, uint8_t order)	222	static int zone_can_alloc(zone_t *z, uint8_t order)
223	{	223	{
224	return buddy_system_can_alloc(z->buddy_system, order);	224	return buddy_system_can_alloc(z->buddy_system, order);
225	}	225	}
226		226
227	/** Find and lock zone that can allocate order frames.	227	/** Find and lock zone that can allocate order frames.
228	*	228	*
229	* Assume interrupts are disabled.	229	* Assume interrupts are disabled.
230	*	230	*
231	* @param order Size (2^order) of free space we are trying to find	231	* @param order Size (2^order) of free space we are trying to find
232	* @param pzone Pointer to preferred zone or NULL, on return contains zone number	232	* @param pzone Pointer to preferred zone or NULL, on return contains zone number
233	*/	233	*/
234	static zone_t * find_free_zone_and_lock(uint8_t order, unsigned int *pzone)	234	static zone_t * find_free_zone_and_lock(uint8_t order, unsigned int *pzone)
235	{	235	{
236	unsigned int i;	236	unsigned int i;
237	zone_t *z;	237	zone_t *z;
238	unsigned int hint = pzone ? *pzone : 0;	238	unsigned int hint = pzone ? *pzone : 0;
239		239
240	spinlock_lock(&zones.lock);	240	spinlock_lock(&zones.lock);
241	if (hint >= zones.count)	241	if (hint >= zones.count)
242	hint = 0;	242	hint = 0;
243	i = hint;	243	i = hint;
244	do {	244	do {
245	z = zones.info[i];	245	z = zones.info[i];
246		246
247	spinlock_lock(&z->lock);	247	spinlock_lock(&z->lock);
248		248
249	/* Check if the zone has 2^order frames area available */	249	/* Check if the zone has 2^order frames area available */
250	if (zone_can_alloc(z, order)) {	250	if (zone_can_alloc(z, order)) {
251	spinlock_unlock(&zones.lock);	251	spinlock_unlock(&zones.lock);
252	if (pzone)	252	if (pzone)
253	*pzone = i;	253	*pzone = i;
254	return z;	254	return z;
255	}	255	}
256	spinlock_unlock(&z->lock);	256	spinlock_unlock(&z->lock);
257	if (++i >= zones.count)	257	if (++i >= zones.count)
258	i = 0;	258	i = 0;
259	} while(i != hint);	259	} while(i != hint);
260	spinlock_unlock(&zones.lock);	260	spinlock_unlock(&zones.lock);
261	return NULL;	261	return NULL;
262	}	262	}
263		263
264	/**************************/	264	/**************************/
265	/* Buddy system functions */	265	/* Buddy system functions */
266	/**************************/	266	/**************************/
267		267
268	/** Buddy system find_block implementation	268	/** Buddy system find_block implementation
269	*	269	*
270	* Find block that is parent of current list.	270	* Find block that is parent of current list.
271	* That means go to lower addresses, until such block is found	271	* That means go to lower addresses, until such block is found
272	*	272	*
273	* @param order - Order of parent must be different then this parameter!!	273	* @param order - Order of parent must be different then this parameter!!
274	*/	274	*/
275	static link_t zone_buddy_find_block(buddy_system_t b, link_t *child,	275	static link_t zone_buddy_find_block(buddy_system_t b, link_t *child,
276	uint8_t order)	276	uint8_t order)
277	{	277	{
278	frame_t * frame;	278	frame_t * frame;
279	zone_t * zone;	279	zone_t * zone;
280	index_t index;	280	index_t index;
281		281
282	frame = list_get_instance(child, frame_t, buddy_link);	282	frame = list_get_instance(child, frame_t, buddy_link);
283	zone = (zone_t *) b->data;	283	zone = (zone_t *) b->data;
284		284
285	index = frame_index(zone, frame);	285	index = frame_index(zone, frame);
286	do {	286	do {
287	if (zone->frames[index].buddy_order != order) {	287	if (zone->frames[index].buddy_order != order) {
288	return &zone->frames[index].buddy_link;	288	return &zone->frames[index].buddy_link;
289	}	289	}
290	} while(index-- > 0);	290	} while(index-- > 0);
291	return NULL;	291	return NULL;
292	}	292	}
293		293
294	static void zone_buddy_print_id(buddy_system_t b, link_t block)	294	static void zone_buddy_print_id(buddy_system_t b, link_t block)
295	{	295	{
296	frame_t * frame;	296	frame_t * frame;
297	zone_t * zone;	297	zone_t * zone;
298	index_t index;	298	index_t index;
299		299
300	frame = list_get_instance(block, frame_t, buddy_link);	300	frame = list_get_instance(block, frame_t, buddy_link);
301	zone = (zone_t *) b->data;	301	zone = (zone_t *) b->data;
302	index = frame_index(zone, frame);	302	index = frame_index(zone, frame);
303	printf("%zd", index);	303	printf("%zd", index);
304	}	304	}
305		305
306	/** Buddy system find_buddy implementation	306	/** Buddy system find_buddy implementation
307	*	307	*
308	* @param b Buddy system.	308	* @param b Buddy system.
309	* @param block Block for which buddy should be found	309	* @param block Block for which buddy should be found
310	*	310	*
311	* @return Buddy for given block if found	311	* @return Buddy for given block if found
312	*/	312	*/
313	static link_t * zone_buddy_find_buddy(buddy_system_t b, link_t block)	313	static link_t * zone_buddy_find_buddy(buddy_system_t b, link_t block)
314	{	314	{
315	frame_t * frame;	315	frame_t * frame;
316	zone_t * zone;	316	zone_t * zone;
317	index_t index;	317	index_t index;
318	bool is_left, is_right;	318	bool is_left, is_right;
319		319
320	frame = list_get_instance(block, frame_t, buddy_link);	320	frame = list_get_instance(block, frame_t, buddy_link);
321	zone = (zone_t *) b->data;	321	zone = (zone_t *) b->data;
322	ASSERT(IS_BUDDY_ORDER_OK(frame_index_abs(zone, frame), frame->buddy_order));	322	ASSERT(IS_BUDDY_ORDER_OK(frame_index_abs(zone, frame), frame->buddy_order));
323		323
324	is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame);	324	is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame);
325	is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame);	325	is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame);
326		326
327	ASSERT(is_left ^ is_right);	327	ASSERT(is_left ^ is_right);
328	if (is_left) {	328	if (is_left) {
329	index = (frame_index(zone, frame)) + (1 << frame->buddy_order);	329	index = (frame_index(zone, frame)) + (1 << frame->buddy_order);
330	} else { /* if (is_right) */	330	} else { /* if (is_right) */
331	index = (frame_index(zone, frame)) - (1 << frame->buddy_order);	331	index = (frame_index(zone, frame)) - (1 << frame->buddy_order);
332	}	332	}
333		333
334	if (frame_index_valid(zone, index)) {	334	if (frame_index_valid(zone, index)) {
335	if (zone->frames[index].buddy_order == frame->buddy_order &&	335	if (zone->frames[index].buddy_order == frame->buddy_order &&
336	zone->frames[index].refcount == 0) {	336	zone->frames[index].refcount == 0) {
337	return &zone->frames[index].buddy_link;	337	return &zone->frames[index].buddy_link;
338	}	338	}
339	}	339	}
340		340
341	return NULL;	341	return NULL;
342	}	342	}
343		343
344	/** Buddy system bisect implementation	344	/** Buddy system bisect implementation
345	*	345	*
346	* @param b Buddy system.	346	* @param b Buddy system.
347	* @param block Block to bisect	347	* @param block Block to bisect
348	*	348	*
349	* @return right block	349	* @return right block
350	*/	350	*/
351	static link_t * zone_buddy_bisect(buddy_system_t b, link_t block) {	351	static link_t * zone_buddy_bisect(buddy_system_t b, link_t block) {
352	frame_t * frame_l, * frame_r;	352	frame_t * frame_l, * frame_r;
353		353
354	frame_l = list_get_instance(block, frame_t, buddy_link);	354	frame_l = list_get_instance(block, frame_t, buddy_link);
355	frame_r = (frame_l + (1 << (frame_l->buddy_order - 1)));	355	frame_r = (frame_l + (1 << (frame_l->buddy_order - 1)));
356		356
357	return &frame_r->buddy_link;	357	return &frame_r->buddy_link;
358	}	358	}
359		359
360	/** Buddy system coalesce implementation	360	/** Buddy system coalesce implementation
361	*	361	*
362	* @param b Buddy system.	362	* @param b Buddy system.
363	* @param block_1 First block	363	* @param block_1 First block
364	* @param block_2 First block's buddy	364	* @param block_2 First block's buddy
365	*	365	*
366	* @return Coalesced block (actually block that represents lower address)	366	* @return Coalesced block (actually block that represents lower address)
367	*/	367	*/
368	static link_t * zone_buddy_coalesce(buddy_system_t b, link_t block_1,	368	static link_t * zone_buddy_coalesce(buddy_system_t b, link_t block_1,
369	link_t * block_2)	369	link_t * block_2)
370	{	370	{
371	frame_t frame1, frame2;	371	frame_t frame1, frame2;
372		372
373	frame1 = list_get_instance(block_1, frame_t, buddy_link);	373	frame1 = list_get_instance(block_1, frame_t, buddy_link);
374	frame2 = list_get_instance(block_2, frame_t, buddy_link);	374	frame2 = list_get_instance(block_2, frame_t, buddy_link);
375		375
376	return frame1 < frame2 ? block_1 : block_2;	376	return frame1 < frame2 ? block_1 : block_2;
377	}	377	}
378		378
379	/** Buddy system set_order implementation	379	/** Buddy system set_order implementation
380	*	380	*
381	* @param b Buddy system.	381	* @param b Buddy system.
382	* @param block Buddy system block	382	* @param block Buddy system block
383	* @param order Order to set	383	* @param order Order to set
384	*/	384	*/
385	static void zone_buddy_set_order(buddy_system_t b, link_t block, uint8_t order) {	385	static void zone_buddy_set_order(buddy_system_t b, link_t block, uint8_t order) {
386	frame_t * frame;	386	frame_t * frame;
387	frame = list_get_instance(block, frame_t, buddy_link);	387	frame = list_get_instance(block, frame_t, buddy_link);
388	frame->buddy_order = order;	388	frame->buddy_order = order;
389	}	389	}
390		390
391	/** Buddy system get_order implementation	391	/** Buddy system get_order implementation
392	*	392	*
393	* @param b Buddy system.	393	* @param b Buddy system.
394	* @param block Buddy system block	394	* @param block Buddy system block
395	*	395	*
396	* @return Order of block	396	* @return Order of block
397	*/	397	*/
398	static uint8_t zone_buddy_get_order(buddy_system_t b, link_t block) {	398	static uint8_t zone_buddy_get_order(buddy_system_t b, link_t block) {
399	frame_t * frame;	399	frame_t * frame;
400	frame = list_get_instance(block, frame_t, buddy_link);	400	frame = list_get_instance(block, frame_t, buddy_link);
401	return frame->buddy_order;	401	return frame->buddy_order;
402	}	402	}
403		403
404	/** Buddy system mark_busy implementation	404	/** Buddy system mark_busy implementation
405	*	405	*
406	* @param b Buddy system	406	* @param b Buddy system
407	* @param block Buddy system block	407	* @param block Buddy system block
408	*	408	*
409	*/	409	*/
410	static void zone_buddy_mark_busy(buddy_system_t b, link_t block) {	410	static void zone_buddy_mark_busy(buddy_system_t b, link_t block) {
411	frame_t * frame;	411	frame_t * frame;
412		412
413	frame = list_get_instance(block, frame_t, buddy_link);	413	frame = list_get_instance(block, frame_t, buddy_link);
414	frame->refcount = 1;	414	frame->refcount = 1;
415	}	415	}
416		416
417	/** Buddy system mark_available implementation	417	/** Buddy system mark_available implementation
418	*	418	*
419	* @param b Buddy system	419	* @param b Buddy system
420	* @param block Buddy system block	420	* @param block Buddy system block
421	*	421	*
422	*/	422	*/
423	static void zone_buddy_mark_available(buddy_system_t b, link_t block) {	423	static void zone_buddy_mark_available(buddy_system_t b, link_t block) {
424	frame_t * frame;	424	frame_t * frame;
425	frame = list_get_instance(block, frame_t, buddy_link);	425	frame = list_get_instance(block, frame_t, buddy_link);
426	frame->refcount = 0;	426	frame->refcount = 0;
427	}	427	}
428		428
429	static buddy_system_operations_t zone_buddy_system_operations = {	429	static buddy_system_operations_t zone_buddy_system_operations = {
430	.find_buddy = zone_buddy_find_buddy,	430	.find_buddy = zone_buddy_find_buddy,
431	.bisect = zone_buddy_bisect,	431	.bisect = zone_buddy_bisect,
432	.coalesce = zone_buddy_coalesce,	432	.coalesce = zone_buddy_coalesce,
433	.set_order = zone_buddy_set_order,	433	.set_order = zone_buddy_set_order,
434	.get_order = zone_buddy_get_order,	434	.get_order = zone_buddy_get_order,
435	.mark_busy = zone_buddy_mark_busy,	435	.mark_busy = zone_buddy_mark_busy,
436	.mark_available = zone_buddy_mark_available,	436	.mark_available = zone_buddy_mark_available,
437	.find_block = zone_buddy_find_block,	437	.find_block = zone_buddy_find_block,
438	.print_id = zone_buddy_print_id	438	.print_id = zone_buddy_print_id
439	};	439	};
440		440
441	/******************/	441	/******************/
442	/* Zone functions */	442	/* Zone functions */
443	/******************/	443	/******************/
444		444
445	/** Allocate frame in particular zone	445	/** Allocate frame in particular zone
446	*	446	*
447	* Assume zone is locked	447	* Assume zone is locked
448	* Panics if allocation is impossible.	448	* Panics if allocation is impossible.
449	*	449	*
450	* @param zone Zone to allocate from.	450	* @param zone Zone to allocate from.
451	* @param order Allocate exactly 2^order frames.	451	* @param order Allocate exactly 2^order frames.
452	*	452	*
453	* @return Frame index in zone	453	* @return Frame index in zone
454	*	454	*
455	*/	455	*/
456	static pfn_t zone_frame_alloc(zone_t *zone, uint8_t order)	456	static pfn_t zone_frame_alloc(zone_t *zone, uint8_t order)
457	{	457	{
458	pfn_t v;	458	pfn_t v;
459	link_t *tmp;	459	link_t *tmp;
460	frame_t *frame;	460	frame_t *frame;
461		461
462	/* Allocate frames from zone buddy system */	462	/* Allocate frames from zone buddy system */
463	tmp = buddy_system_alloc(zone->buddy_system, order);	463	tmp = buddy_system_alloc(zone->buddy_system, order);
464		464
465	ASSERT(tmp);	465	ASSERT(tmp);
466		466
467	/* Update zone information. */	467	/* Update zone information. */
468	zone->free_count -= (1 << order);	468	zone->free_count -= (1 << order);
469	zone->busy_count += (1 << order);	469	zone->busy_count += (1 << order);
470		470
471	/* Frame will be actually a first frame of the block. */	471	/* Frame will be actually a first frame of the block. */
472	frame = list_get_instance(tmp, frame_t, buddy_link);	472	frame = list_get_instance(tmp, frame_t, buddy_link);
473		473
474	/* get frame address */	474	/* get frame address */
475	v = make_frame_index(zone, frame);	475	v = make_frame_index(zone, frame);
476	return v;	476	return v;
477	}	477	}
478		478
479	/** Free frame from zone	479	/** Free frame from zone
480	*	480	*
481	* Assume zone is locked	481	* Assume zone is locked
482	*	482	*
483	* @param zone Pointer to zone from which the frame is to be freed	483	* @param zone Pointer to zone from which the frame is to be freed
484	* @param frame_idx Frame index relative to zone	484	* @param frame_idx Frame index relative to zone
485	*/	485	*/
486	static void zone_frame_free(zone_t *zone, index_t frame_idx)	486	static void zone_frame_free(zone_t *zone, index_t frame_idx)
487	{	487	{
488	frame_t *frame;	488	frame_t *frame;
489	uint8_t order;	489	uint8_t order;
490		490
491	frame = &zone->frames[frame_idx];	491	frame = &zone->frames[frame_idx];
492		492
493	/* remember frame order */	493	/* remember frame order */
494	order = frame->buddy_order;	494	order = frame->buddy_order;
495		495
496	ASSERT(frame->refcount);	496	ASSERT(frame->refcount);
497		497
498	if (!--frame->refcount) {	498	if (!--frame->refcount) {
499	buddy_system_free(zone->buddy_system, &frame->buddy_link);	499	buddy_system_free(zone->buddy_system, &frame->buddy_link);
500		500

Subversion Repositories HelenOS

(root)/tags/0.2.0.4/kernel/generic/src/mm/frame.c – Rev 2128 → 2130