WebSVN – HelenOS – Diff – /SPARTAN/trunk/include/mm/vm.h


/*
 * 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.
 */
 
#ifndef __VM_H__
#define __VM_H__
 
#include <arch/mm/page.h>
#include <arch/mm/vm.h>
#include <arch/types.h>
#include <typedefs.h>
#include <synch/spinlock.h>
#include <list.h>
 
#define KERNEL_ADDRESS_SPACE_START  KERNEL_ADDRESS_SPACE_START_ARCH
#define KERNEL_ADDRESS_SPACE_END    KERNEL_ADDRESS_SPACE_END_ARCH
#define USER_ADDRESS_SPACE_START    USER_ADDRESS_SPACE_START_ARCH
#define USER_ADDRESS_SPACE_END      USER_ADDRESS_SPACE_END_ARCH
 
#define IS_KA(addr) ((addr)>=KERNEL_ADDRESS_SPACE_START && (addr)<=KERNEL_ADDRESS_SPACE_END)
 
#define UTEXT_ADDRESS   UTEXT_ADDRESS_ARCH
#define USTACK_ADDRESS  USTACK_ADDRESS_ARCH
#define UDATA_ADDRESS   UDATA_ADDRESS_ARCH
 
enum vm_type {
    VMA_TEXT = 1, VMA_DATA, VMA_STACK
};
 
/*
 * Each vm_area_t structure describes one continuous area of virtual memory.
 * In the future, it should not be difficult to support shared areas of vm.
 */
struct vm_area {
    spinlock_t lock;
    link_t link;
    vm_type_t type;
    int size;
    __address address;
    __address *mapping;
};
 
/*
 * vm_t contains the list of vm_areas of userspace accessible
 * pages for one or more tasks. Ranges of kernel memory pages are not
 * supposed to figure in the list as they are shared by all tasks and
 * set up during system initialization.
 */
struct vm {
    spinlock_t lock;
    link_t vm_area_head;
    int j;
    pte_t *ptl0;
};
 
extern vm_t * vm_create(void);
extern void vm_destroy(vm_t *m);
 
extern vm_area_t *vm_area_create(vm_t *m, vm_type_t type, size_t size, __address addr);
extern void vm_area_destroy(vm_area_t *a);
 
extern void vm_area_map(vm_area_t *a);
extern void vm_area_unmap(vm_area_t *a);
 
extern void vm_install(vm_t *m);
extern void vm_uninstall(vm_t *m);
 
#endif
 

Subversion Repositories HelenOS

(root)/SPARTAN/trunk/include/mm/vm.h – Rev 72 → 121

Rev 72		Rev 121
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	#ifndef __VM_H__	29	#ifndef __VM_H__
30	#define __VM_H__	30	#define __VM_H__
31		31
-		32	#include <arch/mm/page.h>
32	#include <arch/mm/vm.h>	33	#include <arch/mm/vm.h>
33	#include <arch/types.h>	34	#include <arch/types.h>
34	#include <typedefs.h>	35	#include <typedefs.h>
35	#include <synch/spinlock.h>	36	#include <synch/spinlock.h>
36	#include <list.h>	37	#include <list.h>
37		38
38	#define KERNEL_ADDRESS_SPACE_START KERNEL_ADDRESS_SPACE_START_ARCH	39	#define KERNEL_ADDRESS_SPACE_START KERNEL_ADDRESS_SPACE_START_ARCH
39	#define KERNEL_ADDRESS_SPACE_END KERNEL_ADDRESS_SPACE_END_ARCH	40	#define KERNEL_ADDRESS_SPACE_END KERNEL_ADDRESS_SPACE_END_ARCH
40	#define USER_ADDRESS_SPACE_START USER_ADDRESS_SPACE_START_ARCH	41	#define USER_ADDRESS_SPACE_START USER_ADDRESS_SPACE_START_ARCH
41	#define USER_ADDRESS_SPACE_END USER_ADDRESS_SPACE_END_ARCH	42	#define USER_ADDRESS_SPACE_END USER_ADDRESS_SPACE_END_ARCH
42		43
43	#define IS_KA(addr) ((addr)>=KERNEL_ADDRESS_SPACE_START && (addr)<=KERNEL_ADDRESS_SPACE_END)	44	#define IS_KA(addr) ((addr)>=KERNEL_ADDRESS_SPACE_START && (addr)<=KERNEL_ADDRESS_SPACE_END)
44		45
45	#define UTEXT_ADDRESS UTEXT_ADDRESS_ARCH	46	#define UTEXT_ADDRESS UTEXT_ADDRESS_ARCH
46	#define USTACK_ADDRESS USTACK_ADDRESS_ARCH	47	#define USTACK_ADDRESS USTACK_ADDRESS_ARCH
47	#define UDATA_ADDRESS UDATA_ADDRESS_ARCH	48	#define UDATA_ADDRESS UDATA_ADDRESS_ARCH
48		49
49	enum vm_type {	50	enum vm_type {
50	VMA_TEXT = 1, VMA_DATA, VMA_STACK	51	VMA_TEXT = 1, VMA_DATA, VMA_STACK
51	};	52	};
52		53
53	/*	54	/*
54	* Each vm_area structure describes one continuous area of virtual memory.	55	* Each vm_area_t structure describes one continuous area of virtual memory.
55	* In the future, it should not be difficult to support shared areas of vm.	56	* In the future, it should not be difficult to support shared areas of vm.
56	*/	57	*/
57	struct vm_area {	58	struct vm_area {
58	spinlock_t lock;	59	spinlock_t lock;
59	link_t link;	60	link_t link;
60	vm_type_t type;	61	vm_type_t type;
61	int size;	62	int size;
62	__address address;	63	__address address;
63	__address *mapping;	64	__address *mapping;
64	};	65	};
65		66
66	/*	67	/*
67	* vm_mapping_t contains the list of vm_areas of userspace accessible	68	* vm_t contains the list of vm_areas of userspace accessible
68	* pages for one or more tasks. Ranges of kernel memory pages are not	69	* pages for one or more tasks. Ranges of kernel memory pages are not
69	* supposed to figure in the list as they are shared by all tasks and	70	* supposed to figure in the list as they are shared by all tasks and
70	* set up during system initialization.	71	* set up during system initialization.
71	*/	72	*/
72	struct vm {	73	struct vm {
73	spinlock_t lock;	74	spinlock_t lock;
74	link_t vm_area_head;	75	link_t vm_area_head;
-		76	int j;
-		77	pte_t *ptl0;
75	};	78	};
76		79
77	extern vm_t * vm_create(void);	80	extern vm_t * vm_create(void);
78	extern void vm_destroy(vm_t *m);	81	extern void vm_destroy(vm_t *m);
79		82
80	extern vm_area_t vm_area_create(vm_t m, vm_type_t type, size_t size, __address addr);	83	extern vm_area_t vm_area_create(vm_t m, vm_type_t type, size_t size, __address addr);
81	extern void vm_area_destroy(vm_area_t *a);	84	extern void vm_area_destroy(vm_area_t *a);
82		85
83	extern void vm_area_map(vm_area_t *a);	86	extern void vm_area_map(vm_area_t *a);
84	extern void vm_area_unmap(vm_area_t *a);	87	extern void vm_area_unmap(vm_area_t *a);
85		88
86	extern void vm_install(vm_t *m);	89	extern void vm_install(vm_t *m);
87	extern void vm_uninstall(vm_t *m);	90	extern void vm_uninstall(vm_t *m);
88		91
89	#endif	92	#endif
90		93