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)
71 static double last_warned_latency = sg_surf_precision;
72 if (latency != 0.0 && latency < last_warned_latency) {
73 XBT_WARN("Latency for link %s is smaller than surf/precision (%g < %g)."
74 " For more accuracy, consider setting \"--cfg=surf/precision:%g\".",
75 name.c_str(), latency, sg_surf_precision, latency);
76 last_warned_latency = latency;
79 auto* l = surf_network_model->create_link(name, bandwidths, latency, policy);
81 return l->get_iface();
84 s4u::Host* NetZoneImpl::create_host(const std::string& name, const std::vector<double>& speed_per_pstate,
87 if (hierarchy_ == RoutingMode::unset)
88 hierarchy_ = RoutingMode::base;
90 auto* res = (new s4u::Host(name))->set_netpoint(new NetPoint(name, NetPoint::Type::Host, this));
92 surf_cpu_model_pm->create_cpu(res, speed_per_pstate, coreAmount);
97 int NetZoneImpl::add_component(NetPoint* elm)
99 vertices_.push_back(elm);
100 return vertices_.size() - 1; // The rank of the newly created object
103 void NetZoneImpl::add_route(NetPoint* /*src*/, NetPoint* /*dst*/, NetPoint* /*gw_src*/, NetPoint* /*gw_dst*/,
104 std::vector<resource::LinkImpl*>& /*link_list*/, bool /*symmetrical*/)
106 xbt_die("NetZone '%s' does not accept new routes (wrong class).", get_cname());
109 void NetZoneImpl::add_bypass_route(NetPoint* src, NetPoint* dst, NetPoint* gw_src, NetPoint* gw_dst,
110 std::vector<resource::LinkImpl*>& link_list, bool /* symmetrical */)
112 /* Argument validity checks */
114 XBT_DEBUG("Load bypassNetzoneRoute from %s@%s to %s@%s", src->get_cname(), gw_src->get_cname(), dst->get_cname(),
115 gw_dst->get_cname());
116 xbt_assert(not link_list.empty(), "Bypass route between %s@%s and %s@%s cannot be empty.", src->get_cname(),
117 gw_src->get_cname(), dst->get_cname(), gw_dst->get_cname());
118 xbt_assert(bypass_routes_.find({src, dst}) == bypass_routes_.end(),
119 "The bypass route between %s@%s and %s@%s already exists.", src->get_cname(), gw_src->get_cname(),
120 dst->get_cname(), gw_dst->get_cname());
122 XBT_DEBUG("Load bypassRoute from %s to %s", src->get_cname(), dst->get_cname());
123 xbt_assert(not link_list.empty(), "Bypass route between %s and %s cannot be empty.", src->get_cname(),
125 xbt_assert(bypass_routes_.find({src, dst}) == bypass_routes_.end(),
126 "The bypass route between %s and %s already exists.", src->get_cname(), dst->get_cname());
129 /* Build a copy that will be stored in the dict */
130 auto* newRoute = new BypassRoute(gw_src, gw_dst);
131 for (auto const& link : link_list)
132 newRoute->links.push_back(link);
135 bypass_routes_.insert({{src, dst}, newRoute});
138 /** @brief Get the common ancestor and its first children in each line leading to src and dst
140 * In the recursive case, this sets common_ancestor, src_ancestor and dst_ancestor are set as follows.
144 * ... <- possibly long path
149 * / \ <- direct links
152 * src_ancestor dst_ancestor <- must be different in the recursive case
154 * ... ... <-- possibly long paths (one hop or more)
159 * In the base case (when src and dst are in the same netzone), things are as follows:
163 * ... <-- possibly long path
165 * common_ancestor==src_ancestor==dst_ancestor <-- all the same value
167 * / \ <-- direct links (exactly one hop)
172 * A specific recursive case occurs when src is the ancestor of dst. In this case,
173 * the base case routing should be used so the common_ancestor is specifically set
174 * to src_ancestor==dst_ancestor.
175 * Naturally, things are completely symmetrical if dst is the ancestor of src.
179 * ... <-- possibly long path
181 * src == src_ancestor==dst_ancestor==common_ancestor <-- same value
183 * ... <-- possibly long path (one hop or more)
188 static void find_common_ancestors(NetPoint* src, NetPoint* dst,
189 /* OUT */ NetZoneImpl** common_ancestor, NetZoneImpl** src_ancestor,
190 NetZoneImpl** dst_ancestor)
192 /* Deal with the easy base case */
193 if (src->get_englobing_zone() == dst->get_englobing_zone()) {
194 *common_ancestor = src->get_englobing_zone();
195 *src_ancestor = *common_ancestor;
196 *dst_ancestor = *common_ancestor;
200 /* engage the full recursive search */
202 /* (1) find the path to root of src and dst*/
203 const NetZoneImpl* src_as = src->get_englobing_zone();
204 const NetZoneImpl* dst_as = dst->get_englobing_zone();
206 xbt_assert(src_as, "Host %s must be in a netzone", src->get_cname());
207 xbt_assert(dst_as, "Host %s must be in a netzone", dst->get_cname());
209 /* (2) find the path to the root routing component */
210 std::vector<NetZoneImpl*> path_src;
211 NetZoneImpl* current = src->get_englobing_zone();
212 while (current != nullptr) {
213 path_src.push_back(current);
214 current = current->get_father();
216 std::vector<NetZoneImpl*> path_dst;
217 current = dst->get_englobing_zone();
218 while (current != nullptr) {
219 path_dst.push_back(current);
220 current = current->get_father();
223 /* (3) find the common father.
224 * Before that, index_src and index_dst may be different, they both point to nullptr in path_src/path_dst
225 * So we move them down simultaneously as long as they point to the same content.
227 * This works because all SimGrid platform have a unique root element (that is the last element of both paths).
229 NetZoneImpl* father = nullptr; // the netzone we dropped on the previous loop iteration
230 while (path_src.size() > 1 && path_dst.size() > 1 &&
231 path_src.at(path_src.size() - 1) == path_dst.at(path_dst.size() - 1)) {
232 father = path_src.at(path_src.size() - 1);
237 /* (4) we found the difference at least. Finalize the returned values */
238 *src_ancestor = path_src.at(path_src.size() - 1); /* the first different father of src */
239 *dst_ancestor = path_dst.at(path_dst.size() - 1); /* the first different father of dst */
240 if (*src_ancestor == *dst_ancestor) { // src is the ancestor of dst, or the contrary
241 *common_ancestor = *src_ancestor;
243 *common_ancestor = father;
247 /* PRECONDITION: this is the common ancestor of src and dst */
248 bool NetZoneImpl::get_bypass_route(NetPoint* src, NetPoint* dst,
249 /* OUT */ std::vector<resource::LinkImpl*>& links, double* latency)
251 // If never set a bypass route return nullptr without any further computations
252 if (bypass_routes_.empty())
255 /* Base case, no recursion is needed */
256 if (dst->get_englobing_zone() == this && src->get_englobing_zone() == this) {
257 if (bypass_routes_.find({src, dst}) != bypass_routes_.end()) {
258 const BypassRoute* bypassedRoute = bypass_routes_.at({src, dst});
259 for (resource::LinkImpl* const& link : bypassedRoute->links) {
260 links.push_back(link);
262 *latency += link->get_latency();
264 XBT_DEBUG("Found a bypass route from '%s' to '%s' with %zu links", src->get_cname(), dst->get_cname(),
265 bypassedRoute->links.size());
271 /* Engage recursive search */
273 /* (1) find the path to the root routing component */
274 std::vector<NetZoneImpl*> path_src;
275 NetZoneImpl* current = src->get_englobing_zone();
276 while (current != nullptr) {
277 path_src.push_back(current);
278 current = current->father_;
281 std::vector<NetZoneImpl*> path_dst;
282 current = dst->get_englobing_zone();
283 while (current != nullptr) {
284 path_dst.push_back(current);
285 current = current->father_;
288 /* (2) find the common father */
289 while (path_src.size() > 1 && path_dst.size() > 1 &&
290 path_src.at(path_src.size() - 1) == path_dst.at(path_dst.size() - 1)) {
295 int max_index_src = path_src.size() - 1;
296 int max_index_dst = path_dst.size() - 1;
298 int max_index = std::max(max_index_src, max_index_dst);
300 /* (3) Search for a bypass making the path up to the ancestor useless */
301 const BypassRoute* bypassedRoute = nullptr;
302 std::pair<kernel::routing::NetPoint*, kernel::routing::NetPoint*> key;
303 for (int max = 0; max <= max_index && not bypassedRoute; max++) {
304 for (int i = 0; i < max && not bypassedRoute; i++) {
305 if (i <= max_index_src && max <= max_index_dst) {
306 key = {path_src.at(i)->netpoint_, path_dst.at(max)->netpoint_};
307 auto bpr = bypass_routes_.find(key);
308 if (bpr != bypass_routes_.end()) {
309 bypassedRoute = bpr->second;
312 if (not bypassedRoute && max <= max_index_src && i <= max_index_dst) {
313 key = {path_src.at(max)->netpoint_, path_dst.at(i)->netpoint_};
314 auto bpr = bypass_routes_.find(key);
315 if (bpr != bypass_routes_.end()) {
316 bypassedRoute = bpr->second;
321 if (not bypassedRoute && max <= max_index_src && max <= max_index_dst) {
322 key = {path_src.at(max)->netpoint_, path_dst.at(max)->netpoint_};
323 auto bpr = bypass_routes_.find(key);
324 if (bpr != bypass_routes_.end()) {
325 bypassedRoute = bpr->second;
330 /* (4) If we have the bypass, use it. If not, caller will do the Right Thing. */
332 XBT_DEBUG("Found a bypass route from '%s' to '%s' with %zu links. We may have to complete it with recursive "
334 src->get_cname(), dst->get_cname(), bypassedRoute->links.size());
335 if (src != key.first)
336 get_global_route(src, bypassedRoute->gw_src, links, latency);
337 for (resource::LinkImpl* const& link : bypassedRoute->links) {
338 links.push_back(link);
340 *latency += link->get_latency();
342 if (dst != key.second)
343 get_global_route(bypassedRoute->gw_dst, dst, links, latency);
346 XBT_DEBUG("No bypass route from '%s' to '%s'.", src->get_cname(), dst->get_cname());
350 void NetZoneImpl::get_global_route(NetPoint* src, NetPoint* dst,
351 /* OUT */ std::vector<resource::LinkImpl*>& links, double* latency)
353 RouteCreationArgs route;
355 XBT_DEBUG("Resolve route from '%s' to '%s'", src->get_cname(), dst->get_cname());
357 /* Find how src and dst are interconnected */
358 NetZoneImpl *common_ancestor;
359 NetZoneImpl *src_ancestor;
360 NetZoneImpl *dst_ancestor;
361 find_common_ancestors(src, dst, &common_ancestor, &src_ancestor, &dst_ancestor);
362 XBT_DEBUG("elements_father: common ancestor '%s' src ancestor '%s' dst ancestor '%s'", common_ancestor->get_cname(),
363 src_ancestor->get_cname(), dst_ancestor->get_cname());
365 /* Check whether a direct bypass is defined. If so, use it and bail out */
366 if (common_ancestor->get_bypass_route(src, dst, links, latency))
369 /* If src and dst are in the same netzone, life is good */
370 if (src_ancestor == dst_ancestor) { /* SURF_ROUTING_BASE */
371 route.link_list = std::move(links);
372 common_ancestor->get_local_route(src, dst, &route, latency);
373 links = std::move(route.link_list);
377 /* Not in the same netzone, no bypass. We'll have to find our path between the netzones recursively */
379 common_ancestor->get_local_route(src_ancestor->netpoint_, dst_ancestor->netpoint_, &route, latency);
380 xbt_assert((route.gw_src != nullptr) && (route.gw_dst != nullptr), "Bad gateways for route from '%s' to '%s'.",
381 src->get_cname(), dst->get_cname());
383 /* If source gateway is not our source, we have to recursively find our way up to this point */
384 if (src != route.gw_src)
385 get_global_route(src, route.gw_src, links, latency);
386 for (auto const& link : route.link_list)
387 links.push_back(link);
389 /* If dest gateway is not our destination, we have to recursively find our way from this point */
390 if (route.gw_dst != dst)
391 get_global_route(route.gw_dst, dst, links, latency);
393 } // namespace routing
394 } // namespace kernel
395 } // namespace simgrid