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 ROUTING_HOST_LEVEL; //Routing level
27 int SURF_CPU_LEVEL; //Surf cpu level
28 int SURF_HOST_LEVEL; //Surf host level
29 int SIMIX_STORAGE_LEVEL; //Simix storage level
30 int MSG_HOST_LEVEL; //Msg host level
31 int MSG_STORAGE_LEVEL; //Msg storage level
32 int MSG_FILE_LEVEL; //Msg file level
33 int SD_HOST_LEVEL; //Simdag host level
34 int SD_STORAGE_LEVEL; //Simdag storage level
35 int COORD_HOST_LEVEL=0; //Coordinates level
36 int NS3_HOST_LEVEL; //host node for ns3
39 * @ingroup SURF_build_api
40 * @brief A library containing all known links
43 int SD_LINK_LEVEL; //Simdag level
44 int SURF_LINK_LEVEL; //Surf level
46 xbt_lib_t as_router_lib;
47 int ROUTING_ASR_LEVEL; //Routing level
48 int COORD_ASR_LEVEL; //Coordinates level
49 int NS3_ASR_LEVEL; //host node for ns3
50 int ROUTING_PROP_ASR_LEVEL; //Where the properties are stored
52 static xbt_dict_t random_value = NULL;
55 /** @brief Retrieve a routing edge from its name
57 * Routing edges are either host and routers, whatever
59 RoutingEdgePtr sg_routing_edge_by_name_or_null(const char *name) {
60 RoutingEdgePtr net_elm = (RoutingEdgePtr) xbt_lib_get_or_null(host_lib, name, ROUTING_HOST_LEVEL);
62 net_elm = (RoutingEdgePtr) xbt_lib_get_or_null(as_router_lib, name, ROUTING_ASR_LEVEL);
67 RoutingPlatfPtr routing_platf = NULL;
68 AsPtr current_routing = NULL;
70 /* global parse functions */
71 extern xbt_dynar_t mount_list;
73 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route, surf, "Routing part of surf");
75 static void routing_parse_peer(sg_platf_peer_cbarg_t peer); /* peer bypass */
76 // static void routing_parse_Srandom(void); /* random bypass */
78 static void routing_parse_postparse(void);
80 /* this lines are only for replace use like index in the model table */
85 SURF_MODEL_DIJKSTRACACHE,
89 SURF_MODEL_TORUS_CLUSTER,
90 SURF_MODEL_FAT_TREE_CLUSTER,
93 struct s_model_type routing_models[] = {
95 "Full routing data (fast, large memory requirements, fully expressive)",
96 model_full_create, model_full_end},
98 "Floyd routing data (slow initialization, fast lookup, lesser memory requirements, shortest path routing only)",
99 model_floyd_create, model_floyd_end},
101 "Dijkstra routing data (fast initialization, slow lookup, small memory requirements, shortest path routing only)",
102 model_dijkstra_create, model_dijkstra_both_end},
104 "Dijkstra routing data (fast initialization, fast lookup, small memory requirements, shortest path routing only)",
105 model_dijkstracache_create, model_dijkstra_both_end},
106 {"none", "No routing (Unless you know what you are doing, avoid using this mode in combination with a non Constant network model).",
107 model_none_create, NULL},
108 {"Vivaldi", "Vivaldi routing",
109 model_vivaldi_create, NULL},
110 {"Cluster", "Cluster routing",
111 model_cluster_create, NULL},
112 {"Torus_Cluster", "Torus Cluster routing",
113 model_torus_cluster_create, NULL},
114 {"Fat_Tree_Cluster", "Fat Tree Cluster routing",
115 model_fat_tree_cluster_create, NULL},
116 {NULL, NULL, NULL, NULL}
120 * \brief Add a "host_link" to the network element list
122 static void parse_S_host_link(sg_platf_host_link_cbarg_t host)
124 RoutingEdgePtr info = static_cast<RoutingEdgePtr>(xbt_lib_get_or_null(host_lib, host->id, ROUTING_HOST_LEVEL));
125 xbt_assert(info, "Host '%s' not found!", host->id);
126 xbt_assert(current_routing->p_modelDesc == &routing_models[SURF_MODEL_CLUSTER] ||
127 current_routing->p_modelDesc == &routing_models[SURF_MODEL_VIVALDI],
128 "You have to be in model Cluster to use tag host_link!");
130 s_surf_parsing_link_up_down_t link_up_down;
131 link_up_down.link_up = xbt_lib_get_or_null(link_lib, host->link_up, SURF_LINK_LEVEL);
132 link_up_down.link_down = xbt_lib_get_or_null(link_lib, host->link_down, SURF_LINK_LEVEL);
134 xbt_assert(link_up_down.link_up, "Link '%s' not found!",host->link_up);
135 xbt_assert(link_up_down.link_down, "Link '%s' not found!",host->link_down);
137 if(!current_routing->p_linkUpDownList)
138 current_routing->p_linkUpDownList = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
140 // If dynar is is greater than edge id and if the host_link is already defined
141 if((int)xbt_dynar_length(current_routing->p_linkUpDownList) > info->getId() &&
142 xbt_dynar_get_as(current_routing->p_linkUpDownList, info->getId(), void*))
143 surf_parse_error("Host_link for '%s' is already defined!",host->id);
145 XBT_DEBUG("Push Host_link for host '%s' to position %d", info->getName(), info->getId());
146 xbt_dynar_set_as(current_routing->p_linkUpDownList, info->getId(), s_surf_parsing_link_up_down_t, link_up_down);
150 * \brief Add a "host" to the network element list
152 static void parse_S_host(sg_platf_host_cbarg_t host)
154 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
155 current_routing->p_hierarchy = SURF_ROUTING_BASE;
156 xbt_assert(!xbt_lib_get_or_null(host_lib, host->id, ROUTING_HOST_LEVEL),
157 "Reading a host, processing unit \"%s\" already exists", host->id);
159 RoutingEdgePtr info = new RoutingEdgeImpl(xbt_strdup(host->id),
161 SURF_NETWORK_ELEMENT_HOST,
163 info->setId(current_routing->parsePU(info));
164 xbt_lib_set(host_lib, host->id, ROUTING_HOST_LEVEL, (void *) info);
165 XBT_DEBUG("Having set name '%s' id '%d'", host->id, info->getId());
168 xbt_lib_set(storage_lib, host->id, ROUTING_STORAGE_HOST_LEVEL, (void *) mount_list);
172 if (host->coord && strcmp(host->coord, "")) {
176 if (!COORD_HOST_LEVEL)
177 xbt_die ("To use host coordinates, please add --cfg=network/coordinates:yes to your command line");
178 /* Pre-parse the host coordinates -- FIXME factorize with routers by overloading the routing->parse_PU function*/
179 xbt_dynar_t ctn_str = xbt_str_split_str(host->coord, " ");
180 xbt_dynar_t ctn = xbt_dynar_new(sizeof(double),NULL);
181 xbt_dynar_foreach(ctn_str,cursor, str) {
182 double val = atof(str);
183 xbt_dynar_push(ctn,&val);
185 xbt_dynar_shrink(ctn, 0);
186 xbt_dynar_free(&ctn_str);
187 xbt_lib_set(host_lib, host->id, COORD_HOST_LEVEL, (void *) ctn);
188 XBT_DEBUG("Having set host coordinates for '%s'",host->id);
193 * \brief Add a "router" to the network element list
195 static void parse_S_router(sg_platf_router_cbarg_t router)
197 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
198 current_routing->p_hierarchy = SURF_ROUTING_BASE;
199 xbt_assert(!xbt_lib_get_or_null(as_router_lib, router->id, ROUTING_ASR_LEVEL),
200 "Reading a router, processing unit \"%s\" already exists",
203 RoutingEdgePtr info = new RoutingEdgeImpl(xbt_strdup(router->id),
205 SURF_NETWORK_ELEMENT_ROUTER,
207 info->setId(current_routing->parsePU(info));
208 xbt_lib_set(as_router_lib, router->id, ROUTING_ASR_LEVEL, (void *) info);
209 XBT_DEBUG("Having set name '%s' id '%d'", router->id, info->getId());
211 if (router->coord && strcmp(router->coord, "")) {
215 if (!COORD_ASR_LEVEL)
216 xbt_die ("To use host coordinates, please add --cfg=network/coordinates:yes to your command line");
217 /* Pre-parse the host coordinates */
218 xbt_dynar_t ctn_str = xbt_str_split_str(router->coord, " ");
219 xbt_dynar_t ctn = xbt_dynar_new(sizeof(double),NULL);
220 xbt_dynar_foreach(ctn_str,cursor, str) {
221 double val = atof(str);
222 xbt_dynar_push(ctn,&val);
224 xbt_dynar_shrink(ctn, 0);
225 xbt_dynar_free(&ctn_str);
226 xbt_lib_set(as_router_lib, router->id, COORD_ASR_LEVEL, (void *) ctn);
227 XBT_DEBUG("Having set router coordinates for '%s'",router->id);
232 * \brief Store the route by calling the set_route function of the current routing component
234 static void parse_E_route(sg_platf_route_cbarg_t route)
236 /*FIXME:REMOVE:xbt_assert(current_routing->parse_route,
237 "no defined method \"set_route\" in \"%s\"",
238 current_routing->name);*/
240 current_routing->parseRoute(route);
244 * \brief Store the ASroute by calling the set_ASroute function of the current routing component
246 static void parse_E_ASroute(sg_platf_route_cbarg_t ASroute)
248 /*FIXME:REMOVE:xbt_assert(current_routing->parse_ASroute,
249 "no defined method \"set_ASroute\" in \"%s\"",
250 current_routing->name);*/
251 current_routing->parseASroute(ASroute);
255 * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
257 static void parse_E_bypassRoute(sg_platf_route_cbarg_t route)
259 /*FIXME:REMOVE:xbt_assert(current_routing->parse_bypassroute,
260 "Bypassing mechanism not implemented by routing '%s'",
261 current_routing->name);*/
263 current_routing->parseBypassroute(route);
267 * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
269 static void parse_E_bypassASroute(sg_platf_route_cbarg_t ASroute)
271 /*FIXME:REMOVE:xbt_assert(current_routing->parse_bypassroute,
272 "Bypassing mechanism not implemented by routing '%s'",
273 current_routing->name);*/
274 current_routing->parseBypassroute(ASroute);
277 static void routing_parse_trace(sg_platf_trace_cbarg_t trace)
279 tmgr_trace_t tmgr_trace;
280 if (!trace->file || strcmp(trace->file, "") != 0) {
281 tmgr_trace = tmgr_trace_new_from_file(trace->file);
282 } else if (strcmp(trace->pc_data, "") == 0) {
286 tmgr_trace_new_from_string(trace->id, trace->pc_data,
289 xbt_dict_set(traces_set_list, trace->id, (void *) tmgr_trace, NULL);
292 static void routing_parse_trace_connect(sg_platf_trace_connect_cbarg_t trace_connect)
294 xbt_assert(xbt_dict_get_or_null
295 (traces_set_list, trace_connect->trace),
296 "Cannot connect trace %s to %s: trace unknown",
297 trace_connect->trace,
298 trace_connect->element);
300 switch (trace_connect->kind) {
301 case SURF_TRACE_CONNECT_KIND_HOST_AVAIL:
302 xbt_dict_set(trace_connect_list_host_avail,
303 trace_connect->trace,
304 xbt_strdup(trace_connect->element), NULL);
306 case SURF_TRACE_CONNECT_KIND_POWER:
307 xbt_dict_set(trace_connect_list_power, trace_connect->trace,
308 xbt_strdup(trace_connect->element), NULL);
310 case SURF_TRACE_CONNECT_KIND_LINK_AVAIL:
311 xbt_dict_set(trace_connect_list_link_avail,
312 trace_connect->trace,
313 xbt_strdup(trace_connect->element), NULL);
315 case SURF_TRACE_CONNECT_KIND_BANDWIDTH:
316 xbt_dict_set(trace_connect_list_bandwidth,
317 trace_connect->trace,
318 xbt_strdup(trace_connect->element), NULL);
320 case SURF_TRACE_CONNECT_KIND_LATENCY:
321 xbt_dict_set(trace_connect_list_latency, trace_connect->trace,
322 xbt_strdup(trace_connect->element), NULL);
325 surf_parse_error("Cannot connect trace %s to %s: kind of trace unknown",
326 trace_connect->trace, trace_connect->element);
332 * \brief Make a new routing component to the platform
334 * Add a new autonomous system to the platform. Any elements (such as host,
335 * router or sub-AS) added after this call and before the corresponding call
336 * to sg_platf_new_AS_close() will be added to this AS.
338 * Once this function was called, the configuration concerning the used
339 * models cannot be changed anymore.
341 * @param AS_id name of this autonomous system. Must be unique in the platform
342 * @param wanted_routing_type one of Full, Floyd, Dijkstra or similar. Full list in the variable routing_models, in src/surf/surf_routing.c
344 void routing_AS_begin(sg_platf_AS_cbarg_t AS)
346 XBT_DEBUG("routing_AS_begin");
347 routing_model_description_t model = NULL;
349 xbt_assert(!xbt_lib_get_or_null
350 (as_router_lib, AS->id, ROUTING_ASR_LEVEL),
351 "The AS \"%s\" already exists", AS->id);
353 _sg_cfg_init_status = 2; /* horrible hack: direct access to the global
354 * controlling the level of configuration to prevent
355 * any further config */
357 /* search the routing model */
359 case A_surfxml_AS_routing_Cluster: model = &routing_models[SURF_MODEL_CLUSTER];break;
360 case A_surfxml_AS_routing_Cluster___torus: model = &routing_models[SURF_MODEL_TORUS_CLUSTER];break;
361 case A_surfxml_AS_routing_Cluster___fat___tree: model = &routing_models[SURF_MODEL_FAT_TREE_CLUSTER];break;
362 case A_surfxml_AS_routing_Dijkstra: model = &routing_models[SURF_MODEL_DIJKSTRA];break;
363 case A_surfxml_AS_routing_DijkstraCache: model = &routing_models[SURF_MODEL_DIJKSTRACACHE];break;
364 case A_surfxml_AS_routing_Floyd: model = &routing_models[SURF_MODEL_FLOYD];break;
365 case A_surfxml_AS_routing_Full: model = &routing_models[SURF_MODEL_FULL];break;
366 case A_surfxml_AS_routing_None: model = &routing_models[SURF_MODEL_NONE];break;
367 case A_surfxml_AS_routing_Vivaldi: model = &routing_models[SURF_MODEL_VIVALDI];break;
368 default: xbt_die("Not a valid model!!!");
372 /* make a new routing component */
373 AsPtr new_as = model->create();
375 new_as->p_modelDesc = model;
376 new_as->p_hierarchy = SURF_ROUTING_NULL;
377 new_as->p_name = xbt_strdup(AS->id);
379 RoutingEdgePtr info = new RoutingEdgeImpl(xbt_strdup(new_as->p_name),
381 SURF_NETWORK_ELEMENT_AS,
383 if (current_routing == NULL && routing_platf->p_root == NULL) {
385 /* it is the first one */
386 new_as->p_routingFather = NULL;
387 routing_platf->p_root = new_as;
389 } else if (current_routing != NULL && routing_platf->p_root != NULL) {
391 xbt_assert(!xbt_dict_get_or_null
392 (current_routing->p_routingSons, AS->id),
393 "The AS \"%s\" already exists", AS->id);
394 /* it is a part of the tree */
395 new_as->p_routingFather = current_routing;
396 /* set the father behavior */
397 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
398 current_routing->p_hierarchy = SURF_ROUTING_RECURSIVE;
399 /* add to the sons dictionary */
400 xbt_dict_set(current_routing->p_routingSons, AS->id,
401 (void *) new_as, NULL);
402 /* add to the father element list */
403 info->setId(current_routing->parseAS(info));
405 THROWF(arg_error, 0, "All defined components must belong to a AS");
408 xbt_lib_set(as_router_lib, info->getName(), ROUTING_ASR_LEVEL,
410 XBT_DEBUG("Having set name '%s' id '%d'", new_as->p_name, info->getId());
412 /* set the new current component of the tree */
413 current_routing = new_as;
414 current_routing->p_netElem = info;
419 * \brief Specify that the current description of AS is finished
421 * Once you've declared all the content of your AS, you have to close
422 * it with this call. Your AS is not usable until you call this function.
424 * @fixme: this call is not as robust as wanted: bad things WILL happen
425 * if you call it twice for the same AS, or if you forget calling it, or
426 * even if you add stuff to a closed AS
429 void routing_AS_end(sg_platf_AS_cbarg_t /*AS*/)
432 if (current_routing == NULL) {
433 THROWF(arg_error, 0, "Close an AS, but none was under construction");
435 if (current_routing->p_modelDesc->end)
436 current_routing->p_modelDesc->end(current_routing);
437 current_routing = current_routing->p_routingFather;
441 /* Aux Business methods */
444 * \brief Get the AS father and the first elements of the chain
446 * \param src the source host name
447 * \param dst the destination host name
449 * Get the common father of the to processing units, and the first different
450 * father in the chain
452 static void elements_father(sg_routing_edge_t src, sg_routing_edge_t dst,
457 xbt_assert(src && dst, "bad parameters for \"elements_father\" method");
458 #define ELEMENTS_FATHER_MAXDEPTH 16 /* increase if it is not enough */
459 AsPtr src_as, dst_as;
460 AsPtr path_src[ELEMENTS_FATHER_MAXDEPTH];
461 AsPtr path_dst[ELEMENTS_FATHER_MAXDEPTH];
469 /* (1) find the as where the src and dst are located */
470 sg_routing_edge_t src_data = src;
471 sg_routing_edge_t dst_data = dst;
472 src_as = src_data->getRcComponent();
473 dst_as = dst_data->getRcComponent();
475 char* src_name = src_data->getName();
476 char* dst_name = dst_data->getName();
479 xbt_assert(src_as && dst_as,
480 "Ask for route \"from\"(%s) or \"to\"(%s) no found", src_name, dst_name);
482 /* (2) find the path to the root routing component */
483 for (current = src_as; current != NULL; current = current->p_routingFather) {
484 if (index_src >= ELEMENTS_FATHER_MAXDEPTH)
485 xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_src");
486 path_src[index_src++] = current;
488 for (current = dst_as; current != NULL; current = current->p_routingFather) {
489 if (index_dst >= ELEMENTS_FATHER_MAXDEPTH)
490 xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_dst");
491 path_dst[index_dst++] = current;
494 /* (3) find the common father */
496 current_src = path_src[--index_src];
497 current_dst = path_dst[--index_dst];
498 } while (index_src > 0 && index_dst > 0 && current_src == current_dst);
500 /* (4) they are not in the same routing component, make the path */
501 if (current_src == current_dst)
502 father = current_src;
504 father = path_src[index_src + 1];
506 /* (5) result generation */
507 *res_father = father; /* first the common father of src and dst */
508 *res_src = current_src; /* second the first different father of src */
509 *res_dst = current_dst; /* three the first different father of dst */
511 #undef ELEMENTS_FATHER_MAXDEPTH
514 /* Global Business methods */
517 * \brief Recursive function for get_route_latency
519 * \param src the source host name
520 * \param dst the destination host name
521 * \param *route the route where the links are stored. It is either NULL or a ready to use dynar
522 * \param *latency the latency, if needed
524 * This function is called by "get_route" and "get_latency". It allows to walk
525 * recursively through the ASes tree.
527 static void _get_route_and_latency(RoutingEdgePtr src, RoutingEdgePtr dst,
528 xbt_dynar_t * links, double *latency)
530 s_sg_platf_route_cbarg_t route;
531 memset(&route,0,sizeof(route));
533 xbt_assert(src && dst, "bad parameters for \"_get_route_latency\" method");
534 XBT_DEBUG("Solve route/latency \"%s\" to \"%s\"", src->getName(), dst->getName());
536 /* Find how src and dst are interconnected */
537 AsPtr common_father, src_father, dst_father;
538 elements_father(src, dst, &common_father, &src_father, &dst_father);
539 XBT_DEBUG("elements_father: common father '%s' src_father '%s' dst_father '%s'",
540 common_father->p_name, src_father->p_name, dst_father->p_name);
542 /* Check whether a direct bypass is defined */
543 sg_platf_route_cbarg_t e_route_bypass = NULL;
544 //FIXME:REMOVE:if (common_father->get_bypass_route)
546 e_route_bypass = common_father->getBypassRoute(src, dst, latency);
548 /* Common ancestor is kind enough to declare a bypass route from src to dst -- use it and bail out */
549 if (e_route_bypass) {
550 xbt_dynar_merge(links, &e_route_bypass->link_list);
551 generic_free_route(e_route_bypass);
555 /* If src and dst are in the same AS, life is good */
556 if (src_father == dst_father) { /* SURF_ROUTING_BASE */
557 route.link_list = *links;
558 common_father->getRouteAndLatency(src, dst, &route, latency);
559 // if vivaldi latency+=vivaldi(src,dst)
563 /* Not in the same AS, no bypass. We'll have to find our path between the ASes recursively*/
565 route.link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
566 // Find the net_card corresponding to father
567 RoutingEdgePtr src_father_net_elm = src_father->p_netElem;
568 RoutingEdgePtr dst_father_net_elm = dst_father->p_netElem;
570 common_father->getRouteAndLatency(src_father_net_elm, dst_father_net_elm,
573 xbt_assert((route.gw_src != NULL) && (route.gw_dst != NULL),
574 "bad gateways for route from \"%s\" to \"%s\"", src->getName(), dst->getName());
576 sg_routing_edge_t src_gateway_net_elm = route.gw_src;
577 sg_routing_edge_t dst_gateway_net_elm = route.gw_dst;
579 /* If source gateway is not our source, we have to recursively find our way up to this point */
580 if (src != src_gateway_net_elm)
581 _get_route_and_latency(src, src_gateway_net_elm, links, latency);
582 xbt_dynar_merge(links, &route.link_list);
584 /* If dest gateway is not our destination, we have to recursively find our way from this point */
585 if (dst_gateway_net_elm != dst)
586 _get_route_and_latency(dst_gateway_net_elm, dst, links, latency);
588 // if vivaldi latency+=vivaldi(src_gateway,dst_gateway)
591 AS_t surf_platf_get_root(routing_platf_t platf){
592 return platf->p_root;
595 e_surf_network_element_type_t surf_routing_edge_get_rc_type(sg_routing_edge_t edge){
596 return edge->getRcType();
601 * \brief Find a route between hosts
603 * \param src the network_element_t for src host
604 * \param dst the network_element_t for dst host
605 * \param route where to store the list of links.
606 * If *route=NULL, create a short lived dynar. Else, fill the provided dynar
607 * \param latency where to store the latency experienced on the path (or NULL if not interested)
608 * It is the caller responsability to initialize latency to 0 (we add to provided route)
611 * walk through the routing components tree and find a route between hosts
612 * by calling the differents "get_route" functions in each routing component.
614 void RoutingPlatf::getRouteAndLatency(RoutingEdgePtr src, RoutingEdgePtr dst,
615 xbt_dynar_t* route, double *latency)
617 XBT_DEBUG("routing_get_route_and_latency from %s to %s", src->getName(), dst->getName());
619 xbt_dynar_reset(routing_platf->p_lastRoute);
620 *route = routing_platf->p_lastRoute;
623 _get_route_and_latency(src, dst, route, latency);
625 xbt_assert(!latency || *latency >= 0.0,
626 "negative latency on route between \"%s\" and \"%s\"", src->getName(), dst->getName());
629 xbt_dynar_t RoutingPlatf::getOneLinkRoutes(){
630 return recursiveGetOneLinkRoutes(p_root);
633 xbt_dynar_t RoutingPlatf::recursiveGetOneLinkRoutes(AsPtr rc)
635 xbt_dynar_t ret = xbt_dynar_new(sizeof(OnelinkPtr), xbt_free_f);
637 //adding my one link routes
638 xbt_dynar_t onelink_mine = rc->getOneLinkRoutes();
640 xbt_dynar_merge(&ret,&onelink_mine);
644 xbt_dict_cursor_t cursor = NULL;
646 xbt_dict_foreach(rc->p_routingSons, cursor, key, rc_child) {
647 xbt_dynar_t onelink_child = recursiveGetOneLinkRoutes(rc_child);
649 xbt_dynar_merge(&ret,&onelink_child);
654 e_surf_network_element_type_t routing_get_network_element_type(const char *name)
656 RoutingEdgePtr rc = sg_routing_edge_by_name_or_null(name);
658 return rc->getRcType();
660 return SURF_NETWORK_ELEMENT_NULL;
664 * \brief Generic method: create the global routing schema
666 * Make a global routing structure and set all the parsing functions.
668 void routing_model_create( void *loopback)
670 /* config the uniq global routing */
671 routing_platf = new RoutingPlatf();
672 routing_platf->p_root = NULL;
673 routing_platf->p_loopback = loopback;
674 routing_platf->p_lastRoute = xbt_dynar_new(sizeof(sg_routing_link_t),NULL);
675 /* no current routing at moment */
676 current_routing = NULL;
680 /* ************************************************** */
681 /* ********** PATERN FOR NEW ROUTING **************** */
683 /* The minimal configuration of a new routing model need the next functions,
684 * also you need to set at the start of the file, the new model in the model
685 * list. Remember keep the null ending of the list.
687 /*** Routing model structure ***/
689 // s_routing_component_t generic_routing;
690 // /* things that your routing model need */
691 // } s_routing_component_NEW_t,*routing_component_NEW_t;
693 /*** Parse routing model functions ***/
694 // static void model_NEW_set_processing_unit(routing_component_t rc, const char* name) {}
695 // static void model_NEW_set_autonomous_system(routing_component_t rc, const char* name) {}
696 // static void model_NEW_set_route(routing_component_t rc, const char* src, const char* dst, route_t route) {}
697 // static void model_NEW_set_ASroute(routing_component_t rc, const char* src, const char* dst, route_extended_t route) {}
698 // static void model_NEW_set_bypassroute(routing_component_t rc, const char* src, const char* dst, route_extended_t e_route) {}
700 /*** Business methods ***/
701 // static route_extended_t NEW_get_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
702 // static route_extended_t NEW_get_bypass_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
703 // static void NEW_finalize(routing_component_t rc) { xbt_free(rc);}
705 /*** Creation routing model functions ***/
706 // static void* model_NEW_create(void) {
707 // routing_component_NEW_t new_component = xbt_new0(s_routing_component_NEW_t,1);
708 // new_component->generic_routing.set_processing_unit = model_NEW_set_processing_unit;
709 // new_component->generic_routing.set_autonomous_system = model_NEW_set_autonomous_system;
710 // new_component->generic_routing.set_route = model_NEW_set_route;
711 // new_component->generic_routing.set_ASroute = model_NEW_set_ASroute;
712 // new_component->generic_routing.set_bypassroute = model_NEW_set_bypassroute;
713 // new_component->generic_routing.get_route = NEW_get_route;
714 // new_component->generic_routing.get_bypass_route = NEW_get_bypass_route;
715 // new_component->generic_routing.finalize = NEW_finalize;
716 // /* initialization of internal structures */
717 // return new_component;
719 // static void model_NEW_load(void) {} /* mandatory */
720 // static void model_NEW_unload(void) {} /* mandatory */
721 // static void model_NEW_end(void) {} /* mandatory */
723 /* ************************************************************************** */
724 /* ************************* GENERIC PARSE FUNCTIONS ************************ */
726 void routing_cluster_add_backbone(void* bb) {
727 xbt_assert(current_routing->p_modelDesc == &routing_models[SURF_MODEL_CLUSTER],
728 "You have to be in model Cluster to use tag backbone!");
729 xbt_assert(!surf_as_cluster_get_backbone(current_routing), "The backbone link is already defined!");
730 surf_as_cluster_set_backbone(current_routing, bb);
731 XBT_DEBUG("Add a backbone to AS '%s'", current_routing->p_name);
734 static void routing_parse_cabinet(sg_platf_cabinet_cbarg_t cabinet)
737 char *groups , *host_id , *link_id = NULL;
739 xbt_dynar_t radical_elements;
740 xbt_dynar_t radical_ends;
743 radical_elements = xbt_str_split(cabinet->radical, ",");
744 xbt_dynar_foreach(radical_elements, iter, groups) {
746 radical_ends = xbt_str_split(groups, "-");
747 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
749 switch (xbt_dynar_length(radical_ends)) {
754 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
757 surf_parse_error("Malformed radical");
760 s_sg_platf_host_cbarg_t host;
761 memset(&host, 0, sizeof(host));
762 host.initial_state = SURF_RESOURCE_ON;
764 host.power_scale = 1.0;
765 host.core_amount = 1;
767 s_sg_platf_link_cbarg_t link;
768 memset(&link, 0, sizeof(link));
769 link.state = SURF_RESOURCE_ON;
770 link.policy = SURF_LINK_FULLDUPLEX;
771 link.latency = cabinet->lat;
772 link.bandwidth = cabinet->bw;
774 s_sg_platf_host_link_cbarg_t host_link;
775 memset(&host_link, 0, sizeof(host_link));
777 for (i = start; i <= end; i++) {
778 host_id = bprintf("%s%d%s",cabinet->prefix,i,cabinet->suffix);
779 link_id = bprintf("link_%s%d%s",cabinet->prefix,i,cabinet->suffix);
782 xbt_dynar_t power_state_list = xbt_dynar_new(sizeof(double), NULL);
783 xbt_dynar_push(power_state_list,&cabinet->power);
784 host.power_peak = power_state_list;
785 sg_platf_new_host(&host);
786 sg_platf_new_link(&link);
788 char* link_up = bprintf("%s_UP",link_id);
789 char* link_down = bprintf("%s_DOWN",link_id);
790 host_link.id = host_id;
791 host_link.link_up = link_up;
792 host_link.link_down = link_down;
793 sg_platf_new_host_link(&host_link);
801 xbt_dynar_free(&radical_ends);
803 xbt_dynar_free(&radical_elements);
806 static void routing_parse_cluster(sg_platf_cluster_cbarg_t cluster)
808 char *host_id, *groups, *link_id = NULL;
809 xbt_dict_t patterns = NULL;
812 s_sg_platf_host_cbarg_t host;
813 s_sg_platf_link_cbarg_t link;
817 xbt_dynar_t radical_elements;
818 xbt_dynar_t radical_ends;
820 if ((cluster->availability_trace && strcmp(cluster->availability_trace, ""))
821 || (cluster->state_trace && strcmp(cluster->state_trace, ""))) {
822 patterns = xbt_dict_new_homogeneous(xbt_free_f);
823 xbt_dict_set(patterns, "id", xbt_strdup(cluster->id), NULL);
824 xbt_dict_set(patterns, "prefix", xbt_strdup(cluster->prefix), NULL);
825 xbt_dict_set(patterns, "suffix", xbt_strdup(cluster->suffix), NULL);
828 /* parse the topology attribute. If we are not in a flat cluster,
829 * switch to the right mode and initialize the routing with
830 * the parameters in topo_parameters attribute
832 s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
835 if(cluster->topology == SURF_CLUSTER_TORUS){
836 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Torus_Cluster\">", cluster->id);
837 AS.routing = A_surfxml_AS_routing_Cluster___torus;
838 sg_platf_new_AS_begin(&AS);
839 ((AsClusterTorusPtr)current_routing)->parse_specific_arguments(cluster);
841 else if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
842 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Fat_Tree_Cluster\">", cluster->id);
843 AS.routing = A_surfxml_AS_routing_Cluster___fat___tree;
844 sg_platf_new_AS_begin(&AS);
845 ((AsClusterFatTree*)current_routing)->parse_specific_arguments(cluster);
849 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", cluster->id);
850 AS.routing = A_surfxml_AS_routing_Cluster;
851 sg_platf_new_AS_begin(&AS);
854 if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
855 ((AsClusterPtr)current_routing)->p_nb_links_per_node++;
856 ((AsClusterPtr)current_routing)->p_has_loopback=1;
859 if(cluster->limiter_link!=0){
860 ((AsClusterPtr)current_routing)->p_nb_links_per_node++;
861 ((AsClusterPtr)current_routing)->p_has_limiter=1;
866 current_routing->p_linkUpDownList
867 = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
870 radical_elements = xbt_str_split(cluster->radical, ",");
871 xbt_dynar_foreach(radical_elements, iter, groups) {
873 radical_ends = xbt_str_split(groups, "-");
874 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
876 switch (xbt_dynar_length(radical_ends)) {
881 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
884 surf_parse_error("Malformed radical");
887 for (i = start; i <= end; i++) {
889 bprintf("%s%d%s", cluster->prefix, i, cluster->suffix);
890 link_id = bprintf("%s_link_%d", cluster->id, i);
892 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\">", host_id, cluster->power);
894 memset(&host, 0, sizeof(host));
896 if ((cluster->properties != NULL) && (!xbt_dict_is_empty(cluster->properties))) {
897 xbt_dict_cursor_t cursor=NULL;
899 host.properties = xbt_dict_new();
901 xbt_dict_foreach(cluster->properties,cursor,key,data) {
902 xbt_dict_set(host.properties, key, xbt_strdup(data),free);
905 if (cluster->availability_trace && strcmp(cluster->availability_trace, "")) {
906 xbt_dict_set(patterns, "radical", bprintf("%d", i), NULL);
907 char *avail_file = xbt_str_varsubst(cluster->availability_trace, patterns);
908 XBT_DEBUG("\tavailability_file=\"%s\"", avail_file);
909 host.power_trace = tmgr_trace_new_from_file(avail_file);
910 xbt_free(avail_file);
912 XBT_DEBUG("\tavailability_file=\"\"");
915 if (cluster->state_trace && strcmp(cluster->state_trace, "")) {
916 char *avail_file = xbt_str_varsubst(cluster->state_trace, patterns);
917 XBT_DEBUG("\tstate_file=\"%s\"", avail_file);
918 host.state_trace = tmgr_trace_new_from_file(avail_file);
919 xbt_free(avail_file);
921 XBT_DEBUG("\tstate_file=\"\"");
924 xbt_dynar_t power_state_list = xbt_dynar_new(sizeof(double), NULL);
925 xbt_dynar_push(power_state_list,&cluster->power);
926 host.power_peak = power_state_list;
929 //host.power_peak = cluster->power;
930 host.power_scale = 1.0;
931 host.core_amount = cluster->core_amount;
932 host.initial_state = SURF_RESOURCE_ON;
934 sg_platf_new_host(&host);
935 XBT_DEBUG("</host>");
937 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_id,
938 cluster->bw, cluster->lat);
941 s_surf_parsing_link_up_down_t info_lim, info_loop;
942 // All links are saved in a matrix;
943 // every row describes a single node; every node
944 // may have multiple links.
945 // the first column may store a link from x to x if p_has_loopback is set
946 // the second column may store a limiter link if p_has_limiter is set
947 // other columns are to store one or more link for the node
949 //add a loopback link
950 if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
951 char *tmp_link = bprintf("%s_loopback", link_id);
952 XBT_DEBUG("<loopback\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
953 cluster->limiter_link);
956 memset(&link, 0, sizeof(link));
958 link.bandwidth = cluster->loopback_bw;
959 link.latency = cluster->loopback_lat;
960 link.state = SURF_RESOURCE_ON;
961 link.policy = SURF_LINK_FATPIPE;
962 sg_platf_new_link(&link);
964 xbt_lib_get_or_null(link_lib, tmp_link, SURF_LINK_LEVEL);
965 info_loop.link_down = info_loop.link_up;
967 xbt_dynar_set(current_routing->p_linkUpDownList, rankId*((AsClusterPtr)current_routing)->p_nb_links_per_node, &info_loop);
970 //add a limiter link (shared link to account for maximal bandwidth of the node)
971 if(cluster->limiter_link!=0){
972 char *tmp_link = bprintf("%s_limiter", link_id);
973 XBT_DEBUG("<limiter\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
974 cluster->limiter_link);
977 memset(&link, 0, sizeof(link));
979 link.bandwidth = cluster->limiter_link;
981 link.state = SURF_RESOURCE_ON;
982 link.policy = SURF_LINK_SHARED;
983 sg_platf_new_link(&link);
985 xbt_lib_get_or_null(link_lib, tmp_link, SURF_LINK_LEVEL);
986 info_lim.link_down = info_lim.link_up;
988 xbt_dynar_set(current_routing->p_linkUpDownList,
989 rankId*((AsClusterPtr)current_routing)->p_nb_links_per_node + ((AsClusterPtr)current_routing)->p_has_loopback ,
995 //call the cluster function that adds the others links
996 if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
997 ((AsClusterFatTree*) current_routing)->addProcessingNode(i);
1000 ((AsClusterPtr)current_routing)->create_links_for_node(cluster, i, rankId, rankId*
1001 ((AsClusterPtr)current_routing)->p_nb_links_per_node
1002 + ((AsClusterPtr)current_routing)->p_has_loopback
1003 + ((AsClusterPtr)current_routing)->p_has_limiter );
1010 xbt_dynar_free(&radical_ends);
1012 xbt_dynar_free(&radical_elements);
1014 // For fat trees, the links must be created once all nodes have been added
1015 if(cluster->topology == SURF_CLUSTER_FAT_TREE) {
1016 ((AsClusterFatTree*)current_routing)->create_links();
1018 // Add a router. It is magically used thanks to the way in which surf_routing_cluster is written,
1019 // and it's very useful to connect clusters together
1021 XBT_DEBUG("<router id=\"%s\"/>", cluster->router_id);
1023 s_sg_platf_router_cbarg_t router;
1024 memset(&router, 0, sizeof(router));
1025 router.id = cluster->router_id;
1027 if (!router.id || !strcmp(router.id, ""))
1029 bprintf("%s%s_router%s", cluster->prefix, cluster->id,
1031 sg_platf_new_router(&router);
1032 ((AsClusterPtr)current_routing)->p_router = (RoutingEdgePtr) xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL);
1036 if ((cluster->bb_bw != 0) || (cluster->bb_lat != 0)) {
1037 char *link_backbone = bprintf("%s_backbone", cluster->id);
1038 XBT_DEBUG("<link\tid=\"%s\" bw=\"%f\" lat=\"%f\"/>", link_backbone,
1039 cluster->bb_bw, cluster->bb_lat);
1041 memset(&link, 0, sizeof(link));
1042 link.id = link_backbone;
1043 link.bandwidth = cluster->bb_bw;
1044 link.latency = cluster->bb_lat;
1045 link.state = SURF_RESOURCE_ON;
1046 link.policy = cluster->bb_sharing_policy;
1048 sg_platf_new_link(&link);
1050 routing_cluster_add_backbone(xbt_lib_get_or_null(link_lib, link_backbone, SURF_LINK_LEVEL));
1052 free(link_backbone);
1056 sg_platf_new_AS_end();
1058 xbt_dict_free(&patterns); // no op if it were never set
1061 static void routing_parse_postparse(void) {
1062 xbt_dict_free(&random_value);
1065 static void routing_parse_peer(sg_platf_peer_cbarg_t peer)
1067 char *host_id = NULL;
1068 char *link_id = NULL;
1069 char *router_id = NULL;
1072 host_id = HOST_PEER(peer->id);
1073 link_id = LINK_PEER(peer->id);
1074 router_id = ROUTER_PEER(peer->id);
1076 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", peer->id);
1077 s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
1079 AS.routing = A_surfxml_AS_routing_Cluster;
1080 sg_platf_new_AS_begin(&AS);
1082 current_routing->p_linkUpDownList = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
1084 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\"/>", host_id, peer->power);
1085 s_sg_platf_host_cbarg_t host;
1086 memset(&host, 0, sizeof(host));
1087 host.initial_state = SURF_RESOURCE_ON;
1090 xbt_dynar_t power_state_list = xbt_dynar_new(sizeof(double), NULL);
1091 xbt_dynar_push(power_state_list,&peer->power);
1092 host.power_peak = power_state_list;
1094 //host.power_peak = peer->power;
1095 host.power_scale = 1.0;
1096 host.power_trace = peer->availability_trace;
1097 host.state_trace = peer->state_trace;
1098 host.core_amount = 1;
1099 sg_platf_new_host(&host);
1101 s_sg_platf_link_cbarg_t link;
1102 memset(&link, 0, sizeof(link));
1103 link.state = SURF_RESOURCE_ON;
1104 link.policy = SURF_LINK_SHARED;
1105 link.latency = peer->lat;
1107 char* link_up = bprintf("%s_UP",link_id);
1108 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_up,
1109 peer->bw_out, peer->lat);
1111 link.bandwidth = peer->bw_out;
1112 sg_platf_new_link(&link);
1114 char* link_down = bprintf("%s_DOWN",link_id);
1115 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_down,
1116 peer->bw_in, peer->lat);
1117 link.id = link_down;
1118 link.bandwidth = peer->bw_in;
1119 sg_platf_new_link(&link);
1121 XBT_DEBUG("<host_link\tid=\"%s\"\tup=\"%s\"\tdown=\"%s\" />", host_id,link_up,link_down);
1122 s_sg_platf_host_link_cbarg_t host_link;
1123 memset(&host_link, 0, sizeof(host_link));
1124 host_link.id = host_id;
1125 host_link.link_up = link_up;
1126 host_link.link_down = link_down;
1127 sg_platf_new_host_link(&host_link);
1129 XBT_DEBUG("<router id=\"%s\"/>", router_id);
1130 s_sg_platf_router_cbarg_t router;
1131 memset(&router, 0, sizeof(router));
1132 router.id = router_id;
1133 router.coord = peer->coord;
1134 sg_platf_new_router(&router);
1135 static_cast<AsClusterPtr>(current_routing)->p_router = static_cast<RoutingEdgePtr>(xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL));
1138 sg_platf_new_AS_end();
1141 //xbt_dynar_free(&tab_elements_num);
1149 // static void routing_parse_Srandom(void)
1151 // double mean, std, min, max, seed;
1152 // char *random_id = A_surfxml_random_id;
1153 // char *random_radical = A_surfxml_random_radical;
1154 // char *rd_name = NULL;
1156 // mean = surf_parse_get_double(A_surfxml_random_mean);
1157 // std = surf_parse_get_double(A_surfxml_random_std___deviation);
1158 // min = surf_parse_get_double(A_surfxml_random_min);
1159 // max = surf_parse_get_double(A_surfxml_random_max);
1160 // seed = surf_parse_get_double(A_surfxml_random_seed);
1164 // random_data_t random = xbt_new0(s_random_data_t, 1);
1167 // xbt_dynar_t radical_elements;
1168 // unsigned int iter;
1171 // xbt_dynar_t radical_ends;
1173 // switch (A_surfxml_random_generator) {
1174 // case AU_surfxml_random_generator:
1175 // case A_surfxml_random_generator_NONE:
1176 // random->generator = NONE;
1178 // case A_surfxml_random_generator_DRAND48:
1179 // random->generator = DRAND48;
1181 // case A_surfxml_random_generator_RAND:
1182 // random->generator = RAND;
1184 // case A_surfxml_random_generator_RNGSTREAM:
1185 // random->generator = RNGSTREAM;
1188 // surf_parse_error("Invalid random generator");
1191 // random->seed = seed;
1192 // random->min = min;
1193 // random->max = max;
1195 // /* Check user stupidities */
1197 // THROWF(arg_error, 0, "random->max < random->min (%f < %f)", max, min);
1199 // THROWF(arg_error, 0, "random->mean < random->min (%f < %f)", mean, min);
1201 // THROWF(arg_error, 0, "random->mean > random->max (%f > %f)", mean, max);
1203 // /* normalize the mean and standard deviation before storing */
1204 // random->mean = (mean - min) / (max - min);
1205 // random->std = std / (max - min);
1207 // if (random->mean * (1 - random->mean) < random->std * random->std)
1208 // THROWF(arg_error, 0, "Invalid mean and standard deviation (%f and %f)",
1209 // random->mean, random->std);
1212 // ("id = '%s' min = '%f' max = '%f' mean = '%f' std_deviatinon = '%f' generator = '%d' seed = '%ld' radical = '%s'",
1213 // random_id, random->min, random->max, random->mean, random->std,
1214 // (int)random->generator, random->seed, random_radical);
1216 // if (!random_value)
1217 // random_value = xbt_dict_new_homogeneous(free);
1219 // if (!strcmp(random_radical, "")) {
1220 // res = random_generate(random);
1221 // rd_value = bprintf("%f", res);
1222 // xbt_dict_set(random_value, random_id, rd_value, NULL);
1224 // radical_elements = xbt_str_split(random_radical, ",");
1225 // xbt_dynar_foreach(radical_elements, iter, groups) {
1226 // radical_ends = xbt_str_split(groups, "-");
1227 // switch (xbt_dynar_length(radical_ends)) {
1229 // xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1230 // "Custom Random '%s' already exists !", random_id);
1231 // res = random_generate(random);
1233 // bprintf("%s%d", random_id,
1234 // atoi(xbt_dynar_getfirst_as(radical_ends, char *)));
1235 // xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1236 // xbt_free(tmpbuf);
1240 // start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
1241 // end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
1242 // for (i = start; i <= end; i++) {
1243 // xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1244 // "Custom Random '%s' already exists !", bprintf("%s%d",
1247 // res = random_generate(random);
1248 // tmpbuf = bprintf("%s%d", random_id, i);
1249 // xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1250 // xbt_free(tmpbuf);
1254 // XBT_CRITICAL("Malformed radical");
1257 // res = random_generate(random);
1258 // rd_name = bprintf("%s_router", random_id);
1259 // rd_value = bprintf("%f", res);
1260 // xbt_dict_set(random_value, rd_name, rd_value, NULL);
1262 // xbt_dynar_free(&radical_ends);
1265 // xbt_dynar_free(&radical_elements);
1269 static void check_disk_attachment()
1271 xbt_lib_cursor_t cursor;
1274 RoutingEdgePtr host_elm;
1275 xbt_lib_foreach(storage_lib, cursor, key, data) {
1276 if(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL) != NULL) {
1277 StoragePtr storage = static_cast<StoragePtr>(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL));
1278 host_elm = sg_routing_edge_by_name_or_null(storage->p_attach);
1280 surf_parse_error("Unable to attach storage %s: host %s doesn't exist.", storage->getName(), storage->p_attach);
1285 void routing_register_callbacks()
1287 sg_platf_host_add_cb(parse_S_host);
1288 sg_platf_router_add_cb(parse_S_router);
1289 sg_platf_host_link_add_cb(parse_S_host_link);
1290 sg_platf_route_add_cb(parse_E_route);
1291 sg_platf_ASroute_add_cb(parse_E_ASroute);
1292 sg_platf_bypassRoute_add_cb(parse_E_bypassRoute);
1293 sg_platf_bypassASroute_add_cb(parse_E_bypassASroute);
1295 sg_platf_cluster_add_cb(routing_parse_cluster);
1296 sg_platf_cabinet_add_cb(routing_parse_cabinet);
1298 sg_platf_peer_add_cb(routing_parse_peer);
1299 sg_platf_postparse_add_cb(routing_parse_postparse);
1300 sg_platf_postparse_add_cb(check_disk_attachment);
1302 /* we care about the ASes while parsing the platf. Incredible, isnt it? */
1303 sg_platf_AS_end_add_cb(routing_AS_end);
1304 sg_platf_AS_begin_add_cb(routing_AS_begin);
1306 sg_platf_trace_add_cb(routing_parse_trace);
1307 sg_platf_trace_connect_add_cb(routing_parse_trace_connect);
1309 instr_routing_define_callbacks();
1313 * \brief Recursive function for finalize
1315 * \param rc the source host name
1317 * This fuction is call by "finalize". It allow to finalize the
1318 * AS or routing components. It delete all the structures.
1320 static void finalize_rec(AsPtr as) {
1321 xbt_dict_cursor_t cursor = NULL;
1325 xbt_dict_foreach(as->p_routingSons, cursor, key, elem) {
1332 /** \brief Frees all memory allocated by the routing module */
1333 void routing_exit(void) {
1334 delete routing_platf;
1337 RoutingPlatf::~RoutingPlatf()
1339 xbt_dynar_free(&p_lastRoute);
1340 finalize_rec(p_root);
1343 AS_t surf_AS_get_routing_root() {
1344 return routing_platf->p_root;
1347 const char *surf_AS_get_name(AsPtr as) {
1351 static AsPtr surf_AS_recursive_get_by_name(AsPtr current, const char * name) {
1352 xbt_dict_cursor_t cursor = NULL;
1357 if(!strcmp(current->p_name, name))
1360 xbt_dict_foreach(current->p_routingSons, cursor, key, elem) {
1361 tmp = surf_AS_recursive_get_by_name(elem, name);
1370 AsPtr surf_AS_get_by_name(const char * name) {
1371 AsPtr as = surf_AS_recursive_get_by_name(routing_platf->p_root, name);
1373 XBT_WARN("Impossible to find an AS with name %s, please check your input", name);
1377 xbt_dict_t surf_AS_get_routing_sons(AsPtr as) {
1378 return as->p_routingSons;
1381 const char *surf_AS_get_model(AsPtr as) {
1382 return as->p_modelDesc->name;
1385 xbt_dynar_t surf_AS_get_hosts(AsPtr as) {
1386 xbt_dynar_t elms = as->p_indexNetworkElm;
1387 sg_routing_edge_t relm;
1390 int count = xbt_dynar_length(elms);
1391 xbt_dynar_t res = xbt_dynar_new(sizeof(xbt_dictelm_t), NULL);
1392 for (index = 0; index < count; index++) {
1393 relm = xbt_dynar_get_as(elms, index, RoutingEdgePtr);
1394 delm = xbt_lib_get_elm_or_null(host_lib, relm->getName());
1396 xbt_dynar_push(res, &delm);
1402 void surf_AS_get_graph(AS_t as, xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges) {
1403 as->getGraph(graph, nodes, edges);