WebSVN – HelenOS – Diff – /SPARTAN/trunk/src/mm/vm.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 <mm/vm.h>
#include <mm/page.h>
#include <mm/frame.h>
#include <mm/tlb.h>
#include <mm/heap.h>
#include <arch/mm/page.h>
#include <arch/types.h>
#include <typedefs.h>
#include <synch/spinlock.h>
#include <config.h>
#include <list.h>
#include <panic.h>
#include <arch/asm.h>
 
vm_t *vm_create(void)
{
    vm_t *m;
   
    m = (vm_t *) malloc(sizeof(vm_t));
    if (m) {
        spinlock_initialize(&m->lock);
        list_initialize(&m->vm_area_head);
    }
   
    return m;
}
 
void vm_destroy(vm_t *m)
{
}
 
vm_area_t *vm_area_create(vm_t *m, vm_type_t type, size_t size, __address addr)
{
    pri_t pri;
    vm_area_t *a;
   
    if (addr % PAGE_SIZE)
        panic("addr not aligned to a page boundary");
   
    pri = cpu_priority_high();
    spinlock_lock(&m->lock);
   
    /*
     * TODO: test vm_area which is to be created doesn't overlap with an existing one.
     */
   
    a = (vm_area_t *) malloc(sizeof(vm_area_t));
    if (a) {
        int i;
   
        a->mapping = (__address *) malloc(size * sizeof(__address));
        if (!a->mapping) {
            free(a);
            spinlock_unlock(&m->lock);
            cpu_priority_restore(pri);
            return NULL;
        }
       
        for (i=0; i<size; i++)
            a->mapping[i] = frame_alloc(0);
       
        spinlock_initialize(&a->lock);
           
        link_initialize(&a->link);         
        a->type = type;
        a->size = size;
        a->address = addr;
       
        list_append(&a->link, &m->vm_area_head);
 
    }
 
    spinlock_unlock(&m->lock);
    cpu_priority_restore(pri);
   
    return a;
}
 
void vm_area_destroy(vm_area_t *a)
{
}
 
void vm_area_map(vm_area_t *a)
{
    int i, flags;
    pri_t pri;
   
    pri = cpu_priority_high();
    spinlock_lock(&a->lock);
 
    switch (a->type) {
        case VMA_TEXT:
            flags = PAGE_EXEC | PAGE_READ | PAGE_USER | PAGE_PRESENT | PAGE_CACHEABLE;
            break;
        case VMA_DATA:
        case VMA_STACK:
            flags = PAGE_READ | PAGE_WRITE | PAGE_USER | PAGE_PRESENT | PAGE_CACHEABLE;
            break;
        default:
            panic("unexpected vm_type_t %d", a->type);
    }
   
    for (i=0; i<a->size; i++)
        map_page_to_frame(a->address + i*PAGE_SIZE, a->mapping[i], flags, 0);
       
    spinlock_unlock(&a->lock);
    cpu_priority_restore(pri);
}
 
void vm_area_unmap(vm_area_t *a)
{
    int i;
    pri_t pri;
   
    pri = cpu_priority_high();
    spinlock_lock(&a->lock);
 
    for (i=0; i<a->size; i++)      
        map_page_to_frame(a->address + i*PAGE_SIZE, 0, PAGE_NOT_PRESENT, 0);
   
    spinlock_unlock(&a->lock);
    cpu_priority_restore(pri);
}
 
void vm_install(vm_t *m)
{
    link_t *l;
    pri_t pri;
   
    pri = cpu_priority_high();
    spinlock_lock(&m->lock);
 
    for(l = m->vm_area_head.next; l != &m->vm_area_head; l = l->next)
        vm_area_map(list_get_instance(l, vm_area_t, link));
 
    spinlock_unlock(&m->lock);
    cpu_priority_restore(pri);
}
 
void vm_uninstall(vm_t *m)
{
    link_t *l;
    pri_t pri;
   
    pri = cpu_priority_high();
 
    tlb_shootdown_start();
 
    spinlock_lock(&m->lock);
 
    for(l = m->vm_area_head.next; l != &m->vm_area_head; l = l->next)
        vm_area_unmap(list_get_instance(l, vm_area_t, link));
 
    spinlock_unlock(&m->lock);
 
    tlb_shootdown_finalize();
 
    cpu_priority_restore(pri);
}
 

