Rev 3233 | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1160 | decky | 1 | /* |
2071 | jermar | 2 | * Copyright (c) 2005 Martin Decky |
1160 | 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 | |||
1888 | jermar | 29 | /** @addtogroup ppc64mm |
1702 | cejka | 30 | * @{ |
31 | */ |
||
32 | /** @file |
||
33 | */ |
||
34 | |||
1888 | jermar | 35 | #ifndef KERN_ppc64_PAGE_H_ |
36 | #define KERN_ppc64_PAGE_H_ |
||
1160 | decky | 37 | |
38 | #include <arch/mm/frame.h> |
||
39 | |||
40 | #define PAGE_WIDTH FRAME_WIDTH |
||
41 | #define PAGE_SIZE FRAME_SIZE |
||
42 | |||
43 | #ifdef KERNEL |
||
44 | |||
45 | #ifndef __ASM__ |
||
1780 | jermar | 46 | # define KA2PA(x) (((uintptr_t) (x)) - 0x80000000) |
47 | # define PA2KA(x) (((uintptr_t) (x)) + 0x80000000) |
||
1160 | decky | 48 | #else |
49 | # define KA2PA(x) ((x) - 0x80000000) |
||
50 | # define PA2KA(x) ((x) + 0x80000000) |
||
51 | #endif |
||
52 | |||
1398 | decky | 53 | /* |
54 | * Implementation of generic 4-level page table interface, |
||
55 | * the hardware Page Hash Table is used as cache. |
||
56 | * |
||
57 | * Page table layout: |
||
58 | * - 32-bit virtual addressess |
||
59 | * - Offset is 12 bits => pages are 4K long |
||
60 | * - PTL0 has 1024 entries (10 bits) |
||
61 | * - PTL1 is not used |
||
62 | * - PTL2 is not used |
||
63 | * - PLT3 has 1024 entries (10 bits) |
||
64 | */ |
||
1160 | decky | 65 | |
2467 | jermar | 66 | /* Number of entries in each level. */ |
1398 | decky | 67 | #define PTL0_ENTRIES_ARCH 1024 |
68 | #define PTL1_ENTRIES_ARCH 0 |
||
69 | #define PTL2_ENTRIES_ARCH 0 |
||
70 | #define PTL3_ENTRIES_ARCH 1024 |
||
1160 | decky | 71 | |
2467 | jermar | 72 | /* Sizes of page tables in each level. */ |
2465 | jermar | 73 | #define PTL0_SIZE_ARCH ONE_FRAME |
74 | #define PTL1_SIZE_ARCH 0 |
||
75 | #define PTL2_SIZE_ARCH 0 |
||
76 | #define PTL3_SIZE_ARCH ONE_FRAME |
||
77 | |||
2467 | jermar | 78 | /* Macros calculating indices into page tables in each level. */ |
1398 | decky | 79 | #define PTL0_INDEX_ARCH(vaddr) (((vaddr) >> 22) & 0x3ff) |
80 | #define PTL1_INDEX_ARCH(vaddr) 0 |
||
81 | #define PTL2_INDEX_ARCH(vaddr) 0 |
||
82 | #define PTL3_INDEX_ARCH(vaddr) (((vaddr) >> 12) & 0x3ff) |
||
1160 | decky | 83 | |
2467 | jermar | 84 | /* Get PTE address accessors for each level. */ |
85 | #define GET_PTL1_ADDRESS_ARCH(ptl0, i) \ |
||
86 | (((pte_t *) (ptl0))[(i)].pfn << 12) |
||
87 | #define GET_PTL2_ADDRESS_ARCH(ptl1, i) \ |
||
88 | (ptl1) |
||
89 | #define GET_PTL3_ADDRESS_ARCH(ptl2, i) \ |
||
90 | (ptl2) |
||
91 | #define GET_FRAME_ADDRESS_ARCH(ptl3, i) \ |
||
92 | (((pte_t *) (ptl3))[(i)].pfn << 12) |
||
1160 | decky | 93 | |
2467 | jermar | 94 | /* Set PTE address accessors for each level. */ |
1398 | decky | 95 | #define SET_PTL0_ADDRESS_ARCH(ptl0) |
2467 | jermar | 96 | #define SET_PTL1_ADDRESS_ARCH(ptl0, i, a) \ |
97 | (((pte_t *) (ptl0))[(i)].pfn = (a) >> 12) |
||
1160 | decky | 98 | #define SET_PTL2_ADDRESS_ARCH(ptl1, i, a) |
99 | #define SET_PTL3_ADDRESS_ARCH(ptl2, i, a) |
||
2467 | jermar | 100 | #define SET_FRAME_ADDRESS_ARCH(ptl3, i, a) \ |
101 | (((pte_t *) (ptl3))[(i)].pfn = (a) >> 12) |
||
1160 | decky | 102 | |
2467 | jermar | 103 | /* Get PTE flags accessors for each level. */ |
104 | #define GET_PTL1_FLAGS_ARCH(ptl0, i) \ |
||
105 | get_pt_flags((pte_t *) (ptl0), (index_t) (i)) |
||
106 | #define GET_PTL2_FLAGS_ARCH(ptl1, i) \ |
||
107 | PAGE_PRESENT |
||
108 | #define GET_PTL3_FLAGS_ARCH(ptl2, i) \ |
||
109 | PAGE_PRESENT |
||
110 | #define GET_FRAME_FLAGS_ARCH(ptl3, i) \ |
||
111 | get_pt_flags((pte_t *) (ptl3), (index_t) (i)) |
||
1160 | decky | 112 | |
2467 | jermar | 113 | /* Set PTE flags accessors for each level. */ |
114 | #define SET_PTL1_FLAGS_ARCH(ptl0, i, x) \ |
||
115 | set_pt_flags((pte_t *) (ptl0), (index_t) (i), (x)) |
||
1160 | decky | 116 | #define SET_PTL2_FLAGS_ARCH(ptl1, i, x) |
117 | #define SET_PTL3_FLAGS_ARCH(ptl2, i, x) |
||
2467 | jermar | 118 | #define SET_FRAME_FLAGS_ARCH(ptl3, i, x) \ |
119 | set_pt_flags((pte_t *) (ptl3), (index_t) (i), (x)) |
||
1160 | decky | 120 | |
2467 | jermar | 121 | /* Macros for querying the last-level PTEs. */ |
1780 | jermar | 122 | #define PTE_VALID_ARCH(pte) (*((uint32_t *) (pte)) != 0) |
1423 | jermar | 123 | #define PTE_PRESENT_ARCH(pte) ((pte)->p != 0) |
1780 | jermar | 124 | #define PTE_GET_FRAME_ARCH(pte) ((uintptr_t) ((pte)->pfn << 12)) |
1423 | jermar | 125 | #define PTE_WRITABLE_ARCH(pte) 1 |
126 | #define PTE_EXECUTABLE_ARCH(pte) 1 |
||
1160 | decky | 127 | |
128 | #ifndef __ASM__ |
||
129 | |||
2089 | decky | 130 | #include <mm/mm.h> |
131 | #include <arch/interrupt.h> |
||
1160 | decky | 132 | |
1398 | decky | 133 | static inline int get_pt_flags(pte_t *pt, index_t i) |
134 | { |
||
135 | pte_t *p = &pt[i]; |
||
136 | |||
2467 | jermar | 137 | return ((1 << PAGE_CACHEABLE_SHIFT) | |
138 | ((!p->p) << PAGE_PRESENT_SHIFT) | |
||
139 | (1 << PAGE_USER_SHIFT) | |
||
140 | (1 << PAGE_READ_SHIFT) | |
||
141 | (1 << PAGE_WRITE_SHIFT) | |
||
142 | (1 << PAGE_EXEC_SHIFT) | |
||
143 | (p->g << PAGE_GLOBAL_SHIFT)); |
||
1398 | decky | 144 | } |
145 | |||
146 | static inline void set_pt_flags(pte_t *pt, index_t i, int flags) |
||
147 | { |
||
148 | pte_t *p = &pt[i]; |
||
149 | |||
150 | p->p = !(flags & PAGE_NOT_PRESENT); |
||
151 | p->g = (flags & PAGE_GLOBAL) != 0; |
||
152 | p->valid = 1; |
||
153 | } |
||
154 | |||
1160 | decky | 155 | extern void page_arch_init(void); |
156 | |||
1398 | decky | 157 | #define PHT_BITS 16 |
158 | #define PHT_ORDER 4 |
||
159 | |||
160 | typedef struct { |
||
161 | unsigned v : 1; /**< Valid */ |
||
162 | unsigned vsid : 24; /**< Virtual Segment ID */ |
||
163 | unsigned h : 1; /**< Primary/secondary hash */ |
||
164 | unsigned api : 6; /**< Abbreviated Page Index */ |
||
165 | unsigned rpn : 20; /**< Real Page Number */ |
||
166 | unsigned reserved0 : 3; |
||
167 | unsigned r : 1; /**< Reference */ |
||
168 | unsigned c : 1; /**< Change */ |
||
169 | unsigned wimg : 4; /**< Access control */ |
||
170 | unsigned reserved1 : 1; |
||
171 | unsigned pp : 2; /**< Page protection */ |
||
172 | } phte_t; |
||
173 | |||
174 | extern void pht_refill(bool data, istate_t *istate); |
||
175 | extern void pht_init(void); |
||
176 | |||
1160 | decky | 177 | #endif /* __ASM__ */ |
178 | |||
179 | #endif /* KERNEL */ |
||
180 | |||
181 | #endif |
||
1702 | cejka | 182 | |
1888 | jermar | 183 | /** @} |
1702 | cejka | 184 | */ |