Rev 977 | Rev 1064 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 977 | Rev 1063 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (C) 2005 Ondrej Palkovsky |
2 | * Copyright (C) 2005 Ondrej Palkovsky |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
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 |
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. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
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 |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
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 |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
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 |
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. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
- | 29 | /** Paging on AMD64 |
|
- | 30 | * |
|
- | 31 | * The space is divided in positive numbers - userspace and |
|
- | 32 | * negative numbers - kernel space. The 'negative' space starting |
|
- | 33 | * with 0xffff800000000000 and ending with 0xffffffff80000000 |
|
- | 34 | * (-2GB) is identically mapped physical memory. The area |
|
- | 35 | * (0xffffffff80000000 ... 0xffffffffffffffff is again identically |
|
- | 36 | * mapped first 2GB. |
|
- | 37 | * |
|
- | 38 | * ATTENTION - PA2KA(KA2PA(x)) != x if 'x' is in kernel |
|
- | 39 | */ |
|
- | 40 | ||
29 | #ifndef __amd64_PAGE_H__ |
41 | #ifndef __amd64_PAGE_H__ |
30 | #define __amd64_PAGE_H__ |
42 | #define __amd64_PAGE_H__ |
31 | 43 | ||
32 | #include <arch/mm/frame.h> |
44 | #include <arch/mm/frame.h> |
33 | 45 | ||
34 | #define PAGE_WIDTH FRAME_WIDTH |
46 | #define PAGE_WIDTH FRAME_WIDTH |
35 | #define PAGE_SIZE FRAME_SIZE |
47 | #define PAGE_SIZE FRAME_SIZE |
36 | 48 | ||
37 | #ifdef KERNEL |
49 | #ifdef KERNEL |
38 | 50 | ||
39 | #ifndef __ASM__ |
51 | #ifndef __ASM__ |
40 | # include <mm/page.h> |
52 | # include <mm/page.h> |
41 | # include <arch/types.h> |
53 | # include <arch/types.h> |
42 | #endif |
54 | #endif |
43 | 55 | ||
44 | #ifndef __ASM__ |
56 | #ifndef __ASM__ |
- | 57 | static inline __address ka2pa(__address x) |
|
- | 58 | { |
|
- | 59 | if (x > 0xffffffff80000000) |
|
- | 60 | return x - 0xffffffff80000000; |
|
- | 61 | else |
|
- | 62 | return x - 0xffff800000000000; |
|
- | 63 | } |
|
- | 64 | /* Linker symbol */ |
|
- | 65 | extern int ktext_start; |
|
- | 66 | extern int kdata_end; |
|
- | 67 | static inline __address pa2ka(__address x) |
|
- | 68 | { |
|
- | 69 | if (x >= ka2pa((__address)(&kdata_end)) || \ |
|
- | 70 | x <= ka2pa((__address)&ktext_start)) |
|
- | 71 | return x + 0xffff800000000000; |
|
- | 72 | else |
|
- | 73 | return x + 0xffffffff80000000; |
|
- | 74 | } |
|
- | 75 | # define KA2PA(x) ka2pa((__address)x) |
|
- | 76 | # define PA2KA(x) pa2ka((__address)x) |
|
45 | # define KA2PA(x) (((__address) (x)) - 0xffffffff80000000) |
77 | # define PA2KA_IDENT(x) (((__address) (x)) + 0xffff800000000000) |
46 | # define PA2KA(x) (((__address) (x)) + 0xffffffff80000000) |
78 | # define PA2KA_CODE(x) (((__address) (x)) + 0xffffffff80000000) |
47 | #else |
79 | #else |
48 | # define KA2PA(x) ((x) - 0xffffffff80000000) |
80 | # define KA2PA(x) ((x) - 0xffffffff80000000) |
49 | # define PA2KA(x) ((x) + 0xffffffff80000000) |
81 | # define PA2KA(x) ((x) + 0xffffffff80000000) |
- | 82 | # define PA2KA_DATA(x) ((x) + 0xffff800000000000) |
|
50 | #endif |
83 | #endif |
51 | 84 | ||
52 | #define PTL0_ENTRIES_ARCH 512 |
85 | #define PTL0_ENTRIES_ARCH 512 |
53 | #define PTL1_ENTRIES_ARCH 512 |
86 | #define PTL1_ENTRIES_ARCH 512 |
54 | #define PTL2_ENTRIES_ARCH 512 |
87 | #define PTL2_ENTRIES_ARCH 512 |
55 | #define PTL3_ENTRIES_ARCH 512 |
88 | #define PTL3_ENTRIES_ARCH 512 |
56 | 89 | ||
57 | #define PTL0_INDEX_ARCH(vaddr) (((vaddr)>>39)&0x1ff) |
90 | #define PTL0_INDEX_ARCH(vaddr) (((vaddr)>>39)&0x1ff) |
58 | #define PTL1_INDEX_ARCH(vaddr) (((vaddr)>>30)&0x1ff) |
91 | #define PTL1_INDEX_ARCH(vaddr) (((vaddr)>>30)&0x1ff) |
59 | #define PTL2_INDEX_ARCH(vaddr) (((vaddr)>>21)&0x1ff) |
92 | #define PTL2_INDEX_ARCH(vaddr) (((vaddr)>>21)&0x1ff) |
60 | #define PTL3_INDEX_ARCH(vaddr) (((vaddr)>>12)&0x1ff) |
93 | #define PTL3_INDEX_ARCH(vaddr) (((vaddr)>>12)&0x1ff) |
61 | 94 | ||
62 | #define GET_PTL1_ADDRESS_ARCH(ptl0, i) ((pte_t *) ((((__u64) ((pte_t *)(ptl0))[(i)].addr_12_31)<<12) | (((__u64) ((pte_t *)(ptl0))[(i)].addr_32_51)<<32 ))) |
95 | #define GET_PTL1_ADDRESS_ARCH(ptl0, i) ((pte_t *) ((((__u64) ((pte_t *)(ptl0))[(i)].addr_12_31)<<12) | (((__u64) ((pte_t *)(ptl0))[(i)].addr_32_51)<<32 ))) |
63 | #define GET_PTL2_ADDRESS_ARCH(ptl1, i) ((pte_t *) ((((__u64) ((pte_t *)(ptl1))[(i)].addr_12_31)<<12) | (((__u64) ((pte_t *)(ptl1))[(i)].addr_32_51)<<32 ))) |
96 | #define GET_PTL2_ADDRESS_ARCH(ptl1, i) ((pte_t *) ((((__u64) ((pte_t *)(ptl1))[(i)].addr_12_31)<<12) | (((__u64) ((pte_t *)(ptl1))[(i)].addr_32_51)<<32 ))) |
64 | #define GET_PTL3_ADDRESS_ARCH(ptl2, i) ((pte_t *) ((((__u64) ((pte_t *)(ptl2))[(i)].addr_12_31)<<12) | (((__u64) ((pte_t *)(ptl2))[(i)].addr_32_51)<<32 ))) |
97 | #define GET_PTL3_ADDRESS_ARCH(ptl2, i) ((pte_t *) ((((__u64) ((pte_t *)(ptl2))[(i)].addr_12_31)<<12) | (((__u64) ((pte_t *)(ptl2))[(i)].addr_32_51)<<32 ))) |
65 | #define GET_FRAME_ADDRESS_ARCH(ptl3, i) ((__address *) ((((__u64) ((pte_t *)(ptl3))[(i)].addr_12_31)<<12) | (((__u64) ((pte_t *)(ptl3))[(i)].addr_32_51)<<32 ))) |
98 | #define GET_FRAME_ADDRESS_ARCH(ptl3, i) ((__address *) ((((__u64) ((pte_t *)(ptl3))[(i)].addr_12_31)<<12) | (((__u64) ((pte_t *)(ptl3))[(i)].addr_32_51)<<32 ))) |
66 | 99 | ||
67 | #define SET_PTL0_ADDRESS_ARCH(ptl0) (write_cr3((__address) (ptl0))) |
100 | #define SET_PTL0_ADDRESS_ARCH(ptl0) (write_cr3((__address) (ptl0))) |
68 | #define SET_PTL1_ADDRESS_ARCH(ptl0, i, a) set_pt_addr((pte_t *)(ptl0), (index_t)(i), a) |
101 | #define SET_PTL1_ADDRESS_ARCH(ptl0, i, a) set_pt_addr((pte_t *)(ptl0), (index_t)(i), a) |
69 | #define SET_PTL2_ADDRESS_ARCH(ptl1, i, a) set_pt_addr((pte_t *)(ptl1), (index_t)(i), a) |
102 | #define SET_PTL2_ADDRESS_ARCH(ptl1, i, a) set_pt_addr((pte_t *)(ptl1), (index_t)(i), a) |
70 | #define SET_PTL3_ADDRESS_ARCH(ptl2, i, a) set_pt_addr((pte_t *)(ptl2), (index_t)(i), a) |
103 | #define SET_PTL3_ADDRESS_ARCH(ptl2, i, a) set_pt_addr((pte_t *)(ptl2), (index_t)(i), a) |
71 | #define SET_FRAME_ADDRESS_ARCH(ptl3, i, a) set_pt_addr((pte_t *)(ptl3), (index_t)(i), a) |
104 | #define SET_FRAME_ADDRESS_ARCH(ptl3, i, a) set_pt_addr((pte_t *)(ptl3), (index_t)(i), a) |
72 | 105 | ||
73 | #define GET_PTL1_FLAGS_ARCH(ptl0, i) get_pt_flags((pte_t *)(ptl0), (index_t)(i)) |
106 | #define GET_PTL1_FLAGS_ARCH(ptl0, i) get_pt_flags((pte_t *)(ptl0), (index_t)(i)) |
74 | #define GET_PTL2_FLAGS_ARCH(ptl1, i) get_pt_flags((pte_t *)(ptl1), (index_t)(i)) |
107 | #define GET_PTL2_FLAGS_ARCH(ptl1, i) get_pt_flags((pte_t *)(ptl1), (index_t)(i)) |
75 | #define GET_PTL3_FLAGS_ARCH(ptl2, i) get_pt_flags((pte_t *)(ptl2), (index_t)(i)) |
108 | #define GET_PTL3_FLAGS_ARCH(ptl2, i) get_pt_flags((pte_t *)(ptl2), (index_t)(i)) |
76 | #define GET_FRAME_FLAGS_ARCH(ptl3, i) get_pt_flags((pte_t *)(ptl3), (index_t)(i)) |
109 | #define GET_FRAME_FLAGS_ARCH(ptl3, i) get_pt_flags((pte_t *)(ptl3), (index_t)(i)) |
77 | 110 | ||
78 | #define SET_PTL1_FLAGS_ARCH(ptl0, i, x) set_pt_flags((pte_t *)(ptl0), (index_t)(i), (x)) |
111 | #define SET_PTL1_FLAGS_ARCH(ptl0, i, x) set_pt_flags((pte_t *)(ptl0), (index_t)(i), (x)) |
79 | #define SET_PTL2_FLAGS_ARCH(ptl1, i, x) set_pt_flags((pte_t *)(ptl1), (index_t)(i), (x)) |
112 | #define SET_PTL2_FLAGS_ARCH(ptl1, i, x) set_pt_flags((pte_t *)(ptl1), (index_t)(i), (x)) |
80 | #define SET_PTL3_FLAGS_ARCH(ptl2, i, x) set_pt_flags((pte_t *)(ptl2), (index_t)(i), (x)) |
113 | #define SET_PTL3_FLAGS_ARCH(ptl2, i, x) set_pt_flags((pte_t *)(ptl2), (index_t)(i), (x)) |
81 | #define SET_FRAME_FLAGS_ARCH(ptl3, i, x) set_pt_flags((pte_t *)(ptl3), (index_t)(i), (x)) |
114 | #define SET_FRAME_FLAGS_ARCH(ptl3, i, x) set_pt_flags((pte_t *)(ptl3), (index_t)(i), (x)) |
82 | 115 | ||
83 | #define PTE_VALID_ARCH(p) (*((__u64 *) (p)) != 0) |
116 | #define PTE_VALID_ARCH(p) (*((__u64 *) (p)) != 0) |
84 | #define PTE_PRESENT_ARCH(p) ((p)->present != 0) |
117 | #define PTE_PRESENT_ARCH(p) ((p)->present != 0) |
85 | #define PTE_GET_FRAME_ARCH(p) ((((__address)(p)->addr_12_31)<<12) | ((__address)(p)->addr_32_51<<32)) |
118 | #define PTE_GET_FRAME_ARCH(p) ((((__address)(p)->addr_12_31)<<12) | ((__address)(p)->addr_32_51<<32)) |
86 | 119 | ||
87 | #ifndef __ASM__ |
120 | #ifndef __ASM__ |
88 | 121 | ||
89 | /** Page Table Entry. */ |
122 | /** Page Table Entry. */ |
90 | struct page_specifier { |
123 | struct page_specifier { |
91 | unsigned present : 1; |
124 | unsigned present : 1; |
92 | unsigned writeable : 1; |
125 | unsigned writeable : 1; |
93 | unsigned uaccessible : 1; |
126 | unsigned uaccessible : 1; |
94 | unsigned page_write_through : 1; |
127 | unsigned page_write_through : 1; |
95 | unsigned page_cache_disable : 1; |
128 | unsigned page_cache_disable : 1; |
96 | unsigned accessed : 1; |
129 | unsigned accessed : 1; |
97 | unsigned dirty : 1; |
130 | unsigned dirty : 1; |
98 | unsigned unused: 1; |
131 | unsigned unused: 1; |
99 | unsigned global : 1; |
132 | unsigned global : 1; |
100 | unsigned soft_valid : 1; /**< Valid content even if present bit is cleared. */ |
133 | unsigned soft_valid : 1; /**< Valid content even if present bit is cleared. */ |
101 | unsigned avl : 2; |
134 | unsigned avl : 2; |
102 | unsigned addr_12_31 : 30; |
135 | unsigned addr_12_31 : 30; |
103 | unsigned addr_32_51 : 21; |
136 | unsigned addr_32_51 : 21; |
104 | unsigned no_execute : 1; |
137 | unsigned no_execute : 1; |
105 | } __attribute__ ((packed)); |
138 | } __attribute__ ((packed)); |
106 | 139 | ||
107 | static inline int get_pt_flags(pte_t *pt, index_t i) |
140 | static inline int get_pt_flags(pte_t *pt, index_t i) |
108 | { |
141 | { |
109 | pte_t *p = &pt[i]; |
142 | pte_t *p = &pt[i]; |
110 | 143 | ||
111 | return ( |
144 | return ( |
112 | (!p->page_cache_disable)<<PAGE_CACHEABLE_SHIFT | |
145 | (!p->page_cache_disable)<<PAGE_CACHEABLE_SHIFT | |
113 | (!p->present)<<PAGE_PRESENT_SHIFT | |
146 | (!p->present)<<PAGE_PRESENT_SHIFT | |
114 | p->uaccessible<<PAGE_USER_SHIFT | |
147 | p->uaccessible<<PAGE_USER_SHIFT | |
115 | 1<<PAGE_READ_SHIFT | |
148 | 1<<PAGE_READ_SHIFT | |
116 | p->writeable<<PAGE_WRITE_SHIFT | |
149 | p->writeable<<PAGE_WRITE_SHIFT | |
117 | (!p->no_execute)<<PAGE_EXEC_SHIFT | |
150 | (!p->no_execute)<<PAGE_EXEC_SHIFT | |
118 | p->global<<PAGE_GLOBAL_SHIFT |
151 | p->global<<PAGE_GLOBAL_SHIFT |
119 | ); |
152 | ); |
120 | } |
153 | } |
121 | 154 | ||
122 | static inline void set_pt_addr(pte_t *pt, index_t i, __address a) |
155 | static inline void set_pt_addr(pte_t *pt, index_t i, __address a) |
123 | { |
156 | { |
124 | pte_t *p = &pt[i]; |
157 | pte_t *p = &pt[i]; |
125 | 158 | ||
126 | p->addr_12_31 = (a >> 12) & 0xfffff; |
159 | p->addr_12_31 = (a >> 12) & 0xfffff; |
127 | p->addr_32_51 = a >> 32; |
160 | p->addr_32_51 = a >> 32; |
128 | } |
161 | } |
129 | 162 | ||
130 | static inline void set_pt_flags(pte_t *pt, index_t i, int flags) |
163 | static inline void set_pt_flags(pte_t *pt, index_t i, int flags) |
131 | { |
164 | { |
132 | pte_t *p = &pt[i]; |
165 | pte_t *p = &pt[i]; |
133 | 166 | ||
134 | p->page_cache_disable = !(flags & PAGE_CACHEABLE); |
167 | p->page_cache_disable = !(flags & PAGE_CACHEABLE); |
135 | p->present = !(flags & PAGE_NOT_PRESENT); |
168 | p->present = !(flags & PAGE_NOT_PRESENT); |
136 | p->uaccessible = (flags & PAGE_USER) != 0; |
169 | p->uaccessible = (flags & PAGE_USER) != 0; |
137 | p->writeable = (flags & PAGE_WRITE) != 0; |
170 | p->writeable = (flags & PAGE_WRITE) != 0; |
138 | p->no_execute = (flags & PAGE_EXEC) == 0; |
171 | p->no_execute = (flags & PAGE_EXEC) == 0; |
139 | p->global = (flags & PAGE_GLOBAL) != 0; |
172 | p->global = (flags & PAGE_GLOBAL) != 0; |
140 | 173 | ||
141 | /* |
174 | /* |
142 | * Ensure that there is at least one bit set even if the present bit is cleared. |
175 | * Ensure that there is at least one bit set even if the present bit is cleared. |
143 | */ |
176 | */ |
144 | p->soft_valid = 1; |
177 | p->soft_valid = 1; |
145 | } |
178 | } |
146 | 179 | ||
147 | extern void page_arch_init(void); |
180 | extern void page_arch_init(void); |
148 | 181 | ||
149 | #endif /* __ASM__ */ |
182 | #endif /* __ASM__ */ |
150 | 183 | ||
151 | #endif /* KERNEL */ |
184 | #endif /* KERNEL */ |
152 | 185 | ||
153 | #endif |
186 | #endif |
154 | 187 |