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 "simgrid/platf_interface.h" // platform creation API internal interface
9 #include "surf_routing_private.h"
10 #include "surf/surf_routing.h"
11 #include "surf/surfxml_parse_values.h"
12 #include "xbt/graph.h"
14 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_routing_generic, surf_route, "Generic implementation of the surf routing");
16 static int no_bypassroute_declared = 1;
18 AS_t model_generic_create_sized(size_t childsize) {
19 AS_t new_component = model_none_create_sized(childsize);
21 new_component->parse_PU = generic_parse_PU;
22 new_component->parse_AS = generic_parse_AS;
23 new_component->parse_route = NULL;
24 new_component->parse_ASroute = NULL;
25 new_component->parse_bypassroute = generic_parse_bypassroute;
26 new_component->get_route_and_latency = NULL;
27 new_component->get_onelink_routes = NULL;
28 new_component->get_bypass_route =
29 generic_get_bypassroute;
30 new_component->finalize = model_generic_finalize;
31 new_component->bypassRoutes = xbt_dict_new_homogeneous((void (*)(void *)) generic_free_route);
35 void model_generic_finalize(AS_t as) {
36 xbt_dict_free(&as->bypassRoutes);
37 model_none_finalize(as);
40 int generic_parse_PU(AS_t as, sg_routing_edge_t elm)
42 XBT_DEBUG("Load process unit \"%s\"", elm->name);
43 xbt_dynar_push_as(as->index_network_elm,sg_routing_edge_t,elm);
44 return xbt_dynar_length(as->index_network_elm)-1;
47 int generic_parse_AS(AS_t as, sg_routing_edge_t elm)
49 XBT_DEBUG("Load Autonomous system \"%s\"", elm->name);
50 xbt_dynar_push_as(as->index_network_elm,sg_routing_edge_t,elm);
51 return xbt_dynar_length(as->index_network_elm)-1;
54 void generic_parse_bypassroute(AS_t rc, sg_platf_route_cbarg_t e_route)
56 char *src = (char*)(e_route->src);
57 char *dst = (char*)(e_route->dst);
60 XBT_DEBUG("Load bypassASroute from \"%s\" to \"%s\"", src, dst);
62 XBT_DEBUG("Load bypassRoute from \"%s\" to \"%s\"", src, dst);
63 xbt_dict_t dict_bypassRoutes = rc->bypassRoutes;
66 route_name = bprintf("%s#%s", src, dst);
67 xbt_assert(!xbt_dynar_is_empty(e_route->link_list),
68 "Invalid count of links, must be greater than zero (%s,%s)",
70 xbt_assert(!xbt_dict_get_or_null(dict_bypassRoutes, route_name),
71 "The bypass route between \"%s\"(\"%s\") and \"%s\"(\"%s\") already exists",
72 src, e_route->gw_src->name, dst, e_route->gw_dst->name);
74 sg_platf_route_cbarg_t new_e_route = NULL;
76 new_e_route = generic_new_extended_route(SURF_ROUTING_RECURSIVE, e_route, 1);
78 new_e_route = generic_new_extended_route(SURF_ROUTING_BASE, e_route, 1);
80 xbt_dynar_free(&(e_route->link_list));
82 xbt_dict_set(dict_bypassRoutes, route_name, new_e_route, NULL);
83 no_bypassroute_declared = 0;
87 /* ************************************************************************** */
88 /* *********************** GENERIC BUSINESS METHODS ************************* */
90 xbt_dynar_t generic_get_onelink_routes(AS_t rc) { // FIXME: kill that stub
91 xbt_die("\"generic_get_onelink_routes\" not implemented yet");
95 static const char *instr_node_name(xbt_node_t node)
97 void *data = xbt_graph_node_get_data(node);
98 char *str = (char *) data;
102 xbt_node_t new_xbt_graph_node(xbt_graph_t graph, const char *name,
105 xbt_node_t ret = xbt_dict_get_or_null(nodes, name);
109 ret = xbt_graph_new_node(graph, xbt_strdup(name));
110 xbt_dict_set(nodes, name, ret, NULL);
114 xbt_edge_t new_xbt_graph_edge(xbt_graph_t graph, xbt_node_t s, xbt_node_t d,
119 const char *sn = instr_node_name(s);
120 const char *dn = instr_node_name(d);
121 int len = strlen(sn) + strlen(dn) + 1;
122 char *name = (char *) xbt_malloc(len * sizeof(char));
125 snprintf(name, len, "%s%s", sn, dn);
126 ret = xbt_dict_get_or_null(edges, name);
128 snprintf(name, len, "%s%s", dn, sn);
129 ret = xbt_dict_get_or_null(edges, name);
133 ret = xbt_graph_new_edge(graph, s, d, NULL);
134 xbt_dict_set(edges, name, ret, NULL);
140 void generic_get_graph(xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges,
144 int table_size = xbt_dynar_length(rc->index_network_elm);
146 sg_platf_route_cbarg_t route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
147 route->link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
149 for (src = 0; src < table_size; src++) {
150 sg_routing_edge_t my_src =
151 xbt_dynar_get_as(rc->index_network_elm, src, sg_routing_edge_t);
152 for (dst = 0; dst < table_size; dst++) {
155 sg_routing_edge_t my_dst =
156 xbt_dynar_get_as(rc->index_network_elm, dst, sg_routing_edge_t);
158 rc->get_route_and_latency(rc, my_src, my_dst, route, NULL);
164 xbt_node_t current, previous;
167 previous = new_xbt_graph_node(graph, route->gw_src->name, nodes);
169 previous = new_xbt_graph_node(graph, my_src->name, nodes);
172 xbt_dynar_foreach(route->link_list, cpt, link) {
173 char *link_name = ((surf_resource_t) link)->name;
174 current = new_xbt_graph_node(graph, link_name, nodes);
175 new_xbt_graph_edge(graph, previous, current, edges);
180 current = new_xbt_graph_node(graph, route->gw_dst->name, nodes);
182 current = new_xbt_graph_node(graph, my_dst->name, nodes);
184 new_xbt_graph_edge(graph, previous, current, edges);
191 sg_platf_route_cbarg_t generic_get_bypassroute(AS_t rc, sg_routing_edge_t src,
192 sg_routing_edge_t dst,
195 // If never set a bypass route return NULL without any further computations
196 XBT_DEBUG("generic_get_bypassroute from %s to %s", src->name, dst->name);
197 if (no_bypassroute_declared)
200 sg_platf_route_cbarg_t e_route_bypass = NULL;
201 xbt_dict_t dict_bypassRoutes = rc->bypassRoutes;
203 if(dst->rc_component == rc && src->rc_component == rc ){
204 char *route_name = bprintf("%s#%s", src->name, dst->name);
205 e_route_bypass = xbt_dict_get_or_null(dict_bypassRoutes, route_name);
207 XBT_DEBUG("Find bypass route with %ld links",xbt_dynar_length(e_route_bypass->link_list));
212 int index_src, index_dst;
213 xbt_dynar_t path_src = NULL;
214 xbt_dynar_t path_dst = NULL;
216 AS_t *current_src = NULL;
217 AS_t *current_dst = NULL;
219 if (src == NULL || dst == NULL)
220 xbt_die("Ask for route \"from\"(%s) or \"to\"(%s) no found at AS \"%s\"",
221 src->name, dst->name, rc->name);
223 src_as = src->rc_component;
224 dst_as = dst->rc_component;
226 /* (2) find the path to the root routing component */
227 path_src = xbt_dynar_new(sizeof(AS_t), NULL);
229 while (current != NULL) {
230 xbt_dynar_push(path_src, ¤t);
231 current = current->routing_father;
233 path_dst = xbt_dynar_new(sizeof(AS_t), NULL);
235 while (current != NULL) {
236 xbt_dynar_push(path_dst, ¤t);
237 current = current->routing_father;
240 /* (3) find the common father */
241 index_src = path_src->used - 1;
242 index_dst = path_dst->used - 1;
243 current_src = xbt_dynar_get_ptr(path_src, index_src);
244 current_dst = xbt_dynar_get_ptr(path_dst, index_dst);
245 while (index_src >= 0 && index_dst >= 0 && *current_src == *current_dst) {
246 xbt_dynar_pop_ptr(path_src);
247 xbt_dynar_pop_ptr(path_dst);
250 current_src = xbt_dynar_get_ptr(path_src, index_src);
251 current_dst = xbt_dynar_get_ptr(path_dst, index_dst);
254 int max_index_src = path_src->used - 1;
255 int max_index_dst = path_dst->used - 1;
257 int max_index = max(max_index_src, max_index_dst);
260 for (max = 0; max <= max_index; max++) {
261 for (i = 0; i < max; i++) {
262 if (i <= max_index_src && max <= max_index_dst) {
263 char *route_name = bprintf("%s#%s",
265 (xbt_dynar_get_ptr(path_src, i)))->name,
267 (xbt_dynar_get_ptr(path_dst, max)))->name);
268 e_route_bypass = xbt_dict_get_or_null(dict_bypassRoutes, route_name);
269 xbt_free(route_name);
273 if (max <= max_index_src && i <= max_index_dst) {
274 char *route_name = bprintf("%s#%s",
276 (xbt_dynar_get_ptr(path_src, max)))->name,
278 (xbt_dynar_get_ptr(path_dst, i)))->name);
279 e_route_bypass = xbt_dict_get_or_null(dict_bypassRoutes, route_name);
280 xbt_free(route_name);
289 if (max <= max_index_src && max <= max_index_dst) {
290 char *route_name = bprintf("%s#%s",
292 (xbt_dynar_get_ptr(path_src, max)))->name,
294 (xbt_dynar_get_ptr(path_dst, max)))->name);
295 e_route_bypass = xbt_dict_get_or_null(dict_bypassRoutes, route_name);
296 xbt_free(route_name);
302 xbt_dynar_free(&path_src);
303 xbt_dynar_free(&path_dst);
306 sg_platf_route_cbarg_t new_e_route = NULL;
307 if (e_route_bypass) {
309 unsigned int cpt = 0;
310 new_e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
311 new_e_route->gw_src = e_route_bypass->gw_src;
312 new_e_route->gw_dst = e_route_bypass->gw_dst;
313 new_e_route->link_list =
314 xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
315 xbt_dynar_foreach(e_route_bypass->link_list, cpt, link) {
316 xbt_dynar_push(new_e_route->link_list, &link);
318 *lat += surf_network_model->extension.network.get_link_latency(link);
325 /* ************************************************************************** */
326 /* ************************* GENERIC AUX FUNCTIONS ************************** */
327 /* change a route containing link names into a route containing link entities */
328 sg_platf_route_cbarg_t
329 generic_new_extended_route(e_surf_routing_hierarchy_t hierarchy,
330 sg_platf_route_cbarg_t routearg, int change_order) {
332 sg_platf_route_cbarg_t result;
336 result = xbt_new0(s_sg_platf_route_cbarg_t, 1);
337 result->link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
339 xbt_assert(hierarchy == SURF_ROUTING_BASE
340 || hierarchy == SURF_ROUTING_RECURSIVE,
341 "The hierarchy of this AS is neither BASIC nor RECURSIVE, I'm lost here.");
343 if (hierarchy == SURF_ROUTING_RECURSIVE) {
345 xbt_assert(routearg->gw_src && routearg->gw_dst,
346 "NULL is obviously a bad gateway");
348 /* remeber not erase the gateway names */
349 result->gw_src = routearg->gw_src;
350 result->gw_dst = routearg->gw_dst;
353 xbt_dynar_foreach(routearg->link_list, cpt, link_name) {
355 void *link = xbt_lib_get_or_null(link_lib, link_name, SURF_LINK_LEVEL);
358 xbt_dynar_push(result->link_list, &link);
360 xbt_dynar_unshift(result->link_list, &link);
362 THROWF(mismatch_error, 0, "Link %s not found", link_name);
368 void generic_free_route(sg_platf_route_cbarg_t route)
371 xbt_dynar_free(&route->link_list);
376 static AS_t generic_as_exist(AS_t find_from,
379 //return to_find; // FIXME: BYPASSERROR OF FOREACH WITH BREAK
380 xbt_dict_cursor_t cursor = NULL;
384 xbt_dict_foreach(find_from->routing_sons, cursor, key, elem) {
385 if (to_find == elem || generic_as_exist(elem, to_find)) {
396 generic_autonomous_system_exist(AS_t rc, char *element)
398 //return rc; // FIXME: BYPASSERROR OF FOREACH WITH BREAK
399 AS_t element_as, result, elem;
400 xbt_dict_cursor_t cursor = NULL;
402 element_as = ((sg_routing_edge_t)
403 xbt_lib_get_or_null(as_router_lib, element,
404 ROUTING_ASR_LEVEL))->rc_component;
405 result = ((AS_t) - 1);
406 if (element_as != rc)
407 result = generic_as_exist(rc, element_as);
411 xbt_dict_foreach(element_as->routing_sons, cursor, key, elem) {
412 found = !strcmp(elem->name, element);
423 generic_processing_units_exist(AS_t rc, char *element)
426 element_as = ((sg_routing_edge_t)
427 xbt_lib_get_or_null(host_lib,
428 element, ROUTING_HOST_LEVEL))->rc_component;
429 if (element_as == rc)
431 return generic_as_exist(rc, element_as);
434 void generic_src_dst_check(AS_t rc, sg_routing_edge_t src,
435 sg_routing_edge_t dst)
438 sg_routing_edge_t src_data = src;
439 sg_routing_edge_t dst_data = dst;
441 if (src_data == NULL || dst_data == NULL)
442 xbt_die("Ask for route \"from\"(%s) or \"to\"(%s) no found at AS \"%s\"",
448 (src_data)->rc_component;
450 (dst_data)->rc_component;
452 if (src_as != dst_as)
453 xbt_die("The src(%s in %s) and dst(%s in %s) are in differents AS",
454 src->name, src_as->name,
455 dst->name, dst_as->name);
459 ("The routing component of src'%s' and dst'%s' is not the same as the network elements belong (%s?=%s?=%s)",