1 /* Copyright (c) 2009-2016. 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. */
8 #include "src/kernel/routing/FloydZone.hpp"
9 #include "src/kernel/routing/NetCard.hpp"
10 #include "src/surf/network_interface.hpp"
13 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_floyd, surf, "Routing part of surf");
15 #define TO_FLOYD_COST(i, j) (costTable_)[(i) + (j)*table_size]
16 #define TO_FLOYD_PRED(i, j) (predecessorTable_)[(i) + (j)*table_size]
17 #define TO_FLOYD_LINK(i, j) (linkTable_)[(i) + (j)*table_size]
23 AsFloyd::AsFloyd(As* father, const char* name) : AsRoutedGraph(father, name)
25 predecessorTable_ = nullptr;
32 if (linkTable_ == nullptr) // Dealing with a parse error in the file?
34 int table_size = vertices_.size();
35 /* Delete link_table */
36 for (int i = 0; i < table_size; i++)
37 for (int j = 0; j < table_size; j++)
38 routing_route_free(TO_FLOYD_LINK(i, j));
41 xbt_free(predecessorTable_);
45 void AsFloyd::getLocalRoute(NetCard* src, NetCard* dst, sg_platf_route_cbarg_t route, double* lat)
47 size_t table_size = vertices_.size();
49 getRouteCheckParams(src, dst);
51 /* create a result route */
52 std::vector<sg_platf_route_cbarg_t> route_stack;
53 unsigned int cur = dst->id();
55 int pred = TO_FLOYD_PRED(src->id(), cur);
57 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->name().c_str(), dst->name().c_str());
58 route_stack.push_back(TO_FLOYD_LINK(pred, cur));
60 } while (cur != src->id());
62 if (hierarchy_ == RoutingMode::recursive) {
63 route->gw_src = route_stack.back()->gw_src;
64 route->gw_dst = route_stack.front()->gw_dst;
67 sg_netcard_t prev_dst_gw = nullptr;
68 while (!route_stack.empty()) {
69 sg_platf_route_cbarg_t e_route = route_stack.back();
70 route_stack.pop_back();
71 if (hierarchy_ == RoutingMode::recursive && prev_dst_gw != nullptr &&
72 strcmp(prev_dst_gw->name().c_str(), e_route->gw_src->name().c_str())) {
73 getGlobalRoute(prev_dst_gw, e_route->gw_src, route->link_list, lat);
76 for (auto link : *e_route->link_list) {
77 route->link_list->push_back(link);
79 *lat += link->latency();
82 prev_dst_gw = e_route->gw_dst;
86 void AsFloyd::addRoute(sg_platf_route_cbarg_t route)
88 /* set the size of table routing */
89 int table_size = static_cast<int>(vertices_.size());
91 addRouteCheckParams(route);
94 /* Create Cost, Predecessor and Link tables */
95 costTable_ = xbt_new0(double, table_size* table_size); /* link cost from host to host */
96 predecessorTable_ = xbt_new0(int, table_size* table_size); /* predecessor host numbers */
97 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
99 /* Initialize costs and predecessors */
100 for (int i = 0; i < table_size; i++)
101 for (int j = 0; j < table_size; j++) {
102 TO_FLOYD_COST(i, j) = DBL_MAX;
103 TO_FLOYD_PRED(i, j) = -1;
104 TO_FLOYD_LINK(i, j) = nullptr;
108 /* Check that the route does not already exist */
109 if (route->gw_dst) // AS route (to adapt the error message, if any)
110 xbt_assert(nullptr == TO_FLOYD_LINK(route->src->id(), route->dst->id()),
111 "The route between %s@%s and %s@%s already exists (Rq: routes are symmetrical by default).",
112 route->src->name().c_str(), route->gw_src->name().c_str(), route->dst->name().c_str(),
113 route->gw_dst->name().c_str());
115 xbt_assert(nullptr == TO_FLOYD_LINK(route->src->id(), route->dst->id()),
116 "The route between %s and %s already exists (Rq: routes are symmetrical by default).",
117 route->src->name().c_str(), route->dst->name().c_str());
119 TO_FLOYD_LINK(route->src->id(), route->dst->id()) = newExtendedRoute(hierarchy_, route, 1);
120 TO_FLOYD_PRED(route->src->id(), route->dst->id()) = route->src->id();
121 TO_FLOYD_COST(route->src->id(), route->dst->id()) =
122 (TO_FLOYD_LINK(route->src->id(), route->dst->id()))->link_list->size();
124 if (route->symmetrical == true) {
125 if (route->gw_dst) // AS route (to adapt the error message, if any)
127 nullptr == TO_FLOYD_LINK(route->dst->id(), route->src->id()),
128 "The route between %s@%s and %s@%s already exists. You should not declare the reverse path as symmetrical.",
129 route->dst->name().c_str(), route->gw_dst->name().c_str(), route->src->name().c_str(),
130 route->gw_src->name().c_str());
132 xbt_assert(nullptr == TO_FLOYD_LINK(route->dst->id(), route->src->id()),
133 "The route between %s and %s already exists. You should not declare the reverse path as symmetrical.",
134 route->dst->name().c_str(), route->src->name().c_str());
136 if (route->gw_dst && route->gw_src) {
137 NetCard* gw_tmp = route->gw_src;
138 route->gw_src = route->gw_dst;
139 route->gw_dst = gw_tmp;
142 if (!route->gw_src && !route->gw_dst)
143 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", route->dst->name().c_str(), route->src->name().c_str());
145 XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", route->dst->name().c_str(), route->gw_src->name().c_str(),
146 route->src->name().c_str(), route->gw_dst->name().c_str());
148 TO_FLOYD_LINK(route->dst->id(), route->src->id()) = newExtendedRoute(hierarchy_, route, 0);
149 TO_FLOYD_PRED(route->dst->id(), route->src->id()) = route->dst->id();
150 TO_FLOYD_COST(route->dst->id(), route->src->id()) =
151 (TO_FLOYD_LINK(route->dst->id(), route->src->id()))->link_list->size(); /* count of links, old model assume 1 */
157 /* set the size of table routing */
158 size_t table_size = vertices_.size();
161 /* Create Cost, Predecessor and Link tables */
162 costTable_ = xbt_new0(double, table_size* table_size); /* link cost from host to host */
163 predecessorTable_ = xbt_new0(int, table_size* table_size); /* predecessor host numbers */
164 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
166 /* Initialize costs and predecessors */
167 for (unsigned int i = 0; i < table_size; i++)
168 for (unsigned int j = 0; j < table_size; j++) {
169 TO_FLOYD_COST(i, j) = DBL_MAX;
170 TO_FLOYD_PRED(i, j) = -1;
171 TO_FLOYD_LINK(i, j) = nullptr;
175 /* Add the loopback if needed */
176 if (surf_network_model->loopback_ && hierarchy_ == RoutingMode::base) {
177 for (unsigned int i = 0; i < table_size; i++) {
178 sg_platf_route_cbarg_t e_route = TO_FLOYD_LINK(i, i);
180 e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
181 e_route->gw_src = nullptr;
182 e_route->gw_dst = nullptr;
183 e_route->link_list = new std::vector<Link*>();
184 e_route->link_list->push_back(surf_network_model->loopback_);
185 TO_FLOYD_LINK(i, i) = e_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 if (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);