Switch.cc revision 10918:dd3ab1f109ad
1/* 2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer; 9 * redistributions in binary form must reproduce the above copyright 10 * notice, this list of conditions and the following disclaimer in the 11 * documentation and/or other materials provided with the distribution; 12 * neither the name of the copyright holders nor the names of its 13 * contributors may be used to endorse or promote products derived from 14 * this software without specific prior written permission. 15 * 16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 */ 28 29#include <numeric> 30 31#include "base/cast.hh" 32#include "base/stl_helpers.hh" 33#include "mem/ruby/network/MessageBuffer.hh" 34#include "mem/ruby/network/simple/PerfectSwitch.hh" 35#include "mem/ruby/network/simple/SimpleNetwork.hh" 36#include "mem/ruby/network/simple/Switch.hh" 37#include "mem/ruby/network/simple/Throttle.hh" 38 39using namespace std; 40using m5::stl_helpers::deletePointers; 41using m5::stl_helpers::operator<<; 42 43Switch::Switch(const Params *p) : BasicRouter(p) 44{ 45 m_perfect_switch = new PerfectSwitch(m_id, this, p->virt_nets); 46} 47 48Switch::~Switch() 49{ 50 delete m_perfect_switch; 51 52 // Delete throttles (one per output port) 53 deletePointers(m_throttles); 54 55 // Delete MessageBuffers 56 deletePointers(m_buffers_to_free); 57} 58 59void 60Switch::init() 61{ 62 BasicRouter::init(); 63 m_perfect_switch->init(m_network_ptr); 64} 65 66void 67Switch::addInPort(const vector<MessageBuffer*>& in) 68{ 69 m_perfect_switch->addInPort(in); 70 71 for (auto& it : in) { 72 if (it != nullptr) { 73 it->setReceiver(this); 74 } 75 } 76} 77 78void 79Switch::addOutPort(const vector<MessageBuffer*>& out, 80 const NetDest& routing_table_entry, 81 Cycles link_latency, int bw_multiplier) 82{ 83 // Create a throttle 84 RubySystem *rs = m_network_ptr->params()->ruby_system; 85 Throttle* throttle_ptr = new Throttle(m_id, rs, m_throttles.size(), 86 link_latency, bw_multiplier, 87 m_network_ptr->getEndpointBandwidth(), 88 this); 89 90 m_throttles.push_back(throttle_ptr); 91 92 // Create one buffer per vnet (these are intermediaryQueues) 93 vector<MessageBuffer*> intermediateBuffers; 94 95 for (int i = 0; i < out.size(); ++i) { 96 if (out[i] != nullptr) { 97 out[i]->setSender(this); 98 } 99 100 MessageBuffer* buffer_ptr = new MessageBuffer; 101 // Make these queues ordered 102 buffer_ptr->setOrdering(true); 103 if (m_network_ptr->getBufferSize() > 0) { 104 buffer_ptr->resize(m_network_ptr->getBufferSize()); 105 } 106 107 intermediateBuffers.push_back(buffer_ptr); 108 m_buffers_to_free.push_back(buffer_ptr); 109 110 buffer_ptr->setSender(this); 111 buffer_ptr->setReceiver(this); 112 } 113 114 // Hook the queues to the PerfectSwitch 115 m_perfect_switch->addOutPort(intermediateBuffers, routing_table_entry); 116 117 // Hook the queues to the Throttle 118 throttle_ptr->addLinks(intermediateBuffers, out); 119} 120 121const Throttle* 122Switch::getThrottle(LinkID link_number) const 123{ 124 assert(m_throttles[link_number] != NULL); 125 return m_throttles[link_number]; 126} 127 128void 129Switch::regStats() 130{ 131 for (int link = 0; link < m_throttles.size(); link++) { 132 m_throttles[link]->regStats(name()); 133 } 134 135 m_avg_utilization.name(name() + ".percent_links_utilized"); 136 for (unsigned int i = 0; i < m_throttles.size(); i++) { 137 m_avg_utilization += m_throttles[i]->getUtilization(); 138 } 139 m_avg_utilization /= Stats::constant(m_throttles.size()); 140 141 for (unsigned int type = MessageSizeType_FIRST; 142 type < MessageSizeType_NUM; ++type) { 143 m_msg_counts[type] 144 .name(name() + ".msg_count." + 145 MessageSizeType_to_string(MessageSizeType(type))) 146 .flags(Stats::nozero) 147 ; 148 m_msg_bytes[type] 149 .name(name() + ".msg_bytes." + 150 MessageSizeType_to_string(MessageSizeType(type))) 151 .flags(Stats::nozero) 152 ; 153 154 for (unsigned int i = 0; i < m_throttles.size(); i++) { 155 m_msg_counts[type] += m_throttles[i]->getMsgCount(type); 156 } 157 m_msg_bytes[type] = m_msg_counts[type] * Stats::constant( 158 Network::MessageSizeType_to_int(MessageSizeType(type))); 159 } 160} 161 162void 163Switch::resetStats() 164{ 165 m_perfect_switch->clearStats(); 166 for (int i = 0; i < m_throttles.size(); i++) { 167 m_throttles[i]->clearStats(); 168 } 169} 170 171void 172Switch::collateStats() 173{ 174 m_perfect_switch->collateStats(); 175 for (int i = 0; i < m_throttles.size(); i++) { 176 m_throttles[i]->collateStats(); 177 } 178} 179 180void 181Switch::print(std::ostream& out) const 182{ 183 // FIXME printing 184 out << "[Switch]"; 185} 186 187bool 188Switch::functionalRead(Packet *pkt) 189{ 190 // Access the buffers in the switch for performing a functional read 191 for (unsigned int i = 0; i < m_buffers_to_free.size(); ++i) { 192 if (m_buffers_to_free[i]->functionalRead(pkt)) { 193 return true; 194 } 195 } 196 return false; 197} 198 199uint32_t 200Switch::functionalWrite(Packet *pkt) 201{ 202 // Access the buffers in the switch for performing a functional write 203 uint32_t num_functional_writes = 0; 204 for (unsigned int i = 0; i < m_buffers_to_free.size(); ++i) { 205 num_functional_writes += m_buffers_to_free[i]->functionalWrite(pkt); 206 } 207 return num_functional_writes; 208} 209 210Switch * 211SwitchParams::create() 212{ 213 return new Switch(this); 214} 215