X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/fa222c38f9b796be07ab4351ffc810a61a8fd705..b35d70d6818026204833410d2e3917252fa35127:/src/surf/surf_routing_cluster_fat_tree.hpp diff --git a/src/surf/surf_routing_cluster_fat_tree.hpp b/src/surf/surf_routing_cluster_fat_tree.hpp index 2180d06939..30253876e8 100644 --- a/src/surf/surf_routing_cluster_fat_tree.hpp +++ b/src/surf/surf_routing_cluster_fat_tree.hpp @@ -7,8 +7,16 @@ #ifndef SURF_ROUTING_CLUSTER_FAT_TREE_HPP_ #define SURF_ROUTING_CLUSTER_FAT_TREE_HPP_ +#include +#include +#include + +#include + #include "surf_routing_cluster.hpp" +namespace simgrid { +namespace surf { /** \file surf_routing_cluster_fat_tree.cpp * The class AsClusterFatTree describes PGFT, as introduced by Eitan Zahavi @@ -17,8 +25,8 @@ * address real world constraints, which are not currently enforced. */ -class FatTreeNode; -class FatTreeLink; +class XBT_PRIVATE FatTreeNode; +class XBT_PRIVATE FatTreeLink; /** \brief A node in a fat tree. * A FatTreeNode can either be a switch or a processing node. Switches are @@ -107,11 +115,11 @@ public: * * Routing is made using a destination-mod-k scheme. */ -class AsClusterFatTree : public AsCluster { +class XBT_PRIVATE AsClusterFatTree : public AsCluster { public: AsClusterFatTree(); ~AsClusterFatTree(); - virtual void getRouteAndLatency(RoutingEdge *src, RoutingEdge *dst, + virtual void getRouteAndLatency(NetCard *src, NetCard *dst, sg_platf_route_cbarg_t into, double *latency); @@ -130,7 +138,7 @@ public: /** \brief Add a processing node. */ void addProcessingNode(int id); - void generateDotFile(const string& filename = "fatTree.dot") const; + void generateDotFile(const std::string& filename = "fatTree.dot") const; private: @@ -156,4 +164,8 @@ private: bool areRelated(FatTreeNode *parent, FatTreeNode *child); bool isInSubTree(FatTreeNode *root, FatTreeNode *node); }; + +} +} + #endif