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


/*
 * Copyright (c) 2001-2005 Jakub Jermar
 * Copyright (c) 2005 Sergey Bondari
 * Copyright (c) 2009 Martin Decky
 * 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
 */
 
#include <arch/types.h>
#include <mm/frame.h>
#include <mm/as.h>
#include <panic.h>
#include <debug.h>
#include <adt/list.h>
 
#include <synch/mutex.h>
#include <synch/condvar.h>
#include <arch/asm.h>
#include <arch.h>
#include <print.h>
#include <align.h>
#include <mm/slab.h>
#include <bitops.h>
#include <macros.h>
#include <config.h>
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
zones_t zones;
 
/*
 * Synchronization primitives used to sleep when there is no memory
 * available.
 */
mutex_t mem_avail_mtx;
condvar_t mem_avail_cv;
count_t mem_avail_req = 0;  /**< Number of frames requested. */
count_t mem_avail_gen = 0;  /**< Generation counter. */
 
/********************/
/* 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 bool frame_index_valid(zone_t *zone, index_t index)
{
    return (index < zone->count);
}
 
static inline index_t make_frame_index(zone_t *zone, frame_t *frame)
{
    return (frame - zone->frames);
}
 
 
 
 
 
 
/** Initialize frame structure.
 *
 * @param frame Frame structure to be initialized.
 *
 */
static void frame_initialize(frame_t *frame)
{
    frame->refcount = 1;
    frame->buddy_order = 0;
}
 
/*******************/
/* Zones functions */
/*******************/
 
/** Insert-sort zone into zones list.
 *
 * Assume interrupts are disabled and zones lock is
 * locked.
 *
 * @param base  Base frame of the newly inserted zone.
 * @param count Number of frames of the newly inserted zone.
 *
 * @return Zone number on success, -1 on error.
 *
 */
static count_t zones_insert_zone(pfn_t base, count_t count)
{
    if (zones.count + 1 == ZONES_MAX) {
        printf("Maximum zone count %u exceeded!\n", ZONES_MAX);
        return (count_t) -1;
    }
   
    count_t i;
    for (i = 0; i < zones.count; i++) {
        /* Check for overlap */
        if (overlaps(base, count,
            zones.info[i].base, zones.info[i].count)) {
            printf("Zones overlap!\n");
            return (count_t) -1;
        }
        if (base < zones.info[i].base)
            break;
    }
   
    /* Move other zones up */
    count_t j;
    for (j = zones.count; j > i; j--) {
        zones.info[j] = zones.info[j - 1];
        zones.info[j].buddy_system->data =
            (void *) &zones.info[j - 1];
    }
   
    zones.count++;
   
    return i;
}
 
/** Get total available frames.
 *
 * Assume interrupts are disabled and zones lock is
 * locked.
 *
 * @return Total number of available frames.
 *
 */
static count_t total_frames_free(void)
{
    count_t total = 0;
    count_t i;
    for (i = 0; i < zones.count; i++)
        total += zones.info[i].free_count;
   
    return total;
}
 
/** Find a zone with a given frames.
 *
 * Assume interrupts are disabled and zones lock is
 * locked.
 *
 * @param frame Frame number contained in zone.
 * @param count Number of frames to look for.
 * @param hint  Used as zone hint.
 *
 * @return Zone index or -1 if not found.
 *
 */
count_t find_zone(pfn_t frame, count_t count, count_t hint)
{
    if (hint >= zones.count)
        hint = 0;
   
    count_t i = hint;
    do {
        if ((zones.info[i].base <= frame)
            && (zones.info[i].base + zones.info[i].count >= frame + count))
            return i;
       
        i++;
        if (i >= zones.count)
            i = 0;
    } while (i != hint);
   
    return (count_t) -1;
}
 
/** @return True if zone can allocate specified order */
static bool zone_can_alloc(zone_t *zone, uint8_t order)
{
    return (zone_flags_available(zone->flags)
        && buddy_system_can_alloc(zone->buddy_system, order));
}
 
