1 2/* 3 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 4 * All rights reserved. 5 * 6 * Redistribution and use in source and binary forms, with or without 7 * modification, are permitted provided that the following conditions are 8 * met: redistributions of source code must retain the above copyright --- 73 unchanged lines hidden (view full) --- 82 83 // Allocate to and from queues 84 m_toNetQueues.setSize(m_nodes); 85 m_fromNetQueues.setSize(m_nodes); 86 for (int node = 0; node < m_nodes; node++) { 87 m_toNetQueues[node].setSize(m_virtual_networks); 88 m_fromNetQueues[node].setSize(m_virtual_networks); 89 for (int j = 0; j < m_virtual_networks; j++) { |
90 m_toNetQueues[node][j] = new MessageBuffer( |
91 "toNet node "+int_to_string(node)+" j "+int_to_string(j)); |
92 m_fromNetQueues[node][j] = new MessageBuffer( |
93 "fromNet node "+int_to_string(node)+" j "+int_to_string(j)); 94 } 95 } 96 97 // Setup the network switches 98 // m_topology_ptr = new Topology(this, m_nodes); 99 m_topology_ptr->makeTopology(); 100 int number_of_switches = m_topology_ptr->numSwitches(); --- 165 unchanged lines hidden --- |