DirectoryMemory.cc revision 7025
15627Sgblack@eecs.umich.edu 25627Sgblack@eecs.umich.edu/* 35627Sgblack@eecs.umich.edu * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 45627Sgblack@eecs.umich.edu * All rights reserved. 55627Sgblack@eecs.umich.edu * 65627Sgblack@eecs.umich.edu * Redistribution and use in source and binary forms, with or without 75627Sgblack@eecs.umich.edu * modification, are permitted provided that the following conditions are 85627Sgblack@eecs.umich.edu * met: redistributions of source code must retain the above copyright 95627Sgblack@eecs.umich.edu * notice, this list of conditions and the following disclaimer; 105627Sgblack@eecs.umich.edu * redistributions in binary form must reproduce the above copyright 115627Sgblack@eecs.umich.edu * notice, this list of conditions and the following disclaimer in the 125627Sgblack@eecs.umich.edu * documentation and/or other materials provided with the distribution; 135627Sgblack@eecs.umich.edu * neither the name of the copyright holders nor the names of its 145627Sgblack@eecs.umich.edu * contributors may be used to endorse or promote products derived from 155627Sgblack@eecs.umich.edu * this software without specific prior written permission. 165627Sgblack@eecs.umich.edu * 175627Sgblack@eecs.umich.edu * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 185627Sgblack@eecs.umich.edu * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 195627Sgblack@eecs.umich.edu * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 205627Sgblack@eecs.umich.edu * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 215627Sgblack@eecs.umich.edu * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 225627Sgblack@eecs.umich.edu * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 235627Sgblack@eecs.umich.edu * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 245627Sgblack@eecs.umich.edu * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 255627Sgblack@eecs.umich.edu * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 265627Sgblack@eecs.umich.edu * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 275627Sgblack@eecs.umich.edu * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 285627Sgblack@eecs.umich.edu */ 295627Sgblack@eecs.umich.edu 305627Sgblack@eecs.umich.edu/* 315627Sgblack@eecs.umich.edu * DirectoryMemory.cc 325627Sgblack@eecs.umich.edu * 335627Sgblack@eecs.umich.edu * Description: See DirectoryMemory.hh 345627Sgblack@eecs.umich.edu * 355627Sgblack@eecs.umich.edu * $Id$ 365627Sgblack@eecs.umich.edu * 375627Sgblack@eecs.umich.edu */ 385627Sgblack@eecs.umich.edu 395627Sgblack@eecs.umich.edu#include "mem/ruby/system/System.hh" 405627Sgblack@eecs.umich.edu#include "mem/ruby/system/DirectoryMemory.hh" 415627Sgblack@eecs.umich.edu#include "mem/ruby/slicc_interface/RubySlicc_Util.hh" 425627Sgblack@eecs.umich.edu#include "mem/gems_common/util.hh" 435627Sgblack@eecs.umich.edu 445627Sgblack@eecs.umich.eduint DirectoryMemory::m_num_directories = 0; 455627Sgblack@eecs.umich.eduint DirectoryMemory::m_num_directories_bits = 0; 465627Sgblack@eecs.umich.eduuint64_t DirectoryMemory::m_total_size_bytes = 0; 475627Sgblack@eecs.umich.edu 485627Sgblack@eecs.umich.eduDirectoryMemory::DirectoryMemory(const Params *p) 495627Sgblack@eecs.umich.edu : SimObject(p) 505627Sgblack@eecs.umich.edu{ 515627Sgblack@eecs.umich.edu m_version = p->version; 525627Sgblack@eecs.umich.edu m_size_bytes = p->size; 535627Sgblack@eecs.umich.edu m_size_bits = log_int(m_size_bytes); 545627Sgblack@eecs.umich.edu m_num_entries = 0; 555627Sgblack@eecs.umich.edu m_use_map = p->use_map; 565627Sgblack@eecs.umich.edu m_map_levels = p->map_levels; 575627Sgblack@eecs.umich.edu} 585627Sgblack@eecs.umich.edu 595627Sgblack@eecs.umich.eduvoid DirectoryMemory::init() 605627Sgblack@eecs.umich.edu{ 615627Sgblack@eecs.umich.edu m_num_entries = m_size_bytes / RubySystem::getBlockSizeBytes(); 625627Sgblack@eecs.umich.edu 635627Sgblack@eecs.umich.edu if (m_use_map) { 645627Sgblack@eecs.umich.edu int entry_bits = log_int(m_num_entries); 655627Sgblack@eecs.umich.edu assert(entry_bits >= m_map_levels); 665627Sgblack@eecs.umich.edu m_sparseMemory = new SparseMemory(entry_bits, m_map_levels); 675627Sgblack@eecs.umich.edu } else { 685627Sgblack@eecs.umich.edu m_entries = new Directory_Entry*[m_num_entries]; 695627Sgblack@eecs.umich.edu for (int i=0; i < m_num_entries; i++) 705627Sgblack@eecs.umich.edu m_entries[i] = NULL; 715627Sgblack@eecs.umich.edu } 725627Sgblack@eecs.umich.edu 735627Sgblack@eecs.umich.edu m_ram = g_system_ptr->getMemoryVector(); 745627Sgblack@eecs.umich.edu 755627Sgblack@eecs.umich.edu m_num_directories++; 765627Sgblack@eecs.umich.edu m_num_directories_bits = log_int(m_num_directories); 775627Sgblack@eecs.umich.edu m_total_size_bytes += m_size_bytes; 785627Sgblack@eecs.umich.edu} 795627Sgblack@eecs.umich.edu 805627Sgblack@eecs.umich.eduDirectoryMemory::~DirectoryMemory() 815627Sgblack@eecs.umich.edu{ 825627Sgblack@eecs.umich.edu // free up all the directory entries 835627Sgblack@eecs.umich.edu if (m_entries != NULL) { 845627Sgblack@eecs.umich.edu for (uint64 i = 0; i < m_num_entries; i++) { 855627Sgblack@eecs.umich.edu if (m_entries[i] != NULL) { 865627Sgblack@eecs.umich.edu delete m_entries[i]; 875627Sgblack@eecs.umich.edu } 885627Sgblack@eecs.umich.edu } 895627Sgblack@eecs.umich.edu delete [] m_entries; 905627Sgblack@eecs.umich.edu } else if (m_use_map) { 915627Sgblack@eecs.umich.edu delete m_sparseMemory; 925627Sgblack@eecs.umich.edu } 935627Sgblack@eecs.umich.edu} 945627Sgblack@eecs.umich.edu 955627Sgblack@eecs.umich.eduvoid DirectoryMemory::printConfig(ostream& out) const 965627Sgblack@eecs.umich.edu{ 975627Sgblack@eecs.umich.edu out << "DirectoryMemory module config: " << m_name << endl; 985627Sgblack@eecs.umich.edu out << " version: " << m_version << endl; 995627Sgblack@eecs.umich.edu out << " memory_bits: " << m_size_bits << endl; 1005627Sgblack@eecs.umich.edu out << " memory_size_bytes: " << m_size_bytes << endl; 1015627Sgblack@eecs.umich.edu out << " memory_size_Kbytes: " << double(m_size_bytes) / (1<<10) << endl; 1025627Sgblack@eecs.umich.edu out << " memory_size_Mbytes: " << double(m_size_bytes) / (1<<20) << endl; 1035627Sgblack@eecs.umich.edu out << " memory_size_Gbytes: " << double(m_size_bytes) / (1<<30) << endl; 1045627Sgblack@eecs.umich.edu} 1055627Sgblack@eecs.umich.edu 1065627Sgblack@eecs.umich.edu// Static method 1075627Sgblack@eecs.umich.eduvoid DirectoryMemory::printGlobalConfig(ostream & out) 1085627Sgblack@eecs.umich.edu{ 1095627Sgblack@eecs.umich.edu out << "DirectoryMemory Global Config: " << endl; 110 out << " number of directory memories: " << m_num_directories << endl; 111 if (m_num_directories > 1) { 112 out << " number of selection bits: " << m_num_directories_bits << endl; 113 out << " selection bits: " << RubySystem::getBlockSizeBits()+m_num_directories_bits-1 114 << "-" << RubySystem::getBlockSizeBits() << endl; 115 } 116 out << " total memory size bytes: " << m_total_size_bytes << endl; 117 out << " total memory bits: " << log_int(m_total_size_bytes) << endl; 118 119} 120 121uint64 DirectoryMemory::mapAddressToDirectoryVersion(PhysAddress address) 122{ 123 if (m_num_directories_bits == 0) return 0; 124 uint64 ret = address.bitSelect(RubySystem::getBlockSizeBits(), 125 RubySystem::getBlockSizeBits()+m_num_directories_bits-1); 126 return ret; 127} 128 129// Public method 130bool DirectoryMemory::isPresent(PhysAddress address) 131{ 132 bool ret = (mapAddressToDirectoryVersion(address) == m_version); 133 return ret; 134} 135 136uint64 DirectoryMemory::mapAddressToLocalIdx(PhysAddress address) 137{ 138 uint64 ret = address.getAddress() 139 >> (RubySystem::getBlockSizeBits() + m_num_directories_bits); 140 return ret; 141} 142 143Directory_Entry& DirectoryMemory::lookup(PhysAddress address) 144{ 145 assert(isPresent(address)); 146 Directory_Entry* entry; 147 uint64 idx; 148 DEBUG_EXPR(CACHE_COMP, HighPrio, address); 149 150 if (m_use_map) { 151 if (m_sparseMemory->exist(address)) { 152 entry = m_sparseMemory->lookup(address); 153 assert(entry != NULL); 154 } else { 155 // 156 // Note: SparseMemory internally creates a new Directory Entry 157 // 158 m_sparseMemory->add(address); 159 entry = m_sparseMemory->lookup(address); 160 } 161 } else { 162 idx = mapAddressToLocalIdx(address); 163 assert(idx < m_num_entries); 164 entry = m_entries[idx]; 165 166 if (entry == NULL) { 167 entry = new Directory_Entry(); 168 entry->getDataBlk().assign(m_ram->getBlockPtr(address)); 169 m_entries[idx] = entry; 170 } 171 } 172 173 return (*entry); 174} 175/* 176Directory_Entry& DirectoryMemory::lookup(PhysAddress address) 177{ 178 assert(isPresent(address)); 179 Index index = address.memoryModuleIndex(); 180 181 if (index < 0 || index > m_size) { 182 WARN_EXPR(address.getAddress()); 183 WARN_EXPR(index); 184 WARN_EXPR(m_size); 185 ERROR_MSG("Directory Memory Assertion: accessing memory out of range."); 186 } 187 Directory_Entry* entry = m_entries[index]; 188 189 // allocate the directory entry on demand. 190 if (entry == NULL) { 191 entry = new Directory_Entry; 192 entry->getDataBlk().assign(m_ram->getBlockPtr(address)); 193 194 // store entry to the table 195 m_entries[index] = entry; 196 } 197 198 return (*entry); 199} 200*/ 201 202void DirectoryMemory::invalidateBlock(PhysAddress address) 203{ 204 205 if (m_use_map) { 206 assert(m_sparseMemory->exist(address)); 207 m_sparseMemory->remove(address); 208 } 209 /* 210 else { 211 assert(isPresent(address)); 212 213 Index index = address.memoryModuleIndex(); 214 215 if (index < 0 || index > m_size) { 216 ERROR_MSG("Directory Memory Assertion: accessing memory out of range."); 217 } 218 219 if(m_entries[index] != NULL){ 220 delete m_entries[index]; 221 m_entries[index] = NULL; 222 } 223 } 224 */ 225 226 227} 228 229void DirectoryMemory::print(ostream& out) const 230{ 231 232} 233 234void DirectoryMemory::printStats(ostream& out) const 235{ 236 if (m_use_map) { 237 m_sparseMemory->printStats(out); 238 } 239} 240 241DirectoryMemory * 242RubyDirectoryMemoryParams::create() 243{ 244 return new DirectoryMemory(this); 245} 246