WebSVN – HelenOS-historic – Diff – /kernel/trunk/arch/mips32/include/mm/page.h


/*
 * Copyright (C) 2003-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 __mips32_PAGE_H__
#define __mips32_PAGE_H__
 
#include <arch/mm/frame.h>
 
#define PAGE_WIDTH  FRAME_WIDTH
#define PAGE_SIZE   FRAME_SIZE
 
#ifndef __ASM__
#  define KA2PA(x)  (((__address) (x)) - 0x80000000)
#  define PA2KA(x)  (((__address) (x)) + 0x80000000)
#else
#  define KA2PA(x)  ((x) - 0x80000000)
#  define PA2KA(x)  ((x) + 0x80000000)
#endif
 
#ifdef KERNEL
 
/*
 * Implementation of generic 4-level page table interface.
 * NOTE: this implementation is under construction
 *
 * Page table layout:
 * - 32-bit virtual addresses
 * - Offset is 14 bits => pages are 16K long
 * - PTE's use similar format as CP0 EntryLo[01] registers => PTE is therefore 4 bytes long
 * - PTE's replace EntryLo v (valid) bit with p (present) bit
 * - PTE's use only one bit to distinguish between cacheable and uncacheable mappings
 * - PTE's define soft_valid field to ensure there is at least one 1 bit even if the p bit is cleared
 * - PTE's make use of CP0 EntryLo's two-bit reserved field for bit W (writable) and bit A (accessed)
 * - PTL0 has 64 entries (6 bits)
 * - PTL1 is not used
 * - PTL2 is not used
 * - PTL3 has 4096 entries (12 bits)
 */
 
#define PTL0_ENTRIES_ARCH   64
#define PTL1_ENTRIES_ARCH   0
#define PTL2_ENTRIES_ARCH   0
#define PTL3_ENTRIES_ARCH   4096
 
#define PTL0_INDEX_ARCH(vaddr)  ((vaddr)>>26) 
#define PTL1_INDEX_ARCH(vaddr)  0
#define PTL2_INDEX_ARCH(vaddr)  0
#define PTL3_INDEX_ARCH(vaddr)  (((vaddr)>>14) & 0xfff)
 
#define SET_PTL0_ADDRESS_ARCH(ptl0)
 
#define GET_PTL1_ADDRESS_ARCH(ptl0, i)      (((pte_t *)(ptl0))[(i)].pfn<<12)
#define GET_PTL2_ADDRESS_ARCH(ptl1, i)      (ptl1)
#define GET_PTL3_ADDRESS_ARCH(ptl2, i)      (ptl2)
#define GET_FRAME_ADDRESS_ARCH(ptl3, i)     (((pte_t *)(ptl3))[(i)].pfn<<12)
 
#define SET_PTL1_ADDRESS_ARCH(ptl0, i, a)   (((pte_t *)(ptl0))[(i)].pfn = (a)>>12)
#define SET_PTL2_ADDRESS_ARCH(ptl1, i, a)
#define SET_PTL3_ADDRESS_ARCH(ptl2, i, a)
#define SET_FRAME_ADDRESS_ARCH(ptl3, i, a)  (((pte_t *)(ptl3))[(i)].pfn = (a)>>12)
 
#define GET_PTL1_FLAGS_ARCH(ptl0, i)        get_pt_flags((pte_t *)(ptl0), (index_t)(i))
#define GET_PTL2_FLAGS_ARCH(ptl1, i)        PAGE_PRESENT
#define GET_PTL3_FLAGS_ARCH(ptl2, i)        PAGE_PRESENT
#define GET_FRAME_FLAGS_ARCH(ptl3, i)       get_pt_flags((pte_t *)(ptl3), (index_t)(i))
 
#define SET_PTL1_FLAGS_ARCH(ptl0, i, x)     set_pt_flags((pte_t *)(ptl0), (index_t)(i), (x))
#define SET_PTL2_FLAGS_ARCH(ptl1, i, x)
#define SET_PTL3_FLAGS_ARCH(ptl2, i, x)
#define SET_FRAME_FLAGS_ARCH(ptl3, i, x)    set_pt_flags((pte_t *)(ptl3), (index_t)(i), (x))
 
#define PTE_VALID_ARCH(pte)         (*((__u32 *) (pte)) != 0)
#define PTE_PRESENT_ARCH(pte)           ((pte)->p != 0)
#define PTE_GET_FRAME_ARCH(pte)         ((pte)->pfn<<12)
#define PTE_WRITABLE_ARCH(pte)          ((pte)->w != 0)
#define PTE_EXECUTABLE_ARCH(pte)        1
 
