hypervisor_machdep.c revision 1.22 1 /* $NetBSD: hypervisor_machdep.c,v 1.22 2012/11/10 16:28:06 cherry Exp $ */
2
3 /*
4 *
5 * Copyright (c) 2004 Christian Limpach.
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 *
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
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
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
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
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29 /******************************************************************************
30 * hypervisor.c
31 *
32 * Communication to/from hypervisor.
33 *
34 * Copyright (c) 2002-2004, K A Fraser
35 *
36 * Permission is hereby granted, free of charge, to any person obtaining a copy
37 * of this software and associated documentation files (the "Software"), to
38 * deal in the Software without restriction, including without limitation the
39 * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
40 * sell copies of the Software, and to permit persons to whom the Software is
41 * furnished to do so, subject to the following conditions:
42 *
43 * The above copyright notice and this permission notice shall be included in
44 * all copies or substantial portions of the Software.
45 *
46 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
47 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
48 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
49 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
50 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
51 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
52 * DEALINGS IN THE SOFTWARE.
53 */
54
55
56 #include <sys/cdefs.h>
57 __KERNEL_RCSID(0, "$NetBSD: hypervisor_machdep.c,v 1.22 2012/11/10 16:28:06 cherry Exp $");
58
59 #include <sys/param.h>
60 #include <sys/systm.h>
61 #include <sys/kmem.h>
62
63 #include <uvm/uvm_extern.h>
64
65 #include <machine/vmparam.h>
66 #include <machine/pmap.h>
67
68 #include <xen/xen.h>
69 #include <xen/hypervisor.h>
70 #include <xen/evtchn.h>
71 #include <xen/xenpmap.h>
72
73 #include "opt_xen.h"
74
75 /*
76 * arch-dependent p2m frame lists list (L3 and L2)
77 * used by Xen for save/restore mappings
78 */
79 static unsigned long * l3_p2m_page;
80 static unsigned long * l2_p2m_page;
81 static int l2_p2m_page_size; /* size of L2 page, in pages */
82
83 static void build_p2m_frame_list_list(void);
84 static void update_p2m_frame_list_list(void);
85
86 // #define PORT_DEBUG 4
87 // #define EARLY_DEBUG_EVENT
88
89 /* callback function type */
90 typedef void (*iterate_func_t)(struct cpu_info *, unsigned int,
91 unsigned int, unsigned int, void *);
92
93 static inline void
94 evt_iterate_bits(struct cpu_info *ci, volatile unsigned long *pendingl1,
95 volatile unsigned long *pendingl2,
96 volatile unsigned long *mask,
97 iterate_func_t iterate_pending, void *iterate_args)
98 {
99
100 KASSERT(pendingl1 != NULL);
101 KASSERT(pendingl2 != NULL);
102
103 unsigned long l1, l2;
104 unsigned int l1i, l2i, port;
105
106 l1 = xen_atomic_xchg(pendingl1, 0);
107 while ((l1i = xen_ffs(l1)) != 0) {
108 l1i--;
109 l1 &= ~(1UL << l1i);
110
111 l2 = pendingl2[l1i] & (mask != NULL ? ~mask[l1i] : -1UL);
112 l2 &= ci->ci_evtmask[l1i];
113
114 if (mask != NULL) xen_atomic_setbits_l(&mask[l1i], l2);
115 xen_atomic_clearbits_l(&pendingl2[l1i], l2);
116
117 while ((l2i = xen_ffs(l2)) != 0) {
118 l2i--;
119 l2 &= ~(1UL << l2i);
120
121 port = (l1i << LONG_SHIFT) + l2i;
122
123 iterate_pending(ci, port, l1i, l2i, iterate_args);
124 }
125 }
126 }
127
128 /*
129 * Set per-cpu "pending" information for outstanding events that
130 * cannot be processed now.
131 */
132
133 static inline void
134 evt_set_pending(struct cpu_info *ci, unsigned int port, unsigned int l1i,
135 unsigned int l2i, void *args)
136 {
137
138 KASSERT(args != NULL);
139 KASSERT(ci != NULL);
140
141 int *ret = args;
142
143 if (evtsource[port]) {
144 hypervisor_set_ipending(evtsource[port]->ev_cpu,
145 evtsource[port]->ev_imask, l1i, l2i);
146 evtsource[port]->ev_evcnt.ev_count++;
147 if (*ret == 0 && ci->ci_ilevel <
148 evtsource[port]->ev_maxlevel)
149 *ret = 1;
150 }
151 #ifdef DOM0OPS
152 else {
153 /* set pending event */
154 xenevt_setipending(l1i, l2i);
155 }
156 #endif
157 }
158
159 int stipending(void);
160 int
161 stipending(void)
162 {
163 volatile shared_info_t *s = HYPERVISOR_shared_info;
164 struct cpu_info *ci;
165 volatile struct vcpu_info *vci;
166 int ret;
167
168 ret = 0;
169 ci = curcpu();
170 vci = ci->ci_vcpu;
171
172 #if 0
173 if (HYPERVISOR_shared_info->events)
174 printf("stipending events %08lx mask %08lx ilevel %d\n",
175 HYPERVISOR_shared_info->events,
176 HYPERVISOR_shared_info->events_mask, ci->ci_ilevel);
177 #endif
178
179 #ifdef EARLY_DEBUG_EVENT
180 if (xen_atomic_test_bit(&s->evtchn_pending[0], debug_port)) {
181 xen_debug_handler(NULL);
182 xen_atomic_clear_bit(&s->evtchn_pending[0], debug_port);
183 }
184 #endif
185
186 /*
187 * we're only called after STIC, so we know that we'll have to
188 * STI at the end
189 */
190
191 while (vci->evtchn_upcall_pending) {
192 cli();
193
194 vci->evtchn_upcall_pending = 0;
195
196 evt_iterate_bits(ci, &vci->evtchn_pending_sel,
197 s->evtchn_pending, s->evtchn_mask,
198 evt_set_pending, &ret);
199
200 sti();
201 }
202
203 #if 0
204 if (ci->ci_ipending & 0x1)
205 printf("stipending events %08lx mask %08lx ilevel %d ipending %08x\n",
206 HYPERVISOR_shared_info->events,
207 HYPERVISOR_shared_info->events_mask, ci->ci_ilevel,
208 ci->ci_ipending);
209 #endif
210
211 return (ret);
212 }
213
214 /* Iterate through pending events and call the event handler */
215
216 static inline void
217 evt_do_hypervisor_callback(struct cpu_info *ci, unsigned int port,
218 unsigned int l1i, unsigned int l2i, void *args)
219 {
220 KASSERT(args != NULL);
221 KASSERT(ci == curcpu());
222
223 struct intrframe *regs = args;
224
225 #ifdef PORT_DEBUG
226 if (port == PORT_DEBUG)
227 printf("do_hypervisor_callback event %d\n", port);
228 #endif
229 if (evtsource[port]) {
230 ci->ci_idepth++;
231 evtchn_do_event(port, regs);
232 ci->ci_idepth--;
233 }
234 #ifdef DOM0OPS
235 else {
236 if (ci->ci_ilevel < IPL_HIGH) {
237 /* fast path */
238 int oipl = ci->ci_ilevel;
239 ci->ci_ilevel = IPL_HIGH;
240 ci->ci_idepth++;
241 xenevt_event(port);
242 ci->ci_idepth--;
243 ci->ci_ilevel = oipl;
244 } else {
245 /* set pending event */
246 xenevt_setipending(l1i, l2i);
247 }
248 }
249 #endif
250 }
251
252 void
253 do_hypervisor_callback(struct intrframe *regs)
254 {
255 volatile shared_info_t *s = HYPERVISOR_shared_info;
256 struct cpu_info *ci;
257 volatile struct vcpu_info *vci;
258 int level;
259
260 ci = curcpu();
261 vci = ci->ci_vcpu;
262 level = ci->ci_ilevel;
263
264 // DDD printf("do_hypervisor_callback\n");
265
266 #ifdef EARLY_DEBUG_EVENT
267 if (xen_atomic_test_bit(&s->evtchn_pending[0], debug_port)) {
268 xen_debug_handler(NULL);
269 xen_atomic_clear_bit(&s->evtchn_pending[0], debug_port);
270 }
271 #endif
272
273 while (vci->evtchn_upcall_pending) {
274 vci->evtchn_upcall_pending = 0;
275
276 evt_iterate_bits(ci, &vci->evtchn_pending_sel,
277 s->evtchn_pending, s->evtchn_mask,
278 evt_do_hypervisor_callback, regs);
279 }
280
281 #ifdef DIAGNOSTIC
282 if (level != ci->ci_ilevel)
283 printf("hypervisor done %08x level %d/%d ipending %08x\n",
284 (uint)vci->evtchn_pending_sel,
285 level, ci->ci_ilevel, ci->ci_ipending);
286 #endif
287 }
288
289 void
290 hypervisor_send_event(struct cpu_info *ci, unsigned int ev)
291 {
292 KASSERT(ci != NULL);
293
294 volatile shared_info_t *s = HYPERVISOR_shared_info;
295 volatile struct vcpu_info *vci = ci->ci_vcpu;
296
297 #ifdef PORT_DEBUG
298 if (ev == PORT_DEBUG)
299 printf("hypervisor_send_event %d\n", ev);
300 #endif
301
302 xen_atomic_set_bit(&s->evtchn_pending[0], ev);
303
304 if (__predict_false(ci == curcpu())) {
305 xen_atomic_set_bit(&vci->evtchn_pending_sel,
306 ev >> LONG_SHIFT);
307 xen_atomic_set_bit(&vci->evtchn_upcall_pending, 0);
308 }
309
310 xen_atomic_clear_bit(&s->evtchn_mask[0], ev);
311
312 if (__predict_true(ci == curcpu())) {
313 hypervisor_force_callback();
314 } else {
315 if (__predict_false(xen_send_ipi(ci, XEN_IPI_HVCB))) {
316 panic("xen_send_ipi(cpu%d, XEN_IPI_HVCB) failed\n",
317 (int) ci->ci_cpuid);
318 }
319 }
320 }
321
322 void
323 hypervisor_unmask_event(unsigned int ev)
324 {
325 volatile shared_info_t *s = HYPERVISOR_shared_info;
326 CPU_INFO_ITERATOR cii;
327 struct cpu_info *ci;
328 volatile struct vcpu_info *vci;
329
330 #ifdef PORT_DEBUG
331 if (ev == PORT_DEBUG)
332 printf("hypervisor_unmask_event %d\n", ev);
333 #endif
334
335 xen_atomic_clear_bit(&s->evtchn_mask[0], ev);
336 /*
337 * The following is basically the equivalent of
338 * 'hw_resend_irq'. Just like a real IO-APIC we 'lose the
339 * interrupt edge' if the channel is masked.
340 */
341 if (!xen_atomic_test_bit(&s->evtchn_pending[0], ev))
342 return;
343
344 for (CPU_INFO_FOREACH(cii, ci)) {
345 if (!xen_atomic_test_bit(&ci->ci_evtmask[0], ev))
346 continue;
347 vci = ci->ci_vcpu;
348 if (__predict_true(ci == curcpu())) {
349 if (!xen_atomic_test_and_set_bit(&vci->evtchn_pending_sel,
350 ev>>LONG_SHIFT))
351 xen_atomic_set_bit(&vci->evtchn_upcall_pending, 0);
352 }
353 if (!vci->evtchn_upcall_mask) {
354 if (__predict_true(ci == curcpu())) {
355 hypervisor_force_callback();
356 } else {
357 if (__predict_false(
358 xen_send_ipi(ci, XEN_IPI_HVCB))) {
359 panic("xen_send_ipi(cpu%d, "
360 "XEN_IPI_HVCB) failed\n",
361 (int) ci->ci_cpuid);
362 }
363 }
364 }
365 }
366 }
367
368 void
369 hypervisor_mask_event(unsigned int ev)
370 {
371 volatile shared_info_t *s = HYPERVISOR_shared_info;
372 #ifdef PORT_DEBUG
373 if (ev == PORT_DEBUG)
374 printf("hypervisor_mask_event %d\n", ev);
375 #endif
376
377 xen_atomic_set_bit(&s->evtchn_mask[0], ev);
378 }
379
380 void
381 hypervisor_clear_event(unsigned int ev)
382 {
383 volatile shared_info_t *s = HYPERVISOR_shared_info;
384 #ifdef PORT_DEBUG
385 if (ev == PORT_DEBUG)
386 printf("hypervisor_clear_event %d\n", ev);
387 #endif
388
389 xen_atomic_clear_bit(&s->evtchn_pending[0], ev);
390 }
391
392 static inline void
393 evt_enable_event(struct cpu_info *ci, unsigned int port,
394 unsigned int l1i, unsigned int l2i, void *args)
395 {
396 KASSERT(ci != NULL);
397 KASSERT(args == NULL);
398 hypervisor_enable_event(port);
399 }
400
401 void
402 hypervisor_enable_ipl(unsigned int ipl)
403 {
404 struct cpu_info *ci = curcpu();
405
406 /*
407 * enable all events for ipl. As we only set an event in ipl_evt_mask
408 * for its lowest IPL, and pending IPLs are processed high to low,
409 * we know that all callback for this event have been processed.
410 */
411
412 evt_iterate_bits(ci, &ci->ci_isources[ipl]->ipl_evt_mask1,
413 ci->ci_isources[ipl]->ipl_evt_mask2, NULL,
414 evt_enable_event, NULL);
415
416 }
417
418 void
419 hypervisor_set_ipending(struct cpu_info *ci, uint32_t iplmask, int l1, int l2)
420 {
421 int ipl;
422
423 /* set pending bit for the appropriate IPLs */
424 ci->ci_ipending |= iplmask;
425
426 /*
427 * And set event pending bit for the lowest IPL. As IPL are handled
428 * from high to low, this ensure that all callbacks will have been
429 * called when we ack the event
430 */
431 ipl = ffs(iplmask);
432 KASSERT(ipl > 0);
433 ipl--;
434 KASSERT(ipl < NIPL);
435 KASSERT(ci->ci_isources[ipl] != NULL);
436 ci->ci_isources[ipl]->ipl_evt_mask1 |= 1UL << l1;
437 ci->ci_isources[ipl]->ipl_evt_mask2[l1] |= 1UL << l2;
438 if (__predict_false(ci != curcpu())) {
439 if (xen_send_ipi(ci, XEN_IPI_HVCB)) {
440 panic("hypervisor_set_ipending: "
441 "xen_send_ipi(cpu%d, XEN_IPI_HVCB) failed\n",
442 (int) ci->ci_cpuid);
443 }
444 }
445 }
446
447 void
448 hypervisor_machdep_attach(void)
449 {
450 /* dom0 does not require the arch-dependent P2M translation table */
451 if (!xendomain_is_dom0()) {
452 build_p2m_frame_list_list();
453 sysctl_xen_suspend_setup();
454 }
455 }
456
457 void
458 hypervisor_machdep_resume(void)
459 {
460 /* dom0 does not require the arch-dependent P2M translation table */
461 if (!xendomain_is_dom0())
462 update_p2m_frame_list_list();
463 }
464
465 /*
466 * Generate the p2m_frame_list_list table,
467 * needed for guest save/restore
468 */
469 static void
470 build_p2m_frame_list_list(void)
471 {
472 int fpp; /* number of page (frame) pointer per page */
473 unsigned long max_pfn;
474 /*
475 * The p2m list is composed of three levels of indirection,
476 * each layer containing MFNs pointing to lower level pages
477 * The indirection is used to convert a given PFN to its MFN
478 * Each N level page can point to @fpp (N-1) level pages
479 * For example, for x86 32bit, we have:
480 * - PAGE_SIZE: 4096 bytes
481 * - fpp: 1024 (one L3 page can address 1024 L2 pages)
482 * A L1 page contains the list of MFN we are looking for
483 */
484 max_pfn = xen_start_info.nr_pages;
485 fpp = PAGE_SIZE / sizeof(xen_pfn_t);
486
487 /* we only need one L3 page */
488 l3_p2m_page = (vaddr_t *)uvm_km_alloc(kernel_map, PAGE_SIZE,
489 PAGE_SIZE, UVM_KMF_WIRED | UVM_KMF_NOWAIT);
490 if (l3_p2m_page == NULL)
491 panic("could not allocate memory for l3_p2m_page");
492
493 /*
494 * Determine how many L2 pages we need for the mapping
495 * Each L2 can map a total of @fpp L1 pages
496 */
497 l2_p2m_page_size = howmany(max_pfn, fpp);
498
499 l2_p2m_page = (vaddr_t *)uvm_km_alloc(kernel_map,
500 l2_p2m_page_size * PAGE_SIZE,
501 PAGE_SIZE, UVM_KMF_WIRED | UVM_KMF_NOWAIT);
502 if (l2_p2m_page == NULL)
503 panic("could not allocate memory for l2_p2m_page");
504
505 /* We now have L3 and L2 pages ready, update L1 mapping */
506 update_p2m_frame_list_list();
507
508 }
509
510 /*
511 * Update the L1 p2m_frame_list_list mapping (during guest boot or resume)
512 */
513 static void
514 update_p2m_frame_list_list(void)
515 {
516 int i;
517 int fpp; /* number of page (frame) pointer per page */
518 unsigned long max_pfn;
519
520 max_pfn = xen_start_info.nr_pages;
521 fpp = PAGE_SIZE / sizeof(xen_pfn_t);
522
523 for (i = 0; i < l2_p2m_page_size; i++) {
524 /*
525 * Each time we start a new L2 page,
526 * store its MFN in the L3 page
527 */
528 if ((i % fpp) == 0) {
529 l3_p2m_page[i/fpp] = vtomfn(
530 (vaddr_t)&l2_p2m_page[i]);
531 }
532 /*
533 * we use a shortcut
534 * since @xpmap_phys_to_machine_mapping array
535 * already contains PFN to MFN mapping, we just
536 * set the l2_p2m_page MFN pointer to the MFN of the
537 * according frame of @xpmap_phys_to_machine_mapping
538 */
539 l2_p2m_page[i] = vtomfn((vaddr_t)
540 &xpmap_phys_to_machine_mapping[i*fpp]);
541 }
542
543 HYPERVISOR_shared_info->arch.pfn_to_mfn_frame_list_list =
544 vtomfn((vaddr_t)l3_p2m_page);
545 HYPERVISOR_shared_info->arch.max_pfn = max_pfn;
546
547 }
548