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.
 */
 
/*
 * 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 <typedefs.h>
#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>
 
typedef struct {
    count_t refcount;   /**< tracking of shared frames  */
    __u8 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'
 */
 
struct {
    SPINLOCK_DECLARE(lock);
    int count;
    zone_t *info[ZONES_MAX];
}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
 *
 * @return zone number on success, -1 on error
 */
static int zones_add_zone(zone_t *newzone)
{
    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
 *
 * @param hint Start searching in zone 'hint'
 * @param lock Lock zone if true
 *
 * Assume interrupts disable
 */
static zone_t * find_zone_and_lock(pfn_t frame, int *pzone)
{
    int i;
    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, __u8 order)
{
    return buddy_system_can_alloc(z->buddy_system, order);
}
 
/**
 * Find AND LOCK zone that can allocate order frames
 *
 * Assume interrupts are disabled!!
 *
 * @param pzone Pointer to preferred zone or NULL, on return contains zone number
 */
static zone_t * find_free_zone_lock(__u8 order, int *pzone)
{
    int i;
    zone_t *z;
    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,
                     __u8 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("%d", 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, __u8 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 __u8 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 struct buddy_system_operations  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.
 *
 * @return Frame index in zone
 */
static pfn_t zone_frame_alloc(zone_t *zone,__u8 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
 */
static void zone_frame_free(zone_t *zone, index_t frame_idx)
{
    frame_t *frame;
    __u8 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
 */
 
static void _zone_merge(zone_t *z, zone_t *z1, zone_t *z2)
{
    __u8 max_order;
    int i, 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 *)((void *)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 frames with refcount=0 to 1, because
     * we add all free frames to buddy allocator later again, clear
     * order to 0.
     */
    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];
    }
    for (i=0; i < z->count; i++) {
        if (!z->frames[i].refcount) {
            z->frames[i].refcount = 1;
            z->frames[i].buddy_order = 0;
        }
    }
    /* 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;
    int i;
 
    pfn = ADDR2PFN((__address)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 unneded frames. This means, that
 * when freeing the block, you have to free every frame from block.
 *
 * @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;
    __u8 order;
    frame_t *frame;
   
    ASSERT(frame_idx+count < zone->count);
 
    order = zone->frames[frame_idx].buddy_order;
    ASSERT((1 << order) >= count);
 
    /* Reduce all blocks to order 0 */
    for (i=0; i < (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 < (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(int z1, int z2)
{
    ipl_t ipl;
    zone_t *zone1, *zone2, *newzone;
    int cframes;
    __u8 order;
    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));
    order = fnzb(cframes) + 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 size Size of the zone. Must be a multiple of FRAME_SIZE.
 * @param conffram Address of configuration frame
 * @param flags Zone flags.
 *
 * @return Initialized zone.
 */
static void zone_construct(pfn_t start, count_t count, zone_t *z, int flags)
{
    int i;
    __u8 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 *)((void *)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 */
__address 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 confframe Where configuration frame is supposed to be.
 *                  Always check, 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
 *
 * @return Zone number or -1 on error
 */
int zone_create(pfn_t start, count_t count, pfn_t confframe, int flags)
{
    zone_t *z;
    __address addr;
    count_t confcount;
    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;
           
            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, 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, 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 flags Flags for host zone selection and address processing.
 * @param order Allocate exactly 2^order frames.
 * @param pzone Preferred zone
 *
 * @return Allocated frame.
 */
pfn_t frame_alloc_generic(__u8 order, int flags, int * status, 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_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_lock(order,pzone);
        if (!zone) {
            freed = slab_reclaim(SLAB_RECLAIM_ALL);
            if (freed)
                zone = find_free_zone_lock(order,pzone);
        }
    }
    if (!zone) {
        if (flags & FRAME_PANIC)
            panic("Can't allocate frame.\n");
       
        /*
         * TODO: Sleep until frames are available again.
         */
        interrupts_restore(ipl);
 
        if (flags & FRAME_ATOMIC) {
            ASSERT(status != NULL);
            if (status)
                *status = FRAME_NO_MEMORY;
            return NULL;
        }
       
        panic("Sleep not implemented.\n");
        goto loop;
    }
    v = zone_frame_alloc(zone,order);
    v += zone->base;
 
    spinlock_unlock(&zone->lock);
    interrupts_restore(ipl);
 
    if (status)
        *status = FRAME_OK;
    return v;
}
 
/** Free a frame.
 *
 * Find respective frame structure for supplied addr.
 * Decrement frame reference count.
 * If it drops to zero, move the frame structure to free list.
 *
 * @param frame Frame no to be freed.
 */
void frame_free(pfn_t pfn)
{
    ipl_t ipl;
    zone_t *zone;
 
    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);
}
 
 
 
/** Mark given range unavailable in frame zones */
void frame_mark_unavailable(pfn_t start, count_t count)
{
    int i;
    zone_t *zone;
    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_glob_lock");
    }
    /* Tell the architecture to create some memory */
    frame_arch_init();
    if (config.cpu_active == 1) {
        pfn_t firstframe = ADDR2PFN(KA2PA(config.base));
        pfn_t lastframe = ADDR2PFN(KA2PA(config.base+config.kernel_size));
        frame_mark_unavailable(firstframe,lastframe-firstframe+1);
       
        count_t i;
        for (i = 0; i < init.cnt; i++)
            frame_mark_unavailable(ADDR2PFN(KA2PA(init.tasks[i].addr)), SIZE2FRAMES(init.tasks[i].size));
 
    }
}
 
 
 
/** Prints list of zones
 *
 */
void zone_print_list(void) {
    zone_t *zone = NULL;
    int i;
    ipl_t ipl;
 
    ipl = interrupts_disable();
    spinlock_lock(&zones.lock);
    printf("#  Base address\tFree Frames\tBusy Frames\n");
    printf("   ------------\t-----------\t-----------\n");
    for (i = 0; i < zones.count; i++) {
        zone = zones.info[i];
        spinlock_lock(&zone->lock);
        printf("%d: %L\t%d\t\t%d\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 base Zone base address OR zone number
 */
void zone_print_one(int num) {
    zone_t *zone = NULL;
    ipl_t ipl;
    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: %d frames (%dK)\n", zone->count, ((zone->count) * FRAME_SIZE) >> 10);
    printf("Allocated space: %d frames (%dK)\n", zone->busy_count, (zone->busy_count * FRAME_SIZE) >> 10);
    printf("Available space: %d (%dK)\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 946	Rev 1037
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	/*	30	/*
31	* Locking order	31	* Locking order
32	*	32	*
33	* In order to access particular zone, the process must first lock	33	* In order to access particular zone, the process must first lock
34	* the zones.lock, then lock the zone and then unlock the zones.lock.	34	* the zones.lock, then lock the zone and then unlock the zones.lock.
35	* This insures, that we can fiddle with the zones in runtime without	35	* This insures, that we can fiddle with the zones in runtime without
36	* affecting the processes.	36	* affecting the processes.
37	*	37	*
38	*/	38	*/
39		39
40	#include <typedefs.h>	40	#include <typedefs.h>
41	#include <arch/types.h>	41	#include <arch/types.h>
42	#include <mm/frame.h>	42	#include <mm/frame.h>
43	#include <mm/as.h>	43	#include <mm/as.h>
44	#include <panic.h>	44	#include <panic.h>
45	#include <debug.h>	45	#include <debug.h>
46	#include <adt/list.h>	46	#include <adt/list.h>
47	#include <synch/spinlock.h>	47	#include <synch/spinlock.h>
48	#include <arch/asm.h>	48	#include <arch/asm.h>
49	#include <arch.h>	49	#include <arch.h>
50	#include <print.h>	50	#include <print.h>
51	#include <align.h>	51	#include <align.h>
52	#include <mm/slab.h>	52	#include <mm/slab.h>
53	#include <bitops.h>	53	#include <bitops.h>
54		54
55	typedef struct {	55	typedef struct {
56	count_t refcount; /*< tracking of shared frames /	56	count_t refcount; /*< tracking of shared frames /
57	__u8 buddy_order; /*< buddy system block order /	57	__u8 buddy_order; /*< buddy system block order /
58	link_t buddy_link; /*< link to the next free block inside one order /	58	link_t buddy_link; /*< link to the next free block inside one order /
59	void parent; /< If allocated by slab, this points there /	59	void parent; /< If allocated by slab, this points there /
60	}frame_t;	60	}frame_t;
61		61
62	typedef struct {	62	typedef struct {
63	SPINLOCK_DECLARE(lock); /*< this lock protects everything below /	63	SPINLOCK_DECLARE(lock); /*< this lock protects everything below /
64	pfn_t base; /*< frame_no of the first frame in the frames array /	64	pfn_t base; /*< frame_no of the first frame in the frames array /
65	count_t count; /*< Size of zone /	65	count_t count; /*< Size of zone /
66		66
67	frame_t frames; /< array of frame_t structures in this zone /	67	frame_t frames; /< array of frame_t structures in this zone /
68	count_t free_count; /*< number of free frame_t structures /	68	count_t free_count; /*< number of free frame_t structures /
69	count_t busy_count; /*< number of busy frame_t structures /	69	count_t busy_count; /*< number of busy frame_t structures /
70		70
71	buddy_system_t * buddy_system; /*< buddy system for the zone /	71	buddy_system_t * buddy_system; /*< buddy system for the zone /
72	int flags;	72	int flags;
73	}zone_t;	73	}zone_t;
74		74
75	/*	75	/*
76	* The zoneinfo.lock must be locked when accessing zoneinfo structure.	76	* The zoneinfo.lock must be locked when accessing zoneinfo structure.
77	* Some of the attributes in zone_t structures are 'read-only'	77	* Some of the attributes in zone_t structures are 'read-only'
78	*/	78	*/
79		79
80	struct {	80	struct {
81	SPINLOCK_DECLARE(lock);	81	SPINLOCK_DECLARE(lock);
82	int count;	82	int count;
83	zone_t *info[ZONES_MAX];	83	zone_t *info[ZONES_MAX];
84	}zones;	84	}zones;
85		85
86		86
87	/*********************************/	87	/*********************************/
88	/* Helper functions */	88	/* Helper functions */
89	static inline index_t frame_index(zone_t zone, frame_t frame)	89	static inline index_t frame_index(zone_t zone, frame_t frame)
90	{	90	{
91	return (index_t)(frame - zone->frames);	91	return (index_t)(frame - zone->frames);
92	}	92	}
93	static inline index_t frame_index_abs(zone_t zone, frame_t frame)	93	static inline index_t frame_index_abs(zone_t zone, frame_t frame)
94	{	94	{
95	return (index_t)(frame - zone->frames) + zone->base;	95	return (index_t)(frame - zone->frames) + zone->base;
96	}	96	}
97	static inline int frame_index_valid(zone_t *zone, index_t index)	97	static inline int frame_index_valid(zone_t *zone, index_t index)
98	{	98	{
99	return index >= 0 && index < zone->count;	99	return index >= 0 && index < zone->count;
100	}	100	}
101		101
102	/** Compute pfn_t from frame_t pointer & zone pointer */	102	/** Compute pfn_t from frame_t pointer & zone pointer */
103	static index_t make_frame_index(zone_t zone, frame_t frame)	103	static index_t make_frame_index(zone_t zone, frame_t frame)
104	{	104	{
105	return frame - zone->frames;	105	return frame - zone->frames;
106	}	106	}
107		107
108	/** Initialize frame structure	108	/** Initialize frame structure
109	*	109	*
110	* Initialize frame structure.	110	* Initialize frame structure.
111	*	111	*
112	* @param frame Frame structure to be initialized.	112	* @param frame Frame structure to be initialized.
113	*/	113	*/
114	static void frame_initialize(frame_t *frame)	114	static void frame_initialize(frame_t *frame)
115	{	115	{
116	frame->refcount = 1;	116	frame->refcount = 1;
117	frame->buddy_order = 0;	117	frame->buddy_order = 0;
118	}	118	}
119		119
120	/*************************************/	120	/*************************************/
121	/* Zoneinfo functions */	121	/* Zoneinfo functions */
122		122
123	/**	123	/**
124	* Insert-sort zone into zones list	124	* Insert-sort zone into zones list
125	*	125	*
126	* @return zone number on success, -1 on error	126	* @return zone number on success, -1 on error
127	*/	127	*/
128	static int zones_add_zone(zone_t *newzone)	128	static int zones_add_zone(zone_t *newzone)
129	{	129	{
130	int i,j;	130	int i,j;
131	ipl_t ipl;	131	ipl_t ipl;
132	zone_t *z;	132	zone_t *z;
133		133
134	ipl = interrupts_disable();	134	ipl = interrupts_disable();
135	spinlock_lock(&zones.lock);	135	spinlock_lock(&zones.lock);
136	/* Try to merge */	136	/* Try to merge */
137	if (zones.count+1 == ZONES_MAX)	137	if (zones.count + 1 == ZONES_MAX)
138	panic("Maximum zone(%d) count exceeded.", ZONES_MAX);	138	panic("Maximum zone(%d) count exceeded.", ZONES_MAX);
139	for (i=0; i < zones.count; i++) {	139	for (i = 0; i < zones.count; i++) {
140	/* Check for overflow */	140	/* Check for overflow */
141	z = zones.info[i];	141	z = zones.info[i];
142	if (overlaps(newzone->base,newzone->count,	142	if (overlaps(newzone->base,newzone->count,
143	z->base, z->count)) {	143	z->base, z->count)) {
144	printf("Zones overlap!\n");	144	printf("Zones overlap!\n");
145	return -1;	145	return -1;
146	}	146	}
147	if (newzone->base < z->base)	147	if (newzone->base < z->base)
148	break;	148	break;
149	}	149	}
150	/* Move other zones up */	150	/* Move other zones up */
151	for (j=i;j < zones.count;j++)	151	for (j = i;j < zones.count; j++)
152	zones.info[j+1] = zones.info[j];	152	zones.info[j + 1] = zones.info[j];
153	zones.info[i] = newzone;	153	zones.info[i] = newzone;
154	zones.count++;	154	zones.count++;
155	spinlock_unlock(&zones.lock);	155	spinlock_unlock(&zones.lock);
156	interrupts_restore(ipl);	156	interrupts_restore(ipl);
157		157
158	return i;	158	return i;
159	}	159	}
160		160
161	/**	161	/**
162	* Try to find a zone where can we find the frame	162	* Try to find a zone where can we find the frame
163	*	163	*
164	* @param hint Start searching in zone 'hint'	164	* @param hint Start searching in zone 'hint'
165	* @param lock Lock zone if true	165	* @param lock Lock zone if true
166	*	166	*
167	* Assume interrupts disable	167	* Assume interrupts disable
168	*/	168	*/
169	static zone_t * find_zone_and_lock(pfn_t frame, int *pzone)	169	static zone_t * find_zone_and_lock(pfn_t frame, int *pzone)
170	{	170	{
171	int i;	171	int i;
172	int hint = pzone ? *pzone : 0;	172	int hint = pzone ? *pzone : 0;
173	zone_t *z;	173	zone_t *z;
174		174
175	spinlock_lock(&zones.lock);	175	spinlock_lock(&zones.lock);
176		176
177	if (hint >= zones.count \|\| hint < 0)	177	if (hint >= zones.count \|\| hint < 0)
178	hint = 0;	178	hint = 0;
179		179
180	i = hint;	180	i = hint;
181	do {	181	do {
182	z = zones.info[i];	182	z = zones.info[i];
183	spinlock_lock(&z->lock);	183	spinlock_lock(&z->lock);
184	if (z->base <= frame && z->base + z->count > frame) {	184	if (z->base <= frame && z->base + z->count > frame) {
185	spinlock_unlock(&zones.lock); /* Unlock the global lock */	185	spinlock_unlock(&zones.lock); /* Unlock the global lock */
186	if (pzone)	186	if (pzone)
187	*pzone = i;	187	*pzone = i;
188	return z;	188	return z;
189	}	189	}
190	spinlock_unlock(&z->lock);	190	spinlock_unlock(&z->lock);
191		191
192	i++;	192	i++;
193	if (i >= zones.count)	193	if (i >= zones.count)
194	i = 0;	194	i = 0;
195	} while(i != hint);	195	} while(i != hint);
196		196
197	spinlock_unlock(&zones.lock);	197	spinlock_unlock(&zones.lock);
198	return NULL;	198	return NULL;
199	}	199	}
200		200
201	/** @return True if zone can allocate specified order */	201	/** @return True if zone can allocate specified order */
202	static int zone_can_alloc(zone_t *z, __u8 order)	202	static int zone_can_alloc(zone_t *z, __u8 order)
203	{	203	{
204	return buddy_system_can_alloc(z->buddy_system, order);	204	return buddy_system_can_alloc(z->buddy_system, order);
205	}	205	}
206		206
207	/**	207	/**
208	* Find AND LOCK zone that can allocate order frames	208	* Find AND LOCK zone that can allocate order frames
209	*	209	*
210	* Assume interrupts are disabled!!	210	* Assume interrupts are disabled!!
211	*	211	*
212	* @param pzone Pointer to preferred zone or NULL, on return contains zone number	212	* @param pzone Pointer to preferred zone or NULL, on return contains zone number
213	*/	213	*/
214	static zone_t * find_free_zone_lock(__u8 order, int *pzone)	214	static zone_t * find_free_zone_lock(__u8 order, int *pzone)
215	{	215	{
216	int i;	216	int i;
217	zone_t *z;	217	zone_t *z;
218	int hint = pzone ? *pzone : 0;	218	int hint = pzone ? *pzone : 0;
219		219
220	spinlock_lock(&zones.lock);	220	spinlock_lock(&zones.lock);
221	if (hint >= zones.count)	221	if (hint >= zones.count)
222	hint = 0;	222	hint = 0;
223	i = hint;	223	i = hint;
224	do {	224	do {
225	z = zones.info[i];	225	z = zones.info[i];
226		226
227	spinlock_lock(&z->lock);	227	spinlock_lock(&z->lock);
228		228
229	/* Check if the zone has 2^order frames area available */	229	/* Check if the zone has 2^order frames area available */
230	if (zone_can_alloc(z, order)) {	230	if (zone_can_alloc(z, order)) {
231	spinlock_unlock(&zones.lock);	231	spinlock_unlock(&zones.lock);
232	if (pzone)	232	if (pzone)
233	*pzone = i;	233	*pzone = i;
234	return z;	234	return z;
235	}	235	}
236	spinlock_unlock(&z->lock);	236	spinlock_unlock(&z->lock);
237	if (++i >= zones.count)	237	if (++i >= zones.count)
238	i = 0;	238	i = 0;
239	} while(i != hint);	239	} while(i != hint);
240	spinlock_unlock(&zones.lock);	240	spinlock_unlock(&zones.lock);
241	return NULL;	241	return NULL;
242	}	242	}
243		243
244	/********************************************/	244	/********************************************/
245	/* Buddy system functions */	245	/* Buddy system functions */
246		246
247	/** Buddy system find_block implementation	247	/** Buddy system find_block implementation
248	*	248	*
249	* Find block that is parent of current list.	249	* Find block that is parent of current list.
250	* That means go to lower addresses, until such block is found	250	* That means go to lower addresses, until such block is found
251	*	251	*
252	* @param order - Order of parent must be different then this parameter!!	252	* @param order - Order of parent must be different then this parameter!!
253	*/	253	*/
254	static link_t zone_buddy_find_block(buddy_system_t b, link_t *child,	254	static link_t zone_buddy_find_block(buddy_system_t b, link_t *child,
255	__u8 order)	255	__u8 order)
256	{	256	{
257	frame_t * frame;	257	frame_t * frame;
258	zone_t * zone;	258	zone_t * zone;
259	index_t index;	259	index_t index;
260		260
261	frame = list_get_instance(child, frame_t, buddy_link);	261	frame = list_get_instance(child, frame_t, buddy_link);
262	zone = (zone_t *) b->data;	262	zone = (zone_t *) b->data;
263		263
264	index = frame_index(zone, frame);	264	index = frame_index(zone, frame);
265	do {	265	do {
266	if (zone->frames[index].buddy_order != order) {	266	if (zone->frames[index].buddy_order != order) {
267	return &zone->frames[index].buddy_link;	267	return &zone->frames[index].buddy_link;
268	}	268	}
269	} while(index-- > 0);	269	} while(index-- > 0);
270	return NULL;	270	return NULL;
271	}	271	}
272		272
273	static void zone_buddy_print_id(buddy_system_t b, link_t block)	273	static void zone_buddy_print_id(buddy_system_t b, link_t block)
274	{	274	{
275	frame_t * frame;	275	frame_t * frame;
276	zone_t * zone;	276	zone_t * zone;
277	index_t index;	277	index_t index;
278		278
279	frame = list_get_instance(block, frame_t, buddy_link);	279	frame = list_get_instance(block, frame_t, buddy_link);
280	zone = (zone_t *) b->data;	280	zone = (zone_t *) b->data;
281	index = frame_index(zone, frame);	281	index = frame_index(zone, frame);
282	printf("%d", index);	282	printf("%d", index);
283	}	283	}
284		284
285	/** Buddy system find_buddy implementation	285	/** Buddy system find_buddy implementation
286	*	286	*
287	* @param b Buddy system.	287	* @param b Buddy system.
288	* @param block Block for which buddy should be found	288	* @param block Block for which buddy should be found
289	*	289	*
290	* @return Buddy for given block if found	290	* @return Buddy for given block if found
291	*/	291	*/
292	static link_t * zone_buddy_find_buddy(buddy_system_t b, link_t block)	292	static link_t * zone_buddy_find_buddy(buddy_system_t b, link_t block)
293	{	293	{
294	frame_t * frame;	294	frame_t * frame;
295	zone_t * zone;	295	zone_t * zone;
296	index_t index;	296	index_t index;
297	bool is_left, is_right;	297	bool is_left, is_right;
298		298
299	frame = list_get_instance(block, frame_t, buddy_link);	299	frame = list_get_instance(block, frame_t, buddy_link);
300	zone = (zone_t *) b->data;	300	zone = (zone_t *) b->data;
301	ASSERT(IS_BUDDY_ORDER_OK(frame_index_abs(zone, frame), frame->buddy_order));	301	ASSERT(IS_BUDDY_ORDER_OK(frame_index_abs(zone, frame), frame->buddy_order));
302		302
303	is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame);	303	is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame);
304	is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame);	304	is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame);
305		305
306	ASSERT(is_left ^ is_right);	306	ASSERT(is_left ^ is_right);
307	if (is_left) {	307	if (is_left) {
308	index = (frame_index(zone, frame)) + (1 << frame->buddy_order);	308	index = (frame_index(zone, frame)) + (1 << frame->buddy_order);
309	} else { // if (is_right)	309	} else { // if (is_right)
310	index = (frame_index(zone, frame)) - (1 << frame->buddy_order);	310	index = (frame_index(zone, frame)) - (1 << frame->buddy_order);
311	}	311	}
312		312
313	if (frame_index_valid(zone, index)) {	313	if (frame_index_valid(zone, index)) {
314	if (zone->frames[index].buddy_order == frame->buddy_order &&	314	if (zone->frames[index].buddy_order == frame->buddy_order &&
315	zone->frames[index].refcount == 0) {	315	zone->frames[index].refcount == 0) {
316	return &zone->frames[index].buddy_link;	316	return &zone->frames[index].buddy_link;
317	}	317	}
318	}	318	}
319		319
320	return NULL;	320	return NULL;
321	}	321	}
322		322
323	/** Buddy system bisect implementation	323	/** Buddy system bisect implementation
324	*	324	*
325	* @param b Buddy system.	325	* @param b Buddy system.
326	* @param block Block to bisect	326	* @param block Block to bisect
327	*	327	*
328	* @return right block	328	* @return right block
329	*/	329	*/
330	static link_t * zone_buddy_bisect(buddy_system_t b, link_t block) {	330	static link_t * zone_buddy_bisect(buddy_system_t b, link_t block) {
331	frame_t * frame_l, * frame_r;	331	frame_t * frame_l, * frame_r;
332		332
333	frame_l = list_get_instance(block, frame_t, buddy_link);	333	frame_l = list_get_instance(block, frame_t, buddy_link);
334	frame_r = (frame_l + (1 << (frame_l->buddy_order - 1)));	334	frame_r = (frame_l + (1 << (frame_l->buddy_order - 1)));
335		335
336	return &frame_r->buddy_link;	336	return &frame_r->buddy_link;
337	}	337	}
338		338
339	/** Buddy system coalesce implementation	339	/** Buddy system coalesce implementation
340	*	340	*
341	* @param b Buddy system.	341	* @param b Buddy system.
342	* @param block_1 First block	342	* @param block_1 First block
343	* @param block_2 First block's buddy	343	* @param block_2 First block's buddy
344	*	344	*
345	* @return Coalesced block (actually block that represents lower address)	345	* @return Coalesced block (actually block that represents lower address)
346	*/	346	*/
347	static link_t * zone_buddy_coalesce(buddy_system_t b, link_t block_1,	347	static link_t * zone_buddy_coalesce(buddy_system_t b, link_t block_1,
348	link_t * block_2)	348	link_t * block_2)
349	{	349	{
350	frame_t frame1, frame2;	350	frame_t frame1, frame2;
351		351
352	frame1 = list_get_instance(block_1, frame_t, buddy_link);	352	frame1 = list_get_instance(block_1, frame_t, buddy_link);
353	frame2 = list_get_instance(block_2, frame_t, buddy_link);	353	frame2 = list_get_instance(block_2, frame_t, buddy_link);
354		354
355	return frame1 < frame2 ? block_1 : block_2;	355	return frame1 < frame2 ? block_1 : block_2;
356	}	356	}
357		357
358	/** Buddy system set_order implementation	358	/** Buddy system set_order implementation
359	*	359	*
360	* @param b Buddy system.	360	* @param b Buddy system.
361	* @param block Buddy system block	361	* @param block Buddy system block
362	* @param order Order to set	362	* @param order Order to set
363	*/	363	*/
364	static void zone_buddy_set_order(buddy_system_t b, link_t block, __u8 order) {	364	static void zone_buddy_set_order(buddy_system_t b, link_t block, __u8 order) {
365	frame_t * frame;	365	frame_t * frame;
366	frame = list_get_instance(block, frame_t, buddy_link);	366	frame = list_get_instance(block, frame_t, buddy_link);
367	frame->buddy_order = order;	367	frame->buddy_order = order;
368	}	368	}
369		369
370	/** Buddy system get_order implementation	370	/** Buddy system get_order implementation
371	*	371	*
372	* @param b Buddy system.	372	* @param b Buddy system.
373	* @param block Buddy system block	373	* @param block Buddy system block
374	*	374	*
375	* @return Order of block	375	* @return Order of block
376	*/	376	*/
377	static __u8 zone_buddy_get_order(buddy_system_t b, link_t block) {	377	static __u8 zone_buddy_get_order(buddy_system_t b, link_t block) {
378	frame_t * frame;	378	frame_t * frame;
379	frame = list_get_instance(block, frame_t, buddy_link);	379	frame = list_get_instance(block, frame_t, buddy_link);
380	return frame->buddy_order;	380	return frame->buddy_order;
381	}	381	}
382		382
383	/** Buddy system mark_busy implementation	383	/** Buddy system mark_busy implementation
384	*	384	*
385	* @param b Buddy system	385	* @param b Buddy system
386	* @param block Buddy system block	386	* @param block Buddy system block
387	*	387	*
388	*/	388	*/
389	static void zone_buddy_mark_busy(buddy_system_t b, link_t block) {	389	static void zone_buddy_mark_busy(buddy_system_t b, link_t block) {
390	frame_t * frame;	390	frame_t * frame;
391		391
392	frame = list_get_instance(block, frame_t, buddy_link);	392	frame = list_get_instance(block, frame_t, buddy_link);
393	frame->refcount = 1;	393	frame->refcount = 1;
394	}	394	}
395		395
396	/** Buddy system mark_available implementation	396	/** Buddy system mark_available implementation
397	*	397	*
398	* @param b Buddy system	398	* @param b Buddy system
399	* @param block Buddy system block	399	* @param block Buddy system block
400	*	400	*
401	*/	401	*/
402	static void zone_buddy_mark_available(buddy_system_t b, link_t block) {	402	static void zone_buddy_mark_available(buddy_system_t b, link_t block) {
403	frame_t * frame;	403	frame_t * frame;
404	frame = list_get_instance(block, frame_t, buddy_link);	404	frame = list_get_instance(block, frame_t, buddy_link);
405	frame->refcount = 0;	405	frame->refcount = 0;
406	}	406	}
407		407
408	static struct buddy_system_operations zone_buddy_system_operations = {	408	static struct buddy_system_operations zone_buddy_system_operations = {
409	.find_buddy = zone_buddy_find_buddy,	409	.find_buddy = zone_buddy_find_buddy,
410	.bisect = zone_buddy_bisect,	410	.bisect = zone_buddy_bisect,
411	.coalesce = zone_buddy_coalesce,	411	.coalesce = zone_buddy_coalesce,
412	.set_order = zone_buddy_set_order,	412	.set_order = zone_buddy_set_order,
413	.get_order = zone_buddy_get_order,	413	.get_order = zone_buddy_get_order,
414	.mark_busy = zone_buddy_mark_busy,	414	.mark_busy = zone_buddy_mark_busy,
415	.mark_available = zone_buddy_mark_available,	415	.mark_available = zone_buddy_mark_available,
416	.find_block = zone_buddy_find_block,	416	.find_block = zone_buddy_find_block,
417	.print_id = zone_buddy_print_id	417	.print_id = zone_buddy_print_id
418	};	418	};
419		419
420	/*************************************/	420	/*************************************/
421	/* Zone functions */	421	/* Zone functions */
422		422
423	/** Allocate frame in particular zone	423	/** Allocate frame in particular zone
424	*	424	*
425	* Assume zone is locked	425	* Assume zone is locked
426	* Panics, if allocation is impossible.	426	* Panics, if allocation is impossible.
427	*	427	*
428	* @return Frame index in zone	428	* @return Frame index in zone
429	*/	429	*/
430	static pfn_t zone_frame_alloc(zone_t *zone,__u8 order)	430	static pfn_t zone_frame_alloc(zone_t *zone,__u8 order)
431	{	431	{
432	pfn_t v;	432	pfn_t v;
433	link_t *tmp;	433	link_t *tmp;
434	frame_t *frame;	434	frame_t *frame;
435		435
436	/* Allocate frames from zone buddy system */	436	/* Allocate frames from zone buddy system */
437	tmp = buddy_system_alloc(zone->buddy_system, order);	437	tmp = buddy_system_alloc(zone->buddy_system, order);
438		438
439	ASSERT(tmp);	439	ASSERT(tmp);
440		440
441	/* Update zone information. */	441	/* Update zone information. */
442	zone->free_count -= (1 << order);	442	zone->free_count -= (1 << order);
443	zone->busy_count += (1 << order);	443	zone->busy_count += (1 << order);
444		444
445	/* Frame will be actually a first frame of the block. */	445	/* Frame will be actually a first frame of the block. */
446	frame = list_get_instance(tmp, frame_t, buddy_link);	446	frame = list_get_instance(tmp, frame_t, buddy_link);
447		447
448	/* get frame address */	448	/* get frame address */
449	v = make_frame_index(zone, frame);	449	v = make_frame_index(zone, frame);
450	return v;	450	return v;
451	}	451	}
452		452
453	/** Free frame from zone	453	/** Free frame from zone
454	*	454	*
455	* Assume zone is locked	455	* Assume zone is locked
456	*/	456	*/
457	static void zone_frame_free(zone_t *zone, index_t frame_idx)	457	static void zone_frame_free(zone_t *zone, index_t frame_idx)
458	{	458	{
459	frame_t *frame;	459	frame_t *frame;
460	__u8 order;	460	__u8 order;
461		461
462	frame = &zone->frames[frame_idx];	462	frame = &zone->frames[frame_idx];
463		463
464	/* remember frame order */	464	/* remember frame order */
465	order = frame->buddy_order;	465	order = frame->buddy_order;
466		466
467	ASSERT(frame->refcount);	467	ASSERT(frame->refcount);
468		468
469	if (!--frame->refcount) {	469	if (!--frame->refcount) {
470	buddy_system_free(zone->buddy_system, &frame->buddy_link);	470	buddy_system_free(zone->buddy_system, &frame->buddy_link);
471		471
472	/* Update zone information. */	472	/* Update zone information. */
473	zone->free_count += (1 << order);	473	zone->free_count += (1 << order);
474	zone->busy_count -= (1 << order);	474	zone->busy_count -= (1 << order);
475	}	475	}
476	}	476	}
477		477
478	/** Return frame from zone */	478	/** Return frame from zone */
479	static frame_t * zone_get_frame(zone_t *zone, index_t frame_idx)	479	static frame_t * zone_get_frame(zone_t *zone, index_t frame_idx)
480	{	480	{
481	ASSERT(frame_idx < zone->count);	481	ASSERT(frame_idx < zone->count);
482	return &zone->frames[frame_idx];	482	return &zone->frames[frame_idx];
483	}	483	}
484		484
485	/** Mark frame in zone unavailable to allocation */	485	/** Mark frame in zone unavailable to allocation */
486	static void zone_mark_unavailable(zone_t *zone, index_t frame_idx)	486	static void zone_mark_unavailable(zone_t *zone, index_t frame_idx)
487	{	487	{
488	frame_t *frame;	488	frame_t *frame;
489	link_t *link;	489	link_t *link;
490		490
491	frame = zone_get_frame(zone, frame_idx);	491	frame = zone_get_frame(zone, frame_idx);
492	if (frame->refcount)	492	if (frame->refcount)
493	return;	493	return;
494	link = buddy_system_alloc_block(zone->buddy_system,	494	link = buddy_system_alloc_block(zone->buddy_system,
495	&frame->buddy_link);	495	&frame->buddy_link);
496	ASSERT(link);	496	ASSERT(link);
497	zone->free_count--;	497	zone->free_count--;
498	}	498	}
499		499
500	/**	500	/**

Subversion Repositories HelenOS

(root)/trunk/kernel/generic/src/mm/frame.c @ 2071 – Rev 946 → 1037