tlb.cc revision 8607:5fb918115c07
16313Sgblack@eecs.umich.edu/* 26313Sgblack@eecs.umich.edu * Copyright (c) 2001-2005 The Regents of The University of Michigan 36313Sgblack@eecs.umich.edu * Copyright (c) 2007 MIPS Technologies, Inc. 46313Sgblack@eecs.umich.edu * All rights reserved. 56313Sgblack@eecs.umich.edu * 66313Sgblack@eecs.umich.edu * Redistribution and use in source and binary forms, with or without 76313Sgblack@eecs.umich.edu * modification, are permitted provided that the following conditions are 86313Sgblack@eecs.umich.edu * met: redistributions of source code must retain the above copyright 96313Sgblack@eecs.umich.edu * notice, this list of conditions and the following disclaimer; 106313Sgblack@eecs.umich.edu * redistributions in binary form must reproduce the above copyright 116313Sgblack@eecs.umich.edu * notice, this list of conditions and the following disclaimer in the 126313Sgblack@eecs.umich.edu * documentation and/or other materials provided with the distribution; 136313Sgblack@eecs.umich.edu * neither the name of the copyright holders nor the names of its 146313Sgblack@eecs.umich.edu * contributors may be used to endorse or promote products derived from 156313Sgblack@eecs.umich.edu * this software without specific prior written permission. 166313Sgblack@eecs.umich.edu * 176313Sgblack@eecs.umich.edu * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 186313Sgblack@eecs.umich.edu * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 196313Sgblack@eecs.umich.edu * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 206313Sgblack@eecs.umich.edu * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 216313Sgblack@eecs.umich.edu * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 226313Sgblack@eecs.umich.edu * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 236313Sgblack@eecs.umich.edu * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 246313Sgblack@eecs.umich.edu * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 256313Sgblack@eecs.umich.edu * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 266313Sgblack@eecs.umich.edu * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 276313Sgblack@eecs.umich.edu * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 286313Sgblack@eecs.umich.edu * 296313Sgblack@eecs.umich.edu * Authors: Nathan Binkert 306313Sgblack@eecs.umich.edu * Steve Reinhardt 316313Sgblack@eecs.umich.edu * Jaidev Patwardhan 326313Sgblack@eecs.umich.edu */ 336313Sgblack@eecs.umich.edu 348229Snate@binkert.org#include <string> 356334Sgblack@eecs.umich.edu#include <vector> 366334Sgblack@eecs.umich.edu 376334Sgblack@eecs.umich.edu#include "arch/mips/faults.hh" 386334Sgblack@eecs.umich.edu#include "arch/mips/pagetable.hh" 396313Sgblack@eecs.umich.edu#include "arch/mips/pra_constants.hh" 406334Sgblack@eecs.umich.edu#include "arch/mips/tlb.hh" 417878Sgblack@eecs.umich.edu#include "arch/mips/utility.hh" 426313Sgblack@eecs.umich.edu#include "base/inifile.hh" 436334Sgblack@eecs.umich.edu#include "base/str.hh" 446313Sgblack@eecs.umich.edu#include "base/trace.hh" 456313Sgblack@eecs.umich.edu#include "cpu/thread_context.hh" 466334Sgblack@eecs.umich.edu#include "debug/MipsPRA.hh" 476313Sgblack@eecs.umich.edu#include "debug/TLB.hh" 486313Sgblack@eecs.umich.edu#include "mem/page_table.hh" 496313Sgblack@eecs.umich.edu#include "params/MipsTLB.hh" 506313Sgblack@eecs.umich.edu#include "sim/process.hh" 516313Sgblack@eecs.umich.edu 526334Sgblack@eecs.umich.eduusing namespace std; 536334Sgblack@eecs.umich.eduusing namespace MipsISA; 546334Sgblack@eecs.umich.edu 556334Sgblack@eecs.umich.edu/////////////////////////////////////////////////////////////////////// 566313Sgblack@eecs.umich.edu// 578181Sksewell@umich.edu// MIPS TLB 588181Sksewell@umich.edu// 598181Sksewell@umich.edu 608181Sksewell@umich.edustatic inline mode_type 616334Sgblack@eecs.umich.edugetOperatingMode(MiscReg Stat) 626334Sgblack@eecs.umich.edu{ 636334Sgblack@eecs.umich.edu if ((Stat & 0x10000006) != 0 || (Stat & 0x18) ==0) { 646334Sgblack@eecs.umich.edu return mode_kernel; 656334Sgblack@eecs.umich.edu } else if ((Stat & 0x18) == 0x8) { 666334Sgblack@eecs.umich.edu return mode_supervisor; 676334Sgblack@eecs.umich.edu } else if ((Stat & 0x18) == 0x10) { 686334Sgblack@eecs.umich.edu return mode_user; 696334Sgblack@eecs.umich.edu } else { 706334Sgblack@eecs.umich.edu return mode_number; 716313Sgblack@eecs.umich.edu } 728181Sksewell@umich.edu} 736313Sgblack@eecs.umich.edu 748181Sksewell@umich.edu 756334Sgblack@eecs.umich.eduTLB::TLB(const Params *p) 768181Sksewell@umich.edu : BaseTLB(p), size(p->size), nlu(0) 776334Sgblack@eecs.umich.edu{ 786334Sgblack@eecs.umich.edu table = new PTE[size]; 796334Sgblack@eecs.umich.edu memset(table, 0, sizeof(PTE[size])); 806334Sgblack@eecs.umich.edu smallPages = 0; 816334Sgblack@eecs.umich.edu} 826334Sgblack@eecs.umich.edu 836334Sgblack@eecs.umich.eduTLB::~TLB() 846334Sgblack@eecs.umich.edu{ 856334Sgblack@eecs.umich.edu if (table) 866334Sgblack@eecs.umich.edu delete [] table; 876334Sgblack@eecs.umich.edu} 886334Sgblack@eecs.umich.edu 896334Sgblack@eecs.umich.edu// look up an entry in the TLB 906334Sgblack@eecs.umich.eduMipsISA::PTE * 916334Sgblack@eecs.umich.eduTLB::lookup(Addr vpn, uint8_t asn) const 926334Sgblack@eecs.umich.edu{ 936334Sgblack@eecs.umich.edu // assume not found... 946334Sgblack@eecs.umich.edu PTE *retval = NULL; 956334Sgblack@eecs.umich.edu PageTable::const_iterator i = lookupTable.find(vpn); 966334Sgblack@eecs.umich.edu if (i != lookupTable.end()) { 976334Sgblack@eecs.umich.edu while (i->first == vpn) { 986334Sgblack@eecs.umich.edu int index = i->second; 996334Sgblack@eecs.umich.edu PTE *pte = &table[index]; 1006334Sgblack@eecs.umich.edu 1016334Sgblack@eecs.umich.edu /* 1KB TLB Lookup code - from MIPS ARM Volume III - Rev. 2.50 */ 1026334Sgblack@eecs.umich.edu Addr Mask = pte->Mask; 1036334Sgblack@eecs.umich.edu Addr InvMask = ~Mask; 1046334Sgblack@eecs.umich.edu Addr VPN = pte->VPN; 1056334Sgblack@eecs.umich.edu if (((vpn & InvMask) == (VPN & InvMask)) && 1066334Sgblack@eecs.umich.edu (pte->G || (asn == pte->asid))) { 1076334Sgblack@eecs.umich.edu // We have a VPN + ASID Match 1086334Sgblack@eecs.umich.edu retval = pte; 1096334Sgblack@eecs.umich.edu break; 1106334Sgblack@eecs.umich.edu } 1116334Sgblack@eecs.umich.edu ++i; 1126334Sgblack@eecs.umich.edu } 1136334Sgblack@eecs.umich.edu } 1146334Sgblack@eecs.umich.edu 1156334Sgblack@eecs.umich.edu DPRINTF(TLB, "lookup %#x, asn %#x -> %s ppn %#x\n", vpn, (int)asn, 1166334Sgblack@eecs.umich.edu retval ? "hit" : "miss", retval ? retval->PFN1 : 0); 1176334Sgblack@eecs.umich.edu return retval; 1186334Sgblack@eecs.umich.edu} 1196334Sgblack@eecs.umich.edu 1206334Sgblack@eecs.umich.eduMipsISA::PTE* 1216313Sgblack@eecs.umich.eduTLB::getEntry(unsigned Index) const 1226334Sgblack@eecs.umich.edu{ 1236334Sgblack@eecs.umich.edu // Make sure that Index is valid 1246334Sgblack@eecs.umich.edu assert(Index<size); 1256334Sgblack@eecs.umich.edu return &table[Index]; 1266334Sgblack@eecs.umich.edu} 1276313Sgblack@eecs.umich.edu 1286334Sgblack@eecs.umich.eduint 1296334Sgblack@eecs.umich.eduTLB::probeEntry(Addr vpn, uint8_t asn) const 1306334Sgblack@eecs.umich.edu{ 1316313Sgblack@eecs.umich.edu // assume not found... 1326334Sgblack@eecs.umich.edu int Ind = -1; 1336334Sgblack@eecs.umich.edu PageTable::const_iterator i = lookupTable.find(vpn); 1346313Sgblack@eecs.umich.edu if (i != lookupTable.end()) { 1356334Sgblack@eecs.umich.edu while (i->first == vpn) { 1366334Sgblack@eecs.umich.edu int index = i->second; 1376334Sgblack@eecs.umich.edu PTE *pte = &table[index]; 1386334Sgblack@eecs.umich.edu 1399180Sandreas.hansson@arm.com /* 1KB TLB Lookup code - from MIPS ARM Volume III - Rev. 2.50 */ 1406334Sgblack@eecs.umich.edu Addr Mask = pte->Mask; 1416334Sgblack@eecs.umich.edu Addr InvMask = ~Mask; 1426334Sgblack@eecs.umich.edu Addr VPN = pte->VPN; 1436334Sgblack@eecs.umich.edu if (((vpn & InvMask) == (VPN & InvMask)) && 1446334Sgblack@eecs.umich.edu (pte->G || (asn == pte->asid))) { 1456334Sgblack@eecs.umich.edu // We have a VPN + ASID Match 1469180Sandreas.hansson@arm.com Ind = index; 1476334Sgblack@eecs.umich.edu break; 1486334Sgblack@eecs.umich.edu } 1496334Sgblack@eecs.umich.edu ++i; 1506806Sgblack@eecs.umich.edu } 1516334Sgblack@eecs.umich.edu } 1526334Sgblack@eecs.umich.edu DPRINTF(MipsPRA,"VPN: %x, asid: %d, Result of TLBP: %d\n",vpn,asn,Ind); 1536334Sgblack@eecs.umich.edu return Ind; 1546334Sgblack@eecs.umich.edu} 1556334Sgblack@eecs.umich.edu 1566334Sgblack@eecs.umich.eduinline Fault 1576334Sgblack@eecs.umich.eduTLB::checkCacheability(RequestPtr &req) 1586313Sgblack@eecs.umich.edu{ 1596313Sgblack@eecs.umich.edu Addr VAddrUncacheable = 0xA0000000; 1606313Sgblack@eecs.umich.edu // In MIPS, cacheability is controlled by certain bits of the virtual 1616313Sgblack@eecs.umich.edu // address or by the TLB entry 1626313Sgblack@eecs.umich.edu if ((req->getVaddr() & VAddrUncacheable) == VAddrUncacheable) { 1636313Sgblack@eecs.umich.edu // mark request as uncacheable 1646313Sgblack@eecs.umich.edu req->setFlags(Request::UNCACHEABLE); 1656313Sgblack@eecs.umich.edu } 1666313Sgblack@eecs.umich.edu return NoFault; 1676313Sgblack@eecs.umich.edu} 1686313Sgblack@eecs.umich.edu 1696313Sgblack@eecs.umich.eduvoid 1706313Sgblack@eecs.umich.eduTLB::insertAt(PTE &pte, unsigned Index, int _smallPages) 1716678Sgblack@eecs.umich.edu{ 1726678Sgblack@eecs.umich.edu smallPages = _smallPages; 1736678Sgblack@eecs.umich.edu if (Index > size) { 1746678Sgblack@eecs.umich.edu warn("Attempted to write at index (%d) beyond TLB size (%d)", 1756678Sgblack@eecs.umich.edu Index, size); 1766313Sgblack@eecs.umich.edu } else { 1776313Sgblack@eecs.umich.edu // Update TLB 1786313Sgblack@eecs.umich.edu DPRINTF(TLB, "TLB[%d]: %x %x %x %x\n", 1796313Sgblack@eecs.umich.edu Index, pte.Mask << 11, 180 ((pte.VPN << 11) | pte.asid), 181 ((pte.PFN0 << 6) | (pte.C0 << 3) | 182 (pte.D0 << 2) | (pte.V0 <<1) | pte.G), 183 ((pte.PFN1 <<6) | (pte.C1 << 3) | 184 (pte.D1 << 2) | (pte.V1 <<1) | pte.G)); 185 if (table[Index].V0 == true || table[Index].V1 == true) { 186 // Previous entry is valid 187 PageTable::iterator i = lookupTable.find(table[Index].VPN); 188 lookupTable.erase(i); 189 } 190 table[Index]=pte; 191 // Update fast lookup table 192 lookupTable.insert(make_pair(table[Index].VPN, Index)); 193 } 194} 195 196// insert a new TLB entry 197void 198TLB::insert(Addr addr, PTE &pte) 199{ 200 fatal("TLB Insert not yet implemented\n"); 201} 202 203void 204TLB::flushAll() 205{ 206 DPRINTF(TLB, "flushAll\n"); 207 memset(table, 0, sizeof(PTE[size])); 208 lookupTable.clear(); 209 nlu = 0; 210} 211 212void 213TLB::serialize(ostream &os) 214{ 215 SERIALIZE_SCALAR(size); 216 SERIALIZE_SCALAR(nlu); 217 218 for (int i = 0; i < size; i++) { 219 nameOut(os, csprintf("%s.PTE%d", name(), i)); 220 table[i].serialize(os); 221 } 222} 223 224void 225TLB::unserialize(Checkpoint *cp, const string §ion) 226{ 227 UNSERIALIZE_SCALAR(size); 228 UNSERIALIZE_SCALAR(nlu); 229 230 for (int i = 0; i < size; i++) { 231 table[i].unserialize(cp, csprintf("%s.PTE%d", section, i)); 232 if (table[i].V0 || table[i].V1) { 233 lookupTable.insert(make_pair(table[i].VPN, i)); 234 } 235 } 236} 237 238void 239TLB::regStats() 240{ 241 read_hits 242 .name(name() + ".read_hits") 243 .desc("DTB read hits") 244 ; 245 246 read_misses 247 .name(name() + ".read_misses") 248 .desc("DTB read misses") 249 ; 250 251 252 read_accesses 253 .name(name() + ".read_accesses") 254 .desc("DTB read accesses") 255 ; 256 257 write_hits 258 .name(name() + ".write_hits") 259 .desc("DTB write hits") 260 ; 261 262 write_misses 263 .name(name() + ".write_misses") 264 .desc("DTB write misses") 265 ; 266 267 268 write_accesses 269 .name(name() + ".write_accesses") 270 .desc("DTB write accesses") 271 ; 272 273 hits 274 .name(name() + ".hits") 275 .desc("DTB hits") 276 ; 277 278 misses 279 .name(name() + ".misses") 280 .desc("DTB misses") 281 ; 282 283 accesses 284 .name(name() + ".accesses") 285 .desc("DTB accesses") 286 ; 287 288 hits = read_hits + write_hits; 289 misses = read_misses + write_misses; 290 accesses = read_accesses + write_accesses; 291} 292 293Fault 294TLB::translateInst(RequestPtr req, ThreadContext *tc) 295{ 296#if !FULL_SYSTEM 297 Process * p = tc->getProcessPtr(); 298 299 Fault fault = p->pTable->translate(req); 300 if (fault != NoFault) 301 return fault; 302 303 return NoFault; 304#else 305 Addr vaddr = req->getVaddr(); 306 307 bool misaligned = (req->getSize() - 1) & vaddr; 308 309 if (IsKSeg0(vaddr)) { 310 // Address will not be translated through TLB, set response, and go! 311 req->setPaddr(KSeg02Phys(vaddr)); 312 if (getOperatingMode(tc->readMiscReg(MISCREG_STATUS)) != mode_kernel || 313 misaligned) { 314 return new AddressErrorFault(vaddr, false); 315 } 316 } else if(IsKSeg1(vaddr)) { 317 // Address will not be translated through TLB, set response, and go! 318 req->setPaddr(KSeg02Phys(vaddr)); 319 } else { 320 /* 321 * This is an optimization - smallPages is updated every time a TLB 322 * operation is performed. That way, we don't need to look at 323 * Config3 _ SP and PageGrain _ ESP every time we do a TLB lookup 324 */ 325 Addr VPN; 326 if (smallPages == 1) { 327 VPN = (vaddr >> 11); 328 } else { 329 VPN = ((vaddr >> 11) & 0xFFFFFFFC); 330 } 331 uint8_t Asid = req->getAsid(); 332 if (misaligned) { 333 // Unaligned address! 334 return new AddressErrorFault(vaddr, false); 335 } 336 PTE *pte = lookup(VPN,Asid); 337 if (pte != NULL) { 338 // Ok, found something 339 /* Check for valid bits */ 340 int EvenOdd; 341 bool Valid; 342 if ((((vaddr) >> pte->AddrShiftAmount) & 1) == 0) { 343 // Check even bits 344 Valid = pte->V0; 345 EvenOdd = 0; 346 } else { 347 // Check odd bits 348 Valid = pte->V1; 349 EvenOdd = 1; 350 } 351 352 if (Valid == false) { 353 return new InvalidFault(Asid, vaddr, vpn, false); 354 } else { 355 // Ok, this is really a match, set paddr 356 Addr PAddr; 357 if (EvenOdd == 0) { 358 PAddr = pte->PFN0; 359 } else { 360 PAddr = pte->PFN1; 361 } 362 PAddr >>= (pte->AddrShiftAmount - 12); 363 PAddr <<= pte->AddrShiftAmount; 364 PAddr |= (vaddr & pte->OffsetMask); 365 req->setPaddr(PAddr); 366 } 367 } else { 368 // Didn't find any match, return a TLB Refill Exception 369 return new RefillFault(Asid, vaddr, vpn, false); 370 } 371 } 372 return checkCacheability(req); 373#endif 374} 375 376Fault 377TLB::translateData(RequestPtr req, ThreadContext *tc, bool write) 378{ 379#if !FULL_SYSTEM 380 //@TODO: This should actually use TLB instead of going directly 381 // to the page table in syscall mode. 382 /** 383 * Check for alignment faults 384 */ 385 if (req->getVaddr() & (req->getSize() - 1)) { 386 DPRINTF(TLB, "Alignment Fault on %#x, size = %d", req->getVaddr(), 387 req->getSize()); 388 return new AddressErrorFault(req->getVaddr(), write); 389 } 390 391 392 Process * p = tc->getProcessPtr(); 393 394 Fault fault = p->pTable->translate(req); 395 if (fault != NoFault) 396 return fault; 397 398 return NoFault; 399#else 400 Addr vaddr = req->getVaddr(); 401 402 bool misaligned = (req->getSize() - 1) & vaddr; 403 404 if (IsKSeg0(vaddr)) { 405 // Address will not be translated through TLB, set response, and go! 406 req->setPaddr(KSeg02Phys(vaddr)); 407 if (getOperatingMode(tc->readMiscReg(MISCREG_STATUS)) != mode_kernel || 408 misaligned) { 409 return new AddressErrorFault(vaddr, true); 410 } 411 } else if(IsKSeg1(vaddr)) { 412 // Address will not be translated through TLB, set response, and go! 413 req->setPaddr(KSeg02Phys(vaddr)); 414 } else { 415 /* 416 * This is an optimization - smallPages is updated every time a TLB 417 * operation is performed. That way, we don't need to look at 418 * Config3 _ SP and PageGrain _ ESP every time we do a TLB lookup 419 */ 420 Addr VPN = (vaddr >> 11) & 0xFFFFFFFC; 421 if (smallPages == 1) { 422 VPN = vaddr >> 11; 423 } 424 uint8_t Asid = req->getAsid(); 425 PTE *pte = lookup(VPN, Asid); 426 if (misaligned) { 427 return new AddressErrorFault(vaddr, true); 428 } 429 if (pte != NULL) { 430 // Ok, found something 431 /* Check for valid bits */ 432 int EvenOdd; 433 bool Valid; 434 bool Dirty; 435 if ((((vaddr >> pte->AddrShiftAmount) & 1)) == 0) { 436 // Check even bits 437 Valid = pte->V0; 438 Dirty = pte->D0; 439 EvenOdd = 0; 440 } else { 441 // Check odd bits 442 Valid = pte->V1; 443 Dirty = pte->D1; 444 EvenOdd = 1; 445 } 446 447 if (Valid == false) { 448 return new InvalidFault(Asid, vaddr, VPN, true); 449 } else { 450 // Ok, this is really a match, set paddr 451 if (!Dirty) { 452 return new TlbModifiedFault(Asid, vaddr, VPN); 453 } 454 Addr PAddr; 455 if (EvenOdd == 0) { 456 PAddr = pte->PFN0; 457 } else { 458 PAddr = pte->PFN1; 459 } 460 PAddr >>= (pte->AddrShiftAmount - 12); 461 PAddr <<= pte->AddrShiftAmount; 462 PAddr |= (vaddr & pte->OffsetMask); 463 req->setPaddr(PAddr); 464 } 465 } else { 466 // Didn't find any match, return a TLB Refill Exception 467 return new RefillFault(Asid, vaddr, VPN, true); 468 } 469 } 470 return checkCacheability(req); 471#endif 472} 473 474Fault 475TLB::translateAtomic(RequestPtr req, ThreadContext *tc, Mode mode) 476{ 477 if (mode == Execute) 478 return translateInst(req, tc); 479 else 480 return translateData(req, tc, mode == Write); 481} 482 483void 484TLB::translateTiming(RequestPtr req, ThreadContext *tc, 485 Translation *translation, Mode mode) 486{ 487 assert(translation); 488 translation->finish(translateAtomic(req, tc, mode), req, tc, mode); 489} 490 491 492MipsISA::PTE & 493TLB::index(bool advance) 494{ 495 PTE *pte = &table[nlu]; 496 497 if (advance) 498 nextnlu(); 499 500 return *pte; 501} 502 503MipsISA::TLB * 504MipsTLBParams::create() 505{ 506 return new TLB(this); 507} 508