1 /* Copyright (c) 2009-2015. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
7 #include "src/surf/surf_routing_floyd.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]
19 AsFloyd::AsFloyd(const char*name)
22 predecessorTable_ = NULL;
29 int table_size = (int)xbt_dynar_length(vertices_);
30 if (linkTable_ == NULL) // Dealing with a parse error in the file?
32 /* Delete link_table */
33 for (i = 0; i < table_size; i++)
34 for (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 = xbt_dynar_length(vertices_);
46 getRouteCheckParams(src, dst);
48 /* create a result route */
49 xbt_dynar_t route_stack = xbt_dynar_new(sizeof(sg_platf_route_cbarg_t), NULL);
53 pred = TO_FLOYD_PRED(src->id(), cur);
55 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->name(), dst->name());
56 xbt_dynar_push_as(route_stack, sg_platf_route_cbarg_t, TO_FLOYD_LINK(pred, cur));
58 } while (cur != src->id());
60 if (hierarchy_ == s4u::As::ROUTING_RECURSIVE) {
61 route->gw_src = xbt_dynar_getlast_as(route_stack, sg_platf_route_cbarg_t)->gw_src;
62 route->gw_dst = xbt_dynar_getfirst_as(route_stack, sg_platf_route_cbarg_t)->gw_dst;
65 sg_netcard_t prev_dst_gw = NULL;
66 while (!xbt_dynar_is_empty(route_stack)) {
67 sg_platf_route_cbarg_t e_route = xbt_dynar_pop_as(route_stack, sg_platf_route_cbarg_t);
69 if (hierarchy_ == s4u::As::ROUTING_RECURSIVE && prev_dst_gw != NULL && 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;
81 xbt_dynar_free(&route_stack);
84 void AsFloyd::addRoute(sg_platf_route_cbarg_t route)
86 /* set the size of table routing */
87 int table_size = (int)xbt_dynar_length(vertices_);
89 NetCard *src = sg_netcard_by_name_or_null(route->src);
90 NetCard *dst = sg_netcard_by_name_or_null(route->dst);
92 addRouteCheckParams(route);
95 /* Create Cost, Predecessor and Link tables */
96 costTable_ = xbt_new0(double, table_size * table_size); /* link cost from host to host */
97 predecessorTable_ = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
98 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
100 /* Initialize costs and predecessors */
101 for (int i = 0; i < table_size; i++)
102 for (int j = 0; j < table_size; j++) {
103 TO_FLOYD_COST(i, j) = DBL_MAX;
104 TO_FLOYD_PRED(i, j) = -1;
105 TO_FLOYD_LINK(i, j) = NULL;
109 /* Check that the route does not already exist */
110 if (route->gw_dst) // AS route (to adapt the error message, if any)
111 xbt_assert(nullptr == TO_FLOYD_LINK(src->id(), dst->id()),
112 "The route between %s@%s and %s@%s already exists (Rq: routes are symmetrical by default).",
113 src->name(),route->gw_src->name(),dst->name(),route->gw_dst->name());
115 xbt_assert(nullptr == TO_FLOYD_LINK(src->id(), dst->id()),
116 "The route between %s and %s already exists (Rq: routes are symmetrical by default).", src->name(),dst->name());
118 TO_FLOYD_LINK(src->id(), dst->id()) = newExtendedRoute(hierarchy_, route, 1);
119 TO_FLOYD_PRED(src->id(), dst->id()) = src->id();
120 TO_FLOYD_COST(src->id(), dst->id()) = (TO_FLOYD_LINK(src->id(), dst->id()))->link_list->size();
123 if (route->symmetrical == TRUE) {
124 if (route->gw_dst) // AS route (to adapt the error message, if any)
125 xbt_assert(nullptr == TO_FLOYD_LINK(dst->id(), src->id()),
126 "The route between %s@%s and %s@%s already exists. You should not declare the reverse path as symmetrical.",
127 dst->name(),route->gw_dst->name(),src->name(),route->gw_src->name());
129 xbt_assert(nullptr == TO_FLOYD_LINK(dst->id(), src->id()),
130 "The route between %s and %s already exists. You should not declare the reverse path as symmetrical.",
131 dst->name(),src->name());
133 if(route->gw_dst && route->gw_src) {
134 NetCard* gw_tmp = route->gw_src;
135 route->gw_src = route->gw_dst;
136 route->gw_dst = gw_tmp;
139 if(!route->gw_src && !route->gw_dst)
140 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", dst->name(), src->name());
142 XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", dst->name(),
143 route->gw_src->name(), src->name(), route->gw_dst->name());
145 TO_FLOYD_LINK(dst->id(), src->id()) = newExtendedRoute(hierarchy_, route, 0);
146 TO_FLOYD_PRED(dst->id(), src->id()) = dst->id();
147 TO_FLOYD_COST(dst->id(), src->id()) = (TO_FLOYD_LINK(dst->id(), src->id()))->link_list->size(); /* count of links, old model assume 1 */
151 void AsFloyd::Seal(){
153 /* set the size of table routing */
154 size_t table_size = xbt_dynar_length(vertices_);
157 /* Create Cost, Predecessor and Link tables */
158 costTable_ = xbt_new0(double, table_size * table_size); /* link cost from host to host */
159 predecessorTable_ = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
160 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
162 /* Initialize costs and predecessors */
163 for (unsigned int i = 0; i < table_size; i++)
164 for (unsigned int j = 0; j < table_size; j++) {
165 TO_FLOYD_COST(i, j) = DBL_MAX;
166 TO_FLOYD_PRED(i, j) = -1;
167 TO_FLOYD_LINK(i, j) = NULL;
171 /* Add the loopback if needed */
172 if (routing_platf->loopback_ && hierarchy_ == s4u::As::ROUTING_BASE) {
173 for (unsigned int i = 0; i < table_size; i++) {
174 sg_platf_route_cbarg_t e_route = TO_FLOYD_LINK(i, i);
176 e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
177 e_route->gw_src = NULL;
178 e_route->gw_dst = NULL;
179 e_route->link_list = new std::vector<Link*>();
180 e_route->link_list->push_back(routing_platf->loopback_);
181 TO_FLOYD_LINK(i, i) = e_route;
182 TO_FLOYD_PRED(i, i) = i;
183 TO_FLOYD_COST(i, i) = 1;
187 /* Calculate path costs */
188 for (unsigned int c = 0; c < table_size; c++) {
189 for (unsigned int a = 0; a < table_size; a++) {
190 for (unsigned int b = 0; b < table_size; b++) {
191 if (TO_FLOYD_COST(a, c) < DBL_MAX && TO_FLOYD_COST(c, b) < DBL_MAX) {
192 if (TO_FLOYD_COST(a, b) == DBL_MAX ||
193 (TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b) <
194 TO_FLOYD_COST(a, b))) {
195 TO_FLOYD_COST(a, b) =
196 TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b);
197 TO_FLOYD_PRED(a, b) = TO_FLOYD_PRED(c, b);