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#ifndef __MEM_RUBY_NETWORK_SIMPLE_SIMPLENETWORK_HH__
30#define __MEM_RUBY_NETWORK_SIMPLE_SIMPLENETWORK_HH__
31
32#include <iostream>
33#include <vector>
34
35#include "mem/ruby/common/Global.hh"
36#include "mem/ruby/network/Network.hh"
37#include "params/SimpleNetwork.hh"
38#include "sim/sim_object.hh"
39
40class NetDest;
41class MessageBuffer;
42class Throttle;
43class Switch;
44class Topology;
45
46class SimpleNetwork : public Network
47{
48 public:
49 typedef SimpleNetworkParams Params;
50 SimpleNetwork(const Params *p);
51 ~SimpleNetwork();
52
53 void init();
54
55 int getBufferSize() { return m_buffer_size; }
56 int getEndpointBandwidth() { return m_endpoint_bandwidth; }
57 bool getAdaptiveRouting() {return m_adaptive_routing; }
58
59 void collateStats();
60 void regStats();
61
62 // returns the queue requested for the given component
63 MessageBuffer* getToNetQueue(NodeID id, bool ordered, int network_num, std::string vnet_type);
64 MessageBuffer* getFromNetQueue(NodeID id, bool ordered, int network_num, std::string vnet_type);
65 virtual const std::vector<Throttle*>* getThrottles(NodeID id) const;
66
67 bool isVNetOrdered(int vnet) { return m_ordered[vnet]; }
68 bool validVirtualNetwork(int vnet) { return m_in_use[vnet]; }
69
70 int getNumNodes() {return m_nodes; }
71
72 // Methods used by Topology to setup the network
73 void makeOutLink(SwitchID src, NodeID dest, BasicLink* link,
74 LinkDirection direction,
75 const NetDest& routing_table_entry);
76 void makeInLink(NodeID src, SwitchID dest, BasicLink* link,
77 LinkDirection direction,
78 const NetDest& routing_table_entry);
79 void makeInternalLink(SwitchID src, SwitchID dest, BasicLink* link,
80 LinkDirection direction,
81 const NetDest& routing_table_entry);
82
83 void print(std::ostream& out) const;
84
85 bool functionalRead(Packet *pkt);
86 uint32_t functionalWrite(Packet *pkt);
87
88 private:
89 void checkNetworkAllocation(NodeID id, bool ordered, int network_num);
90 void addLink(SwitchID src, SwitchID dest, int link_latency);
91 void makeLink(SwitchID src, SwitchID dest,
92 const NetDest& routing_table_entry, int link_latency);
93 void makeTopology();
94
95 // Private copy constructor and assignment operator
96 SimpleNetwork(const SimpleNetwork& obj);
97 SimpleNetwork& operator=(const SimpleNetwork& obj);
98
99 // vector of queues from the components
100 std::vector<std::vector<MessageBuffer*> > m_toNetQueues;
101 std::vector<std::vector<MessageBuffer*> > m_fromNetQueues;
102
103 std::vector<bool> m_in_use;
104 std::vector<bool> m_ordered;
105 std::vector<Switch*> m_switches;
106 std::vector<MessageBuffer*> m_buffers_to_free;
107 std::vector<Switch*> m_endpoint_switches;
108
109 int m_buffer_size;
110 int m_endpoint_bandwidth;
111 bool m_adaptive_routing;
112
113 //Statistical variables
| 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#ifndef __MEM_RUBY_NETWORK_SIMPLE_SIMPLENETWORK_HH__
30#define __MEM_RUBY_NETWORK_SIMPLE_SIMPLENETWORK_HH__
31
32#include <iostream>
33#include <vector>
34
35#include "mem/ruby/common/Global.hh"
36#include "mem/ruby/network/Network.hh"
37#include "params/SimpleNetwork.hh"
38#include "sim/sim_object.hh"
39
40class NetDest;
41class MessageBuffer;
42class Throttle;
43class Switch;
44class Topology;
45
46class SimpleNetwork : public Network
47{
48 public:
49 typedef SimpleNetworkParams Params;
50 SimpleNetwork(const Params *p);
51 ~SimpleNetwork();
52
53 void init();
54
55 int getBufferSize() { return m_buffer_size; }
56 int getEndpointBandwidth() { return m_endpoint_bandwidth; }
57 bool getAdaptiveRouting() {return m_adaptive_routing; }
58
59 void collateStats();
60 void regStats();
61
62 // returns the queue requested for the given component
63 MessageBuffer* getToNetQueue(NodeID id, bool ordered, int network_num, std::string vnet_type);
64 MessageBuffer* getFromNetQueue(NodeID id, bool ordered, int network_num, std::string vnet_type);
65 virtual const std::vector<Throttle*>* getThrottles(NodeID id) const;
66
67 bool isVNetOrdered(int vnet) { return m_ordered[vnet]; }
68 bool validVirtualNetwork(int vnet) { return m_in_use[vnet]; }
69
70 int getNumNodes() {return m_nodes; }
71
72 // Methods used by Topology to setup the network
73 void makeOutLink(SwitchID src, NodeID dest, BasicLink* link,
74 LinkDirection direction,
75 const NetDest& routing_table_entry);
76 void makeInLink(NodeID src, SwitchID dest, BasicLink* link,
77 LinkDirection direction,
78 const NetDest& routing_table_entry);
79 void makeInternalLink(SwitchID src, SwitchID dest, BasicLink* link,
80 LinkDirection direction,
81 const NetDest& routing_table_entry);
82
83 void print(std::ostream& out) const;
84
85 bool functionalRead(Packet *pkt);
86 uint32_t functionalWrite(Packet *pkt);
87
88 private:
89 void checkNetworkAllocation(NodeID id, bool ordered, int network_num);
90 void addLink(SwitchID src, SwitchID dest, int link_latency);
91 void makeLink(SwitchID src, SwitchID dest,
92 const NetDest& routing_table_entry, int link_latency);
93 void makeTopology();
94
95 // Private copy constructor and assignment operator
96 SimpleNetwork(const SimpleNetwork& obj);
97 SimpleNetwork& operator=(const SimpleNetwork& obj);
98
99 // vector of queues from the components
100 std::vector<std::vector<MessageBuffer*> > m_toNetQueues;
101 std::vector<std::vector<MessageBuffer*> > m_fromNetQueues;
102
103 std::vector<bool> m_in_use;
104 std::vector<bool> m_ordered;
105 std::vector<Switch*> m_switches;
106 std::vector<MessageBuffer*> m_buffers_to_free;
107 std::vector<Switch*> m_endpoint_switches;
108
109 int m_buffer_size;
110 int m_endpoint_bandwidth;
111 bool m_adaptive_routing;
112
113 //Statistical variables
|