Rev 3425 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1 | jermar | 1 | /* |
2071 | jermar | 2 | * Copyright (c) 2001-2004 Jakub Jermar |
1 | jermar | 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 ia32mm |
1702 | cejka | 30 | * @{ |
31 | */ |
||
32 | /** @file |
||
33 | */ |
||
34 | |||
1888 | jermar | 35 | #ifndef KERN_ia32_PAGE_H_ |
36 | #define KERN_ia32_PAGE_H_ |
||
1 | jermar | 37 | |
967 | palkovsky | 38 | #include <arch/mm/frame.h> |
39 | |||
765 | jermar | 40 | #define PAGE_WIDTH FRAME_WIDTH |
1 | jermar | 41 | #define PAGE_SIZE FRAME_SIZE |
42 | |||
967 | palkovsky | 43 | #ifdef KERNEL |
44 | |||
300 | palkovsky | 45 | #ifndef __ASM__ |
1780 | jermar | 46 | # define KA2PA(x) (((uintptr_t) (x)) - 0x80000000) |
47 | # define PA2KA(x) (((uintptr_t) (x)) + 0x80000000) |
||
300 | palkovsky | 48 | #else |
957 | decky | 49 | # define KA2PA(x) ((x) - 0x80000000) |
50 | # define PA2KA(x) ((x) + 0x80000000) |
||
300 | palkovsky | 51 | #endif |
1 | jermar | 52 | |
119 | jermar | 53 | /* |
54 | * Implementation of generic 4-level page table interface. |
||
55 | * IA-32 has 2-level page tables, so PTL1 and PTL2 are left out. |
||
56 | */ |
||
2467 | jermar | 57 | |
58 | /* Number of entries in each level. */ |
||
832 | jermar | 59 | #define PTL0_ENTRIES_ARCH 1024 |
60 | #define PTL1_ENTRIES_ARCH 0 |
||
61 | #define PTL2_ENTRIES_ARCH 0 |
||
62 | #define PTL3_ENTRIES_ARCH 1024 |
||
63 | |||
2467 | jermar | 64 | /* Page table sizes for each level. */ |
65 | #define PTL0_SIZE_ARCH ONE_FRAME |
||
66 | #define PTL1_SIZE_ARCH 0 |
||
67 | #define PTL2_SIZE_ARCH 0 |
||
68 | #define PTL3_SIZE_ARCH ONE_FRAME |
||
2465 | jermar | 69 | |
2467 | jermar | 70 | /* Macros calculating indices for each level. */ |
2089 | decky | 71 | #define PTL0_INDEX_ARCH(vaddr) (((vaddr) >> 22) & 0x3ff) |
119 | jermar | 72 | #define PTL1_INDEX_ARCH(vaddr) 0 |
73 | #define PTL2_INDEX_ARCH(vaddr) 0 |
||
2089 | decky | 74 | #define PTL3_INDEX_ARCH(vaddr) (((vaddr) >> 12) & 0x3ff) |
119 | jermar | 75 | |
2467 | jermar | 76 | /* Get PTE address accessors for each level. */ |
77 | #define GET_PTL1_ADDRESS_ARCH(ptl0, i) \ |
||
78 | ((pte_t *) ((((pte_t *) (ptl0))[(i)].frame_address) << 12)) |
||
79 | #define GET_PTL2_ADDRESS_ARCH(ptl1, i) \ |
||
80 | (ptl1) |
||
81 | #define GET_PTL3_ADDRESS_ARCH(ptl2, i) \ |
||
82 | (ptl2) |
||
83 | #define GET_FRAME_ADDRESS_ARCH(ptl3, i) \ |
||
84 | ((uintptr_t) ((((pte_t *) (ptl3))[(i)].frame_address) << 12)) |
||
119 | jermar | 85 | |
2467 | jermar | 86 | /* Set PTE address accessors for each level. */ |
87 | #define SET_PTL0_ADDRESS_ARCH(ptl0) \ |
||
88 | (write_cr3((uintptr_t) (ptl0))) |
||
89 | #define SET_PTL1_ADDRESS_ARCH(ptl0, i, a) \ |
||
90 | (((pte_t *) (ptl0))[(i)].frame_address = (a) >> 12) |
||
120 | jermar | 91 | #define SET_PTL2_ADDRESS_ARCH(ptl1, i, a) |
92 | #define SET_PTL3_ADDRESS_ARCH(ptl2, i, a) |
||
2467 | jermar | 93 | #define SET_FRAME_ADDRESS_ARCH(ptl3, i, a) \ |
94 | (((pte_t *) (ptl3))[(i)].frame_address = (a) >> 12) |
||
119 | jermar | 95 | |
2467 | jermar | 96 | /* Get PTE flags accessors for each level. */ |
97 | #define GET_PTL1_FLAGS_ARCH(ptl0, i) \ |
||
4692 | svoboda | 98 | get_pt_flags((pte_t *) (ptl0), (size_t) (i)) |
2467 | jermar | 99 | #define GET_PTL2_FLAGS_ARCH(ptl1, i) \ |
100 | PAGE_PRESENT |
||
101 | #define GET_PTL3_FLAGS_ARCH(ptl2, i) \ |
||
102 | PAGE_PRESENT |
||
103 | #define GET_FRAME_FLAGS_ARCH(ptl3, i) \ |
||
4692 | svoboda | 104 | get_pt_flags((pte_t *) (ptl3), (size_t) (i)) |
120 | jermar | 105 | |
2467 | jermar | 106 | /* Set PTE flags accessors for each level. */ |
107 | #define SET_PTL1_FLAGS_ARCH(ptl0, i, x) \ |
||
4692 | svoboda | 108 | set_pt_flags((pte_t *) (ptl0), (size_t) (i), (x)) |
120 | jermar | 109 | #define SET_PTL2_FLAGS_ARCH(ptl1, i, x) |
110 | #define SET_PTL3_FLAGS_ARCH(ptl2, i, x) |
||
2467 | jermar | 111 | #define SET_FRAME_FLAGS_ARCH(ptl3, i, x) \ |
4692 | svoboda | 112 | set_pt_flags((pte_t *) (ptl3), (size_t) (i), (x)) |
120 | jermar | 113 | |
2467 | jermar | 114 | /* Macros for querying the last level entries. */ |
115 | #define PTE_VALID_ARCH(p) \ |
||
116 | (*((uint32_t *) (p)) != 0) |
||
117 | #define PTE_PRESENT_ARCH(p) \ |
||
118 | ((p)->present != 0) |
||
119 | #define PTE_GET_FRAME_ARCH(p) \ |
||
120 | ((p)->frame_address << FRAME_WIDTH) |
||
121 | #define PTE_WRITABLE_ARCH(p) \ |
||
122 | ((p)->writeable != 0) |
||
1423 | jermar | 123 | #define PTE_EXECUTABLE_ARCH(p) 1 |
832 | jermar | 124 | |
300 | palkovsky | 125 | #ifndef __ASM__ |
126 | |||
2089 | decky | 127 | #include <mm/mm.h> |
128 | #include <arch/interrupt.h> |
||
3424 | svoboda | 129 | #include <arch/types.h> |
130 | #include <typedefs.h> |
||
300 | palkovsky | 131 | |
1411 | jermar | 132 | /* Page fault error codes. */ |
133 | |||
2467 | jermar | 134 | /** When bit on this position is 0, the page fault was caused by a not-present |
135 | * page. |
||
136 | */ |
||
2089 | decky | 137 | #define PFERR_CODE_P (1 << 0) |
1411 | jermar | 138 | |
139 | /** When bit on this position is 1, the page fault was caused by a write. */ |
||
2089 | decky | 140 | #define PFERR_CODE_RW (1 << 1) |
1411 | jermar | 141 | |
142 | /** When bit on this position is 1, the page fault was caused in user mode. */ |
||
2089 | decky | 143 | #define PFERR_CODE_US (1 << 2) |
1411 | jermar | 144 | |
145 | /** When bit on this position is 1, a reserved bit was set in page directory. */ |
||
2089 | decky | 146 | #define PFERR_CODE_RSVD (1 << 3) |
1411 | jermar | 147 | |
4692 | svoboda | 148 | static inline int get_pt_flags(pte_t *pt, size_t i) |
120 | jermar | 149 | { |
150 | pte_t *p = &pt[i]; |
||
151 | |||
2467 | jermar | 152 | return ((!p->page_cache_disable) << PAGE_CACHEABLE_SHIFT | |
153 | (!p->present) << PAGE_PRESENT_SHIFT | |
||
154 | p->uaccessible << PAGE_USER_SHIFT | |
||
155 | 1 << PAGE_READ_SHIFT | |
||
156 | p->writeable << PAGE_WRITE_SHIFT | |
||
157 | 1 << PAGE_EXEC_SHIFT | |
||
158 | p->global << PAGE_GLOBAL_SHIFT); |
||
120 | jermar | 159 | } |
160 | |||
4692 | svoboda | 161 | static inline void set_pt_flags(pte_t *pt, size_t i, int flags) |
120 | jermar | 162 | { |
163 | pte_t *p = &pt[i]; |
||
164 | |||
165 | p->page_cache_disable = !(flags & PAGE_CACHEABLE); |
||
166 | p->present = !(flags & PAGE_NOT_PRESENT); |
||
135 | jermar | 167 | p->uaccessible = (flags & PAGE_USER) != 0; |
168 | p->writeable = (flags & PAGE_WRITE) != 0; |
||
825 | jermar | 169 | p->global = (flags & PAGE_GLOBAL) != 0; |
831 | jermar | 170 | |
171 | /* |
||
2467 | jermar | 172 | * Ensure that there is at least one bit set even if the present bit is |
173 | * cleared. |
||
831 | jermar | 174 | */ |
175 | p->soft_valid = true; |
||
120 | jermar | 176 | } |
177 | |||
1 | jermar | 178 | extern void page_arch_init(void); |
1411 | jermar | 179 | extern void page_fault(int n, istate_t *istate); |
1 | jermar | 180 | |
300 | palkovsky | 181 | #endif /* __ASM__ */ |
182 | |||
967 | palkovsky | 183 | #endif /* KERNEL */ |
184 | |||
1 | jermar | 185 | #endif |
1702 | cejka | 186 | |
1888 | jermar | 187 | /** @} |
1702 | cejka | 188 | */ |