tlb.cc revision 10824
17008Snate@binkert.org/* 27008Snate@binkert.org * Copyright (c) 2001-2005 The Regents of The University of Michigan 37008Snate@binkert.org * All rights reserved. 47008Snate@binkert.org * 57008Snate@binkert.org * Redistribution and use in source and binary forms, with or without 67008Snate@binkert.org * modification, are permitted provided that the following conditions are 77008Snate@binkert.org * met: redistributions of source code must retain the above copyright 87008Snate@binkert.org * notice, this list of conditions and the following disclaimer; 97008Snate@binkert.org * redistributions in binary form must reproduce the above copyright 107008Snate@binkert.org * notice, this list of conditions and the following disclaimer in the 117008Snate@binkert.org * documentation and/or other materials provided with the distribution; 127008Snate@binkert.org * neither the name of the copyright holders nor the names of its 137008Snate@binkert.org * contributors may be used to endorse or promote products derived from 147008Snate@binkert.org * this software without specific prior written permission. 157008Snate@binkert.org * 167008Snate@binkert.org * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 177008Snate@binkert.org * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 187008Snate@binkert.org * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 197008Snate@binkert.org * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 207008Snate@binkert.org * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 217008Snate@binkert.org * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 227008Snate@binkert.org * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 237008Snate@binkert.org * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 247008Snate@binkert.org * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 257008Snate@binkert.org * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 267008Snate@binkert.org * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 277008Snate@binkert.org * 286285Snate@binkert.org * Authors: Ali Saidi 2910472Sandreas.hansson@arm.com */ 3010472Sandreas.hansson@arm.com 3110518Snilay@cs.wisc.edu#include <cstring> 3210518Snilay@cs.wisc.edu 338232Snate@binkert.org#include "arch/sparc/asi.hh" 349104Shestness@cs.utexas.edu#include "arch/sparc/faults.hh" 357039Snate@binkert.org#include "arch/sparc/registers.hh" 367039Snate@binkert.org#include "arch/sparc/tlb.hh" 376285Snate@binkert.org#include "base/bitfield.hh" 3810518Snilay@cs.wisc.edu#include "base/trace.hh" 396285Snate@binkert.org#include "cpu/base.hh" 406876Ssteve.reinhardt@amd.com#include "cpu/thread_context.hh" 4110518Snilay@cs.wisc.edu#include "debug/IPR.hh" 4210518Snilay@cs.wisc.edu#include "debug/TLB.hh" 4310706Spower.jg@gmail.com#include "mem/packet_access.hh" 4410706Spower.jg@gmail.com#include "mem/request.hh" 4510519Snilay@cs.wisc.edu#include "sim/full_system.hh" 466285Snate@binkert.org#include "sim/system.hh" 4710518Snilay@cs.wisc.edu 486285Snate@binkert.org/* @todo remove some of the magic constants. -- ali 496285Snate@binkert.org * */ 507039Snate@binkert.orgnamespace SparcISA { 517039Snate@binkert.org 526285Snate@binkert.orgTLB::TLB(const Params *p) 5310518Snilay@cs.wisc.edu : BaseTLB(p), size(p->size), usedEntries(0), lastReplaced(0), 5410518Snilay@cs.wisc.edu cacheState(0), cacheValid(false) 5510518Snilay@cs.wisc.edu{ 5610518Snilay@cs.wisc.edu // To make this work you'll have to change the hypervisor and OS 577039Snate@binkert.org if (size > 64) 587039Snate@binkert.org fatal("SPARC T1 TLB registers don't support more than 64 TLB entries"); 5910519Snilay@cs.wisc.edu 6010519Snilay@cs.wisc.edu tlb = new TlbEntry[size]; 616285Snate@binkert.org std::memset(tlb, 0, sizeof(TlbEntry) * size); 626285Snate@binkert.org 6310518Snilay@cs.wisc.edu for (int x = 0; x < size; x++) 6410518Snilay@cs.wisc.edu freeList.push_back(&tlb[x]); 6510518Snilay@cs.wisc.edu 6610518Snilay@cs.wisc.edu c0_tsb_ps0 = 0; 6710518Snilay@cs.wisc.edu c0_tsb_ps1 = 0; 6810518Snilay@cs.wisc.edu c0_config = 0; 6910518Snilay@cs.wisc.edu cx_tsb_ps0 = 0; 7010518Snilay@cs.wisc.edu cx_tsb_ps1 = 0; 7110518Snilay@cs.wisc.edu cx_config = 0; 7210518Snilay@cs.wisc.edu sfsr = 0; 7310518Snilay@cs.wisc.edu tag_access = 0; 7410518Snilay@cs.wisc.edu sfar = 0; 7510518Snilay@cs.wisc.edu cacheEntry[0] = NULL; 7610518Snilay@cs.wisc.edu cacheEntry[1] = NULL; 7710706Spower.jg@gmail.com} 7810706Spower.jg@gmail.com 7910706Spower.jg@gmail.comvoid 8010706Spower.jg@gmail.comTLB::clearUsedBits() 8110518Snilay@cs.wisc.edu{ 8210518Snilay@cs.wisc.edu MapIter i; 8310518Snilay@cs.wisc.edu for (i = lookupTable.begin(); i != lookupTable.end(); i++) { 8410518Snilay@cs.wisc.edu TlbEntry *t = i->second; 8510518Snilay@cs.wisc.edu if (!t->pte.locked()) { 8610518Snilay@cs.wisc.edu t->used = false; 8710518Snilay@cs.wisc.edu usedEntries--; 8810518Snilay@cs.wisc.edu } 8910518Snilay@cs.wisc.edu } 9010518Snilay@cs.wisc.edu} 9110518Snilay@cs.wisc.edu 9210518Snilay@cs.wisc.edu 9310518Snilay@cs.wisc.eduvoid 9410518Snilay@cs.wisc.eduTLB::insert(Addr va, int partition_id, int context_id, bool real, 9510518Snilay@cs.wisc.edu const PageTableEntry& PTE, int entry) 9610518Snilay@cs.wisc.edu{ 9710518Snilay@cs.wisc.edu MapIter i; 9810518Snilay@cs.wisc.edu TlbEntry *new_entry = NULL; 9910518Snilay@cs.wisc.edu// TlbRange tr; 10010518Snilay@cs.wisc.edu int x; 10110518Snilay@cs.wisc.edu 10210518Snilay@cs.wisc.edu cacheValid = false; 10310518Snilay@cs.wisc.edu va &= ~(PTE.size()-1); 10410518Snilay@cs.wisc.edu /* tr.va = va; 10510518Snilay@cs.wisc.edu tr.size = PTE.size() - 1; 10610518Snilay@cs.wisc.edu tr.contextId = context_id; 10710518Snilay@cs.wisc.edu tr.partitionId = partition_id; 10810518Snilay@cs.wisc.edu tr.real = real; 10910518Snilay@cs.wisc.edu*/ 11010518Snilay@cs.wisc.edu 11110518Snilay@cs.wisc.edu DPRINTF(TLB, 11210518Snilay@cs.wisc.edu "TLB: Inserting Entry; va=%#x pa=%#x pid=%d cid=%d r=%d entryid=%d\n", 11310518Snilay@cs.wisc.edu va, PTE.paddr(), partition_id, context_id, (int)real, entry); 11410518Snilay@cs.wisc.edu 11510518Snilay@cs.wisc.edu // Demap any entry that conflicts 11610518Snilay@cs.wisc.edu for (x = 0; x < size; x++) { 11710518Snilay@cs.wisc.edu if (tlb[x].range.real == real && 11810518Snilay@cs.wisc.edu tlb[x].range.partitionId == partition_id && 11910518Snilay@cs.wisc.edu tlb[x].range.va < va + PTE.size() - 1 && 12010518Snilay@cs.wisc.edu tlb[x].range.va + tlb[x].range.size >= va && 12110518Snilay@cs.wisc.edu (real || tlb[x].range.contextId == context_id )) 12210518Snilay@cs.wisc.edu { 12310518Snilay@cs.wisc.edu if (tlb[x].valid) { 12410518Snilay@cs.wisc.edu freeList.push_front(&tlb[x]); 12510518Snilay@cs.wisc.edu DPRINTF(TLB, "TLB: Conflicting entry %#X , deleting it\n", x); 12610518Snilay@cs.wisc.edu 12710518Snilay@cs.wisc.edu tlb[x].valid = false; 12810518Snilay@cs.wisc.edu if (tlb[x].used) { 12910518Snilay@cs.wisc.edu tlb[x].used = false; 13010518Snilay@cs.wisc.edu usedEntries--; 13110518Snilay@cs.wisc.edu } 13210518Snilay@cs.wisc.edu lookupTable.erase(tlb[x].range); 13310518Snilay@cs.wisc.edu } 13410518Snilay@cs.wisc.edu } 13510518Snilay@cs.wisc.edu } 13610518Snilay@cs.wisc.edu 13710518Snilay@cs.wisc.edu if (entry != -1) { 13810518Snilay@cs.wisc.edu assert(entry < size && entry >= 0); 13910518Snilay@cs.wisc.edu new_entry = &tlb[entry]; 14010518Snilay@cs.wisc.edu } else { 14110518Snilay@cs.wisc.edu if (!freeList.empty()) { 14210518Snilay@cs.wisc.edu new_entry = freeList.front(); 14310518Snilay@cs.wisc.edu } else { 14410518Snilay@cs.wisc.edu x = lastReplaced; 14510518Snilay@cs.wisc.edu do { 14610518Snilay@cs.wisc.edu ++x; 14710518Snilay@cs.wisc.edu if (x == size) 14810518Snilay@cs.wisc.edu x = 0; 14910518Snilay@cs.wisc.edu if (x == lastReplaced) 15010518Snilay@cs.wisc.edu goto insertAllLocked; 15110518Snilay@cs.wisc.edu } while (tlb[x].pte.locked()); 15210518Snilay@cs.wisc.edu lastReplaced = x; 15310518Snilay@cs.wisc.edu new_entry = &tlb[x]; 15410518Snilay@cs.wisc.edu } 15510518Snilay@cs.wisc.edu } 15610518Snilay@cs.wisc.edu 15710518Snilay@cs.wisc.eduinsertAllLocked: 15810518Snilay@cs.wisc.edu // Update the last ently if their all locked 15910518Snilay@cs.wisc.edu if (!new_entry) { 16010518Snilay@cs.wisc.edu new_entry = &tlb[size-1]; 16110518Snilay@cs.wisc.edu } 16210518Snilay@cs.wisc.edu 16310518Snilay@cs.wisc.edu freeList.remove(new_entry); 16410518Snilay@cs.wisc.edu if (new_entry->valid && new_entry->used) 16510518Snilay@cs.wisc.edu usedEntries--; 16610518Snilay@cs.wisc.edu if (new_entry->valid) 16710518Snilay@cs.wisc.edu lookupTable.erase(new_entry->range); 16810518Snilay@cs.wisc.edu 16910518Snilay@cs.wisc.edu 17010518Snilay@cs.wisc.edu assert(PTE.valid()); 17110518Snilay@cs.wisc.edu new_entry->range.va = va; 17210518Snilay@cs.wisc.edu new_entry->range.size = PTE.size() - 1; 17310518Snilay@cs.wisc.edu new_entry->range.partitionId = partition_id; 17410518Snilay@cs.wisc.edu new_entry->range.contextId = context_id; 17510518Snilay@cs.wisc.edu new_entry->range.real = real; 17610518Snilay@cs.wisc.edu new_entry->pte = PTE; 17710518Snilay@cs.wisc.edu new_entry->used = true;; 17810518Snilay@cs.wisc.edu new_entry->valid = true; 17910518Snilay@cs.wisc.edu usedEntries++; 18010518Snilay@cs.wisc.edu 18110518Snilay@cs.wisc.edu i = lookupTable.insert(new_entry->range, new_entry); 18210518Snilay@cs.wisc.edu assert(i != lookupTable.end()); 18310518Snilay@cs.wisc.edu 18410518Snilay@cs.wisc.edu // If all entries have their used bit set, clear it on them all, 18510518Snilay@cs.wisc.edu // but the one we just inserted 18610518Snilay@cs.wisc.edu if (usedEntries == size) { 18710518Snilay@cs.wisc.edu clearUsedBits(); 18810518Snilay@cs.wisc.edu new_entry->used = true; 18910518Snilay@cs.wisc.edu usedEntries++; 19010518Snilay@cs.wisc.edu } 19110518Snilay@cs.wisc.edu} 19210518Snilay@cs.wisc.edu 19310518Snilay@cs.wisc.edu 19410518Snilay@cs.wisc.eduTlbEntry* 19510518Snilay@cs.wisc.eduTLB::lookup(Addr va, int partition_id, bool real, int context_id, 19610518Snilay@cs.wisc.edu bool update_used) 19710518Snilay@cs.wisc.edu{ 19810518Snilay@cs.wisc.edu MapIter i; 19910518Snilay@cs.wisc.edu TlbRange tr; 20010518Snilay@cs.wisc.edu TlbEntry *t; 20110518Snilay@cs.wisc.edu 20210518Snilay@cs.wisc.edu DPRINTF(TLB, "TLB: Looking up entry va=%#x pid=%d cid=%d r=%d\n", 20310518Snilay@cs.wisc.edu va, partition_id, context_id, real); 20410518Snilay@cs.wisc.edu // Assemble full address structure 20510518Snilay@cs.wisc.edu tr.va = va; 20610518Snilay@cs.wisc.edu tr.size = 1; 20710518Snilay@cs.wisc.edu tr.contextId = context_id; 20810518Snilay@cs.wisc.edu tr.partitionId = partition_id; 20910518Snilay@cs.wisc.edu tr.real = real; 21010518Snilay@cs.wisc.edu 21110518Snilay@cs.wisc.edu // Try to find the entry 21210518Snilay@cs.wisc.edu i = lookupTable.find(tr); 21310518Snilay@cs.wisc.edu if (i == lookupTable.end()) { 21410706Spower.jg@gmail.com DPRINTF(TLB, "TLB: No valid entry found\n"); 21510706Spower.jg@gmail.com return NULL; 21610706Spower.jg@gmail.com } 21710706Spower.jg@gmail.com 21810706Spower.jg@gmail.com // Mark the entries used bit and clear other used bits in needed 21910706Spower.jg@gmail.com t = i->second; 22010706Spower.jg@gmail.com DPRINTF(TLB, "TLB: Valid entry found pa: %#x size: %#x\n", t->pte.paddr(), 22110518Snilay@cs.wisc.edu t->pte.size()); 22210518Snilay@cs.wisc.edu 22310518Snilay@cs.wisc.edu // Update the used bits only if this is a real access (not a fake 22410518Snilay@cs.wisc.edu // one from virttophys() 22510518Snilay@cs.wisc.edu if (!t->used && update_used) { 22610518Snilay@cs.wisc.edu t->used = true; 22710518Snilay@cs.wisc.edu usedEntries++; 22810519Snilay@cs.wisc.edu if (usedEntries == size) { 22910518Snilay@cs.wisc.edu clearUsedBits(); 23010518Snilay@cs.wisc.edu t->used = true; 23110518Snilay@cs.wisc.edu usedEntries++; 23210518Snilay@cs.wisc.edu } 23310518Snilay@cs.wisc.edu } 23410518Snilay@cs.wisc.edu 23510518Snilay@cs.wisc.edu return t; 23610518Snilay@cs.wisc.edu} 23710518Snilay@cs.wisc.edu 23810518Snilay@cs.wisc.eduvoid 2397039Snate@binkert.orgTLB::dumpAll() 2408615Snilay@cs.wisc.edu{ 2416285Snate@binkert.org MapIter i; 2427544SBrad.Beckmann@amd.com for (int x = 0; x < size; x++) { 2437544SBrad.Beckmann@amd.com if (tlb[x].valid) { 2447544SBrad.Beckmann@amd.com DPRINTFN("%4d: %#2x:%#2x %c %#4x %#8x %#8x %#16x\n", 2457544SBrad.Beckmann@amd.com x, tlb[x].range.partitionId, tlb[x].range.contextId, 2468615Snilay@cs.wisc.edu tlb[x].range.real ? 'R' : ' ', tlb[x].range.size, 24710562Sandreas.hansson@arm.com tlb[x].range.va, tlb[x].pte.paddr(), tlb[x].pte()); 2488615Snilay@cs.wisc.edu } 2498615Snilay@cs.wisc.edu } 2506285Snate@binkert.org} 2517039Snate@binkert.org 2527039Snate@binkert.orgvoid 2536285Snate@binkert.orgTLB::demapPage(Addr va, int partition_id, bool real, int context_id) 2547039Snate@binkert.org{ 2557039Snate@binkert.org TlbRange tr; 2567039Snate@binkert.org MapIter i; 2577039Snate@binkert.org 2587039Snate@binkert.org DPRINTF(IPR, "TLB: Demapping Page va=%#x pid=%#d cid=%d r=%d\n", 2597039Snate@binkert.org va, partition_id, context_id, real); 2608615Snilay@cs.wisc.edu 2616285Snate@binkert.org cacheValid = false; 26210472Sandreas.hansson@arm.com 26310472Sandreas.hansson@arm.com // Assemble full address structure 2647453Snate@binkert.org tr.va = va; 2657453Snate@binkert.org tr.size = 1; 2667453Snate@binkert.org tr.contextId = context_id; 2677039Snate@binkert.org tr.partitionId = partition_id; 2686888SBrad.Beckmann@amd.com tr.real = real; 2697453Snate@binkert.org 2707039Snate@binkert.org // Demap any entry that conflicts 2716888SBrad.Beckmann@amd.com i = lookupTable.find(tr); 2727915SBrad.Beckmann@amd.com if (i != lookupTable.end()) { 2737915SBrad.Beckmann@amd.com DPRINTF(IPR, "TLB: Demapped page\n"); 2747915SBrad.Beckmann@amd.com i->second->valid = false; 2757915SBrad.Beckmann@amd.com if (i->second->used) { 2767039Snate@binkert.org i->second->used = false; 2776888SBrad.Beckmann@amd.com usedEntries--; 2787039Snate@binkert.org } 2797039Snate@binkert.org freeList.push_front(i->second); 2807453Snate@binkert.org lookupTable.erase(i); 2816285Snate@binkert.org } 2827039Snate@binkert.org} 2836285Snate@binkert.org 2846285Snate@binkert.orgvoid 2857039Snate@binkert.orgTLB::demapContext(int partition_id, int context_id) 2867039Snate@binkert.org{ 2876285Snate@binkert.org DPRINTF(IPR, "TLB: Demapping Context pid=%#d cid=%d\n", 28810231Ssteve.reinhardt@amd.com partition_id, context_id); 2897039Snate@binkert.org cacheValid = false; 2907039Snate@binkert.org for (int x = 0; x < size; x++) { 2918162SBrad.Beckmann@amd.com if (tlb[x].range.contextId == context_id && 2928162SBrad.Beckmann@amd.com tlb[x].range.partitionId == partition_id) { 2938162SBrad.Beckmann@amd.com if (tlb[x].valid) { 2948162SBrad.Beckmann@amd.com freeList.push_front(&tlb[x]); 2958162SBrad.Beckmann@amd.com } 2968162SBrad.Beckmann@amd.com tlb[x].valid = false; 2977039Snate@binkert.org if (tlb[x].used) { 2987039Snate@binkert.org tlb[x].used = false; 2997039Snate@binkert.org usedEntries--; 3006285Snate@binkert.org } 30110472Sandreas.hansson@arm.com lookupTable.erase(tlb[x].range); 30210472Sandreas.hansson@arm.com } 3037453Snate@binkert.org } 3047039Snate@binkert.org} 3056888SBrad.Beckmann@amd.com 3067453Snate@binkert.orgvoid 3077453Snate@binkert.orgTLB::demapAll(int partition_id) 3086888SBrad.Beckmann@amd.com{ 3097453Snate@binkert.org DPRINTF(TLB, "TLB: Demapping All pid=%#d\n", partition_id); 3107039Snate@binkert.org cacheValid = false; 3116888SBrad.Beckmann@amd.com for (int x = 0; x < size; x++) { 3127453Snate@binkert.org if (tlb[x].valid && !tlb[x].pte.locked() && 3137039Snate@binkert.org tlb[x].range.partitionId == partition_id) { 3147039Snate@binkert.org freeList.push_front(&tlb[x]); 3157039Snate@binkert.org tlb[x].valid = false; 3167039Snate@binkert.org if (tlb[x].used) { 3176888SBrad.Beckmann@amd.com tlb[x].used = false; 3187039Snate@binkert.org usedEntries--; 3197453Snate@binkert.org } 3207039Snate@binkert.org lookupTable.erase(tlb[x].range); 3217453Snate@binkert.org } 3227453Snate@binkert.org } 3237039Snate@binkert.org} 3247453Snate@binkert.org 3257039Snate@binkert.orgvoid 3266888SBrad.Beckmann@amd.comTLB::flushAll() 3277039Snate@binkert.org{ 3287039Snate@binkert.org cacheValid = false; 3297453Snate@binkert.org lookupTable.clear(); 3308160SBrad.Beckmann@amd.com 3318160SBrad.Beckmann@amd.com for (int x = 0; x < size; x++) { 3328160SBrad.Beckmann@amd.com if (tlb[x].valid) 3338160SBrad.Beckmann@amd.com freeList.push_back(&tlb[x]); 3346285Snate@binkert.org tlb[x].valid = false; 3356285Snate@binkert.org tlb[x].used = false; 3367039Snate@binkert.org } 3377039Snate@binkert.org usedEntries = 0; 3386285Snate@binkert.org} 33910231Ssteve.reinhardt@amd.com 3407039Snate@binkert.orguint64_t 3417039Snate@binkert.orgTLB::TteRead(int entry) 3427039Snate@binkert.org{ 3437039Snate@binkert.org if (entry >= size) 34410231Ssteve.reinhardt@amd.com panic("entry: %d\n", entry); 3457915SBrad.Beckmann@amd.com 3467915SBrad.Beckmann@amd.com assert(entry < size); 3477915SBrad.Beckmann@amd.com if (tlb[entry].valid) 3487915SBrad.Beckmann@amd.com return tlb[entry].pte(); 3497039Snate@binkert.org else 3506285Snate@binkert.org return (uint64_t)-1ll; 3516285Snate@binkert.org} 3527039Snate@binkert.org 3537039Snate@binkert.orguint64_t 3546285Snate@binkert.orgTLB::TagRead(int entry) 3557039Snate@binkert.org{ 3566285Snate@binkert.org assert(entry < size); 3576285Snate@binkert.org uint64_t tag; 3587039Snate@binkert.org if (!tlb[entry].valid) 35910518Snilay@cs.wisc.edu return (uint64_t)-1ll; 36010518Snilay@cs.wisc.edu 3619104Shestness@cs.utexas.edu tag = tlb[entry].range.contextId; 3629104Shestness@cs.utexas.edu tag |= tlb[entry].range.va; 3639104Shestness@cs.utexas.edu tag |= (uint64_t)tlb[entry].range.partitionId << 61; 3649104Shestness@cs.utexas.edu tag |= tlb[entry].range.real ? ULL(1) << 60 : 0; 3656876Ssteve.reinhardt@amd.com tag |= (uint64_t)~tlb[entry].pte._size() << 56; 3666876Ssteve.reinhardt@amd.com return tag; 3676876Ssteve.reinhardt@amd.com} 3686876Ssteve.reinhardt@amd.com 3696876Ssteve.reinhardt@amd.combool 370TLB::validVirtualAddress(Addr va, bool am) 371{ 372 if (am) 373 return true; 374 if (va >= StartVAddrHole && va <= EndVAddrHole) 375 return false; 376 return true; 377} 378 379void 380TLB::writeSfsr(bool write, ContextType ct, bool se, FaultTypes ft, int asi) 381{ 382 if (sfsr & 0x1) 383 sfsr = 0x3; 384 else 385 sfsr = 1; 386 387 if (write) 388 sfsr |= 1 << 2; 389 sfsr |= ct << 4; 390 if (se) 391 sfsr |= 1 << 6; 392 sfsr |= ft << 7; 393 sfsr |= asi << 16; 394} 395 396void 397TLB::writeTagAccess(Addr va, int context) 398{ 399 DPRINTF(TLB, "TLB: Writing Tag Access: va: %#X ctx: %#X value: %#X\n", 400 va, context, mbits(va, 63,13) | mbits(context,12,0)); 401 402 tag_access = mbits(va, 63,13) | mbits(context,12,0); 403} 404 405void 406TLB::writeSfsr(Addr a, bool write, ContextType ct, 407 bool se, FaultTypes ft, int asi) 408{ 409 DPRINTF(TLB, "TLB: Fault: A=%#x w=%d ct=%d ft=%d asi=%d\n", 410 a, (int)write, ct, ft, asi); 411 TLB::writeSfsr(write, ct, se, ft, asi); 412 sfar = a; 413} 414 415Fault 416TLB::translateInst(RequestPtr req, ThreadContext *tc) 417{ 418 uint64_t tlbdata = tc->readMiscRegNoEffect(MISCREG_TLB_DATA); 419 420 Addr vaddr = req->getVaddr(); 421 TlbEntry *e; 422 423 assert(req->getArchFlags() == ASI_IMPLICIT); 424 425 DPRINTF(TLB, "TLB: ITB Request to translate va=%#x size=%d\n", 426 vaddr, req->getSize()); 427 428 // Be fast if we can! 429 if (cacheValid && cacheState == tlbdata) { 430 if (cacheEntry[0]) { 431 if (cacheEntry[0]->range.va < vaddr + sizeof(MachInst) && 432 cacheEntry[0]->range.va + cacheEntry[0]->range.size >= vaddr) { 433 req->setPaddr(cacheEntry[0]->pte.translate(vaddr)); 434 return NoFault; 435 } 436 } else { 437 req->setPaddr(vaddr & PAddrImplMask); 438 return NoFault; 439 } 440 } 441 442 bool hpriv = bits(tlbdata,0,0); 443 bool red = bits(tlbdata,1,1); 444 bool priv = bits(tlbdata,2,2); 445 bool addr_mask = bits(tlbdata,3,3); 446 bool lsu_im = bits(tlbdata,4,4); 447 448 int part_id = bits(tlbdata,15,8); 449 int tl = bits(tlbdata,18,16); 450 int pri_context = bits(tlbdata,47,32); 451 int context; 452 ContextType ct; 453 int asi; 454 bool real = false; 455 456 DPRINTF(TLB, "TLB: priv:%d hpriv:%d red:%d lsuim:%d part_id: %#X\n", 457 priv, hpriv, red, lsu_im, part_id); 458 459 if (tl > 0) { 460 asi = ASI_N; 461 ct = Nucleus; 462 context = 0; 463 } else { 464 asi = ASI_P; 465 ct = Primary; 466 context = pri_context; 467 } 468 469 if ( hpriv || red ) { 470 cacheValid = true; 471 cacheState = tlbdata; 472 cacheEntry[0] = NULL; 473 req->setPaddr(vaddr & PAddrImplMask); 474 return NoFault; 475 } 476 477 // If the access is unaligned trap 478 if (vaddr & 0x3) { 479 writeSfsr(false, ct, false, OtherFault, asi); 480 return std::make_shared<MemAddressNotAligned>(); 481 } 482 483 if (addr_mask) 484 vaddr = vaddr & VAddrAMask; 485 486 if (!validVirtualAddress(vaddr, addr_mask)) { 487 writeSfsr(false, ct, false, VaOutOfRange, asi); 488 return std::make_shared<InstructionAccessException>(); 489 } 490 491 if (!lsu_im) { 492 e = lookup(vaddr, part_id, true); 493 real = true; 494 context = 0; 495 } else { 496 e = lookup(vaddr, part_id, false, context); 497 } 498 499 if (e == NULL || !e->valid) { 500 writeTagAccess(vaddr, context); 501 if (real) { 502 return std::make_shared<InstructionRealTranslationMiss>(); 503 } else { 504 if (FullSystem) 505 return std::make_shared<FastInstructionAccessMMUMiss>(); 506 else 507 return std::make_shared<FastInstructionAccessMMUMiss>( 508 req->getVaddr()); 509 } 510 } 511 512 // were not priviledged accesing priv page 513 if (!priv && e->pte.priv()) { 514 writeTagAccess(vaddr, context); 515 writeSfsr(false, ct, false, PrivViolation, asi); 516 return std::make_shared<InstructionAccessException>(); 517 } 518 519 // cache translation date for next translation 520 cacheValid = true; 521 cacheState = tlbdata; 522 cacheEntry[0] = e; 523 524 req->setPaddr(e->pte.translate(vaddr)); 525 DPRINTF(TLB, "TLB: %#X -> %#X\n", vaddr, req->getPaddr()); 526 return NoFault; 527} 528 529Fault 530TLB::translateData(RequestPtr req, ThreadContext *tc, bool write) 531{ 532 /* 533 * @todo this could really use some profiling and fixing to make 534 * it faster! 535 */ 536 uint64_t tlbdata = tc->readMiscRegNoEffect(MISCREG_TLB_DATA); 537 Addr vaddr = req->getVaddr(); 538 Addr size = req->getSize(); 539 ASI asi; 540 asi = (ASI)req->getArchFlags(); 541 bool implicit = false; 542 bool hpriv = bits(tlbdata,0,0); 543 bool unaligned = vaddr & (size - 1); 544 545 DPRINTF(TLB, "TLB: DTB Request to translate va=%#x size=%d asi=%#x\n", 546 vaddr, size, asi); 547 548 if (lookupTable.size() != 64 - freeList.size()) 549 panic("Lookup table size: %d tlb size: %d\n", lookupTable.size(), 550 freeList.size()); 551 if (asi == ASI_IMPLICIT) 552 implicit = true; 553 554 // Only use the fast path here if there doesn't need to be an unaligned 555 // trap later 556 if (!unaligned) { 557 if (hpriv && implicit) { 558 req->setPaddr(vaddr & PAddrImplMask); 559 return NoFault; 560 } 561 562 // Be fast if we can! 563 if (cacheValid && cacheState == tlbdata) { 564 565 566 567 if (cacheEntry[0]) { 568 TlbEntry *ce = cacheEntry[0]; 569 Addr ce_va = ce->range.va; 570 if (cacheAsi[0] == asi && 571 ce_va < vaddr + size && ce_va + ce->range.size > vaddr && 572 (!write || ce->pte.writable())) { 573 req->setPaddr(ce->pte.translate(vaddr)); 574 if (ce->pte.sideffect() || (ce->pte.paddr() >> 39) & 1) { 575 req->setFlags( 576 Request::UNCACHEABLE | Request::STRICT_ORDER); 577 } 578 DPRINTF(TLB, "TLB: %#X -> %#X\n", vaddr, req->getPaddr()); 579 return NoFault; 580 } // if matched 581 } // if cache entry valid 582 if (cacheEntry[1]) { 583 TlbEntry *ce = cacheEntry[1]; 584 Addr ce_va = ce->range.va; 585 if (cacheAsi[1] == asi && 586 ce_va < vaddr + size && ce_va + ce->range.size > vaddr && 587 (!write || ce->pte.writable())) { 588 req->setPaddr(ce->pte.translate(vaddr)); 589 if (ce->pte.sideffect() || (ce->pte.paddr() >> 39) & 1) { 590 req->setFlags( 591 Request::UNCACHEABLE | Request::STRICT_ORDER); 592 } 593 DPRINTF(TLB, "TLB: %#X -> %#X\n", vaddr, req->getPaddr()); 594 return NoFault; 595 } // if matched 596 } // if cache entry valid 597 } 598 } 599 600 bool red = bits(tlbdata,1,1); 601 bool priv = bits(tlbdata,2,2); 602 bool addr_mask = bits(tlbdata,3,3); 603 bool lsu_dm = bits(tlbdata,5,5); 604 605 int part_id = bits(tlbdata,15,8); 606 int tl = bits(tlbdata,18,16); 607 int pri_context = bits(tlbdata,47,32); 608 int sec_context = bits(tlbdata,63,48); 609 610 bool real = false; 611 ContextType ct = Primary; 612 int context = 0; 613 614 TlbEntry *e; 615 616 DPRINTF(TLB, "TLB: priv:%d hpriv:%d red:%d lsudm:%d part_id: %#X\n", 617 priv, hpriv, red, lsu_dm, part_id); 618 619 if (implicit) { 620 if (tl > 0) { 621 asi = ASI_N; 622 ct = Nucleus; 623 context = 0; 624 } else { 625 asi = ASI_P; 626 ct = Primary; 627 context = pri_context; 628 } 629 } else { 630 // We need to check for priv level/asi priv 631 if (!priv && !hpriv && !asiIsUnPriv(asi)) { 632 // It appears that context should be Nucleus in these cases? 633 writeSfsr(vaddr, write, Nucleus, false, IllegalAsi, asi); 634 return std::make_shared<PrivilegedAction>(); 635 } 636 637 if (!hpriv && asiIsHPriv(asi)) { 638 writeSfsr(vaddr, write, Nucleus, false, IllegalAsi, asi); 639 return std::make_shared<DataAccessException>(); 640 } 641 642 if (asiIsPrimary(asi)) { 643 context = pri_context; 644 ct = Primary; 645 } else if (asiIsSecondary(asi)) { 646 context = sec_context; 647 ct = Secondary; 648 } else if (asiIsNucleus(asi)) { 649 ct = Nucleus; 650 context = 0; 651 } else { // ???? 652 ct = Primary; 653 context = pri_context; 654 } 655 } 656 657 if (!implicit && asi != ASI_P && asi != ASI_S) { 658 if (asiIsLittle(asi)) 659 panic("Little Endian ASIs not supported\n"); 660 661 //XXX It's unclear from looking at the documentation how a no fault 662 // load differs from a regular one, other than what happens concerning 663 // nfo and e bits in the TTE 664// if (asiIsNoFault(asi)) 665// panic("No Fault ASIs not supported\n"); 666 667 if (asiIsPartialStore(asi)) 668 panic("Partial Store ASIs not supported\n"); 669 670 if (asiIsCmt(asi)) 671 panic("Cmt ASI registers not implmented\n"); 672 673 if (asiIsInterrupt(asi)) 674 goto handleIntRegAccess; 675 if (asiIsMmu(asi)) 676 goto handleMmuRegAccess; 677 if (asiIsScratchPad(asi)) 678 goto handleScratchRegAccess; 679 if (asiIsQueue(asi)) 680 goto handleQueueRegAccess; 681 if (asiIsSparcError(asi)) 682 goto handleSparcErrorRegAccess; 683 684 if (!asiIsReal(asi) && !asiIsNucleus(asi) && !asiIsAsIfUser(asi) && 685 !asiIsTwin(asi) && !asiIsBlock(asi) && !asiIsNoFault(asi)) 686 panic("Accessing ASI %#X. Should we?\n", asi); 687 } 688 689 // If the asi is unaligned trap 690 if (unaligned) { 691 writeSfsr(vaddr, false, ct, false, OtherFault, asi); 692 return std::make_shared<MemAddressNotAligned>(); 693 } 694 695 if (addr_mask) 696 vaddr = vaddr & VAddrAMask; 697 698 if (!validVirtualAddress(vaddr, addr_mask)) { 699 writeSfsr(vaddr, false, ct, true, VaOutOfRange, asi); 700 return std::make_shared<DataAccessException>(); 701 } 702 703 if ((!lsu_dm && !hpriv && !red) || asiIsReal(asi)) { 704 real = true; 705 context = 0; 706 } 707 708 if (hpriv && (implicit || (!asiIsAsIfUser(asi) && !asiIsReal(asi)))) { 709 req->setPaddr(vaddr & PAddrImplMask); 710 return NoFault; 711 } 712 713 e = lookup(vaddr, part_id, real, context); 714 715 if (e == NULL || !e->valid) { 716 writeTagAccess(vaddr, context); 717 DPRINTF(TLB, "TLB: DTB Failed to find matching TLB entry\n"); 718 if (real) { 719 return std::make_shared<DataRealTranslationMiss>(); 720 } else { 721 if (FullSystem) 722 return std::make_shared<FastDataAccessMMUMiss>(); 723 else 724 return std::make_shared<FastDataAccessMMUMiss>( 725 req->getVaddr()); 726 } 727 728 } 729 730 if (!priv && e->pte.priv()) { 731 writeTagAccess(vaddr, context); 732 writeSfsr(vaddr, write, ct, e->pte.sideffect(), PrivViolation, asi); 733 return std::make_shared<DataAccessException>(); 734 } 735 736 if (write && !e->pte.writable()) { 737 writeTagAccess(vaddr, context); 738 writeSfsr(vaddr, write, ct, e->pte.sideffect(), OtherFault, asi); 739 return std::make_shared<FastDataAccessProtection>(); 740 } 741 742 if (e->pte.nofault() && !asiIsNoFault(asi)) { 743 writeTagAccess(vaddr, context); 744 writeSfsr(vaddr, write, ct, e->pte.sideffect(), LoadFromNfo, asi); 745 return std::make_shared<DataAccessException>(); 746 } 747 748 if (e->pte.sideffect() && asiIsNoFault(asi)) { 749 writeTagAccess(vaddr, context); 750 writeSfsr(vaddr, write, ct, e->pte.sideffect(), SideEffect, asi); 751 return std::make_shared<DataAccessException>(); 752 } 753 754 if (e->pte.sideffect() || (e->pte.paddr() >> 39) & 1) 755 req->setFlags(Request::UNCACHEABLE | Request::STRICT_ORDER); 756 757 // cache translation date for next translation 758 cacheState = tlbdata; 759 if (!cacheValid) { 760 cacheEntry[1] = NULL; 761 cacheEntry[0] = NULL; 762 } 763 764 if (cacheEntry[0] != e && cacheEntry[1] != e) { 765 cacheEntry[1] = cacheEntry[0]; 766 cacheEntry[0] = e; 767 cacheAsi[1] = cacheAsi[0]; 768 cacheAsi[0] = asi; 769 if (implicit) 770 cacheAsi[0] = (ASI)0; 771 } 772 cacheValid = true; 773 req->setPaddr(e->pte.translate(vaddr)); 774 DPRINTF(TLB, "TLB: %#X -> %#X\n", vaddr, req->getPaddr()); 775 return NoFault; 776 777 /** Normal flow ends here. */ 778handleIntRegAccess: 779 if (!hpriv) { 780 writeSfsr(vaddr, write, Primary, true, IllegalAsi, asi); 781 if (priv) 782 return std::make_shared<DataAccessException>(); 783 else 784 return std::make_shared<PrivilegedAction>(); 785 } 786 787 if ((asi == ASI_SWVR_UDB_INTR_W && !write) || 788 (asi == ASI_SWVR_UDB_INTR_R && write)) { 789 writeSfsr(vaddr, write, Primary, true, IllegalAsi, asi); 790 return std::make_shared<DataAccessException>(); 791 } 792 793 goto regAccessOk; 794 795 796handleScratchRegAccess: 797 if (vaddr > 0x38 || (vaddr >= 0x20 && vaddr < 0x30 && !hpriv)) { 798 writeSfsr(vaddr, write, Primary, true, IllegalAsi, asi); 799 return std::make_shared<DataAccessException>(); 800 } 801 goto regAccessOk; 802 803handleQueueRegAccess: 804 if (!priv && !hpriv) { 805 writeSfsr(vaddr, write, Primary, true, IllegalAsi, asi); 806 return std::make_shared<PrivilegedAction>(); 807 } 808 if ((!hpriv && vaddr & 0xF) || vaddr > 0x3f8 || vaddr < 0x3c0) { 809 writeSfsr(vaddr, write, Primary, true, IllegalAsi, asi); 810 return std::make_shared<DataAccessException>(); 811 } 812 goto regAccessOk; 813 814handleSparcErrorRegAccess: 815 if (!hpriv) { 816 writeSfsr(vaddr, write, Primary, true, IllegalAsi, asi); 817 if (priv) 818 return std::make_shared<DataAccessException>(); 819 else 820 return std::make_shared<PrivilegedAction>(); 821 } 822 goto regAccessOk; 823 824 825regAccessOk: 826handleMmuRegAccess: 827 DPRINTF(TLB, "TLB: DTB Translating MM IPR access\n"); 828 req->setFlags(Request::MMAPPED_IPR); 829 req->setPaddr(req->getVaddr()); 830 return NoFault; 831}; 832 833Fault 834TLB::translateAtomic(RequestPtr req, ThreadContext *tc, Mode mode) 835{ 836 if (mode == Execute) 837 return translateInst(req, tc); 838 else 839 return translateData(req, tc, mode == Write); 840} 841 842void 843TLB::translateTiming(RequestPtr req, ThreadContext *tc, 844 Translation *translation, Mode mode) 845{ 846 assert(translation); 847 translation->finish(translateAtomic(req, tc, mode), req, tc, mode); 848} 849 850Fault 851TLB::translateFunctional(RequestPtr req, ThreadContext *tc, Mode mode) 852{ 853 panic("Not implemented\n"); 854 return NoFault; 855} 856 857Fault 858TLB::finalizePhysical(RequestPtr req, ThreadContext *tc, Mode mode) const 859{ 860 return NoFault; 861} 862 863Cycles 864TLB::doMmuRegRead(ThreadContext *tc, Packet *pkt) 865{ 866 Addr va = pkt->getAddr(); 867 ASI asi = (ASI)pkt->req->getArchFlags(); 868 uint64_t temp; 869 870 DPRINTF(IPR, "Memory Mapped IPR Read: asi=%#X a=%#x\n", 871 (uint32_t)pkt->req->getArchFlags(), pkt->getAddr()); 872 873 TLB *itb = tc->getITBPtr(); 874 875 switch (asi) { 876 case ASI_LSU_CONTROL_REG: 877 assert(va == 0); 878 pkt->set(tc->readMiscReg(MISCREG_MMU_LSU_CTRL)); 879 break; 880 case ASI_MMU: 881 switch (va) { 882 case 0x8: 883 pkt->set(tc->readMiscReg(MISCREG_MMU_P_CONTEXT)); 884 break; 885 case 0x10: 886 pkt->set(tc->readMiscReg(MISCREG_MMU_S_CONTEXT)); 887 break; 888 default: 889 goto doMmuReadError; 890 } 891 break; 892 case ASI_QUEUE: 893 pkt->set(tc->readMiscReg(MISCREG_QUEUE_CPU_MONDO_HEAD + 894 (va >> 4) - 0x3c)); 895 break; 896 case ASI_DMMU_CTXT_ZERO_TSB_BASE_PS0: 897 assert(va == 0); 898 pkt->set(c0_tsb_ps0); 899 break; 900 case ASI_DMMU_CTXT_ZERO_TSB_BASE_PS1: 901 assert(va == 0); 902 pkt->set(c0_tsb_ps1); 903 break; 904 case ASI_DMMU_CTXT_ZERO_CONFIG: 905 assert(va == 0); 906 pkt->set(c0_config); 907 break; 908 case ASI_IMMU_CTXT_ZERO_TSB_BASE_PS0: 909 assert(va == 0); 910 pkt->set(itb->c0_tsb_ps0); 911 break; 912 case ASI_IMMU_CTXT_ZERO_TSB_BASE_PS1: 913 assert(va == 0); 914 pkt->set(itb->c0_tsb_ps1); 915 break; 916 case ASI_IMMU_CTXT_ZERO_CONFIG: 917 assert(va == 0); 918 pkt->set(itb->c0_config); 919 break; 920 case ASI_DMMU_CTXT_NONZERO_TSB_BASE_PS0: 921 assert(va == 0); 922 pkt->set(cx_tsb_ps0); 923 break; 924 case ASI_DMMU_CTXT_NONZERO_TSB_BASE_PS1: 925 assert(va == 0); 926 pkt->set(cx_tsb_ps1); 927 break; 928 case ASI_DMMU_CTXT_NONZERO_CONFIG: 929 assert(va == 0); 930 pkt->set(cx_config); 931 break; 932 case ASI_IMMU_CTXT_NONZERO_TSB_BASE_PS0: 933 assert(va == 0); 934 pkt->set(itb->cx_tsb_ps0); 935 break; 936 case ASI_IMMU_CTXT_NONZERO_TSB_BASE_PS1: 937 assert(va == 0); 938 pkt->set(itb->cx_tsb_ps1); 939 break; 940 case ASI_IMMU_CTXT_NONZERO_CONFIG: 941 assert(va == 0); 942 pkt->set(itb->cx_config); 943 break; 944 case ASI_SPARC_ERROR_STATUS_REG: 945 pkt->set((uint64_t)0); 946 break; 947 case ASI_HYP_SCRATCHPAD: 948 case ASI_SCRATCHPAD: 949 pkt->set(tc->readMiscReg(MISCREG_SCRATCHPAD_R0 + (va >> 3))); 950 break; 951 case ASI_IMMU: 952 switch (va) { 953 case 0x0: 954 temp = itb->tag_access; 955 pkt->set(bits(temp,63,22) | bits(temp,12,0) << 48); 956 break; 957 case 0x18: 958 pkt->set(itb->sfsr); 959 break; 960 case 0x30: 961 pkt->set(itb->tag_access); 962 break; 963 default: 964 goto doMmuReadError; 965 } 966 break; 967 case ASI_DMMU: 968 switch (va) { 969 case 0x0: 970 temp = tag_access; 971 pkt->set(bits(temp,63,22) | bits(temp,12,0) << 48); 972 break; 973 case 0x18: 974 pkt->set(sfsr); 975 break; 976 case 0x20: 977 pkt->set(sfar); 978 break; 979 case 0x30: 980 pkt->set(tag_access); 981 break; 982 case 0x80: 983 pkt->set(tc->readMiscReg(MISCREG_MMU_PART_ID)); 984 break; 985 default: 986 goto doMmuReadError; 987 } 988 break; 989 case ASI_DMMU_TSB_PS0_PTR_REG: 990 pkt->set(MakeTsbPtr(Ps0, 991 tag_access, 992 c0_tsb_ps0, 993 c0_config, 994 cx_tsb_ps0, 995 cx_config)); 996 break; 997 case ASI_DMMU_TSB_PS1_PTR_REG: 998 pkt->set(MakeTsbPtr(Ps1, 999 tag_access, 1000 c0_tsb_ps1, 1001 c0_config, 1002 cx_tsb_ps1, 1003 cx_config)); 1004 break; 1005 case ASI_IMMU_TSB_PS0_PTR_REG: 1006 pkt->set(MakeTsbPtr(Ps0, 1007 itb->tag_access, 1008 itb->c0_tsb_ps0, 1009 itb->c0_config, 1010 itb->cx_tsb_ps0, 1011 itb->cx_config)); 1012 break; 1013 case ASI_IMMU_TSB_PS1_PTR_REG: 1014 pkt->set(MakeTsbPtr(Ps1, 1015 itb->tag_access, 1016 itb->c0_tsb_ps1, 1017 itb->c0_config, 1018 itb->cx_tsb_ps1, 1019 itb->cx_config)); 1020 break; 1021 case ASI_SWVR_INTR_RECEIVE: 1022 { 1023 SparcISA::Interrupts * interrupts = 1024 dynamic_cast<SparcISA::Interrupts *>( 1025 tc->getCpuPtr()->getInterruptController()); 1026 pkt->set(interrupts->get_vec(IT_INT_VEC)); 1027 } 1028 break; 1029 case ASI_SWVR_UDB_INTR_R: 1030 { 1031 SparcISA::Interrupts * interrupts = 1032 dynamic_cast<SparcISA::Interrupts *>( 1033 tc->getCpuPtr()->getInterruptController()); 1034 temp = findMsbSet(interrupts->get_vec(IT_INT_VEC)); 1035 tc->getCpuPtr()->clearInterrupt(IT_INT_VEC, temp); 1036 pkt->set(temp); 1037 } 1038 break; 1039 default: 1040doMmuReadError: 1041 panic("need to impl DTB::doMmuRegRead() got asi=%#x, va=%#x\n", 1042 (uint32_t)asi, va); 1043 } 1044 pkt->makeAtomicResponse(); 1045 return Cycles(1); 1046} 1047 1048Cycles 1049TLB::doMmuRegWrite(ThreadContext *tc, Packet *pkt) 1050{ 1051 uint64_t data = pkt->get<uint64_t>(); 1052 Addr va = pkt->getAddr(); 1053 ASI asi = (ASI)pkt->req->getArchFlags(); 1054 1055 Addr ta_insert; 1056 Addr va_insert; 1057 Addr ct_insert; 1058 int part_insert; 1059 int entry_insert = -1; 1060 bool real_insert; 1061 bool ignore; 1062 int part_id; 1063 int ctx_id; 1064 PageTableEntry pte; 1065 1066 DPRINTF(IPR, "Memory Mapped IPR Write: asi=%#X a=%#x d=%#X\n", 1067 (uint32_t)asi, va, data); 1068 1069 TLB *itb = tc->getITBPtr(); 1070 1071 switch (asi) { 1072 case ASI_LSU_CONTROL_REG: 1073 assert(va == 0); 1074 tc->setMiscReg(MISCREG_MMU_LSU_CTRL, data); 1075 break; 1076 case ASI_MMU: 1077 switch (va) { 1078 case 0x8: 1079 tc->setMiscReg(MISCREG_MMU_P_CONTEXT, data); 1080 break; 1081 case 0x10: 1082 tc->setMiscReg(MISCREG_MMU_S_CONTEXT, data); 1083 break; 1084 default: 1085 goto doMmuWriteError; 1086 } 1087 break; 1088 case ASI_QUEUE: 1089 assert(mbits(data,13,6) == data); 1090 tc->setMiscReg(MISCREG_QUEUE_CPU_MONDO_HEAD + 1091 (va >> 4) - 0x3c, data); 1092 break; 1093 case ASI_DMMU_CTXT_ZERO_TSB_BASE_PS0: 1094 assert(va == 0); 1095 c0_tsb_ps0 = data; 1096 break; 1097 case ASI_DMMU_CTXT_ZERO_TSB_BASE_PS1: 1098 assert(va == 0); 1099 c0_tsb_ps1 = data; 1100 break; 1101 case ASI_DMMU_CTXT_ZERO_CONFIG: 1102 assert(va == 0); 1103 c0_config = data; 1104 break; 1105 case ASI_IMMU_CTXT_ZERO_TSB_BASE_PS0: 1106 assert(va == 0); 1107 itb->c0_tsb_ps0 = data; 1108 break; 1109 case ASI_IMMU_CTXT_ZERO_TSB_BASE_PS1: 1110 assert(va == 0); 1111 itb->c0_tsb_ps1 = data; 1112 break; 1113 case ASI_IMMU_CTXT_ZERO_CONFIG: 1114 assert(va == 0); 1115 itb->c0_config = data; 1116 break; 1117 case ASI_DMMU_CTXT_NONZERO_TSB_BASE_PS0: 1118 assert(va == 0); 1119 cx_tsb_ps0 = data; 1120 break; 1121 case ASI_DMMU_CTXT_NONZERO_TSB_BASE_PS1: 1122 assert(va == 0); 1123 cx_tsb_ps1 = data; 1124 break; 1125 case ASI_DMMU_CTXT_NONZERO_CONFIG: 1126 assert(va == 0); 1127 cx_config = data; 1128 break; 1129 case ASI_IMMU_CTXT_NONZERO_TSB_BASE_PS0: 1130 assert(va == 0); 1131 itb->cx_tsb_ps0 = data; 1132 break; 1133 case ASI_IMMU_CTXT_NONZERO_TSB_BASE_PS1: 1134 assert(va == 0); 1135 itb->cx_tsb_ps1 = data; 1136 break; 1137 case ASI_IMMU_CTXT_NONZERO_CONFIG: 1138 assert(va == 0); 1139 itb->cx_config = data; 1140 break; 1141 case ASI_SPARC_ERROR_EN_REG: 1142 case ASI_SPARC_ERROR_STATUS_REG: 1143 inform("Ignoring write to SPARC ERROR regsiter\n"); 1144 break; 1145 case ASI_HYP_SCRATCHPAD: 1146 case ASI_SCRATCHPAD: 1147 tc->setMiscReg(MISCREG_SCRATCHPAD_R0 + (va >> 3), data); 1148 break; 1149 case ASI_IMMU: 1150 switch (va) { 1151 case 0x18: 1152 itb->sfsr = data; 1153 break; 1154 case 0x30: 1155 sext<59>(bits(data, 59,0)); 1156 itb->tag_access = data; 1157 break; 1158 default: 1159 goto doMmuWriteError; 1160 } 1161 break; 1162 case ASI_ITLB_DATA_ACCESS_REG: 1163 entry_insert = bits(va, 8,3); 1164 case ASI_ITLB_DATA_IN_REG: 1165 assert(entry_insert != -1 || mbits(va,10,9) == va); 1166 ta_insert = itb->tag_access; 1167 va_insert = mbits(ta_insert, 63,13); 1168 ct_insert = mbits(ta_insert, 12,0); 1169 part_insert = tc->readMiscReg(MISCREG_MMU_PART_ID); 1170 real_insert = bits(va, 9,9); 1171 pte.populate(data, bits(va,10,10) ? PageTableEntry::sun4v : 1172 PageTableEntry::sun4u); 1173 tc->getITBPtr()->insert(va_insert, part_insert, ct_insert, real_insert, 1174 pte, entry_insert); 1175 break; 1176 case ASI_DTLB_DATA_ACCESS_REG: 1177 entry_insert = bits(va, 8,3); 1178 case ASI_DTLB_DATA_IN_REG: 1179 assert(entry_insert != -1 || mbits(va,10,9) == va); 1180 ta_insert = tag_access; 1181 va_insert = mbits(ta_insert, 63,13); 1182 ct_insert = mbits(ta_insert, 12,0); 1183 part_insert = tc->readMiscReg(MISCREG_MMU_PART_ID); 1184 real_insert = bits(va, 9,9); 1185 pte.populate(data, bits(va,10,10) ? PageTableEntry::sun4v : 1186 PageTableEntry::sun4u); 1187 insert(va_insert, part_insert, ct_insert, real_insert, pte, 1188 entry_insert); 1189 break; 1190 case ASI_IMMU_DEMAP: 1191 ignore = false; 1192 ctx_id = -1; 1193 part_id = tc->readMiscReg(MISCREG_MMU_PART_ID); 1194 switch (bits(va,5,4)) { 1195 case 0: 1196 ctx_id = tc->readMiscReg(MISCREG_MMU_P_CONTEXT); 1197 break; 1198 case 1: 1199 ignore = true; 1200 break; 1201 case 3: 1202 ctx_id = 0; 1203 break; 1204 default: 1205 ignore = true; 1206 } 1207 1208 switch (bits(va,7,6)) { 1209 case 0: // demap page 1210 if (!ignore) 1211 tc->getITBPtr()->demapPage(mbits(va,63,13), part_id, 1212 bits(va,9,9), ctx_id); 1213 break; 1214 case 1: // demap context 1215 if (!ignore) 1216 tc->getITBPtr()->demapContext(part_id, ctx_id); 1217 break; 1218 case 2: 1219 tc->getITBPtr()->demapAll(part_id); 1220 break; 1221 default: 1222 panic("Invalid type for IMMU demap\n"); 1223 } 1224 break; 1225 case ASI_DMMU: 1226 switch (va) { 1227 case 0x18: 1228 sfsr = data; 1229 break; 1230 case 0x30: 1231 sext<59>(bits(data, 59,0)); 1232 tag_access = data; 1233 break; 1234 case 0x80: 1235 tc->setMiscReg(MISCREG_MMU_PART_ID, data); 1236 break; 1237 default: 1238 goto doMmuWriteError; 1239 } 1240 break; 1241 case ASI_DMMU_DEMAP: 1242 ignore = false; 1243 ctx_id = -1; 1244 part_id = tc->readMiscReg(MISCREG_MMU_PART_ID); 1245 switch (bits(va,5,4)) { 1246 case 0: 1247 ctx_id = tc->readMiscReg(MISCREG_MMU_P_CONTEXT); 1248 break; 1249 case 1: 1250 ctx_id = tc->readMiscReg(MISCREG_MMU_S_CONTEXT); 1251 break; 1252 case 3: 1253 ctx_id = 0; 1254 break; 1255 default: 1256 ignore = true; 1257 } 1258 1259 switch (bits(va,7,6)) { 1260 case 0: // demap page 1261 if (!ignore) 1262 demapPage(mbits(va,63,13), part_id, bits(va,9,9), ctx_id); 1263 break; 1264 case 1: // demap context 1265 if (!ignore) 1266 demapContext(part_id, ctx_id); 1267 break; 1268 case 2: 1269 demapAll(part_id); 1270 break; 1271 default: 1272 panic("Invalid type for IMMU demap\n"); 1273 } 1274 break; 1275 case ASI_SWVR_INTR_RECEIVE: 1276 { 1277 int msb; 1278 // clear all the interrupts that aren't set in the write 1279 SparcISA::Interrupts * interrupts = 1280 dynamic_cast<SparcISA::Interrupts *>( 1281 tc->getCpuPtr()->getInterruptController()); 1282 while (interrupts->get_vec(IT_INT_VEC) & data) { 1283 msb = findMsbSet(interrupts->get_vec(IT_INT_VEC) & data); 1284 tc->getCpuPtr()->clearInterrupt(IT_INT_VEC, msb); 1285 } 1286 } 1287 break; 1288 case ASI_SWVR_UDB_INTR_W: 1289 tc->getSystemPtr()->threadContexts[bits(data,12,8)]->getCpuPtr()-> 1290 postInterrupt(bits(data, 5, 0), 0); 1291 break; 1292 default: 1293doMmuWriteError: 1294 panic("need to impl DTB::doMmuRegWrite() got asi=%#x, va=%#x d=%#x\n", 1295 (uint32_t)pkt->req->getArchFlags(), pkt->getAddr(), data); 1296 } 1297 pkt->makeAtomicResponse(); 1298 return Cycles(1); 1299} 1300 1301void 1302TLB::GetTsbPtr(ThreadContext *tc, Addr addr, int ctx, Addr *ptrs) 1303{ 1304 uint64_t tag_access = mbits(addr,63,13) | mbits(ctx,12,0); 1305 TLB * itb = tc->getITBPtr(); 1306 ptrs[0] = MakeTsbPtr(Ps0, tag_access, 1307 c0_tsb_ps0, 1308 c0_config, 1309 cx_tsb_ps0, 1310 cx_config); 1311 ptrs[1] = MakeTsbPtr(Ps1, tag_access, 1312 c0_tsb_ps1, 1313 c0_config, 1314 cx_tsb_ps1, 1315 cx_config); 1316 ptrs[2] = MakeTsbPtr(Ps0, tag_access, 1317 itb->c0_tsb_ps0, 1318 itb->c0_config, 1319 itb->cx_tsb_ps0, 1320 itb->cx_config); 1321 ptrs[3] = MakeTsbPtr(Ps1, tag_access, 1322 itb->c0_tsb_ps1, 1323 itb->c0_config, 1324 itb->cx_tsb_ps1, 1325 itb->cx_config); 1326} 1327 1328uint64_t 1329TLB::MakeTsbPtr(TsbPageSize ps, uint64_t tag_access, uint64_t c0_tsb, 1330 uint64_t c0_config, uint64_t cX_tsb, uint64_t cX_config) 1331{ 1332 uint64_t tsb; 1333 uint64_t config; 1334 1335 if (bits(tag_access, 12,0) == 0) { 1336 tsb = c0_tsb; 1337 config = c0_config; 1338 } else { 1339 tsb = cX_tsb; 1340 config = cX_config; 1341 } 1342 1343 uint64_t ptr = mbits(tsb,63,13); 1344 bool split = bits(tsb,12,12); 1345 int tsb_size = bits(tsb,3,0); 1346 int page_size = (ps == Ps0) ? bits(config, 2,0) : bits(config,10,8); 1347 1348 if (ps == Ps1 && split) 1349 ptr |= ULL(1) << (13 + tsb_size); 1350 ptr |= (tag_access >> (9 + page_size * 3)) & mask(12+tsb_size, 4); 1351 1352 return ptr; 1353} 1354 1355void 1356TLB::serialize(std::ostream &os) 1357{ 1358 SERIALIZE_SCALAR(size); 1359 SERIALIZE_SCALAR(usedEntries); 1360 SERIALIZE_SCALAR(lastReplaced); 1361 1362 // convert the pointer based free list into an index based one 1363 int *free_list = (int*)malloc(sizeof(int) * size); 1364 int cntr = 0; 1365 std::list<TlbEntry*>::iterator i; 1366 i = freeList.begin(); 1367 while (i != freeList.end()) { 1368 free_list[cntr++] = ((size_t)*i - (size_t)tlb)/ sizeof(TlbEntry); 1369 i++; 1370 } 1371 SERIALIZE_SCALAR(cntr); 1372 SERIALIZE_ARRAY(free_list, cntr); 1373 1374 SERIALIZE_SCALAR(c0_tsb_ps0); 1375 SERIALIZE_SCALAR(c0_tsb_ps1); 1376 SERIALIZE_SCALAR(c0_config); 1377 SERIALIZE_SCALAR(cx_tsb_ps0); 1378 SERIALIZE_SCALAR(cx_tsb_ps1); 1379 SERIALIZE_SCALAR(cx_config); 1380 SERIALIZE_SCALAR(sfsr); 1381 SERIALIZE_SCALAR(tag_access); 1382 1383 for (int x = 0; x < size; x++) { 1384 nameOut(os, csprintf("%s.PTE%d", name(), x)); 1385 tlb[x].serialize(os); 1386 } 1387 SERIALIZE_SCALAR(sfar); 1388} 1389 1390void 1391TLB::unserialize(Checkpoint *cp, const std::string §ion) 1392{ 1393 int oldSize; 1394 1395 paramIn(cp, section, "size", oldSize); 1396 if (oldSize != size) 1397 panic("Don't support unserializing different sized TLBs\n"); 1398 UNSERIALIZE_SCALAR(usedEntries); 1399 UNSERIALIZE_SCALAR(lastReplaced); 1400 1401 int cntr; 1402 UNSERIALIZE_SCALAR(cntr); 1403 1404 int *free_list = (int*)malloc(sizeof(int) * cntr); 1405 freeList.clear(); 1406 UNSERIALIZE_ARRAY(free_list, cntr); 1407 for (int x = 0; x < cntr; x++) 1408 freeList.push_back(&tlb[free_list[x]]); 1409 1410 UNSERIALIZE_SCALAR(c0_tsb_ps0); 1411 UNSERIALIZE_SCALAR(c0_tsb_ps1); 1412 UNSERIALIZE_SCALAR(c0_config); 1413 UNSERIALIZE_SCALAR(cx_tsb_ps0); 1414 UNSERIALIZE_SCALAR(cx_tsb_ps1); 1415 UNSERIALIZE_SCALAR(cx_config); 1416 UNSERIALIZE_SCALAR(sfsr); 1417 UNSERIALIZE_SCALAR(tag_access); 1418 1419 lookupTable.clear(); 1420 for (int x = 0; x < size; x++) { 1421 tlb[x].unserialize(cp, csprintf("%s.PTE%d", section, x)); 1422 if (tlb[x].valid) 1423 lookupTable.insert(tlb[x].range, &tlb[x]); 1424 1425 } 1426 UNSERIALIZE_SCALAR(sfar); 1427} 1428 1429} // namespace SparcISA 1430 1431SparcISA::TLB * 1432SparcTLBParams::create() 1433{ 1434 return new SparcISA::TLB(this); 1435} 1436