SimpleNetwork.cc (8645:89929730804b) | SimpleNetwork.cc (9116:9171e26543fa) |
---|---|
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" | 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/protocol/TopologyType.hh" | |
35#include "mem/ruby/buffers/MessageBuffer.hh" 36#include "mem/ruby/common/NetDest.hh" 37#include "mem/ruby/network/BasicLink.hh" 38#include "mem/ruby/network/simple/SimpleLink.hh" 39#include "mem/ruby/network/simple/SimpleNetwork.hh" 40#include "mem/ruby/network/simple/Switch.hh" 41#include "mem/ruby/network/simple/Throttle.hh" 42#include "mem/ruby/network/Topology.hh" 43#include "mem/ruby/profiler/Profiler.hh" 44#include "mem/ruby/system/System.hh" 45 46using namespace std; 47using m5::stl_helpers::deletePointers; 48 49SimpleNetwork::SimpleNetwork(const Params *p) 50 : Network(p) 51{ 52 m_buffer_size = p->buffer_size; 53 m_endpoint_bandwidth = p->endpoint_bandwidth; 54 m_adaptive_routing = p->adaptive_routing; 55 56 // Note: the parent Network Object constructor is called before the 57 // SimpleNetwork child constructor. Therefore, the member variables 58 // used below should already be initialized. 59 60 m_endpoint_switches.resize(m_nodes); 61 62 m_in_use.resize(m_virtual_networks); 63 m_ordered.resize(m_virtual_networks); 64 for (int i = 0; i < m_virtual_networks; i++) { 65 m_in_use[i] = false; 66 m_ordered[i] = false; 67 } 68 69 // Allocate to and from queues 70 m_toNetQueues.resize(m_nodes); 71 m_fromNetQueues.resize(m_nodes); 72 for (int node = 0; node < m_nodes; node++) { 73 m_toNetQueues[node].resize(m_virtual_networks); 74 m_fromNetQueues[node].resize(m_virtual_networks); 75 for (int j = 0; j < m_virtual_networks; j++) { 76 m_toNetQueues[node][j] = 77 new MessageBuffer(csprintf("toNet node %d j %d", node, j)); 78 m_fromNetQueues[node][j] = 79 new MessageBuffer(csprintf("fromNet node %d j %d", node, j)); 80 } 81 } 82} 83 84void 85SimpleNetwork::init() 86{ 87 Network::init(); 88 89 // The topology pointer should have already been initialized in 90 // the parent class network constructor. 91 assert(m_topology_ptr != NULL); 92 int number_of_switches = m_topology_ptr->numSwitches(); 93 for (int i = 0; i < number_of_switches; i++) { 94 m_switch_ptr_vector.push_back(new Switch(i, this)); 95 } 96 97 // false because this isn't a reconfiguration 98 m_topology_ptr->createLinks(this, false); 99} 100 101void 102SimpleNetwork::reset() 103{ 104 for (int node = 0; node < m_nodes; node++) { 105 for (int j = 0; j < m_virtual_networks; j++) { 106 m_toNetQueues[node][j]->clear(); 107 m_fromNetQueues[node][j]->clear(); 108 } 109 } 110 111 for(int i = 0; i < m_switch_ptr_vector.size(); i++){ 112 m_switch_ptr_vector[i]->clearBuffers(); 113 } 114} 115 116SimpleNetwork::~SimpleNetwork() 117{ 118 for (int i = 0; i < m_nodes; i++) { 119 deletePointers(m_toNetQueues[i]); 120 deletePointers(m_fromNetQueues[i]); 121 } 122 deletePointers(m_switch_ptr_vector); 123 deletePointers(m_buffers_to_free); 124 // delete m_topology_ptr; 125} 126 127// From a switch to an endpoint node 128void 129SimpleNetwork::makeOutLink(SwitchID src, NodeID dest, BasicLink* link, 130 LinkDirection direction, 131 const NetDest& routing_table_entry, 132 bool isReconfiguration) 133{ 134 assert(dest < m_nodes); 135 assert(src < m_switch_ptr_vector.size()); 136 assert(m_switch_ptr_vector[src] != NULL); 137 138 if (isReconfiguration) { 139 m_switch_ptr_vector[src]->reconfigureOutPort(routing_table_entry); 140 return; 141 } 142 143 SimpleExtLink *simple_link = safe_cast<SimpleExtLink*>(link); 144 145 m_switch_ptr_vector[src]->addOutPort(m_fromNetQueues[dest], 146 routing_table_entry, 147 simple_link->m_latency, 148 simple_link->m_bw_multiplier); 149 150 m_endpoint_switches[dest] = m_switch_ptr_vector[src]; 151} 152 153// From an endpoint node to a switch 154void 155SimpleNetwork::makeInLink(NodeID src, SwitchID dest, BasicLink* link, 156 LinkDirection direction, 157 const NetDest& routing_table_entry, 158 bool isReconfiguration) 159{ 160 assert(src < m_nodes); 161 if (isReconfiguration) { 162 // do nothing 163 return; 164 } 165 166 m_switch_ptr_vector[dest]->addInPort(m_toNetQueues[src]); 167} 168 169// From a switch to a switch 170void 171SimpleNetwork::makeInternalLink(SwitchID src, SwitchID dest, BasicLink* link, 172 LinkDirection direction, 173 const NetDest& routing_table_entry, 174 bool isReconfiguration) 175{ 176 if (isReconfiguration) { 177 m_switch_ptr_vector[src]->reconfigureOutPort(routing_table_entry); 178 return; 179 } 180 181 // Create a set of new MessageBuffers 182 std::vector<MessageBuffer*> queues; 183 for (int i = 0; i < m_virtual_networks; i++) { 184 // allocate a buffer 185 MessageBuffer* buffer_ptr = new MessageBuffer; 186 buffer_ptr->setOrdering(true); 187 if (m_buffer_size > 0) { 188 buffer_ptr->resize(m_buffer_size); 189 } 190 queues.push_back(buffer_ptr); 191 // remember to deallocate it 192 m_buffers_to_free.push_back(buffer_ptr); 193 } 194 // Connect it to the two switches 195 SimpleIntLink *simple_link = safe_cast<SimpleIntLink*>(link); 196 197 m_switch_ptr_vector[dest]->addInPort(queues); 198 m_switch_ptr_vector[src]->addOutPort(queues, routing_table_entry, 199 simple_link->m_latency, 200 simple_link->m_bw_multiplier); 201} 202 203void 204SimpleNetwork::checkNetworkAllocation(NodeID id, bool ordered, int network_num) 205{ 206 assert(id < m_nodes); 207 assert(network_num < m_virtual_networks); 208 209 if (ordered) { 210 m_ordered[network_num] = true; 211 } 212 m_in_use[network_num] = true; 213} 214 215MessageBuffer* 216SimpleNetwork::getToNetQueue(NodeID id, bool ordered, int network_num, 217 std::string vnet_type) 218{ 219 checkNetworkAllocation(id, ordered, network_num); 220 return m_toNetQueues[id][network_num]; 221} 222 223MessageBuffer* 224SimpleNetwork::getFromNetQueue(NodeID id, bool ordered, int network_num, 225 std::string vnet_type) 226{ 227 checkNetworkAllocation(id, ordered, network_num); 228 return m_fromNetQueues[id][network_num]; 229} 230 231const std::vector<Throttle*>* 232SimpleNetwork::getThrottles(NodeID id) const 233{ 234 assert(id >= 0); 235 assert(id < m_nodes); 236 assert(m_endpoint_switches[id] != NULL); 237 return m_endpoint_switches[id]->getThrottles(); 238} 239 240void 241SimpleNetwork::printStats(ostream& out) const 242{ 243 out << endl; 244 out << "Network Stats" << endl; 245 out << "-------------" << endl; 246 out << endl; 247 248 // 249 // Determine total counts before printing out each switch's stats 250 // 251 std::vector<uint64> total_msg_counts; 252 total_msg_counts.resize(MessageSizeType_NUM); 253 for (MessageSizeType type = MessageSizeType_FIRST; 254 type < MessageSizeType_NUM; 255 ++type) { 256 total_msg_counts[type] = 0; 257 } 258 259 for (int i = 0; i < m_switch_ptr_vector.size(); i++) { 260 const std::vector<Throttle*>* throttles = 261 m_switch_ptr_vector[i]->getThrottles(); 262 263 for (int p = 0; p < throttles->size(); p++) { 264 265 const std::vector<std::vector<int> >& message_counts = 266 ((*throttles)[p])->getCounters(); 267 268 for (MessageSizeType type = MessageSizeType_FIRST; 269 type < MessageSizeType_NUM; 270 ++type) { 271 272 const std::vector<int> &mct = message_counts[type]; 273 int sum = accumulate(mct.begin(), mct.end(), 0); 274 total_msg_counts[type] += uint64(sum); 275 } 276 } 277 } 278 uint64 total_msgs = 0; 279 uint64 total_bytes = 0; 280 for (MessageSizeType type = MessageSizeType_FIRST; 281 type < MessageSizeType_NUM; 282 ++type) { 283 284 if (total_msg_counts[type] > 0) { 285 out << "total_msg_count_" << type << ": " << total_msg_counts[type] 286 << " " << total_msg_counts[type] * 287 uint64(RubySystem::getNetwork()->MessageSizeType_to_int(type)) 288 << endl; 289 290 total_msgs += total_msg_counts[type]; 291 292 total_bytes += total_msg_counts[type] * 293 uint64(RubySystem::getNetwork()->MessageSizeType_to_int(type)); 294 295 } 296 } 297 298 out << "total_msgs: " << total_msgs 299 << " total_bytes: " << total_bytes << endl; 300 301 out << endl; 302 for (int i = 0; i < m_switch_ptr_vector.size(); i++) { 303 m_switch_ptr_vector[i]->printStats(out); 304 } 305 m_topology_ptr->printStats(out); 306} 307 308void 309SimpleNetwork::clearStats() 310{ 311 for (int i = 0; i < m_switch_ptr_vector.size(); i++) { 312 m_switch_ptr_vector[i]->clearStats(); 313 } 314 m_topology_ptr->clearStats(); 315} 316 317void 318SimpleNetwork::printConfig(ostream& out) const 319{ 320 out << endl; 321 out << "Network Configuration" << endl; 322 out << "---------------------" << endl; 323 out << "network: SIMPLE_NETWORK" << endl; 324 out << "topology: " << m_topology_ptr->getName() << endl; 325 out << endl; 326 327 for (int i = 0; i < m_virtual_networks; i++) { 328 out << "virtual_net_" << i << ": "; 329 if (m_in_use[i]) { 330 out << "active, "; 331 if (m_ordered[i]) { 332 out << "ordered" << endl; 333 } else { 334 out << "unordered" << endl; 335 } 336 } else { 337 out << "inactive" << endl; 338 } 339 } 340 out << endl; 341 342 for(int i = 0; i < m_switch_ptr_vector.size(); i++) { 343 m_switch_ptr_vector[i]->printConfig(out); 344 } 345 346 m_topology_ptr->printConfig(out); 347} 348 349void 350SimpleNetwork::print(ostream& out) const 351{ 352 out << "[SimpleNetwork]"; 353} 354 355 356SimpleNetwork * 357SimpleNetworkParams::create() 358{ 359 return new SimpleNetwork(this); 360} | 34#include "mem/ruby/buffers/MessageBuffer.hh" 35#include "mem/ruby/common/NetDest.hh" 36#include "mem/ruby/network/BasicLink.hh" 37#include "mem/ruby/network/simple/SimpleLink.hh" 38#include "mem/ruby/network/simple/SimpleNetwork.hh" 39#include "mem/ruby/network/simple/Switch.hh" 40#include "mem/ruby/network/simple/Throttle.hh" 41#include "mem/ruby/network/Topology.hh" 42#include "mem/ruby/profiler/Profiler.hh" 43#include "mem/ruby/system/System.hh" 44 45using namespace std; 46using m5::stl_helpers::deletePointers; 47 48SimpleNetwork::SimpleNetwork(const Params *p) 49 : Network(p) 50{ 51 m_buffer_size = p->buffer_size; 52 m_endpoint_bandwidth = p->endpoint_bandwidth; 53 m_adaptive_routing = p->adaptive_routing; 54 55 // Note: the parent Network Object constructor is called before the 56 // SimpleNetwork child constructor. Therefore, the member variables 57 // used below should already be initialized. 58 59 m_endpoint_switches.resize(m_nodes); 60 61 m_in_use.resize(m_virtual_networks); 62 m_ordered.resize(m_virtual_networks); 63 for (int i = 0; i < m_virtual_networks; i++) { 64 m_in_use[i] = false; 65 m_ordered[i] = false; 66 } 67 68 // Allocate to and from queues 69 m_toNetQueues.resize(m_nodes); 70 m_fromNetQueues.resize(m_nodes); 71 for (int node = 0; node < m_nodes; node++) { 72 m_toNetQueues[node].resize(m_virtual_networks); 73 m_fromNetQueues[node].resize(m_virtual_networks); 74 for (int j = 0; j < m_virtual_networks; j++) { 75 m_toNetQueues[node][j] = 76 new MessageBuffer(csprintf("toNet node %d j %d", node, j)); 77 m_fromNetQueues[node][j] = 78 new MessageBuffer(csprintf("fromNet node %d j %d", node, j)); 79 } 80 } 81} 82 83void 84SimpleNetwork::init() 85{ 86 Network::init(); 87 88 // The topology pointer should have already been initialized in 89 // the parent class network constructor. 90 assert(m_topology_ptr != NULL); 91 int number_of_switches = m_topology_ptr->numSwitches(); 92 for (int i = 0; i < number_of_switches; i++) { 93 m_switch_ptr_vector.push_back(new Switch(i, this)); 94 } 95 96 // false because this isn't a reconfiguration 97 m_topology_ptr->createLinks(this, false); 98} 99 100void 101SimpleNetwork::reset() 102{ 103 for (int node = 0; node < m_nodes; node++) { 104 for (int j = 0; j < m_virtual_networks; j++) { 105 m_toNetQueues[node][j]->clear(); 106 m_fromNetQueues[node][j]->clear(); 107 } 108 } 109 110 for(int i = 0; i < m_switch_ptr_vector.size(); i++){ 111 m_switch_ptr_vector[i]->clearBuffers(); 112 } 113} 114 115SimpleNetwork::~SimpleNetwork() 116{ 117 for (int i = 0; i < m_nodes; i++) { 118 deletePointers(m_toNetQueues[i]); 119 deletePointers(m_fromNetQueues[i]); 120 } 121 deletePointers(m_switch_ptr_vector); 122 deletePointers(m_buffers_to_free); 123 // delete m_topology_ptr; 124} 125 126// From a switch to an endpoint node 127void 128SimpleNetwork::makeOutLink(SwitchID src, NodeID dest, BasicLink* link, 129 LinkDirection direction, 130 const NetDest& routing_table_entry, 131 bool isReconfiguration) 132{ 133 assert(dest < m_nodes); 134 assert(src < m_switch_ptr_vector.size()); 135 assert(m_switch_ptr_vector[src] != NULL); 136 137 if (isReconfiguration) { 138 m_switch_ptr_vector[src]->reconfigureOutPort(routing_table_entry); 139 return; 140 } 141 142 SimpleExtLink *simple_link = safe_cast<SimpleExtLink*>(link); 143 144 m_switch_ptr_vector[src]->addOutPort(m_fromNetQueues[dest], 145 routing_table_entry, 146 simple_link->m_latency, 147 simple_link->m_bw_multiplier); 148 149 m_endpoint_switches[dest] = m_switch_ptr_vector[src]; 150} 151 152// From an endpoint node to a switch 153void 154SimpleNetwork::makeInLink(NodeID src, SwitchID dest, BasicLink* link, 155 LinkDirection direction, 156 const NetDest& routing_table_entry, 157 bool isReconfiguration) 158{ 159 assert(src < m_nodes); 160 if (isReconfiguration) { 161 // do nothing 162 return; 163 } 164 165 m_switch_ptr_vector[dest]->addInPort(m_toNetQueues[src]); 166} 167 168// From a switch to a switch 169void 170SimpleNetwork::makeInternalLink(SwitchID src, SwitchID dest, BasicLink* link, 171 LinkDirection direction, 172 const NetDest& routing_table_entry, 173 bool isReconfiguration) 174{ 175 if (isReconfiguration) { 176 m_switch_ptr_vector[src]->reconfigureOutPort(routing_table_entry); 177 return; 178 } 179 180 // Create a set of new MessageBuffers 181 std::vector<MessageBuffer*> queues; 182 for (int i = 0; i < m_virtual_networks; i++) { 183 // allocate a buffer 184 MessageBuffer* buffer_ptr = new MessageBuffer; 185 buffer_ptr->setOrdering(true); 186 if (m_buffer_size > 0) { 187 buffer_ptr->resize(m_buffer_size); 188 } 189 queues.push_back(buffer_ptr); 190 // remember to deallocate it 191 m_buffers_to_free.push_back(buffer_ptr); 192 } 193 // Connect it to the two switches 194 SimpleIntLink *simple_link = safe_cast<SimpleIntLink*>(link); 195 196 m_switch_ptr_vector[dest]->addInPort(queues); 197 m_switch_ptr_vector[src]->addOutPort(queues, routing_table_entry, 198 simple_link->m_latency, 199 simple_link->m_bw_multiplier); 200} 201 202void 203SimpleNetwork::checkNetworkAllocation(NodeID id, bool ordered, int network_num) 204{ 205 assert(id < m_nodes); 206 assert(network_num < m_virtual_networks); 207 208 if (ordered) { 209 m_ordered[network_num] = true; 210 } 211 m_in_use[network_num] = true; 212} 213 214MessageBuffer* 215SimpleNetwork::getToNetQueue(NodeID id, bool ordered, int network_num, 216 std::string vnet_type) 217{ 218 checkNetworkAllocation(id, ordered, network_num); 219 return m_toNetQueues[id][network_num]; 220} 221 222MessageBuffer* 223SimpleNetwork::getFromNetQueue(NodeID id, bool ordered, int network_num, 224 std::string vnet_type) 225{ 226 checkNetworkAllocation(id, ordered, network_num); 227 return m_fromNetQueues[id][network_num]; 228} 229 230const std::vector<Throttle*>* 231SimpleNetwork::getThrottles(NodeID id) const 232{ 233 assert(id >= 0); 234 assert(id < m_nodes); 235 assert(m_endpoint_switches[id] != NULL); 236 return m_endpoint_switches[id]->getThrottles(); 237} 238 239void 240SimpleNetwork::printStats(ostream& out) const 241{ 242 out << endl; 243 out << "Network Stats" << endl; 244 out << "-------------" << endl; 245 out << endl; 246 247 // 248 // Determine total counts before printing out each switch's stats 249 // 250 std::vector<uint64> total_msg_counts; 251 total_msg_counts.resize(MessageSizeType_NUM); 252 for (MessageSizeType type = MessageSizeType_FIRST; 253 type < MessageSizeType_NUM; 254 ++type) { 255 total_msg_counts[type] = 0; 256 } 257 258 for (int i = 0; i < m_switch_ptr_vector.size(); i++) { 259 const std::vector<Throttle*>* throttles = 260 m_switch_ptr_vector[i]->getThrottles(); 261 262 for (int p = 0; p < throttles->size(); p++) { 263 264 const std::vector<std::vector<int> >& message_counts = 265 ((*throttles)[p])->getCounters(); 266 267 for (MessageSizeType type = MessageSizeType_FIRST; 268 type < MessageSizeType_NUM; 269 ++type) { 270 271 const std::vector<int> &mct = message_counts[type]; 272 int sum = accumulate(mct.begin(), mct.end(), 0); 273 total_msg_counts[type] += uint64(sum); 274 } 275 } 276 } 277 uint64 total_msgs = 0; 278 uint64 total_bytes = 0; 279 for (MessageSizeType type = MessageSizeType_FIRST; 280 type < MessageSizeType_NUM; 281 ++type) { 282 283 if (total_msg_counts[type] > 0) { 284 out << "total_msg_count_" << type << ": " << total_msg_counts[type] 285 << " " << total_msg_counts[type] * 286 uint64(RubySystem::getNetwork()->MessageSizeType_to_int(type)) 287 << endl; 288 289 total_msgs += total_msg_counts[type]; 290 291 total_bytes += total_msg_counts[type] * 292 uint64(RubySystem::getNetwork()->MessageSizeType_to_int(type)); 293 294 } 295 } 296 297 out << "total_msgs: " << total_msgs 298 << " total_bytes: " << total_bytes << endl; 299 300 out << endl; 301 for (int i = 0; i < m_switch_ptr_vector.size(); i++) { 302 m_switch_ptr_vector[i]->printStats(out); 303 } 304 m_topology_ptr->printStats(out); 305} 306 307void 308SimpleNetwork::clearStats() 309{ 310 for (int i = 0; i < m_switch_ptr_vector.size(); i++) { 311 m_switch_ptr_vector[i]->clearStats(); 312 } 313 m_topology_ptr->clearStats(); 314} 315 316void 317SimpleNetwork::printConfig(ostream& out) const 318{ 319 out << endl; 320 out << "Network Configuration" << endl; 321 out << "---------------------" << endl; 322 out << "network: SIMPLE_NETWORK" << endl; 323 out << "topology: " << m_topology_ptr->getName() << endl; 324 out << endl; 325 326 for (int i = 0; i < m_virtual_networks; i++) { 327 out << "virtual_net_" << i << ": "; 328 if (m_in_use[i]) { 329 out << "active, "; 330 if (m_ordered[i]) { 331 out << "ordered" << endl; 332 } else { 333 out << "unordered" << endl; 334 } 335 } else { 336 out << "inactive" << endl; 337 } 338 } 339 out << endl; 340 341 for(int i = 0; i < m_switch_ptr_vector.size(); i++) { 342 m_switch_ptr_vector[i]->printConfig(out); 343 } 344 345 m_topology_ptr->printConfig(out); 346} 347 348void 349SimpleNetwork::print(ostream& out) const 350{ 351 out << "[SimpleNetwork]"; 352} 353 354 355SimpleNetwork * 356SimpleNetworkParams::create() 357{ 358 return new SimpleNetwork(this); 359} |