Logo AND Algorithmique Numérique Distribuée

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