summaryrefslogtreecommitdiff
path: root/src/mem/ruby/network/simple/Topology.hh
diff options
context:
space:
mode:
Diffstat (limited to 'src/mem/ruby/network/simple/Topology.hh')
-rw-r--r--src/mem/ruby/network/simple/Topology.hh148
1 files changed, 0 insertions, 148 deletions
diff --git a/src/mem/ruby/network/simple/Topology.hh b/src/mem/ruby/network/simple/Topology.hh
deleted file mode 100644
index c92848d8f..000000000
--- a/src/mem/ruby/network/simple/Topology.hh
+++ /dev/null
@@ -1,148 +0,0 @@
-/*
- * 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 topology here is configurable; it can be a hierachical (default
- * one) or a 2D torus or a 2D torus with half switches killed. I think
- * all input port has a one-input-one-output switch connected just to
- * control and bandwidth, since we don't control bandwidth on input
- * ports. Basically, the class has a vector of nodes and edges. First
- * 2*m_nodes elements in the node vector are input and output
- * ports. Edges are represented in two vectors of src and dest
- * nodes. All edges have latency.
- */
-
-#ifndef __MEM_RUBY_NETWORK_SIMPLE_TOPOLOGY_HH__
-#define __MEM_RUBY_NETWORK_SIMPLE_TOPOLOGY_HH__
-
-#include <iostream>
-#include <string>
-#include <vector>
-
-#include "mem/ruby/common/Global.hh"
-#include "mem/ruby/system/NodeID.hh"
-#include "params/ExtLink.hh"
-#include "params/IntLink.hh"
-#include "params/Link.hh"
-#include "params/Topology.hh"
-#include "sim/sim_object.hh"
-
-class Network;
-class NetDest;
-
-typedef std::vector<std::vector<int> > Matrix;
-
-class Link : public SimObject
-{
- public:
- typedef LinkParams Params;
- Link(const Params *p) : SimObject(p) {}
- const Params *params() const { return (const Params *)_params; }
-};
-
-class ExtLink : public Link
-{
- public:
- typedef ExtLinkParams Params;
- ExtLink(const Params *p) : Link(p) {}
- const Params *params() const { return (const Params *)_params; }
-};
-
-class IntLink : public Link
-{
- public:
- typedef IntLinkParams Params;
- IntLink(const Params *p) : Link(p) {}
- const Params *params() const { return (const Params *)_params; }
-};
-
-class Topology : public SimObject
-{
- public:
- typedef TopologyParams Params;
- Topology(const Params *p);
- virtual ~Topology() {}
- const Params *params() const { return (const Params *)_params; }
-
- int numSwitches() const { return m_number_of_switches; }
- void createLinks(Network *net, bool isReconfiguration);
-
- void initNetworkPtr(Network* net_ptr);
-
- const std::string getName() { return m_name; }
- void printStats(std::ostream& out) const;
- void clearStats();
- void printConfig(std::ostream& out) const;
- void print(std::ostream& out) const { out << "[Topology]"; }
-
- protected:
- SwitchID newSwitchID();
- void addLink(SwitchID src, SwitchID dest, int link_latency);
- void addLink(SwitchID src, SwitchID dest, int link_latency,
- int bw_multiplier);
- void addLink(SwitchID src, SwitchID dest, int link_latency,
- int bw_multiplier, int link_weight);
- void makeLink(Network *net, SwitchID src, SwitchID dest,
- const NetDest& routing_table_entry, int link_latency, int weight,
- int bw_multiplier, bool isReconfiguration);
-
- //void makeSwitchesPerChip(std::vector<std::vector<SwitchID > > &nodePairs,
- // std::vector<int> &latencies, std::vector<int> &bw_multis,
- // int numberOfChips);
-
- std::string getDesignStr();
- // Private copy constructor and assignment operator
- Topology(const Topology& obj);
- Topology& operator=(const Topology& obj);
-
- std::string m_name;
- bool m_print_config;
- NodeID m_nodes;
- int m_number_of_switches;
-
- std::vector<AbstractController*> m_controller_vector;
-
- std::vector<SwitchID> m_links_src_vector;
- std::vector<SwitchID> m_links_dest_vector;
- std::vector<int> m_links_latency_vector;
- std::vector<int> m_links_weight_vector;
- std::vector<int> m_bw_multiplier_vector;
-
- Matrix m_component_latencies;
- Matrix m_component_inter_switches;
-};
-
-inline std::ostream&
-operator<<(std::ostream& out, const Topology& obj)
-{
- obj.print(out);
- out << std::flush;
- return out;
-}
-
-#endif // __MEM_RUBY_NETWORK_SIMPLE_TOPOLOGY_HH__