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


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

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

Subversion Repositories HelenOS

(root)/trunk/kernel/generic/src/mm/frame.c @ 2745 – Rev 2712 → 2725