2009-10-27 17:24:39 +01:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2001-2005 The Regents of The University of Michigan
|
|
|
|
* Copyright (c) 2007 MIPS Technologies, Inc.
|
|
|
|
* Copyright (c) 2007-2008 The Florida State University
|
|
|
|
* Copyright (c) 2009 The University of Edinburgh
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are
|
|
|
|
* met: redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer;
|
|
|
|
* redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution;
|
|
|
|
* neither the name of the copyright holders nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived from
|
|
|
|
* this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* Authors: Nathan Binkert
|
|
|
|
* Steve Reinhardt
|
|
|
|
* Jaidev Patwardhan
|
|
|
|
* Stephen Hines
|
|
|
|
* Timothy M. Jones
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <string>
|
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
#include "arch/power/faults.hh"
|
|
|
|
#include "arch/power/pagetable.hh"
|
|
|
|
#include "arch/power/tlb.hh"
|
|
|
|
#include "arch/power/utility.hh"
|
|
|
|
#include "base/inifile.hh"
|
|
|
|
#include "base/str.hh"
|
|
|
|
#include "base/trace.hh"
|
|
|
|
#include "cpu/thread_context.hh"
|
2011-04-15 19:44:32 +02:00
|
|
|
#include "debug/Power.hh"
|
|
|
|
#include "debug/TLB.hh"
|
2009-10-27 17:24:39 +01:00
|
|
|
#include "mem/page_table.hh"
|
|
|
|
#include "params/PowerTLB.hh"
|
2011-10-30 11:55:24 +01:00
|
|
|
#include "sim/full_system.hh"
|
2009-10-27 17:24:39 +01:00
|
|
|
#include "sim/process.hh"
|
|
|
|
|
|
|
|
using namespace std;
|
|
|
|
using namespace PowerISA;
|
|
|
|
|
|
|
|
///////////////////////////////////////////////////////////////////////
|
|
|
|
//
|
|
|
|
// POWER TLB
|
|
|
|
//
|
|
|
|
|
|
|
|
#define MODE2MASK(X) (1 << (X))
|
|
|
|
|
|
|
|
TLB::TLB(const Params *p)
|
|
|
|
: BaseTLB(p), size(p->size), nlu(0)
|
|
|
|
{
|
|
|
|
table = new PowerISA::PTE[size];
|
|
|
|
memset(table, 0, sizeof(PowerISA::PTE[size]));
|
|
|
|
smallPages = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
TLB::~TLB()
|
|
|
|
{
|
|
|
|
if (table)
|
|
|
|
delete [] table;
|
|
|
|
}
|
|
|
|
|
|
|
|
// look up an entry in the TLB
|
|
|
|
PowerISA::PTE *
|
|
|
|
TLB::lookup(Addr vpn, uint8_t asn) const
|
|
|
|
{
|
|
|
|
// assume not found...
|
|
|
|
PowerISA::PTE *retval = NULL;
|
|
|
|
PageTable::const_iterator i = lookupTable.find(vpn);
|
|
|
|
if (i != lookupTable.end()) {
|
|
|
|
while (i->first == vpn) {
|
|
|
|
int index = i->second;
|
|
|
|
PowerISA::PTE *pte = &table[index];
|
|
|
|
Addr Mask = pte->Mask;
|
|
|
|
Addr InvMask = ~Mask;
|
|
|
|
Addr VPN = pte->VPN;
|
|
|
|
if (((vpn & InvMask) == (VPN & InvMask))
|
|
|
|
&& (pte->G || (asn == pte->asid))) {
|
|
|
|
|
|
|
|
// We have a VPN + ASID Match
|
|
|
|
retval = pte;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
++i;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
DPRINTF(TLB, "lookup %#x, asn %#x -> %s ppn %#x\n", vpn, (int)asn,
|
|
|
|
retval ? "hit" : "miss", retval ? retval->PFN1 : 0);
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
|
|
|
PowerISA::PTE*
|
|
|
|
TLB::getEntry(unsigned Index) const
|
|
|
|
{
|
|
|
|
// Make sure that Index is valid
|
|
|
|
assert(Index<size);
|
|
|
|
return &table[Index];
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
TLB::probeEntry(Addr vpn,uint8_t asn) const
|
|
|
|
{
|
|
|
|
// assume not found...
|
|
|
|
int Ind = -1;
|
|
|
|
PageTable::const_iterator i = lookupTable.find(vpn);
|
|
|
|
if (i != lookupTable.end()) {
|
|
|
|
while (i->first == vpn) {
|
|
|
|
int index = i->second;
|
|
|
|
PowerISA::PTE *pte = &table[index];
|
|
|
|
Addr Mask = pte->Mask;
|
|
|
|
Addr InvMask = ~Mask;
|
|
|
|
Addr VPN = pte->VPN;
|
|
|
|
if (((vpn & InvMask) == (VPN & InvMask))
|
|
|
|
&& (pte->G || (asn == pte->asid))) {
|
|
|
|
|
|
|
|
// We have a VPN + ASID Match
|
|
|
|
Ind = index;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
++i;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
DPRINTF(Power, "VPN: %x, asid: %d, Result of TLBP: %d\n", vpn, asn, Ind);
|
|
|
|
return Ind;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline Fault
|
|
|
|
TLB::checkCacheability(RequestPtr &req)
|
|
|
|
{
|
|
|
|
Addr VAddrUncacheable = 0xA0000000;
|
|
|
|
if ((req->getVaddr() & VAddrUncacheable) == VAddrUncacheable) {
|
|
|
|
|
|
|
|
// mark request as uncacheable
|
|
|
|
req->setFlags(Request::UNCACHEABLE);
|
|
|
|
}
|
|
|
|
return NoFault;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
TLB::insertAt(PowerISA::PTE &pte, unsigned Index, int _smallPages)
|
|
|
|
{
|
|
|
|
smallPages=_smallPages;
|
|
|
|
if (Index > size){
|
|
|
|
warn("Attempted to write at index (%d) beyond TLB size (%d)",
|
|
|
|
Index, size);
|
|
|
|
} else {
|
|
|
|
|
|
|
|
// Update TLB
|
|
|
|
if (table[Index].V0 == true || table[Index].V1 == true) {
|
|
|
|
|
|
|
|
// Previous entry is valid
|
|
|
|
PageTable::iterator i = lookupTable.find(table[Index].VPN);
|
|
|
|
lookupTable.erase(i);
|
|
|
|
}
|
|
|
|
table[Index]=pte;
|
|
|
|
|
|
|
|
// Update fast lookup table
|
|
|
|
lookupTable.insert(make_pair(table[Index].VPN, Index));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// insert a new TLB entry
|
|
|
|
void
|
|
|
|
TLB::insert(Addr addr, PowerISA::PTE &pte)
|
|
|
|
{
|
|
|
|
fatal("TLB Insert not yet implemented\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
TLB::flushAll()
|
|
|
|
{
|
|
|
|
DPRINTF(TLB, "flushAll\n");
|
|
|
|
memset(table, 0, sizeof(PowerISA::PTE[size]));
|
|
|
|
lookupTable.clear();
|
|
|
|
nlu = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
TLB::serialize(ostream &os)
|
|
|
|
{
|
|
|
|
SERIALIZE_SCALAR(size);
|
|
|
|
SERIALIZE_SCALAR(nlu);
|
|
|
|
|
|
|
|
for (int i = 0; i < size; i++) {
|
|
|
|
nameOut(os, csprintf("%s.PTE%d", name(), i));
|
|
|
|
table[i].serialize(os);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
TLB::unserialize(Checkpoint *cp, const string §ion)
|
|
|
|
{
|
|
|
|
UNSERIALIZE_SCALAR(size);
|
|
|
|
UNSERIALIZE_SCALAR(nlu);
|
|
|
|
|
|
|
|
for (int i = 0; i < size; i++) {
|
|
|
|
table[i].unserialize(cp, csprintf("%s.PTE%d", section, i));
|
|
|
|
if (table[i].V0 || table[i].V1) {
|
|
|
|
lookupTable.insert(make_pair(table[i].VPN, i));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
TLB::regStats()
|
|
|
|
{
|
|
|
|
read_hits
|
|
|
|
.name(name() + ".read_hits")
|
|
|
|
.desc("DTB read hits")
|
|
|
|
;
|
|
|
|
|
|
|
|
read_misses
|
|
|
|
.name(name() + ".read_misses")
|
|
|
|
.desc("DTB read misses")
|
|
|
|
;
|
|
|
|
|
|
|
|
|
|
|
|
read_accesses
|
|
|
|
.name(name() + ".read_accesses")
|
|
|
|
.desc("DTB read accesses")
|
|
|
|
;
|
|
|
|
|
|
|
|
write_hits
|
|
|
|
.name(name() + ".write_hits")
|
|
|
|
.desc("DTB write hits")
|
|
|
|
;
|
|
|
|
|
|
|
|
write_misses
|
|
|
|
.name(name() + ".write_misses")
|
|
|
|
.desc("DTB write misses")
|
|
|
|
;
|
|
|
|
|
|
|
|
|
|
|
|
write_accesses
|
|
|
|
.name(name() + ".write_accesses")
|
|
|
|
.desc("DTB write accesses")
|
|
|
|
;
|
|
|
|
|
|
|
|
hits
|
|
|
|
.name(name() + ".hits")
|
|
|
|
.desc("DTB hits")
|
|
|
|
;
|
|
|
|
|
|
|
|
misses
|
|
|
|
.name(name() + ".misses")
|
|
|
|
.desc("DTB misses")
|
|
|
|
;
|
|
|
|
|
|
|
|
accesses
|
|
|
|
.name(name() + ".accesses")
|
|
|
|
.desc("DTB accesses")
|
|
|
|
;
|
|
|
|
|
|
|
|
hits = read_hits + write_hits;
|
|
|
|
misses = read_misses + write_misses;
|
|
|
|
accesses = read_accesses + write_accesses;
|
|
|
|
}
|
|
|
|
|
|
|
|
Fault
|
2010-02-12 20:53:19 +01:00
|
|
|
TLB::translateInst(RequestPtr req, ThreadContext *tc)
|
|
|
|
{
|
|
|
|
// Instruction accesses must be word-aligned
|
|
|
|
if (req->getVaddr() & 0x3) {
|
|
|
|
DPRINTF(TLB, "Alignment Fault on %#x, size = %d\n", req->getVaddr(),
|
|
|
|
req->getSize());
|
|
|
|
return new AlignmentFault();
|
|
|
|
}
|
|
|
|
|
|
|
|
Process * p = tc->getProcessPtr();
|
|
|
|
|
|
|
|
Fault fault = p->pTable->translate(req);
|
|
|
|
if (fault != NoFault)
|
|
|
|
return fault;
|
|
|
|
|
|
|
|
return NoFault;
|
|
|
|
}
|
|
|
|
|
|
|
|
Fault
|
|
|
|
TLB::translateData(RequestPtr req, ThreadContext *tc, bool write)
|
2009-10-27 17:24:39 +01:00
|
|
|
{
|
|
|
|
Process * p = tc->getProcessPtr();
|
|
|
|
|
|
|
|
Fault fault = p->pTable->translate(req);
|
|
|
|
if (fault != NoFault)
|
|
|
|
return fault;
|
|
|
|
|
|
|
|
return NoFault;
|
2010-02-12 20:53:19 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
Fault
|
|
|
|
TLB::translateAtomic(RequestPtr req, ThreadContext *tc, Mode mode)
|
|
|
|
{
|
2012-01-29 11:04:34 +01:00
|
|
|
if (FullSystem)
|
2011-10-30 11:55:24 +01:00
|
|
|
fatal("translate atomic not yet implemented in full system mode.\n");
|
2012-01-29 11:04:34 +01:00
|
|
|
|
|
|
|
if (mode == Execute)
|
|
|
|
return translateInst(req, tc);
|
|
|
|
else
|
|
|
|
return translateData(req, tc, mode == Write);
|
2009-10-27 17:24:39 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
TLB::translateTiming(RequestPtr req, ThreadContext *tc,
|
|
|
|
Translation *translation, Mode mode)
|
|
|
|
{
|
|
|
|
assert(translation);
|
|
|
|
translation->finish(translateAtomic(req, tc, mode), req, tc, mode);
|
|
|
|
}
|
|
|
|
|
2012-03-09 15:59:28 +01:00
|
|
|
Fault
|
|
|
|
TLB::translateFunctional(RequestPtr req, ThreadContext *tc, Mode mode)
|
|
|
|
{
|
|
|
|
panic("Not implemented\n");
|
|
|
|
return NoFault;
|
|
|
|
}
|
|
|
|
|
2013-06-03 13:55:41 +02:00
|
|
|
Fault
|
|
|
|
TLB::finalizePhysical(RequestPtr req, ThreadContext *tc, Mode mode) const
|
|
|
|
{
|
|
|
|
return NoFault;
|
|
|
|
}
|
|
|
|
|
2009-10-27 17:24:39 +01:00
|
|
|
PowerISA::PTE &
|
|
|
|
TLB::index(bool advance)
|
|
|
|
{
|
|
|
|
PowerISA::PTE *pte = &table[nlu];
|
|
|
|
|
|
|
|
if (advance)
|
|
|
|
nextnlu();
|
|
|
|
|
|
|
|
return *pte;
|
|
|
|
}
|
|
|
|
|
|
|
|
PowerISA::TLB *
|
|
|
|
PowerTLBParams::create()
|
|
|
|
{
|
|
|
|
return new PowerISA::TLB(this);
|
|
|
|
}
|