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_HOST_LEVEL; //Surf host level
28 int SIMIX_STORAGE_LEVEL; //Simix storage level
29 int MSG_STORAGE_LEVEL; //Msg storage level
30 int MSG_FILE_LEVEL; //Msg file level
31 int SD_HOST_LEVEL; //Simdag host level
32 int SD_STORAGE_LEVEL; //Simdag storage level
33 int COORD_HOST_LEVEL=0; //Coordinates level
34 int NS3_HOST_LEVEL; //host node for ns3
37 * @ingroup SURF_build_api
38 * @brief A library containing all known links
41 int SD_LINK_LEVEL; //Simdag level
42 int SURF_LINK_LEVEL; //Surf level
44 xbt_lib_t as_router_lib;
45 int ROUTING_ASR_LEVEL; //Routing level
46 int COORD_ASR_LEVEL; //Coordinates level
47 int NS3_ASR_LEVEL; //host node for ns3
48 int ROUTING_PROP_ASR_LEVEL; //Where the properties are stored
50 static xbt_dict_t random_value = NULL;
53 /** @brief Retrieve a routing edge from its name
55 * Routing edges are either host and routers, whatever
57 RoutingEdgePtr sg_routing_edge_by_name_or_null(const char *name) {
58 RoutingEdgePtr net_elm = (RoutingEdgePtr) xbt_lib_get_or_null(host_lib, name, ROUTING_HOST_LEVEL);
60 net_elm = (RoutingEdgePtr) xbt_lib_get_or_null(as_router_lib, name, ROUTING_ASR_LEVEL);
65 RoutingPlatfPtr routing_platf = NULL;
66 AsPtr current_routing = NULL;
68 /* global parse functions */
69 extern xbt_dynar_t mount_list;
71 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route, surf, "Routing part of surf");
73 static void routing_parse_peer(sg_platf_peer_cbarg_t peer); /* peer bypass */
74 // static void routing_parse_Srandom(void); /* random bypass */
76 static void routing_parse_postparse(void);
78 /* this lines are only for replace use like index in the model table */
83 SURF_MODEL_DIJKSTRACACHE,
87 SURF_MODEL_TORUS_CLUSTER,
88 SURF_MODEL_FAT_TREE_CLUSTER,
91 struct s_model_type routing_models[] = {
93 "Full routing data (fast, large memory requirements, fully expressive)",
94 model_full_create, model_full_end},
96 "Floyd routing data (slow initialization, fast lookup, lesser memory requirements, shortest path routing only)",
97 model_floyd_create, model_floyd_end},
99 "Dijkstra routing data (fast initialization, slow lookup, small memory requirements, shortest path routing only)",
100 model_dijkstra_create, model_dijkstra_both_end},
102 "Dijkstra routing data (fast initialization, fast lookup, small memory requirements, shortest path routing only)",
103 model_dijkstracache_create, model_dijkstra_both_end},
104 {"none", "No routing (Unless you know what you are doing, avoid using this mode in combination with a non Constant network model).",
105 model_none_create, NULL},
106 {"Vivaldi", "Vivaldi routing",
107 model_vivaldi_create, NULL},
108 {"Cluster", "Cluster routing",
109 model_cluster_create, NULL},
110 {"Torus_Cluster", "Torus Cluster routing",
111 model_torus_cluster_create, NULL},
112 {"Fat_Tree_Cluster", "Fat Tree Cluster routing",
113 model_fat_tree_cluster_create, NULL},
114 {NULL, NULL, NULL, NULL}
118 * \brief Add a "host_link" to the network element list
120 static void parse_S_host_link(sg_platf_host_link_cbarg_t host)
122 RoutingEdgePtr info = static_cast<RoutingEdgePtr>(xbt_lib_get_or_null(host_lib, host->id, ROUTING_HOST_LEVEL));
123 xbt_assert(info, "Host '%s' not found!", host->id);
124 xbt_assert(current_routing->p_modelDesc == &routing_models[SURF_MODEL_CLUSTER] ||
125 current_routing->p_modelDesc == &routing_models[SURF_MODEL_VIVALDI],
126 "You have to be in model Cluster to use tag host_link!");
128 s_surf_parsing_link_up_down_t link_up_down;
129 link_up_down.link_up = xbt_lib_get_or_null(link_lib, host->link_up, SURF_LINK_LEVEL);
130 link_up_down.link_down = xbt_lib_get_or_null(link_lib, host->link_down, SURF_LINK_LEVEL);
132 xbt_assert(link_up_down.link_up, "Link '%s' not found!",host->link_up);
133 xbt_assert(link_up_down.link_down, "Link '%s' not found!",host->link_down);
135 if(!current_routing->p_linkUpDownList)
136 current_routing->p_linkUpDownList = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
138 // If dynar is is greater than edge id and if the host_link is already defined
139 if((int)xbt_dynar_length(current_routing->p_linkUpDownList) > info->getId() &&
140 xbt_dynar_get_as(current_routing->p_linkUpDownList, info->getId(), void*))
141 surf_parse_error("Host_link for '%s' is already defined!",host->id);
143 XBT_DEBUG("Push Host_link for host '%s' to position %d", info->getName(), info->getId());
144 xbt_dynar_set_as(current_routing->p_linkUpDownList, info->getId(), s_surf_parsing_link_up_down_t, link_up_down);
148 * \brief Add a "host" to the network element list
150 static void parse_S_host(sg_platf_host_cbarg_t host)
152 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
153 current_routing->p_hierarchy = SURF_ROUTING_BASE;
154 xbt_assert(!xbt_lib_get_or_null(host_lib, host->id, ROUTING_HOST_LEVEL),
155 "Reading a host, processing unit \"%s\" already exists", host->id);
157 RoutingEdgePtr info = new RoutingEdgeImpl(xbt_strdup(host->id),
159 SURF_NETWORK_ELEMENT_HOST,
161 info->setId(current_routing->parsePU(info));
162 xbt_lib_set(host_lib, host->id, ROUTING_HOST_LEVEL, (void *) info);
163 XBT_DEBUG("Having set name '%s' id '%d'", host->id, info->getId());
166 xbt_lib_set(storage_lib, host->id, ROUTING_STORAGE_HOST_LEVEL, (void *) mount_list);
170 if (host->coord && strcmp(host->coord, "")) {
174 if (!COORD_HOST_LEVEL)
175 xbt_die ("To use host coordinates, please add --cfg=network/coordinates:yes to your command line");
176 /* Pre-parse the host coordinates -- FIXME factorize with routers by overloading the routing->parse_PU function*/
177 xbt_dynar_t ctn_str = xbt_str_split_str(host->coord, " ");
178 xbt_dynar_t ctn = xbt_dynar_new(sizeof(double),NULL);
179 xbt_dynar_foreach(ctn_str,cursor, str) {
180 double val = atof(str);
181 xbt_dynar_push(ctn,&val);
183 xbt_dynar_shrink(ctn, 0);
184 xbt_dynar_free(&ctn_str);
185 xbt_lib_set(host_lib, host->id, COORD_HOST_LEVEL, (void *) ctn);
186 XBT_DEBUG("Having set host coordinates for '%s'",host->id);
191 * \brief Add a "router" to the network element list
193 static void parse_S_router(sg_platf_router_cbarg_t router)
195 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
196 current_routing->p_hierarchy = SURF_ROUTING_BASE;
197 xbt_assert(!xbt_lib_get_or_null(as_router_lib, router->id, ROUTING_ASR_LEVEL),
198 "Reading a router, processing unit \"%s\" already exists",
201 RoutingEdgePtr info = new RoutingEdgeImpl(xbt_strdup(router->id),
203 SURF_NETWORK_ELEMENT_ROUTER,
205 info->setId(current_routing->parsePU(info));
206 xbt_lib_set(as_router_lib, router->id, ROUTING_ASR_LEVEL, (void *) info);
207 XBT_DEBUG("Having set name '%s' id '%d'", router->id, info->getId());
209 if (router->coord && strcmp(router->coord, "")) {
213 if (!COORD_ASR_LEVEL)
214 xbt_die ("To use host coordinates, please add --cfg=network/coordinates:yes to your command line");
215 /* Pre-parse the host coordinates */
216 xbt_dynar_t ctn_str = xbt_str_split_str(router->coord, " ");
217 xbt_dynar_t ctn = xbt_dynar_new(sizeof(double),NULL);
218 xbt_dynar_foreach(ctn_str,cursor, str) {
219 double val = atof(str);
220 xbt_dynar_push(ctn,&val);
222 xbt_dynar_shrink(ctn, 0);
223 xbt_dynar_free(&ctn_str);
224 xbt_lib_set(as_router_lib, router->id, COORD_ASR_LEVEL, (void *) ctn);
225 XBT_DEBUG("Having set router coordinates for '%s'",router->id);
230 * \brief Store the route by calling the set_route function of the current routing component
232 static void parse_E_route(sg_platf_route_cbarg_t route)
234 /*FIXME:REMOVE:xbt_assert(current_routing->parse_route,
235 "no defined method \"set_route\" in \"%s\"",
236 current_routing->name);*/
238 current_routing->parseRoute(route);
242 * \brief Store the ASroute by calling the set_ASroute function of the current routing component
244 static void parse_E_ASroute(sg_platf_route_cbarg_t ASroute)
246 /*FIXME:REMOVE:xbt_assert(current_routing->parse_ASroute,
247 "no defined method \"set_ASroute\" in \"%s\"",
248 current_routing->name);*/
249 current_routing->parseASroute(ASroute);
253 * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
255 static void parse_E_bypassRoute(sg_platf_route_cbarg_t route)
257 /*FIXME:REMOVE:xbt_assert(current_routing->parse_bypassroute,
258 "Bypassing mechanism not implemented by routing '%s'",
259 current_routing->name);*/
261 current_routing->parseBypassroute(route);
265 * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
267 static void parse_E_bypassASroute(sg_platf_route_cbarg_t ASroute)
269 /*FIXME:REMOVE:xbt_assert(current_routing->parse_bypassroute,
270 "Bypassing mechanism not implemented by routing '%s'",
271 current_routing->name);*/
272 current_routing->parseBypassroute(ASroute);
275 static void routing_parse_trace(sg_platf_trace_cbarg_t trace)
277 tmgr_trace_t tmgr_trace;
278 if (!trace->file || strcmp(trace->file, "") != 0) {
279 tmgr_trace = tmgr_trace_new_from_file(trace->file);
280 } else if (strcmp(trace->pc_data, "") == 0) {
284 tmgr_trace_new_from_string(trace->id, trace->pc_data,
287 xbt_dict_set(traces_set_list, trace->id, (void *) tmgr_trace, NULL);
290 static void routing_parse_trace_connect(sg_platf_trace_connect_cbarg_t trace_connect)
292 xbt_assert(xbt_dict_get_or_null
293 (traces_set_list, trace_connect->trace),
294 "Cannot connect trace %s to %s: trace unknown",
295 trace_connect->trace,
296 trace_connect->element);
298 switch (trace_connect->kind) {
299 case SURF_TRACE_CONNECT_KIND_HOST_AVAIL:
300 xbt_dict_set(trace_connect_list_host_avail,
301 trace_connect->trace,
302 xbt_strdup(trace_connect->element), NULL);
304 case SURF_TRACE_CONNECT_KIND_POWER:
305 xbt_dict_set(trace_connect_list_power, trace_connect->trace,
306 xbt_strdup(trace_connect->element), NULL);
308 case SURF_TRACE_CONNECT_KIND_LINK_AVAIL:
309 xbt_dict_set(trace_connect_list_link_avail,
310 trace_connect->trace,
311 xbt_strdup(trace_connect->element), NULL);
313 case SURF_TRACE_CONNECT_KIND_BANDWIDTH:
314 xbt_dict_set(trace_connect_list_bandwidth,
315 trace_connect->trace,
316 xbt_strdup(trace_connect->element), NULL);
318 case SURF_TRACE_CONNECT_KIND_LATENCY:
319 xbt_dict_set(trace_connect_list_latency, trace_connect->trace,
320 xbt_strdup(trace_connect->element), NULL);
323 surf_parse_error("Cannot connect trace %s to %s: kind of trace unknown",
324 trace_connect->trace, trace_connect->element);
330 * \brief Make a new routing component to the platform
332 * Add a new autonomous system to the platform. Any elements (such as host,
333 * router or sub-AS) added after this call and before the corresponding call
334 * to sg_platf_new_AS_close() will be added to this AS.
336 * Once this function was called, the configuration concerning the used
337 * models cannot be changed anymore.
339 * @param AS_id name of this autonomous system. Must be unique in the platform
340 * @param wanted_routing_type one of Full, Floyd, Dijkstra or similar. Full list in the variable routing_models, in src/surf/surf_routing.c
342 void routing_AS_begin(sg_platf_AS_cbarg_t AS)
344 XBT_DEBUG("routing_AS_begin");
345 routing_model_description_t model = NULL;
347 xbt_assert(!xbt_lib_get_or_null
348 (as_router_lib, AS->id, ROUTING_ASR_LEVEL),
349 "The AS \"%s\" already exists", AS->id);
351 _sg_cfg_init_status = 2; /* horrible hack: direct access to the global
352 * controlling the level of configuration to prevent
353 * any further config */
355 /* search the routing model */
357 case A_surfxml_AS_routing_Cluster: model = &routing_models[SURF_MODEL_CLUSTER];break;
358 case A_surfxml_AS_routing_Cluster___torus: model = &routing_models[SURF_MODEL_TORUS_CLUSTER];break;
359 case A_surfxml_AS_routing_Cluster___fat___tree: model = &routing_models[SURF_MODEL_FAT_TREE_CLUSTER];break;
360 case A_surfxml_AS_routing_Dijkstra: model = &routing_models[SURF_MODEL_DIJKSTRA];break;
361 case A_surfxml_AS_routing_DijkstraCache: model = &routing_models[SURF_MODEL_DIJKSTRACACHE];break;
362 case A_surfxml_AS_routing_Floyd: model = &routing_models[SURF_MODEL_FLOYD];break;
363 case A_surfxml_AS_routing_Full: model = &routing_models[SURF_MODEL_FULL];break;
364 case A_surfxml_AS_routing_None: model = &routing_models[SURF_MODEL_NONE];break;
365 case A_surfxml_AS_routing_Vivaldi: model = &routing_models[SURF_MODEL_VIVALDI];break;
366 default: xbt_die("Not a valid model!!!");
370 /* make a new routing component */
371 AsPtr new_as = model->create();
373 new_as->p_modelDesc = model;
374 new_as->p_hierarchy = SURF_ROUTING_NULL;
375 new_as->p_name = xbt_strdup(AS->id);
377 RoutingEdgePtr info = new RoutingEdgeImpl(xbt_strdup(new_as->p_name),
379 SURF_NETWORK_ELEMENT_AS,
381 if (current_routing == NULL && routing_platf->p_root == NULL) {
383 /* it is the first one */
384 new_as->p_routingFather = NULL;
385 routing_platf->p_root = new_as;
387 } else if (current_routing != NULL && routing_platf->p_root != NULL) {
389 xbt_assert(!xbt_dict_get_or_null
390 (current_routing->p_routingSons, AS->id),
391 "The AS \"%s\" already exists", AS->id);
392 /* it is a part of the tree */
393 new_as->p_routingFather = current_routing;
394 /* set the father behavior */
395 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
396 current_routing->p_hierarchy = SURF_ROUTING_RECURSIVE;
397 /* add to the sons dictionary */
398 xbt_dict_set(current_routing->p_routingSons, AS->id,
399 (void *) new_as, NULL);
400 /* add to the father element list */
401 info->setId(current_routing->parseAS(info));
403 THROWF(arg_error, 0, "All defined components must belong to a AS");
406 xbt_lib_set(as_router_lib, info->getName(), ROUTING_ASR_LEVEL,
408 XBT_DEBUG("Having set name '%s' id '%d'", new_as->p_name, info->getId());
410 /* set the new current component of the tree */
411 current_routing = new_as;
412 current_routing->p_netElem = info;
417 * \brief Specify that the current description of AS is finished
419 * Once you've declared all the content of your AS, you have to close
420 * it with this call. Your AS is not usable until you call this function.
422 * @fixme: this call is not as robust as wanted: bad things WILL happen
423 * if you call it twice for the same AS, or if you forget calling it, or
424 * even if you add stuff to a closed AS
427 void routing_AS_end(sg_platf_AS_cbarg_t /*AS*/)
430 if (current_routing == NULL) {
431 THROWF(arg_error, 0, "Close an AS, but none was under construction");
433 if (current_routing->p_modelDesc->end)
434 current_routing->p_modelDesc->end(current_routing);
435 current_routing = current_routing->p_routingFather;
439 /* Aux Business methods */
442 * \brief Get the AS father and the first elements of the chain
444 * \param src the source host name
445 * \param dst the destination host name
447 * Get the common father of the to processing units, and the first different
448 * father in the chain
450 static void elements_father(sg_routing_edge_t src, sg_routing_edge_t dst,
455 xbt_assert(src && dst, "bad parameters for \"elements_father\" method");
456 #define ELEMENTS_FATHER_MAXDEPTH 16 /* increase if it is not enough */
457 AsPtr src_as, dst_as;
458 AsPtr path_src[ELEMENTS_FATHER_MAXDEPTH];
459 AsPtr path_dst[ELEMENTS_FATHER_MAXDEPTH];
467 /* (1) find the as where the src and dst are located */
468 sg_routing_edge_t src_data = src;
469 sg_routing_edge_t dst_data = dst;
470 src_as = src_data->getRcComponent();
471 dst_as = dst_data->getRcComponent();
473 char* src_name = src_data->getName();
474 char* dst_name = dst_data->getName();
477 xbt_assert(src_as && dst_as,
478 "Ask for route \"from\"(%s) or \"to\"(%s) no found", src_name, dst_name);
480 /* (2) find the path to the root routing component */
481 for (current = src_as; current != NULL; current = current->p_routingFather) {
482 if (index_src >= ELEMENTS_FATHER_MAXDEPTH)
483 xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_src");
484 path_src[index_src++] = current;
486 for (current = dst_as; current != NULL; current = current->p_routingFather) {
487 if (index_dst >= ELEMENTS_FATHER_MAXDEPTH)
488 xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_dst");
489 path_dst[index_dst++] = current;
492 /* (3) find the common father */
494 current_src = path_src[--index_src];
495 current_dst = path_dst[--index_dst];
496 } while (index_src > 0 && index_dst > 0 && current_src == current_dst);
498 /* (4) they are not in the same routing component, make the path */
499 if (current_src == current_dst)
500 father = current_src;
502 father = path_src[index_src + 1];
504 /* (5) result generation */
505 *res_father = father; /* first the common father of src and dst */
506 *res_src = current_src; /* second the first different father of src */
507 *res_dst = current_dst; /* three the first different father of dst */
509 #undef ELEMENTS_FATHER_MAXDEPTH
512 /* Global Business methods */
515 * \brief Recursive function for get_route_latency
517 * \param src the source host name
518 * \param dst the destination host name
519 * \param *route the route where the links are stored. It is either NULL or a ready to use dynar
520 * \param *latency the latency, if needed
522 * This function is called by "get_route" and "get_latency". It allows to walk
523 * recursively through the ASes tree.
525 static void _get_route_and_latency(RoutingEdgePtr src, RoutingEdgePtr dst,
526 xbt_dynar_t * links, double *latency)
528 s_sg_platf_route_cbarg_t route;
529 memset(&route,0,sizeof(route));
531 xbt_assert(src && dst, "bad parameters for \"_get_route_latency\" method");
532 XBT_DEBUG("Solve route/latency \"%s\" to \"%s\"", src->getName(), dst->getName());
534 /* Find how src and dst are interconnected */
535 AsPtr common_father, src_father, dst_father;
536 elements_father(src, dst, &common_father, &src_father, &dst_father);
537 XBT_DEBUG("elements_father: common father '%s' src_father '%s' dst_father '%s'",
538 common_father->p_name, src_father->p_name, dst_father->p_name);
540 /* Check whether a direct bypass is defined */
541 sg_platf_route_cbarg_t e_route_bypass = NULL;
542 //FIXME:REMOVE:if (common_father->get_bypass_route)
544 e_route_bypass = common_father->getBypassRoute(src, dst, latency);
546 /* Common ancestor is kind enough to declare a bypass route from src to dst -- use it and bail out */
547 if (e_route_bypass) {
548 xbt_dynar_merge(links, &e_route_bypass->link_list);
549 generic_free_route(e_route_bypass);
553 /* If src and dst are in the same AS, life is good */
554 if (src_father == dst_father) { /* SURF_ROUTING_BASE */
555 route.link_list = *links;
556 common_father->getRouteAndLatency(src, dst, &route, latency);
557 // if vivaldi latency+=vivaldi(src,dst)
561 /* Not in the same AS, no bypass. We'll have to find our path between the ASes recursively*/
563 route.link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
564 // Find the net_card corresponding to father
565 RoutingEdgePtr src_father_net_elm = src_father->p_netElem;
566 RoutingEdgePtr dst_father_net_elm = dst_father->p_netElem;
568 common_father->getRouteAndLatency(src_father_net_elm, dst_father_net_elm,
571 xbt_assert((route.gw_src != NULL) && (route.gw_dst != NULL),
572 "bad gateways for route from \"%s\" to \"%s\"", src->getName(), dst->getName());
574 sg_routing_edge_t src_gateway_net_elm = route.gw_src;
575 sg_routing_edge_t dst_gateway_net_elm = route.gw_dst;
577 /* If source gateway is not our source, we have to recursively find our way up to this point */
578 if (src != src_gateway_net_elm)
579 _get_route_and_latency(src, src_gateway_net_elm, links, latency);
580 xbt_dynar_merge(links, &route.link_list);
582 /* If dest gateway is not our destination, we have to recursively find our way from this point */
583 if (dst_gateway_net_elm != dst)
584 _get_route_and_latency(dst_gateway_net_elm, dst, links, latency);
586 // if vivaldi latency+=vivaldi(src_gateway,dst_gateway)
589 AS_t surf_platf_get_root(routing_platf_t platf){
590 return platf->p_root;
593 e_surf_network_element_type_t surf_routing_edge_get_rc_type(sg_routing_edge_t edge){
594 return edge->getRcType();
599 * \brief Find a route between hosts
601 * \param src the network_element_t for src host
602 * \param dst the network_element_t for dst host
603 * \param route where to store the list of links.
604 * If *route=NULL, create a short lived dynar. Else, fill the provided dynar
605 * \param latency where to store the latency experienced on the path (or NULL if not interested)
606 * It is the caller responsability to initialize latency to 0 (we add to provided route)
609 * walk through the routing components tree and find a route between hosts
610 * by calling the differents "get_route" functions in each routing component.
612 void RoutingPlatf::getRouteAndLatency(RoutingEdgePtr src, RoutingEdgePtr dst,
613 xbt_dynar_t* route, double *latency)
615 XBT_DEBUG("routing_get_route_and_latency from %s to %s", src->getName(), dst->getName());
617 xbt_dynar_reset(routing_platf->p_lastRoute);
618 *route = routing_platf->p_lastRoute;
621 _get_route_and_latency(src, dst, route, latency);
623 xbt_assert(!latency || *latency >= 0.0,
624 "negative latency on route between \"%s\" and \"%s\"", src->getName(), dst->getName());
627 xbt_dynar_t RoutingPlatf::getOneLinkRoutes(){
628 return recursiveGetOneLinkRoutes(p_root);
631 xbt_dynar_t RoutingPlatf::recursiveGetOneLinkRoutes(AsPtr rc)
633 xbt_dynar_t ret = xbt_dynar_new(sizeof(OnelinkPtr), xbt_free_f);
635 //adding my one link routes
636 xbt_dynar_t onelink_mine = rc->getOneLinkRoutes();
638 xbt_dynar_merge(&ret,&onelink_mine);
642 xbt_dict_cursor_t cursor = NULL;
644 xbt_dict_foreach(rc->p_routingSons, cursor, key, rc_child) {
645 xbt_dynar_t onelink_child = recursiveGetOneLinkRoutes(rc_child);
647 xbt_dynar_merge(&ret,&onelink_child);
652 e_surf_network_element_type_t routing_get_network_element_type(const char *name)
654 RoutingEdgePtr rc = sg_routing_edge_by_name_or_null(name);
656 return rc->getRcType();
658 return SURF_NETWORK_ELEMENT_NULL;
662 * \brief Generic method: create the global routing schema
664 * Make a global routing structure and set all the parsing functions.
666 void routing_model_create( void *loopback)
668 /* config the uniq global routing */
669 routing_platf = new RoutingPlatf();
670 routing_platf->p_root = NULL;
671 routing_platf->p_loopback = loopback;
672 routing_platf->p_lastRoute = xbt_dynar_new(sizeof(sg_routing_link_t),NULL);
673 /* no current routing at moment */
674 current_routing = NULL;
678 /* ************************************************** */
679 /* ********** PATERN FOR NEW ROUTING **************** */
681 /* The minimal configuration of a new routing model need the next functions,
682 * also you need to set at the start of the file, the new model in the model
683 * list. Remember keep the null ending of the list.
685 /*** Routing model structure ***/
687 // s_routing_component_t generic_routing;
688 // /* things that your routing model need */
689 // } s_routing_component_NEW_t,*routing_component_NEW_t;
691 /*** Parse routing model functions ***/
692 // static void model_NEW_set_processing_unit(routing_component_t rc, const char* name) {}
693 // static void model_NEW_set_autonomous_system(routing_component_t rc, const char* name) {}
694 // static void model_NEW_set_route(routing_component_t rc, const char* src, const char* dst, route_t route) {}
695 // static void model_NEW_set_ASroute(routing_component_t rc, const char* src, const char* dst, route_extended_t route) {}
696 // static void model_NEW_set_bypassroute(routing_component_t rc, const char* src, const char* dst, route_extended_t e_route) {}
698 /*** Business methods ***/
699 // static route_extended_t NEW_get_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
700 // static route_extended_t NEW_get_bypass_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
701 // static void NEW_finalize(routing_component_t rc) { xbt_free(rc);}
703 /*** Creation routing model functions ***/
704 // static void* model_NEW_create(void) {
705 // routing_component_NEW_t new_component = xbt_new0(s_routing_component_NEW_t,1);
706 // new_component->generic_routing.set_processing_unit = model_NEW_set_processing_unit;
707 // new_component->generic_routing.set_autonomous_system = model_NEW_set_autonomous_system;
708 // new_component->generic_routing.set_route = model_NEW_set_route;
709 // new_component->generic_routing.set_ASroute = model_NEW_set_ASroute;
710 // new_component->generic_routing.set_bypassroute = model_NEW_set_bypassroute;
711 // new_component->generic_routing.get_route = NEW_get_route;
712 // new_component->generic_routing.get_bypass_route = NEW_get_bypass_route;
713 // new_component->generic_routing.finalize = NEW_finalize;
714 // /* initialization of internal structures */
715 // return new_component;
717 // static void model_NEW_load(void) {} /* mandatory */
718 // static void model_NEW_unload(void) {} /* mandatory */
719 // static void model_NEW_end(void) {} /* mandatory */
721 /* ************************************************************************** */
722 /* ************************* GENERIC PARSE FUNCTIONS ************************ */
724 void routing_cluster_add_backbone(void* bb) {
725 xbt_assert(current_routing->p_modelDesc == &routing_models[SURF_MODEL_CLUSTER],
726 "You have to be in model Cluster to use tag backbone!");
727 xbt_assert(!surf_as_cluster_get_backbone(current_routing), "The backbone link is already defined!");
728 surf_as_cluster_set_backbone(current_routing, bb);
729 XBT_DEBUG("Add a backbone to AS '%s'", current_routing->p_name);
732 static void routing_parse_cabinet(sg_platf_cabinet_cbarg_t cabinet)
735 char *groups , *host_id , *link_id = NULL;
737 xbt_dynar_t radical_elements;
738 xbt_dynar_t radical_ends;
741 radical_elements = xbt_str_split(cabinet->radical, ",");
742 xbt_dynar_foreach(radical_elements, iter, groups) {
744 radical_ends = xbt_str_split(groups, "-");
745 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
747 switch (xbt_dynar_length(radical_ends)) {
752 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
755 surf_parse_error("Malformed radical");
758 s_sg_platf_host_cbarg_t host;
759 memset(&host, 0, sizeof(host));
760 host.initial_state = SURF_RESOURCE_ON;
762 host.power_scale = 1.0;
763 host.core_amount = 1;
765 s_sg_platf_link_cbarg_t link;
766 memset(&link, 0, sizeof(link));
767 link.state = SURF_RESOURCE_ON;
768 link.policy = SURF_LINK_FULLDUPLEX;
769 link.latency = cabinet->lat;
770 link.bandwidth = cabinet->bw;
772 s_sg_platf_host_link_cbarg_t host_link;
773 memset(&host_link, 0, sizeof(host_link));
775 for (i = start; i <= end; i++) {
776 host_id = bprintf("%s%d%s",cabinet->prefix,i,cabinet->suffix);
777 link_id = bprintf("link_%s%d%s",cabinet->prefix,i,cabinet->suffix);
780 xbt_dynar_t power_state_list = xbt_dynar_new(sizeof(double), NULL);
781 xbt_dynar_push(power_state_list,&cabinet->power);
782 host.power_peak = power_state_list;
783 sg_platf_new_host(&host);
784 sg_platf_new_link(&link);
786 char* link_up = bprintf("%s_UP",link_id);
787 char* link_down = bprintf("%s_DOWN",link_id);
788 host_link.id = host_id;
789 host_link.link_up = link_up;
790 host_link.link_down = link_down;
791 sg_platf_new_host_link(&host_link);
799 xbt_dynar_free(&radical_ends);
801 xbt_dynar_free(&radical_elements);
804 static void routing_parse_cluster(sg_platf_cluster_cbarg_t cluster)
806 char *host_id, *groups, *link_id = NULL;
807 xbt_dict_t patterns = NULL;
810 s_sg_platf_host_cbarg_t host;
811 s_sg_platf_link_cbarg_t link;
815 xbt_dynar_t radical_elements;
816 xbt_dynar_t radical_ends;
818 if ((cluster->availability_trace && strcmp(cluster->availability_trace, ""))
819 || (cluster->state_trace && strcmp(cluster->state_trace, ""))) {
820 patterns = xbt_dict_new_homogeneous(xbt_free_f);
821 xbt_dict_set(patterns, "id", xbt_strdup(cluster->id), NULL);
822 xbt_dict_set(patterns, "prefix", xbt_strdup(cluster->prefix), NULL);
823 xbt_dict_set(patterns, "suffix", xbt_strdup(cluster->suffix), NULL);
826 /* parse the topology attribute. If we are not in a flat cluster,
827 * switch to the right mode and initialize the routing with
828 * the parameters in topo_parameters attribute
830 s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
833 if(cluster->topology == SURF_CLUSTER_TORUS){
834 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Torus_Cluster\">", cluster->id);
835 AS.routing = A_surfxml_AS_routing_Cluster___torus;
836 sg_platf_new_AS_begin(&AS);
837 ((AsClusterTorusPtr)current_routing)->parse_specific_arguments(cluster);
839 else if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
840 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Fat_Tree_Cluster\">", cluster->id);
841 AS.routing = A_surfxml_AS_routing_Cluster___fat___tree;
842 sg_platf_new_AS_begin(&AS);
843 ((AsClusterFatTree*)current_routing)->parse_specific_arguments(cluster);
847 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", cluster->id);
848 AS.routing = A_surfxml_AS_routing_Cluster;
849 sg_platf_new_AS_begin(&AS);
852 if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
853 ((AsClusterPtr)current_routing)->p_nb_links_per_node++;
854 ((AsClusterPtr)current_routing)->p_has_loopback=1;
857 if(cluster->limiter_link!=0){
858 ((AsClusterPtr)current_routing)->p_nb_links_per_node++;
859 ((AsClusterPtr)current_routing)->p_has_limiter=1;
864 current_routing->p_linkUpDownList
865 = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
868 radical_elements = xbt_str_split(cluster->radical, ",");
869 xbt_dynar_foreach(radical_elements, iter, groups) {
871 radical_ends = xbt_str_split(groups, "-");
872 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
874 switch (xbt_dynar_length(radical_ends)) {
879 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
882 surf_parse_error("Malformed radical");
885 for (i = start; i <= end; i++) {
887 bprintf("%s%d%s", cluster->prefix, i, cluster->suffix);
888 link_id = bprintf("%s_link_%d", cluster->id, i);
890 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\">", host_id, cluster->power);
892 memset(&host, 0, sizeof(host));
894 if ((cluster->properties != NULL) && (!xbt_dict_is_empty(cluster->properties))) {
895 xbt_dict_cursor_t cursor=NULL;
897 host.properties = xbt_dict_new();
899 xbt_dict_foreach(cluster->properties,cursor,key,data) {
900 xbt_dict_set(host.properties, key, xbt_strdup(data),free);
903 if (cluster->availability_trace && strcmp(cluster->availability_trace, "")) {
904 xbt_dict_set(patterns, "radical", bprintf("%d", i), NULL);
905 char *avail_file = xbt_str_varsubst(cluster->availability_trace, patterns);
906 XBT_DEBUG("\tavailability_file=\"%s\"", avail_file);
907 host.power_trace = tmgr_trace_new_from_file(avail_file);
908 xbt_free(avail_file);
910 XBT_DEBUG("\tavailability_file=\"\"");
913 if (cluster->state_trace && strcmp(cluster->state_trace, "")) {
914 char *avail_file = xbt_str_varsubst(cluster->state_trace, patterns);
915 XBT_DEBUG("\tstate_file=\"%s\"", avail_file);
916 host.state_trace = tmgr_trace_new_from_file(avail_file);
917 xbt_free(avail_file);
919 XBT_DEBUG("\tstate_file=\"\"");
922 xbt_dynar_t power_state_list = xbt_dynar_new(sizeof(double), NULL);
923 xbt_dynar_push(power_state_list,&cluster->power);
924 host.power_peak = power_state_list;
927 //host.power_peak = cluster->power;
928 host.power_scale = 1.0;
929 host.core_amount = cluster->core_amount;
930 host.initial_state = SURF_RESOURCE_ON;
932 sg_platf_new_host(&host);
933 XBT_DEBUG("</host>");
935 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_id,
936 cluster->bw, cluster->lat);
939 s_surf_parsing_link_up_down_t info_lim, info_loop;
940 // All links are saved in a matrix;
941 // every row describes a single node; every node
942 // may have multiple links.
943 // the first column may store a link from x to x if p_has_loopback is set
944 // the second column may store a limiter link if p_has_limiter is set
945 // other columns are to store one or more link for the node
947 //add a loopback link
948 if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
949 char *tmp_link = bprintf("%s_loopback", link_id);
950 XBT_DEBUG("<loopback\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
951 cluster->limiter_link);
954 memset(&link, 0, sizeof(link));
956 link.bandwidth = cluster->loopback_bw;
957 link.latency = cluster->loopback_lat;
958 link.state = SURF_RESOURCE_ON;
959 link.policy = SURF_LINK_FATPIPE;
960 sg_platf_new_link(&link);
962 xbt_lib_get_or_null(link_lib, tmp_link, SURF_LINK_LEVEL);
963 info_loop.link_down = info_loop.link_up;
965 xbt_dynar_set(current_routing->p_linkUpDownList, rankId*((AsClusterPtr)current_routing)->p_nb_links_per_node, &info_loop);
968 //add a limiter link (shared link to account for maximal bandwidth of the node)
969 if(cluster->limiter_link!=0){
970 char *tmp_link = bprintf("%s_limiter", link_id);
971 XBT_DEBUG("<limiter\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
972 cluster->limiter_link);
975 memset(&link, 0, sizeof(link));
977 link.bandwidth = cluster->limiter_link;
979 link.state = SURF_RESOURCE_ON;
980 link.policy = SURF_LINK_SHARED;
981 sg_platf_new_link(&link);
983 xbt_lib_get_or_null(link_lib, tmp_link, SURF_LINK_LEVEL);
984 info_lim.link_down = info_lim.link_up;
986 xbt_dynar_set(current_routing->p_linkUpDownList,
987 rankId*((AsClusterPtr)current_routing)->p_nb_links_per_node + ((AsClusterPtr)current_routing)->p_has_loopback ,
993 //call the cluster function that adds the others links
994 if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
995 ((AsClusterFatTree*) current_routing)->addProcessingNode(i);
998 ((AsClusterPtr)current_routing)->create_links_for_node(cluster, i, rankId, rankId*
999 ((AsClusterPtr)current_routing)->p_nb_links_per_node
1000 + ((AsClusterPtr)current_routing)->p_has_loopback
1001 + ((AsClusterPtr)current_routing)->p_has_limiter );
1008 xbt_dynar_free(&radical_ends);
1010 xbt_dynar_free(&radical_elements);
1012 // For fat trees, the links must be created once all nodes have been added
1013 if(cluster->topology == SURF_CLUSTER_FAT_TREE) {
1014 ((AsClusterFatTree*)current_routing)->create_links();
1016 // Add a router. It is magically used thanks to the way in which surf_routing_cluster is written,
1017 // and it's very useful to connect clusters together
1019 XBT_DEBUG("<router id=\"%s\"/>", cluster->router_id);
1021 s_sg_platf_router_cbarg_t router;
1022 memset(&router, 0, sizeof(router));
1023 router.id = cluster->router_id;
1025 if (!router.id || !strcmp(router.id, ""))
1027 bprintf("%s%s_router%s", cluster->prefix, cluster->id,
1029 sg_platf_new_router(&router);
1030 ((AsClusterPtr)current_routing)->p_router = (RoutingEdgePtr) xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL);
1034 if ((cluster->bb_bw != 0) || (cluster->bb_lat != 0)) {
1035 char *link_backbone = bprintf("%s_backbone", cluster->id);
1036 XBT_DEBUG("<link\tid=\"%s\" bw=\"%f\" lat=\"%f\"/>", link_backbone,
1037 cluster->bb_bw, cluster->bb_lat);
1039 memset(&link, 0, sizeof(link));
1040 link.id = link_backbone;
1041 link.bandwidth = cluster->bb_bw;
1042 link.latency = cluster->bb_lat;
1043 link.state = SURF_RESOURCE_ON;
1044 link.policy = cluster->bb_sharing_policy;
1046 sg_platf_new_link(&link);
1048 routing_cluster_add_backbone(xbt_lib_get_or_null(link_lib, link_backbone, SURF_LINK_LEVEL));
1050 free(link_backbone);
1054 sg_platf_new_AS_end();
1056 xbt_dict_free(&patterns); // no op if it were never set
1059 static void routing_parse_postparse(void) {
1060 xbt_dict_free(&random_value);
1063 static void routing_parse_peer(sg_platf_peer_cbarg_t peer)
1065 char *host_id = NULL;
1066 char *link_id = NULL;
1067 char *router_id = NULL;
1070 host_id = HOST_PEER(peer->id);
1071 link_id = LINK_PEER(peer->id);
1072 router_id = ROUTER_PEER(peer->id);
1074 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", peer->id);
1075 s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
1077 AS.routing = A_surfxml_AS_routing_Cluster;
1078 sg_platf_new_AS_begin(&AS);
1080 current_routing->p_linkUpDownList = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
1082 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\"/>", host_id, peer->power);
1083 s_sg_platf_host_cbarg_t host;
1084 memset(&host, 0, sizeof(host));
1085 host.initial_state = SURF_RESOURCE_ON;
1088 xbt_dynar_t power_state_list = xbt_dynar_new(sizeof(double), NULL);
1089 xbt_dynar_push(power_state_list,&peer->power);
1090 host.power_peak = power_state_list;
1092 //host.power_peak = peer->power;
1093 host.power_scale = 1.0;
1094 host.power_trace = peer->availability_trace;
1095 host.state_trace = peer->state_trace;
1096 host.core_amount = 1;
1097 sg_platf_new_host(&host);
1099 s_sg_platf_link_cbarg_t link;
1100 memset(&link, 0, sizeof(link));
1101 link.state = SURF_RESOURCE_ON;
1102 link.policy = SURF_LINK_SHARED;
1103 link.latency = peer->lat;
1105 char* link_up = bprintf("%s_UP",link_id);
1106 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_up,
1107 peer->bw_out, peer->lat);
1109 link.bandwidth = peer->bw_out;
1110 sg_platf_new_link(&link);
1112 char* link_down = bprintf("%s_DOWN",link_id);
1113 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_down,
1114 peer->bw_in, peer->lat);
1115 link.id = link_down;
1116 link.bandwidth = peer->bw_in;
1117 sg_platf_new_link(&link);
1119 XBT_DEBUG("<host_link\tid=\"%s\"\tup=\"%s\"\tdown=\"%s\" />", host_id,link_up,link_down);
1120 s_sg_platf_host_link_cbarg_t host_link;
1121 memset(&host_link, 0, sizeof(host_link));
1122 host_link.id = host_id;
1123 host_link.link_up = link_up;
1124 host_link.link_down = link_down;
1125 sg_platf_new_host_link(&host_link);
1127 XBT_DEBUG("<router id=\"%s\"/>", router_id);
1128 s_sg_platf_router_cbarg_t router;
1129 memset(&router, 0, sizeof(router));
1130 router.id = router_id;
1131 router.coord = peer->coord;
1132 sg_platf_new_router(&router);
1133 static_cast<AsClusterPtr>(current_routing)->p_router = static_cast<RoutingEdgePtr>(xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL));
1136 sg_platf_new_AS_end();
1139 //xbt_dynar_free(&tab_elements_num);
1147 // static void routing_parse_Srandom(void)
1149 // double mean, std, min, max, seed;
1150 // char *random_id = A_surfxml_random_id;
1151 // char *random_radical = A_surfxml_random_radical;
1152 // char *rd_name = NULL;
1154 // mean = surf_parse_get_double(A_surfxml_random_mean);
1155 // std = surf_parse_get_double(A_surfxml_random_std___deviation);
1156 // min = surf_parse_get_double(A_surfxml_random_min);
1157 // max = surf_parse_get_double(A_surfxml_random_max);
1158 // seed = surf_parse_get_double(A_surfxml_random_seed);
1162 // random_data_t random = xbt_new0(s_random_data_t, 1);
1165 // xbt_dynar_t radical_elements;
1166 // unsigned int iter;
1169 // xbt_dynar_t radical_ends;
1171 // switch (A_surfxml_random_generator) {
1172 // case AU_surfxml_random_generator:
1173 // case A_surfxml_random_generator_NONE:
1174 // random->generator = NONE;
1176 // case A_surfxml_random_generator_DRAND48:
1177 // random->generator = DRAND48;
1179 // case A_surfxml_random_generator_RAND:
1180 // random->generator = RAND;
1182 // case A_surfxml_random_generator_RNGSTREAM:
1183 // random->generator = RNGSTREAM;
1186 // surf_parse_error("Invalid random generator");
1189 // random->seed = seed;
1190 // random->min = min;
1191 // random->max = max;
1193 // /* Check user stupidities */
1195 // THROWF(arg_error, 0, "random->max < random->min (%f < %f)", max, min);
1197 // THROWF(arg_error, 0, "random->mean < random->min (%f < %f)", mean, min);
1199 // THROWF(arg_error, 0, "random->mean > random->max (%f > %f)", mean, max);
1201 // /* normalize the mean and standard deviation before storing */
1202 // random->mean = (mean - min) / (max - min);
1203 // random->std = std / (max - min);
1205 // if (random->mean * (1 - random->mean) < random->std * random->std)
1206 // THROWF(arg_error, 0, "Invalid mean and standard deviation (%f and %f)",
1207 // random->mean, random->std);
1210 // ("id = '%s' min = '%f' max = '%f' mean = '%f' std_deviatinon = '%f' generator = '%d' seed = '%ld' radical = '%s'",
1211 // random_id, random->min, random->max, random->mean, random->std,
1212 // (int)random->generator, random->seed, random_radical);
1214 // if (!random_value)
1215 // random_value = xbt_dict_new_homogeneous(free);
1217 // if (!strcmp(random_radical, "")) {
1218 // res = random_generate(random);
1219 // rd_value = bprintf("%f", res);
1220 // xbt_dict_set(random_value, random_id, rd_value, NULL);
1222 // radical_elements = xbt_str_split(random_radical, ",");
1223 // xbt_dynar_foreach(radical_elements, iter, groups) {
1224 // radical_ends = xbt_str_split(groups, "-");
1225 // switch (xbt_dynar_length(radical_ends)) {
1227 // xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1228 // "Custom Random '%s' already exists !", random_id);
1229 // res = random_generate(random);
1231 // bprintf("%s%d", random_id,
1232 // atoi(xbt_dynar_getfirst_as(radical_ends, char *)));
1233 // xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1234 // xbt_free(tmpbuf);
1238 // start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
1239 // end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
1240 // for (i = start; i <= end; i++) {
1241 // xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1242 // "Custom Random '%s' already exists !", bprintf("%s%d",
1245 // res = random_generate(random);
1246 // tmpbuf = bprintf("%s%d", random_id, i);
1247 // xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1248 // xbt_free(tmpbuf);
1252 // XBT_CRITICAL("Malformed radical");
1255 // res = random_generate(random);
1256 // rd_name = bprintf("%s_router", random_id);
1257 // rd_value = bprintf("%f", res);
1258 // xbt_dict_set(random_value, rd_name, rd_value, NULL);
1260 // xbt_dynar_free(&radical_ends);
1263 // xbt_dynar_free(&radical_elements);
1267 static void check_disk_attachment()
1269 xbt_lib_cursor_t cursor;
1272 RoutingEdgePtr host_elm;
1273 xbt_lib_foreach(storage_lib, cursor, key, data) {
1274 if(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL) != NULL) {
1275 StoragePtr storage = static_cast<StoragePtr>(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL));
1276 host_elm = sg_routing_edge_by_name_or_null(storage->p_attach);
1278 surf_parse_error("Unable to attach storage %s: host %s doesn't exist.", storage->getName(), storage->p_attach);
1283 void routing_register_callbacks()
1285 sg_platf_host_add_cb(parse_S_host);
1286 sg_platf_router_add_cb(parse_S_router);
1287 sg_platf_host_link_add_cb(parse_S_host_link);
1288 sg_platf_route_add_cb(parse_E_route);
1289 sg_platf_ASroute_add_cb(parse_E_ASroute);
1290 sg_platf_bypassRoute_add_cb(parse_E_bypassRoute);
1291 sg_platf_bypassASroute_add_cb(parse_E_bypassASroute);
1293 sg_platf_cluster_add_cb(routing_parse_cluster);
1294 sg_platf_cabinet_add_cb(routing_parse_cabinet);
1296 sg_platf_peer_add_cb(routing_parse_peer);
1297 sg_platf_postparse_add_cb(routing_parse_postparse);
1298 sg_platf_postparse_add_cb(check_disk_attachment);
1300 /* we care about the ASes while parsing the platf. Incredible, isnt it? */
1301 sg_platf_AS_end_add_cb(routing_AS_end);
1302 sg_platf_AS_begin_add_cb(routing_AS_begin);
1304 sg_platf_trace_add_cb(routing_parse_trace);
1305 sg_platf_trace_connect_add_cb(routing_parse_trace_connect);
1307 instr_routing_define_callbacks();
1311 * \brief Recursive function for finalize
1313 * \param rc the source host name
1315 * This fuction is call by "finalize". It allow to finalize the
1316 * AS or routing components. It delete all the structures.
1318 static void finalize_rec(AsPtr as) {
1319 xbt_dict_cursor_t cursor = NULL;
1323 xbt_dict_foreach(as->p_routingSons, cursor, key, elem) {
1330 /** \brief Frees all memory allocated by the routing module */
1331 void routing_exit(void) {
1332 delete routing_platf;
1335 RoutingPlatf::~RoutingPlatf()
1337 xbt_dynar_free(&p_lastRoute);
1338 finalize_rec(p_root);
1341 AS_t surf_AS_get_routing_root() {
1342 return routing_platf->p_root;
1345 const char *surf_AS_get_name(AsPtr as) {
1349 static AsPtr surf_AS_recursive_get_by_name(AsPtr current, const char * name) {
1350 xbt_dict_cursor_t cursor = NULL;
1355 if(!strcmp(current->p_name, name))
1358 xbt_dict_foreach(current->p_routingSons, cursor, key, elem) {
1359 tmp = surf_AS_recursive_get_by_name(elem, name);
1368 AsPtr surf_AS_get_by_name(const char * name) {
1369 AsPtr as = surf_AS_recursive_get_by_name(routing_platf->p_root, name);
1371 XBT_WARN("Impossible to find an AS with name %s, please check your input", name);
1375 xbt_dict_t surf_AS_get_routing_sons(AsPtr as) {
1376 return as->p_routingSons;
1379 const char *surf_AS_get_model(AsPtr as) {
1380 return as->p_modelDesc->name;
1383 xbt_dynar_t surf_AS_get_hosts(AsPtr as) {
1384 xbt_dynar_t elms = as->p_indexNetworkElm;
1385 sg_routing_edge_t relm;
1388 int count = xbt_dynar_length(elms);
1389 xbt_dynar_t res = xbt_dynar_new(sizeof(xbt_dictelm_t), NULL);
1390 for (index = 0; index < count; index++) {
1391 relm = xbt_dynar_get_as(elms, index, RoutingEdgePtr);
1392 delm = xbt_lib_get_elm_or_null(host_lib, relm->getName());
1394 xbt_dynar_push(res, &delm);
1400 void surf_AS_get_graph(AS_t as, xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges) {
1401 as->getGraph(graph, nodes, edges);