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


/*
 * Copyright (C) 2001-2005 Jakub Jermar
 * Copyright (C) 2005 Sergey Bondari
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
#include <typedefs.h>
#include <arch/types.h>
#include <mm/heap.h>
#include <mm/frame.h>
#include <mm/as.h>
#include <panic.h>
#include <debug.h>
#include <list.h>
#include <synch/spinlock.h>
#include <arch/asm.h>
#include <arch.h>
#include <print.h>
#include <align.h>
 
SPINLOCK_INITIALIZE(zone_head_lock);    /**< this lock protects zone_head list */
LIST_INITIALIZE(zone_head);             /**< list of all zones in the system */
 
/** Blacklist containing non-available areas of memory.
 *
 * This blacklist is used to exclude frames that cannot be allocated
 * (e.g. kernel memory) from available memory map.
 */
region_t zone_blacklist[ZONE_BLACKLIST_SIZE];
count_t zone_blacklist_count = 0;
 
static struct buddy_system_operations  zone_buddy_system_operations = {
    .find_buddy = zone_buddy_find_buddy,
    .bisect = zone_buddy_bisect,
    .coalesce = zone_buddy_coalesce,
    .set_order = zone_buddy_set_order,
    .get_order = zone_buddy_get_order,
    .mark_busy = zone_buddy_mark_busy,
};
 
/** Initialize physical memory management
 *
 * Initialize physical memory managemnt.
 */
void frame_init(void)
{
    if (config.cpu_active == 1) {
        frame_region_not_free(KA2PA(config.base), config.kernel_size);
        if (config.init_size > 0)
            frame_region_not_free(KA2PA(config.init_addr), config.init_size);
    }
 
    frame_arch_init();
}
 
/**
 * Find AND LOCK zone that can allocate order frames
 *
 * Assume zone_head_lock is locked.
 */
static zone_t * find_free_zone(__u8 order)
{
    link_t *cur;
    zone_t *z;
 
    for (cur = zone_head.next; cur != &zone_head;cur = cur->next) {
        z = list_get_instance(cur, zone_t, link);
       
        spinlock_lock(&z->lock);
       
        /* Check if the zone has 2^order frames area available  */
        if (buddy_system_can_alloc(z->buddy_system, order))
            return z;
       
        spinlock_unlock(&z->lock);
    }
    return NULL;
}
 
/** Allocate power-of-two frames of physical memory.
 *
 * @param flags Flags for host zone selection and address processing.
 * @param order Allocate exactly 2^order frames.
 * @param pzone Pointer to preferred zone pointer, on output it changes
 *              to the zone that the frame was really allocated to
 *
 * @return Allocated frame.
 */
