Rev 1787 | Rev 2007 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1 | jermar | 1 | /* |
2 | * Copyright (C) 2001-2004 Jakub 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 | */ |
||
832 | jermar | 57 | #define PTL0_ENTRIES_ARCH 1024 |
58 | #define PTL1_ENTRIES_ARCH 0 |
||
59 | #define PTL2_ENTRIES_ARCH 0 |
||
60 | #define PTL3_ENTRIES_ARCH 1024 |
||
61 | |||
119 | jermar | 62 | #define PTL0_INDEX_ARCH(vaddr) (((vaddr)>>22)&0x3ff) |
63 | #define PTL1_INDEX_ARCH(vaddr) 0 |
||
64 | #define PTL2_INDEX_ARCH(vaddr) 0 |
||
65 | #define PTL3_INDEX_ARCH(vaddr) (((vaddr)>>12)&0x3ff) |
||
66 | |||
67 | #define GET_PTL1_ADDRESS_ARCH(ptl0, i) ((pte_t *)((((pte_t *)(ptl0))[(i)].frame_address)<<12)) |
||
68 | #define GET_PTL2_ADDRESS_ARCH(ptl1, i) (ptl1) |
||
69 | #define GET_PTL3_ADDRESS_ARCH(ptl2, i) (ptl2) |
||
1780 | jermar | 70 | #define GET_FRAME_ADDRESS_ARCH(ptl3, i) ((uintptr_t)((((pte_t *)(ptl3))[(i)].frame_address)<<12)) |
119 | jermar | 71 | |
1780 | jermar | 72 | #define SET_PTL0_ADDRESS_ARCH(ptl0) (write_cr3((uintptr_t) (ptl0))) |
120 | jermar | 73 | #define SET_PTL1_ADDRESS_ARCH(ptl0, i, a) (((pte_t *)(ptl0))[(i)].frame_address = (a)>>12) |
74 | #define SET_PTL2_ADDRESS_ARCH(ptl1, i, a) |
||
75 | #define SET_PTL3_ADDRESS_ARCH(ptl2, i, a) |
||
76 | #define SET_FRAME_ADDRESS_ARCH(ptl3, i, a) (((pte_t *)(ptl3))[(i)].frame_address = (a)>>12) |
||
119 | jermar | 77 | |
120 | jermar | 78 | #define GET_PTL1_FLAGS_ARCH(ptl0, i) get_pt_flags((pte_t *)(ptl0), (index_t)(i)) |
79 | #define GET_PTL2_FLAGS_ARCH(ptl1, i) PAGE_PRESENT |
||
80 | #define GET_PTL3_FLAGS_ARCH(ptl2, i) PAGE_PRESENT |
||
81 | #define GET_FRAME_FLAGS_ARCH(ptl3, i) get_pt_flags((pte_t *)(ptl3), (index_t)(i)) |
||
82 | |||
83 | #define SET_PTL1_FLAGS_ARCH(ptl0, i, x) set_pt_flags((pte_t *)(ptl0), (index_t)(i), (x)) |
||
84 | #define SET_PTL2_FLAGS_ARCH(ptl1, i, x) |
||
85 | #define SET_PTL3_FLAGS_ARCH(ptl2, i, x) |
||
86 | #define SET_FRAME_FLAGS_ARCH(ptl3, i, x) set_pt_flags((pte_t *)(ptl3), (index_t)(i), (x)) |
||
87 | |||
1780 | jermar | 88 | #define PTE_VALID_ARCH(p) (*((uint32_t *) (p)) != 0) |
977 | jermar | 89 | #define PTE_PRESENT_ARCH(p) ((p)->present != 0) |
90 | #define PTE_GET_FRAME_ARCH(p) ((p)->frame_address<<FRAME_WIDTH) |
||
1423 | jermar | 91 | #define PTE_WRITABLE_ARCH(p) ((p)->writeable != 0) |
92 | #define PTE_EXECUTABLE_ARCH(p) 1 |
||
832 | jermar | 93 | |
300 | palkovsky | 94 | #ifndef __ASM__ |
95 | |||
96 | #include <mm/page.h> |
||
97 | #include <arch/types.h> |
||
98 | #include <arch/mm/frame.h> |
||
99 | #include <typedefs.h> |
||
100 | |||
1411 | jermar | 101 | /* Page fault error codes. */ |
102 | |||
103 | /** When bit on this position is 0, the page fault was caused by a not-present page. */ |
||
104 | #define PFERR_CODE_P (1<<0) |
||
105 | |||
106 | /** When bit on this position is 1, the page fault was caused by a write. */ |
||
107 | #define PFERR_CODE_RW (1<<1) |
||
108 | |||
109 | /** When bit on this position is 1, the page fault was caused in user mode. */ |
||
110 | #define PFERR_CODE_US (1<<2) |
||
111 | |||
112 | /** When bit on this position is 1, a reserved bit was set in page directory. */ |
||
113 | #define PFERR_CODE_RSVD (1<<3) |
||
114 | |||
831 | jermar | 115 | /** Page Table Entry. */ |
1 | jermar | 116 | struct page_specifier { |
117 | unsigned present : 1; |
||
118 | unsigned writeable : 1; |
||
119 | unsigned uaccessible : 1; |
||
120 | unsigned page_write_through : 1; |
||
121 | unsigned page_cache_disable : 1; |
||
122 | unsigned accessed : 1; |
||
123 | unsigned dirty : 1; |
||
825 | jermar | 124 | unsigned pat : 1; |
125 | unsigned global : 1; |
||
831 | jermar | 126 | unsigned soft_valid : 1; /**< Valid content even if the present bit is not set. */ |
127 | unsigned avl : 2; |
||
1 | jermar | 128 | unsigned frame_address : 20; |
129 | } __attribute__ ((packed)); |
||
130 | |||
120 | jermar | 131 | static inline int get_pt_flags(pte_t *pt, index_t i) |
132 | { |
||
133 | pte_t *p = &pt[i]; |
||
134 | |||
135 | return ( |
||
136 | (!p->page_cache_disable)<<PAGE_CACHEABLE_SHIFT | |
||
137 | (!p->present)<<PAGE_PRESENT_SHIFT | |
||
138 | p->uaccessible<<PAGE_USER_SHIFT | |
||
139 | 1<<PAGE_READ_SHIFT | |
||
140 | p->writeable<<PAGE_WRITE_SHIFT | |
||
825 | jermar | 141 | 1<<PAGE_EXEC_SHIFT | |
142 | p->global<<PAGE_GLOBAL_SHIFT |
||
120 | jermar | 143 | ); |
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->page_cache_disable = !(flags & PAGE_CACHEABLE); |
||
151 | p->present = !(flags & PAGE_NOT_PRESENT); |
||
135 | jermar | 152 | p->uaccessible = (flags & PAGE_USER) != 0; |
153 | p->writeable = (flags & PAGE_WRITE) != 0; |
||
825 | jermar | 154 | p->global = (flags & PAGE_GLOBAL) != 0; |
831 | jermar | 155 | |
156 | /* |
||
157 | * Ensure that there is at least one bit set even if the present bit is cleared. |
||
158 | */ |
||
159 | p->soft_valid = true; |
||
120 | jermar | 160 | } |
161 | |||
1 | jermar | 162 | extern void page_arch_init(void); |
1411 | jermar | 163 | extern void page_fault(int n, istate_t *istate); |
1 | jermar | 164 | |
300 | palkovsky | 165 | #endif /* __ASM__ */ |
166 | |||
967 | palkovsky | 167 | #endif /* KERNEL */ |
168 | |||
1 | jermar | 169 | #endif |
1702 | cejka | 170 | |
1888 | jermar | 171 | /** @} |
1702 | cejka | 172 | */ |