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