__address frame_alloc(int flags, __u8 order, int * status, zone_t **pzone)
{
    ipl_t ipl;
    link_t *tmp;
    zone_t *zone = NULL;
    frame_t *frame = NULL;
    int freed;
    __address v;
   
loop:
    ipl = interrupts_disable();
    spinlock_lock(&zone_head_lock);
 
    /*
     * First, find suitable frame zone.
     */
    if (pzone && *pzone) {
        spinlock_lock(&(*pzone)->lock);
        if (!buddy_system_can_alloc((*pzone)->buddy_system, order))
            spinlock_unlock(&(*pzone)->lock);
        else
            zone = *pzone;
    }
    if (!zone) {
        zone = find_free_zone(order);
        /* If no memory, reclaim some slab memory,
           if it does not help, reclaim all */
        if (!zone && !(flags & FRAME_NO_RECLAIM)) {
            spinlock_unlock(&zone_head_lock);
            freed = slab_reclaim(0);
            spinlock_lock(&zone_head_lock);
            if (freed)
                zone = find_free_zone(order);
            if (!zone) {
                spinlock_unlock(&zone_head_lock);
                freed = slab_reclaim(SLAB_RECLAIM_ALL);
                spinlock_lock(&zone_head_lock);
                if (freed)
                    zone = find_free_zone(order);
            }
        }
    }
 
    if (!zone) {
        if (flags & FRAME_PANIC)
            panic("Can't allocate frame.\n");
       
        /*
         * TODO: Sleep until frames are available again.
         */
        spinlock_unlock(&zone_head_lock);
        interrupts_restore(ipl);
 
        if (flags & FRAME_ATOMIC) {
            ASSERT(status != NULL);
            *status = FRAME_NO_MEMORY;
            return NULL;
        }
       
        panic("Sleep not implemented.\n");
        goto loop;
    }
       
    /* 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 = FRAME2ADDR(zone, frame);
 
    spinlock_unlock(&zone->lock);
    spinlock_unlock(&zone_head_lock);
    interrupts_restore(ipl);
 
    ASSERT(v == ALIGN_UP(v, FRAME_SIZE << order));
 
    if (flags & FRAME_KA)
        v = PA2KA(v);
   
    if (status)
        *status = FRAME_OK;
 
    if (pzone)
        *pzone = zone;
    return v;
}
 
/** Convert address to zone pointer
 *
 * Assume zone_head_lock is held
 *
 * @param addr Physical address
 * @param lock If true, lock the zone
 */
static zone_t * addr2zone(__address addr, int lock)
{
    link_t *cur;
    zone_t *z = NULL;
 
    for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {
        z = list_get_instance(cur, zone_t, link);
       
        spinlock_lock(&z->lock);
       
        /*
         * Check if addr belongs to z.
         */
        if ((addr >= z->base) && (addr <= z->base + (z->free_count + z->busy_count) * FRAME_SIZE)) {
            if (!lock)
                spinlock_unlock(&z->lock);
            return z;
        }
 
        spinlock_unlock(&z->lock);
    }
 
    panic("Cannot find addr2zone: 0x%X", addr);
}
 
/** Return frame_t structure corresponding to address
 *
 *
 */
frame_t * frame_addr2frame(__address addr)
{
    ipl_t ipl;
    frame_t *frame;
    zone_t *zone;
 
    if (IS_KA(addr))
        addr = KA2PA(addr);
 
    /* Disable interrupts to avoid deadlocks with interrupt handlers */
    ipl = interrupts_disable();
    spinlock_lock(&zone_head_lock);
   
    zone = addr2zone(addr,0);
    frame = ADDR2FRAME(zone, addr);
 
    spinlock_unlock(&zone_head_lock);
    interrupts_restore(ipl);
 
    return frame;
}
 
 
/** Free a frame.
 *
 * Find respective frame structrue for supplied addr.
 * Decrement frame reference count.
 * If it drops to zero, move the frame structure to free list.
 *
 * @param addr Address of the frame to be freed. It must be a multiple of FRAME_SIZE.
 */
void frame_free(__address addr)
{
    ipl_t ipl;
    zone_t *zone;
    frame_t *frame;
    int order;
   
    ASSERT(addr % FRAME_SIZE == 0);
   
    if (IS_KA(addr))
        addr = KA2PA(addr);
 
    ipl = interrupts_disable();
    spinlock_lock(&zone_head_lock);
   
    /*
     * First, find host frame zone for addr.
     */
    zone = addr2zone(addr, 1); /* This locks the zone automatically */
   
    frame = ADDR2FRAME(zone, addr);
   
    /* 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);
   
    spinlock_unlock(&zone->lock);
    spinlock_unlock(&zone_head_lock);
    interrupts_restore(ipl);
}
 
/** Mark frame region not free.
 *
 * Mark frame region not free.
 *
 * @param base Base address of non-available region.
 * @param size Size of non-available region.
 */
void frame_region_not_free(__address base, size_t size)
{
    index_t index;
    index = zone_blacklist_count++;
 
    /* Force base to the nearest lower address frame boundary. */
    base = ALIGN_DOWN(base, FRAME_SIZE);
    /* Align size to frame boundary. */
    size = ALIGN_UP(size, FRAME_SIZE);
 
    ASSERT(index < ZONE_BLACKLIST_SIZE);
    zone_blacklist[index].base = base;
    zone_blacklist[index].size = size;
}
 
/** Create frame zones in region of available memory.
 *
 * Avoid any black listed areas of non-available memory.
 * Assume that the black listed areas cannot overlap
 * one another or cross available memory region boundaries.
 *
 * @param base Base address of available memory region.
 * @param size Size of the region.
 */
void zone_create_in_region(__address base, size_t size) {
    int i;
    zone_t * z;
    __address s;
    size_t sz;
   
    ASSERT(base % FRAME_SIZE == 0);
    ASSERT(size % FRAME_SIZE == 0);
   
    if (!size)
        return;
 
    for (i = 0; i < zone_blacklist_count; i++) {
        if (zone_blacklist[i].base >= base && zone_blacklist[i].base < base + size) {
            s = base; sz = zone_blacklist[i].base - base;
            ASSERT(base != s || sz != size);
            zone_create_in_region(s, sz);
           
            s = zone_blacklist[i].base + zone_blacklist[i].size;
            sz = (base + size) - (zone_blacklist[i].base + zone_blacklist[i].size);
            ASSERT(base != s || sz != size);
            zone_create_in_region(s, sz);
            return;
       
        }
    }
   
    z = zone_create(base, size, 0);
 
    if (!z) {
        panic("Cannot allocate zone (base=%P, size=%d).\n", base, size);
    }
   
    zone_attach(z);
}
 
 
/** Create frame zone
 *
 * Create new frame zone.
 *
 * @param start Physical address of the first frame within the zone.
 * @param size Size of the zone. Must be a multiple of FRAME_SIZE.
 * @param flags Zone flags.
 *
 * @return Initialized zone.
 */
zone_t * zone_create(__address start, size_t size, int flags)
{
    zone_t *z;
    count_t cnt;
    int i;
    __u8 max_order;
 
    ASSERT(start % FRAME_SIZE == 0);
    ASSERT(size % FRAME_SIZE == 0);
   
    cnt = size / FRAME_SIZE;
   
    z = (zone_t *) early_malloc(sizeof(zone_t));
    if (z) {
        link_initialize(&z->link);
        spinlock_initialize(&z->lock, "zone_lock");
   
        z->base = start;
        z->base_index = start / FRAME_SIZE;
       
        z->flags = flags;
 
        z->free_count = cnt;
        z->busy_count = 0;
       
        z->frames = (frame_t *) early_malloc(cnt * sizeof(frame_t));
        if (!z->frames) {
            early_free(z);
            return NULL;
        }
       
        for (i = 0; i<cnt; i++) {
            frame_initialize(&z->frames[i], z);
        }
       
        /*
         * Create buddy system for the zone
         */
        for (max_order = 0; cnt >> max_order; max_order++)
            ;
        z->buddy_system = buddy_system_create(max_order, &zone_buddy_system_operations, (void *) z);
       
        /* Stuffing frames */
        for (i = 0; i<cnt; i++) {
            z->frames[i].refcount = 0;
            buddy_system_free(z->buddy_system, &z->frames[i].buddy_link);  
        }
       
    }
    return z;
}
 
/** Attach frame zone
 *
 * Attach frame zone to zone list.
 *
 * @param zone Zone to be attached.
 */
void zone_attach(zone_t *zone)
{
    ipl_t ipl;
   
    ipl = interrupts_disable();
    spinlock_lock(&zone_head_lock);
   
    list_append(&zone->link, &zone_head);
   
    spinlock_unlock(&zone_head_lock);
    interrupts_restore(ipl);
}
 
/** Initialize frame structure
 *
 * Initialize frame structure.
 *
 * @param frame Frame structure to be initialized.
 * @param zone Host frame zone.
 */
void frame_initialize(frame_t *frame, zone_t *zone)
{
    frame->refcount = 1;
    frame->buddy_order = 0;
}
 
 
/** 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
 */
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
 */
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)
 */
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
 */
void zone_buddy_set_order(buddy_system_t *b, link_t * block, __u8 order) {
    frame_t * frame;
    frame = list_get_instance(block, frame_t, buddy_link);
    frame->buddy_order = order;
}
 
/** Buddy system get_order implementation
 *
 * @param b Buddy system.
 * @param block Buddy system block
 *
 * @return Order of block
 */
__u8 zone_buddy_get_order(buddy_system_t *b, link_t * block) {
    frame_t * frame;
    frame = list_get_instance(block, frame_t, buddy_link);
    return frame->buddy_order;
}
 
/** Buddy system mark_busy implementation
 *
 * @param b Buddy system
 * @param block Buddy system block
 *
 */
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;
}
 
