#include "simgrid/s4u/host.hpp"
#include "src/kernel/routing/AsImpl.hpp"
+#include "src/surf/cpu_interface.hpp"
#include "src/surf/network_interface.hpp" // Link FIXME: move to proper header
XBT_LOG_NEW_DEFAULT_SUBCATEGORY(AsImpl,surf, "Implementation of S4U autonomous systems");
}
AsImpl::~AsImpl() = default;
- void AsImpl::attachHost(s4u::Host* host)
+ simgrid::s4u::Host* AsImpl::createHost(const char* name, std::vector<double>* speedPerPstate, int coreAmount)
{
+ simgrid::s4u::Host* res = new simgrid::s4u::Host(name);
+
if (hierarchy_ == RoutingMode::unset)
hierarchy_ = RoutingMode::base;
- host->pimpl_netcard = new NetCardImpl(host->name().c_str(), NetCard::Type::Host, this);
+ res->pimpl_netcard = new NetCardImpl(name, NetCard::Type::Host, this);
+
+ surf_cpu_model_pm->createCpu(res, speedPerPstate, coreAmount);
+
+ return res;
}
- xbt_dynar_t AsImpl::getOneLinkRoutes()
+ void AsImpl::getOneLinkRoutes(xbt_dynar_t accumulator)
{
- return nullptr;
}
/** @brief Get the common ancestor and its first children in each line leading to src and dst
AsImpl* src_as = src->containingAS();
AsImpl* dst_as = dst->containingAS();
- xbt_assert(src_as, "Host %s must be in an AS", src->name());
- xbt_assert(dst_as, "Host %s must be in an AS", dst->name());
+ xbt_assert(src_as, "Host %s must be in an AS", src->name().c_str());
+ xbt_assert(dst_as, "Host %s must be in an AS", dst->name().c_str());
/* (2) find the path to the root routing component */
std::vector<AsImpl*> path_src;
/* OUT */ std::vector<surf::Link*>* links, double* latency)
{
// If never set a bypass route return nullptr without any further computations
- XBT_DEBUG("generic_get_bypassroute from %s to %s", src->name(), dst->name());
+ XBT_DEBUG("generic_get_bypassroute from %s to %s", src->name().c_str(), dst->name().c_str());
if (bypassRoutes_.empty())
return false;
/* Base case, no recursion is needed */
if (dst->containingAS() == this && src->containingAS() == this) {
- if (bypassRoutes_.find({src->name(), dst->name()}) != bypassRoutes_.end()) {
- std::vector<surf::Link*>* bypassedRoute = bypassRoutes_.at({src->name(), dst->name()});
- for (surf::Link* link : *bypassedRoute) {
+ if (bypassRoutes_.find({src, dst}) != bypassRoutes_.end()) {
+ AsRoute* bypassedRoute = bypassRoutes_.at({src, dst});
+ for (surf::Link* link : bypassedRoute->links) {
links->push_back(link);
if (latency)
*latency += link->latency();
}
- XBT_DEBUG("Found a bypass route with %zu links", bypassedRoute->size());
+ XBT_DEBUG("Found a bypass route with %zu links", bypassedRoute->links.size());
return true;
}
return false;
/* Engage recursive search */
- std::vector<surf::Link*>* bypassedRoute = nullptr;
/* (1) find the path to the root routing component */
- std::vector<As*> path_src;
+ std::vector<AsImpl*> path_src;
As* current = src->containingAS();
while (current != nullptr) {
- path_src.push_back(current);
+ path_src.push_back(static_cast<AsImpl*>(current));
current = current->father_;
}
- std::vector<As*> path_dst;
+ std::vector<AsImpl*> path_dst;
current = dst->containingAS();
while (current != nullptr) {
- path_dst.push_back(current);
+ path_dst.push_back(static_cast<AsImpl*>(current));
current = current->father_;
}
int max_index = std::max(max_index_src, max_index_dst);
+ /* (3) Search for a bypass making the path up to the ancestor useless */
+ AsRoute* bypassedRoute = nullptr;
+ std::pair<kernel::routing::NetCard*, kernel::routing::NetCard*> key;
for (int max = 0; max <= max_index; max++) {
for (int i = 0; i < max; i++) {
if (i <= max_index_src && max <= max_index_dst) {
- const std::pair<std::string, std::string> key = {path_src.at(i)->name(), path_dst.at(max)->name()};
+ key = {path_src.at(i)->netcard_, path_dst.at(max)->netcard_};
if (bypassRoutes_.find(key) != bypassRoutes_.end()) {
bypassedRoute = bypassRoutes_.at(key);
break;
}
}
if (max <= max_index_src && i <= max_index_dst) {
- const std::pair<std::string, std::string> key = {path_src.at(max)->name(), path_dst.at(i)->name()};
+ key = {path_src.at(max)->netcard_, path_dst.at(i)->netcard_};
if (bypassRoutes_.find(key) != bypassRoutes_.end()) {
bypassedRoute = bypassRoutes_.at(key);
break;
break;
if (max <= max_index_src && max <= max_index_dst) {
- const std::pair<std::string, std::string> key = {path_src.at(max)->name(), path_dst.at(max)->name()};
+ key = {path_src.at(max)->netcard_, path_dst.at(max)->netcard_};
if (bypassRoutes_.find(key) != bypassRoutes_.end()) {
bypassedRoute = bypassRoutes_.at(key);
break;
}
}
+ /* (4) If we have the bypass, use it. If not, caller will do the Right Thing. */
if (bypassedRoute) {
- for (surf::Link* link : *bypassedRoute) {
+ if (src != key.first)
+ getRouteRecursive(src, const_cast<NetCard*>(bypassedRoute->gw_src), links, latency);
+ for (surf::Link* link : bypassedRoute->links) {
links->push_back(link);
if (latency)
*latency += link->latency();
}
+ if (dst != key.second)
+ getRouteRecursive(const_cast<NetCard*>(bypassedRoute->gw_dst), dst, links, latency);
return true;
}
return false;
s_sg_platf_route_cbarg_t route;
memset(&route,0,sizeof(route));
- XBT_DEBUG("Solve route/latency \"%s\" to \"%s\"", src->name(), dst->name());
+ XBT_DEBUG("Solve route/latency \"%s\" to \"%s\"", src->name().c_str(), dst->name().c_str());
/* Find how src and dst are interconnected */
AsImpl *common_ancestor, *src_ancestor, *dst_ancestor;
route.link_list = new std::vector<surf::Link*>();
common_ancestor->getRouteAndLatency(src_ancestor->netcard_, dst_ancestor->netcard_, &route, latency);
- xbt_assert((route.gw_src != nullptr) && (route.gw_dst != nullptr),
- "bad gateways for route from \"%s\" to \"%s\"", src->name(), dst->name());
+ xbt_assert((route.gw_src != nullptr) && (route.gw_dst != nullptr), "bad gateways for route from \"%s\" to \"%s\"",
+ src->name().c_str(), dst->name().c_str());
/* If source gateway is not our source, we have to recursively find our way up to this point */
if (src != route.gw_src)
