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


/*
 * Copyright (C) 2001-2004 Jakub Jermar
 * 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>
 
spinlock_t zone_head_lock;       /**< this lock protects zone_head list */
link_t zone_head;                /**< list of all zones in the system */
 
/** Initialize physical memory management
 *
 * Initialize physical memory managemnt.
 */
void frame_init(void)
{
    if (config.cpu_active == 1) {
        zone_init();
    }
 
    frame_arch_init();
   
    if (config.cpu_active == 1) {
                frame_region_not_free(config.base, config.base + config.kernel_size + CONFIG_STACK_SIZE);
        }  
}
 
/** Allocate a frame
 *
 * Allocate a frame of physical memory.
 *
 * @param flags Flags for host zone selection and address processing.
 *
 * @return Allocated frame.
 */
__address frame_alloc(int flags)
{
    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 any free frames.
         */
        if (z->free_count) {
            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;
    }
       
    tmp = zone->free_head.next;
    frame = list_get_instance(tmp, frame_t, link);
 
    frame->refcount++;
    list_remove(tmp);           /* remove frame from free_head */
    zone->free_count--;
    zone->busy_count++;
   
    v = zone->base + (frame - zone->frames) * FRAME_SIZE;
   
    if (flags & FRAME_KA)
        v = PA2KA(v);
   
    spinlock_unlock(&zone->lock);
   
    spinlock_unlock(&zone_head_lock);
    interrupts_restore(ipl);
   
    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 = &zone->frames[(addr - zone->base)/FRAME_SIZE];
    ASSERT(frame->refcount);
 
    if (!--frame->refcount) {
        list_append(&frame->link, &zone->free_head);    /* append frame to free_head */
        zone->free_count++;
        zone->busy_count--;
    }
   
    spinlock_unlock(&zone->lock);  
   
    spinlock_unlock(&zone_head_lock);
    interrupts_restore(ipl);
}
 
/** Mark frame not free.
 *
 * Find respective frame structrue for supplied addr.
 * Increment frame reference count and remove the frame structure from free list.
 *
 * @param addr Address of the frame to be marked. It must be a multiple of FRAME_SIZE.
 */
void frame_not_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 = &zone->frames[(addr - zone->base)/FRAME_SIZE];
 
    if (!frame->refcount) {
        frame->refcount++;
 
        list_remove(&frame->link);          /* remove frame from free_head */
        zone->free_count--;
        zone->busy_count++;
    }
   
    spinlock_unlock(&zone->lock);  
   
    spinlock_unlock(&zone_head_lock);
    interrupts_restore(ipl);
}
 
/** Mark frame region not free.
 *
 * Mark frame region not free.
 *
 * @param start First address.
 * @param stop Last address.
 */
void frame_region_not_free(__address start, __address stop)
{
        __address a;
 
        start /= FRAME_SIZE;
        stop /= FRAME_SIZE;
        for (a = start; a <= stop; a++)
                frame_not_free(a * FRAME_SIZE);
}
 
 
/** Initialize zonekeeping
 *
 * Initialize zonekeeping.
 */
void zone_init(void)
{
    spinlock_initialize(&zone_head_lock);
    list_initialize(&zone_head);
}
 
