WebSVN – HelenOS – Diff – /branches/tracing/kernel/arch/ppc32/include/mm/page.h


/*
 * Copyright (c) 2005 Martin Decky
 * 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.
 */
 
/** @addtogroup ppc32mm
 * @{
 */
/** @file
 */
 
#ifndef KERN_ppc32_PAGE_H_
#define KERN_ppc32_PAGE_H_
 
#include <arch/mm/frame.h>
 
#define PAGE_WIDTH  FRAME_WIDTH
#define PAGE_SIZE   FRAME_SIZE
 
#ifdef KERNEL
 
#ifndef __ASM__
#   define KA2PA(x) (((uintptr_t) (x)) - 0x80000000)
#   define PA2KA(x) (((uintptr_t) (x)) + 0x80000000)
#else
#   define KA2PA(x) ((x) - 0x80000000)
#   define PA2KA(x) ((x) + 0x80000000)
#endif
 
/*
 * Implementation of generic 4-level page table interface,
 * the hardware Page Hash Table is used as cache.
 *
 * Page table layout:
 * - 32-bit virtual addressess
 * - Offset is 12 bits => pages are 4K long
 * - PTL0 has 1024 entries (10 bits)
 * - PTL1 is not used
 * - PTL2 is not used
 * - PLT3 has 1024 entries (10 bits)
 */
 
/* Number of entries in each level. */
#define PTL0_ENTRIES_ARCH   1024
#define PTL1_ENTRIES_ARCH   0
#define PTL2_ENTRIES_ARCH   0
#define PTL3_ENTRIES_ARCH   1024
 
/* Page table sizes for each level. */
#define PTL0_SIZE_ARCH      ONE_FRAME
#define PTL1_SIZE_ARCH      0
#define PTL2_SIZE_ARCH      0
#define PTL3_SIZE_ARCH      ONE_FRAME
 
/* Macros calculating indices into page tables on each level. */
#define PTL0_INDEX_ARCH(vaddr)  (((vaddr) >> 22) & 0x3ff)
#define PTL1_INDEX_ARCH(vaddr)  0
#define PTL2_INDEX_ARCH(vaddr)  0
#define PTL3_INDEX_ARCH(vaddr)  (((vaddr) >> 12) & 0x3ff)
 
/* Get PTE address accessors for each level. */
#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)
 
/* Set PTE address accessors for each level. */
#define SET_PTL0_ADDRESS_ARCH(ptl0)
#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)
 
/* Get PTE flags accessors for each level. */
#define GET_PTL1_FLAGS_ARCH(ptl0, i) \
    get_pt_flags((pte_t *) (ptl0), (size_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), (size_t) (i))
 
/* Set PTE flags accessors for each level. */
#define SET_PTL1_FLAGS_ARCH(ptl0, i, x) \
    set_pt_flags((pte_t *) (ptl0), (size_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), (size_t) (i), (x))
 
/* Macros for querying the last-level PTEs. */
#define PTE_VALID_ARCH(pte)         (*((uint32_t *) (pte)) != 0)
#define PTE_PRESENT_ARCH(pte)           ((pte)->present != 0)
#define PTE_GET_FRAME_ARCH(pte)         ((pte)->pfn << 12)
#define PTE_WRITABLE_ARCH(pte)          1
#define PTE_EXECUTABLE_ARCH(pte)        1
 
#ifndef __ASM__
 
#include <mm/mm.h>
#include <arch/interrupt.h>
 
static inline int get_pt_flags(pte_t *pt, size_t i)
{
    pte_t *p = &pt[i];
   
    return (((!p->page_cache_disable) << PAGE_CACHEABLE_SHIFT) |
        ((!p->present) << PAGE_PRESENT_SHIFT) |
        (1 << PAGE_USER_SHIFT) |
        (1 << PAGE_READ_SHIFT) |
        (1 << PAGE_WRITE_SHIFT) |
        (1 << PAGE_EXEC_SHIFT) |
        (p->global << PAGE_GLOBAL_SHIFT));
}
 
static inline void set_pt_flags(pte_t *pt, size_t i, int flags)
{
    pte_t *p = &pt[i];
   
    p->page_cache_disable = !(flags & PAGE_CACHEABLE);
    p->present = !(flags & PAGE_NOT_PRESENT);
    p->global = (flags & PAGE_GLOBAL) != 0;
    p->valid = 1;
}
 
extern void page_arch_init(void);
 
