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; --- 13 unchanged lines hidden (view full) --- 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/* |
30 * Perfect switch, of course it is perfect and no latency or what so 31 * ever. Every cycle it is woke up and perform all the necessary 32 * routings that must be done. Note, this switch also has number of 33 * input ports/output ports and has a routing table as well. |
34 */ 35 |
36#ifndef __MEM_RUBY_NETWORK_SIMPLE_PERFECTSWITCH_HH__ 37#define __MEM_RUBY_NETWORK_SIMPLE_PERFECTSWITCH_HH__ |
38 39#include <iostream> 40 |
41#include "mem/gems_common/Vector.hh" 42#include "mem/ruby/common/Consumer.hh" |
43#include "mem/ruby/common/Global.hh" |
44#include "mem/ruby/system/NodeID.hh" 45 46class MessageBuffer; 47class NetDest; 48class SimpleNetwork; 49 |
50struct LinkOrder 51{ 52 int m_link; 53 int m_value; |
54}; 55 |
56class PerfectSwitch : public Consumer 57{ 58 public: 59 PerfectSwitch(SwitchID sid, SimpleNetwork* network_ptr); 60 ~PerfectSwitch(); |
61 |
62 void addInPort(const Vector<MessageBuffer*>& in); 63 void addOutPort(const Vector<MessageBuffer*>& out, 64 const NetDest& routing_table_entry); 65 void clearRoutingTables(); 66 void clearBuffers(); 67 void reconfigureOutPort(const NetDest& routing_table_entry); 68 int getInLinks() const { return m_in.size(); } 69 int getOutLinks() const { return m_out.size(); } |
70 |
71 void wakeup(); |
72 |
73 void printStats(std::ostream& out) const; 74 void clearStats(); 75 void printConfig(std::ostream& out) const; |
76 |
77 void print(std::ostream& out) const; |
78 |
79 private: 80 // Private copy constructor and assignment operator 81 PerfectSwitch(const PerfectSwitch& obj); 82 PerfectSwitch& operator=(const PerfectSwitch& obj); |
83 |
84 SwitchID m_switch_id; |
85 |
86 // vector of queues from the components 87 Vector<Vector<MessageBuffer*> > m_in; 88 Vector<Vector<MessageBuffer*> > m_out; 89 Vector<NetDest> m_routing_table; 90 Vector<LinkOrder> m_link_order; 91 int m_virtual_networks; 92 int m_round_robin_start; 93 int m_wakeups_wo_switch; 94 SimpleNetwork* m_network_ptr; |
95}; 96 |
97inline std::ostream& 98operator<<(std::ostream& out, const PerfectSwitch& obj) |
99{ |
100 obj.print(out); 101 out << std::flush; 102 return out; |
103} 104 |
105#endif // __MEM_RUBY_NETWORK_SIMPLE_PERFECTSWITCH_HH__ |