RubyTester.cc revision 12680
1/* 2 * Copyright (c) 2012-2013 ARM Limited 3 * All rights reserved 4 * 5 * The license below extends only to copyright in the software and shall 6 * not be construed as granting a license to any other intellectual 7 * property including but not limited to intellectual property relating 8 * to a hardware implementation of the functionality of the software 9 * licensed hereunder. You may use the software subject to the license 10 * terms below provided that you ensure that this notice is replicated 11 * unmodified and in its entirety in all distributions of the software, 12 * modified or unmodified, in source code or in binary form. 13 * 14 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 15 * Copyright (c) 2009 Advanced Micro Devices, Inc. 16 * All rights reserved. 17 * 18 * Redistribution and use in source and binary forms, with or without 19 * modification, are permitted provided that the following conditions are 20 * met: redistributions of source code must retain the above copyright 21 * notice, this list of conditions and the following disclaimer; 22 * redistributions in binary form must reproduce the above copyright 23 * notice, this list of conditions and the following disclaimer in the 24 * documentation and/or other materials provided with the distribution; 25 * neither the name of the copyright holders nor the names of its 26 * contributors may be used to endorse or promote products derived from 27 * this software without specific prior written permission. 28 * 29 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 30 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 31 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 32 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 33 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 34 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 35 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 36 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 37 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 38 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 39 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 40 */ 41 42#include "cpu/testers/rubytest/RubyTester.hh" 43 44#include "base/logging.hh" 45#include "base/trace.hh" 46#include "cpu/testers/rubytest/Check.hh" 47#include "debug/RubyTest.hh" 48#include "mem/ruby/common/SubBlock.hh" 49#include "sim/sim_exit.hh" 50#include "sim/system.hh" 51 52RubyTester::RubyTester(const Params *p) 53 : MemObject(p), 54 checkStartEvent([this]{ wakeup(); }, "RubyTester tick", 55 false, Event::CPU_Tick_Pri), 56 _masterId(p->system->getMasterId(this)), 57 m_checkTable_ptr(nullptr), 58 m_num_cpus(p->num_cpus), 59 m_checks_to_complete(p->checks_to_complete), 60 m_deadlock_threshold(p->deadlock_threshold), 61 m_num_writers(0), 62 m_num_readers(0), 63 m_wakeup_frequency(p->wakeup_frequency), 64 m_check_flush(p->check_flush), 65 m_num_inst_only_ports(p->port_cpuInstPort_connection_count), 66 m_num_inst_data_ports(p->port_cpuInstDataPort_connection_count) 67{ 68 m_checks_completed = 0; 69 70 // 71 // Create the requested inst and data ports and place them on the 72 // appropriate read and write port lists. The reason for the subtle 73 // difference between inst and data ports vs. read and write ports is 74 // from the tester's perspective, it only needs to know whether a port 75 // supports reads (checks) or writes (actions). Meanwhile, the protocol 76 // controllers have data ports (support read and writes) or inst ports 77 // (support only reads). 78 // Note: the inst ports are the lowest elements of the readPort vector, 79 // then the data ports are added to the readPort vector 80 // 81 int idx = 0; 82 for (int i = 0; i < p->port_cpuInstPort_connection_count; ++i) { 83 readPorts.push_back(new CpuPort(csprintf("%s-instPort%d", name(), i), 84 this, i, idx)); 85 idx++; 86 } 87 for (int i = 0; i < p->port_cpuInstDataPort_connection_count; ++i) { 88 CpuPort *port = new CpuPort(csprintf("%s-instDataPort%d", name(), i), 89 this, i, idx); 90 readPorts.push_back(port); 91 writePorts.push_back(port); 92 idx++; 93 } 94 for (int i = 0; i < p->port_cpuDataPort_connection_count; ++i) { 95 CpuPort *port = new CpuPort(csprintf("%s-dataPort%d", name(), i), 96 this, i, idx); 97 readPorts.push_back(port); 98 writePorts.push_back(port); 99 idx++; 100 } 101 102 // add the check start event to the event queue 103 schedule(checkStartEvent, 1); 104} 105 106RubyTester::~RubyTester() 107{ 108 delete m_checkTable_ptr; 109 // Only delete the readPorts since the writePorts are just a subset 110 for (int i = 0; i < readPorts.size(); i++) 111 delete readPorts[i]; 112} 113 114void 115RubyTester::init() 116{ 117 assert(writePorts.size() > 0 && readPorts.size() > 0); 118 119 m_last_progress_vector.resize(m_num_cpus); 120 for (int i = 0; i < m_last_progress_vector.size(); i++) { 121 m_last_progress_vector[i] = Cycles(0); 122 } 123 124 m_num_writers = writePorts.size(); 125 m_num_readers = readPorts.size(); 126 assert(m_num_readers == m_num_cpus); 127 128 m_checkTable_ptr = new CheckTable(m_num_writers, m_num_readers, this); 129} 130 131BaseMasterPort & 132RubyTester::getMasterPort(const std::string &if_name, PortID idx) 133{ 134 if (if_name != "cpuInstPort" && if_name != "cpuInstDataPort" && 135 if_name != "cpuDataPort") { 136 // pass it along to our super class 137 return MemObject::getMasterPort(if_name, idx); 138 } else { 139 if (if_name == "cpuInstPort") { 140 if (idx > m_num_inst_only_ports) { 141 panic("RubyTester::getMasterPort: unknown inst port %d\n", 142 idx); 143 } 144 // 145 // inst ports map to the lowest readPort elements 146 // 147 return *readPorts[idx]; 148 } else if (if_name == "cpuInstDataPort") { 149 if (idx > m_num_inst_data_ports) { 150 panic("RubyTester::getMasterPort: unknown inst+data port %d\n", 151 idx); 152 } 153 int read_idx = idx + m_num_inst_only_ports; 154 // 155 // inst+data ports map to the next readPort elements 156 // 157 return *readPorts[read_idx]; 158 } else { 159 assert(if_name == "cpuDataPort"); 160 // 161 // data only ports map to the final readPort elements 162 // 163 if (idx > (static_cast<int>(readPorts.size()) - 164 (m_num_inst_only_ports + m_num_inst_data_ports))) { 165 panic("RubyTester::getMasterPort: unknown data port %d\n", 166 idx); 167 } 168 int read_idx = idx + m_num_inst_only_ports + m_num_inst_data_ports; 169 return *readPorts[read_idx]; 170 } 171 // Note: currently the Ruby Tester does not support write only ports 172 // but that could easily be added here 173 } 174} 175 176bool 177RubyTester::CpuPort::recvTimingResp(PacketPtr pkt) 178{ 179 // retrieve the subblock and call hitCallback 180 RubyTester::SenderState* senderState = 181 safe_cast<RubyTester::SenderState*>(pkt->senderState); 182 SubBlock& subblock = senderState->subBlock; 183 184 tester->hitCallback(globalIdx, &subblock); 185 186 // Now that the tester has completed, delete the senderState 187 // (includes sublock) and the packet, then return 188 delete pkt->senderState; 189 delete pkt->req; 190 delete pkt; 191 return true; 192} 193 194bool 195RubyTester::isInstOnlyCpuPort(int idx) 196{ 197 return idx < m_num_inst_only_ports; 198} 199 200bool 201RubyTester::isInstDataCpuPort(int idx) 202{ 203 return ((idx >= m_num_inst_only_ports) && 204 (idx < (m_num_inst_only_ports + m_num_inst_data_ports))); 205} 206 207MasterPort* 208RubyTester::getReadableCpuPort(int idx) 209{ 210 assert(idx >= 0 && idx < readPorts.size()); 211 212 return readPorts[idx]; 213} 214 215MasterPort* 216RubyTester::getWritableCpuPort(int idx) 217{ 218 assert(idx >= 0 && idx < writePorts.size()); 219 220 return writePorts[idx]; 221} 222 223void 224RubyTester::hitCallback(NodeID proc, SubBlock* data) 225{ 226 // Mark that we made progress 227 m_last_progress_vector[proc] = curCycle(); 228 229 DPRINTF(RubyTest, "completed request for proc: %d", proc); 230 DPRINTFR(RubyTest, " addr: 0x%x, size: %d, data: ", 231 data->getAddress(), data->getSize()); 232 for (int byte = 0; byte < data->getSize(); byte++) { 233 DPRINTFR(RubyTest, "%d ", data->getByte(byte)); 234 } 235 DPRINTFR(RubyTest, "\n"); 236 237 // This tells us our store has 'completed' or for a load gives us 238 // back the data to make the check 239 Check* check_ptr = m_checkTable_ptr->getCheck(data->getAddress()); 240 assert(check_ptr != NULL); 241 check_ptr->performCallback(proc, data, curCycle()); 242} 243 244void 245RubyTester::wakeup() 246{ 247 if (m_checks_completed < m_checks_to_complete) { 248 // Try to perform an action or check 249 Check* check_ptr = m_checkTable_ptr->getRandomCheck(); 250 assert(check_ptr != NULL); 251 check_ptr->initiate(); 252 253 checkForDeadlock(); 254 255 schedule(checkStartEvent, curTick() + m_wakeup_frequency); 256 } else { 257 exitSimLoop("Ruby Tester completed"); 258 } 259} 260 261void 262RubyTester::checkForDeadlock() 263{ 264 int size = m_last_progress_vector.size(); 265 Cycles current_time = curCycle(); 266 for (int processor = 0; processor < size; processor++) { 267 if ((current_time - m_last_progress_vector[processor]) > 268 m_deadlock_threshold) { 269 panic("Deadlock detected: current_time: %d last_progress_time: %d " 270 "difference: %d processor: %d\n", 271 current_time, m_last_progress_vector[processor], 272 current_time - m_last_progress_vector[processor], processor); 273 } 274 } 275} 276 277void 278RubyTester::print(std::ostream& out) const 279{ 280 out << "[RubyTester]" << std::endl; 281} 282 283RubyTester * 284RubyTesterParams::create() 285{ 286 return new RubyTester(this); 287} 288