2 * Copyright (c) 2004-2010 Juli Mallett <jmallett@FreeBSD.org>
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 #include <sys/param.h>
32 #include <sys/kernel.h>
33 #include <sys/systm.h>
40 #include <machine/pte.h>
41 #include <machine/tlb.h>
49 } entry[MIPS_MAX_TLB_ENTRIES];
52 static struct tlb_state tlb_state[MAXCPU];
56 * PageMask must increment in steps of 2 bits.
58 COMPILE_TIME_ASSERT(POPCNT(TLBMASK_MASK) % 2 == 0);
64 __asm __volatile ("tlbp" : : : "memory");
71 __asm __volatile ("tlbr" : : : "memory");
76 tlb_write_indexed(void)
78 __asm __volatile ("tlbwi" : : : "memory");
83 tlb_write_random(void)
85 __asm __volatile ("tlbwr" : : : "memory");
89 static void tlb_invalidate_one(unsigned);
92 tlb_insert_wired(unsigned i, vm_offset_t va, pt_entry_t pte0, pt_entry_t pte1)
100 asid = mips_rd_entryhi() & TLBHI_ASID_MASK;
104 mips_wr_entryhi(TLBHI_ENTRY(va, 0));
105 mips_wr_entrylo0(pte0);
106 mips_wr_entrylo1(pte1);
109 mips_wr_entryhi(asid);
114 tlb_invalidate_address(struct pmap *pmap, vm_offset_t va)
123 asid = mips_rd_entryhi() & TLBHI_ASID_MASK;
126 mips_wr_entryhi(TLBHI_ENTRY(va, pmap_asid(pmap)));
130 tlb_invalidate_one(i);
132 mips_wr_entryhi(asid);
137 tlb_invalidate_all(void)
144 asid = mips_rd_entryhi() & TLBHI_ASID_MASK;
146 for (i = mips_rd_wired(); i < num_tlbentries; i++)
147 tlb_invalidate_one(i);
149 mips_wr_entryhi(asid);
154 tlb_invalidate_all_user(struct pmap *pmap)
161 asid = mips_rd_entryhi() & TLBHI_ASID_MASK;
163 for (i = mips_rd_wired(); i < num_tlbentries; i++) {
169 uasid = mips_rd_entryhi() & TLBHI_ASID_MASK;
172 * Invalidate all non-kernel entries.
178 * Invalidate this pmap's entries.
180 if (uasid != pmap_asid(pmap))
183 tlb_invalidate_one(i);
186 mips_wr_entryhi(asid);
191 * Invalidates any TLB entries that map a virtual page from the specified
192 * address range. If "end" is zero, then every virtual page is considered to
193 * be within the address range's upper bound.
196 tlb_invalidate_range(pmap_t pmap, vm_offset_t start, vm_offset_t end)
198 register_t asid, end_hi, hi, hi_pagemask, s, save_asid, start_hi;
201 KASSERT(start < end || (end == 0 && start > 0),
202 ("tlb_invalidate_range: invalid range"));
205 * Truncate the virtual address "start" to an even page frame number,
206 * and round the virtual address "end" to an even page frame number.
208 start &= ~((1 << TLBMASK_SHIFT) - 1);
209 end = (end + (1 << TLBMASK_SHIFT) - 1) & ~((1 << TLBMASK_SHIFT) - 1);
212 save_asid = mips_rd_entryhi() & TLBHI_ASID_MASK;
214 asid = pmap_asid(pmap);
215 start_hi = TLBHI_ENTRY(start, asid);
216 end_hi = TLBHI_ENTRY(end, asid);
219 * Select the fastest method for invalidating the TLB entries.
221 if (end - start < num_tlbentries << TLBMASK_SHIFT || (end == 0 &&
222 start >= -(num_tlbentries << TLBMASK_SHIFT))) {
224 * The virtual address range is small compared to the size of
225 * the TLB. Probe the TLB for each even numbered page frame
226 * within the virtual address range.
228 for (hi = start_hi; hi != end_hi; hi += 1 << TLBMASK_SHIFT) {
234 tlb_invalidate_one(i);
238 * The virtual address range is large compared to the size of
239 * the TLB. Test every non-wired TLB entry.
241 for (i = mips_rd_wired(); i < num_tlbentries; i++) {
244 hi = mips_rd_entryhi();
245 if ((hi & TLBHI_ASID_MASK) == asid && (hi < end_hi ||
248 * If "hi" is a large page that spans
249 * "start_hi", then it must be invalidated.
251 hi_pagemask = mips_rd_pagemask();
252 if (hi >= (start_hi & ~(hi_pagemask <<
254 tlb_invalidate_one(i);
259 mips_wr_entryhi(save_asid);
263 /* XXX Only if DDB? */
269 cpu = PCPU_GET(cpuid);
271 tlb_state[cpu].wired = mips_rd_wired();
272 for (i = 0; i < num_tlbentries; i++) {
276 tlb_state[cpu].entry[i].entryhi = mips_rd_entryhi();
277 tlb_state[cpu].entry[i].entrylo0 = mips_rd_entrylo0();
278 tlb_state[cpu].entry[i].entrylo1 = mips_rd_entrylo1();
283 tlb_update(struct pmap *pmap, vm_offset_t va, pt_entry_t pte)
290 pte &= ~TLBLO_SWBITS_MASK;
293 asid = mips_rd_entryhi() & TLBHI_ASID_MASK;
296 mips_wr_entryhi(TLBHI_ENTRY(va, pmap_asid(pmap)));
302 if ((va & PAGE_SIZE) == 0) {
303 mips_wr_entrylo0(pte);
305 mips_wr_entrylo1(pte);
310 mips_wr_entryhi(asid);
315 tlb_invalidate_one(unsigned i)
317 /* XXX an invalid ASID? */
318 mips_wr_entryhi(TLBHI_ENTRY(MIPS_KSEG0_START + (2 * i * PAGE_SIZE), 0));
329 DB_SHOW_COMMAND(tlb, ddb_dump_tlb)
331 register_t ehi, elo0, elo1;
336 * The worst conversion from hex to decimal ever.
339 cpu = ((addr >> 4) % 16) * 10 + (addr % 16);
341 cpu = PCPU_GET(cpuid);
343 if (cpu < 0 || cpu >= mp_ncpus) {
344 db_printf("Invalid CPU %u\n", cpu);
348 if (cpu == PCPU_GET(cpuid))
351 db_printf("Beginning TLB dump for CPU %u...\n", cpu);
352 for (i = 0; i < num_tlbentries; i++) {
353 if (i == tlb_state[cpu].wired) {
355 db_printf("^^^ WIRED ENTRIES ^^^\n");
357 db_printf("(No wired entries.)\n");
361 ehi = tlb_state[cpu].entry[i].entryhi;
362 elo0 = tlb_state[cpu].entry[i].entrylo0;
363 elo1 = tlb_state[cpu].entry[i].entrylo1;
365 if (elo0 == 0 && elo1 == 0)
368 db_printf("#%u\t=> %jx\n", i, (intmax_t)ehi);
369 db_printf(" Lo0\t%jx\t(%#jx)\n", (intmax_t)elo0, (intmax_t)TLBLO_PTE_TO_PA(elo0));
370 db_printf(" Lo1\t%jx\t(%#jx)\n", (intmax_t)elo1, (intmax_t)TLBLO_PTE_TO_PA(elo1));
372 db_printf("Finished.\n");