/** Find a zone that can allocate order frames.
 *
 * Assume interrupts are disabled and zones lock is
 * locked.
 *
 * @param order Size (2^order) of free space we are trying to find.
 * @param flags Required flags of the target zone.
 * @param hind  Preferred zone.
 *
 */
static count_t find_free_zone(uint8_t order, zone_flags_t flags, count_t hint)
{
    if (hint >= zones.count)
        hint = 0;
   
    count_t i = hint;
    do {
        /*
         * Check whether the zone meets the search criteria.
         */
        if ((zones.info[i].flags & flags) == flags) {
            /*
             * Check if the zone has 2^order frames area available.
             */
            if (zone_can_alloc(&zones.info[i], order))
                return i;
        }
       
        i++;
        if (i >= zones.count)
            i = 0;
    } while (i != hint);
   
    return (count_t) -1;
}
 
/**************************/
/* 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 *buddy, link_t *child,
    uint8_t order)
{
    frame_t *frame = list_get_instance(child, frame_t, buddy_link);
    zone_t *zone = (zone_t *) buddy->data;
   
    index_t index = frame_index(zone, frame);
    do {
        if (zone->frames[index].buddy_order != order)
            return &zone->frames[index].buddy_link;
    } while (index-- > 0);
   
    return NULL;
}
 
/** Buddy system find_buddy implementation.
 *
 * @param buddy 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 *buddy, link_t *block)
{
    frame_t *frame = list_get_instance(block, frame_t, buddy_link);
    zone_t *zone = (zone_t *) buddy->data;
    ASSERT(IS_BUDDY_ORDER_OK(frame_index_abs(zone, frame),
        frame->buddy_order));
   
    bool is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame);
    bool is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame);
   
    ASSERT(is_left ^ is_right);
   
    index_t index;
    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 buddy Buddy system.
 * @param block Block to bisect.
 *
 * @return Right block.
 *
 */
static link_t *zone_buddy_bisect(buddy_system_t *buddy, link_t *block)
{
    frame_t *frame_l = list_get_instance(block, frame_t, buddy_link);
    frame_t *frame_r = (frame_l + (1 << (frame_l->buddy_order - 1)));
   
    return &frame_r->buddy_link;
}
 
/** Buddy system coalesce implementation.
 *
 * @param buddy   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 *buddy, link_t *block_1,
    link_t *block_2)
{
    frame_t *frame1 = list_get_instance(block_1, frame_t, buddy_link);
    frame_t *frame2 = list_get_instance(block_2, frame_t, buddy_link);
   
    return ((frame1 < frame2) ? block_1 : block_2);
}
 
/** Buddy system set_order implementation.
 *
 * @param buddy Buddy system.
 * @param block Buddy system block.
 * @param order Order to set.
 *
 */
static void zone_buddy_set_order(buddy_system_t *buddy, link_t *block,
    uint8_t order)
{
    list_get_instance(block, frame_t, buddy_link)->buddy_order = order;
}
 
/** Buddy system get_order implementation.
 *
 * @param buddy Buddy system.
 * @param block Buddy system block.
 *
 * @return Order of block.
 *
 */
static uint8_t zone_buddy_get_order(buddy_system_t *buddy, link_t *block)
{
    return list_get_instance(block, frame_t, buddy_link)->buddy_order;
}
 
/** Buddy system mark_busy implementation.
 *
 * @param buddy Buddy system.
 * @param block Buddy system block.
 *
 */
static void zone_buddy_mark_busy(buddy_system_t *buddy, link_t * block)
{
    list_get_instance(block, frame_t, buddy_link)->refcount = 1;
}
 
/** Buddy system mark_available implementation.
 *
 * @param buddy Buddy system.
 * @param block Buddy system block.
 */
static void zone_buddy_mark_available(buddy_system_t *buddy, link_t *block)
{
    list_get_instance(block, frame_t, buddy_link)->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
};
 
/******************/
/* Zone functions */
/******************/
 
