1 /* Copyright (c) 2009-2014. 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_floyd.hpp"
8 #include "network_interface.hpp"
10 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_floyd, surf, "Routing part of surf");
12 #define TO_FLOYD_COST(i,j) (p_costTable)[(i)+(j)*table_size]
13 #define TO_FLOYD_PRED(i,j) (p_predecessorTable)[(i)+(j)*table_size]
14 #define TO_FLOYD_LINK(i,j) (p_linkTable)[(i)+(j)*table_size]
16 AS_t model_floyd_create(void)
21 void model_floyd_end(AS_t current_routing)
23 static_cast<AsFloydPtr>(current_routing)->end();
26 AsFloyd::AsFloyd(): AsGeneric() {
27 p_predecessorTable = NULL;
35 table_size = (int)xbt_dynar_length(p_indexNetworkElm);
36 if (p_linkTable == NULL) // Dealing with a parse error in the file?
38 /* Delete link_table */
39 for (i = 0; i < table_size; i++)
40 for (j = 0; j < table_size; j++) {
41 generic_free_route(TO_FLOYD_LINK(i, j));
43 xbt_free(p_linkTable);
44 /* Delete bypass dict */
45 xbt_dict_free(&p_bypassRoutes);
46 /* Delete predecessor and cost table */
47 xbt_free(p_predecessorTable);
48 xbt_free(p_costTable);
51 /* Business methods */
52 xbt_dynar_t AsFloyd::getOneLinkRoutes()
54 xbt_dynar_t ret = xbt_dynar_new(sizeof(OnelinkPtr), xbt_free_f);
55 sg_platf_route_cbarg_t route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
56 route->link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
59 sg_routing_edge_t src_elm, dst_elm;
60 int table_size = xbt_dynar_length(p_indexNetworkElm);
61 for(src=0; src < table_size; src++) {
62 for(dst=0; dst< table_size; dst++) {
63 xbt_dynar_reset(route->link_list);
64 src_elm = xbt_dynar_get_as(p_indexNetworkElm, src, RoutingEdgePtr);
65 dst_elm = xbt_dynar_get_as(p_indexNetworkElm, dst, RoutingEdgePtr);
66 this->getRouteAndLatency(src_elm, dst_elm, route, NULL);
68 if (xbt_dynar_length(route->link_list) == 1) {
69 void *link = *(void **) xbt_dynar_get_ptr(route->link_list, 0);
71 if (p_hierarchy == SURF_ROUTING_BASE)
72 onelink = new Onelink(link, src_elm, dst_elm);
73 else if (p_hierarchy == SURF_ROUTING_RECURSIVE)
74 onelink = new Onelink(link, route->gw_src, route->gw_dst);
76 onelink = new Onelink(link, NULL, NULL);
77 xbt_dynar_push(ret, &onelink);
85 void AsFloyd::getRouteAndLatency(RoutingEdgePtr src, RoutingEdgePtr dst, sg_platf_route_cbarg_t res, double *lat)
89 size_t table_size = xbt_dynar_length(p_indexNetworkElm);
91 this->srcDstCheck(src, dst);
93 /* create a result route */
94 xbt_dynar_t route_stack = xbt_dynar_new(sizeof(sg_platf_route_cbarg_t), NULL);
96 int cur = dst->getId();
98 pred = TO_FLOYD_PRED(src->getId(), cur);
100 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->getName(), dst->getName());
101 xbt_dynar_push_as(route_stack, sg_platf_route_cbarg_t, TO_FLOYD_LINK(pred, cur));
103 } while (cur != src->getId());
105 if (p_hierarchy == SURF_ROUTING_RECURSIVE) {
106 res->gw_src = xbt_dynar_getlast_as(route_stack, sg_platf_route_cbarg_t)->gw_src;
107 res->gw_dst = xbt_dynar_getfirst_as(route_stack, sg_platf_route_cbarg_t)->gw_dst;
110 sg_routing_edge_t prev_dst_gw = NULL;
111 while (!xbt_dynar_is_empty(route_stack)) {
112 sg_platf_route_cbarg_t e_route = xbt_dynar_pop_as(route_stack, sg_platf_route_cbarg_t);
117 if (p_hierarchy == SURF_ROUTING_RECURSIVE && prev_dst_gw != NULL
118 && strcmp(prev_dst_gw->getName(), e_route->gw_src->getName())) {
119 routing_get_route_and_latency(prev_dst_gw, e_route->gw_src,
120 &res->link_list, lat);
123 links = e_route->link_list;
124 xbt_dynar_foreach(links, cpt, link) {
125 xbt_dynar_push_as(res->link_list, sg_routing_link_t, link);
127 *lat += static_cast<NetworkLinkPtr>(link)->getLatency();
130 prev_dst_gw = e_route->gw_dst;
132 xbt_dynar_free(&route_stack);
135 static int floyd_pointer_resource_cmp(const void *a, const void *b) {
139 void AsFloyd::parseASroute(sg_platf_route_cbarg_t route){
143 void AsFloyd::parseRoute(sg_platf_route_cbarg_t route)
145 char *src = (char*)(route->src);
146 char *dst = (char*)(route->dst);
150 /* set the size of table routing */
151 int table_size = (int)xbt_dynar_length(p_indexNetworkElm);
152 RoutingEdgePtr src_net_elm, dst_net_elm;
154 src_net_elm = sg_routing_edge_by_name_or_null(src);
155 dst_net_elm = sg_routing_edge_by_name_or_null(dst);
157 xbt_assert(src_net_elm, "Network elements %s not found", src);
158 xbt_assert(dst_net_elm, "Network elements %s not found", dst);
163 /* Create Cost, Predecessor and Link tables */
164 p_costTable = xbt_new0(double, table_size * table_size); /* link cost from host to host */
165 p_predecessorTable = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
166 p_linkTable = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
168 /* Initialize costs and predecessors */
169 for (i = 0; i < table_size; i++)
170 for (j = 0; j < table_size; j++) {
171 TO_FLOYD_COST(i, j) = DBL_MAX;
172 TO_FLOYD_PRED(i, j) = -1;
173 TO_FLOYD_LINK(i, j) = NULL; /* fixed, missing in the previous version */
176 if(!route->gw_dst && !route->gw_src)
177 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", src, dst);
180 XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", src,
181 route->gw_src->getName(), dst, route->gw_dst->getName());
182 if(route->gw_dst->getRcType() == SURF_NETWORK_ELEMENT_NULL)
183 surf_parse_error("The dst_gateway '%s' does not exist!",route->gw_dst->getName());
184 if(route->gw_src->getRcType() == SURF_NETWORK_ELEMENT_NULL)
185 surf_parse_error("The src_gateway '%s' does not exist!",route->gw_src->getName());
188 if(TO_FLOYD_LINK(src_net_elm->getId(), dst_net_elm->getId()))
193 xbt_dynar_t link_route_to_test = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
194 xbt_dynar_foreach(route->link_list,cpt,link_name)
196 void *link = xbt_lib_get_or_null(link_lib, link_name, SURF_LINK_LEVEL);
197 xbt_assert(link,"Link : '%s' doesn't exists.",link_name);
198 xbt_dynar_push(link_route_to_test,&link);
200 xbt_assert(!xbt_dynar_compare(
201 TO_FLOYD_LINK(src_net_elm->getId(), dst_net_elm->getId())->link_list,
203 (int_f_cpvoid_cpvoid_t) floyd_pointer_resource_cmp),
204 "The route between \"%s\" and \"%s\" already exists", src,dst);
208 TO_FLOYD_LINK(src_net_elm->getId(), dst_net_elm->getId()) =
209 newExtendedRoute(p_hierarchy, route, 1);
210 TO_FLOYD_PRED(src_net_elm->getId(), dst_net_elm->getId()) = src_net_elm->getId();
211 TO_FLOYD_COST(src_net_elm->getId(), dst_net_elm->getId()) =
212 ((TO_FLOYD_LINK(src_net_elm->getId(), dst_net_elm->getId()))->link_list)->used; /* count of links, old model assume 1 */
215 if ( (route->symmetrical == TRUE && as_route == 0)
216 || (route->symmetrical == TRUE && as_route == 1)
219 if(TO_FLOYD_LINK(dst_net_elm->getId(), src_net_elm->getId()))
221 if(!route->gw_dst && !route->gw_src)
222 XBT_DEBUG("See Route from \"%s\" to \"%s\"", dst, src);
224 XBT_DEBUG("See ASroute from \"%s(%s)\" to \"%s(%s)\"", dst,
225 route->gw_src->getName(), src, route->gw_dst->getName());
228 xbt_dynar_t link_route_to_test = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
229 for(i=xbt_dynar_length(route->link_list) ;i>0 ;i--)
231 link_name = xbt_dynar_get_as(route->link_list,i-1,char *);
232 void *link = xbt_lib_get_or_null(link_lib, link_name, SURF_LINK_LEVEL);
233 xbt_assert(link,"Link : '%s' doesn't exists.",link_name);
234 xbt_dynar_push(link_route_to_test,&link);
236 xbt_assert(!xbt_dynar_compare(
237 TO_FLOYD_LINK(dst_net_elm->getId(), src_net_elm->getId())->link_list,
239 (int_f_cpvoid_cpvoid_t) floyd_pointer_resource_cmp),
240 "The route between \"%s\" and \"%s\" already exists", src,dst);
244 if(route->gw_dst && route->gw_src)
246 sg_routing_edge_t gw_src = route->gw_src;
247 sg_routing_edge_t gw_dst = route->gw_dst;
248 route->gw_src = gw_dst;
249 route->gw_dst = gw_src;
252 if(!route->gw_src && !route->gw_dst)
253 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", dst, src);
255 XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", dst,
256 route->gw_src->getName(), src, route->gw_dst->getName());
258 TO_FLOYD_LINK(dst_net_elm->getId(), src_net_elm->getId()) =
259 newExtendedRoute(p_hierarchy, route, 0);
260 TO_FLOYD_PRED(dst_net_elm->getId(), src_net_elm->getId()) = dst_net_elm->getId();
261 TO_FLOYD_COST(dst_net_elm->getId(), src_net_elm->getId()) =
262 ((TO_FLOYD_LINK(dst_net_elm->getId(), src_net_elm->getId()))->link_list)->used; /* count of links, old model assume 1 */
265 xbt_dynar_free(&route->link_list);
269 unsigned int i, j, a, b, c;
271 /* set the size of table routing */
272 size_t table_size = xbt_dynar_length(p_indexNetworkElm);
275 /* Create Cost, Predecessor and Link tables */
276 p_costTable = xbt_new0(double, table_size * table_size); /* link cost from host to host */
277 p_predecessorTable = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
278 p_linkTable = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
280 /* Initialize costs and predecessors */
281 for (i = 0; i < table_size; i++)
282 for (j = 0; j < table_size; j++) {
283 TO_FLOYD_COST(i, j) = DBL_MAX;
284 TO_FLOYD_PRED(i, j) = -1;
285 TO_FLOYD_LINK(i, j) = NULL; /* fixed, missing in the previous version */
289 /* Add the loopback if needed */
290 if (routing_platf->p_loopback && p_hierarchy == SURF_ROUTING_BASE) {
291 for (i = 0; i < table_size; i++) {
292 sg_platf_route_cbarg_t e_route = TO_FLOYD_LINK(i, i);
294 e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
295 e_route->gw_src = NULL;
296 e_route->gw_dst = NULL;
297 e_route->link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
298 xbt_dynar_push(e_route->link_list, &routing_platf->p_loopback);
299 TO_FLOYD_LINK(i, i) = e_route;
300 TO_FLOYD_PRED(i, i) = i;
301 TO_FLOYD_COST(i, i) = 1;
305 /* Calculate path costs */
306 for (c = 0; c < table_size; c++) {
307 for (a = 0; a < table_size; a++) {
308 for (b = 0; b < table_size; b++) {
309 if (TO_FLOYD_COST(a, c) < DBL_MAX && TO_FLOYD_COST(c, b) < DBL_MAX) {
310 if (TO_FLOYD_COST(a, b) == DBL_MAX ||
311 (TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b) <
312 TO_FLOYD_COST(a, b))) {
313 TO_FLOYD_COST(a, b) =
314 TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b);
315 TO_FLOYD_PRED(a, b) = TO_FLOYD_PRED(c, b);