/** 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;
   
    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);
   
        z->base = start;
        z->flags = flags;
 
        z->free_count = cnt;
        list_initialize(&z->free_head);
 
        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);
            list_append(&z->frames[i].link, &z->free_head);
        }
       
    }
   
    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 = 0;
    link_initialize(&frame->link);
}
 

Rev 375	Rev 413
1	/*	1	/*
2	* Copyright (C) 2001-2004 Jakub Jermar	2	* Copyright (C) 2001-2004 Jakub Jermar
3	* All rights reserved.	3	* All rights reserved.
4	*	4	*
5	* Redistribution and use in source and binary forms, with or without	5	* Redistribution and use in source and binary forms, with or without
6	* modification, are permitted provided that the following conditions	6	* modification, are permitted provided that the following conditions
7	* are met:	7	* are met:
8	*	8	*
9	* - Redistributions of source code must retain the above copyright	9	* - Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.	10	* notice, this list of conditions and the following disclaimer.
11	* - Redistributions in binary form must reproduce the above copyright	11	* - Redistributions in binary form must reproduce the above copyright
12	* notice, this list of conditions and the following disclaimer in the	12	* notice, this list of conditions and the following disclaimer in the
13	* documentation and/or other materials provided with the distribution.	13	* documentation and/or other materials provided with the distribution.
14	* - The name of the author may not be used to endorse or promote products	14	* - The name of the author may not be used to endorse or promote products
15	* derived from this software without specific prior written permission.	15	* derived from this software without specific prior written permission.
16	*	16	*
17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES	18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY	23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF	25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.	26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27	*/	27	*/
28		28
29	#include <typedefs.h>	29	#include <typedefs.h>
30	#include <arch/types.h>	30	#include <arch/types.h>
31	#include <mm/heap.h>	31	#include <mm/heap.h>
32	#include <mm/frame.h>	32	#include <mm/frame.h>
33	#include <mm/vm.h>	33	#include <mm/vm.h>
34	#include <panic.h>	34	#include <panic.h>
35	#include <debug.h>	35	#include <debug.h>
36	#include <list.h>	36	#include <list.h>
37	#include <synch/spinlock.h>	37	#include <synch/spinlock.h>
38	#include <arch/asm.h>	38	#include <arch/asm.h>
39	#include <arch.h>	39	#include <arch.h>
40		40
41	spinlock_t zone_head_lock; /*< this lock protects zone_head list /	41	spinlock_t zone_head_lock; /*< this lock protects zone_head list /
42	link_t zone_head; /*< list of all zones in the system /	42	link_t zone_head; /*< list of all zones in the system /
43		43
44	/** Initialize physical memory management	44	/** Initialize physical memory management
45	*	45	*
46	* Initialize physical memory managemnt.	46	* Initialize physical memory managemnt.
47	*/	47	*/
48	void frame_init(void)	48	void frame_init(void)
49	{	49	{
50	if (config.cpu_active == 1) {	50	if (config.cpu_active == 1) {
51	zone_init();	51	zone_init();
52	}	52	}
53		53
54	frame_arch_init();	54	frame_arch_init();
55		55
56	if (config.cpu_active == 1) {	56	if (config.cpu_active == 1) {
57	frame_region_not_free(config.base, config.base + config.kernel_size + CONFIG_STACK_SIZE);	57	frame_region_not_free(config.base, config.base + config.kernel_size + CONFIG_STACK_SIZE);
58	}	58	}
59	}	59	}
60		60
61	/** Allocate a frame	61	/** Allocate a frame
62	*	62	*
63	* Allocate a frame of physical memory.	63	* Allocate a frame of physical memory.
64	*	64	*
65	* @param flags Flags for host zone selection and address processing.	65	* @param flags Flags for host zone selection and address processing.
66	*	66	*
67	* @return Allocated frame.	67	* @return Allocated frame.
68	*/	68	*/
69	__address frame_alloc(int flags)	69	__address frame_alloc(int flags)
70	{	70	{
71	pri_t pri;	71	ipl_t ipl;
72	link_t cur, tmp;	72	link_t cur, tmp;
73	zone_t *z;	73	zone_t *z;
74	zone_t *zone = NULL;	74	zone_t *zone = NULL;
75	frame_t *frame = NULL;	75	frame_t *frame = NULL;
76	__address v;	76	__address v;
77		77
78	loop:	78	loop:
79	pri = cpu_priority_high();	79	ipl = interrupts_disable();
80	spinlock_lock(&zone_head_lock);	80	spinlock_lock(&zone_head_lock);
81		81
82	/*	82	/*
83	* First, find suitable frame zone.	83	* First, find suitable frame zone.
84	*/	84	*/
85	for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {	85	for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {
86	z = list_get_instance(cur, zone_t, link);	86	z = list_get_instance(cur, zone_t, link);
87		87
88	spinlock_lock(&z->lock);	88	spinlock_lock(&z->lock);
89	/*	89	/*
90	* Check if the zone has any free frames.	90	* Check if the zone has any free frames.
91	*/	91	*/
92	if (z->free_count) {	92	if (z->free_count) {
93	zone = z;	93	zone = z;
94	break;	94	break;
95	}	95	}
96	spinlock_unlock(&z->lock);	96	spinlock_unlock(&z->lock);
97	}	97	}
98		98
99	if (!zone) {	99	if (!zone) {
100	if (flags & FRAME_PANIC)	100	if (flags & FRAME_PANIC)
101	panic("Can't allocate frame.\n");	101	panic("Can't allocate frame.\n");
102		102
103	/*	103	/*
104	* TODO: Sleep until frames are available again.	104	* TODO: Sleep until frames are available again.
105	*/	105	*/
106	spinlock_unlock(&zone_head_lock);	106	spinlock_unlock(&zone_head_lock);
107	cpu_priority_restore(pri);	107	interrupts_restore(ipl);
108		108
109	panic("Sleep not implemented.\n");	109	panic("Sleep not implemented.\n");
110	goto loop;	110	goto loop;
111	}	111	}
112		112
113	tmp = zone->free_head.next;	113	tmp = zone->free_head.next;
114	frame = list_get_instance(tmp, frame_t, link);	114	frame = list_get_instance(tmp, frame_t, link);
115		115
116	frame->refcount++;	116	frame->refcount++;
117	list_remove(tmp); /* remove frame from free_head */	117	list_remove(tmp); /* remove frame from free_head */
118	zone->free_count--;	118	zone->free_count--;
119	zone->busy_count++;	119	zone->busy_count++;
120		120
121	v = zone->base + (frame - zone->frames) * FRAME_SIZE;	121	v = zone->base + (frame - zone->frames) * FRAME_SIZE;
122		122
123	if (flags & FRAME_KA)	123	if (flags & FRAME_KA)
124	v = PA2KA(v);	124	v = PA2KA(v);
125		125
126	spinlock_unlock(&zone->lock);	126	spinlock_unlock(&zone->lock);
127		127
128	spinlock_unlock(&zone_head_lock);	128	spinlock_unlock(&zone_head_lock);
129	cpu_priority_restore(pri);	129	interrupts_restore(ipl);
130		130
131	return v;	131	return v;
132	}	132	}
133		133
134	/** Free a frame.	134	/** Free a frame.
135	*	135	*
136	* Find respective frame structrue for supplied addr.	136	* Find respective frame structrue for supplied addr.
137	* Decrement frame reference count.	137	* Decrement frame reference count.
138	* If it drops to zero, move the frame structure to free list.	138	* If it drops to zero, move the frame structure to free list.
139	*	139	*
140	* @param addr Address of the frame to be freed. It must be a multiple of FRAME_SIZE.	140	* @param addr Address of the frame to be freed. It must be a multiple of FRAME_SIZE.
141	*/	141	*/
142	void frame_free(__address addr)	142	void frame_free(__address addr)
143	{	143	{
144	pri_t pri;	144	ipl_t ipl;
145	link_t *cur;	145	link_t *cur;
146	zone_t *z;	146	zone_t *z;
147	zone_t *zone = NULL;	147	zone_t *zone = NULL;
148	frame_t *frame;	148	frame_t *frame;
149		149
150	ASSERT(addr % FRAME_SIZE == 0);	150	ASSERT(addr % FRAME_SIZE == 0);
151		151
152	pri = cpu_priority_high();	152	ipl = interrupts_disable();
153	spinlock_lock(&zone_head_lock);	153	spinlock_lock(&zone_head_lock);
154		154
155	/*	155	/*
156	* First, find host frame zone for addr.	156	* First, find host frame zone for addr.
157	*/	157	*/
158	for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {	158	for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {
159	z = list_get_instance(cur, zone_t, link);	159	z = list_get_instance(cur, zone_t, link);
160		160
161	spinlock_lock(&z->lock);	161	spinlock_lock(&z->lock);
162		162
163	if (IS_KA(addr))	163	if (IS_KA(addr))
164	addr = KA2PA(addr);	164	addr = KA2PA(addr);
165		165
166	/*	166	/*
167	* Check if addr belongs to z.	167	* Check if addr belongs to z.
168	*/	168	*/
169	if ((addr >= z->base) && (addr <= z->base + (z->free_count + z->busy_count) * FRAME_SIZE)) {	169	if ((addr >= z->base) && (addr <= z->base + (z->free_count + z->busy_count) * FRAME_SIZE)) {
170	zone = z;	170	zone = z;
171	break;	171	break;
172	}	172	}
173	spinlock_unlock(&z->lock);	173	spinlock_unlock(&z->lock);
174	}	174	}
175		175
176	ASSERT(zone != NULL);	176	ASSERT(zone != NULL);
177		177
178	frame = &zone->frames[(addr - zone->base)/FRAME_SIZE];	178	frame = &zone->frames[(addr - zone->base)/FRAME_SIZE];
179	ASSERT(frame->refcount);	179	ASSERT(frame->refcount);
180		180
181	if (!--frame->refcount) {	181	if (!--frame->refcount) {
182	list_append(&frame->link, &zone->free_head); /* append frame to free_head */	182	list_append(&frame->link, &zone->free_head); /* append frame to free_head */
183	zone->free_count++;	183	zone->free_count++;
184	zone->busy_count--;	184	zone->busy_count--;
185	}	185	}
186		186
187	spinlock_unlock(&zone->lock);	187	spinlock_unlock(&zone->lock);
188		188
189	spinlock_unlock(&zone_head_lock);	189	spinlock_unlock(&zone_head_lock);
190	cpu_priority_restore(pri);	190	interrupts_restore(ipl);
191	}	191	}
192		192
193	/** Mark frame not free.	193	/** Mark frame not free.
194	*	194	*
195	* Find respective frame structrue for supplied addr.	195	* Find respective frame structrue for supplied addr.
196	* Increment frame reference count and remove the frame structure from free list.	196	* Increment frame reference count and remove the frame structure from free list.
197	*	197	*
198	* @param addr Address of the frame to be marked. It must be a multiple of FRAME_SIZE.	198	* @param addr Address of the frame to be marked. It must be a multiple of FRAME_SIZE.
199	*/	199	*/
200	void frame_not_free(__address addr)	200	void frame_not_free(__address addr)
201	{	201	{
202	pri_t pri;	202	ipl_t ipl;
203	link_t *cur;	203	link_t *cur;
204	zone_t *z;	204	zone_t *z;
205	zone_t *zone = NULL;	205	zone_t *zone = NULL;
206	frame_t *frame;	206	frame_t *frame;
207		207
208	ASSERT(addr % FRAME_SIZE == 0);	208	ASSERT(addr % FRAME_SIZE == 0);
209		209
210	pri = cpu_priority_high();	210	ipl = interrupts_disable();
211	spinlock_lock(&zone_head_lock);	211	spinlock_lock(&zone_head_lock);
212		212
213	/*	213	/*
214	* First, find host frame zone for addr.	214	* First, find host frame zone for addr.
215	*/	215	*/
216	for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {	216	for (cur = zone_head.next; cur != &zone_head; cur = cur->next) {
217	z = list_get_instance(cur, zone_t, link);	217	z = list_get_instance(cur, zone_t, link);
218		218
219	spinlock_lock(&z->lock);	219	spinlock_lock(&z->lock);
220		220
221	if (IS_KA(addr))	221	if (IS_KA(addr))
222	addr = KA2PA(addr);	222	addr = KA2PA(addr);
223		223
224	/*	224	/*
225	* Check if addr belongs to z.	225	* Check if addr belongs to z.
226	*/	226	*/
227	if ((addr >= z->base) && (addr <= z->base + (z->free_count + z->busy_count) * FRAME_SIZE)) {	227	if ((addr >= z->base) && (addr <= z->base + (z->free_count + z->busy_count) * FRAME_SIZE)) {
228	zone = z;	228	zone = z;
229	break;	229	break;
230	}	230	}
231	spinlock_unlock(&z->lock);	231	spinlock_unlock(&z->lock);
232	}	232	}
233		233
234	ASSERT(zone != NULL);	234	ASSERT(zone != NULL);
235		235
236	frame = &zone->frames[(addr - zone->base)/FRAME_SIZE];	236	frame = &zone->frames[(addr - zone->base)/FRAME_SIZE];
237		237
238	if (!frame->refcount) {	238	if (!frame->refcount) {
239	frame->refcount++;	239	frame->refcount++;
240		240
241	list_remove(&frame->link); /* remove frame from free_head */	241	list_remove(&frame->link); /* remove frame from free_head */
242	zone->free_count--;	242	zone->free_count--;
243	zone->busy_count++;	243	zone->busy_count++;
244	}	244	}
245		245
246	spinlock_unlock(&zone->lock);	246	spinlock_unlock(&zone->lock);
247		247
248	spinlock_unlock(&zone_head_lock);	248	spinlock_unlock(&zone_head_lock);
249	cpu_priority_restore(pri);	249	interrupts_restore(ipl);
250	}	250	}
251		251
252	/** Mark frame region not free.	252	/** Mark frame region not free.
253	*	253	*
254	* Mark frame region not free.	254	* Mark frame region not free.
255	*	255	*
256	* @param start First address.	256	* @param start First address.
257	* @param stop Last address.	257	* @param stop Last address.
258	*/	258	*/
259	void frame_region_not_free(__address start, __address stop)	259	void frame_region_not_free(__address start, __address stop)
260	{	260	{
261	__address a;	261	__address a;
262		262
263	start /= FRAME_SIZE;	263	start /= FRAME_SIZE;
264	stop /= FRAME_SIZE;	264	stop /= FRAME_SIZE;
265	for (a = start; a <= stop; a++)	265	for (a = start; a <= stop; a++)
266	frame_not_free(a * FRAME_SIZE);	266	frame_not_free(a * FRAME_SIZE);
267	}	267	}
268		268
269		269
270	/** Initialize zonekeeping	270	/** Initialize zonekeeping
271	*	271	*
272	* Initialize zonekeeping.	272	* Initialize zonekeeping.
273	*/	273	*/
274	void zone_init(void)	274	void zone_init(void)
275	{	275	{
276	spinlock_initialize(&zone_head_lock);	276	spinlock_initialize(&zone_head_lock);
277	list_initialize(&zone_head);	277	list_initialize(&zone_head);
278	}	278	}
279		279
280	/** Create frame zone	280	/** Create frame zone
281	*	281	*
282	* Create new frame zone.	282	* Create new frame zone.
283	*	283	*
284	* @param start Physical address of the first frame within the zone.	284	* @param start Physical address of the first frame within the zone.
285	* @param size Size of the zone. Must be a multiple of FRAME_SIZE.	285	* @param size Size of the zone. Must be a multiple of FRAME_SIZE.
286	* @param flags Zone flags.	286	* @param flags Zone flags.
287	*	287	*
288	* @return Initialized zone.	288	* @return Initialized zone.
289	*/	289	*/
290	zone_t *zone_create(__address start, size_t size, int flags)	290	zone_t *zone_create(__address start, size_t size, int flags)
291	{	291	{
292	zone_t *z;	292	zone_t *z;
293	count_t cnt;	293	count_t cnt;
294	int i;	294	int i;
295		295
296	ASSERT(start % FRAME_SIZE == 0);	296	ASSERT(start % FRAME_SIZE == 0);
297	ASSERT(size % FRAME_SIZE == 0);	297	ASSERT(size % FRAME_SIZE == 0);
298		298
299	cnt = size / FRAME_SIZE;	299	cnt = size / FRAME_SIZE;
300		300
301	z = (zone_t *) early_malloc(sizeof(zone_t));	301	z = (zone_t *) early_malloc(sizeof(zone_t));
302	if (z) {	302	if (z) {
303	link_initialize(&z->link);	303	link_initialize(&z->link);
304	spinlock_initialize(&z->lock);	304	spinlock_initialize(&z->lock);
305		305
306	z->base = start;	306	z->base = start;
307	z->flags = flags;	307	z->flags = flags;
308		308
309	z->free_count = cnt;	309	z->free_count = cnt;
310	list_initialize(&z->free_head);	310	list_initialize(&z->free_head);
311		311
312	z->busy_count = 0;	312	z->busy_count = 0;
313		313
314	z->frames = (frame_t ) early_malloc(cnt sizeof(frame_t));	314	z->frames = (frame_t ) early_malloc(cnt sizeof(frame_t));
315	if (!z->frames) {	315	if (!z->frames) {
316	early_free(z);	316	early_free(z);
317	return NULL;	317	return NULL;
318	}	318	}
319		319
320	for (i = 0; i<cnt; i++) {	320	for (i = 0; i<cnt; i++) {
321	frame_initialize(&z->frames[i], z);	321	frame_initialize(&z->frames[i], z);
322	list_append(&z->frames[i].link, &z->free_head);	322	list_append(&z->frames[i].link, &z->free_head);
323	}	323	}
324		324
325	}	325	}
326		326
327	return z;	327	return z;
328	}	328	}
329		329
330	/** Attach frame zone	330	/** Attach frame zone
331	*	331	*
332	* Attach frame zone to zone list.	332	* Attach frame zone to zone list.
333	*	333	*
334	* @param zone Zone to be attached.	334	* @param zone Zone to be attached.
335	*/	335	*/
336	void zone_attach(zone_t *zone)	336	void zone_attach(zone_t *zone)
337	{	337	{
338	pri_t pri;	338	ipl_t ipl;
339		339
340	pri = cpu_priority_high();	340	ipl = interrupts_disable();
341	spinlock_lock(&zone_head_lock);	341	spinlock_lock(&zone_head_lock);
342		342
343	list_append(&zone->link, &zone_head);	343	list_append(&zone->link, &zone_head);
344		344
345	spinlock_unlock(&zone_head_lock);	345	spinlock_unlock(&zone_head_lock);
346	cpu_priority_restore(pri);	346	interrupts_restore(ipl);
347	}	347	}
348		348
349	/** Initialize frame structure	349	/** Initialize frame structure
350	*	350	*
351	* Initialize frame structure.	351	* Initialize frame structure.
352	*	352	*
353	* @param frame Frame structure to be initialized.	353	* @param frame Frame structure to be initialized.
354	* @param zone Host frame zone.	354	* @param zone Host frame zone.
355	*/	355	*/
356	void frame_initialize(frame_t frame, zone_t zone)	356	void frame_initialize(frame_t frame, zone_t zone)
357	{	357	{
358	frame->refcount = 0;	358	frame->refcount = 0;
359	link_initialize(&frame->link);	359	link_initialize(&frame->link);
360	}	360	}
361		361

Subversion Repositories HelenOS-historic

(root)/SPARTAN/trunk/src/mm/frame.c – Rev 375 → 413