/** Allocate frame in particular zone.
 *
 * Assume zone is locked and is available for allocation.
 * 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)
{
    ASSERT(zone_flags_available(zone->flags));
   
    /* Allocate frames from zone buddy system */
    link_t *link = buddy_system_alloc(zone->buddy_system, order);
   
    ASSERT(link);
   
    /* Update zone information. */
    zone->free_count -= (1 << order);
    zone->busy_count += (1 << order);
   
    /* Frame will be actually a first frame of the block. */
    frame_t *frame = list_get_instance(link, frame_t, buddy_link);
   
    /* Get frame address */
    return make_frame_index(zone, frame);
}
 
/** Free frame from zone.
 *
 * Assume zone is locked and is available for deallocation.
 *
 * @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)
{
    ASSERT(zone_flags_available(zone->flags));
   
    frame_t *frame = &zone->frames[frame_idx];
   
    /* Remember frame order */
    uint8_t 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)
{
    ASSERT(zone_flags_available(zone->flags));
   
    frame_t *frame = zone_get_frame(zone, frame_idx);
    if (frame->refcount)
        return;
   
    link_t *link = buddy_system_alloc_block(zone->buddy_system,
        &frame->buddy_link);
   
    ASSERT(link);
    zone->free_count--;
}
 
/** Merge two zones.
 *
 * Expect buddy to point to space at least zone_conf_size large.
 * Assume z1 & z2 are locked and compatible and zones lock is
 * locked.
 *
 * @param z1     First zone to merge.
 * @param z2     Second zone to merge.
 * @param old_z1 Original date of the first zone.
 * @param buddy  Merged zone buddy.
 *
 */
static void zone_merge_internal(count_t z1, count_t z2, zone_t *old_z1, buddy_system_t *buddy)
{
    ASSERT(zone_flags_available(zones.info[z1].flags));
    ASSERT(zone_flags_available(zones.info[z2].flags));
    ASSERT(zones.info[z1].flags == zones.info[z2].flags);
    ASSERT(zones.info[z1].base < zones.info[z2].base);
    ASSERT(!overlaps(zones.info[z1].base, zones.info[z1].count,
        zones.info[z2].base, zones.info[z2].count));
   
    /* Difference between zone bases */
    pfn_t base_diff = zones.info[z2].base - zones.info[z1].base;
   
    zones.info[z1].count = base_diff + zones.info[z2].count;
    zones.info[z1].free_count += zones.info[z2].free_count;
    zones.info[z1].busy_count += zones.info[z2].busy_count;
    zones.info[z1].buddy_system = buddy;
   
    uint8_t order = fnzb(zones.info[z1].count);
    buddy_system_create(zones.info[z1].buddy_system, order,
        &zone_buddy_system_operations, (void *) &zones.info[z1]);
   
    zones.info[z1].frames =
        (frame_t *) ((uint8_t *) zones.info[z1].buddy_system
        + buddy_conf_size(order));
   
    /* This marks all frames busy */
    count_t i;
    for (i = 0; i < zones.info[z1].count; i++)
        frame_initialize(&zones.info[z1].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, clearing
     * 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 < old_z1->count; i++)
        zones.info[z1].frames[i] = old_z1->frames[i];
   
    for (i = 0; i < zones.info[z2].count; i++)
        zones.info[z1].frames[base_diff + i]
            = zones.info[z2].frames[i];
   
    i = 0;
    while (i < zones.info[z1].count) {
        if (zones.info[z1].frames[i].refcount) {
            /* Skip busy frames */
            i += 1 << zones.info[z1].frames[i].buddy_order;
        } else {
            /* Free frames, set refcount = 1
             * (all free frames have refcount == 0, we need not
             * to check the order)
             */
            zones.info[z1].frames[i].refcount = 1;
            zones.info[z1].frames[i].buddy_order = 0;
            i++;
        }
    }
   
    /* Add free blocks from the original zone z1 */
    while (zone_can_alloc(old_z1, 0)) {
        /* Allocate from the original zone */
        pfn_t frame_idx = zone_frame_alloc(old_z1, 0);
       
        /* Free the frame from the merged zone */
        frame_t *frame = &zones.info[z1].frames[frame_idx];
        frame->refcount = 0;
        buddy_system_free(zones.info[z1].buddy_system, &frame->buddy_link);
    }
   
    /* Add free blocks from the original zone z2 */
    while (zone_can_alloc(&zones.info[z2], 0)) {
        /* Allocate from the original zone */
        pfn_t frame_idx = zone_frame_alloc(&zones.info[z2], 0);
       
        /* Free the frame from the merged zone */
        frame_t *frame = &zones.info[z1].frames[base_diff + frame_idx];
        frame->refcount = 0;
        buddy_system_free(zones.info[z1].buddy_system, &frame->buddy_link);
    }
}
 
