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(): AsGeneric() {
21 p_predecessorTable = NULL;
29 table_size = (int)xbt_dynar_length(p_indexNetworkElm);
30 if (p_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));
37 xbt_free(p_linkTable);
38 /* Delete bypass dict */
39 xbt_dict_free(&p_bypassRoutes);
40 /* Delete predecessor and cost table */
41 xbt_free(p_predecessorTable);
42 xbt_free(p_costTable);
45 /* Business methods */
46 xbt_dynar_t AsFloyd::getOneLinkRoutes()
48 xbt_dynar_t ret = xbt_dynar_new(sizeof(Onelink*), xbt_free_f);
49 sg_platf_route_cbarg_t route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
50 route->link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
53 sg_netcard_t src_elm, dst_elm;
54 int table_size = xbt_dynar_length(p_indexNetworkElm);
55 for(src=0; src < table_size; src++) {
56 for(dst=0; dst< table_size; dst++) {
57 xbt_dynar_reset(route->link_list);
58 src_elm = xbt_dynar_get_as(p_indexNetworkElm, src, NetCard*);
59 dst_elm = xbt_dynar_get_as(p_indexNetworkElm, dst, NetCard*);
60 this->getRouteAndLatency(src_elm, dst_elm, route, NULL);
62 if (xbt_dynar_length(route->link_list) == 1) {
63 void *link = *(void **) xbt_dynar_get_ptr(route->link_list, 0);
65 if (p_hierarchy == SURF_ROUTING_BASE)
66 onelink = new Onelink(link, src_elm, dst_elm);
67 else if (p_hierarchy == SURF_ROUTING_RECURSIVE)
68 onelink = new Onelink(link, route->gw_src, route->gw_dst);
70 onelink = new Onelink(link, NULL, NULL);
71 xbt_dynar_push(ret, &onelink);
79 void AsFloyd::getRouteAndLatency(NetCard *src, NetCard *dst, sg_platf_route_cbarg_t res, double *lat)
83 size_t table_size = xbt_dynar_length(p_indexNetworkElm);
85 this->srcDstCheck(src, dst);
87 /* create a result route */
88 xbt_dynar_t route_stack = xbt_dynar_new(sizeof(sg_platf_route_cbarg_t), NULL);
90 int cur = dst->getId();
92 pred = TO_FLOYD_PRED(src->getId(), cur);
94 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->getName(), dst->getName());
95 xbt_dynar_push_as(route_stack, sg_platf_route_cbarg_t, TO_FLOYD_LINK(pred, cur));
97 } while (cur != src->getId());
99 if (p_hierarchy == SURF_ROUTING_RECURSIVE) {
100 res->gw_src = xbt_dynar_getlast_as(route_stack, sg_platf_route_cbarg_t)->gw_src;
101 res->gw_dst = xbt_dynar_getfirst_as(route_stack, sg_platf_route_cbarg_t)->gw_dst;
104 sg_netcard_t prev_dst_gw = NULL;
105 while (!xbt_dynar_is_empty(route_stack)) {
106 sg_platf_route_cbarg_t e_route = xbt_dynar_pop_as(route_stack, sg_platf_route_cbarg_t);
111 if (p_hierarchy == SURF_ROUTING_RECURSIVE && prev_dst_gw != NULL
112 && strcmp(prev_dst_gw->getName(), e_route->gw_src->getName())) {
113 routing_platf->getRouteAndLatency(prev_dst_gw, e_route->gw_src,
114 &res->link_list, lat);
117 links = e_route->link_list;
118 xbt_dynar_foreach(links, cpt, link) {
119 xbt_dynar_push_as(res->link_list, sg_routing_link_t, link);
121 *lat += static_cast<Link*>(link)->getLatency();
124 prev_dst_gw = e_route->gw_dst;
126 xbt_dynar_free(&route_stack);
129 static int floyd_pointer_resource_cmp(const void *a, const void *b) {
133 void AsFloyd::parseASroute(sg_platf_route_cbarg_t route){
137 void AsFloyd::parseRoute(sg_platf_route_cbarg_t route)
139 char *src = (char*)(route->src);
140 char *dst = (char*)(route->dst);
144 /* set the size of table routing */
145 int table_size = (int)xbt_dynar_length(p_indexNetworkElm);
146 NetCard *src_net_elm, *dst_net_elm;
148 src_net_elm = sg_netcard_by_name_or_null(src);
149 dst_net_elm = sg_netcard_by_name_or_null(dst);
151 xbt_assert(src_net_elm, "Network elements %s not found", src);
152 xbt_assert(dst_net_elm, "Network elements %s not found", dst);
157 /* Create Cost, Predecessor and Link tables */
158 p_costTable = xbt_new0(double, table_size * table_size); /* link cost from host to host */
159 p_predecessorTable = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
160 p_linkTable = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
162 /* Initialize costs and predecessors */
163 for (i = 0; i < table_size; i++)
164 for (j = 0; j < table_size; j++) {
165 TO_FLOYD_COST(i, j) = DBL_MAX;
166 TO_FLOYD_PRED(i, j) = -1;
167 TO_FLOYD_LINK(i, j) = NULL; /* fixed, missing in the previous version */
170 if(!route->gw_dst && !route->gw_src)
171 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", src, dst);
174 XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", src,
175 route->gw_src->getName(), dst, route->gw_dst->getName());
176 if(route->gw_dst->getRcType() == SURF_NETWORK_ELEMENT_NULL)
177 surf_parse_error("The dst_gateway '%s' does not exist!",route->gw_dst->getName());
178 if(route->gw_src->getRcType() == SURF_NETWORK_ELEMENT_NULL)
179 surf_parse_error("The src_gateway '%s' does not exist!",route->gw_src->getName());
182 if(TO_FLOYD_LINK(src_net_elm->getId(), dst_net_elm->getId()))
187 xbt_dynar_t link_route_to_test = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
188 xbt_dynar_foreach(route->link_list,cpt,link_name)
190 void *link = Link::byName(link_name);
191 xbt_assert(link,"Link : '%s' doesn't exists.",link_name);
192 xbt_dynar_push(link_route_to_test,&link);
194 xbt_assert(!xbt_dynar_compare(
195 TO_FLOYD_LINK(src_net_elm->getId(), dst_net_elm->getId())->link_list,
197 (int_f_cpvoid_cpvoid_t) floyd_pointer_resource_cmp),
198 "The route between \"%s\" and \"%s\" already exists", src,dst);
202 TO_FLOYD_LINK(src_net_elm->getId(), dst_net_elm->getId()) =
203 newExtendedRoute(p_hierarchy, route, 1);
204 TO_FLOYD_PRED(src_net_elm->getId(), dst_net_elm->getId()) = src_net_elm->getId();
205 TO_FLOYD_COST(src_net_elm->getId(), dst_net_elm->getId()) =
206 ((TO_FLOYD_LINK(src_net_elm->getId(), dst_net_elm->getId()))->link_list)->used; /* count of links, old model assume 1 */
209 if ( (route->symmetrical == TRUE && as_route == 0)
210 || (route->symmetrical == TRUE && as_route == 1)
213 if(TO_FLOYD_LINK(dst_net_elm->getId(), src_net_elm->getId()))
215 if(!route->gw_dst && !route->gw_src)
216 XBT_DEBUG("See Route from \"%s\" to \"%s\"", dst, src);
218 XBT_DEBUG("See ASroute from \"%s(%s)\" to \"%s(%s)\"", dst,
219 route->gw_src->getName(), src, route->gw_dst->getName());
222 xbt_dynar_t link_route_to_test = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
223 for(i=xbt_dynar_length(route->link_list) ;i>0 ;i--)
225 link_name = xbt_dynar_get_as(route->link_list,i-1,char *);
226 void *link = Link::byName(link_name);
227 xbt_assert(link,"Link : '%s' doesn't exists.",link_name);
228 xbt_dynar_push(link_route_to_test,&link);
230 xbt_assert(!xbt_dynar_compare(
231 TO_FLOYD_LINK(dst_net_elm->getId(), src_net_elm->getId())->link_list,
233 (int_f_cpvoid_cpvoid_t) floyd_pointer_resource_cmp),
234 "The route between \"%s\" and \"%s\" already exists", src,dst);
238 if(route->gw_dst && route->gw_src)
240 sg_netcard_t gw_src = route->gw_src;
241 sg_netcard_t gw_dst = route->gw_dst;
242 route->gw_src = gw_dst;
243 route->gw_dst = gw_src;
246 if(!route->gw_src && !route->gw_dst)
247 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", dst, src);
249 XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", dst,
250 route->gw_src->getName(), src, route->gw_dst->getName());
252 TO_FLOYD_LINK(dst_net_elm->getId(), src_net_elm->getId()) =
253 newExtendedRoute(p_hierarchy, route, 0);
254 TO_FLOYD_PRED(dst_net_elm->getId(), src_net_elm->getId()) = dst_net_elm->getId();
255 TO_FLOYD_COST(dst_net_elm->getId(), src_net_elm->getId()) =
256 ((TO_FLOYD_LINK(dst_net_elm->getId(), src_net_elm->getId()))->link_list)->used; /* count of links, old model assume 1 */
259 xbt_dynar_free(&route->link_list);
262 void AsFloyd::Seal(){
263 unsigned int i, j, a, b, c;
265 /* set the size of table routing */
266 size_t table_size = xbt_dynar_length(p_indexNetworkElm);
269 /* Create Cost, Predecessor and Link tables */
270 p_costTable = xbt_new0(double, table_size * table_size); /* link cost from host to host */
271 p_predecessorTable = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
272 p_linkTable = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
274 /* Initialize costs and predecessors */
275 for (i = 0; i < table_size; i++)
276 for (j = 0; j < table_size; j++) {
277 TO_FLOYD_COST(i, j) = DBL_MAX;
278 TO_FLOYD_PRED(i, j) = -1;
279 TO_FLOYD_LINK(i, j) = NULL; /* fixed, missing in the previous version */
283 /* Add the loopback if needed */
284 if (routing_platf->p_loopback && p_hierarchy == SURF_ROUTING_BASE) {
285 for (i = 0; i < table_size; i++) {
286 sg_platf_route_cbarg_t e_route = TO_FLOYD_LINK(i, i);
288 e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
289 e_route->gw_src = NULL;
290 e_route->gw_dst = NULL;
291 e_route->link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
292 xbt_dynar_push(e_route->link_list, &routing_platf->p_loopback);
293 TO_FLOYD_LINK(i, i) = e_route;
294 TO_FLOYD_PRED(i, i) = i;
295 TO_FLOYD_COST(i, i) = 1;
299 /* Calculate path costs */
300 for (c = 0; c < table_size; c++) {
301 for (a = 0; a < table_size; a++) {
302 for (b = 0; b < table_size; b++) {
303 if (TO_FLOYD_COST(a, c) < DBL_MAX && TO_FLOYD_COST(c, b) < DBL_MAX) {
304 if (TO_FLOYD_COST(a, b) == DBL_MAX ||
305 (TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b) <
306 TO_FLOYD_COST(a, b))) {
307 TO_FLOYD_COST(a, b) =
308 TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b);
309 TO_FLOYD_PRED(a, b) = TO_FLOYD_PRED(c, b);