CheckTable.cc revision 11793
1/* 2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 3 * Copyright (c) 2009 Advanced Micro Devices, Inc. 4 * All rights reserved. 5 * 6 * Redistribution and use in source and binary forms, with or without 7 * modification, are permitted provided that the following conditions are 8 * met: redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer; 10 * redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution; 13 * neither the name of the copyright holders nor the names of its 14 * contributors may be used to endorse or promote products derived from 15 * this software without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 18 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 19 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 20 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 21 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 22 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 23 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 27 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28 */ 29 30#include "cpu/testers/rubytest/CheckTable.hh" 31 32#include "base/intmath.hh" 33#include "base/random.hh" 34#include "cpu/testers/rubytest/Check.hh" 35#include "debug/RubyTest.hh" 36 37CheckTable::CheckTable(int _num_writers, int _num_readers, RubyTester* _tester) 38 : m_num_writers(_num_writers), m_num_readers(_num_readers), 39 m_tester_ptr(_tester) 40{ 41 Addr physical = 0; 42 43 const int size1 = 32; 44 const int size2 = 100; 45 46 DPRINTF(RubyTest, "Adding false sharing checks\n"); 47 // The first set is to get some false sharing 48 physical = 1000; 49 for (int i = 0; i < size1; i++) { 50 // Setup linear addresses 51 addCheck(physical); 52 physical += CHECK_SIZE; 53 } 54 55 DPRINTF(RubyTest, "Adding cache conflict checks\n"); 56 // The next two sets are to get some limited false sharing and 57 // cache conflicts 58 physical = 1000; 59 for (int i = 0; i < size2; i++) { 60 // Setup linear addresses 61 addCheck(physical); 62 physical += 256; 63 } 64 65 DPRINTF(RubyTest, "Adding cache conflict checks2\n"); 66 physical = 1000 + CHECK_SIZE; 67 for (int i = 0; i < size2; i++) { 68 // Setup linear addresses 69 addCheck(physical); 70 physical += 256; 71 } 72} 73 74CheckTable::~CheckTable() 75{ 76 int size = m_check_vector.size(); 77 for (int i = 0; i < size; i++) 78 delete m_check_vector[i]; 79} 80 81void 82CheckTable::addCheck(Addr address) 83{ 84 if (floorLog2(CHECK_SIZE) != 0) { 85 if (bitSelect(address, 0, CHECK_SIZE_BITS - 1) != 0) { 86 panic("Check not aligned"); 87 } 88 } 89 90 for (int i = 0; i < CHECK_SIZE; i++) { 91 if (m_lookup_map.count(address+i)) { 92 // A mapping for this byte already existed, discard the 93 // entire check 94 return; 95 } 96 } 97 98 DPRINTF(RubyTest, "Adding check for address: %s\n", address); 99 100 Check* check_ptr = new Check(address, 100 + m_check_vector.size(), 101 m_num_writers, m_num_readers, m_tester_ptr); 102 for (int i = 0; i < CHECK_SIZE; i++) { 103 // Insert it once per byte 104 m_lookup_map[address + i] = check_ptr; 105 } 106 m_check_vector.push_back(check_ptr); 107} 108 109Check* 110CheckTable::getRandomCheck() 111{ 112 assert(m_check_vector.size() > 0); 113 return m_check_vector[random_mt.random<unsigned>(0, m_check_vector.size() - 1)]; 114} 115 116Check* 117CheckTable::getCheck(const Addr address) 118{ 119 DPRINTF(RubyTest, "Looking for check by address: %s\n", address); 120 121 auto i = m_lookup_map.find(address); 122 123 if (i == m_lookup_map.end()) 124 return NULL; 125 126 Check* check = i->second; 127 assert(check != NULL); 128 return check; 129} 130 131void 132CheckTable::print(std::ostream& out) const 133{ 134} 135