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

Subversion Repositories HelenOS-historic

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