Logo AND Algorithmique Numérique Distribuée

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