/** Prints list of zones
 *
 */
void zone_print_list(void) {
    zone_t *zone = NULL;
    link_t *cur;
    ipl_t ipl;
 
    ipl = interrupts_disable();
    spinlock_lock(&zone_head_lock);
    printf("Base address\tFree Frames\tBusy Frames\n");
    printf("------------\t-----------\t-----------\n");
    for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {
        zone = list_get_instance(cur, zone_t, link);
        spinlock_lock(&zone->lock);
        printf("%L\t%d\t\t%d\n",zone->base, zone->free_count, zone->busy_count);
        spinlock_unlock(&zone->lock);
    }
    spinlock_unlock(&zone_head_lock);
    interrupts_restore(ipl);
}
 
/** Prints zone details
 *
 * @param base Zone base address
 */
void zone_print_one(__address base) {
    zone_t *zone = NULL, *z ;
    link_t *cur;
    ipl_t ipl;
 
    ipl = interrupts_disable();
    spinlock_lock(&zone_head_lock);
   
    for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {
        z = list_get_instance(cur, zone_t, link);
        if (base == z->base) {
            zone = z;
            break;
        }
    }
   
    if (!zone) {
        spinlock_unlock(&zone_head_lock);
        interrupts_restore(ipl);
        printf("No zone with address %X\n", base);
        return;
    }
   
    spinlock_lock(&zone->lock);
    printf("Memory zone information\n\n");
    printf("Zone base address: %P\n", zone->base);
    printf("Zone size: %d frames (%dK)\n", zone->free_count + zone->busy_count, ((zone->free_count + zone->busy_count) * FRAME_SIZE) >> 10);
    printf("Allocated space: %d frames (%dK)\n", zone->busy_count, (zone->busy_count * FRAME_SIZE) >> 10);
    printf("Available space: %d (%dK)\n", zone->free_count, (zone->free_count * FRAME_SIZE) >> 10);
   
    printf("\nBuddy allocator structures:\n\n");
    buddy_system_structure_print(zone->buddy_system, FRAME_SIZE);
   
    spinlock_unlock(&zone->lock);
    spinlock_unlock(&zone_head_lock);
    interrupts_restore(ipl);
}
 
 

