1 /* Copyright (c) 2006-2021. The SimGrid Team. All rights reserved. */
3 /* This program is free software; you can redistribute it and/or modify it
4 * under the terms of the license (GNU LGPL) which comes with this package. */
6 #include "simgrid/kernel/routing/NetZoneImpl.hpp"
7 #include "simgrid/kernel/routing/NetPoint.hpp"
8 #include "simgrid/s4u/Engine.hpp"
9 #include "simgrid/s4u/Host.hpp"
10 #include "src/surf/cpu_interface.hpp"
11 #include "src/surf/network_interface.hpp"
12 #include "src/surf/xml/platf_private.hpp"
13 #include "surf/surf.hpp"
15 XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(surf_route);
21 NetZoneImpl::NetZoneImpl(NetZoneImpl* father, const std::string& name, resource::NetworkModel* network_model)
22 : piface_(this), father_(father), name_(name), network_model_(network_model)
24 xbt_assert(nullptr == s4u::Engine::get_instance()->netpoint_by_name_or_null(get_name()),
25 "Refusing to create a second NetZone called '%s'.", get_cname());
27 netpoint_ = new NetPoint(name_, NetPoint::Type::NetZone, father_);
28 XBT_DEBUG("NetZone '%s' created with the id '%u'", get_cname(), netpoint_->id());
31 NetZoneImpl::~NetZoneImpl()
33 for (auto const& nz : children_)
36 for (auto const& kv : bypass_routes_)
39 s4u::Engine::get_instance()->netpoint_unregister(netpoint_);
42 /** @brief Returns the list of the hosts found in this NetZone (not recursively)
44 * Only the hosts that are directly contained in this NetZone are retrieved,
45 * not the ones contained in sub-netzones.
47 std::vector<s4u::Host*> NetZoneImpl::get_all_hosts() const
49 std::vector<s4u::Host*> res;
50 for (auto const& card : get_vertices()) {
51 s4u::Host* host = s4u::Host::by_name_or_null(card->get_name());
57 int NetZoneImpl::get_host_count() const
60 for (auto const& card : get_vertices()) {
61 const s4u::Host* host = s4u::Host::by_name_or_null(card->get_name());
68 s4u::Link* NetZoneImpl::create_link(const std::string& name, const std::vector<double>& bandwidths, double latency,
69 s4u::Link::SharingPolicy policy,
70 const std::unordered_map<std::string, std::string>* props)
72 static double last_warned_latency = sg_surf_precision;
73 if (latency != 0.0 && latency < last_warned_latency) {
74 XBT_WARN("Latency for link %s is smaller than surf/precision (%g < %g)."
75 " For more accuracy, consider setting \"--cfg=surf/precision:%g\".",
76 name.c_str(), latency, sg_surf_precision, latency);
77 last_warned_latency = latency;
80 auto* l = surf_network_model->create_link(name, bandwidths, latency, policy);
83 l->set_properties(*props);
85 return l->get_iface();
87 s4u::Host* NetZoneImpl::create_host(const std::string& name, const std::vector<double>& speed_per_pstate,
88 int coreAmount, const std::unordered_map<std::string, std::string>* props)
90 auto* res = new s4u::Host(name);
92 if (hierarchy_ == RoutingMode::unset)
93 hierarchy_ = RoutingMode::base;
95 res->set_netpoint(new NetPoint(name, NetPoint::Type::Host, this));
97 surf_cpu_model_pm->create_cpu(res, speed_per_pstate, coreAmount);
100 res->set_properties(*props);
102 s4u::Host::on_creation(*res); // notify the signal
107 int NetZoneImpl::add_component(NetPoint* elm)
109 vertices_.push_back(elm);
110 return vertices_.size() - 1; // The rank of the newly created object
113 void NetZoneImpl::add_route(NetPoint* /*src*/, NetPoint* /*dst*/, NetPoint* /*gw_src*/, NetPoint* /*gw_dst*/,
114 std::vector<resource::LinkImpl*>& /*link_list*/, bool /*symmetrical*/)
116 xbt_die("NetZone '%s' does not accept new routes (wrong class).", get_cname());
119 void NetZoneImpl::add_bypass_route(NetPoint* src, NetPoint* dst, NetPoint* gw_src, NetPoint* gw_dst,
120 std::vector<resource::LinkImpl*>& link_list, bool /* symmetrical */)
122 /* Argument validity checks */
124 XBT_DEBUG("Load bypassNetzoneRoute from %s@%s to %s@%s", src->get_cname(), gw_src->get_cname(), dst->get_cname(),
125 gw_dst->get_cname());
126 xbt_assert(not link_list.empty(), "Bypass route between %s@%s and %s@%s cannot be empty.", src->get_cname(),
127 gw_src->get_cname(), dst->get_cname(), gw_dst->get_cname());
128 xbt_assert(bypass_routes_.find({src, dst}) == bypass_routes_.end(),
129 "The bypass route between %s@%s and %s@%s already exists.", src->get_cname(), gw_src->get_cname(),
130 dst->get_cname(), gw_dst->get_cname());
132 XBT_DEBUG("Load bypassRoute from %s to %s", src->get_cname(), dst->get_cname());
133 xbt_assert(not link_list.empty(), "Bypass route between %s and %s cannot be empty.", src->get_cname(),
135 xbt_assert(bypass_routes_.find({src, dst}) == bypass_routes_.end(),
136 "The bypass route between %s and %s already exists.", src->get_cname(), dst->get_cname());
139 /* Build a copy that will be stored in the dict */
140 auto* newRoute = new BypassRoute(gw_src, gw_dst);
141 for (auto const& link : link_list)
142 newRoute->links.push_back(link);
145 bypass_routes_.insert({{src, dst}, newRoute});
148 /** @brief Get the common ancestor and its first children in each line leading to src and dst
150 * In the recursive case, this sets common_ancestor, src_ancestor and dst_ancestor are set as follows.
154 * ... <- possibly long path
159 * / \ <- direct links
162 * src_ancestor dst_ancestor <- must be different in the recursive case
164 * ... ... <-- possibly long paths (one hop or more)
169 * In the base case (when src and dst are in the same netzone), things are as follows:
173 * ... <-- possibly long path
175 * common_ancestor==src_ancestor==dst_ancestor <-- all the same value
177 * / \ <-- direct links (exactly one hop)
182 * A specific recursive case occurs when src is the ancestor of dst. In this case,
183 * the base case routing should be used so the common_ancestor is specifically set
184 * to src_ancestor==dst_ancestor.
185 * Naturally, things are completely symmetrical if dst is the ancestor of src.
189 * ... <-- possibly long path
191 * src == src_ancestor==dst_ancestor==common_ancestor <-- same value
193 * ... <-- possibly long path (one hop or more)
198 static void find_common_ancestors(NetPoint* src, NetPoint* dst,
199 /* OUT */ NetZoneImpl** common_ancestor, NetZoneImpl** src_ancestor,
200 NetZoneImpl** dst_ancestor)
202 /* Deal with the easy base case */
203 if (src->get_englobing_zone() == dst->get_englobing_zone()) {
204 *common_ancestor = src->get_englobing_zone();
205 *src_ancestor = *common_ancestor;
206 *dst_ancestor = *common_ancestor;
210 /* engage the full recursive search */
212 /* (1) find the path to root of src and dst*/
213 const NetZoneImpl* src_as = src->get_englobing_zone();
214 const NetZoneImpl* dst_as = dst->get_englobing_zone();
216 xbt_assert(src_as, "Host %s must be in a netzone", src->get_cname());
217 xbt_assert(dst_as, "Host %s must be in a netzone", dst->get_cname());
219 /* (2) find the path to the root routing component */
220 std::vector<NetZoneImpl*> path_src;
221 NetZoneImpl* current = src->get_englobing_zone();
222 while (current != nullptr) {
223 path_src.push_back(current);
224 current = current->get_father();
226 std::vector<NetZoneImpl*> path_dst;
227 current = dst->get_englobing_zone();
228 while (current != nullptr) {
229 path_dst.push_back(current);
230 current = current->get_father();
233 /* (3) find the common father.
234 * Before that, index_src and index_dst may be different, they both point to nullptr in path_src/path_dst
235 * So we move them down simultaneously as long as they point to the same content.
237 * This works because all SimGrid platform have a unique root element (that is the last element of both paths).
239 NetZoneImpl* father = nullptr; // the netzone we dropped on the previous loop iteration
240 while (path_src.size() > 1 && path_dst.size() > 1 &&
241 path_src.at(path_src.size() - 1) == path_dst.at(path_dst.size() - 1)) {
242 father = path_src.at(path_src.size() - 1);
247 /* (4) we found the difference at least. Finalize the returned values */
248 *src_ancestor = path_src.at(path_src.size() - 1); /* the first different father of src */
249 *dst_ancestor = path_dst.at(path_dst.size() - 1); /* the first different father of dst */
250 if (*src_ancestor == *dst_ancestor) { // src is the ancestor of dst, or the contrary
251 *common_ancestor = *src_ancestor;
253 *common_ancestor = father;
257 /* PRECONDITION: this is the common ancestor of src and dst */
258 bool NetZoneImpl::get_bypass_route(NetPoint* src, NetPoint* dst,
259 /* OUT */ std::vector<resource::LinkImpl*>& links, double* latency)
261 // If never set a bypass route return nullptr without any further computations
262 if (bypass_routes_.empty())
265 /* Base case, no recursion is needed */
266 if (dst->get_englobing_zone() == this && src->get_englobing_zone() == this) {
267 if (bypass_routes_.find({src, dst}) != bypass_routes_.end()) {
268 const BypassRoute* bypassedRoute = bypass_routes_.at({src, dst});
269 for (resource::LinkImpl* const& link : bypassedRoute->links) {
270 links.push_back(link);
272 *latency += link->get_latency();
274 XBT_DEBUG("Found a bypass route from '%s' to '%s' with %zu links", src->get_cname(), dst->get_cname(),
275 bypassedRoute->links.size());
281 /* Engage recursive search */
283 /* (1) find the path to the root routing component */
284 std::vector<NetZoneImpl*> path_src;
285 NetZoneImpl* current = src->get_englobing_zone();
286 while (current != nullptr) {
287 path_src.push_back(current);
288 current = current->father_;
291 std::vector<NetZoneImpl*> path_dst;
292 current = dst->get_englobing_zone();
293 while (current != nullptr) {
294 path_dst.push_back(current);
295 current = current->father_;
298 /* (2) find the common father */
299 while (path_src.size() > 1 && path_dst.size() > 1 &&
300 path_src.at(path_src.size() - 1) == path_dst.at(path_dst.size() - 1)) {
305 int max_index_src = path_src.size() - 1;
306 int max_index_dst = path_dst.size() - 1;
308 int max_index = std::max(max_index_src, max_index_dst);
310 /* (3) Search for a bypass making the path up to the ancestor useless */
311 const BypassRoute* bypassedRoute = nullptr;
312 std::pair<kernel::routing::NetPoint*, kernel::routing::NetPoint*> key;
313 for (int max = 0; max <= max_index && not bypassedRoute; max++) {
314 for (int i = 0; i < max && not bypassedRoute; i++) {
315 if (i <= max_index_src && max <= max_index_dst) {
316 key = {path_src.at(i)->netpoint_, path_dst.at(max)->netpoint_};
317 auto bpr = bypass_routes_.find(key);
318 if (bpr != bypass_routes_.end()) {
319 bypassedRoute = bpr->second;
322 if (not bypassedRoute && max <= max_index_src && i <= max_index_dst) {
323 key = {path_src.at(max)->netpoint_, path_dst.at(i)->netpoint_};
324 auto bpr = bypass_routes_.find(key);
325 if (bpr != bypass_routes_.end()) {
326 bypassedRoute = bpr->second;
331 if (not bypassedRoute && max <= max_index_src && max <= max_index_dst) {
332 key = {path_src.at(max)->netpoint_, path_dst.at(max)->netpoint_};
333 auto bpr = bypass_routes_.find(key);
334 if (bpr != bypass_routes_.end()) {
335 bypassedRoute = bpr->second;
340 /* (4) If we have the bypass, use it. If not, caller will do the Right Thing. */
342 XBT_DEBUG("Found a bypass route from '%s' to '%s' with %zu links. We may have to complete it with recursive "
344 src->get_cname(), dst->get_cname(), bypassedRoute->links.size());
345 if (src != key.first)
346 get_global_route(src, bypassedRoute->gw_src, links, latency);
347 for (resource::LinkImpl* const& link : bypassedRoute->links) {
348 links.push_back(link);
350 *latency += link->get_latency();
352 if (dst != key.second)
353 get_global_route(bypassedRoute->gw_dst, dst, links, latency);
356 XBT_DEBUG("No bypass route from '%s' to '%s'.", src->get_cname(), dst->get_cname());
360 void NetZoneImpl::get_global_route(NetPoint* src, NetPoint* dst,
361 /* OUT */ std::vector<resource::LinkImpl*>& links, double* latency)
363 RouteCreationArgs route;
365 XBT_DEBUG("Resolve route from '%s' to '%s'", src->get_cname(), dst->get_cname());
367 /* Find how src and dst are interconnected */
368 NetZoneImpl *common_ancestor;
369 NetZoneImpl *src_ancestor;
370 NetZoneImpl *dst_ancestor;
371 find_common_ancestors(src, dst, &common_ancestor, &src_ancestor, &dst_ancestor);
372 XBT_DEBUG("elements_father: common ancestor '%s' src ancestor '%s' dst ancestor '%s'", common_ancestor->get_cname(),
373 src_ancestor->get_cname(), dst_ancestor->get_cname());
375 /* Check whether a direct bypass is defined. If so, use it and bail out */
376 if (common_ancestor->get_bypass_route(src, dst, links, latency))
379 /* If src and dst are in the same netzone, life is good */
380 if (src_ancestor == dst_ancestor) { /* SURF_ROUTING_BASE */
381 route.link_list = std::move(links);
382 common_ancestor->get_local_route(src, dst, &route, latency);
383 links = std::move(route.link_list);
387 /* Not in the same netzone, no bypass. We'll have to find our path between the netzones recursively */
389 common_ancestor->get_local_route(src_ancestor->netpoint_, dst_ancestor->netpoint_, &route, latency);
390 xbt_assert((route.gw_src != nullptr) && (route.gw_dst != nullptr), "Bad gateways for route from '%s' to '%s'.",
391 src->get_cname(), dst->get_cname());
393 /* If source gateway is not our source, we have to recursively find our way up to this point */
394 if (src != route.gw_src)
395 get_global_route(src, route.gw_src, links, latency);
396 for (auto const& link : route.link_list)
397 links.push_back(link);
399 /* If dest gateway is not our destination, we have to recursively find our way from this point */
400 if (route.gw_dst != dst)
401 get_global_route(route.gw_dst, dst, links, latency);
403 } // namespace routing
404 } // namespace kernel
405 } // namespace simgrid