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/surf/AsFloyd.hpp"
9 #include "src/surf/network_interface.hpp"
11 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_floyd, surf, "Routing part of surf");
13 #define TO_FLOYD_COST(i,j) (costTable_)[(i)+(j)*table_size]
14 #define TO_FLOYD_PRED(i,j) (predecessorTable_)[(i)+(j)*table_size]
15 #define TO_FLOYD_LINK(i,j) (linkTable_)[(i)+(j)*table_size]
20 AsFloyd::AsFloyd(const char*name)
23 predecessorTable_ = nullptr;
30 int table_size = (int)xbt_dynar_length(vertices_);
31 if (linkTable_ == nullptr) // Dealing with a parse error in the file?
33 /* Delete link_table */
34 for (i = 0; i < table_size; i++)
35 for (j = 0; j < table_size; j++)
36 routing_route_free(TO_FLOYD_LINK(i, j));
39 xbt_free(predecessorTable_);
43 void AsFloyd::getRouteAndLatency(NetCard *src, NetCard *dst, sg_platf_route_cbarg_t route, double *lat)
45 size_t table_size = xbt_dynar_length(vertices_);
47 getRouteCheckParams(src, dst);
49 /* create a result route */
50 xbt_dynar_t route_stack = xbt_dynar_new(sizeof(sg_platf_route_cbarg_t), nullptr);
54 pred = TO_FLOYD_PRED(src->id(), cur);
56 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->name(), dst->name());
57 xbt_dynar_push_as(route_stack, sg_platf_route_cbarg_t, TO_FLOYD_LINK(pred, cur));
59 } while (cur != src->id());
61 if (hierarchy_ == RoutingMode::recursive) {
62 route->gw_src = xbt_dynar_getlast_as(route_stack, sg_platf_route_cbarg_t)->gw_src;
63 route->gw_dst = xbt_dynar_getfirst_as(route_stack, sg_platf_route_cbarg_t)->gw_dst;
66 sg_netcard_t prev_dst_gw = nullptr;
67 while (!xbt_dynar_is_empty(route_stack)) {
68 sg_platf_route_cbarg_t e_route = xbt_dynar_pop_as(route_stack, sg_platf_route_cbarg_t);
70 if (hierarchy_ == RoutingMode::recursive && prev_dst_gw != nullptr && strcmp(prev_dst_gw->name(), e_route->gw_src->name())) {
71 routing_platf->getRouteAndLatency(prev_dst_gw, e_route->gw_src, route->link_list, lat);
74 for (auto link: *e_route->link_list) {
75 route->link_list->push_back(link);
77 *lat += link->getLatency();
80 prev_dst_gw = e_route->gw_dst;
82 xbt_dynar_free(&route_stack);
85 void AsFloyd::addRoute(sg_platf_route_cbarg_t route)
87 /* set the size of table routing */
88 int table_size = (int)xbt_dynar_length(vertices_);
90 addRouteCheckParams(route);
93 /* Create Cost, Predecessor and Link tables */
94 costTable_ = xbt_new0(double, table_size * table_size); /* link cost from host to host */
95 predecessorTable_ = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
96 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
98 /* Initialize costs and predecessors */
99 for (int i = 0; i < table_size; i++)
100 for (int j = 0; j < table_size; j++) {
101 TO_FLOYD_COST(i, j) = DBL_MAX;
102 TO_FLOYD_PRED(i, j) = -1;
103 TO_FLOYD_LINK(i, j) = nullptr;
107 /* Check that the route does not already exist */
108 if (route->gw_dst) // AS route (to adapt the error message, if any)
109 xbt_assert(nullptr == TO_FLOYD_LINK(route->src->id(), route->dst->id()),
110 "The route between %s@%s and %s@%s already exists (Rq: routes are symmetrical by default).",
111 route->src->name(),route->gw_src->name(),route->dst->name(),route->gw_dst->name());
113 xbt_assert(nullptr == TO_FLOYD_LINK(route->src->id(), route->dst->id()),
114 "The route between %s and %s already exists (Rq: routes are symmetrical by default).", route->src->name(),route->dst->name());
116 TO_FLOYD_LINK(route->src->id(), route->dst->id()) = newExtendedRoute(hierarchy_, route, 1);
117 TO_FLOYD_PRED(route->src->id(), route->dst->id()) = route->src->id();
118 TO_FLOYD_COST(route->src->id(), route->dst->id()) = (TO_FLOYD_LINK(route->src->id(), route->dst->id()))->link_list->size();
121 if (route->symmetrical == true) {
122 if (route->gw_dst) // AS route (to adapt the error message, if any)
123 xbt_assert(nullptr == TO_FLOYD_LINK(route->dst->id(), route->src->id()),
124 "The route between %s@%s and %s@%s already exists. You should not declare the reverse path as symmetrical.",
125 route->dst->name(),route->gw_dst->name(),route->src->name(),route->gw_src->name());
127 xbt_assert(nullptr == TO_FLOYD_LINK(route->dst->id(), route->src->id()),
128 "The route between %s and %s already exists. You should not declare the reverse path as symmetrical.",
129 route->dst->name(),route->src->name());
131 if(route->gw_dst && route->gw_src) {
132 NetCard* gw_tmp = route->gw_src;
133 route->gw_src = route->gw_dst;
134 route->gw_dst = gw_tmp;
137 if(!route->gw_src && !route->gw_dst)
138 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", route->dst->name(), route->src->name());
140 XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", route->dst->name(),
141 route->gw_src->name(), route->src->name(), route->gw_dst->name());
143 TO_FLOYD_LINK(route->dst->id(), route->src->id()) = newExtendedRoute(hierarchy_, route, 0);
144 TO_FLOYD_PRED(route->dst->id(), route->src->id()) = route->dst->id();
145 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 */
149 void AsFloyd::seal(){
151 /* set the size of table routing */
152 size_t table_size = xbt_dynar_length(vertices_);
155 /* Create Cost, Predecessor and Link tables */
156 costTable_ = xbt_new0(double, table_size * table_size); /* link cost from host to host */
157 predecessorTable_ = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
158 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
160 /* Initialize costs and predecessors */
161 for (unsigned int i = 0; i < table_size; i++)
162 for (unsigned int j = 0; j < table_size; j++) {
163 TO_FLOYD_COST(i, j) = DBL_MAX;
164 TO_FLOYD_PRED(i, j) = -1;
165 TO_FLOYD_LINK(i, j) = nullptr;
169 /* Add the loopback if needed */
170 if (routing_platf->loopback_ && hierarchy_ == RoutingMode::base) {
171 for (unsigned int i = 0; i < table_size; i++) {
172 sg_platf_route_cbarg_t e_route = TO_FLOYD_LINK(i, i);
174 e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
175 e_route->gw_src = nullptr;
176 e_route->gw_dst = nullptr;
177 e_route->link_list = new std::vector<Link*>();
178 e_route->link_list->push_back(routing_platf->loopback_);
179 TO_FLOYD_LINK(i, i) = e_route;
180 TO_FLOYD_PRED(i, i) = i;
181 TO_FLOYD_COST(i, i) = 1;
185 /* Calculate path costs */
186 for (unsigned int c = 0; c < table_size; c++) {
187 for (unsigned int a = 0; a < table_size; a++) {
188 for (unsigned int b = 0; b < table_size; b++) {
189 if (TO_FLOYD_COST(a, c) < DBL_MAX && TO_FLOYD_COST(c, b) < DBL_MAX) {
190 if (TO_FLOYD_COST(a, b) == DBL_MAX ||
191 (TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b) <
192 TO_FLOYD_COST(a, b))) {
193 TO_FLOYD_COST(a, b) =
194 TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b);
195 TO_FLOYD_PRED(a, b) = TO_FLOYD_PRED(c, b);