2009-05-11 19:38:43 +02:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are
|
|
|
|
* met: redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer;
|
|
|
|
* redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution;
|
|
|
|
* neither the name of the copyright holders nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived from
|
|
|
|
* this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
2010-04-01 01:56:45 +02:00
|
|
|
* Perfect switch, of course it is perfect and no latency or what so
|
|
|
|
* ever. Every cycle it is woke up and perform all the necessary
|
|
|
|
* routings that must be done. Note, this switch also has number of
|
|
|
|
* input ports/output ports and has a routing table as well.
|
2009-05-11 19:38:43 +02:00
|
|
|
*/
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
#ifndef __MEM_RUBY_NETWORK_SIMPLE_PERFECTSWITCH_HH__
|
|
|
|
#define __MEM_RUBY_NETWORK_SIMPLE_PERFECTSWITCH_HH__
|
2009-05-11 19:38:43 +02:00
|
|
|
|
2010-03-11 03:33:11 +01:00
|
|
|
#include <iostream>
|
|
|
|
|
2009-05-11 19:38:45 +02:00
|
|
|
#include "mem/gems_common/Vector.hh"
|
|
|
|
#include "mem/ruby/common/Consumer.hh"
|
2010-04-01 01:56:45 +02:00
|
|
|
#include "mem/ruby/common/Global.hh"
|
2009-05-11 19:38:45 +02:00
|
|
|
#include "mem/ruby/system/NodeID.hh"
|
2009-05-11 19:38:43 +02:00
|
|
|
|
|
|
|
class MessageBuffer;
|
|
|
|
class NetDest;
|
|
|
|
class SimpleNetwork;
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
struct LinkOrder
|
|
|
|
{
|
|
|
|
int m_link;
|
|
|
|
int m_value;
|
2009-05-11 19:38:43 +02:00
|
|
|
};
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
class PerfectSwitch : public Consumer
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
PerfectSwitch(SwitchID sid, SimpleNetwork* network_ptr);
|
|
|
|
~PerfectSwitch();
|
|
|
|
|
|
|
|
void addInPort(const Vector<MessageBuffer*>& in);
|
|
|
|
void addOutPort(const Vector<MessageBuffer*>& out,
|
|
|
|
const NetDest& routing_table_entry);
|
|
|
|
void clearRoutingTables();
|
|
|
|
void clearBuffers();
|
|
|
|
void reconfigureOutPort(const NetDest& routing_table_entry);
|
|
|
|
int getInLinks() const { return m_in.size(); }
|
|
|
|
int getOutLinks() const { return m_out.size(); }
|
|
|
|
|
|
|
|
void wakeup();
|
|
|
|
|
|
|
|
void printStats(std::ostream& out) const;
|
|
|
|
void clearStats();
|
|
|
|
void printConfig(std::ostream& out) const;
|
|
|
|
|
|
|
|
void print(std::ostream& out) const;
|
|
|
|
|
|
|
|
private:
|
|
|
|
// Private copy constructor and assignment operator
|
|
|
|
PerfectSwitch(const PerfectSwitch& obj);
|
|
|
|
PerfectSwitch& operator=(const PerfectSwitch& obj);
|
|
|
|
|
|
|
|
SwitchID m_switch_id;
|
|
|
|
|
|
|
|
// vector of queues from the components
|
|
|
|
Vector<Vector<MessageBuffer*> > m_in;
|
|
|
|
Vector<Vector<MessageBuffer*> > m_out;
|
|
|
|
Vector<NetDest> m_routing_table;
|
|
|
|
Vector<LinkOrder> m_link_order;
|
|
|
|
int m_virtual_networks;
|
|
|
|
int m_round_robin_start;
|
|
|
|
int m_wakeups_wo_switch;
|
|
|
|
SimpleNetwork* m_network_ptr;
|
2009-05-11 19:38:43 +02:00
|
|
|
};
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
inline std::ostream&
|
|
|
|
operator<<(std::ostream& out, const PerfectSwitch& obj)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-04-01 01:56:45 +02:00
|
|
|
obj.print(out);
|
|
|
|
out << std::flush;
|
|
|
|
return out;
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
#endif // __MEM_RUBY_NETWORK_SIMPLE_PERFECTSWITCH_HH__
|