/*
+ * Copyright (c) 2014 Advanced Micro Devices, Inc.
* Copyright (c) 2003 The Regents of The University of Michigan
* All rights reserved.
*
* 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: Steve Reinhardt
- * Ron Dreslinski
- * Ali Saidi
*/
/**
* @file
- * Definitions of page table.
+ * Definitions of functional page table.
*/
-#include <string>
-#include <map>
-#include <fstream>
-
-#include "arch/faults.hh"
-#include "base/bitfield.hh"
-#include "base/intmath.hh"
-#include "base/trace.hh"
#include "mem/page_table.hh"
-#include "sim/builder.hh"
-#include "sim/sim_object.hh"
-#include "sim/system.hh"
-using namespace std;
-using namespace TheISA;
+#include <string>
-PageTable::PageTable(System *_system, Addr _pageSize)
- : pageSize(_pageSize), offsetMask(mask(floorLog2(_pageSize))),
- system(_system)
-{
- assert(isPowerOf2(pageSize));
- pTableCache[0].vaddr = 0;
- pTableCache[1].vaddr = 0;
- pTableCache[2].vaddr = 0;
-}
+#include "base/compiler.hh"
+#include "base/trace.hh"
+#include "debug/MMU.hh"
+#include "sim/faults.hh"
+#include "sim/serialize.hh"
-PageTable::~PageTable()
+void
+EmulationPageTable::map(Addr vaddr, Addr paddr, int64_t size, uint64_t flags)
{
-}
+ bool clobber = flags & Clobber;
+ // starting address must be page aligned
+ assert(pageOffset(vaddr) == 0);
-Fault
-PageTable::page_check(Addr addr, int64_t size) const
-{
- if (size < sizeof(uint64_t)) {
- if (!isPowerOf2(size)) {
- panic("Invalid request size!\n");
- return genMachineCheckFault();
- }
+ DPRINTF(MMU, "Allocating Page: %#x-%#x\n", vaddr, vaddr + size);
- if ((size - 1) & addr)
- return genAlignmentFault();
- }
- else {
- if ((addr & (VMPageSize - 1)) + size > VMPageSize) {
- panic("Invalid request size!\n");
- return genMachineCheckFault();
+ while (size > 0) {
+ auto it = pTable.find(vaddr);
+ if (it != pTable.end()) {
+ // already mapped
+ panic_if(!clobber,
+ "EmulationPageTable::allocate: addr %#x already mapped",
+ vaddr);
+ it->second = Entry(paddr, flags);
+ } else {
+ pTable.emplace(vaddr, Entry(paddr, flags));
}
- if ((sizeof(uint64_t) - 1) & addr)
- return genAlignmentFault();
+ size -= _pageSize;
+ vaddr += _pageSize;
+ paddr += _pageSize;
}
-
- return NoFault;
}
-
void
-PageTable::allocate(Addr vaddr, int64_t size)
+EmulationPageTable::remap(Addr vaddr, int64_t size, Addr new_vaddr)
{
- // starting address must be page aligned
assert(pageOffset(vaddr) == 0);
+ assert(pageOffset(new_vaddr) == 0);
- DPRINTF(MMU, "Allocating Page: %#x-%#x\n", vaddr, vaddr+ size);
+ DPRINTF(MMU, "moving pages from vaddr %08p to %08p, size = %d\n", vaddr,
+ new_vaddr, size);
- for (; size > 0; size -= pageSize, vaddr += pageSize) {
- m5::hash_map<Addr,Addr>::iterator iter = pTable.find(vaddr);
+ while (size > 0) {
+ M5_VAR_USED auto new_it = pTable.find(new_vaddr);
+ auto old_it = pTable.find(vaddr);
+ assert(old_it != pTable.end() && new_it == pTable.end());
- if (iter != pTable.end()) {
- // already mapped
- fatal("PageTable::allocate: address 0x%x already mapped", vaddr);
- }
-
- pTable[vaddr] = system->new_page();
- updateCache(vaddr, pTable[vaddr]);
+ pTable.emplace(new_vaddr, old_it->second);
+ pTable.erase(old_it);
+ size -= _pageSize;
+ vaddr += _pageSize;
+ new_vaddr += _pageSize;
}
}
+void
+EmulationPageTable::getMappings(std::vector<std::pair<Addr, Addr>> *addr_maps)
+{
+ for (auto &iter : pTable)
+ addr_maps->push_back(std::make_pair(iter.first, iter.second.paddr));
+}
+void
+EmulationPageTable::unmap(Addr vaddr, int64_t size)
+{
+ assert(pageOffset(vaddr) == 0);
+
+ DPRINTF(MMU, "Unmapping page: %#x-%#x\n", vaddr, vaddr + size);
+
+ while (size > 0) {
+ auto it = pTable.find(vaddr);
+ assert(it != pTable.end());
+ pTable.erase(it);
+ size -= _pageSize;
+ vaddr += _pageSize;
+ }
+}
bool
-PageTable::translate(Addr vaddr, Addr &paddr)
+EmulationPageTable::isUnmapped(Addr vaddr, int64_t size)
{
- Addr page_addr = pageAlign(vaddr);
- paddr = 0;
+ // starting address must be page aligned
+ assert(pageOffset(vaddr) == 0);
- if (pTableCache[0].vaddr == page_addr) {
- paddr = pTableCache[0].paddr + pageOffset(vaddr);
- return true;
- }
- if (pTableCache[1].vaddr == page_addr) {
- paddr = pTableCache[1].paddr + pageOffset(vaddr);
- return true;
- }
- if (pTableCache[2].vaddr == page_addr) {
- paddr = pTableCache[2].paddr + pageOffset(vaddr);
- return true;
- }
+ for (int64_t offset = 0; offset < size; offset += _pageSize)
+ if (pTable.find(vaddr + offset) != pTable.end())
+ return false;
- m5::hash_map<Addr,Addr>::iterator iter = pTable.find(page_addr);
+ return true;
+}
- if (iter == pTable.end()) {
+const EmulationPageTable::Entry *
+EmulationPageTable::lookup(Addr vaddr)
+{
+ Addr page_addr = pageAlign(vaddr);
+ PTableItr iter = pTable.find(page_addr);
+ if (iter == pTable.end())
+ return nullptr;
+ return &(iter->second);
+}
+
+bool
+EmulationPageTable::translate(Addr vaddr, Addr &paddr)
+{
+ const Entry *entry = lookup(vaddr);
+ if (!entry) {
+ DPRINTF(MMU, "Couldn't Translate: %#x\n", vaddr);
return false;
}
-
- updateCache(page_addr, iter->second);
- paddr = iter->second + pageOffset(vaddr);
+ paddr = pageOffset(vaddr) + entry->paddr;
+ DPRINTF(MMU, "Translating: %#x->%#x\n", vaddr, paddr);
return true;
}
-
Fault
-PageTable::translate(RequestPtr &req)
+EmulationPageTable::translate(const RequestPtr &req)
{
Addr paddr;
- assert(pageAlign(req->getVaddr() + req->getSize() - 1)
- == pageAlign(req->getVaddr()));
- if (!translate(req->getVaddr(), paddr)) {
- return Fault(new PageTableFault(req->getVaddr()));
- }
+ assert(pageAlign(req->getVaddr() + req->getSize() - 1) ==
+ pageAlign(req->getVaddr()));
+ if (!translate(req->getVaddr(), paddr))
+ return Fault(new GenericPageTableFault(req->getVaddr()));
req->setPaddr(paddr);
- return page_check(req->getPaddr(), req->getSize());
+ if ((paddr & (_pageSize - 1)) + req->getSize() > _pageSize) {
+ panic("Request spans page boundaries!\n");
+ return NoFault;
+ }
+ return NoFault;
}
void
-PageTable::serialize(std::ostream &os)
+EmulationPageTable::serialize(CheckpointOut &cp) const
{
- paramOut(os, "ptable.size", pTable.size());
-
- int count = 0;
+ ScopedCheckpointSection sec(cp, "ptable");
+ paramOut(cp, "size", pTable.size());
- m5::hash_map<Addr,Addr>::iterator iter = pTable.begin();
- m5::hash_map<Addr,Addr>::iterator end = pTable.end();
- while (iter != end) {
- paramOut(os, csprintf("ptable.entry%dvaddr", count), iter->first);
- paramOut(os, csprintf("ptable.entry%dpaddr", count), iter->second);
+ PTable::size_type count = 0;
+ for (auto &pte : pTable) {
+ ScopedCheckpointSection sec(cp, csprintf("Entry%d", count++));
- ++iter;
- ++count;
+ paramOut(cp, "vaddr", pte.first);
+ paramOut(cp, "paddr", pte.second.paddr);
+ paramOut(cp, "flags", pte.second.flags);
}
assert(count == pTable.size());
}
void
-PageTable::unserialize(Checkpoint *cp, const std::string §ion)
+EmulationPageTable::unserialize(CheckpointIn &cp)
{
- int i = 0, count;
- paramIn(cp, section, "ptable.size", count);
- Addr vaddr, paddr;
+ int count;
+ ScopedCheckpointSection sec(cp, "ptable");
+ paramIn(cp, "size", count);
- pTable.clear();
+ for (int i = 0; i < count; ++i) {
+ ScopedCheckpointSection sec(cp, csprintf("Entry%d", i));
- while(i < count) {
- paramIn(cp, section, csprintf("ptable.entry%dvaddr", i), vaddr);
- paramIn(cp, section, csprintf("ptable.entry%dpaddr", i), paddr);
- pTable[vaddr] = paddr;
- ++i;
- }
+ Addr vaddr;
+ UNSERIALIZE_SCALAR(vaddr);
+ Addr paddr;
+ uint64_t flags;
+ UNSERIALIZE_SCALAR(paddr);
+ UNSERIALIZE_SCALAR(flags);
+ pTable.emplace(vaddr, Entry(paddr, flags));
+ }
}
projects / gem5.git / blobdiff