1 /* Copyright (c) 2009-2011, 2013-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. */
7 #include "surf_routing.hpp"
8 #include "surf_routing_private.hpp"
9 #include "surf_routing_cluster.hpp"
10 #include "surf_routing_cluster_torus.hpp"
11 #include "surf_routing_cluster_fat_tree.hpp"
13 #include "simgrid/platf_interface.h" // platform creation API internal interface
14 #include "simgrid/sg_config.h"
15 #include "storage_interface.hpp"
17 #include "surf/surfxml_parse_values.h"
21 * @ingroup SURF_build_api
22 * @brief A library containing all known hosts
26 int SURF_HOST_LEVEL; //Surf host level
27 int COORD_HOST_LEVEL=0; //Coordinates level
28 int NS3_HOST_LEVEL; //host node for ns3
30 int MSG_FILE_LEVEL; //Msg file level
32 int SIMIX_STORAGE_LEVEL; //Simix storage level
33 int MSG_STORAGE_LEVEL; //Msg storage level
34 int SD_STORAGE_LEVEL; //Simdag storage level
36 xbt_lib_t as_router_lib;
37 int ROUTING_ASR_LEVEL; //Routing level
38 int COORD_ASR_LEVEL; //Coordinates level
39 int NS3_ASR_LEVEL; //host node for ns3
40 int ROUTING_PROP_ASR_LEVEL; //Where the properties are stored
42 static xbt_dict_t random_value = NULL;
45 /** @brief Retrieve a routing edge from its name
47 * Routing edges are either host and routers, whatever
49 RoutingEdge *sg_routing_edge_by_name_or_null(const char *name) {
50 sg_host_t h = sg_host_by_name(name);
51 RoutingEdge *net_elm = h==NULL?NULL: sg_host_edge(h);
53 net_elm = (RoutingEdge*) xbt_lib_get_or_null(as_router_lib, name, ROUTING_ASR_LEVEL);
58 RoutingPlatf *routing_platf = NULL;
59 As *current_routing = NULL;
61 /* global parse functions */
62 extern xbt_dynar_t mount_list;
64 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route, surf, "Routing part of surf");
66 static void routing_parse_peer(sg_platf_peer_cbarg_t peer); /* peer bypass */
67 // static void routing_parse_Srandom(void); /* random bypass */
69 static void routing_parse_postparse(void);
71 /* this lines are only for replace use like index in the model table */
76 SURF_MODEL_DIJKSTRACACHE,
80 SURF_MODEL_TORUS_CLUSTER,
81 SURF_MODEL_FAT_TREE_CLUSTER,
84 struct s_model_type routing_models[] = {
86 "Full routing data (fast, large memory requirements, fully expressive)",
87 model_full_create, model_full_end},
89 "Floyd routing data (slow initialization, fast lookup, lesser memory requirements, shortest path routing only)",
90 model_floyd_create, model_floyd_end},
92 "Dijkstra routing data (fast initialization, slow lookup, small memory requirements, shortest path routing only)",
93 model_dijkstra_create, model_dijkstra_both_end},
95 "Dijkstra routing data (fast initialization, fast lookup, small memory requirements, shortest path routing only)",
96 model_dijkstracache_create, model_dijkstra_both_end},
97 {"none", "No routing (Unless you know what you are doing, avoid using this mode in combination with a non Constant network model).",
98 model_none_create, NULL},
99 {"Vivaldi", "Vivaldi routing",
100 model_vivaldi_create, NULL},
101 {"Cluster", "Cluster routing",
102 model_cluster_create, NULL},
103 {"Torus_Cluster", "Torus Cluster routing",
104 model_torus_cluster_create, NULL},
105 {"Fat_Tree_Cluster", "Fat Tree Cluster routing",
106 model_fat_tree_cluster_create, NULL},
107 {NULL, NULL, NULL, NULL}
111 * \brief Add a "host_link" to the network element list
113 static void parse_S_host(sg_platf_host_link_cbarg_t host)
115 RoutingEdge *info = sg_host_edge(sg_host_by_name(host->id));
116 xbt_assert(info, "Host '%s' not found!", host->id);
117 xbt_assert(current_routing->p_modelDesc == &routing_models[SURF_MODEL_CLUSTER] ||
118 current_routing->p_modelDesc == &routing_models[SURF_MODEL_VIVALDI],
119 "You have to be in model Cluster to use tag host_link!");
121 s_surf_parsing_link_up_down_t link_up_down;
122 link_up_down.link_up = Link::byName(host->link_up);
123 link_up_down.link_down = Link::byName(host->link_down);
125 xbt_assert(link_up_down.link_up, "Link '%s' not found!",host->link_up);
126 xbt_assert(link_up_down.link_down, "Link '%s' not found!",host->link_down);
128 if(!current_routing->p_linkUpDownList)
129 current_routing->p_linkUpDownList = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
131 // If dynar is is greater than edge id and if the host_link is already defined
132 if((int)xbt_dynar_length(current_routing->p_linkUpDownList) > info->getId() &&
133 xbt_dynar_get_as(current_routing->p_linkUpDownList, info->getId(), void*))
134 surf_parse_error("Host_link for '%s' is already defined!",host->id);
136 XBT_DEBUG("Push Host_link for host '%s' to position %d", info->getName(), info->getId());
137 xbt_dynar_set_as(current_routing->p_linkUpDownList, info->getId(), s_surf_parsing_link_up_down_t, link_up_down);
141 * \brief Add a "host" to the network element list
143 void routing_parse_init(sg_platf_host_cbarg_t host)
145 if (! current_routing)
148 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
149 current_routing->p_hierarchy = SURF_ROUTING_BASE;
150 xbt_assert(!sg_host_by_name(host->id),
151 "Reading a host, processing unit \"%s\" already exists", host->id);
153 RoutingEdge *info = new RoutingEdgeImpl(xbt_strdup(host->id),
155 SURF_NETWORK_ELEMENT_HOST,
157 info->setId(current_routing->parsePU(info));
158 sg_host_edge_set(sg_host_by_name_or_create(host->id), info);
159 XBT_DEBUG("Having set name '%s' id '%d'", host->id, info->getId());
162 xbt_lib_set(storage_lib, host->id, ROUTING_STORAGE_HOST_LEVEL, (void *) mount_list);
166 if (host->coord && strcmp(host->coord, "")) {
170 if (!COORD_HOST_LEVEL)
171 xbt_die ("To use host coordinates, please add --cfg=network/coordinates:yes to your command line");
172 /* Pre-parse the host coordinates -- FIXME factorize with routers by overloading the routing->parse_PU function*/
173 xbt_dynar_t ctn_str = xbt_str_split_str(host->coord, " ");
174 xbt_dynar_t ctn = xbt_dynar_new(sizeof(double),NULL);
175 xbt_dynar_foreach(ctn_str,cursor, str) {
176 double val = atof(str);
177 xbt_dynar_push(ctn,&val);
179 xbt_dynar_shrink(ctn, 0);
180 xbt_dynar_free(&ctn_str);
181 xbt_lib_set(host_lib, host->id, COORD_HOST_LEVEL, (void *) ctn);
182 XBT_DEBUG("Having set host coordinates for '%s'",host->id);
187 * \brief Add a "router" to the network element list
189 static void parse_S_router(sg_platf_router_cbarg_t router)
191 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
192 current_routing->p_hierarchy = SURF_ROUTING_BASE;
193 xbt_assert(!xbt_lib_get_or_null(as_router_lib, router->id, ROUTING_ASR_LEVEL),
194 "Reading a router, processing unit \"%s\" already exists",
197 RoutingEdge *info = new RoutingEdgeImpl(xbt_strdup(router->id),
199 SURF_NETWORK_ELEMENT_ROUTER,
201 info->setId(current_routing->parsePU(info));
202 xbt_lib_set(as_router_lib, router->id, ROUTING_ASR_LEVEL, (void *) info);
203 XBT_DEBUG("Having set name '%s' id '%d'", router->id, info->getId());
205 if (router->coord && strcmp(router->coord, "")) {
209 if (!COORD_ASR_LEVEL)
210 xbt_die ("To use host coordinates, please add --cfg=network/coordinates:yes to your command line");
211 /* Pre-parse the host coordinates */
212 xbt_dynar_t ctn_str = xbt_str_split_str(router->coord, " ");
213 xbt_dynar_t ctn = xbt_dynar_new(sizeof(double),NULL);
214 xbt_dynar_foreach(ctn_str,cursor, str) {
215 double val = atof(str);
216 xbt_dynar_push(ctn,&val);
218 xbt_dynar_shrink(ctn, 0);
219 xbt_dynar_free(&ctn_str);
220 xbt_lib_set(as_router_lib, router->id, COORD_ASR_LEVEL, (void *) ctn);
221 XBT_DEBUG("Having set router coordinates for '%s'",router->id);
226 * \brief Store the route by calling the set_route function of the current routing component
228 static void parse_E_route(sg_platf_route_cbarg_t route)
230 /*FIXME:REMOVE:xbt_assert(current_routing->parse_route,
231 "no defined method \"set_route\" in \"%s\"",
232 current_routing->name);*/
234 current_routing->parseRoute(route);
238 * \brief Store the ASroute by calling the set_ASroute function of the current routing component
240 static void parse_E_ASroute(sg_platf_route_cbarg_t ASroute)
242 /*FIXME:REMOVE:xbt_assert(current_routing->parse_ASroute,
243 "no defined method \"set_ASroute\" in \"%s\"",
244 current_routing->name);*/
245 current_routing->parseASroute(ASroute);
249 * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
251 static void parse_E_bypassRoute(sg_platf_route_cbarg_t route)
253 /*FIXME:REMOVE:xbt_assert(current_routing->parse_bypassroute,
254 "Bypassing mechanism not implemented by routing '%s'",
255 current_routing->name);*/
257 current_routing->parseBypassroute(route);
261 * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
263 static void parse_E_bypassASroute(sg_platf_route_cbarg_t ASroute)
265 /*FIXME:REMOVE:xbt_assert(current_routing->parse_bypassroute,
266 "Bypassing mechanism not implemented by routing '%s'",
267 current_routing->name);*/
268 current_routing->parseBypassroute(ASroute);
271 static void routing_parse_trace(sg_platf_trace_cbarg_t trace)
273 tmgr_trace_t tmgr_trace;
274 if (!trace->file || strcmp(trace->file, "") != 0) {
275 tmgr_trace = tmgr_trace_new_from_file(trace->file);
276 } else if (strcmp(trace->pc_data, "") == 0) {
280 tmgr_trace_new_from_string(trace->id, trace->pc_data,
283 xbt_dict_set(traces_set_list, trace->id, (void *) tmgr_trace, NULL);
286 static void routing_parse_trace_connect(sg_platf_trace_connect_cbarg_t trace_connect)
288 xbt_assert(xbt_dict_get_or_null
289 (traces_set_list, trace_connect->trace),
290 "Cannot connect trace %s to %s: trace unknown",
291 trace_connect->trace,
292 trace_connect->element);
294 switch (trace_connect->kind) {
295 case SURF_TRACE_CONNECT_KIND_HOST_AVAIL:
296 xbt_dict_set(trace_connect_list_host_avail,
297 trace_connect->trace,
298 xbt_strdup(trace_connect->element), NULL);
300 case SURF_TRACE_CONNECT_KIND_POWER:
301 xbt_dict_set(trace_connect_list_power, trace_connect->trace,
302 xbt_strdup(trace_connect->element), NULL);
304 case SURF_TRACE_CONNECT_KIND_LINK_AVAIL:
305 xbt_dict_set(trace_connect_list_link_avail,
306 trace_connect->trace,
307 xbt_strdup(trace_connect->element), NULL);
309 case SURF_TRACE_CONNECT_KIND_BANDWIDTH:
310 xbt_dict_set(trace_connect_list_bandwidth,
311 trace_connect->trace,
312 xbt_strdup(trace_connect->element), NULL);
314 case SURF_TRACE_CONNECT_KIND_LATENCY:
315 xbt_dict_set(trace_connect_list_latency, trace_connect->trace,
316 xbt_strdup(trace_connect->element), NULL);
319 surf_parse_error("Cannot connect trace %s to %s: kind of trace unknown",
320 trace_connect->trace, trace_connect->element);
326 * \brief Make a new routing component to the platform
328 * Add a new autonomous system to the platform. Any elements (such as host,
329 * router or sub-AS) added after this call and before the corresponding call
330 * to sg_platf_new_AS_close() will be added to this AS.
332 * Once this function was called, the configuration concerning the used
333 * models cannot be changed anymore.
335 * @param AS_id name of this autonomous system. Must be unique in the platform
336 * @param wanted_routing_type one of Full, Floyd, Dijkstra or similar. Full list in the variable routing_models, in src/surf/surf_routing.c
338 void routing_AS_begin(sg_platf_AS_cbarg_t AS)
340 XBT_DEBUG("routing_AS_begin");
341 routing_model_description_t model = NULL;
343 xbt_assert(!xbt_lib_get_or_null
344 (as_router_lib, AS->id, ROUTING_ASR_LEVEL),
345 "The AS \"%s\" already exists", AS->id);
347 _sg_cfg_init_status = 2; /* horrible hack: direct access to the global
348 * controlling the level of configuration to prevent
349 * any further config */
351 /* search the routing model */
353 case A_surfxml_AS_routing_Cluster: model = &routing_models[SURF_MODEL_CLUSTER];break;
354 case A_surfxml_AS_routing_Cluster___torus: model = &routing_models[SURF_MODEL_TORUS_CLUSTER];break;
355 case A_surfxml_AS_routing_Cluster___fat___tree: model = &routing_models[SURF_MODEL_FAT_TREE_CLUSTER];break;
356 case A_surfxml_AS_routing_Dijkstra: model = &routing_models[SURF_MODEL_DIJKSTRA];break;
357 case A_surfxml_AS_routing_DijkstraCache: model = &routing_models[SURF_MODEL_DIJKSTRACACHE];break;
358 case A_surfxml_AS_routing_Floyd: model = &routing_models[SURF_MODEL_FLOYD];break;
359 case A_surfxml_AS_routing_Full: model = &routing_models[SURF_MODEL_FULL];break;
360 case A_surfxml_AS_routing_None: model = &routing_models[SURF_MODEL_NONE];break;
361 case A_surfxml_AS_routing_Vivaldi: model = &routing_models[SURF_MODEL_VIVALDI];break;
362 default: xbt_die("Not a valid model!!!");
366 /* make a new routing component */
367 As *new_as = model->create();
369 new_as->p_modelDesc = model;
370 new_as->p_hierarchy = SURF_ROUTING_NULL;
371 new_as->p_name = xbt_strdup(AS->id);
373 RoutingEdge *info = new RoutingEdgeImpl(xbt_strdup(new_as->p_name),
375 SURF_NETWORK_ELEMENT_AS,
377 if (current_routing == NULL && routing_platf->p_root == NULL) {
379 /* it is the first one */
380 new_as->p_routingFather = NULL;
381 routing_platf->p_root = new_as;
383 } else if (current_routing != NULL && routing_platf->p_root != NULL) {
385 xbt_assert(!xbt_dict_get_or_null
386 (current_routing->p_routingSons, AS->id),
387 "The AS \"%s\" already exists", AS->id);
388 /* it is a part of the tree */
389 new_as->p_routingFather = current_routing;
390 /* set the father behavior */
391 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
392 current_routing->p_hierarchy = SURF_ROUTING_RECURSIVE;
393 /* add to the sons dictionary */
394 xbt_dict_set(current_routing->p_routingSons, AS->id,
395 (void *) new_as, NULL);
396 /* add to the father element list */
397 info->setId(current_routing->parseAS(info));
399 THROWF(arg_error, 0, "All defined components must belong to a AS");
402 xbt_lib_set(as_router_lib, info->getName(), ROUTING_ASR_LEVEL,
404 XBT_DEBUG("Having set name '%s' id '%d'", new_as->p_name, info->getId());
406 /* set the new current component of the tree */
407 current_routing = new_as;
408 current_routing->p_netElem = info;
413 * \brief Specify that the current description of AS is finished
415 * Once you've declared all the content of your AS, you have to close
416 * it with this call. Your AS is not usable until you call this function.
418 * @fixme: this call is not as robust as wanted: bad things WILL happen
419 * if you call it twice for the same AS, or if you forget calling it, or
420 * even if you add stuff to a closed AS
423 void routing_AS_end(sg_platf_AS_cbarg_t /*AS*/)
426 if (current_routing == NULL) {
427 THROWF(arg_error, 0, "Close an AS, but none was under construction");
429 if (current_routing->p_modelDesc->end)
430 current_routing->p_modelDesc->end(current_routing);
431 current_routing = current_routing->p_routingFather;
435 /* Aux Business methods */
438 * \brief Get the AS father and the first elements of the chain
440 * \param src the source host name
441 * \param dst the destination host name
443 * Get the common father of the to processing units, and the first different
444 * father in the chain
446 static void elements_father(sg_routing_edge_t src, sg_routing_edge_t dst,
451 xbt_assert(src && dst, "bad parameters for \"elements_father\" method");
452 #define ELEMENTS_FATHER_MAXDEPTH 16 /* increase if it is not enough */
454 As *path_src[ELEMENTS_FATHER_MAXDEPTH];
455 As *path_dst[ELEMENTS_FATHER_MAXDEPTH];
463 /* (1) find the as where the src and dst are located */
464 sg_routing_edge_t src_data = src;
465 sg_routing_edge_t dst_data = dst;
466 src_as = src_data->getRcComponent();
467 dst_as = dst_data->getRcComponent();
469 char* src_name = src_data->getName();
470 char* dst_name = dst_data->getName();
473 xbt_assert(src_as && dst_as,
474 "Ask for route \"from\"(%s) or \"to\"(%s) no found", src_name, dst_name);
476 /* (2) find the path to the root routing component */
477 for (current = src_as; current != NULL; current = current->p_routingFather) {
478 if (index_src >= ELEMENTS_FATHER_MAXDEPTH)
479 xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_src");
480 path_src[index_src++] = current;
482 for (current = dst_as; current != NULL; current = current->p_routingFather) {
483 if (index_dst >= ELEMENTS_FATHER_MAXDEPTH)
484 xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_dst");
485 path_dst[index_dst++] = current;
488 /* (3) find the common father */
490 current_src = path_src[--index_src];
491 current_dst = path_dst[--index_dst];
492 } while (index_src > 0 && index_dst > 0 && current_src == current_dst);
494 /* (4) they are not in the same routing component, make the path */
495 if (current_src == current_dst)
496 father = current_src;
498 father = path_src[index_src + 1];
500 /* (5) result generation */
501 *res_father = father; /* first the common father of src and dst */
502 *res_src = current_src; /* second the first different father of src */
503 *res_dst = current_dst; /* three the first different father of dst */
505 #undef ELEMENTS_FATHER_MAXDEPTH
508 /* Global Business methods */
511 * \brief Recursive function for get_route_latency
513 * \param src the source host name
514 * \param dst the destination host name
515 * \param *route the route where the links are stored. It is either NULL or a ready to use dynar
516 * \param *latency the latency, if needed
518 * This function is called by "get_route" and "get_latency". It allows to walk
519 * recursively through the ASes tree.
521 static void _get_route_and_latency(RoutingEdge *src, RoutingEdge *dst,
522 xbt_dynar_t * links, double *latency)
524 s_sg_platf_route_cbarg_t route = SG_PLATF_ROUTE_INITIALIZER;
525 memset(&route,0,sizeof(route));
527 xbt_assert(src && dst, "bad parameters for \"_get_route_latency\" method");
528 XBT_DEBUG("Solve route/latency \"%s\" to \"%s\"", src->getName(), dst->getName());
530 /* Find how src and dst are interconnected */
531 As *common_father, *src_father, *dst_father;
532 elements_father(src, dst, &common_father, &src_father, &dst_father);
533 XBT_DEBUG("elements_father: common father '%s' src_father '%s' dst_father '%s'",
534 common_father->p_name, src_father->p_name, dst_father->p_name);
536 /* Check whether a direct bypass is defined */
537 sg_platf_route_cbarg_t e_route_bypass = NULL;
538 //FIXME:REMOVE:if (common_father->get_bypass_route)
540 e_route_bypass = common_father->getBypassRoute(src, dst, latency);
542 /* Common ancestor is kind enough to declare a bypass route from src to dst -- use it and bail out */
543 if (e_route_bypass) {
544 xbt_dynar_merge(links, &e_route_bypass->link_list);
545 generic_free_route(e_route_bypass);
549 /* If src and dst are in the same AS, life is good */
550 if (src_father == dst_father) { /* SURF_ROUTING_BASE */
551 route.link_list = *links;
552 common_father->getRouteAndLatency(src, dst, &route, latency);
553 // if vivaldi latency+=vivaldi(src,dst)
557 /* Not in the same AS, no bypass. We'll have to find our path between the ASes recursively*/
559 route.link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
560 // Find the net_card corresponding to father
561 RoutingEdge *src_father_net_elm = src_father->p_netElem;
562 RoutingEdge *dst_father_net_elm = dst_father->p_netElem;
564 common_father->getRouteAndLatency(src_father_net_elm, dst_father_net_elm,
567 xbt_assert((route.gw_src != NULL) && (route.gw_dst != NULL),
568 "bad gateways for route from \"%s\" to \"%s\"", src->getName(), dst->getName());
570 sg_routing_edge_t src_gateway_net_elm = route.gw_src;
571 sg_routing_edge_t dst_gateway_net_elm = route.gw_dst;
573 /* If source gateway is not our source, we have to recursively find our way up to this point */
574 if (src != src_gateway_net_elm)
575 _get_route_and_latency(src, src_gateway_net_elm, links, latency);
576 xbt_dynar_merge(links, &route.link_list);
578 /* If dest gateway is not our destination, we have to recursively find our way from this point */
579 if (dst_gateway_net_elm != dst)
580 _get_route_and_latency(dst_gateway_net_elm, dst, links, latency);
582 // if vivaldi latency+=vivaldi(src_gateway,dst_gateway)
585 AS_t surf_platf_get_root(routing_platf_t platf){
586 return platf->p_root;
589 e_surf_network_element_type_t surf_routing_edge_get_rc_type(sg_routing_edge_t edge){
590 return edge->getRcType();
595 * \brief Find a route between hosts
597 * \param src the network_element_t for src host
598 * \param dst the network_element_t for dst host
599 * \param route where to store the list of links.
600 * If *route=NULL, create a short lived dynar. Else, fill the provided dynar
601 * \param latency where to store the latency experienced on the path (or NULL if not interested)
602 * It is the caller responsability to initialize latency to 0 (we add to provided route)
605 * walk through the routing components tree and find a route between hosts
606 * by calling the differents "get_route" functions in each routing component.
608 void RoutingPlatf::getRouteAndLatency(RoutingEdge *src, RoutingEdge *dst,
609 xbt_dynar_t* route, double *latency)
611 XBT_DEBUG("routing_get_route_and_latency from %s to %s", src->getName(), dst->getName());
613 xbt_dynar_reset(routing_platf->p_lastRoute);
614 *route = routing_platf->p_lastRoute;
617 _get_route_and_latency(src, dst, route, latency);
619 xbt_assert(!latency || *latency >= 0.0,
620 "negative latency on route between \"%s\" and \"%s\"", src->getName(), dst->getName());
623 xbt_dynar_t RoutingPlatf::getOneLinkRoutes(){
624 return recursiveGetOneLinkRoutes(p_root);
627 xbt_dynar_t RoutingPlatf::recursiveGetOneLinkRoutes(As *rc)
629 xbt_dynar_t ret = xbt_dynar_new(sizeof(Onelink*), xbt_free_f);
631 //adding my one link routes
632 xbt_dynar_t onelink_mine = rc->getOneLinkRoutes();
634 xbt_dynar_merge(&ret,&onelink_mine);
638 xbt_dict_cursor_t cursor = NULL;
640 xbt_dict_foreach(rc->p_routingSons, cursor, key, rc_child) {
641 xbt_dynar_t onelink_child = recursiveGetOneLinkRoutes(rc_child);
643 xbt_dynar_merge(&ret,&onelink_child);
648 e_surf_network_element_type_t routing_get_network_element_type(const char *name)
650 RoutingEdge *rc = sg_routing_edge_by_name_or_null(name);
652 return rc->getRcType();
654 return SURF_NETWORK_ELEMENT_NULL;
658 * \brief Generic method: create the global routing schema
660 * Make a global routing structure and set all the parsing functions.
662 void routing_model_create( void *loopback)
664 /* config the uniq global routing */
665 routing_platf = new RoutingPlatf();
666 routing_platf->p_root = NULL;
667 routing_platf->p_loopback = loopback;
668 routing_platf->p_lastRoute = xbt_dynar_new(sizeof(sg_routing_link_t),NULL);
669 /* no current routing at moment */
670 current_routing = NULL;
674 /* ************************************************** */
675 /* ********** PATERN FOR NEW ROUTING **************** */
677 /* The minimal configuration of a new routing model need the next functions,
678 * also you need to set at the start of the file, the new model in the model
679 * list. Remember keep the null ending of the list.
681 /*** Routing model structure ***/
683 // s_routing_component_t generic_routing;
684 // /* things that your routing model need */
685 // } s_routing_component_NEW_t,*routing_component_NEW_t;
687 /*** Parse routing model functions ***/
688 // static void model_NEW_set_processing_unit(routing_component_t rc, const char* name) {}
689 // static void model_NEW_set_autonomous_system(routing_component_t rc, const char* name) {}
690 // static void model_NEW_set_route(routing_component_t rc, const char* src, const char* dst, route_t route) {}
691 // static void model_NEW_set_ASroute(routing_component_t rc, const char* src, const char* dst, route_extended_t route) {}
692 // static void model_NEW_set_bypassroute(routing_component_t rc, const char* src, const char* dst, route_extended_t e_route) {}
694 /*** Business methods ***/
695 // static route_extended_t NEW_get_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
696 // static route_extended_t NEW_get_bypass_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
697 // static void NEW_finalize(routing_component_t rc) { xbt_free(rc);}
699 /*** Creation routing model functions ***/
700 // static void* model_NEW_create(void) {
701 // routing_component_NEW_t new_component = xbt_new0(s_routing_component_NEW_t,1);
702 // new_component->generic_routing.set_processing_unit = model_NEW_set_processing_unit;
703 // new_component->generic_routing.set_autonomous_system = model_NEW_set_autonomous_system;
704 // new_component->generic_routing.set_route = model_NEW_set_route;
705 // new_component->generic_routing.set_ASroute = model_NEW_set_ASroute;
706 // new_component->generic_routing.set_bypassroute = model_NEW_set_bypassroute;
707 // new_component->generic_routing.get_route = NEW_get_route;
708 // new_component->generic_routing.get_bypass_route = NEW_get_bypass_route;
709 // new_component->generic_routing.finalize = NEW_finalize;
710 // /* initialization of internal structures */
711 // return new_component;
713 // static void model_NEW_load(void) {} /* mandatory */
714 // static void model_NEW_unload(void) {} /* mandatory */
715 // static void model_NEW_end(void) {} /* mandatory */
717 /* ************************************************************************** */
718 /* ************************* GENERIC PARSE FUNCTIONS ************************ */
720 void routing_cluster_add_backbone(void* bb) {
721 xbt_assert(current_routing->p_modelDesc == &routing_models[SURF_MODEL_CLUSTER],
722 "You have to be in model Cluster to use tag backbone!");
723 xbt_assert(!static_cast<AsCluster*>(current_routing)->p_backbone, "The backbone link is already defined!");
724 static_cast<AsCluster*>(current_routing)->p_backbone = static_cast<Link*>(bb);
725 XBT_DEBUG("Add a backbone to AS '%s'", current_routing->p_name);
728 static void routing_parse_cabinet(sg_platf_cabinet_cbarg_t cabinet)
731 char *groups , *host_id , *link_id = NULL;
733 xbt_dynar_t radical_elements;
734 xbt_dynar_t radical_ends;
737 radical_elements = xbt_str_split(cabinet->radical, ",");
738 xbt_dynar_foreach(radical_elements, iter, groups) {
740 radical_ends = xbt_str_split(groups, "-");
741 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
743 switch (xbt_dynar_length(radical_ends)) {
748 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
751 surf_parse_error("Malformed radical");
754 s_sg_platf_host_cbarg_t host = SG_PLATF_HOST_INITIALIZER;
755 memset(&host, 0, sizeof(host));
756 host.initial_state = SURF_RESOURCE_ON;
758 host.power_scale = 1.0;
759 host.core_amount = 1;
761 s_sg_platf_link_cbarg_t link = SG_PLATF_LINK_INITIALIZER;
762 memset(&link, 0, sizeof(link));
763 link.state = SURF_RESOURCE_ON;
764 link.policy = SURF_LINK_FULLDUPLEX;
765 link.latency = cabinet->lat;
766 link.bandwidth = cabinet->bw;
768 s_sg_platf_host_link_cbarg_t host_link = SG_PLATF_HOST_LINK_INITIALIZER;
769 memset(&host_link, 0, sizeof(host_link));
771 for (i = start; i <= end; i++) {
772 host_id = bprintf("%s%d%s",cabinet->prefix,i,cabinet->suffix);
773 link_id = bprintf("link_%s%d%s",cabinet->prefix,i,cabinet->suffix);
776 host.power_peak = xbt_dynar_new(sizeof(double), NULL);
777 xbt_dynar_push(host.power_peak,&cabinet->power);
778 sg_platf_new_host(&host);
779 xbt_dynar_free(&host.power_peak);
780 sg_platf_new_link(&link);
782 char* link_up = bprintf("%s_UP",link_id);
783 char* link_down = bprintf("%s_DOWN",link_id);
784 host_link.id = host_id;
785 host_link.link_up = link_up;
786 host_link.link_down = link_down;
787 sg_platf_new_host_link(&host_link);
795 xbt_dynar_free(&radical_ends);
797 xbt_dynar_free(&radical_elements);
800 static void routing_parse_cluster(sg_platf_cluster_cbarg_t cluster)
802 char *host_id, *groups, *link_id = NULL;
803 xbt_dict_t patterns = NULL;
806 s_sg_platf_host_cbarg_t host = SG_PLATF_HOST_INITIALIZER;
807 s_sg_platf_link_cbarg_t link = SG_PLATF_LINK_INITIALIZER;
811 xbt_dynar_t radical_elements;
812 xbt_dynar_t radical_ends;
814 if ((cluster->availability_trace && strcmp(cluster->availability_trace, ""))
815 || (cluster->state_trace && strcmp(cluster->state_trace, ""))) {
816 patterns = xbt_dict_new_homogeneous(xbt_free_f);
817 xbt_dict_set(patterns, "id", xbt_strdup(cluster->id), NULL);
818 xbt_dict_set(patterns, "prefix", xbt_strdup(cluster->prefix), NULL);
819 xbt_dict_set(patterns, "suffix", xbt_strdup(cluster->suffix), NULL);
822 /* parse the topology attribute. If we are not in a flat cluster,
823 * switch to the right mode and initialize the routing with
824 * the parameters in topo_parameters attribute
826 s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
829 if(cluster->topology == SURF_CLUSTER_TORUS){
830 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Torus_Cluster\">", cluster->id);
831 AS.routing = A_surfxml_AS_routing_Cluster___torus;
832 sg_platf_new_AS_begin(&AS);
833 ((AsClusterTorus*)current_routing)->parse_specific_arguments(cluster);
835 else if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
836 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Fat_Tree_Cluster\">", cluster->id);
837 AS.routing = A_surfxml_AS_routing_Cluster___fat___tree;
838 sg_platf_new_AS_begin(&AS);
839 ((AsClusterFatTree*)current_routing)->parse_specific_arguments(cluster);
843 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", cluster->id);
844 AS.routing = A_surfxml_AS_routing_Cluster;
845 sg_platf_new_AS_begin(&AS);
848 if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
849 ((AsCluster*)current_routing)->p_nb_links_per_node++;
850 ((AsCluster*)current_routing)->p_has_loopback=1;
853 if(cluster->limiter_link!=0){
854 ((AsCluster*)current_routing)->p_nb_links_per_node++;
855 ((AsCluster*)current_routing)->p_has_limiter=1;
860 current_routing->p_linkUpDownList
861 = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
864 radical_elements = xbt_str_split(cluster->radical, ",");
865 xbt_dynar_foreach(radical_elements, iter, groups) {
867 radical_ends = xbt_str_split(groups, "-");
868 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
870 switch (xbt_dynar_length(radical_ends)) {
875 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
878 surf_parse_error("Malformed radical");
881 for (i = start; i <= end; i++) {
883 bprintf("%s%d%s", cluster->prefix, i, cluster->suffix);
884 link_id = bprintf("%s_link_%d", cluster->id, i);
886 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\">", host_id, cluster->power);
888 memset(&host, 0, sizeof(host));
890 if ((cluster->properties != NULL) && (!xbt_dict_is_empty(cluster->properties))) {
891 xbt_dict_cursor_t cursor=NULL;
893 host.properties = xbt_dict_new();
895 xbt_dict_foreach(cluster->properties,cursor,key,data) {
896 xbt_dict_set(host.properties, key, xbt_strdup(data),free);
899 if (cluster->availability_trace && strcmp(cluster->availability_trace, "")) {
900 xbt_dict_set(patterns, "radical", bprintf("%d", i), NULL);
901 char *avail_file = xbt_str_varsubst(cluster->availability_trace, patterns);
902 XBT_DEBUG("\tavailability_file=\"%s\"", avail_file);
903 host.power_trace = tmgr_trace_new_from_file(avail_file);
904 xbt_free(avail_file);
906 XBT_DEBUG("\tavailability_file=\"\"");
909 if (cluster->state_trace && strcmp(cluster->state_trace, "")) {
910 char *avail_file = xbt_str_varsubst(cluster->state_trace, patterns);
911 XBT_DEBUG("\tstate_file=\"%s\"", avail_file);
912 host.state_trace = tmgr_trace_new_from_file(avail_file);
913 xbt_free(avail_file);
915 XBT_DEBUG("\tstate_file=\"\"");
918 host.power_peak = xbt_dynar_new(sizeof(double), NULL);
919 xbt_dynar_push(host.power_peak,&cluster->power);
922 //host.power_peak = cluster->power;
923 host.power_scale = 1.0;
924 host.core_amount = cluster->core_amount;
925 host.initial_state = SURF_RESOURCE_ON;
927 sg_platf_new_host(&host);
928 xbt_dynar_free(&host.power_peak);
929 XBT_DEBUG("</host>");
931 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_id,
932 cluster->bw, cluster->lat);
935 s_surf_parsing_link_up_down_t info_lim, info_loop;
936 // All links are saved in a matrix;
937 // every row describes a single node; every node
938 // may have multiple links.
939 // the first column may store a link from x to x if p_has_loopback is set
940 // the second column may store a limiter link if p_has_limiter is set
941 // other columns are to store one or more link for the node
943 //add a loopback link
944 if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
945 char *tmp_link = bprintf("%s_loopback", link_id);
946 XBT_DEBUG("<loopback\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
947 cluster->limiter_link);
950 memset(&link, 0, sizeof(link));
952 link.bandwidth = cluster->loopback_bw;
953 link.latency = cluster->loopback_lat;
954 link.state = SURF_RESOURCE_ON;
955 link.policy = SURF_LINK_FATPIPE;
956 sg_platf_new_link(&link);
957 info_loop.link_up = Link::byName(tmp_link);
958 info_loop.link_down = info_loop.link_up;
960 xbt_dynar_set(current_routing->p_linkUpDownList, rankId*(static_cast<AsCluster*>(current_routing))->p_nb_links_per_node, &info_loop);
963 //add a limiter link (shared link to account for maximal bandwidth of the node)
964 if(cluster->limiter_link!=0){
965 char *tmp_link = bprintf("%s_limiter", link_id);
966 XBT_DEBUG("<limiter\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
967 cluster->limiter_link);
970 memset(&link, 0, sizeof(link));
972 link.bandwidth = cluster->limiter_link;
974 link.state = SURF_RESOURCE_ON;
975 link.policy = SURF_LINK_SHARED;
976 sg_platf_new_link(&link);
977 info_lim.link_up = Link::byName(tmp_link);
978 info_lim.link_down = info_lim.link_up;
980 xbt_dynar_set(current_routing->p_linkUpDownList,
981 rankId*(static_cast<AsCluster*>(current_routing))->p_nb_links_per_node + static_cast<AsCluster*>(current_routing)->p_has_loopback ,
987 //call the cluster function that adds the others links
988 if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
989 ((AsClusterFatTree*) current_routing)->addProcessingNode(i);
992 static_cast<AsCluster*>(current_routing)->create_links_for_node(cluster, i, rankId, rankId*
993 static_cast<AsCluster*>(current_routing)->p_nb_links_per_node
994 + static_cast<AsCluster*>(current_routing)->p_has_loopback
995 + static_cast<AsCluster*>(current_routing)->p_has_limiter );
1002 xbt_dynar_free(&radical_ends);
1004 xbt_dynar_free(&radical_elements);
1006 // For fat trees, the links must be created once all nodes have been added
1007 if(cluster->topology == SURF_CLUSTER_FAT_TREE) {
1008 static_cast<AsClusterFatTree*>(current_routing)->create_links();
1010 // Add a router. It is magically used thanks to the way in which surf_routing_cluster is written,
1011 // and it's very useful to connect clusters together
1013 XBT_DEBUG("<router id=\"%s\"/>", cluster->router_id);
1015 s_sg_platf_router_cbarg_t router = SG_PLATF_ROUTER_INITIALIZER;
1016 memset(&router, 0, sizeof(router));
1017 router.id = cluster->router_id;
1019 if (!router.id || !strcmp(router.id, ""))
1021 bprintf("%s%s_router%s", cluster->prefix, cluster->id,
1023 sg_platf_new_router(&router);
1024 ((AsCluster*)current_routing)->p_router = (RoutingEdge*) xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL);
1028 if ((cluster->bb_bw != 0) || (cluster->bb_lat != 0)) {
1029 char *link_backbone = bprintf("%s_backbone", cluster->id);
1030 XBT_DEBUG("<link\tid=\"%s\" bw=\"%f\" lat=\"%f\"/>", link_backbone,
1031 cluster->bb_bw, cluster->bb_lat);
1033 memset(&link, 0, sizeof(link));
1034 link.id = link_backbone;
1035 link.bandwidth = cluster->bb_bw;
1036 link.latency = cluster->bb_lat;
1037 link.state = SURF_RESOURCE_ON;
1038 link.policy = cluster->bb_sharing_policy;
1040 sg_platf_new_link(&link);
1042 routing_cluster_add_backbone(Link::byName(link_backbone));
1044 free(link_backbone);
1048 sg_platf_new_AS_end();
1050 xbt_dict_free(&patterns); // no op if it were never set
1053 static void routing_parse_postparse(void) {
1054 xbt_dict_free(&random_value);
1057 static void routing_parse_peer(sg_platf_peer_cbarg_t peer)
1059 char *host_id = NULL;
1060 char *link_id = NULL;
1061 char *router_id = NULL;
1064 host_id = HOST_PEER(peer->id);
1065 link_id = LINK_PEER(peer->id);
1066 router_id = ROUTER_PEER(peer->id);
1068 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", peer->id);
1069 s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
1071 AS.routing = A_surfxml_AS_routing_Cluster;
1072 sg_platf_new_AS_begin(&AS);
1074 current_routing->p_linkUpDownList = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
1076 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\"/>", host_id, peer->power);
1077 s_sg_platf_host_cbarg_t host = SG_PLATF_HOST_INITIALIZER;
1078 memset(&host, 0, sizeof(host));
1079 host.initial_state = SURF_RESOURCE_ON;
1082 host.power_peak = xbt_dynar_new(sizeof(double), NULL);
1083 xbt_dynar_push(host.power_peak,&peer->power);
1085 //host.power_peak = peer->power;
1086 host.power_scale = 1.0;
1087 host.power_trace = peer->availability_trace;
1088 host.state_trace = peer->state_trace;
1089 host.core_amount = 1;
1090 sg_platf_new_host(&host);
1091 xbt_dynar_free(&host.power_peak);
1093 s_sg_platf_link_cbarg_t link = SG_PLATF_LINK_INITIALIZER;
1094 memset(&link, 0, sizeof(link));
1095 link.state = SURF_RESOURCE_ON;
1096 link.policy = SURF_LINK_SHARED;
1097 link.latency = peer->lat;
1099 char* link_up = bprintf("%s_UP",link_id);
1100 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_up,
1101 peer->bw_out, peer->lat);
1103 link.bandwidth = peer->bw_out;
1104 sg_platf_new_link(&link);
1106 char* link_down = bprintf("%s_DOWN",link_id);
1107 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_down,
1108 peer->bw_in, peer->lat);
1109 link.id = link_down;
1110 link.bandwidth = peer->bw_in;
1111 sg_platf_new_link(&link);
1113 XBT_DEBUG("<host_link\tid=\"%s\"\tup=\"%s\"\tdown=\"%s\" />", host_id,link_up,link_down);
1114 s_sg_platf_host_link_cbarg_t host_link = SG_PLATF_HOST_LINK_INITIALIZER;
1115 memset(&host_link, 0, sizeof(host_link));
1116 host_link.id = host_id;
1117 host_link.link_up = link_up;
1118 host_link.link_down = link_down;
1119 sg_platf_new_host_link(&host_link);
1121 XBT_DEBUG("<router id=\"%s\"/>", router_id);
1122 s_sg_platf_router_cbarg_t router = SG_PLATF_ROUTER_INITIALIZER;
1123 memset(&router, 0, sizeof(router));
1124 router.id = router_id;
1125 router.coord = peer->coord;
1126 sg_platf_new_router(&router);
1127 static_cast<AsCluster*>(current_routing)->p_router = static_cast<RoutingEdge*>(xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL));
1130 sg_platf_new_AS_end();
1133 //xbt_dynar_free(&tab_elements_num);
1141 // static void routing_parse_Srandom(void)
1143 // double mean, std, min, max, seed;
1144 // char *random_id = A_surfxml_random_id;
1145 // char *random_radical = A_surfxml_random_radical;
1146 // char *rd_name = NULL;
1148 // mean = surf_parse_get_double(A_surfxml_random_mean);
1149 // std = surf_parse_get_double(A_surfxml_random_std___deviation);
1150 // min = surf_parse_get_double(A_surfxml_random_min);
1151 // max = surf_parse_get_double(A_surfxml_random_max);
1152 // seed = surf_parse_get_double(A_surfxml_random_seed);
1156 // random_data_t random = xbt_new0(s_random_data_t, 1);
1159 // xbt_dynar_t radical_elements;
1160 // unsigned int iter;
1163 // xbt_dynar_t radical_ends;
1165 // switch (A_surfxml_random_generator) {
1166 // case AU_surfxml_random_generator:
1167 // case A_surfxml_random_generator_NONE:
1168 // random->generator = NONE;
1170 // case A_surfxml_random_generator_DRAND48:
1171 // random->generator = DRAND48;
1173 // case A_surfxml_random_generator_RAND:
1174 // random->generator = RAND;
1176 // case A_surfxml_random_generator_RNGSTREAM:
1177 // random->generator = RNGSTREAM;
1180 // surf_parse_error("Invalid random generator");
1183 // random->seed = seed;
1184 // random->min = min;
1185 // random->max = max;
1187 // /* Check user stupidities */
1189 // THROWF(arg_error, 0, "random->max < random->min (%f < %f)", max, min);
1191 // THROWF(arg_error, 0, "random->mean < random->min (%f < %f)", mean, min);
1193 // THROWF(arg_error, 0, "random->mean > random->max (%f > %f)", mean, max);
1195 // /* normalize the mean and standard deviation before storing */
1196 // random->mean = (mean - min) / (max - min);
1197 // random->std = std / (max - min);
1199 // if (random->mean * (1 - random->mean) < random->std * random->std)
1200 // THROWF(arg_error, 0, "Invalid mean and standard deviation (%f and %f)",
1201 // random->mean, random->std);
1204 // ("id = '%s' min = '%f' max = '%f' mean = '%f' std_deviatinon = '%f' generator = '%d' seed = '%ld' radical = '%s'",
1205 // random_id, random->min, random->max, random->mean, random->std,
1206 // (int)random->generator, random->seed, random_radical);
1208 // if (!random_value)
1209 // random_value = xbt_dict_new_homogeneous(free);
1211 // if (!strcmp(random_radical, "")) {
1212 // res = random_generate(random);
1213 // rd_value = bprintf("%f", res);
1214 // xbt_dict_set(random_value, random_id, rd_value, NULL);
1216 // radical_elements = xbt_str_split(random_radical, ",");
1217 // xbt_dynar_foreach(radical_elements, iter, groups) {
1218 // radical_ends = xbt_str_split(groups, "-");
1219 // switch (xbt_dynar_length(radical_ends)) {
1221 // xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1222 // "Custom Random '%s' already exists !", random_id);
1223 // res = random_generate(random);
1225 // bprintf("%s%d", random_id,
1226 // atoi(xbt_dynar_getfirst_as(radical_ends, char *)));
1227 // xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1228 // xbt_free(tmpbuf);
1232 // start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
1233 // end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
1234 // for (i = start; i <= end; i++) {
1235 // xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1236 // "Custom Random '%s' already exists !", bprintf("%s%d",
1239 // res = random_generate(random);
1240 // tmpbuf = bprintf("%s%d", random_id, i);
1241 // xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1242 // xbt_free(tmpbuf);
1246 // XBT_CRITICAL("Malformed radical");
1249 // res = random_generate(random);
1250 // rd_name = bprintf("%s_router", random_id);
1251 // rd_value = bprintf("%f", res);
1252 // xbt_dict_set(random_value, rd_name, rd_value, NULL);
1254 // xbt_dynar_free(&radical_ends);
1257 // xbt_dynar_free(&radical_elements);
1261 static void check_disk_attachment()
1263 xbt_lib_cursor_t cursor;
1266 RoutingEdge *host_elm;
1267 xbt_lib_foreach(storage_lib, cursor, key, data) {
1268 if(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL) != NULL) {
1269 Storage *storage = static_cast<Storage*>(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL));
1270 host_elm = sg_routing_edge_by_name_or_null(storage->p_attach);
1272 surf_parse_error("Unable to attach storage %s: host %s doesn't exist.", storage->getName(), storage->p_attach);
1277 void routing_register_callbacks()
1279 sg_platf_router_add_cb(parse_S_router);
1280 sg_platf_host_link_add_cb(parse_S_host);
1281 sg_platf_route_add_cb(parse_E_route);
1282 sg_platf_ASroute_add_cb(parse_E_ASroute);
1283 sg_platf_bypassRoute_add_cb(parse_E_bypassRoute);
1284 sg_platf_bypassASroute_add_cb(parse_E_bypassASroute);
1286 sg_platf_cluster_add_cb(routing_parse_cluster);
1287 sg_platf_cabinet_add_cb(routing_parse_cabinet);
1289 sg_platf_peer_add_cb(routing_parse_peer);
1290 sg_platf_postparse_add_cb(routing_parse_postparse);
1291 sg_platf_postparse_add_cb(check_disk_attachment);
1293 /* we care about the ASes while parsing the platf. Incredible, isnt it? */
1294 sg_platf_AS_end_add_cb(routing_AS_end);
1295 sg_platf_AS_begin_add_cb(routing_AS_begin);
1297 sg_platf_trace_add_cb(routing_parse_trace);
1298 sg_platf_trace_connect_add_cb(routing_parse_trace_connect);
1300 instr_routing_define_callbacks();
1304 * \brief Recursive function for finalize
1306 * \param rc the source host name
1308 * This fuction is call by "finalize". It allow to finalize the
1309 * AS or routing components. It delete all the structures.
1311 static void finalize_rec(As *as) {
1312 xbt_dict_cursor_t cursor = NULL;
1316 xbt_dict_foreach(as->p_routingSons, cursor, key, elem) {
1323 /** \brief Frees all memory allocated by the routing module */
1324 void routing_exit(void) {
1325 delete routing_platf;
1328 RoutingPlatf::~RoutingPlatf()
1330 xbt_dynar_free(&p_lastRoute);
1331 finalize_rec(p_root);
1334 AS_t surf_AS_get_routing_root() {
1335 return routing_platf->p_root;
1338 const char *surf_AS_get_name(As *as) {
1342 static As *surf_AS_recursive_get_by_name(As *current, const char * name) {
1343 xbt_dict_cursor_t cursor = NULL;
1348 if(!strcmp(current->p_name, name))
1351 xbt_dict_foreach(current->p_routingSons, cursor, key, elem) {
1352 tmp = surf_AS_recursive_get_by_name(elem, name);
1361 As *surf_AS_get_by_name(const char * name) {
1362 As *as = surf_AS_recursive_get_by_name(routing_platf->p_root, name);
1364 XBT_WARN("Impossible to find an AS with name %s, please check your input", name);
1368 xbt_dict_t surf_AS_get_routing_sons(As *as) {
1369 return as->p_routingSons;
1372 const char *surf_AS_get_model(As *as) {
1373 return as->p_modelDesc->name;
1376 xbt_dynar_t surf_AS_get_hosts(As *as) {
1377 xbt_dynar_t elms = as->p_indexNetworkElm;
1378 sg_routing_edge_t relm;
1381 int count = xbt_dynar_length(elms);
1382 xbt_dynar_t res = xbt_dynar_new(sizeof(xbt_dictelm_t), NULL);
1383 for (index = 0; index < count; index++) {
1384 relm = xbt_dynar_get_as(elms, index, RoutingEdge*);
1385 delm = xbt_lib_get_elm_or_null(host_lib, relm->getName());
1387 xbt_dynar_push(res, &delm);
1393 void surf_AS_get_graph(AS_t as, xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges) {
1394 as->getGraph(graph, nodes, edges);