CheckTable.cc revision 7455
110448Snilay@cs.wisc.edu/* 210448Snilay@cs.wisc.edu * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 310448Snilay@cs.wisc.edu * Copyright (c) 2009 Advanced Micro Devices, Inc. 410448Snilay@cs.wisc.edu * All rights reserved. 510448Snilay@cs.wisc.edu * 610448Snilay@cs.wisc.edu * Redistribution and use in source and binary forms, with or without 710448Snilay@cs.wisc.edu * modification, are permitted provided that the following conditions are 810448Snilay@cs.wisc.edu * met: redistributions of source code must retain the above copyright 910448Snilay@cs.wisc.edu * notice, this list of conditions and the following disclaimer; 1010448Snilay@cs.wisc.edu * redistributions in binary form must reproduce the above copyright 1110448Snilay@cs.wisc.edu * notice, this list of conditions and the following disclaimer in the 1210448Snilay@cs.wisc.edu * documentation and/or other materials provided with the distribution; 1310448Snilay@cs.wisc.edu * neither the name of the copyright holders nor the names of its 1410448Snilay@cs.wisc.edu * contributors may be used to endorse or promote products derived from 1510448Snilay@cs.wisc.edu * this software without specific prior written permission. 1610448Snilay@cs.wisc.edu * 1710448Snilay@cs.wisc.edu * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 1810448Snilay@cs.wisc.edu * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 1910448Snilay@cs.wisc.edu * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 2010448Snilay@cs.wisc.edu * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 2110448Snilay@cs.wisc.edu * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 2210447Snilay@cs.wisc.edu * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 2310447Snilay@cs.wisc.edu * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 2410447Snilay@cs.wisc.edu * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 2510447Snilay@cs.wisc.edu * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 2610447Snilay@cs.wisc.edu * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 2710447Snilay@cs.wisc.edu * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 2810447Snilay@cs.wisc.edu */ 2910447Snilay@cs.wisc.edu 3010447Snilay@cs.wisc.edu#include "base/intmath.hh" 3110447Snilay@cs.wisc.edu#include "cpu/rubytest/Check.hh" 3210447Snilay@cs.wisc.edu#include "cpu/rubytest/CheckTable.hh" 3310447Snilay@cs.wisc.edu#include "cpu/rubytest/CheckTable.hh" 3410447Snilay@cs.wisc.edu 3510447Snilay@cs.wisc.eduCheckTable::CheckTable(int _num_cpu_sequencers, RubyTester* _tester) 3610447Snilay@cs.wisc.edu : m_num_cpu_sequencers(_num_cpu_sequencers), m_tester_ptr(_tester) 3710447Snilay@cs.wisc.edu{ 3810447Snilay@cs.wisc.edu physical_address_t physical = 0; 3910447Snilay@cs.wisc.edu Address address; 4010447Snilay@cs.wisc.edu 4110447Snilay@cs.wisc.edu const int size1 = 32; 4210447Snilay@cs.wisc.edu const int size2 = 100; 4310447Snilay@cs.wisc.edu 4410447Snilay@cs.wisc.edu // The first set is to get some false sharing 4510447Snilay@cs.wisc.edu physical = 1000; 4610447Snilay@cs.wisc.edu for (int i = 0; i < size1; i++) { 4710447Snilay@cs.wisc.edu // Setup linear addresses 4810447Snilay@cs.wisc.edu address.setAddress(physical); 4910447Snilay@cs.wisc.edu addCheck(address); 5010447Snilay@cs.wisc.edu physical += CHECK_SIZE; 5110447Snilay@cs.wisc.edu } 5210447Snilay@cs.wisc.edu 5310447Snilay@cs.wisc.edu // The next two sets are to get some limited false sharing and 5410447Snilay@cs.wisc.edu // cache conflicts 5510447Snilay@cs.wisc.edu physical = 1000; 5610447Snilay@cs.wisc.edu for (int i = 0; i < size2; i++) { 5710447Snilay@cs.wisc.edu // Setup linear addresses 5810447Snilay@cs.wisc.edu address.setAddress(physical); 5910447Snilay@cs.wisc.edu addCheck(address); 6010447Snilay@cs.wisc.edu physical += 256; 6110447Snilay@cs.wisc.edu } 6210447Snilay@cs.wisc.edu 6310447Snilay@cs.wisc.edu physical = 1000 + CHECK_SIZE; 6410447Snilay@cs.wisc.edu for (int i = 0; i < size2; i++) { 6510447Snilay@cs.wisc.edu // Setup linear addresses 6610447Snilay@cs.wisc.edu address.setAddress(physical); 6710447Snilay@cs.wisc.edu addCheck(address); 6810447Snilay@cs.wisc.edu physical += 256; 6910447Snilay@cs.wisc.edu } 7010447Snilay@cs.wisc.edu} 7110447Snilay@cs.wisc.edu 7210447Snilay@cs.wisc.eduCheckTable::~CheckTable() 7310447Snilay@cs.wisc.edu{ 7410447Snilay@cs.wisc.edu int size = m_check_vector.size(); 7510447Snilay@cs.wisc.edu for (int i = 0; i < size; i++) 7610447Snilay@cs.wisc.edu delete m_check_vector[i]; 7710447Snilay@cs.wisc.edu} 7810447Snilay@cs.wisc.edu 7910447Snilay@cs.wisc.eduvoid 8010447Snilay@cs.wisc.eduCheckTable::addCheck(const Address& address) 8110447Snilay@cs.wisc.edu{ 8210447Snilay@cs.wisc.edu if (floorLog2(CHECK_SIZE) != 0) { 8310447Snilay@cs.wisc.edu if (address.bitSelect(0, CHECK_SIZE_BITS - 1) != 0) { 8410447Snilay@cs.wisc.edu ERROR_MSG("Check not aligned"); 8510447Snilay@cs.wisc.edu } 8610447Snilay@cs.wisc.edu } 8710447Snilay@cs.wisc.edu 8810447Snilay@cs.wisc.edu for (int i = 0; i < CHECK_SIZE; i++) { 8910447Snilay@cs.wisc.edu if (m_lookup_map.count(Address(address.getAddress()+i))) { 9010447Snilay@cs.wisc.edu // A mapping for this byte already existed, discard the 9110447Snilay@cs.wisc.edu // entire check 9210447Snilay@cs.wisc.edu return; 9310447Snilay@cs.wisc.edu } 9410447Snilay@cs.wisc.edu } 9510447Snilay@cs.wisc.edu 9610447Snilay@cs.wisc.edu Check* check_ptr = new Check(address, Address(100 + m_check_vector.size()), 9710447Snilay@cs.wisc.edu m_num_cpu_sequencers, m_tester_ptr); 9810447Snilay@cs.wisc.edu for (int i = 0; i < CHECK_SIZE; i++) { 9910447Snilay@cs.wisc.edu // Insert it once per byte 10010447Snilay@cs.wisc.edu m_lookup_map[Address(address.getAddress() + i)] = check_ptr; 10110447Snilay@cs.wisc.edu } 10210447Snilay@cs.wisc.edu m_check_vector.push_back(check_ptr); 10310447Snilay@cs.wisc.edu} 10410447Snilay@cs.wisc.edu 10510447Snilay@cs.wisc.eduCheck* 10610447Snilay@cs.wisc.eduCheckTable::getRandomCheck() 10710447Snilay@cs.wisc.edu{ 108 return m_check_vector[random() % m_check_vector.size()]; 109} 110 111Check* 112CheckTable::getCheck(const Address& address) 113{ 114 DEBUG_MSG(TESTER_COMP, MedPrio, "Looking for check by address"); 115 DEBUG_EXPR(TESTER_COMP, MedPrio, address); 116 117 m5::hash_map<Address, Check*>::iterator i = m_lookup_map.find(address); 118 119 if (i == m_lookup_map.end()) 120 return NULL; 121 122 Check* check = i->second; 123 assert(check != NULL); 124 return check; 125} 126 127void 128CheckTable::print(std::ostream& out) const 129{ 130} 131