SimpleNetwork.cc revision 8257
16145Snate@binkert.org/* 26145Snate@binkert.org * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 36145Snate@binkert.org * All rights reserved. 46145Snate@binkert.org * 56145Snate@binkert.org * Redistribution and use in source and binary forms, with or without 66145Snate@binkert.org * modification, are permitted provided that the following conditions are 76145Snate@binkert.org * met: redistributions of source code must retain the above copyright 86145Snate@binkert.org * notice, this list of conditions and the following disclaimer; 96145Snate@binkert.org * redistributions in binary form must reproduce the above copyright 106145Snate@binkert.org * notice, this list of conditions and the following disclaimer in the 116145Snate@binkert.org * documentation and/or other materials provided with the distribution; 126145Snate@binkert.org * neither the name of the copyright holders nor the names of its 136145Snate@binkert.org * contributors may be used to endorse or promote products derived from 146145Snate@binkert.org * this software without specific prior written permission. 156145Snate@binkert.org * 166145Snate@binkert.org * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 176145Snate@binkert.org * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 186145Snate@binkert.org * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 196145Snate@binkert.org * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 206145Snate@binkert.org * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 216145Snate@binkert.org * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 226145Snate@binkert.org * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 236145Snate@binkert.org * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 246145Snate@binkert.org * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 256145Snate@binkert.org * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 266145Snate@binkert.org * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 276145Snate@binkert.org */ 286145Snate@binkert.org 297832Snate@binkert.org#include <cassert> 307547SBrad.Beckmann@amd.com#include <numeric> 317547SBrad.Beckmann@amd.com 327454Snate@binkert.org#include "base/stl_helpers.hh" 337054Snate@binkert.org#include "mem/protocol/MachineType.hh" 347054Snate@binkert.org#include "mem/protocol/Protocol.hh" 357054Snate@binkert.org#include "mem/protocol/TopologyType.hh" 367054Snate@binkert.org#include "mem/ruby/buffers/MessageBuffer.hh" 377054Snate@binkert.org#include "mem/ruby/common/NetDest.hh" 388257SBrad.Beckmann@amd.com#include "mem/ruby/network/BasicLink.hh" 396154Snate@binkert.org#include "mem/ruby/network/simple/SimpleNetwork.hh" 407054Snate@binkert.org#include "mem/ruby/network/simple/Switch.hh" 417547SBrad.Beckmann@amd.com#include "mem/ruby/network/simple/Throttle.hh" 428255SBrad.Beckmann@amd.com#include "mem/ruby/network/Topology.hh" 436154Snate@binkert.org#include "mem/ruby/profiler/Profiler.hh" 446154Snate@binkert.org#include "mem/ruby/system/System.hh" 456145Snate@binkert.org 467055Snate@binkert.orgusing namespace std; 477454Snate@binkert.orgusing m5::stl_helpers::deletePointers; 487055Snate@binkert.org 497054Snate@binkert.org#if 0 506284Snate@binkert.org// ***BIG HACK*** - This is actually code that _should_ be in Network.cc 516145Snate@binkert.org 526145Snate@binkert.org// Note: Moved to Princeton Network 536145Snate@binkert.org// calls new to abstract away from the network 547054Snate@binkert.orgNetwork* 557054Snate@binkert.orgNetwork::createNetwork(int nodes) 566145Snate@binkert.org{ 577054Snate@binkert.org return new SimpleNetwork(nodes); 586145Snate@binkert.org} 597054Snate@binkert.org#endif 606145Snate@binkert.org 616876Ssteve.reinhardt@amd.comSimpleNetwork::SimpleNetwork(const Params *p) 626876Ssteve.reinhardt@amd.com : Network(p) 636285Snate@binkert.org{ 647054Snate@binkert.org // Note: the parent Network Object constructor is called before the 657054Snate@binkert.org // SimpleNetwork child constructor. Therefore, the member variables 667054Snate@binkert.org // used below should already be initialized. 676285Snate@binkert.org 687454Snate@binkert.org m_endpoint_switches.resize(m_nodes); 696285Snate@binkert.org 707454Snate@binkert.org m_in_use.resize(m_virtual_networks); 717454Snate@binkert.org m_ordered.resize(m_virtual_networks); 727054Snate@binkert.org for (int i = 0; i < m_virtual_networks; i++) { 737054Snate@binkert.org m_in_use[i] = false; 747054Snate@binkert.org m_ordered[i] = false; 756285Snate@binkert.org } 767054Snate@binkert.org 777054Snate@binkert.org // Allocate to and from queues 787454Snate@binkert.org m_toNetQueues.resize(m_nodes); 797454Snate@binkert.org m_fromNetQueues.resize(m_nodes); 807054Snate@binkert.org for (int node = 0; node < m_nodes; node++) { 817454Snate@binkert.org m_toNetQueues[node].resize(m_virtual_networks); 827454Snate@binkert.org m_fromNetQueues[node].resize(m_virtual_networks); 837054Snate@binkert.org for (int j = 0; j < m_virtual_networks; j++) { 847056Snate@binkert.org m_toNetQueues[node][j] = 857056Snate@binkert.org new MessageBuffer(csprintf("toNet node %d j %d", node, j)); 867056Snate@binkert.org m_fromNetQueues[node][j] = 877056Snate@binkert.org new MessageBuffer(csprintf("fromNet node %d j %d", node, j)); 887054Snate@binkert.org } 897054Snate@binkert.org } 906881SBrad.Beckmann@amd.com} 916285Snate@binkert.org 927054Snate@binkert.orgvoid 937054Snate@binkert.orgSimpleNetwork::init() 946881SBrad.Beckmann@amd.com{ 957054Snate@binkert.org Network::init(); 966881SBrad.Beckmann@amd.com 977054Snate@binkert.org // The topology pointer should have already been initialized in 987054Snate@binkert.org // the parent class network constructor. 997054Snate@binkert.org assert(m_topology_ptr != NULL); 1007054Snate@binkert.org int number_of_switches = m_topology_ptr->numSwitches(); 1017054Snate@binkert.org for (int i = 0; i < number_of_switches; i++) { 1027454Snate@binkert.org m_switch_ptr_vector.push_back(new Switch(i, this)); 1037054Snate@binkert.org } 1046881SBrad.Beckmann@amd.com 1057054Snate@binkert.org // false because this isn't a reconfiguration 1067054Snate@binkert.org m_topology_ptr->createLinks(this, false); 1076285Snate@binkert.org} 1086145Snate@binkert.org 1097054Snate@binkert.orgvoid 1107054Snate@binkert.orgSimpleNetwork::reset() 1116145Snate@binkert.org{ 1127054Snate@binkert.org for (int node = 0; node < m_nodes; node++) { 1137054Snate@binkert.org for (int j = 0; j < m_virtual_networks; j++) { 1147054Snate@binkert.org m_toNetQueues[node][j]->clear(); 1157054Snate@binkert.org m_fromNetQueues[node][j]->clear(); 1167054Snate@binkert.org } 1176145Snate@binkert.org } 1186145Snate@binkert.org 1197054Snate@binkert.org for(int i = 0; i < m_switch_ptr_vector.size(); i++){ 1207054Snate@binkert.org m_switch_ptr_vector[i]->clearBuffers(); 1217054Snate@binkert.org } 1226145Snate@binkert.org} 1236145Snate@binkert.org 1246145Snate@binkert.orgSimpleNetwork::~SimpleNetwork() 1256145Snate@binkert.org{ 1267054Snate@binkert.org for (int i = 0; i < m_nodes; i++) { 1277454Snate@binkert.org deletePointers(m_toNetQueues[i]); 1287454Snate@binkert.org deletePointers(m_fromNetQueues[i]); 1297054Snate@binkert.org } 1307454Snate@binkert.org deletePointers(m_switch_ptr_vector); 1317454Snate@binkert.org deletePointers(m_buffers_to_free); 1327054Snate@binkert.org // delete m_topology_ptr; 1336145Snate@binkert.org} 1346145Snate@binkert.org 1356145Snate@binkert.org// From a switch to an endpoint node 1367054Snate@binkert.orgvoid 1378257SBrad.Beckmann@amd.comSimpleNetwork::makeOutLink(SwitchID src, NodeID dest, BasicLink* link, 1388257SBrad.Beckmann@amd.com LinkDirection direction, 1398257SBrad.Beckmann@amd.com const NetDest& routing_table_entry, 1408257SBrad.Beckmann@amd.com bool isReconfiguration) 1416145Snate@binkert.org{ 1427054Snate@binkert.org assert(dest < m_nodes); 1437054Snate@binkert.org assert(src < m_switch_ptr_vector.size()); 1447054Snate@binkert.org assert(m_switch_ptr_vector[src] != NULL); 1457054Snate@binkert.org 1467054Snate@binkert.org if (isReconfiguration) { 1477054Snate@binkert.org m_switch_ptr_vector[src]->reconfigureOutPort(routing_table_entry); 1487054Snate@binkert.org return; 1497054Snate@binkert.org } 1507054Snate@binkert.org 1517054Snate@binkert.org m_switch_ptr_vector[src]->addOutPort(m_fromNetQueues[dest], 1528257SBrad.Beckmann@amd.com routing_table_entry, 1538257SBrad.Beckmann@amd.com link->m_latency, 1548257SBrad.Beckmann@amd.com link->m_bw_multiplier); 1558257SBrad.Beckmann@amd.com 1566145Snate@binkert.org m_endpoint_switches[dest] = m_switch_ptr_vector[src]; 1576145Snate@binkert.org} 1586145Snate@binkert.org 1596145Snate@binkert.org// From an endpoint node to a switch 1607054Snate@binkert.orgvoid 1618257SBrad.Beckmann@amd.comSimpleNetwork::makeInLink(NodeID src, SwitchID dest, BasicLink* link, 1628257SBrad.Beckmann@amd.com LinkDirection direction, 1638257SBrad.Beckmann@amd.com const NetDest& routing_table_entry, 1648257SBrad.Beckmann@amd.com bool isReconfiguration) 1656145Snate@binkert.org{ 1667054Snate@binkert.org assert(src < m_nodes); 1677054Snate@binkert.org if (isReconfiguration) { 1687054Snate@binkert.org // do nothing 1697054Snate@binkert.org return; 1707054Snate@binkert.org } 1717054Snate@binkert.org 1726145Snate@binkert.org m_switch_ptr_vector[dest]->addInPort(m_toNetQueues[src]); 1736145Snate@binkert.org} 1746145Snate@binkert.org 1756145Snate@binkert.org// From a switch to a switch 1767054Snate@binkert.orgvoid 1778257SBrad.Beckmann@amd.comSimpleNetwork::makeInternalLink(SwitchID src, SwitchID dest, BasicLink* link, 1788257SBrad.Beckmann@amd.com LinkDirection direction, 1798257SBrad.Beckmann@amd.com const NetDest& routing_table_entry, 1808257SBrad.Beckmann@amd.com bool isReconfiguration) 1816145Snate@binkert.org{ 1827054Snate@binkert.org if (isReconfiguration) { 1837054Snate@binkert.org m_switch_ptr_vector[src]->reconfigureOutPort(routing_table_entry); 1847054Snate@binkert.org return; 1857054Snate@binkert.org } 1867054Snate@binkert.org 1876145Snate@binkert.org // Create a set of new MessageBuffers 1887454Snate@binkert.org std::vector<MessageBuffer*> queues; 1896145Snate@binkert.org for (int i = 0; i < m_virtual_networks; i++) { 1907054Snate@binkert.org // allocate a buffer 1917054Snate@binkert.org MessageBuffer* buffer_ptr = new MessageBuffer; 1927054Snate@binkert.org buffer_ptr->setOrdering(true); 1937054Snate@binkert.org if (m_buffer_size > 0) { 1947454Snate@binkert.org buffer_ptr->resize(m_buffer_size); 1957054Snate@binkert.org } 1967454Snate@binkert.org queues.push_back(buffer_ptr); 1977054Snate@binkert.org // remember to deallocate it 1987454Snate@binkert.org m_buffers_to_free.push_back(buffer_ptr); 1997054Snate@binkert.org } 2007054Snate@binkert.org // Connect it to the two switches 2017054Snate@binkert.org m_switch_ptr_vector[dest]->addInPort(queues); 2027054Snate@binkert.org m_switch_ptr_vector[src]->addOutPort(queues, routing_table_entry, 2038257SBrad.Beckmann@amd.com link->m_latency, 2048257SBrad.Beckmann@amd.com link->m_bw_multiplier); 2057054Snate@binkert.org} 2067054Snate@binkert.org 2077054Snate@binkert.orgvoid 2087054Snate@binkert.orgSimpleNetwork::checkNetworkAllocation(NodeID id, bool ordered, int network_num) 2097054Snate@binkert.org{ 2107832Snate@binkert.org assert(id < m_nodes); 2117832Snate@binkert.org assert(network_num < m_virtual_networks); 2127054Snate@binkert.org 2137054Snate@binkert.org if (ordered) { 2147054Snate@binkert.org m_ordered[network_num] = true; 2157054Snate@binkert.org } 2167054Snate@binkert.org m_in_use[network_num] = true; 2177054Snate@binkert.org} 2187054Snate@binkert.org 2197054Snate@binkert.orgMessageBuffer* 2207054Snate@binkert.orgSimpleNetwork::getToNetQueue(NodeID id, bool ordered, int network_num) 2217054Snate@binkert.org{ 2227054Snate@binkert.org checkNetworkAllocation(id, ordered, network_num); 2237054Snate@binkert.org return m_toNetQueues[id][network_num]; 2247054Snate@binkert.org} 2257054Snate@binkert.org 2267054Snate@binkert.orgMessageBuffer* 2277054Snate@binkert.orgSimpleNetwork::getFromNetQueue(NodeID id, bool ordered, int network_num) 2287054Snate@binkert.org{ 2297054Snate@binkert.org checkNetworkAllocation(id, ordered, network_num); 2307054Snate@binkert.org return m_fromNetQueues[id][network_num]; 2317054Snate@binkert.org} 2327054Snate@binkert.org 2337454Snate@binkert.orgconst std::vector<Throttle*>* 2347054Snate@binkert.orgSimpleNetwork::getThrottles(NodeID id) const 2357054Snate@binkert.org{ 2367054Snate@binkert.org assert(id >= 0); 2377054Snate@binkert.org assert(id < m_nodes); 2387054Snate@binkert.org assert(m_endpoint_switches[id] != NULL); 2397054Snate@binkert.org return m_endpoint_switches[id]->getThrottles(); 2407054Snate@binkert.org} 2417054Snate@binkert.org 2427054Snate@binkert.orgvoid 2437054Snate@binkert.orgSimpleNetwork::printStats(ostream& out) const 2447054Snate@binkert.org{ 2457054Snate@binkert.org out << endl; 2467054Snate@binkert.org out << "Network Stats" << endl; 2477054Snate@binkert.org out << "-------------" << endl; 2487054Snate@binkert.org out << endl; 2497547SBrad.Beckmann@amd.com 2507547SBrad.Beckmann@amd.com // 2517547SBrad.Beckmann@amd.com // Determine total counts before printing out each switch's stats 2527547SBrad.Beckmann@amd.com // 2537547SBrad.Beckmann@amd.com std::vector<uint64> total_msg_counts; 2547547SBrad.Beckmann@amd.com total_msg_counts.resize(MessageSizeType_NUM); 2557547SBrad.Beckmann@amd.com for (MessageSizeType type = MessageSizeType_FIRST; 2567547SBrad.Beckmann@amd.com type < MessageSizeType_NUM; 2577547SBrad.Beckmann@amd.com ++type) { 2587547SBrad.Beckmann@amd.com total_msg_counts[type] = 0; 2597547SBrad.Beckmann@amd.com } 2607547SBrad.Beckmann@amd.com 2617547SBrad.Beckmann@amd.com for (int i = 0; i < m_switch_ptr_vector.size(); i++) { 2627547SBrad.Beckmann@amd.com const std::vector<Throttle*>* throttles = 2637547SBrad.Beckmann@amd.com m_switch_ptr_vector[i]->getThrottles(); 2647547SBrad.Beckmann@amd.com 2657547SBrad.Beckmann@amd.com for (int p = 0; p < throttles->size(); p++) { 2667547SBrad.Beckmann@amd.com 2677547SBrad.Beckmann@amd.com const std::vector<std::vector<int> >& message_counts = 2687547SBrad.Beckmann@amd.com ((*throttles)[p])->getCounters(); 2697547SBrad.Beckmann@amd.com 2707547SBrad.Beckmann@amd.com for (MessageSizeType type = MessageSizeType_FIRST; 2717547SBrad.Beckmann@amd.com type < MessageSizeType_NUM; 2727547SBrad.Beckmann@amd.com ++type) { 2737547SBrad.Beckmann@amd.com 2747547SBrad.Beckmann@amd.com const std::vector<int> &mct = message_counts[type]; 2757547SBrad.Beckmann@amd.com int sum = accumulate(mct.begin(), mct.end(), 0); 2767547SBrad.Beckmann@amd.com total_msg_counts[type] += uint64(sum); 2777547SBrad.Beckmann@amd.com } 2787547SBrad.Beckmann@amd.com } 2797547SBrad.Beckmann@amd.com } 2807547SBrad.Beckmann@amd.com uint64 total_msgs = 0; 2817547SBrad.Beckmann@amd.com uint64 total_bytes = 0; 2827547SBrad.Beckmann@amd.com for (MessageSizeType type = MessageSizeType_FIRST; 2837547SBrad.Beckmann@amd.com type < MessageSizeType_NUM; 2847547SBrad.Beckmann@amd.com ++type) { 2857547SBrad.Beckmann@amd.com 2867547SBrad.Beckmann@amd.com if (total_msg_counts[type] > 0) { 2877547SBrad.Beckmann@amd.com out << "total_msg_count_" << type << ": " << total_msg_counts[type] 2887547SBrad.Beckmann@amd.com << " " << total_msg_counts[type] * 2897547SBrad.Beckmann@amd.com uint64(RubySystem::getNetwork()->MessageSizeType_to_int(type)) 2907547SBrad.Beckmann@amd.com << endl; 2917547SBrad.Beckmann@amd.com 2927547SBrad.Beckmann@amd.com total_msgs += total_msg_counts[type]; 2937547SBrad.Beckmann@amd.com 2947547SBrad.Beckmann@amd.com total_bytes += total_msg_counts[type] * 2957547SBrad.Beckmann@amd.com uint64(RubySystem::getNetwork()->MessageSizeType_to_int(type)); 2967547SBrad.Beckmann@amd.com 2977547SBrad.Beckmann@amd.com } 2987547SBrad.Beckmann@amd.com } 2997547SBrad.Beckmann@amd.com 3007547SBrad.Beckmann@amd.com out << "total_msgs: " << total_msgs 3017547SBrad.Beckmann@amd.com << " total_bytes: " << total_bytes << endl; 3027547SBrad.Beckmann@amd.com 3037547SBrad.Beckmann@amd.com out << endl; 3047054Snate@binkert.org for (int i = 0; i < m_switch_ptr_vector.size(); i++) { 3057054Snate@binkert.org m_switch_ptr_vector[i]->printStats(out); 3067054Snate@binkert.org } 3077054Snate@binkert.org m_topology_ptr->printStats(out); 3087054Snate@binkert.org} 3097054Snate@binkert.org 3107054Snate@binkert.orgvoid 3117054Snate@binkert.orgSimpleNetwork::clearStats() 3127054Snate@binkert.org{ 3137054Snate@binkert.org for (int i = 0; i < m_switch_ptr_vector.size(); i++) { 3147054Snate@binkert.org m_switch_ptr_vector[i]->clearStats(); 3157054Snate@binkert.org } 3167054Snate@binkert.org m_topology_ptr->clearStats(); 3177054Snate@binkert.org} 3187054Snate@binkert.org 3197054Snate@binkert.orgvoid 3207054Snate@binkert.orgSimpleNetwork::printConfig(ostream& out) const 3217054Snate@binkert.org{ 3227054Snate@binkert.org out << endl; 3237054Snate@binkert.org out << "Network Configuration" << endl; 3247054Snate@binkert.org out << "---------------------" << endl; 3257054Snate@binkert.org out << "network: SIMPLE_NETWORK" << endl; 3267054Snate@binkert.org out << "topology: " << m_topology_ptr->getName() << endl; 3277054Snate@binkert.org out << endl; 3287054Snate@binkert.org 3297054Snate@binkert.org for (int i = 0; i < m_virtual_networks; i++) { 3307054Snate@binkert.org out << "virtual_net_" << i << ": "; 3317054Snate@binkert.org if (m_in_use[i]) { 3327054Snate@binkert.org out << "active, "; 3337054Snate@binkert.org if (m_ordered[i]) { 3347054Snate@binkert.org out << "ordered" << endl; 3357054Snate@binkert.org } else { 3367054Snate@binkert.org out << "unordered" << endl; 3377054Snate@binkert.org } 3387054Snate@binkert.org } else { 3397054Snate@binkert.org out << "inactive" << endl; 3407054Snate@binkert.org } 3417054Snate@binkert.org } 3427054Snate@binkert.org out << endl; 3437054Snate@binkert.org 3447054Snate@binkert.org for(int i = 0; i < m_switch_ptr_vector.size(); i++) { 3457054Snate@binkert.org m_switch_ptr_vector[i]->printConfig(out); 3466145Snate@binkert.org } 3476145Snate@binkert.org 3487054Snate@binkert.org m_topology_ptr->printConfig(out); 3496145Snate@binkert.org} 3506145Snate@binkert.org 3517054Snate@binkert.orgvoid 3527054Snate@binkert.orgSimpleNetwork::print(ostream& out) const 3536145Snate@binkert.org{ 3547054Snate@binkert.org out << "[SimpleNetwork]"; 3556145Snate@binkert.org} 3566876Ssteve.reinhardt@amd.com 3576876Ssteve.reinhardt@amd.com 3586876Ssteve.reinhardt@amd.comSimpleNetwork * 3596876Ssteve.reinhardt@amd.comSimpleNetworkParams::create() 3606876Ssteve.reinhardt@amd.com{ 3616876Ssteve.reinhardt@amd.com return new SimpleNetwork(this); 3626876Ssteve.reinhardt@amd.com} 363