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);
    }
 
    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)
{
    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);
 
        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);
   
    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;
}
 

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

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/mm/frame.c – Rev 623 → 624