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 <pcre.h> /* regular expression library */
9 #include "simgrid/platf_interface.h" // platform creation API internal interface
11 #include "surf_routing_private.h"
12 #include "surf/surf_routing.h"
13 #include "surf/surfxml_parse_values.h"
15 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_routing_generic, surf_route, "Generic implementation of the surf routing");
17 static int no_bypassroute_declared = 1;
19 AS_t model_generic_create_sized(size_t childsize) {
20 AS_t new_component = model_none_create_sized(childsize);
22 new_component->parse_PU = generic_parse_PU;
23 new_component->parse_AS = generic_parse_AS;
24 new_component->parse_route = NULL;
25 new_component->parse_ASroute = NULL;
26 new_component->parse_bypassroute = generic_parse_bypassroute;
27 new_component->get_route_and_latency = NULL;
28 new_component->get_onelink_routes = NULL;
29 new_component->get_bypass_route =
30 generic_get_bypassroute;
31 new_component->finalize = model_generic_finalize;
32 new_component->bypassRoutes = xbt_dict_new_homogeneous((void (*)(void *)) generic_free_route);
36 void model_generic_finalize(AS_t as) {
37 xbt_dict_free(&as->bypassRoutes);
38 model_none_finalize(as);
41 int generic_parse_PU(AS_t as, network_element_t elm)
43 XBT_DEBUG("Load process unit \"%s\"", elm->name);
44 xbt_dynar_push_as(as->index_network_elm,network_element_t,elm);
45 return xbt_dynar_length(as->index_network_elm)-1;
48 int generic_parse_AS(AS_t as, network_element_t elm)
50 XBT_DEBUG("Load Autonomous system \"%s\"", elm->name);
51 xbt_dynar_push_as(as->index_network_elm,network_element_t,elm);
52 return xbt_dynar_length(as->index_network_elm)-1;
55 void generic_parse_bypassroute(AS_t rc,
56 const char *src, const char *dst,
59 XBT_DEBUG("Load bypassRoute from \"%s\" to \"%s\"", src, dst);
60 xbt_dict_t dict_bypassRoutes = rc->bypassRoutes;
63 route_name = bprintf("%s#%s", src, dst);
64 xbt_assert(!xbt_dynar_is_empty(e_route->link_list),
65 "Invalid count of links, must be greater than zero (%s,%s)",
67 xbt_assert(!xbt_dict_get_or_null(dict_bypassRoutes, route_name),
68 "The bypass route between \"%s\"(\"%s\") and \"%s\"(\"%s\") already exists",
69 src, e_route->src_gateway->name, dst, e_route->dst_gateway->name);
72 generic_new_extended_route(SURF_ROUTING_RECURSIVE, e_route, 0);
73 xbt_dynar_free(&(e_route->link_list));
76 xbt_dict_set(dict_bypassRoutes, route_name, new_e_route, NULL);
77 no_bypassroute_declared = 0;
81 /* ************************************************************************** */
82 /* *********************** GENERIC BUSINESS METHODS ************************* */
84 xbt_dynar_t generic_get_onelink_routes(AS_t rc) { // FIXME: kill that stub
85 xbt_die("\"generic_get_onelink_routes\" not implemented yet");
89 route_t generic_get_bypassroute(AS_t rc, network_element_t src, network_element_t dst)
91 // If never set a bypass route return NULL without any further computations
92 if(no_bypassroute_declared)
95 xbt_dict_t dict_bypassRoutes = rc->bypassRoutes;
97 int index_src, index_dst;
98 xbt_dynar_t path_src = NULL;
99 xbt_dynar_t path_dst = NULL;
101 AS_t *current_src = NULL;
102 AS_t *current_dst = NULL;
104 char* src_name = src->name;
105 char* dst_name = dst->name;
107 if (src == NULL || dst == NULL)
108 xbt_die("Ask for route \"from\"(%s) or \"to\"(%s) no found at AS \"%s\"",
109 src_name, dst_name, rc->name);
111 src_as = src->rc_component;
112 dst_as = dst->rc_component;
114 /* (2) find the path to the root routing component */
115 path_src = xbt_dynar_new(sizeof(AS_t), NULL);
117 while (current != NULL) {
118 xbt_dynar_push(path_src, ¤t);
119 current = current->routing_father;
121 path_dst = xbt_dynar_new(sizeof(AS_t), NULL);
123 while (current != NULL) {
124 xbt_dynar_push(path_dst, ¤t);
125 current = current->routing_father;
128 /* (3) find the common father */
129 index_src = path_src->used - 1;
130 index_dst = path_dst->used - 1;
131 current_src = xbt_dynar_get_ptr(path_src, index_src);
132 current_dst = xbt_dynar_get_ptr(path_dst, index_dst);
133 while (index_src >= 0 && index_dst >= 0 && *current_src == *current_dst) {
134 xbt_dynar_pop_ptr(path_src);
135 xbt_dynar_pop_ptr(path_dst);
138 current_src = xbt_dynar_get_ptr(path_src, index_src);
139 current_dst = xbt_dynar_get_ptr(path_dst, index_dst);
142 int max_index_src = path_src->used - 1;
143 int max_index_dst = path_dst->used - 1;
145 int max_index = max(max_index_src, max_index_dst);
148 route_t e_route_bypass = NULL;
150 for (max = 0; max <= max_index; max++) {
151 for (i = 0; i < max; i++) {
152 if (i <= max_index_src && max <= max_index_dst) {
153 char *route_name = bprintf("%s#%s",
155 (xbt_dynar_get_ptr(path_src, i)))->name,
157 (xbt_dynar_get_ptr(path_dst, max)))->name);
158 e_route_bypass = xbt_dict_get_or_null(dict_bypassRoutes, route_name);
159 xbt_free(route_name);
163 if (max <= max_index_src && i <= max_index_dst) {
164 char *route_name = bprintf("%s#%s",
166 (xbt_dynar_get_ptr(path_src, max)))->name,
168 (xbt_dynar_get_ptr(path_dst, i)))->name);
169 e_route_bypass = xbt_dict_get_or_null(dict_bypassRoutes, route_name);
170 xbt_free(route_name);
179 if (max <= max_index_src && max <= max_index_dst) {
180 char *route_name = bprintf("%s#%s",
182 (xbt_dynar_get_ptr(path_src, max)))->name,
184 (xbt_dynar_get_ptr(path_dst, max)))->name);
185 e_route_bypass = xbt_dict_get_or_null(dict_bypassRoutes, route_name);
186 xbt_free(route_name);
192 xbt_dynar_free(&path_src);
193 xbt_dynar_free(&path_dst);
195 route_t new_e_route = NULL;
197 if (e_route_bypass) {
199 unsigned int cpt = 0;
200 new_e_route = xbt_new0(s_route_t, 1);
201 new_e_route->src_gateway = e_route_bypass->src_gateway;
202 new_e_route->dst_gateway = e_route_bypass->dst_gateway;
203 new_e_route->link_list =
204 xbt_dynar_new(global_routing->size_of_link, NULL);
205 xbt_dynar_foreach(e_route_bypass->link_list, cpt, link) {
206 xbt_dynar_push(new_e_route->link_list, &link);
213 /* ************************************************************************** */
214 /* ************************* GENERIC AUX FUNCTIONS ************************** */
217 generic_new_route(e_surf_routing_hierarchy_t hierarchy, void *data, int order)
223 xbt_dynar_t links = NULL, links_id = NULL;
225 new_route = xbt_new0(s_route_t, 1);
226 new_route->link_list = xbt_dynar_new(global_routing->size_of_link, NULL);
228 xbt_assert(hierarchy == SURF_ROUTING_BASE,
229 "the hierarchy type is not SURF_ROUTING_BASE");
231 links = ((route_t) data)->link_list;
234 links_id = new_route->link_list;
236 xbt_dynar_foreach(links, cpt, link_name) {
238 void *link = xbt_lib_get_or_null(link_lib, link_name, SURF_LINK_LEVEL);
241 xbt_dynar_push(links_id, &link);
243 xbt_dynar_unshift(links_id, &link);
245 THROWF(mismatch_error, 0, "Link %s not found", link_name);
252 generic_new_extended_route(e_surf_routing_hierarchy_t hierarchy,
253 void *data, int order)
257 route_t e_route, new_e_route;
260 xbt_dynar_t links = NULL, links_id = NULL;
262 new_e_route = xbt_new0(s_route_t, 1);
263 new_e_route->link_list = xbt_dynar_new(global_routing->size_of_link, NULL);
265 xbt_assert(hierarchy == SURF_ROUTING_BASE
266 || hierarchy == SURF_ROUTING_RECURSIVE,
267 "the hierarchy type is not defined");
269 if (hierarchy == SURF_ROUTING_BASE) {
271 route = (route_t) data;
272 links = route->link_list;
274 } else if (hierarchy == SURF_ROUTING_RECURSIVE) {
276 e_route = (route_t) data;
277 xbt_assert(e_route->src_gateway
278 && e_route->dst_gateway, "bad gateway, is null");
279 links = e_route->link_list;
281 /* remeber not erase the gateway names */
282 new_e_route->src_gateway = e_route->src_gateway;
283 new_e_route->dst_gateway = e_route->dst_gateway;
286 links_id = new_e_route->link_list;
288 xbt_dynar_foreach(links, cpt, link_name) {
290 void *link = xbt_lib_get_or_null(link_lib, link_name, SURF_LINK_LEVEL);
293 xbt_dynar_push(links_id, &link);
295 xbt_dynar_unshift(links_id, &link);
297 THROWF(mismatch_error, 0, "Link %s not found", link_name);
303 void generic_free_route(route_t route)
306 xbt_dynar_free(&route->link_list);
311 static AS_t generic_as_exist(AS_t find_from,
314 //return to_find; // FIXME: BYPASSERROR OF FOREACH WITH BREAK
315 xbt_dict_cursor_t cursor = NULL;
319 xbt_dict_foreach(find_from->routing_sons, cursor, key, elem) {
320 if (to_find == elem || generic_as_exist(elem, to_find)) {
331 generic_autonomous_system_exist(AS_t rc, char *element)
333 //return rc; // FIXME: BYPASSERROR OF FOREACH WITH BREAK
334 AS_t element_as, result, elem;
335 xbt_dict_cursor_t cursor = NULL;
337 element_as = ((network_element_t)
338 xbt_lib_get_or_null(as_router_lib, element,
339 ROUTING_ASR_LEVEL))->rc_component;
340 result = ((AS_t) - 1);
341 if (element_as != rc)
342 result = generic_as_exist(rc, element_as);
346 xbt_dict_foreach(element_as->routing_sons, cursor, key, elem) {
347 found = !strcmp(elem->name, element);
358 generic_processing_units_exist(AS_t rc, char *element)
361 element_as = ((network_element_t)
362 xbt_lib_get_or_null(host_lib,
363 element, ROUTING_HOST_LEVEL))->rc_component;
364 if (element_as == rc)
366 return generic_as_exist(rc, element_as);
369 void generic_src_dst_check(AS_t rc, network_element_t src,
370 network_element_t dst)
373 network_element_t src_data = src;
374 network_element_t dst_data = dst;
376 if (src_data == NULL || dst_data == NULL)
377 xbt_die("Ask for route \"from\"(%s) or \"to\"(%s) no found at AS \"%s\"",
383 (src_data)->rc_component;
385 (dst_data)->rc_component;
387 if (src_as != dst_as)
388 xbt_die("The src(%s in %s) and dst(%s in %s) are in differents AS",
389 src->name, src_as->name,
390 dst->name, dst_as->name);
394 ("The routing component of src'%s' and dst'%s' is not the same as the network elements belong (%s?=%s?=%s)",