SimpleNetwork.cc revision 7547
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 297547SBrad.Beckmann@amd.com#include <numeric> 307547SBrad.Beckmann@amd.com 317454Snate@binkert.org#include "base/stl_helpers.hh" 327054Snate@binkert.org#include "mem/protocol/MachineType.hh" 337054Snate@binkert.org#include "mem/protocol/Protocol.hh" 347054Snate@binkert.org#include "mem/protocol/TopologyType.hh" 357054Snate@binkert.org#include "mem/ruby/buffers/MessageBuffer.hh" 367054Snate@binkert.org#include "mem/ruby/common/NetDest.hh" 376154Snate@binkert.org#include "mem/ruby/network/simple/SimpleNetwork.hh" 387054Snate@binkert.org#include "mem/ruby/network/simple/Switch.hh" 397547SBrad.Beckmann@amd.com#include "mem/ruby/network/simple/Throttle.hh" 407054Snate@binkert.org#include "mem/ruby/network/simple/Topology.hh" 416154Snate@binkert.org#include "mem/ruby/profiler/Profiler.hh" 426154Snate@binkert.org#include "mem/ruby/system/System.hh" 436145Snate@binkert.org 447055Snate@binkert.orgusing namespace std; 457454Snate@binkert.orgusing m5::stl_helpers::deletePointers; 467055Snate@binkert.org 477054Snate@binkert.org#if 0 486284Snate@binkert.org// ***BIG HACK*** - This is actually code that _should_ be in Network.cc 496145Snate@binkert.org 506145Snate@binkert.org// Note: Moved to Princeton Network 516145Snate@binkert.org// calls new to abstract away from the network 527054Snate@binkert.orgNetwork* 537054Snate@binkert.orgNetwork::createNetwork(int nodes) 546145Snate@binkert.org{ 557054Snate@binkert.org return new SimpleNetwork(nodes); 566145Snate@binkert.org} 577054Snate@binkert.org#endif 586145Snate@binkert.org 596876Ssteve.reinhardt@amd.comSimpleNetwork::SimpleNetwork(const Params *p) 606876Ssteve.reinhardt@amd.com : Network(p) 616285Snate@binkert.org{ 627054Snate@binkert.org // Note: the parent Network Object constructor is called before the 637054Snate@binkert.org // SimpleNetwork child constructor. Therefore, the member variables 647054Snate@binkert.org // used below should already be initialized. 656285Snate@binkert.org 667454Snate@binkert.org m_endpoint_switches.resize(m_nodes); 676285Snate@binkert.org 687454Snate@binkert.org m_in_use.resize(m_virtual_networks); 697454Snate@binkert.org m_ordered.resize(m_virtual_networks); 707054Snate@binkert.org for (int i = 0; i < m_virtual_networks; i++) { 717054Snate@binkert.org m_in_use[i] = false; 727054Snate@binkert.org m_ordered[i] = false; 736285Snate@binkert.org } 747054Snate@binkert.org 757054Snate@binkert.org // Allocate to and from queues 767454Snate@binkert.org m_toNetQueues.resize(m_nodes); 777454Snate@binkert.org m_fromNetQueues.resize(m_nodes); 787054Snate@binkert.org for (int node = 0; node < m_nodes; node++) { 797454Snate@binkert.org m_toNetQueues[node].resize(m_virtual_networks); 807454Snate@binkert.org m_fromNetQueues[node].resize(m_virtual_networks); 817054Snate@binkert.org for (int j = 0; j < m_virtual_networks; j++) { 827056Snate@binkert.org m_toNetQueues[node][j] = 837056Snate@binkert.org new MessageBuffer(csprintf("toNet node %d j %d", node, j)); 847056Snate@binkert.org m_fromNetQueues[node][j] = 857056Snate@binkert.org new MessageBuffer(csprintf("fromNet node %d j %d", node, j)); 867054Snate@binkert.org } 877054Snate@binkert.org } 886881SBrad.Beckmann@amd.com} 896285Snate@binkert.org 907054Snate@binkert.orgvoid 917054Snate@binkert.orgSimpleNetwork::init() 926881SBrad.Beckmann@amd.com{ 937054Snate@binkert.org Network::init(); 946881SBrad.Beckmann@amd.com 957054Snate@binkert.org // The topology pointer should have already been initialized in 967054Snate@binkert.org // the parent class network constructor. 977054Snate@binkert.org assert(m_topology_ptr != NULL); 987054Snate@binkert.org int number_of_switches = m_topology_ptr->numSwitches(); 997054Snate@binkert.org for (int i = 0; i < number_of_switches; i++) { 1007454Snate@binkert.org m_switch_ptr_vector.push_back(new Switch(i, this)); 1017054Snate@binkert.org } 1026881SBrad.Beckmann@amd.com 1037054Snate@binkert.org // false because this isn't a reconfiguration 1047054Snate@binkert.org m_topology_ptr->createLinks(this, false); 1056285Snate@binkert.org} 1066145Snate@binkert.org 1077054Snate@binkert.orgvoid 1087054Snate@binkert.orgSimpleNetwork::reset() 1096145Snate@binkert.org{ 1107054Snate@binkert.org for (int node = 0; node < m_nodes; node++) { 1117054Snate@binkert.org for (int j = 0; j < m_virtual_networks; j++) { 1127054Snate@binkert.org m_toNetQueues[node][j]->clear(); 1137054Snate@binkert.org m_fromNetQueues[node][j]->clear(); 1147054Snate@binkert.org } 1156145Snate@binkert.org } 1166145Snate@binkert.org 1177054Snate@binkert.org for(int i = 0; i < m_switch_ptr_vector.size(); i++){ 1187054Snate@binkert.org m_switch_ptr_vector[i]->clearBuffers(); 1197054Snate@binkert.org } 1206145Snate@binkert.org} 1216145Snate@binkert.org 1226145Snate@binkert.orgSimpleNetwork::~SimpleNetwork() 1236145Snate@binkert.org{ 1247054Snate@binkert.org for (int i = 0; i < m_nodes; i++) { 1257454Snate@binkert.org deletePointers(m_toNetQueues[i]); 1267454Snate@binkert.org deletePointers(m_fromNetQueues[i]); 1277054Snate@binkert.org } 1287454Snate@binkert.org deletePointers(m_switch_ptr_vector); 1297454Snate@binkert.org deletePointers(m_buffers_to_free); 1307054Snate@binkert.org // delete m_topology_ptr; 1316145Snate@binkert.org} 1326145Snate@binkert.org 1336145Snate@binkert.org// From a switch to an endpoint node 1347054Snate@binkert.orgvoid 1357054Snate@binkert.orgSimpleNetwork::makeOutLink(SwitchID src, NodeID dest, 1367054Snate@binkert.org const NetDest& routing_table_entry, int link_latency, int link_weight, 1377054Snate@binkert.org int bw_multiplier, bool isReconfiguration) 1386145Snate@binkert.org{ 1397054Snate@binkert.org assert(dest < m_nodes); 1407054Snate@binkert.org assert(src < m_switch_ptr_vector.size()); 1417054Snate@binkert.org assert(m_switch_ptr_vector[src] != NULL); 1427054Snate@binkert.org 1437054Snate@binkert.org if (isReconfiguration) { 1447054Snate@binkert.org m_switch_ptr_vector[src]->reconfigureOutPort(routing_table_entry); 1457054Snate@binkert.org return; 1467054Snate@binkert.org } 1477054Snate@binkert.org 1487054Snate@binkert.org m_switch_ptr_vector[src]->addOutPort(m_fromNetQueues[dest], 1497054Snate@binkert.org routing_table_entry, link_latency, bw_multiplier); 1506145Snate@binkert.org m_endpoint_switches[dest] = m_switch_ptr_vector[src]; 1516145Snate@binkert.org} 1526145Snate@binkert.org 1536145Snate@binkert.org// From an endpoint node to a switch 1547054Snate@binkert.orgvoid 1557054Snate@binkert.orgSimpleNetwork::makeInLink(NodeID src, SwitchID dest, 1567054Snate@binkert.org const NetDest& routing_table_entry, int link_latency, int bw_multiplier, 1577054Snate@binkert.org bool isReconfiguration) 1586145Snate@binkert.org{ 1597054Snate@binkert.org assert(src < m_nodes); 1607054Snate@binkert.org if (isReconfiguration) { 1617054Snate@binkert.org // do nothing 1627054Snate@binkert.org return; 1637054Snate@binkert.org } 1647054Snate@binkert.org 1656145Snate@binkert.org m_switch_ptr_vector[dest]->addInPort(m_toNetQueues[src]); 1666145Snate@binkert.org} 1676145Snate@binkert.org 1686145Snate@binkert.org// From a switch to a switch 1697054Snate@binkert.orgvoid 1707054Snate@binkert.orgSimpleNetwork::makeInternalLink(SwitchID src, SwitchID dest, 1717054Snate@binkert.org const NetDest& routing_table_entry, int link_latency, int link_weight, 1727054Snate@binkert.org int bw_multiplier, bool isReconfiguration) 1736145Snate@binkert.org{ 1747054Snate@binkert.org if (isReconfiguration) { 1757054Snate@binkert.org m_switch_ptr_vector[src]->reconfigureOutPort(routing_table_entry); 1767054Snate@binkert.org return; 1777054Snate@binkert.org } 1787054Snate@binkert.org 1796145Snate@binkert.org // Create a set of new MessageBuffers 1807454Snate@binkert.org std::vector<MessageBuffer*> queues; 1816145Snate@binkert.org for (int i = 0; i < m_virtual_networks; i++) { 1827054Snate@binkert.org // allocate a buffer 1837054Snate@binkert.org MessageBuffer* buffer_ptr = new MessageBuffer; 1847054Snate@binkert.org buffer_ptr->setOrdering(true); 1857054Snate@binkert.org if (m_buffer_size > 0) { 1867454Snate@binkert.org buffer_ptr->resize(m_buffer_size); 1877054Snate@binkert.org } 1887454Snate@binkert.org queues.push_back(buffer_ptr); 1897054Snate@binkert.org // remember to deallocate it 1907454Snate@binkert.org m_buffers_to_free.push_back(buffer_ptr); 1917054Snate@binkert.org } 1927054Snate@binkert.org // Connect it to the two switches 1937054Snate@binkert.org m_switch_ptr_vector[dest]->addInPort(queues); 1947054Snate@binkert.org m_switch_ptr_vector[src]->addOutPort(queues, routing_table_entry, 1957054Snate@binkert.org link_latency, bw_multiplier); 1967054Snate@binkert.org} 1977054Snate@binkert.org 1987054Snate@binkert.orgvoid 1997054Snate@binkert.orgSimpleNetwork::checkNetworkAllocation(NodeID id, bool ordered, int network_num) 2007054Snate@binkert.org{ 2017054Snate@binkert.org ASSERT(id < m_nodes); 2027054Snate@binkert.org ASSERT(network_num < m_virtual_networks); 2037054Snate@binkert.org 2047054Snate@binkert.org if (ordered) { 2057054Snate@binkert.org m_ordered[network_num] = true; 2067054Snate@binkert.org } 2077054Snate@binkert.org m_in_use[network_num] = true; 2087054Snate@binkert.org} 2097054Snate@binkert.org 2107054Snate@binkert.orgMessageBuffer* 2117054Snate@binkert.orgSimpleNetwork::getToNetQueue(NodeID id, bool ordered, int network_num) 2127054Snate@binkert.org{ 2137054Snate@binkert.org checkNetworkAllocation(id, ordered, network_num); 2147054Snate@binkert.org return m_toNetQueues[id][network_num]; 2157054Snate@binkert.org} 2167054Snate@binkert.org 2177054Snate@binkert.orgMessageBuffer* 2187054Snate@binkert.orgSimpleNetwork::getFromNetQueue(NodeID id, bool ordered, int network_num) 2197054Snate@binkert.org{ 2207054Snate@binkert.org checkNetworkAllocation(id, ordered, network_num); 2217054Snate@binkert.org return m_fromNetQueues[id][network_num]; 2227054Snate@binkert.org} 2237054Snate@binkert.org 2247454Snate@binkert.orgconst std::vector<Throttle*>* 2257054Snate@binkert.orgSimpleNetwork::getThrottles(NodeID id) const 2267054Snate@binkert.org{ 2277054Snate@binkert.org assert(id >= 0); 2287054Snate@binkert.org assert(id < m_nodes); 2297054Snate@binkert.org assert(m_endpoint_switches[id] != NULL); 2307054Snate@binkert.org return m_endpoint_switches[id]->getThrottles(); 2317054Snate@binkert.org} 2327054Snate@binkert.org 2337054Snate@binkert.orgvoid 2347054Snate@binkert.orgSimpleNetwork::printStats(ostream& out) const 2357054Snate@binkert.org{ 2367054Snate@binkert.org out << endl; 2377054Snate@binkert.org out << "Network Stats" << endl; 2387054Snate@binkert.org out << "-------------" << endl; 2397054Snate@binkert.org out << endl; 2407547SBrad.Beckmann@amd.com 2417547SBrad.Beckmann@amd.com // 2427547SBrad.Beckmann@amd.com // Determine total counts before printing out each switch's stats 2437547SBrad.Beckmann@amd.com // 2447547SBrad.Beckmann@amd.com std::vector<uint64> total_msg_counts; 2457547SBrad.Beckmann@amd.com total_msg_counts.resize(MessageSizeType_NUM); 2467547SBrad.Beckmann@amd.com for (MessageSizeType type = MessageSizeType_FIRST; 2477547SBrad.Beckmann@amd.com type < MessageSizeType_NUM; 2487547SBrad.Beckmann@amd.com ++type) { 2497547SBrad.Beckmann@amd.com total_msg_counts[type] = 0; 2507547SBrad.Beckmann@amd.com } 2517547SBrad.Beckmann@amd.com 2527547SBrad.Beckmann@amd.com for (int i = 0; i < m_switch_ptr_vector.size(); i++) { 2537547SBrad.Beckmann@amd.com const std::vector<Throttle*>* throttles = 2547547SBrad.Beckmann@amd.com m_switch_ptr_vector[i]->getThrottles(); 2557547SBrad.Beckmann@amd.com 2567547SBrad.Beckmann@amd.com for (int p = 0; p < throttles->size(); p++) { 2577547SBrad.Beckmann@amd.com 2587547SBrad.Beckmann@amd.com const std::vector<std::vector<int> >& message_counts = 2597547SBrad.Beckmann@amd.com ((*throttles)[p])->getCounters(); 2607547SBrad.Beckmann@amd.com 2617547SBrad.Beckmann@amd.com for (MessageSizeType type = MessageSizeType_FIRST; 2627547SBrad.Beckmann@amd.com type < MessageSizeType_NUM; 2637547SBrad.Beckmann@amd.com ++type) { 2647547SBrad.Beckmann@amd.com 2657547SBrad.Beckmann@amd.com const std::vector<int> &mct = message_counts[type]; 2667547SBrad.Beckmann@amd.com int sum = accumulate(mct.begin(), mct.end(), 0); 2677547SBrad.Beckmann@amd.com total_msg_counts[type] += uint64(sum); 2687547SBrad.Beckmann@amd.com } 2697547SBrad.Beckmann@amd.com } 2707547SBrad.Beckmann@amd.com } 2717547SBrad.Beckmann@amd.com uint64 total_msgs = 0; 2727547SBrad.Beckmann@amd.com uint64 total_bytes = 0; 2737547SBrad.Beckmann@amd.com for (MessageSizeType type = MessageSizeType_FIRST; 2747547SBrad.Beckmann@amd.com type < MessageSizeType_NUM; 2757547SBrad.Beckmann@amd.com ++type) { 2767547SBrad.Beckmann@amd.com 2777547SBrad.Beckmann@amd.com if (total_msg_counts[type] > 0) { 2787547SBrad.Beckmann@amd.com out << "total_msg_count_" << type << ": " << total_msg_counts[type] 2797547SBrad.Beckmann@amd.com << " " << total_msg_counts[type] * 2807547SBrad.Beckmann@amd.com uint64(RubySystem::getNetwork()->MessageSizeType_to_int(type)) 2817547SBrad.Beckmann@amd.com << endl; 2827547SBrad.Beckmann@amd.com 2837547SBrad.Beckmann@amd.com total_msgs += total_msg_counts[type]; 2847547SBrad.Beckmann@amd.com 2857547SBrad.Beckmann@amd.com total_bytes += total_msg_counts[type] * 2867547SBrad.Beckmann@amd.com uint64(RubySystem::getNetwork()->MessageSizeType_to_int(type)); 2877547SBrad.Beckmann@amd.com 2887547SBrad.Beckmann@amd.com } 2897547SBrad.Beckmann@amd.com } 2907547SBrad.Beckmann@amd.com 2917547SBrad.Beckmann@amd.com out << "total_msgs: " << total_msgs 2927547SBrad.Beckmann@amd.com << " total_bytes: " << total_bytes << endl; 2937547SBrad.Beckmann@amd.com 2947547SBrad.Beckmann@amd.com out << endl; 2957054Snate@binkert.org for (int i = 0; i < m_switch_ptr_vector.size(); i++) { 2967054Snate@binkert.org m_switch_ptr_vector[i]->printStats(out); 2977054Snate@binkert.org } 2987054Snate@binkert.org m_topology_ptr->printStats(out); 2997054Snate@binkert.org} 3007054Snate@binkert.org 3017054Snate@binkert.orgvoid 3027054Snate@binkert.orgSimpleNetwork::clearStats() 3037054Snate@binkert.org{ 3047054Snate@binkert.org for (int i = 0; i < m_switch_ptr_vector.size(); i++) { 3057054Snate@binkert.org m_switch_ptr_vector[i]->clearStats(); 3067054Snate@binkert.org } 3077054Snate@binkert.org m_topology_ptr->clearStats(); 3087054Snate@binkert.org} 3097054Snate@binkert.org 3107054Snate@binkert.orgvoid 3117054Snate@binkert.orgSimpleNetwork::printConfig(ostream& out) const 3127054Snate@binkert.org{ 3137054Snate@binkert.org out << endl; 3147054Snate@binkert.org out << "Network Configuration" << endl; 3157054Snate@binkert.org out << "---------------------" << endl; 3167054Snate@binkert.org out << "network: SIMPLE_NETWORK" << endl; 3177054Snate@binkert.org out << "topology: " << m_topology_ptr->getName() << endl; 3187054Snate@binkert.org out << endl; 3197054Snate@binkert.org 3207054Snate@binkert.org for (int i = 0; i < m_virtual_networks; i++) { 3217054Snate@binkert.org out << "virtual_net_" << i << ": "; 3227054Snate@binkert.org if (m_in_use[i]) { 3237054Snate@binkert.org out << "active, "; 3247054Snate@binkert.org if (m_ordered[i]) { 3257054Snate@binkert.org out << "ordered" << endl; 3267054Snate@binkert.org } else { 3277054Snate@binkert.org out << "unordered" << endl; 3287054Snate@binkert.org } 3297054Snate@binkert.org } else { 3307054Snate@binkert.org out << "inactive" << endl; 3317054Snate@binkert.org } 3327054Snate@binkert.org } 3337054Snate@binkert.org out << endl; 3347054Snate@binkert.org 3357054Snate@binkert.org for(int i = 0; i < m_switch_ptr_vector.size(); i++) { 3367054Snate@binkert.org m_switch_ptr_vector[i]->printConfig(out); 3376145Snate@binkert.org } 3386145Snate@binkert.org 3397054Snate@binkert.org m_topology_ptr->printConfig(out); 3406145Snate@binkert.org} 3416145Snate@binkert.org 3427054Snate@binkert.orgvoid 3437054Snate@binkert.orgSimpleNetwork::print(ostream& out) const 3446145Snate@binkert.org{ 3457054Snate@binkert.org out << "[SimpleNetwork]"; 3466145Snate@binkert.org} 3476876Ssteve.reinhardt@amd.com 3486876Ssteve.reinhardt@amd.com 3496876Ssteve.reinhardt@amd.comSimpleNetwork * 3506876Ssteve.reinhardt@amd.comSimpleNetworkParams::create() 3516876Ssteve.reinhardt@amd.com{ 3526876Ssteve.reinhardt@amd.com return new SimpleNetwork(this); 3536876Ssteve.reinhardt@amd.com} 354