/** Return old configuration frames into the zone.
 *
 * We have two cases:
 * - The configuration data is outside the zone
 *   -> do nothing (perhaps call frame_free?)
 * - The configuration data was created by zone_create
 *   or updated by reduce_region -> free every frame
 *
 * @param znum  The actual zone where freeing should occur.
 * @param pfn   Old zone configuration frame.
 * @param count Old zone frame count.
 *
 */
static void return_config_frames(count_t znum, pfn_t pfn, count_t count)
{
    ASSERT(zone_flags_available(zones.info[znum].flags));
   
    count_t cframes = SIZE2FRAMES(zone_conf_size(count));
   
    if ((pfn < zones.info[znum].base)
        || (pfn >= zones.info[znum].base + zones.info[znum].count))
        return;
   
    frame_t *frame
        = &zones.info[znum].frames[pfn - zones.info[znum].base];
    ASSERT(!frame->buddy_order);
   
    count_t i;
    for (i = 0; i < cframes; i++) {
        zones.info[znum].busy_count++;
        zone_frame_free(&zones.info[znum],
            pfn - zones.info[znum].base + i);
    }
}
 
/** Reduce allocated block to count of order 0 frames.
 *
 * The allocated block needs 2^order frames. Reduce all frames
 * in the 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 znum      Zone.
 * @param frame_idx Index the first frame of the block.
 * @param count     Allocated frames in block.
 *
 */
