SimpleNetwork.cc revision 11047:dcf729f0bbfa
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 <cassert> 30#include <numeric> 31 32#include "base/cast.hh" 33#include "base/stl_helpers.hh" 34#include "mem/ruby/common/NetDest.hh" 35#include "mem/ruby/network/MessageBuffer.hh" 36#include "mem/ruby/network/simple/SimpleLink.hh" 37#include "mem/ruby/network/simple/SimpleNetwork.hh" 38#include "mem/ruby/network/simple/Switch.hh" 39#include "mem/ruby/network/simple/Throttle.hh" 40#include "mem/ruby/profiler/Profiler.hh" 41 42using namespace std; 43using m5::stl_helpers::deletePointers; 44 45SimpleNetwork::SimpleNetwork(const Params *p) 46 : Network(p), m_buffer_size(p->buffer_size), 47 m_endpoint_bandwidth(p->endpoint_bandwidth), 48 m_adaptive_routing(p->adaptive_routing) 49{ 50 // record the routers 51 for (vector<BasicRouter*>::const_iterator i = p->routers.begin(); 52 i != p->routers.end(); ++i) { 53 Switch* s = safe_cast<Switch*>(*i); 54 m_switches.push_back(s); 55 s->init_net_ptr(this); 56 } 57 58 m_int_link_buffers = p->int_link_buffers; 59 m_num_connected_buffers = 0; 60} 61 62void 63SimpleNetwork::init() 64{ 65 Network::init(); 66 67 // The topology pointer should have already been initialized in 68 // the parent class network constructor. 69 assert(m_topology_ptr != NULL); 70 m_topology_ptr->createLinks(this); 71} 72 73SimpleNetwork::~SimpleNetwork() 74{ 75 deletePointers(m_switches); 76 deletePointers(m_int_link_buffers); 77} 78 79// From a switch to an endpoint node 80void 81SimpleNetwork::makeOutLink(SwitchID src, NodeID dest, BasicLink* link, 82 LinkDirection direction, 83 const NetDest& routing_table_entry) 84{ 85 assert(dest < m_nodes); 86 assert(src < m_switches.size()); 87 assert(m_switches[src] != NULL); 88 89 SimpleExtLink *simple_link = safe_cast<SimpleExtLink*>(link); 90 91 m_switches[src]->addOutPort(m_fromNetQueues[dest], routing_table_entry, 92 simple_link->m_latency, 93 simple_link->m_bw_multiplier); 94} 95 96// From an endpoint node to a switch 97void 98SimpleNetwork::makeInLink(NodeID src, SwitchID dest, BasicLink* link, 99 LinkDirection direction, 100 const NetDest& routing_table_entry) 101{ 102 assert(src < m_nodes); 103 m_switches[dest]->addInPort(m_toNetQueues[src]); 104} 105 106// From a switch to a switch 107void 108SimpleNetwork::makeInternalLink(SwitchID src, SwitchID dest, BasicLink* link, 109 LinkDirection direction, 110 const NetDest& routing_table_entry) 111{ 112 // Create a set of new MessageBuffers 113 std::vector<MessageBuffer*> queues(m_virtual_networks); 114 115 for (int i = 0; i < m_virtual_networks; i++) { 116 // allocate a buffer 117 assert(m_num_connected_buffers < m_int_link_buffers.size()); 118 MessageBuffer* buffer_ptr = m_int_link_buffers[m_num_connected_buffers]; 119 m_num_connected_buffers++; 120 queues[i] = buffer_ptr; 121 } 122 123 // Connect it to the two switches 124 SimpleIntLink *simple_link = safe_cast<SimpleIntLink*>(link); 125 126 m_switches[dest]->addInPort(queues); 127 m_switches[src]->addOutPort(queues, routing_table_entry, 128 simple_link->m_latency, 129 simple_link->m_bw_multiplier); 130} 131 132void 133SimpleNetwork::checkNetworkAllocation(NodeID id, bool ordered, int network_num) 134{ 135 assert(id < m_nodes); 136 assert(network_num < m_virtual_networks); 137 138 if (ordered) { 139 m_ordered[network_num] = true; 140 } 141 m_in_use[network_num] = true; 142} 143 144void 145SimpleNetwork::setToNetQueue(NodeID id, bool ordered, int network_num, 146 std::string vnet_type, MessageBuffer *b) 147{ 148 checkNetworkAllocation(id, ordered, network_num); 149 while (m_toNetQueues[id].size() <= network_num) { 150 m_toNetQueues[id].push_back(nullptr); 151 } 152 m_toNetQueues[id][network_num] = b; 153} 154 155void 156SimpleNetwork::setFromNetQueue(NodeID id, bool ordered, int network_num, 157 std::string vnet_type, MessageBuffer *b) 158{ 159 checkNetworkAllocation(id, ordered, network_num); 160 while (m_fromNetQueues[id].size() <= network_num) { 161 m_fromNetQueues[id].push_back(nullptr); 162 } 163 m_fromNetQueues[id][network_num] = b; 164} 165 166void 167SimpleNetwork::regStats() 168{ 169 for (MessageSizeType type = MessageSizeType_FIRST; 170 type < MessageSizeType_NUM; ++type) { 171 m_msg_counts[(unsigned int) type] 172 .name(name() + ".msg_count." + MessageSizeType_to_string(type)) 173 .flags(Stats::nozero) 174 ; 175 m_msg_bytes[(unsigned int) type] 176 .name(name() + ".msg_byte." + MessageSizeType_to_string(type)) 177 .flags(Stats::nozero) 178 ; 179 180 // Now state what the formula is. 181 for (int i = 0; i < m_switches.size(); i++) { 182 m_msg_counts[(unsigned int) type] += 183 sum(m_switches[i]->getMsgCount(type)); 184 } 185 186 m_msg_bytes[(unsigned int) type] = 187 m_msg_counts[(unsigned int) type] * Stats::constant( 188 Network::MessageSizeType_to_int(type)); 189 } 190} 191 192void 193SimpleNetwork::collateStats() 194{ 195 for (int i = 0; i < m_switches.size(); i++) { 196 m_switches[i]->collateStats(); 197 } 198} 199 200void 201SimpleNetwork::print(ostream& out) const 202{ 203 out << "[SimpleNetwork]"; 204} 205 206SimpleNetwork * 207SimpleNetworkParams::create() 208{ 209 return new SimpleNetwork(this); 210} 211 212/* 213 * The simple network has an array of switches. These switches have buffers 214 * that need to be accessed for functional reads and writes. Also the links 215 * between different switches have buffers that need to be accessed. 216 */ 217bool 218SimpleNetwork::functionalRead(Packet *pkt) 219{ 220 for (unsigned int i = 0; i < m_switches.size(); i++) { 221 if (m_switches[i]->functionalRead(pkt)) { 222 return true; 223 } 224 } 225 226 return false; 227} 228 229uint32_t 230SimpleNetwork::functionalWrite(Packet *pkt) 231{ 232 uint32_t num_functional_writes = 0; 233 234 for (unsigned int i = 0; i < m_switches.size(); i++) { 235 num_functional_writes += m_switches[i]->functionalWrite(pkt); 236 } 237 238 for (unsigned int i = 0; i < m_int_link_buffers.size(); ++i) { 239 num_functional_writes += m_int_link_buffers[i]->functionalWrite(pkt); 240 } 241 return num_functional_writes; 242} 243