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"
16 int ROUTING_HOST_LEVEL; //Routing level
17 int SURF_CPU_LEVEL; //Surf cpu level
18 int SURF_WKS_LEVEL; //Surf workstation level
19 int SIMIX_HOST_LEVEL; //Simix level
20 int MSG_HOST_LEVEL; //Msg level
21 int SD_HOST_LEVEL; //Simdag level
22 int COORD_HOST_LEVEL=0; //Coordinates level
23 int NS3_HOST_LEVEL; //host node for ns3
26 int SD_LINK_LEVEL; //Simdag level
27 int SURF_LINK_LEVEL; //Surf level
28 int NS3_LINK_LEVEL; //link for ns3
30 xbt_lib_t as_router_lib;
31 int ROUTING_ASR_LEVEL; //Routing level
32 int COORD_ASR_LEVEL; //Coordinates level
33 int NS3_ASR_LEVEL; //host node for ns3
35 static xbt_dict_t random_value = NULL;
38 routing_global_t global_routing = NULL;
39 AS_t current_routing = NULL;
41 /* global parse functions */
42 xbt_dynar_t parsed_link_list = NULL; /* temporary store of current list link of a route */
43 static const char *src = NULL; /* temporary store the source name of a route */
44 static const char *dst = NULL; /* temporary store the destination name of a route */
45 static char *gw_src = NULL; /* temporary store the gateway source name of a route */
46 static char *gw_dst = NULL; /* temporary store the gateway destination name of a route */
48 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route, surf, "Routing part of surf");
50 static void routing_parse_peer(sg_platf_peer_cbarg_t peer); /* peer bypass */
51 static void routing_parse_Srandom(void); /* random bypass */
53 static void routing_parse_postparse(void);
55 /* this lines are only for replace use like index in the model table */
60 SURF_MODEL_DIJKSTRACACHE,
67 struct s_model_type routing_models[] = {
69 "Full routing data (fast, large memory requirements, fully expressive)",
70 model_full_create, model_full_end},
72 "Floyd routing data (slow initialization, fast lookup, lesser memory requirements, shortest path routing only)",
73 model_floyd_create, model_floyd_end},
75 "Dijkstra routing data (fast initialization, slow lookup, small memory requirements, shortest path routing only)",
76 model_dijkstra_create, model_dijkstra_both_end},
78 "Dijkstra routing data (fast initialization, fast lookup, small memory requirements, shortest path routing only)",
79 model_dijkstracache_create, model_dijkstra_both_end},
80 {"none", "No routing (usable with Constant network only)",
81 model_none_create, NULL},
82 {"RuleBased", "Rule-Based routing data (...)",
83 model_rulebased_create, NULL},
84 {"Vivaldi", "Vivaldi routing",
85 model_vivaldi_create, NULL},
86 {"Cluster", "Cluster routing",
87 model_cluster_create, NULL},
88 {NULL, NULL, NULL, NULL}
92 * \brief Add a "host" to the network element list
94 static void parse_S_host(sg_platf_host_cbarg_t host)
96 network_element_info_t info = NULL;
97 if (current_routing->hierarchy == SURF_ROUTING_NULL)
98 current_routing->hierarchy = SURF_ROUTING_BASE;
99 xbt_assert(!xbt_lib_get_or_null(host_lib, host->id, ROUTING_HOST_LEVEL),
100 "Reading a host, processing unit \"%s\" already exists", host->id);
102 current_routing->parse_PU(current_routing, host->id);
103 info = xbt_new0(s_network_element_info_t, 1);
104 info->rc_component = current_routing;
105 info->rc_type = SURF_NETWORK_ELEMENT_HOST;
106 xbt_lib_set(host_lib, host->id, ROUTING_HOST_LEVEL, (void *) info);
107 if (host->coord && strcmp(host->coord, "")) {
111 if (!COORD_HOST_LEVEL)
112 xbt_die ("To use host coordinates, please add --cfg=coordinates:yes to your command line");
114 /* Pre-parse the host coordinates -- FIXME factorize with routers by overloading the routing->parse_PU function*/
115 xbt_dynar_t ctn_str = xbt_str_split_str(host->coord, " ");
116 xbt_dynar_t ctn = xbt_dynar_new(sizeof(double),NULL);
117 xbt_dynar_foreach(ctn_str,cursor, str) {
118 double val = atof(str);
119 xbt_dynar_push(ctn,&val);
121 xbt_dynar_shrink(ctn, 0);
122 xbt_dynar_free(&ctn_str);
123 xbt_lib_set(host_lib, host->id, COORD_HOST_LEVEL, (void *) ctn);
128 * \brief Add a "router" to the network element list
130 static void parse_S_router(sg_platf_router_cbarg_t router)
132 network_element_info_t info = NULL;
133 if (current_routing->hierarchy == SURF_ROUTING_NULL)
134 current_routing->hierarchy = SURF_ROUTING_BASE;
135 xbt_assert(!xbt_lib_get_or_null(as_router_lib, router->id, ROUTING_ASR_LEVEL),
136 "Reading a router, processing unit \"%s\" already exists",
139 current_routing->parse_PU(current_routing, router->id);
140 info = xbt_new0(s_network_element_info_t, 1);
141 info->rc_component = current_routing;
142 info->rc_type = SURF_NETWORK_ELEMENT_ROUTER;
144 xbt_lib_set(as_router_lib, router->id, ROUTING_ASR_LEVEL, (void *) info);
145 if (strcmp(router->coord, "")) {
149 if (!COORD_ASR_LEVEL)
150 xbt_die ("To use host coordinates, please add --cfg=coordinates:yes to your command line");
152 /* Pre-parse the host coordinates */
153 xbt_dynar_t ctn_str = xbt_str_split_str(router->coord, " ");
154 xbt_dynar_t ctn = xbt_dynar_new(sizeof(double),NULL);
155 xbt_dynar_foreach(ctn_str,cursor, str) {
156 double val = atof(str);
157 xbt_dynar_push(ctn,&val);
159 xbt_dynar_shrink(ctn, 0);
160 xbt_dynar_free(&ctn_str);
161 xbt_lib_set(as_router_lib, router->id, COORD_ASR_LEVEL, (void *) ctn);
167 * \brief Set the end points for a route
169 static void routing_parse_S_route(void)
171 if (src != NULL && dst != NULL && parsed_link_list != NULL)
172 THROWF(arg_error, 0, "Route between %s to %s can not be defined",
173 A_surfxml_route_src, A_surfxml_route_dst);
174 src = A_surfxml_route_src;
175 dst = A_surfxml_route_dst;
176 xbt_assert(strlen(src) > 0 || strlen(dst) > 0,
177 "Some limits are null in the route between \"%s\" and \"%s\"",
179 parsed_link_list = xbt_dynar_new(sizeof(char *), &xbt_free_ref);
183 * \brief Set the end points and gateways for a ASroute
185 static void routing_parse_S_ASroute(void)
187 if (src != NULL && dst != NULL && parsed_link_list != NULL)
188 THROWF(arg_error, 0, "Route between %s to %s can not be defined",
189 A_surfxml_ASroute_src, A_surfxml_ASroute_dst);
190 src = A_surfxml_ASroute_src;
191 dst = A_surfxml_ASroute_dst;
192 gw_src = A_surfxml_ASroute_gw_src;
193 gw_dst = A_surfxml_ASroute_gw_dst;
194 xbt_assert(strlen(src) > 0 || strlen(dst) > 0 || strlen(gw_src) > 0
195 || strlen(gw_dst) > 0,
196 "Some limits are null in the route between \"%s\" and \"%s\"",
198 parsed_link_list = xbt_dynar_new(sizeof(char *), &xbt_free_ref);
202 * \brief Set the end points for a bypassRoute
204 static void routing_parse_S_bypassRoute(void)
206 if (src != NULL && dst != NULL && parsed_link_list != NULL)
208 "Bypass Route between %s to %s can not be defined",
209 A_surfxml_bypassRoute_src, A_surfxml_bypassRoute_dst);
210 src = A_surfxml_bypassRoute_src;
211 dst = A_surfxml_bypassRoute_dst;
212 gw_src = A_surfxml_bypassRoute_gw_src;
213 gw_dst = A_surfxml_bypassRoute_gw_dst;
214 xbt_assert(strlen(src) > 0 || strlen(dst) > 0 || strlen(gw_src) > 0
215 || strlen(gw_dst) > 0,
216 "Some limits are null in the route between \"%s\" and \"%s\"",
218 parsed_link_list = xbt_dynar_new(sizeof(char *), &xbt_free_ref);
222 * \brief Set a new link on the actual list of link for a route or ASroute from XML
225 static void routing_parse_link_ctn(void)
228 switch (A_surfxml_link_ctn_direction) {
229 case AU_surfxml_link_ctn_direction:
230 case A_surfxml_link_ctn_direction_NONE:
231 link_id = xbt_strdup(A_surfxml_link_ctn_id);
233 case A_surfxml_link_ctn_direction_UP:
234 link_id = bprintf("%s_UP", A_surfxml_link_ctn_id);
236 case A_surfxml_link_ctn_direction_DOWN:
237 link_id = bprintf("%s_DOWN", A_surfxml_link_ctn_id);
240 xbt_dynar_push(parsed_link_list, &link_id);
244 * \brief Store the route by calling the set_route function of the current routing component
246 static void routing_parse_E_route(void)
248 route_t route = xbt_new0(s_route_t, 1);
249 route->link_list = parsed_link_list;
250 xbt_assert(current_routing->parse_route,
251 "no defined method \"set_route\" in \"%s\"",
252 current_routing->name);
253 current_routing->parse_route(current_routing, src, dst, route);
254 parsed_link_list = NULL;
260 * \brief Store the ASroute by calling the set_ASroute function of the current routing component
262 static void routing_parse_E_ASroute(void)
264 route_t e_route = xbt_new0(s_route_t, 1);
265 e_route->link_list = parsed_link_list;
266 e_route->src_gateway = xbt_strdup(gw_src);
267 e_route->dst_gateway = xbt_strdup(gw_dst);
268 xbt_assert(current_routing->parse_ASroute,
269 "no defined method \"set_ASroute\" in \"%s\"",
270 current_routing->name);
271 current_routing->parse_ASroute(current_routing, src, dst, e_route);
272 parsed_link_list = NULL;
280 * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
282 static void routing_parse_E_bypassRoute(void)
284 route_t e_route = xbt_new0(s_route_t, 1);
285 e_route->link_list = parsed_link_list;
286 e_route->src_gateway = xbt_strdup(gw_src);
287 e_route->dst_gateway = xbt_strdup(gw_dst);
288 xbt_assert(current_routing->parse_bypassroute,
289 "Bypassing mechanism not implemented by routing '%s'",
290 current_routing->name);
291 current_routing->parse_bypassroute(current_routing, src, dst, e_route);
292 parsed_link_list = NULL;
300 * \brief Make a new routing component to the platform
302 * Add a new autonomous system to the platform. Any elements (such as host,
303 * router or sub-AS) added after this call and before the corresponding call
304 * to sg_platf_new_AS_close() will be added to this AS.
306 * Once this function was called, the configuration concerning the used
307 * models cannot be changed anymore.
309 * @param AS_id name of this autonomous system. Must be unique in the platform
310 * @param wanted_routing_type one of Full, Floyd, Dijkstra or similar. Full list in the variable routing_models, in src/surf/surf_routing.c
312 void routing_AS_begin(const char *AS_id, const char *wanted_routing_type)
315 routing_model_description_t model = NULL;
318 /* search the routing model */
319 for (cpt = 0; routing_models[cpt].name; cpt++)
320 if (!strcmp(wanted_routing_type, routing_models[cpt].name))
321 model = &routing_models[cpt];
322 /* if its not exist, error */
324 fprintf(stderr, "Routing model %s not found. Existing models:\n",
325 wanted_routing_type);
326 for (cpt = 0; routing_models[cpt].name; cpt++)
327 fprintf(stderr, " %s: %s\n", routing_models[cpt].name,
328 routing_models[cpt].desc);
332 /* make a new routing component */
333 new_as = (AS_t) model->create();
334 new_as->model_desc = model;
335 new_as->hierarchy = SURF_ROUTING_NULL;
336 new_as->name = xbt_strdup(AS_id);
338 if (current_routing == NULL && global_routing->root == NULL) {
340 /* it is the first one */
341 new_as->routing_father = NULL;
342 global_routing->root = new_as;
344 } else if (current_routing != NULL && global_routing->root != NULL) {
346 xbt_assert(!xbt_dict_get_or_null
347 (current_routing->routing_sons, AS_id),
348 "The AS \"%s\" already exists", AS_id);
349 /* it is a part of the tree */
350 new_as->routing_father = current_routing;
351 /* set the father behavior */
352 if (current_routing->hierarchy == SURF_ROUTING_NULL)
353 current_routing->hierarchy = SURF_ROUTING_RECURSIVE;
354 /* add to the sons dictionary */
355 xbt_dict_set(current_routing->routing_sons, AS_id,
356 (void *) new_as, NULL);
357 /* add to the father element list */
358 current_routing->parse_AS(current_routing, AS_id);
360 THROWF(arg_error, 0, "All defined components must be belong to a AS");
362 /* set the new current component of the tree */
363 current_routing = new_as;
367 * \brief Specify that the current description of AS is finished
369 * Once you've declared all the content of your AS, you have to close
370 * it with this call. Your AS is not usable until you call this function.
372 * @fixme: this call is not as robust as wanted: bad things WILL happen
373 * if you call it twice for the same AS, or if you forget calling it, or
374 * even if you add stuff to a closed AS
377 void routing_AS_end()
380 if (current_routing == NULL) {
381 THROWF(arg_error, 0, "Close an AS, but none was under construction");
383 network_element_info_t info = NULL;
384 xbt_assert(!xbt_lib_get_or_null
385 (as_router_lib, current_routing->name, ROUTING_ASR_LEVEL),
386 "The AS \"%s\" already exists", current_routing->name);
387 info = xbt_new0(s_network_element_info_t, 1);
388 info->rc_component = current_routing->routing_father;
389 info->rc_type = SURF_NETWORK_ELEMENT_AS;
390 xbt_lib_set(as_router_lib, current_routing->name, ROUTING_ASR_LEVEL,
393 if (current_routing->model_desc->end)
394 current_routing->model_desc->end(current_routing);
395 current_routing = current_routing->routing_father;
399 /* Aux Business methods */
402 * \brief Get the AS father and the first elements of the chain
404 * \param src the source host name
405 * \param dst the destination host name
407 * Get the common father of the to processing units, and the first different
408 * father in the chain
410 static void elements_father(const char *src, const char *dst,
415 xbt_assert(src && dst, "bad parameters for \"elements_father\" method");
416 #define ELEMENTS_FATHER_MAXDEPTH 16 /* increase if it is not enough */
418 AS_t path_src[ELEMENTS_FATHER_MAXDEPTH];
419 AS_t path_dst[ELEMENTS_FATHER_MAXDEPTH];
427 /* (1) find the as where the src and dst are located */
428 network_element_info_t src_data = xbt_lib_get_or_null(host_lib, src,
430 network_element_info_t dst_data = xbt_lib_get_or_null(host_lib, dst,
433 src_data = xbt_lib_get_or_null(as_router_lib, src, ROUTING_ASR_LEVEL);
435 dst_data = xbt_lib_get_or_null(as_router_lib, dst, ROUTING_ASR_LEVEL);
436 src_as = src_data->rc_component;
437 dst_as = dst_data->rc_component;
439 xbt_assert(src_as && dst_as,
440 "Ask for route \"from\"(%s) or \"to\"(%s) no found", src, dst);
442 /* (2) find the path to the root routing component */
443 for (current = src_as; current != NULL; current = current->routing_father) {
444 if (index_src >= ELEMENTS_FATHER_MAXDEPTH)
445 xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_src");
446 path_src[index_src++] = current;
448 for (current = dst_as; current != NULL; current = current->routing_father) {
449 if (index_dst >= ELEMENTS_FATHER_MAXDEPTH)
450 xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_dst");
451 path_dst[index_dst++] = current;
454 /* (3) find the common father */
456 current_src = path_src[--index_src];
457 current_dst = path_dst[--index_dst];
458 } while (index_src > 0 && index_dst > 0 && current_src == current_dst);
460 /* (4) they are not in the same routing component, make the path */
461 if (current_src == current_dst)
462 father = current_src;
464 father = path_src[index_src + 1];
466 /* (5) result generation */
467 *res_father = father; /* first the common father of src and dst */
468 *res_src = current_src; /* second the first different father of src */
469 *res_dst = current_dst; /* three the first different father of dst */
471 #undef ELEMENTS_FATHER_MAXDEPTH
474 /* Global Business methods */
477 * \brief Recursive function for get_route_latency
479 * \param src the source host name
480 * \param dst the destination host name
481 * \param *route the route where the links are stored. It is either NULL or a ready to use dynar
482 * \param *latency the latency, if needed
484 * This function is called by "get_route" and "get_latency". It allows to walk
485 * recursively through the ASes tree.
487 static void _get_route_and_latency(const char *src, const char *dst,
488 xbt_dynar_t * links, double *latency)
493 memset(&route,0,sizeof(route));
495 XBT_DEBUG("Solve route/latency \"%s\" to \"%s\"", src, dst);
496 xbt_assert(src && dst, "bad parameters for \"_get_route_latency\" method");
498 /* Find how src and dst are interconnected */
499 AS_t common_father, src_father, dst_father;
500 elements_father(src, dst, &common_father, &src_father, &dst_father);
502 /* If src and dst are in the same AS, life is good */
503 if (src_father == dst_father) { /* SURF_ROUTING_BASE */
505 route.link_list = xbt_dynar_new(global_routing->size_of_link, NULL);
507 common_father->get_route_and_latency(common_father, src, dst, &route,latency);
508 *links = route.link_list;
510 xbt_free(route.src_gateway);
511 xbt_free(route.dst_gateway);
515 /* If we are here, src and dst are not in the same AS; check whether a direct bypass is defined */
517 route_t e_route_bypass = NULL;
518 if (common_father->get_bypass_route)
519 e_route_bypass = common_father->get_bypass_route(common_father, src, dst);
521 if (e_route_bypass) { /* Common ancestor is kind enough to declare a bypass route from src to dst -- use it and bail out */
523 xbt_die("Bypass cannot work yet with get_latency"); // FIXME: that limitation seems supurious to me -- check with alvin
525 *links = xbt_dynar_new(global_routing->size_of_link, NULL);
527 xbt_dynar_foreach(e_route_bypass->link_list, cpt, link) {
528 xbt_dynar_push(*links, &link);
531 generic_free_route(e_route_bypass);
536 /* Not in the same AS, no bypass. We'll have to find our path between the ASes recursively*/
538 route_t e_route_cnt = xbt_new0(s_route_t, 1);
539 e_route_cnt->link_list = xbt_dynar_new(global_routing->size_of_link, NULL);
540 common_father->get_route_and_latency(common_father, src_father->name, dst_father->name, e_route_cnt,latency);
542 xbt_assert(e_route_cnt, "no route between \"%s\" and \"%s\"",
543 src_father->name, dst_father->name);
545 xbt_assert((e_route_cnt->src_gateway == NULL) ==
546 (e_route_cnt->dst_gateway == NULL),
547 "bad gateway for route between \"%s\" and \"%s\"", src, dst);
549 *links = xbt_dynar_new(global_routing->size_of_link, NULL);
551 /* If source gateway is not our source, we have to recursively find our way up to this point */
552 if (strcmp(src, e_route_cnt->src_gateway)) {
553 xbt_dynar_t route_src;
555 _get_route_and_latency(src, e_route_cnt->src_gateway,
556 (links ? &route_src : NULL),
559 xbt_dynar_foreach(route_src, cpt, link) {
560 xbt_dynar_push(*links, &link);
562 xbt_dynar_free(&route_src);
565 xbt_dynar_foreach(e_route_cnt->link_list, cpt, link) {
566 xbt_dynar_push(*links, &link);
569 /* If dest gateway is not our destination, we have to recursively find our way from this point */
570 if (strcmp(e_route_cnt->dst_gateway, dst)) {
571 xbt_dynar_t route_dst;
573 _get_route_and_latency(e_route_cnt->dst_gateway, dst,
574 (links ? &route_dst : NULL),
577 xbt_dynar_foreach(route_dst, cpt, link) {
578 xbt_dynar_push(*links, &link);
580 xbt_dynar_free(&route_dst);
584 generic_free_route(e_route_cnt);
588 * \brief Find a route between hosts
590 * \param src the source host name
591 * \param dst the destination host name
592 * \param route where to store the list of links.
593 * If *route=NULL, create a short lived dynar. Else, fill the provided dynar
594 * \param latency where to store the latency experienced on the path (or NULL if not interested)
595 * It is the caller responsability to initialize latency to 0 (we add to provided route)
598 * walk through the routing components tree and find a route between hosts
599 * by calling the differents "get_route" functions in each routing component.
601 void routing_get_route_and_latency(const char *src, const char *dst,
602 xbt_dynar_t * route, double *latency)
604 static xbt_dynar_t last_route = NULL;
606 int need_cleanup = !(*route);
609 xbt_dynar_free(&last_route);
610 last_route = *route = xbt_dynar_new(global_routing->size_of_link,NULL);
613 _get_route_and_latency(src, dst, route, latency);
615 xbt_assert(!latency || *latency >= 0.0,
616 "negative latency on route between \"%s\" and \"%s\"", src, dst);
619 static xbt_dynar_t recursive_get_onelink_routes(AS_t rc)
621 xbt_dynar_t ret = xbt_dynar_new(sizeof(onelink_t), xbt_free);
623 //adding my one link routes
626 xbt_dynar_t onelink_mine = rc->get_onelink_routes(rc);
628 xbt_dynar_foreach(onelink_mine, cpt, link) {
629 xbt_dynar_push(ret, &link);
634 xbt_dict_cursor_t cursor = NULL;
636 xbt_dict_foreach(rc->routing_sons, cursor, key, rc_child) {
637 xbt_dynar_t onelink_child = recursive_get_onelink_routes(rc_child);
639 xbt_dynar_foreach(onelink_child, cpt, link) {
640 xbt_dynar_push(ret, &link);
647 static xbt_dynar_t get_onelink_routes(void)
649 return recursive_get_onelink_routes(global_routing->root);
652 e_surf_network_element_type_t routing_get_network_element_type(const char *name)
654 network_element_info_t rc = NULL;
656 rc = xbt_lib_get_or_null(host_lib, name, ROUTING_HOST_LEVEL);
660 rc = xbt_lib_get_or_null(as_router_lib, name, ROUTING_ASR_LEVEL);
664 return SURF_NETWORK_ELEMENT_NULL;
668 * \brief Generic method: create the global routing schema
670 * Make a global routing structure and set all the parsing functions.
672 void routing_model_create(size_t size_of_links, void *loopback)
674 /* config the uniq global routing */
675 global_routing = xbt_new0(s_routing_global_t, 1);
676 global_routing->root = NULL;
677 global_routing->get_onelink_routes = get_onelink_routes;
678 global_routing->loopback = loopback;
679 global_routing->size_of_link = size_of_links;
680 /* no current routing at moment */
681 current_routing = NULL;
685 /* ************************************************** */
686 /* ********** PATERN FOR NEW ROUTING **************** */
688 /* The minimal configuration of a new routing model need the next functions,
689 * also you need to set at the start of the file, the new model in the model
690 * list. Remember keep the null ending of the list.
692 /*** Routing model structure ***/
694 // s_routing_component_t generic_routing;
695 // /* things that your routing model need */
696 // } s_routing_component_NEW_t,*routing_component_NEW_t;
698 /*** Parse routing model functions ***/
699 // static void model_NEW_set_processing_unit(routing_component_t rc, const char* name) {}
700 // static void model_NEW_set_autonomous_system(routing_component_t rc, const char* name) {}
701 // static void model_NEW_set_route(routing_component_t rc, const char* src, const char* dst, route_t route) {}
702 // static void model_NEW_set_ASroute(routing_component_t rc, const char* src, const char* dst, route_extended_t route) {}
703 // static void model_NEW_set_bypassroute(routing_component_t rc, const char* src, const char* dst, route_extended_t e_route) {}
705 /*** Business methods ***/
706 // static route_extended_t NEW_get_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
707 // static route_extended_t NEW_get_bypass_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
708 // static void NEW_finalize(routing_component_t rc) { xbt_free(rc);}
710 /*** Creation routing model functions ***/
711 // static void* model_NEW_create(void) {
712 // routing_component_NEW_t new_component = xbt_new0(s_routing_component_NEW_t,1);
713 // new_component->generic_routing.set_processing_unit = model_NEW_set_processing_unit;
714 // new_component->generic_routing.set_autonomous_system = model_NEW_set_autonomous_system;
715 // new_component->generic_routing.set_route = model_NEW_set_route;
716 // new_component->generic_routing.set_ASroute = model_NEW_set_ASroute;
717 // new_component->generic_routing.set_bypassroute = model_NEW_set_bypassroute;
718 // new_component->generic_routing.get_route = NEW_get_route;
719 // new_component->generic_routing.get_bypass_route = NEW_get_bypass_route;
720 // new_component->generic_routing.finalize = NEW_finalize;
721 // /* initialization of internal structures */
722 // return new_component;
724 // static void model_NEW_load(void) {} /* mandatory */
725 // static void model_NEW_unload(void) {} /* mandatory */
726 // static void model_NEW_end(void) {} /* mandatory */
728 /* ************************************************************************** */
729 /* ************************* GENERIC PARSE FUNCTIONS ************************ */
732 static void routing_parse_cluster(sg_platf_cluster_cbarg_t cluster)
734 char *host_id, *groups, *link_id = NULL;
735 xbt_dict_t patterns = NULL;
737 s_sg_platf_host_cbarg_t host;
738 s_sg_platf_link_cbarg_t link;
742 xbt_dynar_t radical_elements;
743 xbt_dynar_t radical_ends;
745 if (strcmp(cluster->availability_trace, "")
746 || strcmp(cluster->state_trace, "")) {
747 patterns = xbt_dict_new();
748 xbt_dict_set(patterns, "id", xbt_strdup(cluster->id), free);
749 xbt_dict_set(patterns, "prefix", xbt_strdup(cluster->prefix), free);
750 xbt_dict_set(patterns, "suffix", xbt_strdup(cluster->suffix), free);
754 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", cluster->id);
755 sg_platf_new_AS_begin(cluster->id, "Cluster");
758 radical_elements = xbt_str_split(cluster->radical, ",");
759 xbt_dynar_foreach(radical_elements, iter, groups) {
761 radical_ends = xbt_str_split(groups, "-");
762 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
764 switch (xbt_dynar_length(radical_ends)) {
769 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
772 surf_parse_error("Malformed radical");
775 for (i = start; i <= end; i++) {
777 bprintf("%s%d%s", cluster->prefix, i, cluster->suffix);
778 link_id = bprintf("%s_link_%d", cluster->id, i);
780 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\">", host_id, cluster->power);
782 memset(&host, 0, sizeof(host));
784 if (strcmp(cluster->availability_trace, "")) {
785 xbt_dict_set(patterns, "radical", bprintf("%d", i), xbt_free);
786 char *avail_file = xbt_str_varsubst(cluster->availability_trace, patterns);
787 XBT_DEBUG("\tavailability_file=\"%s\"", avail_file);
788 host.power_trace = tmgr_trace_new(avail_file);
789 xbt_free(avail_file);
791 XBT_DEBUG("\tavailability_file=\"\"");
794 if (strcmp(cluster->state_trace, "")) {
795 char *avail_file = xbt_str_varsubst(cluster->state_trace, patterns);
796 XBT_DEBUG("\tstate_file=\"%s\"", avail_file);
797 host.state_trace = tmgr_trace_new(avail_file);
798 xbt_free(avail_file);
800 XBT_DEBUG("\tstate_file=\"\"");
803 host.power_peak = cluster->power;
804 host.power_scale = 1.0;
805 host.core_amount = cluster->core_amount;
806 host.initial_state = SURF_RESOURCE_ON;
808 sg_platf_new_host(&host);
809 XBT_DEBUG("</host>");
811 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_id,
812 cluster->bw, cluster->lat);
814 memset(&link, 0, sizeof(link));
816 link.bandwidth = cluster->bw;
817 link.latency = cluster->lat;
818 link.state = SURF_RESOURCE_ON;
819 link.policy = cluster->sharing_policy;
820 sg_platf_new_link(&link);
822 surf_parsing_link_up_down_t info =
823 xbt_new0(s_surf_parsing_link_up_down_t, 1);
824 if (link.policy == SURF_LINK_FULLDUPLEX) {
825 char *tmp_link = bprintf("%s_UP", link_id);
827 xbt_lib_get_or_null(link_lib, tmp_link, SURF_LINK_LEVEL);
829 tmp_link = bprintf("%s_DOWN", link_id);
831 xbt_lib_get_or_null(link_lib, tmp_link, SURF_LINK_LEVEL);
834 info->link_up = xbt_lib_get_or_null(link_lib, link_id, SURF_LINK_LEVEL);
835 info->link_down = info->link_up;
837 surf_routing_cluster_add_link(host_id, info);
843 xbt_dynar_free(&radical_ends);
845 xbt_dynar_free(&radical_elements);
847 // Add a router. It is magically used thanks to the way in which surf_routing_cluster is written,
848 // and it's very useful to connect clusters together
850 XBT_DEBUG("<router id=\"%s\"/>", cluster->router_id);
852 s_sg_platf_router_cbarg_t router;
853 memset(&router, 0, sizeof(router));
854 router.id = cluster->router_id;
856 if (!router.id || !strcmp(router.id, ""))
858 bprintf("%s%s_router%s", cluster->prefix, cluster->id,
860 sg_platf_new_router(&router);
864 if ((cluster->bb_bw != 0) && (cluster->bb_lat != 0)) {
865 char *link_backbone = bprintf("%s_backbone", cluster->id);
866 XBT_DEBUG("<link\tid=\"%s\" bw=\"%f\" lat=\"%f\"/>", link_backbone,
867 cluster->bb_bw, cluster->bb_lat);
869 memset(&link, 0, sizeof(link));
870 link.id = link_backbone;
871 link.bandwidth = cluster->bb_bw;
872 link.latency = cluster->bb_lat;
873 link.state = SURF_RESOURCE_ON;
874 link.policy = cluster->bb_sharing_policy;
876 sg_platf_new_link(&link);
878 surf_routing_cluster_add_backbone(current_routing, xbt_lib_get_or_null(link_lib, link_backbone, SURF_LINK_LEVEL));
884 sg_platf_new_AS_end();
886 xbt_dict_free(&patterns); // no op if it were never set
889 static void routing_parse_postparse(void) {
890 xbt_dict_free(&random_value);
893 static void routing_parse_peer(sg_platf_peer_cbarg_t peer)
895 static int AX_ptr = 0;
896 char *host_id = NULL;
897 char *router_id, *link_router, *link_backbone, *link_id_up, *link_id_down;
899 static unsigned int surfxml_buffer_stack_stack_ptr = 1;
900 static unsigned int surfxml_buffer_stack_stack[1024];
902 surfxml_buffer_stack_stack[0] = 0;
904 surfxml_bufferstack_push(1);
906 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Full\">", peer->id);
907 sg_platf_new_AS_begin(peer->id, "Full");
910 host_id = HOST_PEER(peer->id);
911 router_id = ROUTER_PEER(peer->id);
912 link_id_up = LINK_UP_PEER(peer->id);
913 link_id_down = LINK_DOWN_PEER(peer->id);
915 link_router = bprintf("%s_link_router", peer->id);
916 link_backbone = bprintf("%s_backbone", peer->id);
918 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\"/>", host_id, peer->power);
919 s_sg_platf_host_cbarg_t host;
920 memset(&host, 0, sizeof(host));
921 host.initial_state = SURF_RESOURCE_ON;
923 host.power_peak = peer->power;
924 host.power_scale = 1.0;
925 host.power_trace = peer->availability_trace;
926 host.state_trace = peer->state_trace;
927 host.core_amount = 1;
928 host.coord = peer->coord;
929 sg_platf_new_host(&host);
932 XBT_DEBUG("<router id=\"%s\"\tcoordinates=\"%s\"/>", router_id, peer->coord);
933 s_sg_platf_router_cbarg_t router;
934 memset(&router, 0, sizeof(router));
935 router.id = router_id;
936 router.coord = peer->coord;
937 sg_platf_new_router(&router);
939 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_id_up,
940 peer->bw_in, peer->lat);
941 s_sg_platf_link_cbarg_t link;
942 memset(&link, 0, sizeof(link));
943 link.state = SURF_RESOURCE_ON;
944 link.policy = SURF_LINK_SHARED;
945 link.id = link_id_up;
946 link.bandwidth = peer->bw_in;
947 link.latency = peer->lat;
948 sg_platf_new_link(&link);
950 // FIXME: dealing with full duplex is not the role of this piece of code, I'd say [Mt]
951 // Instead, it should be created fullduplex, and the models will do what's needed in this case
952 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_id_down,
953 peer->bw_out, peer->lat);
954 link.id = link_id_down;
955 sg_platf_new_link(&link);
960 XBT_DEBUG("<route\tsrc=\"%s\"\tdst=\"%s\"", host_id, router_id);
961 XBT_DEBUG("symmetrical=\"NO\">");
962 SURFXML_BUFFER_SET(route_src, host_id);
963 SURFXML_BUFFER_SET(route_dst, router_id);
964 A_surfxml_route_symmetrical = A_surfxml_route_symmetrical_NO;
965 SURFXML_START_TAG(route);
967 XBT_DEBUG("<link_ctn\tid=\"%s\"/>", link_id_up);
968 SURFXML_BUFFER_SET(link_ctn_id, link_id_up);
969 A_surfxml_link_ctn_direction = A_surfxml_link_ctn_direction_NONE;
970 SURFXML_START_TAG(link_ctn);
971 SURFXML_END_TAG(link_ctn);
973 XBT_DEBUG("</route>");
974 SURFXML_END_TAG(route);
977 XBT_DEBUG("<route\tsrc=\"%s\"\tdst=\"%s\"", router_id, host_id);
978 XBT_DEBUG("symmetrical=\"NO\">");
979 SURFXML_BUFFER_SET(route_src, router_id);
980 SURFXML_BUFFER_SET(route_dst, host_id);
981 A_surfxml_route_symmetrical = A_surfxml_route_symmetrical_NO;
982 SURFXML_START_TAG(route);
984 XBT_DEBUG("<link_ctn\tid=\"%s\"/>", link_id_down);
985 SURFXML_BUFFER_SET(link_ctn_id, link_id_down);
986 A_surfxml_link_ctn_direction = A_surfxml_link_ctn_direction_NONE;
987 SURFXML_START_TAG(link_ctn);
988 SURFXML_END_TAG(link_ctn);
990 XBT_DEBUG("</route>");
991 SURFXML_END_TAG(route);
994 sg_platf_new_AS_end();
997 //xbt_dynar_free(&tab_elements_num);
1001 free(link_backbone);
1004 surfxml_bufferstack_pop(1);
1007 static void routing_parse_Srandom(void)
1009 double mean, std, min, max, seed;
1010 char *random_id = A_surfxml_random_id;
1011 char *random_radical = A_surfxml_random_radical;
1012 char *rd_name = NULL;
1014 mean = surf_parse_get_double(A_surfxml_random_mean);
1015 std = surf_parse_get_double(A_surfxml_random_std_deviation);
1016 min = surf_parse_get_double(A_surfxml_random_min);
1017 max = surf_parse_get_double(A_surfxml_random_max);
1018 seed = surf_parse_get_double(A_surfxml_random_seed);
1022 random_data_t random = xbt_new0(s_random_data_t, 1);
1025 xbt_dynar_t radical_elements;
1029 xbt_dynar_t radical_ends;
1031 random->generator = A_surfxml_random_generator;
1032 random->seed = seed;
1036 /* Check user stupidities */
1038 THROWF(arg_error, 0, "random->max < random->min (%f < %f)", max, min);
1040 THROWF(arg_error, 0, "random->mean < random->min (%f < %f)", mean, min);
1042 THROWF(arg_error, 0, "random->mean > random->max (%f > %f)", mean, max);
1044 /* normalize the mean and standard deviation before storing */
1045 random->mean = (mean - min) / (max - min);
1046 random->std = std / (max - min);
1048 if (random->mean * (1 - random->mean) < random->std * random->std)
1049 THROWF(arg_error, 0, "Invalid mean and standard deviation (%f and %f)",
1050 random->mean, random->std);
1053 ("id = '%s' min = '%f' max = '%f' mean = '%f' std_deviatinon = '%f' generator = '%d' seed = '%ld' radical = '%s'",
1054 random_id, random->min, random->max, random->mean, random->std,
1055 random->generator, random->seed, random_radical);
1058 random_value = xbt_dict_new();
1060 if (!strcmp(random_radical, "")) {
1061 res = random_generate(random);
1062 rd_value = bprintf("%f", res);
1063 xbt_dict_set(random_value, random_id, rd_value, free);
1065 radical_elements = xbt_str_split(random_radical, ",");
1066 xbt_dynar_foreach(radical_elements, iter, groups) {
1067 radical_ends = xbt_str_split(groups, "-");
1068 switch (xbt_dynar_length(radical_ends)) {
1070 xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1071 "Custom Random '%s' already exists !", random_id);
1072 res = random_generate(random);
1074 bprintf("%s%d", random_id,
1075 atoi(xbt_dynar_getfirst_as(radical_ends, char *)));
1076 xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), free);
1081 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
1082 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
1083 for (i = start; i <= end; i++) {
1084 xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1085 "Custom Random '%s' already exists !", bprintf("%s%d",
1088 res = random_generate(random);
1089 tmpbuf = bprintf("%s%d", random_id, i);
1090 xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), free);
1095 XBT_CRITICAL("Malformed radical");
1098 res = random_generate(random);
1099 rd_name = bprintf("%s_router", random_id);
1100 rd_value = bprintf("%f", res);
1101 xbt_dict_set(random_value, rd_name, rd_value, free);
1103 xbt_dynar_free(&radical_ends);
1106 xbt_dynar_free(&radical_elements);
1110 void routing_register_callbacks()
1112 sg_platf_host_add_cb(parse_S_host);
1113 sg_platf_router_add_cb(parse_S_router);
1115 surfxml_add_callback(STag_surfxml_random_cb_list, &routing_parse_Srandom);
1117 surfxml_add_callback(STag_surfxml_route_cb_list, &routing_parse_S_route);
1118 surfxml_add_callback(STag_surfxml_ASroute_cb_list, &routing_parse_S_ASroute);
1119 surfxml_add_callback(STag_surfxml_bypassRoute_cb_list,
1120 &routing_parse_S_bypassRoute);
1122 surfxml_add_callback(ETag_surfxml_link_ctn_cb_list, &routing_parse_link_ctn);
1124 surfxml_add_callback(ETag_surfxml_route_cb_list, &routing_parse_E_route);
1125 surfxml_add_callback(ETag_surfxml_ASroute_cb_list, &routing_parse_E_ASroute);
1126 surfxml_add_callback(ETag_surfxml_bypassRoute_cb_list,
1127 &routing_parse_E_bypassRoute);
1129 sg_platf_cluster_add_cb(routing_parse_cluster);
1131 sg_platf_peer_add_cb(routing_parse_peer);
1132 sg_platf_postparse_add_cb(routing_parse_postparse);
1135 instr_routing_define_callbacks();
1140 * \brief Recursive function for finalize
1142 * \param rc the source host name
1144 * This fuction is call by "finalize". It allow to finalize the
1145 * AS or routing components. It delete all the structures.
1147 static void finalize_rec(AS_t as) {
1148 xbt_dict_cursor_t cursor = NULL;
1152 xbt_dict_foreach(as->routing_sons, cursor, key, elem) {
1159 /** \brief Frees all memory allocated by the routing module */
1160 void routing_exit(void) {
1161 if (!global_routing)
1163 finalize_rec(global_routing->root);
1164 xbt_free(global_routing);