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. */
13 #include <xbt/sysdep.h>
14 #include <xbt/dynar.h>
15 #include <xbt/graph.h>
17 #include "simgrid/platf_interface.h" // platform creation API internal interface
19 #include "surf_routing_generic.hpp"
20 #include "surf_routing_private.hpp"
21 #include "network_interface.hpp"
23 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_routing_generic, surf_route, "Generic implementation of the surf routing");
25 static int no_bypassroute_declared = 1;
27 void routing_route_free(sg_platf_route_cbarg_t route)
30 xbt_dynar_free(&route->link_list);
38 AsGeneric::AsGeneric(const char*name)
41 bypassRoutes_ = xbt_dict_new_homogeneous((void (*)(void *)) routing_route_free);
44 AsGeneric::~AsGeneric()
46 xbt_dict_free(&bypassRoutes_);
49 void AsGeneric::parseBypassroute(sg_platf_route_cbarg_t e_route)
51 char *src = (char*)(e_route->src);
52 char *dst = (char*)(e_route->dst);
55 XBT_DEBUG("Load bypassASroute from \"%s\" to \"%s\"", src, dst);
57 XBT_DEBUG("Load bypassRoute from \"%s\" to \"%s\"", src, dst);
58 xbt_dict_t dict_bypassRoutes = bypassRoutes_;
61 route_name = bprintf("%s#%s", src, dst);
62 xbt_assert(!xbt_dynar_is_empty(e_route->link_list),
63 "Invalid count of links, must be greater than zero (%s,%s)",
65 xbt_assert(!xbt_dict_get_or_null(dict_bypassRoutes, route_name),
66 "The bypass route between \"%s\"(\"%s\") and \"%s\"(\"%s\") already exists",
67 src, e_route->gw_src->name(), dst, e_route->gw_dst->name());
69 sg_platf_route_cbarg_t new_e_route = NULL;
71 new_e_route = newExtendedRoute(SURF_ROUTING_RECURSIVE, e_route, 1);
73 new_e_route = newExtendedRoute(SURF_ROUTING_BASE, e_route, 1);
75 xbt_dynar_free(&(e_route->link_list));
77 xbt_dict_set(dict_bypassRoutes, route_name, new_e_route, NULL);
78 no_bypassroute_declared = 0;
85 /* ************************************************************************** */
86 /* *********************** GENERIC BUSINESS METHODS ************************* */
88 static const char *instr_node_name(xbt_node_t node)
90 void *data = xbt_graph_node_get_data(node);
91 char *str = (char *) data;
95 xbt_node_t new_xbt_graph_node(xbt_graph_t graph, const char *name,
98 xbt_node_t ret = (xbt_node_t) xbt_dict_get_or_null(nodes, name);
102 ret = xbt_graph_new_node(graph, xbt_strdup(name));
103 xbt_dict_set(nodes, name, ret, NULL);
107 xbt_edge_t new_xbt_graph_edge(xbt_graph_t graph, xbt_node_t s, xbt_node_t d,
112 const char *sn = instr_node_name(s);
113 const char *dn = instr_node_name(d);
114 int len = strlen(sn) + strlen(dn) + 1;
115 char *name = (char *) xbt_malloc(len * sizeof(char));
118 snprintf(name, len, "%s%s", sn, dn);
119 ret = (xbt_edge_t) xbt_dict_get_or_null(edges, name);
121 snprintf(name, len, "%s%s", dn, sn);
122 ret = (xbt_edge_t) xbt_dict_get_or_null(edges, name);
126 ret = xbt_graph_new_edge(graph, s, d, NULL);
127 xbt_dict_set(edges, name, ret, NULL);
136 void AsGeneric::getGraph(xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges)
139 int table_size = xbt_dynar_length(vertices_);
142 for (src = 0; src < table_size; src++) {
144 xbt_dynar_get_as(vertices_, src, NetCard*);
145 for (dst = 0; dst < table_size; dst++) {
149 xbt_dynar_get_as(vertices_, dst, NetCard*);
151 sg_platf_route_cbarg_t route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
152 route->link_list = xbt_dynar_new(sizeof(Link*), NULL);
154 getRouteAndLatency(my_src, my_dst, route, NULL);
156 XBT_DEBUG ("get_route_and_latency %s -> %s", my_src->name(), my_dst->name());
161 xbt_node_t current, previous;
162 const char *previous_name, *current_name;
165 previous = new_xbt_graph_node(graph, route->gw_src->name(), nodes);
166 previous_name = route->gw_src->name();
168 previous = new_xbt_graph_node(graph, my_src->name(), nodes);
169 previous_name = my_src->name();
172 xbt_dynar_foreach(route->link_list, cpt, link) {
173 const char *link_name = static_cast<simgrid::surf::Resource*>(
175 current = new_xbt_graph_node(graph, link_name, nodes);
176 current_name = link_name;
177 new_xbt_graph_edge(graph, previous, current, edges);
178 XBT_DEBUG (" %s -> %s", previous_name, current_name);
180 previous_name = current_name;
184 current = new_xbt_graph_node(graph, route->gw_dst->name(), nodes);
185 current_name = route->gw_dst->name();
187 current = new_xbt_graph_node(graph, my_dst->name(), nodes);
188 current_name = my_dst->name();
190 new_xbt_graph_edge(graph, previous, current, edges);
191 XBT_DEBUG (" %s -> %s", previous_name, current_name);
193 xbt_dynar_free (&(route->link_list));
199 sg_platf_route_cbarg_t AsGeneric::getBypassRoute(NetCard *src,
203 // If never set a bypass route return NULL without any further computations
204 XBT_DEBUG("generic_get_bypassroute from %s to %s", src->name(), dst->name());
205 if (no_bypassroute_declared)
208 sg_platf_route_cbarg_t e_route_bypass = NULL;
209 xbt_dict_t dict_bypassRoutes = bypassRoutes_;
211 if(dst->containingAS() == this && src->containingAS() == this ){
212 char *route_name = bprintf("%s#%s", src->name(), dst->name());
213 e_route_bypass = (sg_platf_route_cbarg_t) xbt_dict_get_or_null(dict_bypassRoutes, route_name);
215 XBT_DEBUG("Find bypass route with %ld links",xbt_dynar_length(e_route_bypass->link_list));
220 int index_src, index_dst;
221 xbt_dynar_t path_src = NULL;
222 xbt_dynar_t path_dst = NULL;
224 As **current_src = NULL;
225 As **current_dst = NULL;
227 if (src == NULL || dst == NULL)
228 xbt_die("Ask for route \"from\"(%s) or \"to\"(%s) no found at AS \"%s\"",
229 src ? src->name() : "(null)",
230 dst ? dst->name() : "(null)", name_);
232 src_as = src->containingAS();
233 dst_as = dst->containingAS();
235 /* (2) find the path to the root routing component */
236 path_src = xbt_dynar_new(sizeof(As*), NULL);
238 while (current != NULL) {
239 xbt_dynar_push(path_src, ¤t);
240 current = current->father_;
242 path_dst = xbt_dynar_new(sizeof(As*), NULL);
244 while (current != NULL) {
245 xbt_dynar_push(path_dst, ¤t);
246 current = current->father_;
249 /* (3) find the common father */
250 index_src = path_src->used - 1;
251 index_dst = path_dst->used - 1;
252 current_src = (As **) xbt_dynar_get_ptr(path_src, index_src);
253 current_dst = (As **) xbt_dynar_get_ptr(path_dst, index_dst);
254 while (index_src >= 0 && index_dst >= 0 && *current_src == *current_dst) {
255 xbt_dynar_pop_ptr(path_src);
256 xbt_dynar_pop_ptr(path_dst);
259 current_src = (As **) xbt_dynar_get_ptr(path_src, index_src);
260 current_dst = (As **) xbt_dynar_get_ptr(path_dst, index_dst);
263 int max_index_src = path_src->used - 1;
264 int max_index_dst = path_dst->used - 1;
266 int max_index = std::max(max_index_src, max_index_dst);
269 for (max = 0; max <= max_index; max++) {
270 for (i = 0; i < max; i++) {
271 if (i <= max_index_src && max <= max_index_dst) {
272 char *route_name = bprintf("%s#%s",
274 (xbt_dynar_get_ptr(path_src, i)))->name_,
276 (xbt_dynar_get_ptr(path_dst, max)))->name_);
277 e_route_bypass = (sg_platf_route_cbarg_t) xbt_dict_get_or_null(dict_bypassRoutes, route_name);
278 xbt_free(route_name);
282 if (max <= max_index_src && i <= max_index_dst) {
283 char *route_name = bprintf("%s#%s",
285 (xbt_dynar_get_ptr(path_src, max)))->name_,
287 (xbt_dynar_get_ptr(path_dst, i)))->name_);
288 e_route_bypass = (sg_platf_route_cbarg_t) xbt_dict_get_or_null(dict_bypassRoutes, route_name);
289 xbt_free(route_name);
298 if (max <= max_index_src && max <= max_index_dst) {
299 char *route_name = bprintf("%s#%s",
301 (xbt_dynar_get_ptr(path_src, max)))->name_,
303 (xbt_dynar_get_ptr(path_dst, max)))->name_);
304 e_route_bypass = (sg_platf_route_cbarg_t) xbt_dict_get_or_null(dict_bypassRoutes, route_name);
305 xbt_free(route_name);
311 xbt_dynar_free(&path_src);
312 xbt_dynar_free(&path_dst);
315 sg_platf_route_cbarg_t new_e_route = NULL;
316 if (e_route_bypass) {
318 unsigned int cpt = 0;
319 new_e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
320 new_e_route->gw_src = e_route_bypass->gw_src;
321 new_e_route->gw_dst = e_route_bypass->gw_dst;
322 new_e_route->link_list =
323 xbt_dynar_new(sizeof(Link*), NULL);
324 xbt_dynar_foreach(e_route_bypass->link_list, cpt, link) {
325 xbt_dynar_push(new_e_route->link_list, &link);
327 *lat += link->getLatency();
334 /* ************************************************************************** */
335 /* ************************* GENERIC AUX FUNCTIONS ************************** */
336 /* change a route containing link names into a route containing link entities */
337 sg_platf_route_cbarg_t AsGeneric::newExtendedRoute(e_surf_routing_hierarchy_t hierarchy,
338 sg_platf_route_cbarg_t routearg, int change_order) {
340 sg_platf_route_cbarg_t result;
344 result = xbt_new0(s_sg_platf_route_cbarg_t, 1);
345 result->link_list = xbt_dynar_new(sizeof(Link*), NULL);
347 xbt_assert(hierarchy == SURF_ROUTING_BASE
348 || hierarchy == SURF_ROUTING_RECURSIVE,
349 "The hierarchy of this AS is neither BASIC nor RECURSIVE, I'm lost here.");
351 if (hierarchy == SURF_ROUTING_RECURSIVE) {
353 xbt_assert(routearg->gw_src && routearg->gw_dst, "NULL is obviously a deficient gateway");
355 /* remember not erase the gateway names */
356 result->gw_src = routearg->gw_src;
357 result->gw_dst = routearg->gw_dst;
360 xbt_dynar_foreach(routearg->link_list, cpt, link_name) {
362 Link *link = Link::byName(link_name);
365 xbt_dynar_push(result->link_list, &link);
367 xbt_dynar_unshift(result->link_list, &link);
369 THROWF(mismatch_error, 0, "Link '%s' not found", link_name);
375 void AsGeneric::getRouteCheckParams(NetCard *src, NetCard *dst)
377 xbt_assert(src,"Cannot find a route from NULL to %s", dst->name());
378 xbt_assert(dst,"Cannot find a route from %s to NULL", src->name());
380 As *src_as = src->containingAS();
381 As *dst_as = dst->containingAS();
383 xbt_assert(src_as == dst_as, "Internal error: %s@%s and %s@%s are not in the same AS as expected. Please report that bug.",
384 src->name(), src_as->name_, dst->name(), dst_as->name_);
386 xbt_assert(this == dst_as,
387 "Internal error: route destination %s@%s is not in AS %s as expected (route source: %s@%s). Please report that bug.",
388 src->name(), dst->name(), src_as->name_, dst_as->name_, name_);
390 void AsGeneric::parseRouteCheckParams(sg_platf_route_cbarg_t route) {
391 const char *srcName = route->src;
392 const char *dstName = route->dst;
393 NetCard *src = sg_netcard_by_name_or_null(srcName);
394 NetCard *dst = sg_netcard_by_name_or_null(dstName);
396 if(!route->gw_dst && !route->gw_src) {
397 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", srcName, dstName);
398 xbt_assert(src, "Cannot add a route from %s to %s: %s does not exist.", srcName, dstName, srcName);
399 xbt_assert(dst, "Cannot add a route from %s to %s: %s does not exist.", srcName, dstName, dstName);
400 xbt_assert(!xbt_dynar_is_empty(route->link_list), "Empty route (between %s and %s) forbidden.", srcName, dstName);
402 XBT_DEBUG("Load ASroute from %s@%s to %s@%s", srcName, route->gw_src->name(), dstName, route->gw_dst->name());
403 xbt_assert(src, "Cannot add a route from %s@%s to %s@%s: %s does not exist.",
404 srcName,route->gw_src->name(), dstName,route->gw_dst->name(), srcName);
405 xbt_assert(dst, "Cannot add a route from %s@%s to %s@%s: %s does not exist.",
406 srcName,route->gw_src->name(), dstName,route->gw_dst->name(), dstName);
407 xbt_assert(!xbt_dynar_is_empty(route->link_list), "Empty route (between %s@%s and %s@%s) forbidden.",
408 srcName,route->gw_src->name(), dstName,route->gw_dst->name());