Logo AND Algorithmique Numérique Distribuée

Public GIT Repository
cleanup in the Link field names
[simgrid.git] / src / kernel / routing / AsClusterFatTree.cpp
index c5b518f8109b04d68392144466c0806f77135c27..859eb9120b7804ebfd2b6246b7fc86d64dee53c1 100644 (file)
@@ -23,8 +23,7 @@ namespace simgrid {
 namespace kernel {
 namespace routing {
 
-AsClusterFatTree::AsClusterFatTree(const char*name)
-  : AsCluster(name)
+AsClusterFatTree::AsClusterFatTree(As* father, const char* name) : AsCluster(father, name)
 {
   XBT_DEBUG("Creating a new fat tree.");
 }
@@ -95,7 +94,7 @@ void AsClusterFatTree::getRouteAndLatency(NetCard *src,
   if(source->id == destination->id && this->hasLoopback_) {
     into->link_list->push_back(source->loopback);
     if(latency) {
-      *latency += source->loopback->getLatency();
+      *latency += source->loopback->latency();
     }
     return;
   }
@@ -115,7 +114,7 @@ void AsClusterFatTree::getRouteAndLatency(NetCard *src,
     into->link_list->push_back(currentNode->parents[d]->upLink);
 
     if(latency) {
-      *latency += currentNode->parents[d]->upLink->getLatency();
+      *latency += currentNode->parents[d]->upLink->latency();
     }
 
     if (this->hasLimiter_) {
@@ -135,7 +134,7 @@ void AsClusterFatTree::getRouteAndLatency(NetCard *src,
          destination->label[currentNode->level - 1]) {
         into->link_list->push_back(currentNode->children[i]->downLink);
         if(latency) {
-          *latency += currentNode->children[i]->downLink->getLatency();
+          *latency += currentNode->children[i]->downLink->latency();
         }
         currentNode = currentNode->children[i]->downNode;
         if (this->hasLimiter_) {