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 /* Business methods */
43 xbt_dynar_t AsFloyd::getOneLinkRoutes()
45 xbt_dynar_t ret = xbt_dynar_new(sizeof(Onelink*), xbt_free_f);
46 sg_platf_route_cbarg_t route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
47 route->link_list = new std::vector<Link*>();
49 int table_size = xbt_dynar_length(vertices_);
50 for(int src=0; src < table_size; src++) {
51 for(int dst=0; dst< table_size; dst++) {
52 route->link_list->clear();
53 NetCard *src_elm = xbt_dynar_get_as(vertices_, src, NetCard*);
54 NetCard *dst_elm = xbt_dynar_get_as(vertices_, dst, NetCard*);
55 this->getRouteAndLatency(src_elm, dst_elm, route, NULL);
57 if (route->link_list->size() == 1) {
58 void *link = route->link_list->at(0);
60 if (hierarchy_ == SURF_ROUTING_BASE)
61 onelink = new Onelink(link, src_elm, dst_elm);
62 else if (hierarchy_ == SURF_ROUTING_RECURSIVE)
63 onelink = new Onelink(link, route->gw_src, route->gw_dst);
65 onelink = new Onelink(link, NULL, NULL);
66 xbt_dynar_push(ret, &onelink);
74 void AsFloyd::getRouteAndLatency(NetCard *src, NetCard *dst, sg_platf_route_cbarg_t route, double *lat)
77 size_t table_size = xbt_dynar_length(vertices_);
79 getRouteCheckParams(src, dst);
81 /* create a result route */
82 xbt_dynar_t route_stack = xbt_dynar_new(sizeof(sg_platf_route_cbarg_t), NULL);
86 pred = TO_FLOYD_PRED(src->id(), cur);
88 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->name(), dst->name());
89 xbt_dynar_push_as(route_stack, sg_platf_route_cbarg_t, TO_FLOYD_LINK(pred, cur));
91 } while (cur != src->id());
93 if (hierarchy_ == SURF_ROUTING_RECURSIVE) {
94 route->gw_src = xbt_dynar_getlast_as(route_stack, sg_platf_route_cbarg_t)->gw_src;
95 route->gw_dst = xbt_dynar_getfirst_as(route_stack, sg_platf_route_cbarg_t)->gw_dst;
98 sg_netcard_t prev_dst_gw = NULL;
99 while (!xbt_dynar_is_empty(route_stack)) {
100 sg_platf_route_cbarg_t e_route = xbt_dynar_pop_as(route_stack, sg_platf_route_cbarg_t);
102 if (hierarchy_ == SURF_ROUTING_RECURSIVE && prev_dst_gw != NULL && strcmp(prev_dst_gw->name(), e_route->gw_src->name())) {
103 routing_platf->getRouteAndLatency(prev_dst_gw, e_route->gw_src, route->link_list, lat);
106 for (auto link: *e_route->link_list) {
107 route->link_list->push_back(link);
109 *lat += link->getLatency();
112 prev_dst_gw = e_route->gw_dst;
114 xbt_dynar_free(&route_stack);
117 void AsFloyd::addRoute(sg_platf_route_cbarg_t route)
119 /* set the size of table routing */
120 int table_size = (int)xbt_dynar_length(vertices_);
122 NetCard *src = sg_netcard_by_name_or_null(route->src);
123 NetCard *dst = sg_netcard_by_name_or_null(route->dst);
125 addRouteCheckParams(route);
128 /* Create Cost, Predecessor and Link tables */
129 costTable_ = xbt_new0(double, table_size * table_size); /* link cost from host to host */
130 predecessorTable_ = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
131 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
133 /* Initialize costs and predecessors */
134 for (int i = 0; i < table_size; i++)
135 for (int j = 0; j < table_size; j++) {
136 TO_FLOYD_COST(i, j) = DBL_MAX;
137 TO_FLOYD_PRED(i, j) = -1;
138 TO_FLOYD_LINK(i, j) = NULL;
142 /* Check that the route does not already exist */
143 if (route->gw_dst) // AS route (to adapt the error message, if any)
144 xbt_assert(nullptr == TO_FLOYD_LINK(src->id(), dst->id()),
145 "The route between %s@%s and %s@%s already exists (Rq: routes are symmetrical by default).",
146 src->name(),route->gw_src->name(),dst->name(),route->gw_dst->name());
148 xbt_assert(nullptr == TO_FLOYD_LINK(src->id(), dst->id()),
149 "The route between %s and %s already exists (Rq: routes are symmetrical by default).", src->name(),dst->name());
151 TO_FLOYD_LINK(src->id(), dst->id()) = newExtendedRoute(hierarchy_, route, 1);
152 TO_FLOYD_PRED(src->id(), dst->id()) = src->id();
153 TO_FLOYD_COST(src->id(), dst->id()) = (TO_FLOYD_LINK(src->id(), dst->id()))->link_list->size();
156 if (route->symmetrical == TRUE) {
157 if (route->gw_dst) // AS route (to adapt the error message, if any)
158 xbt_assert(nullptr == TO_FLOYD_LINK(dst->id(), src->id()),
159 "The route between %s@%s and %s@%s already exists. You should not declare the reverse path as symmetrical.",
160 dst->name(),route->gw_dst->name(),src->name(),route->gw_src->name());
162 xbt_assert(nullptr == TO_FLOYD_LINK(dst->id(), src->id()),
163 "The route between %s and %s already exists. You should not declare the reverse path as symmetrical.",
164 dst->name(),src->name());
166 if(route->gw_dst && route->gw_src) {
167 NetCard* gw_tmp = route->gw_src;
168 route->gw_src = route->gw_dst;
169 route->gw_dst = gw_tmp;
172 if(!route->gw_src && !route->gw_dst)
173 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", dst->name(), src->name());
175 XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", dst->name(),
176 route->gw_src->name(), src->name(), route->gw_dst->name());
178 TO_FLOYD_LINK(dst->id(), src->id()) = newExtendedRoute(hierarchy_, route, 0);
179 TO_FLOYD_PRED(dst->id(), src->id()) = dst->id();
180 TO_FLOYD_COST(dst->id(), src->id()) = (TO_FLOYD_LINK(dst->id(), src->id()))->link_list->size(); /* count of links, old model assume 1 */
184 void AsFloyd::Seal(){
186 /* set the size of table routing */
187 size_t table_size = xbt_dynar_length(vertices_);
190 /* Create Cost, Predecessor and Link tables */
191 costTable_ = xbt_new0(double, table_size * table_size); /* link cost from host to host */
192 predecessorTable_ = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
193 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
195 /* Initialize costs and predecessors */
196 for (unsigned int i = 0; i < table_size; i++)
197 for (unsigned int j = 0; j < table_size; j++) {
198 TO_FLOYD_COST(i, j) = DBL_MAX;
199 TO_FLOYD_PRED(i, j) = -1;
200 TO_FLOYD_LINK(i, j) = NULL;
204 /* Add the loopback if needed */
205 if (routing_platf->loopback_ && hierarchy_ == SURF_ROUTING_BASE) {
206 for (unsigned int i = 0; i < table_size; i++) {
207 sg_platf_route_cbarg_t e_route = TO_FLOYD_LINK(i, i);
209 e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
210 e_route->gw_src = NULL;
211 e_route->gw_dst = NULL;
212 e_route->link_list = new std::vector<Link*>();
213 e_route->link_list->push_back(routing_platf->loopback_);
214 TO_FLOYD_LINK(i, i) = e_route;
215 TO_FLOYD_PRED(i, i) = i;
216 TO_FLOYD_COST(i, i) = 1;
220 /* Calculate path costs */
221 for (unsigned int c = 0; c < table_size; c++) {
222 for (unsigned int a = 0; a < table_size; a++) {
223 for (unsigned int b = 0; b < table_size; b++) {
224 if (TO_FLOYD_COST(a, c) < DBL_MAX && TO_FLOYD_COST(c, b) < DBL_MAX) {
225 if (TO_FLOYD_COST(a, b) == DBL_MAX ||
226 (TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b) <
227 TO_FLOYD_COST(a, b))) {
228 TO_FLOYD_COST(a, b) =
229 TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b);
230 TO_FLOYD_PRED(a, b) = TO_FLOYD_PRED(c, b);