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_private.hpp"
8 #include "src/surf/surf_routing_floyd.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;
31 table_size = (int)xbt_dynar_length(vertices_);
32 if (linkTable_ == NULL) // Dealing with a parse error in the file?
34 /* Delete link_table */
35 for (i = 0; i < table_size; i++)
36 for (j = 0; j < table_size; j++) {
37 routing_route_free(TO_FLOYD_LINK(i, j));
40 /* Delete bypass dict */
41 xbt_dict_free(&bypassRoutes_);
42 /* Delete predecessor and cost table */
43 xbt_free(predecessorTable_);
47 /* Business methods */
48 xbt_dynar_t AsFloyd::getOneLinkRoutes()
50 xbt_dynar_t ret = xbt_dynar_new(sizeof(Onelink*), xbt_free_f);
51 sg_platf_route_cbarg_t route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
52 route->link_list = xbt_dynar_new(sizeof(Link*), NULL);
55 sg_netcard_t src_elm, dst_elm;
56 int table_size = xbt_dynar_length(vertices_);
57 for(src=0; src < table_size; src++) {
58 for(dst=0; dst< table_size; dst++) {
59 xbt_dynar_reset(route->link_list);
60 src_elm = xbt_dynar_get_as(vertices_, src, NetCard*);
61 dst_elm = xbt_dynar_get_as(vertices_, dst, NetCard*);
62 this->getRouteAndLatency(src_elm, dst_elm, route, NULL);
64 if (xbt_dynar_length(route->link_list) == 1) {
65 void *link = *(void **) xbt_dynar_get_ptr(route->link_list, 0);
67 if (hierarchy_ == SURF_ROUTING_BASE)
68 onelink = new Onelink(link, src_elm, dst_elm);
69 else if (hierarchy_ == SURF_ROUTING_RECURSIVE)
70 onelink = new Onelink(link, route->gw_src, route->gw_dst);
72 onelink = new Onelink(link, NULL, NULL);
73 xbt_dynar_push(ret, &onelink);
81 void AsFloyd::getRouteAndLatency(NetCard *src, NetCard *dst, sg_platf_route_cbarg_t res, double *lat)
84 size_t table_size = xbt_dynar_length(vertices_);
86 getRouteCheckParams(src, dst);
88 /* create a result route */
89 xbt_dynar_t route_stack = xbt_dynar_new(sizeof(sg_platf_route_cbarg_t), NULL);
93 pred = TO_FLOYD_PRED(src->id(), cur);
95 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->name(), dst->name());
96 xbt_dynar_push_as(route_stack, sg_platf_route_cbarg_t, TO_FLOYD_LINK(pred, cur));
98 } while (cur != src->id());
100 if (hierarchy_ == SURF_ROUTING_RECURSIVE) {
101 res->gw_src = xbt_dynar_getlast_as(route_stack, sg_platf_route_cbarg_t)->gw_src;
102 res->gw_dst = xbt_dynar_getfirst_as(route_stack, sg_platf_route_cbarg_t)->gw_dst;
105 sg_netcard_t prev_dst_gw = NULL;
106 while (!xbt_dynar_is_empty(route_stack)) {
107 sg_platf_route_cbarg_t e_route = xbt_dynar_pop_as(route_stack, sg_platf_route_cbarg_t);
112 if (hierarchy_ == SURF_ROUTING_RECURSIVE && prev_dst_gw != NULL && strcmp(prev_dst_gw->name(), e_route->gw_src->name())) {
113 routing_platf->getRouteAndLatency(prev_dst_gw, e_route->gw_src, &res->link_list, lat);
116 links = e_route->link_list;
117 xbt_dynar_foreach(links, cpt, link) {
118 xbt_dynar_push_as(res->link_list, Link*, (Link*)link);
120 *lat += static_cast<Link*>(link)->getLatency();
123 prev_dst_gw = e_route->gw_dst;
125 xbt_dynar_free(&route_stack);
128 static int floyd_pointer_resource_cmp(const void *a, const void *b) {
132 void AsFloyd::parseRoute(sg_platf_route_cbarg_t route)
134 /* set the size of table routing */
135 int table_size = (int)xbt_dynar_length(vertices_);
137 NetCard *src = sg_netcard_by_name_or_null(route->src);
138 NetCard *dst = sg_netcard_by_name_or_null(route->dst);
140 parseRouteCheckParams(route);
143 /* Create Cost, Predecessor and Link tables */
144 costTable_ = xbt_new0(double, table_size * table_size); /* link cost from host to host */
145 predecessorTable_ = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
146 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
148 /* Initialize costs and predecessors */
149 for (int i = 0; i < table_size; i++)
150 for (int j = 0; j < table_size; j++) {
151 TO_FLOYD_COST(i, j) = DBL_MAX;
152 TO_FLOYD_PRED(i, j) = -1;
153 TO_FLOYD_LINK(i, j) = NULL;
157 /* Check that the route does not already exist */
158 if (route->gw_dst) // AS route (to adapt the error message, if any)
159 xbt_assert(nullptr == TO_FLOYD_LINK(src->id(), dst->id()),
160 "The route between %s@%s and %s@%s already exists (Rq: routes are symmetrical by default).",
161 src->name(),route->gw_src->name(),dst->name(),route->gw_dst->name());
163 xbt_assert(nullptr == TO_FLOYD_LINK(src->id(), dst->id()),
164 "The route between %s and %s already exists (Rq: routes are symmetrical by default).", src->name(),dst->name());
166 TO_FLOYD_LINK(src->id(), dst->id()) = newExtendedRoute(hierarchy_, route, 1);
167 TO_FLOYD_PRED(src->id(), dst->id()) = src->id();
168 TO_FLOYD_COST(src->id(), dst->id()) = ((TO_FLOYD_LINK(src->id(), dst->id()))->link_list)->used;
171 if (route->symmetrical == TRUE) {
172 if(TO_FLOYD_LINK(dst->id(), src->id()))
174 if(!route->gw_dst && !route->gw_src)
175 XBT_DEBUG("See Route from \"%s\" to \"%s\"", dst->name(), src->name());
177 XBT_DEBUG("See ASroute from \"%s(%s)\" to \"%s(%s)\"", dst->name(), route->gw_src->name(), src->name(), route->gw_dst->name());
180 xbt_dynar_t link_route_to_test = xbt_dynar_new(sizeof(Link*), NULL);
181 for(int i=xbt_dynar_length(route->link_list) ;i>0 ;i--) {
182 link_name = xbt_dynar_get_as(route->link_list,i-1,char *);
183 void *link = Link::byName(link_name);
184 xbt_assert(link,"Link : '%s' doesn't exists.",link_name);
185 xbt_dynar_push(link_route_to_test,&link);
187 xbt_assert(!xbt_dynar_compare(
188 TO_FLOYD_LINK(dst->id(), src->id())->link_list,
190 (int_f_cpvoid_cpvoid_t) floyd_pointer_resource_cmp),
191 "The route between \"%s\" and \"%s\" already exists", src->name(),dst->name());
195 if(route->gw_dst && route->gw_src) {
196 NetCard* gw_tmp = route->gw_src;
197 route->gw_src = route->gw_dst;
198 route->gw_dst = gw_tmp;
201 if(!route->gw_src && !route->gw_dst)
202 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", dst->name(), src->name());
204 XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", dst->name(),
205 route->gw_src->name(), src->name(), route->gw_dst->name());
207 TO_FLOYD_LINK(dst->id(), src->id()) =
208 newExtendedRoute(hierarchy_, route, 0);
209 TO_FLOYD_PRED(dst->id(), src->id()) = dst->id();
210 TO_FLOYD_COST(dst->id(), src->id()) =
211 ((TO_FLOYD_LINK(dst->id(), src->id()))->link_list)->used; /* count of links, old model assume 1 */
214 xbt_dynar_free(&route->link_list);
217 void AsFloyd::Seal(){
219 /* set the size of table routing */
220 size_t table_size = xbt_dynar_length(vertices_);
223 /* Create Cost, Predecessor and Link tables */
224 costTable_ = xbt_new0(double, table_size * table_size); /* link cost from host to host */
225 predecessorTable_ = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
226 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
228 /* Initialize costs and predecessors */
229 for (unsigned int i = 0; i < table_size; i++)
230 for (unsigned int j = 0; j < table_size; j++) {
231 TO_FLOYD_COST(i, j) = DBL_MAX;
232 TO_FLOYD_PRED(i, j) = -1;
233 TO_FLOYD_LINK(i, j) = NULL;
237 /* Add the loopback if needed */
238 if (routing_platf->loopback_ && hierarchy_ == SURF_ROUTING_BASE) {
239 for (unsigned int i = 0; i < table_size; i++) {
240 sg_platf_route_cbarg_t e_route = TO_FLOYD_LINK(i, i);
242 e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
243 e_route->gw_src = NULL;
244 e_route->gw_dst = NULL;
245 e_route->link_list = xbt_dynar_new(sizeof(Link*), NULL);
246 xbt_dynar_push(e_route->link_list, &routing_platf->loopback_);
247 TO_FLOYD_LINK(i, i) = e_route;
248 TO_FLOYD_PRED(i, i) = i;
249 TO_FLOYD_COST(i, i) = 1;
253 /* Calculate path costs */
254 for (unsigned int c = 0; c < table_size; c++) {
255 for (unsigned int a = 0; a < table_size; a++) {
256 for (unsigned int b = 0; b < table_size; b++) {
257 if (TO_FLOYD_COST(a, c) < DBL_MAX && TO_FLOYD_COST(c, b) < DBL_MAX) {
258 if (TO_FLOYD_COST(a, b) == DBL_MAX ||
259 (TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b) <
260 TO_FLOYD_COST(a, b))) {
261 TO_FLOYD_COST(a, b) =
262 TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b);
263 TO_FLOYD_PRED(a, b) = TO_FLOYD_PRED(c, b);