CheckTable.cc revision 8232
111878Sandreas.sandberg@arm.com/* 211878Sandreas.sandberg@arm.com * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 311878Sandreas.sandberg@arm.com * Copyright (c) 2009 Advanced Micro Devices, Inc. 411878Sandreas.sandberg@arm.com * All rights reserved. 511878Sandreas.sandberg@arm.com * 611878Sandreas.sandberg@arm.com * Redistribution and use in source and binary forms, with or without 711878Sandreas.sandberg@arm.com * modification, are permitted provided that the following conditions are 811878Sandreas.sandberg@arm.com * met: redistributions of source code must retain the above copyright 911878Sandreas.sandberg@arm.com * notice, this list of conditions and the following disclaimer; 1011878Sandreas.sandberg@arm.com * redistributions in binary form must reproduce the above copyright 1111878Sandreas.sandberg@arm.com * notice, this list of conditions and the following disclaimer in the 1211878Sandreas.sandberg@arm.com * documentation and/or other materials provided with the distribution; 134126SN/A * neither the name of the copyright holders nor the names of its 148295Snate@binkert.org * contributors may be used to endorse or promote products derived from 154126SN/A * this software without specific prior written permission. 164126SN/A * 174126SN/A * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 184126SN/A * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 194126SN/A * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 204126SN/A * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 214126SN/A * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 224126SN/A * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 234126SN/A * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 244126SN/A * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 254126SN/A * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 264126SN/A * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 274126SN/A * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 284126SN/A */ 294126SN/A 304126SN/A#include "base/intmath.hh" 314126SN/A#include "cpu/testers/rubytest/Check.hh" 324126SN/A#include "cpu/testers/rubytest/CheckTable.hh" 334126SN/A#include "debug/RubyTest.hh" 344126SN/A 354126SN/ACheckTable::CheckTable(int _num_cpu_sequencers, RubyTester* _tester) 364126SN/A : m_num_cpu_sequencers(_num_cpu_sequencers), m_tester_ptr(_tester) 374126SN/A{ 384126SN/A physical_address_t physical = 0; 394126SN/A Address address; 404126SN/A 4111878Sandreas.sandberg@arm.com const int size1 = 32; 424126SN/A const int size2 = 100; 438296Snate@binkert.org 448296Snate@binkert.org // The first set is to get some false sharing 4511802Sandreas.sandberg@arm.com physical = 1000; 468295Snate@binkert.org for (int i = 0; i < size1; i++) { 478296Snate@binkert.org // Setup linear addresses 484126SN/A address.setAddress(physical); 4911766Sandreas.sandberg@arm.com addCheck(address); 5011802Sandreas.sandberg@arm.com physical += CHECK_SIZE; 5111802Sandreas.sandberg@arm.com } 5211766Sandreas.sandberg@arm.com 538296Snate@binkert.org // The next two sets are to get some limited false sharing and 5411878Sandreas.sandberg@arm.com // cache conflicts 5511878Sandreas.sandberg@arm.com physical = 1000; 5611878Sandreas.sandberg@arm.com for (int i = 0; i < size2; i++) { 5711878Sandreas.sandberg@arm.com // Setup linear addresses 5811878Sandreas.sandberg@arm.com address.setAddress(physical); 5911878Sandreas.sandberg@arm.com addCheck(address); 6011878Sandreas.sandberg@arm.com physical += 256; 6111878Sandreas.sandberg@arm.com } 6211878Sandreas.sandberg@arm.com 6311878Sandreas.sandberg@arm.com physical = 1000 + CHECK_SIZE; 6411878Sandreas.sandberg@arm.com for (int i = 0; i < size2; i++) { 6511878Sandreas.sandberg@arm.com // Setup linear addresses 6611878Sandreas.sandberg@arm.com address.setAddress(physical); 6711878Sandreas.sandberg@arm.com addCheck(address); 6811878Sandreas.sandberg@arm.com physical += 256; 6911878Sandreas.sandberg@arm.com } 7011878Sandreas.sandberg@arm.com} 7111878Sandreas.sandberg@arm.com 7211878Sandreas.sandberg@arm.comCheckTable::~CheckTable() 7311878Sandreas.sandberg@arm.com{ 7413712Sandreas.sandberg@arm.com int size = m_check_vector.size(); 7513712Sandreas.sandberg@arm.com for (int i = 0; i < size; i++) 7613712Sandreas.sandberg@arm.com delete m_check_vector[i]; 7713712Sandreas.sandberg@arm.com} 7813712Sandreas.sandberg@arm.com 7911878Sandreas.sandberg@arm.comvoid 8011878Sandreas.sandberg@arm.comCheckTable::addCheck(const Address& address) 8111878Sandreas.sandberg@arm.com{ 8211878Sandreas.sandberg@arm.com if (floorLog2(CHECK_SIZE) != 0) { 8311878Sandreas.sandberg@arm.com if (address.bitSelect(0, CHECK_SIZE_BITS - 1) != 0) { 8411878Sandreas.sandberg@arm.com panic("Check not aligned"); 8511878Sandreas.sandberg@arm.com } 8611878Sandreas.sandberg@arm.com } 8711878Sandreas.sandberg@arm.com 8811878Sandreas.sandberg@arm.com for (int i = 0; i < CHECK_SIZE; i++) { 8911878Sandreas.sandberg@arm.com if (m_lookup_map.count(Address(address.getAddress()+i))) { 9011878Sandreas.sandberg@arm.com // A mapping for this byte already existed, discard the 9111878Sandreas.sandberg@arm.com // entire check 9211878Sandreas.sandberg@arm.com return; 9311878Sandreas.sandberg@arm.com } 9411878Sandreas.sandberg@arm.com } 9511878Sandreas.sandberg@arm.com 9611878Sandreas.sandberg@arm.com Check* check_ptr = new Check(address, Address(100 + m_check_vector.size()), 9711878Sandreas.sandberg@arm.com m_num_cpu_sequencers, m_tester_ptr); 9811878Sandreas.sandberg@arm.com for (int i = 0; i < CHECK_SIZE; i++) { 9911878Sandreas.sandberg@arm.com // Insert it once per byte 10011878Sandreas.sandberg@arm.com m_lookup_map[Address(address.getAddress() + i)] = check_ptr; 10111878Sandreas.sandberg@arm.com } 10211878Sandreas.sandberg@arm.com m_check_vector.push_back(check_ptr); 10311878Sandreas.sandberg@arm.com} 10411878Sandreas.sandberg@arm.com 10511878Sandreas.sandberg@arm.comCheck* 10611878Sandreas.sandberg@arm.comCheckTable::getRandomCheck() 10711878Sandreas.sandberg@arm.com{ 10811878Sandreas.sandberg@arm.com return m_check_vector[random() % m_check_vector.size()]; 10911878Sandreas.sandberg@arm.com} 11011878Sandreas.sandberg@arm.com 11111878Sandreas.sandberg@arm.comCheck* 11211878Sandreas.sandberg@arm.comCheckTable::getCheck(const Address& address) 11311878Sandreas.sandberg@arm.com{ 11411878Sandreas.sandberg@arm.com DPRINTF(RubyTest, "Looking for check by address: %s", address); 11511878Sandreas.sandberg@arm.com 11611878Sandreas.sandberg@arm.com m5::hash_map<Address, Check*>::iterator i = m_lookup_map.find(address); 11711878Sandreas.sandberg@arm.com 11811878Sandreas.sandberg@arm.com if (i == m_lookup_map.end()) 11911878Sandreas.sandberg@arm.com return NULL; 12011878Sandreas.sandberg@arm.com 12111878Sandreas.sandberg@arm.com Check* check = i->second; 12211878Sandreas.sandberg@arm.com assert(check != NULL); 12311878Sandreas.sandberg@arm.com return check; 12411878Sandreas.sandberg@arm.com} 12511878Sandreas.sandberg@arm.com 12611878Sandreas.sandberg@arm.comvoid 12711878Sandreas.sandberg@arm.comCheckTable::print(std::ostream& out) const 12811878Sandreas.sandberg@arm.com{ 12911878Sandreas.sandberg@arm.com} 13011878Sandreas.sandberg@arm.com