source = tempIter->second;
tempIter = this->computeNodes.find(dst->getId());
if (tempIter == this->computeNodes.end()) {
- xbt_die("Could not find the destination %s [%d] in the fat tree", src->getName(), src->getId());
+ xbt_die("Could not find the destination %s [%d] in the fat tree", dst->getName(), dst->getId());
}
destination = tempIter->second;
- XBT_DEBUG("%d %d", src->getId(), source->id);
XBT_DEBUG("Get route and latency from '%s' [%d] to '%s' [%d] in a fat tree",
src->getName(), src->getId(), dst->getName(), dst->getId());
for (unsigned int i = 1 ; i <= this->levels ; i++) {
msgBuffer << ", " << this->nodesByLevel[i] << " switches at level " << i;
}
- XBT_DEBUG(msgBuffer.str().c_str());
+ XBT_DEBUG("%s", msgBuffer.str().c_str());
msgBuffer.str("");
msgBuffer << "Nodes are : ";
msgBuffer << this->nodes[i]->id << "(" << this->nodes[i]->level << ","
<< this->nodes[i]->position << ") ";
}
- XBT_DEBUG(msgBuffer.str().c_str());
+ XBT_DEBUG("%s", msgBuffer.str().c_str());
}
msgBuffer << "(" << this->links[i]->upNode->id << ","
<< this->links[i]->downNode->id << ") ";
}
- XBT_DEBUG(msgBuffer.str().c_str());
+ XBT_DEBUG("%s", msgBuffer.str().c_str());
}
}
msgBuffer << ">";
msgBuffer << " related ? ";
- XBT_DEBUG(msgBuffer.str().c_str());
+ XBT_DEBUG("%s", msgBuffer.str().c_str());
}
if (parent->level != child->level + 1) {
}
msgBuffer << "> to " << k << " (" << i << "," << j <<")";
- XBT_DEBUG(bprintf(msgBuffer.str().c_str()));
+ XBT_DEBUG("%s", msgBuffer.str().c_str());
}
this->nodes[k]->label.assign(currentLabel.begin(), currentLabel.end());