2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
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.
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.
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.
36 #ifndef __MEM_RUBY_NETWORK_SIMPLE_PERFECTSWITCH_HH__
37 #define __MEM_RUBY_NETWORK_SIMPLE_PERFECTSWITCH_HH__
43 #include "mem/ruby/common/Consumer.hh"
56 bool operator<(const LinkOrder& l1, const LinkOrder& l2);
58 class PerfectSwitch : public Consumer
61 PerfectSwitch(SwitchID sid, Switch *, uint32_t);
65 { return csprintf("PerfectSwitch-%i", m_switch_id); }
67 void init(SimpleNetwork *);
68 void addInPort(const std::map<int, MessageBuffer*>& in);
69 void addOutPort(const std::map<int, MessageBuffer*>& out,
70 const NetDest& routing_table_entry);
72 int getInLinks() const { return m_in.size(); }
73 int getOutLinks() const { return m_out.size(); }
76 void storeEventInfo(int info);
80 void print(std::ostream& out) const;
83 // Private copy constructor and assignment operator
84 PerfectSwitch(const PerfectSwitch& obj);
85 PerfectSwitch& operator=(const PerfectSwitch& obj);
89 // vector of queues from the components
90 std::vector<std::map<int, MessageBuffer*> > m_in;
91 std::vector<std::map<int, MessageBuffer*> > m_out;
93 std::vector<NetDest> m_routing_table;
94 std::vector<LinkOrder> m_link_order;
96 uint32_t m_virtual_networks;
97 int m_round_robin_start;
98 int m_wakeups_wo_switch;
100 SimpleNetwork* m_network_ptr;
101 std::vector<int> m_pending_message_count;
105 operator<<(std::ostream& out, const PerfectSwitch& obj)
112 #endif // __MEM_RUBY_NETWORK_SIMPLE_PERFECTSWITCH_HH__