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
|
|
|
|
2009-05-11 19:38:45 +02:00
|
|
|
#include "mem/ruby/network/Network.hh"
|
2010-01-30 05:29:17 +01:00
|
|
|
#include "params/SimpleNetwork.hh"
|
2009-05-11 19:38:43 +02:00
|
|
|
|
|
|
|
class NetDest;
|
|
|
|
class MessageBuffer;
|
|
|
|
class Throttle;
|
|
|
|
class Switch;
|
|
|
|
|
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();
|
|
|
|
|
2011-04-29 02:18:14 +02:00
|
|
|
int getBufferSize() { return m_buffer_size; }
|
|
|
|
int getEndpointBandwidth() { return m_endpoint_bandwidth; }
|
|
|
|
bool getAdaptiveRouting() {return m_adaptive_routing; }
|
|
|
|
|
2013-09-06 23:21:35 +02:00
|
|
|
void collateStats();
|
|
|
|
void regStats();
|
2010-04-01 01:56:45 +02:00
|
|
|
|
2014-09-01 23:55:47 +02:00
|
|
|
// sets the queue requested
|
|
|
|
void setToNetQueue(NodeID id, bool ordered, int network_num,
|
|
|
|
std::string vnet_type, MessageBuffer *b);
|
|
|
|
void setFromNetQueue(NodeID id, bool ordered, int network_num,
|
|
|
|
std::string vnet_type, MessageBuffer *b);
|
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]; }
|
|
|
|
|
|
|
|
// Methods used by Topology to setup the network
|
2011-04-29 02:18:14 +02:00
|
|
|
void makeOutLink(SwitchID src, NodeID dest, BasicLink* link,
|
|
|
|
LinkDirection direction,
|
2013-06-29 04:36:37 +02:00
|
|
|
const NetDest& routing_table_entry);
|
|
|
|
void makeInLink(NodeID src, SwitchID dest, BasicLink* link,
|
2011-04-29 02:18:14 +02:00
|
|
|
LinkDirection direction,
|
2013-06-29 04:36:37 +02:00
|
|
|
const NetDest& routing_table_entry);
|
2011-04-29 02:18:14 +02:00
|
|
|
void makeInternalLink(SwitchID src, SwitchID dest, BasicLink* link,
|
|
|
|
LinkDirection direction,
|
2013-06-29 04:36:37 +02:00
|
|
|
const NetDest& routing_table_entry);
|
2010-04-01 01:56:45 +02:00
|
|
|
|
2010-04-02 20:20:32 +02:00
|
|
|
void print(std::ostream& out) const;
|
2010-04-01 01:56:45 +02:00
|
|
|
|
2012-10-16 00:51:57 +02:00
|
|
|
bool functionalRead(Packet *pkt);
|
|
|
|
uint32_t functionalWrite(Packet *pkt);
|
|
|
|
|
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);
|
|
|
|
void makeTopology();
|
|
|
|
|
|
|
|
// Private copy constructor and assignment operator
|
|
|
|
SimpleNetwork(const SimpleNetwork& obj);
|
|
|
|
SimpleNetwork& operator=(const SimpleNetwork& obj);
|
2014-09-01 23:55:47 +02:00
|
|
|
|
2013-09-06 23:21:29 +02:00
|
|
|
std::vector<Switch*> m_switches;
|
ruby: Expose MessageBuffers as SimObjects
Expose MessageBuffers from SLICC controllers as SimObjects that can be
manipulated in Python. This patch has numerous benefits:
1) First and foremost, it exposes MessageBuffers as SimObjects that can be
manipulated in Python code. This allows parameters to be set and checked in
Python code to avoid obfuscating parameters within protocol files. Further, now
as SimObjects, MessageBuffer parameters are printed to config output files as a
way to track parameters across simulations (e.g. buffer sizes)
2) Cleans up special-case code for responseFromMemory buffers, and aligns their
instantiation and use with mandatoryQueue buffers. These two special buffers
are the only MessageBuffers that are exposed to components outside of SLICC
controllers, and they're both slave ends of these buffers. They should be
exposed outside of SLICC in the same way, and this patch does it.
3) Distinguishes buffer-specific parameters from buffer-to-network parameters.
Specifically, buffer size, randomization, ordering, recycle latency, and ports
are all specific to a MessageBuffer, while the virtual network ID and type are
intrinsics of how the buffer is connected to network ports. The former are
specified in the Python object, while the latter are specified in the
controller *.sm files. Unlike buffer-specific parameters, which may need to
change depending on the simulated system structure, buffer-to-network
parameters can be specified statically for most or all different simulated
systems.
2015-08-14 07:19:44 +02:00
|
|
|
std::vector<MessageBuffer*> m_int_link_buffers;
|
|
|
|
int m_num_connected_buffers;
|
2010-06-11 08:17:07 +02:00
|
|
|
std::vector<Switch*> m_endpoint_switches;
|
2011-04-29 02:18:14 +02:00
|
|
|
|
|
|
|
int m_buffer_size;
|
|
|
|
int m_endpoint_bandwidth;
|
|
|
|
bool m_adaptive_routing;
|
2013-09-06 23:21:35 +02:00
|
|
|
|
|
|
|
//Statistical variables
|
2013-09-11 22:33:27 +02:00
|
|
|
Stats::Formula m_msg_counts[MessageSizeType_NUM];
|
|
|
|
Stats::Formula m_msg_bytes[MessageSizeType_NUM];
|
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__
|