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. */
7 #include "src/kernel/routing/AsFloyd.hpp"
8 #include "src/surf/network_interface.hpp"
10 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_floyd, surf, "Routing part of surf");
12 #define TO_FLOYD_COST(i,j) (costTable_)[(i)+(j)*table_size]
13 #define TO_FLOYD_PRED(i,j) (predecessorTable_)[(i)+(j)*table_size]
14 #define TO_FLOYD_LINK(i,j) (linkTable_)[(i)+(j)*table_size]
20 AsFloyd::AsFloyd(const char*name)
23 predecessorTable_ = nullptr;
29 int table_size = static_cast<int>(vertices_.size());
30 if (linkTable_ == nullptr) // Dealing with a parse error in the file?
32 /* Delete link_table */
33 for (int i = 0; i < table_size; i++)
34 for (int j = 0; j < table_size; j++)
35 routing_route_free(TO_FLOYD_LINK(i, j));
38 xbt_free(predecessorTable_);
42 void AsFloyd::getRouteAndLatency(NetCard *src, NetCard *dst, sg_platf_route_cbarg_t route, double *lat)
44 size_t table_size = vertices_.size();
46 getRouteCheckParams(src, dst);
48 /* create a result route */
49 std::vector<sg_platf_route_cbarg_t> route_stack;
51 unsigned int cur = dst->id();
53 pred = TO_FLOYD_PRED(src->id(), cur);
55 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->name(), dst->name());
56 route_stack.push_back(TO_FLOYD_LINK(pred, cur));
58 } while (cur != src->id());
60 if (hierarchy_ == RoutingMode::recursive) {
61 route->gw_src = route_stack.back()->gw_src;
62 route->gw_dst = route_stack.front()->gw_dst;
65 sg_netcard_t prev_dst_gw = nullptr;
66 while (!route_stack.empty()) {
67 sg_platf_route_cbarg_t e_route = route_stack.back();
68 route_stack.pop_back();
69 if (hierarchy_ == RoutingMode::recursive && prev_dst_gw != nullptr && strcmp(prev_dst_gw->name(), e_route->gw_src->name())) {
70 routing_platf->getRouteAndLatency(prev_dst_gw, e_route->gw_src, route->link_list, lat);
73 for (auto link: *e_route->link_list) {
74 route->link_list->push_back(link);
76 *lat += link->getLatency();
79 prev_dst_gw = e_route->gw_dst;
83 void AsFloyd::addRoute(sg_platf_route_cbarg_t route)
85 /* set the size of table routing */
86 int table_size = static_cast<int>(vertices_.size());
88 addRouteCheckParams(route);
91 /* Create Cost, Predecessor and Link tables */
92 costTable_ = xbt_new0(double, table_size * table_size); /* link cost from host to host */
93 predecessorTable_ = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
94 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
96 /* Initialize costs and predecessors */
97 for (int i = 0; i < table_size; i++)
98 for (int j = 0; j < table_size; j++) {
99 TO_FLOYD_COST(i, j) = DBL_MAX;
100 TO_FLOYD_PRED(i, j) = -1;
101 TO_FLOYD_LINK(i, j) = nullptr;
105 /* Check that the route does not already exist */
106 if (route->gw_dst) // AS route (to adapt the error message, if any)
107 xbt_assert(nullptr == TO_FLOYD_LINK(route->src->id(), route->dst->id()),
108 "The route between %s@%s and %s@%s already exists (Rq: routes are symmetrical by default).",
109 route->src->name(),route->gw_src->name(),route->dst->name(),route->gw_dst->name());
111 xbt_assert(nullptr == TO_FLOYD_LINK(route->src->id(), route->dst->id()),
112 "The route between %s and %s already exists (Rq: routes are symmetrical by default).", route->src->name(),route->dst->name());
114 TO_FLOYD_LINK(route->src->id(), route->dst->id()) = newExtendedRoute(hierarchy_, route, 1);
115 TO_FLOYD_PRED(route->src->id(), route->dst->id()) = route->src->id();
116 TO_FLOYD_COST(route->src->id(), route->dst->id()) = (TO_FLOYD_LINK(route->src->id(), route->dst->id()))->link_list->size();
119 if (route->symmetrical == true) {
120 if (route->gw_dst) // AS route (to adapt the error message, if any)
121 xbt_assert(nullptr == TO_FLOYD_LINK(route->dst->id(), route->src->id()),
122 "The route between %s@%s and %s@%s already exists. You should not declare the reverse path as symmetrical.",
123 route->dst->name(),route->gw_dst->name(),route->src->name(),route->gw_src->name());
125 xbt_assert(nullptr == TO_FLOYD_LINK(route->dst->id(), route->src->id()),
126 "The route between %s and %s already exists. You should not declare the reverse path as symmetrical.",
127 route->dst->name(),route->src->name());
129 if(route->gw_dst && route->gw_src) {
130 NetCard* gw_tmp = route->gw_src;
131 route->gw_src = route->gw_dst;
132 route->gw_dst = gw_tmp;
135 if(!route->gw_src && !route->gw_dst)
136 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", route->dst->name(), route->src->name());
138 XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", route->dst->name(),
139 route->gw_src->name(), route->src->name(), route->gw_dst->name());
141 TO_FLOYD_LINK(route->dst->id(), route->src->id()) = newExtendedRoute(hierarchy_, route, 0);
142 TO_FLOYD_PRED(route->dst->id(), route->src->id()) = route->dst->id();
143 TO_FLOYD_COST(route->dst->id(), route->src->id()) = (TO_FLOYD_LINK(route->dst->id(), route->src->id()))->link_list->size(); /* count of links, old model assume 1 */
147 void AsFloyd::seal(){
148 /* set the size of table routing */
149 size_t table_size = vertices_.size();
152 /* Create Cost, Predecessor and Link tables */
153 costTable_ = xbt_new0(double, table_size * table_size); /* link cost from host to host */
154 predecessorTable_ = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
155 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
157 /* Initialize costs and predecessors */
158 for (unsigned int i = 0; i < table_size; i++)
159 for (unsigned int j = 0; j < table_size; j++) {
160 TO_FLOYD_COST(i, j) = DBL_MAX;
161 TO_FLOYD_PRED(i, j) = -1;
162 TO_FLOYD_LINK(i, j) = nullptr;
166 /* Add the loopback if needed */
167 if (routing_platf->loopback_ && hierarchy_ == RoutingMode::base) {
168 for (unsigned int i = 0; i < table_size; i++) {
169 sg_platf_route_cbarg_t e_route = TO_FLOYD_LINK(i, i);
171 e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
172 e_route->gw_src = nullptr;
173 e_route->gw_dst = nullptr;
174 e_route->link_list = new std::vector<Link*>();
175 e_route->link_list->push_back(routing_platf->loopback_);
176 TO_FLOYD_LINK(i, i) = e_route;
177 TO_FLOYD_PRED(i, i) = i;
178 TO_FLOYD_COST(i, i) = 1;
182 /* Calculate path costs */
183 for (unsigned int c = 0; c < table_size; c++) {
184 for (unsigned int a = 0; a < table_size; a++) {
185 for (unsigned int b = 0; b < table_size; b++) {
186 if (TO_FLOYD_COST(a, c) < DBL_MAX && TO_FLOYD_COST(c, b) < DBL_MAX) {
187 if (fabs(TO_FLOYD_COST(a, b) - DBL_MAX) < std::numeric_limits<double>::epsilon() ||
188 (TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b) < TO_FLOYD_COST(a, b))) {
189 TO_FLOYD_COST(a, b) = TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b);
190 TO_FLOYD_PRED(a, b) = TO_FLOYD_PRED(c, b);