Logo AND Algorithmique Numérique Distribuée

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