Logo AND Algorithmique Numérique Distribuée

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