Rev 904 | Rev 1702 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 904 | Rev 1210 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (C) 2006 Jakub Jermar |
2 | * Copyright (C) 2006 Jakub Jermar |
3 | * Copyright (C) 2006 Jakub Vana |
3 | * Copyright (C) 2006 Jakub Vana |
4 | * All rights reserved. |
4 | * All rights reserved. |
5 | * |
5 | * |
6 | * Redistribution and use in source and binary forms, with or without |
6 | * Redistribution and use in source and binary forms, with or without |
7 | * modification, are permitted provided that the following conditions |
7 | * modification, are permitted provided that the following conditions |
8 | * are met: |
8 | * are met: |
9 | * |
9 | * |
10 | * - Redistributions of source code must retain the above copyright |
10 | * - Redistributions of source code must retain the above copyright |
11 | * notice, this list of conditions and the following disclaimer. |
11 | * notice, this list of conditions and the following disclaimer. |
12 | * - Redistributions in binary form must reproduce the above copyright |
12 | * - Redistributions in binary form must reproduce the above copyright |
13 | * notice, this list of conditions and the following disclaimer in the |
13 | * notice, this list of conditions and the following disclaimer in the |
14 | * documentation and/or other materials provided with the distribution. |
14 | * documentation and/or other materials provided with the distribution. |
15 | * - The name of the author may not be used to endorse or promote products |
15 | * - The name of the author may not be used to endorse or promote products |
16 | * derived from this software without specific prior written permission. |
16 | * derived from this software without specific prior written permission. |
17 | * |
17 | * |
18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
19 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
23 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
28 | */ |
28 | */ |
29 | 29 | ||
30 | #include <arch/mm/page.h> |
30 | #include <arch/mm/page.h> |
31 | #include <genarch/mm/page_ht.h> |
31 | #include <genarch/mm/page_ht.h> |
32 | #include <mm/asid.h> |
32 | #include <mm/asid.h> |
33 | #include <arch/mm/asid.h> |
33 | #include <arch/mm/asid.h> |
- | 34 | #include <arch/mm/vhpt.h> |
|
34 | #include <arch/types.h> |
35 | #include <arch/types.h> |
35 | #include <typedefs.h> |
36 | #include <typedefs.h> |
36 | #include <print.h> |
37 | #include <print.h> |
37 | #include <mm/page.h> |
38 | #include <mm/page.h> |
38 | #include <mm/frame.h> |
39 | #include <mm/frame.h> |
39 | #include <config.h> |
40 | #include <config.h> |
40 | #include <panic.h> |
41 | #include <panic.h> |
41 | #include <arch/asm.h> |
42 | #include <arch/asm.h> |
42 | #include <arch/barrier.h> |
43 | #include <arch/barrier.h> |
43 | #include <memstr.h> |
44 | #include <memstr.h> |
44 | 45 | ||
45 | static void set_environment(void); |
46 | static void set_environment(void); |
46 | 47 | ||
47 | /** Initialize ia64 virtual address translation subsystem. */ |
48 | /** Initialize ia64 virtual address translation subsystem. */ |
48 | void page_arch_init(void) |
49 | void page_arch_init(void) |
49 | { |
50 | { |
50 | page_mapping_operations = &ht_mapping_operations; |
51 | page_mapping_operations = &ht_mapping_operations; |
51 | pk_disable(); |
52 | pk_disable(); |
52 | set_environment(); |
53 | set_environment(); |
53 | } |
54 | } |
54 | 55 | ||
55 | /** Initialize VHPT and region registers. */ |
56 | /** Initialize VHPT and region registers. */ |
56 | void set_environment(void) |
57 | void set_environment(void) |
57 | { |
58 | { |
58 | region_register rr; |
59 | region_register rr; |
59 | pta_register pta; |
60 | pta_register pta; |
60 | int i; |
61 | int i; |
- | 62 | #ifdef CONFIG_VHPT |
|
- | 63 | __address vhpt_base; |
|
- | 64 | #endif |
|
61 | 65 | ||
62 | /* |
66 | /* |
63 | * First set up kernel region register. |
67 | * First set up kernel region register. |
64 | * This is redundant (see start.S) but we keep it here just for sure. |
68 | * This is redundant (see start.S) but we keep it here just for sure. |
65 | */ |
69 | */ |
66 | rr.word = rr_read(VRN_KERNEL); |
70 | rr.word = rr_read(VRN_KERNEL); |
67 | rr.map.ve = 0; /* disable VHPT walker */ |
71 | rr.map.ve = 0; /* disable VHPT walker */ |
68 | rr.map.ps = PAGE_WIDTH; |
72 | rr.map.ps = PAGE_WIDTH; |
69 | rr.map.rid = ASID2RID(ASID_KERNEL, VRN_KERNEL); |
73 | rr.map.rid = ASID2RID(ASID_KERNEL, VRN_KERNEL); |
70 | rr_write(VRN_KERNEL, rr.word); |
74 | rr_write(VRN_KERNEL, rr.word); |
71 | srlz_i(); |
75 | srlz_i(); |
72 | srlz_d(); |
76 | srlz_d(); |
73 | 77 | ||
74 | /* |
78 | /* |
75 | * And setup the rest of region register. |
79 | * And setup the rest of region register. |
76 | */ |
80 | */ |
77 | for(i = 0; i < REGION_REGISTERS; i++) { |
81 | for(i = 0; i < REGION_REGISTERS; i++) { |
78 | /* skip kernel rr */ |
82 | /* skip kernel rr */ |
79 | if (i == VRN_KERNEL) |
83 | if (i == VRN_KERNEL) |
80 | continue; |
84 | continue; |
81 | 85 | ||
82 | rr.word = rr_read(i); |
86 | rr.word = rr_read(i); |
83 | rr.map.ve = 0; /* disable VHPT walker */ |
87 | rr.map.ve = 0; /* disable VHPT walker */ |
84 | rr.map.rid = RID_KERNEL; |
88 | rr.map.rid = RID_KERNEL; |
85 | rr.map.ps = PAGE_WIDTH; |
89 | rr.map.ps = PAGE_WIDTH; |
86 | rr_write(i, rr.word); |
90 | rr_write(i, rr.word); |
87 | srlz_i(); |
91 | srlz_i(); |
88 | srlz_d(); |
92 | srlz_d(); |
89 | } |
93 | } |
90 | 94 | ||
- | 95 | #ifdef CONFIG_VHPT |
|
- | 96 | vhpt_base = vhpt_set_up(); |
|
- | 97 | #endif |
|
91 | /* |
98 | /* |
92 | * Set up PTA register. |
99 | * Set up PTA register. |
93 | */ |
100 | */ |
94 | pta.word = pta_read(); |
101 | pta.word = pta_read(); |
- | 102 | #ifndef CONFIG_VHPT |
|
95 | pta.map.ve = 0; /* disable VHPT walker */ |
103 | pta.map.ve = 0; /* disable VHPT walker */ |
- | 104 | pta.map.base = 0 >> PTA_BASE_SHIFT; |
|
- | 105 | #else |
|
- | 106 | pta.map.ve = 1; /* enable VHPT walker */ |
|
- | 107 | pta.map.base = vhpt_base >> PTA_BASE_SHIFT; |
|
- | 108 | #endif |
|
96 | pta.map.vf = 1; /* large entry format */ |
109 | pta.map.vf = 1; /* large entry format */ |
97 | pta.map.size = VHPT_WIDTH; |
110 | pta.map.size = VHPT_WIDTH; |
98 | pta.map.base = VHPT_BASE >> PTA_BASE_SHIFT; |
- | |
99 | pta_write(pta.word); |
111 | pta_write(pta.word); |
100 | srlz_i(); |
112 | srlz_i(); |
101 | srlz_d(); |
113 | srlz_d(); |
102 | } |
114 | } |
103 | 115 | ||
104 | /** Calculate address of collision chain from VPN and ASID. |
116 | /** Calculate address of collision chain from VPN and ASID. |
105 | * |
117 | * |
106 | * Interrupts must be disabled. |
118 | * Interrupts must be disabled. |
107 | * |
119 | * |
108 | * @param page Address of virtual page including VRN bits. |
120 | * @param page Address of virtual page including VRN bits. |
109 | * @param asid Address space identifier. |
121 | * @param asid Address space identifier. |
110 | * |
122 | * |
111 | * @return VHPT entry address. |
123 | * @return VHPT entry address. |
112 | */ |
124 | */ |
113 | vhpt_entry_t *vhpt_hash(__address page, asid_t asid) |
125 | vhpt_entry_t *vhpt_hash(__address page, asid_t asid) |
114 | { |
126 | { |
115 | region_register rr_save, rr; |
127 | region_register rr_save, rr; |
116 | index_t vrn; |
128 | index_t vrn; |
117 | rid_t rid; |
129 | rid_t rid; |
118 | vhpt_entry_t *v; |
130 | vhpt_entry_t *v; |
119 | 131 | ||
120 | vrn = page >> VRN_SHIFT; |
132 | vrn = page >> VRN_SHIFT; |
121 | rid = ASID2RID(asid, vrn); |
133 | rid = ASID2RID(asid, vrn); |
122 | 134 | ||
123 | rr_save.word = rr_read(vrn); |
135 | rr_save.word = rr_read(vrn); |
124 | if (rr_save.map.rid == rid) { |
136 | if (rr_save.map.rid == rid) { |
125 | /* |
137 | /* |
126 | * The RID is already in place, compute thash and return. |
138 | * The RID is already in place, compute thash and return. |
127 | */ |
139 | */ |
128 | v = (vhpt_entry_t *) thash(page); |
140 | v = (vhpt_entry_t *) thash(page); |
129 | return v; |
141 | return v; |
130 | } |
142 | } |
131 | 143 | ||
132 | /* |
144 | /* |
133 | * The RID must be written to some region register. |
145 | * The RID must be written to some region register. |
134 | * To speed things up, register indexed by vrn is used. |
146 | * To speed things up, register indexed by vrn is used. |
135 | */ |
147 | */ |
136 | rr.word = rr_save.word; |
148 | rr.word = rr_save.word; |
137 | rr.map.rid = rid; |
149 | rr.map.rid = rid; |
138 | rr_write(vrn, rr.word); |
150 | rr_write(vrn, rr.word); |
139 | srlz_i(); |
151 | srlz_i(); |
140 | v = (vhpt_entry_t *) thash(page); |
152 | v = (vhpt_entry_t *) thash(page); |
141 | rr_write(vrn, rr_save.word); |
153 | rr_write(vrn, rr_save.word); |
142 | srlz_i(); |
154 | srlz_i(); |
143 | srlz_d(); |
155 | srlz_d(); |
144 | 156 | ||
145 | return v; |
157 | return v; |
146 | } |
158 | } |
147 | 159 | ||
148 | /** Compare ASID and VPN against PTE. |
160 | /** Compare ASID and VPN against PTE. |
149 | * |
161 | * |
150 | * Interrupts must be disabled. |
162 | * Interrupts must be disabled. |
151 | * |
163 | * |
152 | * @param page Address of virtual page including VRN bits. |
164 | * @param page Address of virtual page including VRN bits. |
153 | * @param asid Address space identifier. |
165 | * @param asid Address space identifier. |
154 | * |
166 | * |
155 | * @return True if page and asid match the page and asid of t, false otherwise. |
167 | * @return True if page and asid match the page and asid of t, false otherwise. |
156 | */ |
168 | */ |
157 | bool vhpt_compare(__address page, asid_t asid, vhpt_entry_t *v) |
169 | bool vhpt_compare(__address page, asid_t asid, vhpt_entry_t *v) |
158 | { |
170 | { |
159 | region_register rr_save, rr; |
171 | region_register rr_save, rr; |
160 | index_t vrn; |
172 | index_t vrn; |
161 | rid_t rid; |
173 | rid_t rid; |
162 | bool match; |
174 | bool match; |
163 | 175 | ||
164 | ASSERT(v); |
176 | ASSERT(v); |
165 | 177 | ||
166 | vrn = page >> VRN_SHIFT; |
178 | vrn = page >> VRN_SHIFT; |
167 | rid = ASID2RID(asid, vrn); |
179 | rid = ASID2RID(asid, vrn); |
168 | 180 | ||
169 | rr_save.word = rr_read(vrn); |
181 | rr_save.word = rr_read(vrn); |
170 | if (rr_save.map.rid == rid) { |
182 | if (rr_save.map.rid == rid) { |
171 | /* |
183 | /* |
172 | * The RID is already in place, compare ttag with t and return. |
184 | * The RID is already in place, compare ttag with t and return. |
173 | */ |
185 | */ |
174 | return ttag(page) == v->present.tag.tag_word; |
186 | return ttag(page) == v->present.tag.tag_word; |
175 | } |
187 | } |
176 | 188 | ||
177 | /* |
189 | /* |
178 | * The RID must be written to some region register. |
190 | * The RID must be written to some region register. |
179 | * To speed things up, register indexed by vrn is used. |
191 | * To speed things up, register indexed by vrn is used. |
180 | */ |
192 | */ |
181 | rr.word = rr_save.word; |
193 | rr.word = rr_save.word; |
182 | rr.map.rid = rid; |
194 | rr.map.rid = rid; |
183 | rr_write(vrn, rr.word); |
195 | rr_write(vrn, rr.word); |
184 | srlz_i(); |
196 | srlz_i(); |
185 | match = (ttag(page) == v->present.tag.tag_word); |
197 | match = (ttag(page) == v->present.tag.tag_word); |
186 | rr_write(vrn, rr_save.word); |
198 | rr_write(vrn, rr_save.word); |
187 | srlz_i(); |
199 | srlz_i(); |
188 | srlz_d(); |
200 | srlz_d(); |
189 | 201 | ||
190 | return match; |
202 | return match; |
191 | } |
203 | } |
192 | 204 | ||
193 | /** Set up one VHPT entry. |
205 | /** Set up one VHPT entry. |
194 | * |
206 | * |
195 | * @param t VHPT entry to be set up. |
207 | * @param t VHPT entry to be set up. |
196 | * @param page Virtual address of the page mapped by the entry. |
208 | * @param page Virtual address of the page mapped by the entry. |
197 | * @param asid Address space identifier of the address space to which page belongs. |
209 | * @param asid Address space identifier of the address space to which page belongs. |
198 | * @param frame Physical address of the frame to wich page is mapped. |
210 | * @param frame Physical address of the frame to wich page is mapped. |
199 | * @param flags Different flags for the mapping. |
211 | * @param flags Different flags for the mapping. |
200 | */ |
212 | */ |
201 | void vhpt_set_record(vhpt_entry_t *v, __address page, asid_t asid, __address frame, int flags) |
213 | void vhpt_set_record(vhpt_entry_t *v, __address page, asid_t asid, __address frame, int flags) |
202 | { |
214 | { |
203 | region_register rr_save, rr; |
215 | region_register rr_save, rr; |
204 | index_t vrn; |
216 | index_t vrn; |
205 | rid_t rid; |
217 | rid_t rid; |
206 | __u64 tag; |
218 | __u64 tag; |
207 | 219 | ||
208 | ASSERT(v); |
220 | ASSERT(v); |
209 | 221 | ||
210 | vrn = page >> VRN_SHIFT; |
222 | vrn = page >> VRN_SHIFT; |
211 | rid = ASID2RID(asid, vrn); |
223 | rid = ASID2RID(asid, vrn); |
212 | 224 | ||
213 | /* |
225 | /* |
214 | * Compute ttag. |
226 | * Compute ttag. |
215 | */ |
227 | */ |
216 | rr_save.word = rr_read(vrn); |
228 | rr_save.word = rr_read(vrn); |
217 | rr.word = rr_save.word; |
229 | rr.word = rr_save.word; |
218 | rr.map.rid = rid; |
230 | rr.map.rid = rid; |
219 | rr_write(vrn, rr.word); |
231 | rr_write(vrn, rr.word); |
220 | srlz_i(); |
232 | srlz_i(); |
221 | tag = ttag(page); |
233 | tag = ttag(page); |
222 | rr_write(vrn, rr_save.word); |
234 | rr_write(vrn, rr_save.word); |
223 | srlz_i(); |
235 | srlz_i(); |
224 | srlz_d(); |
236 | srlz_d(); |
225 | 237 | ||
226 | /* |
238 | /* |
227 | * Clear the entry. |
239 | * Clear the entry. |
228 | */ |
240 | */ |
229 | v->word[0] = 0; |
241 | v->word[0] = 0; |
230 | v->word[1] = 0; |
242 | v->word[1] = 0; |
231 | v->word[2] = 0; |
243 | v->word[2] = 0; |
232 | v->word[3] = 0; |
244 | v->word[3] = 0; |
233 | 245 | ||
234 | v->present.p = true; |
246 | v->present.p = true; |
235 | v->present.ma = (flags & PAGE_CACHEABLE) ? MA_WRITEBACK : MA_UNCACHEABLE; |
247 | v->present.ma = (flags & PAGE_CACHEABLE) ? MA_WRITEBACK : MA_UNCACHEABLE; |
236 | v->present.a = false; /* not accessed */ |
248 | v->present.a = false; /* not accessed */ |
237 | v->present.d = false; /* not dirty */ |
249 | v->present.d = false; /* not dirty */ |
238 | v->present.pl = (flags & PAGE_USER) ? PL_USER : PL_KERNEL; |
250 | v->present.pl = (flags & PAGE_USER) ? PL_USER : PL_KERNEL; |
239 | v->present.ar = (flags & PAGE_WRITE) ? AR_WRITE : AR_READ; |
251 | v->present.ar = (flags & PAGE_WRITE) ? AR_WRITE : AR_READ; |
240 | v->present.ar |= (flags & PAGE_EXEC) ? AR_EXECUTE : 0; |
252 | v->present.ar |= (flags & PAGE_EXEC) ? AR_EXECUTE : 0; |
241 | v->present.ppn = frame >> PPN_SHIFT; |
253 | v->present.ppn = frame >> PPN_SHIFT; |
242 | v->present.ed = false; /* exception not deffered */ |
254 | v->present.ed = false; /* exception not deffered */ |
243 | v->present.ps = PAGE_WIDTH; |
255 | v->present.ps = PAGE_WIDTH; |
244 | v->present.key = 0; |
256 | v->present.key = 0; |
245 | v->present.tag.tag_word = tag; |
257 | v->present.tag.tag_word = tag; |
246 | } |
258 | } |
247 | 259 |