2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD AND BSD-4-Clause
4 * Copyright (c) 2001 The NetBSD Foundation, Inc.
7 * This code is derived from software contributed to The NetBSD Foundation
8 * by Matt Thomas <matt@3am-software.com> of Allegro Networks, Inc.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
19 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 * POSSIBILITY OF SUCH DAMAGE.
32 * Copyright (C) 1995, 1996 Wolfgang Solfrank.
33 * Copyright (C) 1995, 1996 TooLs GmbH.
34 * All rights reserved.
36 * Redistribution and use in source and binary forms, with or without
37 * modification, are permitted provided that the following conditions
39 * 1. Redistributions of source code must retain the above copyright
40 * notice, this list of conditions and the following disclaimer.
41 * 2. Redistributions in binary form must reproduce the above copyright
42 * notice, this list of conditions and the following disclaimer in the
43 * documentation and/or other materials provided with the distribution.
44 * 3. All advertising materials mentioning features or use of this software
45 * must display the following acknowledgement:
46 * This product includes software developed by TooLs GmbH.
47 * 4. The name of TooLs GmbH may not be used to endorse or promote products
48 * derived from this software without specific prior written permission.
50 * THIS SOFTWARE IS PROVIDED BY TOOLS GMBH ``AS IS'' AND ANY EXPRESS OR
51 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
52 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
53 * IN NO EVENT SHALL TOOLS GMBH BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
54 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
55 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
56 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
57 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
58 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
59 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
61 * $NetBSD: pmap.c,v 1.28 2000/03/26 20:42:36 kleink Exp $
64 * Copyright (C) 2001 Benno Rice.
65 * All rights reserved.
67 * Redistribution and use in source and binary forms, with or without
68 * modification, are permitted provided that the following conditions
70 * 1. Redistributions of source code must retain the above copyright
71 * notice, this list of conditions and the following disclaimer.
72 * 2. Redistributions in binary form must reproduce the above copyright
73 * notice, this list of conditions and the following disclaimer in the
74 * documentation and/or other materials provided with the distribution.
76 * THIS SOFTWARE IS PROVIDED BY Benno Rice ``AS IS'' AND ANY EXPRESS OR
77 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
78 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
79 * IN NO EVENT SHALL TOOLS GMBH BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
80 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
81 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
82 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
83 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
84 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
85 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
88 #include <sys/cdefs.h>
89 __FBSDID("$FreeBSD$");
92 * Manages physical address maps.
94 * Since the information managed by this module is also stored by the
95 * logical address mapping module, this module may throw away valid virtual
96 * to physical mappings at almost any time. However, invalidations of
97 * mappings must be done as requested.
99 * In order to cope with hardware architectures which make virtual to
100 * physical map invalidates expensive, this module may delay invalidate
101 * reduced protection operations until such time as they are actually
102 * necessary. This module is given full information as to which processors
103 * are currently using which maps, and to when physical maps must be made
107 #include "opt_kstack_pages.h"
109 #include <sys/param.h>
110 #include <sys/kernel.h>
111 #include <sys/conf.h>
112 #include <sys/queue.h>
113 #include <sys/cpuset.h>
114 #include <sys/kerneldump.h>
116 #include <sys/lock.h>
117 #include <sys/msgbuf.h>
118 #include <sys/mutex.h>
119 #include <sys/proc.h>
120 #include <sys/rwlock.h>
121 #include <sys/sched.h>
122 #include <sys/sysctl.h>
123 #include <sys/systm.h>
124 #include <sys/vmmeter.h>
126 #include <dev/ofw/openfirm.h>
129 #include <vm/vm_param.h>
130 #include <vm/vm_kern.h>
131 #include <vm/vm_page.h>
132 #include <vm/vm_map.h>
133 #include <vm/vm_object.h>
134 #include <vm/vm_extern.h>
135 #include <vm/vm_page.h>
136 #include <vm/vm_phys.h>
137 #include <vm/vm_pageout.h>
140 #include <machine/cpu.h>
141 #include <machine/platform.h>
142 #include <machine/bat.h>
143 #include <machine/frame.h>
144 #include <machine/md_var.h>
145 #include <machine/psl.h>
146 #include <machine/pte.h>
147 #include <machine/smp.h>
148 #include <machine/sr.h>
149 #include <machine/mmuvar.h>
150 #include <machine/trap.h>
156 #define TODO panic("%s: not implemented", __func__);
158 #define VSID_MAKE(sr, hash) ((sr) | (((hash) & 0xfffff) << 4))
159 #define VSID_TO_SR(vsid) ((vsid) & 0xf)
160 #define VSID_TO_HASH(vsid) (((vsid) >> 4) & 0xfffff)
169 extern unsigned char _etext[];
170 extern unsigned char _end[];
173 * Map of physical memory regions.
175 static struct mem_region *regions;
176 static struct mem_region *pregions;
177 static u_int phys_avail_count;
178 static int regions_sz, pregions_sz;
179 static struct ofw_map *translations;
182 * Lock for the pteg and pvo tables.
184 struct mtx moea_table_mutex;
185 struct mtx moea_vsid_mutex;
187 /* tlbie instruction synchronization */
188 static struct mtx tlbie_mtx;
193 static struct pteg *moea_pteg_table;
194 u_int moea_pteg_count;
195 u_int moea_pteg_mask;
200 struct pvo_head *moea_pvo_table; /* pvo entries by pteg index */
201 struct pvo_head moea_pvo_kunmanaged =
202 LIST_HEAD_INITIALIZER(moea_pvo_kunmanaged); /* list of unmanaged pages */
204 static struct rwlock_padalign pvh_global_lock;
206 uma_zone_t moea_upvo_zone; /* zone for pvo entries for unmanaged pages */
207 uma_zone_t moea_mpvo_zone; /* zone for pvo entries for managed pages */
209 #define BPVO_POOL_SIZE 32768
210 static struct pvo_entry *moea_bpvo_pool;
211 static int moea_bpvo_pool_index = 0;
213 #define VSID_NBPW (sizeof(u_int32_t) * 8)
214 static u_int moea_vsid_bitmap[NPMAPS / VSID_NBPW];
216 static boolean_t moea_initialized = FALSE;
221 u_int moea_pte_valid = 0;
222 u_int moea_pte_overflow = 0;
223 u_int moea_pte_replacements = 0;
224 u_int moea_pvo_entries = 0;
225 u_int moea_pvo_enter_calls = 0;
226 u_int moea_pvo_remove_calls = 0;
227 u_int moea_pte_spills = 0;
228 SYSCTL_INT(_machdep, OID_AUTO, moea_pte_valid, CTLFLAG_RD, &moea_pte_valid,
230 SYSCTL_INT(_machdep, OID_AUTO, moea_pte_overflow, CTLFLAG_RD,
231 &moea_pte_overflow, 0, "");
232 SYSCTL_INT(_machdep, OID_AUTO, moea_pte_replacements, CTLFLAG_RD,
233 &moea_pte_replacements, 0, "");
234 SYSCTL_INT(_machdep, OID_AUTO, moea_pvo_entries, CTLFLAG_RD, &moea_pvo_entries,
236 SYSCTL_INT(_machdep, OID_AUTO, moea_pvo_enter_calls, CTLFLAG_RD,
237 &moea_pvo_enter_calls, 0, "");
238 SYSCTL_INT(_machdep, OID_AUTO, moea_pvo_remove_calls, CTLFLAG_RD,
239 &moea_pvo_remove_calls, 0, "");
240 SYSCTL_INT(_machdep, OID_AUTO, moea_pte_spills, CTLFLAG_RD,
241 &moea_pte_spills, 0, "");
244 * Allocate physical memory for use in moea_bootstrap.
246 static vm_offset_t moea_bootstrap_alloc(vm_size_t, u_int);
251 static int moea_pte_insert(u_int, struct pte *);
256 static int moea_pvo_enter(pmap_t, uma_zone_t, struct pvo_head *,
257 vm_offset_t, vm_paddr_t, u_int, int);
258 static void moea_pvo_remove(struct pvo_entry *, int);
259 static struct pvo_entry *moea_pvo_find_va(pmap_t, vm_offset_t, int *);
260 static struct pte *moea_pvo_to_pte(const struct pvo_entry *, int);
265 static int moea_enter_locked(pmap_t, vm_offset_t, vm_page_t,
266 vm_prot_t, u_int, int8_t);
267 static void moea_syncicache(vm_paddr_t, vm_size_t);
268 static boolean_t moea_query_bit(vm_page_t, int);
269 static u_int moea_clear_bit(vm_page_t, int);
270 static void moea_kremove(mmu_t, vm_offset_t);
271 int moea_pte_spill(vm_offset_t);
274 * Kernel MMU interface
276 void moea_clear_modify(mmu_t, vm_page_t);
277 void moea_copy_page(mmu_t, vm_page_t, vm_page_t);
278 void moea_copy_pages(mmu_t mmu, vm_page_t *ma, vm_offset_t a_offset,
279 vm_page_t *mb, vm_offset_t b_offset, int xfersize);
280 int moea_enter(mmu_t, pmap_t, vm_offset_t, vm_page_t, vm_prot_t, u_int,
282 void moea_enter_object(mmu_t, pmap_t, vm_offset_t, vm_offset_t, vm_page_t,
284 void moea_enter_quick(mmu_t, pmap_t, vm_offset_t, vm_page_t, vm_prot_t);
285 vm_paddr_t moea_extract(mmu_t, pmap_t, vm_offset_t);
286 vm_page_t moea_extract_and_hold(mmu_t, pmap_t, vm_offset_t, vm_prot_t);
287 void moea_init(mmu_t);
288 boolean_t moea_is_modified(mmu_t, vm_page_t);
289 boolean_t moea_is_prefaultable(mmu_t, pmap_t, vm_offset_t);
290 boolean_t moea_is_referenced(mmu_t, vm_page_t);
291 int moea_ts_referenced(mmu_t, vm_page_t);
292 vm_offset_t moea_map(mmu_t, vm_offset_t *, vm_paddr_t, vm_paddr_t, int);
293 boolean_t moea_page_exists_quick(mmu_t, pmap_t, vm_page_t);
294 void moea_page_init(mmu_t, vm_page_t);
295 int moea_page_wired_mappings(mmu_t, vm_page_t);
296 void moea_pinit(mmu_t, pmap_t);
297 void moea_pinit0(mmu_t, pmap_t);
298 void moea_protect(mmu_t, pmap_t, vm_offset_t, vm_offset_t, vm_prot_t);
299 void moea_qenter(mmu_t, vm_offset_t, vm_page_t *, int);
300 void moea_qremove(mmu_t, vm_offset_t, int);
301 void moea_release(mmu_t, pmap_t);
302 void moea_remove(mmu_t, pmap_t, vm_offset_t, vm_offset_t);
303 void moea_remove_all(mmu_t, vm_page_t);
304 void moea_remove_write(mmu_t, vm_page_t);
305 void moea_unwire(mmu_t, pmap_t, vm_offset_t, vm_offset_t);
306 void moea_zero_page(mmu_t, vm_page_t);
307 void moea_zero_page_area(mmu_t, vm_page_t, int, int);
308 void moea_activate(mmu_t, struct thread *);
309 void moea_deactivate(mmu_t, struct thread *);
310 void moea_cpu_bootstrap(mmu_t, int);
311 void moea_bootstrap(mmu_t, vm_offset_t, vm_offset_t);
312 void *moea_mapdev(mmu_t, vm_paddr_t, vm_size_t);
313 void *moea_mapdev_attr(mmu_t, vm_paddr_t, vm_size_t, vm_memattr_t);
314 void moea_unmapdev(mmu_t, vm_offset_t, vm_size_t);
315 vm_paddr_t moea_kextract(mmu_t, vm_offset_t);
316 void moea_kenter_attr(mmu_t, vm_offset_t, vm_paddr_t, vm_memattr_t);
317 void moea_kenter(mmu_t, vm_offset_t, vm_paddr_t);
318 void moea_page_set_memattr(mmu_t mmu, vm_page_t m, vm_memattr_t ma);
319 boolean_t moea_dev_direct_mapped(mmu_t, vm_paddr_t, vm_size_t);
320 static void moea_sync_icache(mmu_t, pmap_t, vm_offset_t, vm_size_t);
321 void moea_dumpsys_map(mmu_t mmu, vm_paddr_t pa, size_t sz, void **va);
322 void moea_scan_init(mmu_t mmu);
323 vm_offset_t moea_quick_enter_page(mmu_t mmu, vm_page_t m);
324 void moea_quick_remove_page(mmu_t mmu, vm_offset_t addr);
325 boolean_t moea_page_is_mapped(mmu_t mmu, vm_page_t m);
326 static int moea_map_user_ptr(mmu_t mmu, pmap_t pm,
327 volatile const void *uaddr, void **kaddr, size_t ulen, size_t *klen);
328 static int moea_decode_kernel_ptr(mmu_t mmu, vm_offset_t addr,
329 int *is_user, vm_offset_t *decoded_addr);
332 static mmu_method_t moea_methods[] = {
333 MMUMETHOD(mmu_clear_modify, moea_clear_modify),
334 MMUMETHOD(mmu_copy_page, moea_copy_page),
335 MMUMETHOD(mmu_copy_pages, moea_copy_pages),
336 MMUMETHOD(mmu_enter, moea_enter),
337 MMUMETHOD(mmu_enter_object, moea_enter_object),
338 MMUMETHOD(mmu_enter_quick, moea_enter_quick),
339 MMUMETHOD(mmu_extract, moea_extract),
340 MMUMETHOD(mmu_extract_and_hold, moea_extract_and_hold),
341 MMUMETHOD(mmu_init, moea_init),
342 MMUMETHOD(mmu_is_modified, moea_is_modified),
343 MMUMETHOD(mmu_is_prefaultable, moea_is_prefaultable),
344 MMUMETHOD(mmu_is_referenced, moea_is_referenced),
345 MMUMETHOD(mmu_ts_referenced, moea_ts_referenced),
346 MMUMETHOD(mmu_map, moea_map),
347 MMUMETHOD(mmu_page_exists_quick,moea_page_exists_quick),
348 MMUMETHOD(mmu_page_init, moea_page_init),
349 MMUMETHOD(mmu_page_wired_mappings,moea_page_wired_mappings),
350 MMUMETHOD(mmu_pinit, moea_pinit),
351 MMUMETHOD(mmu_pinit0, moea_pinit0),
352 MMUMETHOD(mmu_protect, moea_protect),
353 MMUMETHOD(mmu_qenter, moea_qenter),
354 MMUMETHOD(mmu_qremove, moea_qremove),
355 MMUMETHOD(mmu_release, moea_release),
356 MMUMETHOD(mmu_remove, moea_remove),
357 MMUMETHOD(mmu_remove_all, moea_remove_all),
358 MMUMETHOD(mmu_remove_write, moea_remove_write),
359 MMUMETHOD(mmu_sync_icache, moea_sync_icache),
360 MMUMETHOD(mmu_unwire, moea_unwire),
361 MMUMETHOD(mmu_zero_page, moea_zero_page),
362 MMUMETHOD(mmu_zero_page_area, moea_zero_page_area),
363 MMUMETHOD(mmu_activate, moea_activate),
364 MMUMETHOD(mmu_deactivate, moea_deactivate),
365 MMUMETHOD(mmu_page_set_memattr, moea_page_set_memattr),
366 MMUMETHOD(mmu_quick_enter_page, moea_quick_enter_page),
367 MMUMETHOD(mmu_quick_remove_page, moea_quick_remove_page),
368 MMUMETHOD(mmu_page_is_mapped, moea_page_is_mapped),
370 /* Internal interfaces */
371 MMUMETHOD(mmu_bootstrap, moea_bootstrap),
372 MMUMETHOD(mmu_cpu_bootstrap, moea_cpu_bootstrap),
373 MMUMETHOD(mmu_mapdev_attr, moea_mapdev_attr),
374 MMUMETHOD(mmu_mapdev, moea_mapdev),
375 MMUMETHOD(mmu_unmapdev, moea_unmapdev),
376 MMUMETHOD(mmu_kextract, moea_kextract),
377 MMUMETHOD(mmu_kenter, moea_kenter),
378 MMUMETHOD(mmu_kenter_attr, moea_kenter_attr),
379 MMUMETHOD(mmu_dev_direct_mapped,moea_dev_direct_mapped),
380 MMUMETHOD(mmu_scan_init, moea_scan_init),
381 MMUMETHOD(mmu_dumpsys_map, moea_dumpsys_map),
382 MMUMETHOD(mmu_map_user_ptr, moea_map_user_ptr),
383 MMUMETHOD(mmu_decode_kernel_ptr, moea_decode_kernel_ptr),
388 MMU_DEF(oea_mmu, MMU_TYPE_OEA, moea_methods, 0);
390 static __inline uint32_t
391 moea_calc_wimg(vm_paddr_t pa, vm_memattr_t ma)
396 if (ma != VM_MEMATTR_DEFAULT) {
398 case VM_MEMATTR_UNCACHEABLE:
399 return (PTE_I | PTE_G);
400 case VM_MEMATTR_CACHEABLE:
402 case VM_MEMATTR_WRITE_COMBINING:
403 case VM_MEMATTR_WRITE_BACK:
404 case VM_MEMATTR_PREFETCHABLE:
406 case VM_MEMATTR_WRITE_THROUGH:
407 return (PTE_W | PTE_M);
412 * Assume the page is cache inhibited and access is guarded unless
413 * it's in our available memory array.
415 pte_lo = PTE_I | PTE_G;
416 for (i = 0; i < pregions_sz; i++) {
417 if ((pa >= pregions[i].mr_start) &&
418 (pa < (pregions[i].mr_start + pregions[i].mr_size))) {
428 tlbie(vm_offset_t va)
431 mtx_lock_spin(&tlbie_mtx);
432 __asm __volatile("ptesync");
433 __asm __volatile("tlbie %0" :: "r"(va));
434 __asm __volatile("eieio; tlbsync; ptesync");
435 mtx_unlock_spin(&tlbie_mtx);
443 for (va = 0; va < 0x00040000; va += 0x00001000) {
444 __asm __volatile("tlbie %0" :: "r"(va));
447 __asm __volatile("tlbsync");
452 va_to_sr(u_int *sr, vm_offset_t va)
454 return (sr[(uintptr_t)va >> ADDR_SR_SHFT]);
457 static __inline u_int
458 va_to_pteg(u_int sr, vm_offset_t addr)
462 hash = (sr & SR_VSID_MASK) ^ (((u_int)addr & ADDR_PIDX) >>
464 return (hash & moea_pteg_mask);
467 static __inline struct pvo_head *
468 vm_page_to_pvoh(vm_page_t m)
471 return (&m->md.mdpg_pvoh);
475 moea_attr_clear(vm_page_t m, int ptebit)
478 rw_assert(&pvh_global_lock, RA_WLOCKED);
479 m->md.mdpg_attrs &= ~ptebit;
483 moea_attr_fetch(vm_page_t m)
486 return (m->md.mdpg_attrs);
490 moea_attr_save(vm_page_t m, int ptebit)
493 rw_assert(&pvh_global_lock, RA_WLOCKED);
494 m->md.mdpg_attrs |= ptebit;
498 moea_pte_compare(const struct pte *pt, const struct pte *pvo_pt)
500 if (pt->pte_hi == pvo_pt->pte_hi)
507 moea_pte_match(struct pte *pt, u_int sr, vm_offset_t va, int which)
509 return (pt->pte_hi & ~PTE_VALID) ==
510 (((sr & SR_VSID_MASK) << PTE_VSID_SHFT) |
511 ((va >> ADDR_API_SHFT) & PTE_API) | which);
515 moea_pte_create(struct pte *pt, u_int sr, vm_offset_t va, u_int pte_lo)
518 mtx_assert(&moea_table_mutex, MA_OWNED);
521 * Construct a PTE. Default to IMB initially. Valid bit only gets
522 * set when the real pte is set in memory.
524 * Note: Don't set the valid bit for correct operation of tlb update.
526 pt->pte_hi = ((sr & SR_VSID_MASK) << PTE_VSID_SHFT) |
527 (((va & ADDR_PIDX) >> ADDR_API_SHFT) & PTE_API);
532 moea_pte_synch(struct pte *pt, struct pte *pvo_pt)
535 mtx_assert(&moea_table_mutex, MA_OWNED);
536 pvo_pt->pte_lo |= pt->pte_lo & (PTE_REF | PTE_CHG);
540 moea_pte_clear(struct pte *pt, vm_offset_t va, int ptebit)
543 mtx_assert(&moea_table_mutex, MA_OWNED);
546 * As shown in Section 7.6.3.2.3
548 pt->pte_lo &= ~ptebit;
553 moea_pte_set(struct pte *pt, struct pte *pvo_pt)
556 mtx_assert(&moea_table_mutex, MA_OWNED);
557 pvo_pt->pte_hi |= PTE_VALID;
560 * Update the PTE as defined in section 7.6.3.1.
561 * Note that the REF/CHG bits are from pvo_pt and thus should have
562 * been saved so this routine can restore them (if desired).
564 pt->pte_lo = pvo_pt->pte_lo;
566 pt->pte_hi = pvo_pt->pte_hi;
572 moea_pte_unset(struct pte *pt, struct pte *pvo_pt, vm_offset_t va)
575 mtx_assert(&moea_table_mutex, MA_OWNED);
576 pvo_pt->pte_hi &= ~PTE_VALID;
579 * Force the reg & chg bits back into the PTEs.
584 * Invalidate the pte.
586 pt->pte_hi &= ~PTE_VALID;
591 * Save the reg & chg bits.
593 moea_pte_synch(pt, pvo_pt);
598 moea_pte_change(struct pte *pt, struct pte *pvo_pt, vm_offset_t va)
604 moea_pte_unset(pt, pvo_pt, va);
605 moea_pte_set(pt, pvo_pt);
609 * Quick sort callout for comparing memory regions.
611 static int om_cmp(const void *a, const void *b);
614 om_cmp(const void *a, const void *b)
616 const struct ofw_map *mapa;
617 const struct ofw_map *mapb;
621 if (mapa->om_pa < mapb->om_pa)
623 else if (mapa->om_pa > mapb->om_pa)
630 moea_cpu_bootstrap(mmu_t mmup, int ap)
637 __asm __volatile("mtdbatu 0,%0" :: "r"(battable[0].batu));
638 __asm __volatile("mtdbatl 0,%0" :: "r"(battable[0].batl));
640 __asm __volatile("mtibatu 0,%0" :: "r"(battable[0].batu));
641 __asm __volatile("mtibatl 0,%0" :: "r"(battable[0].batl));
645 __asm __volatile("mtdbatu 1,%0" :: "r"(battable[8].batu));
646 __asm __volatile("mtdbatl 1,%0" :: "r"(battable[8].batl));
649 __asm __volatile("mtibatu 1,%0" :: "r"(0));
650 __asm __volatile("mtdbatu 2,%0" :: "r"(0));
651 __asm __volatile("mtibatu 2,%0" :: "r"(0));
652 __asm __volatile("mtdbatu 3,%0" :: "r"(0));
653 __asm __volatile("mtibatu 3,%0" :: "r"(0));
656 for (i = 0; i < 16; i++)
657 mtsrin(i << ADDR_SR_SHFT, kernel_pmap->pm_sr[i]);
660 sdr = (u_int)moea_pteg_table | (moea_pteg_mask >> 10);
661 __asm __volatile("mtsdr1 %0" :: "r"(sdr));
668 moea_bootstrap(mmu_t mmup, vm_offset_t kernelstart, vm_offset_t kernelend)
671 phandle_t chosen, mmu;
674 vm_size_t size, physsz, hwphyssz;
675 vm_offset_t pa, va, off;
680 * Set up BAT0 to map the lowest 256 MB area
682 battable[0x0].batl = BATL(0x00000000, BAT_M, BAT_PP_RW);
683 battable[0x0].batu = BATU(0x00000000, BAT_BL_256M, BAT_Vs);
686 * Map PCI memory space.
688 battable[0x8].batl = BATL(0x80000000, BAT_I|BAT_G, BAT_PP_RW);
689 battable[0x8].batu = BATU(0x80000000, BAT_BL_256M, BAT_Vs);
691 battable[0x9].batl = BATL(0x90000000, BAT_I|BAT_G, BAT_PP_RW);
692 battable[0x9].batu = BATU(0x90000000, BAT_BL_256M, BAT_Vs);
694 battable[0xa].batl = BATL(0xa0000000, BAT_I|BAT_G, BAT_PP_RW);
695 battable[0xa].batu = BATU(0xa0000000, BAT_BL_256M, BAT_Vs);
697 battable[0xb].batl = BATL(0xb0000000, BAT_I|BAT_G, BAT_PP_RW);
698 battable[0xb].batu = BATU(0xb0000000, BAT_BL_256M, BAT_Vs);
703 battable[0xf].batl = BATL(0xf0000000, BAT_I|BAT_G, BAT_PP_RW);
704 battable[0xf].batu = BATU(0xf0000000, BAT_BL_256M, BAT_Vs);
707 * Use an IBAT and a DBAT to map the bottom segment of memory
708 * where we are. Turn off instruction relocation temporarily
709 * to prevent faults while reprogramming the IBAT.
712 mtmsr(msr & ~PSL_IR);
713 __asm (".balign 32; \n"
714 "mtibatu 0,%0; mtibatl 0,%1; isync; \n"
715 "mtdbatu 0,%0; mtdbatl 0,%1; isync"
716 :: "r"(battable[0].batu), "r"(battable[0].batl));
720 __asm __volatile("mtdbatu 1,%0" :: "r"(battable[8].batu));
721 __asm __volatile("mtdbatl 1,%0" :: "r"(battable[8].batl));
724 /* set global direct map flag */
727 mem_regions(&pregions, &pregions_sz, ®ions, ®ions_sz);
728 CTR0(KTR_PMAP, "moea_bootstrap: physical memory");
730 for (i = 0; i < pregions_sz; i++) {
734 CTR3(KTR_PMAP, "physregion: %#x - %#x (%#x)",
735 pregions[i].mr_start,
736 pregions[i].mr_start + pregions[i].mr_size,
737 pregions[i].mr_size);
739 * Install entries into the BAT table to allow all
740 * of physmem to be convered by on-demand BAT entries.
741 * The loop will sometimes set the same battable element
742 * twice, but that's fine since they won't be used for
745 pa = pregions[i].mr_start & 0xf0000000;
746 end = pregions[i].mr_start + pregions[i].mr_size;
748 u_int n = pa >> ADDR_SR_SHFT;
750 battable[n].batl = BATL(pa, BAT_M, BAT_PP_RW);
751 battable[n].batu = BATU(pa, BAT_BL_256M, BAT_Vs);
752 pa += SEGMENT_LENGTH;
756 if (PHYS_AVAIL_ENTRIES < regions_sz)
757 panic("moea_bootstrap: phys_avail too small");
759 phys_avail_count = 0;
762 TUNABLE_ULONG_FETCH("hw.physmem", (u_long *) &hwphyssz);
763 for (i = 0, j = 0; i < regions_sz; i++, j += 2) {
764 CTR3(KTR_PMAP, "region: %#x - %#x (%#x)", regions[i].mr_start,
765 regions[i].mr_start + regions[i].mr_size,
768 (physsz + regions[i].mr_size) >= hwphyssz) {
769 if (physsz < hwphyssz) {
770 phys_avail[j] = regions[i].mr_start;
771 phys_avail[j + 1] = regions[i].mr_start +
778 phys_avail[j] = regions[i].mr_start;
779 phys_avail[j + 1] = regions[i].mr_start + regions[i].mr_size;
781 physsz += regions[i].mr_size;
784 /* Check for overlap with the kernel and exception vectors */
785 for (j = 0; j < 2*phys_avail_count; j+=2) {
786 if (phys_avail[j] < EXC_LAST)
787 phys_avail[j] += EXC_LAST;
789 if (kernelstart >= phys_avail[j] &&
790 kernelstart < phys_avail[j+1]) {
791 if (kernelend < phys_avail[j+1]) {
792 phys_avail[2*phys_avail_count] =
793 (kernelend & ~PAGE_MASK) + PAGE_SIZE;
794 phys_avail[2*phys_avail_count + 1] =
799 phys_avail[j+1] = kernelstart & ~PAGE_MASK;
802 if (kernelend >= phys_avail[j] &&
803 kernelend < phys_avail[j+1]) {
804 if (kernelstart > phys_avail[j]) {
805 phys_avail[2*phys_avail_count] = phys_avail[j];
806 phys_avail[2*phys_avail_count + 1] =
807 kernelstart & ~PAGE_MASK;
811 phys_avail[j] = (kernelend & ~PAGE_MASK) + PAGE_SIZE;
815 physmem = btoc(physsz);
818 * Allocate PTEG table.
821 moea_pteg_count = PTEGCOUNT;
823 moea_pteg_count = 0x1000;
825 while (moea_pteg_count < physmem)
826 moea_pteg_count <<= 1;
828 moea_pteg_count >>= 1;
829 #endif /* PTEGCOUNT */
831 size = moea_pteg_count * sizeof(struct pteg);
832 CTR2(KTR_PMAP, "moea_bootstrap: %d PTEGs, %d bytes", moea_pteg_count,
834 moea_pteg_table = (struct pteg *)moea_bootstrap_alloc(size, size);
835 CTR1(KTR_PMAP, "moea_bootstrap: PTEG table at %p", moea_pteg_table);
836 bzero((void *)moea_pteg_table, moea_pteg_count * sizeof(struct pteg));
837 moea_pteg_mask = moea_pteg_count - 1;
840 * Allocate pv/overflow lists.
842 size = sizeof(struct pvo_head) * moea_pteg_count;
843 moea_pvo_table = (struct pvo_head *)moea_bootstrap_alloc(size,
845 CTR1(KTR_PMAP, "moea_bootstrap: PVO table at %p", moea_pvo_table);
846 for (i = 0; i < moea_pteg_count; i++)
847 LIST_INIT(&moea_pvo_table[i]);
850 * Initialize the lock that synchronizes access to the pteg and pvo
853 mtx_init(&moea_table_mutex, "pmap table", NULL, MTX_DEF |
855 mtx_init(&moea_vsid_mutex, "VSID table", NULL, MTX_DEF);
857 mtx_init(&tlbie_mtx, "tlbie", NULL, MTX_SPIN);
860 * Initialise the unmanaged pvo pool.
862 moea_bpvo_pool = (struct pvo_entry *)moea_bootstrap_alloc(
863 BPVO_POOL_SIZE*sizeof(struct pvo_entry), 0);
864 moea_bpvo_pool_index = 0;
867 * Make sure kernel vsid is allocated as well as VSID 0.
869 moea_vsid_bitmap[(KERNEL_VSIDBITS & (NPMAPS - 1)) / VSID_NBPW]
870 |= 1 << (KERNEL_VSIDBITS % VSID_NBPW);
871 moea_vsid_bitmap[0] |= 1;
874 * Initialize the kernel pmap (which is statically allocated).
876 PMAP_LOCK_INIT(kernel_pmap);
877 for (i = 0; i < 16; i++)
878 kernel_pmap->pm_sr[i] = EMPTY_SEGMENT + i;
879 CPU_FILL(&kernel_pmap->pm_active);
880 RB_INIT(&kernel_pmap->pmap_pvo);
883 * Initialize the global pv list lock.
885 rw_init(&pvh_global_lock, "pmap pv global");
888 * Set up the Open Firmware mappings
890 chosen = OF_finddevice("/chosen");
891 if (chosen != -1 && OF_getprop(chosen, "mmu", &mmui, 4) != -1 &&
892 (mmu = OF_instance_to_package(mmui)) != -1 &&
893 (sz = OF_getproplen(mmu, "translations")) != -1) {
895 for (i = 0; phys_avail[i] != 0; i += 2) {
896 if (phys_avail[i + 1] >= sz) {
897 translations = (struct ofw_map *)phys_avail[i];
901 if (translations == NULL)
902 panic("moea_bootstrap: no space to copy translations");
903 bzero(translations, sz);
904 if (OF_getprop(mmu, "translations", translations, sz) == -1)
905 panic("moea_bootstrap: can't get ofw translations");
906 CTR0(KTR_PMAP, "moea_bootstrap: translations");
907 sz /= sizeof(*translations);
908 qsort(translations, sz, sizeof (*translations), om_cmp);
909 for (i = 0; i < sz; i++) {
910 CTR3(KTR_PMAP, "translation: pa=%#x va=%#x len=%#x",
911 translations[i].om_pa, translations[i].om_va,
912 translations[i].om_len);
915 * If the mapping is 1:1, let the RAM and device
916 * on-demand BAT tables take care of the translation.
918 if (translations[i].om_va == translations[i].om_pa)
921 /* Enter the pages */
922 for (off = 0; off < translations[i].om_len;
924 moea_kenter(mmup, translations[i].om_va + off,
925 translations[i].om_pa + off);
930 * Calculate the last available physical address.
932 for (i = 0; phys_avail[i + 2] != 0; i += 2)
934 Maxmem = powerpc_btop(phys_avail[i + 1]);
936 moea_cpu_bootstrap(mmup,0);
937 mtmsr(mfmsr() | PSL_DR | PSL_IR);
941 * Set the start and end of kva.
943 virtual_avail = VM_MIN_KERNEL_ADDRESS;
944 virtual_end = VM_MAX_SAFE_KERNEL_ADDRESS;
947 * Allocate a kernel stack with a guard page for thread0 and map it
948 * into the kernel page map.
950 pa = moea_bootstrap_alloc(kstack_pages * PAGE_SIZE, PAGE_SIZE);
951 va = virtual_avail + KSTACK_GUARD_PAGES * PAGE_SIZE;
952 virtual_avail = va + kstack_pages * PAGE_SIZE;
953 CTR2(KTR_PMAP, "moea_bootstrap: kstack0 at %#x (%#x)", pa, va);
954 thread0.td_kstack = va;
955 thread0.td_kstack_pages = kstack_pages;
956 for (i = 0; i < kstack_pages; i++) {
957 moea_kenter(mmup, va, pa);
963 * Allocate virtual address space for the message buffer.
965 pa = msgbuf_phys = moea_bootstrap_alloc(msgbufsize, PAGE_SIZE);
966 msgbufp = (struct msgbuf *)virtual_avail;
968 virtual_avail += round_page(msgbufsize);
969 while (va < virtual_avail) {
970 moea_kenter(mmup, va, pa);
976 * Allocate virtual address space for the dynamic percpu area.
978 pa = moea_bootstrap_alloc(DPCPU_SIZE, PAGE_SIZE);
979 dpcpu = (void *)virtual_avail;
981 virtual_avail += DPCPU_SIZE;
982 while (va < virtual_avail) {
983 moea_kenter(mmup, va, pa);
987 dpcpu_init(dpcpu, 0);
991 * Activate a user pmap. The pmap must be activated before it's address
992 * space can be accessed in any way.
995 moea_activate(mmu_t mmu, struct thread *td)
1000 * Load all the data we need up front to encourage the compiler to
1001 * not issue any loads while we have interrupts disabled below.
1003 pm = &td->td_proc->p_vmspace->vm_pmap;
1004 pmr = pm->pmap_phys;
1006 CPU_SET(PCPU_GET(cpuid), &pm->pm_active);
1007 PCPU_SET(curpmap, pmr);
1009 mtsrin(USER_SR << ADDR_SR_SHFT, td->td_pcb->pcb_cpu.aim.usr_vsid);
1013 moea_deactivate(mmu_t mmu, struct thread *td)
1017 pm = &td->td_proc->p_vmspace->vm_pmap;
1018 CPU_CLR(PCPU_GET(cpuid), &pm->pm_active);
1019 PCPU_SET(curpmap, NULL);
1023 moea_unwire(mmu_t mmu, pmap_t pm, vm_offset_t sva, vm_offset_t eva)
1025 struct pvo_entry key, *pvo;
1028 key.pvo_vaddr = sva;
1029 for (pvo = RB_NFIND(pvo_tree, &pm->pmap_pvo, &key);
1030 pvo != NULL && PVO_VADDR(pvo) < eva;
1031 pvo = RB_NEXT(pvo_tree, &pm->pmap_pvo, pvo)) {
1032 if ((pvo->pvo_vaddr & PVO_WIRED) == 0)
1033 panic("moea_unwire: pvo %p is missing PVO_WIRED", pvo);
1034 pvo->pvo_vaddr &= ~PVO_WIRED;
1035 pm->pm_stats.wired_count--;
1041 moea_copy_page(mmu_t mmu, vm_page_t msrc, vm_page_t mdst)
1046 dst = VM_PAGE_TO_PHYS(mdst);
1047 src = VM_PAGE_TO_PHYS(msrc);
1049 bcopy((void *)src, (void *)dst, PAGE_SIZE);
1053 moea_copy_pages(mmu_t mmu, vm_page_t *ma, vm_offset_t a_offset,
1054 vm_page_t *mb, vm_offset_t b_offset, int xfersize)
1057 vm_offset_t a_pg_offset, b_pg_offset;
1060 while (xfersize > 0) {
1061 a_pg_offset = a_offset & PAGE_MASK;
1062 cnt = min(xfersize, PAGE_SIZE - a_pg_offset);
1063 a_cp = (char *)VM_PAGE_TO_PHYS(ma[a_offset >> PAGE_SHIFT]) +
1065 b_pg_offset = b_offset & PAGE_MASK;
1066 cnt = min(cnt, PAGE_SIZE - b_pg_offset);
1067 b_cp = (char *)VM_PAGE_TO_PHYS(mb[b_offset >> PAGE_SHIFT]) +
1069 bcopy(a_cp, b_cp, cnt);
1077 * Zero a page of physical memory by temporarily mapping it into the tlb.
1080 moea_zero_page(mmu_t mmu, vm_page_t m)
1082 vm_offset_t off, pa = VM_PAGE_TO_PHYS(m);
1084 for (off = 0; off < PAGE_SIZE; off += cacheline_size)
1085 __asm __volatile("dcbz 0,%0" :: "r"(pa + off));
1089 moea_zero_page_area(mmu_t mmu, vm_page_t m, int off, int size)
1091 vm_offset_t pa = VM_PAGE_TO_PHYS(m);
1092 void *va = (void *)(pa + off);
1098 moea_quick_enter_page(mmu_t mmu, vm_page_t m)
1101 return (VM_PAGE_TO_PHYS(m));
1105 moea_quick_remove_page(mmu_t mmu, vm_offset_t addr)
1110 moea_page_is_mapped(mmu_t mmu, vm_page_t m)
1112 return (!LIST_EMPTY(&(m)->md.mdpg_pvoh));
1116 * Map the given physical page at the specified virtual address in the
1117 * target pmap with the protection requested. If specified the page
1118 * will be wired down.
1121 moea_enter(mmu_t mmu, pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot,
1122 u_int flags, int8_t psind)
1127 rw_wlock(&pvh_global_lock);
1129 error = moea_enter_locked(pmap, va, m, prot, flags, psind);
1130 rw_wunlock(&pvh_global_lock);
1132 if (error != ENOMEM)
1133 return (KERN_SUCCESS);
1134 if ((flags & PMAP_ENTER_NOSLEEP) != 0)
1135 return (KERN_RESOURCE_SHORTAGE);
1136 VM_OBJECT_ASSERT_UNLOCKED(m->object);
1142 * Map the given physical page at the specified virtual address in the
1143 * target pmap with the protection requested. If specified the page
1144 * will be wired down.
1146 * The global pvh and pmap must be locked.
1149 moea_enter_locked(pmap_t pmap, vm_offset_t va, vm_page_t m, vm_prot_t prot,
1150 u_int flags, int8_t psind __unused)
1152 struct pvo_head *pvo_head;
1154 u_int pte_lo, pvo_flags;
1157 if (pmap_bootstrapped)
1158 rw_assert(&pvh_global_lock, RA_WLOCKED);
1159 PMAP_LOCK_ASSERT(pmap, MA_OWNED);
1160 if ((m->oflags & VPO_UNMANAGED) == 0) {
1161 if ((flags & PMAP_ENTER_QUICK_LOCKED) == 0)
1162 VM_PAGE_OBJECT_BUSY_ASSERT(m);
1164 VM_OBJECT_ASSERT_LOCKED(m->object);
1167 if ((m->oflags & VPO_UNMANAGED) != 0 || !moea_initialized) {
1168 pvo_head = &moea_pvo_kunmanaged;
1169 zone = moea_upvo_zone;
1172 pvo_head = vm_page_to_pvoh(m);
1173 zone = moea_mpvo_zone;
1174 pvo_flags = PVO_MANAGED;
1177 pte_lo = moea_calc_wimg(VM_PAGE_TO_PHYS(m), pmap_page_get_memattr(m));
1179 if (prot & VM_PROT_WRITE) {
1181 if (pmap_bootstrapped &&
1182 (m->oflags & VPO_UNMANAGED) == 0)
1183 vm_page_aflag_set(m, PGA_WRITEABLE);
1187 if ((flags & PMAP_ENTER_WIRED) != 0)
1188 pvo_flags |= PVO_WIRED;
1190 error = moea_pvo_enter(pmap, zone, pvo_head, va, VM_PAGE_TO_PHYS(m),
1194 * Flush the real page from the instruction cache. This has be done
1195 * for all user mappings to prevent information leakage via the
1196 * instruction cache. moea_pvo_enter() returns ENOENT for the first
1197 * mapping for a page.
1199 if (pmap != kernel_pmap && error == ENOENT &&
1200 (pte_lo & (PTE_I | PTE_G)) == 0)
1201 moea_syncicache(VM_PAGE_TO_PHYS(m), PAGE_SIZE);
1207 * Maps a sequence of resident pages belonging to the same object.
1208 * The sequence begins with the given page m_start. This page is
1209 * mapped at the given virtual address start. Each subsequent page is
1210 * mapped at a virtual address that is offset from start by the same
1211 * amount as the page is offset from m_start within the object. The
1212 * last page in the sequence is the page with the largest offset from
1213 * m_start that can be mapped at a virtual address less than the given
1214 * virtual address end. Not every virtual page between start and end
1215 * is mapped; only those for which a resident page exists with the
1216 * corresponding offset from m_start are mapped.
1219 moea_enter_object(mmu_t mmu, pmap_t pm, vm_offset_t start, vm_offset_t end,
1220 vm_page_t m_start, vm_prot_t prot)
1223 vm_pindex_t diff, psize;
1225 VM_OBJECT_ASSERT_LOCKED(m_start->object);
1227 psize = atop(end - start);
1229 rw_wlock(&pvh_global_lock);
1231 while (m != NULL && (diff = m->pindex - m_start->pindex) < psize) {
1232 moea_enter_locked(pm, start + ptoa(diff), m, prot &
1233 (VM_PROT_READ | VM_PROT_EXECUTE), PMAP_ENTER_QUICK_LOCKED,
1235 m = TAILQ_NEXT(m, listq);
1237 rw_wunlock(&pvh_global_lock);
1242 moea_enter_quick(mmu_t mmu, pmap_t pm, vm_offset_t va, vm_page_t m,
1246 rw_wlock(&pvh_global_lock);
1248 moea_enter_locked(pm, va, m, prot & (VM_PROT_READ | VM_PROT_EXECUTE),
1249 PMAP_ENTER_QUICK_LOCKED, 0);
1250 rw_wunlock(&pvh_global_lock);
1255 moea_extract(mmu_t mmu, pmap_t pm, vm_offset_t va)
1257 struct pvo_entry *pvo;
1261 pvo = moea_pvo_find_va(pm, va & ~ADDR_POFF, NULL);
1265 pa = (pvo->pvo_pte.pte.pte_lo & PTE_RPGN) | (va & ADDR_POFF);
1271 * Atomically extract and hold the physical page with the given
1272 * pmap and virtual address pair if that mapping permits the given
1276 moea_extract_and_hold(mmu_t mmu, pmap_t pmap, vm_offset_t va, vm_prot_t prot)
1278 struct pvo_entry *pvo;
1283 pvo = moea_pvo_find_va(pmap, va & ~ADDR_POFF, NULL);
1284 if (pvo != NULL && (pvo->pvo_pte.pte.pte_hi & PTE_VALID) &&
1285 ((pvo->pvo_pte.pte.pte_lo & PTE_PP) == PTE_RW ||
1286 (prot & VM_PROT_WRITE) == 0)) {
1287 m = PHYS_TO_VM_PAGE(pvo->pvo_pte.pte.pte_lo & PTE_RPGN);
1288 if (!vm_page_wire_mapped(m))
1296 moea_init(mmu_t mmu)
1299 moea_upvo_zone = uma_zcreate("UPVO entry", sizeof (struct pvo_entry),
1300 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR,
1301 UMA_ZONE_VM | UMA_ZONE_NOFREE);
1302 moea_mpvo_zone = uma_zcreate("MPVO entry", sizeof(struct pvo_entry),
1303 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR,
1304 UMA_ZONE_VM | UMA_ZONE_NOFREE);
1305 moea_initialized = TRUE;
1309 moea_is_referenced(mmu_t mmu, vm_page_t m)
1313 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
1314 ("moea_is_referenced: page %p is not managed", m));
1315 rw_wlock(&pvh_global_lock);
1316 rv = moea_query_bit(m, PTE_REF);
1317 rw_wunlock(&pvh_global_lock);
1322 moea_is_modified(mmu_t mmu, vm_page_t m)
1326 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
1327 ("moea_is_modified: page %p is not managed", m));
1330 * If the page is not busied then this check is racy.
1332 if (!pmap_page_is_write_mapped(m))
1335 rw_wlock(&pvh_global_lock);
1336 rv = moea_query_bit(m, PTE_CHG);
1337 rw_wunlock(&pvh_global_lock);
1342 moea_is_prefaultable(mmu_t mmu, pmap_t pmap, vm_offset_t va)
1344 struct pvo_entry *pvo;
1348 pvo = moea_pvo_find_va(pmap, va & ~ADDR_POFF, NULL);
1349 rv = pvo == NULL || (pvo->pvo_pte.pte.pte_hi & PTE_VALID) == 0;
1355 moea_clear_modify(mmu_t mmu, vm_page_t m)
1358 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
1359 ("moea_clear_modify: page %p is not managed", m));
1360 vm_page_assert_busied(m);
1362 if (!pmap_page_is_write_mapped(m))
1364 rw_wlock(&pvh_global_lock);
1365 moea_clear_bit(m, PTE_CHG);
1366 rw_wunlock(&pvh_global_lock);
1370 * Clear the write and modified bits in each of the given page's mappings.
1373 moea_remove_write(mmu_t mmu, vm_page_t m)
1375 struct pvo_entry *pvo;
1380 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
1381 ("moea_remove_write: page %p is not managed", m));
1382 vm_page_assert_busied(m);
1384 if (!pmap_page_is_write_mapped(m))
1386 rw_wlock(&pvh_global_lock);
1387 lo = moea_attr_fetch(m);
1389 LIST_FOREACH(pvo, vm_page_to_pvoh(m), pvo_vlink) {
1390 pmap = pvo->pvo_pmap;
1392 if ((pvo->pvo_pte.pte.pte_lo & PTE_PP) != PTE_BR) {
1393 pt = moea_pvo_to_pte(pvo, -1);
1394 pvo->pvo_pte.pte.pte_lo &= ~PTE_PP;
1395 pvo->pvo_pte.pte.pte_lo |= PTE_BR;
1397 moea_pte_synch(pt, &pvo->pvo_pte.pte);
1398 lo |= pvo->pvo_pte.pte.pte_lo;
1399 pvo->pvo_pte.pte.pte_lo &= ~PTE_CHG;
1400 moea_pte_change(pt, &pvo->pvo_pte.pte,
1402 mtx_unlock(&moea_table_mutex);
1407 if ((lo & PTE_CHG) != 0) {
1408 moea_attr_clear(m, PTE_CHG);
1411 vm_page_aflag_clear(m, PGA_WRITEABLE);
1412 rw_wunlock(&pvh_global_lock);
1416 * moea_ts_referenced:
1418 * Return a count of reference bits for a page, clearing those bits.
1419 * It is not necessary for every reference bit to be cleared, but it
1420 * is necessary that 0 only be returned when there are truly no
1421 * reference bits set.
1423 * XXX: The exact number of bits to check and clear is a matter that
1424 * should be tested and standardized at some point in the future for
1425 * optimal aging of shared pages.
1428 moea_ts_referenced(mmu_t mmu, vm_page_t m)
1432 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
1433 ("moea_ts_referenced: page %p is not managed", m));
1434 rw_wlock(&pvh_global_lock);
1435 count = moea_clear_bit(m, PTE_REF);
1436 rw_wunlock(&pvh_global_lock);
1441 * Modify the WIMG settings of all mappings for a page.
1444 moea_page_set_memattr(mmu_t mmu, vm_page_t m, vm_memattr_t ma)
1446 struct pvo_entry *pvo;
1447 struct pvo_head *pvo_head;
1452 if ((m->oflags & VPO_UNMANAGED) != 0) {
1453 m->md.mdpg_cache_attrs = ma;
1457 rw_wlock(&pvh_global_lock);
1458 pvo_head = vm_page_to_pvoh(m);
1459 lo = moea_calc_wimg(VM_PAGE_TO_PHYS(m), ma);
1461 LIST_FOREACH(pvo, pvo_head, pvo_vlink) {
1462 pmap = pvo->pvo_pmap;
1464 pt = moea_pvo_to_pte(pvo, -1);
1465 pvo->pvo_pte.pte.pte_lo &= ~PTE_WIMG;
1466 pvo->pvo_pte.pte.pte_lo |= lo;
1468 moea_pte_change(pt, &pvo->pvo_pte.pte,
1470 if (pvo->pvo_pmap == kernel_pmap)
1473 mtx_unlock(&moea_table_mutex);
1476 m->md.mdpg_cache_attrs = ma;
1477 rw_wunlock(&pvh_global_lock);
1481 * Map a wired page into kernel virtual address space.
1484 moea_kenter(mmu_t mmu, vm_offset_t va, vm_paddr_t pa)
1487 moea_kenter_attr(mmu, va, pa, VM_MEMATTR_DEFAULT);
1491 moea_kenter_attr(mmu_t mmu, vm_offset_t va, vm_paddr_t pa, vm_memattr_t ma)
1497 if (va < VM_MIN_KERNEL_ADDRESS)
1498 panic("moea_kenter: attempt to enter non-kernel address %#x",
1502 pte_lo = moea_calc_wimg(pa, ma);
1504 PMAP_LOCK(kernel_pmap);
1505 error = moea_pvo_enter(kernel_pmap, moea_upvo_zone,
1506 &moea_pvo_kunmanaged, va, pa, pte_lo, PVO_WIRED);
1508 if (error != 0 && error != ENOENT)
1509 panic("moea_kenter: failed to enter va %#x pa %#x: %d", va,
1512 PMAP_UNLOCK(kernel_pmap);
1516 * Extract the physical page address associated with the given kernel virtual
1520 moea_kextract(mmu_t mmu, vm_offset_t va)
1522 struct pvo_entry *pvo;
1526 * Allow direct mappings on 32-bit OEA
1528 if (va < VM_MIN_KERNEL_ADDRESS) {
1532 PMAP_LOCK(kernel_pmap);
1533 pvo = moea_pvo_find_va(kernel_pmap, va & ~ADDR_POFF, NULL);
1534 KASSERT(pvo != NULL, ("moea_kextract: no addr found"));
1535 pa = (pvo->pvo_pte.pte.pte_lo & PTE_RPGN) | (va & ADDR_POFF);
1536 PMAP_UNLOCK(kernel_pmap);
1541 * Remove a wired page from kernel virtual address space.
1544 moea_kremove(mmu_t mmu, vm_offset_t va)
1547 moea_remove(mmu, kernel_pmap, va, va + PAGE_SIZE);
1551 * Provide a kernel pointer corresponding to a given userland pointer.
1552 * The returned pointer is valid until the next time this function is
1553 * called in this thread. This is used internally in copyin/copyout.
1556 moea_map_user_ptr(mmu_t mmu, pmap_t pm, volatile const void *uaddr,
1557 void **kaddr, size_t ulen, size_t *klen)
1562 *kaddr = (char *)USER_ADDR + ((uintptr_t)uaddr & ~SEGMENT_MASK);
1563 l = ((char *)USER_ADDR + SEGMENT_LENGTH) - (char *)(*kaddr);
1571 vsid = va_to_vsid(pm, (vm_offset_t)uaddr);
1573 /* Mark segment no-execute */
1576 /* If we have already set this VSID, we can just return */
1577 if (curthread->td_pcb->pcb_cpu.aim.usr_vsid == vsid)
1580 __asm __volatile("isync");
1581 curthread->td_pcb->pcb_cpu.aim.usr_segm =
1582 (uintptr_t)uaddr >> ADDR_SR_SHFT;
1583 curthread->td_pcb->pcb_cpu.aim.usr_vsid = vsid;
1584 __asm __volatile("mtsr %0,%1; isync" :: "n"(USER_SR), "r"(vsid));
1590 * Figure out where a given kernel pointer (usually in a fault) points
1591 * to from the VM's perspective, potentially remapping into userland's
1595 moea_decode_kernel_ptr(mmu_t mmu, vm_offset_t addr, int *is_user,
1596 vm_offset_t *decoded_addr)
1598 vm_offset_t user_sr;
1600 if ((addr >> ADDR_SR_SHFT) == (USER_ADDR >> ADDR_SR_SHFT)) {
1601 user_sr = curthread->td_pcb->pcb_cpu.aim.usr_segm;
1602 addr &= ADDR_PIDX | ADDR_POFF;
1603 addr |= user_sr << ADDR_SR_SHFT;
1604 *decoded_addr = addr;
1607 *decoded_addr = addr;
1615 * Map a range of physical addresses into kernel virtual address space.
1617 * The value passed in *virt is a suggested virtual address for the mapping.
1618 * Architectures which can support a direct-mapped physical to virtual region
1619 * can return the appropriate address within that region, leaving '*virt'
1620 * unchanged. We cannot and therefore do not; *virt is updated with the
1621 * first usable address after the mapped region.
1624 moea_map(mmu_t mmu, vm_offset_t *virt, vm_paddr_t pa_start,
1625 vm_paddr_t pa_end, int prot)
1627 vm_offset_t sva, va;
1631 for (; pa_start < pa_end; pa_start += PAGE_SIZE, va += PAGE_SIZE)
1632 moea_kenter(mmu, va, pa_start);
1638 * Returns true if the pmap's pv is one of the first
1639 * 16 pvs linked to from this page. This count may
1640 * be changed upwards or downwards in the future; it
1641 * is only necessary that true be returned for a small
1642 * subset of pmaps for proper page aging.
1645 moea_page_exists_quick(mmu_t mmu, pmap_t pmap, vm_page_t m)
1648 struct pvo_entry *pvo;
1651 KASSERT((m->oflags & VPO_UNMANAGED) == 0,
1652 ("moea_page_exists_quick: page %p is not managed", m));
1655 rw_wlock(&pvh_global_lock);
1656 LIST_FOREACH(pvo, vm_page_to_pvoh(m), pvo_vlink) {
1657 if (pvo->pvo_pmap == pmap) {
1664 rw_wunlock(&pvh_global_lock);
1669 moea_page_init(mmu_t mmu __unused, vm_page_t m)
1672 m->md.mdpg_attrs = 0;
1673 m->md.mdpg_cache_attrs = VM_MEMATTR_DEFAULT;
1674 LIST_INIT(&m->md.mdpg_pvoh);
1678 * Return the number of managed mappings to the given physical page
1682 moea_page_wired_mappings(mmu_t mmu, vm_page_t m)
1684 struct pvo_entry *pvo;
1688 if ((m->oflags & VPO_UNMANAGED) != 0)
1690 rw_wlock(&pvh_global_lock);
1691 LIST_FOREACH(pvo, vm_page_to_pvoh(m), pvo_vlink)
1692 if ((pvo->pvo_vaddr & PVO_WIRED) != 0)
1694 rw_wunlock(&pvh_global_lock);
1698 static u_int moea_vsidcontext;
1701 moea_pinit(mmu_t mmu, pmap_t pmap)
1706 KASSERT((int)pmap < VM_MIN_KERNEL_ADDRESS, ("moea_pinit: virt pmap"));
1707 RB_INIT(&pmap->pmap_pvo);
1710 __asm __volatile("mftb %0" : "=r"(entropy));
1712 if ((pmap->pmap_phys = (pmap_t)moea_kextract(mmu, (vm_offset_t)pmap))
1714 pmap->pmap_phys = pmap;
1718 mtx_lock(&moea_vsid_mutex);
1720 * Allocate some segment registers for this pmap.
1722 for (i = 0; i < NPMAPS; i += VSID_NBPW) {
1726 * Create a new value by mutiplying by a prime and adding in
1727 * entropy from the timebase register. This is to make the
1728 * VSID more random so that the PT hash function collides
1729 * less often. (Note that the prime casues gcc to do shifts
1730 * instead of a multiply.)
1732 moea_vsidcontext = (moea_vsidcontext * 0x1105) + entropy;
1733 hash = moea_vsidcontext & (NPMAPS - 1);
1734 if (hash == 0) /* 0 is special, avoid it */
1737 mask = 1 << (hash & (VSID_NBPW - 1));
1738 hash = (moea_vsidcontext & 0xfffff);
1739 if (moea_vsid_bitmap[n] & mask) { /* collision? */
1740 /* anything free in this bucket? */
1741 if (moea_vsid_bitmap[n] == 0xffffffff) {
1742 entropy = (moea_vsidcontext >> 20);
1745 i = ffs(~moea_vsid_bitmap[n]) - 1;
1747 hash &= rounddown2(0xfffff, VSID_NBPW);
1750 KASSERT(!(moea_vsid_bitmap[n] & mask),
1751 ("Allocating in-use VSID group %#x\n", hash));
1752 moea_vsid_bitmap[n] |= mask;
1753 for (i = 0; i < 16; i++)
1754 pmap->pm_sr[i] = VSID_MAKE(i, hash);
1755 mtx_unlock(&moea_vsid_mutex);
1759 mtx_unlock(&moea_vsid_mutex);
1760 panic("moea_pinit: out of segments");
1764 * Initialize the pmap associated with process 0.
1767 moea_pinit0(mmu_t mmu, pmap_t pm)
1771 moea_pinit(mmu, pm);
1772 bzero(&pm->pm_stats, sizeof(pm->pm_stats));
1776 * Set the physical protection on the specified range of this map as requested.
1779 moea_protect(mmu_t mmu, pmap_t pm, vm_offset_t sva, vm_offset_t eva,
1782 struct pvo_entry *pvo, *tpvo, key;
1785 KASSERT(pm == &curproc->p_vmspace->vm_pmap || pm == kernel_pmap,
1786 ("moea_protect: non current pmap"));
1788 if ((prot & VM_PROT_READ) == VM_PROT_NONE) {
1789 moea_remove(mmu, pm, sva, eva);
1793 rw_wlock(&pvh_global_lock);
1795 key.pvo_vaddr = sva;
1796 for (pvo = RB_NFIND(pvo_tree, &pm->pmap_pvo, &key);
1797 pvo != NULL && PVO_VADDR(pvo) < eva; pvo = tpvo) {
1798 tpvo = RB_NEXT(pvo_tree, &pm->pmap_pvo, pvo);
1801 * Grab the PTE pointer before we diddle with the cached PTE
1804 pt = moea_pvo_to_pte(pvo, -1);
1806 * Change the protection of the page.
1808 pvo->pvo_pte.pte.pte_lo &= ~PTE_PP;
1809 pvo->pvo_pte.pte.pte_lo |= PTE_BR;
1812 * If the PVO is in the page table, update that pte as well.
1815 moea_pte_change(pt, &pvo->pvo_pte.pte, pvo->pvo_vaddr);
1816 mtx_unlock(&moea_table_mutex);
1819 rw_wunlock(&pvh_global_lock);
1824 * Map a list of wired pages into kernel virtual address space. This is
1825 * intended for temporary mappings which do not need page modification or
1826 * references recorded. Existing mappings in the region are overwritten.
1829 moea_qenter(mmu_t mmu, vm_offset_t sva, vm_page_t *m, int count)
1834 while (count-- > 0) {
1835 moea_kenter(mmu, va, VM_PAGE_TO_PHYS(*m));
1842 * Remove page mappings from kernel virtual address space. Intended for
1843 * temporary mappings entered by moea_qenter.
1846 moea_qremove(mmu_t mmu, vm_offset_t sva, int count)
1851 while (count-- > 0) {
1852 moea_kremove(mmu, va);
1858 moea_release(mmu_t mmu, pmap_t pmap)
1863 * Free segment register's VSID
1865 if (pmap->pm_sr[0] == 0)
1866 panic("moea_release");
1868 mtx_lock(&moea_vsid_mutex);
1869 idx = VSID_TO_HASH(pmap->pm_sr[0]) & (NPMAPS-1);
1870 mask = 1 << (idx % VSID_NBPW);
1872 moea_vsid_bitmap[idx] &= ~mask;
1873 mtx_unlock(&moea_vsid_mutex);
1877 * Remove the given range of addresses from the specified map.
1880 moea_remove(mmu_t mmu, pmap_t pm, vm_offset_t sva, vm_offset_t eva)
1882 struct pvo_entry *pvo, *tpvo, key;
1884 rw_wlock(&pvh_global_lock);
1886 key.pvo_vaddr = sva;
1887 for (pvo = RB_NFIND(pvo_tree, &pm->pmap_pvo, &key);
1888 pvo != NULL && PVO_VADDR(pvo) < eva; pvo = tpvo) {
1889 tpvo = RB_NEXT(pvo_tree, &pm->pmap_pvo, pvo);
1890 moea_pvo_remove(pvo, -1);
1893 rw_wunlock(&pvh_global_lock);
1897 * Remove physical page from all pmaps in which it resides. moea_pvo_remove()
1898 * will reflect changes in pte's back to the vm_page.
1901 moea_remove_all(mmu_t mmu, vm_page_t m)
1903 struct pvo_head *pvo_head;
1904 struct pvo_entry *pvo, *next_pvo;
1907 rw_wlock(&pvh_global_lock);
1908 pvo_head = vm_page_to_pvoh(m);
1909 for (pvo = LIST_FIRST(pvo_head); pvo != NULL; pvo = next_pvo) {
1910 next_pvo = LIST_NEXT(pvo, pvo_vlink);
1912 pmap = pvo->pvo_pmap;
1914 moea_pvo_remove(pvo, -1);
1917 if ((m->a.flags & PGA_WRITEABLE) && moea_query_bit(m, PTE_CHG)) {
1918 moea_attr_clear(m, PTE_CHG);
1921 vm_page_aflag_clear(m, PGA_WRITEABLE);
1922 rw_wunlock(&pvh_global_lock);
1926 * Allocate a physical page of memory directly from the phys_avail map.
1927 * Can only be called from moea_bootstrap before avail start and end are
1931 moea_bootstrap_alloc(vm_size_t size, u_int align)
1936 size = round_page(size);
1937 for (i = 0; phys_avail[i + 1] != 0; i += 2) {
1939 s = roundup2(phys_avail[i], align);
1944 if (s < phys_avail[i] || e > phys_avail[i + 1])
1947 if (s == phys_avail[i]) {
1948 phys_avail[i] += size;
1949 } else if (e == phys_avail[i + 1]) {
1950 phys_avail[i + 1] -= size;
1952 for (j = phys_avail_count * 2; j > i; j -= 2) {
1953 phys_avail[j] = phys_avail[j - 2];
1954 phys_avail[j + 1] = phys_avail[j - 1];
1957 phys_avail[i + 3] = phys_avail[i + 1];
1958 phys_avail[i + 1] = s;
1959 phys_avail[i + 2] = e;
1965 panic("moea_bootstrap_alloc: could not allocate memory");
1969 moea_syncicache(vm_paddr_t pa, vm_size_t len)
1971 __syncicache((void *)pa, len);
1975 moea_pvo_enter(pmap_t pm, uma_zone_t zone, struct pvo_head *pvo_head,
1976 vm_offset_t va, vm_paddr_t pa, u_int pte_lo, int flags)
1978 struct pvo_entry *pvo;
1985 moea_pvo_enter_calls++;
1990 * Compute the PTE Group index.
1993 sr = va_to_sr(pm->pm_sr, va);
1994 ptegidx = va_to_pteg(sr, va);
1997 * Remove any existing mapping for this page. Reuse the pvo entry if
1998 * there is a mapping.
2000 mtx_lock(&moea_table_mutex);
2001 LIST_FOREACH(pvo, &moea_pvo_table[ptegidx], pvo_olink) {
2002 if (pvo->pvo_pmap == pm && PVO_VADDR(pvo) == va) {
2003 if ((pvo->pvo_pte.pte.pte_lo & PTE_RPGN) == pa &&
2004 (pvo->pvo_pte.pte.pte_lo & PTE_PP) ==
2005 (pte_lo & PTE_PP)) {
2007 * The PTE is not changing. Instead, this may
2008 * be a request to change the mapping's wired
2011 mtx_unlock(&moea_table_mutex);
2012 if ((flags & PVO_WIRED) != 0 &&
2013 (pvo->pvo_vaddr & PVO_WIRED) == 0) {
2014 pvo->pvo_vaddr |= PVO_WIRED;
2015 pm->pm_stats.wired_count++;
2016 } else if ((flags & PVO_WIRED) == 0 &&
2017 (pvo->pvo_vaddr & PVO_WIRED) != 0) {
2018 pvo->pvo_vaddr &= ~PVO_WIRED;
2019 pm->pm_stats.wired_count--;
2023 moea_pvo_remove(pvo, -1);
2029 * If we aren't overwriting a mapping, try to allocate.
2031 if (moea_initialized) {
2032 pvo = uma_zalloc(zone, M_NOWAIT);
2034 if (moea_bpvo_pool_index >= BPVO_POOL_SIZE) {
2035 panic("moea_enter: bpvo pool exhausted, %d, %d, %d",
2036 moea_bpvo_pool_index, BPVO_POOL_SIZE,
2037 BPVO_POOL_SIZE * sizeof(struct pvo_entry));
2039 pvo = &moea_bpvo_pool[moea_bpvo_pool_index];
2040 moea_bpvo_pool_index++;
2045 mtx_unlock(&moea_table_mutex);
2050 pvo->pvo_vaddr = va;
2052 LIST_INSERT_HEAD(&moea_pvo_table[ptegidx], pvo, pvo_olink);
2053 pvo->pvo_vaddr &= ~ADDR_POFF;
2054 if (flags & PVO_WIRED)
2055 pvo->pvo_vaddr |= PVO_WIRED;
2056 if (pvo_head != &moea_pvo_kunmanaged)
2057 pvo->pvo_vaddr |= PVO_MANAGED;
2059 pvo->pvo_vaddr |= PVO_BOOTSTRAP;
2061 moea_pte_create(&pvo->pvo_pte.pte, sr, va, pa | pte_lo);
2066 RB_INSERT(pvo_tree, &pm->pmap_pvo, pvo);
2069 * Remember if the list was empty and therefore will be the first
2072 if (LIST_FIRST(pvo_head) == NULL)
2074 LIST_INSERT_HEAD(pvo_head, pvo, pvo_vlink);
2076 if (pvo->pvo_vaddr & PVO_WIRED)
2077 pm->pm_stats.wired_count++;
2078 pm->pm_stats.resident_count++;
2080 i = moea_pte_insert(ptegidx, &pvo->pvo_pte.pte);
2081 KASSERT(i < 8, ("Invalid PTE index"));
2083 PVO_PTEGIDX_SET(pvo, i);
2085 panic("moea_pvo_enter: overflow");
2086 moea_pte_overflow++;
2088 mtx_unlock(&moea_table_mutex);
2090 return (first ? ENOENT : 0);
2094 moea_pvo_remove(struct pvo_entry *pvo, int pteidx)
2099 * If there is an active pte entry, we need to deactivate it (and
2100 * save the ref & cfg bits).
2102 pt = moea_pvo_to_pte(pvo, pteidx);
2104 moea_pte_unset(pt, &pvo->pvo_pte.pte, pvo->pvo_vaddr);
2105 mtx_unlock(&moea_table_mutex);
2106 PVO_PTEGIDX_CLR(pvo);
2108 moea_pte_overflow--;
2112 * Update our statistics.
2114 pvo->pvo_pmap->pm_stats.resident_count--;
2115 if (pvo->pvo_vaddr & PVO_WIRED)
2116 pvo->pvo_pmap->pm_stats.wired_count--;
2119 * Remove this PVO from the PV and pmap lists.
2121 LIST_REMOVE(pvo, pvo_vlink);
2122 RB_REMOVE(pvo_tree, &pvo->pvo_pmap->pmap_pvo, pvo);
2125 * Save the REF/CHG bits into their cache if the page is managed.
2126 * Clear PGA_WRITEABLE if all mappings of the page have been removed.
2128 if ((pvo->pvo_vaddr & PVO_MANAGED) == PVO_MANAGED) {
2131 pg = PHYS_TO_VM_PAGE(pvo->pvo_pte.pte.pte_lo & PTE_RPGN);
2133 moea_attr_save(pg, pvo->pvo_pte.pte.pte_lo &
2134 (PTE_REF | PTE_CHG));
2135 if (LIST_EMPTY(&pg->md.mdpg_pvoh))
2136 vm_page_aflag_clear(pg, PGA_WRITEABLE);
2141 * Remove this from the overflow list and return it to the pool
2142 * if we aren't going to reuse it.
2144 LIST_REMOVE(pvo, pvo_olink);
2145 if (!(pvo->pvo_vaddr & PVO_BOOTSTRAP))
2146 uma_zfree(pvo->pvo_vaddr & PVO_MANAGED ? moea_mpvo_zone :
2147 moea_upvo_zone, pvo);
2149 moea_pvo_remove_calls++;
2153 moea_pvo_pte_index(const struct pvo_entry *pvo, int ptegidx)
2158 * We can find the actual pte entry without searching by grabbing
2159 * the PTEG index from 3 unused bits in pte_lo[11:9] and by
2160 * noticing the HID bit.
2162 pteidx = ptegidx * 8 + PVO_PTEGIDX_GET(pvo);
2163 if (pvo->pvo_pte.pte.pte_hi & PTE_HID)
2164 pteidx ^= moea_pteg_mask * 8;
2169 static struct pvo_entry *
2170 moea_pvo_find_va(pmap_t pm, vm_offset_t va, int *pteidx_p)
2172 struct pvo_entry *pvo;
2177 sr = va_to_sr(pm->pm_sr, va);
2178 ptegidx = va_to_pteg(sr, va);
2180 mtx_lock(&moea_table_mutex);
2181 LIST_FOREACH(pvo, &moea_pvo_table[ptegidx], pvo_olink) {
2182 if (pvo->pvo_pmap == pm && PVO_VADDR(pvo) == va) {
2184 *pteidx_p = moea_pvo_pte_index(pvo, ptegidx);
2188 mtx_unlock(&moea_table_mutex);
2194 moea_pvo_to_pte(const struct pvo_entry *pvo, int pteidx)
2199 * If we haven't been supplied the ptegidx, calculate it.
2205 sr = va_to_sr(pvo->pvo_pmap->pm_sr, pvo->pvo_vaddr);
2206 ptegidx = va_to_pteg(sr, pvo->pvo_vaddr);
2207 pteidx = moea_pvo_pte_index(pvo, ptegidx);
2210 pt = &moea_pteg_table[pteidx >> 3].pt[pteidx & 7];
2211 mtx_lock(&moea_table_mutex);
2213 if ((pvo->pvo_pte.pte.pte_hi & PTE_VALID) && !PVO_PTEGIDX_ISSET(pvo)) {
2214 panic("moea_pvo_to_pte: pvo %p has valid pte in pvo but no "
2215 "valid pte index", pvo);
2218 if ((pvo->pvo_pte.pte.pte_hi & PTE_VALID) == 0 && PVO_PTEGIDX_ISSET(pvo)) {
2219 panic("moea_pvo_to_pte: pvo %p has valid pte index in pvo "
2220 "pvo but no valid pte", pvo);
2223 if ((pt->pte_hi ^ (pvo->pvo_pte.pte.pte_hi & ~PTE_VALID)) == PTE_VALID) {
2224 if ((pvo->pvo_pte.pte.pte_hi & PTE_VALID) == 0) {
2225 panic("moea_pvo_to_pte: pvo %p has valid pte in "
2226 "moea_pteg_table %p but invalid in pvo", pvo, pt);
2229 if (((pt->pte_lo ^ pvo->pvo_pte.pte.pte_lo) & ~(PTE_CHG|PTE_REF))
2231 panic("moea_pvo_to_pte: pvo %p pte does not match "
2232 "pte %p in moea_pteg_table", pvo, pt);
2235 mtx_assert(&moea_table_mutex, MA_OWNED);
2239 if (pvo->pvo_pte.pte.pte_hi & PTE_VALID) {
2240 panic("moea_pvo_to_pte: pvo %p has invalid pte %p in "
2241 "moea_pteg_table but valid in pvo: %8x, %8x", pvo, pt, pvo->pvo_pte.pte.pte_hi, pt->pte_hi);
2244 mtx_unlock(&moea_table_mutex);
2249 * XXX: THIS STUFF SHOULD BE IN pte.c?
2252 moea_pte_spill(vm_offset_t addr)
2254 struct pvo_entry *source_pvo, *victim_pvo;
2255 struct pvo_entry *pvo;
2264 ptegidx = va_to_pteg(sr, addr);
2267 * Have to substitute some entry. Use the primary hash for this.
2268 * Use low bits of timebase as random generator.
2270 pteg = &moea_pteg_table[ptegidx];
2271 mtx_lock(&moea_table_mutex);
2272 __asm __volatile("mftb %0" : "=r"(i));
2278 LIST_FOREACH(pvo, &moea_pvo_table[ptegidx], pvo_olink) {
2280 * We need to find a pvo entry for this address.
2282 if (source_pvo == NULL &&
2283 moea_pte_match(&pvo->pvo_pte.pte, sr, addr,
2284 pvo->pvo_pte.pte.pte_hi & PTE_HID)) {
2286 * Now found an entry to be spilled into the pteg.
2287 * The PTE is now valid, so we know it's active.
2289 j = moea_pte_insert(ptegidx, &pvo->pvo_pte.pte);
2292 PVO_PTEGIDX_SET(pvo, j);
2293 moea_pte_overflow--;
2294 mtx_unlock(&moea_table_mutex);
2300 if (victim_pvo != NULL)
2305 * We also need the pvo entry of the victim we are replacing
2306 * so save the R & C bits of the PTE.
2308 if ((pt->pte_hi & PTE_HID) == 0 && victim_pvo == NULL &&
2309 moea_pte_compare(pt, &pvo->pvo_pte.pte)) {
2311 if (source_pvo != NULL)
2316 if (source_pvo == NULL) {
2317 mtx_unlock(&moea_table_mutex);
2321 if (victim_pvo == NULL) {
2322 if ((pt->pte_hi & PTE_HID) == 0)
2323 panic("moea_pte_spill: victim p-pte (%p) has no pvo"
2327 * If this is a secondary PTE, we need to search it's primary
2328 * pvo bucket for the matching PVO.
2330 LIST_FOREACH(pvo, &moea_pvo_table[ptegidx ^ moea_pteg_mask],
2333 * We also need the pvo entry of the victim we are
2334 * replacing so save the R & C bits of the PTE.
2336 if (moea_pte_compare(pt, &pvo->pvo_pte.pte)) {
2342 if (victim_pvo == NULL)
2343 panic("moea_pte_spill: victim s-pte (%p) has no pvo"
2348 * We are invalidating the TLB entry for the EA we are replacing even
2349 * though it's valid. If we don't, we lose any ref/chg bit changes
2350 * contained in the TLB entry.
2352 source_pvo->pvo_pte.pte.pte_hi &= ~PTE_HID;
2354 moea_pte_unset(pt, &victim_pvo->pvo_pte.pte, victim_pvo->pvo_vaddr);
2355 moea_pte_set(pt, &source_pvo->pvo_pte.pte);
2357 PVO_PTEGIDX_CLR(victim_pvo);
2358 PVO_PTEGIDX_SET(source_pvo, i);
2359 moea_pte_replacements++;
2361 mtx_unlock(&moea_table_mutex);
2365 static __inline struct pvo_entry *
2366 moea_pte_spillable_ident(u_int ptegidx)
2369 struct pvo_entry *pvo_walk, *pvo = NULL;
2371 LIST_FOREACH(pvo_walk, &moea_pvo_table[ptegidx], pvo_olink) {
2372 if (pvo_walk->pvo_vaddr & PVO_WIRED)
2375 if (!(pvo_walk->pvo_pte.pte.pte_hi & PTE_VALID))
2378 pt = moea_pvo_to_pte(pvo_walk, -1);
2385 mtx_unlock(&moea_table_mutex);
2386 if (!(pt->pte_lo & PTE_REF))
2394 moea_pte_insert(u_int ptegidx, struct pte *pvo_pt)
2397 struct pvo_entry *victim_pvo;
2400 u_int pteg_bkpidx = ptegidx;
2402 mtx_assert(&moea_table_mutex, MA_OWNED);
2405 * First try primary hash.
2407 for (pt = moea_pteg_table[ptegidx].pt, i = 0; i < 8; i++, pt++) {
2408 if ((pt->pte_hi & PTE_VALID) == 0) {
2409 pvo_pt->pte_hi &= ~PTE_HID;
2410 moea_pte_set(pt, pvo_pt);
2416 * Now try secondary hash.
2418 ptegidx ^= moea_pteg_mask;
2420 for (pt = moea_pteg_table[ptegidx].pt, i = 0; i < 8; i++, pt++) {
2421 if ((pt->pte_hi & PTE_VALID) == 0) {
2422 pvo_pt->pte_hi |= PTE_HID;
2423 moea_pte_set(pt, pvo_pt);
2428 /* Try again, but this time try to force a PTE out. */
2429 ptegidx = pteg_bkpidx;
2431 victim_pvo = moea_pte_spillable_ident(ptegidx);
2432 if (victim_pvo == NULL) {
2433 ptegidx ^= moea_pteg_mask;
2434 victim_pvo = moea_pte_spillable_ident(ptegidx);
2437 if (victim_pvo == NULL) {
2438 panic("moea_pte_insert: overflow");
2442 victim_idx = moea_pvo_pte_index(victim_pvo, ptegidx);
2444 if (pteg_bkpidx == ptegidx)
2445 pvo_pt->pte_hi &= ~PTE_HID;
2447 pvo_pt->pte_hi |= PTE_HID;
2450 * Synchronize the sacrifice PTE with its PVO, then mark both
2451 * invalid. The PVO will be reused when/if the VM system comes
2452 * here after a fault.
2454 pt = &moea_pteg_table[victim_idx >> 3].pt[victim_idx & 7];
2456 if (pt->pte_hi != victim_pvo->pvo_pte.pte.pte_hi)
2457 panic("Victim PVO doesn't match PTE! PVO: %8x, PTE: %8x", victim_pvo->pvo_pte.pte.pte_hi, pt->pte_hi);
2462 moea_pte_unset(pt, &victim_pvo->pvo_pte.pte, victim_pvo->pvo_vaddr);
2463 PVO_PTEGIDX_CLR(victim_pvo);
2464 moea_pte_overflow++;
2465 moea_pte_set(pt, pvo_pt);
2467 return (victim_idx & 7);
2471 moea_query_bit(vm_page_t m, int ptebit)
2473 struct pvo_entry *pvo;
2476 rw_assert(&pvh_global_lock, RA_WLOCKED);
2477 if (moea_attr_fetch(m) & ptebit)
2480 LIST_FOREACH(pvo, vm_page_to_pvoh(m), pvo_vlink) {
2483 * See if we saved the bit off. If so, cache it and return
2486 if (pvo->pvo_pte.pte.pte_lo & ptebit) {
2487 moea_attr_save(m, ptebit);
2493 * No luck, now go through the hard part of looking at the PTEs
2494 * themselves. Sync so that any pending REF/CHG bits are flushed to
2498 LIST_FOREACH(pvo, vm_page_to_pvoh(m), pvo_vlink) {
2501 * See if this pvo has a valid PTE. if so, fetch the
2502 * REF/CHG bits from the valid PTE. If the appropriate
2503 * ptebit is set, cache it and return success.
2505 pt = moea_pvo_to_pte(pvo, -1);
2507 moea_pte_synch(pt, &pvo->pvo_pte.pte);
2508 mtx_unlock(&moea_table_mutex);
2509 if (pvo->pvo_pte.pte.pte_lo & ptebit) {
2510 moea_attr_save(m, ptebit);
2520 moea_clear_bit(vm_page_t m, int ptebit)
2523 struct pvo_entry *pvo;
2526 rw_assert(&pvh_global_lock, RA_WLOCKED);
2529 * Clear the cached value.
2531 moea_attr_clear(m, ptebit);
2534 * Sync so that any pending REF/CHG bits are flushed to the PTEs (so
2535 * we can reset the right ones). note that since the pvo entries and
2536 * list heads are accessed via BAT0 and are never placed in the page
2537 * table, we don't have to worry about further accesses setting the
2543 * For each pvo entry, clear the pvo's ptebit. If this pvo has a
2544 * valid pte clear the ptebit from the valid pte.
2547 LIST_FOREACH(pvo, vm_page_to_pvoh(m), pvo_vlink) {
2548 pt = moea_pvo_to_pte(pvo, -1);
2550 moea_pte_synch(pt, &pvo->pvo_pte.pte);
2551 if (pvo->pvo_pte.pte.pte_lo & ptebit) {
2553 moea_pte_clear(pt, PVO_VADDR(pvo), ptebit);
2555 mtx_unlock(&moea_table_mutex);
2557 pvo->pvo_pte.pte.pte_lo &= ~ptebit;
2564 * Return true if the physical range is encompassed by the battable[idx]
2567 moea_bat_mapped(int idx, vm_paddr_t pa, vm_size_t size)
2575 * Return immediately if not a valid mapping
2577 if (!(battable[idx].batu & BAT_Vs))
2581 * The BAT entry must be cache-inhibited, guarded, and r/w
2582 * so it can function as an i/o page
2584 prot = battable[idx].batl & (BAT_I|BAT_G|BAT_PP_RW);
2585 if (prot != (BAT_I|BAT_G|BAT_PP_RW))
2589 * The address should be within the BAT range. Assume that the
2590 * start address in the BAT has the correct alignment (thus
2591 * not requiring masking)
2593 start = battable[idx].batl & BAT_PBS;
2594 bat_ble = (battable[idx].batu & ~(BAT_EBS)) | 0x03;
2595 end = start | (bat_ble << 15) | 0x7fff;
2597 if ((pa < start) || ((pa + size) > end))
2604 moea_dev_direct_mapped(mmu_t mmu, vm_paddr_t pa, vm_size_t size)
2609 * This currently does not work for entries that
2610 * overlap 256M BAT segments.
2613 for(i = 0; i < 16; i++)
2614 if (moea_bat_mapped(i, pa, size) == 0)
2621 * Map a set of physical memory pages into the kernel virtual
2622 * address space. Return a pointer to where it is mapped. This
2623 * routine is intended to be used for mapping device memory,
2627 moea_mapdev(mmu_t mmu, vm_paddr_t pa, vm_size_t size)
2630 return (moea_mapdev_attr(mmu, pa, size, VM_MEMATTR_DEFAULT));
2634 moea_mapdev_attr(mmu_t mmu, vm_paddr_t pa, vm_size_t size, vm_memattr_t ma)
2636 vm_offset_t va, tmpva, ppa, offset;
2639 ppa = trunc_page(pa);
2640 offset = pa & PAGE_MASK;
2641 size = roundup(offset + size, PAGE_SIZE);
2644 * If the physical address lies within a valid BAT table entry,
2645 * return the 1:1 mapping. This currently doesn't work
2646 * for regions that overlap 256M BAT segments.
2648 for (i = 0; i < 16; i++) {
2649 if (moea_bat_mapped(i, pa, size) == 0)
2650 return ((void *) pa);
2653 va = kva_alloc(size);
2655 panic("moea_mapdev: Couldn't alloc kernel virtual memory");
2657 for (tmpva = va; size > 0;) {
2658 moea_kenter_attr(mmu, tmpva, ppa, ma);
2665 return ((void *)(va + offset));
2669 moea_unmapdev(mmu_t mmu, vm_offset_t va, vm_size_t size)
2671 vm_offset_t base, offset;
2674 * If this is outside kernel virtual space, then it's a
2675 * battable entry and doesn't require unmapping
2677 if ((va >= VM_MIN_KERNEL_ADDRESS) && (va <= virtual_end)) {
2678 base = trunc_page(va);
2679 offset = va & PAGE_MASK;
2680 size = roundup(offset + size, PAGE_SIZE);
2681 kva_free(base, size);
2686 moea_sync_icache(mmu_t mmu, pmap_t pm, vm_offset_t va, vm_size_t sz)
2688 struct pvo_entry *pvo;
2695 lim = round_page(va + 1);
2696 len = MIN(lim - va, sz);
2697 pvo = moea_pvo_find_va(pm, va & ~ADDR_POFF, NULL);
2699 pa = (pvo->pvo_pte.pte.pte_lo & PTE_RPGN) |
2701 moea_syncicache(pa, len);
2710 moea_dumpsys_map(mmu_t mmu, vm_paddr_t pa, size_t sz, void **va)
2716 extern struct dump_pa dump_map[PHYS_AVAIL_SZ + 1];
2719 moea_scan_init(mmu_t mmu)
2721 struct pvo_entry *pvo;
2726 /* Initialize phys. segments for dumpsys(). */
2727 memset(&dump_map, 0, sizeof(dump_map));
2728 mem_regions(&pregions, &pregions_sz, ®ions, ®ions_sz);
2729 for (i = 0; i < pregions_sz; i++) {
2730 dump_map[i].pa_start = pregions[i].mr_start;
2731 dump_map[i].pa_size = pregions[i].mr_size;
2736 /* Virtual segments for minidumps: */
2737 memset(&dump_map, 0, sizeof(dump_map));
2739 /* 1st: kernel .data and .bss. */
2740 dump_map[0].pa_start = trunc_page((uintptr_t)_etext);
2741 dump_map[0].pa_size =
2742 round_page((uintptr_t)_end) - dump_map[0].pa_start;
2744 /* 2nd: msgbuf and tables (see pmap_bootstrap()). */
2745 dump_map[1].pa_start = (vm_paddr_t)msgbufp->msg_ptr;
2746 dump_map[1].pa_size = round_page(msgbufp->msg_size);
2748 /* 3rd: kernel VM. */
2749 va = dump_map[1].pa_start + dump_map[1].pa_size;
2750 /* Find start of next chunk (from va). */
2751 while (va < virtual_end) {
2752 /* Don't dump the buffer cache. */
2753 if (va >= kmi.buffer_sva && va < kmi.buffer_eva) {
2754 va = kmi.buffer_eva;
2757 pvo = moea_pvo_find_va(kernel_pmap, va & ~ADDR_POFF, NULL);
2758 if (pvo != NULL && (pvo->pvo_pte.pte.pte_hi & PTE_VALID))
2762 if (va < virtual_end) {
2763 dump_map[2].pa_start = va;
2765 /* Find last page in chunk. */
2766 while (va < virtual_end) {
2767 /* Don't run into the buffer cache. */
2768 if (va == kmi.buffer_sva)
2770 pvo = moea_pvo_find_va(kernel_pmap, va & ~ADDR_POFF,
2773 !(pvo->pvo_pte.pte.pte_hi & PTE_VALID))
2777 dump_map[2].pa_size = va - dump_map[2].pa_start;