#ifndef __ASM__
 
#include <arch/mm/tlb.h>
#include <mm/page.h>
#include <arch/mm/frame.h>
#include <arch/types.h>
 
static inline int get_pt_flags(pte_t *pt, index_t i)
{
    pte_t *p = &pt[i];
   
    return (
        (p->cacheable<<PAGE_CACHEABLE_SHIFT) |
        ((!p->p)<<PAGE_PRESENT_SHIFT) |
        (1<<PAGE_USER_SHIFT) |
        (1<<PAGE_READ_SHIFT) |
        ((p->w)<<PAGE_WRITE_SHIFT) |
        (1<<PAGE_EXEC_SHIFT) |
        (p->g<<PAGE_GLOBAL_SHIFT)
    );
       
}
 
static inline void set_pt_flags(pte_t *pt, index_t i, int flags)
{
    pte_t *p = &pt[i];
   
    p->cacheable = (flags & PAGE_CACHEABLE) != 0;
    p->p = !(flags & PAGE_NOT_PRESENT);
    p->g = (flags & PAGE_GLOBAL) != 0;
    p->w = (flags & PAGE_WRITE) != 0;
   
    /*
     * Ensure that valid entries have at least one bit set.
     */
    p->soft_valid = 1;
}
 
extern void page_arch_init(void);
 
#endif /* __ASM__ */
 
#endif /* KERNEL */
 
#endif
 

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/arch/mips32/include/mm/page.h @ 1702 – Rev 1087 → 1423