Rev 764	Rev 768
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	#include <typedefs.h>	30	#include <typedefs.h>
31	#include <arch/types.h>	31	#include <arch/types.h>
32	#include <mm/heap.h>	32	#include <mm/heap.h>
33	#include <mm/frame.h>	33	#include <mm/frame.h>
34	#include <mm/as.h>	34	#include <mm/as.h>
35	#include <panic.h>	35	#include <panic.h>
36	#include <debug.h>	36	#include <debug.h>
37	#include <list.h>	37	#include <list.h>
38	#include <synch/spinlock.h>	38	#include <synch/spinlock.h>
39	#include <arch/asm.h>	39	#include <arch/asm.h>
40	#include <arch.h>	40	#include <arch.h>
41	#include <print.h>	41	#include <print.h>
42	#include <align.h>	42	#include <align.h>
43		43
44	SPINLOCK_INITIALIZE(zone_head_lock); /*< this lock protects zone_head list /	44	SPINLOCK_INITIALIZE(zone_head_lock); /*< this lock protects zone_head list /
45	LIST_INITIALIZE(zone_head); /*< list of all zones in the system /	45	LIST_INITIALIZE(zone_head); /*< list of all zones in the system /
46		46
47	/** Blacklist containing non-available areas of memory.	47	/** Blacklist containing non-available areas of memory.
48	*	48	*
49	* This blacklist is used to exclude frames that cannot be allocated	49	* This blacklist is used to exclude frames that cannot be allocated
50	* (e.g. kernel memory) from available memory map.	50	* (e.g. kernel memory) from available memory map.
51	*/	51	*/
52	region_t zone_blacklist[ZONE_BLACKLIST_SIZE];	52	region_t zone_blacklist[ZONE_BLACKLIST_SIZE];
53	count_t zone_blacklist_count = 0;	53	count_t zone_blacklist_count = 0;
54		54
55	static struct buddy_system_operations zone_buddy_system_operations = {	55	static struct buddy_system_operations zone_buddy_system_operations = {
56	.find_buddy = zone_buddy_find_buddy,	56	.find_buddy = zone_buddy_find_buddy,
57	.bisect = zone_buddy_bisect,	57	.bisect = zone_buddy_bisect,
58	.coalesce = zone_buddy_coalesce,	58	.coalesce = zone_buddy_coalesce,
59	.set_order = zone_buddy_set_order,	59	.set_order = zone_buddy_set_order,
60	.get_order = zone_buddy_get_order,	60	.get_order = zone_buddy_get_order,
61	.mark_busy = zone_buddy_mark_busy,	61	.mark_busy = zone_buddy_mark_busy,
62	};	62	};
63		63
64	/** Initialize physical memory management	64	/** Initialize physical memory management
65	*	65	*
66	* Initialize physical memory managemnt.	66	* Initialize physical memory managemnt.
67	*/	67	*/
68	void frame_init(void)	68	void frame_init(void)
69	{	69	{
70	if (config.cpu_active == 1) {	70	if (config.cpu_active == 1) {
71	frame_region_not_free(KA2PA(config.base), config.kernel_size);	71	frame_region_not_free(KA2PA(config.base), config.kernel_size);
72	if (config.init_size > 0)	72	if (config.init_size > 0)
73	frame_region_not_free(KA2PA(config.init_addr), config.init_size);	73	frame_region_not_free(KA2PA(config.init_addr), config.init_size);
74	}	74	}
75		75
76	frame_arch_init();	76	frame_arch_init();
77	}	77	}
78		78
79	/**	79	/**
80	* Find AND LOCK zone that can allocate order frames	80	* Find AND LOCK zone that can allocate order frames
81	*	81	*
82	* Assume zone_head_lock is locked.	82	* Assume zone_head_lock is locked.
83	*/	83	*/
84	static zone_t * find_free_zone(__u8 order)	84	static zone_t * find_free_zone(__u8 order)
85	{	85	{
86	link_t *cur;	86	link_t *cur;
87	zone_t *z;	87	zone_t *z;
88		88
89	for (cur = zone_head.next; cur != &zone_head;cur = cur->next) {	89	for (cur = zone_head.next; cur != &zone_head;cur = cur->next) {
90	z = list_get_instance(cur, zone_t, link);	90	z = list_get_instance(cur, zone_t, link);
91		91
92	spinlock_lock(&z->lock);	92	spinlock_lock(&z->lock);
93		93
94	/* Check if the zone has 2^order frames area available */	94	/* Check if the zone has 2^order frames area available */
95	if (buddy_system_can_alloc(z->buddy_system, order))	95	if (buddy_system_can_alloc(z->buddy_system, order))
96	return z;	96	return z;
97		97
98	spinlock_unlock(&z->lock);	98	spinlock_unlock(&z->lock);
99	}	99	}
100	return NULL;	100	return NULL;
101	}	101	}
102		102
103	/** Allocate power-of-two frames of physical memory.	103	/** Allocate power-of-two frames of physical memory.
104	*	104	*
105	* @param flags Flags for host zone selection and address processing.	105	* @param flags Flags for host zone selection and address processing.
106	* @param order Allocate exactly 2^order frames.	106	* @param order Allocate exactly 2^order frames.
107	* @param pzone Pointer to preferred zone pointer, on output it changes	107	* @param pzone Pointer to preferred zone pointer, on output it changes
108	* to the zone that the frame was really allocated to	108	* to the zone that the frame was really allocated to
109	*	109	*
110	* @return Allocated frame.	110	* @return Allocated frame.
111	*/	111	*/
112	__address frame_alloc(int flags, __u8 order, int * status, zone_t **pzone)	112	__address frame_alloc(int flags, __u8 order, int * status, zone_t **pzone)
113	{	113	{
114	ipl_t ipl;	114	ipl_t ipl;
115	link_t *tmp;	115	link_t *tmp;
116	zone_t *zone = NULL;	116	zone_t *zone = NULL;
117	frame_t *frame = NULL;	117	frame_t *frame = NULL;
-		118	int freed;
118	__address v;	119	__address v;
119		120
120	loop:	121	loop:
121	ipl = interrupts_disable();	122	ipl = interrupts_disable();
122	spinlock_lock(&zone_head_lock);	123	spinlock_lock(&zone_head_lock);
123		124
124	/*	125	/*
125	* First, find suitable frame zone.	126	* First, find suitable frame zone.
126	*/	127	*/
127	if (pzone && *pzone) {	128	if (pzone && *pzone) {
128	spinlock_lock(&(*pzone)->lock);	129	spinlock_lock(&(*pzone)->lock);
129	if (!buddy_system_can_alloc((*pzone)->buddy_system, order))	130	if (!buddy_system_can_alloc((*pzone)->buddy_system, order))
130	spinlock_unlock(&(*pzone)->lock);	131	spinlock_unlock(&(*pzone)->lock);
131	else	132	else
132	zone = *pzone;	133	zone = *pzone;
133	}	134	}
134	if (!zone) {	135	if (!zone) {
135	zone = find_free_zone(order);	136	zone = find_free_zone(order);
136	/* If no memory, reclaim some slab memory,	137	/* If no memory, reclaim some slab memory,
137	if it does not help, reclaim all */	138	if it does not help, reclaim all */
138	if (!zone && !(flags & FRAME_NO_RECLAIM))	139	if (!zone && !(flags & FRAME_NO_RECLAIM)) {
-		140	spinlock_unlock(&zone_head_lock);
139	if (slab_reclaim(0) \|\| slab_reclaim(SLAB_RECLAIM_ALL))	141	freed = slab_reclaim(0);
-		142	spinlock_lock(&zone_head_lock);
-		143	if (freed)
140	zone = find_free_zone(order);	144	zone = find_free_zone(order);
-		145	if (!zone) {
-		146	spinlock_unlock(&zone_head_lock);
-		147	freed = slab_reclaim(SLAB_RECLAIM_ALL);
-		148	spinlock_lock(&zone_head_lock);
-		149	if (freed)
-		150	zone = find_free_zone(order);
-		151	}
-		152	}
141	}	153	}
142		154
143	if (!zone) {	155	if (!zone) {
144	if (flags & FRAME_PANIC)	156	if (flags & FRAME_PANIC)
145	panic("Can't allocate frame.\n");	157	panic("Can't allocate frame.\n");
146		158
147	/*	159	/*
148	* TODO: Sleep until frames are available again.	160	* TODO: Sleep until frames are available again.
149	*/	161	*/
150	spinlock_unlock(&zone_head_lock);	162	spinlock_unlock(&zone_head_lock);
151	interrupts_restore(ipl);	163	interrupts_restore(ipl);
152		164
153	if (flags & FRAME_ATOMIC) {	165	if (flags & FRAME_ATOMIC) {
154	ASSERT(status != NULL);	166	ASSERT(status != NULL);
155	*status = FRAME_NO_MEMORY;	167	*status = FRAME_NO_MEMORY;
156	return NULL;	168	return NULL;
157	}	169	}
158		170
159	panic("Sleep not implemented.\n");	171	panic("Sleep not implemented.\n");
160	goto loop;	172	goto loop;
161	}	173	}
162		174
163	/* Allocate frames from zone buddy system */	175	/* Allocate frames from zone buddy system */
164	tmp = buddy_system_alloc(zone->buddy_system, order);	176	tmp = buddy_system_alloc(zone->buddy_system, order);
165		177
166	ASSERT(tmp);	178	ASSERT(tmp);
167		179
168	/* Update zone information. */	180	/* Update zone information. */
169	zone->free_count -= (1 << order);	181	zone->free_count -= (1 << order);
170	zone->busy_count += (1 << order);	182	zone->busy_count += (1 << order);
171		183
172	/* Frame will be actually a first frame of the block. */	184	/* Frame will be actually a first frame of the block. */
173	frame = list_get_instance(tmp, frame_t, buddy_link);	185	frame = list_get_instance(tmp, frame_t, buddy_link);
174		186
175	/* get frame address */	187	/* get frame address */
176	v = FRAME2ADDR(zone, frame);	188	v = FRAME2ADDR(zone, frame);
177		189
178	spinlock_unlock(&zone->lock);	190	spinlock_unlock(&zone->lock);
179	spinlock_unlock(&zone_head_lock);	191	spinlock_unlock(&zone_head_lock);
180	interrupts_restore(ipl);	192	interrupts_restore(ipl);
181		193
182	ASSERT(v == ALIGN_UP(v, FRAME_SIZE << order));	194	ASSERT(v == ALIGN_UP(v, FRAME_SIZE << order));
183		195
184	if (flags & FRAME_KA)	196	if (flags & FRAME_KA)
185	v = PA2KA(v);	197	v = PA2KA(v);
186		198
187	if (status)	199	if (status)
188	*status = FRAME_OK;	200	*status = FRAME_OK;
189		201
190	if (pzone)	202	if (pzone)
191	*pzone = zone;	203	*pzone = zone;
192	return v;	204	return v;
193	}	205	}
194		206
195	/** Convert address to zone pointer	207	/** Convert address to zone pointer
196	*	208	*
197	* Assume zone_head_lock is held	209	* Assume zone_head_lock is held
198	*	210	*
199	* @param addr Physical address	211	* @param addr Physical address
200	* @param lock If true, lock the zone	212	* @param lock If true, lock the zone
201	*/	213	*/
202	static zone_t * addr2zone(__address addr, int lock)	214	static zone_t * addr2zone(__address addr, int lock)
203	{	215	{
204	link_t *cur;	216	link_t *cur;
205	zone_t *z = NULL;	217	zone_t *z = NULL;
206		218
207	for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {	219	for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {
208	z = list_get_instance(cur, zone_t, link);	220	z = list_get_instance(cur, zone_t, link);
209		221
210	spinlock_lock(&z->lock);	222	spinlock_lock(&z->lock);
211		223
212	/*	224	/*
213	* Check if addr belongs to z.	225	* Check if addr belongs to z.
214	*/	226	*/
215	if ((addr >= z->base) && (addr <= z->base + (z->free_count + z->busy_count) * FRAME_SIZE)) {	227	if ((addr >= z->base) && (addr <= z->base + (z->free_count + z->busy_count) * FRAME_SIZE)) {
216	if (!lock)	228	if (!lock)
217	spinlock_unlock(&z->lock);	229	spinlock_unlock(&z->lock);
218	return z;	230	return z;
219	}	231	}
220		232
221	spinlock_unlock(&z->lock);	233	spinlock_unlock(&z->lock);
222	}	234	}
223		235
224	panic("Cannot find addr2zone: 0x%X", addr);	236	panic("Cannot find addr2zone: 0x%X", addr);
225	}	237	}
226		238
227	/** Return frame_t structure corresponding to address	239	/** Return frame_t structure corresponding to address
228	*	240	*
229	*	241	*
230	*/	242	*/
231	frame_t * frame_addr2frame(__address addr)	243	frame_t * frame_addr2frame(__address addr)
232	{	244	{
233	ipl_t ipl;	245	ipl_t ipl;
234	frame_t *frame;	246	frame_t *frame;
235	zone_t *zone;	247	zone_t *zone;
236		248
237	if (IS_KA(addr))	249	if (IS_KA(addr))
238	addr = KA2PA(addr);	250	addr = KA2PA(addr);
239		251
240	/* Disable interrupts to avoid deadlocks with interrupt handlers */	252	/* Disable interrupts to avoid deadlocks with interrupt handlers */
241	ipl = interrupts_disable();	253	ipl = interrupts_disable();
242	spinlock_lock(&zone_head_lock);	254	spinlock_lock(&zone_head_lock);
243		255
244	zone = addr2zone(addr,0);	256	zone = addr2zone(addr,0);
245	frame = ADDR2FRAME(zone, addr);	257	frame = ADDR2FRAME(zone, addr);
246		258
247	spinlock_unlock(&zone_head_lock);	259	spinlock_unlock(&zone_head_lock);
248	interrupts_restore(ipl);	260	interrupts_restore(ipl);
249		261
250	return frame;	262	return frame;
251	}	263	}
252		264
253		265
254	/** Free a frame.	266	/** Free a frame.
255	*	267	*
256	* Find respective frame structrue for supplied addr.	268	* Find respective frame structrue for supplied addr.
257	* Decrement frame reference count.	269	* Decrement frame reference count.
258	* If it drops to zero, move the frame structure to free list.	270	* If it drops to zero, move the frame structure to free list.
259	*	271	*
260	* @param addr Address of the frame to be freed. It must be a multiple of FRAME_SIZE.	272	* @param addr Address of the frame to be freed. It must be a multiple of FRAME_SIZE.
261	*/	273	*/
262	void frame_free(__address addr)	274	void frame_free(__address addr)
263	{	275	{
264	ipl_t ipl;	276	ipl_t ipl;
265	zone_t *zone;	277	zone_t *zone;
266	frame_t *frame;	278	frame_t *frame;
267	int order;	279	int order;
268		280
269	ASSERT(addr % FRAME_SIZE == 0);	281	ASSERT(addr % FRAME_SIZE == 0);
270		282
271	if (IS_KA(addr))	283	if (IS_KA(addr))
272	addr = KA2PA(addr);	284	addr = KA2PA(addr);
273		285
274	ipl = interrupts_disable();	286	ipl = interrupts_disable();
275	spinlock_lock(&zone_head_lock);	287	spinlock_lock(&zone_head_lock);
276		288
277	/*	289	/*
278	* First, find host frame zone for addr.	290	* First, find host frame zone for addr.
279	*/	291	*/
280	zone = addr2zone(addr, 1); /* This locks the zone automatically */	292	zone = addr2zone(addr, 1); /* This locks the zone automatically */
281		293
282	frame = ADDR2FRAME(zone, addr);	294	frame = ADDR2FRAME(zone, addr);
283		295
284	/* remember frame order */	296	/* remember frame order */
285	order = frame->buddy_order;	297	order = frame->buddy_order;
286		298
287	ASSERT(frame->refcount);	299	ASSERT(frame->refcount);
288		300
289	if (!--frame->refcount) {	301	if (!--frame->refcount) {
290	buddy_system_free(zone->buddy_system, &frame->buddy_link);	302	buddy_system_free(zone->buddy_system, &frame->buddy_link);
291	}	303	}
292		304
293	/* Update zone information. */	305	/* Update zone information. */
294	zone->free_count += (1 << order);	306	zone->free_count += (1 << order);
295	zone->busy_count -= (1 << order);	307	zone->busy_count -= (1 << order);
296		308
297	spinlock_unlock(&zone->lock);	309	spinlock_unlock(&zone->lock);
298	spinlock_unlock(&zone_head_lock);	310	spinlock_unlock(&zone_head_lock);
299	interrupts_restore(ipl);	311	interrupts_restore(ipl);
300	}	312	}
301		313
302	/** Mark frame region not free.	314	/** Mark frame region not free.
303	*	315	*
304	* Mark frame region not free.	316	* Mark frame region not free.
305	*	317	*
306	* @param base Base address of non-available region.	318	* @param base Base address of non-available region.
307	* @param size Size of non-available region.	319	* @param size Size of non-available region.
308	*/	320	*/
309	void frame_region_not_free(__address base, size_t size)	321	void frame_region_not_free(__address base, size_t size)
310	{	322	{
311	index_t index;	323	index_t index;
312	index = zone_blacklist_count++;	324	index = zone_blacklist_count++;
313		325
314	/* Force base to the nearest lower address frame boundary. */	326	/* Force base to the nearest lower address frame boundary. */
315	base = ALIGN_DOWN(base, FRAME_SIZE);	327	base = ALIGN_DOWN(base, FRAME_SIZE);
316	/* Align size to frame boundary. */	328	/* Align size to frame boundary. */
317	size = ALIGN_UP(size, FRAME_SIZE);	329	size = ALIGN_UP(size, FRAME_SIZE);
318		330
319	ASSERT(index < ZONE_BLACKLIST_SIZE);	331	ASSERT(index < ZONE_BLACKLIST_SIZE);
320	zone_blacklist[index].base = base;	332	zone_blacklist[index].base = base;
321	zone_blacklist[index].size = size;	333	zone_blacklist[index].size = size;
322	}	334	}
323		335
324	/** Create frame zones in region of available memory.	336	/** Create frame zones in region of available memory.
325	*	337	*
326	* Avoid any black listed areas of non-available memory.	338	* Avoid any black listed areas of non-available memory.
327	* Assume that the black listed areas cannot overlap	339	* Assume that the black listed areas cannot overlap
328	* one another or cross available memory region boundaries.	340	* one another or cross available memory region boundaries.
329	*	341	*
330	* @param base Base address of available memory region.	342	* @param base Base address of available memory region.
331	* @param size Size of the region.	343	* @param size Size of the region.
332	*/	344	*/
333	void zone_create_in_region(__address base, size_t size) {	345	void zone_create_in_region(__address base, size_t size) {
334	int i;	346	int i;
335	zone_t * z;	347	zone_t * z;
336	__address s;	348	__address s;
337	size_t sz;	349	size_t sz;
338		350
339	ASSERT(base % FRAME_SIZE == 0);	351	ASSERT(base % FRAME_SIZE == 0);
340	ASSERT(size % FRAME_SIZE == 0);	352	ASSERT(size % FRAME_SIZE == 0);
341		353
342	if (!size)	354	if (!size)
343	return;	355	return;
344		356
345	for (i = 0; i < zone_blacklist_count; i++) {	357	for (i = 0; i < zone_blacklist_count; i++) {
346	if (zone_blacklist[i].base >= base && zone_blacklist[i].base < base + size) {	358	if (zone_blacklist[i].base >= base && zone_blacklist[i].base < base + size) {
347	s = base; sz = zone_blacklist[i].base - base;	359	s = base; sz = zone_blacklist[i].base - base;
348	ASSERT(base != s \|\| sz != size);	360	ASSERT(base != s \|\| sz != size);
349	zone_create_in_region(s, sz);	361	zone_create_in_region(s, sz);
350		362
351	s = zone_blacklist[i].base + zone_blacklist[i].size;	363	s = zone_blacklist[i].base + zone_blacklist[i].size;
352	sz = (base + size) - (zone_blacklist[i].base + zone_blacklist[i].size);	364	sz = (base + size) - (zone_blacklist[i].base + zone_blacklist[i].size);
353	ASSERT(base != s \|\| sz != size);	365	ASSERT(base != s \|\| sz != size);
354	zone_create_in_region(s, sz);	366	zone_create_in_region(s, sz);
355	return;	367	return;
356		368
357	}	369	}
358	}	370	}
359		371
360	z = zone_create(base, size, 0);	372	z = zone_create(base, size, 0);
361		373
362	if (!z) {	374	if (!z) {
363	panic("Cannot allocate zone (base=%P, size=%d).\n", base, size);	375	panic("Cannot allocate zone (base=%P, size=%d).\n", base, size);
364	}	376	}
365		377
366	zone_attach(z);	378	zone_attach(z);
367	}	379	}
368		380
369		381
370	/** Create frame zone	382	/** Create frame zone
371	*	383	*
372	* Create new frame zone.	384	* Create new frame zone.
373	*	385	*
374	* @param start Physical address of the first frame within the zone.	386	* @param start Physical address of the first frame within the zone.
375	* @param size Size of the zone. Must be a multiple of FRAME_SIZE.	387	* @param size Size of the zone. Must be a multiple of FRAME_SIZE.
376	* @param flags Zone flags.	388	* @param flags Zone flags.
377	*	389	*
378	* @return Initialized zone.	390	* @return Initialized zone.
379	*/	391	*/
380	zone_t * zone_create(__address start, size_t size, int flags)	392	zone_t * zone_create(__address start, size_t size, int flags)
381	{	393	{
382	zone_t *z;	394	zone_t *z;
383	count_t cnt;	395	count_t cnt;
384	int i;	396	int i;
385	__u8 max_order;	397	__u8 max_order;
386		398
387	ASSERT(start % FRAME_SIZE == 0);	399	ASSERT(start % FRAME_SIZE == 0);
388	ASSERT(size % FRAME_SIZE == 0);	400	ASSERT(size % FRAME_SIZE == 0);
389		401
390	cnt = size / FRAME_SIZE;	402	cnt = size / FRAME_SIZE;
391		403
392	z = (zone_t *) early_malloc(sizeof(zone_t));	404	z = (zone_t *) early_malloc(sizeof(zone_t));
393	if (z) {	405	if (z) {
394	link_initialize(&z->link);	406	link_initialize(&z->link);
395	spinlock_initialize(&z->lock, "zone_lock");	407	spinlock_initialize(&z->lock, "zone_lock");
396		408
397	z->base = start;	409	z->base = start;
398	z->base_index = start / FRAME_SIZE;	410	z->base_index = start / FRAME_SIZE;
399		411
400	z->flags = flags;	412	z->flags = flags;
401		413
402	z->free_count = cnt;	414	z->free_count = cnt;
403	z->busy_count = 0;	415	z->busy_count = 0;
404		416
405	z->frames = (frame_t ) early_malloc(cnt sizeof(frame_t));	417	z->frames = (frame_t ) early_malloc(cnt sizeof(frame_t));
406	if (!z->frames) {	418	if (!z->frames) {
407	early_free(z);	419	early_free(z);
408	return NULL;	420	return NULL;
409	}	421	}
410		422
411	for (i = 0; i<cnt; i++) {	423	for (i = 0; i<cnt; i++) {
412	frame_initialize(&z->frames[i], z);	424	frame_initialize(&z->frames[i], z);
413	}	425	}
414		426
415	/*	427	/*
416	* Create buddy system for the zone	428	* Create buddy system for the zone
417	*/	429	*/
418	for (max_order = 0; cnt >> max_order; max_order++)	430	for (max_order = 0; cnt >> max_order; max_order++)
419	;	431	;
420	z->buddy_system = buddy_system_create(max_order, &zone_buddy_system_operations, (void *) z);	432	z->buddy_system = buddy_system_create(max_order, &zone_buddy_system_operations, (void *) z);
421		433
422	/* Stuffing frames */	434	/* Stuffing frames */
423	for (i = 0; i<cnt; i++) {	435	for (i = 0; i<cnt; i++) {
424	z->frames[i].refcount = 0;	436	z->frames[i].refcount = 0;
425	buddy_system_free(z->buddy_system, &z->frames[i].buddy_link);	437	buddy_system_free(z->buddy_system, &z->frames[i].buddy_link);
426	}	438	}
427		439
428	}	440	}
429	return z;	441	return z;
430	}	442	}
431		443
432	/** Attach frame zone	444	/** Attach frame zone
433	*	445	*
434	* Attach frame zone to zone list.	446	* Attach frame zone to zone list.
435	*	447	*
436	* @param zone Zone to be attached.	448	* @param zone Zone to be attached.
437	*/	449	*/
438	void zone_attach(zone_t *zone)	450	void zone_attach(zone_t *zone)
439	{	451	{
440	ipl_t ipl;	452	ipl_t ipl;
441		453
442	ipl = interrupts_disable();	454	ipl = interrupts_disable();
443	spinlock_lock(&zone_head_lock);	455	spinlock_lock(&zone_head_lock);
444		456
445	list_append(&zone->link, &zone_head);	457	list_append(&zone->link, &zone_head);
446		458
447	spinlock_unlock(&zone_head_lock);	459	spinlock_unlock(&zone_head_lock);
448	interrupts_restore(ipl);	460	interrupts_restore(ipl);
449	}	461	}
450		462
451	/** Initialize frame structure	463	/** Initialize frame structure
452	*	464	*
453	* Initialize frame structure.	465	* Initialize frame structure.
454	*	466	*
455	* @param frame Frame structure to be initialized.	467	* @param frame Frame structure to be initialized.
456	* @param zone Host frame zone.	468	* @param zone Host frame zone.
457	*/	469	*/
458	void frame_initialize(frame_t frame, zone_t zone)	470	void frame_initialize(frame_t frame, zone_t zone)
459	{	471	{
460	frame->refcount = 1;	472	frame->refcount = 1;
461	frame->buddy_order = 0;	473	frame->buddy_order = 0;
462	}	474	}
463		475
464		476
465	/** Buddy system find_buddy implementation	477	/** Buddy system find_buddy implementation
466	*	478	*
467	* @param b Buddy system.	479	* @param b Buddy system.
468	* @param block Block for which buddy should be found	480	* @param block Block for which buddy should be found
469	*	481	*
470	* @return Buddy for given block if found	482	* @return Buddy for given block if found
471	*/	483	*/
472	link_t * zone_buddy_find_buddy(buddy_system_t b, link_t block) {	484	link_t * zone_buddy_find_buddy(buddy_system_t b, link_t block) {
473	frame_t * frame;	485	frame_t * frame;
474	zone_t * zone;	486	zone_t * zone;
475	index_t index;	487	index_t index;
476	bool is_left, is_right;	488	bool is_left, is_right;
477		489
478	frame = list_get_instance(block, frame_t, buddy_link);	490	frame = list_get_instance(block, frame_t, buddy_link);
479	zone = (zone_t *) b->data;	491	zone = (zone_t *) b->data;
480	ASSERT(IS_BUDDY_ORDER_OK(FRAME_INDEX_ABS(zone, frame), frame->buddy_order));	492	ASSERT(IS_BUDDY_ORDER_OK(FRAME_INDEX_ABS(zone, frame), frame->buddy_order));
481		493
482		494
483	is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame);	495	is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame);
484	is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame);	496	is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame);
485		497
486	ASSERT(is_left ^ is_right);	498	ASSERT(is_left ^ is_right);
487		499
488	if (is_left) {	500	if (is_left) {

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/mm/frame.c – Rev 764 → 768