#endif /* __ASM__ */
 
#endif /* KERNEL */
 
#endif
 
/** @}
 */
 

Subversion Repositories HelenOS

(root)/branches/tracing/kernel/arch/ppc32/include/mm/page.h – Rev 4377 → 4692

Rev 4377		Rev 4692
1	/*	1	/*
2	* Copyright (c) 2005 Martin Decky	2	* Copyright (c) 2005 Martin Decky
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	/** @addtogroup ppc32mm	29	/** @addtogroup ppc32mm
30	* @{	30	* @{
31	*/	31	*/
32	/** @file	32	/** @file
33	*/	33	*/
34		34
35	#ifndef KERN_ppc32_PAGE_H_	35	#ifndef KERN_ppc32_PAGE_H_
36	#define KERN_ppc32_PAGE_H_	36	#define KERN_ppc32_PAGE_H_
37		37
38	#include <arch/mm/frame.h>	38	#include <arch/mm/frame.h>
39		39
40	#define PAGE_WIDTH FRAME_WIDTH	40	#define PAGE_WIDTH FRAME_WIDTH
41	#define PAGE_SIZE FRAME_SIZE	41	#define PAGE_SIZE FRAME_SIZE
42		42
43	#ifdef KERNEL	43	#ifdef KERNEL
44		44
45	#ifndef __ASM__	45	#ifndef __ASM__
46	# define KA2PA(x) (((uintptr_t) (x)) - 0x80000000)	46	# define KA2PA(x) (((uintptr_t) (x)) - 0x80000000)
47	# define PA2KA(x) (((uintptr_t) (x)) + 0x80000000)	47	# define PA2KA(x) (((uintptr_t) (x)) + 0x80000000)
48	#else	48	#else
49	# define KA2PA(x) ((x) - 0x80000000)	49	# define KA2PA(x) ((x) - 0x80000000)
50	# define PA2KA(x) ((x) + 0x80000000)	50	# define PA2KA(x) ((x) + 0x80000000)
51	#endif	51	#endif
52		52
53	/*	53	/*
54	* Implementation of generic 4-level page table interface,	54	* Implementation of generic 4-level page table interface,
55	* the hardware Page Hash Table is used as cache.	55	* the hardware Page Hash Table is used as cache.
56	*	56	*
57	* Page table layout:	57	* Page table layout:
58	* - 32-bit virtual addressess	58	* - 32-bit virtual addressess
59	* - Offset is 12 bits => pages are 4K long	59	* - Offset is 12 bits => pages are 4K long
60	* - PTL0 has 1024 entries (10 bits)	60	* - PTL0 has 1024 entries (10 bits)
61	* - PTL1 is not used	61	* - PTL1 is not used
62	* - PTL2 is not used	62	* - PTL2 is not used
63	* - PLT3 has 1024 entries (10 bits)	63	* - PLT3 has 1024 entries (10 bits)
64	*/	64	*/
65		65
66	/* Number of entries in each level. */	66	/* Number of entries in each level. */
67	#define PTL0_ENTRIES_ARCH 1024	67	#define PTL0_ENTRIES_ARCH 1024
68	#define PTL1_ENTRIES_ARCH 0	68	#define PTL1_ENTRIES_ARCH 0
69	#define PTL2_ENTRIES_ARCH 0	69	#define PTL2_ENTRIES_ARCH 0
70	#define PTL3_ENTRIES_ARCH 1024	70	#define PTL3_ENTRIES_ARCH 1024
71		71
72	/* Page table sizes for each level. */	72	/* Page table sizes for each level. */
73	#define PTL0_SIZE_ARCH ONE_FRAME	73	#define PTL0_SIZE_ARCH ONE_FRAME
74	#define PTL1_SIZE_ARCH 0	74	#define PTL1_SIZE_ARCH 0
75	#define PTL2_SIZE_ARCH 0	75	#define PTL2_SIZE_ARCH 0
76	#define PTL3_SIZE_ARCH ONE_FRAME	76	#define PTL3_SIZE_ARCH ONE_FRAME
77		77
78	/* Macros calculating indices into page tables on each level. */	78	/* Macros calculating indices into page tables on each level. */
79	#define PTL0_INDEX_ARCH(vaddr) (((vaddr) >> 22) & 0x3ff)	79	#define PTL0_INDEX_ARCH(vaddr) (((vaddr) >> 22) & 0x3ff)
80	#define PTL1_INDEX_ARCH(vaddr) 0	80	#define PTL1_INDEX_ARCH(vaddr) 0
81	#define PTL2_INDEX_ARCH(vaddr) 0	81	#define PTL2_INDEX_ARCH(vaddr) 0
82	#define PTL3_INDEX_ARCH(vaddr) (((vaddr) >> 12) & 0x3ff)	82	#define PTL3_INDEX_ARCH(vaddr) (((vaddr) >> 12) & 0x3ff)
83		83
84	/* Get PTE address accessors for each level. */	84	/* Get PTE address accessors for each level. */
85	#define GET_PTL1_ADDRESS_ARCH(ptl0, i) \	85	#define GET_PTL1_ADDRESS_ARCH(ptl0, i) \
86	(((pte_t *) (ptl0))[(i)].pfn << 12)	86	(((pte_t *) (ptl0))[(i)].pfn << 12)
87	#define GET_PTL2_ADDRESS_ARCH(ptl1, i) \	87	#define GET_PTL2_ADDRESS_ARCH(ptl1, i) \
88	(ptl1)	88	(ptl1)
89	#define GET_PTL3_ADDRESS_ARCH(ptl2, i) \	89	#define GET_PTL3_ADDRESS_ARCH(ptl2, i) \
90	(ptl2)	90	(ptl2)
91	#define GET_FRAME_ADDRESS_ARCH(ptl3, i) \	91	#define GET_FRAME_ADDRESS_ARCH(ptl3, i) \
92	(((pte_t *) (ptl3))[(i)].pfn << 12)	92	(((pte_t *) (ptl3))[(i)].pfn << 12)
93		93
94	/* Set PTE address accessors for each level. */	94	/* Set PTE address accessors for each level. */
95	#define SET_PTL0_ADDRESS_ARCH(ptl0)	95	#define SET_PTL0_ADDRESS_ARCH(ptl0)
96	#define SET_PTL1_ADDRESS_ARCH(ptl0, i, a) \	96	#define SET_PTL1_ADDRESS_ARCH(ptl0, i, a) \
97	(((pte_t *) (ptl0))[(i)].pfn = (a) >> 12)	97	(((pte_t *) (ptl0))[(i)].pfn = (a) >> 12)
98	#define SET_PTL2_ADDRESS_ARCH(ptl1, i, a)	98	#define SET_PTL2_ADDRESS_ARCH(ptl1, i, a)
99	#define SET_PTL3_ADDRESS_ARCH(ptl2, i, a)	99	#define SET_PTL3_ADDRESS_ARCH(ptl2, i, a)
100	#define SET_FRAME_ADDRESS_ARCH(ptl3, i, a) \	100	#define SET_FRAME_ADDRESS_ARCH(ptl3, i, a) \
101	(((pte_t *) (ptl3))[(i)].pfn = (a) >> 12)	101	(((pte_t *) (ptl3))[(i)].pfn = (a) >> 12)
102		102
103	/* Get PTE flags accessors for each level. */	103	/* Get PTE flags accessors for each level. */
104	#define GET_PTL1_FLAGS_ARCH(ptl0, i) \	104	#define GET_PTL1_FLAGS_ARCH(ptl0, i) \
105	get_pt_flags((pte_t *) (ptl0), (index_t) (i))	105	get_pt_flags((pte_t *) (ptl0), (size_t) (i))
106	#define GET_PTL2_FLAGS_ARCH(ptl1, i) \	106	#define GET_PTL2_FLAGS_ARCH(ptl1, i) \
107	PAGE_PRESENT	107	PAGE_PRESENT
108	#define GET_PTL3_FLAGS_ARCH(ptl2, i) \	108	#define GET_PTL3_FLAGS_ARCH(ptl2, i) \
109	PAGE_PRESENT	109	PAGE_PRESENT
110	#define GET_FRAME_FLAGS_ARCH(ptl3, i) \	110	#define GET_FRAME_FLAGS_ARCH(ptl3, i) \
111	get_pt_flags((pte_t *) (ptl3), (index_t) (i))	111	get_pt_flags((pte_t *) (ptl3), (size_t) (i))
112		112
113	/* Set PTE flags accessors for each level. */	113	/* Set PTE flags accessors for each level. */
114	#define SET_PTL1_FLAGS_ARCH(ptl0, i, x) \	114	#define SET_PTL1_FLAGS_ARCH(ptl0, i, x) \
115	set_pt_flags((pte_t *) (ptl0), (index_t) (i), (x))	115	set_pt_flags((pte_t *) (ptl0), (size_t) (i), (x))
116	#define SET_PTL2_FLAGS_ARCH(ptl1, i, x)	116	#define SET_PTL2_FLAGS_ARCH(ptl1, i, x)
117	#define SET_PTL3_FLAGS_ARCH(ptl2, i, x)	117	#define SET_PTL3_FLAGS_ARCH(ptl2, i, x)
118	#define SET_FRAME_FLAGS_ARCH(ptl3, i, x) \	118	#define SET_FRAME_FLAGS_ARCH(ptl3, i, x) \
119	set_pt_flags((pte_t *) (ptl3), (index_t) (i), (x))	119	set_pt_flags((pte_t *) (ptl3), (size_t) (i), (x))
120		120
121	/* Macros for querying the last-level PTEs. */	121	/* Macros for querying the last-level PTEs. */
122	#define PTE_VALID_ARCH(pte) (((uint32_t ) (pte)) != 0)	122	#define PTE_VALID_ARCH(pte) (((uint32_t ) (pte)) != 0)
123	#define PTE_PRESENT_ARCH(pte) ((pte)->present != 0)	123	#define PTE_PRESENT_ARCH(pte) ((pte)->present != 0)
124	#define PTE_GET_FRAME_ARCH(pte) ((pte)->pfn << 12)	124	#define PTE_GET_FRAME_ARCH(pte) ((pte)->pfn << 12)
125	#define PTE_WRITABLE_ARCH(pte) 1	125	#define PTE_WRITABLE_ARCH(pte) 1
126	#define PTE_EXECUTABLE_ARCH(pte) 1	126	#define PTE_EXECUTABLE_ARCH(pte) 1
127		127
128	#ifndef __ASM__	128	#ifndef __ASM__
129		129
130	#include <mm/mm.h>	130	#include <mm/mm.h>
131	#include <arch/interrupt.h>	131	#include <arch/interrupt.h>
132		132
133	static inline int get_pt_flags(pte_t *pt, index_t i)	133	static inline int get_pt_flags(pte_t *pt, size_t i)
134	{	134	{
135	pte_t *p = &pt[i];	135	pte_t *p = &pt[i];
136		136
137	return (((!p->page_cache_disable) << PAGE_CACHEABLE_SHIFT) \|	137	return (((!p->page_cache_disable) << PAGE_CACHEABLE_SHIFT) \|
138	((!p->present) << PAGE_PRESENT_SHIFT) \|	138	((!p->present) << PAGE_PRESENT_SHIFT) \|
139	(1 << PAGE_USER_SHIFT) \|	139	(1 << PAGE_USER_SHIFT) \|
140	(1 << PAGE_READ_SHIFT) \|	140	(1 << PAGE_READ_SHIFT) \|
141	(1 << PAGE_WRITE_SHIFT) \|	141	(1 << PAGE_WRITE_SHIFT) \|
142	(1 << PAGE_EXEC_SHIFT) \|	142	(1 << PAGE_EXEC_SHIFT) \|
143	(p->global << PAGE_GLOBAL_SHIFT));	143	(p->global << PAGE_GLOBAL_SHIFT));
144	}	144	}
145		145
146	static inline void set_pt_flags(pte_t *pt, index_t i, int flags)	146	static inline void set_pt_flags(pte_t *pt, size_t i, int flags)
147	{	147	{
148	pte_t *p = &pt[i];	148	pte_t *p = &pt[i];
149		149
150	p->page_cache_disable = !(flags & PAGE_CACHEABLE);	150	p->page_cache_disable = !(flags & PAGE_CACHEABLE);
151	p->present = !(flags & PAGE_NOT_PRESENT);	151	p->present = !(flags & PAGE_NOT_PRESENT);
152	p->global = (flags & PAGE_GLOBAL) != 0;	152	p->global = (flags & PAGE_GLOBAL) != 0;
153	p->valid = 1;	153	p->valid = 1;
154	}	154	}
155		155
156	extern void page_arch_init(void);	156	extern void page_arch_init(void);
157		157
158	#endif /* __ASM__ */	158	#endif /* __ASM__ */
159		159
160	#endif /* KERNEL */	160	#endif /* KERNEL */
161		161
162	#endif	162	#endif
163		163
164	/** @}	164	/** @}
165	*/	165	*/
166		166