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