static void zone_reduce_region(count_t znum, pfn_t frame_idx, count_t count)
{
    ASSERT(zone_flags_available(zones.info[znum].flags));
    ASSERT(frame_idx + count < zones.info[znum].count);
   
    uint8_t order = zones.info[znum].frames[frame_idx].buddy_order;
    ASSERT((count_t) (1 << order) >= count);
   
    /* Reduce all blocks to order 0 */
    count_t i;
    for (i = 0; i < (count_t) (1 << order); i++) {
        frame_t *frame = &zones.info[znum].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(&zones.info[znum], i + frame_idx);
}
 
/** Merge zones z1 and z2.
 *
 * The merged zones must be 2 zones with no zone existing in between
 * (which means that z2 = z1 + 1). Both zones must be available zones
 * with the same flags.
 *
 * 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 :-/
 *
 * The function uses
 *
 */
bool zone_merge(count_t z1, count_t z2)
{
    ipl_t ipl = interrupts_disable();
    spinlock_lock(&zones.lock);
   
    bool ret = true;
   
    /* We can join only 2 zones with none existing inbetween,
     * the zones have to be available and with the same
     * set of flags
     */
    if ((z1 >= zones.count) || (z2 >= zones.count)
        || (z2 - z1 != 1)
        || (!zone_flags_available(zones.info[z1].flags))
        || (!zone_flags_available(zones.info[z2].flags))
        || (zones.info[z1].flags != zones.info[z2].flags)) {
        ret = false;
        goto errout;
    }
   
    pfn_t cframes = SIZE2FRAMES(zone_conf_size(
        zones.info[z2].base - zones.info[z1].base
        + zones.info[z2].count));
   
    uint8_t order;
    if (cframes == 1)
        order = 0;
    else
        order = fnzb(cframes - 1) + 1;
   
    /* Allocate merged zone data inside one of the zones */
    pfn_t pfn;
    if (zone_can_alloc(&zones.info[z1], order)) {
        pfn = zones.info[z1].base + zone_frame_alloc(&zones.info[z1], order);
    } else if (zone_can_alloc(&zones.info[z2], order)) {
        pfn = zones.info[z2].base + zone_frame_alloc(&zones.info[z2], order);
    } else {
        ret = false;
        goto errout;
    }
   
    /* Preserve original data from z1 */
    zone_t old_z1 = zones.info[z1];
    old_z1.buddy_system->data = (void *) &old_z1;
   
    /* Do zone merging */
    buddy_system_t *buddy = (buddy_system_t *) PA2KA(PFN2ADDR(pfn));
    zone_merge_internal(z1, z2, &old_z1, buddy);
   
    /* Free unneeded config frames */
    zone_reduce_region(z1, pfn - zones.info[z1].base, cframes);
   
    /* Subtract zone information from busy frames */
    zones.info[z1].busy_count -= cframes;
   
    /* Free old zone information */
    return_config_frames(z1,
        ADDR2PFN(KA2PA((uintptr_t) old_z1.frames)), old_z1.count);
    return_config_frames(z1,
        ADDR2PFN(KA2PA((uintptr_t) zones.info[z2].frames)),
        zones.info[z2].count);
   
    /* Move zones down */
    count_t i;
    for (i = z2 + 1; i < zones.count; i++) {
        zones.info[i - 1] = zones.info[i];
        zones.info[i - 1].buddy_system->data =
            (void *) &zones.info[i - 1];
    }
   
    zones.count--;
   
errout:
    spinlock_unlock(&zones.lock);
    interrupts_restore(ipl);
   
    return ret;
}
 
/** Merge all mergeable zones into one big zone.
 *
 * It is reasonable to do this on systems where
 * BIOS reports parts in chunks, so that we could
 * have 1 zone (it's faster).
 *
 */
void zone_merge_all(void)
{
    count_t i = 0;
    while (i < zones.count) {
        if (!zone_merge(i, i + 1))
            i++;
    }
}
 
/** Create new frame zone.
 *
 * @param zone  Zone to construct.
 * @param buddy Address of buddy system configuration information.
 * @param start Physical address of the first frame within the zone.
 * @param count Count of frames in zone.
 * @param flags Zone flags.
 *
 * @return Initialized zone.
 *
 */
static void zone_construct(zone_t *zone, buddy_system_t *buddy, pfn_t start, count_t count, zone_flags_t flags)
{
    zone->base = start;
    zone->count = count;
    zone->flags = flags;
    zone->free_count = count;
    zone->busy_count = 0;
    zone->buddy_system = buddy;
   
    if (zone_flags_available(flags)) {
        /*
         * Compute order for buddy system and initialize
         */
        uint8_t order = fnzb(count);
        buddy_system_create(zone->buddy_system, order,
            &zone_buddy_system_operations, (void *) zone);
       
        /* Allocate frames _after_ the confframe */
       
        /* Check sizes */
        zone->frames = (frame_t *) ((uint8_t *) zone->buddy_system +
            buddy_conf_size(order));
       
        count_t i;
        for (i = 0; i < count; i++)
            frame_initialize(&zone->frames[i]);
       
        /* Stuffing frames */
        for (i = 0; i < count; i++) {
            zone->frames[i].refcount = 0;
            buddy_system_free(zone->buddy_system, &zone->frames[i].buddy_link);
        }
    } else
        zone->frames = NULL;
}
 
/** 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)
{
    return (count * sizeof(frame_t) + buddy_conf_size(fnzb(count)));
}
 
/** 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.
 *
 */
count_t zone_create(pfn_t start, count_t count, pfn_t confframe, zone_flags_t flags)
{
    ipl_t ipl = interrupts_disable();
    spinlock_lock(&zones.lock);
   
    if (zone_flags_available(flags)) {  /* Create available zone */
        /* Theoretically we could have NULL here, practically make sure
         * nobody tries to do that. If some platform requires, remove
         * the assert
         */
        ASSERT(confframe != NULL);
       
        /* If confframe is supposed to be inside our zone, then make sure
         * it does not span kernel & init
         */
        count_t confcount = SIZE2FRAMES(zone_conf_size(count));
        if ((confframe >= start) && (confframe < start + count)) {
            for (; confframe < start + count; confframe++) {
                uintptr_t 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.");
        }
       
        count_t znum = zones_insert_zone(start, count);
        if (znum == (count_t) -1) {
            spinlock_unlock(&zones.lock);
            interrupts_restore(ipl);
            return (count_t) -1;
        }
       
        buddy_system_t *buddy = (buddy_system_t *) PA2KA(PFN2ADDR(confframe));
        zone_construct(&zones.info[znum], buddy, start, count, flags);
       
        /* If confdata in zone, mark as unavailable */
        if ((confframe >= start) && (confframe < start + count)) {
            count_t i;
            for (i = confframe; i < confframe + confcount; i++)
                zone_mark_unavailable(&zones.info[znum],
                    i - zones.info[znum].base);
        }
       
        spinlock_unlock(&zones.lock);
        interrupts_restore(ipl);
       
        return znum;
    }
   
    /* Non-available zone */
    count_t znum = zones_insert_zone(start, count);
    if (znum == (count_t) -1) {
        spinlock_unlock(&zones.lock);
        interrupts_restore(ipl);
        return (count_t) -1;
    }
    zone_construct(&zones.info[znum], NULL, start, count, flags);
   
    spinlock_unlock(&zones.lock);
    interrupts_restore(ipl);
   
    return znum;
}
 
/*******************/
/* Frame functions */
/*******************/
 
/** Set parent of frame. */
void frame_set_parent(pfn_t pfn, void *data, count_t hint)
{
    ipl_t ipl = interrupts_disable();
    spinlock_lock(&zones.lock);
   
    count_t znum = find_zone(pfn, 1, hint);
   
    ASSERT(znum != (count_t) -1);
   
    zone_get_frame(&zones.info[znum],
        pfn - zones.info[znum].base)->parent = data;
   
    spinlock_unlock(&zones.lock);
    interrupts_restore(ipl);
}
 
void *frame_get_parent(pfn_t pfn, count_t hint)
{
    ipl_t ipl = interrupts_disable();
    spinlock_lock(&zones.lock);
   
    count_t znum = find_zone(pfn, 1, hint);
   
    ASSERT(znum != (count_t) -1);
   
    void *res = zone_get_frame(&zones.info[znum],
        pfn - zones.info[znum].base)->parent;
   
    spinlock_unlock(&zones.lock);
    interrupts_restore(ipl);
   
    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, frame_flags_t flags, count_t *pzone)
{
    count_t size = ((count_t) 1) << order;
    ipl_t ipl;
    count_t hint = pzone ? (*pzone) : 0;
   
loop:
    ipl = interrupts_disable();
    spinlock_lock(&zones.lock);
   
    /*
     * First, find suitable frame zone.
     */
    count_t znum = find_free_zone(order,
        FRAME_TO_ZONE_FLAGS(flags), hint);
   
    /* If no memory, reclaim some slab memory,
       if it does not help, reclaim all */
    if ((znum == (count_t) -1) && (!(flags & FRAME_NO_RECLAIM))) {
        count_t freed = slab_reclaim(0);
       
        if (freed > 0)
            znum = find_free_zone(order,
                FRAME_TO_ZONE_FLAGS(flags), hint);
       
        if (znum == (count_t) -1) {
            freed = slab_reclaim(SLAB_RECLAIM_ALL);
            if (freed > 0)
                znum = find_free_zone(order,
                    FRAME_TO_ZONE_FLAGS(flags), hint);
        }
    }
   
    if (znum == (count_t) -1) {
        if (flags & FRAME_ATOMIC) {
            spinlock_unlock(&zones.lock);
            interrupts_restore(ipl);
            return NULL;
        }
       
#ifdef CONFIG_DEBUG
        count_t avail = total_frames_free();
#endif
       
        spinlock_unlock(&zones.lock);
        interrupts_restore(ipl);
       
        /*
         * Sleep until some frames are available again.
         */
       
#ifdef CONFIG_DEBUG
        printf("Thread %" PRIu64 " waiting for %" PRIc " frames, "
            "%" PRIc " available.\n", THREAD->tid, size, avail);
#endif
       
        mutex_lock(&mem_avail_mtx);
       
        if (mem_avail_req > 0)
            mem_avail_req = min(mem_avail_req, size);
        else
            mem_avail_req = size;
        count_t gen = mem_avail_gen;
       
        while (gen == mem_avail_gen)
            condvar_wait(&mem_avail_cv, &mem_avail_mtx);
       
        mutex_unlock(&mem_avail_mtx);
       
#ifdef CONFIG_DEBUG
        printf("Thread %" PRIu64 " woken up.\n", THREAD->tid);
#endif
       
        goto loop;
    }
   
    pfn_t pfn = zone_frame_alloc(&zones.info[znum], order)
        + zones.info[znum].base;
   
    spinlock_unlock(&zones.lock);
    interrupts_restore(ipl);
   
    if (pzone)
        *pzone = znum;
   
    if (flags & FRAME_KA)
        return (void *) PA2KA(PFN2ADDR(pfn));
   
    return (void *) PFN2ADDR(pfn);
}
 
/** 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 = interrupts_disable();
    spinlock_lock(&zones.lock);
   
    /*
     * First, find host frame zone for addr.
     */
    pfn_t pfn = ADDR2PFN(frame);
    count_t znum = find_zone(pfn, 1, NULL);
   
    ASSERT(znum != (count_t) -1);
   
    zone_frame_free(&zones.info[znum], pfn - zones.info[znum].base);
   
    spinlock_unlock(&zones.lock);
    interrupts_restore(ipl);
   
    /*
     * Signal that some memory has been freed.
     */
    mutex_lock(&mem_avail_mtx);
    if (mem_avail_req > 0)
        mem_avail_req--;
   
    if (mem_avail_req == 0) {
        mem_avail_gen++;
        condvar_broadcast(&mem_avail_cv);
    }
    mutex_unlock(&mem_avail_mtx);
}
 
/** 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 = interrupts_disable();
    spinlock_lock(&zones.lock);
   
    /*
     * First, find host frame zone for addr.
     */
    count_t znum = find_zone(pfn, 1, NULL);
   
    ASSERT(znum != (count_t) -1);
   
    zones.info[znum].frames[pfn - zones.info[znum].base].refcount++;
   
    spinlock_unlock(&zones.lock);
    interrupts_restore(ipl);
}
 
