1 /* Copyright (c) 2009-2011, 2013-2014. 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 SIMIX_STORAGE_LEVEL; //Simix storage level
28 int MSG_STORAGE_LEVEL; //Msg storage level
29 int MSG_FILE_LEVEL; //Msg file level
30 int SD_STORAGE_LEVEL; //Simdag storage level
31 int COORD_HOST_LEVEL=0; //Coordinates level
32 int NS3_HOST_LEVEL; //host node for ns3
34 xbt_lib_t as_router_lib;
35 int ROUTING_ASR_LEVEL; //Routing level
36 int COORD_ASR_LEVEL; //Coordinates level
37 int NS3_ASR_LEVEL; //host node for ns3
38 int ROUTING_PROP_ASR_LEVEL; //Where the properties are stored
40 static xbt_dict_t random_value = NULL;
43 /** @brief Retrieve a routing edge from its name
45 * Routing edges are either host and routers, whatever
47 RoutingEdgePtr sg_routing_edge_by_name_or_null(const char *name) {
48 sg_host_t h = sg_host_by_name(name);
49 RoutingEdgePtr net_elm = h==NULL?NULL: sg_host_edge(h);
51 net_elm = (RoutingEdgePtr) xbt_lib_get_or_null(as_router_lib, name, ROUTING_ASR_LEVEL);
56 RoutingPlatfPtr routing_platf = NULL;
57 AsPtr current_routing = NULL;
59 /* global parse functions */
60 extern xbt_dynar_t mount_list;
62 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route, surf, "Routing part of surf");
64 static void routing_parse_peer(sg_platf_peer_cbarg_t peer); /* peer bypass */
65 // static void routing_parse_Srandom(void); /* random bypass */
67 static void routing_parse_postparse(void);
69 /* this lines are only for replace use like index in the model table */
74 SURF_MODEL_DIJKSTRACACHE,
78 SURF_MODEL_TORUS_CLUSTER,
79 SURF_MODEL_FAT_TREE_CLUSTER,
82 struct s_model_type routing_models[] = {
84 "Full routing data (fast, large memory requirements, fully expressive)",
85 model_full_create, model_full_end},
87 "Floyd routing data (slow initialization, fast lookup, lesser memory requirements, shortest path routing only)",
88 model_floyd_create, model_floyd_end},
90 "Dijkstra routing data (fast initialization, slow lookup, small memory requirements, shortest path routing only)",
91 model_dijkstra_create, model_dijkstra_both_end},
93 "Dijkstra routing data (fast initialization, fast lookup, small memory requirements, shortest path routing only)",
94 model_dijkstracache_create, model_dijkstra_both_end},
95 {"none", "No routing (Unless you know what you are doing, avoid using this mode in combination with a non Constant network model).",
96 model_none_create, NULL},
97 {"Vivaldi", "Vivaldi routing",
98 model_vivaldi_create, NULL},
99 {"Cluster", "Cluster routing",
100 model_cluster_create, NULL},
101 {"Torus_Cluster", "Torus Cluster routing",
102 model_torus_cluster_create, NULL},
103 {"Fat_Tree_Cluster", "Fat Tree Cluster routing",
104 model_fat_tree_cluster_create, NULL},
105 {NULL, NULL, NULL, NULL}
109 * \brief Add a "host_link" to the network element list
111 static void parse_S_host_link(sg_platf_host_link_cbarg_t host)
113 RoutingEdgePtr info = sg_host_edge(sg_host_by_name(host->id));
114 xbt_assert(info, "Host '%s' not found!", host->id);
115 xbt_assert(current_routing->p_modelDesc == &routing_models[SURF_MODEL_CLUSTER] ||
116 current_routing->p_modelDesc == &routing_models[SURF_MODEL_VIVALDI],
117 "You have to be in model Cluster to use tag host_link!");
119 s_surf_parsing_link_up_down_t link_up_down;
120 link_up_down.link_up = Link::byName(host->link_up);
121 link_up_down.link_down = Link::byName(host->link_down);
123 xbt_assert(link_up_down.link_up, "Link '%s' not found!",host->link_up);
124 xbt_assert(link_up_down.link_down, "Link '%s' not found!",host->link_down);
126 if(!current_routing->p_linkUpDownList)
127 current_routing->p_linkUpDownList = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
129 // If dynar is is greater than edge id and if the host_link is already defined
130 if((int)xbt_dynar_length(current_routing->p_linkUpDownList) > info->getId() &&
131 xbt_dynar_get_as(current_routing->p_linkUpDownList, info->getId(), void*))
132 surf_parse_error("Host_link for '%s' is already defined!",host->id);
134 XBT_DEBUG("Push Host_link for host '%s' to position %d", info->getName(), info->getId());
135 xbt_dynar_set_as(current_routing->p_linkUpDownList, info->getId(), s_surf_parsing_link_up_down_t, link_up_down);
139 * \brief Add a "host" to the network element list
141 static void parse_S_host(sg_platf_host_cbarg_t host)
143 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
144 current_routing->p_hierarchy = SURF_ROUTING_BASE;
145 xbt_assert(!sg_host_by_name(host->id),
146 "Reading a host, processing unit \"%s\" already exists", host->id);
148 RoutingEdgePtr info = new RoutingEdgeImpl(xbt_strdup(host->id),
150 SURF_NETWORK_ELEMENT_HOST,
152 info->setId(current_routing->parsePU(info));
153 sg_host_edge_set(sg_host_by_name_or_create(host->id), info);
154 XBT_DEBUG("Having set name '%s' id '%d'", host->id, info->getId());
157 xbt_lib_set(storage_lib, host->id, ROUTING_STORAGE_HOST_LEVEL, (void *) mount_list);
161 if (host->coord && strcmp(host->coord, "")) {
165 if (!COORD_HOST_LEVEL)
166 xbt_die ("To use host coordinates, please add --cfg=network/coordinates:yes to your command line");
167 /* Pre-parse the host coordinates -- FIXME factorize with routers by overloading the routing->parse_PU function*/
168 xbt_dynar_t ctn_str = xbt_str_split_str(host->coord, " ");
169 xbt_dynar_t ctn = xbt_dynar_new(sizeof(double),NULL);
170 xbt_dynar_foreach(ctn_str,cursor, str) {
171 double val = atof(str);
172 xbt_dynar_push(ctn,&val);
174 xbt_dynar_shrink(ctn, 0);
175 xbt_dynar_free(&ctn_str);
176 xbt_lib_set(host_lib, host->id, COORD_HOST_LEVEL, (void *) ctn);
177 XBT_DEBUG("Having set host coordinates for '%s'",host->id);
182 * \brief Add a "router" to the network element list
184 static void parse_S_router(sg_platf_router_cbarg_t router)
186 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
187 current_routing->p_hierarchy = SURF_ROUTING_BASE;
188 xbt_assert(!xbt_lib_get_or_null(as_router_lib, router->id, ROUTING_ASR_LEVEL),
189 "Reading a router, processing unit \"%s\" already exists",
192 RoutingEdgePtr info = new RoutingEdgeImpl(xbt_strdup(router->id),
194 SURF_NETWORK_ELEMENT_ROUTER,
196 info->setId(current_routing->parsePU(info));
197 xbt_lib_set(as_router_lib, router->id, ROUTING_ASR_LEVEL, (void *) info);
198 XBT_DEBUG("Having set name '%s' id '%d'", router->id, info->getId());
200 if (router->coord && strcmp(router->coord, "")) {
204 if (!COORD_ASR_LEVEL)
205 xbt_die ("To use host coordinates, please add --cfg=network/coordinates:yes to your command line");
206 /* Pre-parse the host coordinates */
207 xbt_dynar_t ctn_str = xbt_str_split_str(router->coord, " ");
208 xbt_dynar_t ctn = xbt_dynar_new(sizeof(double),NULL);
209 xbt_dynar_foreach(ctn_str,cursor, str) {
210 double val = atof(str);
211 xbt_dynar_push(ctn,&val);
213 xbt_dynar_shrink(ctn, 0);
214 xbt_dynar_free(&ctn_str);
215 xbt_lib_set(as_router_lib, router->id, COORD_ASR_LEVEL, (void *) ctn);
216 XBT_DEBUG("Having set router coordinates for '%s'",router->id);
221 * \brief Store the route by calling the set_route function of the current routing component
223 static void parse_E_route(sg_platf_route_cbarg_t route)
225 /*FIXME:REMOVE:xbt_assert(current_routing->parse_route,
226 "no defined method \"set_route\" in \"%s\"",
227 current_routing->name);*/
229 current_routing->parseRoute(route);
233 * \brief Store the ASroute by calling the set_ASroute function of the current routing component
235 static void parse_E_ASroute(sg_platf_route_cbarg_t ASroute)
237 /*FIXME:REMOVE:xbt_assert(current_routing->parse_ASroute,
238 "no defined method \"set_ASroute\" in \"%s\"",
239 current_routing->name);*/
240 current_routing->parseASroute(ASroute);
244 * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
246 static void parse_E_bypassRoute(sg_platf_route_cbarg_t route)
248 /*FIXME:REMOVE:xbt_assert(current_routing->parse_bypassroute,
249 "Bypassing mechanism not implemented by routing '%s'",
250 current_routing->name);*/
252 current_routing->parseBypassroute(route);
256 * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
258 static void parse_E_bypassASroute(sg_platf_route_cbarg_t ASroute)
260 /*FIXME:REMOVE:xbt_assert(current_routing->parse_bypassroute,
261 "Bypassing mechanism not implemented by routing '%s'",
262 current_routing->name);*/
263 current_routing->parseBypassroute(ASroute);
266 static void routing_parse_trace(sg_platf_trace_cbarg_t trace)
268 tmgr_trace_t tmgr_trace;
269 if (!trace->file || strcmp(trace->file, "") != 0) {
270 tmgr_trace = tmgr_trace_new_from_file(trace->file);
271 } else if (strcmp(trace->pc_data, "") == 0) {
275 tmgr_trace_new_from_string(trace->id, trace->pc_data,
278 xbt_dict_set(traces_set_list, trace->id, (void *) tmgr_trace, NULL);
281 static void routing_parse_trace_connect(sg_platf_trace_connect_cbarg_t trace_connect)
283 xbt_assert(xbt_dict_get_or_null
284 (traces_set_list, trace_connect->trace),
285 "Cannot connect trace %s to %s: trace unknown",
286 trace_connect->trace,
287 trace_connect->element);
289 switch (trace_connect->kind) {
290 case SURF_TRACE_CONNECT_KIND_HOST_AVAIL:
291 xbt_dict_set(trace_connect_list_host_avail,
292 trace_connect->trace,
293 xbt_strdup(trace_connect->element), NULL);
295 case SURF_TRACE_CONNECT_KIND_POWER:
296 xbt_dict_set(trace_connect_list_power, trace_connect->trace,
297 xbt_strdup(trace_connect->element), NULL);
299 case SURF_TRACE_CONNECT_KIND_LINK_AVAIL:
300 xbt_dict_set(trace_connect_list_link_avail,
301 trace_connect->trace,
302 xbt_strdup(trace_connect->element), NULL);
304 case SURF_TRACE_CONNECT_KIND_BANDWIDTH:
305 xbt_dict_set(trace_connect_list_bandwidth,
306 trace_connect->trace,
307 xbt_strdup(trace_connect->element), NULL);
309 case SURF_TRACE_CONNECT_KIND_LATENCY:
310 xbt_dict_set(trace_connect_list_latency, trace_connect->trace,
311 xbt_strdup(trace_connect->element), NULL);
314 surf_parse_error("Cannot connect trace %s to %s: kind of trace unknown",
315 trace_connect->trace, trace_connect->element);
321 * \brief Make a new routing component to the platform
323 * Add a new autonomous system to the platform. Any elements (such as host,
324 * router or sub-AS) added after this call and before the corresponding call
325 * to sg_platf_new_AS_close() will be added to this AS.
327 * Once this function was called, the configuration concerning the used
328 * models cannot be changed anymore.
330 * @param AS_id name of this autonomous system. Must be unique in the platform
331 * @param wanted_routing_type one of Full, Floyd, Dijkstra or similar. Full list in the variable routing_models, in src/surf/surf_routing.c
333 void routing_AS_begin(sg_platf_AS_cbarg_t AS)
335 XBT_DEBUG("routing_AS_begin");
336 routing_model_description_t model = NULL;
338 xbt_assert(!xbt_lib_get_or_null
339 (as_router_lib, AS->id, ROUTING_ASR_LEVEL),
340 "The AS \"%s\" already exists", AS->id);
342 _sg_cfg_init_status = 2; /* horrible hack: direct access to the global
343 * controlling the level of configuration to prevent
344 * any further config */
346 /* search the routing model */
348 case A_surfxml_AS_routing_Cluster: model = &routing_models[SURF_MODEL_CLUSTER];break;
349 case A_surfxml_AS_routing_Cluster___torus: model = &routing_models[SURF_MODEL_TORUS_CLUSTER];break;
350 case A_surfxml_AS_routing_Cluster___fat___tree: model = &routing_models[SURF_MODEL_FAT_TREE_CLUSTER];break;
351 case A_surfxml_AS_routing_Dijkstra: model = &routing_models[SURF_MODEL_DIJKSTRA];break;
352 case A_surfxml_AS_routing_DijkstraCache: model = &routing_models[SURF_MODEL_DIJKSTRACACHE];break;
353 case A_surfxml_AS_routing_Floyd: model = &routing_models[SURF_MODEL_FLOYD];break;
354 case A_surfxml_AS_routing_Full: model = &routing_models[SURF_MODEL_FULL];break;
355 case A_surfxml_AS_routing_None: model = &routing_models[SURF_MODEL_NONE];break;
356 case A_surfxml_AS_routing_Vivaldi: model = &routing_models[SURF_MODEL_VIVALDI];break;
357 default: xbt_die("Not a valid model!!!");
361 /* make a new routing component */
362 AsPtr new_as = model->create();
364 new_as->p_modelDesc = model;
365 new_as->p_hierarchy = SURF_ROUTING_NULL;
366 new_as->p_name = xbt_strdup(AS->id);
368 RoutingEdgePtr info = new RoutingEdgeImpl(xbt_strdup(new_as->p_name),
370 SURF_NETWORK_ELEMENT_AS,
372 if (current_routing == NULL && routing_platf->p_root == NULL) {
374 /* it is the first one */
375 new_as->p_routingFather = NULL;
376 routing_platf->p_root = new_as;
378 } else if (current_routing != NULL && routing_platf->p_root != NULL) {
380 xbt_assert(!xbt_dict_get_or_null
381 (current_routing->p_routingSons, AS->id),
382 "The AS \"%s\" already exists", AS->id);
383 /* it is a part of the tree */
384 new_as->p_routingFather = current_routing;
385 /* set the father behavior */
386 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
387 current_routing->p_hierarchy = SURF_ROUTING_RECURSIVE;
388 /* add to the sons dictionary */
389 xbt_dict_set(current_routing->p_routingSons, AS->id,
390 (void *) new_as, NULL);
391 /* add to the father element list */
392 info->setId(current_routing->parseAS(info));
394 THROWF(arg_error, 0, "All defined components must belong to a AS");
397 xbt_lib_set(as_router_lib, info->getName(), ROUTING_ASR_LEVEL,
399 XBT_DEBUG("Having set name '%s' id '%d'", new_as->p_name, info->getId());
401 /* set the new current component of the tree */
402 current_routing = new_as;
403 current_routing->p_netElem = info;
408 * \brief Specify that the current description of AS is finished
410 * Once you've declared all the content of your AS, you have to close
411 * it with this call. Your AS is not usable until you call this function.
413 * @fixme: this call is not as robust as wanted: bad things WILL happen
414 * if you call it twice for the same AS, or if you forget calling it, or
415 * even if you add stuff to a closed AS
418 void routing_AS_end(sg_platf_AS_cbarg_t /*AS*/)
421 if (current_routing == NULL) {
422 THROWF(arg_error, 0, "Close an AS, but none was under construction");
424 if (current_routing->p_modelDesc->end)
425 current_routing->p_modelDesc->end(current_routing);
426 current_routing = current_routing->p_routingFather;
430 /* Aux Business methods */
433 * \brief Get the AS father and the first elements of the chain
435 * \param src the source host name
436 * \param dst the destination host name
438 * Get the common father of the to processing units, and the first different
439 * father in the chain
441 static void elements_father(sg_routing_edge_t src, sg_routing_edge_t dst,
446 xbt_assert(src && dst, "bad parameters for \"elements_father\" method");
447 #define ELEMENTS_FATHER_MAXDEPTH 16 /* increase if it is not enough */
448 AsPtr src_as, dst_as;
449 AsPtr path_src[ELEMENTS_FATHER_MAXDEPTH];
450 AsPtr path_dst[ELEMENTS_FATHER_MAXDEPTH];
458 /* (1) find the as where the src and dst are located */
459 sg_routing_edge_t src_data = src;
460 sg_routing_edge_t dst_data = dst;
461 src_as = src_data->getRcComponent();
462 dst_as = dst_data->getRcComponent();
464 char* src_name = src_data->getName();
465 char* dst_name = dst_data->getName();
468 xbt_assert(src_as && dst_as,
469 "Ask for route \"from\"(%s) or \"to\"(%s) no found", src_name, dst_name);
471 /* (2) find the path to the root routing component */
472 for (current = src_as; current != NULL; current = current->p_routingFather) {
473 if (index_src >= ELEMENTS_FATHER_MAXDEPTH)
474 xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_src");
475 path_src[index_src++] = current;
477 for (current = dst_as; current != NULL; current = current->p_routingFather) {
478 if (index_dst >= ELEMENTS_FATHER_MAXDEPTH)
479 xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_dst");
480 path_dst[index_dst++] = current;
483 /* (3) find the common father */
485 current_src = path_src[--index_src];
486 current_dst = path_dst[--index_dst];
487 } while (index_src > 0 && index_dst > 0 && current_src == current_dst);
489 /* (4) they are not in the same routing component, make the path */
490 if (current_src == current_dst)
491 father = current_src;
493 father = path_src[index_src + 1];
495 /* (5) result generation */
496 *res_father = father; /* first the common father of src and dst */
497 *res_src = current_src; /* second the first different father of src */
498 *res_dst = current_dst; /* three the first different father of dst */
500 #undef ELEMENTS_FATHER_MAXDEPTH
503 /* Global Business methods */
506 * \brief Recursive function for get_route_latency
508 * \param src the source host name
509 * \param dst the destination host name
510 * \param *route the route where the links are stored. It is either NULL or a ready to use dynar
511 * \param *latency the latency, if needed
513 * This function is called by "get_route" and "get_latency". It allows to walk
514 * recursively through the ASes tree.
516 static void _get_route_and_latency(RoutingEdgePtr src, RoutingEdgePtr dst,
517 xbt_dynar_t * links, double *latency)
519 s_sg_platf_route_cbarg_t route;
520 memset(&route,0,sizeof(route));
522 xbt_assert(src && dst, "bad parameters for \"_get_route_latency\" method");
523 XBT_DEBUG("Solve route/latency \"%s\" to \"%s\"", src->getName(), dst->getName());
525 /* Find how src and dst are interconnected */
526 AsPtr common_father, src_father, dst_father;
527 elements_father(src, dst, &common_father, &src_father, &dst_father);
528 XBT_DEBUG("elements_father: common father '%s' src_father '%s' dst_father '%s'",
529 common_father->p_name, src_father->p_name, dst_father->p_name);
531 /* Check whether a direct bypass is defined */
532 sg_platf_route_cbarg_t e_route_bypass = NULL;
533 //FIXME:REMOVE:if (common_father->get_bypass_route)
535 e_route_bypass = common_father->getBypassRoute(src, dst, latency);
537 /* Common ancestor is kind enough to declare a bypass route from src to dst -- use it and bail out */
538 if (e_route_bypass) {
539 xbt_dynar_merge(links, &e_route_bypass->link_list);
540 generic_free_route(e_route_bypass);
544 /* If src and dst are in the same AS, life is good */
545 if (src_father == dst_father) { /* SURF_ROUTING_BASE */
546 route.link_list = *links;
547 common_father->getRouteAndLatency(src, dst, &route, latency);
548 // if vivaldi latency+=vivaldi(src,dst)
552 /* Not in the same AS, no bypass. We'll have to find our path between the ASes recursively*/
554 route.link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
555 // Find the net_card corresponding to father
556 RoutingEdgePtr src_father_net_elm = src_father->p_netElem;
557 RoutingEdgePtr dst_father_net_elm = dst_father->p_netElem;
559 common_father->getRouteAndLatency(src_father_net_elm, dst_father_net_elm,
562 xbt_assert((route.gw_src != NULL) && (route.gw_dst != NULL),
563 "bad gateways for route from \"%s\" to \"%s\"", src->getName(), dst->getName());
565 sg_routing_edge_t src_gateway_net_elm = route.gw_src;
566 sg_routing_edge_t dst_gateway_net_elm = route.gw_dst;
568 /* If source gateway is not our source, we have to recursively find our way up to this point */
569 if (src != src_gateway_net_elm)
570 _get_route_and_latency(src, src_gateway_net_elm, links, latency);
571 xbt_dynar_merge(links, &route.link_list);
573 /* If dest gateway is not our destination, we have to recursively find our way from this point */
574 if (dst_gateway_net_elm != dst)
575 _get_route_and_latency(dst_gateway_net_elm, dst, links, latency);
577 // if vivaldi latency+=vivaldi(src_gateway,dst_gateway)
580 AS_t surf_platf_get_root(routing_platf_t platf){
581 return platf->p_root;
584 e_surf_network_element_type_t surf_routing_edge_get_rc_type(sg_routing_edge_t edge){
585 return edge->getRcType();
590 * \brief Find a route between hosts
592 * \param src the network_element_t for src host
593 * \param dst the network_element_t for dst host
594 * \param route where to store the list of links.
595 * If *route=NULL, create a short lived dynar. Else, fill the provided dynar
596 * \param latency where to store the latency experienced on the path (or NULL if not interested)
597 * It is the caller responsability to initialize latency to 0 (we add to provided route)
600 * walk through the routing components tree and find a route between hosts
601 * by calling the differents "get_route" functions in each routing component.
603 void RoutingPlatf::getRouteAndLatency(RoutingEdgePtr src, RoutingEdgePtr dst,
604 xbt_dynar_t* route, double *latency)
606 XBT_DEBUG("routing_get_route_and_latency from %s to %s", src->getName(), dst->getName());
608 xbt_dynar_reset(routing_platf->p_lastRoute);
609 *route = routing_platf->p_lastRoute;
612 _get_route_and_latency(src, dst, route, latency);
614 xbt_assert(!latency || *latency >= 0.0,
615 "negative latency on route between \"%s\" and \"%s\"", src->getName(), dst->getName());
618 xbt_dynar_t RoutingPlatf::getOneLinkRoutes(){
619 return recursiveGetOneLinkRoutes(p_root);
622 xbt_dynar_t RoutingPlatf::recursiveGetOneLinkRoutes(AsPtr rc)
624 xbt_dynar_t ret = xbt_dynar_new(sizeof(OnelinkPtr), xbt_free_f);
626 //adding my one link routes
627 xbt_dynar_t onelink_mine = rc->getOneLinkRoutes();
629 xbt_dynar_merge(&ret,&onelink_mine);
633 xbt_dict_cursor_t cursor = NULL;
635 xbt_dict_foreach(rc->p_routingSons, cursor, key, rc_child) {
636 xbt_dynar_t onelink_child = recursiveGetOneLinkRoutes(rc_child);
638 xbt_dynar_merge(&ret,&onelink_child);
643 e_surf_network_element_type_t routing_get_network_element_type(const char *name)
645 RoutingEdgePtr rc = sg_routing_edge_by_name_or_null(name);
647 return rc->getRcType();
649 return SURF_NETWORK_ELEMENT_NULL;
653 * \brief Generic method: create the global routing schema
655 * Make a global routing structure and set all the parsing functions.
657 void routing_model_create( void *loopback)
659 /* config the uniq global routing */
660 routing_platf = new RoutingPlatf();
661 routing_platf->p_root = NULL;
662 routing_platf->p_loopback = loopback;
663 routing_platf->p_lastRoute = xbt_dynar_new(sizeof(sg_routing_link_t),NULL);
664 /* no current routing at moment */
665 current_routing = NULL;
669 /* ************************************************** */
670 /* ********** PATERN FOR NEW ROUTING **************** */
672 /* The minimal configuration of a new routing model need the next functions,
673 * also you need to set at the start of the file, the new model in the model
674 * list. Remember keep the null ending of the list.
676 /*** Routing model structure ***/
678 // s_routing_component_t generic_routing;
679 // /* things that your routing model need */
680 // } s_routing_component_NEW_t,*routing_component_NEW_t;
682 /*** Parse routing model functions ***/
683 // static void model_NEW_set_processing_unit(routing_component_t rc, const char* name) {}
684 // static void model_NEW_set_autonomous_system(routing_component_t rc, const char* name) {}
685 // static void model_NEW_set_route(routing_component_t rc, const char* src, const char* dst, route_t route) {}
686 // static void model_NEW_set_ASroute(routing_component_t rc, const char* src, const char* dst, route_extended_t route) {}
687 // static void model_NEW_set_bypassroute(routing_component_t rc, const char* src, const char* dst, route_extended_t e_route) {}
689 /*** Business methods ***/
690 // static route_extended_t NEW_get_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
691 // static route_extended_t NEW_get_bypass_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
692 // static void NEW_finalize(routing_component_t rc) { xbt_free(rc);}
694 /*** Creation routing model functions ***/
695 // static void* model_NEW_create(void) {
696 // routing_component_NEW_t new_component = xbt_new0(s_routing_component_NEW_t,1);
697 // new_component->generic_routing.set_processing_unit = model_NEW_set_processing_unit;
698 // new_component->generic_routing.set_autonomous_system = model_NEW_set_autonomous_system;
699 // new_component->generic_routing.set_route = model_NEW_set_route;
700 // new_component->generic_routing.set_ASroute = model_NEW_set_ASroute;
701 // new_component->generic_routing.set_bypassroute = model_NEW_set_bypassroute;
702 // new_component->generic_routing.get_route = NEW_get_route;
703 // new_component->generic_routing.get_bypass_route = NEW_get_bypass_route;
704 // new_component->generic_routing.finalize = NEW_finalize;
705 // /* initialization of internal structures */
706 // return new_component;
708 // static void model_NEW_load(void) {} /* mandatory */
709 // static void model_NEW_unload(void) {} /* mandatory */
710 // static void model_NEW_end(void) {} /* mandatory */
712 /* ************************************************************************** */
713 /* ************************* GENERIC PARSE FUNCTIONS ************************ */
715 void routing_cluster_add_backbone(void* bb) {
716 xbt_assert(current_routing->p_modelDesc == &routing_models[SURF_MODEL_CLUSTER],
717 "You have to be in model Cluster to use tag backbone!");
718 xbt_assert(!surf_as_cluster_get_backbone(current_routing), "The backbone link is already defined!");
719 surf_as_cluster_set_backbone(current_routing, bb);
720 XBT_DEBUG("Add a backbone to AS '%s'", current_routing->p_name);
723 static void routing_parse_cabinet(sg_platf_cabinet_cbarg_t cabinet)
726 char *groups , *host_id , *link_id = NULL;
728 xbt_dynar_t radical_elements;
729 xbt_dynar_t radical_ends;
732 radical_elements = xbt_str_split(cabinet->radical, ",");
733 xbt_dynar_foreach(radical_elements, iter, groups) {
735 radical_ends = xbt_str_split(groups, "-");
736 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
738 switch (xbt_dynar_length(radical_ends)) {
743 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
746 surf_parse_error("Malformed radical");
749 s_sg_platf_host_cbarg_t host;
750 memset(&host, 0, sizeof(host));
751 host.initial_state = SURF_RESOURCE_ON;
753 host.power_scale = 1.0;
754 host.core_amount = 1;
756 s_sg_platf_link_cbarg_t link;
757 memset(&link, 0, sizeof(link));
758 link.state = SURF_RESOURCE_ON;
759 link.policy = SURF_LINK_FULLDUPLEX;
760 link.latency = cabinet->lat;
761 link.bandwidth = cabinet->bw;
763 s_sg_platf_host_link_cbarg_t host_link;
764 memset(&host_link, 0, sizeof(host_link));
766 for (i = start; i <= end; i++) {
767 host_id = bprintf("%s%d%s",cabinet->prefix,i,cabinet->suffix);
768 link_id = bprintf("link_%s%d%s",cabinet->prefix,i,cabinet->suffix);
771 xbt_dynar_t power_state_list = xbt_dynar_new(sizeof(double), NULL);
772 xbt_dynar_push(power_state_list,&cabinet->power);
773 host.power_peak = power_state_list;
774 sg_platf_new_host(&host);
775 sg_platf_new_link(&link);
777 char* link_up = bprintf("%s_UP",link_id);
778 char* link_down = bprintf("%s_DOWN",link_id);
779 host_link.id = host_id;
780 host_link.link_up = link_up;
781 host_link.link_down = link_down;
782 sg_platf_new_host_link(&host_link);
790 xbt_dynar_free(&radical_ends);
792 xbt_dynar_free(&radical_elements);
795 static void routing_parse_cluster(sg_platf_cluster_cbarg_t cluster)
797 char *host_id, *groups, *link_id = NULL;
798 xbt_dict_t patterns = NULL;
801 s_sg_platf_host_cbarg_t host;
802 s_sg_platf_link_cbarg_t link;
806 xbt_dynar_t radical_elements;
807 xbt_dynar_t radical_ends;
809 if ((cluster->availability_trace && strcmp(cluster->availability_trace, ""))
810 || (cluster->state_trace && strcmp(cluster->state_trace, ""))) {
811 patterns = xbt_dict_new_homogeneous(xbt_free_f);
812 xbt_dict_set(patterns, "id", xbt_strdup(cluster->id), NULL);
813 xbt_dict_set(patterns, "prefix", xbt_strdup(cluster->prefix), NULL);
814 xbt_dict_set(patterns, "suffix", xbt_strdup(cluster->suffix), NULL);
817 /* parse the topology attribute. If we are not in a flat cluster,
818 * switch to the right mode and initialize the routing with
819 * the parameters in topo_parameters attribute
821 s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
824 if(cluster->topology == SURF_CLUSTER_TORUS){
825 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Torus_Cluster\">", cluster->id);
826 AS.routing = A_surfxml_AS_routing_Cluster___torus;
827 sg_platf_new_AS_begin(&AS);
828 ((AsClusterTorusPtr)current_routing)->parse_specific_arguments(cluster);
830 else if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
831 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Fat_Tree_Cluster\">", cluster->id);
832 AS.routing = A_surfxml_AS_routing_Cluster___fat___tree;
833 sg_platf_new_AS_begin(&AS);
834 ((AsClusterFatTree*)current_routing)->parse_specific_arguments(cluster);
838 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", cluster->id);
839 AS.routing = A_surfxml_AS_routing_Cluster;
840 sg_platf_new_AS_begin(&AS);
843 if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
844 ((AsClusterPtr)current_routing)->p_nb_links_per_node++;
845 ((AsClusterPtr)current_routing)->p_has_loopback=1;
848 if(cluster->limiter_link!=0){
849 ((AsClusterPtr)current_routing)->p_nb_links_per_node++;
850 ((AsClusterPtr)current_routing)->p_has_limiter=1;
855 current_routing->p_linkUpDownList
856 = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
859 radical_elements = xbt_str_split(cluster->radical, ",");
860 xbt_dynar_foreach(radical_elements, iter, groups) {
862 radical_ends = xbt_str_split(groups, "-");
863 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
865 switch (xbt_dynar_length(radical_ends)) {
870 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
873 surf_parse_error("Malformed radical");
876 for (i = start; i <= end; i++) {
878 bprintf("%s%d%s", cluster->prefix, i, cluster->suffix);
879 link_id = bprintf("%s_link_%d", cluster->id, i);
881 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\">", host_id, cluster->power);
883 memset(&host, 0, sizeof(host));
885 if ((cluster->properties != NULL) && (!xbt_dict_is_empty(cluster->properties))) {
886 xbt_dict_cursor_t cursor=NULL;
888 host.properties = xbt_dict_new();
890 xbt_dict_foreach(cluster->properties,cursor,key,data) {
891 xbt_dict_set(host.properties, key, xbt_strdup(data),free);
894 if (cluster->availability_trace && strcmp(cluster->availability_trace, "")) {
895 xbt_dict_set(patterns, "radical", bprintf("%d", i), NULL);
896 char *avail_file = xbt_str_varsubst(cluster->availability_trace, patterns);
897 XBT_DEBUG("\tavailability_file=\"%s\"", avail_file);
898 host.power_trace = tmgr_trace_new_from_file(avail_file);
899 xbt_free(avail_file);
901 XBT_DEBUG("\tavailability_file=\"\"");
904 if (cluster->state_trace && strcmp(cluster->state_trace, "")) {
905 char *avail_file = xbt_str_varsubst(cluster->state_trace, patterns);
906 XBT_DEBUG("\tstate_file=\"%s\"", avail_file);
907 host.state_trace = tmgr_trace_new_from_file(avail_file);
908 xbt_free(avail_file);
910 XBT_DEBUG("\tstate_file=\"\"");
913 xbt_dynar_t power_state_list = xbt_dynar_new(sizeof(double), NULL);
914 xbt_dynar_push(power_state_list,&cluster->power);
915 host.power_peak = power_state_list;
918 //host.power_peak = cluster->power;
919 host.power_scale = 1.0;
920 host.core_amount = cluster->core_amount;
921 host.initial_state = SURF_RESOURCE_ON;
923 sg_platf_new_host(&host);
924 XBT_DEBUG("</host>");
926 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_id,
927 cluster->bw, cluster->lat);
930 s_surf_parsing_link_up_down_t info_lim, info_loop;
931 // All links are saved in a matrix;
932 // every row describes a single node; every node
933 // may have multiple links.
934 // the first column may store a link from x to x if p_has_loopback is set
935 // the second column may store a limiter link if p_has_limiter is set
936 // other columns are to store one or more link for the node
938 //add a loopback link
939 if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
940 char *tmp_link = bprintf("%s_loopback", link_id);
941 XBT_DEBUG("<loopback\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
942 cluster->limiter_link);
945 memset(&link, 0, sizeof(link));
947 link.bandwidth = cluster->loopback_bw;
948 link.latency = cluster->loopback_lat;
949 link.state = SURF_RESOURCE_ON;
950 link.policy = SURF_LINK_FATPIPE;
951 sg_platf_new_link(&link);
952 info_loop.link_up = Link::byName(tmp_link);
953 info_loop.link_down = info_loop.link_up;
955 xbt_dynar_set(current_routing->p_linkUpDownList, rankId*((AsClusterPtr)current_routing)->p_nb_links_per_node, &info_loop);
958 //add a limiter link (shared link to account for maximal bandwidth of the node)
959 if(cluster->limiter_link!=0){
960 char *tmp_link = bprintf("%s_limiter", link_id);
961 XBT_DEBUG("<limiter\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
962 cluster->limiter_link);
965 memset(&link, 0, sizeof(link));
967 link.bandwidth = cluster->limiter_link;
969 link.state = SURF_RESOURCE_ON;
970 link.policy = SURF_LINK_SHARED;
971 sg_platf_new_link(&link);
972 info_lim.link_up = Link::byName(tmp_link);
973 info_lim.link_down = info_lim.link_up;
975 xbt_dynar_set(current_routing->p_linkUpDownList,
976 rankId*((AsClusterPtr)current_routing)->p_nb_links_per_node + ((AsClusterPtr)current_routing)->p_has_loopback ,
982 //call the cluster function that adds the others links
983 if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
984 ((AsClusterFatTree*) current_routing)->addProcessingNode(i);
987 ((AsClusterPtr)current_routing)->create_links_for_node(cluster, i, rankId, rankId*
988 ((AsClusterPtr)current_routing)->p_nb_links_per_node
989 + ((AsClusterPtr)current_routing)->p_has_loopback
990 + ((AsClusterPtr)current_routing)->p_has_limiter );
997 xbt_dynar_free(&radical_ends);
999 xbt_dynar_free(&radical_elements);
1001 // For fat trees, the links must be created once all nodes have been added
1002 if(cluster->topology == SURF_CLUSTER_FAT_TREE) {
1003 ((AsClusterFatTree*)current_routing)->create_links();
1005 // Add a router. It is magically used thanks to the way in which surf_routing_cluster is written,
1006 // and it's very useful to connect clusters together
1008 XBT_DEBUG("<router id=\"%s\"/>", cluster->router_id);
1010 s_sg_platf_router_cbarg_t router;
1011 memset(&router, 0, sizeof(router));
1012 router.id = cluster->router_id;
1014 if (!router.id || !strcmp(router.id, ""))
1016 bprintf("%s%s_router%s", cluster->prefix, cluster->id,
1018 sg_platf_new_router(&router);
1019 ((AsClusterPtr)current_routing)->p_router = (RoutingEdgePtr) xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL);
1023 if ((cluster->bb_bw != 0) || (cluster->bb_lat != 0)) {
1024 char *link_backbone = bprintf("%s_backbone", cluster->id);
1025 XBT_DEBUG("<link\tid=\"%s\" bw=\"%f\" lat=\"%f\"/>", link_backbone,
1026 cluster->bb_bw, cluster->bb_lat);
1028 memset(&link, 0, sizeof(link));
1029 link.id = link_backbone;
1030 link.bandwidth = cluster->bb_bw;
1031 link.latency = cluster->bb_lat;
1032 link.state = SURF_RESOURCE_ON;
1033 link.policy = cluster->bb_sharing_policy;
1035 sg_platf_new_link(&link);
1037 routing_cluster_add_backbone(Link::byName(link_backbone));
1039 free(link_backbone);
1043 sg_platf_new_AS_end();
1045 xbt_dict_free(&patterns); // no op if it were never set
1048 static void routing_parse_postparse(void) {
1049 xbt_dict_free(&random_value);
1052 static void routing_parse_peer(sg_platf_peer_cbarg_t peer)
1054 char *host_id = NULL;
1055 char *link_id = NULL;
1056 char *router_id = NULL;
1059 host_id = HOST_PEER(peer->id);
1060 link_id = LINK_PEER(peer->id);
1061 router_id = ROUTER_PEER(peer->id);
1063 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", peer->id);
1064 s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
1066 AS.routing = A_surfxml_AS_routing_Cluster;
1067 sg_platf_new_AS_begin(&AS);
1069 current_routing->p_linkUpDownList = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
1071 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\"/>", host_id, peer->power);
1072 s_sg_platf_host_cbarg_t host;
1073 memset(&host, 0, sizeof(host));
1074 host.initial_state = SURF_RESOURCE_ON;
1077 xbt_dynar_t power_state_list = xbt_dynar_new(sizeof(double), NULL);
1078 xbt_dynar_push(power_state_list,&peer->power);
1079 host.power_peak = power_state_list;
1081 //host.power_peak = peer->power;
1082 host.power_scale = 1.0;
1083 host.power_trace = peer->availability_trace;
1084 host.state_trace = peer->state_trace;
1085 host.core_amount = 1;
1086 sg_platf_new_host(&host);
1088 s_sg_platf_link_cbarg_t link;
1089 memset(&link, 0, sizeof(link));
1090 link.state = SURF_RESOURCE_ON;
1091 link.policy = SURF_LINK_SHARED;
1092 link.latency = peer->lat;
1094 char* link_up = bprintf("%s_UP",link_id);
1095 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_up,
1096 peer->bw_out, peer->lat);
1098 link.bandwidth = peer->bw_out;
1099 sg_platf_new_link(&link);
1101 char* link_down = bprintf("%s_DOWN",link_id);
1102 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_down,
1103 peer->bw_in, peer->lat);
1104 link.id = link_down;
1105 link.bandwidth = peer->bw_in;
1106 sg_platf_new_link(&link);
1108 XBT_DEBUG("<host_link\tid=\"%s\"\tup=\"%s\"\tdown=\"%s\" />", host_id,link_up,link_down);
1109 s_sg_platf_host_link_cbarg_t host_link;
1110 memset(&host_link, 0, sizeof(host_link));
1111 host_link.id = host_id;
1112 host_link.link_up = link_up;
1113 host_link.link_down = link_down;
1114 sg_platf_new_host_link(&host_link);
1116 XBT_DEBUG("<router id=\"%s\"/>", router_id);
1117 s_sg_platf_router_cbarg_t router;
1118 memset(&router, 0, sizeof(router));
1119 router.id = router_id;
1120 router.coord = peer->coord;
1121 sg_platf_new_router(&router);
1122 static_cast<AsClusterPtr>(current_routing)->p_router = static_cast<RoutingEdgePtr>(xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL));
1125 sg_platf_new_AS_end();
1128 //xbt_dynar_free(&tab_elements_num);
1136 // static void routing_parse_Srandom(void)
1138 // double mean, std, min, max, seed;
1139 // char *random_id = A_surfxml_random_id;
1140 // char *random_radical = A_surfxml_random_radical;
1141 // char *rd_name = NULL;
1143 // mean = surf_parse_get_double(A_surfxml_random_mean);
1144 // std = surf_parse_get_double(A_surfxml_random_std___deviation);
1145 // min = surf_parse_get_double(A_surfxml_random_min);
1146 // max = surf_parse_get_double(A_surfxml_random_max);
1147 // seed = surf_parse_get_double(A_surfxml_random_seed);
1151 // random_data_t random = xbt_new0(s_random_data_t, 1);
1154 // xbt_dynar_t radical_elements;
1155 // unsigned int iter;
1158 // xbt_dynar_t radical_ends;
1160 // switch (A_surfxml_random_generator) {
1161 // case AU_surfxml_random_generator:
1162 // case A_surfxml_random_generator_NONE:
1163 // random->generator = NONE;
1165 // case A_surfxml_random_generator_DRAND48:
1166 // random->generator = DRAND48;
1168 // case A_surfxml_random_generator_RAND:
1169 // random->generator = RAND;
1171 // case A_surfxml_random_generator_RNGSTREAM:
1172 // random->generator = RNGSTREAM;
1175 // surf_parse_error("Invalid random generator");
1178 // random->seed = seed;
1179 // random->min = min;
1180 // random->max = max;
1182 // /* Check user stupidities */
1184 // THROWF(arg_error, 0, "random->max < random->min (%f < %f)", max, min);
1186 // THROWF(arg_error, 0, "random->mean < random->min (%f < %f)", mean, min);
1188 // THROWF(arg_error, 0, "random->mean > random->max (%f > %f)", mean, max);
1190 // /* normalize the mean and standard deviation before storing */
1191 // random->mean = (mean - min) / (max - min);
1192 // random->std = std / (max - min);
1194 // if (random->mean * (1 - random->mean) < random->std * random->std)
1195 // THROWF(arg_error, 0, "Invalid mean and standard deviation (%f and %f)",
1196 // random->mean, random->std);
1199 // ("id = '%s' min = '%f' max = '%f' mean = '%f' std_deviatinon = '%f' generator = '%d' seed = '%ld' radical = '%s'",
1200 // random_id, random->min, random->max, random->mean, random->std,
1201 // (int)random->generator, random->seed, random_radical);
1203 // if (!random_value)
1204 // random_value = xbt_dict_new_homogeneous(free);
1206 // if (!strcmp(random_radical, "")) {
1207 // res = random_generate(random);
1208 // rd_value = bprintf("%f", res);
1209 // xbt_dict_set(random_value, random_id, rd_value, NULL);
1211 // radical_elements = xbt_str_split(random_radical, ",");
1212 // xbt_dynar_foreach(radical_elements, iter, groups) {
1213 // radical_ends = xbt_str_split(groups, "-");
1214 // switch (xbt_dynar_length(radical_ends)) {
1216 // xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1217 // "Custom Random '%s' already exists !", random_id);
1218 // res = random_generate(random);
1220 // bprintf("%s%d", random_id,
1221 // atoi(xbt_dynar_getfirst_as(radical_ends, char *)));
1222 // xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1223 // xbt_free(tmpbuf);
1227 // start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
1228 // end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
1229 // for (i = start; i <= end; i++) {
1230 // xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1231 // "Custom Random '%s' already exists !", bprintf("%s%d",
1234 // res = random_generate(random);
1235 // tmpbuf = bprintf("%s%d", random_id, i);
1236 // xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1237 // xbt_free(tmpbuf);
1241 // XBT_CRITICAL("Malformed radical");
1244 // res = random_generate(random);
1245 // rd_name = bprintf("%s_router", random_id);
1246 // rd_value = bprintf("%f", res);
1247 // xbt_dict_set(random_value, rd_name, rd_value, NULL);
1249 // xbt_dynar_free(&radical_ends);
1252 // xbt_dynar_free(&radical_elements);
1256 static void check_disk_attachment()
1258 xbt_lib_cursor_t cursor;
1261 RoutingEdgePtr host_elm;
1262 xbt_lib_foreach(storage_lib, cursor, key, data) {
1263 if(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL) != NULL) {
1264 StoragePtr storage = static_cast<StoragePtr>(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL));
1265 host_elm = sg_routing_edge_by_name_or_null(storage->p_attach);
1267 surf_parse_error("Unable to attach storage %s: host %s doesn't exist.", storage->getName(), storage->p_attach);
1272 void routing_register_callbacks()
1274 sg_platf_host_add_cb(parse_S_host);
1275 sg_platf_router_add_cb(parse_S_router);
1276 sg_platf_host_link_add_cb(parse_S_host_link);
1277 sg_platf_route_add_cb(parse_E_route);
1278 sg_platf_ASroute_add_cb(parse_E_ASroute);
1279 sg_platf_bypassRoute_add_cb(parse_E_bypassRoute);
1280 sg_platf_bypassASroute_add_cb(parse_E_bypassASroute);
1282 sg_platf_cluster_add_cb(routing_parse_cluster);
1283 sg_platf_cabinet_add_cb(routing_parse_cabinet);
1285 sg_platf_peer_add_cb(routing_parse_peer);
1286 sg_platf_postparse_add_cb(routing_parse_postparse);
1287 sg_platf_postparse_add_cb(check_disk_attachment);
1289 /* we care about the ASes while parsing the platf. Incredible, isnt it? */
1290 sg_platf_AS_end_add_cb(routing_AS_end);
1291 sg_platf_AS_begin_add_cb(routing_AS_begin);
1293 sg_platf_trace_add_cb(routing_parse_trace);
1294 sg_platf_trace_connect_add_cb(routing_parse_trace_connect);
1296 instr_routing_define_callbacks();
1300 * \brief Recursive function for finalize
1302 * \param rc the source host name
1304 * This fuction is call by "finalize". It allow to finalize the
1305 * AS or routing components. It delete all the structures.
1307 static void finalize_rec(AsPtr as) {
1308 xbt_dict_cursor_t cursor = NULL;
1312 xbt_dict_foreach(as->p_routingSons, cursor, key, elem) {
1319 /** \brief Frees all memory allocated by the routing module */
1320 void routing_exit(void) {
1321 delete routing_platf;
1324 RoutingPlatf::~RoutingPlatf()
1326 xbt_dynar_free(&p_lastRoute);
1327 finalize_rec(p_root);
1330 AS_t surf_AS_get_routing_root() {
1331 return routing_platf->p_root;
1334 const char *surf_AS_get_name(AsPtr as) {
1338 static AsPtr surf_AS_recursive_get_by_name(AsPtr current, const char * name) {
1339 xbt_dict_cursor_t cursor = NULL;
1344 if(!strcmp(current->p_name, name))
1347 xbt_dict_foreach(current->p_routingSons, cursor, key, elem) {
1348 tmp = surf_AS_recursive_get_by_name(elem, name);
1357 AsPtr surf_AS_get_by_name(const char * name) {
1358 AsPtr as = surf_AS_recursive_get_by_name(routing_platf->p_root, name);
1360 XBT_WARN("Impossible to find an AS with name %s, please check your input", name);
1364 xbt_dict_t surf_AS_get_routing_sons(AsPtr as) {
1365 return as->p_routingSons;
1368 const char *surf_AS_get_model(AsPtr as) {
1369 return as->p_modelDesc->name;
1372 xbt_dynar_t surf_AS_get_hosts(AsPtr as) {
1373 xbt_dynar_t elms = as->p_indexNetworkElm;
1374 sg_routing_edge_t relm;
1377 int count = xbt_dynar_length(elms);
1378 xbt_dynar_t res = xbt_dynar_new(sizeof(xbt_dictelm_t), NULL);
1379 for (index = 0; index < count; index++) {
1380 relm = xbt_dynar_get_as(elms, index, RoutingEdgePtr);
1381 delm = xbt_lib_get_elm_or_null(host_lib, relm->getName());
1383 xbt_dynar_push(res, &delm);
1389 void surf_AS_get_graph(AS_t as, xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges) {
1390 as->getGraph(graph, nodes, edges);