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;
24 surf_callback(void, As*) asCreatedCallbacks;
27 * @ingroup SURF_build_api
28 * @brief A library containing all known hosts
32 int SURF_HOST_LEVEL; //Surf host level
33 int COORD_HOST_LEVEL=0; //Coordinates level
34 int NS3_HOST_LEVEL; //host node for ns3
36 int MSG_FILE_LEVEL; //Msg file level
38 int SIMIX_STORAGE_LEVEL; //Simix storage level
39 int MSG_STORAGE_LEVEL; //Msg storage level
40 int SD_STORAGE_LEVEL; //Simdag storage level
42 xbt_lib_t as_router_lib;
43 int ROUTING_ASR_LEVEL; //Routing level
44 int COORD_ASR_LEVEL; //Coordinates level
45 int NS3_ASR_LEVEL; //host node for ns3
46 int ROUTING_PROP_ASR_LEVEL; //Where the properties are stored
48 static xbt_dict_t random_value = NULL;
51 /** @brief Retrieve a routing edge from its name
53 * Routing edges are either host and routers, whatever
55 RoutingEdge *sg_routing_edge_by_name_or_null(const char *name) {
56 sg_host_t h = sg_host_by_name(name);
57 RoutingEdge *net_elm = h==NULL?NULL: sg_host_edge(h);
59 net_elm = (RoutingEdge*) xbt_lib_get_or_null(as_router_lib, name, ROUTING_ASR_LEVEL);
64 RoutingPlatf *routing_platf = NULL;
66 /* global parse functions */
67 extern xbt_dynar_t mount_list;
69 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route, surf, "Routing part of surf");
71 /** The current AS in the parsing */
72 static As *current_routing = NULL;
73 As* routing_get_current()
75 return current_routing;
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 void sg_platf_new_host_link(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 /* set the new current component of the tree */
379 current_routing = new_as;
380 current_routing->p_netElem = info;
382 routingEdgeCreatedCallbacks(info);
383 asCreatedCallbacks(new_as);
387 * \brief Specify that the current description of AS is finished
389 * Once you've declared all the content of your AS, you have to close
390 * it with this call. Your AS is not usable until you call this function.
392 * @fixme: this call is not as robust as wanted: bad things WILL happen
393 * if you call it twice for the same AS, or if you forget calling it, or
394 * even if you add stuff to a closed AS
397 void routing_AS_end()
400 if (current_routing == NULL) {
401 THROWF(arg_error, 0, "Close an AS, but none was under construction");
403 if (current_routing->p_modelDesc->end)
404 current_routing->p_modelDesc->end(current_routing);
405 current_routing = current_routing->p_routingFather;
409 /* Aux Business methods */
412 * \brief Get the AS father and the first elements of the chain
414 * \param src the source host name
415 * \param dst the destination host name
417 * Get the common father of the to processing units, and the first different
418 * father in the chain
420 static void elements_father(sg_routing_edge_t src, sg_routing_edge_t dst,
425 xbt_assert(src && dst, "bad parameters for \"elements_father\" method");
426 #define ELEMENTS_FATHER_MAXDEPTH 16 /* increase if it is not enough */
428 As *path_src[ELEMENTS_FATHER_MAXDEPTH];
429 As *path_dst[ELEMENTS_FATHER_MAXDEPTH];
437 /* (1) find the as where the src and dst are located */
438 sg_routing_edge_t src_data = src;
439 sg_routing_edge_t dst_data = dst;
440 src_as = src_data->getRcComponent();
441 dst_as = dst_data->getRcComponent();
443 char* src_name = src_data->getName();
444 char* dst_name = dst_data->getName();
447 xbt_assert(src_as && dst_as,
448 "Ask for route \"from\"(%s) or \"to\"(%s) no found", src_name, dst_name);
450 /* (2) find the path to the root routing component */
451 for (current = src_as; current != NULL; current = current->p_routingFather) {
452 if (index_src >= ELEMENTS_FATHER_MAXDEPTH)
453 xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_src");
454 path_src[index_src++] = current;
456 for (current = dst_as; current != NULL; current = current->p_routingFather) {
457 if (index_dst >= ELEMENTS_FATHER_MAXDEPTH)
458 xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_dst");
459 path_dst[index_dst++] = current;
462 /* (3) find the common father */
464 current_src = path_src[--index_src];
465 current_dst = path_dst[--index_dst];
466 } while (index_src > 0 && index_dst > 0 && current_src == current_dst);
468 /* (4) they are not in the same routing component, make the path */
469 if (current_src == current_dst)
470 father = current_src;
472 father = path_src[index_src + 1];
474 /* (5) result generation */
475 *res_father = father; /* first the common father of src and dst */
476 *res_src = current_src; /* second the first different father of src */
477 *res_dst = current_dst; /* three the first different father of dst */
479 #undef ELEMENTS_FATHER_MAXDEPTH
482 /* Global Business methods */
485 * \brief Recursive function for get_route_latency
487 * \param src the source host name
488 * \param dst the destination host name
489 * \param *route the route where the links are stored. It is either NULL or a ready to use dynar
490 * \param *latency the latency, if needed
492 * This function is called by "get_route" and "get_latency". It allows to walk
493 * recursively through the ASes tree.
495 static void _get_route_and_latency(RoutingEdge *src, RoutingEdge *dst,
496 xbt_dynar_t * links, double *latency)
498 s_sg_platf_route_cbarg_t route = SG_PLATF_ROUTE_INITIALIZER;
499 memset(&route,0,sizeof(route));
501 xbt_assert(src && dst, "bad parameters for \"_get_route_latency\" method");
502 XBT_DEBUG("Solve route/latency \"%s\" to \"%s\"", src->getName(), dst->getName());
504 /* Find how src and dst are interconnected */
505 As *common_father, *src_father, *dst_father;
506 elements_father(src, dst, &common_father, &src_father, &dst_father);
507 XBT_DEBUG("elements_father: common father '%s' src_father '%s' dst_father '%s'",
508 common_father->p_name, src_father->p_name, dst_father->p_name);
510 /* Check whether a direct bypass is defined */
511 sg_platf_route_cbarg_t e_route_bypass = NULL;
512 //FIXME:REMOVE:if (common_father->get_bypass_route)
514 e_route_bypass = common_father->getBypassRoute(src, dst, latency);
516 /* Common ancestor is kind enough to declare a bypass route from src to dst -- use it and bail out */
517 if (e_route_bypass) {
518 xbt_dynar_merge(links, &e_route_bypass->link_list);
519 generic_free_route(e_route_bypass);
523 /* If src and dst are in the same AS, life is good */
524 if (src_father == dst_father) { /* SURF_ROUTING_BASE */
525 route.link_list = *links;
526 common_father->getRouteAndLatency(src, dst, &route, latency);
527 // if vivaldi latency+=vivaldi(src,dst)
531 /* Not in the same AS, no bypass. We'll have to find our path between the ASes recursively*/
533 route.link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
534 // Find the net_card corresponding to father
535 RoutingEdge *src_father_net_elm = src_father->p_netElem;
536 RoutingEdge *dst_father_net_elm = dst_father->p_netElem;
538 common_father->getRouteAndLatency(src_father_net_elm, dst_father_net_elm,
541 xbt_assert((route.gw_src != NULL) && (route.gw_dst != NULL),
542 "bad gateways for route from \"%s\" to \"%s\"", src->getName(), dst->getName());
544 sg_routing_edge_t src_gateway_net_elm = route.gw_src;
545 sg_routing_edge_t dst_gateway_net_elm = route.gw_dst;
547 /* If source gateway is not our source, we have to recursively find our way up to this point */
548 if (src != src_gateway_net_elm)
549 _get_route_and_latency(src, src_gateway_net_elm, links, latency);
550 xbt_dynar_merge(links, &route.link_list);
552 /* If dest gateway is not our destination, we have to recursively find our way from this point */
553 if (dst_gateway_net_elm != dst)
554 _get_route_and_latency(dst_gateway_net_elm, dst, links, latency);
556 // if vivaldi latency+=vivaldi(src_gateway,dst_gateway)
559 AS_t surf_platf_get_root(routing_platf_t platf){
560 return platf->p_root;
563 e_surf_network_element_type_t surf_routing_edge_get_rc_type(sg_routing_edge_t edge){
564 return edge->getRcType();
569 * \brief Find a route between hosts
571 * \param src the network_element_t for src host
572 * \param dst the network_element_t for dst host
573 * \param route where to store the list of links.
574 * If *route=NULL, create a short lived dynar. Else, fill the provided dynar
575 * \param latency where to store the latency experienced on the path (or NULL if not interested)
576 * It is the caller responsability to initialize latency to 0 (we add to provided route)
579 * walk through the routing components tree and find a route between hosts
580 * by calling the differents "get_route" functions in each routing component.
582 void RoutingPlatf::getRouteAndLatency(RoutingEdge *src, RoutingEdge *dst,
583 xbt_dynar_t* route, double *latency)
585 XBT_DEBUG("routing_get_route_and_latency from %s to %s", src->getName(), dst->getName());
587 xbt_dynar_reset(routing_platf->p_lastRoute);
588 *route = routing_platf->p_lastRoute;
591 _get_route_and_latency(src, dst, route, latency);
593 xbt_assert(!latency || *latency >= 0.0,
594 "negative latency on route between \"%s\" and \"%s\"", src->getName(), dst->getName());
597 xbt_dynar_t RoutingPlatf::getOneLinkRoutes(){
598 return recursiveGetOneLinkRoutes(p_root);
601 xbt_dynar_t RoutingPlatf::recursiveGetOneLinkRoutes(As *rc)
603 xbt_dynar_t ret = xbt_dynar_new(sizeof(Onelink*), xbt_free_f);
605 //adding my one link routes
606 xbt_dynar_t onelink_mine = rc->getOneLinkRoutes();
608 xbt_dynar_merge(&ret,&onelink_mine);
612 xbt_dict_cursor_t cursor = NULL;
614 xbt_dict_foreach(rc->p_routingSons, cursor, key, rc_child) {
615 xbt_dynar_t onelink_child = recursiveGetOneLinkRoutes(rc_child);
617 xbt_dynar_merge(&ret,&onelink_child);
622 e_surf_network_element_type_t routing_get_network_element_type(const char *name)
624 RoutingEdge *rc = sg_routing_edge_by_name_or_null(name);
626 return rc->getRcType();
628 return SURF_NETWORK_ELEMENT_NULL;
632 * \brief Generic method: create the global routing schema
634 * Make a global routing structure and set all the parsing functions.
636 void routing_model_create( void *loopback)
638 /* config the uniq global routing */
639 routing_platf = new RoutingPlatf();
640 routing_platf->p_root = NULL;
641 routing_platf->p_loopback = loopback;
642 routing_platf->p_lastRoute = xbt_dynar_new(sizeof(sg_routing_link_t),NULL);
643 /* no current routing at moment */
644 current_routing = NULL;
648 /* ************************************************** */
649 /* ********** PATERN FOR NEW ROUTING **************** */
651 /* The minimal configuration of a new routing model need the next functions,
652 * also you need to set at the start of the file, the new model in the model
653 * list. Remember keep the null ending of the list.
655 /*** Routing model structure ***/
657 // s_routing_component_t generic_routing;
658 // /* things that your routing model need */
659 // } s_routing_component_NEW_t,*routing_component_NEW_t;
661 /*** Parse routing model functions ***/
662 // static void model_NEW_set_processing_unit(routing_component_t rc, const char* name) {}
663 // static void model_NEW_set_autonomous_system(routing_component_t rc, const char* name) {}
664 // static void model_NEW_set_route(routing_component_t rc, const char* src, const char* dst, route_t route) {}
665 // static void model_NEW_set_ASroute(routing_component_t rc, const char* src, const char* dst, route_extended_t route) {}
666 // static void model_NEW_set_bypassroute(routing_component_t rc, const char* src, const char* dst, route_extended_t e_route) {}
668 /*** Business methods ***/
669 // static route_extended_t NEW_get_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
670 // static route_extended_t NEW_get_bypass_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
671 // static void NEW_finalize(routing_component_t rc) { xbt_free(rc);}
673 /*** Creation routing model functions ***/
674 // static void* model_NEW_create(void) {
675 // routing_component_NEW_t new_component = xbt_new0(s_routing_component_NEW_t,1);
676 // new_component->generic_routing.set_processing_unit = model_NEW_set_processing_unit;
677 // new_component->generic_routing.set_autonomous_system = model_NEW_set_autonomous_system;
678 // new_component->generic_routing.set_route = model_NEW_set_route;
679 // new_component->generic_routing.set_ASroute = model_NEW_set_ASroute;
680 // new_component->generic_routing.set_bypassroute = model_NEW_set_bypassroute;
681 // new_component->generic_routing.get_route = NEW_get_route;
682 // new_component->generic_routing.get_bypass_route = NEW_get_bypass_route;
683 // new_component->generic_routing.finalize = NEW_finalize;
684 // /* initialization of internal structures */
685 // return new_component;
687 // static void model_NEW_load(void) {} /* mandatory */
688 // static void model_NEW_unload(void) {} /* mandatory */
689 // static void model_NEW_end(void) {} /* mandatory */
691 /* ************************************************************************** */
692 /* ************************* GENERIC PARSE FUNCTIONS ************************ */
694 void routing_cluster_add_backbone(void* bb) {
695 xbt_assert(current_routing->p_modelDesc == &routing_models[SURF_MODEL_CLUSTER],
696 "You have to be in model Cluster to use tag backbone!");
697 xbt_assert(!static_cast<AsCluster*>(current_routing)->p_backbone, "The backbone link is already defined!");
698 static_cast<AsCluster*>(current_routing)->p_backbone = static_cast<Link*>(bb);
699 XBT_DEBUG("Add a backbone to AS '%s'", current_routing->p_name);
702 static void routing_parse_cabinet(sg_platf_cabinet_cbarg_t cabinet)
705 char *groups , *host_id , *link_id = NULL;
707 xbt_dynar_t radical_elements;
708 xbt_dynar_t radical_ends;
711 radical_elements = xbt_str_split(cabinet->radical, ",");
712 xbt_dynar_foreach(radical_elements, iter, groups) {
714 radical_ends = xbt_str_split(groups, "-");
715 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
717 switch (xbt_dynar_length(radical_ends)) {
722 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
725 surf_parse_error("Malformed radical");
728 s_sg_platf_host_cbarg_t host = SG_PLATF_HOST_INITIALIZER;
729 memset(&host, 0, sizeof(host));
730 host.initial_state = SURF_RESOURCE_ON;
732 host.power_scale = 1.0;
733 host.core_amount = 1;
735 s_sg_platf_link_cbarg_t link = SG_PLATF_LINK_INITIALIZER;
736 memset(&link, 0, sizeof(link));
737 link.state = SURF_RESOURCE_ON;
738 link.policy = SURF_LINK_FULLDUPLEX;
739 link.latency = cabinet->lat;
740 link.bandwidth = cabinet->bw;
742 s_sg_platf_host_link_cbarg_t host_link = SG_PLATF_HOST_LINK_INITIALIZER;
743 memset(&host_link, 0, sizeof(host_link));
745 for (i = start; i <= end; i++) {
746 host_id = bprintf("%s%d%s",cabinet->prefix,i,cabinet->suffix);
747 link_id = bprintf("link_%s%d%s",cabinet->prefix,i,cabinet->suffix);
750 host.power_peak = xbt_dynar_new(sizeof(double), NULL);
751 xbt_dynar_push(host.power_peak,&cabinet->power);
752 sg_platf_new_host(&host);
753 xbt_dynar_free(&host.power_peak);
754 sg_platf_new_link(&link);
756 char* link_up = bprintf("%s_UP",link_id);
757 char* link_down = bprintf("%s_DOWN",link_id);
758 host_link.id = host_id;
759 host_link.link_up = link_up;
760 host_link.link_down = link_down;
761 sg_platf_new_host_link(&host_link);
769 xbt_dynar_free(&radical_ends);
771 xbt_dynar_free(&radical_elements);
774 static void routing_parse_cluster(sg_platf_cluster_cbarg_t cluster)
776 char *host_id, *groups, *link_id = NULL;
777 xbt_dict_t patterns = NULL;
780 s_sg_platf_host_cbarg_t host = SG_PLATF_HOST_INITIALIZER;
781 s_sg_platf_link_cbarg_t link = SG_PLATF_LINK_INITIALIZER;
785 xbt_dynar_t radical_elements;
786 xbt_dynar_t radical_ends;
788 if ((cluster->availability_trace && strcmp(cluster->availability_trace, ""))
789 || (cluster->state_trace && strcmp(cluster->state_trace, ""))) {
790 patterns = xbt_dict_new_homogeneous(xbt_free_f);
791 xbt_dict_set(patterns, "id", xbt_strdup(cluster->id), NULL);
792 xbt_dict_set(patterns, "prefix", xbt_strdup(cluster->prefix), NULL);
793 xbt_dict_set(patterns, "suffix", xbt_strdup(cluster->suffix), NULL);
796 /* parse the topology attribute. If we are not in a flat cluster,
797 * switch to the right mode and initialize the routing with
798 * the parameters in topo_parameters attribute
800 s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
803 if(cluster->topology == SURF_CLUSTER_TORUS){
804 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Torus_Cluster\">", cluster->id);
805 AS.routing = A_surfxml_AS_routing_Cluster___torus;
806 sg_platf_new_AS_begin(&AS);
807 ((AsClusterTorus*)current_routing)->parse_specific_arguments(cluster);
809 else if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
810 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Fat_Tree_Cluster\">", cluster->id);
811 AS.routing = A_surfxml_AS_routing_Cluster___fat___tree;
812 sg_platf_new_AS_begin(&AS);
813 ((AsClusterFatTree*)current_routing)->parse_specific_arguments(cluster);
817 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", cluster->id);
818 AS.routing = A_surfxml_AS_routing_Cluster;
819 sg_platf_new_AS_begin(&AS);
822 if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
823 ((AsCluster*)current_routing)->p_nb_links_per_node++;
824 ((AsCluster*)current_routing)->p_has_loopback=1;
827 if(cluster->limiter_link!=0){
828 ((AsCluster*)current_routing)->p_nb_links_per_node++;
829 ((AsCluster*)current_routing)->p_has_limiter=1;
834 current_routing->p_linkUpDownList
835 = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
838 radical_elements = xbt_str_split(cluster->radical, ",");
839 xbt_dynar_foreach(radical_elements, iter, groups) {
841 radical_ends = xbt_str_split(groups, "-");
842 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
844 switch (xbt_dynar_length(radical_ends)) {
849 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
852 surf_parse_error("Malformed radical");
855 for (i = start; i <= end; i++) {
857 bprintf("%s%d%s", cluster->prefix, i, cluster->suffix);
858 link_id = bprintf("%s_link_%d", cluster->id, i);
860 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\">", host_id, cluster->power);
862 memset(&host, 0, sizeof(host));
864 if ((cluster->properties != NULL) && (!xbt_dict_is_empty(cluster->properties))) {
865 xbt_dict_cursor_t cursor=NULL;
867 host.properties = xbt_dict_new();
869 xbt_dict_foreach(cluster->properties,cursor,key,data) {
870 xbt_dict_set(host.properties, key, xbt_strdup(data),free);
873 if (cluster->availability_trace && strcmp(cluster->availability_trace, "")) {
874 xbt_dict_set(patterns, "radical", bprintf("%d", i), NULL);
875 char *avail_file = xbt_str_varsubst(cluster->availability_trace, patterns);
876 XBT_DEBUG("\tavailability_file=\"%s\"", avail_file);
877 host.power_trace = tmgr_trace_new_from_file(avail_file);
878 xbt_free(avail_file);
880 XBT_DEBUG("\tavailability_file=\"\"");
883 if (cluster->state_trace && strcmp(cluster->state_trace, "")) {
884 char *avail_file = xbt_str_varsubst(cluster->state_trace, patterns);
885 XBT_DEBUG("\tstate_file=\"%s\"", avail_file);
886 host.state_trace = tmgr_trace_new_from_file(avail_file);
887 xbt_free(avail_file);
889 XBT_DEBUG("\tstate_file=\"\"");
892 host.power_peak = xbt_dynar_new(sizeof(double), NULL);
893 xbt_dynar_push(host.power_peak,&cluster->power);
896 //host.power_peak = cluster->power;
897 host.power_scale = 1.0;
898 host.core_amount = cluster->core_amount;
899 host.initial_state = SURF_RESOURCE_ON;
901 sg_platf_new_host(&host);
902 xbt_dynar_free(&host.power_peak);
903 XBT_DEBUG("</host>");
905 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_id,
906 cluster->bw, cluster->lat);
909 s_surf_parsing_link_up_down_t info_lim, info_loop;
910 // All links are saved in a matrix;
911 // every row describes a single node; every node
912 // may have multiple links.
913 // the first column may store a link from x to x if p_has_loopback is set
914 // the second column may store a limiter link if p_has_limiter is set
915 // other columns are to store one or more link for the node
917 //add a loopback link
918 if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
919 char *tmp_link = bprintf("%s_loopback", link_id);
920 XBT_DEBUG("<loopback\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
921 cluster->limiter_link);
924 memset(&link, 0, sizeof(link));
926 link.bandwidth = cluster->loopback_bw;
927 link.latency = cluster->loopback_lat;
928 link.state = SURF_RESOURCE_ON;
929 link.policy = SURF_LINK_FATPIPE;
930 sg_platf_new_link(&link);
931 info_loop.link_up = Link::byName(tmp_link);
932 info_loop.link_down = info_loop.link_up;
934 xbt_dynar_set(current_routing->p_linkUpDownList, rankId*(static_cast<AsCluster*>(current_routing))->p_nb_links_per_node, &info_loop);
937 //add a limiter link (shared link to account for maximal bandwidth of the node)
938 if(cluster->limiter_link!=0){
939 char *tmp_link = bprintf("%s_limiter", link_id);
940 XBT_DEBUG("<limiter\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
941 cluster->limiter_link);
944 memset(&link, 0, sizeof(link));
946 link.bandwidth = cluster->limiter_link;
948 link.state = SURF_RESOURCE_ON;
949 link.policy = SURF_LINK_SHARED;
950 sg_platf_new_link(&link);
951 info_lim.link_up = Link::byName(tmp_link);
952 info_lim.link_down = info_lim.link_up;
954 xbt_dynar_set(current_routing->p_linkUpDownList,
955 rankId*(static_cast<AsCluster*>(current_routing))->p_nb_links_per_node + static_cast<AsCluster*>(current_routing)->p_has_loopback ,
961 //call the cluster function that adds the others links
962 if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
963 ((AsClusterFatTree*) current_routing)->addProcessingNode(i);
966 static_cast<AsCluster*>(current_routing)->create_links_for_node(cluster, i, rankId, rankId*
967 static_cast<AsCluster*>(current_routing)->p_nb_links_per_node
968 + static_cast<AsCluster*>(current_routing)->p_has_loopback
969 + static_cast<AsCluster*>(current_routing)->p_has_limiter );
976 xbt_dynar_free(&radical_ends);
978 xbt_dynar_free(&radical_elements);
980 // For fat trees, the links must be created once all nodes have been added
981 if(cluster->topology == SURF_CLUSTER_FAT_TREE) {
982 static_cast<AsClusterFatTree*>(current_routing)->create_links();
984 // Add a router. It is magically used thanks to the way in which surf_routing_cluster is written,
985 // and it's very useful to connect clusters together
987 XBT_DEBUG("<router id=\"%s\"/>", cluster->router_id);
989 s_sg_platf_router_cbarg_t router = SG_PLATF_ROUTER_INITIALIZER;
990 memset(&router, 0, sizeof(router));
991 router.id = cluster->router_id;
993 if (!router.id || !strcmp(router.id, ""))
995 bprintf("%s%s_router%s", cluster->prefix, cluster->id,
997 sg_platf_new_router(&router);
998 ((AsCluster*)current_routing)->p_router = (RoutingEdge*) xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL);
1002 if ((cluster->bb_bw != 0) || (cluster->bb_lat != 0)) {
1003 char *link_backbone = bprintf("%s_backbone", cluster->id);
1004 XBT_DEBUG("<link\tid=\"%s\" bw=\"%f\" lat=\"%f\"/>", link_backbone,
1005 cluster->bb_bw, cluster->bb_lat);
1007 memset(&link, 0, sizeof(link));
1008 link.id = link_backbone;
1009 link.bandwidth = cluster->bb_bw;
1010 link.latency = cluster->bb_lat;
1011 link.state = SURF_RESOURCE_ON;
1012 link.policy = cluster->bb_sharing_policy;
1014 sg_platf_new_link(&link);
1016 routing_cluster_add_backbone(Link::byName(link_backbone));
1018 free(link_backbone);
1022 sg_platf_new_AS_end();
1024 xbt_dict_free(&patterns); // no op if it were never set
1027 static void routing_parse_postparse(void) {
1028 xbt_dict_free(&random_value);
1031 void sg_platf_new_peer(sg_platf_peer_cbarg_t peer)
1033 char *host_id = NULL;
1034 char *link_id = NULL;
1035 char *router_id = NULL;
1038 host_id = HOST_PEER(peer->id);
1039 link_id = LINK_PEER(peer->id);
1040 router_id = ROUTER_PEER(peer->id);
1042 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", peer->id);
1043 s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
1045 AS.routing = A_surfxml_AS_routing_Cluster;
1046 sg_platf_new_AS_begin(&AS);
1048 current_routing->p_linkUpDownList = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
1050 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\"/>", host_id, peer->power);
1051 s_sg_platf_host_cbarg_t host = SG_PLATF_HOST_INITIALIZER;
1052 memset(&host, 0, sizeof(host));
1053 host.initial_state = SURF_RESOURCE_ON;
1056 host.power_peak = xbt_dynar_new(sizeof(double), NULL);
1057 xbt_dynar_push(host.power_peak,&peer->power);
1059 //host.power_peak = peer->power;
1060 host.power_scale = 1.0;
1061 host.power_trace = peer->availability_trace;
1062 host.state_trace = peer->state_trace;
1063 host.core_amount = 1;
1064 sg_platf_new_host(&host);
1065 xbt_dynar_free(&host.power_peak);
1067 s_sg_platf_link_cbarg_t link = SG_PLATF_LINK_INITIALIZER;
1068 memset(&link, 0, sizeof(link));
1069 link.state = SURF_RESOURCE_ON;
1070 link.policy = SURF_LINK_SHARED;
1071 link.latency = peer->lat;
1073 char* link_up = bprintf("%s_UP",link_id);
1074 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_up,
1075 peer->bw_out, peer->lat);
1077 link.bandwidth = peer->bw_out;
1078 sg_platf_new_link(&link);
1080 char* link_down = bprintf("%s_DOWN",link_id);
1081 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_down,
1082 peer->bw_in, peer->lat);
1083 link.id = link_down;
1084 link.bandwidth = peer->bw_in;
1085 sg_platf_new_link(&link);
1087 XBT_DEBUG("<host_link\tid=\"%s\"\tup=\"%s\"\tdown=\"%s\" />", host_id,link_up,link_down);
1088 s_sg_platf_host_link_cbarg_t host_link = SG_PLATF_HOST_LINK_INITIALIZER;
1089 memset(&host_link, 0, sizeof(host_link));
1090 host_link.id = host_id;
1091 host_link.link_up = link_up;
1092 host_link.link_down = link_down;
1093 sg_platf_new_host_link(&host_link);
1095 XBT_DEBUG("<router id=\"%s\"/>", router_id);
1096 s_sg_platf_router_cbarg_t router = SG_PLATF_ROUTER_INITIALIZER;
1097 memset(&router, 0, sizeof(router));
1098 router.id = router_id;
1099 router.coord = peer->coord;
1100 sg_platf_new_router(&router);
1101 static_cast<AsCluster*>(current_routing)->p_router = static_cast<RoutingEdge*>(xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL));
1104 sg_platf_new_AS_end();
1107 //xbt_dynar_free(&tab_elements_num);
1115 // static void routing_parse_Srandom(void)
1117 // double mean, std, min, max, seed;
1118 // char *random_id = A_surfxml_random_id;
1119 // char *random_radical = A_surfxml_random_radical;
1120 // char *rd_name = NULL;
1122 // mean = surf_parse_get_double(A_surfxml_random_mean);
1123 // std = surf_parse_get_double(A_surfxml_random_std___deviation);
1124 // min = surf_parse_get_double(A_surfxml_random_min);
1125 // max = surf_parse_get_double(A_surfxml_random_max);
1126 // seed = surf_parse_get_double(A_surfxml_random_seed);
1130 // random_data_t random = xbt_new0(s_random_data_t, 1);
1133 // xbt_dynar_t radical_elements;
1134 // unsigned int iter;
1137 // xbt_dynar_t radical_ends;
1139 // switch (A_surfxml_random_generator) {
1140 // case AU_surfxml_random_generator:
1141 // case A_surfxml_random_generator_NONE:
1142 // random->generator = NONE;
1144 // case A_surfxml_random_generator_DRAND48:
1145 // random->generator = DRAND48;
1147 // case A_surfxml_random_generator_RAND:
1148 // random->generator = RAND;
1150 // case A_surfxml_random_generator_RNGSTREAM:
1151 // random->generator = RNGSTREAM;
1154 // surf_parse_error("Invalid random generator");
1157 // random->seed = seed;
1158 // random->min = min;
1159 // random->max = max;
1161 // /* Check user stupidities */
1163 // THROWF(arg_error, 0, "random->max < random->min (%f < %f)", max, min);
1165 // THROWF(arg_error, 0, "random->mean < random->min (%f < %f)", mean, min);
1167 // THROWF(arg_error, 0, "random->mean > random->max (%f > %f)", mean, max);
1169 // /* normalize the mean and standard deviation before storing */
1170 // random->mean = (mean - min) / (max - min);
1171 // random->std = std / (max - min);
1173 // if (random->mean * (1 - random->mean) < random->std * random->std)
1174 // THROWF(arg_error, 0, "Invalid mean and standard deviation (%f and %f)",
1175 // random->mean, random->std);
1178 // ("id = '%s' min = '%f' max = '%f' mean = '%f' std_deviatinon = '%f' generator = '%d' seed = '%ld' radical = '%s'",
1179 // random_id, random->min, random->max, random->mean, random->std,
1180 // (int)random->generator, random->seed, random_radical);
1182 // if (!random_value)
1183 // random_value = xbt_dict_new_homogeneous(free);
1185 // if (!strcmp(random_radical, "")) {
1186 // res = random_generate(random);
1187 // rd_value = bprintf("%f", res);
1188 // xbt_dict_set(random_value, random_id, rd_value, NULL);
1190 // radical_elements = xbt_str_split(random_radical, ",");
1191 // xbt_dynar_foreach(radical_elements, iter, groups) {
1192 // radical_ends = xbt_str_split(groups, "-");
1193 // switch (xbt_dynar_length(radical_ends)) {
1195 // xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1196 // "Custom Random '%s' already exists !", random_id);
1197 // res = random_generate(random);
1199 // bprintf("%s%d", random_id,
1200 // atoi(xbt_dynar_getfirst_as(radical_ends, char *)));
1201 // xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1202 // xbt_free(tmpbuf);
1206 // start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
1207 // end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
1208 // for (i = start; i <= end; i++) {
1209 // xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1210 // "Custom Random '%s' already exists !", bprintf("%s%d",
1213 // res = random_generate(random);
1214 // tmpbuf = bprintf("%s%d", random_id, i);
1215 // xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1216 // xbt_free(tmpbuf);
1220 // XBT_CRITICAL("Malformed radical");
1223 // res = random_generate(random);
1224 // rd_name = bprintf("%s_router", random_id);
1225 // rd_value = bprintf("%f", res);
1226 // xbt_dict_set(random_value, rd_name, rd_value, NULL);
1228 // xbt_dynar_free(&radical_ends);
1231 // xbt_dynar_free(&radical_elements);
1235 static void check_disk_attachment()
1237 xbt_lib_cursor_t cursor;
1240 RoutingEdge *host_elm;
1241 xbt_lib_foreach(storage_lib, cursor, key, data) {
1242 if(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL) != NULL) {
1243 Storage *storage = static_cast<Storage*>(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL));
1244 host_elm = sg_routing_edge_by_name_or_null(storage->p_attach);
1246 surf_parse_error("Unable to attach storage %s: host %s doesn't exist.", storage->getName(), storage->p_attach);
1251 void routing_register_callbacks()
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_postparse_add_cb(routing_parse_postparse);
1262 sg_platf_postparse_add_cb(check_disk_attachment);
1264 sg_platf_trace_add_cb(routing_parse_trace);
1265 sg_platf_trace_connect_add_cb(routing_parse_trace_connect);
1267 instr_routing_define_callbacks();
1271 * \brief Recursive function for finalize
1273 * \param rc the source host name
1275 * This fuction is call by "finalize". It allow to finalize the
1276 * AS or routing components. It delete all the structures.
1278 static void finalize_rec(As *as) {
1279 xbt_dict_cursor_t cursor = NULL;
1283 xbt_dict_foreach(as->p_routingSons, cursor, key, elem) {
1290 /** \brief Frees all memory allocated by the routing module */
1291 void routing_exit(void) {
1292 delete routing_platf;
1295 RoutingPlatf::~RoutingPlatf()
1297 xbt_dynar_free(&p_lastRoute);
1298 finalize_rec(p_root);
1301 AS_t surf_AS_get_routing_root() {
1302 return routing_platf->p_root;
1305 const char *surf_AS_get_name(As *as) {
1309 static As *surf_AS_recursive_get_by_name(As *current, const char * name) {
1310 xbt_dict_cursor_t cursor = NULL;
1315 if(!strcmp(current->p_name, name))
1318 xbt_dict_foreach(current->p_routingSons, cursor, key, elem) {
1319 tmp = surf_AS_recursive_get_by_name(elem, name);
1328 As *surf_AS_get_by_name(const char * name) {
1329 As *as = surf_AS_recursive_get_by_name(routing_platf->p_root, name);
1331 XBT_WARN("Impossible to find an AS with name %s, please check your input", name);
1335 xbt_dict_t surf_AS_get_routing_sons(As *as) {
1336 return as->p_routingSons;
1339 const char *surf_AS_get_model(As *as) {
1340 return as->p_modelDesc->name;
1343 xbt_dynar_t surf_AS_get_hosts(As *as) {
1344 xbt_dynar_t elms = as->p_indexNetworkElm;
1345 sg_routing_edge_t relm;
1348 int count = xbt_dynar_length(elms);
1349 xbt_dynar_t res = xbt_dynar_new(sizeof(xbt_dictelm_t), NULL);
1350 for (index = 0; index < count; index++) {
1351 relm = xbt_dynar_get_as(elms, index, RoutingEdge*);
1352 delm = xbt_lib_get_elm_or_null(host_lib, relm->getName());
1354 xbt_dynar_push(res, &delm);
1360 void surf_AS_get_graph(AS_t as, xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges) {
1361 as->getGraph(graph, nodes, edges);