/** Mark given range unavailable in frame zones. */
void frame_mark_unavailable(pfn_t start, count_t count)
{
    ipl_t ipl = interrupts_disable();
    spinlock_lock(&zones.lock);
   
    count_t i;
    for (i = 0; i < count; i++) {
        count_t znum = find_zone(start + i, 1, 0);
        if (znum == (count_t) -1)  /* PFN not found */
            continue;
       
        zone_mark_unavailable(&zones.info[znum],
            start + i - zones.info[znum].base);
    }
   
    spinlock_unlock(&zones.lock);
    interrupts_restore(ipl);
}
 
/** Initialize physical memory management. */
void frame_init(void)
{
    if (config.cpu_active == 1) {
        zones.count = 0;
        spinlock_initialize(&zones.lock, "zones.lock");
        mutex_initialize(&mem_avail_mtx, MUTEX_ACTIVE);
        condvar_initialize(&mem_avail_cv);
    }
   
    /* 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)
{
    ipl_t ipl = interrupts_disable();
    spinlock_lock(&zones.lock);
   
    uint64_t total = 0;
    count_t i;
    for (i = 0; i < zones.count; i++)
        total += (uint64_t) FRAMES2SIZE(zones.info[i].count);
   
    spinlock_unlock(&zones.lock);
    interrupts_restore(ipl);
   
    return total;
}
 
/** Prints list of zones. */
void zone_print_list(void)
{
#ifdef __32_BITS__
    printf("#  base address frames       flags    free frames  busy frames\n");
    printf("-- ------------ ------------ -------- ------------ ------------\n");
#endif
 
#ifdef __64_BITS__
    printf("#  base address          frames      flags    free frames  busy frames\n");
    printf("-- -------------------- ------------ -------- ------------ ------------\n");
#endif
   
    /*
     * Because printing may require allocation of memory, we may not hold
     * the frame allocator locks when printing zone statistics.  Therefore,
     * we simply gather the statistics under the protection of the locks and
     * print the statistics when the locks have been released.
     *
     * When someone adds/removes zones while we are printing the statistics,
     * we may end up with inaccurate output (e.g. a zone being skipped from
     * the listing).
     */
   
    count_t i;
    for (i = 0;; i++) {
        ipl_t ipl = interrupts_disable();
        spinlock_lock(&zones.lock);
       
        if (i >= zones.count) {
            spinlock_unlock(&zones.lock);
            interrupts_restore(ipl);
            break;
        }
       
        uintptr_t base = PFN2ADDR(zones.info[i].base);
        count_t count = zones.info[i].count;
        zone_flags_t flags = zones.info[i].flags;
        count_t free_count = zones.info[i].free_count;
        count_t busy_count = zones.info[i].busy_count;
       
        spinlock_unlock(&zones.lock);
        interrupts_restore(ipl);
       
        bool available = zone_flags_available(flags);
       
        printf("%-2" PRIc, i);
       
#ifdef __32_BITS__
        printf("   %10p", base);
 
 
 
#endif
       
#ifdef __64_BITS__
        printf("   %18p", base);
#endif
       
        printf(" %12" PRIc " %c%c%c      ", count,
            available ? 'A' : ' ',
            (flags & ZONE_RESERVED) ? 'R' : ' ',
            (flags & ZONE_FIRMWARE) ? 'F' : ' ');
 
       
        if (available)
            printf("%12" PRIc " %12" PRIc,
                free_count, busy_count);
       
        printf("\n");
    }
}
 
/** Prints zone details.
 *
 * @param num Zone base address or zone number.
 *
 */
void zone_print_one(count_t num)
{
    ipl_t ipl = interrupts_disable();
    spinlock_lock(&zones.lock);
    count_t znum = (count_t) -1;
   
    count_t i;
    for (i = 0; i < zones.count; i++) {
        if ((i == num) || (PFN2ADDR(zones.info[i].base) == num)) {
            znum = i;
            break;
        }
    }
   
    if (znum == (count_t) -1) {
        spinlock_unlock(&zones.lock);
        interrupts_restore(ipl);
        printf("Zone not found.\n");
        return;
    }
   
    uintptr_t base = PFN2ADDR(zones.info[i].base);
    zone_flags_t flags = zones.info[i].flags;
    count_t count = zones.info[i].count;
    count_t free_count = zones.info[i].free_count;
    count_t busy_count = zones.info[i].busy_count;
   
    spinlock_unlock(&zones.lock);
    interrupts_restore(ipl);
   
    bool available = zone_flags_available(flags);
   
    printf("Zone number:       %" PRIc "\n", znum);
    printf("Zone base address: %p\n", base);
    printf("Zone size:         %" PRIc " frames (%" PRIs " KiB)\n", count,
        SIZE2KB(FRAMES2SIZE(count)));
    printf("Zone flags:        %c%c%c\n",
        available ? 'A' : ' ',
        (flags & ZONE_RESERVED) ? 'R' : ' ',
        (flags & ZONE_FIRMWARE) ? 'F' : ' ');
   
    if (available) {
        printf("Allocated space:   %" PRIc " frames (%" PRIs " KiB)\n",
            busy_count, SIZE2KB(FRAMES2SIZE(busy_count)));
        printf("Available space:   %" PRIc " frames (%" PRIs " KiB)\n",
            free_count, SIZE2KB(FRAMES2SIZE(free_count)));
    }
}
 
/** @}
 */
 

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

Subversion Repositories HelenOS

(root)/trunk/kernel/generic/src/mm/frame.c @ 3229 – Rev 3972 → 3973