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>
#include <debug.h>
#include <memstr.h>
#include <arch.h>
 
#define KAS_START_INDEX     PTL0_INDEX(KERNEL_ADDRESS_SPACE_START)
#define KAS_END_INDEX       PTL0_INDEX(KERNEL_ADDRESS_SPACE_END)
#define KAS_INDICES     (1+(KAS_END_INDEX-KAS_START_INDEX))
 
vm_t *vm_create(pte_t *ptl0)
{
    vm_t *m;
 
    m = (vm_t *) malloc(sizeof(vm_t));
    if (m) {
        spinlock_initialize(&m->lock);
        list_initialize(&m->vm_area_head);
 
        /*
         * Each vm_t is supposed to have its own page table.
         * It is either passed one or it has to allocate and set one up.
         */
        m->ptl0 = ptl0;
        if (!m->ptl0) {
            pte_t *src_ptl0, *dst_ptl0;
       
            src_ptl0 = (pte_t *) PA2KA((__address) GET_PTL0_ADDRESS());
            dst_ptl0 = (pte_t *) frame_alloc(FRAME_KA | FRAME_PANIC);
 
//          memsetb((__address) dst_ptl0, PAGE_SIZE, 0);
//          memcpy((void *) &dst_ptl0[KAS_START_INDEX], (void *) &src_ptl0[KAS_START_INDEX], KAS_INDICES);
           
            memcpy((void *) dst_ptl0,(void *) src_ptl0, PAGE_SIZE);
 
            m->ptl0 = (pte_t *) KA2PA((__address) dst_ptl0);
        }
    }
 
    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, vm_t *m)
{
    int i, flags;
    pri_t pri;
   
    pri = cpu_priority_high();
    spinlock_lock(&m->lock);
    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);
    }
 
    ASSERT(m->ptl0);
    for (i=0; i<a->size; i++)
        map_page_to_frame(a->address + i*PAGE_SIZE, a->mapping[i], flags, (__address) m->ptl0);
       
    spinlock_unlock(&a->lock);
    spinlock_unlock(&m->lock);
    cpu_priority_restore(pri);
}
 
void vm_area_unmap(vm_area_t *a, vm_t *m)
{
    int i;
    pri_t pri;
   
    pri = cpu_priority_high();
    spinlock_lock(&m->lock);
    spinlock_lock(&a->lock);
 
    ASSERT(m->ptl0);
    for (i=0; i<a->size; i++)      
        map_page_to_frame(a->address + i*PAGE_SIZE, 0, PAGE_NOT_PRESENT, (__address) m->ptl0);
   
    spinlock_unlock(&a->lock);
    spinlock_unlock(&m->lock);
    cpu_priority_restore(pri);
}
 
void vm_install(vm_t *m)
{
    link_t *l;
    pri_t pri;
   
    pri = cpu_priority_high();
 
    tlb_shootdown_start();
    spinlock_lock(&m->lock);
 
    ASSERT(m->ptl0);
    SET_PTL0_ADDRESS(m->ptl0);
 
    spinlock_unlock(&m->lock);
    tlb_shootdown_finalize();
 
    cpu_priority_restore(pri);
}
 

