CheckTable.cc revision 11168
15664Sgblack@eecs.umich.edu/* 25664Sgblack@eecs.umich.edu * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 35664Sgblack@eecs.umich.edu * Copyright (c) 2009 Advanced Micro Devices, Inc. 45664Sgblack@eecs.umich.edu * All rights reserved. 55664Sgblack@eecs.umich.edu * 65664Sgblack@eecs.umich.edu * Redistribution and use in source and binary forms, with or without 75664Sgblack@eecs.umich.edu * modification, are permitted provided that the following conditions are 85664Sgblack@eecs.umich.edu * met: redistributions of source code must retain the above copyright 95664Sgblack@eecs.umich.edu * notice, this list of conditions and the following disclaimer; 105664Sgblack@eecs.umich.edu * redistributions in binary form must reproduce the above copyright 115664Sgblack@eecs.umich.edu * notice, this list of conditions and the following disclaimer in the 125664Sgblack@eecs.umich.edu * documentation and/or other materials provided with the distribution; 135664Sgblack@eecs.umich.edu * neither the name of the copyright holders nor the names of its 145664Sgblack@eecs.umich.edu * contributors may be used to endorse or promote products derived from 155664Sgblack@eecs.umich.edu * this software without specific prior written permission. 165664Sgblack@eecs.umich.edu * 175664Sgblack@eecs.umich.edu * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 185664Sgblack@eecs.umich.edu * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 195664Sgblack@eecs.umich.edu * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 205664Sgblack@eecs.umich.edu * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 215664Sgblack@eecs.umich.edu * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 225664Sgblack@eecs.umich.edu * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 235664Sgblack@eecs.umich.edu * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 245664Sgblack@eecs.umich.edu * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 255664Sgblack@eecs.umich.edu * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 265664Sgblack@eecs.umich.edu * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 275664Sgblack@eecs.umich.edu * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 285664Sgblack@eecs.umich.edu */ 295664Sgblack@eecs.umich.edu 305664Sgblack@eecs.umich.edu#include "base/intmath.hh" 315664Sgblack@eecs.umich.edu#include "base/random.hh" 325664Sgblack@eecs.umich.edu#include "cpu/testers/rubytest/Check.hh" 335664Sgblack@eecs.umich.edu#include "cpu/testers/rubytest/CheckTable.hh" 345666Sgblack@eecs.umich.edu#include "debug/RubyTest.hh" 355666Sgblack@eecs.umich.edu 365666Sgblack@eecs.umich.eduCheckTable::CheckTable(int _num_writers, int _num_readers, RubyTester* _tester) 375666Sgblack@eecs.umich.edu : m_num_writers(_num_writers), m_num_readers(_num_readers), 385666Sgblack@eecs.umich.edu m_tester_ptr(_tester) 395666Sgblack@eecs.umich.edu{ 405666Sgblack@eecs.umich.edu Addr physical = 0; 415666Sgblack@eecs.umich.edu 425666Sgblack@eecs.umich.edu const int size1 = 32; 435666Sgblack@eecs.umich.edu const int size2 = 100; 445666Sgblack@eecs.umich.edu 455666Sgblack@eecs.umich.edu // The first set is to get some false sharing 465666Sgblack@eecs.umich.edu physical = 1000; 475666Sgblack@eecs.umich.edu for (int i = 0; i < size1; i++) { 485666Sgblack@eecs.umich.edu // Setup linear addresses 495666Sgblack@eecs.umich.edu addCheck(physical); 505666Sgblack@eecs.umich.edu physical += CHECK_SIZE; 515666Sgblack@eecs.umich.edu } 525666Sgblack@eecs.umich.edu 535666Sgblack@eecs.umich.edu // The next two sets are to get some limited false sharing and 545666Sgblack@eecs.umich.edu // cache conflicts 555666Sgblack@eecs.umich.edu physical = 1000; 565666Sgblack@eecs.umich.edu for (int i = 0; i < size2; i++) { 575666Sgblack@eecs.umich.edu // Setup linear addresses 585666Sgblack@eecs.umich.edu addCheck(physical); 595666Sgblack@eecs.umich.edu physical += 256; 605666Sgblack@eecs.umich.edu } 615666Sgblack@eecs.umich.edu 625666Sgblack@eecs.umich.edu physical = 1000 + CHECK_SIZE; 635666Sgblack@eecs.umich.edu for (int i = 0; i < size2; i++) { 645666Sgblack@eecs.umich.edu // Setup linear addresses 655666Sgblack@eecs.umich.edu addCheck(physical); 665666Sgblack@eecs.umich.edu physical += 256; 675666Sgblack@eecs.umich.edu } 685664Sgblack@eecs.umich.edu} 695664Sgblack@eecs.umich.edu 705664Sgblack@eecs.umich.eduCheckTable::~CheckTable() 715666Sgblack@eecs.umich.edu{ 725664Sgblack@eecs.umich.edu int size = m_check_vector.size(); 735664Sgblack@eecs.umich.edu for (int i = 0; i < size; i++) 745664Sgblack@eecs.umich.edu delete m_check_vector[i]; 75} 76 77void 78CheckTable::addCheck(Addr address) 79{ 80 if (floorLog2(CHECK_SIZE) != 0) { 81 if (bitSelect(address, 0, CHECK_SIZE_BITS - 1) != 0) { 82 panic("Check not aligned"); 83 } 84 } 85 86 for (int i = 0; i < CHECK_SIZE; i++) { 87 if (m_lookup_map.count(address+i)) { 88 // A mapping for this byte already existed, discard the 89 // entire check 90 return; 91 } 92 } 93 94 Check* check_ptr = new Check(address, 100 + m_check_vector.size(), 95 m_num_writers, m_num_readers, m_tester_ptr); 96 for (int i = 0; i < CHECK_SIZE; i++) { 97 // Insert it once per byte 98 m_lookup_map[address + i] = check_ptr; 99 } 100 m_check_vector.push_back(check_ptr); 101} 102 103Check* 104CheckTable::getRandomCheck() 105{ 106 assert(m_check_vector.size() > 0); 107 return m_check_vector[random_mt.random<unsigned>(0, m_check_vector.size() - 1)]; 108} 109 110Check* 111CheckTable::getCheck(const Addr address) 112{ 113 DPRINTF(RubyTest, "Looking for check by address: %s", address); 114 115 auto i = m_lookup_map.find(address); 116 117 if (i == m_lookup_map.end()) 118 return NULL; 119 120 Check* check = i->second; 121 assert(check != NULL); 122 return check; 123} 124 125void 126CheckTable::print(std::ostream& out) const 127{ 128} 129