Rev 831 | Rev 957 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 831 | Rev 832 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (C) 2001-2004 Jakub Jermar |
2 | * Copyright (C) 2001-2004 Jakub Jermar |
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 | #ifndef __ia32_PAGE_H__ |
29 | #ifndef __ia32_PAGE_H__ |
30 | #define __ia32_PAGE_H__ |
30 | #define __ia32_PAGE_H__ |
31 | 31 | ||
32 | #define PAGE_WIDTH FRAME_WIDTH |
32 | #define PAGE_WIDTH FRAME_WIDTH |
33 | #define PAGE_SIZE FRAME_SIZE |
33 | #define PAGE_SIZE FRAME_SIZE |
34 | 34 | ||
35 | #ifndef __ASM__ |
35 | #ifndef __ASM__ |
36 | # define KA2PA(x) (((__address) (x)) - 0x80000000) |
36 | # define KA2PA(x) (((__address) (x)) - 0x80000000) |
37 | # define PA2KA(x) (((__address) (x)) + 0x80000000) |
37 | # define PA2KA(x) (((__address) (x)) + 0x80000000) |
38 | #else |
38 | #else |
39 | # define KA2PA(x) ((x) - 0x80000000) |
39 | # define KA2PA(x) ((x) - 0x80000000) |
40 | # define PA2KA(x) ((x) + 0x80000000) |
40 | # define PA2KA(x) ((x) + 0x80000000) |
41 | #endif |
41 | #endif |
42 | 42 | ||
43 | /* |
43 | /* |
44 | * Implementation of generic 4-level page table interface. |
44 | * Implementation of generic 4-level page table interface. |
45 | * IA-32 has 2-level page tables, so PTL1 and PTL2 are left out. |
45 | * IA-32 has 2-level page tables, so PTL1 and PTL2 are left out. |
46 | */ |
46 | */ |
- | 47 | #define PTL0_ENTRIES_ARCH 1024 |
|
- | 48 | #define PTL1_ENTRIES_ARCH 0 |
|
- | 49 | #define PTL2_ENTRIES_ARCH 0 |
|
- | 50 | #define PTL3_ENTRIES_ARCH 1024 |
|
- | 51 | ||
47 | #define PTL0_INDEX_ARCH(vaddr) (((vaddr)>>22)&0x3ff) |
52 | #define PTL0_INDEX_ARCH(vaddr) (((vaddr)>>22)&0x3ff) |
48 | #define PTL1_INDEX_ARCH(vaddr) 0 |
53 | #define PTL1_INDEX_ARCH(vaddr) 0 |
49 | #define PTL2_INDEX_ARCH(vaddr) 0 |
54 | #define PTL2_INDEX_ARCH(vaddr) 0 |
50 | #define PTL3_INDEX_ARCH(vaddr) (((vaddr)>>12)&0x3ff) |
55 | #define PTL3_INDEX_ARCH(vaddr) (((vaddr)>>12)&0x3ff) |
51 | 56 | ||
52 | #define GET_PTL1_ADDRESS_ARCH(ptl0, i) ((pte_t *)((((pte_t *)(ptl0))[(i)].frame_address)<<12)) |
57 | #define GET_PTL1_ADDRESS_ARCH(ptl0, i) ((pte_t *)((((pte_t *)(ptl0))[(i)].frame_address)<<12)) |
53 | #define GET_PTL2_ADDRESS_ARCH(ptl1, i) (ptl1) |
58 | #define GET_PTL2_ADDRESS_ARCH(ptl1, i) (ptl1) |
54 | #define GET_PTL3_ADDRESS_ARCH(ptl2, i) (ptl2) |
59 | #define GET_PTL3_ADDRESS_ARCH(ptl2, i) (ptl2) |
55 | #define GET_FRAME_ADDRESS_ARCH(ptl3, i) ((__address)((((pte_t *)(ptl3))[(i)].frame_address)<<12)) |
60 | #define GET_FRAME_ADDRESS_ARCH(ptl3, i) ((__address)((((pte_t *)(ptl3))[(i)].frame_address)<<12)) |
56 | 61 | ||
57 | #define SET_PTL0_ADDRESS_ARCH(ptl0) (write_cr3((__address) (ptl0))) |
62 | #define SET_PTL0_ADDRESS_ARCH(ptl0) (write_cr3((__address) (ptl0))) |
58 | #define SET_PTL1_ADDRESS_ARCH(ptl0, i, a) (((pte_t *)(ptl0))[(i)].frame_address = (a)>>12) |
63 | #define SET_PTL1_ADDRESS_ARCH(ptl0, i, a) (((pte_t *)(ptl0))[(i)].frame_address = (a)>>12) |
59 | #define SET_PTL2_ADDRESS_ARCH(ptl1, i, a) |
64 | #define SET_PTL2_ADDRESS_ARCH(ptl1, i, a) |
60 | #define SET_PTL3_ADDRESS_ARCH(ptl2, i, a) |
65 | #define SET_PTL3_ADDRESS_ARCH(ptl2, i, a) |
61 | #define SET_FRAME_ADDRESS_ARCH(ptl3, i, a) (((pte_t *)(ptl3))[(i)].frame_address = (a)>>12) |
66 | #define SET_FRAME_ADDRESS_ARCH(ptl3, i, a) (((pte_t *)(ptl3))[(i)].frame_address = (a)>>12) |
62 | 67 | ||
63 | #define GET_PTL1_FLAGS_ARCH(ptl0, i) get_pt_flags((pte_t *)(ptl0), (index_t)(i)) |
68 | #define GET_PTL1_FLAGS_ARCH(ptl0, i) get_pt_flags((pte_t *)(ptl0), (index_t)(i)) |
64 | #define GET_PTL2_FLAGS_ARCH(ptl1, i) PAGE_PRESENT |
69 | #define GET_PTL2_FLAGS_ARCH(ptl1, i) PAGE_PRESENT |
65 | #define GET_PTL3_FLAGS_ARCH(ptl2, i) PAGE_PRESENT |
70 | #define GET_PTL3_FLAGS_ARCH(ptl2, i) PAGE_PRESENT |
66 | #define GET_FRAME_FLAGS_ARCH(ptl3, i) get_pt_flags((pte_t *)(ptl3), (index_t)(i)) |
71 | #define GET_FRAME_FLAGS_ARCH(ptl3, i) get_pt_flags((pte_t *)(ptl3), (index_t)(i)) |
67 | 72 | ||
68 | #define SET_PTL1_FLAGS_ARCH(ptl0, i, x) set_pt_flags((pte_t *)(ptl0), (index_t)(i), (x)) |
73 | #define SET_PTL1_FLAGS_ARCH(ptl0, i, x) set_pt_flags((pte_t *)(ptl0), (index_t)(i), (x)) |
69 | #define SET_PTL2_FLAGS_ARCH(ptl1, i, x) |
74 | #define SET_PTL2_FLAGS_ARCH(ptl1, i, x) |
70 | #define SET_PTL3_FLAGS_ARCH(ptl2, i, x) |
75 | #define SET_PTL3_FLAGS_ARCH(ptl2, i, x) |
71 | #define SET_FRAME_FLAGS_ARCH(ptl3, i, x) set_pt_flags((pte_t *)(ptl3), (index_t)(i), (x)) |
76 | #define SET_FRAME_FLAGS_ARCH(ptl3, i, x) set_pt_flags((pte_t *)(ptl3), (index_t)(i), (x)) |
72 | 77 | ||
- | 78 | #define PTE_VALID_ARCH(p) (*((__u32 *) (p)) != 0) |
|
- | 79 | ||
73 | #ifndef __ASM__ |
80 | #ifndef __ASM__ |
74 | 81 | ||
75 | #include <mm/page.h> |
82 | #include <mm/page.h> |
76 | #include <arch/types.h> |
83 | #include <arch/types.h> |
77 | #include <arch/mm/frame.h> |
84 | #include <arch/mm/frame.h> |
78 | #include <typedefs.h> |
85 | #include <typedefs.h> |
79 | 86 | ||
80 | /** Page Table Entry. */ |
87 | /** Page Table Entry. */ |
81 | struct page_specifier { |
88 | struct page_specifier { |
82 | unsigned present : 1; |
89 | unsigned present : 1; |
83 | unsigned writeable : 1; |
90 | unsigned writeable : 1; |
84 | unsigned uaccessible : 1; |
91 | unsigned uaccessible : 1; |
85 | unsigned page_write_through : 1; |
92 | unsigned page_write_through : 1; |
86 | unsigned page_cache_disable : 1; |
93 | unsigned page_cache_disable : 1; |
87 | unsigned accessed : 1; |
94 | unsigned accessed : 1; |
88 | unsigned dirty : 1; |
95 | unsigned dirty : 1; |
89 | unsigned pat : 1; |
96 | unsigned pat : 1; |
90 | unsigned global : 1; |
97 | unsigned global : 1; |
91 | unsigned soft_valid : 1; /**< Valid content even if the present bit is not set. */ |
98 | unsigned soft_valid : 1; /**< Valid content even if the present bit is not set. */ |
92 | unsigned avl : 2; |
99 | unsigned avl : 2; |
93 | unsigned frame_address : 20; |
100 | unsigned frame_address : 20; |
94 | } __attribute__ ((packed)); |
101 | } __attribute__ ((packed)); |
95 | 102 | ||
96 | static inline int get_pt_flags(pte_t *pt, index_t i) |
103 | static inline int get_pt_flags(pte_t *pt, index_t i) |
97 | { |
104 | { |
98 | pte_t *p = &pt[i]; |
105 | pte_t *p = &pt[i]; |
99 | 106 | ||
100 | return ( |
107 | return ( |
101 | (!p->page_cache_disable)<<PAGE_CACHEABLE_SHIFT | |
108 | (!p->page_cache_disable)<<PAGE_CACHEABLE_SHIFT | |
102 | (!p->present)<<PAGE_PRESENT_SHIFT | |
109 | (!p->present)<<PAGE_PRESENT_SHIFT | |
103 | p->uaccessible<<PAGE_USER_SHIFT | |
110 | p->uaccessible<<PAGE_USER_SHIFT | |
104 | 1<<PAGE_READ_SHIFT | |
111 | 1<<PAGE_READ_SHIFT | |
105 | p->writeable<<PAGE_WRITE_SHIFT | |
112 | p->writeable<<PAGE_WRITE_SHIFT | |
106 | 1<<PAGE_EXEC_SHIFT | |
113 | 1<<PAGE_EXEC_SHIFT | |
107 | p->global<<PAGE_GLOBAL_SHIFT |
114 | p->global<<PAGE_GLOBAL_SHIFT |
108 | ); |
115 | ); |
109 | } |
116 | } |
110 | 117 | ||
111 | static inline void set_pt_flags(pte_t *pt, index_t i, int flags) |
118 | static inline void set_pt_flags(pte_t *pt, index_t i, int flags) |
112 | { |
119 | { |
113 | pte_t *p = &pt[i]; |
120 | pte_t *p = &pt[i]; |
114 | 121 | ||
115 | p->page_cache_disable = !(flags & PAGE_CACHEABLE); |
122 | p->page_cache_disable = !(flags & PAGE_CACHEABLE); |
116 | p->present = !(flags & PAGE_NOT_PRESENT); |
123 | p->present = !(flags & PAGE_NOT_PRESENT); |
117 | p->uaccessible = (flags & PAGE_USER) != 0; |
124 | p->uaccessible = (flags & PAGE_USER) != 0; |
118 | p->writeable = (flags & PAGE_WRITE) != 0; |
125 | p->writeable = (flags & PAGE_WRITE) != 0; |
119 | p->global = (flags & PAGE_GLOBAL) != 0; |
126 | p->global = (flags & PAGE_GLOBAL) != 0; |
120 | 127 | ||
121 | /* |
128 | /* |
122 | * Ensure that there is at least one bit set even if the present bit is cleared. |
129 | * Ensure that there is at least one bit set even if the present bit is cleared. |
123 | */ |
130 | */ |
124 | p->soft_valid = true; |
131 | p->soft_valid = true; |
125 | } |
132 | } |
126 | 133 | ||
127 | extern void page_arch_init(void); |
134 | extern void page_arch_init(void); |
128 | 135 | ||
129 | #endif /* __ASM__ */ |
136 | #endif /* __ASM__ */ |
130 | 137 | ||
131 | #endif |
138 | #endif |
132 | 139 |