CheckTable.cc revision 10348
16899SN/A/* 26899SN/A * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 36899SN/A * Copyright (c) 2009 Advanced Micro Devices, Inc. 46899SN/A * All rights reserved. 56899SN/A * 66899SN/A * Redistribution and use in source and binary forms, with or without 76899SN/A * modification, are permitted provided that the following conditions are 86899SN/A * met: redistributions of source code must retain the above copyright 96899SN/A * notice, this list of conditions and the following disclaimer; 106899SN/A * redistributions in binary form must reproduce the above copyright 116899SN/A * notice, this list of conditions and the following disclaimer in the 126899SN/A * documentation and/or other materials provided with the distribution; 136899SN/A * neither the name of the copyright holders nor the names of its 146899SN/A * contributors may be used to endorse or promote products derived from 156899SN/A * this software without specific prior written permission. 166899SN/A * 176899SN/A * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 186899SN/A * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 196899SN/A * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 206899SN/A * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 216899SN/A * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 226899SN/A * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 236899SN/A * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 246899SN/A * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 256899SN/A * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 266899SN/A * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 276899SN/A * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 286899SN/A */ 296899SN/A 307056SN/A#include "base/intmath.hh" 3110348Sandreas.hansson@arm.com#include "base/random.hh" 327632SBrad.Beckmann@amd.com#include "cpu/testers/rubytest/Check.hh" 337632SBrad.Beckmann@amd.com#include "cpu/testers/rubytest/CheckTable.hh" 348232Snate@binkert.org#include "debug/RubyTest.hh" 356899SN/A 368932SBrad.Beckmann@amd.comCheckTable::CheckTable(int _num_writers, int _num_readers, RubyTester* _tester) 378932SBrad.Beckmann@amd.com : m_num_writers(_num_writers), m_num_readers(_num_readers), 388932SBrad.Beckmann@amd.com m_tester_ptr(_tester) 396899SN/A{ 407053SN/A physical_address_t physical = 0; 417053SN/A Address address; 426899SN/A 437053SN/A const int size1 = 32; 447053SN/A const int size2 = 100; 456899SN/A 467053SN/A // The first set is to get some false sharing 477053SN/A physical = 1000; 487053SN/A for (int i = 0; i < size1; i++) { 497053SN/A // Setup linear addresses 507053SN/A address.setAddress(physical); 517053SN/A addCheck(address); 527053SN/A physical += CHECK_SIZE; 537053SN/A } 546899SN/A 557053SN/A // The next two sets are to get some limited false sharing and 567053SN/A // cache conflicts 577053SN/A physical = 1000; 587053SN/A for (int i = 0; i < size2; i++) { 597053SN/A // Setup linear addresses 607053SN/A address.setAddress(physical); 617053SN/A addCheck(address); 627053SN/A physical += 256; 637053SN/A } 646899SN/A 657053SN/A physical = 1000 + CHECK_SIZE; 667053SN/A for (int i = 0; i < size2; i++) { 677053SN/A // Setup linear addresses 687053SN/A address.setAddress(physical); 697053SN/A addCheck(address); 707053SN/A physical += 256; 717053SN/A } 726899SN/A} 736899SN/A 746899SN/ACheckTable::~CheckTable() 756899SN/A{ 767053SN/A int size = m_check_vector.size(); 777053SN/A for (int i = 0; i < size; i++) 787053SN/A delete m_check_vector[i]; 796899SN/A} 806899SN/A 817053SN/Avoid 827053SN/ACheckTable::addCheck(const Address& address) 836899SN/A{ 847056SN/A if (floorLog2(CHECK_SIZE) != 0) { 857053SN/A if (address.bitSelect(0, CHECK_SIZE_BITS - 1) != 0) { 867805Snilay@cs.wisc.edu panic("Check not aligned"); 877053SN/A } 886899SN/A } 896899SN/A 907053SN/A for (int i = 0; i < CHECK_SIZE; i++) { 917455SN/A if (m_lookup_map.count(Address(address.getAddress()+i))) { 927053SN/A // A mapping for this byte already existed, discard the 937053SN/A // entire check 947053SN/A return; 957053SN/A } 966899SN/A } 976899SN/A 987053SN/A Check* check_ptr = new Check(address, Address(100 + m_check_vector.size()), 998932SBrad.Beckmann@amd.com m_num_writers, m_num_readers, m_tester_ptr); 1007053SN/A for (int i = 0; i < CHECK_SIZE; i++) { 1017053SN/A // Insert it once per byte 1027455SN/A m_lookup_map[Address(address.getAddress() + i)] = check_ptr; 1037053SN/A } 1047454SN/A m_check_vector.push_back(check_ptr); 1056899SN/A} 1066899SN/A 1077053SN/ACheck* 1087053SN/ACheckTable::getRandomCheck() 1096899SN/A{ 1109108SBrad.Beckmann@amd.com assert(m_check_vector.size() > 0); 11110348Sandreas.hansson@arm.com return m_check_vector[random_mt.random<unsigned>(0, m_check_vector.size() - 1)]; 1126899SN/A} 1136899SN/A 1147053SN/ACheck* 1157053SN/ACheckTable::getCheck(const Address& address) 1166899SN/A{ 1177780Snilay@cs.wisc.edu DPRINTF(RubyTest, "Looking for check by address: %s", address); 1186899SN/A 1197455SN/A m5::hash_map<Address, Check*>::iterator i = m_lookup_map.find(address); 1207455SN/A 1217455SN/A if (i == m_lookup_map.end()) 1227053SN/A return NULL; 1237455SN/A 1247455SN/A Check* check = i->second; 1257455SN/A assert(check != NULL); 1267455SN/A return check; 1276899SN/A} 1286899SN/A 1297053SN/Avoid 1307055SN/ACheckTable::print(std::ostream& out) const 1316899SN/A{ 1326899SN/A} 133