1 /* Copyright (c) 2009-2011, 2013-2015. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
7 #include "surf_routing.hpp"
8 #include "surf_routing_private.hpp"
9 #include "surf_routing_cluster.hpp"
10 #include "surf_routing_cluster_torus.hpp"
11 #include "surf_routing_cluster_fat_tree.hpp"
13 #include "simgrid/platf_interface.h" // platform creation API internal interface
14 #include "simgrid/sg_config.h"
15 #include "storage_interface.hpp"
17 #include "surf/surfxml_parse_values.h"
23 surf_callback(void, RoutingEdge*) routingEdgeCreatedCallbacks;
26 * @ingroup SURF_build_api
27 * @brief A library containing all known hosts
31 int SURF_HOST_LEVEL; //Surf host level
32 int COORD_HOST_LEVEL=0; //Coordinates level
33 int NS3_HOST_LEVEL; //host node for ns3
35 int MSG_FILE_LEVEL; //Msg file level
37 int SIMIX_STORAGE_LEVEL; //Simix storage level
38 int MSG_STORAGE_LEVEL; //Msg storage level
39 int SD_STORAGE_LEVEL; //Simdag storage level
41 xbt_lib_t as_router_lib;
42 int ROUTING_ASR_LEVEL; //Routing level
43 int COORD_ASR_LEVEL; //Coordinates level
44 int NS3_ASR_LEVEL; //host node for ns3
45 int ROUTING_PROP_ASR_LEVEL; //Where the properties are stored
47 static xbt_dict_t random_value = NULL;
50 /** @brief Retrieve a routing edge from its name
52 * Routing edges are either host and routers, whatever
54 RoutingEdge *sg_routing_edge_by_name_or_null(const char *name) {
55 sg_host_t h = sg_host_by_name(name);
56 RoutingEdge *net_elm = h==NULL?NULL: sg_host_edge(h);
58 net_elm = (RoutingEdge*) xbt_lib_get_or_null(as_router_lib, name, ROUTING_ASR_LEVEL);
63 RoutingPlatf *routing_platf = NULL;
65 /* global parse functions */
66 extern xbt_dynar_t mount_list;
68 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route, surf, "Routing part of surf");
70 /** The current AS in the parsing */
71 static As *current_routing = NULL;
72 As* routing_get_current()
74 return current_routing;
77 static void routing_parse_peer(sg_platf_peer_cbarg_t peer); /* peer bypass */
78 // static void routing_parse_Srandom(void); /* random bypass */
80 static void routing_parse_postparse(void);
82 /* this lines are only for replace use like index in the model table */
87 SURF_MODEL_DIJKSTRACACHE,
91 SURF_MODEL_TORUS_CLUSTER,
92 SURF_MODEL_FAT_TREE_CLUSTER,
95 struct s_model_type routing_models[] = {
97 "Full routing data (fast, large memory requirements, fully expressive)",
98 model_full_create, model_full_end},
100 "Floyd routing data (slow initialization, fast lookup, lesser memory requirements, shortest path routing only)",
101 model_floyd_create, model_floyd_end},
103 "Dijkstra routing data (fast initialization, slow lookup, small memory requirements, shortest path routing only)",
104 model_dijkstra_create, model_dijkstra_both_end},
106 "Dijkstra routing data (fast initialization, fast lookup, small memory requirements, shortest path routing only)",
107 model_dijkstracache_create, model_dijkstra_both_end},
108 {"none", "No routing (Unless you know what you are doing, avoid using this mode in combination with a non Constant network model).",
109 model_none_create, NULL},
110 {"Vivaldi", "Vivaldi routing",
111 model_vivaldi_create, NULL},
112 {"Cluster", "Cluster routing",
113 model_cluster_create, NULL},
114 {"Torus_Cluster", "Torus Cluster routing",
115 model_torus_cluster_create, NULL},
116 {"Fat_Tree_Cluster", "Fat Tree Cluster routing",
117 model_fat_tree_cluster_create, NULL},
118 {NULL, NULL, NULL, NULL}
122 * \brief Add a "host_link" to the network element list
124 static void parse_S_host(sg_platf_host_link_cbarg_t host)
126 RoutingEdge *info = sg_host_edge(sg_host_by_name(host->id));
127 xbt_assert(info, "Host '%s' not found!", host->id);
128 xbt_assert(current_routing->p_modelDesc == &routing_models[SURF_MODEL_CLUSTER] ||
129 current_routing->p_modelDesc == &routing_models[SURF_MODEL_VIVALDI],
130 "You have to be in model Cluster to use tag host_link!");
132 s_surf_parsing_link_up_down_t link_up_down;
133 link_up_down.link_up = Link::byName(host->link_up);
134 link_up_down.link_down = Link::byName(host->link_down);
136 xbt_assert(link_up_down.link_up, "Link '%s' not found!",host->link_up);
137 xbt_assert(link_up_down.link_down, "Link '%s' not found!",host->link_down);
139 if(!current_routing->p_linkUpDownList)
140 current_routing->p_linkUpDownList = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
142 // If dynar is is greater than edge id and if the host_link is already defined
143 if((int)xbt_dynar_length(current_routing->p_linkUpDownList) > info->getId() &&
144 xbt_dynar_get_as(current_routing->p_linkUpDownList, info->getId(), void*))
145 surf_parse_error("Host_link for '%s' is already defined!",host->id);
147 XBT_DEBUG("Push Host_link for host '%s' to position %d", info->getName(), info->getId());
148 xbt_dynar_set_as(current_routing->p_linkUpDownList, info->getId(), s_surf_parsing_link_up_down_t, link_up_down);
152 * \brief Add a "host" to the network element list
154 RoutingEdge *routing_add_host(As* current_routing, sg_platf_host_cbarg_t host)
156 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
157 current_routing->p_hierarchy = SURF_ROUTING_BASE;
158 xbt_assert(!sg_host_by_name(host->id),
159 "Reading a host, processing unit \"%s\" already exists", host->id);
161 RoutingEdge *routingEdge = new RoutingEdgeImpl(xbt_strdup(host->id),
163 SURF_NETWORK_ELEMENT_HOST,
165 routingEdge->setId(current_routing->parsePU(routingEdge));
166 sg_host_edge_set(sg_host_by_name_or_create(host->id), routingEdge);
167 XBT_DEBUG("Having set name '%s' id '%d'", host->id, routingEdge->getId());
168 routingEdgeCreatedCallbacks(routingEdge);
171 xbt_lib_set(storage_lib, host->id, ROUTING_STORAGE_HOST_LEVEL, (void *) mount_list);
175 if (host->coord && strcmp(host->coord, "")) {
179 if (!COORD_HOST_LEVEL)
180 xbt_die ("To use host coordinates, please add --cfg=network/coordinates:yes to your command line");
181 /* Pre-parse the host coordinates -- FIXME factorize with routers by overloading the routing->parse_PU function*/
182 xbt_dynar_t ctn_str = xbt_str_split_str(host->coord, " ");
183 xbt_dynar_t ctn = xbt_dynar_new(sizeof(double),NULL);
184 xbt_dynar_foreach(ctn_str,cursor, str) {
185 double val = atof(str);
186 xbt_dynar_push(ctn,&val);
188 xbt_dynar_shrink(ctn, 0);
189 xbt_dynar_free(&ctn_str);
190 xbt_lib_set(host_lib, host->id, COORD_HOST_LEVEL, (void *) ctn);
191 XBT_DEBUG("Having set host coordinates for '%s'",host->id);
198 * \brief Add a "router" to the network element list
200 void sg_platf_new_router(sg_platf_router_cbarg_t router)
202 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
203 current_routing->p_hierarchy = SURF_ROUTING_BASE;
204 xbt_assert(!xbt_lib_get_or_null(as_router_lib, router->id, ROUTING_ASR_LEVEL),
205 "Reading a router, processing unit \"%s\" already exists",
208 RoutingEdge *info = new RoutingEdgeImpl(xbt_strdup(router->id),
210 SURF_NETWORK_ELEMENT_ROUTER,
212 info->setId(current_routing->parsePU(info));
213 xbt_lib_set(as_router_lib, router->id, ROUTING_ASR_LEVEL, (void *) info);
214 XBT_DEBUG("Having set name '%s' id '%d'", router->id, info->getId());
215 routingEdgeCreatedCallbacks(info);
217 if (router->coord && strcmp(router->coord, "")) {
221 if (!COORD_ASR_LEVEL)
222 xbt_die ("To use host coordinates, please add --cfg=network/coordinates:yes to your command line");
223 /* Pre-parse the host coordinates */
224 xbt_dynar_t ctn_str = xbt_str_split_str(router->coord, " ");
225 xbt_dynar_t ctn = xbt_dynar_new(sizeof(double),NULL);
226 xbt_dynar_foreach(ctn_str,cursor, str) {
227 double val = atof(str);
228 xbt_dynar_push(ctn,&val);
230 xbt_dynar_shrink(ctn, 0);
231 xbt_dynar_free(&ctn_str);
232 xbt_lib_set(as_router_lib, router->id, COORD_ASR_LEVEL, (void *) ctn);
233 XBT_DEBUG("Having set router coordinates for '%s'",router->id);
236 unsigned int iterator;
237 sg_platf_router_cb_t fun;
238 xbt_dynar_foreach(sg_platf_router_cb_list, iterator, fun) {
244 * \brief Store the route by calling the set_route function of the current routing component
246 static void parse_E_route(sg_platf_route_cbarg_t route)
248 /*FIXME:REMOVE:xbt_assert(current_routing->parse_route,
249 "no defined method \"set_route\" in \"%s\"",
250 current_routing->name);*/
252 current_routing->parseRoute(route);
256 * \brief Store the ASroute by calling the set_ASroute function of the current routing component
258 static void parse_E_ASroute(sg_platf_route_cbarg_t ASroute)
260 /*FIXME:REMOVE:xbt_assert(current_routing->parse_ASroute,
261 "no defined method \"set_ASroute\" in \"%s\"",
262 current_routing->name);*/
263 current_routing->parseASroute(ASroute);
267 * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
269 static void parse_E_bypassRoute(sg_platf_route_cbarg_t route)
271 /*FIXME:REMOVE:xbt_assert(current_routing->parse_bypassroute,
272 "Bypassing mechanism not implemented by routing '%s'",
273 current_routing->name);*/
275 current_routing->parseBypassroute(route);
279 * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
281 static void parse_E_bypassASroute(sg_platf_route_cbarg_t ASroute)
283 /*FIXME:REMOVE:xbt_assert(current_routing->parse_bypassroute,
284 "Bypassing mechanism not implemented by routing '%s'",
285 current_routing->name);*/
286 current_routing->parseBypassroute(ASroute);
289 static void routing_parse_trace(sg_platf_trace_cbarg_t trace)
291 tmgr_trace_t tmgr_trace;
292 if (!trace->file || strcmp(trace->file, "") != 0) {
293 tmgr_trace = tmgr_trace_new_from_file(trace->file);
294 } else if (strcmp(trace->pc_data, "") == 0) {
298 tmgr_trace_new_from_string(trace->id, trace->pc_data,
301 xbt_dict_set(traces_set_list, trace->id, (void *) tmgr_trace, NULL);
304 static void routing_parse_trace_connect(sg_platf_trace_connect_cbarg_t trace_connect)
306 xbt_assert(xbt_dict_get_or_null
307 (traces_set_list, trace_connect->trace),
308 "Cannot connect trace %s to %s: trace unknown",
309 trace_connect->trace,
310 trace_connect->element);
312 switch (trace_connect->kind) {
313 case SURF_TRACE_CONNECT_KIND_HOST_AVAIL:
314 xbt_dict_set(trace_connect_list_host_avail,
315 trace_connect->trace,
316 xbt_strdup(trace_connect->element), NULL);
318 case SURF_TRACE_CONNECT_KIND_POWER:
319 xbt_dict_set(trace_connect_list_power, trace_connect->trace,
320 xbt_strdup(trace_connect->element), NULL);
322 case SURF_TRACE_CONNECT_KIND_LINK_AVAIL:
323 xbt_dict_set(trace_connect_list_link_avail,
324 trace_connect->trace,
325 xbt_strdup(trace_connect->element), NULL);
327 case SURF_TRACE_CONNECT_KIND_BANDWIDTH:
328 xbt_dict_set(trace_connect_list_bandwidth,
329 trace_connect->trace,
330 xbt_strdup(trace_connect->element), NULL);
332 case SURF_TRACE_CONNECT_KIND_LATENCY:
333 xbt_dict_set(trace_connect_list_latency, trace_connect->trace,
334 xbt_strdup(trace_connect->element), NULL);
337 surf_parse_error("Cannot connect trace %s to %s: kind of trace unknown",
338 trace_connect->trace, trace_connect->element);
344 * \brief Make a new routing component to the platform
346 * Add a new autonomous system to the platform. Any elements (such as host,
347 * router or sub-AS) added after this call and before the corresponding call
348 * to sg_platf_new_AS_close() will be added to this AS.
350 * Once this function was called, the configuration concerning the used
351 * models cannot be changed anymore.
353 * @param AS_id name of this autonomous system. Must be unique in the platform
354 * @param wanted_routing_type one of Full, Floyd, Dijkstra or similar. Full list in the variable routing_models, in src/surf/surf_routing.c
356 void routing_AS_begin(sg_platf_AS_cbarg_t AS)
358 XBT_DEBUG("routing_AS_begin");
359 routing_model_description_t model = NULL;
361 xbt_assert(!xbt_lib_get_or_null
362 (as_router_lib, AS->id, ROUTING_ASR_LEVEL),
363 "The AS \"%s\" already exists", AS->id);
365 _sg_cfg_init_status = 2; /* horrible hack: direct access to the global
366 * controlling the level of configuration to prevent
367 * any further config */
369 /* search the routing model */
371 case A_surfxml_AS_routing_Cluster: model = &routing_models[SURF_MODEL_CLUSTER];break;
372 case A_surfxml_AS_routing_Cluster___torus: model = &routing_models[SURF_MODEL_TORUS_CLUSTER];break;
373 case A_surfxml_AS_routing_Cluster___fat___tree: model = &routing_models[SURF_MODEL_FAT_TREE_CLUSTER];break;
374 case A_surfxml_AS_routing_Dijkstra: model = &routing_models[SURF_MODEL_DIJKSTRA];break;
375 case A_surfxml_AS_routing_DijkstraCache: model = &routing_models[SURF_MODEL_DIJKSTRACACHE];break;
376 case A_surfxml_AS_routing_Floyd: model = &routing_models[SURF_MODEL_FLOYD];break;
377 case A_surfxml_AS_routing_Full: model = &routing_models[SURF_MODEL_FULL];break;
378 case A_surfxml_AS_routing_None: model = &routing_models[SURF_MODEL_NONE];break;
379 case A_surfxml_AS_routing_Vivaldi: model = &routing_models[SURF_MODEL_VIVALDI];break;
380 default: xbt_die("Not a valid model!!!");
384 /* make a new routing component */
385 As *new_as = model->create();
387 new_as->p_modelDesc = model;
388 new_as->p_hierarchy = SURF_ROUTING_NULL;
389 new_as->p_name = xbt_strdup(AS->id);
391 RoutingEdge *info = new RoutingEdgeImpl(xbt_strdup(new_as->p_name),
393 SURF_NETWORK_ELEMENT_AS,
395 if (current_routing == NULL && routing_platf->p_root == NULL) {
397 /* it is the first one */
398 new_as->p_routingFather = NULL;
399 routing_platf->p_root = new_as;
401 } else if (current_routing != NULL && routing_platf->p_root != NULL) {
403 xbt_assert(!xbt_dict_get_or_null
404 (current_routing->p_routingSons, AS->id),
405 "The AS \"%s\" already exists", AS->id);
406 /* it is a part of the tree */
407 new_as->p_routingFather = current_routing;
408 /* set the father behavior */
409 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
410 current_routing->p_hierarchy = SURF_ROUTING_RECURSIVE;
411 /* add to the sons dictionary */
412 xbt_dict_set(current_routing->p_routingSons, AS->id,
413 (void *) new_as, NULL);
414 /* add to the father element list */
415 info->setId(current_routing->parseAS(info));
417 THROWF(arg_error, 0, "All defined components must belong to a AS");
420 xbt_lib_set(as_router_lib, info->getName(), ROUTING_ASR_LEVEL,
422 XBT_DEBUG("Having set name '%s' id '%d'", new_as->p_name, info->getId());
424 routingEdgeCreatedCallbacks(info);
426 /* set the new current component of the tree */
427 current_routing = new_as;
428 current_routing->p_netElem = info;
432 * \brief Specify that the current description of AS is finished
434 * Once you've declared all the content of your AS, you have to close
435 * it with this call. Your AS is not usable until you call this function.
437 * @fixme: this call is not as robust as wanted: bad things WILL happen
438 * if you call it twice for the same AS, or if you forget calling it, or
439 * even if you add stuff to a closed AS
442 void routing_AS_end(sg_platf_AS_cbarg_t /*AS*/)
445 if (current_routing == NULL) {
446 THROWF(arg_error, 0, "Close an AS, but none was under construction");
448 if (current_routing->p_modelDesc->end)
449 current_routing->p_modelDesc->end(current_routing);
450 current_routing = current_routing->p_routingFather;
454 /* Aux Business methods */
457 * \brief Get the AS father and the first elements of the chain
459 * \param src the source host name
460 * \param dst the destination host name
462 * Get the common father of the to processing units, and the first different
463 * father in the chain
465 static void elements_father(sg_routing_edge_t src, sg_routing_edge_t dst,
470 xbt_assert(src && dst, "bad parameters for \"elements_father\" method");
471 #define ELEMENTS_FATHER_MAXDEPTH 16 /* increase if it is not enough */
473 As *path_src[ELEMENTS_FATHER_MAXDEPTH];
474 As *path_dst[ELEMENTS_FATHER_MAXDEPTH];
482 /* (1) find the as where the src and dst are located */
483 sg_routing_edge_t src_data = src;
484 sg_routing_edge_t dst_data = dst;
485 src_as = src_data->getRcComponent();
486 dst_as = dst_data->getRcComponent();
488 char* src_name = src_data->getName();
489 char* dst_name = dst_data->getName();
492 xbt_assert(src_as && dst_as,
493 "Ask for route \"from\"(%s) or \"to\"(%s) no found", src_name, dst_name);
495 /* (2) find the path to the root routing component */
496 for (current = src_as; current != NULL; current = current->p_routingFather) {
497 if (index_src >= ELEMENTS_FATHER_MAXDEPTH)
498 xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_src");
499 path_src[index_src++] = current;
501 for (current = dst_as; current != NULL; current = current->p_routingFather) {
502 if (index_dst >= ELEMENTS_FATHER_MAXDEPTH)
503 xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_dst");
504 path_dst[index_dst++] = current;
507 /* (3) find the common father */
509 current_src = path_src[--index_src];
510 current_dst = path_dst[--index_dst];
511 } while (index_src > 0 && index_dst > 0 && current_src == current_dst);
513 /* (4) they are not in the same routing component, make the path */
514 if (current_src == current_dst)
515 father = current_src;
517 father = path_src[index_src + 1];
519 /* (5) result generation */
520 *res_father = father; /* first the common father of src and dst */
521 *res_src = current_src; /* second the first different father of src */
522 *res_dst = current_dst; /* three the first different father of dst */
524 #undef ELEMENTS_FATHER_MAXDEPTH
527 /* Global Business methods */
530 * \brief Recursive function for get_route_latency
532 * \param src the source host name
533 * \param dst the destination host name
534 * \param *route the route where the links are stored. It is either NULL or a ready to use dynar
535 * \param *latency the latency, if needed
537 * This function is called by "get_route" and "get_latency". It allows to walk
538 * recursively through the ASes tree.
540 static void _get_route_and_latency(RoutingEdge *src, RoutingEdge *dst,
541 xbt_dynar_t * links, double *latency)
543 s_sg_platf_route_cbarg_t route = SG_PLATF_ROUTE_INITIALIZER;
544 memset(&route,0,sizeof(route));
546 xbt_assert(src && dst, "bad parameters for \"_get_route_latency\" method");
547 XBT_DEBUG("Solve route/latency \"%s\" to \"%s\"", src->getName(), dst->getName());
549 /* Find how src and dst are interconnected */
550 As *common_father, *src_father, *dst_father;
551 elements_father(src, dst, &common_father, &src_father, &dst_father);
552 XBT_DEBUG("elements_father: common father '%s' src_father '%s' dst_father '%s'",
553 common_father->p_name, src_father->p_name, dst_father->p_name);
555 /* Check whether a direct bypass is defined */
556 sg_platf_route_cbarg_t e_route_bypass = NULL;
557 //FIXME:REMOVE:if (common_father->get_bypass_route)
559 e_route_bypass = common_father->getBypassRoute(src, dst, latency);
561 /* Common ancestor is kind enough to declare a bypass route from src to dst -- use it and bail out */
562 if (e_route_bypass) {
563 xbt_dynar_merge(links, &e_route_bypass->link_list);
564 generic_free_route(e_route_bypass);
568 /* If src and dst are in the same AS, life is good */
569 if (src_father == dst_father) { /* SURF_ROUTING_BASE */
570 route.link_list = *links;
571 common_father->getRouteAndLatency(src, dst, &route, latency);
572 // if vivaldi latency+=vivaldi(src,dst)
576 /* Not in the same AS, no bypass. We'll have to find our path between the ASes recursively*/
578 route.link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
579 // Find the net_card corresponding to father
580 RoutingEdge *src_father_net_elm = src_father->p_netElem;
581 RoutingEdge *dst_father_net_elm = dst_father->p_netElem;
583 common_father->getRouteAndLatency(src_father_net_elm, dst_father_net_elm,
586 xbt_assert((route.gw_src != NULL) && (route.gw_dst != NULL),
587 "bad gateways for route from \"%s\" to \"%s\"", src->getName(), dst->getName());
589 sg_routing_edge_t src_gateway_net_elm = route.gw_src;
590 sg_routing_edge_t dst_gateway_net_elm = route.gw_dst;
592 /* If source gateway is not our source, we have to recursively find our way up to this point */
593 if (src != src_gateway_net_elm)
594 _get_route_and_latency(src, src_gateway_net_elm, links, latency);
595 xbt_dynar_merge(links, &route.link_list);
597 /* If dest gateway is not our destination, we have to recursively find our way from this point */
598 if (dst_gateway_net_elm != dst)
599 _get_route_and_latency(dst_gateway_net_elm, dst, links, latency);
601 // if vivaldi latency+=vivaldi(src_gateway,dst_gateway)
604 AS_t surf_platf_get_root(routing_platf_t platf){
605 return platf->p_root;
608 e_surf_network_element_type_t surf_routing_edge_get_rc_type(sg_routing_edge_t edge){
609 return edge->getRcType();
614 * \brief Find a route between hosts
616 * \param src the network_element_t for src host
617 * \param dst the network_element_t for dst host
618 * \param route where to store the list of links.
619 * If *route=NULL, create a short lived dynar. Else, fill the provided dynar
620 * \param latency where to store the latency experienced on the path (or NULL if not interested)
621 * It is the caller responsability to initialize latency to 0 (we add to provided route)
624 * walk through the routing components tree and find a route between hosts
625 * by calling the differents "get_route" functions in each routing component.
627 void RoutingPlatf::getRouteAndLatency(RoutingEdge *src, RoutingEdge *dst,
628 xbt_dynar_t* route, double *latency)
630 XBT_DEBUG("routing_get_route_and_latency from %s to %s", src->getName(), dst->getName());
632 xbt_dynar_reset(routing_platf->p_lastRoute);
633 *route = routing_platf->p_lastRoute;
636 _get_route_and_latency(src, dst, route, latency);
638 xbt_assert(!latency || *latency >= 0.0,
639 "negative latency on route between \"%s\" and \"%s\"", src->getName(), dst->getName());
642 xbt_dynar_t RoutingPlatf::getOneLinkRoutes(){
643 return recursiveGetOneLinkRoutes(p_root);
646 xbt_dynar_t RoutingPlatf::recursiveGetOneLinkRoutes(As *rc)
648 xbt_dynar_t ret = xbt_dynar_new(sizeof(Onelink*), xbt_free_f);
650 //adding my one link routes
651 xbt_dynar_t onelink_mine = rc->getOneLinkRoutes();
653 xbt_dynar_merge(&ret,&onelink_mine);
657 xbt_dict_cursor_t cursor = NULL;
659 xbt_dict_foreach(rc->p_routingSons, cursor, key, rc_child) {
660 xbt_dynar_t onelink_child = recursiveGetOneLinkRoutes(rc_child);
662 xbt_dynar_merge(&ret,&onelink_child);
667 e_surf_network_element_type_t routing_get_network_element_type(const char *name)
669 RoutingEdge *rc = sg_routing_edge_by_name_or_null(name);
671 return rc->getRcType();
673 return SURF_NETWORK_ELEMENT_NULL;
677 * \brief Generic method: create the global routing schema
679 * Make a global routing structure and set all the parsing functions.
681 void routing_model_create( void *loopback)
683 /* config the uniq global routing */
684 routing_platf = new RoutingPlatf();
685 routing_platf->p_root = NULL;
686 routing_platf->p_loopback = loopback;
687 routing_platf->p_lastRoute = xbt_dynar_new(sizeof(sg_routing_link_t),NULL);
688 /* no current routing at moment */
689 current_routing = NULL;
693 /* ************************************************** */
694 /* ********** PATERN FOR NEW ROUTING **************** */
696 /* The minimal configuration of a new routing model need the next functions,
697 * also you need to set at the start of the file, the new model in the model
698 * list. Remember keep the null ending of the list.
700 /*** Routing model structure ***/
702 // s_routing_component_t generic_routing;
703 // /* things that your routing model need */
704 // } s_routing_component_NEW_t,*routing_component_NEW_t;
706 /*** Parse routing model functions ***/
707 // static void model_NEW_set_processing_unit(routing_component_t rc, const char* name) {}
708 // static void model_NEW_set_autonomous_system(routing_component_t rc, const char* name) {}
709 // static void model_NEW_set_route(routing_component_t rc, const char* src, const char* dst, route_t route) {}
710 // static void model_NEW_set_ASroute(routing_component_t rc, const char* src, const char* dst, route_extended_t route) {}
711 // static void model_NEW_set_bypassroute(routing_component_t rc, const char* src, const char* dst, route_extended_t e_route) {}
713 /*** Business methods ***/
714 // static route_extended_t NEW_get_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
715 // static route_extended_t NEW_get_bypass_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
716 // static void NEW_finalize(routing_component_t rc) { xbt_free(rc);}
718 /*** Creation routing model functions ***/
719 // static void* model_NEW_create(void) {
720 // routing_component_NEW_t new_component = xbt_new0(s_routing_component_NEW_t,1);
721 // new_component->generic_routing.set_processing_unit = model_NEW_set_processing_unit;
722 // new_component->generic_routing.set_autonomous_system = model_NEW_set_autonomous_system;
723 // new_component->generic_routing.set_route = model_NEW_set_route;
724 // new_component->generic_routing.set_ASroute = model_NEW_set_ASroute;
725 // new_component->generic_routing.set_bypassroute = model_NEW_set_bypassroute;
726 // new_component->generic_routing.get_route = NEW_get_route;
727 // new_component->generic_routing.get_bypass_route = NEW_get_bypass_route;
728 // new_component->generic_routing.finalize = NEW_finalize;
729 // /* initialization of internal structures */
730 // return new_component;
732 // static void model_NEW_load(void) {} /* mandatory */
733 // static void model_NEW_unload(void) {} /* mandatory */
734 // static void model_NEW_end(void) {} /* mandatory */
736 /* ************************************************************************** */
737 /* ************************* GENERIC PARSE FUNCTIONS ************************ */
739 void routing_cluster_add_backbone(void* bb) {
740 xbt_assert(current_routing->p_modelDesc == &routing_models[SURF_MODEL_CLUSTER],
741 "You have to be in model Cluster to use tag backbone!");
742 xbt_assert(!static_cast<AsCluster*>(current_routing)->p_backbone, "The backbone link is already defined!");
743 static_cast<AsCluster*>(current_routing)->p_backbone = static_cast<Link*>(bb);
744 XBT_DEBUG("Add a backbone to AS '%s'", current_routing->p_name);
747 static void routing_parse_cabinet(sg_platf_cabinet_cbarg_t cabinet)
750 char *groups , *host_id , *link_id = NULL;
752 xbt_dynar_t radical_elements;
753 xbt_dynar_t radical_ends;
756 radical_elements = xbt_str_split(cabinet->radical, ",");
757 xbt_dynar_foreach(radical_elements, iter, groups) {
759 radical_ends = xbt_str_split(groups, "-");
760 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
762 switch (xbt_dynar_length(radical_ends)) {
767 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
770 surf_parse_error("Malformed radical");
773 s_sg_platf_host_cbarg_t host = SG_PLATF_HOST_INITIALIZER;
774 memset(&host, 0, sizeof(host));
775 host.initial_state = SURF_RESOURCE_ON;
777 host.power_scale = 1.0;
778 host.core_amount = 1;
780 s_sg_platf_link_cbarg_t link = SG_PLATF_LINK_INITIALIZER;
781 memset(&link, 0, sizeof(link));
782 link.state = SURF_RESOURCE_ON;
783 link.policy = SURF_LINK_FULLDUPLEX;
784 link.latency = cabinet->lat;
785 link.bandwidth = cabinet->bw;
787 s_sg_platf_host_link_cbarg_t host_link = SG_PLATF_HOST_LINK_INITIALIZER;
788 memset(&host_link, 0, sizeof(host_link));
790 for (i = start; i <= end; i++) {
791 host_id = bprintf("%s%d%s",cabinet->prefix,i,cabinet->suffix);
792 link_id = bprintf("link_%s%d%s",cabinet->prefix,i,cabinet->suffix);
795 host.power_peak = xbt_dynar_new(sizeof(double), NULL);
796 xbt_dynar_push(host.power_peak,&cabinet->power);
797 sg_platf_new_host(&host);
798 xbt_dynar_free(&host.power_peak);
799 sg_platf_new_link(&link);
801 char* link_up = bprintf("%s_UP",link_id);
802 char* link_down = bprintf("%s_DOWN",link_id);
803 host_link.id = host_id;
804 host_link.link_up = link_up;
805 host_link.link_down = link_down;
806 sg_platf_new_host_link(&host_link);
814 xbt_dynar_free(&radical_ends);
816 xbt_dynar_free(&radical_elements);
819 static void routing_parse_cluster(sg_platf_cluster_cbarg_t cluster)
821 char *host_id, *groups, *link_id = NULL;
822 xbt_dict_t patterns = NULL;
825 s_sg_platf_host_cbarg_t host = SG_PLATF_HOST_INITIALIZER;
826 s_sg_platf_link_cbarg_t link = SG_PLATF_LINK_INITIALIZER;
830 xbt_dynar_t radical_elements;
831 xbt_dynar_t radical_ends;
833 if ((cluster->availability_trace && strcmp(cluster->availability_trace, ""))
834 || (cluster->state_trace && strcmp(cluster->state_trace, ""))) {
835 patterns = xbt_dict_new_homogeneous(xbt_free_f);
836 xbt_dict_set(patterns, "id", xbt_strdup(cluster->id), NULL);
837 xbt_dict_set(patterns, "prefix", xbt_strdup(cluster->prefix), NULL);
838 xbt_dict_set(patterns, "suffix", xbt_strdup(cluster->suffix), NULL);
841 /* parse the topology attribute. If we are not in a flat cluster,
842 * switch to the right mode and initialize the routing with
843 * the parameters in topo_parameters attribute
845 s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
848 if(cluster->topology == SURF_CLUSTER_TORUS){
849 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Torus_Cluster\">", cluster->id);
850 AS.routing = A_surfxml_AS_routing_Cluster___torus;
851 sg_platf_new_AS_begin(&AS);
852 ((AsClusterTorus*)current_routing)->parse_specific_arguments(cluster);
854 else if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
855 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Fat_Tree_Cluster\">", cluster->id);
856 AS.routing = A_surfxml_AS_routing_Cluster___fat___tree;
857 sg_platf_new_AS_begin(&AS);
858 ((AsClusterFatTree*)current_routing)->parse_specific_arguments(cluster);
862 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", cluster->id);
863 AS.routing = A_surfxml_AS_routing_Cluster;
864 sg_platf_new_AS_begin(&AS);
867 if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
868 ((AsCluster*)current_routing)->p_nb_links_per_node++;
869 ((AsCluster*)current_routing)->p_has_loopback=1;
872 if(cluster->limiter_link!=0){
873 ((AsCluster*)current_routing)->p_nb_links_per_node++;
874 ((AsCluster*)current_routing)->p_has_limiter=1;
879 current_routing->p_linkUpDownList
880 = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
883 radical_elements = xbt_str_split(cluster->radical, ",");
884 xbt_dynar_foreach(radical_elements, iter, groups) {
886 radical_ends = xbt_str_split(groups, "-");
887 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
889 switch (xbt_dynar_length(radical_ends)) {
894 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
897 surf_parse_error("Malformed radical");
900 for (i = start; i <= end; i++) {
902 bprintf("%s%d%s", cluster->prefix, i, cluster->suffix);
903 link_id = bprintf("%s_link_%d", cluster->id, i);
905 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\">", host_id, cluster->power);
907 memset(&host, 0, sizeof(host));
909 if ((cluster->properties != NULL) && (!xbt_dict_is_empty(cluster->properties))) {
910 xbt_dict_cursor_t cursor=NULL;
912 host.properties = xbt_dict_new();
914 xbt_dict_foreach(cluster->properties,cursor,key,data) {
915 xbt_dict_set(host.properties, key, xbt_strdup(data),free);
918 if (cluster->availability_trace && strcmp(cluster->availability_trace, "")) {
919 xbt_dict_set(patterns, "radical", bprintf("%d", i), NULL);
920 char *avail_file = xbt_str_varsubst(cluster->availability_trace, patterns);
921 XBT_DEBUG("\tavailability_file=\"%s\"", avail_file);
922 host.power_trace = tmgr_trace_new_from_file(avail_file);
923 xbt_free(avail_file);
925 XBT_DEBUG("\tavailability_file=\"\"");
928 if (cluster->state_trace && strcmp(cluster->state_trace, "")) {
929 char *avail_file = xbt_str_varsubst(cluster->state_trace, patterns);
930 XBT_DEBUG("\tstate_file=\"%s\"", avail_file);
931 host.state_trace = tmgr_trace_new_from_file(avail_file);
932 xbt_free(avail_file);
934 XBT_DEBUG("\tstate_file=\"\"");
937 host.power_peak = xbt_dynar_new(sizeof(double), NULL);
938 xbt_dynar_push(host.power_peak,&cluster->power);
941 //host.power_peak = cluster->power;
942 host.power_scale = 1.0;
943 host.core_amount = cluster->core_amount;
944 host.initial_state = SURF_RESOURCE_ON;
946 sg_platf_new_host(&host);
947 xbt_dynar_free(&host.power_peak);
948 XBT_DEBUG("</host>");
950 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_id,
951 cluster->bw, cluster->lat);
954 s_surf_parsing_link_up_down_t info_lim, info_loop;
955 // All links are saved in a matrix;
956 // every row describes a single node; every node
957 // may have multiple links.
958 // the first column may store a link from x to x if p_has_loopback is set
959 // the second column may store a limiter link if p_has_limiter is set
960 // other columns are to store one or more link for the node
962 //add a loopback link
963 if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
964 char *tmp_link = bprintf("%s_loopback", link_id);
965 XBT_DEBUG("<loopback\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
966 cluster->limiter_link);
969 memset(&link, 0, sizeof(link));
971 link.bandwidth = cluster->loopback_bw;
972 link.latency = cluster->loopback_lat;
973 link.state = SURF_RESOURCE_ON;
974 link.policy = SURF_LINK_FATPIPE;
975 sg_platf_new_link(&link);
976 info_loop.link_up = Link::byName(tmp_link);
977 info_loop.link_down = info_loop.link_up;
979 xbt_dynar_set(current_routing->p_linkUpDownList, rankId*(static_cast<AsCluster*>(current_routing))->p_nb_links_per_node, &info_loop);
982 //add a limiter link (shared link to account for maximal bandwidth of the node)
983 if(cluster->limiter_link!=0){
984 char *tmp_link = bprintf("%s_limiter", link_id);
985 XBT_DEBUG("<limiter\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
986 cluster->limiter_link);
989 memset(&link, 0, sizeof(link));
991 link.bandwidth = cluster->limiter_link;
993 link.state = SURF_RESOURCE_ON;
994 link.policy = SURF_LINK_SHARED;
995 sg_platf_new_link(&link);
996 info_lim.link_up = Link::byName(tmp_link);
997 info_lim.link_down = info_lim.link_up;
999 xbt_dynar_set(current_routing->p_linkUpDownList,
1000 rankId*(static_cast<AsCluster*>(current_routing))->p_nb_links_per_node + static_cast<AsCluster*>(current_routing)->p_has_loopback ,
1006 //call the cluster function that adds the others links
1007 if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
1008 ((AsClusterFatTree*) current_routing)->addProcessingNode(i);
1011 static_cast<AsCluster*>(current_routing)->create_links_for_node(cluster, i, rankId, rankId*
1012 static_cast<AsCluster*>(current_routing)->p_nb_links_per_node
1013 + static_cast<AsCluster*>(current_routing)->p_has_loopback
1014 + static_cast<AsCluster*>(current_routing)->p_has_limiter );
1021 xbt_dynar_free(&radical_ends);
1023 xbt_dynar_free(&radical_elements);
1025 // For fat trees, the links must be created once all nodes have been added
1026 if(cluster->topology == SURF_CLUSTER_FAT_TREE) {
1027 static_cast<AsClusterFatTree*>(current_routing)->create_links();
1029 // Add a router. It is magically used thanks to the way in which surf_routing_cluster is written,
1030 // and it's very useful to connect clusters together
1032 XBT_DEBUG("<router id=\"%s\"/>", cluster->router_id);
1034 s_sg_platf_router_cbarg_t router = SG_PLATF_ROUTER_INITIALIZER;
1035 memset(&router, 0, sizeof(router));
1036 router.id = cluster->router_id;
1038 if (!router.id || !strcmp(router.id, ""))
1040 bprintf("%s%s_router%s", cluster->prefix, cluster->id,
1042 sg_platf_new_router(&router);
1043 ((AsCluster*)current_routing)->p_router = (RoutingEdge*) xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL);
1047 if ((cluster->bb_bw != 0) || (cluster->bb_lat != 0)) {
1048 char *link_backbone = bprintf("%s_backbone", cluster->id);
1049 XBT_DEBUG("<link\tid=\"%s\" bw=\"%f\" lat=\"%f\"/>", link_backbone,
1050 cluster->bb_bw, cluster->bb_lat);
1052 memset(&link, 0, sizeof(link));
1053 link.id = link_backbone;
1054 link.bandwidth = cluster->bb_bw;
1055 link.latency = cluster->bb_lat;
1056 link.state = SURF_RESOURCE_ON;
1057 link.policy = cluster->bb_sharing_policy;
1059 sg_platf_new_link(&link);
1061 routing_cluster_add_backbone(Link::byName(link_backbone));
1063 free(link_backbone);
1067 sg_platf_new_AS_end();
1069 xbt_dict_free(&patterns); // no op if it were never set
1072 static void routing_parse_postparse(void) {
1073 xbt_dict_free(&random_value);
1076 static void routing_parse_peer(sg_platf_peer_cbarg_t peer)
1078 char *host_id = NULL;
1079 char *link_id = NULL;
1080 char *router_id = NULL;
1083 host_id = HOST_PEER(peer->id);
1084 link_id = LINK_PEER(peer->id);
1085 router_id = ROUTER_PEER(peer->id);
1087 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", peer->id);
1088 s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
1090 AS.routing = A_surfxml_AS_routing_Cluster;
1091 sg_platf_new_AS_begin(&AS);
1093 current_routing->p_linkUpDownList = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
1095 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\"/>", host_id, peer->power);
1096 s_sg_platf_host_cbarg_t host = SG_PLATF_HOST_INITIALIZER;
1097 memset(&host, 0, sizeof(host));
1098 host.initial_state = SURF_RESOURCE_ON;
1101 host.power_peak = xbt_dynar_new(sizeof(double), NULL);
1102 xbt_dynar_push(host.power_peak,&peer->power);
1104 //host.power_peak = peer->power;
1105 host.power_scale = 1.0;
1106 host.power_trace = peer->availability_trace;
1107 host.state_trace = peer->state_trace;
1108 host.core_amount = 1;
1109 sg_platf_new_host(&host);
1110 xbt_dynar_free(&host.power_peak);
1112 s_sg_platf_link_cbarg_t link = SG_PLATF_LINK_INITIALIZER;
1113 memset(&link, 0, sizeof(link));
1114 link.state = SURF_RESOURCE_ON;
1115 link.policy = SURF_LINK_SHARED;
1116 link.latency = peer->lat;
1118 char* link_up = bprintf("%s_UP",link_id);
1119 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_up,
1120 peer->bw_out, peer->lat);
1122 link.bandwidth = peer->bw_out;
1123 sg_platf_new_link(&link);
1125 char* link_down = bprintf("%s_DOWN",link_id);
1126 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_down,
1127 peer->bw_in, peer->lat);
1128 link.id = link_down;
1129 link.bandwidth = peer->bw_in;
1130 sg_platf_new_link(&link);
1132 XBT_DEBUG("<host_link\tid=\"%s\"\tup=\"%s\"\tdown=\"%s\" />", host_id,link_up,link_down);
1133 s_sg_platf_host_link_cbarg_t host_link = SG_PLATF_HOST_LINK_INITIALIZER;
1134 memset(&host_link, 0, sizeof(host_link));
1135 host_link.id = host_id;
1136 host_link.link_up = link_up;
1137 host_link.link_down = link_down;
1138 sg_platf_new_host_link(&host_link);
1140 XBT_DEBUG("<router id=\"%s\"/>", router_id);
1141 s_sg_platf_router_cbarg_t router = SG_PLATF_ROUTER_INITIALIZER;
1142 memset(&router, 0, sizeof(router));
1143 router.id = router_id;
1144 router.coord = peer->coord;
1145 sg_platf_new_router(&router);
1146 static_cast<AsCluster*>(current_routing)->p_router = static_cast<RoutingEdge*>(xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL));
1149 sg_platf_new_AS_end();
1152 //xbt_dynar_free(&tab_elements_num);
1160 // static void routing_parse_Srandom(void)
1162 // double mean, std, min, max, seed;
1163 // char *random_id = A_surfxml_random_id;
1164 // char *random_radical = A_surfxml_random_radical;
1165 // char *rd_name = NULL;
1167 // mean = surf_parse_get_double(A_surfxml_random_mean);
1168 // std = surf_parse_get_double(A_surfxml_random_std___deviation);
1169 // min = surf_parse_get_double(A_surfxml_random_min);
1170 // max = surf_parse_get_double(A_surfxml_random_max);
1171 // seed = surf_parse_get_double(A_surfxml_random_seed);
1175 // random_data_t random = xbt_new0(s_random_data_t, 1);
1178 // xbt_dynar_t radical_elements;
1179 // unsigned int iter;
1182 // xbt_dynar_t radical_ends;
1184 // switch (A_surfxml_random_generator) {
1185 // case AU_surfxml_random_generator:
1186 // case A_surfxml_random_generator_NONE:
1187 // random->generator = NONE;
1189 // case A_surfxml_random_generator_DRAND48:
1190 // random->generator = DRAND48;
1192 // case A_surfxml_random_generator_RAND:
1193 // random->generator = RAND;
1195 // case A_surfxml_random_generator_RNGSTREAM:
1196 // random->generator = RNGSTREAM;
1199 // surf_parse_error("Invalid random generator");
1202 // random->seed = seed;
1203 // random->min = min;
1204 // random->max = max;
1206 // /* Check user stupidities */
1208 // THROWF(arg_error, 0, "random->max < random->min (%f < %f)", max, min);
1210 // THROWF(arg_error, 0, "random->mean < random->min (%f < %f)", mean, min);
1212 // THROWF(arg_error, 0, "random->mean > random->max (%f > %f)", mean, max);
1214 // /* normalize the mean and standard deviation before storing */
1215 // random->mean = (mean - min) / (max - min);
1216 // random->std = std / (max - min);
1218 // if (random->mean * (1 - random->mean) < random->std * random->std)
1219 // THROWF(arg_error, 0, "Invalid mean and standard deviation (%f and %f)",
1220 // random->mean, random->std);
1223 // ("id = '%s' min = '%f' max = '%f' mean = '%f' std_deviatinon = '%f' generator = '%d' seed = '%ld' radical = '%s'",
1224 // random_id, random->min, random->max, random->mean, random->std,
1225 // (int)random->generator, random->seed, random_radical);
1227 // if (!random_value)
1228 // random_value = xbt_dict_new_homogeneous(free);
1230 // if (!strcmp(random_radical, "")) {
1231 // res = random_generate(random);
1232 // rd_value = bprintf("%f", res);
1233 // xbt_dict_set(random_value, random_id, rd_value, NULL);
1235 // radical_elements = xbt_str_split(random_radical, ",");
1236 // xbt_dynar_foreach(radical_elements, iter, groups) {
1237 // radical_ends = xbt_str_split(groups, "-");
1238 // switch (xbt_dynar_length(radical_ends)) {
1240 // xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1241 // "Custom Random '%s' already exists !", random_id);
1242 // res = random_generate(random);
1244 // bprintf("%s%d", random_id,
1245 // atoi(xbt_dynar_getfirst_as(radical_ends, char *)));
1246 // xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1247 // xbt_free(tmpbuf);
1251 // start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
1252 // end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
1253 // for (i = start; i <= end; i++) {
1254 // xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1255 // "Custom Random '%s' already exists !", bprintf("%s%d",
1258 // res = random_generate(random);
1259 // tmpbuf = bprintf("%s%d", random_id, i);
1260 // xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1261 // xbt_free(tmpbuf);
1265 // XBT_CRITICAL("Malformed radical");
1268 // res = random_generate(random);
1269 // rd_name = bprintf("%s_router", random_id);
1270 // rd_value = bprintf("%f", res);
1271 // xbt_dict_set(random_value, rd_name, rd_value, NULL);
1273 // xbt_dynar_free(&radical_ends);
1276 // xbt_dynar_free(&radical_elements);
1280 static void check_disk_attachment()
1282 xbt_lib_cursor_t cursor;
1285 RoutingEdge *host_elm;
1286 xbt_lib_foreach(storage_lib, cursor, key, data) {
1287 if(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL) != NULL) {
1288 Storage *storage = static_cast<Storage*>(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL));
1289 host_elm = sg_routing_edge_by_name_or_null(storage->p_attach);
1291 surf_parse_error("Unable to attach storage %s: host %s doesn't exist.", storage->getName(), storage->p_attach);
1296 void routing_register_callbacks()
1298 sg_platf_router_add_cb(parse_S_router);
1299 sg_platf_host_link_add_cb(parse_S_host);
1300 sg_platf_route_add_cb(parse_E_route);
1301 sg_platf_ASroute_add_cb(parse_E_ASroute);
1302 sg_platf_bypassRoute_add_cb(parse_E_bypassRoute);
1303 sg_platf_bypassASroute_add_cb(parse_E_bypassASroute);
1305 sg_platf_cluster_add_cb(routing_parse_cluster);
1306 sg_platf_cabinet_add_cb(routing_parse_cabinet);
1308 sg_platf_peer_add_cb(routing_parse_peer);
1309 sg_platf_postparse_add_cb(routing_parse_postparse);
1310 sg_platf_postparse_add_cb(check_disk_attachment);
1312 /* we care about the ASes while parsing the platf. Incredible, isnt it? */
1313 sg_platf_AS_end_add_cb(routing_AS_end);
1314 sg_platf_AS_begin_add_cb(routing_AS_begin);
1316 sg_platf_trace_add_cb(routing_parse_trace);
1317 sg_platf_trace_connect_add_cb(routing_parse_trace_connect);
1319 instr_routing_define_callbacks();
1323 * \brief Recursive function for finalize
1325 * \param rc the source host name
1327 * This fuction is call by "finalize". It allow to finalize the
1328 * AS or routing components. It delete all the structures.
1330 static void finalize_rec(As *as) {
1331 xbt_dict_cursor_t cursor = NULL;
1335 xbt_dict_foreach(as->p_routingSons, cursor, key, elem) {
1342 /** \brief Frees all memory allocated by the routing module */
1343 void routing_exit(void) {
1344 delete routing_platf;
1347 RoutingPlatf::~RoutingPlatf()
1349 xbt_dynar_free(&p_lastRoute);
1350 finalize_rec(p_root);
1353 AS_t surf_AS_get_routing_root() {
1354 return routing_platf->p_root;
1357 const char *surf_AS_get_name(As *as) {
1361 static As *surf_AS_recursive_get_by_name(As *current, const char * name) {
1362 xbt_dict_cursor_t cursor = NULL;
1367 if(!strcmp(current->p_name, name))
1370 xbt_dict_foreach(current->p_routingSons, cursor, key, elem) {
1371 tmp = surf_AS_recursive_get_by_name(elem, name);
1380 As *surf_AS_get_by_name(const char * name) {
1381 As *as = surf_AS_recursive_get_by_name(routing_platf->p_root, name);
1383 XBT_WARN("Impossible to find an AS with name %s, please check your input", name);
1387 xbt_dict_t surf_AS_get_routing_sons(As *as) {
1388 return as->p_routingSons;
1391 const char *surf_AS_get_model(As *as) {
1392 return as->p_modelDesc->name;
1395 xbt_dynar_t surf_AS_get_hosts(As *as) {
1396 xbt_dynar_t elms = as->p_indexNetworkElm;
1397 sg_routing_edge_t relm;
1400 int count = xbt_dynar_length(elms);
1401 xbt_dynar_t res = xbt_dynar_new(sizeof(xbt_dictelm_t), NULL);
1402 for (index = 0; index < count; index++) {
1403 relm = xbt_dynar_get_as(elms, index, RoutingEdge*);
1404 delm = xbt_lib_get_elm_or_null(host_lib, relm->getName());
1406 xbt_dynar_push(res, &delm);
1412 void surf_AS_get_graph(AS_t as, xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges) {
1413 as->getGraph(graph, nodes, edges);