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
|
|
|
#ifndef __MEM_RUBY_NETWORK_SIMPLE_SIMPLENETWORK_HH__
|
|
|
|
#define __MEM_RUBY_NETWORK_SIMPLE_SIMPLENETWORK_HH__
|
2009-05-11 19:38:43 +02:00
|
|
|
|
2010-04-02 20:20:32 +02:00
|
|
|
#include <iostream>
|
2010-06-11 08:17:07 +02:00
|
|
|
#include <vector>
|
2010-04-02 20:20:32 +02:00
|
|
|
|
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/network/Network.hh"
|
|
|
|
#include "mem/ruby/system/NodeID.hh"
|
2010-01-30 05:29:17 +01:00
|
|
|
#include "params/SimpleNetwork.hh"
|
2010-04-01 01:56:45 +02:00
|
|
|
#include "sim/sim_object.hh"
|
2009-05-11 19:38:43 +02:00
|
|
|
|
|
|
|
class NetDest;
|
|
|
|
class MessageBuffer;
|
|
|
|
class Throttle;
|
|
|
|
class Switch;
|
|
|
|
class Topology;
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
class SimpleNetwork : public Network
|
|
|
|
{
|
|
|
|
public:
|
2010-01-30 05:29:17 +01:00
|
|
|
typedef SimpleNetworkParams Params;
|
|
|
|
SimpleNetwork(const Params *p);
|
2010-04-01 01:56:45 +02:00
|
|
|
~SimpleNetwork();
|
|
|
|
|
|
|
|
void init();
|
|
|
|
|
2010-04-02 20:20:32 +02:00
|
|
|
void printStats(std::ostream& out) const;
|
2010-04-01 01:56:45 +02:00
|
|
|
void clearStats();
|
2010-04-02 20:20:32 +02:00
|
|
|
void printConfig(std::ostream& out) const;
|
2010-04-01 01:56:45 +02:00
|
|
|
|
|
|
|
void reset();
|
|
|
|
|
|
|
|
// returns the queue requested for the given component
|
|
|
|
MessageBuffer* getToNetQueue(NodeID id, bool ordered, int network_num);
|
|
|
|
MessageBuffer* getFromNetQueue(NodeID id, bool ordered, int network_num);
|
2010-06-11 08:17:07 +02:00
|
|
|
virtual const std::vector<Throttle*>* getThrottles(NodeID id) const;
|
2010-04-01 01:56:45 +02:00
|
|
|
|
|
|
|
bool isVNetOrdered(int vnet) { return m_ordered[vnet]; }
|
|
|
|
bool validVirtualNetwork(int vnet) { return m_in_use[vnet]; }
|
|
|
|
|
|
|
|
int getNumNodes() {return m_nodes; }
|
|
|
|
|
|
|
|
// Methods used by Topology to setup the network
|
|
|
|
void makeOutLink(SwitchID src, NodeID dest,
|
|
|
|
const NetDest& routing_table_entry, int link_latency, int link_weight,
|
|
|
|
int bw_multiplier, bool isReconfiguration);
|
|
|
|
void makeInLink(SwitchID src, NodeID dest,
|
|
|
|
const NetDest& routing_table_entry, int link_latency,
|
|
|
|
int bw_multiplier, bool isReconfiguration);
|
|
|
|
void makeInternalLink(SwitchID src, NodeID dest,
|
|
|
|
const NetDest& routing_table_entry, int link_latency, int link_weight,
|
|
|
|
int bw_multiplier, bool isReconfiguration);
|
|
|
|
|
2010-04-02 20:20:32 +02:00
|
|
|
void print(std::ostream& out) const;
|
2010-04-01 01:56:45 +02:00
|
|
|
|
|
|
|
private:
|
|
|
|
void checkNetworkAllocation(NodeID id, bool ordered, int network_num);
|
|
|
|
void addLink(SwitchID src, SwitchID dest, int link_latency);
|
|
|
|
void makeLink(SwitchID src, SwitchID dest,
|
|
|
|
const NetDest& routing_table_entry, int link_latency);
|
|
|
|
SwitchID createSwitch();
|
|
|
|
void makeTopology();
|
|
|
|
void linkTopology();
|
|
|
|
|
|
|
|
// Private copy constructor and assignment operator
|
|
|
|
SimpleNetwork(const SimpleNetwork& obj);
|
|
|
|
SimpleNetwork& operator=(const SimpleNetwork& obj);
|
|
|
|
|
|
|
|
// vector of queues from the components
|
2010-06-11 08:17:07 +02:00
|
|
|
std::vector<std::vector<MessageBuffer*> > m_toNetQueues;
|
|
|
|
std::vector<std::vector<MessageBuffer*> > m_fromNetQueues;
|
|
|
|
|
|
|
|
std::vector<bool> m_in_use;
|
|
|
|
std::vector<bool> m_ordered;
|
|
|
|
std::vector<Switch*> m_switch_ptr_vector;
|
|
|
|
std::vector<MessageBuffer*> m_buffers_to_free;
|
|
|
|
std::vector<Switch*> m_endpoint_switches;
|
2009-05-11 19:38:43 +02:00
|
|
|
};
|
|
|
|
|
2010-04-02 20:20:32 +02:00
|
|
|
inline std::ostream&
|
|
|
|
operator<<(std::ostream& out, const SimpleNetwork& obj)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-04-01 01:56:45 +02:00
|
|
|
obj.print(out);
|
2010-04-02 20:20:32 +02:00
|
|
|
out << std::flush;
|
2010-04-01 01:56:45 +02:00
|
|
|
return out;
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
#endif // __MEM_RUBY_NETWORK_SIMPLE_SIMPLENETWORK_HH__
|