WebSVN – HelenOS-historic – Diff – /kernel/trunk/generic/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 <arch/types.h>
#include <func.h>
 
#include <mm/heap.h>
#include <mm/frame.h>
#include <mm/page.h>
#include <mm/vm.h>
#include <arch/mm/page.h>
 
#include <config.h>
#include <memstr.h>
 
#include <panic.h>
 
#include <synch/spinlock.h>
 
#include <arch/asm.h>
#include <arch.h>
 
count_t frames = 0;
count_t frames_free;
 
__u8 *frame_bitmap;
count_t frame_bitmap_octets;
 
static spinlock_t framelock;
 
void frame_init(void)
{
    if (config.cpu_active == 1) {
 
        /*
         * The bootstrap processor will allocate all necessary memory for frame allocation.
         */
 
        frames = config.memory_size / FRAME_SIZE;
        frame_bitmap_octets = frames / 8 + (frames % 8 > 0);
        frame_bitmap = (__u8 *) malloc(frame_bitmap_octets);
        if (!frame_bitmap)
            panic("malloc/frame_bitmap\n");
 
        /*
         * Mark all frames free.
         */
        memsetb((__address) frame_bitmap, frame_bitmap_octets, 0);
        frames_free = frames;
    }
 
    /*
     * No frame allocations/reservations prior this point.
     */
 
    frame_arch_init();
 
    if (config.cpu_active == 1) {
        /*
         * Create the memory address space map. Marked frames and frame
         * regions cannot be used for allocation.
         */
        frame_region_not_free(config.base, config.base + config.kernel_size);
    }
}
 
/*
 * Allocate a frame.
 */
__address frame_alloc(int flags)
{
    int i;
    pri_t pri;
   
loop:
    pri = cpu_priority_high();
    spinlock_lock(&framelock);
    if (frames_free) {
        for (i=0; i < frames; i++) {
            int m, n;
       
            m = i / 8;
            n = i % 8;
 
            if ((frame_bitmap[m] & (1<<n)) == 0) {
                frame_bitmap[m] |= (1<<n);
                frames_free--;
                spinlock_unlock(&framelock);
                cpu_priority_restore(pri);
                if (flags & FRAME_KA) return PA2KA(i*FRAME_SIZE);
                return i*FRAME_SIZE;
            }
        }
        panic("frames_free inconsistent (%d)\n", frames_free);
    }
    spinlock_unlock(&framelock);
    cpu_priority_restore(pri);
 
    if (flags & FRAME_PANIC)
        panic("unable to allocate frame\n");
       
    /* TODO: implement sleeping logic here */
    panic("sleep not supported\n");
   
    goto loop;
}
 
/*
 * Free a frame.
 */
void frame_free(__address addr)
{
    pri_t pri;
    __u32 frame;
 
    pri = cpu_priority_high();
    spinlock_lock(&framelock);
   
    frame = IS_KA(addr) ? KA2PA(addr) : addr;
    frame /= FRAME_SIZE;
    if (frame < frames) {
        int m, n;
   
        m = frame / 8;
        n = frame % 8;
   
        if (frame_bitmap[m] & (1<<n)) {
            frame_bitmap[m] &= ~(1<<n);
            frames_free++;
        }
        else panic("frame already free\n");
    }
    else panic("frame number too big\n");
   
    spinlock_unlock(&framelock);
    cpu_priority_restore(pri);
}
 
/*
 * Don't use this function for normal allocation. Use frame_alloc() instead.
 * Use this function to declare that some special frame is not free.
 */
void frame_not_free(__address addr)
{
    pri_t pri;
    __u32 frame;
   
    pri = cpu_priority_high();
    spinlock_lock(&framelock);
    frame = IS_KA(addr) ? KA2PA(addr) : addr;
    frame /= FRAME_SIZE;
    if (frame < frames) {
        int m, n;
 
        m = frame / 8;
        n = frame % 8;
   
        if ((frame_bitmap[m] & (1<<n)) == 0) { 
            frame_bitmap[m] |= (1<<n);
            frames_free--; 
        }
    }
    spinlock_unlock(&framelock);
    cpu_priority_restore(pri);
}
 
void frame_region_not_free(__address start, __address stop)
{
    __u32 i;
 
    start /= FRAME_SIZE;
    stop /= FRAME_SIZE;
    for (i = start; i <= stop; i++)
        frame_not_free(i * FRAME_SIZE);
}
 

