Rev 654 | Rev 687 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 654 | Rev 684 | ||
---|---|---|---|
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 | #include <mm/page.h> |
29 | #include <mm/page.h> |
30 | #include <mm/frame.h> |
30 | #include <mm/frame.h> |
31 | #include <arch/mm/page.h> |
31 | #include <arch/mm/page.h> |
32 | #include <arch/types.h> |
32 | #include <arch/types.h> |
33 | #include <typedefs.h> |
33 | #include <typedefs.h> |
34 | #include <arch/asm.h> |
34 | #include <arch/asm.h> |
35 | #include <memstr.h> |
35 | #include <memstr.h> |
- | 36 | #include <debug.h> |
|
- | 37 | ||
- | 38 | /** Virtual operations for page subsystem. */ |
|
- | 39 | page_operations_t *page_operations = NULL; |
|
36 | 40 | ||
37 | void page_init(void) |
41 | void page_init(void) |
38 | { |
42 | { |
39 | page_arch_init(); |
43 | page_arch_init(); |
40 | page_mapping_insert(0x0, 0x0, PAGE_NOT_PRESENT, 0); |
44 | page_mapping_insert(0x0, 0x0, PAGE_NOT_PRESENT, 0); |
41 | } |
45 | } |
42 | 46 | ||
43 | /** Map memory structure |
47 | /** Map memory structure |
44 | * |
48 | * |
45 | * Identity-map memory structure |
49 | * Identity-map memory structure |
46 | * considering possible crossings |
50 | * considering possible crossings |
47 | * of page boundaries. |
51 | * of page boundaries. |
48 | * |
52 | * |
49 | * @param s Address of the structure. |
53 | * @param s Address of the structure. |
50 | * @param size Size of the structure. |
54 | * @param size Size of the structure. |
51 | */ |
55 | */ |
52 | void map_structure(__address s, size_t size) |
56 | void map_structure(__address s, size_t size) |
53 | { |
57 | { |
54 | int i, cnt, length; |
58 | int i, cnt, length; |
55 | 59 | ||
56 | length = size + (s - (s & ~(PAGE_SIZE-1))); |
60 | length = size + (s - (s & ~(PAGE_SIZE-1))); |
57 | cnt = length/PAGE_SIZE + (length%PAGE_SIZE>0); |
61 | cnt = length/PAGE_SIZE + (length%PAGE_SIZE>0); |
58 | 62 | ||
59 | for (i = 0; i < cnt; i++) |
63 | for (i = 0; i < cnt; i++) |
60 | page_mapping_insert(s + i*PAGE_SIZE, s + i*PAGE_SIZE, PAGE_NOT_CACHEABLE, 0); |
64 | page_mapping_insert(s + i*PAGE_SIZE, s + i*PAGE_SIZE, PAGE_NOT_CACHEABLE, 0); |
61 | 65 | ||
62 | } |
66 | } |
63 | 67 | ||
64 | /** Map page to frame |
68 | /** Map page to frame |
65 | * |
69 | * |
66 | * Map virtual address 'page' to physical address 'frame' |
70 | * Map virtual address 'page' to physical address 'frame' |
67 | * using 'flags'. Allocate and setup any missing page tables. |
71 | * using 'flags'. Allocate and setup any missing page tables. |
68 | * |
72 | * |
69 | * @param page Virtual address of the page to be mapped. |
73 | * @param page Virtual address of the page to be mapped. |
70 | * @param frame Physical address of memory frame to which the mapping is done. |
74 | * @param frame Physical address of memory frame to which the mapping is done. |
71 | * @param flags Flags to be used for mapping. |
75 | * @param flags Flags to be used for mapping. |
72 | * @param root Explicit PTL0 address. |
76 | * @param root Explicit PTL0 address. |
73 | */ |
77 | */ |
74 | void page_mapping_insert(__address page, __address frame, int flags, __address root) |
78 | void page_mapping_insert(__address page, __address frame, int flags, __address root) |
75 | { |
79 | { |
76 | pte_t *ptl0, *ptl1, *ptl2, *ptl3; |
- | |
77 | __address newpt; |
- | |
78 | - | ||
79 | ptl0 = (pte_t *) PA2KA(root ? root : (__address) GET_PTL0_ADDRESS()); |
- | |
80 | - | ||
81 | if (GET_PTL1_FLAGS(ptl0, PTL0_INDEX(page)) & PAGE_NOT_PRESENT) { |
- | |
82 | newpt = frame_alloc(FRAME_KA, ONE_FRAME); |
- | |
83 | memsetb(newpt, PAGE_SIZE, 0); |
80 | ASSERT(page_operations); |
84 | SET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page), KA2PA(newpt)); |
- | |
85 | SET_PTL1_FLAGS(ptl0, PTL0_INDEX(page), PAGE_PRESENT | PAGE_USER | PAGE_EXEC | PAGE_CACHEABLE | PAGE_WRITE); |
- | |
86 | } |
- | |
87 | - | ||
88 | ptl1 = (pte_t *) PA2KA(GET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page))); |
- | |
89 | - | ||
90 | if (GET_PTL2_FLAGS(ptl1, PTL1_INDEX(page)) & PAGE_NOT_PRESENT) { |
- | |
91 | newpt = frame_alloc(FRAME_KA, ONE_FRAME); |
- | |
92 | memsetb(newpt, PAGE_SIZE, 0); |
- | |
93 | SET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page), KA2PA(newpt)); |
- | |
94 | SET_PTL2_FLAGS(ptl1, PTL1_INDEX(page), PAGE_PRESENT | PAGE_USER | PAGE_EXEC | PAGE_CACHEABLE | PAGE_WRITE); |
- | |
95 | } |
- | |
96 | - | ||
97 | ptl2 = (pte_t *) PA2KA(GET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page))); |
- | |
98 | - | ||
99 | if (GET_PTL3_FLAGS(ptl2, PTL2_INDEX(page)) & PAGE_NOT_PRESENT) { |
- | |
100 | newpt = frame_alloc(FRAME_KA, ONE_FRAME); |
81 | ASSERT(page_operations->mapping_insert); |
101 | memsetb(newpt, PAGE_SIZE, 0); |
- | |
102 | SET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page), KA2PA(newpt)); |
- | |
103 | SET_PTL3_FLAGS(ptl2, PTL2_INDEX(page), PAGE_PRESENT | PAGE_USER | PAGE_EXEC | PAGE_CACHEABLE | PAGE_WRITE); |
- | |
104 | } |
82 | |
105 | - | ||
106 | ptl3 = (pte_t *) PA2KA(GET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page))); |
- | |
107 | - | ||
108 | SET_FRAME_ADDRESS(ptl3, PTL3_INDEX(page), frame); |
- | |
109 | SET_FRAME_FLAGS(ptl3, PTL3_INDEX(page), flags); |
83 | page_operations->mapping_insert(page, frame, flags, root); |
110 | } |
84 | } |
111 | 85 | ||
112 | /** Find mapping for virtual page |
86 | /** Find mapping for virtual page |
113 | * |
87 | * |
114 | * Find mapping for virtual page. |
88 | * Find mapping for virtual page. |
115 | * |
89 | * |
116 | * @param page Virtual page. |
90 | * @param page Virtual page. |
117 | * @param root PTL0 address if non-zero. |
91 | * @param root PTL0 address if non-zero. |
118 | * |
92 | * |
119 | * @return NULL if there is no such mapping; entry from PTL3 describing the mapping otherwise. |
93 | * @return NULL if there is no such mapping; entry from PTL3 describing the mapping otherwise. |
120 | */ |
94 | */ |
121 | pte_t *page_mapping_find(__address page, __address root) |
95 | pte_t *page_mapping_find(__address page, __address root) |
122 | { |
96 | { |
123 | pte_t *ptl0, *ptl1, *ptl2, *ptl3; |
97 | ASSERT(page_operations); |
124 | - | ||
125 | ptl0 = (pte_t *) PA2KA(root ? root : (__address) GET_PTL0_ADDRESS()); |
- | |
126 | - | ||
127 | if (GET_PTL1_FLAGS(ptl0, PTL0_INDEX(page)) & PAGE_NOT_PRESENT) |
- | |
128 | return NULL; |
- | |
129 | - | ||
130 | ptl1 = (pte_t *) PA2KA(GET_PTL1_ADDRESS(ptl0, PTL0_INDEX(page))); |
- | |
131 | - | ||
132 | if (GET_PTL2_FLAGS(ptl1, PTL1_INDEX(page)) & PAGE_NOT_PRESENT) |
- | |
133 | return NULL; |
- | |
134 | - | ||
135 | ptl2 = (pte_t *) PA2KA(GET_PTL2_ADDRESS(ptl1, PTL1_INDEX(page))); |
- | |
136 | - | ||
137 | if (GET_PTL3_FLAGS(ptl2, PTL2_INDEX(page)) & PAGE_NOT_PRESENT) |
98 | ASSERT(page_operations->mapping_find); |
138 | return NULL; |
- | |
139 | - | ||
140 | ptl3 = (pte_t *) PA2KA(GET_PTL3_ADDRESS(ptl2, PTL2_INDEX(page))); |
- | |
141 | 99 | ||
142 | return &ptl3[PTL3_INDEX(page)]; |
100 | return page_operations->mapping_find(page, root); |
143 | } |
101 | } |
144 | 102 |