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_floyd.hpp"
8 #include "src/surf/network_interface.hpp"
10 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_floyd, surf, "Routing part of surf");
12 #define TO_FLOYD_COST(i,j) (costTable_)[(i)+(j)*table_size]
13 #define TO_FLOYD_PRED(i,j) (predecessorTable_)[(i)+(j)*table_size]
14 #define TO_FLOYD_LINK(i,j) (linkTable_)[(i)+(j)*table_size]
19 AsFloyd::AsFloyd(const char*name)
22 predecessorTable_ = NULL;
29 int table_size = (int)xbt_dynar_length(vertices_);
30 if (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));
38 xbt_free(predecessorTable_);
42 /* Business methods */
43 xbt_dynar_t AsFloyd::getOneLinkRoutes()
45 xbt_dynar_t ret = xbt_dynar_new(sizeof(Onelink*), xbt_free_f);
46 sg_platf_route_cbarg_t route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
47 route->link_list = xbt_dynar_new(sizeof(Link*), NULL);
50 sg_netcard_t src_elm, dst_elm;
51 int table_size = xbt_dynar_length(vertices_);
52 for(src=0; src < table_size; src++) {
53 for(dst=0; dst< table_size; dst++) {
54 xbt_dynar_reset(route->link_list);
55 src_elm = xbt_dynar_get_as(vertices_, src, NetCard*);
56 dst_elm = xbt_dynar_get_as(vertices_, dst, NetCard*);
57 this->getRouteAndLatency(src_elm, dst_elm, route, NULL);
59 if (xbt_dynar_length(route->link_list) == 1) {
60 void *link = *(void **) xbt_dynar_get_ptr(route->link_list, 0);
62 if (hierarchy_ == SURF_ROUTING_BASE)
63 onelink = new Onelink(link, src_elm, dst_elm);
64 else if (hierarchy_ == SURF_ROUTING_RECURSIVE)
65 onelink = new Onelink(link, route->gw_src, route->gw_dst);
67 onelink = new Onelink(link, NULL, NULL);
68 xbt_dynar_push(ret, &onelink);
76 void AsFloyd::getRouteAndLatency(NetCard *src, NetCard *dst, sg_platf_route_cbarg_t res, double *lat)
79 size_t table_size = xbt_dynar_length(vertices_);
81 getRouteCheckParams(src, dst);
83 /* create a result route */
84 xbt_dynar_t route_stack = xbt_dynar_new(sizeof(sg_platf_route_cbarg_t), NULL);
88 pred = TO_FLOYD_PRED(src->id(), cur);
90 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->name(), dst->name());
91 xbt_dynar_push_as(route_stack, sg_platf_route_cbarg_t, TO_FLOYD_LINK(pred, cur));
93 } while (cur != src->id());
95 if (hierarchy_ == SURF_ROUTING_RECURSIVE) {
96 res->gw_src = xbt_dynar_getlast_as(route_stack, sg_platf_route_cbarg_t)->gw_src;
97 res->gw_dst = xbt_dynar_getfirst_as(route_stack, sg_platf_route_cbarg_t)->gw_dst;
100 sg_netcard_t prev_dst_gw = NULL;
101 while (!xbt_dynar_is_empty(route_stack)) {
102 sg_platf_route_cbarg_t e_route = xbt_dynar_pop_as(route_stack, sg_platf_route_cbarg_t);
107 if (hierarchy_ == SURF_ROUTING_RECURSIVE && prev_dst_gw != NULL && strcmp(prev_dst_gw->name(), e_route->gw_src->name())) {
108 routing_platf->getRouteAndLatency(prev_dst_gw, e_route->gw_src, &res->link_list, lat);
111 links = e_route->link_list;
112 xbt_dynar_foreach(links, cpt, link) {
113 xbt_dynar_push_as(res->link_list, Link*, (Link*)link);
115 *lat += static_cast<Link*>(link)->getLatency();
118 prev_dst_gw = e_route->gw_dst;
120 xbt_dynar_free(&route_stack);
123 static int floyd_pointer_resource_cmp(const void *a, const void *b) {
127 void AsFloyd::addRoute(sg_platf_route_cbarg_t route)
129 /* set the size of table routing */
130 int table_size = (int)xbt_dynar_length(vertices_);
132 NetCard *src = sg_netcard_by_name_or_null(route->src);
133 NetCard *dst = sg_netcard_by_name_or_null(route->dst);
135 addRouteCheckParams(route);
138 /* Create Cost, Predecessor and Link tables */
139 costTable_ = xbt_new0(double, table_size * table_size); /* link cost from host to host */
140 predecessorTable_ = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
141 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
143 /* Initialize costs and predecessors */
144 for (int i = 0; i < table_size; i++)
145 for (int j = 0; j < table_size; j++) {
146 TO_FLOYD_COST(i, j) = DBL_MAX;
147 TO_FLOYD_PRED(i, j) = -1;
148 TO_FLOYD_LINK(i, j) = NULL;
152 /* Check that the route does not already exist */
153 if (route->gw_dst) // AS route (to adapt the error message, if any)
154 xbt_assert(nullptr == TO_FLOYD_LINK(src->id(), dst->id()),
155 "The route between %s@%s and %s@%s already exists (Rq: routes are symmetrical by default).",
156 src->name(),route->gw_src->name(),dst->name(),route->gw_dst->name());
158 xbt_assert(nullptr == TO_FLOYD_LINK(src->id(), dst->id()),
159 "The route between %s and %s already exists (Rq: routes are symmetrical by default).", src->name(),dst->name());
161 TO_FLOYD_LINK(src->id(), dst->id()) = newExtendedRoute(hierarchy_, route, 1);
162 TO_FLOYD_PRED(src->id(), dst->id()) = src->id();
163 TO_FLOYD_COST(src->id(), dst->id()) = ((TO_FLOYD_LINK(src->id(), dst->id()))->link_list)->used;
166 if (route->symmetrical == TRUE) {
167 if(TO_FLOYD_LINK(dst->id(), src->id()))
169 if(!route->gw_dst && !route->gw_src)
170 XBT_DEBUG("See Route from \"%s\" to \"%s\"", dst->name(), src->name());
172 XBT_DEBUG("See ASroute from \"%s(%s)\" to \"%s(%s)\"", dst->name(), route->gw_src->name(), src->name(), route->gw_dst->name());
175 xbt_dynar_t link_route_to_test = xbt_dynar_new(sizeof(Link*), NULL);
176 for(int i=xbt_dynar_length(route->link_list) ;i>0 ;i--) {
177 link_name = xbt_dynar_get_as(route->link_list,i-1,char *);
178 void *link = Link::byName(link_name);
179 xbt_assert(link,"Link : '%s' doesn't exists.",link_name);
180 xbt_dynar_push(link_route_to_test,&link);
182 xbt_assert(!xbt_dynar_compare(
183 TO_FLOYD_LINK(dst->id(), src->id())->link_list,
185 (int_f_cpvoid_cpvoid_t) floyd_pointer_resource_cmp),
186 "The route between \"%s\" and \"%s\" already exists", src->name(),dst->name());
190 if(route->gw_dst && route->gw_src) {
191 NetCard* gw_tmp = route->gw_src;
192 route->gw_src = route->gw_dst;
193 route->gw_dst = gw_tmp;
196 if(!route->gw_src && !route->gw_dst)
197 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", dst->name(), src->name());
199 XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", dst->name(),
200 route->gw_src->name(), src->name(), route->gw_dst->name());
202 TO_FLOYD_LINK(dst->id(), src->id()) =
203 newExtendedRoute(hierarchy_, route, 0);
204 TO_FLOYD_PRED(dst->id(), src->id()) = dst->id();
205 TO_FLOYD_COST(dst->id(), src->id()) =
206 ((TO_FLOYD_LINK(dst->id(), src->id()))->link_list)->used; /* count of links, old model assume 1 */
209 xbt_dynar_free(&route->link_list);
212 void AsFloyd::Seal(){
214 /* set the size of table routing */
215 size_t table_size = xbt_dynar_length(vertices_);
218 /* Create Cost, Predecessor and Link tables */
219 costTable_ = xbt_new0(double, table_size * table_size); /* link cost from host to host */
220 predecessorTable_ = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
221 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
223 /* Initialize costs and predecessors */
224 for (unsigned int i = 0; i < table_size; i++)
225 for (unsigned int j = 0; j < table_size; j++) {
226 TO_FLOYD_COST(i, j) = DBL_MAX;
227 TO_FLOYD_PRED(i, j) = -1;
228 TO_FLOYD_LINK(i, j) = NULL;
232 /* Add the loopback if needed */
233 if (routing_platf->loopback_ && hierarchy_ == SURF_ROUTING_BASE) {
234 for (unsigned int i = 0; i < table_size; i++) {
235 sg_platf_route_cbarg_t e_route = TO_FLOYD_LINK(i, i);
237 e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
238 e_route->gw_src = NULL;
239 e_route->gw_dst = NULL;
240 e_route->link_list = xbt_dynar_new(sizeof(Link*), NULL);
241 xbt_dynar_push(e_route->link_list, &routing_platf->loopback_);
242 TO_FLOYD_LINK(i, i) = e_route;
243 TO_FLOYD_PRED(i, i) = i;
244 TO_FLOYD_COST(i, i) = 1;
248 /* Calculate path costs */
249 for (unsigned int c = 0; c < table_size; c++) {
250 for (unsigned int a = 0; a < table_size; a++) {
251 for (unsigned int b = 0; b < table_size; b++) {
252 if (TO_FLOYD_COST(a, c) < DBL_MAX && TO_FLOYD_COST(c, b) < DBL_MAX) {
253 if (TO_FLOYD_COST(a, b) == DBL_MAX ||
254 (TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b) <
255 TO_FLOYD_COST(a, b))) {
256 TO_FLOYD_COST(a, b) =
257 TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b);
258 TO_FLOYD_PRED(a, b) = TO_FLOYD_PRED(c, b);