CheckTable.cc revision 11800
111524Sdavid.guillen@arm.com/* 29157Sandreas.hansson@arm.com * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 39157Sandreas.hansson@arm.com * 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) 399157Sandreas.hansson@arm.com : m_num_writers(_num_writers), m_num_readers(_num_readers), 409281Sandreas.hansson@arm.com m_tester_ptr(_tester) 419157Sandreas.hansson@arm.com{ 4211524Sdavid.guillen@arm.com Addr physical = 0; 4311524Sdavid.guillen@arm.com 4411524Sdavid.guillen@arm.com const int size1 = 32; 4511524Sdavid.guillen@arm.com const int size2 = 100; 4611524Sdavid.guillen@arm.com 4711524Sdavid.guillen@arm.com DPRINTF(RubyTest, "Adding false sharing checks\n"); 4811524Sdavid.guillen@arm.com // The first set is to get some false sharing 4911524Sdavid.guillen@arm.com physical = 1000; 5011524Sdavid.guillen@arm.com for (int i = 0; i < size1; i++) { 5111524Sdavid.guillen@arm.com // Setup linear addresses 5211524Sdavid.guillen@arm.com addCheck(physical); 5311524Sdavid.guillen@arm.com physical += CHECK_SIZE; 5411524Sdavid.guillen@arm.com } 5511524Sdavid.guillen@arm.com 5611524Sdavid.guillen@arm.com DPRINTF(RubyTest, "Adding cache conflict checks\n"); 5711524Sdavid.guillen@arm.com // The next two sets are to get some limited false sharing and 5811524Sdavid.guillen@arm.com // cache conflicts 5911524Sdavid.guillen@arm.com physical = 1000; 609157Sandreas.hansson@arm.com for (int i = 0; i < size2; i++) { 619157Sandreas.hansson@arm.com // Setup linear addresses 629157Sandreas.hansson@arm.com addCheck(physical); 639338SAndreas.Sandberg@arm.com physical += 256; 649157Sandreas.hansson@arm.com } 659793Sakash.bagdia@arm.com 669793Sakash.bagdia@arm.com DPRINTF(RubyTest, "Adding cache conflict checks2\n"); 679793Sakash.bagdia@arm.com physical = 1000 + CHECK_SIZE; 6811524Sdavid.guillen@arm.com for (int i = 0; i < size2; i++) { 6911527Sdavid.guillen@arm.com // Setup linear addresses 7012265Sdavid.guillen@arm.com addCheck(physical); 7111527Sdavid.guillen@arm.com physical += 256; 7211524Sdavid.guillen@arm.com } 7311524Sdavid.guillen@arm.com} 7411524Sdavid.guillen@arm.com 7511524Sdavid.guillen@arm.comCheckTable::~CheckTable() 7611524Sdavid.guillen@arm.com{ 7711524Sdavid.guillen@arm.com int size = m_check_vector.size(); 7811524Sdavid.guillen@arm.com for (int i = 0; i < size; i++) 7911524Sdavid.guillen@arm.com delete m_check_vector[i]; 80} 81 82void 83CheckTable::addCheck(Addr address) 84{ 85 if (floorLog2(CHECK_SIZE) != 0) { 86 if (bitSelect(address, 0, CHECK_SIZE_BITS - 1) != 0) { 87 panic("Check not aligned"); 88 } 89 } 90 91 for (int i = 0; i < CHECK_SIZE; i++) { 92 if (m_lookup_map.count(address+i)) { 93 // A mapping for this byte already existed, discard the 94 // entire check 95 return; 96 } 97 } 98 99 DPRINTF(RubyTest, "Adding check for address: %s\n", address); 100 101 Check* check_ptr = new Check(address, 100 + m_check_vector.size(), 102 m_num_writers, m_num_readers, m_tester_ptr); 103 for (int i = 0; i < CHECK_SIZE; i++) { 104 // Insert it once per byte 105 m_lookup_map[address + i] = check_ptr; 106 } 107 m_check_vector.push_back(check_ptr); 108} 109 110Check* 111CheckTable::getRandomCheck() 112{ 113 assert(m_check_vector.size() > 0); 114 return m_check_vector[random_mt.random<unsigned>(0, m_check_vector.size() - 1)]; 115} 116 117Check* 118CheckTable::getCheck(const Addr address) 119{ 120 DPRINTF(RubyTest, "Looking for check by address: %s\n", address); 121 122 auto i = m_lookup_map.find(address); 123 124 if (i == m_lookup_map.end()) 125 return NULL; 126 127 Check* check = i->second; 128 assert(check != NULL); 129 return check; 130} 131 132void 133CheckTable::print(std::ostream& out) const 134{ 135} 136