Rev 236	Rev 257
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	#include <arch/asm.h>
42	#include <debug.h>	42	#include <debug.h>
43	#include <memstr.h>	43	#include <memstr.h>
44	#include <arch.h>	44	#include <arch.h>
45		45
46	#define KAS_START_INDEX PTL0_INDEX(KERNEL_ADDRESS_SPACE_START)	46	#define KAS_START_INDEX PTL0_INDEX(KERNEL_ADDRESS_SPACE_START)
47	#define KAS_END_INDEX PTL0_INDEX(KERNEL_ADDRESS_SPACE_END)	47	#define KAS_END_INDEX PTL0_INDEX(KERNEL_ADDRESS_SPACE_END)
48	#define KAS_INDICES (1+(KAS_END_INDEX-KAS_START_INDEX))	48	#define KAS_INDICES (1+(KAS_END_INDEX-KAS_START_INDEX))
49		49
50	vm_t vm_create(pte_t ptl0)	50	vm_t vm_create(pte_t ptl0)
51	{	51	{
52	vm_t *m;	52	vm_t *m;
53		53
54	m = (vm_t *) malloc(sizeof(vm_t));	54	m = (vm_t *) malloc(sizeof(vm_t));
55	if (m) {	55	if (m) {
56	spinlock_initialize(&m->lock);	56	spinlock_initialize(&m->lock);
57	list_initialize(&m->vm_area_head);	57	list_initialize(&m->vm_area_head);
58		58
59	/*	59	/*
60	* Each vm_t is supposed to have its own page table.	60	* Each vm_t is supposed to have its own page table.
61	* It is either passed one or it has to allocate and set one up.	61	* It is either passed one or it has to allocate and set one up.
62	*/	62	*/
63	m->ptl0 = ptl0;	63	m->ptl0 = ptl0;
64	if (!m->ptl0) {	64	if (!m->ptl0) {
65	pte_t src_ptl0, dst_ptl0;	65	pte_t src_ptl0, dst_ptl0;
66		66
67	src_ptl0 = (pte_t *) PA2KA((__address) GET_PTL0_ADDRESS());	67	src_ptl0 = (pte_t *) PA2KA((__address) GET_PTL0_ADDRESS());
68	dst_ptl0 = (pte_t *) frame_alloc(FRAME_KA \| FRAME_PANIC);	68	dst_ptl0 = (pte_t *) frame_alloc(FRAME_KA \| FRAME_PANIC);
69		69
70	// memsetb((__address) dst_ptl0, PAGE_SIZE, 0);	70	// memsetb((__address) dst_ptl0, PAGE_SIZE, 0);
71	// memcpy((void ) &dst_ptl0[KAS_START_INDEX], (void ) &src_ptl0[KAS_START_INDEX], KAS_INDICES);	71	// memcpy((void ) &dst_ptl0[KAS_START_INDEX], (void ) &src_ptl0[KAS_START_INDEX], KAS_INDICES);
72		72
73	memcpy((void ) dst_ptl0, (void ) GET_PTL0_ADDRESS() , PAGE_SIZE);	73	memcpy((void ) dst_ptl0,(void ) src_ptl0, PAGE_SIZE);
74		74
75	m->ptl0 = (pte_t *) KA2PA((__address) dst_ptl0);	75	m->ptl0 = (pte_t *) KA2PA((__address) dst_ptl0);
76	}	76	}
77	}	77	}
78		78
79	return m;	79	return m;
80	}	80	}
81		81
82	void vm_destroy(vm_t *m)	82	void vm_destroy(vm_t *m)
83	{	83	{
84	}	84	}
85		85
86	vm_area_t vm_area_create(vm_t m, vm_type_t type, size_t size, __address addr)	86	vm_area_t vm_area_create(vm_t m, vm_type_t type, size_t size, __address addr)
87	{	87	{
88	pri_t pri;	88	pri_t pri;
89	vm_area_t *a;	89	vm_area_t *a;
90		90
91	if (addr % PAGE_SIZE)	91	if (addr % PAGE_SIZE)
92	panic("addr not aligned to a page boundary");	92	panic("addr not aligned to a page boundary");
93		93
94	pri = cpu_priority_high();	94	pri = cpu_priority_high();
95	spinlock_lock(&m->lock);	95	spinlock_lock(&m->lock);
96		96
97	/*	97	/*
98	* TODO: test vm_area which is to be created doesn't overlap with an existing one.	98	* TODO: test vm_area which is to be created doesn't overlap with an existing one.
99	*/	99	*/
100		100
101	a = (vm_area_t *) malloc(sizeof(vm_area_t));	101	a = (vm_area_t *) malloc(sizeof(vm_area_t));
102	if (a) {	102	if (a) {
103	int i;	103	int i;
104		104
105	a->mapping = (__address ) malloc(size sizeof(__address));	105	a->mapping = (__address ) malloc(size sizeof(__address));
106	if (!a->mapping) {	106	if (!a->mapping) {
107	free(a);	107	free(a);
108	spinlock_unlock(&m->lock);	108	spinlock_unlock(&m->lock);
109	cpu_priority_restore(pri);	109	cpu_priority_restore(pri);
110	return NULL;	110	return NULL;
111	}	111	}
112		112
113	for (i=0; i<size; i++)	113	for (i=0; i<size; i++)
114	a->mapping[i] = frame_alloc(0);	114	a->mapping[i] = frame_alloc(0);
115		115
116	spinlock_initialize(&a->lock);	116	spinlock_initialize(&a->lock);
117		117
118	link_initialize(&a->link);	118	link_initialize(&a->link);
119	a->type = type;	119	a->type = type;
120	a->size = size;	120	a->size = size;
121	a->address = addr;	121	a->address = addr;
122		122
123	list_append(&a->link, &m->vm_area_head);	123	list_append(&a->link, &m->vm_area_head);
124		124
125	}	125	}
126		126
127	spinlock_unlock(&m->lock);	127	spinlock_unlock(&m->lock);
128	cpu_priority_restore(pri);	128	cpu_priority_restore(pri);
129		129
130	return a;	130	return a;
131	}	131	}
132		132
133	void vm_area_destroy(vm_area_t *a)	133	void vm_area_destroy(vm_area_t *a)
134	{	134	{
135	}	135	}
136		136
137	void vm_area_map(vm_area_t a, vm_t m)	137	void vm_area_map(vm_area_t a, vm_t m)
138	{	138	{
139	int i, flags;	139	int i, flags;
140	pri_t pri;	140	pri_t pri;
141		141
142	pri = cpu_priority_high();	142	pri = cpu_priority_high();
143	spinlock_lock(&m->lock);	143	spinlock_lock(&m->lock);
144	spinlock_lock(&a->lock);	144	spinlock_lock(&a->lock);
145		145
146	switch (a->type) {	146	switch (a->type) {
147	case VMA_TEXT:	147	case VMA_TEXT:
148	flags = PAGE_EXEC \| PAGE_READ \| PAGE_USER \| PAGE_PRESENT \| PAGE_CACHEABLE;	148	flags = PAGE_EXEC \| PAGE_READ \| PAGE_USER \| PAGE_PRESENT \| PAGE_CACHEABLE;
149	break;	149	break;
150	case VMA_DATA:	150	case VMA_DATA:
151	case VMA_STACK:	151	case VMA_STACK:
152	flags = PAGE_READ \| PAGE_WRITE \| PAGE_USER \| PAGE_PRESENT \| PAGE_CACHEABLE;	152	flags = PAGE_READ \| PAGE_WRITE \| PAGE_USER \| PAGE_PRESENT \| PAGE_CACHEABLE;
153	break;	153	break;
154	default:	154	default:
155	panic("unexpected vm_type_t %d", a->type);	155	panic("unexpected vm_type_t %d", a->type);
156	}	156	}
157		157
158	ASSERT(m->ptl0);	158	ASSERT(m->ptl0);
159	for (i=0; i<a->size; i++)	159	for (i=0; i<a->size; i++)
160	map_page_to_frame(a->address + i*PAGE_SIZE, a->mapping[i], flags, (__address) m->ptl0);	160	map_page_to_frame(a->address + i*PAGE_SIZE, a->mapping[i], flags, (__address) m->ptl0);
161		161
162	spinlock_unlock(&a->lock);	162	spinlock_unlock(&a->lock);
163	spinlock_unlock(&m->lock);	163	spinlock_unlock(&m->lock);
164	cpu_priority_restore(pri);	164	cpu_priority_restore(pri);
165	}	165	}
166		166
167	void vm_area_unmap(vm_area_t a, vm_t m)	167	void vm_area_unmap(vm_area_t a, vm_t m)
168	{	168	{
169	int i;	169	int i;
170	pri_t pri;	170	pri_t pri;
171		171
172	pri = cpu_priority_high();	172	pri = cpu_priority_high();
173	spinlock_lock(&m->lock);	173	spinlock_lock(&m->lock);
174	spinlock_lock(&a->lock);	174	spinlock_lock(&a->lock);
175		175
176	ASSERT(m->ptl0);	176	ASSERT(m->ptl0);
177	for (i=0; i<a->size; i++)	177	for (i=0; i<a->size; i++)
178	map_page_to_frame(a->address + i*PAGE_SIZE, 0, PAGE_NOT_PRESENT, (__address) m->ptl0);	178	map_page_to_frame(a->address + i*PAGE_SIZE, 0, PAGE_NOT_PRESENT, (__address) m->ptl0);
179		179
180	spinlock_unlock(&a->lock);	180	spinlock_unlock(&a->lock);
181	spinlock_unlock(&m->lock);	181	spinlock_unlock(&m->lock);
182	cpu_priority_restore(pri);	182	cpu_priority_restore(pri);
183	}	183	}
184		184
185	void vm_install(vm_t *m)	185	void vm_install(vm_t *m)
186	{	186	{
187	link_t *l;	187	link_t *l;
188	pri_t pri;	188	pri_t pri;
189		189
190	pri = cpu_priority_high();	190	pri = cpu_priority_high();
191		191
192	tlb_shootdown_start();	192	tlb_shootdown_start();
193	spinlock_lock(&m->lock);	193	spinlock_lock(&m->lock);
194		194
195	ASSERT(m->ptl0);	195	ASSERT(m->ptl0);
196	SET_PTL0_ADDRESS(m->ptl0);	196	SET_PTL0_ADDRESS(m->ptl0);
197		197
198	spinlock_unlock(&m->lock);	198	spinlock_unlock(&m->lock);
199	tlb_shootdown_finalize();	199	tlb_shootdown_finalize();
200		200
201	cpu_priority_restore(pri);	201	cpu_priority_restore(pri);
202	}	202	}
203		203

Subversion Repositories HelenOS

(root)/SPARTAN/trunk/src/mm/vm.c – Rev 236 → 257