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 workstations
26 int ROUTING_HOST_LEVEL; //Routing level
27 int SURF_CPU_LEVEL; //Surf cpu level
28 int SURF_WKS_LEVEL; //Surf workstation level
29 int SIMIX_HOST_LEVEL; //Simix host level
30 int SIMIX_STORAGE_LEVEL; //Simix storage level
31 int MSG_HOST_LEVEL; //Msg host level
32 int MSG_STORAGE_LEVEL; //Msg storage level
33 int MSG_FILE_LEVEL; //Msg file level
34 int SD_HOST_LEVEL; //Simdag host level
35 int SD_STORAGE_LEVEL; //Simdag storage level
36 int COORD_HOST_LEVEL=0; //Coordinates level
37 int NS3_HOST_LEVEL; //host node for ns3
40 * @ingroup SURF_build_api
41 * @brief A library containing all known links
44 int SD_LINK_LEVEL; //Simdag level
45 int SURF_LINK_LEVEL; //Surf level
47 xbt_lib_t as_router_lib;
48 int ROUTING_ASR_LEVEL; //Routing level
49 int COORD_ASR_LEVEL; //Coordinates level
50 int NS3_ASR_LEVEL; //host node for ns3
51 int ROUTING_PROP_ASR_LEVEL; //Where the properties are stored
53 static xbt_dict_t random_value = NULL;
56 /** @brief Retrieve a routing edge from its name
58 * Routing edges are either CPU/workstation and routers, whatever
60 RoutingEdgePtr sg_routing_edge_by_name_or_null(const char *name) {
61 RoutingEdgePtr net_elm = (RoutingEdgePtr) xbt_lib_get_or_null(host_lib, name, ROUTING_HOST_LEVEL);
63 net_elm = (RoutingEdgePtr) xbt_lib_get_or_null(as_router_lib, name, ROUTING_ASR_LEVEL);
68 RoutingPlatfPtr routing_platf = NULL;
69 AsPtr current_routing = NULL;
71 /* global parse functions */
72 extern xbt_dynar_t mount_list;
74 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route, surf, "Routing part of surf");
76 static void routing_parse_peer(sg_platf_peer_cbarg_t peer); /* peer bypass */
77 // static void routing_parse_Srandom(void); /* random bypass */
79 static void routing_parse_postparse(void);
81 /* this lines are only for replace use like index in the model table */
86 SURF_MODEL_DIJKSTRACACHE,
90 SURF_MODEL_TORUS_CLUSTER,
91 SURF_MODEL_FAT_TREE_CLUSTER,
94 struct s_model_type routing_models[] = {
96 "Full routing data (fast, large memory requirements, fully expressive)",
97 model_full_create, model_full_end},
99 "Floyd routing data (slow initialization, fast lookup, lesser memory requirements, shortest path routing only)",
100 model_floyd_create, model_floyd_end},
102 "Dijkstra routing data (fast initialization, slow lookup, small memory requirements, shortest path routing only)",
103 model_dijkstra_create, model_dijkstra_both_end},
105 "Dijkstra routing data (fast initialization, fast lookup, small memory requirements, shortest path routing only)",
106 model_dijkstracache_create, model_dijkstra_both_end},
107 {"none", "No routing (Unless you know what you are doing, avoid using this mode in combination with a non Constant network model).",
108 model_none_create, NULL},
109 {"Vivaldi", "Vivaldi routing",
110 model_vivaldi_create, NULL},
111 {"Cluster", "Cluster routing",
112 model_cluster_create, NULL},
113 {"Torus_Cluster", "Torus Cluster routing",
114 model_torus_cluster_create, NULL},
115 {"Fat_Tree_Cluster", "Fat Tree Cluster routing",
116 model_fat_tree_cluster_create, NULL},
117 {NULL, NULL, NULL, NULL}
121 * \brief Add a "host_link" to the network element list
123 static void parse_S_host_link(sg_platf_host_link_cbarg_t host)
125 RoutingEdgePtr info = static_cast<RoutingEdgePtr>(xbt_lib_get_or_null(host_lib, host->id, ROUTING_HOST_LEVEL));
126 xbt_assert(info, "Host '%s' not found!", host->id);
127 xbt_assert(current_routing->p_modelDesc == &routing_models[SURF_MODEL_CLUSTER] ||
128 current_routing->p_modelDesc == &routing_models[SURF_MODEL_VIVALDI],
129 "You have to be in model Cluster to use tag host_link!");
131 s_surf_parsing_link_up_down_t link_up_down;
132 link_up_down.link_up = xbt_lib_get_or_null(link_lib, host->link_up, SURF_LINK_LEVEL);
133 link_up_down.link_down = xbt_lib_get_or_null(link_lib, host->link_down, SURF_LINK_LEVEL);
135 xbt_assert(link_up_down.link_up, "Link '%s' not found!",host->link_up);
136 xbt_assert(link_up_down.link_down, "Link '%s' not found!",host->link_down);
138 if(!current_routing->p_linkUpDownList)
139 current_routing->p_linkUpDownList = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
141 // If dynar is is greater than edge id and if the host_link is already defined
142 if((int)xbt_dynar_length(current_routing->p_linkUpDownList) > info->getId() &&
143 xbt_dynar_get_as(current_routing->p_linkUpDownList, info->getId(), void*))
144 surf_parse_error("Host_link for '%s' is already defined!",host->id);
146 XBT_DEBUG("Push Host_link for host '%s' to position %d", info->getName(), info->getId());
147 xbt_dynar_set_as(current_routing->p_linkUpDownList, info->getId(), s_surf_parsing_link_up_down_t, link_up_down);
151 * \brief Add a "host" to the network element list
153 static void parse_S_host(sg_platf_host_cbarg_t host)
155 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
156 current_routing->p_hierarchy = SURF_ROUTING_BASE;
157 xbt_assert(!xbt_lib_get_or_null(host_lib, host->id, ROUTING_HOST_LEVEL),
158 "Reading a host, processing unit \"%s\" already exists", host->id);
160 RoutingEdgePtr info = new RoutingEdgeImpl(xbt_strdup(host->id),
162 SURF_NETWORK_ELEMENT_HOST,
164 info->setId(current_routing->parsePU(info));
165 xbt_lib_set(host_lib, host->id, ROUTING_HOST_LEVEL, (void *) info);
166 XBT_DEBUG("Having set name '%s' id '%d'", host->id, info->getId());
169 xbt_lib_set(storage_lib, host->id, ROUTING_STORAGE_HOST_LEVEL, (void *) mount_list);
173 if (host->coord && strcmp(host->coord, "")) {
177 if (!COORD_HOST_LEVEL)
178 xbt_die ("To use host coordinates, please add --cfg=network/coordinates:yes to your command line");
179 /* Pre-parse the host coordinates -- FIXME factorize with routers by overloading the routing->parse_PU function*/
180 xbt_dynar_t ctn_str = xbt_str_split_str(host->coord, " ");
181 xbt_dynar_t ctn = xbt_dynar_new(sizeof(double),NULL);
182 xbt_dynar_foreach(ctn_str,cursor, str) {
183 double val = atof(str);
184 xbt_dynar_push(ctn,&val);
186 xbt_dynar_shrink(ctn, 0);
187 xbt_dynar_free(&ctn_str);
188 xbt_lib_set(host_lib, host->id, COORD_HOST_LEVEL, (void *) ctn);
189 XBT_DEBUG("Having set host coordinates for '%s'",host->id);
194 * \brief Add a "router" to the network element list
196 static void parse_S_router(sg_platf_router_cbarg_t router)
198 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
199 current_routing->p_hierarchy = SURF_ROUTING_BASE;
200 xbt_assert(!xbt_lib_get_or_null(as_router_lib, router->id, ROUTING_ASR_LEVEL),
201 "Reading a router, processing unit \"%s\" already exists",
204 RoutingEdgePtr info = new RoutingEdgeImpl(xbt_strdup(router->id),
206 SURF_NETWORK_ELEMENT_ROUTER,
208 info->setId(current_routing->parsePU(info));
209 xbt_lib_set(as_router_lib, router->id, ROUTING_ASR_LEVEL, (void *) info);
210 XBT_DEBUG("Having set name '%s' id '%d'", router->id, info->getId());
212 if (router->coord && strcmp(router->coord, "")) {
216 if (!COORD_ASR_LEVEL)
217 xbt_die ("To use host coordinates, please add --cfg=network/coordinates:yes to your command line");
218 /* Pre-parse the host coordinates */
219 xbt_dynar_t ctn_str = xbt_str_split_str(router->coord, " ");
220 xbt_dynar_t ctn = xbt_dynar_new(sizeof(double),NULL);
221 xbt_dynar_foreach(ctn_str,cursor, str) {
222 double val = atof(str);
223 xbt_dynar_push(ctn,&val);
225 xbt_dynar_shrink(ctn, 0);
226 xbt_dynar_free(&ctn_str);
227 xbt_lib_set(as_router_lib, router->id, COORD_ASR_LEVEL, (void *) ctn);
228 XBT_DEBUG("Having set router coordinates for '%s'",router->id);
233 * \brief Store the route by calling the set_route function of the current routing component
235 static void parse_E_route(sg_platf_route_cbarg_t route)
237 /*FIXME:REMOVE:xbt_assert(current_routing->parse_route,
238 "no defined method \"set_route\" in \"%s\"",
239 current_routing->name);*/
241 current_routing->parseRoute(route);
245 * \brief Store the ASroute by calling the set_ASroute function of the current routing component
247 static void parse_E_ASroute(sg_platf_route_cbarg_t ASroute)
249 /*FIXME:REMOVE:xbt_assert(current_routing->parse_ASroute,
250 "no defined method \"set_ASroute\" in \"%s\"",
251 current_routing->name);*/
252 current_routing->parseASroute(ASroute);
256 * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
258 static void parse_E_bypassRoute(sg_platf_route_cbarg_t route)
260 /*FIXME:REMOVE:xbt_assert(current_routing->parse_bypassroute,
261 "Bypassing mechanism not implemented by routing '%s'",
262 current_routing->name);*/
264 current_routing->parseBypassroute(route);
268 * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
270 static void parse_E_bypassASroute(sg_platf_route_cbarg_t ASroute)
272 /*FIXME:REMOVE:xbt_assert(current_routing->parse_bypassroute,
273 "Bypassing mechanism not implemented by routing '%s'",
274 current_routing->name);*/
275 current_routing->parseBypassroute(ASroute);
278 static void routing_parse_trace(sg_platf_trace_cbarg_t trace)
280 tmgr_trace_t tmgr_trace;
281 if (!trace->file || strcmp(trace->file, "") != 0) {
282 tmgr_trace = tmgr_trace_new_from_file(trace->file);
283 } else if (strcmp(trace->pc_data, "") == 0) {
287 tmgr_trace_new_from_string(trace->id, trace->pc_data,
290 xbt_dict_set(traces_set_list, trace->id, (void *) tmgr_trace, NULL);
293 static void routing_parse_trace_connect(sg_platf_trace_connect_cbarg_t trace_connect)
295 xbt_assert(xbt_dict_get_or_null
296 (traces_set_list, trace_connect->trace),
297 "Cannot connect trace %s to %s: trace unknown",
298 trace_connect->trace,
299 trace_connect->element);
301 switch (trace_connect->kind) {
302 case SURF_TRACE_CONNECT_KIND_HOST_AVAIL:
303 xbt_dict_set(trace_connect_list_host_avail,
304 trace_connect->trace,
305 xbt_strdup(trace_connect->element), NULL);
307 case SURF_TRACE_CONNECT_KIND_POWER:
308 xbt_dict_set(trace_connect_list_power, trace_connect->trace,
309 xbt_strdup(trace_connect->element), NULL);
311 case SURF_TRACE_CONNECT_KIND_LINK_AVAIL:
312 xbt_dict_set(trace_connect_list_link_avail,
313 trace_connect->trace,
314 xbt_strdup(trace_connect->element), NULL);
316 case SURF_TRACE_CONNECT_KIND_BANDWIDTH:
317 xbt_dict_set(trace_connect_list_bandwidth,
318 trace_connect->trace,
319 xbt_strdup(trace_connect->element), NULL);
321 case SURF_TRACE_CONNECT_KIND_LATENCY:
322 xbt_dict_set(trace_connect_list_latency, trace_connect->trace,
323 xbt_strdup(trace_connect->element), NULL);
326 surf_parse_error("Cannot connect trace %s to %s: kind of trace unknown",
327 trace_connect->trace, trace_connect->element);
333 * \brief Make a new routing component to the platform
335 * Add a new autonomous system to the platform. Any elements (such as host,
336 * router or sub-AS) added after this call and before the corresponding call
337 * to sg_platf_new_AS_close() will be added to this AS.
339 * Once this function was called, the configuration concerning the used
340 * models cannot be changed anymore.
342 * @param AS_id name of this autonomous system. Must be unique in the platform
343 * @param wanted_routing_type one of Full, Floyd, Dijkstra or similar. Full list in the variable routing_models, in src/surf/surf_routing.c
345 void routing_AS_begin(sg_platf_AS_cbarg_t AS)
347 XBT_DEBUG("routing_AS_begin");
348 routing_model_description_t model = NULL;
350 xbt_assert(!xbt_lib_get_or_null
351 (as_router_lib, AS->id, ROUTING_ASR_LEVEL),
352 "The AS \"%s\" already exists", AS->id);
354 _sg_cfg_init_status = 2; /* horrible hack: direct access to the global
355 * controlling the level of configuration to prevent
356 * any further config */
358 /* search the routing model */
360 case A_surfxml_AS_routing_Cluster: model = &routing_models[SURF_MODEL_CLUSTER];break;
361 case A_surfxml_AS_routing_Cluster___torus: model = &routing_models[SURF_MODEL_TORUS_CLUSTER];break;
362 case A_surfxml_AS_routing_Cluster___fat___tree: model = &routing_models[SURF_MODEL_FAT_TREE_CLUSTER];break;
363 case A_surfxml_AS_routing_Dijkstra: model = &routing_models[SURF_MODEL_DIJKSTRA];break;
364 case A_surfxml_AS_routing_DijkstraCache: model = &routing_models[SURF_MODEL_DIJKSTRACACHE];break;
365 case A_surfxml_AS_routing_Floyd: model = &routing_models[SURF_MODEL_FLOYD];break;
366 case A_surfxml_AS_routing_Full: model = &routing_models[SURF_MODEL_FULL];break;
367 case A_surfxml_AS_routing_None: model = &routing_models[SURF_MODEL_NONE];break;
368 case A_surfxml_AS_routing_Vivaldi: model = &routing_models[SURF_MODEL_VIVALDI];break;
369 default: xbt_die("Not a valid model!!!");
373 /* make a new routing component */
374 AsPtr new_as = model->create();
376 new_as->p_modelDesc = model;
377 new_as->p_hierarchy = SURF_ROUTING_NULL;
378 new_as->p_name = xbt_strdup(AS->id);
380 RoutingEdgePtr info = new RoutingEdgeImpl(xbt_strdup(new_as->p_name),
382 SURF_NETWORK_ELEMENT_AS,
384 if (current_routing == NULL && routing_platf->p_root == NULL) {
386 /* it is the first one */
387 new_as->p_routingFather = NULL;
388 routing_platf->p_root = new_as;
390 } else if (current_routing != NULL && routing_platf->p_root != NULL) {
392 xbt_assert(!xbt_dict_get_or_null
393 (current_routing->p_routingSons, AS->id),
394 "The AS \"%s\" already exists", AS->id);
395 /* it is a part of the tree */
396 new_as->p_routingFather = current_routing;
397 /* set the father behavior */
398 if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
399 current_routing->p_hierarchy = SURF_ROUTING_RECURSIVE;
400 /* add to the sons dictionary */
401 xbt_dict_set(current_routing->p_routingSons, AS->id,
402 (void *) new_as, NULL);
403 /* add to the father element list */
404 info->setId(current_routing->parseAS(info));
406 THROWF(arg_error, 0, "All defined components must belong to a AS");
409 xbt_lib_set(as_router_lib, info->getName(), ROUTING_ASR_LEVEL,
411 XBT_DEBUG("Having set name '%s' id '%d'", new_as->p_name, info->getId());
413 /* set the new current component of the tree */
414 current_routing = new_as;
415 current_routing->p_netElem = info;
420 * \brief Specify that the current description of AS is finished
422 * Once you've declared all the content of your AS, you have to close
423 * it with this call. Your AS is not usable until you call this function.
425 * @fixme: this call is not as robust as wanted: bad things WILL happen
426 * if you call it twice for the same AS, or if you forget calling it, or
427 * even if you add stuff to a closed AS
430 void routing_AS_end(sg_platf_AS_cbarg_t /*AS*/)
433 if (current_routing == NULL) {
434 THROWF(arg_error, 0, "Close an AS, but none was under construction");
436 if (current_routing->p_modelDesc->end)
437 current_routing->p_modelDesc->end(current_routing);
438 current_routing = current_routing->p_routingFather;
442 /* Aux Business methods */
445 * \brief Get the AS father and the first elements of the chain
447 * \param src the source host name
448 * \param dst the destination host name
450 * Get the common father of the to processing units, and the first different
451 * father in the chain
453 static void elements_father(sg_routing_edge_t src, sg_routing_edge_t dst,
458 xbt_assert(src && dst, "bad parameters for \"elements_father\" method");
459 #define ELEMENTS_FATHER_MAXDEPTH 16 /* increase if it is not enough */
460 AsPtr src_as, dst_as;
461 AsPtr path_src[ELEMENTS_FATHER_MAXDEPTH];
462 AsPtr path_dst[ELEMENTS_FATHER_MAXDEPTH];
470 /* (1) find the as where the src and dst are located */
471 sg_routing_edge_t src_data = src;
472 sg_routing_edge_t dst_data = dst;
473 src_as = src_data->getRcComponent();
474 dst_as = dst_data->getRcComponent();
476 char* src_name = src_data->getName();
477 char* dst_name = dst_data->getName();
480 xbt_assert(src_as && dst_as,
481 "Ask for route \"from\"(%s) or \"to\"(%s) no found", src_name, dst_name);
483 /* (2) find the path to the root routing component */
484 for (current = src_as; current != NULL; current = current->p_routingFather) {
485 if (index_src >= ELEMENTS_FATHER_MAXDEPTH)
486 xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_src");
487 path_src[index_src++] = current;
489 for (current = dst_as; current != NULL; current = current->p_routingFather) {
490 if (index_dst >= ELEMENTS_FATHER_MAXDEPTH)
491 xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_dst");
492 path_dst[index_dst++] = current;
495 /* (3) find the common father */
497 current_src = path_src[--index_src];
498 current_dst = path_dst[--index_dst];
499 } while (index_src > 0 && index_dst > 0 && current_src == current_dst);
501 /* (4) they are not in the same routing component, make the path */
502 if (current_src == current_dst)
503 father = current_src;
505 father = path_src[index_src + 1];
507 /* (5) result generation */
508 *res_father = father; /* first the common father of src and dst */
509 *res_src = current_src; /* second the first different father of src */
510 *res_dst = current_dst; /* three the first different father of dst */
512 #undef ELEMENTS_FATHER_MAXDEPTH
515 /* Global Business methods */
518 * \brief Recursive function for get_route_latency
520 * \param src the source host name
521 * \param dst the destination host name
522 * \param *route the route where the links are stored. It is either NULL or a ready to use dynar
523 * \param *latency the latency, if needed
525 * This function is called by "get_route" and "get_latency". It allows to walk
526 * recursively through the ASes tree.
528 static void _get_route_and_latency(RoutingEdgePtr src, RoutingEdgePtr dst,
529 xbt_dynar_t * links, double *latency)
531 s_sg_platf_route_cbarg_t route;
532 memset(&route,0,sizeof(route));
534 xbt_assert(src && dst, "bad parameters for \"_get_route_latency\" method");
535 XBT_DEBUG("Solve route/latency \"%s\" to \"%s\"", src->getName(), dst->getName());
537 /* Find how src and dst are interconnected */
538 AsPtr common_father, src_father, dst_father;
539 elements_father(src, dst, &common_father, &src_father, &dst_father);
540 XBT_DEBUG("elements_father: common father '%s' src_father '%s' dst_father '%s'",
541 common_father->p_name, src_father->p_name, dst_father->p_name);
543 /* Check whether a direct bypass is defined */
544 sg_platf_route_cbarg_t e_route_bypass = NULL;
545 //FIXME:REMOVE:if (common_father->get_bypass_route)
547 e_route_bypass = common_father->getBypassRoute(src, dst, latency);
549 /* Common ancestor is kind enough to declare a bypass route from src to dst -- use it and bail out */
550 if (e_route_bypass) {
551 xbt_dynar_merge(links, &e_route_bypass->link_list);
552 generic_free_route(e_route_bypass);
556 /* If src and dst are in the same AS, life is good */
557 if (src_father == dst_father) { /* SURF_ROUTING_BASE */
558 route.link_list = *links;
559 common_father->getRouteAndLatency(src, dst, &route, latency);
560 // if vivaldi latency+=vivaldi(src,dst)
564 /* Not in the same AS, no bypass. We'll have to find our path between the ASes recursively*/
566 route.link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
567 // Find the net_card corresponding to father
568 RoutingEdgePtr src_father_net_elm = src_father->p_netElem;
569 RoutingEdgePtr dst_father_net_elm = dst_father->p_netElem;
571 common_father->getRouteAndLatency(src_father_net_elm, dst_father_net_elm,
574 xbt_assert((route.gw_src != NULL) && (route.gw_dst != NULL),
575 "bad gateways for route from \"%s\" to \"%s\"", src->getName(), dst->getName());
577 sg_routing_edge_t src_gateway_net_elm = route.gw_src;
578 sg_routing_edge_t dst_gateway_net_elm = route.gw_dst;
580 /* If source gateway is not our source, we have to recursively find our way up to this point */
581 if (src != src_gateway_net_elm)
582 _get_route_and_latency(src, src_gateway_net_elm, links, latency);
583 xbt_dynar_merge(links, &route.link_list);
585 /* If dest gateway is not our destination, we have to recursively find our way from this point */
586 if (dst_gateway_net_elm != dst)
587 _get_route_and_latency(dst_gateway_net_elm, dst, links, latency);
589 // if vivaldi latency+=vivaldi(src_gateway,dst_gateway)
592 AS_t surf_platf_get_root(routing_platf_t platf){
593 return platf->p_root;
596 e_surf_network_element_type_t surf_routing_edge_get_rc_type(sg_routing_edge_t edge){
597 return edge->getRcType();
602 * \brief Find a route between hosts
604 * \param src the network_element_t for src host
605 * \param dst the network_element_t for dst host
606 * \param route where to store the list of links.
607 * If *route=NULL, create a short lived dynar. Else, fill the provided dynar
608 * \param latency where to store the latency experienced on the path (or NULL if not interested)
609 * It is the caller responsability to initialize latency to 0 (we add to provided route)
612 * walk through the routing components tree and find a route between hosts
613 * by calling the differents "get_route" functions in each routing component.
615 void RoutingPlatf::getRouteAndLatency(RoutingEdgePtr src, RoutingEdgePtr dst,
616 xbt_dynar_t* route, double *latency)
618 XBT_DEBUG("routing_get_route_and_latency from %s to %s", src->getName(), dst->getName());
620 xbt_dynar_reset(routing_platf->p_lastRoute);
621 *route = routing_platf->p_lastRoute;
624 _get_route_and_latency(src, dst, route, latency);
626 xbt_assert(!latency || *latency >= 0.0,
627 "negative latency on route between \"%s\" and \"%s\"", src->getName(), dst->getName());
630 xbt_dynar_t RoutingPlatf::getOneLinkRoutes(){
631 return recursiveGetOneLinkRoutes(p_root);
634 xbt_dynar_t RoutingPlatf::recursiveGetOneLinkRoutes(AsPtr rc)
636 xbt_dynar_t ret = xbt_dynar_new(sizeof(OnelinkPtr), xbt_free_f);
638 //adding my one link routes
639 xbt_dynar_t onelink_mine = rc->getOneLinkRoutes();
641 xbt_dynar_merge(&ret,&onelink_mine);
645 xbt_dict_cursor_t cursor = NULL;
647 xbt_dict_foreach(rc->p_routingSons, cursor, key, rc_child) {
648 xbt_dynar_t onelink_child = recursiveGetOneLinkRoutes(rc_child);
650 xbt_dynar_merge(&ret,&onelink_child);
655 e_surf_network_element_type_t routing_get_network_element_type(const char *name)
657 RoutingEdgePtr rc = sg_routing_edge_by_name_or_null(name);
659 return rc->getRcType();
661 return SURF_NETWORK_ELEMENT_NULL;
665 * \brief Generic method: create the global routing schema
667 * Make a global routing structure and set all the parsing functions.
669 void routing_model_create( void *loopback)
671 /* config the uniq global routing */
672 routing_platf = new RoutingPlatf();
673 routing_platf->p_root = NULL;
674 routing_platf->p_loopback = loopback;
675 routing_platf->p_lastRoute = xbt_dynar_new(sizeof(sg_routing_link_t),NULL);
676 /* no current routing at moment */
677 current_routing = NULL;
681 /* ************************************************** */
682 /* ********** PATERN FOR NEW ROUTING **************** */
684 /* The minimal configuration of a new routing model need the next functions,
685 * also you need to set at the start of the file, the new model in the model
686 * list. Remember keep the null ending of the list.
688 /*** Routing model structure ***/
690 // s_routing_component_t generic_routing;
691 // /* things that your routing model need */
692 // } s_routing_component_NEW_t,*routing_component_NEW_t;
694 /*** Parse routing model functions ***/
695 // static void model_NEW_set_processing_unit(routing_component_t rc, const char* name) {}
696 // static void model_NEW_set_autonomous_system(routing_component_t rc, const char* name) {}
697 // static void model_NEW_set_route(routing_component_t rc, const char* src, const char* dst, route_t route) {}
698 // static void model_NEW_set_ASroute(routing_component_t rc, const char* src, const char* dst, route_extended_t route) {}
699 // static void model_NEW_set_bypassroute(routing_component_t rc, const char* src, const char* dst, route_extended_t e_route) {}
701 /*** Business methods ***/
702 // static route_extended_t NEW_get_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
703 // static route_extended_t NEW_get_bypass_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
704 // static void NEW_finalize(routing_component_t rc) { xbt_free(rc);}
706 /*** Creation routing model functions ***/
707 // static void* model_NEW_create(void) {
708 // routing_component_NEW_t new_component = xbt_new0(s_routing_component_NEW_t,1);
709 // new_component->generic_routing.set_processing_unit = model_NEW_set_processing_unit;
710 // new_component->generic_routing.set_autonomous_system = model_NEW_set_autonomous_system;
711 // new_component->generic_routing.set_route = model_NEW_set_route;
712 // new_component->generic_routing.set_ASroute = model_NEW_set_ASroute;
713 // new_component->generic_routing.set_bypassroute = model_NEW_set_bypassroute;
714 // new_component->generic_routing.get_route = NEW_get_route;
715 // new_component->generic_routing.get_bypass_route = NEW_get_bypass_route;
716 // new_component->generic_routing.finalize = NEW_finalize;
717 // /* initialization of internal structures */
718 // return new_component;
720 // static void model_NEW_load(void) {} /* mandatory */
721 // static void model_NEW_unload(void) {} /* mandatory */
722 // static void model_NEW_end(void) {} /* mandatory */
724 /* ************************************************************************** */
725 /* ************************* GENERIC PARSE FUNCTIONS ************************ */
727 void routing_cluster_add_backbone(void* bb) {
728 xbt_assert(current_routing->p_modelDesc == &routing_models[SURF_MODEL_CLUSTER],
729 "You have to be in model Cluster to use tag backbone!");
730 xbt_assert(!surf_as_cluster_get_backbone(current_routing), "The backbone link is already defined!");
731 surf_as_cluster_set_backbone(current_routing, bb);
732 XBT_DEBUG("Add a backbone to AS '%s'", current_routing->p_name);
735 static void routing_parse_cabinet(sg_platf_cabinet_cbarg_t cabinet)
738 char *groups , *host_id , *link_id = NULL;
740 xbt_dynar_t radical_elements;
741 xbt_dynar_t radical_ends;
744 radical_elements = xbt_str_split(cabinet->radical, ",");
745 xbt_dynar_foreach(radical_elements, iter, groups) {
747 radical_ends = xbt_str_split(groups, "-");
748 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
750 switch (xbt_dynar_length(radical_ends)) {
755 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
758 surf_parse_error("Malformed radical");
761 s_sg_platf_host_cbarg_t host;
762 memset(&host, 0, sizeof(host));
763 host.initial_state = SURF_RESOURCE_ON;
765 host.power_scale = 1.0;
766 host.core_amount = 1;
768 s_sg_platf_link_cbarg_t link;
769 memset(&link, 0, sizeof(link));
770 link.state = SURF_RESOURCE_ON;
771 link.policy = SURF_LINK_FULLDUPLEX;
772 link.latency = cabinet->lat;
773 link.bandwidth = cabinet->bw;
775 s_sg_platf_host_link_cbarg_t host_link;
776 memset(&host_link, 0, sizeof(host_link));
778 for (i = start; i <= end; i++) {
779 host_id = bprintf("%s%d%s",cabinet->prefix,i,cabinet->suffix);
780 link_id = bprintf("link_%s%d%s",cabinet->prefix,i,cabinet->suffix);
783 xbt_dynar_t power_state_list = xbt_dynar_new(sizeof(double), NULL);
784 xbt_dynar_push(power_state_list,&cabinet->power);
785 host.power_peak = power_state_list;
786 sg_platf_new_host(&host);
787 sg_platf_new_link(&link);
789 char* link_up = bprintf("%s_UP",link_id);
790 char* link_down = bprintf("%s_DOWN",link_id);
791 host_link.id = host_id;
792 host_link.link_up = link_up;
793 host_link.link_down= link_down;
794 sg_platf_new_host_link(&host_link);
802 xbt_dynar_free(&radical_ends);
804 xbt_dynar_free(&radical_elements);
807 static void routing_parse_cluster(sg_platf_cluster_cbarg_t cluster)
809 char *host_id, *groups, *link_id = NULL;
810 xbt_dict_t patterns = NULL;
813 s_sg_platf_host_cbarg_t host;
814 s_sg_platf_link_cbarg_t link;
818 xbt_dynar_t radical_elements;
819 xbt_dynar_t radical_ends;
821 if ((cluster->availability_trace && strcmp(cluster->availability_trace, ""))
822 || (cluster->state_trace && strcmp(cluster->state_trace, ""))) {
823 patterns = xbt_dict_new_homogeneous(xbt_free_f);
824 xbt_dict_set(patterns, "id", xbt_strdup(cluster->id), NULL);
825 xbt_dict_set(patterns, "prefix", xbt_strdup(cluster->prefix), NULL);
826 xbt_dict_set(patterns, "suffix", xbt_strdup(cluster->suffix), NULL);
829 /* parse the topology attribute. If we are not in a flat cluster,
830 * switch to the right mode and initialize the routing with
831 * the parameters in topo_parameters attribute
833 s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
836 if(cluster->topology == SURF_CLUSTER_TORUS){
837 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Torus_Cluster\">", cluster->id);
838 AS.routing = A_surfxml_AS_routing_Cluster___torus;
839 sg_platf_new_AS_begin(&AS);
840 ((AsClusterTorusPtr)current_routing)->parse_specific_arguments(cluster);
842 else if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
843 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Fat_Tree_Cluster\">", cluster->id);
844 AS.routing = A_surfxml_AS_routing_Cluster___fat___tree;
845 sg_platf_new_AS_begin(&AS);
846 ((AsClusterFatTree*)current_routing)->parse_specific_arguments(cluster);
850 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", cluster->id);
851 AS.routing = A_surfxml_AS_routing_Cluster;
852 sg_platf_new_AS_begin(&AS);
855 if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
856 ((AsClusterPtr)current_routing)->p_nb_links_per_node++;
857 ((AsClusterPtr)current_routing)->p_has_loopback=1;
860 if(cluster->limiter_link!=0){
861 ((AsClusterPtr)current_routing)->p_nb_links_per_node++;
862 ((AsClusterPtr)current_routing)->p_has_limiter=1;
867 current_routing->p_linkUpDownList
868 = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
871 radical_elements = xbt_str_split(cluster->radical, ",");
872 xbt_dynar_foreach(radical_elements, iter, groups) {
874 radical_ends = xbt_str_split(groups, "-");
875 start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
877 switch (xbt_dynar_length(radical_ends)) {
882 end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
885 surf_parse_error("Malformed radical");
888 for (i = start; i <= end; i++) {
890 bprintf("%s%d%s", cluster->prefix, i, cluster->suffix);
891 link_id = bprintf("%s_link_%d", cluster->id, i);
893 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\">", host_id, cluster->power);
895 memset(&host, 0, sizeof(host));
897 if (cluster->availability_trace && strcmp(cluster->availability_trace, "")) {
898 xbt_dict_set(patterns, "radical", bprintf("%d", i), NULL);
899 char *avail_file = xbt_str_varsubst(cluster->availability_trace, patterns);
900 XBT_DEBUG("\tavailability_file=\"%s\"", avail_file);
901 host.power_trace = tmgr_trace_new_from_file(avail_file);
902 xbt_free(avail_file);
904 XBT_DEBUG("\tavailability_file=\"\"");
907 if (cluster->state_trace && strcmp(cluster->state_trace, "")) {
908 char *avail_file = xbt_str_varsubst(cluster->state_trace, patterns);
909 XBT_DEBUG("\tstate_file=\"%s\"", avail_file);
910 host.state_trace = tmgr_trace_new_from_file(avail_file);
911 xbt_free(avail_file);
913 XBT_DEBUG("\tstate_file=\"\"");
916 xbt_dynar_t power_state_list = xbt_dynar_new(sizeof(double), NULL);
917 xbt_dynar_push(power_state_list,&cluster->power);
918 host.power_peak = power_state_list;
921 //host.power_peak = cluster->power;
922 host.power_scale = 1.0;
923 host.core_amount = cluster->core_amount;
924 host.initial_state = SURF_RESOURCE_ON;
926 sg_platf_new_host(&host);
927 XBT_DEBUG("</host>");
929 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_id,
930 cluster->bw, cluster->lat);
933 s_surf_parsing_link_up_down_t info_lim, info_loop;
934 // All links are saved in a matrix;
935 // every row describes a single node; every node
936 // may have multiple links.
937 // the first column may store a link from x to x if p_has_loopback is set
938 // the second column may store a limiter link if p_has_limiter is set
939 // other columns are to store one or more link for the node
941 //add a loopback link
942 if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
943 char *tmp_link = bprintf("%s_loopback", link_id);
944 XBT_DEBUG("<loopback\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
945 cluster->limiter_link);
948 memset(&link, 0, sizeof(link));
950 link.bandwidth = cluster->loopback_bw;
951 link.latency = cluster->loopback_lat;
952 link.state = SURF_RESOURCE_ON;
953 link.policy = SURF_LINK_FATPIPE;
954 sg_platf_new_link(&link);
956 xbt_lib_get_or_null(link_lib, tmp_link, SURF_LINK_LEVEL);
957 info_loop.link_down = info_loop.link_up;
959 xbt_dynar_set(current_routing->p_linkUpDownList, rankId*((AsClusterPtr)current_routing)->p_nb_links_per_node, &info_loop);
962 //add a limiter link (shared link to account for maximal bandwidth of the node)
963 if(cluster->limiter_link!=0){
964 char *tmp_link = bprintf("%s_limiter", link_id);
965 XBT_DEBUG("<limiter\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
966 cluster->limiter_link);
969 memset(&link, 0, sizeof(link));
971 link.bandwidth = cluster->limiter_link;
973 link.state = SURF_RESOURCE_ON;
974 link.policy = SURF_LINK_SHARED;
975 sg_platf_new_link(&link);
977 xbt_lib_get_or_null(link_lib, tmp_link, SURF_LINK_LEVEL);
978 info_lim.link_down = info_lim.link_up;
980 xbt_dynar_set(current_routing->p_linkUpDownList,
981 rankId*((AsClusterPtr)current_routing)->p_nb_links_per_node + ((AsClusterPtr)current_routing)->p_has_loopback ,
987 //call the cluster function that adds the others links
988 if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
989 ((AsClusterFatTree*) current_routing)->addProcessingNode(i);
992 ((AsClusterPtr)current_routing)->create_links_for_node(cluster, i, rankId, rankId*
993 ((AsClusterPtr)current_routing)->p_nb_links_per_node
994 + ((AsClusterPtr)current_routing)->p_has_loopback
995 + ((AsClusterPtr)current_routing)->p_has_limiter );
1002 xbt_dynar_free(&radical_ends);
1004 xbt_dynar_free(&radical_elements);
1006 // For fat trees, the links must be created once all nodes have been added
1007 if(cluster->topology == SURF_CLUSTER_FAT_TREE) {
1008 ((AsClusterFatTree*)current_routing)->create_links();
1010 // Add a router. It is magically used thanks to the way in which surf_routing_cluster is written,
1011 // and it's very useful to connect clusters together
1013 XBT_DEBUG("<router id=\"%s\"/>", cluster->router_id);
1015 s_sg_platf_router_cbarg_t router;
1016 memset(&router, 0, sizeof(router));
1017 router.id = cluster->router_id;
1019 if (!router.id || !strcmp(router.id, ""))
1021 bprintf("%s%s_router%s", cluster->prefix, cluster->id,
1023 sg_platf_new_router(&router);
1024 ((AsClusterPtr)current_routing)->p_router = (RoutingEdgePtr) xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL);
1028 if ((cluster->bb_bw != 0) || (cluster->bb_lat != 0)) {
1029 char *link_backbone = bprintf("%s_backbone", cluster->id);
1030 XBT_DEBUG("<link\tid=\"%s\" bw=\"%f\" lat=\"%f\"/>", link_backbone,
1031 cluster->bb_bw, cluster->bb_lat);
1033 memset(&link, 0, sizeof(link));
1034 link.id = link_backbone;
1035 link.bandwidth = cluster->bb_bw;
1036 link.latency = cluster->bb_lat;
1037 link.state = SURF_RESOURCE_ON;
1038 link.policy = cluster->bb_sharing_policy;
1040 sg_platf_new_link(&link);
1042 routing_cluster_add_backbone(xbt_lib_get_or_null(link_lib, link_backbone, SURF_LINK_LEVEL));
1044 free(link_backbone);
1048 sg_platf_new_AS_end();
1050 xbt_dict_free(&patterns); // no op if it were never set
1053 static void routing_parse_postparse(void) {
1054 xbt_dict_free(&random_value);
1057 static void routing_parse_peer(sg_platf_peer_cbarg_t peer)
1059 char *host_id = NULL;
1060 char *link_id = NULL;
1061 char *router_id = NULL;
1064 host_id = HOST_PEER(peer->id);
1065 link_id = LINK_PEER(peer->id);
1066 router_id = ROUTER_PEER(peer->id);
1068 XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", peer->id);
1069 s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
1071 AS.routing = A_surfxml_AS_routing_Cluster;
1072 sg_platf_new_AS_begin(&AS);
1074 current_routing->p_linkUpDownList = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
1076 XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\"/>", host_id, peer->power);
1077 s_sg_platf_host_cbarg_t host;
1078 memset(&host, 0, sizeof(host));
1079 host.initial_state = SURF_RESOURCE_ON;
1082 xbt_dynar_t power_state_list = xbt_dynar_new(sizeof(double), NULL);
1083 xbt_dynar_push(power_state_list,&peer->power);
1084 host.power_peak = power_state_list;
1086 //host.power_peak = peer->power;
1087 host.power_scale = 1.0;
1088 host.power_trace = peer->availability_trace;
1089 host.state_trace = peer->state_trace;
1090 host.core_amount = 1;
1091 sg_platf_new_host(&host);
1093 s_sg_platf_link_cbarg_t link;
1094 memset(&link, 0, sizeof(link));
1095 link.state = SURF_RESOURCE_ON;
1096 link.policy = SURF_LINK_SHARED;
1097 link.latency = peer->lat;
1099 char* link_up = bprintf("%s_UP",link_id);
1100 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_up,
1101 peer->bw_out, peer->lat);
1103 link.bandwidth = peer->bw_out;
1104 sg_platf_new_link(&link);
1106 char* link_down = bprintf("%s_DOWN",link_id);
1107 XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_down,
1108 peer->bw_in, peer->lat);
1109 link.id = link_down;
1110 link.bandwidth = peer->bw_in;
1111 sg_platf_new_link(&link);
1113 XBT_DEBUG("<host_link\tid=\"%s\"\tup=\"%s\"\tdown=\"%s\" />", host_id,link_up,link_down);
1114 s_sg_platf_host_link_cbarg_t host_link;
1115 memset(&host_link, 0, sizeof(host_link));
1116 host_link.id = host_id;
1117 host_link.link_up = link_up;
1118 host_link.link_down= link_down;
1119 sg_platf_new_host_link(&host_link);
1121 XBT_DEBUG("<router id=\"%s\"/>", router_id);
1122 s_sg_platf_router_cbarg_t router;
1123 memset(&router, 0, sizeof(router));
1124 router.id = router_id;
1125 router.coord = peer->coord;
1126 sg_platf_new_router(&router);
1127 static_cast<AsClusterPtr>(current_routing)->p_router = static_cast<RoutingEdgePtr>(xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL));
1130 sg_platf_new_AS_end();
1133 //xbt_dynar_free(&tab_elements_num);
1141 // static void routing_parse_Srandom(void)
1143 // double mean, std, min, max, seed;
1144 // char *random_id = A_surfxml_random_id;
1145 // char *random_radical = A_surfxml_random_radical;
1146 // char *rd_name = NULL;
1148 // mean = surf_parse_get_double(A_surfxml_random_mean);
1149 // std = surf_parse_get_double(A_surfxml_random_std___deviation);
1150 // min = surf_parse_get_double(A_surfxml_random_min);
1151 // max = surf_parse_get_double(A_surfxml_random_max);
1152 // seed = surf_parse_get_double(A_surfxml_random_seed);
1156 // random_data_t random = xbt_new0(s_random_data_t, 1);
1159 // xbt_dynar_t radical_elements;
1160 // unsigned int iter;
1163 // xbt_dynar_t radical_ends;
1165 // switch (A_surfxml_random_generator) {
1166 // case AU_surfxml_random_generator:
1167 // case A_surfxml_random_generator_NONE:
1168 // random->generator = NONE;
1170 // case A_surfxml_random_generator_DRAND48:
1171 // random->generator = DRAND48;
1173 // case A_surfxml_random_generator_RAND:
1174 // random->generator = RAND;
1176 // case A_surfxml_random_generator_RNGSTREAM:
1177 // random->generator = RNGSTREAM;
1180 // surf_parse_error("Invalid random generator");
1183 // random->seed = seed;
1184 // random->min = min;
1185 // random->max = max;
1187 // /* Check user stupidities */
1189 // THROWF(arg_error, 0, "random->max < random->min (%f < %f)", max, min);
1191 // THROWF(arg_error, 0, "random->mean < random->min (%f < %f)", mean, min);
1193 // THROWF(arg_error, 0, "random->mean > random->max (%f > %f)", mean, max);
1195 // /* normalize the mean and standard deviation before storing */
1196 // random->mean = (mean - min) / (max - min);
1197 // random->std = std / (max - min);
1199 // if (random->mean * (1 - random->mean) < random->std * random->std)
1200 // THROWF(arg_error, 0, "Invalid mean and standard deviation (%f and %f)",
1201 // random->mean, random->std);
1204 // ("id = '%s' min = '%f' max = '%f' mean = '%f' std_deviatinon = '%f' generator = '%d' seed = '%ld' radical = '%s'",
1205 // random_id, random->min, random->max, random->mean, random->std,
1206 // (int)random->generator, random->seed, random_radical);
1208 // if (!random_value)
1209 // random_value = xbt_dict_new_homogeneous(free);
1211 // if (!strcmp(random_radical, "")) {
1212 // res = random_generate(random);
1213 // rd_value = bprintf("%f", res);
1214 // xbt_dict_set(random_value, random_id, rd_value, NULL);
1216 // radical_elements = xbt_str_split(random_radical, ",");
1217 // xbt_dynar_foreach(radical_elements, iter, groups) {
1218 // radical_ends = xbt_str_split(groups, "-");
1219 // switch (xbt_dynar_length(radical_ends)) {
1221 // xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1222 // "Custom Random '%s' already exists !", random_id);
1223 // res = random_generate(random);
1225 // bprintf("%s%d", random_id,
1226 // atoi(xbt_dynar_getfirst_as(radical_ends, char *)));
1227 // xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1228 // xbt_free(tmpbuf);
1232 // start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
1233 // end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
1234 // for (i = start; i <= end; i++) {
1235 // xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1236 // "Custom Random '%s' already exists !", bprintf("%s%d",
1239 // res = random_generate(random);
1240 // tmpbuf = bprintf("%s%d", random_id, i);
1241 // xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1242 // xbt_free(tmpbuf);
1246 // XBT_CRITICAL("Malformed radical");
1249 // res = random_generate(random);
1250 // rd_name = bprintf("%s_router", random_id);
1251 // rd_value = bprintf("%f", res);
1252 // xbt_dict_set(random_value, rd_name, rd_value, NULL);
1254 // xbt_dynar_free(&radical_ends);
1257 // xbt_dynar_free(&radical_elements);
1261 static void check_disk_attachment()
1263 xbt_lib_cursor_t cursor;
1266 RoutingEdgePtr host_elm;
1267 xbt_lib_foreach(storage_lib, cursor, key, data) {
1268 if(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL) != NULL) {
1269 StoragePtr storage = static_cast<StoragePtr>(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL));
1270 host_elm = sg_routing_edge_by_name_or_null(storage->p_attach);
1272 surf_parse_error("Unable to attach storage %s: host %s doesn't exist.", storage->getName(), storage->p_attach);
1277 void routing_register_callbacks()
1279 sg_platf_host_add_cb(parse_S_host);
1280 sg_platf_router_add_cb(parse_S_router);
1281 sg_platf_host_link_add_cb(parse_S_host_link);
1282 sg_platf_route_add_cb(parse_E_route);
1283 sg_platf_ASroute_add_cb(parse_E_ASroute);
1284 sg_platf_bypassRoute_add_cb(parse_E_bypassRoute);
1285 sg_platf_bypassASroute_add_cb(parse_E_bypassASroute);
1287 sg_platf_cluster_add_cb(routing_parse_cluster);
1288 sg_platf_cabinet_add_cb(routing_parse_cabinet);
1290 sg_platf_peer_add_cb(routing_parse_peer);
1291 sg_platf_postparse_add_cb(routing_parse_postparse);
1292 sg_platf_postparse_add_cb(check_disk_attachment);
1294 /* we care about the ASes while parsing the platf. Incredible, isnt it? */
1295 sg_platf_AS_end_add_cb(routing_AS_end);
1296 sg_platf_AS_begin_add_cb(routing_AS_begin);
1298 sg_platf_trace_add_cb(routing_parse_trace);
1299 sg_platf_trace_connect_add_cb(routing_parse_trace_connect);
1302 instr_routing_define_callbacks();
1307 * \brief Recursive function for finalize
1309 * \param rc the source host name
1311 * This fuction is call by "finalize". It allow to finalize the
1312 * AS or routing components. It delete all the structures.
1314 static void finalize_rec(AsPtr as) {
1315 xbt_dict_cursor_t cursor = NULL;
1319 xbt_dict_foreach(as->p_routingSons, cursor, key, elem) {
1326 /** \brief Frees all memory allocated by the routing module */
1327 void routing_exit(void) {
1328 delete routing_platf;
1331 RoutingPlatf::~RoutingPlatf()
1333 xbt_dynar_free(&p_lastRoute);
1334 finalize_rec(p_root);
1337 AS_t surf_AS_get_routing_root() {
1338 return routing_platf->p_root;
1341 const char *surf_AS_get_name(AsPtr as) {
1345 static AsPtr surf_AS_recursive_get_by_name(AsPtr current, const char * name) {
1346 xbt_dict_cursor_t cursor = NULL;
1351 if(!strcmp(current->p_name, name))
1354 xbt_dict_foreach(current->p_routingSons, cursor, key, elem) {
1355 tmp = surf_AS_recursive_get_by_name(elem, name);
1364 AsPtr surf_AS_get_by_name(const char * name) {
1365 AsPtr as = surf_AS_recursive_get_by_name(routing_platf->p_root, name);
1367 XBT_WARN("Impossible to find an AS with name %s, please check your input", name);
1371 xbt_dict_t surf_AS_get_routing_sons(AsPtr as) {
1372 return as->p_routingSons;
1375 const char *surf_AS_get_model(AsPtr as) {
1376 return as->p_modelDesc->name;
1379 xbt_dynar_t surf_AS_get_hosts(AsPtr as) {
1380 xbt_dynar_t elms = as->p_indexNetworkElm;
1381 sg_routing_edge_t relm;
1384 int count = xbt_dynar_length(elms);
1385 xbt_dynar_t res = xbt_dynar_new(sizeof(xbt_dictelm_t), NULL);
1386 for (index = 0; index < count; index++) {
1387 relm = xbt_dynar_get_as(elms, index, RoutingEdgePtr);
1388 delm = xbt_lib_get_elm_or_null(host_lib, relm->getName());
1390 xbt_dynar_push(res, &delm);
1396 void surf_AS_get_graph(AS_t as, xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges) {
1397 as->getGraph(graph, nodes, edges);