Logo AND Algorithmique Numérique Distribuée

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