1 /* Copyright (c) 2009-2020. 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/FullZone.hpp"
7 #include "simgrid/kernel/routing/NetPoint.hpp"
8 #include "src/surf/network_interface.hpp"
9 #include "src/surf/xml/platf_private.hpp"
10 #include "surf/surf.hpp"
12 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_full, surf, "Routing part of surf");
14 #define TO_ROUTE_FULL(i, j) routing_table_[(i) + (j)*table_size]
19 FullZone::FullZone(NetZoneImpl* father, const std::string& name, resource::NetworkModel* netmodel)
20 : RoutedZone(father, name, netmodel)
26 unsigned int table_size = get_table_size();
28 /* Create table if needed */
29 if (not routing_table_)
30 routing_table_ = new RouteCreationArgs*[table_size * table_size]();
32 /* Add the loopback if needed */
33 if (network_model_->loopback_ && hierarchy_ == RoutingMode::base) {
34 for (unsigned int i = 0; i < table_size; i++) {
35 RouteCreationArgs* route = TO_ROUTE_FULL(i, i);
37 route = new RouteCreationArgs();
38 route->link_list.push_back(network_model_->loopback_);
39 TO_ROUTE_FULL(i, i) = route;
48 unsigned int table_size = get_table_size();
49 /* Delete routing table */
50 for (unsigned int i = 0; i < table_size; i++)
51 for (unsigned int j = 0; j < table_size; j++)
52 delete TO_ROUTE_FULL(i, j);
53 delete[] routing_table_;
57 void FullZone::get_local_route(NetPoint* src, NetPoint* dst, RouteCreationArgs* res, double* lat)
59 XBT_DEBUG("full getLocalRoute from %s[%u] to %s[%u]", src->get_cname(), src->id(), dst->get_cname(), dst->id());
61 unsigned int table_size = get_table_size();
62 const RouteCreationArgs* e_route = TO_ROUTE_FULL(src->id(), dst->id());
64 if (e_route != nullptr) {
65 res->gw_src = e_route->gw_src;
66 res->gw_dst = e_route->gw_dst;
67 for (auto const& link : e_route->link_list) {
68 res->link_list.push_back(link);
70 *lat += link->get_latency();
75 void FullZone::add_route(NetPoint* src, NetPoint* dst, NetPoint* gw_src, NetPoint* gw_dst,
76 std::vector<resource::LinkImpl*>& link_list, bool symmetrical)
78 add_route_check_params(src, dst, gw_src, gw_dst, link_list, symmetrical);
80 unsigned int table_size = get_table_size();
82 if (not routing_table_)
83 routing_table_ = new RouteCreationArgs*[table_size * table_size]();
85 /* Check that the route does not already exist */
86 if (gw_dst) // inter-zone route (to adapt the error message, if any)
87 xbt_assert(nullptr == TO_ROUTE_FULL(src->id(), dst->id()),
88 "The route between %s@%s and %s@%s already exists (Rq: routes are symmetrical by default).",
89 src->get_cname(), gw_src->get_cname(), dst->get_cname(), gw_dst->get_cname());
91 xbt_assert(nullptr == TO_ROUTE_FULL(src->id(), dst->id()),
92 "The route between %s and %s already exists (Rq: routes are symmetrical by default).", src->get_cname(),
95 /* Add the route to the base */
96 TO_ROUTE_FULL(src->id(), dst->id()) =
97 new_extended_route(hierarchy_, src, dst, gw_src, gw_dst, link_list, symmetrical, true);
99 if (symmetrical == true && src != dst) {
100 if (gw_dst && gw_src) {
101 NetPoint* gw_tmp = gw_src;
105 if (gw_dst && gw_src) // inter-zone route (to adapt the error message, if any)
107 nullptr == TO_ROUTE_FULL(dst->id(), src->id()),
108 "The route between %s@%s and %s@%s already exists. You should not declare the reverse path as symmetrical.",
109 dst->get_cname(), gw_dst->get_cname(), src->get_cname(), gw_src->get_cname());
111 xbt_assert(nullptr == TO_ROUTE_FULL(dst->id(), src->id()),
112 "The route between %s and %s already exists. You should not declare the reverse path as symmetrical.",
113 dst->get_cname(), src->get_cname());
115 TO_ROUTE_FULL(dst->id(), src->id()) =
116 new_extended_route(hierarchy_, src, dst, gw_src, gw_dst, link_list, symmetrical, false);