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/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"
15 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_floyd, surf, "Routing part of surf");
17 #define TO_FLOYD_COST(i, j) (cost_table_)[(i) + (j)*table_size]
18 #define TO_FLOYD_PRED(i, j) (predecessor_table_)[(i) + (j)*table_size]
19 #define TO_FLOYD_LINK(i, j) (link_table_)[(i) + (j)*table_size]
25 FloydZone::FloydZone(NetZoneImpl* father, std::string name, resource::NetworkModel* netmodel)
26 : RoutedZone(father, name, netmodel)
28 predecessor_table_ = nullptr;
29 cost_table_ = nullptr;
30 link_table_ = nullptr;
33 FloydZone::~FloydZone()
35 if (link_table_ == nullptr) // Dealing with a parse error in the file?
37 unsigned int table_size = get_table_size();
38 /* Delete link_table */
39 for (unsigned int i = 0; i < table_size; i++)
40 for (unsigned int j = 0; j < table_size; j++)
41 delete TO_FLOYD_LINK(i, j);
44 delete[] predecessor_table_;
48 void FloydZone::get_local_route(NetPoint* src, NetPoint* dst, RouteCreationArgs* route, double* lat)
50 unsigned int table_size = get_table_size();
52 get_route_check_params(src, dst);
54 /* create a result route */
55 std::vector<RouteCreationArgs*> route_stack;
56 unsigned int cur = dst->id();
58 int pred = TO_FLOYD_PRED(src->id(), cur);
60 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->get_cname(), dst->get_cname());
61 route_stack.push_back(TO_FLOYD_LINK(pred, cur));
63 } while (cur != src->id());
65 if (hierarchy_ == RoutingMode::recursive) {
66 route->gw_src = route_stack.back()->gw_src;
67 route->gw_dst = route_stack.front()->gw_dst;
70 NetPoint* prev_dst_gw = nullptr;
71 while (not route_stack.empty()) {
72 RouteCreationArgs* e_route = route_stack.back();
73 route_stack.pop_back();
74 if (hierarchy_ == RoutingMode::recursive && prev_dst_gw != nullptr &&
75 prev_dst_gw->get_cname() != e_route->gw_src->get_cname()) {
76 get_global_route(prev_dst_gw, e_route->gw_src, route->link_list, lat);
79 for (auto const& link : e_route->link_list) {
80 route->link_list.push_back(link);
82 *lat += link->get_latency();
85 prev_dst_gw = e_route->gw_dst;
89 void FloydZone::add_route(NetPoint* src, NetPoint* dst, NetPoint* gw_src, NetPoint* gw_dst,
90 std::vector<resource::LinkImpl*>& link_list, bool symmetrical)
92 /* set the size of table routing */
93 unsigned int table_size = get_table_size();
95 add_route_check_params(src, dst, gw_src, gw_dst, link_list, symmetrical);
97 if (not link_table_) {
98 /* Create Cost, Predecessor and Link tables */
99 cost_table_ = new double[table_size * table_size]; /* link cost from host to host */
100 predecessor_table_ = new int[table_size * table_size]; /* predecessor host numbers */
101 link_table_ = new RouteCreationArgs*[table_size * table_size]; /* actual link between src and dst */
103 /* Initialize costs and predecessors */
104 for (unsigned int i = 0; i < table_size; i++)
105 for (unsigned int j = 0; j < table_size; j++) {
106 TO_FLOYD_COST(i, j) = DBL_MAX;
107 TO_FLOYD_PRED(i, j) = -1;
108 TO_FLOYD_LINK(i, j) = nullptr;
112 /* Check that the route does not already exist */
113 if (gw_dst) // netzone route (to adapt the error message, if any)
114 xbt_assert(nullptr == TO_FLOYD_LINK(src->id(), dst->id()),
115 "The route between %s@%s and %s@%s already exists (Rq: routes are symmetrical by default).",
116 src->get_cname(), gw_src->get_cname(), dst->get_cname(), gw_dst->get_cname());
118 xbt_assert(nullptr == TO_FLOYD_LINK(src->id(), dst->id()),
119 "The route between %s and %s already exists (Rq: routes are symmetrical by default).", src->get_cname(),
122 TO_FLOYD_LINK(src->id(), dst->id()) =
123 new_extended_route(hierarchy_, src, dst, gw_src, gw_dst, link_list, symmetrical, 1);
124 TO_FLOYD_PRED(src->id(), dst->id()) = src->id();
125 TO_FLOYD_COST(src->id(), dst->id()) = (TO_FLOYD_LINK(src->id(), dst->id()))->link_list.size();
127 if (symmetrical == true) {
128 if (gw_dst) // netzone route (to adapt the error message, if any)
130 nullptr == TO_FLOYD_LINK(dst->id(), src->id()),
131 "The route between %s@%s and %s@%s already exists. You should not declare the reverse path as symmetrical.",
132 dst->get_cname(), gw_dst->get_cname(), src->get_cname(), gw_src->get_cname());
134 xbt_assert(nullptr == TO_FLOYD_LINK(dst->id(), src->id()),
135 "The route between %s and %s already exists. You should not declare the reverse path as symmetrical.",
136 dst->get_cname(), src->get_cname());
138 if (gw_dst && gw_src) {
139 NetPoint* gw_tmp = gw_src;
144 if (not gw_src || not gw_dst)
145 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", dst->get_cname(), src->get_cname());
147 XBT_DEBUG("Load NetzoneRoute from \"%s(%s)\" to \"%s(%s)\"", dst->get_cname(), gw_src->get_cname(),
148 src->get_cname(), gw_dst->get_cname());
150 TO_FLOYD_LINK(dst->id(), src->id()) =
151 new_extended_route(hierarchy_, src, dst, gw_src, gw_dst, link_list, symmetrical, 0);
152 TO_FLOYD_PRED(dst->id(), src->id()) = dst->id();
153 TO_FLOYD_COST(dst->id(), src->id()) =
154 (TO_FLOYD_LINK(dst->id(), src->id()))->link_list.size(); /* count of links, old model assume 1 */
158 void FloydZone::seal()
160 /* set the size of table routing */
161 unsigned int table_size = get_table_size();
163 if (not link_table_) {
164 /* Create Cost, Predecessor and Link tables */
165 cost_table_ = new double[table_size * table_size]; /* link cost from host to host */
166 predecessor_table_ = new int[table_size * table_size]; /* predecessor host numbers */
167 link_table_ = new RouteCreationArgs*[table_size * table_size]; /* actual link between src and dst */
169 /* Initialize costs and predecessors */
170 for (unsigned int i = 0; i < table_size; i++)
171 for (unsigned int j = 0; j < table_size; j++) {
172 TO_FLOYD_COST(i, j) = DBL_MAX;
173 TO_FLOYD_PRED(i, j) = -1;
174 TO_FLOYD_LINK(i, j) = nullptr;
178 /* Add the loopback if needed */
179 if (network_model_->loopback_ && hierarchy_ == RoutingMode::base) {
180 for (unsigned int i = 0; i < table_size; i++) {
181 RouteCreationArgs* route = TO_FLOYD_LINK(i, i);
183 route = new RouteCreationArgs();
184 route->link_list.push_back(network_model_->loopback_);
185 TO_FLOYD_LINK(i, i) = route;
186 TO_FLOYD_PRED(i, i) = i;
187 TO_FLOYD_COST(i, i) = 1;
191 /* Calculate path costs */
192 for (unsigned int c = 0; c < table_size; c++) {
193 for (unsigned int a = 0; a < table_size; a++) {
194 for (unsigned int b = 0; b < table_size; b++) {
195 if (TO_FLOYD_COST(a, c) < DBL_MAX && TO_FLOYD_COST(c, b) < DBL_MAX &&
196 (fabs(TO_FLOYD_COST(a, b) - DBL_MAX) < std::numeric_limits<double>::epsilon() ||
197 (TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b) < TO_FLOYD_COST(a, b)))) {
198 TO_FLOYD_COST(a, b) = TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b);
199 TO_FLOYD_PRED(a, b) = TO_FLOYD_PRED(c, b);