WebSVN – HelenOS-historic – Diff – /kernel/trunk/generic/include/mm/as.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 __AS_H__
#define __AS_H__
 
#include <arch/mm/page.h>
#include <arch/mm/as.h>
#include <arch/mm/asid.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 as_area_type {
    AS_AREA_TEXT = 1, AS_AREA_DATA, AS_AREA_STACK
};
 
/** Address space area structure.
 *
 * Each as_area_t structure describes one contiguous area of virtual memory.
 * In the future, it should not be difficult to support shared areas.
 */
struct as_area {
    SPINLOCK_DECLARE(lock);
    link_t link;
    as_area_type_t type;
    size_t size;        /**< Size of this area. */
    __address base;     /**< Base address of this area. */
    index_t *mapping;   /**< Map of physical frame numbers mapped to virtual page numbers in this area. */
};
 
/** Address space structure.
 *
 * as_t contains the list of as_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 as {
    SPINLOCK_DECLARE(lock);
    link_t as_area_head;
    pte_t *ptl0;
    asid_t asid;            /**< Address space identifier. */
};
 
extern as_t * as_create(pte_t *ptl0);
extern as_area_t *as_area_create(as_t *as, as_area_type_t type, size_t size, __address base);
extern void as_area_set_mapping(as_area_t *a, index_t vpn, index_t pfn);
extern int as_page_fault(__address page);
extern void as_install(as_t *m);
 
/*
 * Each architecture should implement this function.
 * Its main purpose is to do TLB purges according
 * to architecture's requirements. Note that
 * some architectures invalidate their TLB automatically
 * on hardware address space switch (e.g. ia32 and
 * amd64).
 */
#ifndef as_install_arch
extern void as_install_arch(as_t *as);
#endif /* !def as_install_arch */
 
#endif
 

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/include/mm/as.h – Rev 703 → 718

