source: mainline/kernel/arch/ppc32/include/mm/page.h@ c03ee1c

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since c03ee1c was c03ee1c, checked in by Jakub Jermar <jakub@…>, 18 years ago

Improve comments for arch-specific implementations of hierarchical
4-level page tables. Improve formatting.

  • Property mode set to 100644
File size: 4.9 KB
Line 
1/*
2 * Copyright (c) 2005 Martin Decky
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * - Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
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
15 * derived from this software without specific prior written permission.
16 *
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
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
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
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
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29/** @addtogroup ppc32mm
30 * @{
31 */
32/** @file
33 */
34
35#ifndef KERN_ppc32_PAGE_H_
36#define KERN_ppc32_PAGE_H_
37
38#include <arch/mm/frame.h>
39
40#define PAGE_WIDTH FRAME_WIDTH
41#define PAGE_SIZE FRAME_SIZE
42
43#define PAGE_COLOR_BITS 0 /* dummy */
44
45#ifdef KERNEL
46
47#ifndef __ASM__
48# define KA2PA(x) (((uintptr_t) (x)) - 0x80000000)
49# define PA2KA(x) (((uintptr_t) (x)) + 0x80000000)
50#else
51# define KA2PA(x) ((x) - 0x80000000)
52# define PA2KA(x) ((x) + 0x80000000)
53#endif
54
55/*
56 * Implementation of generic 4-level page table interface,
57 * the hardware Page Hash Table is used as cache.
58 *
59 * Page table layout:
60 * - 32-bit virtual addressess
61 * - Offset is 12 bits => pages are 4K long
62 * - PTL0 has 1024 entries (10 bits)
63 * - PTL1 is not used
64 * - PTL2 is not used
65 * - PLT3 has 1024 entries (10 bits)
66 */
67
68/* Number of entries in each level. */
69#define PTL0_ENTRIES_ARCH 1024
70#define PTL1_ENTRIES_ARCH 0
71#define PTL2_ENTRIES_ARCH 0
72#define PTL3_ENTRIES_ARCH 1024
73
74/* Page table sizes for each level. */
75#define PTL0_SIZE_ARCH ONE_FRAME
76#define PTL1_SIZE_ARCH 0
77#define PTL2_SIZE_ARCH 0
78#define PTL3_SIZE_ARCH ONE_FRAME
79
80/* Macros calculating indices into page tables on each level. */
81#define PTL0_INDEX_ARCH(vaddr) (((vaddr) >> 22) & 0x3ff)
82#define PTL1_INDEX_ARCH(vaddr) 0
83#define PTL2_INDEX_ARCH(vaddr) 0
84#define PTL3_INDEX_ARCH(vaddr) (((vaddr) >> 12) & 0x3ff)
85
86/* Get PTE address accessors for each level. */
87#define GET_PTL1_ADDRESS_ARCH(ptl0, i) \
88 (((pte_t *) (ptl0))[(i)].pfn << 12)
89#define GET_PTL2_ADDRESS_ARCH(ptl1, i) \
90 (ptl1)
91#define GET_PTL3_ADDRESS_ARCH(ptl2, i) \
92 (ptl2)
93#define GET_FRAME_ADDRESS_ARCH(ptl3, i) \
94 (((pte_t *) (ptl3))[(i)].pfn << 12)
95
96/* Set PTE address accessors for each level. */
97#define SET_PTL0_ADDRESS_ARCH(ptl0)
98#define SET_PTL1_ADDRESS_ARCH(ptl0, i, a) \
99 (((pte_t *) (ptl0))[(i)].pfn = (a) >> 12)
100#define SET_PTL2_ADDRESS_ARCH(ptl1, i, a)
101#define SET_PTL3_ADDRESS_ARCH(ptl2, i, a)
102#define SET_FRAME_ADDRESS_ARCH(ptl3, i, a) \
103 (((pte_t *) (ptl3))[(i)].pfn = (a) >> 12)
104
105/* Get PTE flags accessors for each level. */
106#define GET_PTL1_FLAGS_ARCH(ptl0, i) \
107 get_pt_flags((pte_t *) (ptl0), (index_t) (i))
108#define GET_PTL2_FLAGS_ARCH(ptl1, i) \
109 PAGE_PRESENT
110#define GET_PTL3_FLAGS_ARCH(ptl2, i) \
111 PAGE_PRESENT
112#define GET_FRAME_FLAGS_ARCH(ptl3, i) \
113 get_pt_flags((pte_t *) (ptl3), (index_t) (i))
114
115/* Set PTE flags accessors for each level. */
116#define SET_PTL1_FLAGS_ARCH(ptl0, i, x) \
117 set_pt_flags((pte_t *) (ptl0), (index_t) (i), (x))
118#define SET_PTL2_FLAGS_ARCH(ptl1, i, x)
119#define SET_PTL3_FLAGS_ARCH(ptl2, i, x)
120#define SET_FRAME_FLAGS_ARCH(ptl3, i, x) \
121 set_pt_flags((pte_t *) (ptl3), (index_t) (i), (x))
122
123/* Macros for querying the last-level PTEs. */
124#define PTE_VALID_ARCH(pte) (*((uint32_t *) (pte)) != 0)
125#define PTE_PRESENT_ARCH(pte) ((pte)->p != 0)
126#define PTE_GET_FRAME_ARCH(pte) ((pte)->pfn << 12)
127#define PTE_WRITABLE_ARCH(pte) 1
128#define PTE_EXECUTABLE_ARCH(pte) 1
129
130#ifndef __ASM__
131
132#include <mm/mm.h>
133#include <arch/interrupt.h>
134
135static inline int get_pt_flags(pte_t *pt, index_t i)
136{
137 pte_t *p = &pt[i];
138
139 return ((1 << PAGE_CACHEABLE_SHIFT) |
140 ((!p->p) << PAGE_PRESENT_SHIFT) |
141 (1 << PAGE_USER_SHIFT) |
142 (1 << PAGE_READ_SHIFT) |
143 (1 << PAGE_WRITE_SHIFT) |
144 (1 << PAGE_EXEC_SHIFT) |
145 (p->g << PAGE_GLOBAL_SHIFT));
146}
147
148static inline void set_pt_flags(pte_t *pt, index_t i, int flags)
149{
150 pte_t *p = &pt[i];
151
152 p->p = !(flags & PAGE_NOT_PRESENT);
153 p->g = (flags & PAGE_GLOBAL) != 0;
154 p->valid = 1;
155}
156
157extern void page_arch_init(void);
158
159#endif /* __ASM__ */
160
161#endif /* KERNEL */
162
163#endif
164
165/** @}
166 */
Note: See TracBrowser for help on using the repository browser.