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