X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/6f2e9113097b642198bdf52fc3a85a5593fa17cd..5fedb73886fa7c03fcc89ca008fb7a6dc72d80a1:/src/surf/surf_routing_cluster_fat_tree.cpp diff --git a/src/surf/surf_routing_cluster_fat_tree.cpp b/src/surf/surf_routing_cluster_fat_tree.cpp index 2421ea5496..2673e94874 100644 --- a/src/surf/surf_routing_cluster_fat_tree.cpp +++ b/src/surf/surf_routing_cluster_fat_tree.cpp @@ -1,4 +1,13 @@ -#include "surf_routing_cluster_fat_tree.hpp" +#include + +#include +#include +#include +#include +#include + +#include "src/surf/surf_routing_private.hpp" +#include "src/surf/surf_routing_cluster_fat_tree.hpp" #include "xbt/lib.h" #include @@ -9,12 +18,12 @@ XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_fat_tree, surf, "Routing for fat trees"); -AS_t model_fat_tree_cluster_create(void) -{ - return new AsClusterFatTree(); -} +namespace simgrid { +namespace surf { -AsClusterFatTree::AsClusterFatTree() : levels(0) { +AsClusterFatTree::AsClusterFatTree(const char*name) + : AsCluster(name) +{ XBT_DEBUG("Creating a new fat tree."); } @@ -47,8 +56,8 @@ bool AsClusterFatTree::isInSubTree(FatTreeNode *root, FatTreeNode *node) { return true; } -void AsClusterFatTree::getRouteAndLatency(RoutingEdgePtr src, - RoutingEdgePtr dst, +void AsClusterFatTree::getRouteAndLatency(NetCard *src, + NetCard *dst, sg_platf_route_cbarg_t into, double *latency) { FatTreeNode *source, *destination, *currentNode; @@ -58,25 +67,25 @@ void AsClusterFatTree::getRouteAndLatency(RoutingEdgePtr src, if (dst->getRcType() == SURF_NETWORK_ELEMENT_ROUTER || src->getRcType() == SURF_NETWORK_ELEMENT_ROUTER) return; /* Let's find the source and the destination in our internal structure */ - tempIter = this->computeNodes.find(src->getId()); + tempIter = this->computeNodes.find(src->id()); // xbt_die -> assert if (tempIter == this->computeNodes.end()) { - xbt_die("Could not find the source %s [%d] in the fat tree", src->getName(), - src->getId()); + xbt_die("Could not find the source %s [%d] in the fat tree", src->name(), + src->id()); } source = tempIter->second; - tempIter = this->computeNodes.find(dst->getId()); + tempIter = this->computeNodes.find(dst->id()); if (tempIter == this->computeNodes.end()) { xbt_die("Could not find the destination %s [%d] in the fat tree", - dst->getName(), dst->getId()); + dst->name(), dst->id()); } destination = tempIter->second; XBT_VERB("Get route and latency from '%s' [%d] to '%s' [%d] in a fat tree", - src->getName(), src->getId(), dst->getName(), dst->getId()); + src->name(), src->id(), dst->name(), dst->id()); /* In case destination is the source, and there is a loopback, let's get through it instead of going up to a switch*/ @@ -407,8 +416,8 @@ void AsClusterFatTree::addLink(FatTreeNode *parent, unsigned int parentPort, void AsClusterFatTree::parse_specific_arguments(sg_platf_cluster_cbarg_t cluster) { - std::vector parameters; - std::vector tmp; + std::vector parameters; + std::vector tmp; boost::split(parameters, cluster->topo_parameters, boost::is_any_of(";")); @@ -419,7 +428,7 @@ void AsClusterFatTree::parse_specific_arguments(sg_platf_cluster_cbarg_t } // The first parts of topo_parameters should be the levels number - this->levels = std::atoi(parameters[0].c_str()); // stoi() only in C++11... + this->levels = xbt_str_parse_int(parameters[0].c_str(), "First parameter is not the amount of levels: %s"); // Then, a l-sized vector standing for the childs number by level boost::split(tmp, parameters[1], boost::is_any_of(",")); @@ -428,7 +437,7 @@ void AsClusterFatTree::parse_specific_arguments(sg_platf_cluster_cbarg_t ", see the documentation for more informations"); } for(size_t i = 0 ; i < tmp.size() ; i++){ - this->lowerLevelNodesNumber.push_back(std::atoi(tmp[i].c_str())); + this->lowerLevelNodesNumber.push_back(xbt_str_parse_int(tmp[i].c_str(), "Invalid lower level node number: %s")); } // Then, a l-sized vector standing for the parents number by level @@ -438,7 +447,7 @@ void AsClusterFatTree::parse_specific_arguments(sg_platf_cluster_cbarg_t ", see the documentation for more informations"); } for(size_t i = 0 ; i < tmp.size() ; i++){ - this->upperLevelNodesNumber.push_back(std::atoi(tmp[i].c_str())); + this->upperLevelNodesNumber.push_back(xbt_str_parse_int(tmp[i].c_str(), "Invalid upper level node number: %s")); } // Finally, a l-sized vector standing for the ports number with the lower level @@ -449,18 +458,18 @@ void AsClusterFatTree::parse_specific_arguments(sg_platf_cluster_cbarg_t } for(size_t i = 0 ; i < tmp.size() ; i++){ - this->lowerLevelPortsNumber.push_back(std::atoi(tmp[i].c_str())); + this->lowerLevelPortsNumber.push_back(xbt_str_parse_int(tmp[i].c_str(), "Invalid lower level node number: %s")); } this->cluster = cluster; } -void AsClusterFatTree::generateDotFile(const string& filename) const { - ofstream file; +void AsClusterFatTree::generateDotFile(const std::string& filename) const { + std::ofstream file; /* Maybe should we get directly a char*, as open takes strings only beginning * with C++11... */ - file.open(filename.c_str(), ios::out | ios::trunc); + file.open(filename.c_str(), std::ios::out | std::ios::trunc); if(file.is_open()) { file << "graph AsClusterFatTree {\n"; @@ -492,31 +501,27 @@ void AsClusterFatTree::generateDotFile(const string& filename) const { FatTreeNode::FatTreeNode(sg_platf_cluster_cbarg_t cluster, int id, int level, int position) : id(id), level(level), position(position) { - s_sg_platf_link_cbarg_t linkTemplate; + s_sg_platf_link_cbarg_t linkTemplate = SG_PLATF_LINK_INITIALIZER; if(cluster->limiter_link) { memset(&linkTemplate, 0, sizeof(linkTemplate)); linkTemplate.bandwidth = cluster->limiter_link; linkTemplate.latency = 0; - linkTemplate.state = SURF_RESOURCE_ON; + linkTemplate.initiallyOn = 1; linkTemplate.policy = SURF_LINK_SHARED; linkTemplate.id = bprintf("limiter_%d", id); sg_platf_new_link(&linkTemplate); - this->limiterLink = (NetworkLink*) xbt_lib_get_or_null(link_lib, - linkTemplate.id, - SURF_LINK_LEVEL); + this->limiterLink = Link::byName(linkTemplate.id); free((void*)linkTemplate.id); } if(cluster->loopback_bw || cluster->loopback_lat) { memset(&linkTemplate, 0, sizeof(linkTemplate)); linkTemplate.bandwidth = cluster->loopback_bw; linkTemplate.latency = cluster->loopback_lat; - linkTemplate.state = SURF_RESOURCE_ON; + linkTemplate.initiallyOn = 1; linkTemplate.policy = SURF_LINK_FATPIPE; linkTemplate.id = bprintf("loopback_%d", id); sg_platf_new_link(&linkTemplate); - this->loopback = (NetworkLink*) xbt_lib_get_or_null(link_lib, - linkTemplate.id, - SURF_LINK_LEVEL); + this->loopback = Link::byName(linkTemplate.id); free((void*)linkTemplate.id); } } @@ -526,33 +531,33 @@ FatTreeLink::FatTreeLink(sg_platf_cluster_cbarg_t cluster, FatTreeNode *upNode) : upNode(upNode), downNode(downNode) { static int uniqueId = 0; - s_sg_platf_link_cbarg_t linkTemplate; + s_sg_platf_link_cbarg_t linkTemplate = SG_PLATF_LINK_INITIALIZER; memset(&linkTemplate, 0, sizeof(linkTemplate)); linkTemplate.bandwidth = cluster->bw; linkTemplate.latency = cluster->lat; - linkTemplate.state = SURF_RESOURCE_ON; + linkTemplate.initiallyOn = 1; linkTemplate.policy = cluster->sharing_policy; // sthg to do with that ? linkTemplate.id = bprintf("link_from_%d_to_%d_%d", downNode->id, upNode->id, uniqueId); sg_platf_new_link(&linkTemplate); - NetworkLink* link; + Link* link; std::string tmpID; if (cluster->sharing_policy == SURF_LINK_FULLDUPLEX) { tmpID = std::string(linkTemplate.id) + "_UP"; - link = (NetworkLink*) xbt_lib_get_or_null(link_lib, tmpID.c_str(), - SURF_LINK_LEVEL); + link = Link::byName(tmpID.c_str()); this->upLink = link; // check link? tmpID = std::string(linkTemplate.id) + "_DOWN"; - link = (NetworkLink*) xbt_lib_get_or_null(link_lib, tmpID.c_str(), - SURF_LINK_LEVEL); + link = Link::byName(tmpID.c_str()); this->downLink = link; // check link ? } else { - link = (NetworkLink*) xbt_lib_get_or_null(link_lib, linkTemplate.id, - SURF_LINK_LEVEL); + link = Link::byName(linkTemplate.id); this->upLink = link; this->downLink = link; } uniqueId++; free((void*)linkTemplate.id); } + +} +}