c1cf55c738
The previous changeset (9863:9483739f83ee) used STL vector containers to dynamically allocate stats in the Ruby SimpleNetwork, Switch and Throttle. For gcc versions before at least 4.6.3, this causes the standard vector allocator to call Stats copy constructors (a no-no, since stats should be allocated in the body of each SimObject instance). Since the size of these stats arrays is known at compile time (NOTE: after code generation), this patch changes their allocation to be static rather than using an STL vector.
127 lines
4.7 KiB
C++
127 lines
4.7 KiB
C++
/*
|
|
* 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.
|
|
*/
|
|
|
|
#ifndef __MEM_RUBY_NETWORK_SIMPLE_SIMPLENETWORK_HH__
|
|
#define __MEM_RUBY_NETWORK_SIMPLE_SIMPLENETWORK_HH__
|
|
|
|
#include <iostream>
|
|
#include <vector>
|
|
|
|
#include "mem/ruby/common/Global.hh"
|
|
#include "mem/ruby/network/Network.hh"
|
|
#include "params/SimpleNetwork.hh"
|
|
#include "sim/sim_object.hh"
|
|
|
|
class NetDest;
|
|
class MessageBuffer;
|
|
class Throttle;
|
|
class Switch;
|
|
class Topology;
|
|
|
|
class SimpleNetwork : public Network
|
|
{
|
|
public:
|
|
typedef SimpleNetworkParams Params;
|
|
SimpleNetwork(const Params *p);
|
|
~SimpleNetwork();
|
|
|
|
void init();
|
|
|
|
int getBufferSize() { return m_buffer_size; }
|
|
int getEndpointBandwidth() { return m_endpoint_bandwidth; }
|
|
bool getAdaptiveRouting() {return m_adaptive_routing; }
|
|
|
|
void collateStats();
|
|
void regStats();
|
|
|
|
// returns the queue requested for the given component
|
|
MessageBuffer* getToNetQueue(NodeID id, bool ordered, int network_num, std::string vnet_type);
|
|
MessageBuffer* getFromNetQueue(NodeID id, bool ordered, int network_num, std::string vnet_type);
|
|
virtual const std::vector<Throttle*>* getThrottles(NodeID id) const;
|
|
|
|
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, BasicLink* link,
|
|
LinkDirection direction,
|
|
const NetDest& routing_table_entry);
|
|
void makeInLink(NodeID src, SwitchID dest, BasicLink* link,
|
|
LinkDirection direction,
|
|
const NetDest& routing_table_entry);
|
|
void makeInternalLink(SwitchID src, SwitchID dest, BasicLink* link,
|
|
LinkDirection direction,
|
|
const NetDest& routing_table_entry);
|
|
|
|
void print(std::ostream& out) const;
|
|
|
|
bool functionalRead(Packet *pkt);
|
|
uint32_t functionalWrite(Packet *pkt);
|
|
|
|
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);
|
|
|
|
// vector of queues from the components
|
|
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_switches;
|
|
std::vector<MessageBuffer*> m_buffers_to_free;
|
|
std::vector<Switch*> m_endpoint_switches;
|
|
|
|
int m_buffer_size;
|
|
int m_endpoint_bandwidth;
|
|
bool m_adaptive_routing;
|
|
|
|
//Statistical variables
|
|
Stats::Formula m_msg_counts[MessageSizeType_NUM];
|
|
Stats::Formula m_msg_bytes[MessageSizeType_NUM];
|
|
};
|
|
|
|
inline std::ostream&
|
|
operator<<(std::ostream& out, const SimpleNetwork& obj)
|
|
{
|
|
obj.print(out);
|
|
out << std::flush;
|
|
return out;
|
|
}
|
|
|
|
#endif // __MEM_RUBY_NETWORK_SIMPLE_SIMPLENETWORK_HH__
|