/* * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood * 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. */ /* * DirectoryMemory.cc * * Description: See DirectoryMemory.hh * * $Id$ * */ #include "mem/ruby/system/System.hh" #include "mem/ruby/system/DirectoryMemory.hh" #include "mem/ruby/slicc_interface/RubySlicc_Util.hh" #include "mem/gems_common/util.hh" int DirectoryMemory::m_num_directories = 0; int DirectoryMemory::m_num_directories_bits = 0; uint64_t DirectoryMemory::m_total_size_bytes = 0; DirectoryMemory::DirectoryMemory(const Params *p) : SimObject(p) { m_version = p->version; m_size_bytes = p->size; m_size_bits = log_int(m_size_bytes); } void DirectoryMemory::init() { m_num_entries = m_size_bytes / RubySystem::getBlockSizeBytes(); m_entries = new Directory_Entry*[m_num_entries]; for (int i=0; i < m_num_entries; i++) m_entries[i] = NULL; m_ram = g_system_ptr->getMemoryVector(); m_num_directories++; m_num_directories_bits = log_int(m_num_directories); m_total_size_bytes += m_size_bytes; } DirectoryMemory::~DirectoryMemory() { // free up all the directory entries for (uint64 i=0;i 1) { out << " number of selection bits: " << m_num_directories_bits << endl; out << " selection bits: " << RubySystem::getBlockSizeBits()+m_num_directories_bits-1 << "-" << RubySystem::getBlockSizeBits() << endl; } out << " total memory size bytes: " << m_total_size_bytes << endl; out << " total memory size bits: " << log_int(m_total_size_bytes) << endl; } int DirectoryMemory::mapAddressToDirectoryVersion(PhysAddress address) { if (m_num_directories_bits == 0) return 0; int ret = address.bitSelect(RubySystem::getBlockSizeBits(), RubySystem::getBlockSizeBits()+m_num_directories_bits-1); return ret; } // Public method bool DirectoryMemory::isPresent(PhysAddress address) { bool ret = (mapAddressToDirectoryVersion(address) == m_version); return ret; } int DirectoryMemory::mapAddressToLocalIdx(PhysAddress address) { int ret = address.getAddress() >> (RubySystem::getBlockSizeBits() + m_num_directories_bits); return ret; } Directory_Entry& DirectoryMemory::lookup(PhysAddress address) { assert(isPresent(address)); Directory_Entry* entry; int idx = mapAddressToLocalIdx(address); entry = m_entries[idx]; if (entry == NULL) { entry = new Directory_Entry; entry->getDataBlk().assign(m_ram->getBlockPtr(address)); m_entries[idx] = entry; } return (*entry); } /* Directory_Entry& DirectoryMemory::lookup(PhysAddress address) { assert(isPresent(address)); Index index = address.memoryModuleIndex(); if (index < 0 || index > m_size) { WARN_EXPR(address.getAddress()); WARN_EXPR(index); WARN_EXPR(m_size); ERROR_MSG("Directory Memory Assertion: accessing memory out of range."); } Directory_Entry* entry = m_entries[index]; // allocate the directory entry on demand. if (entry == NULL) { entry = new Directory_Entry; entry->getDataBlk().assign(m_ram->getBlockPtr(address)); // store entry to the table m_entries[index] = entry; } return (*entry); } */ void DirectoryMemory::invalidateBlock(PhysAddress address) { /* assert(isPresent(address)); Index index = address.memoryModuleIndex(); if (index < 0 || index > m_size) { ERROR_MSG("Directory Memory Assertion: accessing memory out of range."); } if(m_entries[index] != NULL){ delete m_entries[index]; m_entries[index] = NULL; } */ } void DirectoryMemory::print(ostream& out) const { } DirectoryMemory * RubyDirectoryMemoryParams::create() { return new DirectoryMemory(this); }