Rev 125	Rev 195
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 <arch/types.h>	29	#include <arch/types.h>
30	#include <func.h>	30	#include <func.h>
31		31
32	#include <mm/heap.h>	32	#include <mm/heap.h>
33	#include <mm/frame.h>	33	#include <mm/frame.h>
34	#include <mm/page.h>	34	#include <mm/page.h>
35	#include <mm/vm.h>	35	#include <mm/vm.h>
36	#include <arch/mm/page.h>	36	#include <arch/mm/page.h>
37		37
38	#include <config.h>	38	#include <config.h>
39	#include <memstr.h>	39	#include <memstr.h>
40		40
41	#include <panic.h>	41	#include <panic.h>
42		42
43	#include <synch/spinlock.h>	43	#include <synch/spinlock.h>
44		44
45	#include <arch/asm.h>	45	#include <arch/asm.h>
-		46	#include <arch.h>
46		47
47	count_t frames = 0;	48	count_t frames = 0;
48	count_t frames_free;	49	count_t frames_free;
49		50
50	__u8 *frame_bitmap;	51	__u8 *frame_bitmap;
51	count_t frame_bitmap_octets;	52	count_t frame_bitmap_octets;
52		53
53	static spinlock_t framelock;	54	static spinlock_t framelock;
54		55
55	void frame_init(void)	56	void frame_init(void)
56	{	57	{
57	if (config.cpu_active == 1) {	58	if (config.cpu_active == 1) {
58		59
59	/*	60	/*
60	* The bootstrap processor will allocate all necessary memory for frame allocation.	61	* The bootstrap processor will allocate all necessary memory for frame allocation.
61	*/	62	*/
62		63
63	frames = config.memory_size / FRAME_SIZE;	64	frames = config.memory_size / FRAME_SIZE;
64	frame_bitmap_octets = frames / 8 + (frames % 8 > 0);	65	frame_bitmap_octets = frames / 8 + (frames % 8 > 0);
65	frame_bitmap = (__u8 *) malloc(frame_bitmap_octets);	66	frame_bitmap = (__u8 *) malloc(frame_bitmap_octets);
66	if (!frame_bitmap)	67	if (!frame_bitmap)
67	panic("malloc/frame_bitmap\n");	68	panic("malloc/frame_bitmap\n");
68		69
69	/*	70	/*
70	* Mark all frames free.	71	* Mark all frames free.
71	*/	72	*/
72	memsetb((__address) frame_bitmap, frame_bitmap_octets, 0);	73	memsetb((__address) frame_bitmap, frame_bitmap_octets, 0);
73	frames_free = frames;	74	frames_free = frames;
74	}	75	}
75		76
76	/*	77	/*
77	* No frame allocations/reservations prior this point.	78	* No frame allocations/reservations prior this point.
78	*/	79	*/
79		80
80	frame_arch_init();	81	frame_arch_init();
81		82
82	if (config.cpu_active == 1) {	83	if (config.cpu_active == 1) {
83	/*	84	/*
84	* Create the memory address space map. Marked frames and frame	85	* Create the memory address space map. Marked frames and frame
85	* regions cannot be used for allocation.	86	* regions cannot be used for allocation.
86	*/	87	*/
87	frame_region_not_free(config.base, config.base + config.kernel_size);	88	frame_region_not_free(config.base, config.base + config.kernel_size);
88	}	89	}
89	}	90	}
90		91
91	/*	92	/*
92	* Allocate a frame.	93	* Allocate a frame.
93	*/	94	*/
94	__address frame_alloc(int flags)	95	__address frame_alloc(int flags)
95	{	96	{
96	int i;	97	int i;
97	pri_t pri;	98	pri_t pri;
98		99
99	loop:	100	loop:
100	pri = cpu_priority_high();	101	pri = cpu_priority_high();
101	spinlock_lock(&framelock);	102	spinlock_lock(&framelock);
102	if (frames_free) {	103	if (frames_free) {
103	for (i=0; i < frames; i++) {	104	for (i=0; i < frames; i++) {
104	int m, n;	105	int m, n;
105		106
106	m = i / 8;	107	m = i / 8;
107	n = i % 8;	108	n = i % 8;
108		109
109	if ((frame_bitmap[m] & (1<<n)) == 0) {	110	if ((frame_bitmap[m] & (1<<n)) == 0) {
110	frame_bitmap[m] \|= (1<<n);	111	frame_bitmap[m] \|= (1<<n);
111	frames_free--;	112	frames_free--;
112	spinlock_unlock(&framelock);	113	spinlock_unlock(&framelock);
113	cpu_priority_restore(pri);	114	cpu_priority_restore(pri);
114	if (flags & FRAME_KA) return PA2KA(i*FRAME_SIZE);	115	if (flags & FRAME_KA) return PA2KA(i*FRAME_SIZE);
115	return i*FRAME_SIZE;	116	return i*FRAME_SIZE;
116	}	117	}
117	}	118	}
118	panic("frames_free inconsistent (%d)\n", frames_free);	119	panic("frames_free inconsistent (%d)\n", frames_free);
119	}	120	}
120	spinlock_unlock(&framelock);	121	spinlock_unlock(&framelock);
121	cpu_priority_restore(pri);	122	cpu_priority_restore(pri);
122		123
123	if (flags & FRAME_PANIC)	124	if (flags & FRAME_PANIC)
124	panic("unable to allocate frame\n");	125	panic("unable to allocate frame\n");
125		126
126	/* TODO: implement sleeping logic here */	127	/* TODO: implement sleeping logic here */
127	panic("sleep not supported\n");	128	panic("sleep not supported\n");
128		129
129	goto loop;	130	goto loop;
130	}	131	}
131		132
132	/*	133	/*
133	* Free a frame.	134	* Free a frame.
134	*/	135	*/
135	void frame_free(__address addr)	136	void frame_free(__address addr)
136	{	137	{
137	pri_t pri;	138	pri_t pri;
138	__u32 frame;	139	__u32 frame;
139		140
140	pri = cpu_priority_high();	141	pri = cpu_priority_high();
141	spinlock_lock(&framelock);	142	spinlock_lock(&framelock);
142		143
143	frame = IS_KA(addr) ? KA2PA(addr) : addr;	144	frame = IS_KA(addr) ? KA2PA(addr) : addr;
144	frame /= FRAME_SIZE;	145	frame /= FRAME_SIZE;
145	if (frame < frames) {	146	if (frame < frames) {
146	int m, n;	147	int m, n;
147		148
148	m = frame / 8;	149	m = frame / 8;
149	n = frame % 8;	150	n = frame % 8;
150		151
151	if (frame_bitmap[m] & (1<<n)) {	152	if (frame_bitmap[m] & (1<<n)) {
152	frame_bitmap[m] &= ~(1<<n);	153	frame_bitmap[m] &= ~(1<<n);
153	frames_free++;	154	frames_free++;
154	}	155	}
155	else panic("frame already free\n");	156	else panic("frame already free\n");
156	}	157	}
157	else panic("frame number too big\n");	158	else panic("frame number too big\n");
158		159
159	spinlock_unlock(&framelock);	160	spinlock_unlock(&framelock);
160	cpu_priority_restore(pri);	161	cpu_priority_restore(pri);
161	}	162	}
162		163
163	/*	164	/*
164	* Don't use this function for normal allocation. Use frame_alloc() instead.	165	* Don't use this function for normal allocation. Use frame_alloc() instead.
165	* Use this function to declare that some special frame is not free.	166	* Use this function to declare that some special frame is not free.
166	*/	167	*/
167	void frame_not_free(__address addr)	168	void frame_not_free(__address addr)
168	{	169	{
169	pri_t pri;	170	pri_t pri;
170	__u32 frame;	171	__u32 frame;
171		172
172	pri = cpu_priority_high();	173	pri = cpu_priority_high();
173	spinlock_lock(&framelock);	174	spinlock_lock(&framelock);
174	frame = IS_KA(addr) ? KA2PA(addr) : addr;	175	frame = IS_KA(addr) ? KA2PA(addr) : addr;
175	frame /= FRAME_SIZE;	176	frame /= FRAME_SIZE;
176	if (frame < frames) {	177	if (frame < frames) {
177	int m, n;	178	int m, n;
178		179
179	m = frame / 8;	180	m = frame / 8;
180	n = frame % 8;	181	n = frame % 8;
181		182
182	if ((frame_bitmap[m] & (1<<n)) == 0) {	183	if ((frame_bitmap[m] & (1<<n)) == 0) {
183	frame_bitmap[m] \|= (1<<n);	184	frame_bitmap[m] \|= (1<<n);
184	frames_free--;	185	frames_free--;
185	}	186	}
186	}	187	}
187	spinlock_unlock(&framelock);	188	spinlock_unlock(&framelock);
188	cpu_priority_restore(pri);	189	cpu_priority_restore(pri);
189	}	190	}
190		191
191	void frame_region_not_free(__address start, __address stop)	192	void frame_region_not_free(__address start, __address stop)
192	{	193	{
193	__u32 i;	194	__u32 i;
194		195
195	start /= FRAME_SIZE;	196	start /= FRAME_SIZE;
196	stop /= FRAME_SIZE;	197	stop /= FRAME_SIZE;
197	for (i = start; i <= stop; i++)	198	for (i = start; i <= stop; i++)
198	frame_not_free(i * FRAME_SIZE);	199	frame_not_free(i * FRAME_SIZE);
199	}	200	}
200		201

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/mm/frame.c @ 1766 – Rev 125 → 195