1 /* Copyright (c) 2009-2018. 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(NetZone* father, std::string name) : RoutedZone(father, name)
25 unsigned int table_size = get_table_size();
27 /* Create table if needed */
28 if (not routing_table_)
29 routing_table_ = new RouteCreationArgs*[table_size * table_size]();
31 /* Add the loopback if needed */
32 if (surf_network_model->loopback_ && hierarchy_ == RoutingMode::base) {
33 for (unsigned int i = 0; i < table_size; i++) {
34 RouteCreationArgs* e_route = TO_ROUTE_FULL(i, i);
36 e_route = new RouteCreationArgs();
37 e_route->link_list.push_back(surf_network_model->loopback_);
38 TO_ROUTE_FULL(i, i) = e_route;
47 unsigned int table_size = get_table_size();
48 /* Delete routing table */
49 for (unsigned int i = 0; i < table_size; i++)
50 for (unsigned int j = 0; j < table_size; j++)
51 delete TO_ROUTE_FULL(i, j);
52 delete[] routing_table_;
56 void FullZone::get_local_route(NetPoint* src, NetPoint* dst, RouteCreationArgs* res, double* lat)
58 XBT_DEBUG("full getLocalRoute from %s[%u] to %s[%u]", src->get_cname(), src->id(), dst->get_cname(), dst->id());
60 unsigned int table_size = get_table_size();
61 RouteCreationArgs* e_route = TO_ROUTE_FULL(src->id(), dst->id());
63 if (e_route != nullptr) {
64 res->gw_src = e_route->gw_src;
65 res->gw_dst = e_route->gw_dst;
66 for (auto const& link : e_route->link_list) {
67 res->link_list.push_back(link);
69 *lat += link->get_latency();
74 void FullZone::add_route(NetPoint* src, NetPoint* dst, NetPoint* gw_src, NetPoint* gw_dst,
75 std::vector<resource::LinkImpl*>& link_list, bool symmetrical)
77 add_route_check_params(src, dst, gw_src, gw_dst, link_list, symmetrical);
79 unsigned int table_size = get_table_size();
81 if (not routing_table_)
82 routing_table_ = new RouteCreationArgs*[table_size * table_size]();
84 /* Check that the route does not already exist */
85 if (gw_dst) // inter-zone route (to adapt the error message, if any)
86 xbt_assert(nullptr == TO_ROUTE_FULL(src->id(), dst->id()),
87 "The route between %s@%s and %s@%s already exists (Rq: routes are symmetrical by default).",
88 src->get_cname(), gw_src->get_cname(), dst->get_cname(), gw_dst->get_cname());
90 xbt_assert(nullptr == TO_ROUTE_FULL(src->id(), dst->id()),
91 "The route between %s and %s already exists (Rq: routes are symmetrical by default).", src->get_cname(),
94 /* Add the route to the base */
95 TO_ROUTE_FULL(src->id(), dst->id()) =
96 new_extended_route(hierarchy_, src, dst, gw_src, gw_dst, link_list, symmetrical, true);
98 if (symmetrical == true && src != dst) {
99 if (gw_dst && gw_src) {
100 NetPoint* gw_tmp = gw_src;
104 if (gw_dst && gw_src) // inter-zone route (to adapt the error message, if any)
106 nullptr == TO_ROUTE_FULL(dst->id(), src->id()),
107 "The route between %s@%s and %s@%s already exists. You should not declare the reverse path as symmetrical.",
108 dst->get_cname(), gw_dst->get_cname(), src->get_cname(), gw_src->get_cname());
110 xbt_assert(nullptr == TO_ROUTE_FULL(dst->id(), src->id()),
111 "The route between %s and %s already exists. You should not declare the reverse path as symmetrical.",
112 dst->get_cname(), src->get_cname());
114 TO_ROUTE_FULL(dst->id(), src->id()) =
115 new_extended_route(hierarchy_, src, dst, gw_src, gw_dst, link_list, symmetrical, false);