Rev 1087		Rev 1423
1	/*	1	/*
2	* Copyright (C) 2003-2004 Jakub Jermar	2	* Copyright (C) 2003-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 __mips32_PAGE_H__	29	#ifndef __mips32_PAGE_H__
30	#define __mips32_PAGE_H__	30	#define __mips32_PAGE_H__
31		31
32	#include <arch/mm/frame.h>	32	#include <arch/mm/frame.h>
33		33
34	#define PAGE_WIDTH FRAME_WIDTH	34	#define PAGE_WIDTH FRAME_WIDTH
35	#define PAGE_SIZE FRAME_SIZE	35	#define PAGE_SIZE FRAME_SIZE
36		36
37	#ifndef __ASM__	37	#ifndef __ASM__
38	# define KA2PA(x) (((__address) (x)) - 0x80000000)	38	# define KA2PA(x) (((__address) (x)) - 0x80000000)
39	# define PA2KA(x) (((__address) (x)) + 0x80000000)	39	# define PA2KA(x) (((__address) (x)) + 0x80000000)
40	#else	40	#else
41	# define KA2PA(x) ((x) - 0x80000000)	41	# define KA2PA(x) ((x) - 0x80000000)
42	# define PA2KA(x) ((x) + 0x80000000)	42	# define PA2KA(x) ((x) + 0x80000000)
43	#endif	43	#endif
44		44
45	#ifdef KERNEL	45	#ifdef KERNEL
46		46
47	/*	47	/*
48	* Implementation of generic 4-level page table interface.	48	* Implementation of generic 4-level page table interface.
49	* NOTE: this implementation is under construction	49	* NOTE: this implementation is under construction
50	*	50	*
51	* Page table layout:	51	* Page table layout:
52	* - 32-bit virtual addresses	52	* - 32-bit virtual addresses
53	* - Offset is 14 bits => pages are 16K long	53	* - Offset is 14 bits => pages are 16K long
54	* - PTE's use similar format as CP0 EntryLo[01] registers => PTE is therefore 4 bytes long	54	* - PTE's use similar format as CP0 EntryLo[01] registers => PTE is therefore 4 bytes long
55	* - PTE's replace EntryLo v (valid) bit with p (present) bit	55	* - PTE's replace EntryLo v (valid) bit with p (present) bit
56	* - PTE's use only one bit to distinguish between cacheable and uncacheable mappings	56	* - PTE's use only one bit to distinguish between cacheable and uncacheable mappings
57	* - PTE's define soft_valid field to ensure there is at least one 1 bit even if the p bit is cleared	57	* - PTE's define soft_valid field to ensure there is at least one 1 bit even if the p bit is cleared
58	* - PTE's make use of CP0 EntryLo's two-bit reserved field for bit W (writable) and bit A (accessed)	58	* - PTE's make use of CP0 EntryLo's two-bit reserved field for bit W (writable) and bit A (accessed)
59	* - PTL0 has 64 entries (6 bits)	59	* - PTL0 has 64 entries (6 bits)
60	* - PTL1 is not used	60	* - PTL1 is not used
61	* - PTL2 is not used	61	* - PTL2 is not used
62	* - PTL3 has 4096 entries (12 bits)	62	* - PTL3 has 4096 entries (12 bits)
63	*/	63	*/
64		64
65	#define PTL0_ENTRIES_ARCH 64	65	#define PTL0_ENTRIES_ARCH 64
66	#define PTL1_ENTRIES_ARCH 0	66	#define PTL1_ENTRIES_ARCH 0
67	#define PTL2_ENTRIES_ARCH 0	67	#define PTL2_ENTRIES_ARCH 0
68	#define PTL3_ENTRIES_ARCH 4096	68	#define PTL3_ENTRIES_ARCH 4096
69		69
70	#define PTL0_INDEX_ARCH(vaddr) ((vaddr)>>26)	70	#define PTL0_INDEX_ARCH(vaddr) ((vaddr)>>26)
71	#define PTL1_INDEX_ARCH(vaddr) 0	71	#define PTL1_INDEX_ARCH(vaddr) 0
72	#define PTL2_INDEX_ARCH(vaddr) 0	72	#define PTL2_INDEX_ARCH(vaddr) 0
73	#define PTL3_INDEX_ARCH(vaddr) (((vaddr)>>14) & 0xfff)	73	#define PTL3_INDEX_ARCH(vaddr) (((vaddr)>>14) & 0xfff)
74		74
75	#define SET_PTL0_ADDRESS_ARCH(ptl0)	75	#define SET_PTL0_ADDRESS_ARCH(ptl0)
76		76
77	#define GET_PTL1_ADDRESS_ARCH(ptl0, i) (((pte_t *)(ptl0))[(i)].pfn<<12)	77	#define GET_PTL1_ADDRESS_ARCH(ptl0, i) (((pte_t *)(ptl0))[(i)].pfn<<12)
78	#define GET_PTL2_ADDRESS_ARCH(ptl1, i) (ptl1)	78	#define GET_PTL2_ADDRESS_ARCH(ptl1, i) (ptl1)
79	#define GET_PTL3_ADDRESS_ARCH(ptl2, i) (ptl2)	79	#define GET_PTL3_ADDRESS_ARCH(ptl2, i) (ptl2)
80	#define GET_FRAME_ADDRESS_ARCH(ptl3, i) (((pte_t *)(ptl3))[(i)].pfn<<12)	80	#define GET_FRAME_ADDRESS_ARCH(ptl3, i) (((pte_t *)(ptl3))[(i)].pfn<<12)
81		81
82	#define SET_PTL1_ADDRESS_ARCH(ptl0, i, a) (((pte_t *)(ptl0))[(i)].pfn = (a)>>12)	82	#define SET_PTL1_ADDRESS_ARCH(ptl0, i, a) (((pte_t *)(ptl0))[(i)].pfn = (a)>>12)
83	#define SET_PTL2_ADDRESS_ARCH(ptl1, i, a)	83	#define SET_PTL2_ADDRESS_ARCH(ptl1, i, a)
84	#define SET_PTL3_ADDRESS_ARCH(ptl2, i, a)	84	#define SET_PTL3_ADDRESS_ARCH(ptl2, i, a)
85	#define SET_FRAME_ADDRESS_ARCH(ptl3, i, a) (((pte_t *)(ptl3))[(i)].pfn = (a)>>12)	85	#define SET_FRAME_ADDRESS_ARCH(ptl3, i, a) (((pte_t *)(ptl3))[(i)].pfn = (a)>>12)
86		86
87	#define GET_PTL1_FLAGS_ARCH(ptl0, i) get_pt_flags((pte_t *)(ptl0), (index_t)(i))	87	#define GET_PTL1_FLAGS_ARCH(ptl0, i) get_pt_flags((pte_t *)(ptl0), (index_t)(i))
88	#define GET_PTL2_FLAGS_ARCH(ptl1, i) PAGE_PRESENT	88	#define GET_PTL2_FLAGS_ARCH(ptl1, i) PAGE_PRESENT
89	#define GET_PTL3_FLAGS_ARCH(ptl2, i) PAGE_PRESENT	89	#define GET_PTL3_FLAGS_ARCH(ptl2, i) PAGE_PRESENT
90	#define GET_FRAME_FLAGS_ARCH(ptl3, i) get_pt_flags((pte_t *)(ptl3), (index_t)(i))	90	#define GET_FRAME_FLAGS_ARCH(ptl3, i) get_pt_flags((pte_t *)(ptl3), (index_t)(i))
91		91
92	#define SET_PTL1_FLAGS_ARCH(ptl0, i, x) set_pt_flags((pte_t *)(ptl0), (index_t)(i), (x))	92	#define SET_PTL1_FLAGS_ARCH(ptl0, i, x) set_pt_flags((pte_t *)(ptl0), (index_t)(i), (x))
93	#define SET_PTL2_FLAGS_ARCH(ptl1, i, x)	93	#define SET_PTL2_FLAGS_ARCH(ptl1, i, x)
94	#define SET_PTL3_FLAGS_ARCH(ptl2, i, x)	94	#define SET_PTL3_FLAGS_ARCH(ptl2, i, x)
95	#define SET_FRAME_FLAGS_ARCH(ptl3, i, x) set_pt_flags((pte_t *)(ptl3), (index_t)(i), (x))	95	#define SET_FRAME_FLAGS_ARCH(ptl3, i, x) set_pt_flags((pte_t *)(ptl3), (index_t)(i), (x))
96		96
97	#define PTE_VALID_ARCH(pte) (((__u32 ) (pte)) != 0)	97	#define PTE_VALID_ARCH(pte) (((__u32 ) (pte)) != 0)
98	#define PTE_PRESENT_ARCH(pte) ((pte)->p != 0)	98	#define PTE_PRESENT_ARCH(pte) ((pte)->p != 0)
99	#define PTE_GET_FRAME_ARCH(pte) ((pte)->pfn<<12)	99	#define PTE_GET_FRAME_ARCH(pte) ((pte)->pfn<<12)
-		100	#define PTE_WRITABLE_ARCH(pte) ((pte)->w != 0)
-		101	#define PTE_EXECUTABLE_ARCH(pte) 1
100		102
101	#ifndef __ASM__	103	#ifndef __ASM__
102		104
103	#include <arch/mm/tlb.h>	105	#include <arch/mm/tlb.h>
104	#include <mm/page.h>	106	#include <mm/page.h>
105	#include <arch/mm/frame.h>	107	#include <arch/mm/frame.h>
106	#include <arch/types.h>	108	#include <arch/types.h>
107		109
108	static inline int get_pt_flags(pte_t *pt, index_t i)	110	static inline int get_pt_flags(pte_t *pt, index_t i)
109	{	111	{
110	pte_t *p = &pt[i];	112	pte_t *p = &pt[i];
111		113
112	return (	114	return (
113	(p->cacheable<<PAGE_CACHEABLE_SHIFT) \|	115	(p->cacheable<<PAGE_CACHEABLE_SHIFT) \|
114	((!p->p)<<PAGE_PRESENT_SHIFT) \|	116	((!p->p)<<PAGE_PRESENT_SHIFT) \|
115	(1<<PAGE_USER_SHIFT) \|	117	(1<<PAGE_USER_SHIFT) \|
116	(1<<PAGE_READ_SHIFT) \|	118	(1<<PAGE_READ_SHIFT) \|
117	((p->w)<<PAGE_WRITE_SHIFT) \|	119	((p->w)<<PAGE_WRITE_SHIFT) \|
118	(1<<PAGE_EXEC_SHIFT) \|	120	(1<<PAGE_EXEC_SHIFT) \|
119	(p->g<<PAGE_GLOBAL_SHIFT)	121	(p->g<<PAGE_GLOBAL_SHIFT)
120	);	122	);
121		123
122	}	124	}
123		125
124	static inline void set_pt_flags(pte_t *pt, index_t i, int flags)	126	static inline void set_pt_flags(pte_t *pt, index_t i, int flags)
125	{	127	{
126	pte_t *p = &pt[i];	128	pte_t *p = &pt[i];
127		129
128	p->cacheable = (flags & PAGE_CACHEABLE) != 0;	130	p->cacheable = (flags & PAGE_CACHEABLE) != 0;
129	p->p = !(flags & PAGE_NOT_PRESENT);	131	p->p = !(flags & PAGE_NOT_PRESENT);
130	p->g = (flags & PAGE_GLOBAL) != 0;	132	p->g = (flags & PAGE_GLOBAL) != 0;
131	p->w = (flags & PAGE_WRITE) != 0;	133	p->w = (flags & PAGE_WRITE) != 0;
132		134
133	/*	135	/*
134	* Ensure that valid entries have at least one bit set.	136	* Ensure that valid entries have at least one bit set.
135	*/	137	*/
136	p->soft_valid = 1;	138	p->soft_valid = 1;
137	}	139	}
138		140
139	extern void page_arch_init(void);	141	extern void page_arch_init(void);
140		142
141	#endif /* __ASM__ */	143	#endif /* __ASM__ */
142		144
143	#endif /* KERNEL */	145	#endif /* KERNEL */
144		146
145	#endif	147	#endif
146		148