2 * Copyright (c) 1997 Berkeley Software Design, Inc. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
7 * 1. Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
12 * 3. Berkeley Software Design Inc's name may not be used to endorse or
13 * promote products derived from this software without specific prior
16 * THIS SOFTWARE IS PROVIDED BY BERKELEY SOFTWARE DESIGN INC ``AS IS'' AND
17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL BERKELEY SOFTWARE DESIGN INC BE LIABLE
20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 * from BSDI: pmap.c,v 1.28.2.15 2000/04/27 03:10:31 cp Exp
35 #include <sys/param.h>
36 #include <sys/queue.h>
38 #include <sys/linker_set.h>
40 #include <sys/mutex.h>
43 #include <sys/sysctl.h>
44 #include <sys/systm.h>
47 #include <vm/vm_param.h>
48 #include <vm/vm_kern.h>
49 #include <vm/vm_page.h>
50 #include <vm/vm_map.h>
51 #include <vm/vm_object.h>
52 #include <vm/vm_extern.h>
53 #include <vm/vm_pageout.h>
54 #include <vm/vm_pager.h>
56 #include <machine/cpufunc.h>
57 #include <machine/frame.h>
58 #include <machine/trap.h>
59 #include <machine/pmap.h>
60 #include <machine/smp.h>
61 #include <machine/tlb.h>
62 #include <machine/tsb.h>
63 #include <machine/tte.h>
65 CTASSERT((1 << TTE_SHIFT) == sizeof(struct tte));
66 CTASSERT(TSB_BUCKET_MASK < (1 << 12));
68 PMAP_STATS_VAR(tsb_nrepl);
69 PMAP_STATS_VAR(tsb_nlookup_k);
70 PMAP_STATS_VAR(tsb_nlookup_u);
71 PMAP_STATS_VAR(tsb_nenter_k);
72 PMAP_STATS_VAR(tsb_nenter_k_oc);
73 PMAP_STATS_VAR(tsb_nenter_u);
74 PMAP_STATS_VAR(tsb_nenter_u_oc);
75 PMAP_STATS_VAR(tsb_nforeach);
77 struct tte *tsb_kernel;
78 vm_size_t tsb_kernel_mask;
79 vm_size_t tsb_kernel_size;
80 vm_paddr_t tsb_kernel_phys;
83 tsb_tte_lookup(pmap_t pm, vm_offset_t va)
90 if (pm == kernel_pmap) {
91 PMAP_STATS_INC(tsb_nlookup_k);
93 if (tte_match(tp, va))
96 PMAP_LOCK_ASSERT(pm, MA_OWNED);
97 PMAP_STATS_INC(tsb_nlookup_u);
98 for (sz = TS_MIN; sz <= TS_MAX; sz++) {
99 bucket = tsb_vtobucket(pm, sz, va);
100 for (i = 0; i < TSB_BUCKET_SIZE; i++) {
102 if (tte_match(tp, va))
111 tsb_tte_enter(pmap_t pm, vm_page_t m, vm_offset_t va, u_long sz, u_long data)
120 if (DCACHE_COLOR(VM_PAGE_TO_PHYS(m)) != DCACHE_COLOR(va)) {
122 "tsb_tte_enter: off colour va=%#lx pa=%#lx o=%p oc=%#lx ot=%d pi=%#lx",
123 va, VM_PAGE_TO_PHYS(m), m->object,
124 m->object ? m->object->pg_color : -1,
125 m->object ? m->object->type : -1,
127 if (pm == kernel_pmap)
128 PMAP_STATS_INC(tsb_nenter_k_oc);
130 PMAP_STATS_INC(tsb_nenter_u_oc);
133 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
134 PMAP_LOCK_ASSERT(pm, MA_OWNED);
135 if (pm == kernel_pmap) {
136 PMAP_STATS_INC(tsb_nenter_k);
137 tp = tsb_kvtotte(va);
138 KASSERT((tp->tte_data & TD_V) == 0,
139 ("tsb_tte_enter: replacing valid kernel mapping"));
142 PMAP_STATS_INC(tsb_nenter_u);
144 bucket = tsb_vtobucket(pm, sz, va);
148 b0 = rd(tick) & (TSB_BUCKET_SIZE - 1);
151 if ((bucket[i].tte_data & TD_V) == 0) {
156 if ((bucket[i].tte_data & TD_REF) == 0)
158 else if (rtp == NULL)
161 } while ((i = (i + 1) & (TSB_BUCKET_SIZE - 1)) != b0);
165 if ((tp->tte_data & TD_V) != 0) {
166 PMAP_STATS_INC(tsb_nrepl);
167 ova = TTE_GET_VA(tp);
168 pmap_remove_tte(pm, NULL, tp, ova);
169 tlb_page_demap(pm, ova);
173 if ((m->flags & PG_FICTITIOUS) == 0) {
175 if ((m->flags & PG_UNMANAGED) == 0) {
176 pm->pm_stats.resident_count++;
179 if (pmap_cache_enter(m, va) != 0)
181 TAILQ_INSERT_TAIL(&m->md.tte_list, tp, tte_link);
183 data |= TD_FAKE | TD_E;
185 tp->tte_vpn = TV_VPN(va, sz);
192 * Traverse the tsb of a pmap, calling the callback function for any tte entry
193 * that has a virtual address between start and end. If this function returns 0,
194 * tsb_foreach() terminates.
195 * This is used by pmap_remove(), pmap_protect(), and pmap_copy() in the case
196 * that the number of pages in the range given to them reaches the
197 * dimensions of the tsb size as an optimization.
200 tsb_foreach(pmap_t pm1, pmap_t pm2, vm_offset_t start, vm_offset_t end,
201 tsb_callback_t *callback)
209 PMAP_STATS_INC(tsb_nforeach);
210 if (pm1 == kernel_pmap) {
212 n = tsb_kernel_size / sizeof(struct tte);
217 for (i = 0; i < n; i++) {
219 if ((tp->tte_data & TD_V) != 0) {
221 if (va >= start && va < end) {
222 if (!callback(pm1, pm2, tp, va))