1 /* Copyright (c) 2009, 2010, 2011. 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 "surf_routing_private.h"
10 extern routing_global_t global_routing;
12 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_floyd, surf, "Routing part of surf");
14 #define TO_FLOYD_COST(i,j) (as->cost_table)[(i)+(j)*table_size]
15 #define TO_FLOYD_PRED(i,j) (as->predecessor_table)[(i)+(j)*table_size]
16 #define TO_FLOYD_LINK(i,j) (as->link_table)[(i)+(j)*table_size]
18 /* Routing model structure */
21 s_as_t generic_routing;
22 /* vars for calculate the floyd algorith. */
23 int *predecessor_table;
26 } s_as_floyd_t, *as_floyd_t;
28 static void floyd_get_route_and_latency(AS_t asg, network_element_t src, network_element_t dst,
29 route_t res, double *lat);
31 /* Business methods */
32 static xbt_dynar_t floyd_get_onelink_routes(AS_t asg)
34 xbt_dynar_t ret = xbt_dynar_new(sizeof(onelink_t), xbt_free);
36 // route_t route = xbt_new0(s_route_t, 1);
37 // route->link_list = xbt_dynar_new(global_routing->size_of_link, NULL);
39 // xbt_dict_cursor_t c1 = NULL, c2 = NULL;
40 // char *k1, *d1, *k2, *d2;
41 // xbt_dict_foreach(asg->to_index, c1, k1, d1) {
42 // xbt_dict_foreach(asg->to_index, c2, k2, d2) {
43 // xbt_dynar_reset(route->link_list);
44 // floyd_get_route_and_latency(asg, k1, k2, route, NULL);
45 // if (xbt_dynar_length(route->link_list) == 1) {
46 // void *link = *(void **) xbt_dynar_get_ptr(route->link_list, 0);
47 // onelink_t onelink = xbt_new0(s_onelink_t, 1);
48 // onelink->link_ptr = link;
49 // if (asg->hierarchy == SURF_ROUTING_BASE) {
50 // onelink->src = xbt_strdup(k1);
51 // onelink->dst = xbt_strdup(k2);
52 // } else if (asg->hierarchy == SURF_ROUTING_RECURSIVE) {
53 // onelink->src = route->src_gateway;
54 // onelink->dst = route->dst_gateway;
56 // xbt_dynar_push(ret, &onelink);
63 static void floyd_get_route_and_latency(AS_t asg, network_element_t src, network_element_t dst,
64 route_t res, double *lat)
68 as_floyd_t as = (as_floyd_t)asg;
69 size_t table_size = asg->nb_index;
71 generic_src_dst_check(asg, src, dst);
72 int *src_id = &(src->id);
73 int *dst_id = &(dst->id);
74 if (src_id == NULL || dst_id == NULL)
75 THROWF(arg_error,0,"No route from '%s' to '%s'",
79 /* create a result route */
84 network_element_t gw_src, gw_dst, prev_gw_src, first_gw;
91 pred = TO_FLOYD_PRED(*src_id, pred);
92 if (pred == -1) /* if no pred in route -> no route to host */
94 xbt_assert(TO_FLOYD_LINK(pred, prev_pred),
95 "Invalid link for the route between \"%s\" or \"%s\"",
101 route_t e_route = TO_FLOYD_LINK(pred, prev_pred);
102 gw_src = e_route->src_gateway;
103 gw_dst = e_route->dst_gateway;
108 if (asg->hierarchy == SURF_ROUTING_RECURSIVE && !first
109 && strcmp(gw_dst->name, prev_gw_src->name)) {
110 xbt_dynar_t e_route_as_to_as;
111 e_route_as_to_as = xbt_dynar_new(global_routing->size_of_link, NULL);
112 routing_get_route_and_latency(gw_dst, prev_gw_src,&e_route_as_to_as,NULL);
113 links = e_route_as_to_as;
115 xbt_dynar_foreach(links, cpt, link) {
116 xbt_dynar_insert_at(res->link_list, pos, &link);
118 *lat += surf_network_model->extension.network.get_link_latency(link);
121 xbt_dynar_free(&e_route_as_to_as);
124 links = e_route->link_list;
125 xbt_dynar_foreach(links, cpt, link) {
126 xbt_dynar_unshift(res->link_list, &link);
128 *lat += surf_network_model->extension.network.get_link_latency(link);
132 } while (pred != *src_id);
134 THROWF(arg_error,0,"No route from '%s' to '%s'",
138 if (asg->hierarchy == SURF_ROUTING_RECURSIVE) {
139 res->src_gateway = gw_src;
140 res->dst_gateway = first_gw;
144 static void floyd_finalize(AS_t rc)
146 as_floyd_t as = (as_floyd_t) rc;
150 table_size = as->generic_routing.nb_index;
151 /* Delete link_table */
152 for (i = 0; i < table_size; i++)
153 for (j = 0; j < table_size; j++)
154 generic_free_route(TO_FLOYD_LINK(i, j));
155 xbt_free(as->link_table);
156 /* Delete bypass dict */
157 xbt_dict_free(&as->generic_routing.bypassRoutes);
158 /* Delete predecessor and cost table */
159 xbt_free(as->predecessor_table);
160 xbt_free(as->cost_table);
162 model_generic_finalize(rc);
166 AS_t model_floyd_create(void)
168 as_floyd_t new_component = (as_floyd_t)model_generic_create_sized(sizeof(s_as_floyd_t));
169 new_component->generic_routing.parse_route = model_floyd_parse_route;
170 new_component->generic_routing.parse_ASroute = model_floyd_parse_route;
171 new_component->generic_routing.get_route_and_latency = floyd_get_route_and_latency;
172 new_component->generic_routing.get_onelink_routes =
173 floyd_get_onelink_routes;
174 new_component->generic_routing.finalize = floyd_finalize;
175 return (AS_t)new_component;
178 void model_floyd_end(AS_t current_routing)
182 ((as_floyd_t) current_routing);
184 unsigned int i, j, a, b, c;
186 /* set the size of table routing */
187 size_t table_size = as->generic_routing.nb_index;
191 /* Create Cost, Predecessor and Link tables */
192 as->cost_table = xbt_new0(double, table_size * table_size); /* link cost from host to host */
193 as->predecessor_table = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
194 as->link_table = xbt_new0(route_t, table_size * table_size); /* actual link between src and dst */
196 /* Initialize costs and predecessors */
197 for (i = 0; i < table_size; i++)
198 for (j = 0; j < table_size; j++) {
199 TO_FLOYD_COST(i, j) = DBL_MAX;
200 TO_FLOYD_PRED(i, j) = -1;
201 TO_FLOYD_LINK(i, j) = NULL; /* fixed, missing in the previous version */
205 /* Add the loopback if needed */
206 if (global_routing->loopback && current_routing->hierarchy == SURF_ROUTING_BASE) {
207 for (i = 0; i < table_size; i++) {
208 route_t e_route = TO_FLOYD_LINK(i, i);
210 e_route = xbt_new0(s_route_t, 1);
211 e_route->src_gateway = NULL;
212 e_route->dst_gateway = NULL;
214 xbt_dynar_new(global_routing->size_of_link, NULL);
215 xbt_dynar_push(e_route->link_list, &global_routing->loopback);
216 TO_FLOYD_LINK(i, i) = e_route;
217 TO_FLOYD_PRED(i, i) = i;
218 TO_FLOYD_COST(i, i) = 1;
222 /* Calculate path costs */
223 for (c = 0; c < table_size; c++) {
224 for (a = 0; a < table_size; a++) {
225 for (b = 0; b < table_size; b++) {
226 if (TO_FLOYD_COST(a, c) < DBL_MAX && TO_FLOYD_COST(c, b) < DBL_MAX) {
227 if (TO_FLOYD_COST(a, b) == DBL_MAX ||
228 (TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b) <
229 TO_FLOYD_COST(a, b))) {
230 TO_FLOYD_COST(a, b) =
231 TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b);
232 TO_FLOYD_PRED(a, b) = TO_FLOYD_PRED(c, b);
240 static int floyd_pointer_resource_cmp(const void *a, const void *b) {
244 //FIXME: kill dupplicates in next function with full routing
246 void model_floyd_parse_route(AS_t rc, const char *src,
247 const char *dst, route_t route)
249 as_floyd_t as = (as_floyd_t) rc;
251 /* set the size of table routing */
252 size_t table_size = rc->nb_index;
253 network_element_t src_net_elm, dst_net_elm;
255 src_net_elm = (network_element_t)xbt_lib_get_or_null(host_lib, src, ROUTING_HOST_LEVEL);
256 dst_net_elm = (network_element_t)xbt_lib_get_or_null(host_lib, dst, ROUTING_HOST_LEVEL);
257 if(!src_net_elm) src_net_elm = (network_element_t)xbt_lib_get_or_null(as_router_lib, src, ROUTING_ASR_LEVEL);
258 if(!dst_net_elm) dst_net_elm = (network_element_t)xbt_lib_get_or_null(as_router_lib, dst, ROUTING_ASR_LEVEL);
260 xbt_assert(src_net_elm, "Network elements %s not found", src);
261 xbt_assert(dst_net_elm, "Network elements %s not found", dst);
266 /* Create Cost, Predecessor and Link tables */
267 as->cost_table = xbt_new0(double, table_size * table_size); /* link cost from host to host */
268 as->predecessor_table = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
269 as->link_table = xbt_new0(route_t, table_size * table_size); /* actual link between src and dst */
271 /* Initialize costs and predecessors */
272 for (i = 0; i < table_size; i++)
273 for (j = 0; j < table_size; j++) {
274 TO_FLOYD_COST(i, j) = DBL_MAX;
275 TO_FLOYD_PRED(i, j) = -1;
276 TO_FLOYD_LINK(i, j) = NULL; /* fixed, missing in the previous version */
280 if(TO_FLOYD_LINK(src_net_elm->id, dst_net_elm->id))
282 if(!route->dst_gateway && !route->src_gateway)
283 XBT_DEBUG("See Route from \"%s\" to \"%s\"", src, dst);
285 XBT_DEBUG("See ASroute from \"%s(%s)\" to \"%s(%s)\"", src,
286 route->src_gateway->name, dst, route->dst_gateway->name);
289 xbt_dynar_t link_route_to_test = xbt_dynar_new(global_routing->size_of_link, NULL);
290 xbt_dynar_foreach(route->link_list,cpt,link_name)
292 void *link = xbt_lib_get_or_null(link_lib, link_name, SURF_LINK_LEVEL);
293 xbt_assert(link,"Link : '%s' doesn't exists.",link_name);
294 xbt_dynar_push(link_route_to_test,&link);
296 xbt_assert(!xbt_dynar_compare(
297 (void*)TO_FLOYD_LINK(src_net_elm->id, dst_net_elm->id)->link_list,
298 (void*)link_route_to_test,
299 (int_f_cpvoid_cpvoid_t) floyd_pointer_resource_cmp),
300 "The route between \"%s\" and \"%s\" already exists", src,dst);
304 if(!route->dst_gateway && !route->src_gateway)
305 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", src, dst);
307 XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", src,
308 route->src_gateway->name, dst, route->dst_gateway->name);
309 if(route->dst_gateway->rc_type == SURF_NETWORK_ELEMENT_NULL)
310 xbt_die("The dst_gateway '%s' does not exist!",route->dst_gateway->name);
311 if(route->src_gateway->rc_type == SURF_NETWORK_ELEMENT_NULL)
312 xbt_die("The src_gateway '%s' does not exist!",route->src_gateway->name);
314 TO_FLOYD_LINK(src_net_elm->id, dst_net_elm->id) =
315 generic_new_extended_route(rc->hierarchy, route, 1);
316 TO_FLOYD_PRED(src_net_elm->id, dst_net_elm->id) = src_net_elm->id;
317 TO_FLOYD_COST(src_net_elm->id, dst_net_elm->id) =
318 ((TO_FLOYD_LINK(src_net_elm->id, dst_net_elm->id))->link_list)->used; /* count of links, old model assume 1 */
321 if( A_surfxml_route_symmetrical == A_surfxml_route_symmetrical_YES
322 || A_surfxml_ASroute_symmetrical == A_surfxml_ASroute_symmetrical_YES )
324 if(TO_FLOYD_LINK(dst_net_elm->id, src_net_elm->id))
326 if(!route->dst_gateway && !route->src_gateway)
327 XBT_DEBUG("See Route from \"%s\" to \"%s\"", dst, src);
329 XBT_DEBUG("See ASroute from \"%s(%s)\" to \"%s(%s)\"", dst,
330 route->src_gateway->name, src, route->dst_gateway->name);
333 xbt_dynar_t link_route_to_test = xbt_dynar_new(global_routing->size_of_link, NULL);
334 for(i=xbt_dynar_length(route->link_list) ;i>0 ;i--)
336 link_name = xbt_dynar_get_as(route->link_list,i-1,void *);
337 void *link = xbt_lib_get_or_null(link_lib, link_name, SURF_LINK_LEVEL);
338 xbt_assert(link,"Link : '%s' doesn't exists.",link_name);
339 xbt_dynar_push(link_route_to_test,&link);
341 xbt_assert(!xbt_dynar_compare(
342 (void*)TO_FLOYD_LINK(dst_net_elm->id, src_net_elm->id)->link_list,
343 (void*)link_route_to_test,
344 (int_f_cpvoid_cpvoid_t) floyd_pointer_resource_cmp),
345 "The route between \"%s\" and \"%s\" already exists", src,dst);
349 if(route->dst_gateway && route->src_gateway)
351 network_element_t gw_src = route->src_gateway;
352 network_element_t gw_dst = route->dst_gateway;
353 route->src_gateway = gw_dst;
354 route->dst_gateway = gw_src;
357 if(!route->dst_gateway && !route->src_gateway)
358 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", dst, src);
360 XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", dst,
361 route->src_gateway->name, src, route->dst_gateway->name);
363 TO_FLOYD_LINK(dst_net_elm->id, src_net_elm->id) =
364 generic_new_extended_route(rc->hierarchy, route, 0);
365 TO_FLOYD_PRED(dst_net_elm->id, src_net_elm->id) = dst_net_elm->id;
366 TO_FLOYD_COST(dst_net_elm->id, src_net_elm->id) =
367 ((TO_FLOYD_LINK(dst_net_elm->id, src_net_elm->id))->link_list)->used; /* count of links, old model assume 1 */