Rev 2089 | Rev 2467 | 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 | |||
2007 | jermar | 43 | #define PAGE_COLOR_BITS 0 /* dummy */ |
44 | |||
967 | palkovsky | 45 | #ifdef KERNEL |
46 | |||
300 | palkovsky | 47 | #ifndef __ASM__ |
1780 | jermar | 48 | # define KA2PA(x) (((uintptr_t) (x)) - 0x80000000) |
49 | # define PA2KA(x) (((uintptr_t) (x)) + 0x80000000) |
||
300 | palkovsky | 50 | #else |
957 | decky | 51 | # define KA2PA(x) ((x) - 0x80000000) |
52 | # define PA2KA(x) ((x) + 0x80000000) |
||
300 | palkovsky | 53 | #endif |
1 | jermar | 54 | |
119 | jermar | 55 | /* |
56 | * Implementation of generic 4-level page table interface. |
||
57 | * IA-32 has 2-level page tables, so PTL1 and PTL2 are left out. |
||
58 | */ |
||
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 | |||
2465 | jermar | 64 | #define PTL0_SIZE_ARCH ONE_FRAME |
65 | #define PTL1_SIZE_ARCH 0 |
||
66 | #define PTL2_SIZE_ARCH 0 |
||
67 | #define PTL3_SIZE_ARCH ONE_FRAME |
||
68 | |||
2089 | decky | 69 | #define PTL0_INDEX_ARCH(vaddr) (((vaddr) >> 22) & 0x3ff) |
119 | jermar | 70 | #define PTL1_INDEX_ARCH(vaddr) 0 |
71 | #define PTL2_INDEX_ARCH(vaddr) 0 |
||
2089 | decky | 72 | #define PTL3_INDEX_ARCH(vaddr) (((vaddr) >> 12) & 0x3ff) |
119 | jermar | 73 | |
2089 | decky | 74 | #define GET_PTL1_ADDRESS_ARCH(ptl0, i) ((pte_t *)((((pte_t *)(ptl0))[(i)].frame_address) << 12)) |
119 | jermar | 75 | #define GET_PTL2_ADDRESS_ARCH(ptl1, i) (ptl1) |
76 | #define GET_PTL3_ADDRESS_ARCH(ptl2, i) (ptl2) |
||
2089 | decky | 77 | #define GET_FRAME_ADDRESS_ARCH(ptl3, i) ((uintptr_t)((((pte_t *)(ptl3))[(i)].frame_address) << 12)) |
119 | jermar | 78 | |
1780 | jermar | 79 | #define SET_PTL0_ADDRESS_ARCH(ptl0) (write_cr3((uintptr_t) (ptl0))) |
120 | jermar | 80 | #define SET_PTL1_ADDRESS_ARCH(ptl0, i, a) (((pte_t *)(ptl0))[(i)].frame_address = (a)>>12) |
81 | #define SET_PTL2_ADDRESS_ARCH(ptl1, i, a) |
||
82 | #define SET_PTL3_ADDRESS_ARCH(ptl2, i, a) |
||
83 | #define SET_FRAME_ADDRESS_ARCH(ptl3, i, a) (((pte_t *)(ptl3))[(i)].frame_address = (a)>>12) |
||
119 | jermar | 84 | |
120 | jermar | 85 | #define GET_PTL1_FLAGS_ARCH(ptl0, i) get_pt_flags((pte_t *)(ptl0), (index_t)(i)) |
86 | #define GET_PTL2_FLAGS_ARCH(ptl1, i) PAGE_PRESENT |
||
87 | #define GET_PTL3_FLAGS_ARCH(ptl2, i) PAGE_PRESENT |
||
88 | #define GET_FRAME_FLAGS_ARCH(ptl3, i) get_pt_flags((pte_t *)(ptl3), (index_t)(i)) |
||
89 | |||
90 | #define SET_PTL1_FLAGS_ARCH(ptl0, i, x) set_pt_flags((pte_t *)(ptl0), (index_t)(i), (x)) |
||
91 | #define SET_PTL2_FLAGS_ARCH(ptl1, i, x) |
||
92 | #define SET_PTL3_FLAGS_ARCH(ptl2, i, x) |
||
93 | #define SET_FRAME_FLAGS_ARCH(ptl3, i, x) set_pt_flags((pte_t *)(ptl3), (index_t)(i), (x)) |
||
94 | |||
1780 | jermar | 95 | #define PTE_VALID_ARCH(p) (*((uint32_t *) (p)) != 0) |
977 | jermar | 96 | #define PTE_PRESENT_ARCH(p) ((p)->present != 0) |
2089 | decky | 97 | #define PTE_GET_FRAME_ARCH(p) ((p)->frame_address << FRAME_WIDTH) |
1423 | jermar | 98 | #define PTE_WRITABLE_ARCH(p) ((p)->writeable != 0) |
99 | #define PTE_EXECUTABLE_ARCH(p) 1 |
||
832 | jermar | 100 | |
300 | palkovsky | 101 | #ifndef __ASM__ |
102 | |||
2089 | decky | 103 | #include <mm/mm.h> |
104 | #include <arch/interrupt.h> |
||
300 | palkovsky | 105 | |
1411 | jermar | 106 | /* Page fault error codes. */ |
107 | |||
108 | /** When bit on this position is 0, the page fault was caused by a not-present page. */ |
||
2089 | decky | 109 | #define PFERR_CODE_P (1 << 0) |
1411 | jermar | 110 | |
111 | /** When bit on this position is 1, the page fault was caused by a write. */ |
||
2089 | decky | 112 | #define PFERR_CODE_RW (1 << 1) |
1411 | jermar | 113 | |
114 | /** When bit on this position is 1, the page fault was caused in user mode. */ |
||
2089 | decky | 115 | #define PFERR_CODE_US (1 << 2) |
1411 | jermar | 116 | |
117 | /** When bit on this position is 1, a reserved bit was set in page directory. */ |
||
2089 | decky | 118 | #define PFERR_CODE_RSVD (1 << 3) |
1411 | jermar | 119 | |
120 | jermar | 120 | static inline int get_pt_flags(pte_t *pt, index_t i) |
121 | { |
||
122 | pte_t *p = &pt[i]; |
||
123 | |||
124 | return ( |
||
2089 | decky | 125 | (!p->page_cache_disable) << PAGE_CACHEABLE_SHIFT | |
126 | (!p->present) << PAGE_PRESENT_SHIFT | |
||
127 | p->uaccessible << PAGE_USER_SHIFT | |
||
120 | jermar | 128 | 1<<PAGE_READ_SHIFT | |
2089 | decky | 129 | p->writeable << PAGE_WRITE_SHIFT | |
825 | jermar | 130 | 1<<PAGE_EXEC_SHIFT | |
2089 | decky | 131 | p->global << PAGE_GLOBAL_SHIFT |
120 | jermar | 132 | ); |
133 | } |
||
134 | |||
135 | static inline void set_pt_flags(pte_t *pt, index_t i, int flags) |
||
136 | { |
||
137 | pte_t *p = &pt[i]; |
||
138 | |||
139 | p->page_cache_disable = !(flags & PAGE_CACHEABLE); |
||
140 | p->present = !(flags & PAGE_NOT_PRESENT); |
||
135 | jermar | 141 | p->uaccessible = (flags & PAGE_USER) != 0; |
142 | p->writeable = (flags & PAGE_WRITE) != 0; |
||
825 | jermar | 143 | p->global = (flags & PAGE_GLOBAL) != 0; |
831 | jermar | 144 | |
145 | /* |
||
146 | * Ensure that there is at least one bit set even if the present bit is cleared. |
||
147 | */ |
||
148 | p->soft_valid = true; |
||
120 | jermar | 149 | } |
150 | |||
1 | jermar | 151 | extern void page_arch_init(void); |
1411 | jermar | 152 | extern void page_fault(int n, istate_t *istate); |
1 | jermar | 153 | |
300 | palkovsky | 154 | #endif /* __ASM__ */ |
155 | |||
967 | palkovsky | 156 | #endif /* KERNEL */ |
157 | |||
1 | jermar | 158 | #endif |
1702 | cejka | 159 | |
1888 | jermar | 160 | /** @} |
1702 | cejka | 161 | */ |