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"
23 surf_callback(void, RoutingEdge*) routingEdgeCreatedCallbacks;
26 * @ingroup SURF_build_api
27 * @brief A library containing all known hosts
31 int SURF_HOST_LEVEL; //Surf host level
32 int COORD_HOST_LEVEL=0; //Coordinates level
33 int NS3_HOST_LEVEL; //host node for ns3
35 int MSG_FILE_LEVEL; //Msg file level
37 int SIMIX_STORAGE_LEVEL; //Simix storage level
38 int MSG_STORAGE_LEVEL; //Msg storage level
39 int SD_STORAGE_LEVEL; //Simdag storage level
41 xbt_lib_t as_router_lib;
42 int ROUTING_ASR_LEVEL; //Routing level
43 int COORD_ASR_LEVEL; //Coordinates level
44 int NS3_ASR_LEVEL; //host node for ns3
45 int ROUTING_PROP_ASR_LEVEL; //Where the properties are stored
47 static xbt_dict_t random_value = NULL;
50 /** @brief Retrieve a routing edge from its name
52 * Routing edges are either host and routers, whatever
54 RoutingEdge *sg_routing_edge_by_name_or_null(const char *name) {
55 sg_host_t h = sg_host_by_name(name);
56 RoutingEdge *net_elm = h==NULL?NULL: sg_host_edge(h);
58 net_elm = (RoutingEdge*) xbt_lib_get_or_null(as_router_lib, name, ROUTING_ASR_LEVEL);
63 RoutingPlatf *routing_platf = NULL;
65 /* global parse functions */
66 extern xbt_dynar_t mount_list;
68 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route, surf, "Routing part of surf");
70 /** The current AS in the parsing */
71 static As *current_routing = NULL;
72 As* routing_get_current()
74 return current_routing;
77 static void routing_parse_peer(sg_platf_peer_cbarg_t peer); /* peer bypass */
78 // static void routing_parse_Srandom(void); /* random bypass */
80 static void routing_parse_postparse(void);
82 /* this lines are only for replace use like index in the model table */
87 SURF_MODEL_DIJKSTRACACHE,
91 SURF_MODEL_TORUS_CLUSTER,
92 SURF_MODEL_FAT_TREE_CLUSTER,
95 struct s_model_type routing_models[] = {
97 "Full routing data (fast, large memory requirements, fully expressive)",
98 model_full_create, model_full_end},
100 "Floyd routing data (slow initialization, fast lookup, lesser memory requirements, shortest path routing only)",
101 model_floyd_create, model_floyd_end},
103 "Dijkstra routing data (fast initialization, slow lookup, small memory requirements, shortest path routing only)",
104 model_dijkstra_create, model_dijkstra_both_end},
106 "Dijkstra routing data (fast initialization, fast lookup, small memory requirements, shortest path routing only)",
107 model_dijkstracache_create, model_dijkstra_both_end},
108 {"none", "No routing (Unless you know what you are doing, avoid using this mode in combination with a non Constant network model).",
109 model_none_create, NULL},
110 {"Vivaldi", "Vivaldi routing",
111 model_vivaldi_create, NULL},
112 {"Cluster", "Cluster routing",
113 model_cluster_create, NULL},
114 {"Torus_Cluster", "Torus Cluster routing",
115 model_torus_cluster_create, NULL},
116 {"Fat_Tree_Cluster", "Fat Tree Cluster routing",
117 model_fat_tree_cluster_create, NULL},
118 {NULL, NULL, NULL, NULL}
122 * \brief Add a "host_link" to the network element list
124 static void parse_S_host(sg_platf_host_link_cbarg_t host)
126 RoutingEdge *info = sg_host_edge(sg_host_by_name(host->id));
127 xbt_assert(info, "Host '%s' not found!", host->id);
128 xbt_assert(current_routing->p_modelDesc == &routing_models[SURF_MODEL_CLUSTER] ||
129 current_routing->p_modelDesc == &routing_models[SURF_MODEL_VIVALDI],
130 "You have to be in model Cluster to use tag host_link!");
132 s_surf_parsing_link_up_down_t link_up_down;
133 link_up_down.link_up = Link::byName(host->link_up);
134 link_up_down.link_down = Link::byName(host->link_down);
136 xbt_assert(link_up_down.link_up, "Link '%s' not found!",host->link_up);
137 xbt_assert(link_up_down.link_down, "Link '%s' not found!",host->link_down);
139 if(!current_routing->p_linkUpDownList)
140 current_routing->p_linkUpDownList = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
142 // If dynar is is greater than edge id and if the host_link is already defined
143 if((int)xbt_dynar_length(current_routing->p_linkUpDownList) > info->getId() &&
144 xbt_dynar_get_as(current_routing->p_linkUpDownList, info->getId(), void*))
145 surf_parse_error("Host_link for '%s' is already defined!",host->id);
147 XBT_DEBUG("Push Host_link for host '%s' to position %d", info->getName(), info->getId());
148 xbt_dynar_set_as(current_routing->p_linkUpDownList, info->getId(), s_surf_parsing_link_up_down_t, link_up_down);
152 * \brief Add a "host" to the network element list
154 RoutingEdge *routing_add_host(As* current_routing, sg_platf_host_cbarg_t host)
156 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
157 current_routing->p_hierarchy = SURF_ROUTING_BASE;
158 xbt_assert(!sg_host_by_name(host->id),
159 "Reading a host, processing unit \"%s\" already exists", host->id);
161 RoutingEdge *routingEdge = new RoutingEdgeImpl(xbt_strdup(host->id),
163 SURF_NETWORK_ELEMENT_HOST,
165 routingEdge->setId(current_routing->parsePU(routingEdge));
166 sg_host_edge_set(sg_host_by_name_or_create(host->id), routingEdge);
167 XBT_DEBUG("Having set name '%s' id '%d'", host->id, routingEdge->getId());
168 routingEdgeCreatedCallbacks(routingEdge);
171 xbt_lib_set(storage_lib, host->id, ROUTING_STORAGE_HOST_LEVEL, (void *) mount_list);
175 if (host->coord && strcmp(host->coord, "")) {
179 if (!COORD_HOST_LEVEL)
180 xbt_die ("To use host coordinates, please add --cfg=network/coordinates:yes to your command line");
181 /* Pre-parse the host coordinates -- FIXME factorize with routers by overloading the routing->parse_PU function*/
182 xbt_dynar_t ctn_str = xbt_str_split_str(host->coord, " ");
183 xbt_dynar_t ctn = xbt_dynar_new(sizeof(double),NULL);
184 xbt_dynar_foreach(ctn_str,cursor, str) {
185 double val = atof(str);
186 xbt_dynar_push(ctn,&val);
188 xbt_dynar_shrink(ctn, 0);
189 xbt_dynar_free(&ctn_str);
190 xbt_lib_set(host_lib, host->id, COORD_HOST_LEVEL, (void *) ctn);
191 XBT_DEBUG("Having set host coordinates for '%s'",host->id);
198 * \brief Store the route by calling the set_route function of the current routing component
200 static void parse_E_route(sg_platf_route_cbarg_t route)
202 /*FIXME:REMOVE:xbt_assert(current_routing->parse_route,
203 "no defined method \"set_route\" in \"%s\"",
204 current_routing->name);*/
206 current_routing->parseRoute(route);
210 * \brief Store the ASroute by calling the set_ASroute function of the current routing component
212 static void parse_E_ASroute(sg_platf_route_cbarg_t ASroute)
214 /*FIXME:REMOVE:xbt_assert(current_routing->parse_ASroute,
215 "no defined method \"set_ASroute\" in \"%s\"",
216 current_routing->name);*/
217 current_routing->parseASroute(ASroute);
221 * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
223 static void parse_E_bypassRoute(sg_platf_route_cbarg_t route)
225 /*FIXME:REMOVE:xbt_assert(current_routing->parse_bypassroute,
226 "Bypassing mechanism not implemented by routing '%s'",
227 current_routing->name);*/
229 current_routing->parseBypassroute(route);
233 * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
235 static void parse_E_bypassASroute(sg_platf_route_cbarg_t ASroute)
237 /*FIXME:REMOVE:xbt_assert(current_routing->parse_bypassroute,
238 "Bypassing mechanism not implemented by routing '%s'",
239 current_routing->name);*/
240 current_routing->parseBypassroute(ASroute);
243 static void routing_parse_trace(sg_platf_trace_cbarg_t trace)
245 tmgr_trace_t tmgr_trace;
246 if (!trace->file || strcmp(trace->file, "") != 0) {
247 tmgr_trace = tmgr_trace_new_from_file(trace->file);
248 } else if (strcmp(trace->pc_data, "") == 0) {
252 tmgr_trace_new_from_string(trace->id, trace->pc_data,
255 xbt_dict_set(traces_set_list, trace->id, (void *) tmgr_trace, NULL);
258 static void routing_parse_trace_connect(sg_platf_trace_connect_cbarg_t trace_connect)
260 xbt_assert(xbt_dict_get_or_null
261 (traces_set_list, trace_connect->trace),
262 "Cannot connect trace %s to %s: trace unknown",
263 trace_connect->trace,
264 trace_connect->element);
266 switch (trace_connect->kind) {
267 case SURF_TRACE_CONNECT_KIND_HOST_AVAIL:
268 xbt_dict_set(trace_connect_list_host_avail,
269 trace_connect->trace,
270 xbt_strdup(trace_connect->element), NULL);
272 case SURF_TRACE_CONNECT_KIND_POWER:
273 xbt_dict_set(trace_connect_list_power, trace_connect->trace,
274 xbt_strdup(trace_connect->element), NULL);
276 case SURF_TRACE_CONNECT_KIND_LINK_AVAIL:
277 xbt_dict_set(trace_connect_list_link_avail,
278 trace_connect->trace,
279 xbt_strdup(trace_connect->element), NULL);
281 case SURF_TRACE_CONNECT_KIND_BANDWIDTH:
282 xbt_dict_set(trace_connect_list_bandwidth,
283 trace_connect->trace,
284 xbt_strdup(trace_connect->element), NULL);
286 case SURF_TRACE_CONNECT_KIND_LATENCY:
287 xbt_dict_set(trace_connect_list_latency, trace_connect->trace,
288 xbt_strdup(trace_connect->element), NULL);
291 surf_parse_error("Cannot connect trace %s to %s: kind of trace unknown",
292 trace_connect->trace, trace_connect->element);
298 * \brief Make a new routing component to the platform
300 * Add a new autonomous system to the platform. Any elements (such as host,
301 * router or sub-AS) added after this call and before the corresponding call
302 * to sg_platf_new_AS_close() will be added to this AS.
304 * Once this function was called, the configuration concerning the used
305 * models cannot be changed anymore.
307 * @param AS_id name of this autonomous system. Must be unique in the platform
308 * @param wanted_routing_type one of Full, Floyd, Dijkstra or similar. Full list in the variable routing_models, in src/surf/surf_routing.c
310 void routing_AS_begin(sg_platf_AS_cbarg_t AS)
312 XBT_DEBUG("routing_AS_begin");
313 routing_model_description_t model = NULL;
315 xbt_assert(!xbt_lib_get_or_null
316 (as_router_lib, AS->id, ROUTING_ASR_LEVEL),
317 "The AS \"%s\" already exists", AS->id);
319 _sg_cfg_init_status = 2; /* horrible hack: direct access to the global
320 * controlling the level of configuration to prevent
321 * any further config */
323 /* search the routing model */
325 case A_surfxml_AS_routing_Cluster: model = &routing_models[SURF_MODEL_CLUSTER];break;
326 case A_surfxml_AS_routing_Cluster___torus: model = &routing_models[SURF_MODEL_TORUS_CLUSTER];break;
327 case A_surfxml_AS_routing_Cluster___fat___tree: model = &routing_models[SURF_MODEL_FAT_TREE_CLUSTER];break;
328 case A_surfxml_AS_routing_Dijkstra: model = &routing_models[SURF_MODEL_DIJKSTRA];break;
329 case A_surfxml_AS_routing_DijkstraCache: model = &routing_models[SURF_MODEL_DIJKSTRACACHE];break;
330 case A_surfxml_AS_routing_Floyd: model = &routing_models[SURF_MODEL_FLOYD];break;
331 case A_surfxml_AS_routing_Full: model = &routing_models[SURF_MODEL_FULL];break;
332 case A_surfxml_AS_routing_None: model = &routing_models[SURF_MODEL_NONE];break;
333 case A_surfxml_AS_routing_Vivaldi: model = &routing_models[SURF_MODEL_VIVALDI];break;
334 default: xbt_die("Not a valid model!!!");
338 /* make a new routing component */
339 As *new_as = model->create();
341 new_as->p_modelDesc = model;
342 new_as->p_hierarchy = SURF_ROUTING_NULL;
343 new_as->p_name = xbt_strdup(AS->id);
345 RoutingEdge *info = new RoutingEdgeImpl(xbt_strdup(new_as->p_name),
347 SURF_NETWORK_ELEMENT_AS,
349 if (current_routing == NULL && routing_platf->p_root == NULL) {
351 /* it is the first one */
352 new_as->p_routingFather = NULL;
353 routing_platf->p_root = new_as;
355 } else if (current_routing != NULL && routing_platf->p_root != NULL) {
357 xbt_assert(!xbt_dict_get_or_null
358 (current_routing->p_routingSons, AS->id),
359 "The AS \"%s\" already exists", AS->id);
360 /* it is a part of the tree */
361 new_as->p_routingFather = current_routing;
362 /* set the father behavior */
363 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
364 current_routing->p_hierarchy = SURF_ROUTING_RECURSIVE;
365 /* add to the sons dictionary */
366 xbt_dict_set(current_routing->p_routingSons, AS->id,
367 (void *) new_as, NULL);
368 /* add to the father element list */
369 info->setId(current_routing->parseAS(info));
371 THROWF(arg_error, 0, "All defined components must belong to a AS");
374 xbt_lib_set(as_router_lib, info->getName(), ROUTING_ASR_LEVEL,
376 XBT_DEBUG("Having set name '%s' id '%d'", new_as->p_name, info->getId());
378 routingEdgeCreatedCallbacks(info);
380 /* set the new current component of the tree */
381 current_routing = new_as;
382 current_routing->p_netElem = info;
386 * \brief Specify that the current description of AS is finished
388 * Once you've declared all the content of your AS, you have to close
389 * it with this call. Your AS is not usable until you call this function.
391 * @fixme: this call is not as robust as wanted: bad things WILL happen
392 * if you call it twice for the same AS, or if you forget calling it, or
393 * even if you add stuff to a closed AS
396 void routing_AS_end(sg_platf_AS_cbarg_t /*AS*/)
399 if (current_routing == NULL) {
400 THROWF(arg_error, 0, "Close an AS, but none was under construction");
402 if (current_routing->p_modelDesc->end)
403 current_routing->p_modelDesc->end(current_routing);
404 current_routing = current_routing->p_routingFather;
408 /* Aux Business methods */
411 * \brief Get the AS father and the first elements of the chain
413 * \param src the source host name
414 * \param dst the destination host name
416 * Get the common father of the to processing units, and the first different
417 * father in the chain
419 static void elements_father(sg_routing_edge_t src, sg_routing_edge_t dst,
424 xbt_assert(src && dst, "bad parameters for \"elements_father\" method");
425 #define ELEMENTS_FATHER_MAXDEPTH 16 /* increase if it is not enough */
427 As *path_src[ELEMENTS_FATHER_MAXDEPTH];
428 As *path_dst[ELEMENTS_FATHER_MAXDEPTH];
436 /* (1) find the as where the src and dst are located */
437 sg_routing_edge_t src_data = src;
438 sg_routing_edge_t dst_data = dst;
439 src_as = src_data->getRcComponent();
440 dst_as = dst_data->getRcComponent();
442 char* src_name = src_data->getName();
443 char* dst_name = dst_data->getName();
446 xbt_assert(src_as && dst_as,
447 "Ask for route \"from\"(%s) or \"to\"(%s) no found", src_name, dst_name);
449 /* (2) find the path to the root routing component */
450 for (current = src_as; current != NULL; current = current->p_routingFather) {
451 if (index_src >= ELEMENTS_FATHER_MAXDEPTH)
452 xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_src");
453 path_src[index_src++] = current;
455 for (current = dst_as; current != NULL; current = current->p_routingFather) {
456 if (index_dst >= ELEMENTS_FATHER_MAXDEPTH)
457 xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_dst");
458 path_dst[index_dst++] = current;
461 /* (3) find the common father */
463 current_src = path_src[--index_src];
464 current_dst = path_dst[--index_dst];
465 } while (index_src > 0 && index_dst > 0 && current_src == current_dst);
467 /* (4) they are not in the same routing component, make the path */
468 if (current_src == current_dst)
469 father = current_src;
471 father = path_src[index_src + 1];
473 /* (5) result generation */
474 *res_father = father; /* first the common father of src and dst */
475 *res_src = current_src; /* second the first different father of src */
476 *res_dst = current_dst; /* three the first different father of dst */
478 #undef ELEMENTS_FATHER_MAXDEPTH
481 /* Global Business methods */
484 * \brief Recursive function for get_route_latency
486 * \param src the source host name
487 * \param dst the destination host name
488 * \param *route the route where the links are stored. It is either NULL or a ready to use dynar
489 * \param *latency the latency, if needed
491 * This function is called by "get_route" and "get_latency". It allows to walk
492 * recursively through the ASes tree.
494 static void _get_route_and_latency(RoutingEdge *src, RoutingEdge *dst,
495 xbt_dynar_t * links, double *latency)
497 s_sg_platf_route_cbarg_t route = SG_PLATF_ROUTE_INITIALIZER;
498 memset(&route,0,sizeof(route));
500 xbt_assert(src && dst, "bad parameters for \"_get_route_latency\" method");
501 XBT_DEBUG("Solve route/latency \"%s\" to \"%s\"", src->getName(), dst->getName());
503 /* Find how src and dst are interconnected */
504 As *common_father, *src_father, *dst_father;
505 elements_father(src, dst, &common_father, &src_father, &dst_father);
506 XBT_DEBUG("elements_father: common father '%s' src_father '%s' dst_father '%s'",
507 common_father->p_name, src_father->p_name, dst_father->p_name);
509 /* Check whether a direct bypass is defined */
510 sg_platf_route_cbarg_t e_route_bypass = NULL;
511 //FIXME:REMOVE:if (common_father->get_bypass_route)
513 e_route_bypass = common_father->getBypassRoute(src, dst, latency);
515 /* Common ancestor is kind enough to declare a bypass route from src to dst -- use it and bail out */
516 if (e_route_bypass) {
517 xbt_dynar_merge(links, &e_route_bypass->link_list);
518 generic_free_route(e_route_bypass);
522 /* If src and dst are in the same AS, life is good */
523 if (src_father == dst_father) { /* SURF_ROUTING_BASE */
524 route.link_list = *links;
525 common_father->getRouteAndLatency(src, dst, &route, latency);
526 // if vivaldi latency+=vivaldi(src,dst)
530 /* Not in the same AS, no bypass. We'll have to find our path between the ASes recursively*/
532 route.link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
533 // Find the net_card corresponding to father
534 RoutingEdge *src_father_net_elm = src_father->p_netElem;
535 RoutingEdge *dst_father_net_elm = dst_father->p_netElem;
537 common_father->getRouteAndLatency(src_father_net_elm, dst_father_net_elm,
540 xbt_assert((route.gw_src != NULL) && (route.gw_dst != NULL),
541 "bad gateways for route from \"%s\" to \"%s\"", src->getName(), dst->getName());
543 sg_routing_edge_t src_gateway_net_elm = route.gw_src;
544 sg_routing_edge_t dst_gateway_net_elm = route.gw_dst;
546 /* If source gateway is not our source, we have to recursively find our way up to this point */
547 if (src != src_gateway_net_elm)
548 _get_route_and_latency(src, src_gateway_net_elm, links, latency);
549 xbt_dynar_merge(links, &route.link_list);
551 /* If dest gateway is not our destination, we have to recursively find our way from this point */
552 if (dst_gateway_net_elm != dst)
553 _get_route_and_latency(dst_gateway_net_elm, dst, links, latency);
555 // if vivaldi latency+=vivaldi(src_gateway,dst_gateway)
558 AS_t surf_platf_get_root(routing_platf_t platf){
559 return platf->p_root;
562 e_surf_network_element_type_t surf_routing_edge_get_rc_type(sg_routing_edge_t edge){
563 return edge->getRcType();
568 * \brief Find a route between hosts
570 * \param src the network_element_t for src host
571 * \param dst the network_element_t for dst host
572 * \param route where to store the list of links.
573 * If *route=NULL, create a short lived dynar. Else, fill the provided dynar
574 * \param latency where to store the latency experienced on the path (or NULL if not interested)
575 * It is the caller responsability to initialize latency to 0 (we add to provided route)
578 * walk through the routing components tree and find a route between hosts
579 * by calling the differents "get_route" functions in each routing component.
581 void RoutingPlatf::getRouteAndLatency(RoutingEdge *src, RoutingEdge *dst,
582 xbt_dynar_t* route, double *latency)
584 XBT_DEBUG("routing_get_route_and_latency from %s to %s", src->getName(), dst->getName());
586 xbt_dynar_reset(routing_platf->p_lastRoute);
587 *route = routing_platf->p_lastRoute;
590 _get_route_and_latency(src, dst, route, latency);
592 xbt_assert(!latency || *latency >= 0.0,
593 "negative latency on route between \"%s\" and \"%s\"", src->getName(), dst->getName());
596 xbt_dynar_t RoutingPlatf::getOneLinkRoutes(){
597 return recursiveGetOneLinkRoutes(p_root);
600 xbt_dynar_t RoutingPlatf::recursiveGetOneLinkRoutes(As *rc)
602 xbt_dynar_t ret = xbt_dynar_new(sizeof(Onelink*), xbt_free_f);
604 //adding my one link routes
605 xbt_dynar_t onelink_mine = rc->getOneLinkRoutes();
607 xbt_dynar_merge(&ret,&onelink_mine);
611 xbt_dict_cursor_t cursor = NULL;
613 xbt_dict_foreach(rc->p_routingSons, cursor, key, rc_child) {
614 xbt_dynar_t onelink_child = recursiveGetOneLinkRoutes(rc_child);
616 xbt_dynar_merge(&ret,&onelink_child);
621 e_surf_network_element_type_t routing_get_network_element_type(const char *name)
623 RoutingEdge *rc = sg_routing_edge_by_name_or_null(name);
625 return rc->getRcType();
627 return SURF_NETWORK_ELEMENT_NULL;
631 * \brief Generic method: create the global routing schema
633 * Make a global routing structure and set all the parsing functions.
635 void routing_model_create( void *loopback)
637 /* config the uniq global routing */
638 routing_platf = new RoutingPlatf();
639 routing_platf->p_root = NULL;
640 routing_platf->p_loopback = loopback;
641 routing_platf->p_lastRoute = xbt_dynar_new(sizeof(sg_routing_link_t),NULL);
642 /* no current routing at moment */
643 current_routing = NULL;
647 /* ************************************************** */
648 /* ********** PATERN FOR NEW ROUTING **************** */
650 /* The minimal configuration of a new routing model need the next functions,
651 * also you need to set at the start of the file, the new model in the model
652 * list. Remember keep the null ending of the list.
654 /*** Routing model structure ***/
656 // s_routing_component_t generic_routing;
657 // /* things that your routing model need */
658 // } s_routing_component_NEW_t,*routing_component_NEW_t;
660 /*** Parse routing model functions ***/
661 // static void model_NEW_set_processing_unit(routing_component_t rc, const char* name) {}
662 // static void model_NEW_set_autonomous_system(routing_component_t rc, const char* name) {}
663 // static void model_NEW_set_route(routing_component_t rc, const char* src, const char* dst, route_t route) {}
664 // static void model_NEW_set_ASroute(routing_component_t rc, const char* src, const char* dst, route_extended_t route) {}
665 // static void model_NEW_set_bypassroute(routing_component_t rc, const char* src, const char* dst, route_extended_t e_route) {}
667 /*** Business methods ***/
668 // static route_extended_t NEW_get_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
669 // static route_extended_t NEW_get_bypass_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
670 // static void NEW_finalize(routing_component_t rc) { xbt_free(rc);}
672 /*** Creation routing model functions ***/
673 // static void* model_NEW_create(void) {
674 // routing_component_NEW_t new_component = xbt_new0(s_routing_component_NEW_t,1);
675 // new_component->generic_routing.set_processing_unit = model_NEW_set_processing_unit;
676 // new_component->generic_routing.set_autonomous_system = model_NEW_set_autonomous_system;
677 // new_component->generic_routing.set_route = model_NEW_set_route;
678 // new_component->generic_routing.set_ASroute = model_NEW_set_ASroute;
679 // new_component->generic_routing.set_bypassroute = model_NEW_set_bypassroute;
680 // new_component->generic_routing.get_route = NEW_get_route;
681 // new_component->generic_routing.get_bypass_route = NEW_get_bypass_route;
682 // new_component->generic_routing.finalize = NEW_finalize;
683 // /* initialization of internal structures */
684 // return new_component;
686 // static void model_NEW_load(void) {} /* mandatory */
687 // static void model_NEW_unload(void) {} /* mandatory */
688 // static void model_NEW_end(void) {} /* mandatory */
690 /* ************************************************************************** */
691 /* ************************* GENERIC PARSE FUNCTIONS ************************ */
693 void routing_cluster_add_backbone(void* bb) {
694 xbt_assert(current_routing->p_modelDesc == &routing_models[SURF_MODEL_CLUSTER],
695 "You have to be in model Cluster to use tag backbone!");
696 xbt_assert(!static_cast<AsCluster*>(current_routing)->p_backbone, "The backbone link is already defined!");
697 static_cast<AsCluster*>(current_routing)->p_backbone = static_cast<Link*>(bb);
698 XBT_DEBUG("Add a backbone to AS '%s'", current_routing->p_name);
701 static void routing_parse_cabinet(sg_platf_cabinet_cbarg_t cabinet)
704 char *groups , *host_id , *link_id = NULL;
706 xbt_dynar_t radical_elements;
707 xbt_dynar_t radical_ends;
710 radical_elements = xbt_str_split(cabinet->radical, ",");
711 xbt_dynar_foreach(radical_elements, iter, groups) {
713 radical_ends = xbt_str_split(groups, "-");
714 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
716 switch (xbt_dynar_length(radical_ends)) {
721 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
724 surf_parse_error("Malformed radical");
727 s_sg_platf_host_cbarg_t host = SG_PLATF_HOST_INITIALIZER;
728 memset(&host, 0, sizeof(host));
729 host.initial_state = SURF_RESOURCE_ON;
731 host.power_scale = 1.0;
732 host.core_amount = 1;
734 s_sg_platf_link_cbarg_t link = SG_PLATF_LINK_INITIALIZER;
735 memset(&link, 0, sizeof(link));
736 link.state = SURF_RESOURCE_ON;
737 link.policy = SURF_LINK_FULLDUPLEX;
738 link.latency = cabinet->lat;
739 link.bandwidth = cabinet->bw;
741 s_sg_platf_host_link_cbarg_t host_link = SG_PLATF_HOST_LINK_INITIALIZER;
742 memset(&host_link, 0, sizeof(host_link));
744 for (i = start; i <= end; i++) {
745 host_id = bprintf("%s%d%s",cabinet->prefix,i,cabinet->suffix);
746 link_id = bprintf("link_%s%d%s",cabinet->prefix,i,cabinet->suffix);
749 host.power_peak = xbt_dynar_new(sizeof(double), NULL);
750 xbt_dynar_push(host.power_peak,&cabinet->power);
751 sg_platf_new_host(&host);
752 xbt_dynar_free(&host.power_peak);
753 sg_platf_new_link(&link);
755 char* link_up = bprintf("%s_UP",link_id);
756 char* link_down = bprintf("%s_DOWN",link_id);
757 host_link.id = host_id;
758 host_link.link_up = link_up;
759 host_link.link_down = link_down;
760 sg_platf_new_host_link(&host_link);
768 xbt_dynar_free(&radical_ends);
770 xbt_dynar_free(&radical_elements);
773 static void routing_parse_cluster(sg_platf_cluster_cbarg_t cluster)
775 char *host_id, *groups, *link_id = NULL;
776 xbt_dict_t patterns = NULL;
779 s_sg_platf_host_cbarg_t host = SG_PLATF_HOST_INITIALIZER;
780 s_sg_platf_link_cbarg_t link = SG_PLATF_LINK_INITIALIZER;
784 xbt_dynar_t radical_elements;
785 xbt_dynar_t radical_ends;
787 if ((cluster->availability_trace && strcmp(cluster->availability_trace, ""))
788 || (cluster->state_trace && strcmp(cluster->state_trace, ""))) {
789 patterns = xbt_dict_new_homogeneous(xbt_free_f);
790 xbt_dict_set(patterns, "id", xbt_strdup(cluster->id), NULL);
791 xbt_dict_set(patterns, "prefix", xbt_strdup(cluster->prefix), NULL);
792 xbt_dict_set(patterns, "suffix", xbt_strdup(cluster->suffix), NULL);
795 /* parse the topology attribute. If we are not in a flat cluster,
796 * switch to the right mode and initialize the routing with
797 * the parameters in topo_parameters attribute
799 s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
802 if(cluster->topology == SURF_CLUSTER_TORUS){
803 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Torus_Cluster\">", cluster->id);
804 AS.routing = A_surfxml_AS_routing_Cluster___torus;
805 sg_platf_new_AS_begin(&AS);
806 ((AsClusterTorus*)current_routing)->parse_specific_arguments(cluster);
808 else if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
809 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Fat_Tree_Cluster\">", cluster->id);
810 AS.routing = A_surfxml_AS_routing_Cluster___fat___tree;
811 sg_platf_new_AS_begin(&AS);
812 ((AsClusterFatTree*)current_routing)->parse_specific_arguments(cluster);
816 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", cluster->id);
817 AS.routing = A_surfxml_AS_routing_Cluster;
818 sg_platf_new_AS_begin(&AS);
821 if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
822 ((AsCluster*)current_routing)->p_nb_links_per_node++;
823 ((AsCluster*)current_routing)->p_has_loopback=1;
826 if(cluster->limiter_link!=0){
827 ((AsCluster*)current_routing)->p_nb_links_per_node++;
828 ((AsCluster*)current_routing)->p_has_limiter=1;
833 current_routing->p_linkUpDownList
834 = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
837 radical_elements = xbt_str_split(cluster->radical, ",");
838 xbt_dynar_foreach(radical_elements, iter, groups) {
840 radical_ends = xbt_str_split(groups, "-");
841 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
843 switch (xbt_dynar_length(radical_ends)) {
848 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
851 surf_parse_error("Malformed radical");
854 for (i = start; i <= end; i++) {
856 bprintf("%s%d%s", cluster->prefix, i, cluster->suffix);
857 link_id = bprintf("%s_link_%d", cluster->id, i);
859 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\">", host_id, cluster->power);
861 memset(&host, 0, sizeof(host));
863 if ((cluster->properties != NULL) && (!xbt_dict_is_empty(cluster->properties))) {
864 xbt_dict_cursor_t cursor=NULL;
866 host.properties = xbt_dict_new();
868 xbt_dict_foreach(cluster->properties,cursor,key,data) {
869 xbt_dict_set(host.properties, key, xbt_strdup(data),free);
872 if (cluster->availability_trace && strcmp(cluster->availability_trace, "")) {
873 xbt_dict_set(patterns, "radical", bprintf("%d", i), NULL);
874 char *avail_file = xbt_str_varsubst(cluster->availability_trace, patterns);
875 XBT_DEBUG("\tavailability_file=\"%s\"", avail_file);
876 host.power_trace = tmgr_trace_new_from_file(avail_file);
877 xbt_free(avail_file);
879 XBT_DEBUG("\tavailability_file=\"\"");
882 if (cluster->state_trace && strcmp(cluster->state_trace, "")) {
883 char *avail_file = xbt_str_varsubst(cluster->state_trace, patterns);
884 XBT_DEBUG("\tstate_file=\"%s\"", avail_file);
885 host.state_trace = tmgr_trace_new_from_file(avail_file);
886 xbt_free(avail_file);
888 XBT_DEBUG("\tstate_file=\"\"");
891 host.power_peak = xbt_dynar_new(sizeof(double), NULL);
892 xbt_dynar_push(host.power_peak,&cluster->power);
895 //host.power_peak = cluster->power;
896 host.power_scale = 1.0;
897 host.core_amount = cluster->core_amount;
898 host.initial_state = SURF_RESOURCE_ON;
900 sg_platf_new_host(&host);
901 xbt_dynar_free(&host.power_peak);
902 XBT_DEBUG("</host>");
904 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_id,
905 cluster->bw, cluster->lat);
908 s_surf_parsing_link_up_down_t info_lim, info_loop;
909 // All links are saved in a matrix;
910 // every row describes a single node; every node
911 // may have multiple links.
912 // the first column may store a link from x to x if p_has_loopback is set
913 // the second column may store a limiter link if p_has_limiter is set
914 // other columns are to store one or more link for the node
916 //add a loopback link
917 if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
918 char *tmp_link = bprintf("%s_loopback", link_id);
919 XBT_DEBUG("<loopback\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
920 cluster->limiter_link);
923 memset(&link, 0, sizeof(link));
925 link.bandwidth = cluster->loopback_bw;
926 link.latency = cluster->loopback_lat;
927 link.state = SURF_RESOURCE_ON;
928 link.policy = SURF_LINK_FATPIPE;
929 sg_platf_new_link(&link);
930 info_loop.link_up = Link::byName(tmp_link);
931 info_loop.link_down = info_loop.link_up;
933 xbt_dynar_set(current_routing->p_linkUpDownList, rankId*(static_cast<AsCluster*>(current_routing))->p_nb_links_per_node, &info_loop);
936 //add a limiter link (shared link to account for maximal bandwidth of the node)
937 if(cluster->limiter_link!=0){
938 char *tmp_link = bprintf("%s_limiter", link_id);
939 XBT_DEBUG("<limiter\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
940 cluster->limiter_link);
943 memset(&link, 0, sizeof(link));
945 link.bandwidth = cluster->limiter_link;
947 link.state = SURF_RESOURCE_ON;
948 link.policy = SURF_LINK_SHARED;
949 sg_platf_new_link(&link);
950 info_lim.link_up = Link::byName(tmp_link);
951 info_lim.link_down = info_lim.link_up;
953 xbt_dynar_set(current_routing->p_linkUpDownList,
954 rankId*(static_cast<AsCluster*>(current_routing))->p_nb_links_per_node + static_cast<AsCluster*>(current_routing)->p_has_loopback ,
960 //call the cluster function that adds the others links
961 if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
962 ((AsClusterFatTree*) current_routing)->addProcessingNode(i);
965 static_cast<AsCluster*>(current_routing)->create_links_for_node(cluster, i, rankId, rankId*
966 static_cast<AsCluster*>(current_routing)->p_nb_links_per_node
967 + static_cast<AsCluster*>(current_routing)->p_has_loopback
968 + static_cast<AsCluster*>(current_routing)->p_has_limiter );
975 xbt_dynar_free(&radical_ends);
977 xbt_dynar_free(&radical_elements);
979 // For fat trees, the links must be created once all nodes have been added
980 if(cluster->topology == SURF_CLUSTER_FAT_TREE) {
981 static_cast<AsClusterFatTree*>(current_routing)->create_links();
983 // Add a router. It is magically used thanks to the way in which surf_routing_cluster is written,
984 // and it's very useful to connect clusters together
986 XBT_DEBUG("<router id=\"%s\"/>", cluster->router_id);
988 s_sg_platf_router_cbarg_t router = SG_PLATF_ROUTER_INITIALIZER;
989 memset(&router, 0, sizeof(router));
990 router.id = cluster->router_id;
992 if (!router.id || !strcmp(router.id, ""))
994 bprintf("%s%s_router%s", cluster->prefix, cluster->id,
996 sg_platf_new_router(&router);
997 ((AsCluster*)current_routing)->p_router = (RoutingEdge*) xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL);
1001 if ((cluster->bb_bw != 0) || (cluster->bb_lat != 0)) {
1002 char *link_backbone = bprintf("%s_backbone", cluster->id);
1003 XBT_DEBUG("<link\tid=\"%s\" bw=\"%f\" lat=\"%f\"/>", link_backbone,
1004 cluster->bb_bw, cluster->bb_lat);
1006 memset(&link, 0, sizeof(link));
1007 link.id = link_backbone;
1008 link.bandwidth = cluster->bb_bw;
1009 link.latency = cluster->bb_lat;
1010 link.state = SURF_RESOURCE_ON;
1011 link.policy = cluster->bb_sharing_policy;
1013 sg_platf_new_link(&link);
1015 routing_cluster_add_backbone(Link::byName(link_backbone));
1017 free(link_backbone);
1021 sg_platf_new_AS_end();
1023 xbt_dict_free(&patterns); // no op if it were never set
1026 static void routing_parse_postparse(void) {
1027 xbt_dict_free(&random_value);
1030 static void routing_parse_peer(sg_platf_peer_cbarg_t peer)
1032 char *host_id = NULL;
1033 char *link_id = NULL;
1034 char *router_id = NULL;
1037 host_id = HOST_PEER(peer->id);
1038 link_id = LINK_PEER(peer->id);
1039 router_id = ROUTER_PEER(peer->id);
1041 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", peer->id);
1042 s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
1044 AS.routing = A_surfxml_AS_routing_Cluster;
1045 sg_platf_new_AS_begin(&AS);
1047 current_routing->p_linkUpDownList = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
1049 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\"/>", host_id, peer->power);
1050 s_sg_platf_host_cbarg_t host = SG_PLATF_HOST_INITIALIZER;
1051 memset(&host, 0, sizeof(host));
1052 host.initial_state = SURF_RESOURCE_ON;
1055 host.power_peak = xbt_dynar_new(sizeof(double), NULL);
1056 xbt_dynar_push(host.power_peak,&peer->power);
1058 //host.power_peak = peer->power;
1059 host.power_scale = 1.0;
1060 host.power_trace = peer->availability_trace;
1061 host.state_trace = peer->state_trace;
1062 host.core_amount = 1;
1063 sg_platf_new_host(&host);
1064 xbt_dynar_free(&host.power_peak);
1066 s_sg_platf_link_cbarg_t link = SG_PLATF_LINK_INITIALIZER;
1067 memset(&link, 0, sizeof(link));
1068 link.state = SURF_RESOURCE_ON;
1069 link.policy = SURF_LINK_SHARED;
1070 link.latency = peer->lat;
1072 char* link_up = bprintf("%s_UP",link_id);
1073 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_up,
1074 peer->bw_out, peer->lat);
1076 link.bandwidth = peer->bw_out;
1077 sg_platf_new_link(&link);
1079 char* link_down = bprintf("%s_DOWN",link_id);
1080 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_down,
1081 peer->bw_in, peer->lat);
1082 link.id = link_down;
1083 link.bandwidth = peer->bw_in;
1084 sg_platf_new_link(&link);
1086 XBT_DEBUG("<host_link\tid=\"%s\"\tup=\"%s\"\tdown=\"%s\" />", host_id,link_up,link_down);
1087 s_sg_platf_host_link_cbarg_t host_link = SG_PLATF_HOST_LINK_INITIALIZER;
1088 memset(&host_link, 0, sizeof(host_link));
1089 host_link.id = host_id;
1090 host_link.link_up = link_up;
1091 host_link.link_down = link_down;
1092 sg_platf_new_host_link(&host_link);
1094 XBT_DEBUG("<router id=\"%s\"/>", router_id);
1095 s_sg_platf_router_cbarg_t router = SG_PLATF_ROUTER_INITIALIZER;
1096 memset(&router, 0, sizeof(router));
1097 router.id = router_id;
1098 router.coord = peer->coord;
1099 sg_platf_new_router(&router);
1100 static_cast<AsCluster*>(current_routing)->p_router = static_cast<RoutingEdge*>(xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL));
1103 sg_platf_new_AS_end();
1106 //xbt_dynar_free(&tab_elements_num);
1114 // static void routing_parse_Srandom(void)
1116 // double mean, std, min, max, seed;
1117 // char *random_id = A_surfxml_random_id;
1118 // char *random_radical = A_surfxml_random_radical;
1119 // char *rd_name = NULL;
1121 // mean = surf_parse_get_double(A_surfxml_random_mean);
1122 // std = surf_parse_get_double(A_surfxml_random_std___deviation);
1123 // min = surf_parse_get_double(A_surfxml_random_min);
1124 // max = surf_parse_get_double(A_surfxml_random_max);
1125 // seed = surf_parse_get_double(A_surfxml_random_seed);
1129 // random_data_t random = xbt_new0(s_random_data_t, 1);
1132 // xbt_dynar_t radical_elements;
1133 // unsigned int iter;
1136 // xbt_dynar_t radical_ends;
1138 // switch (A_surfxml_random_generator) {
1139 // case AU_surfxml_random_generator:
1140 // case A_surfxml_random_generator_NONE:
1141 // random->generator = NONE;
1143 // case A_surfxml_random_generator_DRAND48:
1144 // random->generator = DRAND48;
1146 // case A_surfxml_random_generator_RAND:
1147 // random->generator = RAND;
1149 // case A_surfxml_random_generator_RNGSTREAM:
1150 // random->generator = RNGSTREAM;
1153 // surf_parse_error("Invalid random generator");
1156 // random->seed = seed;
1157 // random->min = min;
1158 // random->max = max;
1160 // /* Check user stupidities */
1162 // THROWF(arg_error, 0, "random->max < random->min (%f < %f)", max, min);
1164 // THROWF(arg_error, 0, "random->mean < random->min (%f < %f)", mean, min);
1166 // THROWF(arg_error, 0, "random->mean > random->max (%f > %f)", mean, max);
1168 // /* normalize the mean and standard deviation before storing */
1169 // random->mean = (mean - min) / (max - min);
1170 // random->std = std / (max - min);
1172 // if (random->mean * (1 - random->mean) < random->std * random->std)
1173 // THROWF(arg_error, 0, "Invalid mean and standard deviation (%f and %f)",
1174 // random->mean, random->std);
1177 // ("id = '%s' min = '%f' max = '%f' mean = '%f' std_deviatinon = '%f' generator = '%d' seed = '%ld' radical = '%s'",
1178 // random_id, random->min, random->max, random->mean, random->std,
1179 // (int)random->generator, random->seed, random_radical);
1181 // if (!random_value)
1182 // random_value = xbt_dict_new_homogeneous(free);
1184 // if (!strcmp(random_radical, "")) {
1185 // res = random_generate(random);
1186 // rd_value = bprintf("%f", res);
1187 // xbt_dict_set(random_value, random_id, rd_value, NULL);
1189 // radical_elements = xbt_str_split(random_radical, ",");
1190 // xbt_dynar_foreach(radical_elements, iter, groups) {
1191 // radical_ends = xbt_str_split(groups, "-");
1192 // switch (xbt_dynar_length(radical_ends)) {
1194 // xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1195 // "Custom Random '%s' already exists !", random_id);
1196 // res = random_generate(random);
1198 // bprintf("%s%d", random_id,
1199 // atoi(xbt_dynar_getfirst_as(radical_ends, char *)));
1200 // xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1201 // xbt_free(tmpbuf);
1205 // start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
1206 // end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
1207 // for (i = start; i <= end; i++) {
1208 // xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1209 // "Custom Random '%s' already exists !", bprintf("%s%d",
1212 // res = random_generate(random);
1213 // tmpbuf = bprintf("%s%d", random_id, i);
1214 // xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1215 // xbt_free(tmpbuf);
1219 // XBT_CRITICAL("Malformed radical");
1222 // res = random_generate(random);
1223 // rd_name = bprintf("%s_router", random_id);
1224 // rd_value = bprintf("%f", res);
1225 // xbt_dict_set(random_value, rd_name, rd_value, NULL);
1227 // xbt_dynar_free(&radical_ends);
1230 // xbt_dynar_free(&radical_elements);
1234 static void check_disk_attachment()
1236 xbt_lib_cursor_t cursor;
1239 RoutingEdge *host_elm;
1240 xbt_lib_foreach(storage_lib, cursor, key, data) {
1241 if(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL) != NULL) {
1242 Storage *storage = static_cast<Storage*>(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL));
1243 host_elm = sg_routing_edge_by_name_or_null(storage->p_attach);
1245 surf_parse_error("Unable to attach storage %s: host %s doesn't exist.", storage->getName(), storage->p_attach);
1250 void routing_register_callbacks()
1252 sg_platf_host_link_add_cb(parse_S_host);
1253 sg_platf_route_add_cb(parse_E_route);
1254 sg_platf_ASroute_add_cb(parse_E_ASroute);
1255 sg_platf_bypassRoute_add_cb(parse_E_bypassRoute);
1256 sg_platf_bypassASroute_add_cb(parse_E_bypassASroute);
1258 sg_platf_cluster_add_cb(routing_parse_cluster);
1259 sg_platf_cabinet_add_cb(routing_parse_cabinet);
1261 sg_platf_peer_add_cb(routing_parse_peer);
1262 sg_platf_postparse_add_cb(routing_parse_postparse);
1263 sg_platf_postparse_add_cb(check_disk_attachment);
1265 /* we care about the ASes while parsing the platf. Incredible, isnt it? */
1266 sg_platf_AS_end_add_cb(routing_AS_end);
1267 sg_platf_AS_begin_add_cb(routing_AS_begin);
1269 sg_platf_trace_add_cb(routing_parse_trace);
1270 sg_platf_trace_connect_add_cb(routing_parse_trace_connect);
1272 instr_routing_define_callbacks();
1276 * \brief Recursive function for finalize
1278 * \param rc the source host name
1280 * This fuction is call by "finalize". It allow to finalize the
1281 * AS or routing components. It delete all the structures.
1283 static void finalize_rec(As *as) {
1284 xbt_dict_cursor_t cursor = NULL;
1288 xbt_dict_foreach(as->p_routingSons, cursor, key, elem) {
1295 /** \brief Frees all memory allocated by the routing module */
1296 void routing_exit(void) {
1297 delete routing_platf;
1300 RoutingPlatf::~RoutingPlatf()
1302 xbt_dynar_free(&p_lastRoute);
1303 finalize_rec(p_root);
1306 AS_t surf_AS_get_routing_root() {
1307 return routing_platf->p_root;
1310 const char *surf_AS_get_name(As *as) {
1314 static As *surf_AS_recursive_get_by_name(As *current, const char * name) {
1315 xbt_dict_cursor_t cursor = NULL;
1320 if(!strcmp(current->p_name, name))
1323 xbt_dict_foreach(current->p_routingSons, cursor, key, elem) {
1324 tmp = surf_AS_recursive_get_by_name(elem, name);
1333 As *surf_AS_get_by_name(const char * name) {
1334 As *as = surf_AS_recursive_get_by_name(routing_platf->p_root, name);
1336 XBT_WARN("Impossible to find an AS with name %s, please check your input", name);
1340 xbt_dict_t surf_AS_get_routing_sons(As *as) {
1341 return as->p_routingSons;
1344 const char *surf_AS_get_model(As *as) {
1345 return as->p_modelDesc->name;
1348 xbt_dynar_t surf_AS_get_hosts(As *as) {
1349 xbt_dynar_t elms = as->p_indexNetworkElm;
1350 sg_routing_edge_t relm;
1353 int count = xbt_dynar_length(elms);
1354 xbt_dynar_t res = xbt_dynar_new(sizeof(xbt_dictelm_t), NULL);
1355 for (index = 0; index < count; index++) {
1356 relm = xbt_dynar_get_as(elms, index, RoutingEdge*);
1357 delm = xbt_lib_get_elm_or_null(host_lib, relm->getName());
1359 xbt_dynar_push(res, &delm);
1365 void surf_AS_get_graph(AS_t as, xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges) {
1366 as->getGraph(graph, nodes, edges);