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/vm.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;
    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);
 
    ASSERT(frame->refcount);
 
    if (!--frame->refcount) {
        buddy_system_free(zone->buddy_system, &frame->buddy_link);
    }
 
    /* Update zone information. */
    zone->free_count += (1 << frame->buddy_order);
    zone->busy_count -= (1 << frame->buddy_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->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(zone, frame), frame->buddy_order));
   
    is_left = IS_BUDDY_LEFT_BLOCK(zone, frame);
    is_right = IS_BUDDY_RIGHT_BLOCK(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;
    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_head_lock);
 
}
 
/** Prints zone details
 *
 * @param base Zone base address
 */
void zone_print_one(__address base) {
    zone_t *zone = NULL, *z ;
    link_t *cur;
   
   
    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) {
        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 (%d kbytes)\n", zone->free_count + zone->busy_count, ((zone->free_count + zone->busy_count) * FRAME_SIZE) >> 10);
    printf("Allocated space: %d frames (%d kbytes)\n", zone->busy_count, (zone->busy_count * FRAME_SIZE) >> 10);
    printf("Available space: %d (%d kbytes)\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);
   
}
 
 

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

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/mm/frame.c – Rev 686 → 689