Rev 72	Rev 115
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 <mm/vm.h>	29	#include <mm/vm.h>
30	#include <mm/page.h>	30	#include <mm/page.h>
31	#include <mm/frame.h>	31	#include <mm/frame.h>
32	#include <mm/tlb.h>	32	#include <mm/tlb.h>
33	#include <mm/heap.h>	33	#include <mm/heap.h>
34	#include <arch/mm/page.h>	34	#include <arch/mm/page.h>
35	#include <arch/types.h>	35	#include <arch/types.h>
36	#include <typedefs.h>	36	#include <typedefs.h>
37	#include <synch/spinlock.h>	37	#include <synch/spinlock.h>
38	#include <config.h>	38	#include <config.h>
39	#include <list.h>	39	#include <list.h>
40	#include <panic.h>	40	#include <panic.h>
-		41	#include <arch/asm.h>
41		42
42	vm_t *vm_create(void)	43	vm_t *vm_create(void)
43	{	44	{
44	vm_t *m;	45	vm_t *m;
45		46
46	m = (vm_t *) malloc(sizeof(vm_t));	47	m = (vm_t *) malloc(sizeof(vm_t));
47	if (m) {	48	if (m) {
48	spinlock_initialize(&m->lock);	49	spinlock_initialize(&m->lock);
49	list_initialize(&m->vm_area_head);	50	list_initialize(&m->vm_area_head);
50	}	51	}
51		52
52	return m;	53	return m;
53	}	54	}
54		55
55	void vm_destroy(vm_t *m)	56	void vm_destroy(vm_t *m)
56	{	57	{
57	}	58	}
58		59
59	vm_area_t vm_area_create(vm_t m, vm_type_t type, size_t size, __address addr)	60	vm_area_t vm_area_create(vm_t m, vm_type_t type, size_t size, __address addr)
60	{	61	{
61	pri_t pri;	62	pri_t pri;
62	vm_area_t *a;	63	vm_area_t *a;
63		64
64	if (addr % PAGE_SIZE)	65	if (addr % PAGE_SIZE)
65	panic("addr not aligned to a page boundary");	66	panic("addr not aligned to a page boundary");
66		67
67	pri = cpu_priority_high();	68	pri = cpu_priority_high();
68	spinlock_lock(&m->lock);	69	spinlock_lock(&m->lock);
69		70
70	/*	71	/*
71	* TODO: test vm_area which is to be created doesn't overlap with an existing one.	72	* TODO: test vm_area which is to be created doesn't overlap with an existing one.
72	*/	73	*/
73		74
74	a = (vm_area_t *) malloc(sizeof(vm_area_t));	75	a = (vm_area_t *) malloc(sizeof(vm_area_t));
75	if (a) {	76	if (a) {
76	int i;	77	int i;
77		78
78	a->mapping = (__address ) malloc(size sizeof(__address));	79	a->mapping = (__address ) malloc(size sizeof(__address));
79	if (!a->mapping) {	80	if (!a->mapping) {
80	free(a);	81	free(a);
81	spinlock_unlock(&m->lock);	82	spinlock_unlock(&m->lock);
82	cpu_priority_restore(pri);	83	cpu_priority_restore(pri);
83	return NULL;	84	return NULL;
84	}	85	}
85		86
86	for (i=0; i<size; i++)	87	for (i=0; i<size; i++)
87	a->mapping[i] = frame_alloc(0);	88	a->mapping[i] = frame_alloc(0);
88		89
89	spinlock_initialize(&a->lock);	90	spinlock_initialize(&a->lock);
90		91
91	link_initialize(&a->link);	92	link_initialize(&a->link);
92	a->type = type;	93	a->type = type;
93	a->size = size;	94	a->size = size;
94	a->address = addr;	95	a->address = addr;
95		96
96	list_append(&a->link, &m->vm_area_head);	97	list_append(&a->link, &m->vm_area_head);
97		98
98	}	99	}
99		100
100	spinlock_unlock(&m->lock);	101	spinlock_unlock(&m->lock);
101	cpu_priority_restore(pri);	102	cpu_priority_restore(pri);
102		103
103	return a;	104	return a;
104	}	105	}
105		106
106	void vm_area_destroy(vm_area_t *a)	107	void vm_area_destroy(vm_area_t *a)
107	{	108	{
108	}	109	}
109		110
110	void vm_area_map(vm_area_t *a)	111	void vm_area_map(vm_area_t *a)
111	{	112	{
112	int i, flags;	113	int i, flags;
113	pri_t pri;	114	pri_t pri;
114		115
115	pri = cpu_priority_high();	116	pri = cpu_priority_high();
116	spinlock_lock(&a->lock);	117	spinlock_lock(&a->lock);
117		118
118	switch (a->type) {	119	switch (a->type) {
119	case VMA_TEXT:	120	case VMA_TEXT:
120	flags = PAGE_EXEC \| PAGE_READ \| PAGE_USER \| PAGE_PRESENT \| PAGE_CACHEABLE;	121	flags = PAGE_EXEC \| PAGE_READ \| PAGE_USER \| PAGE_PRESENT \| PAGE_CACHEABLE;
121	break;	122	break;
122	case VMA_DATA:	123	case VMA_DATA:
123	case VMA_STACK:	124	case VMA_STACK:
124	flags = PAGE_READ \| PAGE_WRITE \| PAGE_USER \| PAGE_PRESENT \| PAGE_CACHEABLE;	125	flags = PAGE_READ \| PAGE_WRITE \| PAGE_USER \| PAGE_PRESENT \| PAGE_CACHEABLE;
125	break;	126	break;
126	default:	127	default:
127	panic("unexpected vm_type_t %d", a->type);	128	panic("unexpected vm_type_t %d", a->type);
128	}	129	}
129		130
130	for (i=0; i<a->size; i++)	131	for (i=0; i<a->size; i++)
131	map_page_to_frame(a->address + i*PAGE_SIZE, a->mapping[i], flags, 0);	132	map_page_to_frame(a->address + i*PAGE_SIZE, a->mapping[i], flags, 0);
132		133
133	spinlock_unlock(&a->lock);	134	spinlock_unlock(&a->lock);
134	cpu_priority_restore(pri);	135	cpu_priority_restore(pri);
135	}	136	}
136		137
137	void vm_area_unmap(vm_area_t *a)	138	void vm_area_unmap(vm_area_t *a)
138	{	139	{
139	int i;	140	int i;
140	pri_t pri;	141	pri_t pri;
141		142
142	pri = cpu_priority_high();	143	pri = cpu_priority_high();
143	spinlock_lock(&a->lock);	144	spinlock_lock(&a->lock);
144		145
145	for (i=0; i<a->size; i++)	146	for (i=0; i<a->size; i++)
146	map_page_to_frame(a->address + i*PAGE_SIZE, 0, PAGE_NOT_PRESENT, 0);	147	map_page_to_frame(a->address + i*PAGE_SIZE, 0, PAGE_NOT_PRESENT, 0);
147		148
148	spinlock_unlock(&a->lock);	149	spinlock_unlock(&a->lock);
149	cpu_priority_restore(pri);	150	cpu_priority_restore(pri);
150	}	151	}
151		152
152	void vm_install(vm_t *m)	153	void vm_install(vm_t *m)
153	{	154	{
154	link_t *l;	155	link_t *l;
155	pri_t pri;	156	pri_t pri;
156		157
157	pri = cpu_priority_high();	158	pri = cpu_priority_high();
158	spinlock_lock(&m->lock);	159	spinlock_lock(&m->lock);
159		160
160	for(l = m->vm_area_head.next; l != &m->vm_area_head; l = l->next)	161	for(l = m->vm_area_head.next; l != &m->vm_area_head; l = l->next)
161	vm_area_map(list_get_instance(l, vm_area_t, link));	162	vm_area_map(list_get_instance(l, vm_area_t, link));
162		163
163	spinlock_unlock(&m->lock);	164	spinlock_unlock(&m->lock);
164	cpu_priority_restore(pri);	165	cpu_priority_restore(pri);
165	}	166	}
166		167
167	void vm_uninstall(vm_t *m)	168	void vm_uninstall(vm_t *m)
168	{	169	{
169	link_t *l;	170	link_t *l;
170	pri_t pri;	171	pri_t pri;
171		172
172	pri = cpu_priority_high();	173	pri = cpu_priority_high();
173		174
174	tlb_shootdown_start();	175	tlb_shootdown_start();
175		176
176	spinlock_lock(&m->lock);	177	spinlock_lock(&m->lock);
177		178
178	for(l = m->vm_area_head.next; l != &m->vm_area_head; l = l->next)	179	for(l = m->vm_area_head.next; l != &m->vm_area_head; l = l->next)
179	vm_area_unmap(list_get_instance(l, vm_area_t, link));	180	vm_area_unmap(list_get_instance(l, vm_area_t, link));
180		181
181	spinlock_unlock(&m->lock);	182	spinlock_unlock(&m->lock);
182		183
183	tlb_shootdown_finalize();	184	tlb_shootdown_finalize();
184		185
185	cpu_priority_restore(pri);	186	cpu_priority_restore(pri);
186	}	187	}
187		188

Subversion Repositories HelenOS

(root)/SPARTAN/trunk/src/mm/vm.c – Rev 72 → 115