1 /* From: $NetBSD: pmap.c,v 1.148 2004/04/03 04:35:48 bsh Exp $ */
3 * Copyright 2004 Olivier Houchard.
4 * Copyright 2003 Wasabi Systems, Inc.
7 * Written by Steve C. Woodford for Wasabi Systems, Inc.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed for the NetBSD Project by
20 * Wasabi Systems, Inc.
21 * 4. The name of Wasabi Systems, Inc. may not be used to endorse
22 * or promote products derived from this software without specific prior
25 * THIS SOFTWARE IS PROVIDED BY WASABI SYSTEMS, INC. ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
27 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL WASABI SYSTEMS, INC
29 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
30 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
31 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
32 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
33 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
34 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
35 * POSSIBILITY OF SUCH DAMAGE.
39 * Copyright (c) 2002-2003 Wasabi Systems, Inc.
40 * Copyright (c) 2001 Richard Earnshaw
41 * Copyright (c) 2001-2002 Christopher Gilbert
42 * All rights reserved.
44 * 1. Redistributions of source code must retain the above copyright
45 * notice, this list of conditions and the following disclaimer.
46 * 2. Redistributions in binary form must reproduce the above copyright
47 * notice, this list of conditions and the following disclaimer in the
48 * documentation and/or other materials provided with the distribution.
49 * 3. The name of the company nor the name of the author may be used to
50 * endorse or promote products derived from this software without specific
51 * prior written permission.
53 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
54 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
55 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
56 * IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
57 * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
58 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
59 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
60 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
61 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
62 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
66 * Copyright (c) 1999 The NetBSD Foundation, Inc.
67 * All rights reserved.
69 * This code is derived from software contributed to The NetBSD Foundation
70 * by Charles M. Hannum.
72 * Redistribution and use in source and binary forms, with or without
73 * modification, are permitted provided that the following conditions
75 * 1. Redistributions of source code must retain the above copyright
76 * notice, this list of conditions and the following disclaimer.
77 * 2. Redistributions in binary form must reproduce the above copyright
78 * notice, this list of conditions and the following disclaimer in the
79 * documentation and/or other materials provided with the distribution.
80 * 3. All advertising materials mentioning features or use of this software
81 * must display the following acknowledgement:
82 * This product includes software developed by the NetBSD
83 * Foundation, Inc. and its contributors.
84 * 4. Neither the name of The NetBSD Foundation nor the names of its
85 * contributors may be used to endorse or promote products derived
86 * from this software without specific prior written permission.
88 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
89 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
90 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
91 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
92 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
93 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
94 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
95 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
96 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
97 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
98 * POSSIBILITY OF SUCH DAMAGE.
102 * Copyright (c) 1994-1998 Mark Brinicombe.
103 * Copyright (c) 1994 Brini.
104 * All rights reserved.
106 * This code is derived from software written for Brini by Mark Brinicombe
108 * Redistribution and use in source and binary forms, with or without
109 * modification, are permitted provided that the following conditions
111 * 1. Redistributions of source code must retain the above copyright
112 * notice, this list of conditions and the following disclaimer.
113 * 2. Redistributions in binary form must reproduce the above copyright
114 * notice, this list of conditions and the following disclaimer in the
115 * documentation and/or other materials provided with the distribution.
116 * 3. All advertising materials mentioning features or use of this software
117 * must display the following acknowledgement:
118 * This product includes software developed by Mark Brinicombe.
119 * 4. The name of the author may not be used to endorse or promote products
120 * derived from this software without specific prior written permission.
122 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
123 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
124 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
125 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
126 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
127 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
128 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
129 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
130 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
132 * RiscBSD kernel project
136 * Machine dependant vm stuff
142 * Special compilation symbols
143 * PMAP_DEBUG - Build in pmap_debug_level code
145 /* Include header files */
149 #include <sys/cdefs.h>
150 __FBSDID("$FreeBSD$");
151 #include <sys/param.h>
152 #include <sys/systm.h>
153 #include <sys/kernel.h>
154 #include <sys/proc.h>
155 #include <sys/malloc.h>
156 #include <sys/msgbuf.h>
157 #include <sys/vmmeter.h>
158 #include <sys/mman.h>
161 #include <sys/sched.h>
166 #include <vm/vm_kern.h>
167 #include <vm/vm_object.h>
168 #include <vm/vm_map.h>
169 #include <vm/vm_page.h>
170 #include <vm/vm_pageout.h>
171 #include <vm/vm_extern.h>
172 #include <sys/lock.h>
173 #include <sys/mutex.h>
174 #include <machine/md_var.h>
175 #include <machine/vmparam.h>
176 #include <machine/cpu.h>
177 #include <machine/cpufunc.h>
178 #include <machine/pcb.h>
181 #define PDEBUG(_lev_,_stat_) \
182 if (pmap_debug_level >= (_lev_)) \
184 #define dprintf printf
186 int pmap_debug_level = 0;
188 #else /* PMAP_DEBUG */
189 #define PDEBUG(_lev_,_stat_) /* Nothing */
190 #define dprintf(x, arg...)
191 #define PMAP_INLINE __inline
192 #endif /* PMAP_DEBUG */
194 extern struct pv_addr systempage;
196 * Internal function prototypes
198 static void pmap_free_pv_entry (pv_entry_t);
199 static pv_entry_t pmap_get_pv_entry(void);
201 static void pmap_enter_locked(pmap_t, vm_offset_t, vm_page_t,
202 vm_prot_t, boolean_t);
203 static void pmap_vac_me_harder(struct vm_page *, pmap_t,
205 static void pmap_vac_me_kpmap(struct vm_page *, pmap_t,
207 static void pmap_vac_me_user(struct vm_page *, pmap_t, vm_offset_t);
208 static void pmap_alloc_l1(pmap_t);
209 static void pmap_free_l1(pmap_t);
210 static void pmap_use_l1(pmap_t);
212 static int pmap_clearbit(struct vm_page *, u_int);
214 static struct l2_bucket *pmap_get_l2_bucket(pmap_t, vm_offset_t);
215 static struct l2_bucket *pmap_alloc_l2_bucket(pmap_t, vm_offset_t);
216 static void pmap_free_l2_bucket(pmap_t, struct l2_bucket *, u_int);
217 static vm_offset_t kernel_pt_lookup(vm_paddr_t);
219 static MALLOC_DEFINE(M_VMPMAP, "pmap", "PMAP L1");
221 vm_offset_t avail_end; /* PA of last available physical page */
222 vm_offset_t virtual_avail; /* VA of first avail page (after kernel bss) */
223 vm_offset_t virtual_end; /* VA of last avail page (end of kernel AS) */
224 vm_offset_t pmap_curmaxkvaddr;
225 vm_paddr_t kernel_l1pa;
228 vm_offset_t kernel_vm_end = 0;
230 struct pmap kernel_pmap_store;
233 static pt_entry_t *csrc_pte, *cdst_pte;
234 static vm_offset_t csrcp, cdstp;
235 static struct mtx cmtx;
237 static void pmap_init_l1(struct l1_ttable *, pd_entry_t *);
239 * These routines are called when the CPU type is identified to set up
240 * the PTE prototypes, cache modes, etc.
242 * The variables are always here, just in case LKMs need to reference
243 * them (though, they shouldn't).
246 pt_entry_t pte_l1_s_cache_mode;
247 pt_entry_t pte_l1_s_cache_mode_pt;
248 pt_entry_t pte_l1_s_cache_mask;
250 pt_entry_t pte_l2_l_cache_mode;
251 pt_entry_t pte_l2_l_cache_mode_pt;
252 pt_entry_t pte_l2_l_cache_mask;
254 pt_entry_t pte_l2_s_cache_mode;
255 pt_entry_t pte_l2_s_cache_mode_pt;
256 pt_entry_t pte_l2_s_cache_mask;
258 pt_entry_t pte_l2_s_prot_u;
259 pt_entry_t pte_l2_s_prot_w;
260 pt_entry_t pte_l2_s_prot_mask;
262 pt_entry_t pte_l1_s_proto;
263 pt_entry_t pte_l1_c_proto;
264 pt_entry_t pte_l2_s_proto;
266 void (*pmap_copy_page_func)(vm_paddr_t, vm_paddr_t);
267 void (*pmap_zero_page_func)(vm_paddr_t, int, int);
269 * Which pmap is currently 'live' in the cache
271 * XXXSCW: Fix for SMP ...
273 union pmap_cache_state *pmap_cache_state;
275 /* static pt_entry_t *msgbufmap;*/
276 struct msgbuf *msgbufp = 0;
278 extern void bcopy_page(vm_offset_t, vm_offset_t);
279 extern void bzero_page(vm_offset_t);
284 * Metadata for L1 translation tables.
287 /* Entry on the L1 Table list */
288 SLIST_ENTRY(l1_ttable) l1_link;
290 /* Entry on the L1 Least Recently Used list */
291 TAILQ_ENTRY(l1_ttable) l1_lru;
293 /* Track how many domains are allocated from this L1 */
294 volatile u_int l1_domain_use_count;
297 * A free-list of domain numbers for this L1.
298 * We avoid using ffs() and a bitmap to track domains since ffs()
301 u_int8_t l1_domain_first;
302 u_int8_t l1_domain_free[PMAP_DOMAINS];
304 /* Physical address of this L1 page table */
305 vm_paddr_t l1_physaddr;
307 /* KVA of this L1 page table */
312 * Convert a virtual address into its L1 table index. That is, the
313 * index used to locate the L2 descriptor table pointer in an L1 table.
314 * This is basically used to index l1->l1_kva[].
316 * Each L2 descriptor table represents 1MB of VA space.
318 #define L1_IDX(va) (((vm_offset_t)(va)) >> L1_S_SHIFT)
321 * L1 Page Tables are tracked using a Least Recently Used list.
322 * - New L1s are allocated from the HEAD.
323 * - Freed L1s are added to the TAIl.
324 * - Recently accessed L1s (where an 'access' is some change to one of
325 * the userland pmaps which owns this L1) are moved to the TAIL.
327 static TAILQ_HEAD(, l1_ttable) l1_lru_list;
329 * A list of all L1 tables
331 static SLIST_HEAD(, l1_ttable) l1_list;
332 static struct mtx l1_lru_lock;
335 * The l2_dtable tracks L2_BUCKET_SIZE worth of L1 slots.
337 * This is normally 16MB worth L2 page descriptors for any given pmap.
338 * Reference counts are maintained for L2 descriptors so they can be
342 /* The number of L2 page descriptors allocated to this l2_dtable */
345 /* List of L2 page descriptors */
347 pt_entry_t *l2b_kva; /* KVA of L2 Descriptor Table */
348 vm_paddr_t l2b_phys; /* Physical address of same */
349 u_short l2b_l1idx; /* This L2 table's L1 index */
350 u_short l2b_occupancy; /* How many active descriptors */
351 } l2_bucket[L2_BUCKET_SIZE];
354 /* pmap_kenter_internal flags */
355 #define KENTER_CACHE 0x1
356 #define KENTER_USER 0x2
359 * Given an L1 table index, calculate the corresponding l2_dtable index
360 * and bucket index within the l2_dtable.
362 #define L2_IDX(l1idx) (((l1idx) >> L2_BUCKET_LOG2) & \
364 #define L2_BUCKET(l1idx) ((l1idx) & (L2_BUCKET_SIZE - 1))
367 * Given a virtual address, this macro returns the
368 * virtual address required to drop into the next L2 bucket.
370 #define L2_NEXT_BUCKET(va) (((va) & L1_S_FRAME) + L1_S_SIZE)
375 #define pmap_alloc_l2_dtable() \
376 (void*)uma_zalloc(l2table_zone, M_NOWAIT)
377 #define pmap_free_l2_dtable(l2) \
378 uma_zfree(l2table_zone, l2)
381 * We try to map the page tables write-through, if possible. However, not
382 * all CPUs have a write-through cache mode, so on those we have to sync
383 * the cache when we frob page tables.
385 * We try to evaluate this at compile time, if possible. However, it's
386 * not always possible to do that, hence this run-time var.
388 int pmap_needs_pte_sync;
391 * Macro to determine if a mapping might be resident in the
392 * instruction cache and/or TLB
394 #define PV_BEEN_EXECD(f) (((f) & (PVF_REF | PVF_EXEC)) == (PVF_REF | PVF_EXEC))
397 * Macro to determine if a mapping might be resident in the
398 * data cache and/or TLB
400 #define PV_BEEN_REFD(f) (((f) & PVF_REF) != 0)
402 #ifndef PMAP_SHPGPERPROC
403 #define PMAP_SHPGPERPROC 200
406 #define pmap_is_current(pm) ((pm) == pmap_kernel() || \
407 curproc->p_vmspace->vm_map.pmap == (pm))
408 static uma_zone_t pvzone;
410 static uma_zone_t l2table_zone;
411 static vm_offset_t pmap_kernel_l2dtable_kva;
412 static vm_offset_t pmap_kernel_l2ptp_kva;
413 static vm_paddr_t pmap_kernel_l2ptp_phys;
414 static struct vm_object pvzone_obj;
415 static int pv_entry_count=0, pv_entry_max=0, pv_entry_high_water=0;
416 int pmap_pagedaemon_waken = 0;
419 * This list exists for the benefit of pmap_map_chunk(). It keeps track
420 * of the kernel L2 tables during bootstrap, so that pmap_map_chunk() can
421 * find them as necessary.
423 * Note that the data on this list MUST remain valid after initarm() returns,
424 * as pmap_bootstrap() uses it to contruct L2 table metadata.
426 SLIST_HEAD(, pv_addr) kernel_pt_list = SLIST_HEAD_INITIALIZER(kernel_pt_list);
429 pmap_init_l1(struct l1_ttable *l1, pd_entry_t *l1pt)
434 l1->l1_domain_use_count = 0;
435 l1->l1_domain_first = 0;
437 for (i = 0; i < PMAP_DOMAINS; i++)
438 l1->l1_domain_free[i] = i + 1;
441 * Copy the kernel's L1 entries to each new L1.
443 if (l1pt != pmap_kernel()->pm_l1->l1_kva)
444 memcpy(l1pt, pmap_kernel()->pm_l1->l1_kva, L1_TABLE_SIZE);
446 if ((l1->l1_physaddr = pmap_extract(pmap_kernel(), (vm_offset_t)l1pt)) == 0)
447 panic("pmap_init_l1: can't get PA of L1 at %p", l1pt);
448 SLIST_INSERT_HEAD(&l1_list, l1, l1_link);
449 TAILQ_INSERT_TAIL(&l1_lru_list, l1, l1_lru);
453 kernel_pt_lookup(vm_paddr_t pa)
457 SLIST_FOREACH(pv, &kernel_pt_list, pv_list) {
464 #if (ARM_MMU_GENERIC + ARM_MMU_SA1) != 0
466 pmap_pte_init_generic(void)
469 pte_l1_s_cache_mode = L1_S_B|L1_S_C;
470 pte_l1_s_cache_mask = L1_S_CACHE_MASK_generic;
472 pte_l2_l_cache_mode = L2_B|L2_C;
473 pte_l2_l_cache_mask = L2_L_CACHE_MASK_generic;
475 pte_l2_s_cache_mode = L2_B|L2_C;
476 pte_l2_s_cache_mask = L2_S_CACHE_MASK_generic;
479 * If we have a write-through cache, set B and C. If
480 * we have a write-back cache, then we assume setting
481 * only C will make those pages write-through.
483 if (cpufuncs.cf_dcache_wb_range == (void *) cpufunc_nullop) {
484 pte_l1_s_cache_mode_pt = L1_S_B|L1_S_C;
485 pte_l2_l_cache_mode_pt = L2_B|L2_C;
486 pte_l2_s_cache_mode_pt = L2_B|L2_C;
488 pte_l1_s_cache_mode_pt = L1_S_C;
489 pte_l2_l_cache_mode_pt = L2_C;
490 pte_l2_s_cache_mode_pt = L2_C;
493 pte_l2_s_prot_u = L2_S_PROT_U_generic;
494 pte_l2_s_prot_w = L2_S_PROT_W_generic;
495 pte_l2_s_prot_mask = L2_S_PROT_MASK_generic;
497 pte_l1_s_proto = L1_S_PROTO_generic;
498 pte_l1_c_proto = L1_C_PROTO_generic;
499 pte_l2_s_proto = L2_S_PROTO_generic;
501 pmap_copy_page_func = pmap_copy_page_generic;
502 pmap_zero_page_func = pmap_zero_page_generic;
505 #if defined(CPU_ARM8)
507 pmap_pte_init_arm8(void)
511 * ARM8 is compatible with generic, but we need to use
512 * the page tables uncached.
514 pmap_pte_init_generic();
516 pte_l1_s_cache_mode_pt = 0;
517 pte_l2_l_cache_mode_pt = 0;
518 pte_l2_s_cache_mode_pt = 0;
520 #endif /* CPU_ARM8 */
522 #if defined(CPU_ARM9) && defined(ARM9_CACHE_WRITE_THROUGH)
524 pmap_pte_init_arm9(void)
528 * ARM9 is compatible with generic, but we want to use
529 * write-through caching for now.
531 pmap_pte_init_generic();
533 pte_l1_s_cache_mode = L1_S_C;
534 pte_l2_l_cache_mode = L2_C;
535 pte_l2_s_cache_mode = L2_C;
537 pte_l1_s_cache_mode_pt = L1_S_C;
538 pte_l2_l_cache_mode_pt = L2_C;
539 pte_l2_s_cache_mode_pt = L2_C;
541 #endif /* CPU_ARM9 */
542 #endif /* (ARM_MMU_GENERIC + ARM_MMU_SA1) != 0 */
544 #if defined(CPU_ARM10)
546 pmap_pte_init_arm10(void)
550 * ARM10 is compatible with generic, but we want to use
551 * write-through caching for now.
553 pmap_pte_init_generic();
555 pte_l1_s_cache_mode = L1_S_B | L1_S_C;
556 pte_l2_l_cache_mode = L2_B | L2_C;
557 pte_l2_s_cache_mode = L2_B | L2_C;
559 pte_l1_s_cache_mode_pt = L1_S_C;
560 pte_l2_l_cache_mode_pt = L2_C;
561 pte_l2_s_cache_mode_pt = L2_C;
564 #endif /* CPU_ARM10 */
568 pmap_pte_init_sa1(void)
572 * The StrongARM SA-1 cache does not have a write-through
573 * mode. So, do the generic initialization, then reset
574 * the page table cache mode to B=1,C=1, and note that
575 * the PTEs need to be sync'd.
577 pmap_pte_init_generic();
579 pte_l1_s_cache_mode_pt = L1_S_B|L1_S_C;
580 pte_l2_l_cache_mode_pt = L2_B|L2_C;
581 pte_l2_s_cache_mode_pt = L2_B|L2_C;
583 pmap_needs_pte_sync = 1;
585 #endif /* ARM_MMU_SA1 == 1*/
587 #if ARM_MMU_XSCALE == 1
589 static u_int xscale_use_minidata;
593 pmap_pte_init_xscale(void)
596 int write_through = 0;
598 pte_l1_s_cache_mode = L1_S_B|L1_S_C|L1_S_XSCALE_P;
599 pte_l1_s_cache_mask = L1_S_CACHE_MASK_xscale;
601 pte_l2_l_cache_mode = L2_B|L2_C;
602 pte_l2_l_cache_mask = L2_L_CACHE_MASK_xscale;
604 pte_l2_s_cache_mode = L2_B|L2_C;
605 pte_l2_s_cache_mask = L2_S_CACHE_MASK_xscale;
607 pte_l1_s_cache_mode_pt = L1_S_C;
608 pte_l2_l_cache_mode_pt = L2_C;
609 pte_l2_s_cache_mode_pt = L2_C;
610 #ifdef XSCALE_CACHE_READ_WRITE_ALLOCATE
612 * The XScale core has an enhanced mode where writes that
613 * miss the cache cause a cache line to be allocated. This
614 * is significantly faster than the traditional, write-through
615 * behavior of this case.
617 pte_l1_s_cache_mode |= L1_S_XSCALE_TEX(TEX_XSCALE_X);
618 pte_l2_l_cache_mode |= L2_XSCALE_L_TEX(TEX_XSCALE_X);
619 pte_l2_s_cache_mode |= L2_XSCALE_T_TEX(TEX_XSCALE_X);
620 #endif /* XSCALE_CACHE_READ_WRITE_ALLOCATE */
621 #ifdef XSCALE_CACHE_WRITE_THROUGH
623 * Some versions of the XScale core have various bugs in
624 * their cache units, the work-around for which is to run
625 * the cache in write-through mode. Unfortunately, this
626 * has a major (negative) impact on performance. So, we
627 * go ahead and run fast-and-loose, in the hopes that we
628 * don't line up the planets in a way that will trip the
631 * However, we give you the option to be slow-but-correct.
634 #elif defined(XSCALE_CACHE_WRITE_BACK)
635 /* force write back cache mode */
637 #elif defined(CPU_XSCALE_PXA2X0)
639 * Intel PXA2[15]0 processors are known to have a bug in
640 * write-back cache on revision 4 and earlier (stepping
641 * A[01] and B[012]). Fixed for C0 and later.
647 type = id & ~(CPU_ID_XSCALE_COREREV_MASK|CPU_ID_REVISION_MASK);
649 if (type == CPU_ID_PXA250 || type == CPU_ID_PXA210) {
650 if ((id & CPU_ID_REVISION_MASK) < 5) {
651 /* write through for stepping A0-1 and B0-2 */
656 #endif /* XSCALE_CACHE_WRITE_THROUGH */
659 pte_l1_s_cache_mode = L1_S_C;
660 pte_l2_l_cache_mode = L2_C;
661 pte_l2_s_cache_mode = L2_C;
665 xscale_use_minidata = 1;
668 pte_l2_s_prot_u = L2_S_PROT_U_xscale;
669 pte_l2_s_prot_w = L2_S_PROT_W_xscale;
670 pte_l2_s_prot_mask = L2_S_PROT_MASK_xscale;
672 pte_l1_s_proto = L1_S_PROTO_xscale;
673 pte_l1_c_proto = L1_C_PROTO_xscale;
674 pte_l2_s_proto = L2_S_PROTO_xscale;
676 pmap_copy_page_func = pmap_copy_page_xscale;
677 pmap_zero_page_func = pmap_zero_page_xscale;
680 * Disable ECC protection of page table access, for now.
682 __asm __volatile("mrc p15, 0, %0, c1, c0, 1" : "=r" (auxctl));
683 auxctl &= ~XSCALE_AUXCTL_P;
684 __asm __volatile("mcr p15, 0, %0, c1, c0, 1" : : "r" (auxctl));
688 * xscale_setup_minidata:
690 * Set up the mini-data cache clean area. We require the
691 * caller to allocate the right amount of physically and
692 * virtually contiguous space.
694 extern vm_offset_t xscale_minidata_clean_addr;
695 extern vm_size_t xscale_minidata_clean_size; /* already initialized */
697 xscale_setup_minidata(vm_offset_t l1pt, vm_offset_t va, vm_paddr_t pa)
699 pd_entry_t *pde = (pd_entry_t *) l1pt;
704 xscale_minidata_clean_addr = va;
706 /* Round it to page size. */
707 size = (xscale_minidata_clean_size + L2_S_OFFSET) & L2_S_FRAME;
710 va += L2_S_SIZE, pa += L2_S_SIZE, size -= L2_S_SIZE) {
711 pte = (pt_entry_t *) kernel_pt_lookup(
712 pde[L1_IDX(va)] & L1_C_ADDR_MASK);
714 panic("xscale_setup_minidata: can't find L2 table for "
715 "VA 0x%08x", (u_int32_t) va);
716 pte[l2pte_index(va)] =
717 L2_S_PROTO | pa | L2_S_PROT(PTE_KERNEL, VM_PROT_READ) |
718 L2_C | L2_XSCALE_T_TEX(TEX_XSCALE_X);
722 * Configure the mini-data cache for write-back with
723 * read/write-allocate.
725 * NOTE: In order to reconfigure the mini-data cache, we must
726 * make sure it contains no valid data! In order to do that,
727 * we must issue a global data cache invalidate command!
729 * WE ASSUME WE ARE RUNNING UN-CACHED WHEN THIS ROUTINE IS CALLED!
730 * THIS IS VERY IMPORTANT!
733 /* Invalidate data and mini-data. */
734 __asm __volatile("mcr p15, 0, %0, c7, c6, 0" : : "r" (0));
735 __asm __volatile("mrc p15, 0, %0, c1, c0, 1" : "=r" (auxctl));
736 auxctl = (auxctl & ~XSCALE_AUXCTL_MD_MASK) | XSCALE_AUXCTL_MD_WB_RWA;
737 __asm __volatile("mcr p15, 0, %0, c1, c0, 1" : : "r" (auxctl));
742 * Allocate an L1 translation table for the specified pmap.
743 * This is called at pmap creation time.
746 pmap_alloc_l1(pmap_t pm)
748 struct l1_ttable *l1;
752 * Remove the L1 at the head of the LRU list
754 mtx_lock(&l1_lru_lock);
755 l1 = TAILQ_FIRST(&l1_lru_list);
756 TAILQ_REMOVE(&l1_lru_list, l1, l1_lru);
759 * Pick the first available domain number, and update
760 * the link to the next number.
762 domain = l1->l1_domain_first;
763 l1->l1_domain_first = l1->l1_domain_free[domain];
766 * If there are still free domain numbers in this L1,
767 * put it back on the TAIL of the LRU list.
769 if (++l1->l1_domain_use_count < PMAP_DOMAINS)
770 TAILQ_INSERT_TAIL(&l1_lru_list, l1, l1_lru);
772 mtx_unlock(&l1_lru_lock);
775 * Fix up the relevant bits in the pmap structure
778 pm->pm_domain = domain;
782 * Free an L1 translation table.
783 * This is called at pmap destruction time.
786 pmap_free_l1(pmap_t pm)
788 struct l1_ttable *l1 = pm->pm_l1;
790 mtx_lock(&l1_lru_lock);
793 * If this L1 is currently on the LRU list, remove it.
795 if (l1->l1_domain_use_count < PMAP_DOMAINS)
796 TAILQ_REMOVE(&l1_lru_list, l1, l1_lru);
799 * Free up the domain number which was allocated to the pmap
801 l1->l1_domain_free[pm->pm_domain] = l1->l1_domain_first;
802 l1->l1_domain_first = pm->pm_domain;
803 l1->l1_domain_use_count--;
806 * The L1 now must have at least 1 free domain, so add
807 * it back to the LRU list. If the use count is zero,
808 * put it at the head of the list, otherwise it goes
811 if (l1->l1_domain_use_count == 0) {
812 TAILQ_INSERT_HEAD(&l1_lru_list, l1, l1_lru);
814 TAILQ_INSERT_TAIL(&l1_lru_list, l1, l1_lru);
816 mtx_unlock(&l1_lru_lock);
819 static PMAP_INLINE void
820 pmap_use_l1(pmap_t pm)
822 struct l1_ttable *l1;
825 * Do nothing if we're in interrupt context.
826 * Access to an L1 by the kernel pmap must not affect
829 if (pm == pmap_kernel())
835 * If the L1 is not currently on the LRU list, just return
837 if (l1->l1_domain_use_count == PMAP_DOMAINS)
840 mtx_lock(&l1_lru_lock);
843 * Check the use count again, now that we've acquired the lock
845 if (l1->l1_domain_use_count == PMAP_DOMAINS) {
846 mtx_unlock(&l1_lru_lock);
851 * Move the L1 to the back of the LRU list
853 TAILQ_REMOVE(&l1_lru_list, l1, l1_lru);
854 TAILQ_INSERT_TAIL(&l1_lru_list, l1, l1_lru);
856 mtx_unlock(&l1_lru_lock);
861 * Returns a pointer to the L2 bucket associated with the specified pmap
862 * and VA, or NULL if no L2 bucket exists for the address.
864 static PMAP_INLINE struct l2_bucket *
865 pmap_get_l2_bucket(pmap_t pm, vm_offset_t va)
867 struct l2_dtable *l2;
868 struct l2_bucket *l2b;
873 if ((l2 = pm->pm_l2[L2_IDX(l1idx)]) == NULL ||
874 (l2b = &l2->l2_bucket[L2_BUCKET(l1idx)])->l2b_kva == NULL)
881 * Returns a pointer to the L2 bucket associated with the specified pmap
884 * If no L2 bucket exists, perform the necessary allocations to put an L2
885 * bucket/page table in place.
887 * Note that if a new L2 bucket/page was allocated, the caller *must*
888 * increment the bucket occupancy counter appropriately *before*
889 * releasing the pmap's lock to ensure no other thread or cpu deallocates
890 * the bucket/page in the meantime.
892 static struct l2_bucket *
893 pmap_alloc_l2_bucket(pmap_t pm, vm_offset_t va)
895 struct l2_dtable *l2;
896 struct l2_bucket *l2b;
901 PMAP_ASSERT_LOCKED(pm);
902 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
903 if ((l2 = pm->pm_l2[L2_IDX(l1idx)]) == NULL) {
905 * No mapping at this address, as there is
906 * no entry in the L1 table.
907 * Need to allocate a new l2_dtable.
911 vm_page_unlock_queues();
912 if ((l2 = pmap_alloc_l2_dtable()) == NULL) {
913 vm_page_lock_queues();
917 vm_page_lock_queues();
919 if (pm->pm_l2[L2_IDX(l1idx)] != NULL) {
921 vm_page_unlock_queues();
922 uma_zfree(l2table_zone, l2);
923 vm_page_lock_queues();
925 l2 = pm->pm_l2[L2_IDX(l1idx)];
929 * Someone already allocated the l2_dtable while
930 * we were doing the same.
933 bzero(l2, sizeof(*l2));
935 * Link it into the parent pmap
937 pm->pm_l2[L2_IDX(l1idx)] = l2;
941 l2b = &l2->l2_bucket[L2_BUCKET(l1idx)];
944 * Fetch pointer to the L2 page table associated with the address.
946 if (l2b->l2b_kva == NULL) {
950 * No L2 page table has been allocated. Chances are, this
951 * is because we just allocated the l2_dtable, above.
955 vm_page_unlock_queues();
956 ptep = (void*)uma_zalloc(l2zone, M_NOWAIT);
957 vm_page_lock_queues();
959 if (l2b->l2b_kva != 0) {
960 /* We lost the race. */
962 vm_page_unlock_queues();
963 uma_zfree(l2zone, ptep);
964 vm_page_lock_queues();
966 if (l2b->l2b_kva == 0)
970 l2b->l2b_phys = vtophys(ptep);
973 * Oops, no more L2 page tables available at this
974 * time. We may need to deallocate the l2_dtable
975 * if we allocated a new one above.
977 if (l2->l2_occupancy == 0) {
978 pm->pm_l2[L2_IDX(l1idx)] = NULL;
979 pmap_free_l2_dtable(l2);
986 l2b->l2b_l1idx = l1idx;
992 static PMAP_INLINE void
993 #ifndef PMAP_INCLUDE_PTE_SYNC
994 pmap_free_l2_ptp(pt_entry_t *l2)
996 pmap_free_l2_ptp(boolean_t need_sync, pt_entry_t *l2)
999 #ifdef PMAP_INCLUDE_PTE_SYNC
1001 * Note: With a write-back cache, we may need to sync this
1002 * L2 table before re-using it.
1003 * This is because it may have belonged to a non-current
1004 * pmap, in which case the cache syncs would have been
1005 * skipped when the pages were being unmapped. If the
1006 * L2 table were then to be immediately re-allocated to
1007 * the *current* pmap, it may well contain stale mappings
1008 * which have not yet been cleared by a cache write-back
1009 * and so would still be visible to the mmu.
1012 PTE_SYNC_RANGE(l2, L2_TABLE_SIZE_REAL / sizeof(pt_entry_t));
1014 uma_zfree(l2zone, l2);
1017 * One or more mappings in the specified L2 descriptor table have just been
1020 * Garbage collect the metadata and descriptor table itself if necessary.
1022 * The pmap lock must be acquired when this is called (not necessary
1023 * for the kernel pmap).
1026 pmap_free_l2_bucket(pmap_t pm, struct l2_bucket *l2b, u_int count)
1028 struct l2_dtable *l2;
1029 pd_entry_t *pl1pd, l1pd;
1035 * Update the bucket's reference count according to how many
1036 * PTEs the caller has just invalidated.
1038 l2b->l2b_occupancy -= count;
1043 * Level 2 page tables allocated to the kernel pmap are never freed
1044 * as that would require checking all Level 1 page tables and
1045 * removing any references to the Level 2 page table. See also the
1046 * comment elsewhere about never freeing bootstrap L2 descriptors.
1048 * We make do with just invalidating the mapping in the L2 table.
1050 * This isn't really a big deal in practice and, in fact, leads
1051 * to a performance win over time as we don't need to continually
1054 if (l2b->l2b_occupancy > 0 || pm == pmap_kernel())
1058 * There are no more valid mappings in this level 2 page table.
1059 * Go ahead and NULL-out the pointer in the bucket, then
1060 * free the page table.
1062 l1idx = l2b->l2b_l1idx;
1063 ptep = l2b->l2b_kva;
1064 l2b->l2b_kva = NULL;
1066 pl1pd = &pm->pm_l1->l1_kva[l1idx];
1069 * If the L1 slot matches the pmap's domain
1070 * number, then invalidate it.
1072 l1pd = *pl1pd & (L1_TYPE_MASK | L1_C_DOM_MASK);
1073 if (l1pd == (L1_C_DOM(pm->pm_domain) | L1_TYPE_C)) {
1079 * Release the L2 descriptor table back to the pool cache.
1081 #ifndef PMAP_INCLUDE_PTE_SYNC
1082 pmap_free_l2_ptp(ptep);
1084 pmap_free_l2_ptp(!pmap_is_current(pm), ptep);
1088 * Update the reference count in the associated l2_dtable
1090 l2 = pm->pm_l2[L2_IDX(l1idx)];
1091 if (--l2->l2_occupancy > 0)
1095 * There are no more valid mappings in any of the Level 1
1096 * slots managed by this l2_dtable. Go ahead and NULL-out
1097 * the pointer in the parent pmap and free the l2_dtable.
1099 pm->pm_l2[L2_IDX(l1idx)] = NULL;
1100 pmap_free_l2_dtable(l2);
1104 * Pool cache constructors for L2 descriptor tables, metadata and pmap
1108 pmap_l2ptp_ctor(void *mem, int size, void *arg, int flags)
1110 #ifndef PMAP_INCLUDE_PTE_SYNC
1111 struct l2_bucket *l2b;
1112 pt_entry_t *ptep, pte;
1113 #ifdef ARM_USE_SMALL_ALLOC
1116 vm_offset_t va = (vm_offset_t)mem & ~PAGE_MASK;
1119 * The mappings for these page tables were initially made using
1120 * pmap_kenter() by the pool subsystem. Therefore, the cache-
1121 * mode will not be right for page table mappings. To avoid
1122 * polluting the pmap_kenter() code with a special case for
1123 * page tables, we simply fix up the cache-mode here if it's not
1126 #ifdef ARM_USE_SMALL_ALLOC
1127 pde = &kernel_pmap->pm_l1->l1_kva[L1_IDX(va)];
1128 if (!l1pte_section_p(*pde)) {
1130 l2b = pmap_get_l2_bucket(pmap_kernel(), va);
1131 ptep = &l2b->l2b_kva[l2pte_index(va)];
1134 if ((pte & L2_S_CACHE_MASK) != pte_l2_s_cache_mode_pt) {
1136 * Page tables must have the cache-mode set to
1139 *ptep = (pte & ~L2_S_CACHE_MASK) | pte_l2_s_cache_mode_pt;
1141 cpu_tlb_flushD_SE(va);
1145 #ifdef ARM_USE_SMALL_ALLOC
1149 memset(mem, 0, L2_TABLE_SIZE_REAL);
1150 PTE_SYNC_RANGE(mem, L2_TABLE_SIZE_REAL / sizeof(pt_entry_t));
1155 * A bunch of routines to conditionally flush the caches/TLB depending
1156 * on whether the specified pmap actually needs to be flushed at any
1159 static PMAP_INLINE void
1160 pmap_tlb_flushID_SE(pmap_t pm, vm_offset_t va)
1163 if (pmap_is_current(pm))
1164 cpu_tlb_flushID_SE(va);
1167 static PMAP_INLINE void
1168 pmap_tlb_flushD_SE(pmap_t pm, vm_offset_t va)
1171 if (pmap_is_current(pm))
1172 cpu_tlb_flushD_SE(va);
1175 static PMAP_INLINE void
1176 pmap_tlb_flushID(pmap_t pm)
1179 if (pmap_is_current(pm))
1182 static PMAP_INLINE void
1183 pmap_tlb_flushD(pmap_t pm)
1186 if (pmap_is_current(pm))
1190 static PMAP_INLINE void
1191 pmap_idcache_wbinv_range(pmap_t pm, vm_offset_t va, vm_size_t len)
1194 if (pmap_is_current(pm))
1195 cpu_idcache_wbinv_range(va, len);
1198 static PMAP_INLINE void
1199 pmap_dcache_wb_range(pmap_t pm, vm_offset_t va, vm_size_t len,
1200 boolean_t do_inv, boolean_t rd_only)
1203 if (pmap_is_current(pm)) {
1206 cpu_dcache_inv_range(va, len);
1208 cpu_dcache_wbinv_range(va, len);
1211 cpu_dcache_wb_range(va, len);
1215 static PMAP_INLINE void
1216 pmap_idcache_wbinv_all(pmap_t pm)
1219 if (pmap_is_current(pm))
1220 cpu_idcache_wbinv_all();
1223 static PMAP_INLINE void
1224 pmap_dcache_wbinv_all(pmap_t pm)
1227 if (pmap_is_current(pm))
1228 cpu_dcache_wbinv_all();
1234 * Make sure the pte is written out to RAM.
1235 * We need to do this for one of two cases:
1236 * - We're dealing with the kernel pmap
1237 * - There is no pmap active in the cache/tlb.
1238 * - The specified pmap is 'active' in the cache/tlb.
1240 #ifdef PMAP_INCLUDE_PTE_SYNC
1241 #define PTE_SYNC_CURRENT(pm, ptep) \
1243 if (PMAP_NEEDS_PTE_SYNC && \
1244 pmap_is_current(pm)) \
1246 } while (/*CONSTCOND*/0)
1248 #define PTE_SYNC_CURRENT(pm, ptep) /* nothing */
1252 * Since we have a virtually indexed cache, we may need to inhibit caching if
1253 * there is more than one mapping and at least one of them is writable.
1254 * Since we purge the cache on every context switch, we only need to check for
1255 * other mappings within the same pmap, or kernel_pmap.
1256 * This function is also called when a page is unmapped, to possibly reenable
1257 * caching on any remaining mappings.
1259 * The code implements the following logic, where:
1261 * KW = # of kernel read/write pages
1262 * KR = # of kernel read only pages
1263 * UW = # of user read/write pages
1264 * UR = # of user read only pages
1266 * KC = kernel mapping is cacheable
1267 * UC = user mapping is cacheable
1269 * KW=0,KR=0 KW=0,KR>0 KW=1,KR=0 KW>1,KR>=0
1270 * +---------------------------------------------
1271 * UW=0,UR=0 | --- KC=1 KC=1 KC=0
1272 * UW=0,UR>0 | UC=1 KC=1,UC=1 KC=0,UC=0 KC=0,UC=0
1273 * UW=1,UR=0 | UC=1 KC=0,UC=0 KC=0,UC=0 KC=0,UC=0
1274 * UW>1,UR>=0 | UC=0 KC=0,UC=0 KC=0,UC=0 KC=0,UC=0
1277 static const int pmap_vac_flags[4][4] = {
1278 {-1, 0, 0, PVF_KNC},
1279 {0, 0, PVF_NC, PVF_NC},
1280 {0, PVF_NC, PVF_NC, PVF_NC},
1281 {PVF_UNC, PVF_NC, PVF_NC, PVF_NC}
1284 static PMAP_INLINE int
1285 pmap_get_vac_flags(const struct vm_page *pg)
1290 if (pg->md.kro_mappings || pg->md.krw_mappings > 1)
1292 if (pg->md.krw_mappings)
1296 if (pg->md.uro_mappings || pg->md.urw_mappings > 1)
1298 if (pg->md.urw_mappings)
1301 return (pmap_vac_flags[uidx][kidx]);
1304 static __inline void
1305 pmap_vac_me_harder(struct vm_page *pg, pmap_t pm, vm_offset_t va)
1309 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1310 nattr = pmap_get_vac_flags(pg);
1313 pg->md.pvh_attrs &= ~PVF_NC;
1317 if (nattr == 0 && (pg->md.pvh_attrs & PVF_NC) == 0) {
1321 if (pm == pmap_kernel())
1322 pmap_vac_me_kpmap(pg, pm, va);
1324 pmap_vac_me_user(pg, pm, va);
1326 pg->md.pvh_attrs = (pg->md.pvh_attrs & ~PVF_NC) | nattr;
1330 pmap_vac_me_kpmap(struct vm_page *pg, pmap_t pm, vm_offset_t va)
1332 u_int u_cacheable, u_entries;
1333 struct pv_entry *pv;
1334 pmap_t last_pmap = pm;
1337 * Pass one, see if there are both kernel and user pmaps for
1338 * this page. Calculate whether there are user-writable or
1339 * kernel-writable pages.
1342 TAILQ_FOREACH(pv, &pg->md.pv_list, pv_list) {
1343 if (pv->pv_pmap != pm && (pv->pv_flags & PVF_NC) == 0)
1347 u_entries = pg->md.urw_mappings + pg->md.uro_mappings;
1350 * We know we have just been updating a kernel entry, so if
1351 * all user pages are already cacheable, then there is nothing
1354 if (pg->md.k_mappings == 0 && u_cacheable == u_entries)
1359 * Scan over the list again, for each entry, if it
1360 * might not be set correctly, call pmap_vac_me_user
1361 * to recalculate the settings.
1363 TAILQ_FOREACH(pv, &pg->md.pv_list, pv_list) {
1365 * We know kernel mappings will get set
1366 * correctly in other calls. We also know
1367 * that if the pmap is the same as last_pmap
1368 * then we've just handled this entry.
1370 if (pv->pv_pmap == pm || pv->pv_pmap == last_pmap)
1374 * If there are kernel entries and this page
1375 * is writable but non-cacheable, then we can
1376 * skip this entry also.
1378 if (pg->md.k_mappings &&
1379 (pv->pv_flags & (PVF_NC | PVF_WRITE)) ==
1380 (PVF_NC | PVF_WRITE))
1384 * Similarly if there are no kernel-writable
1385 * entries and the page is already
1386 * read-only/cacheable.
1388 if (pg->md.krw_mappings == 0 &&
1389 (pv->pv_flags & (PVF_NC | PVF_WRITE)) == 0)
1393 * For some of the remaining cases, we know
1394 * that we must recalculate, but for others we
1395 * can't tell if they are correct or not, so
1396 * we recalculate anyway.
1398 pmap_vac_me_user(pg, (last_pmap = pv->pv_pmap), 0);
1401 if (pg->md.k_mappings == 0)
1405 pmap_vac_me_user(pg, pm, va);
1409 pmap_vac_me_user(struct vm_page *pg, pmap_t pm, vm_offset_t va)
1411 pmap_t kpmap = pmap_kernel();
1412 struct pv_entry *pv, *npv;
1413 struct l2_bucket *l2b;
1414 pt_entry_t *ptep, pte;
1417 u_int cacheable_entries = 0;
1418 u_int kern_cacheable = 0;
1419 u_int other_writable = 0;
1422 * Count mappings and writable mappings in this pmap.
1423 * Include kernel mappings as part of our own.
1424 * Keep a pointer to the first one.
1426 npv = TAILQ_FIRST(&pg->md.pv_list);
1427 TAILQ_FOREACH(pv, &pg->md.pv_list, pv_list) {
1428 /* Count mappings in the same pmap */
1429 if (pm == pv->pv_pmap || kpmap == pv->pv_pmap) {
1433 /* Cacheable mappings */
1434 if ((pv->pv_flags & PVF_NC) == 0) {
1435 cacheable_entries++;
1436 if (kpmap == pv->pv_pmap)
1440 /* Writable mappings */
1441 if (pv->pv_flags & PVF_WRITE)
1444 if (pv->pv_flags & PVF_WRITE)
1449 * Enable or disable caching as necessary.
1450 * Note: the first entry might be part of the kernel pmap,
1451 * so we can't assume this is indicative of the state of the
1452 * other (maybe non-kpmap) entries.
1454 if ((entries > 1 && writable) ||
1455 (entries > 0 && pm == kpmap && other_writable)) {
1456 if (cacheable_entries == 0)
1459 for (pv = npv; pv; pv = TAILQ_NEXT(pv, pv_list)) {
1460 if ((pm != pv->pv_pmap && kpmap != pv->pv_pmap) ||
1461 (pv->pv_flags & PVF_NC))
1464 pv->pv_flags |= PVF_NC;
1466 l2b = pmap_get_l2_bucket(pv->pv_pmap, pv->pv_va);
1467 ptep = &l2b->l2b_kva[l2pte_index(pv->pv_va)];
1468 pte = *ptep & ~L2_S_CACHE_MASK;
1470 if ((va != pv->pv_va || pm != pv->pv_pmap) &&
1472 if (PV_BEEN_EXECD(pv->pv_flags)) {
1473 pmap_idcache_wbinv_range(pv->pv_pmap,
1474 pv->pv_va, PAGE_SIZE);
1475 pmap_tlb_flushID_SE(pv->pv_pmap,
1478 if (PV_BEEN_REFD(pv->pv_flags)) {
1479 pmap_dcache_wb_range(pv->pv_pmap,
1480 pv->pv_va, PAGE_SIZE, TRUE,
1481 (pv->pv_flags & PVF_WRITE) == 0);
1482 pmap_tlb_flushD_SE(pv->pv_pmap,
1488 PTE_SYNC_CURRENT(pv->pv_pmap, ptep);
1492 if (entries > cacheable_entries) {
1494 * Turn cacheing back on for some pages. If it is a kernel
1495 * page, only do so if there are no other writable pages.
1497 for (pv = npv; pv; pv = TAILQ_NEXT(pv, pv_list)) {
1498 if (!(pv->pv_flags & PVF_NC) || (pm != pv->pv_pmap &&
1499 (kpmap != pv->pv_pmap || other_writable)))
1502 pv->pv_flags &= ~PVF_NC;
1504 l2b = pmap_get_l2_bucket(pv->pv_pmap, pv->pv_va);
1505 ptep = &l2b->l2b_kva[l2pte_index(pv->pv_va)];
1506 pte = (*ptep & ~L2_S_CACHE_MASK) | pte_l2_s_cache_mode;
1508 if (l2pte_valid(pte)) {
1509 if (PV_BEEN_EXECD(pv->pv_flags)) {
1510 pmap_tlb_flushID_SE(pv->pv_pmap,
1513 if (PV_BEEN_REFD(pv->pv_flags)) {
1514 pmap_tlb_flushD_SE(pv->pv_pmap,
1520 PTE_SYNC_CURRENT(pv->pv_pmap, ptep);
1526 * Modify pte bits for all ptes corresponding to the given physical address.
1527 * We use `maskbits' rather than `clearbits' because we're always passing
1528 * constants and the latter would require an extra inversion at run-time.
1531 pmap_clearbit(struct vm_page *pg, u_int maskbits)
1533 struct l2_bucket *l2b;
1534 struct pv_entry *pv;
1535 pt_entry_t *ptep, npte, opte;
1541 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1544 * Clear saved attributes (modify, reference)
1546 pg->md.pvh_attrs &= ~(maskbits & (PVF_MOD | PVF_REF));
1548 if (TAILQ_EMPTY(&pg->md.pv_list)) {
1553 * Loop over all current mappings setting/clearing as appropos
1555 TAILQ_FOREACH(pv, &pg->md.pv_list, pv_list) {
1558 oflags = pv->pv_flags;
1559 pv->pv_flags &= ~maskbits;
1563 l2b = pmap_get_l2_bucket(pm, va);
1565 ptep = &l2b->l2b_kva[l2pte_index(va)];
1566 npte = opte = *ptep;
1568 if (maskbits & (PVF_WRITE|PVF_MOD)) {
1569 if ((pv->pv_flags & PVF_NC)) {
1571 * Entry is not cacheable:
1573 * Don't turn caching on again if this is a
1574 * modified emulation. This would be
1575 * inconsitent with the settings created by
1576 * pmap_vac_me_harder(). Otherwise, it's safe
1577 * to re-enable cacheing.
1579 * There's no need to call pmap_vac_me_harder()
1580 * here: all pages are losing their write
1583 if (maskbits & PVF_WRITE) {
1584 npte |= pte_l2_s_cache_mode;
1585 pv->pv_flags &= ~PVF_NC;
1588 if (opte & L2_S_PROT_W) {
1591 * Entry is writable/cacheable: check if pmap
1592 * is current if it is flush it, otherwise it
1593 * won't be in the cache
1595 if (PV_BEEN_EXECD(oflags))
1596 pmap_idcache_wbinv_range(pm, pv->pv_va,
1599 if (PV_BEEN_REFD(oflags))
1600 pmap_dcache_wb_range(pm, pv->pv_va,
1602 (maskbits & PVF_REF) ? TRUE : FALSE,
1606 /* make the pte read only */
1607 npte &= ~L2_S_PROT_W;
1609 if (maskbits & PVF_WRITE) {
1611 * Keep alias accounting up to date
1613 if (pv->pv_pmap == pmap_kernel()) {
1614 if (oflags & PVF_WRITE) {
1615 pg->md.krw_mappings--;
1616 pg->md.kro_mappings++;
1619 if (oflags & PVF_WRITE) {
1620 pg->md.urw_mappings--;
1621 pg->md.uro_mappings++;
1626 if (maskbits & PVF_REF) {
1627 if ((pv->pv_flags & PVF_NC) == 0 &&
1628 (maskbits & (PVF_WRITE|PVF_MOD)) == 0) {
1630 * Check npte here; we may have already
1631 * done the wbinv above, and the validity
1632 * of the PTE is the same for opte and
1635 if (npte & L2_S_PROT_W) {
1636 if (PV_BEEN_EXECD(oflags))
1637 pmap_idcache_wbinv_range(pm,
1638 pv->pv_va, PAGE_SIZE);
1640 if (PV_BEEN_REFD(oflags))
1641 pmap_dcache_wb_range(pm,
1642 pv->pv_va, PAGE_SIZE,
1645 if ((npte & L2_TYPE_MASK) != L2_TYPE_INV) {
1646 /* XXXJRT need idcache_inv_range */
1647 if (PV_BEEN_EXECD(oflags))
1648 pmap_idcache_wbinv_range(pm,
1649 pv->pv_va, PAGE_SIZE);
1651 if (PV_BEEN_REFD(oflags))
1652 pmap_dcache_wb_range(pm,
1653 pv->pv_va, PAGE_SIZE,
1659 * Make the PTE invalid so that we will take a
1660 * page fault the next time the mapping is
1663 npte &= ~L2_TYPE_MASK;
1664 npte |= L2_TYPE_INV;
1671 /* Flush the TLB entry if a current pmap. */
1672 if (PV_BEEN_EXECD(oflags))
1673 pmap_tlb_flushID_SE(pm, pv->pv_va);
1675 if (PV_BEEN_REFD(oflags))
1676 pmap_tlb_flushD_SE(pm, pv->pv_va);
1683 if (maskbits & PVF_WRITE)
1684 vm_page_flag_clear(pg, PG_WRITEABLE);
1689 * main pv_entry manipulation functions:
1690 * pmap_enter_pv: enter a mapping onto a vm_page list
1691 * pmap_remove_pv: remove a mappiing from a vm_page list
1693 * NOTE: pmap_enter_pv expects to lock the pvh itself
1694 * pmap_remove_pv expects te caller to lock the pvh before calling
1698 * pmap_enter_pv: enter a mapping onto a vm_page lst
1700 * => caller should hold the proper lock on pmap_main_lock
1701 * => caller should have pmap locked
1702 * => we will gain the lock on the vm_page and allocate the new pv_entry
1703 * => caller should adjust ptp's wire_count before calling
1704 * => caller should not adjust pmap's wire_count
1707 pmap_enter_pv(struct vm_page *pg, struct pv_entry *pve, pmap_t pm,
1708 vm_offset_t va, u_int flags)
1711 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1712 PMAP_ASSERT_LOCKED(pm);
1715 pve->pv_flags = flags;
1717 TAILQ_INSERT_HEAD(&pg->md.pv_list, pve, pv_list);
1718 TAILQ_INSERT_HEAD(&pm->pm_pvlist, pve, pv_plist);
1719 pg->md.pvh_attrs |= flags & (PVF_REF | PVF_MOD);
1720 if (pm == pmap_kernel()) {
1721 if (flags & PVF_WRITE)
1722 pg->md.krw_mappings++;
1724 pg->md.kro_mappings++;
1726 if (flags & PVF_WRITE)
1727 pg->md.urw_mappings++;
1729 pg->md.uro_mappings++;
1730 pg->md.pv_list_count++;
1731 if (pve->pv_flags & PVF_WIRED)
1732 ++pm->pm_stats.wired_count;
1733 vm_page_flag_set(pg, PG_REFERENCED);
1738 * pmap_find_pv: Find a pv entry
1740 * => caller should hold lock on vm_page
1742 static PMAP_INLINE struct pv_entry *
1743 pmap_find_pv(struct vm_page *pg, pmap_t pm, vm_offset_t va)
1745 struct pv_entry *pv;
1747 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1748 TAILQ_FOREACH(pv, &pg->md.pv_list, pv_list)
1749 if (pm == pv->pv_pmap && va == pv->pv_va)
1755 * vector_page_setprot:
1757 * Manipulate the protection of the vector page.
1760 vector_page_setprot(int prot)
1762 struct l2_bucket *l2b;
1765 l2b = pmap_get_l2_bucket(pmap_kernel(), vector_page);
1767 ptep = &l2b->l2b_kva[l2pte_index(vector_page)];
1769 *ptep = (*ptep & ~L1_S_PROT_MASK) | L2_S_PROT(PTE_KERNEL, prot);
1771 cpu_tlb_flushD_SE(vector_page);
1776 * pmap_remove_pv: try to remove a mapping from a pv_list
1778 * => caller should hold proper lock on pmap_main_lock
1779 * => pmap should be locked
1780 * => caller should hold lock on vm_page [so that attrs can be adjusted]
1781 * => caller should adjust ptp's wire_count and free PTP if needed
1782 * => caller should NOT adjust pmap's wire_count
1783 * => we return the removed pve
1787 pmap_nuke_pv(struct vm_page *pg, pmap_t pm, struct pv_entry *pve)
1790 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1791 PMAP_ASSERT_LOCKED(pm);
1792 TAILQ_REMOVE(&pg->md.pv_list, pve, pv_list);
1793 TAILQ_REMOVE(&pm->pm_pvlist, pve, pv_plist);
1794 if (pve->pv_flags & PVF_WIRED)
1795 --pm->pm_stats.wired_count;
1796 pg->md.pv_list_count--;
1797 if (pg->md.pvh_attrs & PVF_MOD)
1799 if (pm == pmap_kernel()) {
1800 if (pve->pv_flags & PVF_WRITE)
1801 pg->md.krw_mappings--;
1803 pg->md.kro_mappings--;
1805 if (pve->pv_flags & PVF_WRITE)
1806 pg->md.urw_mappings--;
1808 pg->md.uro_mappings--;
1809 if (TAILQ_FIRST(&pg->md.pv_list) == NULL ||
1810 (pg->md.krw_mappings == 0 && pg->md.urw_mappings == 0)) {
1811 pg->md.pvh_attrs &= ~PVF_MOD;
1812 if (TAILQ_FIRST(&pg->md.pv_list) == NULL)
1813 pg->md.pvh_attrs &= ~PVF_REF;
1814 vm_page_flag_clear(pg, PG_WRITEABLE);
1816 if (TAILQ_FIRST(&pg->md.pv_list))
1817 vm_page_flag_set(pg, PG_REFERENCED);
1818 if (pve->pv_flags & PVF_WRITE)
1819 pmap_vac_me_harder(pg, pm, 0);
1822 static struct pv_entry *
1823 pmap_remove_pv(struct vm_page *pg, pmap_t pm, vm_offset_t va)
1825 struct pv_entry *pve;
1827 pve = TAILQ_FIRST(&pg->md.pv_list);
1830 if (pve->pv_pmap == pm && pve->pv_va == va) { /* match? */
1831 pmap_nuke_pv(pg, pm, pve);
1834 pve = TAILQ_NEXT(pve, pv_list);
1837 return(pve); /* return removed pve */
1841 * pmap_modify_pv: Update pv flags
1843 * => caller should hold lock on vm_page [so that attrs can be adjusted]
1844 * => caller should NOT adjust pmap's wire_count
1845 * => caller must call pmap_vac_me_harder() if writable status of a page
1847 * => we return the old flags
1849 * Modify a physical-virtual mapping in the pv table
1852 pmap_modify_pv(struct vm_page *pg, pmap_t pm, vm_offset_t va,
1853 u_int clr_mask, u_int set_mask)
1855 struct pv_entry *npv;
1856 u_int flags, oflags;
1858 PMAP_ASSERT_LOCKED(pm);
1859 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
1860 if ((npv = pmap_find_pv(pg, pm, va)) == NULL)
1864 * There is at least one VA mapping this page.
1867 if (clr_mask & (PVF_REF | PVF_MOD))
1868 pg->md.pvh_attrs |= set_mask & (PVF_REF | PVF_MOD);
1870 oflags = npv->pv_flags;
1871 npv->pv_flags = flags = (oflags & ~clr_mask) | set_mask;
1873 if ((flags ^ oflags) & PVF_WIRED) {
1874 if (flags & PVF_WIRED)
1875 ++pm->pm_stats.wired_count;
1877 --pm->pm_stats.wired_count;
1880 if ((flags ^ oflags) & PVF_WRITE) {
1881 if (pm == pmap_kernel()) {
1882 if (flags & PVF_WRITE) {
1883 pg->md.krw_mappings++;
1884 pg->md.kro_mappings--;
1886 pg->md.kro_mappings++;
1887 pg->md.krw_mappings--;
1890 if (flags & PVF_WRITE) {
1891 pg->md.urw_mappings++;
1892 pg->md.uro_mappings--;
1894 pg->md.uro_mappings++;
1895 pg->md.urw_mappings--;
1897 if (pg->md.krw_mappings == 0 && pg->md.urw_mappings == 0) {
1898 pg->md.pvh_attrs &= ~PVF_MOD;
1899 vm_page_flag_clear(pg, PG_WRITEABLE);
1901 pmap_vac_me_harder(pg, pm, 0);
1907 /* Function to set the debug level of the pmap code */
1910 pmap_debug(int level)
1912 pmap_debug_level = level;
1913 dprintf("pmap_debug: level=%d\n", pmap_debug_level);
1915 #endif /* PMAP_DEBUG */
1918 pmap_pinit0(struct pmap *pmap)
1920 PDEBUG(1, printf("pmap_pinit0: pmap = %08x\n", (u_int32_t) pmap));
1922 dprintf("pmap_pinit0: pmap = %08x, pm_pdir = %08x\n",
1923 (u_int32_t) pmap, (u_int32_t) pmap->pm_pdir);
1924 bcopy(kernel_pmap, pmap, sizeof(*pmap));
1925 bzero(&pmap->pm_mtx, sizeof(pmap->pm_mtx));
1926 PMAP_LOCK_INIT(pmap);
1930 * Initialize a vm_page's machine-dependent fields.
1933 pmap_page_init(vm_page_t m)
1936 TAILQ_INIT(&m->md.pv_list);
1937 m->md.pv_list_count = 0;
1941 * Initialize the pmap module.
1942 * Called by vm_init, to initialize any structures that the pmap
1943 * system needs to map virtual memory.
1948 int shpgperproc = PMAP_SHPGPERPROC;
1950 PDEBUG(1, printf("pmap_init: phys_start = %08x\n"));
1953 * init the pv free list
1955 pvzone = uma_zcreate("PV ENTRY", sizeof (struct pv_entry), NULL, NULL,
1956 NULL, NULL, UMA_ALIGN_PTR, UMA_ZONE_VM | UMA_ZONE_NOFREE);
1958 * Now it is safe to enable pv_table recording.
1960 PDEBUG(1, printf("pmap_init: done!\n"));
1962 TUNABLE_INT_FETCH("vm.pmap.shpgperproc", &shpgperproc);
1964 pv_entry_max = shpgperproc * maxproc + vm_page_array_size;
1965 pv_entry_high_water = 9 * (pv_entry_max / 10);
1966 l2zone = uma_zcreate("L2 Table", L2_TABLE_SIZE_REAL, pmap_l2ptp_ctor,
1967 NULL, NULL, NULL, UMA_ALIGN_PTR, UMA_ZONE_VM | UMA_ZONE_NOFREE);
1968 l2table_zone = uma_zcreate("L2 Table", sizeof(struct l2_dtable),
1969 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR,
1970 UMA_ZONE_VM | UMA_ZONE_NOFREE);
1972 uma_zone_set_obj(pvzone, &pvzone_obj, pv_entry_max);
1977 pmap_fault_fixup(pmap_t pm, vm_offset_t va, vm_prot_t ftype, int user)
1979 struct l2_dtable *l2;
1980 struct l2_bucket *l2b;
1981 pd_entry_t *pl1pd, l1pd;
1982 pt_entry_t *ptep, pte;
1988 vm_page_lock_queues();
1992 * If there is no l2_dtable for this address, then the process
1993 * has no business accessing it.
1995 * Note: This will catch userland processes trying to access
1998 l2 = pm->pm_l2[L2_IDX(l1idx)];
2003 * Likewise if there is no L2 descriptor table
2005 l2b = &l2->l2_bucket[L2_BUCKET(l1idx)];
2006 if (l2b->l2b_kva == NULL)
2010 * Check the PTE itself.
2012 ptep = &l2b->l2b_kva[l2pte_index(va)];
2018 * Catch a userland access to the vector page mapped at 0x0
2020 if (user && (pte & L2_S_PROT_U) == 0)
2022 if (va == vector_page)
2027 if ((ftype & VM_PROT_WRITE) && (pte & L2_S_PROT_W) == 0) {
2029 * This looks like a good candidate for "page modified"
2032 struct pv_entry *pv;
2035 /* Extract the physical address of the page */
2036 if ((pg = PHYS_TO_VM_PAGE(pa)) == NULL) {
2039 /* Get the current flags for this page. */
2041 pv = pmap_find_pv(pg, pm, va);
2047 * Do the flags say this page is writable? If not then it
2048 * is a genuine write fault. If yes then the write fault is
2049 * our fault as we did not reflect the write access in the
2050 * PTE. Now we know a write has occurred we can correct this
2051 * and also set the modified bit
2053 if ((pv->pv_flags & PVF_WRITE) == 0) {
2057 pg->md.pvh_attrs |= PVF_REF | PVF_MOD;
2059 pv->pv_flags |= PVF_REF | PVF_MOD;
2062 * Re-enable write permissions for the page. No need to call
2063 * pmap_vac_me_harder(), since this is just a
2064 * modified-emulation fault, and the PVF_WRITE bit isn't
2065 * changing. We've already set the cacheable bits based on
2066 * the assumption that we can write to this page.
2068 *ptep = (pte & ~L2_TYPE_MASK) | L2_S_PROTO | L2_S_PROT_W;
2072 if ((pte & L2_TYPE_MASK) == L2_TYPE_INV) {
2074 * This looks like a good candidate for "page referenced"
2077 struct pv_entry *pv;
2080 /* Extract the physical address of the page */
2081 if ((pg = PHYS_TO_VM_PAGE(pa)) == NULL)
2083 /* Get the current flags for this page. */
2085 pv = pmap_find_pv(pg, pm, va);
2089 pg->md.pvh_attrs |= PVF_REF;
2090 pv->pv_flags |= PVF_REF;
2093 *ptep = (pte & ~L2_TYPE_MASK) | L2_S_PROTO;
2099 * We know there is a valid mapping here, so simply
2100 * fix up the L1 if necessary.
2102 pl1pd = &pm->pm_l1->l1_kva[l1idx];
2103 l1pd = l2b->l2b_phys | L1_C_DOM(pm->pm_domain) | L1_C_PROTO;
2104 if (*pl1pd != l1pd) {
2112 * There are bugs in the rev K SA110. This is a check for one
2115 if (rv == 0 && curcpu()->ci_arm_cputype == CPU_ID_SA110 &&
2116 curcpu()->ci_arm_cpurev < 3) {
2117 /* Always current pmap */
2118 if (l2pte_valid(pte)) {
2119 extern int kernel_debug;
2120 if (kernel_debug & 1) {
2121 struct proc *p = curlwp->l_proc;
2122 printf("prefetch_abort: page is already "
2123 "mapped - pte=%p *pte=%08x\n", ptep, pte);
2124 printf("prefetch_abort: pc=%08lx proc=%p "
2125 "process=%s\n", va, p, p->p_comm);
2126 printf("prefetch_abort: far=%08x fs=%x\n",
2127 cpu_faultaddress(), cpu_faultstatus());
2130 if (kernel_debug & 2)
2136 #endif /* CPU_SA110 */
2140 * If 'rv == 0' at this point, it generally indicates that there is a
2141 * stale TLB entry for the faulting address. This happens when two or
2142 * more processes are sharing an L1. Since we don't flush the TLB on
2143 * a context switch between such processes, we can take domain faults
2144 * for mappings which exist at the same VA in both processes. EVEN IF
2145 * WE'VE RECENTLY FIXED UP THE CORRESPONDING L1 in pmap_enter(), for
2148 * This is extremely likely to happen if pmap_enter() updated the L1
2149 * entry for a recently entered mapping. In this case, the TLB is
2150 * flushed for the new mapping, but there may still be TLB entries for
2151 * other mappings belonging to other processes in the 1MB range
2152 * covered by the L1 entry.
2154 * Since 'rv == 0', we know that the L1 already contains the correct
2155 * value, so the fault must be due to a stale TLB entry.
2157 * Since we always need to flush the TLB anyway in the case where we
2158 * fixed up the L1, or frobbed the L2 PTE, we effectively deal with
2159 * stale TLB entries dynamically.
2161 * However, the above condition can ONLY happen if the current L1 is
2162 * being shared. If it happens when the L1 is unshared, it indicates
2163 * that other parts of the pmap are not doing their job WRT managing
2166 if (rv == 0 && pm->pm_l1->l1_domain_use_count == 1) {
2167 extern int last_fault_code;
2168 printf("fixup: pm %p, va 0x%lx, ftype %d - nothing to do!\n",
2170 printf("fixup: l2 %p, l2b %p, ptep %p, pl1pd %p\n",
2171 l2, l2b, ptep, pl1pd);
2172 printf("fixup: pte 0x%x, l1pd 0x%x, last code 0x%x\n",
2173 pte, l1pd, last_fault_code);
2180 cpu_tlb_flushID_SE(va);
2186 vm_page_unlock_queues();
2194 struct l2_bucket *l2b;
2195 struct l1_ttable *l1;
2197 pt_entry_t *ptep, pte;
2198 vm_offset_t va, eva;
2201 needed = (maxproc / PMAP_DOMAINS) + ((maxproc % PMAP_DOMAINS) ? 1 : 0);
2203 l1 = malloc(sizeof(*l1) * needed, M_VMPMAP, M_WAITOK);
2205 for (loop = 0; loop < needed; loop++, l1++) {
2206 /* Allocate a L1 page table */
2207 va = (vm_offset_t)contigmalloc(L1_TABLE_SIZE, M_VMPMAP, 0, 0x0,
2208 0xffffffff, L1_TABLE_SIZE, 0);
2211 panic("Cannot allocate L1 KVM");
2213 eva = va + L1_TABLE_SIZE;
2214 pl1pt = (pd_entry_t *)va;
2217 l2b = pmap_get_l2_bucket(pmap_kernel(), va);
2218 ptep = &l2b->l2b_kva[l2pte_index(va)];
2220 pte = (pte & ~L2_S_CACHE_MASK) | pte_l2_s_cache_mode_pt;
2223 cpu_tlb_flushD_SE(va);
2227 pmap_init_l1(l1, pl1pt);
2232 printf("pmap_postinit: Allocated %d static L1 descriptor tables\n",
2238 * This is used to stuff certain critical values into the PCB where they
2239 * can be accessed quickly from cpu_switch() et al.
2242 pmap_set_pcb_pagedir(pmap_t pm, struct pcb *pcb)
2244 struct l2_bucket *l2b;
2246 pcb->pcb_pagedir = pm->pm_l1->l1_physaddr;
2247 pcb->pcb_dacr = (DOMAIN_CLIENT << (PMAP_DOMAIN_KERNEL * 2)) |
2248 (DOMAIN_CLIENT << (pm->pm_domain * 2));
2250 if (vector_page < KERNBASE) {
2251 pcb->pcb_pl1vec = &pm->pm_l1->l1_kva[L1_IDX(vector_page)];
2252 l2b = pmap_get_l2_bucket(pm, vector_page);
2253 pcb->pcb_l1vec = l2b->l2b_phys | L1_C_PROTO |
2254 L1_C_DOM(pm->pm_domain) | L1_C_DOM(PMAP_DOMAIN_KERNEL);
2256 pcb->pcb_pl1vec = NULL;
2260 pmap_activate(struct thread *td)
2266 pm = vmspace_pmap(td->td_proc->p_vmspace);
2270 pmap_set_pcb_pagedir(pm, pcb);
2272 if (td == curthread) {
2273 u_int cur_dacr, cur_ttb;
2275 __asm __volatile("mrc p15, 0, %0, c2, c0, 0" : "=r"(cur_ttb));
2276 __asm __volatile("mrc p15, 0, %0, c3, c0, 0" : "=r"(cur_dacr));
2278 cur_ttb &= ~(L1_TABLE_SIZE - 1);
2280 if (cur_ttb == (u_int)pcb->pcb_pagedir &&
2281 cur_dacr == pcb->pcb_dacr) {
2283 * No need to switch address spaces.
2291 * We MUST, I repeat, MUST fix up the L1 entry corresponding
2292 * to 'vector_page' in the incoming L1 table before switching
2293 * to it otherwise subsequent interrupts/exceptions (including
2294 * domain faults!) will jump into hyperspace.
2296 if (pcb->pcb_pl1vec) {
2298 *pcb->pcb_pl1vec = pcb->pcb_l1vec;
2300 * Don't need to PTE_SYNC() at this point since
2301 * cpu_setttb() is about to flush both the cache
2306 cpu_domains(pcb->pcb_dacr);
2307 cpu_setttb(pcb->pcb_pagedir);
2315 pmap_set_pt_cache_mode(pd_entry_t *kl1, vm_offset_t va)
2317 pd_entry_t *pdep, pde;
2318 pt_entry_t *ptep, pte;
2323 * Make sure the descriptor itself has the correct cache mode
2325 pdep = &kl1[L1_IDX(va)];
2328 if (l1pte_section_p(pde)) {
2329 if ((pde & L1_S_CACHE_MASK) != pte_l1_s_cache_mode_pt) {
2330 *pdep = (pde & ~L1_S_CACHE_MASK) |
2331 pte_l1_s_cache_mode_pt;
2333 cpu_dcache_wbinv_range((vm_offset_t)pdep,
2338 pa = (vm_paddr_t)(pde & L1_C_ADDR_MASK);
2339 ptep = (pt_entry_t *)kernel_pt_lookup(pa);
2341 panic("pmap_bootstrap: No L2 for L2 @ va %p\n", ptep);
2343 ptep = &ptep[l2pte_index(va)];
2345 if ((pte & L2_S_CACHE_MASK) != pte_l2_s_cache_mode_pt) {
2346 *ptep = (pte & ~L2_S_CACHE_MASK) |
2347 pte_l2_s_cache_mode_pt;
2349 cpu_dcache_wbinv_range((vm_offset_t)ptep,
2359 pmap_alloc_specials(vm_offset_t *availp, int pages, vm_offset_t *vap,
2362 vm_offset_t va = *availp;
2363 struct l2_bucket *l2b;
2366 l2b = pmap_get_l2_bucket(pmap_kernel(), va);
2368 panic("pmap_alloc_specials: no l2b for 0x%x", va);
2370 *ptep = &l2b->l2b_kva[l2pte_index(va)];
2374 *availp = va + (PAGE_SIZE * pages);
2378 * Bootstrap the system enough to run with virtual memory.
2380 * On the arm this is called after mapping has already been enabled
2381 * and just syncs the pmap module with what has already been done.
2382 * [We can't call it easily with mapping off since the kernel is not
2383 * mapped with PA == VA, hence we would have to relocate every address
2384 * from the linked base (virtual) address "KERNBASE" to the actual
2385 * (physical) address starting relative to 0]
2387 #define PMAP_STATIC_L2_SIZE 16
2388 #ifdef ARM_USE_SMALL_ALLOC
2389 extern struct mtx smallalloc_mtx;
2390 extern vm_offset_t alloc_curaddr;
2391 extern vm_offset_t alloc_firstaddr;
2395 pmap_bootstrap(vm_offset_t firstaddr, vm_offset_t lastaddr, struct pv_addr *l1pt)
2397 static struct l1_ttable static_l1;
2398 static struct l2_dtable static_l2[PMAP_STATIC_L2_SIZE];
2399 struct l1_ttable *l1 = &static_l1;
2400 struct l2_dtable *l2;
2401 struct l2_bucket *l2b;
2403 pd_entry_t *kernel_l1pt = (pd_entry_t *)l1pt->pv_va;
2408 int l1idx, l2idx, l2next = 0;
2410 PDEBUG(1, printf("firstaddr = %08x, loadaddr = %08x\n",
2411 firstaddr, loadaddr));
2413 virtual_avail = firstaddr;
2414 kernel_pmap = &kernel_pmap_store;
2415 kernel_pmap->pm_l1 = l1;
2416 kernel_l1pa = l1pt->pv_pa;
2419 * Scan the L1 translation table created by initarm() and create
2420 * the required metadata for all valid mappings found in it.
2422 for (l1idx = 0; l1idx < (L1_TABLE_SIZE / sizeof(pd_entry_t)); l1idx++) {
2423 pde = kernel_l1pt[l1idx];
2426 * We're only interested in Coarse mappings.
2427 * pmap_extract() can deal with section mappings without
2428 * recourse to checking L2 metadata.
2430 if ((pde & L1_TYPE_MASK) != L1_TYPE_C)
2434 * Lookup the KVA of this L2 descriptor table
2436 pa = (vm_paddr_t)(pde & L1_C_ADDR_MASK);
2437 ptep = (pt_entry_t *)kernel_pt_lookup(pa);
2440 panic("pmap_bootstrap: No L2 for va 0x%x, pa 0x%lx",
2441 (u_int)l1idx << L1_S_SHIFT, (long unsigned int)pa);
2445 * Fetch the associated L2 metadata structure.
2446 * Allocate a new one if necessary.
2448 if ((l2 = kernel_pmap->pm_l2[L2_IDX(l1idx)]) == NULL) {
2449 if (l2next == PMAP_STATIC_L2_SIZE)
2450 panic("pmap_bootstrap: out of static L2s");
2451 kernel_pmap->pm_l2[L2_IDX(l1idx)] = l2 =
2452 &static_l2[l2next++];
2456 * One more L1 slot tracked...
2461 * Fill in the details of the L2 descriptor in the
2462 * appropriate bucket.
2464 l2b = &l2->l2_bucket[L2_BUCKET(l1idx)];
2465 l2b->l2b_kva = ptep;
2467 l2b->l2b_l1idx = l1idx;
2470 * Establish an initial occupancy count for this descriptor
2473 l2idx < (L2_TABLE_SIZE_REAL / sizeof(pt_entry_t));
2475 if ((ptep[l2idx] & L2_TYPE_MASK) != L2_TYPE_INV) {
2476 l2b->l2b_occupancy++;
2481 * Make sure the descriptor itself has the correct cache mode.
2482 * If not, fix it, but whine about the problem. Port-meisters
2483 * should consider this a clue to fix up their initarm()
2486 if (pmap_set_pt_cache_mode(kernel_l1pt, (vm_offset_t)ptep)) {
2487 printf("pmap_bootstrap: WARNING! wrong cache mode for "
2488 "L2 pte @ %p\n", ptep);
2494 * Ensure the primary (kernel) L1 has the correct cache mode for
2495 * a page table. Bitch if it is not correctly set.
2497 for (va = (vm_offset_t)kernel_l1pt;
2498 va < ((vm_offset_t)kernel_l1pt + L1_TABLE_SIZE); va += PAGE_SIZE) {
2499 if (pmap_set_pt_cache_mode(kernel_l1pt, va))
2500 printf("pmap_bootstrap: WARNING! wrong cache mode for "
2501 "primary L1 @ 0x%x\n", va);
2504 cpu_dcache_wbinv_all();
2508 PMAP_LOCK_INIT(kernel_pmap);
2509 kernel_pmap->pm_active = -1;
2510 kernel_pmap->pm_domain = PMAP_DOMAIN_KERNEL;
2511 TAILQ_INIT(&kernel_pmap->pm_pvlist);
2514 * Reserve some special page table entries/VA space for temporary
2517 #define SYSMAP(c, p, v, n) \
2518 v = (c)va; va += ((n)*PAGE_SIZE); p = pte; pte += (n);
2520 pmap_alloc_specials(&virtual_avail, 1, &csrcp, &csrc_pte);
2521 pmap_set_pt_cache_mode(kernel_l1pt, (vm_offset_t)csrc_pte);
2522 pmap_alloc_specials(&virtual_avail, 1, &cdstp, &cdst_pte);
2523 pmap_set_pt_cache_mode(kernel_l1pt, (vm_offset_t)cdst_pte);
2524 size = ((lastaddr - pmap_curmaxkvaddr) + L1_S_OFFSET) / L1_S_SIZE;
2525 pmap_alloc_specials(&virtual_avail,
2526 round_page(size * L2_TABLE_SIZE_REAL) / PAGE_SIZE,
2527 &pmap_kernel_l2ptp_kva, NULL);
2529 size = (size + (L2_BUCKET_SIZE - 1)) / L2_BUCKET_SIZE;
2530 pmap_alloc_specials(&virtual_avail,
2531 round_page(size * sizeof(struct l2_dtable)) / PAGE_SIZE,
2532 &pmap_kernel_l2dtable_kva, NULL);
2534 pmap_alloc_specials(&virtual_avail,
2535 1, (vm_offset_t*)&_tmppt, NULL);
2536 SLIST_INIT(&l1_list);
2537 TAILQ_INIT(&l1_lru_list);
2538 mtx_init(&l1_lru_lock, "l1 list lock", NULL, MTX_DEF);
2539 pmap_init_l1(l1, kernel_l1pt);
2540 cpu_dcache_wbinv_all();
2542 virtual_avail = round_page(virtual_avail);
2543 virtual_end = lastaddr;
2544 kernel_vm_end = pmap_curmaxkvaddr;
2545 arm_nocache_startaddr = lastaddr;
2546 mtx_init(&cmtx, "TMP mappings mtx", NULL, MTX_DEF);
2548 #ifdef ARM_USE_SMALL_ALLOC
2549 mtx_init(&smallalloc_mtx, "Small alloc page list", NULL, MTX_DEF);
2550 alloc_firstaddr = alloc_curaddr = arm_nocache_startaddr +
2551 ARM_NOCACHE_KVA_SIZE;
2555 /***************************************************
2556 * Pmap allocation/deallocation routines.
2557 ***************************************************/
2560 * Release any resources held by the given physical map.
2561 * Called when a pmap initialized by pmap_pinit is being released.
2562 * Should only be called if the map contains no valid mappings.
2565 pmap_release(pmap_t pmap)
2569 pmap_idcache_wbinv_all(pmap);
2570 pmap_tlb_flushID(pmap);
2572 if (vector_page < KERNBASE) {
2573 struct pcb *curpcb = PCPU_GET(curpcb);
2574 pcb = thread0.td_pcb;
2575 if (pmap_is_current(pmap)) {
2577 * Frob the L1 entry corresponding to the vector
2578 * page so that it contains the kernel pmap's domain
2579 * number. This will ensure pmap_remove() does not
2580 * pull the current vector page out from under us.
2583 *pcb->pcb_pl1vec = pcb->pcb_l1vec;
2584 cpu_domains(pcb->pcb_dacr);
2585 cpu_setttb(pcb->pcb_pagedir);
2588 pmap_remove(pmap, vector_page, vector_page + PAGE_SIZE);
2590 * Make sure cpu_switch(), et al, DTRT. This is safe to do
2591 * since this process has no remaining mappings of its own.
2593 curpcb->pcb_pl1vec = pcb->pcb_pl1vec;
2594 curpcb->pcb_l1vec = pcb->pcb_l1vec;
2595 curpcb->pcb_dacr = pcb->pcb_dacr;
2596 curpcb->pcb_pagedir = pcb->pcb_pagedir;
2600 PMAP_LOCK_DESTROY(pmap);
2602 dprintf("pmap_release()\n");
2608 * Helper function for pmap_grow_l2_bucket()
2611 pmap_grow_map(vm_offset_t va, pt_entry_t cache_mode, vm_paddr_t *pap)
2613 struct l2_bucket *l2b;
2618 pg = vm_page_alloc(NULL, 0, VM_ALLOC_NOOBJ | VM_ALLOC_WIRED);
2621 pa = VM_PAGE_TO_PHYS(pg);
2626 l2b = pmap_get_l2_bucket(pmap_kernel(), va);
2628 ptep = &l2b->l2b_kva[l2pte_index(va)];
2629 *ptep = L2_S_PROTO | pa | cache_mode |
2630 L2_S_PROT(PTE_KERNEL, VM_PROT_READ | VM_PROT_WRITE);
2636 * This is the same as pmap_alloc_l2_bucket(), except that it is only
2637 * used by pmap_growkernel().
2639 static __inline struct l2_bucket *
2640 pmap_grow_l2_bucket(pmap_t pm, vm_offset_t va)
2642 struct l2_dtable *l2;
2643 struct l2_bucket *l2b;
2644 struct l1_ttable *l1;
2651 if ((l2 = pm->pm_l2[L2_IDX(l1idx)]) == NULL) {
2653 * No mapping at this address, as there is
2654 * no entry in the L1 table.
2655 * Need to allocate a new l2_dtable.
2657 nva = pmap_kernel_l2dtable_kva;
2658 if ((nva & PAGE_MASK) == 0) {
2660 * Need to allocate a backing page
2662 if (pmap_grow_map(nva, pte_l2_s_cache_mode, NULL))
2666 l2 = (struct l2_dtable *)nva;
2667 nva += sizeof(struct l2_dtable);
2669 if ((nva & PAGE_MASK) < (pmap_kernel_l2dtable_kva &
2672 * The new l2_dtable straddles a page boundary.
2673 * Map in another page to cover it.
2675 if (pmap_grow_map(nva, pte_l2_s_cache_mode, NULL))
2679 pmap_kernel_l2dtable_kva = nva;
2682 * Link it into the parent pmap
2684 pm->pm_l2[L2_IDX(l1idx)] = l2;
2685 memset(l2, 0, sizeof(*l2));
2688 l2b = &l2->l2_bucket[L2_BUCKET(l1idx)];
2691 * Fetch pointer to the L2 page table associated with the address.
2693 if (l2b->l2b_kva == NULL) {
2697 * No L2 page table has been allocated. Chances are, this
2698 * is because we just allocated the l2_dtable, above.
2700 nva = pmap_kernel_l2ptp_kva;
2701 ptep = (pt_entry_t *)nva;
2702 if ((nva & PAGE_MASK) == 0) {
2704 * Need to allocate a backing page
2706 if (pmap_grow_map(nva, pte_l2_s_cache_mode_pt,
2707 &pmap_kernel_l2ptp_phys))
2709 PTE_SYNC_RANGE(ptep, PAGE_SIZE / sizeof(pt_entry_t));
2711 memset(ptep, 0, L2_TABLE_SIZE_REAL);
2713 l2b->l2b_kva = ptep;
2714 l2b->l2b_l1idx = l1idx;
2715 l2b->l2b_phys = pmap_kernel_l2ptp_phys;
2717 pmap_kernel_l2ptp_kva += L2_TABLE_SIZE_REAL;
2718 pmap_kernel_l2ptp_phys += L2_TABLE_SIZE_REAL;
2721 /* Distribute new L1 entry to all other L1s */
2722 SLIST_FOREACH(l1, &l1_list, l1_link) {
2723 pl1pd = &l1->l1_kva[L1_IDX(va)];
2724 *pl1pd = l2b->l2b_phys | L1_C_DOM(PMAP_DOMAIN_KERNEL) |
2734 * grow the number of kernel page table entries, if needed
2737 pmap_growkernel(vm_offset_t addr)
2739 pmap_t kpm = pmap_kernel();
2742 if (addr <= pmap_curmaxkvaddr)
2743 return; /* we are OK */
2746 * whoops! we need to add kernel PTPs
2749 s = splhigh(); /* to be safe */
2751 /* Map 1MB at a time */
2752 for (; pmap_curmaxkvaddr < addr; pmap_curmaxkvaddr += L1_S_SIZE)
2753 pmap_grow_l2_bucket(kpm, pmap_curmaxkvaddr);
2756 * flush out the cache, expensive but growkernel will happen so
2759 cpu_dcache_wbinv_all();
2762 kernel_vm_end = pmap_curmaxkvaddr;
2768 * pmap_page_protect:
2770 * Lower the permission for all mappings to a given page.
2773 pmap_page_protect(vm_page_t m, vm_prot_t prot)
2776 case VM_PROT_READ|VM_PROT_WRITE|VM_PROT_EXECUTE:
2777 case VM_PROT_READ|VM_PROT_WRITE:
2781 case VM_PROT_READ|VM_PROT_EXECUTE:
2782 pmap_clearbit(m, PVF_WRITE);
2794 * Remove all pages from specified address space
2795 * this aids process exit speeds. Also, this code
2796 * is special cased for current process only, but
2797 * can have the more generic (and slightly slower)
2798 * mode enabled. This is much faster than pmap_remove
2799 * in the case of running down an entire address space.
2802 pmap_remove_pages(pmap_t pmap)
2804 struct pv_entry *pv, *npv;
2805 struct l2_bucket *l2b = NULL;
2809 vm_page_lock_queues();
2811 for (pv = TAILQ_FIRST(&pmap->pm_pvlist); pv; pv = npv) {
2812 if (pv->pv_flags & PVF_WIRED) {
2813 /* The page is wired, cannot remove it now. */
2814 npv = TAILQ_NEXT(pv, pv_plist);
2817 pmap->pm_stats.resident_count--;
2818 l2b = pmap_get_l2_bucket(pmap, pv->pv_va);
2819 KASSERT(l2b != NULL, ("No L2 bucket in pmap_remove_pages"));
2820 pt = &l2b->l2b_kva[l2pte_index(pv->pv_va)];
2821 m = PHYS_TO_VM_PAGE(*pt & L2_ADDR_MASK);
2824 npv = TAILQ_NEXT(pv, pv_plist);
2825 pmap_nuke_pv(m, pmap, pv);
2826 if (TAILQ_EMPTY(&m->md.pv_list))
2827 vm_page_flag_clear(m, PG_WRITEABLE);
2828 pmap_free_pv_entry(pv);
2830 vm_page_unlock_queues();
2831 cpu_idcache_wbinv_all();
2838 /***************************************************
2839 * Low level mapping routines.....
2840 ***************************************************/
2842 /* Map a section into the KVA. */
2845 pmap_kenter_section(vm_offset_t va, vm_offset_t pa, int flags)
2847 pd_entry_t pd = L1_S_PROTO | pa | L1_S_PROT(PTE_KERNEL,
2848 VM_PROT_READ|VM_PROT_WRITE) | L1_S_DOM(PMAP_DOMAIN_KERNEL);
2849 struct l1_ttable *l1;
2851 KASSERT(((va | pa) & L1_S_OFFSET) == 0,
2852 ("Not a valid section mapping"));
2853 if (flags & SECTION_CACHE)
2854 pd |= pte_l1_s_cache_mode;
2855 else if (flags & SECTION_PT)
2856 pd |= pte_l1_s_cache_mode_pt;
2857 SLIST_FOREACH(l1, &l1_list, l1_link) {
2858 l1->l1_kva[L1_IDX(va)] = pd;
2859 PTE_SYNC(&l1->l1_kva[L1_IDX(va)]);
2864 * add a wired page to the kva
2865 * note that in order for the mapping to take effect -- you
2866 * should do a invltlb after doing the pmap_kenter...
2868 static PMAP_INLINE void
2869 pmap_kenter_internal(vm_offset_t va, vm_offset_t pa, int flags)
2871 struct l2_bucket *l2b;
2874 PDEBUG(1, printf("pmap_kenter: va = %08x, pa = %08x\n",
2875 (uint32_t) va, (uint32_t) pa));
2878 l2b = pmap_get_l2_bucket(pmap_kernel(), va);
2880 l2b = pmap_grow_l2_bucket(pmap_kernel(), va);
2881 KASSERT(l2b != NULL, ("No L2 Bucket"));
2882 pte = &l2b->l2b_kva[l2pte_index(va)];
2884 PDEBUG(1, printf("pmap_kenter: pte = %08x, opte = %08x, npte = %08x\n",
2885 (uint32_t) pte, opte, *pte));
2886 if (l2pte_valid(opte)) {
2887 cpu_dcache_wbinv_range(va, PAGE_SIZE);
2888 cpu_tlb_flushD_SE(va);
2892 l2b->l2b_occupancy++;
2894 *pte = L2_S_PROTO | pa | L2_S_PROT(PTE_KERNEL,
2895 VM_PROT_READ | VM_PROT_WRITE);
2896 if (flags & KENTER_CACHE)
2897 *pte |= pte_l2_s_cache_mode;
2898 if (flags & KENTER_USER)
2899 *pte |= L2_S_PROT_U;
2904 pmap_kenter(vm_offset_t va, vm_paddr_t pa)
2906 pmap_kenter_internal(va, pa, KENTER_CACHE);
2910 pmap_kenter_nocache(vm_offset_t va, vm_paddr_t pa)
2913 pmap_kenter_internal(va, pa, 0);
2917 pmap_kenter_user(vm_offset_t va, vm_paddr_t pa)
2920 pmap_kenter_internal(va, pa, KENTER_CACHE|KENTER_USER);
2922 * Call pmap_fault_fixup now, to make sure we'll have no exception
2923 * at the first use of the new address, or bad things will happen,
2924 * as we use one of these addresses in the exception handlers.
2926 pmap_fault_fixup(pmap_kernel(), va, VM_PROT_READ|VM_PROT_WRITE, 1);
2930 * remove a page rom the kernel pagetables
2933 pmap_kremove(vm_offset_t va)
2935 struct l2_bucket *l2b;
2936 pt_entry_t *pte, opte;
2938 l2b = pmap_get_l2_bucket(pmap_kernel(), va);
2941 KASSERT(l2b != NULL, ("No L2 Bucket"));
2942 pte = &l2b->l2b_kva[l2pte_index(va)];
2944 if (l2pte_valid(opte)) {
2945 cpu_dcache_wbinv_range(va, PAGE_SIZE);
2946 cpu_tlb_flushD_SE(va);
2954 * Used to map a range of physical addresses into kernel
2955 * virtual address space.
2957 * The value passed in '*virt' is a suggested virtual address for
2958 * the mapping. Architectures which can support a direct-mapped
2959 * physical to virtual region can return the appropriate address
2960 * within that region, leaving '*virt' unchanged. Other
2961 * architectures should map the pages starting at '*virt' and
2962 * update '*virt' with the first usable address after the mapped
2966 pmap_map(vm_offset_t *virt, vm_offset_t start, vm_offset_t end, int prot)
2968 vm_offset_t sva = *virt;
2969 vm_offset_t va = sva;
2971 PDEBUG(1, printf("pmap_map: virt = %08x, start = %08x, end = %08x, "
2972 "prot = %d\n", (uint32_t) *virt, (uint32_t) start, (uint32_t) end,
2975 while (start < end) {
2976 pmap_kenter(va, start);
2985 pmap_wb_page(vm_page_t m)
2987 struct pv_entry *pv;
2989 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list)
2990 pmap_dcache_wb_range(pv->pv_pmap, pv->pv_va, PAGE_SIZE, FALSE,
2991 (pv->pv_flags & PVF_WRITE) == 0);
2995 pmap_inv_page(vm_page_t m)
2997 struct pv_entry *pv;
2999 TAILQ_FOREACH(pv, &m->md.pv_list, pv_list)
3000 pmap_dcache_wb_range(pv->pv_pmap, pv->pv_va, PAGE_SIZE, TRUE, TRUE);
3003 * Add a list of wired pages to the kva
3004 * this routine is only used for temporary
3005 * kernel mappings that do not need to have
3006 * page modification or references recorded.
3007 * Note that old mappings are simply written
3008 * over. The page *must* be wired.
3011 pmap_qenter(vm_offset_t va, vm_page_t *m, int count)
3015 for (i = 0; i < count; i++) {
3017 pmap_kenter_internal(va, VM_PAGE_TO_PHYS(m[i]),
3025 * this routine jerks page mappings from the
3026 * kernel -- it is meant only for temporary mappings.
3029 pmap_qremove(vm_offset_t va, int count)
3034 for (i = 0; i < count; i++) {
3037 pmap_inv_page(PHYS_TO_VM_PAGE(pa));
3046 * pmap_object_init_pt preloads the ptes for a given object
3047 * into the specified pmap. This eliminates the blast of soft
3048 * faults on process startup and immediately after an mmap.
3051 pmap_object_init_pt(pmap_t pmap, vm_offset_t addr, vm_object_t object,
3052 vm_pindex_t pindex, vm_size_t size)
3055 VM_OBJECT_LOCK_ASSERT(object, MA_OWNED);
3056 KASSERT(object->type == OBJT_DEVICE,
3057 ("pmap_object_init_pt: non-device object"));
3062 * pmap_is_prefaultable:
3064 * Return whether or not the specified virtual address is elgible
3068 pmap_is_prefaultable(pmap_t pmap, vm_offset_t addr)
3073 if (!pmap_get_pde_pte(pmap, addr, &pde, &pte))
3075 KASSERT(pte != NULL, ("Valid mapping but no pte ?"));
3082 * Fetch pointers to the PDE/PTE for the given pmap/VA pair.
3083 * Returns TRUE if the mapping exists, else FALSE.
3085 * NOTE: This function is only used by a couple of arm-specific modules.
3086 * It is not safe to take any pmap locks here, since we could be right
3087 * in the middle of debugging the pmap anyway...
3089 * It is possible for this routine to return FALSE even though a valid
3090 * mapping does exist. This is because we don't lock, so the metadata
3091 * state may be inconsistent.
3093 * NOTE: We can return a NULL *ptp in the case where the L1 pde is
3094 * a "section" mapping.
3097 pmap_get_pde_pte(pmap_t pm, vm_offset_t va, pd_entry_t **pdp, pt_entry_t **ptp)
3099 struct l2_dtable *l2;
3100 pd_entry_t *pl1pd, l1pd;
3104 if (pm->pm_l1 == NULL)
3108 *pdp = pl1pd = &pm->pm_l1->l1_kva[l1idx];
3111 if (l1pte_section_p(l1pd)) {
3116 if (pm->pm_l2 == NULL)
3119 l2 = pm->pm_l2[L2_IDX(l1idx)];
3122 (ptep = l2->l2_bucket[L2_BUCKET(l1idx)].l2b_kva) == NULL) {
3126 *ptp = &ptep[l2pte_index(va)];
3131 * Routine: pmap_remove_all
3133 * Removes this physical page from
3134 * all physical maps in which it resides.
3135 * Reflects back modify bits to the pager.
3138 * Original versions of this routine were very
3139 * inefficient because they iteratively called
3140 * pmap_remove (slow...)
3143 pmap_remove_all(vm_page_t m)
3146 pt_entry_t *ptep, pte;
3147 struct l2_bucket *l2b;
3148 boolean_t flush = FALSE;
3152 #if defined(PMAP_DEBUG)
3154 * XXX this makes pmap_page_protect(NONE) illegal for non-managed
3157 if (m->flags & PG_FICTITIOUS) {
3158 panic("pmap_page_protect: illegal for unmanaged page, va: 0x%x", VM_PAGE_TO_PHYS(m));
3162 if (TAILQ_EMPTY(&m->md.pv_list))
3164 curpm = vmspace_pmap(curproc->p_vmspace);
3165 while ((pv = TAILQ_FIRST(&m->md.pv_list)) != NULL) {
3166 if (flush == FALSE && (pv->pv_pmap == curpm ||
3167 pv->pv_pmap == pmap_kernel()))
3169 PMAP_LOCK(pv->pv_pmap);
3170 l2b = pmap_get_l2_bucket(pv->pv_pmap, pv->pv_va);
3171 KASSERT(l2b != NULL, ("No l2 bucket"));
3172 ptep = &l2b->l2b_kva[l2pte_index(pv->pv_va)];
3175 PTE_SYNC_CURRENT(pv->pv_pmap, ptep);
3176 pmap_free_l2_bucket(pv->pv_pmap, l2b, 1);
3177 if (pv->pv_flags & PVF_WIRED)
3178 pv->pv_pmap->pm_stats.wired_count--;
3179 pv->pv_pmap->pm_stats.resident_count--;
3180 flags |= pv->pv_flags;
3181 pmap_nuke_pv(m, pv->pv_pmap, pv);
3182 PMAP_UNLOCK(pv->pv_pmap);
3183 pmap_free_pv_entry(pv);
3187 if (PV_BEEN_EXECD(flags))
3188 pmap_tlb_flushID(curpm);
3190 pmap_tlb_flushD(curpm);
3192 vm_page_flag_clear(m, PG_WRITEABLE);
3197 * Set the physical protection on the
3198 * specified range of this map as requested.
3201 pmap_protect(pmap_t pm, vm_offset_t sva, vm_offset_t eva, vm_prot_t prot)
3203 struct l2_bucket *l2b;
3204 pt_entry_t *ptep, pte;
3205 vm_offset_t next_bucket;
3209 if ((prot & VM_PROT_READ) == 0) {
3210 pmap_remove(pm, sva, eva);
3214 if (prot & VM_PROT_WRITE) {
3216 * If this is a read->write transition, just ignore it and let
3217 * vm_fault() take care of it later.
3222 vm_page_lock_queues();
3226 * OK, at this point, we know we're doing write-protect operation.
3227 * If the pmap is active, write-back the range.
3229 pmap_dcache_wb_range(pm, sva, eva - sva, FALSE, FALSE);
3231 flush = ((eva - sva) >= (PAGE_SIZE * 4)) ? 0 : -1;
3235 next_bucket = L2_NEXT_BUCKET(sva);
3236 if (next_bucket > eva)
3239 l2b = pmap_get_l2_bucket(pm, sva);
3245 ptep = &l2b->l2b_kva[l2pte_index(sva)];
3247 while (sva < next_bucket) {
3248 if ((pte = *ptep) != 0 && (pte & L2_S_PROT_W) != 0) {
3252 pg = PHYS_TO_VM_PAGE(l2pte_pa(pte));
3253 pte &= ~L2_S_PROT_W;
3258 f = pmap_modify_pv(pg, pm, sva,
3260 pmap_vac_me_harder(pg, pm, sva);
3263 f = PVF_REF | PVF_EXEC;
3269 if (PV_BEEN_EXECD(f))
3270 pmap_tlb_flushID_SE(pm, sva);
3272 if (PV_BEEN_REFD(f))
3273 pmap_tlb_flushD_SE(pm, sva);
3283 if (PV_BEEN_EXECD(flags))
3284 pmap_tlb_flushID(pm);
3286 if (PV_BEEN_REFD(flags))
3287 pmap_tlb_flushD(pm);
3289 vm_page_unlock_queues();
3296 * Insert the given physical page (p) at
3297 * the specified virtual address (v) in the
3298 * target physical map with the protection requested.
3300 * If specified, the page will be wired down, meaning
3301 * that the related pte can not be reclaimed.
3303 * NB: This is the only routine which MAY NOT lazy-evaluate
3304 * or lose information. That is, this routine must actually
3305 * insert this page into the given map NOW.
3309 pmap_enter(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot,
3313 vm_page_lock_queues();
3315 pmap_enter_locked(pmap, va, m, prot, wired);
3316 vm_page_unlock_queues();
3321 * The page queues and pmap must be locked.
3324 pmap_enter_locked(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot,
3327 struct l2_bucket *l2b = NULL;
3328 struct vm_page *opg;
3329 struct pv_entry *pve = NULL;
3330 pt_entry_t *ptep, npte, opte;
3335 PMAP_ASSERT_LOCKED(pmap);
3336 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
3337 if (va == vector_page) {
3338 pa = systempage.pv_pa;
3341 pa = VM_PAGE_TO_PHYS(m);
3343 if (prot & VM_PROT_WRITE)
3344 nflags |= PVF_WRITE;
3345 if (prot & VM_PROT_EXECUTE)
3348 nflags |= PVF_WIRED;
3349 PDEBUG(1, printf("pmap_enter: pmap = %08x, va = %08x, m = %08x, prot = %x, "
3350 "wired = %x\n", (uint32_t) pmap, va, (uint32_t) m, prot, wired));
3352 if (pmap == pmap_kernel()) {
3353 l2b = pmap_get_l2_bucket(pmap, va);
3355 l2b = pmap_grow_l2_bucket(pmap, va);
3357 l2b = pmap_alloc_l2_bucket(pmap, va);
3358 KASSERT(l2b != NULL,
3359 ("pmap_enter: failed to allocate l2 bucket"));
3360 ptep = &l2b->l2b_kva[l2pte_index(va)];
3367 * There is already a mapping at this address.
3368 * If the physical address is different, lookup the
3371 if (l2pte_pa(opte) != pa)
3372 opg = PHYS_TO_VM_PAGE(l2pte_pa(opte));
3378 if ((prot & (VM_PROT_ALL)) ||
3379 (!m || m->md.pvh_attrs & PVF_REF)) {
3381 * - The access type indicates that we don't need
3382 * to do referenced emulation.
3384 * - The physical page has already been referenced
3385 * so no need to re-do referenced emulation here.
3391 if (m && ((prot & VM_PROT_WRITE) != 0 ||
3392 (m->md.pvh_attrs & PVF_MOD))) {
3394 * This is a writable mapping, and the
3395 * page's mod state indicates it has
3396 * already been modified. Make it
3397 * writable from the outset.
3400 if (!(m->md.pvh_attrs & PVF_MOD))
3404 vm_page_flag_set(m, PG_REFERENCED);
3407 * Need to do page referenced emulation.
3409 npte |= L2_TYPE_INV;
3412 if (prot & VM_PROT_WRITE)
3413 npte |= L2_S_PROT_W;
3414 npte |= pte_l2_s_cache_mode;
3415 if (m && m == opg) {
3417 * We're changing the attrs of an existing mapping.
3420 simple_lock(&pg->mdpage.pvh_slock);
3422 oflags = pmap_modify_pv(m, pmap, va,
3423 PVF_WRITE | PVF_EXEC | PVF_WIRED |
3424 PVF_MOD | PVF_REF, nflags);
3426 simple_unlock(&pg->mdpage.pvh_slock);
3430 * We may need to flush the cache if we're
3433 if (pmap_is_current(pmap) &&
3434 (oflags & PVF_NC) == 0 &&
3435 (opte & L2_S_PROT_W) != 0 &&
3436 (prot & VM_PROT_WRITE) == 0)
3437 cpu_dcache_wb_range(va, PAGE_SIZE);
3440 * New mapping, or changing the backing page
3441 * of an existing mapping.
3445 * Replacing an existing mapping with a new one.
3446 * It is part of our managed memory so we
3447 * must remove it from the PV list
3450 simple_lock(&opg->mdpage.pvh_slock);
3452 pve = pmap_remove_pv(opg, pmap, va);
3453 if (m && (m->flags & (PG_UNMANAGED | PG_FICTITIOUS)) &&
3455 pmap_free_pv_entry(pve);
3457 !(m->flags & (PG_UNMANAGED | PG_FICTITIOUS)))
3458 pve = pmap_get_pv_entry();
3459 KASSERT(pve != NULL, ("No pv"));
3461 simple_unlock(&opg->mdpage.pvh_slock);
3463 oflags = pve->pv_flags;
3466 * If the old mapping was valid (ref/mod
3467 * emulation creates 'invalid' mappings
3468 * initially) then make sure to frob
3471 if ((oflags & PVF_NC) == 0 &&
3472 l2pte_valid(opte)) {
3473 if (PV_BEEN_EXECD(oflags)) {
3474 pmap_idcache_wbinv_range(pmap, va,
3477 if (PV_BEEN_REFD(oflags)) {
3478 pmap_dcache_wb_range(pmap, va,
3480 (oflags & PVF_WRITE) == 0);
3483 } else if (m && !(m->flags & (PG_UNMANAGED | PG_FICTITIOUS)))
3484 if ((pve = pmap_get_pv_entry()) == NULL) {
3485 panic("pmap_enter: no pv entries");
3487 if (m && !(m->flags & (PG_UNMANAGED | PG_FICTITIOUS))) {
3488 KASSERT(va < kmi.clean_sva || va >= kmi.clean_eva,
3489 ("pmap_enter: managed mapping within the clean submap"));
3490 pmap_enter_pv(m, pve, pmap, va, nflags);
3494 * Make sure userland mappings get the right permissions
3496 if (pmap != pmap_kernel() && va != vector_page) {
3497 npte |= L2_S_PROT_U;
3501 * Keep the stats up to date
3504 l2b->l2b_occupancy++;
3505 pmap->pm_stats.resident_count++;
3510 * If this is just a wiring change, the two PTEs will be
3511 * identical, so there's no need to update the page table.
3514 boolean_t is_cached = pmap_is_current(pmap);
3519 * We only need to frob the cache/tlb if this pmap
3523 if (L1_IDX(va) != L1_IDX(vector_page) &&
3524 l2pte_valid(npte)) {
3526 * This mapping is likely to be accessed as
3527 * soon as we return to userland. Fix up the
3528 * L1 entry to avoid taking another
3529 * page/domain fault.
3531 pd_entry_t *pl1pd, l1pd;
3533 pl1pd = &pmap->pm_l1->l1_kva[L1_IDX(va)];
3534 l1pd = l2b->l2b_phys | L1_C_DOM(pmap->pm_domain) |
3536 if (*pl1pd != l1pd) {
3543 if (PV_BEEN_EXECD(oflags))
3544 pmap_tlb_flushID_SE(pmap, va);
3545 else if (PV_BEEN_REFD(oflags))
3546 pmap_tlb_flushD_SE(pmap, va);
3550 pmap_vac_me_harder(m, pmap, va);
3555 * Maps a sequence of resident pages belonging to the same object.
3556 * The sequence begins with the given page m_start. This page is
3557 * mapped at the given virtual address start. Each subsequent page is
3558 * mapped at a virtual address that is offset from start by the same
3559 * amount as the page is offset from m_start within the object. The
3560 * last page in the sequence is the page with the largest offset from
3561 * m_start that can be mapped at a virtual address less than the given
3562 * virtual address end. Not every virtual page between start and end
3563 * is mapped; only those for which a resident page exists with the
3564 * corresponding offset from m_start are mapped.
3567 pmap_enter_object(pmap_t pmap, vm_offset_t start, vm_offset_t end,
3568 vm_page_t m_start, vm_prot_t prot)
3571 vm_pindex_t diff, psize;
3573 psize = atop(end - start);
3576 while (m != NULL && (diff = m->pindex - m_start->pindex) < psize) {
3577 pmap_enter_locked(pmap, start + ptoa(diff), m, prot &
3578 (VM_PROT_READ | VM_PROT_EXECUTE), FALSE);
3579 m = TAILQ_NEXT(m, listq);
3585 * this code makes some *MAJOR* assumptions:
3586 * 1. Current pmap & pmap exists.
3589 * 4. No page table pages.
3590 * but is *MUCH* faster than pmap_enter...
3594 pmap_enter_quick(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot,
3599 pmap_enter_locked(pmap, va, m, prot & (VM_PROT_READ | VM_PROT_EXECUTE),
3606 * Routine: pmap_change_wiring
3607 * Function: Change the wiring attribute for a map/virtual-address
3609 * In/out conditions:
3610 * The mapping must already exist in the pmap.
3613 pmap_change_wiring(pmap_t pmap, vm_offset_t va, boolean_t wired)
3615 struct l2_bucket *l2b;
3616 pt_entry_t *ptep, pte;
3619 vm_page_lock_queues();
3621 l2b = pmap_get_l2_bucket(pmap, va);
3622 KASSERT(l2b, ("No l2b bucket in pmap_change_wiring"));
3623 ptep = &l2b->l2b_kva[l2pte_index(va)];
3625 pg = PHYS_TO_VM_PAGE(l2pte_pa(pte));
3627 pmap_modify_pv(pg, pmap, va, PVF_WIRED, wired);
3628 vm_page_unlock_queues();
3634 * Copy the range specified by src_addr/len
3635 * from the source map to the range dst_addr/len
3636 * in the destination map.
3638 * This routine is only advisory and need not do anything.
3641 pmap_copy(pmap_t dst_pmap, pmap_t src_pmap, vm_offset_t dst_addr,
3642 vm_size_t len, vm_offset_t src_addr)
3648 * Routine: pmap_extract
3650 * Extract the physical page address associated
3651 * with the given map/virtual_address pair.
3654 pmap_extract(pmap_t pm, vm_offset_t va)
3656 struct l2_dtable *l2;
3657 pd_entry_t *pl1pd, l1pd;
3658 pt_entry_t *ptep, pte;
3662 pl1pd = &pm->pm_l1->l1_kva[l1idx];
3665 if (l1pte_section_p(l1pd)) {
3667 * These should only happen for pmap_kernel()
3669 KASSERT(pm == pmap_kernel(), ("huh"));
3670 pa = (l1pd & L1_S_FRAME) | (va & L1_S_OFFSET);
3673 * Note that we can't rely on the validity of the L1
3674 * descriptor as an indication that a mapping exists.
3675 * We have to look it up in the L2 dtable.
3677 l2 = pm->pm_l2[L2_IDX(l1idx)];
3680 (ptep = l2->l2_bucket[L2_BUCKET(l1idx)].l2b_kva) == NULL) {
3684 ptep = &ptep[l2pte_index(va)];
3690 switch (pte & L2_TYPE_MASK) {
3692 pa = (pte & L2_L_FRAME) | (va & L2_L_OFFSET);
3696 pa = (pte & L2_S_FRAME) | (va & L2_S_OFFSET);
3705 * Atomically extract and hold the physical page with the given
3706 * pmap and virtual address pair if that mapping permits the given
3711 pmap_extract_and_hold(pmap_t pmap, vm_offset_t va, vm_prot_t prot)
3713 struct l2_dtable *l2;
3715 pt_entry_t *ptep, pte;
3721 vm_page_lock_queues();
3723 l1pd = pmap->pm_l1->l1_kva[l1idx];
3724 if (l1pte_section_p(l1pd)) {
3726 * These should only happen for pmap_kernel()
3728 KASSERT(pmap == pmap_kernel(), ("huh"));
3729 pa = (l1pd & L1_S_FRAME) | (va & L1_S_OFFSET);
3730 if (l1pd & L1_S_PROT_W || (prot & VM_PROT_WRITE) == 0) {
3731 m = PHYS_TO_VM_PAGE(pa);
3737 * Note that we can't rely on the validity of the L1
3738 * descriptor as an indication that a mapping exists.
3739 * We have to look it up in the L2 dtable.
3741 l2 = pmap->pm_l2[L2_IDX(l1idx)];
3744 (ptep = l2->l2_bucket[L2_BUCKET(l1idx)].l2b_kva) == NULL) {
3746 vm_page_unlock_queues();
3750 ptep = &ptep[l2pte_index(va)];
3755 vm_page_unlock_queues();
3758 if (pte & L2_S_PROT_W || (prot & VM_PROT_WRITE) == 0) {
3759 switch (pte & L2_TYPE_MASK) {
3761 pa = (pte & L2_L_FRAME) | (va & L2_L_OFFSET);
3765 pa = (pte & L2_S_FRAME) | (va & L2_S_OFFSET);
3768 m = PHYS_TO_VM_PAGE(pa);
3774 vm_page_unlock_queues();
3779 * Initialize a preallocated and zeroed pmap structure,
3780 * such as one in a vmspace structure.
3784 pmap_pinit(pmap_t pmap)
3786 PDEBUG(1, printf("pmap_pinit: pmap = %08x\n", (uint32_t) pmap));
3788 PMAP_LOCK_INIT(pmap);
3789 pmap_alloc_l1(pmap);
3790 bzero(pmap->pm_l2, sizeof(pmap->pm_l2));
3793 pmap->pm_active = 0;
3795 TAILQ_INIT(&pmap->pm_pvlist);
3796 bzero(&pmap->pm_stats, sizeof pmap->pm_stats);
3797 pmap->pm_stats.resident_count = 1;
3798 if (vector_page < KERNBASE) {
3799 pmap_enter(pmap, vector_page, PHYS_TO_VM_PAGE(systempage.pv_pa),
3805 /***************************************************
3806 * page management routines.
3807 ***************************************************/
3811 pmap_free_pv_entry(pv_entry_t pv)
3814 uma_zfree(pvzone, pv);
3819 * get a new pv_entry, allocating a block from the system
3821 * the memory allocation is performed bypassing the malloc code
3822 * because of the possibility of allocations at interrupt time.
3825 pmap_get_pv_entry(void)
3827 pv_entry_t ret_value;
3830 if ((pv_entry_count > pv_entry_high_water) &&
3831 (pmap_pagedaemon_waken == 0)) {
3832 pmap_pagedaemon_waken = 1;
3833 wakeup (&vm_pages_needed);
3835 ret_value = uma_zalloc(pvzone, M_NOWAIT);
3841 * Remove the given range of addresses from the specified map.
3843 * It is assumed that the start and end are properly
3844 * rounded to the page size.
3846 #define PMAP_REMOVE_CLEAN_LIST_SIZE 3
3848 pmap_remove(pmap_t pm, vm_offset_t sva, vm_offset_t eva)
3850 struct l2_bucket *l2b;
3851 vm_offset_t next_bucket;
3853 u_int cleanlist_idx, total, cnt;
3857 } cleanlist[PMAP_REMOVE_CLEAN_LIST_SIZE];
3858 u_int mappings, is_exec, is_refd;
3863 * we lock in the pmap => pv_head direction
3866 PMAP_MAP_TO_HEAD_LOCK();
3867 pmap_acquire_pmap_lock(pm);
3870 vm_page_lock_queues();
3872 if (!pmap_is_current(pm)) {
3873 cleanlist_idx = PMAP_REMOVE_CLEAN_LIST_SIZE + 1;
3880 * Do one L2 bucket's worth at a time.
3882 next_bucket = L2_NEXT_BUCKET(sva);
3883 if (next_bucket > eva)
3886 l2b = pmap_get_l2_bucket(pm, sva);
3892 ptep = &l2b->l2b_kva[l2pte_index(sva)];
3895 while (sva < next_bucket) {
3904 * Nothing here, move along
3911 pm->pm_stats.resident_count--;
3917 * Update flags. In a number of circumstances,
3918 * we could cluster a lot of these and do a
3919 * number of sequential pages in one go.
3921 if ((pg = PHYS_TO_VM_PAGE(pa)) != NULL) {
3922 struct pv_entry *pve;
3924 simple_lock(&pg->mdpage.pvh_slock);
3926 pve = pmap_remove_pv(pg, pm, sva);
3929 simple_unlock(&pg->mdpage.pvh_slock);
3932 PV_BEEN_EXECD(pve->pv_flags);
3934 PV_BEEN_REFD(pve->pv_flags);
3935 pmap_free_pv_entry(pve);
3939 if (!l2pte_valid(pte)) {
3941 PTE_SYNC_CURRENT(pm, ptep);
3948 if (cleanlist_idx < PMAP_REMOVE_CLEAN_LIST_SIZE) {
3949 /* Add to the clean list. */
3950 cleanlist[cleanlist_idx].pte = ptep;
3951 cleanlist[cleanlist_idx].va =
3952 sva | (is_exec & 1);
3955 if (cleanlist_idx == PMAP_REMOVE_CLEAN_LIST_SIZE) {
3956 /* Nuke everything if needed. */
3957 pmap_idcache_wbinv_all(pm);
3958 pmap_tlb_flushID(pm);
3961 * Roll back the previous PTE list,
3962 * and zero out the current PTE.
3965 cnt < PMAP_REMOVE_CLEAN_LIST_SIZE; cnt++) {
3966 *cleanlist[cnt].pte = 0;
3976 pmap_tlb_flushID_SE(pm, sva);
3979 pmap_tlb_flushD_SE(pm, sva);
3988 * Deal with any left overs
3990 if (cleanlist_idx <= PMAP_REMOVE_CLEAN_LIST_SIZE) {
3991 total += cleanlist_idx;
3992 for (cnt = 0; cnt < cleanlist_idx; cnt++) {
3994 cleanlist[cnt].va & ~1;
3995 if (cleanlist[cnt].va & 1) {
3996 pmap_idcache_wbinv_range(pm,
3998 pmap_tlb_flushID_SE(pm, clva);
4000 pmap_dcache_wb_range(pm,
4001 clva, PAGE_SIZE, TRUE,
4003 pmap_tlb_flushD_SE(pm, clva);
4005 *cleanlist[cnt].pte = 0;
4006 PTE_SYNC_CURRENT(pm, cleanlist[cnt].pte);
4009 if (total <= PMAP_REMOVE_CLEAN_LIST_SIZE)
4013 * We are removing so much entries it's just
4014 * easier to flush the whole cache.
4016 cleanlist_idx = PMAP_REMOVE_CLEAN_LIST_SIZE + 1;
4017 pmap_idcache_wbinv_all(pm);
4022 pmap_free_l2_bucket(pm, l2b, mappings);
4025 vm_page_unlock_queues();
4030 pmap_release_pmap_lock(pm);
4031 PMAP_MAP_TO_HEAD_UNLOCK();
4041 * Zero a given physical page by mapping it at a page hook point.
4042 * In doing the zero page op, the page we zero is mapped cachable, as with
4043 * StrongARM accesses to non-cached pages are non-burst making writing
4044 * _any_ bulk data very slow.
4046 #if (ARM_MMU_GENERIC + ARM_MMU_SA1) != 0
4048 pmap_zero_page_generic(vm_paddr_t phys, int off, int size)
4051 struct vm_page *pg = PHYS_TO_VM_PAGE(phys);
4053 if (pg->md.pvh_list != NULL)
4054 panic("pmap_zero_page: page has mappings");
4058 _arm_bzero((void *)(phys + off), size, IS_PHYSICAL) == 0)
4064 * Hook in the page, zero it, and purge the cache for that
4065 * zeroed page. Invalidate the TLB as needed.
4067 *cdst_pte = L2_S_PROTO | phys |
4068 L2_S_PROT(PTE_KERNEL, VM_PROT_WRITE) | pte_l2_s_cache_mode;
4070 cpu_tlb_flushD_SE(cdstp);
4072 if (off || size != PAGE_SIZE)
4073 bzero((void *)(cdstp + off), size);
4077 cpu_dcache_wbinv_range(cdstp, PAGE_SIZE);
4079 #endif /* (ARM_MMU_GENERIC + ARM_MMU_SA1) != 0 */
4081 #if ARM_MMU_XSCALE == 1
4083 pmap_zero_page_xscale(vm_paddr_t phys, int off, int size)
4087 _arm_bzero((void *)(phys + off), size, IS_PHYSICAL) == 0)
4091 * Hook in the page, zero it, and purge the cache for that
4092 * zeroed page. Invalidate the TLB as needed.
4094 *cdst_pte = L2_S_PROTO | phys |
4095 L2_S_PROT(PTE_KERNEL, VM_PROT_WRITE) |
4096 L2_C | L2_XSCALE_T_TEX(TEX_XSCALE_X); /* mini-data */
4098 cpu_tlb_flushD_SE(cdstp);
4100 if (off || size != PAGE_SIZE)
4101 bzero((void *)(cdstp + off), size);
4105 xscale_cache_clean_minidata();
4109 * Change the PTEs for the specified kernel mappings such that they
4110 * will use the mini data cache instead of the main data cache.
4113 pmap_use_minicache(vm_offset_t va, vm_size_t size)
4115 struct l2_bucket *l2b;
4116 pt_entry_t *ptep, *sptep, pte;
4117 vm_offset_t next_bucket, eva;
4120 if (xscale_use_minidata == 0)
4127 next_bucket = L2_NEXT_BUCKET(va);
4128 if (next_bucket > eva)
4131 l2b = pmap_get_l2_bucket(pmap_kernel(), va);
4133 sptep = ptep = &l2b->l2b_kva[l2pte_index(va)];
4135 while (va < next_bucket) {
4137 if (!l2pte_minidata(pte)) {
4138 cpu_dcache_wbinv_range(va, PAGE_SIZE);
4139 cpu_tlb_flushD_SE(va);
4140 *ptep = pte & ~L2_B;
4145 PTE_SYNC_RANGE(sptep, (u_int)(ptep - sptep));
4149 #endif /* ARM_MMU_XSCALE == 1 */
4152 * pmap_zero_page zeros the specified hardware page by mapping
4153 * the page into KVM and using bzero to clear its contents.
4156 pmap_zero_page(vm_page_t m)
4158 pmap_zero_page_func(VM_PAGE_TO_PHYS(m), 0, PAGE_SIZE);
4163 * pmap_zero_page_area zeros the specified hardware page by mapping
4164 * the page into KVM and using bzero to clear its contents.
4166 * off and size may not cover an area beyond a single hardware page.
4169 pmap_zero_page_area(vm_page_t m, int off, int size)
4172 pmap_zero_page_func(VM_PAGE_TO_PHYS(m), off, size);
4177 * pmap_zero_page_idle zeros the specified hardware page by mapping
4178 * the page into KVM and using bzero to clear its contents. This
4179 * is intended to be called from the vm_pagezero process only and
4183 pmap_zero_page_idle(vm_page_t m)
4193 * This is a local function used to work out the best strategy to clean
4194 * a single page referenced by its entry in the PV table. It's used by
4195 * pmap_copy_page, pmap_zero page and maybe some others later on.
4197 * Its policy is effectively:
4198 * o If there are no mappings, we don't bother doing anything with the cache.
4199 * o If there is one mapping, we clean just that page.
4200 * o If there are multiple mappings, we clean the entire cache.
4202 * So that some functions can be further optimised, it returns 0 if it didn't
4203 * clean the entire cache, or 1 if it did.
4205 * XXX One bug in this routine is that if the pv_entry has a single page
4206 * mapped at 0x00000000 a whole cache clean will be performed rather than
4207 * just the 1 page. Since this should not occur in everyday use and if it does
4208 * it will just result in not the most efficient clean for the page.
4211 pmap_clean_page(struct pv_entry *pv, boolean_t is_src)
4213 pmap_t pm, pm_to_clean = NULL;
4214 struct pv_entry *npv;
4215 u_int cache_needs_cleaning = 0;
4217 vm_offset_t page_to_clean = 0;
4220 /* nothing mapped in so nothing to flush */
4225 * Since we flush the cache each time we change to a different
4226 * user vmspace, we only need to flush the page if it is in the
4230 pm = vmspace_pmap(curproc->p_vmspace);
4234 for (npv = pv; npv; npv = TAILQ_NEXT(npv, pv_list)) {
4235 if (npv->pv_pmap == pmap_kernel() || npv->pv_pmap == pm) {
4236 flags |= npv->pv_flags;
4238 * The page is mapped non-cacheable in
4239 * this map. No need to flush the cache.
4241 if (npv->pv_flags & PVF_NC) {
4243 if (cache_needs_cleaning)
4244 panic("pmap_clean_page: "
4245 "cache inconsistency");
4248 } else if (is_src && (npv->pv_flags & PVF_WRITE) == 0)
4250 if (cache_needs_cleaning) {
4254 page_to_clean = npv->pv_va;
4255 pm_to_clean = npv->pv_pmap;
4257 cache_needs_cleaning = 1;
4260 if (page_to_clean) {
4261 if (PV_BEEN_EXECD(flags))
4262 pmap_idcache_wbinv_range(pm_to_clean, page_to_clean,
4265 pmap_dcache_wb_range(pm_to_clean, page_to_clean,
4266 PAGE_SIZE, !is_src, (flags & PVF_WRITE) == 0);
4267 } else if (cache_needs_cleaning) {
4268 if (PV_BEEN_EXECD(flags))
4269 pmap_idcache_wbinv_all(pm);
4271 pmap_dcache_wbinv_all(pm);
4279 * pmap_copy_page copies the specified (machine independent)
4280 * page by mapping the page into virtual memory and using
4281 * bcopy to copy the page, one machine dependent page at a
4288 * Copy one physical page into another, by mapping the pages into
4289 * hook points. The same comment regarding cachability as in
4290 * pmap_zero_page also applies here.
4292 #if (ARM_MMU_GENERIC + ARM_MMU_SA1) != 0
4294 pmap_copy_page_generic(vm_paddr_t src, vm_paddr_t dst)
4297 struct vm_page *src_pg = PHYS_TO_VM_PAGE(src);
4300 struct vm_page *dst_pg = PHYS_TO_VM_PAGE(dst);
4302 if (dst_pg->md.pvh_list != NULL)
4303 panic("pmap_copy_page: dst page has mappings");
4308 * Clean the source page. Hold the source page's lock for
4309 * the duration of the copy so that no other mappings can
4310 * be created while we have a potentially aliased mapping.
4313 mtx_lock(&src_pg->md.pvh_mtx);
4317 * XXX: Not needed while we call cpu_dcache_wbinv_all() in
4320 (void) pmap_clean_page(TAILQ_FIRST(&src_pg->md.pv_list), TRUE);
4323 * Map the pages into the page hook points, copy them, and purge
4324 * the cache for the appropriate page. Invalidate the TLB
4328 *csrc_pte = L2_S_PROTO | src |
4329 L2_S_PROT(PTE_KERNEL, VM_PROT_READ) | pte_l2_s_cache_mode;
4331 *cdst_pte = L2_S_PROTO | dst |
4332 L2_S_PROT(PTE_KERNEL, VM_PROT_WRITE) | pte_l2_s_cache_mode;
4334 cpu_tlb_flushD_SE(csrcp);
4335 cpu_tlb_flushD_SE(cdstp);
4337 bcopy_page(csrcp, cdstp);
4339 cpu_dcache_inv_range(csrcp, PAGE_SIZE);
4341 mtx_lock(&src_pg->md.pvh_mtx);
4343 cpu_dcache_wbinv_range(cdstp, PAGE_SIZE);
4345 #endif /* (ARM_MMU_GENERIC + ARM_MMU_SA1) != 0 */
4347 #if ARM_MMU_XSCALE == 1
4349 pmap_copy_page_xscale(vm_paddr_t src, vm_paddr_t dst)
4352 /* XXX: Only needed for pmap_clean_page(), which is commented out. */
4353 struct vm_page *src_pg = PHYS_TO_VM_PAGE(src);
4356 struct vm_page *dst_pg = PHYS_TO_VM_PAGE(dst);
4358 if (dst_pg->md.pvh_list != NULL)
4359 panic("pmap_copy_page: dst page has mappings");
4364 * Clean the source page. Hold the source page's lock for
4365 * the duration of the copy so that no other mappings can
4366 * be created while we have a potentially aliased mapping.
4370 * XXX: Not needed while we call cpu_dcache_wbinv_all() in
4373 (void) pmap_clean_page(TAILQ_FIRST(&src_pg->md.pv_list), TRUE);
4376 * Map the pages into the page hook points, copy them, and purge
4377 * the cache for the appropriate page. Invalidate the TLB
4381 *csrc_pte = L2_S_PROTO | src |
4382 L2_S_PROT(PTE_KERNEL, VM_PROT_READ) |
4383 L2_C | L2_XSCALE_T_TEX(TEX_XSCALE_X); /* mini-data */
4385 *cdst_pte = L2_S_PROTO | dst |
4386 L2_S_PROT(PTE_KERNEL, VM_PROT_WRITE) |
4387 L2_C | L2_XSCALE_T_TEX(TEX_XSCALE_X); /* mini-data */
4389 cpu_tlb_flushD_SE(csrcp);
4390 cpu_tlb_flushD_SE(cdstp);
4392 bcopy_page(csrcp, cdstp);
4394 xscale_cache_clean_minidata();
4396 #endif /* ARM_MMU_XSCALE == 1 */
4399 pmap_copy_page(vm_page_t src, vm_page_t dst)
4401 cpu_dcache_wbinv_all();
4403 _arm_memcpy((void *)VM_PAGE_TO_PHYS(dst),
4404 (void *)VM_PAGE_TO_PHYS(src), PAGE_SIZE, IS_PHYSICAL) == 0)
4406 pmap_copy_page_func(VM_PAGE_TO_PHYS(src), VM_PAGE_TO_PHYS(dst));
4413 * this routine returns true if a physical page resides
4414 * in the given pmap.
4417 pmap_page_exists_quick(pmap_t pmap, vm_page_t m)
4423 if (m->flags & PG_FICTITIOUS)
4429 * Not found, check current mappings returning immediately
4431 for (pv = TAILQ_FIRST(&m->md.pv_list);
4433 pv = TAILQ_NEXT(pv, pv_list)) {
4434 if (pv->pv_pmap == pmap) {
4448 * pmap_ts_referenced:
4450 * Return the count of reference bits for a page, clearing all of them.
4453 pmap_ts_referenced(vm_page_t m)
4455 return (pmap_clearbit(m, PVF_REF));
4460 pmap_is_modified(vm_page_t m)
4463 if (m->md.pvh_attrs & PVF_MOD)
4471 * Clear the modify bits on the specified physical page.
4474 pmap_clear_modify(vm_page_t m)
4477 if (m->md.pvh_attrs & PVF_MOD)
4478 pmap_clearbit(m, PVF_MOD);
4483 * pmap_clear_reference:
4485 * Clear the reference bit on the specified physical page.
4488 pmap_clear_reference(vm_page_t m)
4491 if (m->md.pvh_attrs & PVF_REF)
4492 pmap_clearbit(m, PVF_REF);
4497 * perform the pmap work for mincore
4500 pmap_mincore(pmap_t pmap, vm_offset_t addr)
4502 printf("pmap_mincore()\n");
4509 pmap_addr_hint(vm_object_t obj, vm_offset_t addr, vm_size_t size)
4517 * Map a set of physical memory pages into the kernel virtual
4518 * address space. Return a pointer to where it is mapped. This
4519 * routine is intended to be used for mapping device memory,
4523 pmap_mapdev(vm_offset_t pa, vm_size_t size)
4525 vm_offset_t va, tmpva, offset;
4527 offset = pa & PAGE_MASK;
4528 size = roundup(size, PAGE_SIZE);
4532 va = kmem_alloc_nofault(kernel_map, size);
4534 panic("pmap_mapdev: Couldn't alloc kernel virtual memory");
4535 for (tmpva = va; size > 0;) {
4536 pmap_kenter_internal(tmpva, pa, 0);
4542 return ((void *)(va + offset));
4545 #define BOOTSTRAP_DEBUG
4550 * Create a single section mapping.
4553 pmap_map_section(vm_offset_t l1pt, vm_offset_t va, vm_offset_t pa,
4554 int prot, int cache)
4556 pd_entry_t *pde = (pd_entry_t *) l1pt;
4559 KASSERT(((va | pa) & L1_S_OFFSET) == 0, ("ouin2"));
4568 fl = pte_l1_s_cache_mode;
4572 fl = pte_l1_s_cache_mode_pt;
4576 pde[va >> L1_S_SHIFT] = L1_S_PROTO | pa |
4577 L1_S_PROT(PTE_KERNEL, prot) | fl | L1_S_DOM(PMAP_DOMAIN_KERNEL);
4578 PTE_SYNC(&pde[va >> L1_S_SHIFT]);
4585 * Link the L2 page table specified by "pa" into the L1
4586 * page table at the slot for "va".
4589 pmap_link_l2pt(vm_offset_t l1pt, vm_offset_t va, struct pv_addr *l2pv)
4591 pd_entry_t *pde = (pd_entry_t *) l1pt, proto;
4592 u_int slot = va >> L1_S_SHIFT;
4594 proto = L1_S_DOM(PMAP_DOMAIN_KERNEL) | L1_C_PROTO;
4596 pde[slot + 0] = proto | (l2pv->pv_pa + 0x000);
4597 PTE_SYNC(&pde[slot]);
4599 SLIST_INSERT_HEAD(&kernel_pt_list, l2pv, pv_list);
4607 * Create a single page mapping.
4610 pmap_map_entry(vm_offset_t l1pt, vm_offset_t va, vm_offset_t pa, int prot,
4613 pd_entry_t *pde = (pd_entry_t *) l1pt;
4617 KASSERT(((va | pa) & PAGE_MASK) == 0, ("ouin"));
4626 fl = pte_l2_s_cache_mode;
4630 fl = pte_l2_s_cache_mode_pt;
4634 if ((pde[va >> L1_S_SHIFT] & L1_TYPE_MASK) != L1_TYPE_C)
4635 panic("pmap_map_entry: no L2 table for VA 0x%08x", va);
4637 pte = (pt_entry_t *) kernel_pt_lookup(pde[L1_IDX(va)] & L1_C_ADDR_MASK);
4640 panic("pmap_map_entry: can't find L2 table for VA 0x%08x", va);
4642 pte[l2pte_index(va)] =
4643 L2_S_PROTO | pa | L2_S_PROT(PTE_KERNEL, prot) | fl;
4644 PTE_SYNC(&pte[l2pte_index(va)]);
4650 * Map a chunk of memory using the most efficient mappings
4651 * possible (section. large page, small page) into the
4652 * provided L1 and L2 tables at the specified virtual address.
4655 pmap_map_chunk(vm_offset_t l1pt, vm_offset_t va, vm_offset_t pa,
4656 vm_size_t size, int prot, int cache)
4658 pd_entry_t *pde = (pd_entry_t *) l1pt;
4659 pt_entry_t *pte, f1, f2s, f2l;
4663 resid = (size + (PAGE_SIZE - 1)) & ~(PAGE_SIZE - 1);
4666 panic("pmap_map_chunk: no L1 table provided");
4668 #ifdef VERBOSE_INIT_ARM
4669 printf("pmap_map_chunk: pa=0x%x va=0x%x size=0x%x resid=0x%x "
4670 "prot=0x%x cache=%d\n", pa, va, size, resid, prot, cache);
4682 f1 = pte_l1_s_cache_mode;
4683 f2l = pte_l2_l_cache_mode;
4684 f2s = pte_l2_s_cache_mode;
4688 f1 = pte_l1_s_cache_mode_pt;
4689 f2l = pte_l2_l_cache_mode_pt;
4690 f2s = pte_l2_s_cache_mode_pt;
4697 /* See if we can use a section mapping. */
4698 if (L1_S_MAPPABLE_P(va, pa, resid)) {
4699 #ifdef VERBOSE_INIT_ARM
4702 pde[va >> L1_S_SHIFT] = L1_S_PROTO | pa |
4703 L1_S_PROT(PTE_KERNEL, prot) | f1 |
4704 L1_S_DOM(PMAP_DOMAIN_KERNEL);
4705 PTE_SYNC(&pde[va >> L1_S_SHIFT]);
4713 * Ok, we're going to use an L2 table. Make sure
4714 * one is actually in the corresponding L1 slot
4715 * for the current VA.
4717 if ((pde[va >> L1_S_SHIFT] & L1_TYPE_MASK) != L1_TYPE_C)
4718 panic("pmap_map_chunk: no L2 table for VA 0x%08x", va);
4720 pte = (pt_entry_t *) kernel_pt_lookup(
4721 pde[L1_IDX(va)] & L1_C_ADDR_MASK);
4723 panic("pmap_map_chunk: can't find L2 table for VA"
4725 /* See if we can use a L2 large page mapping. */
4726 if (L2_L_MAPPABLE_P(va, pa, resid)) {
4727 #ifdef VERBOSE_INIT_ARM
4730 for (i = 0; i < 16; i++) {
4731 pte[l2pte_index(va) + i] =
4733 L2_L_PROT(PTE_KERNEL, prot) | f2l;
4734 PTE_SYNC(&pte[l2pte_index(va) + i]);
4742 /* Use a small page mapping. */
4743 #ifdef VERBOSE_INIT_ARM
4746 pte[l2pte_index(va)] =
4747 L2_S_PROTO | pa | L2_S_PROT(PTE_KERNEL, prot) | f2s;
4748 PTE_SYNC(&pte[l2pte_index(va)]);
4753 #ifdef VERBOSE_INIT_ARM
4760 /********************** Static device map routines ***************************/
4762 static const struct pmap_devmap *pmap_devmap_table;
4765 * Register the devmap table. This is provided in case early console
4766 * initialization needs to register mappings created by bootstrap code
4767 * before pmap_devmap_bootstrap() is called.
4770 pmap_devmap_register(const struct pmap_devmap *table)
4773 pmap_devmap_table = table;
4777 * Map all of the static regions in the devmap table, and remember
4778 * the devmap table so other parts of the kernel can look up entries
4782 pmap_devmap_bootstrap(vm_offset_t l1pt, const struct pmap_devmap *table)
4786 pmap_devmap_table = table;
4788 for (i = 0; pmap_devmap_table[i].pd_size != 0; i++) {
4789 #ifdef VERBOSE_INIT_ARM
4790 printf("devmap: %08x -> %08x @ %08x\n",
4791 pmap_devmap_table[i].pd_pa,
4792 pmap_devmap_table[i].pd_pa +
4793 pmap_devmap_table[i].pd_size - 1,
4794 pmap_devmap_table[i].pd_va);
4796 pmap_map_chunk(l1pt, pmap_devmap_table[i].pd_va,
4797 pmap_devmap_table[i].pd_pa,
4798 pmap_devmap_table[i].pd_size,
4799 pmap_devmap_table[i].pd_prot,
4800 pmap_devmap_table[i].pd_cache);
4804 const struct pmap_devmap *
4805 pmap_devmap_find_pa(vm_paddr_t pa, vm_size_t size)
4809 if (pmap_devmap_table == NULL)
4812 for (i = 0; pmap_devmap_table[i].pd_size != 0; i++) {
4813 if (pa >= pmap_devmap_table[i].pd_pa &&
4814 pa + size <= pmap_devmap_table[i].pd_pa +
4815 pmap_devmap_table[i].pd_size)
4816 return (&pmap_devmap_table[i]);
4822 const struct pmap_devmap *
4823 pmap_devmap_find_va(vm_offset_t va, vm_size_t size)
4827 if (pmap_devmap_table == NULL)
4830 for (i = 0; pmap_devmap_table[i].pd_size != 0; i++) {
4831 if (va >= pmap_devmap_table[i].pd_va &&
4832 va + size <= pmap_devmap_table[i].pd_va +
4833 pmap_devmap_table[i].pd_size)
4834 return (&pmap_devmap_table[i]);