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"
13 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_routing_generic, surf_route, "Generic implementation of the surf routing");
15 static int no_bypassroute_declared = 1;
17 AS_t model_generic_create_sized(size_t childsize) {
18 AS_t new_component = model_none_create_sized(childsize);
20 new_component->parse_PU = generic_parse_PU;
21 new_component->parse_AS = generic_parse_AS;
22 new_component->parse_route = NULL;
23 new_component->parse_ASroute = NULL;
24 new_component->parse_bypassroute = generic_parse_bypassroute;
25 new_component->get_route_and_latency = NULL;
26 new_component->get_onelink_routes = NULL;
27 new_component->get_bypass_route =
28 generic_get_bypassroute;
29 new_component->finalize = model_generic_finalize;
30 new_component->bypassRoutes = xbt_dict_new_homogeneous((void (*)(void *)) generic_free_route);
34 void model_generic_finalize(AS_t as) {
35 xbt_dict_free(&as->bypassRoutes);
36 model_none_finalize(as);
39 int generic_parse_PU(AS_t as, sg_routing_edge_t elm)
41 XBT_DEBUG("Load process unit \"%s\"", elm->name);
42 xbt_dynar_push_as(as->index_network_elm,sg_routing_edge_t,elm);
43 return xbt_dynar_length(as->index_network_elm)-1;
46 int generic_parse_AS(AS_t as, sg_routing_edge_t elm)
48 XBT_DEBUG("Load Autonomous system \"%s\"", elm->name);
49 xbt_dynar_push_as(as->index_network_elm,sg_routing_edge_t,elm);
50 return xbt_dynar_length(as->index_network_elm)-1;
53 void generic_parse_bypassroute(AS_t rc, sg_platf_route_cbarg_t e_route)
55 char *src = (char*)(e_route->src);
56 char *dst = (char*)(e_route->dst);
59 XBT_DEBUG("Load bypassASroute from \"%s\" to \"%s\"", src, dst);
61 XBT_DEBUG("Load bypassRoute from \"%s\" to \"%s\"", src, dst);
62 xbt_dict_t dict_bypassRoutes = rc->bypassRoutes;
65 route_name = bprintf("%s#%s", src, dst);
66 xbt_assert(!xbt_dynar_is_empty(e_route->link_list),
67 "Invalid count of links, must be greater than zero (%s,%s)",
69 xbt_assert(!xbt_dict_get_or_null(dict_bypassRoutes, route_name),
70 "The bypass route between \"%s\"(\"%s\") and \"%s\"(\"%s\") already exists",
71 src, e_route->gw_src->name, dst, e_route->gw_dst->name);
73 sg_platf_route_cbarg_t new_e_route = NULL;
75 new_e_route = generic_new_extended_route(SURF_ROUTING_RECURSIVE, e_route, 1);
77 new_e_route = generic_new_extended_route(SURF_ROUTING_BASE, e_route, 1);
79 xbt_dynar_free(&(e_route->link_list));
81 xbt_dict_set(dict_bypassRoutes, route_name, new_e_route, NULL);
82 no_bypassroute_declared = 0;
86 /* ************************************************************************** */
87 /* *********************** GENERIC BUSINESS METHODS ************************* */
89 xbt_dynar_t generic_get_onelink_routes(AS_t rc) { // FIXME: kill that stub
90 xbt_die("\"generic_get_onelink_routes\" not implemented yet");
94 sg_platf_route_cbarg_t generic_get_bypassroute(AS_t rc, sg_routing_edge_t src, sg_routing_edge_t dst, double *lat)
96 // If never set a bypass route return NULL without any further computations
97 XBT_DEBUG("generic_get_bypassroute from %s to %s",src->name,dst->name);
98 if(no_bypassroute_declared)
101 sg_platf_route_cbarg_t e_route_bypass = NULL;
102 xbt_dict_t dict_bypassRoutes = rc->bypassRoutes;
104 if(dst->rc_component == rc && src->rc_component == rc ){
105 char *route_name = bprintf("%s#%s", src->name, dst->name);
106 e_route_bypass = xbt_dict_get_or_null(dict_bypassRoutes, route_name);
108 XBT_DEBUG("Find bypass route with %ld links",xbt_dynar_length(e_route_bypass->link_list));
113 int index_src, index_dst;
114 xbt_dynar_t path_src = NULL;
115 xbt_dynar_t path_dst = NULL;
117 AS_t *current_src = NULL;
118 AS_t *current_dst = NULL;
120 if (src == NULL || dst == NULL)
121 xbt_die("Ask for route \"from\"(%s) or \"to\"(%s) no found at AS \"%s\"",
122 src->name, dst->name, rc->name);
124 src_as = src->rc_component;
125 dst_as = dst->rc_component;
127 /* (2) find the path to the root routing component */
128 path_src = xbt_dynar_new(sizeof(AS_t), NULL);
130 while (current != NULL) {
131 xbt_dynar_push(path_src, ¤t);
132 current = current->routing_father;
134 path_dst = xbt_dynar_new(sizeof(AS_t), NULL);
136 while (current != NULL) {
137 xbt_dynar_push(path_dst, ¤t);
138 current = current->routing_father;
141 /* (3) find the common father */
142 index_src = path_src->used - 1;
143 index_dst = path_dst->used - 1;
144 current_src = xbt_dynar_get_ptr(path_src, index_src);
145 current_dst = xbt_dynar_get_ptr(path_dst, index_dst);
146 while (index_src >= 0 && index_dst >= 0 && *current_src == *current_dst) {
147 xbt_dynar_pop_ptr(path_src);
148 xbt_dynar_pop_ptr(path_dst);
151 current_src = xbt_dynar_get_ptr(path_src, index_src);
152 current_dst = xbt_dynar_get_ptr(path_dst, index_dst);
155 int max_index_src = path_src->used - 1;
156 int max_index_dst = path_dst->used - 1;
158 int max_index = max(max_index_src, max_index_dst);
161 for (max = 0; max <= max_index; max++) {
162 for (i = 0; i < max; i++) {
163 if (i <= max_index_src && max <= max_index_dst) {
164 char *route_name = bprintf("%s#%s",
166 (xbt_dynar_get_ptr(path_src, i)))->name,
168 (xbt_dynar_get_ptr(path_dst, max)))->name);
169 e_route_bypass = xbt_dict_get_or_null(dict_bypassRoutes, route_name);
170 xbt_free(route_name);
174 if (max <= max_index_src && i <= max_index_dst) {
175 char *route_name = bprintf("%s#%s",
177 (xbt_dynar_get_ptr(path_src, max)))->name,
179 (xbt_dynar_get_ptr(path_dst, i)))->name);
180 e_route_bypass = xbt_dict_get_or_null(dict_bypassRoutes, route_name);
181 xbt_free(route_name);
190 if (max <= max_index_src && max <= max_index_dst) {
191 char *route_name = bprintf("%s#%s",
193 (xbt_dynar_get_ptr(path_src, max)))->name,
195 (xbt_dynar_get_ptr(path_dst, max)))->name);
196 e_route_bypass = xbt_dict_get_or_null(dict_bypassRoutes, route_name);
197 xbt_free(route_name);
203 xbt_dynar_free(&path_src);
204 xbt_dynar_free(&path_dst);
207 sg_platf_route_cbarg_t new_e_route = NULL;
208 if (e_route_bypass) {
210 unsigned int cpt = 0;
211 new_e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
212 new_e_route->gw_src = e_route_bypass->gw_src;
213 new_e_route->gw_dst = e_route_bypass->gw_dst;
214 new_e_route->link_list =
215 xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
216 xbt_dynar_foreach(e_route_bypass->link_list, cpt, link) {
217 xbt_dynar_push(new_e_route->link_list, &link);
219 *lat += surf_network_model->extension.network.get_link_latency(link);
226 /* ************************************************************************** */
227 /* ************************* GENERIC AUX FUNCTIONS ************************** */
228 /* change a route containing link names into a route containing link entities */
229 sg_platf_route_cbarg_t
230 generic_new_extended_route(e_surf_routing_hierarchy_t hierarchy,
231 sg_platf_route_cbarg_t routearg, int change_order) {
233 sg_platf_route_cbarg_t result;
237 result = xbt_new0(s_sg_platf_route_cbarg_t, 1);
238 result->link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
240 xbt_assert(hierarchy == SURF_ROUTING_BASE
241 || hierarchy == SURF_ROUTING_RECURSIVE,
242 "The hierarchy of this AS is neither BASIC nor RECURSIVE, I'm lost here.");
244 if (hierarchy == SURF_ROUTING_RECURSIVE) {
246 xbt_assert(routearg->gw_src && routearg->gw_dst,
247 "NULL is obviously a bad gateway");
249 /* remeber not erase the gateway names */
250 result->gw_src = routearg->gw_src;
251 result->gw_dst = routearg->gw_dst;
254 xbt_dynar_foreach(routearg->link_list, cpt, link_name) {
256 void *link = xbt_lib_get_or_null(link_lib, link_name, SURF_LINK_LEVEL);
259 xbt_dynar_push(result->link_list, &link);
261 xbt_dynar_unshift(result->link_list, &link);
263 THROWF(mismatch_error, 0, "Link %s not found", link_name);
269 void generic_free_route(sg_platf_route_cbarg_t route)
272 xbt_dynar_free(&route->link_list);
277 static AS_t generic_as_exist(AS_t find_from,
280 //return to_find; // FIXME: BYPASSERROR OF FOREACH WITH BREAK
281 xbt_dict_cursor_t cursor = NULL;
285 xbt_dict_foreach(find_from->routing_sons, cursor, key, elem) {
286 if (to_find == elem || generic_as_exist(elem, to_find)) {
297 generic_autonomous_system_exist(AS_t rc, char *element)
299 //return rc; // FIXME: BYPASSERROR OF FOREACH WITH BREAK
300 AS_t element_as, result, elem;
301 xbt_dict_cursor_t cursor = NULL;
303 element_as = ((sg_routing_edge_t)
304 xbt_lib_get_or_null(as_router_lib, element,
305 ROUTING_ASR_LEVEL))->rc_component;
306 result = ((AS_t) - 1);
307 if (element_as != rc)
308 result = generic_as_exist(rc, element_as);
312 xbt_dict_foreach(element_as->routing_sons, cursor, key, elem) {
313 found = !strcmp(elem->name, element);
324 generic_processing_units_exist(AS_t rc, char *element)
327 element_as = ((sg_routing_edge_t)
328 xbt_lib_get_or_null(host_lib,
329 element, ROUTING_HOST_LEVEL))->rc_component;
330 if (element_as == rc)
332 return generic_as_exist(rc, element_as);
335 void generic_src_dst_check(AS_t rc, sg_routing_edge_t src,
336 sg_routing_edge_t dst)
339 sg_routing_edge_t src_data = src;
340 sg_routing_edge_t dst_data = dst;
342 if (src_data == NULL || dst_data == NULL)
343 xbt_die("Ask for route \"from\"(%s) or \"to\"(%s) no found at AS \"%s\"",
349 (src_data)->rc_component;
351 (dst_data)->rc_component;
353 if (src_as != dst_as)
354 xbt_die("The src(%s in %s) and dst(%s in %s) are in differents AS",
355 src->name, src_as->name,
356 dst->name, dst_as->name);
360 ("The routing component of src'%s' and dst'%s' is not the same as the network elements belong (%s?=%s?=%s)",