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) (p_costTable)[(i)+(j)*table_size]
14 #define TO_FLOYD_PRED(i,j) (p_predecessorTable)[(i)+(j)*table_size]
15 #define TO_FLOYD_LINK(i,j) (p_linkTable)[(i)+(j)*table_size]
20 AsFloyd::AsFloyd(const char*name)
23 p_predecessorTable = NULL;
31 table_size = (int)xbt_dynar_length(vertices_);
32 if (p_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));
39 xbt_free(p_linkTable);
40 /* Delete bypass dict */
41 xbt_dict_free(&bypassRoutes_);
42 /* Delete predecessor and cost table */
43 xbt_free(p_predecessorTable);
44 xbt_free(p_costTable);
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(sg_routing_link_t), 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)
85 size_t table_size = xbt_dynar_length(vertices_);
87 this->srcDstCheck(src, dst);
89 /* create a result route */
90 xbt_dynar_t route_stack = xbt_dynar_new(sizeof(sg_platf_route_cbarg_t), NULL);
94 pred = TO_FLOYD_PRED(src->id(), cur);
96 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->name(), dst->name());
97 xbt_dynar_push_as(route_stack, sg_platf_route_cbarg_t, TO_FLOYD_LINK(pred, cur));
99 } while (cur != src->id());
101 if (hierarchy_ == SURF_ROUTING_RECURSIVE) {
102 res->gw_src = xbt_dynar_getlast_as(route_stack, sg_platf_route_cbarg_t)->gw_src;
103 res->gw_dst = xbt_dynar_getfirst_as(route_stack, sg_platf_route_cbarg_t)->gw_dst;
106 sg_netcard_t prev_dst_gw = NULL;
107 while (!xbt_dynar_is_empty(route_stack)) {
108 sg_platf_route_cbarg_t e_route = xbt_dynar_pop_as(route_stack, sg_platf_route_cbarg_t);
113 if (hierarchy_ == SURF_ROUTING_RECURSIVE && prev_dst_gw != NULL
114 && strcmp(prev_dst_gw->name(), e_route->gw_src->name())) {
115 routing_platf->getRouteAndLatency(prev_dst_gw, e_route->gw_src,
116 &res->link_list, lat);
119 links = e_route->link_list;
120 xbt_dynar_foreach(links, cpt, link) {
121 xbt_dynar_push_as(res->link_list, sg_routing_link_t, link);
123 *lat += static_cast<Link*>(link)->getLatency();
126 prev_dst_gw = e_route->gw_dst;
128 xbt_dynar_free(&route_stack);
131 static int floyd_pointer_resource_cmp(const void *a, const void *b) {
135 void AsFloyd::parseRoute(sg_platf_route_cbarg_t route)
137 const char *src = route->src;
138 const char *dst = route->dst;
140 /* set the size of table routing */
141 int table_size = (int)xbt_dynar_length(vertices_);
143 NetCard *src_net_elm = sg_netcard_by_name_or_null(src);
144 NetCard *dst_net_elm = sg_netcard_by_name_or_null(dst);
146 parseRouteCheckParams(route);
151 /* Create Cost, Predecessor and Link tables */
152 p_costTable = xbt_new0(double, table_size * table_size); /* link cost from host to host */
153 p_predecessorTable = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
154 p_linkTable = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
156 /* Initialize costs and predecessors */
157 for (i = 0; i < table_size; i++)
158 for (j = 0; j < table_size; j++) {
159 TO_FLOYD_COST(i, j) = DBL_MAX;
160 TO_FLOYD_PRED(i, j) = -1;
161 TO_FLOYD_LINK(i, j) = NULL; /* fixed, missing in the previous version */
165 if(TO_FLOYD_LINK(src_net_elm->id(), dst_net_elm->id()))
170 xbt_dynar_t link_route_to_test = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
171 xbt_dynar_foreach(route->link_list,cpt,link_name)
173 void *link = Link::byName(link_name);
174 xbt_assert(link,"Link : '%s' doesn't exists.",link_name);
175 xbt_dynar_push(link_route_to_test,&link);
177 xbt_assert(!xbt_dynar_compare(
178 TO_FLOYD_LINK(src_net_elm->id(), dst_net_elm->id())->link_list,
180 (int_f_cpvoid_cpvoid_t) floyd_pointer_resource_cmp),
181 "The route between \"%s\" and \"%s\" already exists", src,dst);
185 TO_FLOYD_LINK(src_net_elm->id(), dst_net_elm->id()) =
186 newExtendedRoute(hierarchy_, route, 1);
187 TO_FLOYD_PRED(src_net_elm->id(), dst_net_elm->id()) = src_net_elm->id();
188 TO_FLOYD_COST(src_net_elm->id(), dst_net_elm->id()) =
189 ((TO_FLOYD_LINK(src_net_elm->id(), dst_net_elm->id()))->link_list)->used; /* count of links, old model assume 1 */
192 if (route->symmetrical == TRUE) {
193 if(TO_FLOYD_LINK(dst_net_elm->id(), src_net_elm->id()))
195 if(!route->gw_dst && !route->gw_src)
196 XBT_DEBUG("See Route from \"%s\" to \"%s\"", dst, src);
198 XBT_DEBUG("See ASroute from \"%s(%s)\" to \"%s(%s)\"", dst, route->gw_src->name(), src, route->gw_dst->name());
201 xbt_dynar_t link_route_to_test = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
202 for(int i=xbt_dynar_length(route->link_list) ;i>0 ;i--) {
203 link_name = xbt_dynar_get_as(route->link_list,i-1,char *);
204 void *link = Link::byName(link_name);
205 xbt_assert(link,"Link : '%s' doesn't exists.",link_name);
206 xbt_dynar_push(link_route_to_test,&link);
208 xbt_assert(!xbt_dynar_compare(
209 TO_FLOYD_LINK(dst_net_elm->id(), src_net_elm->id())->link_list,
211 (int_f_cpvoid_cpvoid_t) floyd_pointer_resource_cmp),
212 "The route between \"%s\" and \"%s\" already exists", src,dst);
216 if(route->gw_dst && route->gw_src) {
217 NetCard* gw_tmp = route->gw_src;
218 route->gw_src = route->gw_dst;
219 route->gw_dst = gw_tmp;
222 if(!route->gw_src && !route->gw_dst)
223 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", dst, src);
225 XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", dst,
226 route->gw_src->name(), src, route->gw_dst->name());
228 TO_FLOYD_LINK(dst_net_elm->id(), src_net_elm->id()) =
229 newExtendedRoute(hierarchy_, route, 0);
230 TO_FLOYD_PRED(dst_net_elm->id(), src_net_elm->id()) = dst_net_elm->id();
231 TO_FLOYD_COST(dst_net_elm->id(), src_net_elm->id()) =
232 ((TO_FLOYD_LINK(dst_net_elm->id(), src_net_elm->id()))->link_list)->used; /* count of links, old model assume 1 */
235 xbt_dynar_free(&route->link_list);
238 void AsFloyd::Seal(){
239 unsigned int i, j, a, b, c;
241 /* set the size of table routing */
242 size_t table_size = xbt_dynar_length(vertices_);
245 /* Create Cost, Predecessor and Link tables */
246 p_costTable = xbt_new0(double, table_size * table_size); /* link cost from host to host */
247 p_predecessorTable = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
248 p_linkTable = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
250 /* Initialize costs and predecessors */
251 for (i = 0; i < table_size; i++)
252 for (j = 0; j < table_size; j++) {
253 TO_FLOYD_COST(i, j) = DBL_MAX;
254 TO_FLOYD_PRED(i, j) = -1;
255 TO_FLOYD_LINK(i, j) = NULL;
259 /* Add the loopback if needed */
260 if (routing_platf->p_loopback && hierarchy_ == SURF_ROUTING_BASE) {
261 for (i = 0; i < table_size; i++) {
262 sg_platf_route_cbarg_t e_route = TO_FLOYD_LINK(i, i);
264 e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
265 e_route->gw_src = NULL;
266 e_route->gw_dst = NULL;
267 e_route->link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
268 xbt_dynar_push(e_route->link_list, &routing_platf->p_loopback);
269 TO_FLOYD_LINK(i, i) = e_route;
270 TO_FLOYD_PRED(i, i) = i;
271 TO_FLOYD_COST(i, i) = 1;
275 /* Calculate path costs */
276 for (c = 0; c < table_size; c++) {
277 for (a = 0; a < table_size; a++) {
278 for (b = 0; b < table_size; b++) {
279 if (TO_FLOYD_COST(a, c) < DBL_MAX && TO_FLOYD_COST(c, b) < DBL_MAX) {
280 if (TO_FLOYD_COST(a, b) == DBL_MAX ||
281 (TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b) <
282 TO_FLOYD_COST(a, b))) {
283 TO_FLOYD_COST(a, b) =
284 TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b);
285 TO_FLOYD_PRED(a, b) = TO_FLOYD_PRED(c, b);