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

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/mm/frame.c – Rev 703 → 724