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_ = NULL;
30 int table_size = (int)xbt_dynar_length(vertices_);
31 if (linkTable_ == NULL) // 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), NULL);
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 = NULL;
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 != NULL && 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 NetCard *src = sg_netcard_by_name_or_null(route->src);
91 NetCard *dst = sg_netcard_by_name_or_null(route->dst);
93 addRouteCheckParams(route);
96 /* Create Cost, Predecessor and Link tables */
97 costTable_ = xbt_new0(double, table_size * table_size); /* link cost from host to host */
98 predecessorTable_ = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
99 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
101 /* Initialize costs and predecessors */
102 for (int i = 0; i < table_size; i++)
103 for (int j = 0; j < table_size; j++) {
104 TO_FLOYD_COST(i, j) = DBL_MAX;
105 TO_FLOYD_PRED(i, j) = -1;
106 TO_FLOYD_LINK(i, j) = NULL;
110 /* Check that the route does not already exist */
111 if (route->gw_dst) // AS route (to adapt the error message, if any)
112 xbt_assert(nullptr == TO_FLOYD_LINK(src->id(), dst->id()),
113 "The route between %s@%s and %s@%s already exists (Rq: routes are symmetrical by default).",
114 src->name(),route->gw_src->name(),dst->name(),route->gw_dst->name());
116 xbt_assert(nullptr == TO_FLOYD_LINK(src->id(), dst->id()),
117 "The route between %s and %s already exists (Rq: routes are symmetrical by default).", src->name(),dst->name());
119 TO_FLOYD_LINK(src->id(), dst->id()) = newExtendedRoute(hierarchy_, route, 1);
120 TO_FLOYD_PRED(src->id(), dst->id()) = src->id();
121 TO_FLOYD_COST(src->id(), dst->id()) = (TO_FLOYD_LINK(src->id(), dst->id()))->link_list->size();
124 if (route->symmetrical == true) {
125 if (route->gw_dst) // AS route (to adapt the error message, if any)
126 xbt_assert(nullptr == TO_FLOYD_LINK(dst->id(), src->id()),
127 "The route between %s@%s and %s@%s already exists. You should not declare the reverse path as symmetrical.",
128 dst->name(),route->gw_dst->name(),src->name(),route->gw_src->name());
130 xbt_assert(nullptr == TO_FLOYD_LINK(dst->id(), src->id()),
131 "The route between %s and %s already exists. You should not declare the reverse path as symmetrical.",
132 dst->name(),src->name());
134 if(route->gw_dst && route->gw_src) {
135 NetCard* gw_tmp = route->gw_src;
136 route->gw_src = route->gw_dst;
137 route->gw_dst = gw_tmp;
140 if(!route->gw_src && !route->gw_dst)
141 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", dst->name(), src->name());
143 XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", dst->name(),
144 route->gw_src->name(), src->name(), route->gw_dst->name());
146 TO_FLOYD_LINK(dst->id(), src->id()) = newExtendedRoute(hierarchy_, route, 0);
147 TO_FLOYD_PRED(dst->id(), src->id()) = dst->id();
148 TO_FLOYD_COST(dst->id(), src->id()) = (TO_FLOYD_LINK(dst->id(), src->id()))->link_list->size(); /* count of links, old model assume 1 */
152 void AsFloyd::Seal(){
154 /* set the size of table routing */
155 size_t table_size = xbt_dynar_length(vertices_);
158 /* Create Cost, Predecessor and Link tables */
159 costTable_ = xbt_new0(double, table_size * table_size); /* link cost from host to host */
160 predecessorTable_ = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
161 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
163 /* Initialize costs and predecessors */
164 for (unsigned int i = 0; i < table_size; i++)
165 for (unsigned int j = 0; j < table_size; j++) {
166 TO_FLOYD_COST(i, j) = DBL_MAX;
167 TO_FLOYD_PRED(i, j) = -1;
168 TO_FLOYD_LINK(i, j) = NULL;
172 /* Add the loopback if needed */
173 if (routing_platf->loopback_ && hierarchy_ == RoutingMode::base) {
174 for (unsigned int i = 0; i < table_size; i++) {
175 sg_platf_route_cbarg_t e_route = TO_FLOYD_LINK(i, i);
177 e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
178 e_route->gw_src = NULL;
179 e_route->gw_dst = NULL;
180 e_route->link_list = new std::vector<Link*>();
181 e_route->link_list->push_back(routing_platf->loopback_);
182 TO_FLOYD_LINK(i, i) = e_route;
183 TO_FLOYD_PRED(i, i) = i;
184 TO_FLOYD_COST(i, i) = 1;
188 /* Calculate path costs */
189 for (unsigned int c = 0; c < table_size; c++) {
190 for (unsigned int a = 0; a < table_size; a++) {
191 for (unsigned int b = 0; b < table_size; b++) {
192 if (TO_FLOYD_COST(a, c) < DBL_MAX && TO_FLOYD_COST(c, b) < DBL_MAX) {
193 if (TO_FLOYD_COST(a, b) == DBL_MAX ||
194 (TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b) <
195 TO_FLOYD_COST(a, b))) {
196 TO_FLOYD_COST(a, b) =
197 TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b);
198 TO_FLOYD_PRED(a, b) = TO_FLOYD_PRED(c, b);