xen_pmap.c revision 1.2 1 1.2 chuck /* $NetBSD: xen_pmap.c,v 1.2 2011/02/01 21:18:56 chuck Exp $ */
2 1.2 chuck
3 1.1 dyoung /*
4 1.1 dyoung * Copyright (c) 2007 Manuel Bouyer.
5 1.1 dyoung *
6 1.1 dyoung * Redistribution and use in source and binary forms, with or without
7 1.1 dyoung * modification, are permitted provided that the following conditions
8 1.1 dyoung * are met:
9 1.1 dyoung * 1. Redistributions of source code must retain the above copyright
10 1.1 dyoung * notice, this list of conditions and the following disclaimer.
11 1.1 dyoung * 2. Redistributions in binary form must reproduce the above copyright
12 1.1 dyoung * notice, this list of conditions and the following disclaimer in the
13 1.1 dyoung * documentation and/or other materials provided with the distribution.
14 1.1 dyoung *
15 1.1 dyoung * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16 1.1 dyoung * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17 1.1 dyoung * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18 1.1 dyoung * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19 1.1 dyoung * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20 1.1 dyoung * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 1.1 dyoung * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 1.1 dyoung * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 1.1 dyoung * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24 1.1 dyoung * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25 1.1 dyoung *
26 1.1 dyoung */
27 1.1 dyoung
28 1.1 dyoung /*
29 1.1 dyoung * Copyright (c) 2006 Mathieu Ropert <mro (at) adviseo.fr>
30 1.1 dyoung *
31 1.1 dyoung * Permission to use, copy, modify, and distribute this software for any
32 1.1 dyoung * purpose with or without fee is hereby granted, provided that the above
33 1.1 dyoung * copyright notice and this permission notice appear in all copies.
34 1.1 dyoung *
35 1.1 dyoung * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
36 1.1 dyoung * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
37 1.1 dyoung * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
38 1.1 dyoung * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
39 1.1 dyoung * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
40 1.1 dyoung * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
41 1.1 dyoung * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
42 1.1 dyoung */
43 1.1 dyoung
44 1.1 dyoung /*
45 1.1 dyoung * Copyright (c) 1997 Charles D. Cranor and Washington University.
46 1.1 dyoung * All rights reserved.
47 1.1 dyoung *
48 1.1 dyoung * Redistribution and use in source and binary forms, with or without
49 1.1 dyoung * modification, are permitted provided that the following conditions
50 1.1 dyoung * are met:
51 1.1 dyoung * 1. Redistributions of source code must retain the above copyright
52 1.1 dyoung * notice, this list of conditions and the following disclaimer.
53 1.1 dyoung * 2. Redistributions in binary form must reproduce the above copyright
54 1.1 dyoung * notice, this list of conditions and the following disclaimer in the
55 1.1 dyoung * documentation and/or other materials provided with the distribution.
56 1.1 dyoung *
57 1.1 dyoung * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
58 1.1 dyoung * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
59 1.1 dyoung * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
60 1.1 dyoung * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
61 1.1 dyoung * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
62 1.1 dyoung * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
63 1.1 dyoung * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
64 1.1 dyoung * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
65 1.1 dyoung * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
66 1.1 dyoung * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
67 1.1 dyoung */
68 1.1 dyoung
69 1.1 dyoung /*
70 1.1 dyoung * Copyright 2001 (c) Wasabi Systems, Inc.
71 1.1 dyoung * All rights reserved.
72 1.1 dyoung *
73 1.1 dyoung * Written by Frank van der Linden for Wasabi Systems, Inc.
74 1.1 dyoung *
75 1.1 dyoung * Redistribution and use in source and binary forms, with or without
76 1.1 dyoung * modification, are permitted provided that the following conditions
77 1.1 dyoung * are met:
78 1.1 dyoung * 1. Redistributions of source code must retain the above copyright
79 1.1 dyoung * notice, this list of conditions and the following disclaimer.
80 1.1 dyoung * 2. Redistributions in binary form must reproduce the above copyright
81 1.1 dyoung * notice, this list of conditions and the following disclaimer in the
82 1.1 dyoung * documentation and/or other materials provided with the distribution.
83 1.1 dyoung * 3. All advertising materials mentioning features or use of this software
84 1.1 dyoung * must display the following acknowledgement:
85 1.1 dyoung * This product includes software developed for the NetBSD Project by
86 1.1 dyoung * Wasabi Systems, Inc.
87 1.1 dyoung * 4. The name of Wasabi Systems, Inc. may not be used to endorse
88 1.1 dyoung * or promote products derived from this software without specific prior
89 1.1 dyoung * written permission.
90 1.1 dyoung *
91 1.1 dyoung * THIS SOFTWARE IS PROVIDED BY WASABI SYSTEMS, INC. ``AS IS'' AND
92 1.1 dyoung * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
93 1.1 dyoung * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
94 1.1 dyoung * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL WASABI SYSTEMS, INC
95 1.1 dyoung * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
96 1.1 dyoung * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
97 1.1 dyoung * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
98 1.1 dyoung * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
99 1.1 dyoung * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
100 1.1 dyoung * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
101 1.1 dyoung * POSSIBILITY OF SUCH DAMAGE.
102 1.1 dyoung */
103 1.1 dyoung
104 1.1 dyoung #include <sys/cdefs.h>
105 1.2 chuck __KERNEL_RCSID(0, "$NetBSD: xen_pmap.c,v 1.2 2011/02/01 21:18:56 chuck Exp $");
106 1.1 dyoung
107 1.1 dyoung #include "opt_user_ldt.h"
108 1.1 dyoung #include "opt_lockdebug.h"
109 1.1 dyoung #include "opt_multiprocessor.h"
110 1.1 dyoung #include "opt_xen.h"
111 1.1 dyoung #if !defined(__x86_64__)
112 1.1 dyoung #include "opt_kstack_dr0.h"
113 1.1 dyoung #endif /* !defined(__x86_64__) */
114 1.1 dyoung
115 1.1 dyoung #include <sys/param.h>
116 1.1 dyoung #include <sys/systm.h>
117 1.1 dyoung #include <sys/proc.h>
118 1.1 dyoung #include <sys/pool.h>
119 1.1 dyoung #include <sys/kernel.h>
120 1.1 dyoung #include <sys/atomic.h>
121 1.1 dyoung #include <sys/cpu.h>
122 1.1 dyoung #include <sys/intr.h>
123 1.1 dyoung #include <sys/xcall.h>
124 1.1 dyoung
125 1.1 dyoung #include <uvm/uvm.h>
126 1.1 dyoung
127 1.1 dyoung #include <dev/isa/isareg.h>
128 1.1 dyoung
129 1.1 dyoung #include <machine/specialreg.h>
130 1.1 dyoung #include <machine/gdt.h>
131 1.1 dyoung #include <machine/isa_machdep.h>
132 1.1 dyoung #include <machine/cpuvar.h>
133 1.1 dyoung
134 1.1 dyoung #include <x86/pmap.h>
135 1.1 dyoung #include <x86/pmap_pv.h>
136 1.1 dyoung
137 1.1 dyoung #include <x86/i82489reg.h>
138 1.1 dyoung #include <x86/i82489var.h>
139 1.1 dyoung
140 1.1 dyoung #ifdef XEN
141 1.1 dyoung #include <xen/xen3-public/xen.h>
142 1.1 dyoung #include <xen/hypervisor.h>
143 1.1 dyoung #endif
144 1.1 dyoung
145 1.1 dyoung /* flag to be used for kernel mappings: PG_u on Xen/amd64, 0 otherwise */
146 1.1 dyoung #if defined(XEN) && defined(__x86_64__)
147 1.1 dyoung #define PG_k PG_u
148 1.1 dyoung #else
149 1.1 dyoung #define PG_k 0
150 1.1 dyoung #endif
151 1.1 dyoung
152 1.1 dyoung extern paddr_t pmap_pa_start; /* PA of first physical page for this domain */
153 1.1 dyoung extern paddr_t pmap_pa_end; /* PA of last physical page for this domain */
154 1.1 dyoung
155 1.1 dyoung int
156 1.1 dyoung pmap_enter(struct pmap *pmap, vaddr_t va, paddr_t pa, vm_prot_t prot, u_int flags)
157 1.1 dyoung {
158 1.1 dyoung paddr_t ma;
159 1.1 dyoung
160 1.1 dyoung if (__predict_false(pa < pmap_pa_start || pmap_pa_end <= pa)) {
161 1.1 dyoung ma = pa; /* XXX hack */
162 1.1 dyoung } else {
163 1.1 dyoung ma = xpmap_ptom(pa);
164 1.1 dyoung }
165 1.1 dyoung
166 1.1 dyoung return pmap_enter_ma(pmap, va, ma, pa, prot, flags, DOMID_SELF);
167 1.1 dyoung }
168 1.1 dyoung
169 1.1 dyoung /*
170 1.1 dyoung * pmap_kenter_ma: enter a kernel mapping without R/M (pv_entry) tracking
171 1.1 dyoung *
172 1.1 dyoung * => no need to lock anything, assume va is already allocated
173 1.1 dyoung * => should be faster than normal pmap enter function
174 1.1 dyoung * => we expect a MACHINE address
175 1.1 dyoung */
176 1.1 dyoung
177 1.1 dyoung void
178 1.1 dyoung pmap_kenter_ma(vaddr_t va, paddr_t ma, vm_prot_t prot, u_int flags)
179 1.1 dyoung {
180 1.1 dyoung pt_entry_t *pte, opte, npte;
181 1.1 dyoung
182 1.1 dyoung if (va < VM_MIN_KERNEL_ADDRESS)
183 1.1 dyoung pte = vtopte(va);
184 1.1 dyoung else
185 1.1 dyoung pte = kvtopte(va);
186 1.1 dyoung
187 1.1 dyoung npte = ma | ((prot & VM_PROT_WRITE) ? PG_RW : PG_RO) |
188 1.1 dyoung PG_V | PG_k;
189 1.1 dyoung if (flags & PMAP_NOCACHE)
190 1.1 dyoung npte |= PG_N;
191 1.1 dyoung
192 1.1 dyoung if ((cpu_feature[2] & CPUID_NOX) && !(prot & VM_PROT_EXECUTE))
193 1.1 dyoung npte |= PG_NX;
194 1.1 dyoung
195 1.1 dyoung opte = pmap_pte_testset (pte, npte); /* zap! */
196 1.1 dyoung
197 1.1 dyoung if (pmap_valid_entry(opte)) {
198 1.1 dyoung #if defined(MULTIPROCESSOR)
199 1.1 dyoung kpreempt_disable();
200 1.1 dyoung pmap_tlb_shootdown(pmap_kernel(), va, 0, opte);
201 1.1 dyoung kpreempt_enable();
202 1.1 dyoung #else
203 1.1 dyoung /* Don't bother deferring in the single CPU case. */
204 1.1 dyoung pmap_update_pg(va);
205 1.1 dyoung #endif
206 1.1 dyoung }
207 1.1 dyoung }
208 1.1 dyoung
209 1.1 dyoung /*
210 1.1 dyoung * pmap_extract_ma: extract a MA for the given VA
211 1.1 dyoung */
212 1.1 dyoung
213 1.1 dyoung bool
214 1.1 dyoung pmap_extract_ma(struct pmap *pmap, vaddr_t va, paddr_t *pap)
215 1.1 dyoung {
216 1.1 dyoung pt_entry_t *ptes, pte;
217 1.1 dyoung pd_entry_t pde;
218 1.1 dyoung pd_entry_t * const *pdes;
219 1.1 dyoung struct pmap *pmap2;
220 1.1 dyoung
221 1.1 dyoung kpreempt_disable();
222 1.1 dyoung pmap_map_ptes(pmap, &pmap2, &ptes, &pdes);
223 1.1 dyoung if (!pmap_pdes_valid(va, pdes, &pde)) {
224 1.1 dyoung pmap_unmap_ptes(pmap, pmap2);
225 1.1 dyoung kpreempt_enable();
226 1.1 dyoung return false;
227 1.1 dyoung }
228 1.1 dyoung
229 1.1 dyoung pte = ptes[pl1_i(va)];
230 1.1 dyoung pmap_unmap_ptes(pmap, pmap2);
231 1.1 dyoung kpreempt_enable();
232 1.1 dyoung
233 1.1 dyoung if (__predict_true((pte & PG_V) != 0)) {
234 1.1 dyoung if (pap != NULL)
235 1.1 dyoung *pap = (pte & PG_FRAME) | (va & (NBPD_L1 - 1));
236 1.1 dyoung return true;
237 1.1 dyoung }
238 1.1 dyoung
239 1.1 dyoung return false;
240 1.1 dyoung }
241