1 /* Copyright (c) 2009-2019. 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/FloydZone.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"
11 #include "xbt/string.hpp"
16 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_floyd, surf, "Routing part of surf");
18 #define TO_FLOYD_COST(i, j) (cost_table_)[(i) + (j)*table_size]
19 #define TO_FLOYD_PRED(i, j) (predecessor_table_)[(i) + (j)*table_size]
20 #define TO_FLOYD_LINK(i, j) (link_table_)[(i) + (j)*table_size]
26 FloydZone::FloydZone(NetZoneImpl* father, const std::string& name, resource::NetworkModel* netmodel)
27 : RoutedZone(father, name, netmodel)
29 predecessor_table_ = nullptr;
30 cost_table_ = nullptr;
31 link_table_ = nullptr;
34 FloydZone::~FloydZone()
36 if (link_table_ == nullptr) // Dealing with a parse error in the file?
38 unsigned int table_size = get_table_size();
39 /* Delete link_table */
40 for (unsigned int i = 0; i < table_size; i++)
41 for (unsigned int j = 0; j < table_size; j++)
42 delete TO_FLOYD_LINK(i, j);
45 delete[] predecessor_table_;
49 void FloydZone::get_local_route(NetPoint* src, NetPoint* dst, RouteCreationArgs* route, double* lat)
51 unsigned int table_size = get_table_size();
53 get_route_check_params(src, dst);
55 /* create a result route */
56 std::vector<RouteCreationArgs*> route_stack;
57 unsigned int cur = dst->id();
59 int pred = TO_FLOYD_PRED(src->id(), cur);
61 throw std::invalid_argument(xbt::string_printf("No route from '%s' to '%s'", src->get_cname(), dst->get_cname()));
62 route_stack.push_back(TO_FLOYD_LINK(pred, cur));
64 } while (cur != src->id());
66 if (hierarchy_ == RoutingMode::recursive) {
67 route->gw_src = route_stack.back()->gw_src;
68 route->gw_dst = route_stack.front()->gw_dst;
71 NetPoint* prev_dst_gw = nullptr;
72 while (not route_stack.empty()) {
73 RouteCreationArgs* e_route = route_stack.back();
74 route_stack.pop_back();
75 if (hierarchy_ == RoutingMode::recursive && prev_dst_gw != nullptr &&
76 prev_dst_gw->get_cname() != e_route->gw_src->get_cname()) {
77 get_global_route(prev_dst_gw, e_route->gw_src, route->link_list, lat);
80 for (auto const& link : e_route->link_list) {
81 route->link_list.push_back(link);
83 *lat += link->get_latency();
86 prev_dst_gw = e_route->gw_dst;
90 void FloydZone::add_route(NetPoint* src, NetPoint* dst, NetPoint* gw_src, NetPoint* gw_dst,
91 std::vector<resource::LinkImpl*>& link_list, bool symmetrical)
93 /* set the size of table routing */
94 unsigned int table_size = get_table_size();
96 add_route_check_params(src, dst, gw_src, gw_dst, link_list, symmetrical);
98 if (not link_table_) {
99 /* Create Cost, Predecessor and Link tables */
100 cost_table_ = new double[table_size * table_size]; /* link cost from host to host */
101 predecessor_table_ = new int[table_size * table_size]; /* predecessor host numbers */
102 link_table_ = new RouteCreationArgs*[table_size * table_size]; /* actual link between src and dst */
104 /* Initialize costs and predecessors */
105 for (unsigned int i = 0; i < table_size; i++)
106 for (unsigned int j = 0; j < table_size; j++) {
107 TO_FLOYD_COST(i, j) = DBL_MAX;
108 TO_FLOYD_PRED(i, j) = -1;
109 TO_FLOYD_LINK(i, j) = nullptr;
113 /* Check that the route does not already exist */
114 if (gw_dst) // netzone route (to adapt the error message, if any)
115 xbt_assert(nullptr == TO_FLOYD_LINK(src->id(), dst->id()),
116 "The route between %s@%s and %s@%s already exists (Rq: routes are symmetrical by default).",
117 src->get_cname(), gw_src->get_cname(), dst->get_cname(), gw_dst->get_cname());
119 xbt_assert(nullptr == TO_FLOYD_LINK(src->id(), dst->id()),
120 "The route between %s and %s already exists (Rq: routes are symmetrical by default).", src->get_cname(),
123 TO_FLOYD_LINK(src->id(), dst->id()) =
124 new_extended_route(hierarchy_, src, dst, gw_src, gw_dst, link_list, symmetrical, 1);
125 TO_FLOYD_PRED(src->id(), dst->id()) = src->id();
126 TO_FLOYD_COST(src->id(), dst->id()) = (TO_FLOYD_LINK(src->id(), dst->id()))->link_list.size();
128 if (symmetrical == true) {
129 if (gw_dst) // netzone route (to adapt the error message, if any)
131 nullptr == TO_FLOYD_LINK(dst->id(), src->id()),
132 "The route between %s@%s and %s@%s already exists. You should not declare the reverse path as symmetrical.",
133 dst->get_cname(), gw_dst->get_cname(), src->get_cname(), gw_src->get_cname());
135 xbt_assert(nullptr == TO_FLOYD_LINK(dst->id(), src->id()),
136 "The route between %s and %s already exists. You should not declare the reverse path as symmetrical.",
137 dst->get_cname(), src->get_cname());
139 if (gw_dst && gw_src) {
140 NetPoint* gw_tmp = gw_src;
145 if (not gw_src || not gw_dst)
146 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", dst->get_cname(), src->get_cname());
148 XBT_DEBUG("Load NetzoneRoute from \"%s(%s)\" to \"%s(%s)\"", dst->get_cname(), gw_src->get_cname(),
149 src->get_cname(), gw_dst->get_cname());
151 TO_FLOYD_LINK(dst->id(), src->id()) =
152 new_extended_route(hierarchy_, src, dst, gw_src, gw_dst, link_list, symmetrical, 0);
153 TO_FLOYD_PRED(dst->id(), src->id()) = dst->id();
154 TO_FLOYD_COST(dst->id(), src->id()) =
155 (TO_FLOYD_LINK(dst->id(), src->id()))->link_list.size(); /* count of links, old model assume 1 */
159 void FloydZone::seal()
161 /* set the size of table routing */
162 unsigned int table_size = get_table_size();
164 if (not link_table_) {
165 /* Create Cost, Predecessor and Link tables */
166 cost_table_ = new double[table_size * table_size]; /* link cost from host to host */
167 predecessor_table_ = new int[table_size * table_size]; /* predecessor host numbers */
168 link_table_ = new RouteCreationArgs*[table_size * table_size]; /* actual link between src and dst */
170 /* Initialize costs and predecessors */
171 for (unsigned int i = 0; i < table_size; i++)
172 for (unsigned int j = 0; j < table_size; j++) {
173 TO_FLOYD_COST(i, j) = DBL_MAX;
174 TO_FLOYD_PRED(i, j) = -1;
175 TO_FLOYD_LINK(i, j) = nullptr;
179 /* Add the loopback if needed */
180 if (network_model_->loopback_ && hierarchy_ == RoutingMode::base) {
181 for (unsigned int i = 0; i < table_size; i++) {
182 RouteCreationArgs* route = TO_FLOYD_LINK(i, i);
184 route = new RouteCreationArgs();
185 route->link_list.push_back(network_model_->loopback_);
186 TO_FLOYD_LINK(i, i) = route;
187 TO_FLOYD_PRED(i, i) = i;
188 TO_FLOYD_COST(i, i) = 1;
192 /* Calculate path costs */
193 for (unsigned int c = 0; c < table_size; c++) {
194 for (unsigned int a = 0; a < table_size; a++) {
195 for (unsigned int b = 0; b < table_size; b++) {
196 if (TO_FLOYD_COST(a, c) < DBL_MAX && TO_FLOYD_COST(c, b) < DBL_MAX &&
197 (fabs(TO_FLOYD_COST(a, b) - DBL_MAX) < std::numeric_limits<double>::epsilon() ||
198 (TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b) < TO_FLOYD_COST(a, b)))) {
199 TO_FLOYD_COST(a, b) = TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b);
200 TO_FLOYD_PRED(a, b) = TO_FLOYD_PRED(c, b);