WebSVN – HelenOS-historic – Diff – /kernel/trunk/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[zones.count];
        if (overlaps(newzone->base,newzone->count,
                 z->base, z->count)) {
            printf("Zones overlap!\n");
            return -1;
        }
        if (z->base < newzone->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;
            if (config.init_addr)
                if (overlaps(addr,PFN2ADDR(confcount),
                         KA2PA(config.init_addr),
                         config.init_size))
                    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) {
        frame_mark_unavailable(ADDR2PFN(KA2PA(config.base)),
                       SIZE2FRAMES(config.kernel_size));
        if (config.init_size > 0)
            frame_mark_unavailable(ADDR2PFN(KA2PA(config.init_addr)),
                           SIZE2FRAMES(config.init_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 822	Rev 824
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		139
140	for (i=0; i < zones.count; i++) {	140	for (i=0; i < zones.count; i++) {
141	/* Check for overflow */	141	/* Check for overflow */
142	z = zones.info[zones.count];	142	z = zones.info[zones.count];
143	if (overlaps(newzone->base,newzone->count,	143	if (overlaps(newzone->base,newzone->count,
144	z->base, z->count)) {	144	z->base, z->count)) {
145	printf("Zones overlap!\n");	145	printf("Zones overlap!\n");
146	return -1;	146	return -1;
147	}	147	}
148	if (z->base < newzone->base)	148	if (z->base < newzone->base)
149	break;	149	break;
150	}	150	}
151	/* Move other zones up */	151	/* Move other zones up */
152	for (j=i;j < zones.count;j++)	152	for (j=i;j < zones.count;j++)
153	zones.info[j+1] = zones.info[j];	153	zones.info[j+1] = zones.info[j];
154		154
155	zones.info[i] = newzone;	155	zones.info[i] = newzone;
156	zones.count++;	156	zones.count++;
157		157
158	spinlock_unlock(&zones.lock);	158	spinlock_unlock(&zones.lock);
159	interrupts_restore(ipl);	159	interrupts_restore(ipl);
160		160
161	return i;	161	return i;
162	}	162	}
163		163
164	/**	164	/**
165	* Try to find a zone where can we find the frame	165	* Try to find a zone where can we find the frame
166	*	166	*
167	* @param hint Start searching in zone 'hint'	167	* @param hint Start searching in zone 'hint'
168	* @param lock Lock zone if true	168	* @param lock Lock zone if true
169	*	169	*
170	* Assume interrupts disable	170	* Assume interrupts disable
171	*/	171	*/
172	static zone_t * find_zone_and_lock(pfn_t frame, int *pzone)	172	static zone_t * find_zone_and_lock(pfn_t frame, int *pzone)
173	{	173	{
174	int i;	174	int i;
175	int hint = pzone ? *pzone : 0;	175	int hint = pzone ? *pzone : 0;
176	zone_t *z;	176	zone_t *z;
177		177
178	spinlock_lock(&zones.lock);	178	spinlock_lock(&zones.lock);
179		179
180	if (hint >= zones.count \|\| hint < 0)	180	if (hint >= zones.count \|\| hint < 0)
181	hint = 0;	181	hint = 0;
182		182
183	i = hint;	183	i = hint;
184	do {	184	do {
185	z = zones.info[i];	185	z = zones.info[i];
186	spinlock_lock(&z->lock);	186	spinlock_lock(&z->lock);
187	if (z->base <= frame && z->base + z->count > frame) {	187	if (z->base <= frame && z->base + z->count > frame) {
188	spinlock_unlock(&zones.lock); /* Unlock the global lock */	188	spinlock_unlock(&zones.lock); /* Unlock the global lock */
189	if (pzone)	189	if (pzone)
190	*pzone = i;	190	*pzone = i;
191	return z;	191	return z;
192	}	192	}
193	spinlock_unlock(&z->lock);	193	spinlock_unlock(&z->lock);
194		194
195	i++;	195	i++;
196	if (i >= zones.count)	196	if (i >= zones.count)
197	i = 0;	197	i = 0;
198	} while(i != hint);	198	} while(i != hint);
199		199
200	spinlock_unlock(&zones.lock);	200	spinlock_unlock(&zones.lock);
201	return NULL;	201	return NULL;
202	}	202	}
203		203
204	/** @return True if zone can allocate specified order */	204	/** @return True if zone can allocate specified order */
205	static int zone_can_alloc(zone_t *z, __u8 order)	205	static int zone_can_alloc(zone_t *z, __u8 order)
206	{	206	{
207	return buddy_system_can_alloc(z->buddy_system, order);	207	return buddy_system_can_alloc(z->buddy_system, order);
208	}	208	}
209		209
210	/**	210	/**
211	* Find AND LOCK zone that can allocate order frames	211	* Find AND LOCK zone that can allocate order frames
212	*	212	*
213	* Assume interrupts are disabled!!	213	* Assume interrupts are disabled!!
214	*	214	*
215	* @param pzone Pointer to preferred zone or NULL, on return contains zone number	215	* @param pzone Pointer to preferred zone or NULL, on return contains zone number
216	*/	216	*/
217	static zone_t * find_free_zone_lock(__u8 order, int *pzone)	217	static zone_t * find_free_zone_lock(__u8 order, int *pzone)
218	{	218	{
219	int i;	219	int i;
220	zone_t *z;	220	zone_t *z;
221	int hint = pzone ? *pzone : 0;	221	int hint = pzone ? *pzone : 0;
222		222
223	spinlock_lock(&zones.lock);	223	spinlock_lock(&zones.lock);
224	if (hint >= zones.count)	224	if (hint >= zones.count)
225	hint = 0;	225	hint = 0;
226	i = hint;	226	i = hint;
227	do {	227	do {
228	z = zones.info[i];	228	z = zones.info[i];
229		229
230	spinlock_lock(&z->lock);	230	spinlock_lock(&z->lock);
231		231
232	/* Check if the zone has 2^order frames area available */	232	/* Check if the zone has 2^order frames area available */
233	if (zone_can_alloc(z, order)) {	233	if (zone_can_alloc(z, order)) {
234	spinlock_unlock(&zones.lock);	234	spinlock_unlock(&zones.lock);
235	if (pzone)	235	if (pzone)
236	*pzone = i;	236	*pzone = i;
237	return z;	237	return z;
238	}	238	}
239	spinlock_unlock(&z->lock);	239	spinlock_unlock(&z->lock);
240	if (++i >= zones.count)	240	if (++i >= zones.count)
241	i = 0;	241	i = 0;
242	} while(i != hint);	242	} while(i != hint);
243	spinlock_unlock(&zones.lock);	243	spinlock_unlock(&zones.lock);
244	return NULL;	244	return NULL;
245	}	245	}
246		246
247	/********************************************/	247	/********************************************/
248	/* Buddy system functions */	248	/* Buddy system functions */
249		249
250	/** Buddy system find_block implementation	250	/** Buddy system find_block implementation
251	*	251	*
252	* Find block that is parent of current list.	252	* Find block that is parent of current list.
253	* That means go to lower addresses, until such block is found	253	* That means go to lower addresses, until such block is found
254	*	254	*
255	* @param order - Order of parent must be different then this parameter!!	255	* @param order - Order of parent must be different then this parameter!!
256	*/	256	*/
257	static link_t zone_buddy_find_block(buddy_system_t b, link_t *child,	257	static link_t zone_buddy_find_block(buddy_system_t b, link_t *child,
258	__u8 order)	258	__u8 order)
259	{	259	{
260	frame_t * frame;	260	frame_t * frame;
261	zone_t * zone;	261	zone_t * zone;
262	index_t index;	262	index_t index;
263		263
264	frame = list_get_instance(child, frame_t, buddy_link);	264	frame = list_get_instance(child, frame_t, buddy_link);
265	zone = (zone_t *) b->data;	265	zone = (zone_t *) b->data;
266		266
267	index = frame_index(zone, frame);	267	index = frame_index(zone, frame);
268	do {	268	do {
269	if (zone->frames[index].buddy_order != order) {	269	if (zone->frames[index].buddy_order != order) {
270	return &zone->frames[index].buddy_link;	270	return &zone->frames[index].buddy_link;
271	}	271	}
272	} while(index-- > 0);	272	} while(index-- > 0);
273	return NULL;	273	return NULL;
274	}	274	}
275		275
276	static void zone_buddy_print_id(buddy_system_t b, link_t block)	276	static void zone_buddy_print_id(buddy_system_t b, link_t block)
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(block, frame_t, buddy_link);	282	frame = list_get_instance(block, frame_t, buddy_link);
283	zone = (zone_t *) b->data;	283	zone = (zone_t *) b->data;
284	index = frame_index(zone, frame);	284	index = frame_index(zone, frame);
285	printf("%d", index);	285	printf("%d", index);
286	}	286	}
287		287
288	/** Buddy system find_buddy implementation	288	/** Buddy system find_buddy implementation
289	*	289	*
290	* @param b Buddy system.	290	* @param b Buddy system.
291	* @param block Block for which buddy should be found	291	* @param block Block for which buddy should be found
292	*	292	*
293	* @return Buddy for given block if found	293	* @return Buddy for given block if found
294	*/	294	*/
295	static link_t * zone_buddy_find_buddy(buddy_system_t b, link_t block)	295	static link_t * zone_buddy_find_buddy(buddy_system_t b, link_t block)
296	{	296	{
297	frame_t * frame;	297	frame_t * frame;
298	zone_t * zone;	298	zone_t * zone;
299	index_t index;	299	index_t index;
300	bool is_left, is_right;	300	bool is_left, is_right;
301		301
302	frame = list_get_instance(block, frame_t, buddy_link);	302	frame = list_get_instance(block, frame_t, buddy_link);
303	zone = (zone_t *) b->data;	303	zone = (zone_t *) b->data;
304	ASSERT(IS_BUDDY_ORDER_OK(frame_index_abs(zone, frame), frame->buddy_order));	304	ASSERT(IS_BUDDY_ORDER_OK(frame_index_abs(zone, frame), frame->buddy_order));
305		305
306	is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame);	306	is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame);
307	is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame);	307	is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame);
308		308
309	ASSERT(is_left ^ is_right);	309	ASSERT(is_left ^ is_right);
310	if (is_left) {	310	if (is_left) {
311	index = (frame_index(zone, frame)) + (1 << frame->buddy_order);	311	index = (frame_index(zone, frame)) + (1 << frame->buddy_order);
312	} else { // if (is_right)	312	} else { // if (is_right)
313	index = (frame_index(zone, frame)) - (1 << frame->buddy_order);	313	index = (frame_index(zone, frame)) - (1 << frame->buddy_order);
314	}	314	}
315		315
316		316
317	if (frame_index_valid(zone, index)) {	317	if (frame_index_valid(zone, index)) {
318	if (zone->frames[index].buddy_order == frame->buddy_order &&	318	if (zone->frames[index].buddy_order == frame->buddy_order &&
319	zone->frames[index].refcount == 0) {	319	zone->frames[index].refcount == 0) {
320	return &zone->frames[index].buddy_link;	320	return &zone->frames[index].buddy_link;
321	}	321	}
322	}	322	}
323		323
324	return NULL;	324	return NULL;
325	}	325	}
326		326
327	/** Buddy system bisect implementation	327	/** Buddy system bisect implementation
328	*	328	*
329	* @param b Buddy system.	329	* @param b Buddy system.
330	* @param block Block to bisect	330	* @param block Block to bisect
331	*	331	*
332	* @return right block	332	* @return right block
333	*/	333	*/
334	static link_t * zone_buddy_bisect(buddy_system_t b, link_t block) {	334	static link_t * zone_buddy_bisect(buddy_system_t b, link_t block) {
335	frame_t * frame_l, * frame_r;	335	frame_t * frame_l, * frame_r;
336		336
337	frame_l = list_get_instance(block, frame_t, buddy_link);	337	frame_l = list_get_instance(block, frame_t, buddy_link);
338	frame_r = (frame_l + (1 << (frame_l->buddy_order - 1)));	338	frame_r = (frame_l + (1 << (frame_l->buddy_order - 1)));
339		339
340	return &frame_r->buddy_link;	340	return &frame_r->buddy_link;
341	}	341	}
342		342
343	/** Buddy system coalesce implementation	343	/** Buddy system coalesce implementation
344	*	344	*
345	* @param b Buddy system.	345	* @param b Buddy system.
346	* @param block_1 First block	346	* @param block_1 First block
347	* @param block_2 First block's buddy	347	* @param block_2 First block's buddy
348	*	348	*
349	* @return Coalesced block (actually block that represents lower address)	349	* @return Coalesced block (actually block that represents lower address)
350	*/	350	*/
351	static link_t * zone_buddy_coalesce(buddy_system_t b, link_t block_1,	351	static link_t * zone_buddy_coalesce(buddy_system_t b, link_t block_1,
352	link_t * block_2)	352	link_t * block_2)
353	{	353	{
354	frame_t frame1, frame2;	354	frame_t frame1, frame2;
355		355
356	frame1 = list_get_instance(block_1, frame_t, buddy_link);	356	frame1 = list_get_instance(block_1, frame_t, buddy_link);
357	frame2 = list_get_instance(block_2, frame_t, buddy_link);	357	frame2 = list_get_instance(block_2, frame_t, buddy_link);
358		358
359	return frame1 < frame2 ? block_1 : block_2;	359	return frame1 < frame2 ? block_1 : block_2;
360	}	360	}
361		361
362	/** Buddy system set_order implementation	362	/** Buddy system set_order implementation
363	*	363	*
364	* @param b Buddy system.	364	* @param b Buddy system.
365	* @param block Buddy system block	365	* @param block Buddy system block
366	* @param order Order to set	366	* @param order Order to set
367	*/	367	*/
368	static void zone_buddy_set_order(buddy_system_t b, link_t block, __u8 order) {	368	static void zone_buddy_set_order(buddy_system_t b, link_t block, __u8 order) {
369	frame_t * frame;	369	frame_t * frame;
370	frame = list_get_instance(block, frame_t, buddy_link);	370	frame = list_get_instance(block, frame_t, buddy_link);
371	frame->buddy_order = order;	371	frame->buddy_order = order;
372	}	372	}
373		373
374	/** Buddy system get_order implementation	374	/** Buddy system get_order implementation
375	*	375	*
376	* @param b Buddy system.	376	* @param b Buddy system.
377	* @param block Buddy system block	377	* @param block Buddy system block
378	*	378	*
379	* @return Order of block	379	* @return Order of block
380	*/	380	*/
381	static __u8 zone_buddy_get_order(buddy_system_t b, link_t block) {	381	static __u8 zone_buddy_get_order(buddy_system_t b, link_t block) {
382	frame_t * frame;	382	frame_t * frame;
383	frame = list_get_instance(block, frame_t, buddy_link);	383	frame = list_get_instance(block, frame_t, buddy_link);
384	return frame->buddy_order;	384	return frame->buddy_order;
385	}	385	}
386		386
387	/** Buddy system mark_busy implementation	387	/** Buddy system mark_busy implementation
388	*	388	*
389	* @param b Buddy system	389	* @param b Buddy system
390	* @param block Buddy system block	390	* @param block Buddy system block
391	*	391	*
392	*/	392	*/
393	static void zone_buddy_mark_busy(buddy_system_t b, link_t block) {	393	static void zone_buddy_mark_busy(buddy_system_t b, link_t block) {
394	frame_t * frame;	394	frame_t * frame;
395		395
396	frame = list_get_instance(block, frame_t, buddy_link);	396	frame = list_get_instance(block, frame_t, buddy_link);
397	frame->refcount = 1;	397	frame->refcount = 1;
398	}	398	}
399		399
400	/** Buddy system mark_available implementation	400	/** Buddy system mark_available implementation
401	*	401	*
402	* @param b Buddy system	402	* @param b Buddy system
403	* @param block Buddy system block	403	* @param block Buddy system block
404	*	404	*
405	*/	405	*/
406	static void zone_buddy_mark_available(buddy_system_t b, link_t block) {	406	static void zone_buddy_mark_available(buddy_system_t b, link_t block) {
407	frame_t * frame;	407	frame_t * frame;
408	frame = list_get_instance(block, frame_t, buddy_link);	408	frame = list_get_instance(block, frame_t, buddy_link);
409	frame->refcount = 0;	409	frame->refcount = 0;
410	}	410	}
411		411
412	static struct buddy_system_operations zone_buddy_system_operations = {	412	static struct buddy_system_operations zone_buddy_system_operations = {
413	.find_buddy = zone_buddy_find_buddy,	413	.find_buddy = zone_buddy_find_buddy,
414	.bisect = zone_buddy_bisect,	414	.bisect = zone_buddy_bisect,
415	.coalesce = zone_buddy_coalesce,	415	.coalesce = zone_buddy_coalesce,
416	.set_order = zone_buddy_set_order,	416	.set_order = zone_buddy_set_order,
417	.get_order = zone_buddy_get_order,	417	.get_order = zone_buddy_get_order,
418	.mark_busy = zone_buddy_mark_busy,	418	.mark_busy = zone_buddy_mark_busy,
419	.mark_available = zone_buddy_mark_available,	419	.mark_available = zone_buddy_mark_available,
420	.find_block = zone_buddy_find_block,	420	.find_block = zone_buddy_find_block,
421	.print_id = zone_buddy_print_id	421	.print_id = zone_buddy_print_id
422	};	422	};
423		423
424	/*************************************/	424	/*************************************/
425	/* Zone functions */	425	/* Zone functions */
426		426
427	/** Allocate frame in particular zone	427	/** Allocate frame in particular zone
428	*	428	*
429	* Assume zone is locked	429	* Assume zone is locked
430	* Panics, if allocation is impossible.	430	* Panics, if allocation is impossible.
431	*	431	*
432	* @return Frame index in zone	432	* @return Frame index in zone
433	*/	433	*/
434	static pfn_t zone_frame_alloc(zone_t *zone,__u8 order)	434	static pfn_t zone_frame_alloc(zone_t *zone,__u8 order)
435	{	435	{
436	pfn_t v;	436	pfn_t v;
437	link_t *tmp;	437	link_t *tmp;
438	frame_t *frame;	438	frame_t *frame;
439		439
440	/* Allocate frames from zone buddy system */	440	/* Allocate frames from zone buddy system */
441	tmp = buddy_system_alloc(zone->buddy_system, order);	441	tmp = buddy_system_alloc(zone->buddy_system, order);
442		442
443	ASSERT(tmp);	443	ASSERT(tmp);
444		444
445	/* Update zone information. */	445	/* Update zone information. */
446	zone->free_count -= (1 << order);	446	zone->free_count -= (1 << order);
447	zone->busy_count += (1 << order);	447	zone->busy_count += (1 << order);
448		448
449	/* Frame will be actually a first frame of the block. */	449	/* Frame will be actually a first frame of the block. */
450	frame = list_get_instance(tmp, frame_t, buddy_link);	450	frame = list_get_instance(tmp, frame_t, buddy_link);
451		451
452	/* get frame address */	452	/* get frame address */
453	v = make_frame_index(zone, frame);	453	v = make_frame_index(zone, frame);
454	return v;	454	return v;
455	}	455	}
456		456
457	/** Free frame from zone	457	/** Free frame from zone
458	*	458	*
459	* Assume zone is locked	459	* Assume zone is locked
460	*/	460	*/
461	static void zone_frame_free(zone_t *zone, index_t frame_idx)	461	static void zone_frame_free(zone_t *zone, index_t frame_idx)
462	{	462	{
463	frame_t *frame;	463	frame_t *frame;
464	__u8 order;	464	__u8 order;
465		465
466	frame = &zone->frames[frame_idx];	466	frame = &zone->frames[frame_idx];
467		467
468	/* remember frame order */	468	/* remember frame order */
469	order = frame->buddy_order;	469	order = frame->buddy_order;
470		470
471	ASSERT(frame->refcount);	471	ASSERT(frame->refcount);
472		472
473	if (!--frame->refcount) {	473	if (!--frame->refcount) {
474	buddy_system_free(zone->buddy_system, &frame->buddy_link);	474	buddy_system_free(zone->buddy_system, &frame->buddy_link);
475	}	475	}
476		476
477	/* Update zone information. */	477	/* Update zone information. */
478	zone->free_count += (1 << order);	478	zone->free_count += (1 << order);
479	zone->busy_count -= (1 << order);	479	zone->busy_count -= (1 << order);
480	}	480	}
481		481
482	/** Return frame from zone */	482	/** Return frame from zone */
483	static frame_t * zone_get_frame(zone_t *zone, index_t frame_idx)	483	static frame_t * zone_get_frame(zone_t *zone, index_t frame_idx)
484	{	484	{
485	ASSERT(frame_idx < zone->count);	485	ASSERT(frame_idx < zone->count);
486	return &zone->frames[frame_idx];	486	return &zone->frames[frame_idx];
487	}	487	}
488		488
489	/** Mark frame in zone unavailable to allocation */	489	/** Mark frame in zone unavailable to allocation */
490	static void zone_mark_unavailable(zone_t *zone, index_t frame_idx)	490	static void zone_mark_unavailable(zone_t *zone, index_t frame_idx)
491	{	491	{
492	frame_t *frame;	492	frame_t *frame;
493	link_t *link;	493	link_t *link;
494		494
495	frame = zone_get_frame(zone, frame_idx);	495	frame = zone_get_frame(zone, frame_idx);
496	if (frame->refcount)	496	if (frame->refcount)
497	return;	497	return;
498	link = buddy_system_alloc_block(zone->buddy_system,	498	link = buddy_system_alloc_block(zone->buddy_system,
499	&frame->buddy_link);	499	&frame->buddy_link);
500	ASSERT(link);	500	ASSERT(link);

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/mm/frame.c @ 1757 – Rev 822 → 824