GARNET: adding a fault model for resilient on-chip network research.
[gem5.git] / src / mem / ruby / network / garnet / BaseGarnetNetwork.cc
1 /*
2 * Copyright (c) 2008 Princeton University
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 * Authors: Niket Agarwal
29 */
30
31 #include "mem/ruby/buffers/MessageBuffer.hh"
32 #include "mem/ruby/network/BasicLink.hh"
33 #include "mem/ruby/network/Topology.hh"
34 #include "mem/ruby/network/garnet/BaseGarnetNetwork.hh"
35
36 BaseGarnetNetwork::BaseGarnetNetwork(const Params *p)
37 : Network(p)
38 {
39 m_ni_flit_size = p->ni_flit_size;
40 m_vcs_per_vnet = p->vcs_per_vnet;
41 m_enable_fault_model = p->enable_fault_model;
42 if (m_enable_fault_model)
43 fault_model = p->fault_model;
44
45 m_ruby_start = 0;
46 m_flits_received = 0;
47 m_flits_injected = 0;
48 m_network_latency = 0.0;
49 m_queueing_latency = 0.0;
50
51 // Currently Garnet only supports uniform bandwidth for all
52 // links and network interfaces.
53 for (std::vector<BasicExtLink*>::const_iterator i =
54 m_topology_ptr->params()->ext_links.begin();
55 i != m_topology_ptr->params()->ext_links.end(); ++i) {
56 BasicExtLink* ext_link = (*i);
57 if (ext_link->params()->bandwidth_factor != m_ni_flit_size) {
58 fatal("Garnet only supports uniform bw across all links and NIs\n");
59 }
60 }
61 for (std::vector<BasicIntLink*>::const_iterator i =
62 m_topology_ptr->params()->int_links.begin();
63 i != m_topology_ptr->params()->int_links.end(); ++i) {
64 BasicIntLink* int_link = (*i);
65 if (int_link->params()->bandwidth_factor != m_ni_flit_size) {
66 fatal("Garnet only supports uniform bw across all links and NIs\n");
67 }
68 }
69
70 // Allocate to and from queues
71
72 // Queues that are getting messages from protocol
73 m_toNetQueues.resize(m_nodes);
74
75 // Queues that are feeding the protocol
76 m_fromNetQueues.resize(m_nodes);
77
78 m_in_use.resize(m_virtual_networks);
79 m_ordered.resize(m_virtual_networks);
80 for (int i = 0; i < m_virtual_networks; i++) {
81 m_in_use[i] = false;
82 m_ordered[i] = false;
83 }
84
85 for (int node = 0; node < m_nodes; node++) {
86 // Setting number of virtual message buffers per Network Queue
87 m_toNetQueues[node].resize(m_virtual_networks);
88 m_fromNetQueues[node].resize(m_virtual_networks);
89
90 // Instantiating the Message Buffers that
91 // interact with the coherence protocol
92 for (int j = 0; j < m_virtual_networks; j++) {
93 m_toNetQueues[node][j] = new MessageBuffer();
94 m_fromNetQueues[node][j] = new MessageBuffer();
95 }
96 }
97 }
98
99 void
100 BaseGarnetNetwork::init()
101 {
102 Network::init();
103 }