Logo AND Algorithmique Numérique Distribuée

Public GIT Repository
Rename power->speed in the inner layer of the parsing
[simgrid.git] / src / surf / surf_routing.cpp
1 /* Copyright (c) 2009-2011, 2013-2015. The SimGrid Team.
2  * All rights reserved.                                                     */
3
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. */
6
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"
12
13 #include "simgrid/platf_interface.h"    // platform creation API internal interface
14 #include "simgrid/sg_config.h"
15 #include "storage_interface.hpp"
16
17 #include "surf/surfxml_parse_values.h"
18
19 /*************
20  * Callbacks *
21  *************/
22
23 surf_callback(void, RoutingEdge*) routingEdgeCreatedCallbacks;
24 surf_callback(void, As*) asCreatedCallbacks;
25
26 /**
27  * @ingroup SURF_build_api
28  * @brief A library containing all known hosts
29  */
30 xbt_lib_t host_lib;
31
32 int SURF_HOST_LEVEL;            //Surf host level
33 int COORD_HOST_LEVEL=0;         //Coordinates level
34 int NS3_HOST_LEVEL;             //host node for ns3
35
36 int MSG_FILE_LEVEL;             //Msg file level
37
38 int SIMIX_STORAGE_LEVEL;        //Simix storage level
39 int MSG_STORAGE_LEVEL;          //Msg storage level
40 int SD_STORAGE_LEVEL;           //Simdag storage level
41
42 xbt_lib_t as_router_lib;
43 int ROUTING_ASR_LEVEL;          //Routing level
44 int COORD_ASR_LEVEL;            //Coordinates level
45 int NS3_ASR_LEVEL;              //host node for ns3
46 int ROUTING_PROP_ASR_LEVEL;     //Where the properties are stored
47
48 static xbt_dict_t random_value = NULL;
49
50
51 /** @brief Retrieve a routing edge from its name
52  *
53  * Routing edges are either host and routers, whatever
54  */
55 RoutingEdge *sg_routing_edge_by_name_or_null(const char *name) {
56   sg_host_t h = sg_host_by_name(name);
57   RoutingEdge *net_elm = h==NULL?NULL: sg_host_edge(h);
58   if (!net_elm)
59         net_elm = (RoutingEdge*) xbt_lib_get_or_null(as_router_lib, name, ROUTING_ASR_LEVEL);
60   return net_elm;
61 }
62
63 /* Global vars */
64 RoutingPlatf *routing_platf = NULL;
65
66 /* global parse functions */
67 extern xbt_dynar_t mount_list;
68
69 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route, surf, "Routing part of surf");
70
71 /** The current AS in the parsing */
72 static As *current_routing = NULL;
73 As* routing_get_current()
74 {
75   return current_routing;
76 }
77
78 // static void routing_parse_Srandom(void);        /* random bypass */
79
80 static void routing_parse_postparse(void);
81
82 /* this lines are only for replace use like index in the model table */
83 typedef enum {
84   SURF_MODEL_FULL = 0,
85   SURF_MODEL_FLOYD,
86   SURF_MODEL_DIJKSTRA,
87   SURF_MODEL_DIJKSTRACACHE,
88   SURF_MODEL_NONE,
89   SURF_MODEL_VIVALDI,
90   SURF_MODEL_CLUSTER,
91   SURF_MODEL_TORUS_CLUSTER,
92   SURF_MODEL_FAT_TREE_CLUSTER,
93 } e_routing_types;
94
95 struct s_model_type routing_models[] = {
96   {"Full",
97    "Full routing data (fast, large memory requirements, fully expressive)",
98    model_full_create, model_full_end},
99   {"Floyd",
100    "Floyd routing data (slow initialization, fast lookup, lesser memory requirements, shortest path routing only)",
101    model_floyd_create, model_floyd_end},
102   {"Dijkstra",
103    "Dijkstra routing data (fast initialization, slow lookup, small memory requirements, shortest path routing only)",
104    model_dijkstra_create, model_dijkstra_both_end},
105   {"DijkstraCache",
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}
119 };
120
121 /**
122  * \brief Add a "host_link" to the network element list
123  */
124 void sg_platf_new_host_link(sg_platf_host_link_cbarg_t host)
125 {
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!");
131
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);
135
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);
138
139   if(!current_routing->p_linkUpDownList)
140     current_routing->p_linkUpDownList = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
141
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);
146
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);
149 }
150
151 /**
152  * \brief Add a "host" to the network element list
153  */
154 RoutingEdge *routing_add_host(As* current_routing, sg_platf_host_cbarg_t host)
155 {
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);
160
161   RoutingEdge *routingEdge = new RoutingEdgeImpl(xbt_strdup(host->id),
162                                                     -1,
163                                                     SURF_NETWORK_ELEMENT_HOST,
164                                                     current_routing);
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);
169
170   if(mount_list){
171     xbt_lib_set(storage_lib, host->id, ROUTING_STORAGE_HOST_LEVEL, (void *) mount_list);
172     mount_list = NULL;
173   }
174
175   if (host->coord && strcmp(host->coord, "")) {
176     unsigned int cursor;
177     char*str;
178
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);
187     }
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);
192   }
193
194   return routingEdge;
195 }
196
197 /**
198  * \brief Store the ASroute by calling the set_ASroute function of the current routing component
199  */
200 static void parse_E_ASroute(sg_platf_route_cbarg_t ASroute)
201 {
202   /*FIXME:REMOVE:xbt_assert(current_routing->parse_ASroute,
203              "no defined method \"set_ASroute\" in \"%s\"",
204              current_routing->name);*/
205   current_routing->parseASroute(ASroute);
206 }
207
208 void sg_platf_new_trace(sg_platf_trace_cbarg_t trace)
209 {
210   tmgr_trace_t tmgr_trace;
211   if (!trace->file || strcmp(trace->file, "") != 0) {
212     tmgr_trace = tmgr_trace_new_from_file(trace->file);
213   } else if (strcmp(trace->pc_data, "") == 0) {
214     tmgr_trace = NULL;
215   } else {
216     tmgr_trace =
217           tmgr_trace_new_from_string(trace->id, trace->pc_data,
218                                      trace->periodicity);
219   }
220   xbt_dict_set(traces_set_list, trace->id, (void *) tmgr_trace, NULL);
221 }
222
223 void sg_platf_trace_connect(sg_platf_trace_connect_cbarg_t trace_connect)
224 {
225   xbt_assert(xbt_dict_get_or_null
226               (traces_set_list, trace_connect->trace),
227               "Cannot connect trace %s to %s: trace unknown",
228               trace_connect->trace,
229               trace_connect->element);
230
231   switch (trace_connect->kind) {
232   case SURF_TRACE_CONNECT_KIND_HOST_AVAIL:
233     xbt_dict_set(trace_connect_list_host_avail,
234         trace_connect->trace,
235         xbt_strdup(trace_connect->element), NULL);
236     break;
237   case SURF_TRACE_CONNECT_KIND_POWER:
238     xbt_dict_set(trace_connect_list_power, trace_connect->trace,
239         xbt_strdup(trace_connect->element), NULL);
240     break;
241   case SURF_TRACE_CONNECT_KIND_LINK_AVAIL:
242     xbt_dict_set(trace_connect_list_link_avail,
243         trace_connect->trace,
244         xbt_strdup(trace_connect->element), NULL);
245     break;
246   case SURF_TRACE_CONNECT_KIND_BANDWIDTH:
247     xbt_dict_set(trace_connect_list_bandwidth,
248         trace_connect->trace,
249         xbt_strdup(trace_connect->element), NULL);
250     break;
251   case SURF_TRACE_CONNECT_KIND_LATENCY:
252     xbt_dict_set(trace_connect_list_latency, trace_connect->trace,
253         xbt_strdup(trace_connect->element), NULL);
254     break;
255   default:
256         surf_parse_error("Cannot connect trace %s to %s: kind of trace unknown",
257         trace_connect->trace, trace_connect->element);
258     break;
259   }
260 }
261
262 /**
263  * \brief Make a new routing component to the platform
264  *
265  * Add a new autonomous system to the platform. Any elements (such as host,
266  * router or sub-AS) added after this call and before the corresponding call
267  * to sg_platf_new_AS_close() will be added to this AS.
268  *
269  * Once this function was called, the configuration concerning the used
270  * models cannot be changed anymore.
271  *
272  * @param AS_id name of this autonomous system. Must be unique in the platform
273  * @param wanted_routing_type one of Full, Floyd, Dijkstra or similar. Full list in the variable routing_models, in src/surf/surf_routing.c
274  */
275 void routing_AS_begin(sg_platf_AS_cbarg_t AS)
276 {
277   XBT_DEBUG("routing_AS_begin");
278   routing_model_description_t model = NULL;
279
280   xbt_assert(!xbt_lib_get_or_null
281              (as_router_lib, AS->id, ROUTING_ASR_LEVEL),
282              "The AS \"%s\" already exists", AS->id);
283
284   _sg_cfg_init_status = 2; /* horrible hack: direct access to the global
285                             * controlling the level of configuration to prevent
286                             * any further config */
287
288   /* search the routing model */
289   switch(AS->routing){
290     case A_surfxml_AS_routing_Cluster:               model = &routing_models[SURF_MODEL_CLUSTER];break;
291     case A_surfxml_AS_routing_Cluster___torus:       model = &routing_models[SURF_MODEL_TORUS_CLUSTER];break;
292     case A_surfxml_AS_routing_Cluster___fat___tree:  model = &routing_models[SURF_MODEL_FAT_TREE_CLUSTER];break;
293     case A_surfxml_AS_routing_Dijkstra:              model = &routing_models[SURF_MODEL_DIJKSTRA];break;
294     case A_surfxml_AS_routing_DijkstraCache:         model = &routing_models[SURF_MODEL_DIJKSTRACACHE];break;
295     case A_surfxml_AS_routing_Floyd:                 model = &routing_models[SURF_MODEL_FLOYD];break;
296     case A_surfxml_AS_routing_Full:                  model = &routing_models[SURF_MODEL_FULL];break;
297     case A_surfxml_AS_routing_None:                  model = &routing_models[SURF_MODEL_NONE];break;
298     case A_surfxml_AS_routing_Vivaldi:               model = &routing_models[SURF_MODEL_VIVALDI];break;
299     default: xbt_die("Not a valid model!!!");
300     break;
301   }
302
303   /* make a new routing component */
304   As *new_as = model->create();
305
306   new_as->p_modelDesc = model;
307   new_as->p_hierarchy = SURF_ROUTING_NULL;
308   new_as->p_name = xbt_strdup(AS->id);
309
310   RoutingEdge *info = new RoutingEdgeImpl(xbt_strdup(new_as->p_name),
311                                             -1,
312                                             SURF_NETWORK_ELEMENT_AS,
313                                             current_routing);
314   if (current_routing == NULL && routing_platf->p_root == NULL) {
315
316     /* it is the first one */
317     new_as->p_routingFather = NULL;
318     routing_platf->p_root = new_as;
319     info->setId(-1);
320   } else if (current_routing != NULL && routing_platf->p_root != NULL) {
321
322     xbt_assert(!xbt_dict_get_or_null
323                (current_routing->p_routingSons, AS->id),
324                "The AS \"%s\" already exists", AS->id);
325     /* it is a part of the tree */
326     new_as->p_routingFather = current_routing;
327     /* set the father behavior */
328     if (current_routing->p_hierarchy == SURF_ROUTING_NULL)
329       current_routing->p_hierarchy = SURF_ROUTING_RECURSIVE;
330     /* add to the sons dictionary */
331     xbt_dict_set(current_routing->p_routingSons, AS->id,
332                  (void *) new_as, NULL);
333     /* add to the father element list */
334     info->setId(current_routing->parseAS(info));
335   } else {
336     THROWF(arg_error, 0, "All defined components must belong to a AS");
337   }
338
339   xbt_lib_set(as_router_lib, info->getName(), ROUTING_ASR_LEVEL,
340               (void *) info);
341   XBT_DEBUG("Having set name '%s' id '%d'", new_as->p_name, info->getId());
342
343   /* set the new current component of the tree */
344   current_routing = new_as;
345   current_routing->p_netElem = info;
346
347   routingEdgeCreatedCallbacks(info);
348   asCreatedCallbacks(new_as);
349 }
350
351 /**
352  * \brief Specify that the current description of AS is finished
353  *
354  * Once you've declared all the content of your AS, you have to close
355  * it with this call. Your AS is not usable until you call this function.
356  *
357  * @fixme: this call is not as robust as wanted: bad things WILL happen
358  * if you call it twice for the same AS, or if you forget calling it, or
359  * even if you add stuff to a closed AS
360  *
361  */
362 void routing_AS_end()
363 {
364
365   if (current_routing == NULL) {
366     THROWF(arg_error, 0, "Close an AS, but none was under construction");
367   } else {
368     if (current_routing->p_modelDesc->end)
369       current_routing->p_modelDesc->end(current_routing);
370     current_routing = current_routing->p_routingFather;
371   }
372 }
373
374 /* Aux Business methods */
375
376 /**
377  * \brief Get the AS father and the first elements of the chain
378  *
379  * \param src the source host name
380  * \param dst the destination host name
381  *
382  * Get the common father of the to processing units, and the first different
383  * father in the chain
384  */
385 static void elements_father(sg_routing_edge_t src, sg_routing_edge_t dst,
386                             AS_t * res_father,
387                             AS_t * res_src,
388                             AS_t * res_dst)
389 {
390   xbt_assert(src && dst, "bad parameters for \"elements_father\" method");
391 #define ELEMENTS_FATHER_MAXDEPTH 16     /* increase if it is not enough */
392   As *src_as, *dst_as;
393   As *path_src[ELEMENTS_FATHER_MAXDEPTH];
394   As *path_dst[ELEMENTS_FATHER_MAXDEPTH];
395   int index_src = 0;
396   int index_dst = 0;
397   As *current;
398   As *current_src;
399   As *current_dst;
400   As *father;
401
402   /* (1) find the as where the src and dst are located */
403   sg_routing_edge_t src_data = src;
404   sg_routing_edge_t dst_data = dst;
405   src_as = src_data->getRcComponent();
406   dst_as = dst_data->getRcComponent();
407 #ifndef NDEBUG
408   char* src_name = src_data->getName();
409   char* dst_name = dst_data->getName();
410 #endif
411
412   xbt_assert(src_as && dst_as,
413              "Ask for route \"from\"(%s) or \"to\"(%s) no found", src_name, dst_name);
414
415   /* (2) find the path to the root routing component */
416   for (current = src_as; current != NULL; current = current->p_routingFather) {
417     if (index_src >= ELEMENTS_FATHER_MAXDEPTH)
418       xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_src");
419     path_src[index_src++] = current;
420   }
421   for (current = dst_as; current != NULL; current = current->p_routingFather) {
422     if (index_dst >= ELEMENTS_FATHER_MAXDEPTH)
423       xbt_die("ELEMENTS_FATHER_MAXDEPTH should be increased for path_dst");
424     path_dst[index_dst++] = current;
425   }
426
427   /* (3) find the common father */
428   do {
429     current_src = path_src[--index_src];
430     current_dst = path_dst[--index_dst];
431   } while (index_src > 0 && index_dst > 0 && current_src == current_dst);
432
433   /* (4) they are not in the same routing component, make the path */
434   if (current_src == current_dst)
435     father = current_src;
436   else
437     father = path_src[index_src + 1];
438
439   /* (5) result generation */
440   *res_father = father;         /* first the common father of src and dst */
441   *res_src = current_src;       /* second the first different father of src */
442   *res_dst = current_dst;       /* three  the first different father of dst */
443
444 #undef ELEMENTS_FATHER_MAXDEPTH
445 }
446
447 /* Global Business methods */
448
449 /**
450  * \brief Recursive function for get_route_latency
451  *
452  * \param src the source host name
453  * \param dst the destination host name
454  * \param *route the route where the links are stored. It is either NULL or a ready to use dynar
455  * \param *latency the latency, if needed
456  *
457  * This function is called by "get_route" and "get_latency". It allows to walk
458  * recursively through the ASes tree.
459  */
460 static void _get_route_and_latency(RoutingEdge *src, RoutingEdge *dst,
461                                    xbt_dynar_t * links, double *latency)
462 {
463   s_sg_platf_route_cbarg_t route = SG_PLATF_ROUTE_INITIALIZER;
464   memset(&route,0,sizeof(route));
465
466   xbt_assert(src && dst, "bad parameters for \"_get_route_latency\" method");
467   XBT_DEBUG("Solve route/latency  \"%s\" to \"%s\"", src->getName(), dst->getName());
468
469   /* Find how src and dst are interconnected */
470   As *common_father, *src_father, *dst_father;
471   elements_father(src, dst, &common_father, &src_father, &dst_father);
472   XBT_DEBUG("elements_father: common father '%s' src_father '%s' dst_father '%s'",
473       common_father->p_name, src_father->p_name, dst_father->p_name);
474
475   /* Check whether a direct bypass is defined */
476   sg_platf_route_cbarg_t e_route_bypass = NULL;
477   //FIXME:REMOVE:if (common_father->get_bypass_route)
478
479   e_route_bypass = common_father->getBypassRoute(src, dst, latency);
480
481   /* Common ancestor is kind enough to declare a bypass route from src to dst -- use it and bail out */
482   if (e_route_bypass) {
483     xbt_dynar_merge(links, &e_route_bypass->link_list);
484     generic_free_route(e_route_bypass);
485     return;
486   }
487
488   /* If src and dst are in the same AS, life is good */
489   if (src_father == dst_father) {       /* SURF_ROUTING_BASE */
490     route.link_list = *links;
491     common_father->getRouteAndLatency(src, dst, &route, latency);
492     // if vivaldi latency+=vivaldi(src,dst)
493     return;
494   }
495
496   /* Not in the same AS, no bypass. We'll have to find our path between the ASes recursively*/
497
498   route.link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
499   // Find the net_card corresponding to father
500   RoutingEdge *src_father_net_elm = src_father->p_netElem;
501   RoutingEdge *dst_father_net_elm = dst_father->p_netElem;
502
503   common_father->getRouteAndLatency(src_father_net_elm, dst_father_net_elm,
504                                     &route, latency);
505
506   xbt_assert((route.gw_src != NULL) && (route.gw_dst != NULL),
507       "bad gateways for route from \"%s\" to \"%s\"", src->getName(), dst->getName());
508
509   sg_routing_edge_t src_gateway_net_elm = route.gw_src;
510   sg_routing_edge_t dst_gateway_net_elm = route.gw_dst;
511
512   /* If source gateway is not our source, we have to recursively find our way up to this point */
513   if (src != src_gateway_net_elm)
514     _get_route_and_latency(src, src_gateway_net_elm, links, latency);
515   xbt_dynar_merge(links, &route.link_list);
516
517   /* If dest gateway is not our destination, we have to recursively find our way from this point */
518   if (dst_gateway_net_elm != dst)
519     _get_route_and_latency(dst_gateway_net_elm, dst, links, latency);
520
521   // if vivaldi latency+=vivaldi(src_gateway,dst_gateway)
522 }
523
524 AS_t surf_platf_get_root(routing_platf_t platf){
525   return platf->p_root;
526 }
527
528 e_surf_network_element_type_t surf_routing_edge_get_rc_type(sg_routing_edge_t edge){
529   return edge->getRcType();
530 }
531
532
533 /**
534  * \brief Find a route between hosts
535  *
536  * \param src the network_element_t for src host
537  * \param dst the network_element_t for dst host
538  * \param route where to store the list of links.
539  *              If *route=NULL, create a short lived dynar. Else, fill the provided dynar
540  * \param latency where to store the latency experienced on the path (or NULL if not interested)
541  *                It is the caller responsability to initialize latency to 0 (we add to provided route)
542  * \pre route!=NULL
543  *
544  * walk through the routing components tree and find a route between hosts
545  * by calling the differents "get_route" functions in each routing component.
546  */
547 void RoutingPlatf::getRouteAndLatency(RoutingEdge *src, RoutingEdge *dst,
548                                    xbt_dynar_t* route, double *latency)
549 {
550   XBT_DEBUG("routing_get_route_and_latency from %s to %s", src->getName(), dst->getName());
551   if (!*route) {
552     xbt_dynar_reset(routing_platf->p_lastRoute);
553     *route = routing_platf->p_lastRoute;
554   }
555
556   _get_route_and_latency(src, dst, route, latency);
557
558   xbt_assert(!latency || *latency >= 0.0,
559              "negative latency on route between \"%s\" and \"%s\"", src->getName(), dst->getName());
560 }
561
562 xbt_dynar_t RoutingPlatf::getOneLinkRoutes(){
563   return recursiveGetOneLinkRoutes(p_root);
564 }
565
566 xbt_dynar_t RoutingPlatf::recursiveGetOneLinkRoutes(As *rc)
567 {
568   xbt_dynar_t ret = xbt_dynar_new(sizeof(Onelink*), xbt_free_f);
569
570   //adding my one link routes
571   xbt_dynar_t onelink_mine = rc->getOneLinkRoutes();
572   if (onelink_mine)
573     xbt_dynar_merge(&ret,&onelink_mine);
574
575   //recursing
576   char *key;
577   xbt_dict_cursor_t cursor = NULL;
578   AS_t rc_child;
579   xbt_dict_foreach(rc->p_routingSons, cursor, key, rc_child) {
580     xbt_dynar_t onelink_child = recursiveGetOneLinkRoutes(rc_child);
581     if (onelink_child)
582       xbt_dynar_merge(&ret,&onelink_child);
583   }
584   return ret;
585 }
586
587 e_surf_network_element_type_t routing_get_network_element_type(const char *name)
588 {
589   RoutingEdge *rc = sg_routing_edge_by_name_or_null(name);
590   if (rc)
591     return rc->getRcType();
592
593   return SURF_NETWORK_ELEMENT_NULL;
594 }
595
596 /**
597  * \brief Generic method: create the global routing schema
598  *
599  * Make a global routing structure and set all the parsing functions.
600  */
601 void routing_model_create( void *loopback)
602 {
603   /* config the uniq global routing */
604   routing_platf = new RoutingPlatf();
605   routing_platf->p_root = NULL;
606   routing_platf->p_loopback = loopback;
607   routing_platf->p_lastRoute = xbt_dynar_new(sizeof(sg_routing_link_t),NULL);
608   /* no current routing at moment */
609   current_routing = NULL;
610 }
611
612
613 /* ************************************************** */
614 /* ********** PATERN FOR NEW ROUTING **************** */
615
616 /* The minimal configuration of a new routing model need the next functions,
617  * also you need to set at the start of the file, the new model in the model
618  * list. Remember keep the null ending of the list.
619  */
620 /*** Routing model structure ***/
621 // typedef struct {
622 //   s_routing_component_t generic_routing;
623 //   /* things that your routing model need */
624 // } s_routing_component_NEW_t,*routing_component_NEW_t;
625
626 /*** Parse routing model functions ***/
627 // static void model_NEW_set_processing_unit(routing_component_t rc, const char* name) {}
628 // static void model_NEW_set_autonomous_system(routing_component_t rc, const char* name) {}
629 // static void model_NEW_set_route(routing_component_t rc, const char* src, const char* dst, route_t route) {}
630 // static void model_NEW_set_ASroute(routing_component_t rc, const char* src, const char* dst, route_extended_t route) {}
631 // static void model_NEW_set_bypassroute(routing_component_t rc, const char* src, const char* dst, route_extended_t e_route) {}
632
633 /*** Business methods ***/
634 // static route_extended_t NEW_get_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
635 // static route_extended_t NEW_get_bypass_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
636 // static void NEW_finalize(routing_component_t rc) { xbt_free(rc);}
637
638 /*** Creation routing model functions ***/
639 // static void* model_NEW_create(void) {
640 //   routing_component_NEW_t new_component =  xbt_new0(s_routing_component_NEW_t,1);
641 //   new_component->generic_routing.set_processing_unit = model_NEW_set_processing_unit;
642 //   new_component->generic_routing.set_autonomous_system = model_NEW_set_autonomous_system;
643 //   new_component->generic_routing.set_route = model_NEW_set_route;
644 //   new_component->generic_routing.set_ASroute = model_NEW_set_ASroute;
645 //   new_component->generic_routing.set_bypassroute = model_NEW_set_bypassroute;
646 //   new_component->generic_routing.get_route = NEW_get_route;
647 //   new_component->generic_routing.get_bypass_route = NEW_get_bypass_route;
648 //   new_component->generic_routing.finalize = NEW_finalize;
649 //   /* initialization of internal structures */
650 //   return new_component;
651 // } /* mandatory */
652 // static void  model_NEW_load(void) {}   /* mandatory */
653 // static void  model_NEW_unload(void) {} /* mandatory */
654 // static void  model_NEW_end(void) {}    /* mandatory */
655
656 /* ************************************************************************** */
657 /* ************************* GENERIC PARSE FUNCTIONS ************************ */
658
659 void routing_cluster_add_backbone(void* bb) {
660   xbt_assert(current_routing->p_modelDesc == &routing_models[SURF_MODEL_CLUSTER],
661         "You have to be in model Cluster to use tag backbone!");
662   xbt_assert(!static_cast<AsCluster*>(current_routing)->p_backbone, "The backbone link is already defined!");
663   static_cast<AsCluster*>(current_routing)->p_backbone = static_cast<Link*>(bb);
664   XBT_DEBUG("Add a backbone to AS '%s'", current_routing->p_name);
665 }
666
667 void sg_platf_new_cabinet(sg_platf_cabinet_cbarg_t cabinet)
668 {
669   int start, end, i;
670   char *groups , *host_id , *link_id = NULL;
671   unsigned int iter;
672   xbt_dynar_t radical_elements;
673   xbt_dynar_t radical_ends;
674
675   //Make all hosts
676   radical_elements = xbt_str_split(cabinet->radical, ",");
677   xbt_dynar_foreach(radical_elements, iter, groups) {
678
679     radical_ends = xbt_str_split(groups, "-");
680     start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
681
682     switch (xbt_dynar_length(radical_ends)) {
683     case 1:
684       end = start;
685       break;
686     case 2:
687       end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
688       break;
689     default:
690       surf_parse_error("Malformed radical");
691       break;
692     }
693     s_sg_platf_host_cbarg_t host = SG_PLATF_HOST_INITIALIZER;
694     memset(&host, 0, sizeof(host));
695     host.initial_state = SURF_RESOURCE_ON;
696     host.pstate        = 0;
697     host.speed_scale   = 1.0;
698     host.core_amount   = 1;
699
700     s_sg_platf_link_cbarg_t link = SG_PLATF_LINK_INITIALIZER;
701     memset(&link, 0, sizeof(link));
702     link.state     = SURF_RESOURCE_ON;
703     link.policy    = SURF_LINK_FULLDUPLEX;
704     link.latency   = cabinet->lat;
705     link.bandwidth = cabinet->bw;
706
707     s_sg_platf_host_link_cbarg_t host_link = SG_PLATF_HOST_LINK_INITIALIZER;
708     memset(&host_link, 0, sizeof(host_link));
709
710     for (i = start; i <= end; i++) {
711       host_id                      = bprintf("%s%d%s",cabinet->prefix,i,cabinet->suffix);
712       link_id                      = bprintf("link_%s%d%s",cabinet->prefix,i,cabinet->suffix);
713       host.id                      = host_id;
714       link.id                      = link_id;
715       host.speed_peak = xbt_dynar_new(sizeof(double), NULL);
716       xbt_dynar_push(host.speed_peak,&cabinet->speed);
717       sg_platf_new_host(&host);
718       xbt_dynar_free(&host.speed_peak);
719       sg_platf_new_link(&link);
720
721       char* link_up       = bprintf("%s_UP",link_id);
722       char* link_down     = bprintf("%s_DOWN",link_id);
723       host_link.id        = host_id;
724       host_link.link_up   = link_up;
725       host_link.link_down = link_down;
726       sg_platf_new_host_link(&host_link);
727
728       free(host_id);
729       free(link_id);
730       free(link_up);
731       free(link_down);
732     }
733
734     xbt_dynar_free(&radical_ends);
735   }
736   xbt_dynar_free(&radical_elements);
737 }
738
739 void routing_new_cluster(sg_platf_cluster_cbarg_t cluster)
740 {
741   char *host_id, *groups, *link_id = NULL;
742   xbt_dict_t patterns = NULL;
743   int rankId=0;
744
745   s_sg_platf_host_cbarg_t host = SG_PLATF_HOST_INITIALIZER;
746   s_sg_platf_link_cbarg_t link = SG_PLATF_LINK_INITIALIZER;
747
748   unsigned int iter;
749   int start, end, i;
750   xbt_dynar_t radical_elements;
751   xbt_dynar_t radical_ends;
752
753   if ((cluster->availability_trace && strcmp(cluster->availability_trace, ""))
754       || (cluster->state_trace && strcmp(cluster->state_trace, ""))) {
755     patterns = xbt_dict_new_homogeneous(xbt_free_f);
756     xbt_dict_set(patterns, "id", xbt_strdup(cluster->id), NULL);
757     xbt_dict_set(patterns, "prefix", xbt_strdup(cluster->prefix), NULL);
758     xbt_dict_set(patterns, "suffix", xbt_strdup(cluster->suffix), NULL);
759   }
760
761   /* parse the topology attribute. If we are not in a flat cluster,
762    * switch to the right mode and initialize the routing with
763    * the parameters in topo_parameters attribute
764    */
765   s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
766   AS.id = cluster->id;
767
768   if(cluster->topology == SURF_CLUSTER_TORUS){
769     XBT_DEBUG("<AS id=\"%s\"\trouting=\"Torus_Cluster\">", cluster->id);
770     AS.routing = A_surfxml_AS_routing_Cluster___torus;
771     sg_platf_new_AS_begin(&AS);
772     ((AsClusterTorus*)current_routing)->parse_specific_arguments(cluster);
773   }
774   else if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
775     XBT_DEBUG("<AS id=\"%s\"\trouting=\"Fat_Tree_Cluster\">", cluster->id);
776     AS.routing = A_surfxml_AS_routing_Cluster___fat___tree;
777     sg_platf_new_AS_begin(&AS);
778     ((AsClusterFatTree*)current_routing)->parse_specific_arguments(cluster);
779   }
780
781   else{
782     XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", cluster->id);
783     AS.routing = A_surfxml_AS_routing_Cluster;
784     sg_platf_new_AS_begin(&AS);
785   }
786
787   if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
788       ((AsCluster*)current_routing)->p_nb_links_per_node++;
789       ((AsCluster*)current_routing)->p_has_loopback=1;
790   }
791
792   if(cluster->limiter_link!=0){
793       ((AsCluster*)current_routing)->p_nb_links_per_node++;
794       ((AsCluster*)current_routing)->p_has_limiter=1;
795   }
796
797
798
799   current_routing->p_linkUpDownList
800             = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
801
802   //Make all hosts
803   radical_elements = xbt_str_split(cluster->radical, ",");
804   xbt_dynar_foreach(radical_elements, iter, groups) {
805
806     radical_ends = xbt_str_split(groups, "-");
807     start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
808
809     switch (xbt_dynar_length(radical_ends)) {
810     case 1:
811       end = start;
812       break;
813     case 2:
814       end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
815       break;
816     default:
817       surf_parse_error("Malformed radical");
818       break;
819     }
820     for (i = start; i <= end; i++) {
821       host_id =
822           bprintf("%s%d%s", cluster->prefix, i, cluster->suffix);
823       link_id = bprintf("%s_link_%d", cluster->id, i);
824
825       XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\">", host_id, cluster->speed);
826
827       memset(&host, 0, sizeof(host));
828       host.id = host_id;
829       if ((cluster->properties != NULL) && (!xbt_dict_is_empty(cluster->properties))) {
830           xbt_dict_cursor_t cursor=NULL;
831           char *key,*data;
832           host.properties = xbt_dict_new();
833
834           xbt_dict_foreach(cluster->properties,cursor,key,data) {
835                   xbt_dict_set(host.properties, key, xbt_strdup(data),free);
836           }
837       }
838       if (cluster->availability_trace && strcmp(cluster->availability_trace, "")) {
839         xbt_dict_set(patterns, "radical", bprintf("%d", i), NULL);
840         char *avail_file = xbt_str_varsubst(cluster->availability_trace, patterns);
841         XBT_DEBUG("\tavailability_file=\"%s\"", avail_file);
842         host.speed_trace = tmgr_trace_new_from_file(avail_file);
843         xbt_free(avail_file);
844       } else {
845         XBT_DEBUG("\tavailability_file=\"\"");
846       }
847
848       if (cluster->state_trace && strcmp(cluster->state_trace, "")) {
849         char *avail_file = xbt_str_varsubst(cluster->state_trace, patterns);
850         XBT_DEBUG("\tstate_file=\"%s\"", avail_file);
851         host.state_trace = tmgr_trace_new_from_file(avail_file);
852         xbt_free(avail_file);
853       } else {
854         XBT_DEBUG("\tstate_file=\"\"");
855       }
856
857       host.speed_peak = xbt_dynar_new(sizeof(double), NULL);
858       xbt_dynar_push(host.speed_peak,&cluster->speed);
859       host.pstate = 0;
860
861       //host.power_peak = cluster->power;
862       host.speed_scale = 1.0;
863       host.core_amount = cluster->core_amount;
864       host.initial_state = SURF_RESOURCE_ON;
865       host.coord = "";
866       sg_platf_new_host(&host);
867       xbt_dynar_free(&host.speed_peak);
868       XBT_DEBUG("</host>");
869
870       XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_id,
871                 cluster->bw, cluster->lat);
872
873
874       s_surf_parsing_link_up_down_t info_lim, info_loop;
875       // All links are saved in a matrix;
876       // every row describes a single node; every node
877       // may have multiple links.
878       // the first column may store a link from x to x if p_has_loopback is set
879       // the second column may store a limiter link if p_has_limiter is set
880       // other columns are to store one or more link for the node
881
882       //add a loopback link
883       if(cluster->loopback_bw!=0 || cluster->loopback_lat!=0){
884         char *tmp_link = bprintf("%s_loopback", link_id);
885         XBT_DEBUG("<loopback\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
886                 cluster->limiter_link);
887
888
889         memset(&link, 0, sizeof(link));
890         link.id        = tmp_link;
891         link.bandwidth = cluster->loopback_bw;
892         link.latency   = cluster->loopback_lat;
893         link.state     = SURF_RESOURCE_ON;
894         link.policy    = SURF_LINK_FATPIPE;
895         sg_platf_new_link(&link);
896         info_loop.link_up   = Link::byName(tmp_link);
897         info_loop.link_down = info_loop.link_up;
898         free(tmp_link);
899         xbt_dynar_set(current_routing->p_linkUpDownList, rankId*(static_cast<AsCluster*>(current_routing))->p_nb_links_per_node, &info_loop);
900       }
901
902       //add a limiter link (shared link to account for maximal bandwidth of the node)
903       if(cluster->limiter_link!=0){
904         char *tmp_link = bprintf("%s_limiter", link_id);
905         XBT_DEBUG("<limiter\tid=\"%s\"\tbw=\"%f\"/>", tmp_link,
906                 cluster->limiter_link);
907
908
909         memset(&link, 0, sizeof(link));
910         link.id = tmp_link;
911         link.bandwidth = cluster->limiter_link;
912         link.latency = 0;
913         link.state = SURF_RESOURCE_ON;
914         link.policy = SURF_LINK_SHARED;
915         sg_platf_new_link(&link);
916         info_lim.link_up = Link::byName(tmp_link);
917         info_lim.link_down = info_lim.link_up;
918         free(tmp_link);
919         xbt_dynar_set(current_routing->p_linkUpDownList,
920             rankId*(static_cast<AsCluster*>(current_routing))->p_nb_links_per_node + static_cast<AsCluster*>(current_routing)->p_has_loopback ,
921             &info_lim);
922
923       }
924
925
926       //call the cluster function that adds the others links
927       if (cluster->topology == SURF_CLUSTER_FAT_TREE) {
928         ((AsClusterFatTree*) current_routing)->addProcessingNode(i);
929       }
930       else {
931       static_cast<AsCluster*>(current_routing)->create_links_for_node(cluster, i, rankId, rankId*
932                   static_cast<AsCluster*>(current_routing)->p_nb_links_per_node
933           + static_cast<AsCluster*>(current_routing)->p_has_loopback
934           + static_cast<AsCluster*>(current_routing)->p_has_limiter );
935       }
936       xbt_free(link_id);
937       xbt_free(host_id);
938       rankId++;
939     }
940
941     xbt_dynar_free(&radical_ends);
942   }
943   xbt_dynar_free(&radical_elements);
944
945   // For fat trees, the links must be created once all nodes have been added
946   if(cluster->topology == SURF_CLUSTER_FAT_TREE) {
947     static_cast<AsClusterFatTree*>(current_routing)->create_links();
948   }
949   // Add a router. It is magically used thanks to the way in which surf_routing_cluster is written,
950   // and it's very useful to connect clusters together
951   XBT_DEBUG(" ");
952   XBT_DEBUG("<router id=\"%s\"/>", cluster->router_id);
953   char *newid = NULL;
954   s_sg_platf_router_cbarg_t router = SG_PLATF_ROUTER_INITIALIZER;
955   memset(&router, 0, sizeof(router));
956   router.id = cluster->router_id;
957   router.coord = "";
958   if (!router.id || !strcmp(router.id, ""))
959     router.id = newid =
960         bprintf("%s%s_router%s", cluster->prefix, cluster->id,
961                 cluster->suffix);
962   sg_platf_new_router(&router);
963   ((AsCluster*)current_routing)->p_router = (RoutingEdge*) xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL);
964   free(newid);
965
966   //Make the backbone
967   if ((cluster->bb_bw != 0) || (cluster->bb_lat != 0)) {
968     char *link_backbone = bprintf("%s_backbone", cluster->id);
969     XBT_DEBUG("<link\tid=\"%s\" bw=\"%f\" lat=\"%f\"/>", link_backbone,
970               cluster->bb_bw, cluster->bb_lat);
971
972     memset(&link, 0, sizeof(link));
973     link.id        = link_backbone;
974     link.bandwidth = cluster->bb_bw;
975     link.latency   = cluster->bb_lat;
976     link.state     = SURF_RESOURCE_ON;
977     link.policy    = cluster->bb_sharing_policy;
978
979     sg_platf_new_link(&link);
980
981     routing_cluster_add_backbone(Link::byName(link_backbone));
982
983     free(link_backbone);
984   }
985
986   XBT_DEBUG("</AS>");
987   sg_platf_new_AS_end();
988   XBT_DEBUG(" ");
989   xbt_dict_free(&patterns); // no op if it were never set
990 }
991
992 static void routing_parse_postparse(void) {
993   xbt_dict_free(&random_value);
994 }
995
996 void sg_platf_new_peer(sg_platf_peer_cbarg_t peer)
997 {
998   char *host_id = NULL;
999   char *link_id = NULL;
1000   char *router_id = NULL;
1001
1002   XBT_DEBUG(" ");
1003   host_id = HOST_PEER(peer->id);
1004   link_id = LINK_PEER(peer->id);
1005   router_id = ROUTER_PEER(peer->id);
1006
1007   XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", peer->id);
1008   s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
1009   AS.id                    = peer->id;
1010   AS.routing               = A_surfxml_AS_routing_Cluster;
1011   sg_platf_new_AS_begin(&AS);
1012
1013   current_routing->p_linkUpDownList = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
1014
1015   XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\"/>", host_id, peer->speed);
1016   s_sg_platf_host_cbarg_t host = SG_PLATF_HOST_INITIALIZER;
1017   memset(&host, 0, sizeof(host));
1018   host.initial_state = SURF_RESOURCE_ON;
1019   host.id = host_id;
1020
1021   host.speed_peak = xbt_dynar_new(sizeof(double), NULL);
1022   xbt_dynar_push(host.speed_peak,&peer->speed);
1023   host.pstate = 0;
1024   //host.power_peak = peer->power;
1025   host.speed_scale = 1.0;
1026   host.speed_trace = peer->availability_trace;
1027   host.state_trace = peer->state_trace;
1028   host.core_amount = 1;
1029   sg_platf_new_host(&host);
1030   xbt_dynar_free(&host.speed_peak);
1031
1032   s_sg_platf_link_cbarg_t link = SG_PLATF_LINK_INITIALIZER;
1033   memset(&link, 0, sizeof(link));
1034   link.state   = SURF_RESOURCE_ON;
1035   link.policy  = SURF_LINK_SHARED;
1036   link.latency = peer->lat;
1037
1038   char* link_up = bprintf("%s_UP",link_id);
1039   XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_up,
1040             peer->bw_out, peer->lat);
1041   link.id = link_up;
1042   link.bandwidth = peer->bw_out;
1043   sg_platf_new_link(&link);
1044
1045   char* link_down = bprintf("%s_DOWN",link_id);
1046   XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_down,
1047             peer->bw_in, peer->lat);
1048   link.id = link_down;
1049   link.bandwidth = peer->bw_in;
1050   sg_platf_new_link(&link);
1051
1052   XBT_DEBUG("<host_link\tid=\"%s\"\tup=\"%s\"\tdown=\"%s\" />", host_id,link_up,link_down);
1053   s_sg_platf_host_link_cbarg_t host_link = SG_PLATF_HOST_LINK_INITIALIZER;
1054   memset(&host_link, 0, sizeof(host_link));
1055   host_link.id        = host_id;
1056   host_link.link_up   = link_up;
1057   host_link.link_down = link_down;
1058   sg_platf_new_host_link(&host_link);
1059
1060   XBT_DEBUG("<router id=\"%s\"/>", router_id);
1061   s_sg_platf_router_cbarg_t router = SG_PLATF_ROUTER_INITIALIZER;
1062   memset(&router, 0, sizeof(router));
1063   router.id = router_id;
1064   router.coord = peer->coord;
1065   sg_platf_new_router(&router);
1066   static_cast<AsCluster*>(current_routing)->p_router = static_cast<RoutingEdge*>(xbt_lib_get_or_null(as_router_lib, router.id, ROUTING_ASR_LEVEL));
1067
1068   XBT_DEBUG("</AS>");
1069   sg_platf_new_AS_end();
1070   XBT_DEBUG(" ");
1071
1072   //xbt_dynar_free(&tab_elements_num);
1073   free(router_id);
1074   free(host_id);
1075   free(link_id);
1076   free(link_up);
1077   free(link_down);
1078 }
1079
1080 // static void routing_parse_Srandom(void)
1081 // {
1082 //   double mean, std, min, max, seed;
1083 //   char *random_id = A_surfxml_random_id;
1084 //   char *random_radical = A_surfxml_random_radical;
1085 //   char *rd_name = NULL;
1086 //   char *rd_value;
1087 //   mean = surf_parse_get_double(A_surfxml_random_mean);
1088 //   std = surf_parse_get_double(A_surfxml_random_std___deviation);
1089 //   min = surf_parse_get_double(A_surfxml_random_min);
1090 //   max = surf_parse_get_double(A_surfxml_random_max);
1091 //   seed = surf_parse_get_double(A_surfxml_random_seed);
1092
1093 //   double res = 0;
1094 //   int i = 0;
1095 //   random_data_t random = xbt_new0(s_random_data_t, 1);
1096 //   char *tmpbuf;
1097
1098 //   xbt_dynar_t radical_elements;
1099 //   unsigned int iter;
1100 //   char *groups;
1101 //   int start, end;
1102 //   xbt_dynar_t radical_ends;
1103
1104 //   switch (A_surfxml_random_generator) {
1105 //   case AU_surfxml_random_generator:
1106 //   case A_surfxml_random_generator_NONE:
1107 //     random->generator = NONE;
1108 //     break;
1109 //   case A_surfxml_random_generator_DRAND48:
1110 //     random->generator = DRAND48;
1111 //     break;
1112 //   case A_surfxml_random_generator_RAND:
1113 //     random->generator = RAND;
1114 //     break;
1115 //   case A_surfxml_random_generator_RNGSTREAM:
1116 //     random->generator = RNGSTREAM;
1117 //     break;
1118 //   default:
1119 //     surf_parse_error("Invalid random generator");
1120 //     break;
1121 //   }
1122 //   random->seed = seed;
1123 //   random->min = min;
1124 //   random->max = max;
1125
1126 //   /* Check user stupidities */
1127 //   if (max < min)
1128 //     THROWF(arg_error, 0, "random->max < random->min (%f < %f)", max, min);
1129 //   if (mean < min)
1130 //     THROWF(arg_error, 0, "random->mean < random->min (%f < %f)", mean, min);
1131 //   if (mean > max)
1132 //     THROWF(arg_error, 0, "random->mean > random->max (%f > %f)", mean, max);
1133
1134 //   /* normalize the mean and standard deviation before storing */
1135 //   random->mean = (mean - min) / (max - min);
1136 //   random->std = std / (max - min);
1137
1138 //   if (random->mean * (1 - random->mean) < random->std * random->std)
1139 //     THROWF(arg_error, 0, "Invalid mean and standard deviation (%f and %f)",
1140 //            random->mean, random->std);
1141
1142 //   XBT_DEBUG
1143 //       ("id = '%s' min = '%f' max = '%f' mean = '%f' std_deviatinon = '%f' generator = '%d' seed = '%ld' radical = '%s'",
1144 //        random_id, random->min, random->max, random->mean, random->std,
1145 //        (int)random->generator, random->seed, random_radical);
1146
1147 //   if (!random_value)
1148 //     random_value = xbt_dict_new_homogeneous(free);
1149
1150 //   if (!strcmp(random_radical, "")) {
1151 //     res = random_generate(random);
1152 //     rd_value = bprintf("%f", res);
1153 //     xbt_dict_set(random_value, random_id, rd_value, NULL);
1154 //   } else {
1155 //     radical_elements = xbt_str_split(random_radical, ",");
1156 //     xbt_dynar_foreach(radical_elements, iter, groups) {
1157 //       radical_ends = xbt_str_split(groups, "-");
1158 //       switch (xbt_dynar_length(radical_ends)) {
1159 //       case 1:
1160 //         xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1161 //                    "Custom Random '%s' already exists !", random_id);
1162 //         res = random_generate(random);
1163 //         tmpbuf =
1164 //             bprintf("%s%d", random_id,
1165 //                     atoi(xbt_dynar_getfirst_as(radical_ends, char *)));
1166 //         xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1167 //         xbt_free(tmpbuf);
1168 //         break;
1169
1170 //       case 2:
1171 //         start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
1172 //         end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
1173 //         for (i = start; i <= end; i++) {
1174 //           xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1175 //                      "Custom Random '%s' already exists !", bprintf("%s%d",
1176 //                                                                     random_id,
1177 //                                                                     i));
1178 //           res = random_generate(random);
1179 //           tmpbuf = bprintf("%s%d", random_id, i);
1180 //           xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1181 //           xbt_free(tmpbuf);
1182 //         }
1183 //         break;
1184 //       default:
1185 //         XBT_CRITICAL("Malformed radical");
1186 //         break;
1187 //       }
1188 //       res = random_generate(random);
1189 //       rd_name = bprintf("%s_router", random_id);
1190 //       rd_value = bprintf("%f", res);
1191 //       xbt_dict_set(random_value, rd_name, rd_value, NULL);
1192
1193 //       xbt_dynar_free(&radical_ends);
1194 //     }
1195 //     free(rd_name);
1196 //     xbt_dynar_free(&radical_elements);
1197 //   }
1198 // }
1199
1200 static void check_disk_attachment()
1201 {
1202   xbt_lib_cursor_t cursor;
1203   char *key;
1204   void **data;
1205   RoutingEdge *host_elm;
1206   xbt_lib_foreach(storage_lib, cursor, key, data) {
1207     if(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL) != NULL) {
1208           Storage *storage = static_cast<Storage*>(xbt_lib_get_level(xbt_lib_get_elm_or_null(storage_lib, key), SURF_STORAGE_LEVEL));
1209           host_elm = sg_routing_edge_by_name_or_null(storage->p_attach);
1210           if(!host_elm)
1211                   surf_parse_error("Unable to attach storage %s: host %s doesn't exist.", storage->getName(), storage->p_attach);
1212     }
1213   }
1214 }
1215
1216 void routing_register_callbacks()
1217 {
1218   sg_platf_postparse_add_cb(routing_parse_postparse);
1219   sg_platf_postparse_add_cb(check_disk_attachment);
1220
1221   instr_routing_define_callbacks();
1222 }
1223
1224 /**
1225  * \brief Recursive function for finalize
1226  *
1227  * \param rc the source host name
1228  *
1229  * This fuction is call by "finalize". It allow to finalize the
1230  * AS or routing components. It delete all the structures.
1231  */
1232 static void finalize_rec(As *as) {
1233   xbt_dict_cursor_t cursor = NULL;
1234   char *key;
1235   AS_t elem;
1236
1237   xbt_dict_foreach(as->p_routingSons, cursor, key, elem) {
1238     finalize_rec(elem);
1239   }
1240
1241   delete as;;
1242 }
1243
1244 /** \brief Frees all memory allocated by the routing module */
1245 void routing_exit(void) {
1246   delete routing_platf;
1247 }
1248
1249 RoutingPlatf::~RoutingPlatf()
1250 {
1251         xbt_dynar_free(&p_lastRoute);
1252         finalize_rec(p_root);
1253 }
1254
1255 AS_t surf_AS_get_routing_root() {
1256   return routing_platf->p_root;
1257 }
1258
1259 const char *surf_AS_get_name(As *as) {
1260   return as->p_name;
1261 }
1262
1263 static As *surf_AS_recursive_get_by_name(As *current, const char * name) {
1264   xbt_dict_cursor_t cursor = NULL;
1265   char *key;
1266   AS_t elem;
1267   As *tmp = NULL;
1268
1269   if(!strcmp(current->p_name, name))
1270     return current;
1271
1272   xbt_dict_foreach(current->p_routingSons, cursor, key, elem) {
1273     tmp = surf_AS_recursive_get_by_name(elem, name);
1274     if(tmp != NULL ) {
1275         break;
1276     }
1277   }
1278   return tmp;
1279 }
1280
1281
1282 As *surf_AS_get_by_name(const char * name) {
1283   As *as = surf_AS_recursive_get_by_name(routing_platf->p_root, name);
1284   if(as == NULL)
1285     XBT_WARN("Impossible to find an AS with name %s, please check your input", name);
1286   return as;
1287 }
1288
1289 xbt_dict_t surf_AS_get_routing_sons(As *as) {
1290   return as->p_routingSons;
1291 }
1292
1293 const char *surf_AS_get_model(As *as) {
1294   return as->p_modelDesc->name;
1295 }
1296
1297 xbt_dynar_t surf_AS_get_hosts(As *as) {
1298   xbt_dynar_t elms = as->p_indexNetworkElm;
1299   sg_routing_edge_t relm;
1300   xbt_dictelm_t delm;
1301   int index;
1302   int count = xbt_dynar_length(elms);
1303   xbt_dynar_t res =  xbt_dynar_new(sizeof(xbt_dictelm_t), NULL);
1304   for (index = 0; index < count; index++) {
1305      relm = xbt_dynar_get_as(elms, index, RoutingEdge*);
1306      delm = xbt_lib_get_elm_or_null(host_lib, relm->getName());
1307      if (delm!=NULL) {
1308        xbt_dynar_push(res, &delm);
1309      }
1310   }
1311   return res;
1312 }
1313
1314 void surf_AS_get_graph(AS_t as, xbt_graph_t graph, xbt_dict_t nodes, xbt_dict_t edges) {
1315   as->getGraph(graph, nodes, edges);
1316 }