CheckTable.cc revision 11800
19157Sandreas.hansson@arm.com/* 211524Sdavid.guillen@arm.com * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 310000Sclt67@cornell.edu * Copyright (c) 2009 Advanced Micro Devices, Inc. 49157Sandreas.hansson@arm.com * All rights reserved. 59157Sandreas.hansson@arm.com * 69157Sandreas.hansson@arm.com * Redistribution and use in source and binary forms, with or without 79157Sandreas.hansson@arm.com * modification, are permitted provided that the following conditions are 89157Sandreas.hansson@arm.com * met: redistributions of source code must retain the above copyright 99157Sandreas.hansson@arm.com * notice, this list of conditions and the following disclaimer; 109157Sandreas.hansson@arm.com * redistributions in binary form must reproduce the above copyright 119157Sandreas.hansson@arm.com * notice, this list of conditions and the following disclaimer in the 129157Sandreas.hansson@arm.com * documentation and/or other materials provided with the distribution; 139157Sandreas.hansson@arm.com * neither the name of the copyright holders nor the names of its 149157Sandreas.hansson@arm.com * contributors may be used to endorse or promote products derived from 159157Sandreas.hansson@arm.com * this software without specific prior written permission. 169157Sandreas.hansson@arm.com * 179157Sandreas.hansson@arm.com * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 189157Sandreas.hansson@arm.com * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 199157Sandreas.hansson@arm.com * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 209157Sandreas.hansson@arm.com * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 219157Sandreas.hansson@arm.com * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 229157Sandreas.hansson@arm.com * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 239157Sandreas.hansson@arm.com * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 249157Sandreas.hansson@arm.com * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 259157Sandreas.hansson@arm.com * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 269157Sandreas.hansson@arm.com * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 279157Sandreas.hansson@arm.com * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 289157Sandreas.hansson@arm.com */ 299157Sandreas.hansson@arm.com 309157Sandreas.hansson@arm.com#include "cpu/testers/rubytest/CheckTable.hh" 319157Sandreas.hansson@arm.com 329157Sandreas.hansson@arm.com#include "base/intmath.hh" 339157Sandreas.hansson@arm.com#include "base/random.hh" 349157Sandreas.hansson@arm.com#include "base/trace.hh" 359157Sandreas.hansson@arm.com#include "cpu/testers/rubytest/Check.hh" 369157Sandreas.hansson@arm.com#include "debug/RubyTest.hh" 379157Sandreas.hansson@arm.com 389157Sandreas.hansson@arm.comCheckTable::CheckTable(int _num_writers, int _num_readers, RubyTester* _tester) 3910000Sclt67@cornell.edu : m_num_writers(_num_writers), m_num_readers(_num_readers), 4011524Sdavid.guillen@arm.com m_tester_ptr(_tester) 4111524Sdavid.guillen@arm.com{ 429157Sandreas.hansson@arm.com Addr physical = 0; 439157Sandreas.hansson@arm.com 449157Sandreas.hansson@arm.com const int size1 = 32; 459157Sandreas.hansson@arm.com const int size2 = 100; 469157Sandreas.hansson@arm.com 479157Sandreas.hansson@arm.com DPRINTF(RubyTest, "Adding false sharing checks\n"); 489157Sandreas.hansson@arm.com // The first set is to get some false sharing 499157Sandreas.hansson@arm.com physical = 1000; 509157Sandreas.hansson@arm.com for (int i = 0; i < size1; i++) { 519157Sandreas.hansson@arm.com // Setup linear addresses 5211524Sdavid.guillen@arm.com addCheck(physical); 539157Sandreas.hansson@arm.com physical += CHECK_SIZE; 549418Sandreas.hansson@arm.com } 5511524Sdavid.guillen@arm.com 569157Sandreas.hansson@arm.com DPRINTF(RubyTest, "Adding cache conflict checks\n"); 579356Snilay@cs.wisc.edu // The next two sets are to get some limited false sharing and 589793Sakash.bagdia@arm.com // cache conflicts 599157Sandreas.hansson@arm.com physical = 1000; 609157Sandreas.hansson@arm.com for (int i = 0; i < size2; i++) { 619157Sandreas.hansson@arm.com // Setup linear addresses 6211009Sandreas.sandberg@arm.com addCheck(physical); 6311009Sandreas.sandberg@arm.com physical += 256; 6411009Sandreas.sandberg@arm.com } 659157Sandreas.hansson@arm.com 6611009Sandreas.sandberg@arm.com DPRINTF(RubyTest, "Adding cache conflict checks2\n"); 679157Sandreas.hansson@arm.com physical = 1000 + CHECK_SIZE; 689157Sandreas.hansson@arm.com for (int i = 0; i < size2; i++) { 699157Sandreas.hansson@arm.com // Setup linear addresses 709179Sandreas.hansson@arm.com addCheck(physical); 719179Sandreas.hansson@arm.com physical += 256; 729179Sandreas.hansson@arm.com } 739179Sandreas.hansson@arm.com} 749179Sandreas.hansson@arm.com 759179Sandreas.hansson@arm.comCheckTable::~CheckTable() 769180Sandreas.hansson@arm.com{ 779179Sandreas.hansson@arm.com int size = m_check_vector.size(); 789157Sandreas.hansson@arm.com for (int i = 0; i < size; i++) 7910236Sjthestness@gmail.com delete m_check_vector[i]; 8010236Sjthestness@gmail.com} 819179Sandreas.hansson@arm.com 829179Sandreas.hansson@arm.comvoid 839179Sandreas.hansson@arm.comCheckTable::addCheck(Addr address) 849179Sandreas.hansson@arm.com{ 859179Sandreas.hansson@arm.com if (floorLog2(CHECK_SIZE) != 0) { 869179Sandreas.hansson@arm.com if (bitSelect(address, 0, CHECK_SIZE_BITS - 1) != 0) { 879179Sandreas.hansson@arm.com panic("Check not aligned"); 889179Sandreas.hansson@arm.com } 899179Sandreas.hansson@arm.com } 909179Sandreas.hansson@arm.com 919179Sandreas.hansson@arm.com for (int i = 0; i < CHECK_SIZE; i++) { 929793Sakash.bagdia@arm.com if (m_lookup_map.count(address+i)) { 939179Sandreas.hansson@arm.com // A mapping for this byte already existed, discard the 949179Sandreas.hansson@arm.com // entire check 959179Sandreas.hansson@arm.com return; 969179Sandreas.hansson@arm.com } 979179Sandreas.hansson@arm.com } 989179Sandreas.hansson@arm.com 999179Sandreas.hansson@arm.com DPRINTF(RubyTest, "Adding check for address: %s\n", address); 1009179Sandreas.hansson@arm.com 1019179Sandreas.hansson@arm.com Check* check_ptr = new Check(address, 100 + m_check_vector.size(), 1029793Sakash.bagdia@arm.com m_num_writers, m_num_readers, m_tester_ptr); 1039179Sandreas.hansson@arm.com for (int i = 0; i < CHECK_SIZE; i++) { 1049793Sakash.bagdia@arm.com // Insert it once per byte 1059179Sandreas.hansson@arm.com m_lookup_map[address + i] = check_ptr; 1069179Sandreas.hansson@arm.com } 1079793Sakash.bagdia@arm.com m_check_vector.push_back(check_ptr); 1089793Sakash.bagdia@arm.com} 1099793Sakash.bagdia@arm.com 1109793Sakash.bagdia@arm.comCheck* 1119157Sandreas.hansson@arm.comCheckTable::getRandomCheck() 1129545Sandreas.hansson@arm.com{ 1139545Sandreas.hansson@arm.com assert(m_check_vector.size() > 0); 1149157Sandreas.hansson@arm.com return m_check_vector[random_mt.random<unsigned>(0, m_check_vector.size() - 1)]; 1159793Sakash.bagdia@arm.com} 1169157Sandreas.hansson@arm.com 1179157Sandreas.hansson@arm.comCheck* 11811009Sandreas.sandberg@arm.comCheckTable::getCheck(const Addr address) 11911009Sandreas.sandberg@arm.com{ 1209418Sandreas.hansson@arm.com DPRINTF(RubyTest, "Looking for check by address: %s\n", address); 12110000Sclt67@cornell.edu 12210000Sclt67@cornell.edu auto i = m_lookup_map.find(address); 12310000Sclt67@cornell.edu 1249418Sandreas.hansson@arm.com if (i == m_lookup_map.end()) 1259157Sandreas.hansson@arm.com return NULL; 12611009Sandreas.sandberg@arm.com 12711009Sandreas.sandberg@arm.com Check* check = i->second; 12811009Sandreas.sandberg@arm.com assert(check != NULL); 1299157Sandreas.hansson@arm.com return check; 1309157Sandreas.hansson@arm.com} 1319157Sandreas.hansson@arm.com 13211009Sandreas.sandberg@arm.comvoid 1339157Sandreas.hansson@arm.comCheckTable::print(std::ostream& out) const 1349296Snilay@cs.wisc.edu{ 1359296Snilay@cs.wisc.edu} 1369296Snilay@cs.wisc.edu