CheckTable.cc revision 11025
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{ 4011025Snilay@cs.wisc.edu Addr physical = 0; 416899SN/A 427053SN/A const int size1 = 32; 437053SN/A const int size2 = 100; 446899SN/A 457053SN/A // The first set is to get some false sharing 467053SN/A physical = 1000; 477053SN/A for (int i = 0; i < size1; i++) { 487053SN/A // Setup linear addresses 4911025Snilay@cs.wisc.edu addCheck(physical); 507053SN/A physical += CHECK_SIZE; 517053SN/A } 526899SN/A 537053SN/A // The next two sets are to get some limited false sharing and 547053SN/A // cache conflicts 557053SN/A physical = 1000; 567053SN/A for (int i = 0; i < size2; i++) { 577053SN/A // Setup linear addresses 5811025Snilay@cs.wisc.edu addCheck(physical); 597053SN/A physical += 256; 607053SN/A } 616899SN/A 627053SN/A physical = 1000 + CHECK_SIZE; 637053SN/A for (int i = 0; i < size2; i++) { 647053SN/A // Setup linear addresses 6511025Snilay@cs.wisc.edu addCheck(physical); 667053SN/A physical += 256; 677053SN/A } 686899SN/A} 696899SN/A 706899SN/ACheckTable::~CheckTable() 716899SN/A{ 727053SN/A int size = m_check_vector.size(); 737053SN/A for (int i = 0; i < size; i++) 747053SN/A delete m_check_vector[i]; 756899SN/A} 766899SN/A 777053SN/Avoid 7811025Snilay@cs.wisc.eduCheckTable::addCheck(Addr address) 796899SN/A{ 807056SN/A if (floorLog2(CHECK_SIZE) != 0) { 8111025Snilay@cs.wisc.edu if (bitSelect(address, 0, CHECK_SIZE_BITS - 1) != 0) { 827805Snilay@cs.wisc.edu panic("Check not aligned"); 837053SN/A } 846899SN/A } 856899SN/A 867053SN/A for (int i = 0; i < CHECK_SIZE; i++) { 8711025Snilay@cs.wisc.edu if (m_lookup_map.count(address+i)) { 887053SN/A // A mapping for this byte already existed, discard the 897053SN/A // entire check 907053SN/A return; 917053SN/A } 926899SN/A } 936899SN/A 9411025Snilay@cs.wisc.edu Check* check_ptr = new Check(address, 100 + m_check_vector.size(), 958932SBrad.Beckmann@amd.com m_num_writers, m_num_readers, m_tester_ptr); 967053SN/A for (int i = 0; i < CHECK_SIZE; i++) { 977053SN/A // Insert it once per byte 9811025Snilay@cs.wisc.edu m_lookup_map[address + i] = check_ptr; 997053SN/A } 1007454SN/A m_check_vector.push_back(check_ptr); 1016899SN/A} 1026899SN/A 1037053SN/ACheck* 1047053SN/ACheckTable::getRandomCheck() 1056899SN/A{ 1069108SBrad.Beckmann@amd.com assert(m_check_vector.size() > 0); 10710348Sandreas.hansson@arm.com return m_check_vector[random_mt.random<unsigned>(0, m_check_vector.size() - 1)]; 1086899SN/A} 1096899SN/A 1107053SN/ACheck* 11111025Snilay@cs.wisc.eduCheckTable::getCheck(const Addr address) 1126899SN/A{ 1137780Snilay@cs.wisc.edu DPRINTF(RubyTest, "Looking for check by address: %s", address); 1146899SN/A 11511025Snilay@cs.wisc.edu m5::hash_map<Addr, Check*>::iterator i = m_lookup_map.find(address); 1167455SN/A 1177455SN/A if (i == m_lookup_map.end()) 1187053SN/A return NULL; 1197455SN/A 1207455SN/A Check* check = i->second; 1217455SN/A assert(check != NULL); 1227455SN/A return check; 1236899SN/A} 1246899SN/A 1257053SN/Avoid 1267055SN/ACheckTable::print(std::ostream& out) const 1276899SN/A{ 1286899SN/A} 129