5ffc165939
This patch adds support to different entities in the ruby memory system for more reliable functional read/write accesses. Only the simple network has been augmented as of now. Later on Garnet will also support functional accesses. The patch adds functional access code to all the different types of messages that protocols can send around. These messages are functionally accessed by going through the buffers maintained by the network entities. The patch also rectifies some of the bugs found in coherence protocols while testing the patch. With this patch applied, functional writes always succeed. But functional reads can still fail.
131 lines
5 KiB
C++
131 lines
5 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.
|
|
*/
|
|
|
|
/*
|
|
* The Network class is the base class for classes that implement the
|
|
* interconnection network between components (processor/cache
|
|
* components and memory/directory components). The interconnection
|
|
* network as described here is not a physical network, but a
|
|
* programming concept used to implement all communication between
|
|
* components. Thus parts of this 'network' will model the on-chip
|
|
* connections between cache controllers and directory controllers as
|
|
* well as the links between chip and network switches.
|
|
*/
|
|
|
|
#ifndef __MEM_RUBY_NETWORK_NETWORK_HH__
|
|
#define __MEM_RUBY_NETWORK_NETWORK_HH__
|
|
|
|
#include <iostream>
|
|
#include <string>
|
|
#include <vector>
|
|
|
|
#include "mem/packet.hh"
|
|
#include "mem/protocol/LinkDirection.hh"
|
|
#include "mem/protocol/MessageSizeType.hh"
|
|
#include "mem/ruby/common/TypeDefines.hh"
|
|
#include "params/RubyNetwork.hh"
|
|
#include "sim/sim_object.hh"
|
|
|
|
class NetDest;
|
|
class MessageBuffer;
|
|
class Throttle;
|
|
class Topology;
|
|
|
|
class Network : public SimObject
|
|
{
|
|
public:
|
|
typedef RubyNetworkParams Params;
|
|
Network(const Params *p);
|
|
virtual ~Network() {}
|
|
|
|
virtual void init();
|
|
|
|
static int getNumberOfVirtualNetworks() { return m_virtual_networks; }
|
|
static uint32_t MessageSizeType_to_int(MessageSizeType size_type);
|
|
|
|
// returns the queue requested for the given component
|
|
virtual MessageBuffer* getToNetQueue(NodeID id, bool ordered,
|
|
int netNumber, std::string vnet_type) = 0;
|
|
virtual MessageBuffer* getFromNetQueue(NodeID id, bool ordered,
|
|
int netNumber, std::string vnet_type) = 0;
|
|
virtual const std::vector<Throttle*>* getThrottles(NodeID id) const;
|
|
virtual int getNumNodes() {return 1;}
|
|
|
|
virtual void makeOutLink(SwitchID src, NodeID dest, BasicLink* link,
|
|
LinkDirection direction,
|
|
const NetDest& routing_table_entry,
|
|
bool isReconfiguration) = 0;
|
|
virtual void makeInLink(NodeID src, SwitchID dest, BasicLink* link,
|
|
LinkDirection direction,
|
|
const NetDest& routing_table_entry,
|
|
bool isReconfiguration) = 0;
|
|
virtual void makeInternalLink(SwitchID src, SwitchID dest, BasicLink* link,
|
|
LinkDirection direction,
|
|
const NetDest& routing_table_entry,
|
|
bool isReconfiguration) = 0;
|
|
|
|
virtual void reset() = 0;
|
|
|
|
virtual void printStats(std::ostream& out) const = 0;
|
|
virtual void clearStats() = 0;
|
|
virtual void print(std::ostream& out) const = 0;
|
|
|
|
/*
|
|
* Virtual functions for functionally reading and writing packets in
|
|
* the network. Each network needs to implement these for functional
|
|
* accesses to work correctly.
|
|
*/
|
|
virtual bool functionalRead(Packet *pkt)
|
|
{ fatal("Functional read not implemented.\n"); }
|
|
virtual uint32_t functionalWrite(Packet *pkt)
|
|
{ fatal("Functional write not implemented.\n"); }
|
|
|
|
protected:
|
|
// Private copy constructor and assignment operator
|
|
Network(const Network& obj);
|
|
Network& operator=(const Network& obj);
|
|
|
|
protected:
|
|
const std::string m_name;
|
|
int m_nodes;
|
|
static uint32_t m_virtual_networks;
|
|
Topology* m_topology_ptr;
|
|
static uint32_t m_control_msg_size;
|
|
static uint32_t m_data_msg_size;
|
|
};
|
|
|
|
inline std::ostream&
|
|
operator<<(std::ostream& out, const Network& obj)
|
|
{
|
|
obj.print(out);
|
|
out << std::flush;
|
|
return out;
|
|
}
|
|
|
|
#endif // __MEM_RUBY_NETWORK_NETWORK_HH__
|