Rev 106 | Rev 110 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 106 | Rev 109 | ||
---|---|---|---|
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 <arch/types.h> |
29 | #include <arch/types.h> |
30 | #include <config.h> |
30 | #include <config.h> |
31 | #include <func.h> |
31 | #include <func.h> |
32 | #include <mm/frame.h> |
32 | #include <mm/frame.h> |
33 | #include <mm/page.h> |
33 | #include <mm/page.h> |
34 | #include <arch/mm/page.h> |
34 | #include <arch/mm/page.h> |
35 | #include <arch/interrupt.h> |
35 | #include <arch/interrupt.h> |
36 | #include <arch/asm.h> |
36 | #include <arch/asm.h> |
37 | #include <synch/spinlock.h> |
37 | #include <synch/spinlock.h> |
38 | #include <debug.h> |
38 | #include <debug.h> |
39 | 39 | ||
40 | /* |
40 | /* |
41 | * Note. |
41 | * Note. |
42 | * This is the preliminary code for controlling paging mechanism on ia32. It is |
42 | * This is the preliminary code for controlling paging mechanism on ia32. It is |
43 | * needed by other parts of the kernel for its ability to map virtual addresses |
43 | * needed by other parts of the kernel for its ability to map virtual addresses |
44 | * to physical. SMP code relies on this feature. Other than that, this code is |
44 | * to physical. SMP code relies on this feature. Other than that, this code is |
45 | * by no means meant to implement virtual memory in terms of swapping pages in |
45 | * by no means meant to implement virtual memory in terms of swapping pages in |
46 | * and out. |
46 | * and out. |
47 | */ |
47 | */ |
48 | 48 | ||
49 | __address bootstrap_dba; |
49 | __address bootstrap_dba; |
50 | 50 | ||
51 | void page_arch_init(void) |
51 | void page_arch_init(void) |
52 | { |
52 | { |
53 | __address dba; |
53 | __address dba; |
54 | __u32 i; |
54 | __u32 i; |
55 | 55 | ||
56 | if (config.cpu_active == 1) { |
56 | if (config.cpu_active == 1) { |
57 | dba = frame_alloc(FRAME_KA | FRAME_PANIC); |
57 | dba = frame_alloc(FRAME_KA | FRAME_PANIC); |
58 | memsetb(dba, PAGE_SIZE, 0); |
58 | memsetb(dba, PAGE_SIZE, 0); |
59 | 59 | ||
60 | bootstrap_dba = dba; |
60 | bootstrap_dba = dba; |
61 | 61 | ||
62 | /* |
62 | /* |
63 | * Identity mapping for all but 0th page. |
63 | * Identity mapping for all but 0th page. |
64 | * PA2KA(identity) mapping for all but 0th page. |
64 | * PA2KA(identity) mapping for all but 0th page. |
65 | */ |
65 | */ |
66 | for (i = 1; i < frames; i++) { |
66 | for (i = 1; i < frames; i++) { |
67 | map_page_to_frame(i * PAGE_SIZE, i * PAGE_SIZE, PAGE_CACHEABLE, 0); |
67 | map_page_to_frame(i * PAGE_SIZE, i * PAGE_SIZE, PAGE_CACHEABLE, dba); |
68 | map_page_to_frame(PA2KA(i * PAGE_SIZE), i * PAGE_SIZE, PAGE_CACHEABLE, 0); |
68 | map_page_to_frame(PA2KA(i * PAGE_SIZE), i * PAGE_SIZE, PAGE_CACHEABLE, dba); |
69 | } |
69 | } |
70 | 70 | ||
71 | trap_register(14, page_fault); |
71 | trap_register(14, page_fault); |
72 | cpu_write_dba(KA2PA(dba)); |
72 | cpu_write_dba(KA2PA(dba)); |
73 | } |
73 | } |
74 | else { |
74 | else { |
75 | 75 | ||
76 | /* |
76 | /* |
77 | * Application processors need to create their own view of the |
77 | * Application processors need to create their own view of the |
78 | * virtual address space. Because of that, each AP copies |
78 | * virtual address space. Because of that, each AP copies |
79 | * already-initialized paging information from the bootstrap |
79 | * already-initialized paging information from the bootstrap |
80 | * processor and adjusts it to fulfill its needs. |
80 | * processor and adjusts it to fulfill its needs. |
81 | */ |
81 | */ |
82 | 82 | ||
83 | dba = frame_alloc(FRAME_KA | FRAME_PANIC); |
83 | dba = frame_alloc(FRAME_KA | FRAME_PANIC); |
84 | memcopy(bootstrap_dba, dba, PAGE_SIZE); |
84 | memcopy(bootstrap_dba, dba, PAGE_SIZE); |
85 | cpu_write_dba(KA2PA(dba)); |
85 | cpu_write_dba(KA2PA(dba)); |
86 | } |
86 | } |
87 | 87 | ||
88 | paging_on(); |
88 | paging_on(); |
89 | } |
89 | } |
90 | 90 | ||
91 | /* |
91 | /* |
92 | * Besides mapping pages to frames, this function also sets the present bit of |
92 | * Besides mapping pages to frames, this function also sets the present bit of |
93 | * the page's specifier in both page directory and respective page table. If |
93 | * the page's specifier in both page directory and respective page table. If |
94 | * the page table for this page has not been allocated so far, it will take |
94 | * the page table for this page has not been allocated so far, it will take |
95 | * care of it and allocate the necessary frame. |
95 | * care of it and allocate the necessary frame. |
96 | * |
96 | * |
97 | * When the copy parameter is positive, map_page_to_frame will not overwrite |
- | |
98 | * the current mapping. It will allocate a new frame and do the mapping on it |
- | |
99 | * instead. |
- | |
100 | * |
- | |
101 | * PAGE_CACHEABLE flag: when set, it turns caches for that page on |
97 | * PAGE_CACHEABLE flag: when set, it turns caches for that page on |
102 | * PAGE_NOT_PRESENT flag: when set, it marks the page not present |
98 | * PAGE_NOT_PRESENT flag: when set, it marks the page not present |
103 | * PAGE_USER flag: when set, the page is accessible from userspace |
99 | * PAGE_USER flag: when set, the page is accessible from userspace |
- | 100 | * |
|
- | 101 | * When the root parameter is non-zero, it is used as the page directory address. |
|
- | 102 | * Otherwise, the page directory address is read from CPU. |
|
104 | */ |
103 | */ |
105 | void map_page_to_frame(__address page, __address frame, int flags, int copy) |
104 | void map_page_to_frame(__address page, __address frame, int flags, __address root) |
106 | { |
105 | { |
107 | struct page_specifier *pd, *pt; |
106 | struct page_specifier *pd, *pt; |
108 | __address dba, newpt; |
107 | __address dba, newpt; |
109 | int pde, pte; |
108 | int pde, pte; |
110 | 109 | ||
111 | // TODO: map_page_to_frame should take dba as a parameter |
110 | if (root) dba = root; |
112 | // dba = cpu_read_dba(); |
111 | else dba = cpu_read_dba(); |
113 | dba = bootstrap_dba; |
- | |
114 | 112 | ||
115 | pde = page >> 22; /* page directory entry */ |
113 | pde = page >> 22; /* page directory entry */ |
116 | pte = (page >> 12) & 0x3ff; /* page table entry */ |
114 | pte = (page >> 12) & 0x3ff; /* page table entry */ |
117 | 115 | ||
118 | pd = (struct page_specifier *) dba; |
116 | pd = (struct page_specifier *) dba; |
119 | 117 | ||
120 | if (!pd[pde].present) { |
118 | if (!pd[pde].present) { |
121 | /* |
119 | /* |
122 | * There is currently no page table for this address. Allocate |
120 | * There is currently no page table for this address. Allocate |
123 | * frame for the page table and clean it. |
121 | * frame for the page table and clean it. |
124 | */ |
122 | */ |
125 | newpt = frame_alloc(FRAME_KA); |
123 | newpt = frame_alloc(FRAME_KA); |
126 | pd[pde].frame_address = KA2PA(newpt) >> 12; |
124 | pd[pde].frame_address = KA2PA(newpt) >> 12; |
127 | memsetb(newpt, PAGE_SIZE, 0); |
125 | memsetb(newpt, PAGE_SIZE, 0); |
128 | pd[pde].present = 1; |
126 | pd[pde].present = 1; |
129 | pd[pde].uaccessible = 1; |
127 | pd[pde].uaccessible = 1; |
130 | } |
128 | } |
131 | if (copy) { |
- | |
132 | newpt = frame_alloc(FRAME_KA); |
- | |
133 | memcopy(pd[pde].frame_address << 12, newpt, PAGE_SIZE); |
- | |
134 | pd[pde].frame_address = KA2PA(newpt) >> 12; |
- | |
135 | } |
- | |
136 | 129 | ||
137 | pt = (struct page_specifier *) (pd[pde].frame_address << 12); |
130 | pt = (struct page_specifier *) (pd[pde].frame_address << 12); |
138 | 131 | ||
139 | pt[pte].frame_address = frame >> 12; |
132 | pt[pte].frame_address = frame >> 12; |
140 | pt[pte].present = !(flags & PAGE_NOT_PRESENT); |
133 | pt[pte].present = !(flags & PAGE_NOT_PRESENT); |
141 | pt[pte].page_cache_disable = !(flags & PAGE_CACHEABLE); |
134 | pt[pte].page_cache_disable = !(flags & PAGE_CACHEABLE); |
142 | pt[pte].uaccessible = (flags & PAGE_USER) != 0; |
135 | pt[pte].uaccessible = (flags & PAGE_USER) != 0; |
143 | pt[pte].writeable = (flags & PAGE_WRITE) != 0; |
136 | pt[pte].writeable = (flags & PAGE_WRITE) != 0; |
144 | } |
137 | } |
145 | 138 |