Logo AND Algorithmique Numérique Distribuée

Public GIT Repository
Finalize properties on AS.
[simgrid.git] / src / surf / surf_routing.c
1 /* Copyright (c) 2009, 2010, 2011. 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 <pcre.h>               /* regular expression library */
8
9 #include "simgrid/platf_interface.h"    // platform creation API internal interface
10
11 #include "surf_routing_private.h"
12 #include "surf/surf_routing.h"
13 #include "surf/surfxml_parse_values.h"
14
15 /**
16  * @ingroup SURF_build_api
17  * @brief A library containing all known workstations
18  */
19 xbt_lib_t host_lib;
20
21 int ROUTING_HOST_LEVEL;         //Routing level
22 int SURF_CPU_LEVEL;             //Surf cpu level
23 int SURF_WKS_LEVEL;             //Surf workstation level
24 int SIMIX_HOST_LEVEL;           //Simix level
25 int MSG_HOST_LEVEL;             //Msg level
26 int SD_HOST_LEVEL;              //Simdag level
27 int COORD_HOST_LEVEL=0;         //Coordinates level
28 int NS3_HOST_LEVEL;             //host node for ns3
29
30 xbt_dict_t watched_hosts_lib;
31
32 /**
33  * @ingroup SURF_build_api
34  * @brief A library containing all known links
35  */
36 xbt_lib_t link_lib;
37 int SD_LINK_LEVEL;              //Simdag level
38 int SURF_LINK_LEVEL;            //Surf level
39 int NS3_LINK_LEVEL;             //link for ns3
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 /** @brief Retrieve a routing edge from its name
50  *
51  * Routing edges are either CPU/workstation and routers, whatever
52  */
53 sg_routing_edge_t sg_routing_edge_by_name_or_null(const char *name) {
54     sg_routing_edge_t net_elm = xbt_lib_get_or_null(host_lib, name, ROUTING_HOST_LEVEL);
55     if(!net_elm) net_elm = xbt_lib_get_or_null(as_router_lib, name, ROUTING_ASR_LEVEL);
56   return net_elm;
57 }
58
59 /* Global vars */
60 routing_platf_t routing_platf = NULL;
61 AS_t current_routing = NULL;
62
63 /* global parse functions */
64 extern xbt_dynar_t mount_list;
65
66 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route, surf, "Routing part of surf");
67
68 static void routing_parse_peer(sg_platf_peer_cbarg_t peer);     /* peer bypass */
69 static void routing_parse_Srandom(void);        /* random bypass */
70
71 static void routing_parse_postparse(void);
72
73 /* this lines are only for replace use like index in the model table */
74 typedef enum {
75   SURF_MODEL_FULL = 0,
76   SURF_MODEL_FLOYD,
77   SURF_MODEL_DIJKSTRA,
78   SURF_MODEL_DIJKSTRACACHE,
79   SURF_MODEL_NONE,
80   SURF_MODEL_RULEBASED,
81   SURF_MODEL_VIVALDI,
82   SURF_MODEL_CLUSTER
83 } e_routing_types;
84
85 struct s_model_type routing_models[] = {
86   {"Full",
87    "Full routing data (fast, large memory requirements, fully expressive)",
88    model_full_create, model_full_end},
89   {"Floyd",
90    "Floyd routing data (slow initialization, fast lookup, lesser memory requirements, shortest path routing only)",
91    model_floyd_create, model_floyd_end},
92   {"Dijkstra",
93    "Dijkstra routing data (fast initialization, slow lookup, small memory requirements, shortest path routing only)",
94    model_dijkstra_create, model_dijkstra_both_end},
95   {"DijkstraCache",
96    "Dijkstra routing data (fast initialization, fast lookup, small memory requirements, shortest path routing only)",
97    model_dijkstracache_create, model_dijkstra_both_end},
98   {"none", "No routing (Unless you know what you are doing, avoid using this mode in combination with a non Constant network model).",
99    model_none_create,  NULL},
100   {"RuleBased", "Rule-Based routing data (...)",
101    model_rulebased_create, NULL},
102   {"Vivaldi", "Vivaldi routing",
103    model_vivaldi_create, NULL},
104   {"Cluster", "Cluster routing",
105    model_cluster_create, NULL},
106   {NULL, NULL, NULL, NULL}
107 };
108
109 /**
110  * \brief Add a "host_link" to the network element list
111  */
112 static void parse_S_host_link(sg_platf_host_link_cbarg_t host)
113 {
114   sg_routing_edge_t info = NULL;
115   info = 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->model_desc == &routing_models[SURF_MODEL_CLUSTER] ||
118       current_routing->model_desc == &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->link_up_down_list)
129     current_routing->link_up_down_list = 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(xbt_dynar_length(current_routing->link_up_down_list) > info->id &&
133       xbt_dynar_get_as(current_routing->link_up_down_list,info->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->name,info->id);
137   xbt_dynar_set_as(current_routing->link_up_down_list,info->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   sg_routing_edge_t info = NULL;
146   if (current_routing->hierarchy == SURF_ROUTING_NULL)
147     current_routing->hierarchy = SURF_ROUTING_BASE;
148   xbt_assert(!xbt_lib_get_or_null(host_lib, host->id, ROUTING_HOST_LEVEL),
149              "Reading a host, processing unit \"%s\" already exists", host->id);
150
151   info = xbt_new0(s_network_element_t, 1);
152   info->rc_component = current_routing;
153   info->rc_type = SURF_NETWORK_ELEMENT_HOST;
154   info->name = xbt_strdup(host->id);
155   info->id = current_routing->parse_PU(current_routing, (void *) info);
156   xbt_lib_set(host_lib, host->id, ROUTING_HOST_LEVEL, (void *) info);
157   XBT_DEBUG("Having set name '%s' id '%d'",host->id,info->id);
158
159   if(mount_list){
160     xbt_lib_set(storage_lib, host->id, ROUTING_STORAGE_HOST_LEVEL, (void *) mount_list);
161     mount_list = NULL;
162   }
163
164   if (host->coord && strcmp(host->coord, "")) {
165     unsigned int cursor;
166     char*str;
167
168     if (!COORD_HOST_LEVEL)
169       xbt_die ("To use host coordinates, please add --cfg=network/coordinates:yes to your command line");
170     /* Pre-parse the host coordinates -- FIXME factorize with routers by overloading the routing->parse_PU function*/
171     xbt_dynar_t ctn_str = xbt_str_split_str(host->coord, " ");
172     xbt_dynar_t ctn = xbt_dynar_new(sizeof(double),NULL);
173     xbt_dynar_foreach(ctn_str,cursor, str) {
174       double val = atof(str);
175       xbt_dynar_push(ctn,&val);
176     }
177     xbt_dynar_shrink(ctn, 0);
178     xbt_dynar_free(&ctn_str);
179     xbt_lib_set(host_lib, host->id, COORD_HOST_LEVEL, (void *) ctn);
180     XBT_DEBUG("Having set host coordinates for '%s'",host->id);
181   }
182 }
183
184 /**
185  * \brief Add a "router" to the network element list
186  */
187 static void parse_S_router(sg_platf_router_cbarg_t router)
188 {
189   sg_routing_edge_t info = NULL;
190   if (current_routing->hierarchy == SURF_ROUTING_NULL)
191     current_routing->hierarchy = SURF_ROUTING_BASE;
192   xbt_assert(!xbt_lib_get_or_null(as_router_lib, router->id, ROUTING_ASR_LEVEL),
193              "Reading a router, processing unit \"%s\" already exists",
194              router->id);
195
196   info = xbt_new0(s_network_element_t, 1);
197   info->rc_component = current_routing;
198   info->rc_type = SURF_NETWORK_ELEMENT_ROUTER;
199   info->name = xbt_strdup(router->id);
200   info->id = current_routing->parse_PU(current_routing, (void *) info);
201   xbt_lib_set(as_router_lib, router->id, ROUTING_ASR_LEVEL, (void *) info);
202   XBT_DEBUG("Having set name '%s' id '%d'",router->id,info->id);
203
204   if (router->coord && strcmp(router->coord, "")) {
205     unsigned int cursor;
206     char*str;
207
208     if (!COORD_ASR_LEVEL)
209       xbt_die ("To use host coordinates, please add --cfg=network/coordinates:yes to your command line");
210     /* Pre-parse the host coordinates */
211     xbt_dynar_t ctn_str = xbt_str_split_str(router->coord, " ");
212     xbt_dynar_t ctn = xbt_dynar_new(sizeof(double),NULL);
213     xbt_dynar_foreach(ctn_str,cursor, str) {
214       double val = atof(str);
215       xbt_dynar_push(ctn,&val);
216     }
217     xbt_dynar_shrink(ctn, 0);
218     xbt_dynar_free(&ctn_str);
219     xbt_lib_set(as_router_lib, router->id, COORD_ASR_LEVEL, (void *) ctn);
220     XBT_DEBUG("Having set router coordinates for '%s'",router->id);
221   }
222 }
223
224 /**
225  * \brief Store the route by calling the set_route function of the current routing component
226  */
227 static void parse_E_route(sg_platf_route_cbarg_t route)
228 {
229   xbt_assert(current_routing->parse_route,
230              "no defined method \"set_route\" in \"%s\"",
231              current_routing->name);
232
233   current_routing->parse_route(current_routing, route);
234 }
235
236 /**
237  * \brief Store the ASroute by calling the set_ASroute function of the current routing component
238  */
239 static void parse_E_ASroute(sg_platf_route_cbarg_t ASroute)
240 {
241   xbt_assert(current_routing->parse_ASroute,
242              "no defined method \"set_ASroute\" in \"%s\"",
243              current_routing->name);
244   current_routing->parse_ASroute(current_routing, ASroute);
245 }
246
247 /**
248  * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
249  */
250 static void parse_E_bypassRoute(sg_platf_route_cbarg_t route)
251 {
252   xbt_assert(current_routing->parse_bypassroute,
253              "Bypassing mechanism not implemented by routing '%s'",
254              current_routing->name);
255
256   current_routing->parse_bypassroute(current_routing, route);
257 }
258
259 /**
260  * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
261  */
262 static void parse_E_bypassASroute(sg_platf_route_cbarg_t ASroute)
263 {
264   xbt_assert(current_routing->parse_bypassroute,
265              "Bypassing mechanism not implemented by routing '%s'",
266              current_routing->name);
267   current_routing->parse_bypassroute(current_routing, ASroute);
268 }
269
270 static void routing_parse_trace(sg_platf_trace_cbarg_t trace)
271 {
272   tmgr_trace_t tmgr_trace;
273   if (!trace->file || strcmp(trace->file, "") != 0) {
274     tmgr_trace = tmgr_trace_new_from_file(trace->file);
275   } else if (strcmp(trace->pc_data, "") == 0) {
276     tmgr_trace = NULL;
277   } else {
278     tmgr_trace =
279           tmgr_trace_new_from_string(trace->id, trace->pc_data,
280                                      trace->periodicity);
281   }
282   xbt_dict_set(traces_set_list, trace->id, (void *) tmgr_trace, NULL);
283 }
284
285 static void routing_parse_trace_connect(sg_platf_trace_connect_cbarg_t trace_connect)
286 {
287   xbt_assert(xbt_dict_get_or_null
288               (traces_set_list, trace_connect->trace),
289               "Cannot connect trace %s to %s: trace unknown",
290               trace_connect->trace,
291               trace_connect->element);
292
293   switch (trace_connect->kind) {
294   case SURF_TRACE_CONNECT_KIND_HOST_AVAIL:
295     xbt_dict_set(trace_connect_list_host_avail,
296         trace_connect->trace,
297         xbt_strdup(trace_connect->element), NULL);
298     break;
299   case SURF_TRACE_CONNECT_KIND_POWER:
300     xbt_dict_set(trace_connect_list_power, trace_connect->trace,
301         xbt_strdup(trace_connect->element), NULL);
302     break;
303   case SURF_TRACE_CONNECT_KIND_LINK_AVAIL:
304     xbt_dict_set(trace_connect_list_link_avail,
305         trace_connect->trace,
306         xbt_strdup(trace_connect->element), NULL);
307     break;
308   case SURF_TRACE_CONNECT_KIND_BANDWIDTH:
309     xbt_dict_set(trace_connect_list_bandwidth,
310         trace_connect->trace,
311         xbt_strdup(trace_connect->element), NULL);
312     break;
313   case SURF_TRACE_CONNECT_KIND_LATENCY:
314     xbt_dict_set(trace_connect_list_latency, trace_connect->trace,
315         xbt_strdup(trace_connect->element), NULL);
316     break;
317   default:
318     xbt_die("Cannot connect trace %s to %s: kind of trace unknown",
319         trace_connect->trace, trace_connect->element);
320     break;
321   }
322 }
323
324 /**
325  * \brief Make a new routing component to the platform
326  *
327  * Add a new autonomous system to the platform. Any elements (such as host,
328  * router or sub-AS) added after this call and before the corresponding call
329  * to sg_platf_new_AS_close() will be added to this AS.
330  *
331  * Once this function was called, the configuration concerning the used
332  * models cannot be changed anymore.
333  *
334  * @param AS_id name of this autonomous system. Must be unique in the platform
335  * @param wanted_routing_type one of Full, Floyd, Dijkstra or similar. Full list in the variable routing_models, in src/surf/surf_routing.c
336  */
337 void routing_AS_begin(sg_platf_AS_cbarg_t AS)
338 {
339   XBT_DEBUG("routing_AS_begin");
340   AS_t new_as;
341   routing_model_description_t model = NULL;
342
343   xbt_assert(!xbt_lib_get_or_null
344              (as_router_lib, AS->id, ROUTING_ASR_LEVEL),
345              "The AS \"%s\" already exists", AS->id);
346
347   /* search the routing model */
348   switch(AS->routing){
349     case A_surfxml_AS_routing_Cluster:       model = &routing_models[SURF_MODEL_CLUSTER];break;
350     case A_surfxml_AS_routing_Dijkstra:      model = &routing_models[SURF_MODEL_DIJKSTRA];break;
351     case A_surfxml_AS_routing_DijkstraCache: model = &routing_models[SURF_MODEL_DIJKSTRACACHE];break;
352     case A_surfxml_AS_routing_Floyd:         model = &routing_models[SURF_MODEL_FLOYD];break;
353     case A_surfxml_AS_routing_Full:          model = &routing_models[SURF_MODEL_FULL];break;
354     case A_surfxml_AS_routing_None:          model = &routing_models[SURF_MODEL_NONE];break;
355     case A_surfxml_AS_routing_RuleBased:     model = &routing_models[SURF_MODEL_RULEBASED];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   new_as = (AS_t) model->create();
363   new_as->model_desc = model;
364   new_as->hierarchy = SURF_ROUTING_NULL;
365   new_as->name = xbt_strdup(AS->id);
366
367   sg_routing_edge_t info = NULL;
368   info = xbt_new0(s_network_element_t, 1);
369
370   if (current_routing == NULL && routing_platf->root == NULL) {
371
372     /* it is the first one */
373     new_as->routing_father = NULL;
374     routing_platf->root = new_as;
375     info->id = -1;
376   } else if (current_routing != NULL && routing_platf->root != NULL) {
377
378     xbt_assert(!xbt_dict_get_or_null
379                (current_routing->routing_sons, AS->id),
380                "The AS \"%s\" already exists", AS->id);
381     /* it is a part of the tree */
382     new_as->routing_father = current_routing;
383     /* set the father behavior */
384     if (current_routing->hierarchy == SURF_ROUTING_NULL)
385       current_routing->hierarchy = SURF_ROUTING_RECURSIVE;
386     /* add to the sons dictionary */
387     xbt_dict_set(current_routing->routing_sons, AS->id,
388                  (void *) new_as, NULL);
389     /* add to the father element list */
390     info->id = current_routing->parse_AS(current_routing, (void *) info);
391   } else {
392     THROWF(arg_error, 0, "All defined components must be belong to a AS");
393   }
394
395   info->rc_component = new_as->routing_father;
396   info->rc_type = SURF_NETWORK_ELEMENT_AS;
397   info->name = new_as->name;
398
399   xbt_lib_set(as_router_lib, info->name, ROUTING_ASR_LEVEL,
400               (void *) info);
401   XBT_DEBUG("Having set name '%s' id '%d'",new_as->name,info->id);
402
403   /* set the new current component of the tree */
404   current_routing = new_as;
405   current_routing->net_elem = 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->model_desc->end)
427       current_routing->model_desc->end(current_routing);
428     current_routing = current_routing->routing_father;
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   AS_t src_as, dst_as;
451   AS_t path_src[ELEMENTS_FATHER_MAXDEPTH];
452   AS_t path_dst[ELEMENTS_FATHER_MAXDEPTH];
453   int index_src = 0;
454   int index_dst = 0;
455   AS_t current;
456   AS_t current_src;
457   AS_t current_dst;
458   AS_t 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->rc_component;
464   dst_as = dst_data->rc_component;
465 #ifndef NDEBUG
466   char* src_name = src_data->name;
467   char* dst_name = dst_data->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->routing_father) {
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->routing_father) {
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(sg_routing_edge_t src, sg_routing_edge_t 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_DEBUG("Solve route/latency  \"%s\" to \"%s\"", src->name, dst->name);
525   xbt_assert(src && dst, "bad parameters for \"_get_route_latency\" method");
526
527   /* Find how src and dst are interconnected */
528   AS_t 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->name,src_father->name,dst_father->name);
532
533   /* Check whether a direct bypass is defined */
534   sg_platf_route_cbarg_t e_route_bypass = NULL;
535   if (common_father->get_bypass_route)
536     e_route_bypass = common_father->get_bypass_route(common_father, src, dst, latency);
537
538   /* Common ancestor is kind enough to declare a bypass route from src to dst -- use it and bail out */
539   if (e_route_bypass) {
540     xbt_dynar_merge(links, &e_route_bypass->link_list);
541     generic_free_route(e_route_bypass);
542     return;
543   }
544
545   /* If src and dst are in the same AS, life is good */
546   if (src_father == dst_father) {       /* SURF_ROUTING_BASE */
547     route.link_list = *links;
548     common_father->get_route_and_latency(common_father, src, dst, &route,latency);
549     // if vivaldi latency+=vivaldi(src,dst)
550     return;
551   }
552
553   /* Not in the same AS, no bypass. We'll have to find our path between the ASes recursively*/
554
555   route.link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
556   // Find the net_card corresponding to father
557   sg_routing_edge_t src_father_net_elm = src_father->net_elem;
558   sg_routing_edge_t dst_father_net_elm = dst_father->net_elem;
559
560   common_father->get_route_and_latency(common_father,
561                                        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->name, dst->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 /**
583  * \brief Find a route between hosts
584  *
585  * \param src the network_element_t for src host
586  * \param dst the network_element_t for dst host
587  * \param route where to store the list of links.
588  *              If *route=NULL, create a short lived dynar. Else, fill the provided dynar
589  * \param latency where to store the latency experienced on the path (or NULL if not interested)
590  *                It is the caller responsability to initialize latency to 0 (we add to provided route)
591  * \pre route!=NULL
592  *
593  * walk through the routing components tree and find a route between hosts
594  * by calling the differents "get_route" functions in each routing component.
595  */
596 void routing_get_route_and_latency(sg_routing_edge_t src,
597                                    sg_routing_edge_t dst,
598                                    xbt_dynar_t * route, double *latency)
599 {
600   XBT_DEBUG("routing_get_route_and_latency from %s to %s",src->name,dst->name);
601   if (!*route) {
602     xbt_dynar_reset(routing_platf->last_route);
603     *route = routing_platf->last_route;
604   }
605
606   _get_route_and_latency(src, dst, route, latency);
607
608   xbt_assert(!latency || *latency >= 0.0,
609              "negative latency on route between \"%s\" and \"%s\"", src->name, dst->name);
610 }
611
612 static xbt_dynar_t recursive_get_onelink_routes(AS_t rc)
613 {
614   xbt_dynar_t ret = xbt_dynar_new(sizeof(onelink_t), xbt_free);
615
616   //adding my one link routes
617   xbt_dynar_t onelink_mine = rc->get_onelink_routes(rc);
618   if (onelink_mine)
619     xbt_dynar_merge(&ret,&onelink_mine);
620
621   //recursing
622   char *key;
623   xbt_dict_cursor_t cursor = NULL;
624   AS_t rc_child;
625   xbt_dict_foreach(rc->routing_sons, cursor, key, rc_child) {
626     xbt_dynar_t onelink_child = recursive_get_onelink_routes(rc_child);
627     if (onelink_child)
628       xbt_dynar_merge(&ret,&onelink_child);
629   }
630   return ret;
631 }
632
633 static xbt_dynar_t get_onelink_routes(void)
634 {
635   return recursive_get_onelink_routes(routing_platf->root);
636 }
637
638 e_surf_network_element_type_t routing_get_network_element_type(const char *name)
639 {
640   sg_routing_edge_t rc = sg_routing_edge_by_name_or_null(name);
641   if (rc)
642     return rc->rc_type;
643
644   return SURF_NETWORK_ELEMENT_NULL;
645 }
646
647 /**
648  * \brief Generic method: create the global routing schema
649  * 
650  * Make a global routing structure and set all the parsing functions.
651  */
652 void routing_model_create( void *loopback)
653 {
654   /* config the uniq global routing */
655   routing_platf = xbt_new0(s_routing_platf_t, 1);
656   routing_platf->root = NULL;
657   routing_platf->get_onelink_routes = get_onelink_routes;
658   routing_platf->loopback = loopback;
659   routing_platf->last_route = xbt_dynar_new(sizeof(sg_routing_link_t),NULL);
660   /* no current routing at moment */
661   current_routing = NULL;
662 }
663
664
665 /* ************************************************** */
666 /* ********** PATERN FOR NEW ROUTING **************** */
667
668 /* The minimal configuration of a new routing model need the next functions,
669  * also you need to set at the start of the file, the new model in the model
670  * list. Remember keep the null ending of the list.
671  */
672 /*** Routing model structure ***/
673 // typedef struct {
674 //   s_routing_component_t generic_routing;
675 //   /* things that your routing model need */
676 // } s_routing_component_NEW_t,*routing_component_NEW_t;
677
678 /*** Parse routing model functions ***/
679 // static void model_NEW_set_processing_unit(routing_component_t rc, const char* name) {}
680 // static void model_NEW_set_autonomous_system(routing_component_t rc, const char* name) {}
681 // static void model_NEW_set_route(routing_component_t rc, const char* src, const char* dst, route_t route) {}
682 // static void model_NEW_set_ASroute(routing_component_t rc, const char* src, const char* dst, route_extended_t route) {}
683 // static void model_NEW_set_bypassroute(routing_component_t rc, const char* src, const char* dst, route_extended_t e_route) {}
684
685 /*** Business methods ***/
686 // static route_extended_t NEW_get_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
687 // static route_extended_t NEW_get_bypass_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
688 // static void NEW_finalize(routing_component_t rc) { xbt_free(rc);}
689
690 /*** Creation routing model functions ***/
691 // static void* model_NEW_create(void) {
692 //   routing_component_NEW_t new_component =  xbt_new0(s_routing_component_NEW_t,1);
693 //   new_component->generic_routing.set_processing_unit = model_NEW_set_processing_unit;
694 //   new_component->generic_routing.set_autonomous_system = model_NEW_set_autonomous_system;
695 //   new_component->generic_routing.set_route = model_NEW_set_route;
696 //   new_component->generic_routing.set_ASroute = model_NEW_set_ASroute;
697 //   new_component->generic_routing.set_bypassroute = model_NEW_set_bypassroute;
698 //   new_component->generic_routing.get_route = NEW_get_route;
699 //   new_component->generic_routing.get_bypass_route = NEW_get_bypass_route;
700 //   new_component->generic_routing.finalize = NEW_finalize;
701 //   /* initialization of internal structures */
702 //   return new_component;
703 // } /* mandatory */
704 // static void  model_NEW_load(void) {}   /* mandatory */
705 // static void  model_NEW_unload(void) {} /* mandatory */
706 // static void  model_NEW_end(void) {}    /* mandatory */
707
708 /* ************************************************************************** */
709 /* ************************* GENERIC PARSE FUNCTIONS ************************ */
710
711 void routing_cluster_add_backbone(void* bb) {
712   xbt_assert(current_routing->model_desc == &routing_models[SURF_MODEL_CLUSTER],
713         "You have to be in model Cluster to use tag backbone!");
714   xbt_assert(!((as_cluster_t)current_routing)->backbone,"The backbone link is already defined!");
715   ((as_cluster_t)current_routing)->backbone = bb;
716   XBT_DEBUG("Add a backbone to AS '%s'",current_routing->name);
717 }
718
719 static void routing_parse_cabinet(sg_platf_cabinet_cbarg_t cabinet)
720 {
721   int start, end, i;
722   char *groups , *host_id , *link_id = NULL;
723   unsigned int iter;
724   xbt_dynar_t radical_elements;
725   xbt_dynar_t radical_ends;
726
727   //Make all hosts
728   radical_elements = xbt_str_split(cabinet->radical, ",");
729   xbt_dynar_foreach(radical_elements, iter, groups) {
730
731     radical_ends = xbt_str_split(groups, "-");
732     start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
733
734     switch (xbt_dynar_length(radical_ends)) {
735     case 1:
736       end = start;
737       break;
738     case 2:
739       end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
740       break;
741     default:
742       surf_parse_error("Malformed radical");
743       break;
744     }
745     s_sg_platf_host_cbarg_t host;
746     memset(&host, 0, sizeof(host));
747     host.initial_state = SURF_RESOURCE_ON;
748     host.power_peak = cabinet->power;
749     host.power_scale = 1.0;
750     host.core_amount = 1;
751
752     s_sg_platf_link_cbarg_t link;
753     memset(&link, 0, sizeof(link));
754     link.state = SURF_RESOURCE_ON;
755     link.policy = SURF_LINK_FULLDUPLEX;
756     link.latency = cabinet->lat;
757     link.bandwidth = cabinet->bw;
758
759     s_sg_platf_host_link_cbarg_t host_link;
760     memset(&host_link, 0, sizeof(host_link));
761
762     for (i = start; i <= end; i++) {
763       host_id = bprintf("%s%d%s",cabinet->prefix,i,cabinet->suffix);
764       link_id = bprintf("link_%s%d%s",cabinet->prefix,i,cabinet->suffix);
765       host.id = host_id;
766       link.id = link_id;
767       sg_platf_new_host(&host);
768       sg_platf_new_link(&link);
769
770       char* link_up = bprintf("%s_UP",link_id);
771       char* link_down = bprintf("%s_DOWN",link_id);
772       host_link.id = host_id;
773       host_link.link_up = link_up;
774       host_link.link_down= link_down;
775       sg_platf_new_host_link(&host_link);
776
777       free(host_id);
778       free(link_id);
779       free(link_up);
780       free(link_down);
781     }
782
783     xbt_dynar_free(&radical_ends);
784   }
785   xbt_dynar_free(&radical_elements);
786 }
787
788 static void routing_parse_cluster(sg_platf_cluster_cbarg_t cluster)
789 {
790   char *host_id, *groups, *link_id = NULL;
791   xbt_dict_t patterns = NULL;
792
793   s_sg_platf_host_cbarg_t host;
794   s_sg_platf_link_cbarg_t link;
795
796   unsigned int iter;
797   int start, end, i;
798   xbt_dynar_t radical_elements;
799   xbt_dynar_t radical_ends;
800
801   if ((cluster->availability_trace && strcmp(cluster->availability_trace, ""))
802       || (cluster->state_trace && strcmp(cluster->state_trace, ""))) {
803     patterns = xbt_dict_new_homogeneous(xbt_free_f);
804     xbt_dict_set(patterns, "id", xbt_strdup(cluster->id), NULL);
805     xbt_dict_set(patterns, "prefix", xbt_strdup(cluster->prefix), NULL);
806     xbt_dict_set(patterns, "suffix", xbt_strdup(cluster->suffix), NULL);
807   }
808
809   XBT_DEBUG("<AS id=\"%s\"\trouting=\"Cluster\">", cluster->id);
810   s_sg_platf_AS_cbarg_t AS = SG_PLATF_AS_INITIALIZER;
811   AS.id = cluster->id;
812   AS.routing = A_surfxml_AS_routing_Cluster;
813   sg_platf_new_AS_begin(&AS);
814
815   current_routing->link_up_down_list
816             = xbt_dynar_new(sizeof(s_surf_parsing_link_up_down_t),NULL);
817
818   //Make all hosts
819   radical_elements = xbt_str_split(cluster->radical, ",");
820   xbt_dynar_foreach(radical_elements, iter, groups) {
821
822     radical_ends = xbt_str_split(groups, "-");
823     start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
824
825     switch (xbt_dynar_length(radical_ends)) {
826     case 1:
827       end = start;
828       break;
829     case 2:
830       end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
831       break;
832     default:
833       surf_parse_error("Malformed radical");
834       break;
835     }
836     for (i = start; i <= end; i++) {
837       host_id =
838           bprintf("%s%d%s", cluster->prefix, i, cluster->suffix);
839       link_id = bprintf("%s_link_%d", cluster->id, i);
840
841       XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\">", host_id, cluster->power);
842
843       memset(&host, 0, sizeof(host));
844       host.id = host_id;
845       if (cluster->availability_trace && strcmp(cluster->availability_trace, "")) {
846         xbt_dict_set(patterns, "radical", bprintf("%d", i), NULL);
847         char *avail_file = xbt_str_varsubst(cluster->availability_trace, patterns);
848         XBT_DEBUG("\tavailability_file=\"%s\"", avail_file);
849         host.power_trace = tmgr_trace_new_from_file(avail_file);
850         xbt_free(avail_file);
851       } else {
852         XBT_DEBUG("\tavailability_file=\"\"");
853       }
854
855       if (cluster->state_trace && strcmp(cluster->state_trace, "")) {
856         char *avail_file = xbt_str_varsubst(cluster->state_trace, patterns);
857         XBT_DEBUG("\tstate_file=\"%s\"", avail_file);
858         host.state_trace = tmgr_trace_new_from_file(avail_file);
859         xbt_free(avail_file);
860       } else {
861         XBT_DEBUG("\tstate_file=\"\"");
862       }
863
864       host.power_peak = cluster->power;
865       host.power_scale = 1.0;
866       host.core_amount = cluster->core_amount;
867       host.initial_state = SURF_RESOURCE_ON;
868       host.coord = "";
869       sg_platf_new_host(&host);
870       XBT_DEBUG("</host>");
871
872       XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_id,
873                 cluster->bw, cluster->lat);
874
875       memset(&link, 0, sizeof(link));
876       link.id = link_id;
877       link.bandwidth = cluster->bw;
878       link.latency = cluster->lat;
879       link.state = SURF_RESOURCE_ON;
880       link.policy = cluster->sharing_policy;
881       sg_platf_new_link(&link);
882
883       s_surf_parsing_link_up_down_t info;
884
885       if (link.policy == SURF_LINK_FULLDUPLEX) {
886         char *tmp_link = bprintf("%s_UP", link_id);
887         info.link_up =
888             xbt_lib_get_or_null(link_lib, tmp_link, SURF_LINK_LEVEL);
889         free(tmp_link);
890         tmp_link = bprintf("%s_DOWN", link_id);
891         info.link_down =
892             xbt_lib_get_or_null(link_lib, tmp_link, SURF_LINK_LEVEL);
893         free(tmp_link);
894       } else {
895         info.link_up = xbt_lib_get_or_null(link_lib, link_id, SURF_LINK_LEVEL);
896         info.link_down = info.link_up;
897       }
898       xbt_dynar_push(current_routing->link_up_down_list,&info);
899       xbt_free(link_id);
900       xbt_free(host_id);
901     }
902
903     xbt_dynar_free(&radical_ends);
904   }
905   xbt_dynar_free(&radical_elements);
906
907   // Add a router. It is magically used thanks to the way in which surf_routing_cluster is written,
908   // and it's very useful to connect clusters together
909   XBT_DEBUG(" ");
910   XBT_DEBUG("<router id=\"%s\"/>", cluster->router_id);
911   char *newid = NULL;
912   s_sg_platf_router_cbarg_t router;
913   memset(&router, 0, sizeof(router));
914   router.id = cluster->router_id;
915   router.coord = "";
916   if (!router.id || !strcmp(router.id, ""))
917     router.id = newid =
918         bprintf("%s%s_router%s", cluster->prefix, cluster->id,
919                 cluster->suffix);
920   sg_platf_new_router(&router);
921   free(newid);
922
923   //Make the backbone
924   if ((cluster->bb_bw != 0) && (cluster->bb_lat != 0)) {
925     char *link_backbone = bprintf("%s_backbone", cluster->id);
926     XBT_DEBUG("<link\tid=\"%s\" bw=\"%f\" lat=\"%f\"/>", link_backbone,
927               cluster->bb_bw, cluster->bb_lat);
928
929     memset(&link, 0, sizeof(link));
930     link.id = link_backbone;
931     link.bandwidth = cluster->bb_bw;
932     link.latency = cluster->bb_lat;
933     link.state = SURF_RESOURCE_ON;
934     link.policy = cluster->bb_sharing_policy;
935
936     sg_platf_new_link(&link);
937
938     routing_cluster_add_backbone(xbt_lib_get_or_null(link_lib, link_backbone, SURF_LINK_LEVEL));
939
940     free(link_backbone);
941   }
942
943   XBT_DEBUG("</AS>");
944   sg_platf_new_AS_end();
945   XBT_DEBUG(" ");
946   xbt_dict_free(&patterns); // no op if it were never set
947 }
948
949 static void routing_parse_postparse(void) {
950   xbt_dict_free(&random_value);
951 }
952
953 static void routing_parse_peer(sg_platf_peer_cbarg_t peer)
954 {
955   char *host_id = NULL;
956   char *link_id;
957
958   XBT_DEBUG(" ");
959   host_id = HOST_PEER(peer->id);
960   link_id = LINK_PEER(peer->id);
961
962   XBT_DEBUG("<host\tid=\"%s\"\tpower=\"%f\"/>", host_id, peer->power);
963   s_sg_platf_host_cbarg_t host;
964   memset(&host, 0, sizeof(host));
965   host.initial_state = SURF_RESOURCE_ON;
966   host.id = host_id;
967   host.power_peak = peer->power;
968   host.power_scale = 1.0;
969   host.power_trace = peer->availability_trace;
970   host.state_trace = peer->state_trace;
971   host.core_amount = 1;
972   host.coord = peer->coord;
973   sg_platf_new_host(&host);
974
975   s_sg_platf_link_cbarg_t link;
976   memset(&link, 0, sizeof(link));
977   link.state = SURF_RESOURCE_ON;
978   link.policy = SURF_LINK_SHARED;
979   link.latency = peer->lat;
980
981   char* link_up = bprintf("%s_UP",link_id);
982   XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_up,
983             peer->bw_out, peer->lat);
984   link.id = link_up;
985   link.bandwidth = peer->bw_out;
986   sg_platf_new_link(&link);
987
988   char* link_down = bprintf("%s_DOWN",link_id);
989   XBT_DEBUG("<link\tid=\"%s\"\tbw=\"%f\"\tlat=\"%f\"/>", link_down,
990             peer->bw_in, peer->lat);
991   link.id = link_down;
992   link.bandwidth = peer->bw_in;
993   sg_platf_new_link(&link);
994
995   XBT_DEBUG("<host_link\tid=\"%s\"\tup=\"%s\"\tdown=\"%s\" />", host_id,link_up,link_down);
996   s_sg_platf_host_link_cbarg_t host_link;
997   memset(&host_link, 0, sizeof(host_link));
998   host_link.id = host_id;
999   host_link.link_up = link_up;
1000   host_link.link_down= link_down;
1001   sg_platf_new_host_link(&host_link);
1002
1003   XBT_DEBUG(" ");
1004
1005   //xbt_dynar_free(&tab_elements_num);
1006   free(host_id);
1007   free(link_id);
1008   free(link_up);
1009   free(link_down);
1010 }
1011
1012 static void routing_parse_Srandom(void)
1013 {
1014   double mean, std, min, max, seed;
1015   char *random_id = A_surfxml_random_id;
1016   char *random_radical = A_surfxml_random_radical;
1017   char *rd_name = NULL;
1018   char *rd_value;
1019   mean = surf_parse_get_double(A_surfxml_random_mean);
1020   std = surf_parse_get_double(A_surfxml_random_std_deviation);
1021   min = surf_parse_get_double(A_surfxml_random_min);
1022   max = surf_parse_get_double(A_surfxml_random_max);
1023   seed = surf_parse_get_double(A_surfxml_random_seed);
1024
1025   double res = 0;
1026   int i = 0;
1027   random_data_t random = xbt_new0(s_random_data_t, 1);
1028   char *tmpbuf;
1029
1030   xbt_dynar_t radical_elements;
1031   unsigned int iter;
1032   char *groups;
1033   int start, end;
1034   xbt_dynar_t radical_ends;
1035
1036   switch (A_surfxml_random_generator) {
1037   case AU_surfxml_random_generator:
1038   case A_surfxml_random_generator_NONE:
1039     random->generator = NONE;
1040     break;
1041   case A_surfxml_random_generator_DRAND48:
1042     random->generator = DRAND48;
1043     break;
1044   case A_surfxml_random_generator_RAND:
1045     random->generator = RAND;
1046     break;
1047   case A_surfxml_random_generator_RNGSTREAM:
1048     random->generator = RNGSTREAM;
1049     break;
1050   default:
1051     surf_parse_error("Invalid random generator");
1052     break;
1053   }
1054   random->seed = seed;
1055   random->min = min;
1056   random->max = max;
1057
1058   /* Check user stupidities */
1059   if (max < min)
1060     THROWF(arg_error, 0, "random->max < random->min (%f < %f)", max, min);
1061   if (mean < min)
1062     THROWF(arg_error, 0, "random->mean < random->min (%f < %f)", mean, min);
1063   if (mean > max)
1064     THROWF(arg_error, 0, "random->mean > random->max (%f > %f)", mean, max);
1065
1066   /* normalize the mean and standard deviation before storing */
1067   random->mean = (mean - min) / (max - min);
1068   random->std = std / (max - min);
1069
1070   if (random->mean * (1 - random->mean) < random->std * random->std)
1071     THROWF(arg_error, 0, "Invalid mean and standard deviation (%f and %f)",
1072            random->mean, random->std);
1073
1074   XBT_DEBUG
1075       ("id = '%s' min = '%f' max = '%f' mean = '%f' std_deviatinon = '%f' generator = '%d' seed = '%ld' radical = '%s'",
1076        random_id, random->min, random->max, random->mean, random->std,
1077        (int)random->generator, random->seed, random_radical);
1078
1079   if (!random_value)
1080     random_value = xbt_dict_new_homogeneous(free);
1081
1082   if (!strcmp(random_radical, "")) {
1083     res = random_generate(random);
1084     rd_value = bprintf("%f", res);
1085     xbt_dict_set(random_value, random_id, rd_value, NULL);
1086   } else {
1087     radical_elements = xbt_str_split(random_radical, ",");
1088     xbt_dynar_foreach(radical_elements, iter, groups) {
1089       radical_ends = xbt_str_split(groups, "-");
1090       switch (xbt_dynar_length(radical_ends)) {
1091       case 1:
1092         xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1093                    "Custom Random '%s' already exists !", random_id);
1094         res = random_generate(random);
1095         tmpbuf =
1096             bprintf("%s%d", random_id,
1097                     atoi(xbt_dynar_getfirst_as(radical_ends, char *)));
1098         xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1099         xbt_free(tmpbuf);
1100         break;
1101
1102       case 2:
1103         start = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 0, char *));
1104         end = surf_parse_get_int(xbt_dynar_get_as(radical_ends, 1, char *));
1105         for (i = start; i <= end; i++) {
1106           xbt_assert(!xbt_dict_get_or_null(random_value, random_id),
1107                      "Custom Random '%s' already exists !", bprintf("%s%d",
1108                                                                     random_id,
1109                                                                     i));
1110           res = random_generate(random);
1111           tmpbuf = bprintf("%s%d", random_id, i);
1112           xbt_dict_set(random_value, tmpbuf, bprintf("%f", res), NULL);
1113           xbt_free(tmpbuf);
1114         }
1115         break;
1116       default:
1117         XBT_CRITICAL("Malformed radical");
1118         break;
1119       }
1120       res = random_generate(random);
1121       rd_name = bprintf("%s_router", random_id);
1122       rd_value = bprintf("%f", res);
1123       xbt_dict_set(random_value, rd_name, rd_value, NULL);
1124
1125       xbt_dynar_free(&radical_ends);
1126     }
1127     free(rd_name);
1128     xbt_dynar_free(&radical_elements);
1129   }
1130 }
1131
1132 void routing_register_callbacks()
1133 {
1134   sg_platf_host_add_cb(parse_S_host);
1135   sg_platf_router_add_cb(parse_S_router);
1136   sg_platf_host_link_add_cb(parse_S_host_link);
1137   sg_platf_route_add_cb(parse_E_route);
1138   sg_platf_ASroute_add_cb(parse_E_ASroute);
1139   sg_platf_bypassRoute_add_cb(parse_E_bypassRoute);
1140   sg_platf_bypassASroute_add_cb(parse_E_bypassASroute);
1141
1142   sg_platf_cluster_add_cb(routing_parse_cluster);
1143   sg_platf_cabinet_add_cb(routing_parse_cabinet);
1144
1145   sg_platf_peer_add_cb(routing_parse_peer);
1146   sg_platf_postparse_add_cb(routing_parse_postparse);
1147
1148   /* we care about the ASes while parsing the platf. Incredible, isnt it? */
1149   sg_platf_AS_end_add_cb(routing_AS_end);
1150   sg_platf_AS_begin_add_cb(routing_AS_begin);
1151
1152   sg_platf_trace_add_cb(routing_parse_trace);
1153   sg_platf_trace_connect_add_cb(routing_parse_trace_connect);
1154
1155 #ifdef HAVE_TRACING
1156   instr_routing_define_callbacks();
1157 #endif
1158 }
1159
1160 /**
1161  * \brief Recursive function for finalize
1162  *
1163  * \param rc the source host name
1164  *
1165  * This fuction is call by "finalize". It allow to finalize the
1166  * AS or routing components. It delete all the structures.
1167  */
1168 static void finalize_rec(AS_t as) {
1169   xbt_dict_cursor_t cursor = NULL;
1170   char *key;
1171   AS_t elem;
1172
1173   xbt_dict_foreach(as->routing_sons, cursor, key, elem) {
1174     finalize_rec(elem);
1175   }
1176
1177   as->finalize(as);
1178 }
1179
1180 /** \brief Frees all memory allocated by the routing module */
1181 void routing_exit(void) {
1182   if (!routing_platf)
1183     return;
1184   xbt_dynar_free(&routing_platf->last_route);
1185   finalize_rec(routing_platf->root);
1186   xbt_free(routing_platf);
1187 }