Rev 703		Rev 718
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 __AS_H__	29	#ifndef __AS_H__
30	#define __AS_H__	30	#define __AS_H__
31		31
32	#include <arch/mm/page.h>	32	#include <arch/mm/page.h>
33	#include <arch/mm/as.h>	33	#include <arch/mm/as.h>
34	#include <arch/mm/asid.h>	34	#include <arch/mm/asid.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 <list.h>	38	#include <list.h>
39		39
40	#define KERNEL_ADDRESS_SPACE_START KERNEL_ADDRESS_SPACE_START_ARCH	40	#define KERNEL_ADDRESS_SPACE_START KERNEL_ADDRESS_SPACE_START_ARCH
41	#define KERNEL_ADDRESS_SPACE_END KERNEL_ADDRESS_SPACE_END_ARCH	41	#define KERNEL_ADDRESS_SPACE_END KERNEL_ADDRESS_SPACE_END_ARCH
42	#define USER_ADDRESS_SPACE_START USER_ADDRESS_SPACE_START_ARCH	42	#define USER_ADDRESS_SPACE_START USER_ADDRESS_SPACE_START_ARCH
43	#define USER_ADDRESS_SPACE_END USER_ADDRESS_SPACE_END_ARCH	43	#define USER_ADDRESS_SPACE_END USER_ADDRESS_SPACE_END_ARCH
44		44
45	#define IS_KA(addr) ((addr)>=KERNEL_ADDRESS_SPACE_START && (addr)<=KERNEL_ADDRESS_SPACE_END)	45	#define IS_KA(addr) ((addr)>=KERNEL_ADDRESS_SPACE_START && (addr)<=KERNEL_ADDRESS_SPACE_END)
46		46
47	#define UTEXT_ADDRESS UTEXT_ADDRESS_ARCH	47	#define UTEXT_ADDRESS UTEXT_ADDRESS_ARCH
48	#define USTACK_ADDRESS USTACK_ADDRESS_ARCH	48	#define USTACK_ADDRESS USTACK_ADDRESS_ARCH
49	#define UDATA_ADDRESS UDATA_ADDRESS_ARCH	49	#define UDATA_ADDRESS UDATA_ADDRESS_ARCH
50		50
51	enum as_area_type {	51	enum as_area_type {
52	AS_AREA_TEXT = 1, AS_AREA_DATA, AS_AREA_STACK	52	AS_AREA_TEXT = 1, AS_AREA_DATA, AS_AREA_STACK
53	};	53	};
54		54
55	/** Address space area structure.	55	/** Address space area structure.
56	*	56	*
57	* Each as_area_t structure describes one contiguous area of virtual memory.	57	* Each as_area_t structure describes one contiguous area of virtual memory.
58	* In the future, it should not be difficult to support shared areas.	58	* In the future, it should not be difficult to support shared areas.
59	*/	59	*/
60	struct as_area {	60	struct as_area {
61	SPINLOCK_DECLARE(lock);	61	SPINLOCK_DECLARE(lock);
62	link_t link;	62	link_t link;
63	as_area_type_t type;	63	as_area_type_t type;
64	size_t size; /*< Size of this area. /	64	size_t size; /*< Size of this area. /
65	__address base; /*< Base address of this area. /	65	__address base; /*< Base address of this area. /
66	index_t mapping; /< Map of physical frame numbers mapped to virtual page numbers in this area. /	66	index_t mapping; /< Map of physical frame numbers mapped to virtual page numbers in this area. /
67	};	67	};
68		68
69	/** Address space structure.	69	/** Address space structure.
70	*	70	*
71	* as_t contains the list of as_areas of userspace accessible	71	* as_t contains the list of as_areas of userspace accessible
72	* pages for one or more tasks. Ranges of kernel memory pages are not	72	* pages for one or more tasks. Ranges of kernel memory pages are not
73	* supposed to figure in the list as they are shared by all tasks and	73	* supposed to figure in the list as they are shared by all tasks and
74	* set up during system initialization.	74	* set up during system initialization.
75	*/	75	*/
76	struct as {	76	struct as {
77	SPINLOCK_DECLARE(lock);	77	SPINLOCK_DECLARE(lock);
78	link_t as_area_head;	78	link_t as_area_head;
79	pte_t *ptl0;	79	pte_t *ptl0;
80	asid_t asid; /*< Address space identifier. /	80	asid_t asid; /*< Address space identifier. /
81	};	81	};
82		82
83	extern as_t * as_create(pte_t *ptl0);	83	extern as_t * as_create(pte_t *ptl0);
84	extern as_area_t as_area_create(as_t as, as_area_type_t type, size_t size, __address base);	84	extern as_area_t as_area_create(as_t as, as_area_type_t type, size_t size, __address base);
85	extern void as_area_load_mapping(as_area_t a, index_t pfn);	85	extern void as_area_set_mapping(as_area_t *a, index_t vpn, index_t pfn);
86	extern int as_page_fault(__address page);	86	extern int as_page_fault(__address page);
87	extern void as_install(as_t *m);	87	extern void as_install(as_t *m);
88		88
89	/*	89	/*
90	* Each architecture should implement this function.	90	* Each architecture should implement this function.
91	* Its main purpose is to do TLB purges according	91	* Its main purpose is to do TLB purges according
92	* to architecture's requirements. Note that	92	* to architecture's requirements. Note that
93	* some architectures invalidate their TLB automatically	93	* some architectures invalidate their TLB automatically
94	* on hardware address space switch (e.g. ia32 and	94	* on hardware address space switch (e.g. ia32 and
95	* amd64).	95	* amd64).
96	*/	96	*/
97	#ifndef as_install_arch	97	#ifndef as_install_arch
98	extern void as_install_arch(as_t *as);	98	extern void as_install_arch(as_t *as);
99	#endif /* !def as_install_arch */	99	#endif /* !def as_install_arch */
100		100
101	#endif	101	#endif
102		102