PerfectSwitch.hh revision 11049:dfb0aa3f0649 
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/*
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#include <string>
41#include <vector>
42
43#include "mem/ruby/common/Consumer.hh"
44
45class MessageBuffer;
46class NetDest;
47class SimpleNetwork;
48class Switch;
49
50struct LinkOrder
51{
52    int m_link;
53    int m_value;
54};
55
56bool operator<(const LinkOrder& l1, const LinkOrder& l2);
57
58class PerfectSwitch : public Consumer
59{
60  public:
61    PerfectSwitch(SwitchID sid, Switch *, uint32_t);
62    ~PerfectSwitch();
63
64    std::string name()
65    { return csprintf("PerfectSwitch-%i", m_switch_id); }
66
67    void init(SimpleNetwork *);
68    void addInPort(const std::vector<MessageBuffer*>& in);
69    void addOutPort(const std::vector<MessageBuffer*>& out,
70                    const NetDest& routing_table_entry);
71
72    int getInLinks() const { return m_in.size(); }
73    int getOutLinks() const { return m_out.size(); }
74
75    void wakeup();
76    void storeEventInfo(int info);
77
78    void clearStats();
79    void collateStats();
80    void print(std::ostream& out) const;
81
82  private:
83    // Private copy constructor and assignment operator
84    PerfectSwitch(const PerfectSwitch& obj);
85    PerfectSwitch& operator=(const PerfectSwitch& obj);
86
87    void operateVnet(int vnet);
88
89    SwitchID m_switch_id;
90
91    // vector of queues from the components
92    std::vector<std::vector<MessageBuffer*> > m_in;
93    std::vector<std::vector<MessageBuffer*> > m_out;
94
95    std::vector<NetDest> m_routing_table;
96    std::vector<LinkOrder> m_link_order;
97
98    uint32_t m_virtual_networks;
99    int m_round_robin_start;
100    int m_wakeups_wo_switch;
101
102    SimpleNetwork* m_network_ptr;
103    std::vector<int> m_pending_message_count;
104};
105
106inline std::ostream&
107operator<<(std::ostream& out, const PerfectSwitch& obj)
108{
109    obj.print(out);
110    out << std::flush;
111    return out;
112}
113
114#endif // __MEM_RUBY_NETWORK_SIMPLE_PERFECTSWITCH_HH__
115