Logo AND Algorithmique Numérique Distribuée

Public GIT Repository
Move parse_routes to s_routing_component_t.
[simgrid.git] / src / surf / surf_routing.c
1 /* Copyright (c) 2009, 2010. 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
8
9 #include <float.h>
10 #include "gras_config.h"
11
12 #ifdef HAVE_PCRE_LIB
13 #include <pcre.h>               /* regular expresion library */
14 #endif
15 #include "surf_private.h"
16 #include "xbt/dynar.h"
17 #include "xbt/str.h"
18 #include "xbt/config.h"
19 #include "xbt/graph.h"
20 #include "xbt/set.h"
21
22 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route, surf, "Routing part of surf");
23
24 /* Global vars */
25 routing_global_t global_routing = NULL;
26 routing_component_t current_routing = NULL;
27 model_type_t current_routing_model = NULL;
28
29 /* Prototypes of each model */
30 static void *model_full_create(void);   /* create structures for full routing model */
31 static void model_full_load(void);      /* load parse functions for full routing model */
32 static void model_full_unload(void);    /* unload parse functions for full routing model */
33 static void model_full_end(void);       /* finalize the creation of full routing model */
34
35 static void *model_floyd_create(void);  /* create structures for floyd routing model */
36 static void model_floyd_load(void);     /* load parse functions for floyd routing model */
37 static void model_floyd_unload(void);   /* unload parse functions for floyd routing model */
38 static void model_floyd_end(void);      /* finalize the creation of floyd routing model */
39
40 static void *model_dijkstra_both_create(int cached);    /* create by calling dijkstra or dijkstracache */
41 static void *model_dijkstra_create(void);       /* create structures for dijkstra routing model */
42 static void *model_dijkstracache_create(void);  /* create structures for dijkstracache routing model */
43 static void model_dijkstra_both_load(void);     /* load parse functions for dijkstra routing model */
44 static void model_dijkstra_both_unload(void);   /* unload parse functions for dijkstra routing model */
45 static void model_dijkstra_both_end(void);      /* finalize the creation of dijkstra routing model */
46
47 static void *model_rulebased_create(void);      /* create structures for rulebased routing model */
48 static void model_rulebased_load(void); /* load parse functions for rulebased routing model */
49 static void model_rulebased_unload(void);       /* unload parse functions for rulebased routing model */
50 static void model_rulebased_end(void);  /* finalize the creation of rulebased routing model */
51
52 static void *model_none_create(void);   /* none routing model */
53 static void model_none_load(void);      /* none routing model */
54 static void model_none_unload(void);    /* none routing model */
55 static void model_none_end(void);       /* none routing model */
56
57 static void routing_full_parse_Scluster(void);  /*cluster bypass */
58
59 static void parse_Sconfig(void);        /*config Tag */
60
61 /* this lines are only for replace use like index in the model table */
62 typedef enum {
63   SURF_MODEL_FULL = 0,
64   SURF_MODEL_FLOYD,
65   SURF_MODEL_DIJKSTRA,
66   SURF_MODEL_DIJKSTRACACHE,
67   SURF_MODEL_NONE,
68 #ifdef HAVE_PCRE_LIB
69   SURF_MODEL_RULEBASED
70 #endif
71 } e_routing_types;
72
73
74 /* must be finish with null and carefull if change de order */
75 struct s_model_type routing_models[] = { {"Full",
76                                           "Full routing data (fast, large memory requirements, fully expressive)",
77                                           model_full_create,
78                                           model_full_load,
79                                           model_full_unload,
80                                           model_full_end},
81 {"Floyd",
82  "Floyd routing data (slow initialization, fast lookup, lesser memory requirements, shortest path routing only)",
83  model_floyd_create, model_floyd_load, model_floyd_unload,
84  model_floyd_end},
85 {"Dijkstra",
86  "Dijkstra routing data (fast initialization, slow lookup, small memory requirements, shortest path routing only)",
87  model_dijkstra_create, model_dijkstra_both_load,
88  model_dijkstra_both_unload, model_dijkstra_both_end},
89 {"DijkstraCache",
90  "Dijkstra routing data (fast initialization, fast lookup, small memory requirements, shortest path routing only)",
91  model_dijkstracache_create, model_dijkstra_both_load,
92  model_dijkstra_both_unload, model_dijkstra_both_end},
93 {"none", "No routing (usable with Constant network only)",
94  model_none_create, model_none_load, model_none_unload, model_none_end},
95 #ifdef HAVE_PCRE_LIB
96 {"RuleBased", "Rule-Based routing data (...)", model_rulebased_create,
97  model_rulebased_load, model_rulebased_unload, model_rulebased_end},
98 #endif
99 {NULL, NULL, NULL, NULL, NULL, NULL}
100 };
101
102 /* ************************************************************************** */
103 /* ***************** GENERIC PARSE FUNCTIONS (declarations) ***************** */
104
105 static void generic_set_processing_unit(routing_component_t rc,
106                                         const char *name);
107 static void generic_set_autonomous_system(routing_component_t rc,
108                                           const char *name);
109 static void generic_set_route(routing_component_t rc, const char *src,
110                               const char *dst, route_t route);
111 static void generic_set_ASroute(routing_component_t rc, const char *src,
112                                 const char *dst, route_extended_t e_route);
113 static void generic_set_bypassroute(routing_component_t rc,
114                                     const char *src, const char *dst,
115                                     route_extended_t e_route);
116
117 /* ************************************************************************** */
118 /* *************** GENERIC BUSINESS METHODS (declarations) ****************** */
119
120 static xbt_dynar_t generic_get_onelink_routes(routing_component_t rc);
121 static route_extended_t generic_get_bypassroute(routing_component_t rc,
122                                                 const char *src,
123                                                 const char *dst);
124
125 /* ************************************************************************** */
126 /* ****************** GENERIC AUX FUNCTIONS (declarations) ****************** */
127
128 static route_extended_t
129 generic_new_extended_route(e_surf_routing_hierarchy_t hierarchy,
130                            void *data, int order);
131 static void generic_free_route(route_t route);
132 static void generic_free_extended_route(route_extended_t e_route);
133 static routing_component_t
134 generic_autonomous_system_exist(routing_component_t rc, char *element);
135 static routing_component_t
136 generic_processing_units_exist(routing_component_t rc, char *element);
137 static void generic_src_dst_check(routing_component_t rc, const char *src,
138                                   const char *dst);
139
140 /* ************************************************************************** */
141 /* **************************** GLOBAL FUNCTIONS **************************** */
142
143 /* global parse functions */
144 static char *src = NULL;        /* temporary store the source name of a route */
145 static char *dst = NULL;        /* temporary store the destination name of a route */
146 static char *gw_src = NULL;     /* temporary store the gateway source name of a route */
147 static char *gw_dst = NULL;     /* temporary store the gateway destination name of a route */
148 static xbt_dynar_t link_list = NULL;    /* temporary store of current list link of a route */
149
150 /**
151  * \brief Add a "host" to the network element list
152  */
153 static void parse_S_host(char *host_id)
154 {
155   network_element_info_t info = NULL;
156   if (current_routing->hierarchy == SURF_ROUTING_NULL)
157     current_routing->hierarchy = SURF_ROUTING_BASE;
158   xbt_assert1(!xbt_dict_get_or_null
159               (global_routing->where_network_elements, host_id),
160               "Reading a host, processing unit \"%s\" already exist",
161               host_id);
162   xbt_assert1(current_routing->set_processing_unit,
163               "no defined method \"set_processing_unit\" in \"%s\"",
164               current_routing->name);
165   (*(current_routing->set_processing_unit)) (current_routing, host_id);
166   info = xbt_new0(s_network_element_info_t, 1);
167   info->rc_component = current_routing;
168   info->rc_type = SURF_NETWORK_ELEMENT_HOST;
169   xbt_dict_set(global_routing->where_network_elements, host_id,
170                (void *) info, NULL);
171 }
172
173 /*
174  * \brief Add a host to the network element list from XML
175  */
176 static void parse_S_host_XML(void)
177 {
178   parse_S_host(A_surfxml_host_id);
179 }
180
181 /*
182  * \brief Add a host to the network element list from lua script
183  */
184 static void parse_S_host_lua(char *host_id)
185 {
186   parse_S_host(host_id);
187 }
188
189 /*
190  *
191  */
192
193 /**
194  * \brief Add a "router" to the network element list
195  */
196 static void parse_S_router(void)
197 {
198   network_element_info_t info = NULL;
199
200   if (current_routing->hierarchy == SURF_ROUTING_NULL)
201     current_routing->hierarchy = SURF_ROUTING_BASE;
202   xbt_assert1(!xbt_dict_get_or_null
203               (global_routing->where_network_elements,
204                A_surfxml_router_id),
205               "Reading a router, processing unit \"%s\" already exist",
206               A_surfxml_router_id);
207   xbt_assert1(current_routing->set_processing_unit,
208               "no defined method \"set_processing_unit\" in \"%s\"",
209               current_routing->name);
210   (*(current_routing->set_processing_unit)) (current_routing,
211                                              A_surfxml_router_id);
212   info = xbt_new0(s_network_element_info_t, 1);
213   info->rc_component = current_routing;
214   info->rc_type = SURF_NETWORK_ELEMENT_ROUTER;
215   xbt_dict_set(global_routing->where_network_elements, A_surfxml_router_id,
216                (void *) info, NULL);
217 #ifdef HAVE_TRACING
218   TRACE_surf_host_declaration(A_surfxml_router_id, 0);
219 #endif
220 }
221
222 /**
223  * \brief Set the endponints for a route
224  */
225 static void parse_S_route_new_and_endpoints(char *src_id, char *dst_id)
226 {
227   if (src != NULL && dst != NULL && link_list != NULL)
228     THROW2(arg_error, 0, "Route between %s to %s can not be defined",
229            src_id, dst_id);
230   src = src_id;
231   dst = dst_id;
232   xbt_assert2(strlen(src) > 0 || strlen(dst) > 0,
233               "Some limits are null in the route between \"%s\" and \"%s\"",
234               src, dst);
235   link_list = xbt_dynar_new(sizeof(char *), &xbt_free_ref);
236 }
237
238 /**
239  * \breif Set the endpoints for a route from XML
240  */
241 static void parse_S_route_new_and_endpoints_XML(void)
242 {
243   parse_S_route_new_and_endpoints(A_surfxml_route_src,
244                                   A_surfxml_route_dst);
245 }
246
247 /**
248  * \breif Set the endpoints for a route from lua
249  */
250 static void parse_S_route_new_and_endpoints_lua(char *id_src, char *id_dst)
251 {
252   parse_S_route_new_and_endpoints(id_src, id_dst);
253 }
254
255 /**
256  * \brief Set the endponints and gateways for a ASroute
257  */
258 static void parse_S_ASroute_new_and_endpoints(void)
259 {
260   if (src != NULL && dst != NULL && link_list != NULL)
261     THROW2(arg_error, 0, "Route between %s to %s can not be defined",
262            A_surfxml_ASroute_src, A_surfxml_ASroute_dst);
263   src = A_surfxml_ASroute_src;
264   dst = A_surfxml_ASroute_dst;
265   gw_src = A_surfxml_ASroute_gw_src;
266   gw_dst = A_surfxml_ASroute_gw_dst;
267   xbt_assert2(strlen(src) > 0 || strlen(dst) > 0 || strlen(gw_src) > 0
268               || strlen(gw_dst) > 0,
269               "Some limits are null in the route between \"%s\" and \"%s\"",
270               src, dst);
271   link_list = xbt_dynar_new(sizeof(char *), &xbt_free_ref);
272 }
273
274 /**
275  * \brief Set the endponints for a bypassRoute
276  */
277 static void parse_S_bypassRoute_new_and_endpoints(void)
278 {
279   if (src != NULL && dst != NULL && link_list != NULL)
280     THROW2(arg_error, 0,
281            "Bypass Route between %s to %s can not be defined",
282            A_surfxml_bypassRoute_src, A_surfxml_bypassRoute_dst);
283   src = A_surfxml_bypassRoute_src;
284   dst = A_surfxml_bypassRoute_dst;
285   gw_src = A_surfxml_bypassRoute_gw_src;
286   gw_dst = A_surfxml_bypassRoute_gw_dst;
287   xbt_assert2(strlen(src) > 0 || strlen(dst) > 0 || strlen(gw_src) > 0
288               || strlen(gw_dst) > 0,
289               "Some limits are null in the route between \"%s\" and \"%s\"",
290               src, dst);
291   link_list = xbt_dynar_new(sizeof(char *), &xbt_free_ref);
292 }
293
294 /**
295  * \brief Set a new link on the actual list of link for a route or ASroute
296  */
297 static void parse_E_link_ctn_new_elem(char *link_id)
298 {
299   char *val;
300   val = xbt_strdup(link_id);
301   xbt_dynar_push(link_list, &val);
302 }
303
304 /**
305  * \brief Set a new link on the actual list of link for a route or ASroute from XML
306  */
307
308 static void parse_E_link_ctn_new_elem_XML(void)
309 {
310   parse_E_link_ctn_new_elem(A_surfxml_link_ctn_id);
311 }
312
313 /**
314  * \brief Set a new link on the actual list of link for a route or ASroute from lua
315  */
316 static void parse_E_link_c_ctn_new_elem_lua(char *link_id)
317 {
318
319   parse_E_link_ctn_new_elem(link_id);
320 }
321
322 /**
323  * \brief Store the route by calling the set_route function of the current routing component
324  */
325 static void parse_E_route_store_route(void)
326 {
327   route_t route = xbt_new0(s_route_t, 1);
328   route->link_list = link_list;
329 //   xbt_assert1(generic_processing_units_exist(current_routing,src),"the \"%s\" processing units gateway does not exist",src);
330 //   xbt_assert1(generic_processing_units_exist(current_routing,dst),"the \"%s\" processing units gateway does not exist",dst);
331   xbt_assert1(current_routing->set_route,
332               "no defined method \"set_route\" in \"%s\"",
333               current_routing->name);
334   (*(current_routing->set_route)) (current_routing, src, dst, route);
335   link_list = NULL;
336   src = NULL;
337   dst = NULL;
338 }
339
340 /**
341  * \brief Store the ASroute by calling the set_ASroute function of the current routing component
342  */
343 static void parse_E_ASroute_store_route(void)
344 {
345   route_extended_t e_route = xbt_new0(s_route_extended_t, 1);
346   e_route->generic_route.link_list = link_list;
347   e_route->src_gateway = xbt_strdup(gw_src);
348   e_route->dst_gateway = xbt_strdup(gw_dst);
349 //   xbt_assert1(generic_autonomous_system_exist(current_routing,src),"the \"%s\" autonomous system does not exist",src);
350 //   xbt_assert1(generic_autonomous_system_exist(current_routing,dst),"the \"%s\" autonomous system does not exist",dst);
351 //   xbt_assert1(generic_processing_units_exist(current_routing,gw_src),"the \"%s\" processing units gateway does not exist",gw_src);
352 //   xbt_assert1(generic_processing_units_exist(current_routing,gw_dst),"the \"%s\" processing units gateway does not exist",gw_dst);
353   xbt_assert1(current_routing->set_ASroute,
354               "no defined method \"set_ASroute\" in \"%s\"",
355               current_routing->name);
356   (*(current_routing->set_ASroute)) (current_routing, src, dst, e_route);
357   link_list = NULL;
358   src = NULL;
359   dst = NULL;
360   gw_src = NULL;
361   gw_dst = NULL;
362 }
363
364 /**
365  * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
366  */
367 static void parse_E_bypassRoute_store_route(void)
368 {
369   route_extended_t e_route = xbt_new0(s_route_extended_t, 1);
370   e_route->generic_route.link_list = link_list;
371   e_route->src_gateway = xbt_strdup(gw_src);
372   e_route->dst_gateway = xbt_strdup(gw_dst);
373 //   xbt_assert1(generic_autonomous_system_exist(current_routing,src),"the \"%s\" autonomous system does not exist",src);
374 //   xbt_assert1(generic_autonomous_system_exist(current_routing,dst),"the \"%s\" autonomous system does not exist",dst);
375 //   xbt_assert1(generic_processing_units_exist(current_routing,gw_src),"the \"%s\" processing units gateway does not exist",gw_src);
376 //   xbt_assert1(generic_processing_units_exist(current_routing,gw_dst),"the \"%s\" processing units gateway does not exist",gw_dst);
377   xbt_assert1(current_routing->set_bypassroute,
378               "no defined method \"set_bypassroute\" in \"%s\"",
379               current_routing->name);
380   (*(current_routing->set_bypassroute)) (current_routing, src, dst,
381                                          e_route);
382   link_list = NULL;
383   src = NULL;
384   dst = NULL;
385   gw_src = NULL;
386   gw_dst = NULL;
387 }
388
389 /**
390  * \brief Make a new routing component
391  *
392  * make the new structure and
393  * set the parsing functions to allows parsing the part of the routing tree
394  */
395 static void parse_S_AS(char *AS_id, char *AS_routing)
396 {
397   routing_component_t new_routing;
398   model_type_t model = NULL;
399   char *wanted = AS_routing;
400   int cpt;
401   /* seach the routing model */
402   for (cpt = 0; routing_models[cpt].name; cpt++)
403     if (!strcmp(wanted, routing_models[cpt].name))
404       model = &routing_models[cpt];
405   /* if its not exist, error */
406   if (model == NULL) {
407     fprintf(stderr, "Routing model %s not found. Existing models:\n",
408             wanted);
409     for (cpt = 0; routing_models[cpt].name; cpt++)
410       if (!strcmp(wanted, routing_models[cpt].name))
411         fprintf(stderr, "   %s: %s\n", routing_models[cpt].name,
412                 routing_models[cpt].desc);
413     xbt_die(NULL);
414   }
415
416   /* make a new routing component */
417   new_routing = (routing_component_t) (*(model->create)) ();
418   new_routing->routing = model;
419   new_routing->hierarchy = SURF_ROUTING_NULL;
420   new_routing->name = xbt_strdup(AS_id);
421   new_routing->routing_sons = xbt_dict_new();
422   //INFO2("Routing %s for AS %s",A_surfxml_AS_routing,A_surfxml_AS_id);
423
424   if (current_routing == NULL && global_routing->root == NULL) {
425
426     /* it is the first one */
427     new_routing->routing_father = NULL;
428     global_routing->root = new_routing;
429
430   } else if (current_routing != NULL && global_routing->root != NULL) {
431
432     xbt_assert1(!xbt_dict_get_or_null
433                 (current_routing->routing_sons, AS_id),
434                 "The AS \"%s\" already exist", AS_id);
435     /* it is a part of the tree */
436     new_routing->routing_father = current_routing;
437     /* set the father behavior */
438     if (current_routing->hierarchy == SURF_ROUTING_NULL)
439       current_routing->hierarchy = SURF_ROUTING_RECURSIVE;
440     /* add to the sons dictionary */
441     xbt_dict_set(current_routing->routing_sons, AS_id,
442                  (void *) new_routing, NULL);
443     /* add to the father element list */
444     (*(current_routing->set_autonomous_system)) (current_routing, AS_id);
445     /* unload the prev parse rules */
446     (*(current_routing->routing->unload)) ();
447
448   } else {
449     THROW0(arg_error, 0, "All defined components must be belong to a AS");
450   }
451   /* set the new parse rules */
452   (*(new_routing->routing->load)) ();
453   /* set the new current component of the tree */
454   current_routing = new_routing;
455 }
456
457 /*
458  * Detect the routing model type of the routing component from XML platforms
459  */
460 static void parse_S_AS_XML(void)
461 {
462   parse_S_AS(A_surfxml_AS_id, A_surfxml_AS_routing);
463 }
464
465 /*
466  * define the routing model type of routing component from lua script
467  */
468 static void parse_S_AS_lua(char *id, char *mode)
469 {
470   parse_S_AS(id, mode);
471 }
472
473
474 /**
475  * \brief Finish the creation of a new routing component
476  *
477  * When you finish to read the routing component, other structures must be created. 
478  * the "end" method allow to do that for any routing model type
479  */
480 static void parse_E_AS(char *AS_id)
481 {
482
483   if (current_routing == NULL) {
484     THROW1(arg_error, 0, "Close AS(%s), that never open", AS_id);
485   } else {
486     network_element_info_t info = NULL;
487     xbt_assert1(!xbt_dict_get_or_null
488                 (global_routing->where_network_elements,
489                  current_routing->name), "The AS \"%s\" already exist",
490                 current_routing->name);
491     info = xbt_new0(s_network_element_info_t, 1);
492     info->rc_component = current_routing->routing_father;
493     info->rc_type = SURF_NETWORK_ELEMENT_AS;
494     xbt_dict_set(global_routing->where_network_elements,
495                  current_routing->name, info, NULL);
496     (*(current_routing->routing->unload)) ();
497     (*(current_routing->routing->end)) ();
498     current_routing = current_routing->routing_father;
499     if (current_routing != NULL)
500       (*(current_routing->routing->load)) ();
501   }
502 }
503
504 /*
505  * \brief Finish the creation of a new routing component from XML
506  */
507 static void parse_E_AS_XML(void)
508 {
509   parse_E_AS(A_surfxml_AS_id);
510 }
511
512 /*
513  * \brief Finish the creation of a new routing component from lua
514  */
515 static void parse_E_AS_lua(char *id)
516 {
517   parse_E_AS(id);
518 }
519
520 /* Aux Business methods */
521
522 /**
523  * \brief Get the AS father and the first elements of the chain
524  *
525  * \param src the source host name 
526  * \param dst the destination host name
527  * 
528  * Get the common father of the to processing units, and the first different 
529  * father in the chain
530  */
531 static xbt_dynar_t elements_father(const char *src, const char *dst)
532 {
533
534   xbt_assert0(src && dst, "bad parameters for \"elements_father\" method");
535
536   xbt_dynar_t result = xbt_dynar_new(sizeof(char *), NULL);
537
538   routing_component_t src_as, dst_as;
539   int index_src, index_dst, index_father_src, index_father_dst;
540   xbt_dynar_t path_src = NULL;
541   xbt_dynar_t path_dst = NULL;
542   routing_component_t current = NULL;
543   routing_component_t *current_src = NULL;
544   routing_component_t *current_dst = NULL;
545   routing_component_t *father = NULL;
546
547   /* (1) find the as where the src and dst are located */
548   src_as = ((network_element_info_t)
549             xbt_dict_get_or_null(global_routing->where_network_elements,
550                                  src))->rc_component;
551   dst_as = ((network_element_info_t)
552             xbt_dict_get_or_null(global_routing->where_network_elements,
553                                  dst))->rc_component;
554   xbt_assert2(src_as
555               && dst_as,
556               "Ask for route \"from\"(%s) or \"to\"(%s) no found", src,
557               dst);
558
559   /* (2) find the path to the root routing component */
560   path_src = xbt_dynar_new(sizeof(routing_component_t), NULL);
561   current = src_as;
562   while (current != NULL) {
563     xbt_dynar_push(path_src, &current);
564     current = current->routing_father;
565   }
566   path_dst = xbt_dynar_new(sizeof(routing_component_t), NULL);
567   current = dst_as;
568   while (current != NULL) {
569     xbt_dynar_push(path_dst, &current);
570     current = current->routing_father;
571   }
572
573   /* (3) find the common father */
574   index_src = (path_src->used) - 1;
575   index_dst = (path_dst->used) - 1;
576   current_src = xbt_dynar_get_ptr(path_src, index_src);
577   current_dst = xbt_dynar_get_ptr(path_dst, index_dst);
578   while (index_src >= 0 && index_dst >= 0 && *current_src == *current_dst) {
579     current_src = xbt_dynar_get_ptr(path_src, index_src);
580     current_dst = xbt_dynar_get_ptr(path_dst, index_dst);
581     index_src--;
582     index_dst--;
583   }
584   index_src++;
585   index_dst++;
586   current_src = xbt_dynar_get_ptr(path_src, index_src);
587   current_dst = xbt_dynar_get_ptr(path_dst, index_dst);
588
589   /* (4) they are not in the same routing component, make the path */
590   index_father_src = index_src + 1;
591   index_father_dst = index_dst + 1;
592
593   if (*current_src == *current_dst)
594     father = current_src;
595   else
596     father = xbt_dynar_get_ptr(path_src, index_father_src);
597
598   /* (5) result generation */
599   xbt_dynar_push(result, father);       /* first same the father of src and dst */
600   xbt_dynar_push(result, current_src);  /* second the first different father of src */
601   xbt_dynar_push(result, current_dst);  /* three  the first different father of dst */
602
603   xbt_dynar_free(&path_src);
604   xbt_dynar_free(&path_dst);
605
606   return result;
607 }
608
609 /* Global Business methods */
610
611 /**
612  * \brief Recursive function for get_route
613  *
614  * \param src the source host name 
615  * \param dst the destination host name
616  * 
617  * This fuction is call by "get_route". It allow to walk through the 
618  * routing components tree.
619  */
620 static route_extended_t _get_route(const char *src, const char *dst)
621 {
622
623   void *link;
624   unsigned int cpt = 0;
625
626   DEBUG2("Solve route  \"%s\" to \"%s\"", src, dst);
627
628   xbt_assert0(src && dst, "bad parameters for \"_get_route\" method");
629
630   route_extended_t e_route, e_route_cnt, e_route_src = NULL, e_route_dst =
631       NULL;
632
633   xbt_dynar_t elem_father_list = elements_father(src, dst);
634
635   routing_component_t common_father =
636       xbt_dynar_get_as(elem_father_list, 0, routing_component_t);
637   routing_component_t src_father =
638       xbt_dynar_get_as(elem_father_list, 1, routing_component_t);
639   routing_component_t dst_father =
640       xbt_dynar_get_as(elem_father_list, 2, routing_component_t);
641
642   e_route = xbt_new0(s_route_extended_t, 1);
643   e_route->src_gateway = NULL;
644   e_route->dst_gateway = NULL;
645   e_route->generic_route.link_list =
646       xbt_dynar_new(global_routing->size_of_link, NULL);
647
648   if (src_father == dst_father) {       /* SURF_ROUTING_BASE */
649
650     if (strcmp(src, dst)) {
651       e_route_cnt =
652           (*(common_father->get_route)) (common_father, src, dst);
653       xbt_assert2(e_route_cnt, "no route between \"%s\" and \"%s\"", src,
654                   dst);
655       xbt_dynar_foreach(e_route_cnt->generic_route.link_list, cpt, link) {
656         xbt_dynar_push(e_route->generic_route.link_list, &link);
657       }
658       generic_free_extended_route(e_route_cnt);
659     }
660
661   } else {                      /* SURF_ROUTING_RECURSIVE */
662
663     route_extended_t e_route_bypass = NULL;
664
665     if (common_father->get_bypass_route)
666       e_route_bypass =
667           (*(common_father->get_bypass_route)) (common_father, src, dst);
668
669     if (e_route_bypass)
670       e_route_cnt = e_route_bypass;
671     else
672       e_route_cnt =
673           (*(common_father->get_route)) (common_father, src_father->name,
674                                          dst_father->name);
675
676     xbt_assert2(e_route_cnt, "no route between \"%s\" and \"%s\"",
677                 src_father->name, dst_father->name);
678
679     xbt_assert2((e_route_cnt->src_gateway == NULL) ==
680                 (e_route_cnt->dst_gateway == NULL),
681                 "bad gateway for route between \"%s\" and \"%s\"", src,
682                 dst);
683
684     if (src != e_route_cnt->src_gateway) {
685       e_route_src = _get_route(src, e_route_cnt->src_gateway);
686       xbt_assert2(e_route_src, "no route between \"%s\" and \"%s\"", src,
687                   e_route_cnt->src_gateway);
688       xbt_dynar_foreach(e_route_src->generic_route.link_list, cpt, link) {
689         xbt_dynar_push(e_route->generic_route.link_list, &link);
690       }
691     }
692
693     xbt_dynar_foreach(e_route_cnt->generic_route.link_list, cpt, link) {
694       xbt_dynar_push(e_route->generic_route.link_list, &link);
695     }
696
697     if (e_route_cnt->dst_gateway != dst) {
698       e_route_dst = _get_route(e_route_cnt->dst_gateway, dst);
699       xbt_assert2(e_route_dst, "no route between \"%s\" and \"%s\"",
700                   e_route_cnt->dst_gateway, dst);
701       xbt_dynar_foreach(e_route_dst->generic_route.link_list, cpt, link) {
702         xbt_dynar_push(e_route->generic_route.link_list, &link);
703       }
704     }
705
706     e_route->src_gateway = xbt_strdup(e_route_cnt->src_gateway);
707     e_route->dst_gateway = xbt_strdup(e_route_cnt->dst_gateway);
708
709     generic_free_extended_route(e_route_src);
710     generic_free_extended_route(e_route_cnt);
711     generic_free_extended_route(e_route_dst);
712   }
713
714   xbt_dynar_free(&elem_father_list);
715
716   return e_route;
717 }
718
719 /**
720  * \brief Generic method: find a route between hosts
721  *
722  * \param src the source host name 
723  * \param dst the destination host name
724  * 
725  * walk through the routing components tree and find a route between hosts
726  * by calling the differents "get_route" functions in each routing component
727  */
728 static xbt_dynar_t get_route(const char *src, const char *dst)
729 {
730
731   route_extended_t e_route;
732   xbt_dynar_t elem_father_list = elements_father(src, dst);
733   routing_component_t common_father =
734       xbt_dynar_get_as(elem_father_list, 0, routing_component_t);
735
736   if (strcmp(src, dst))
737     e_route = _get_route(src, dst);
738   else
739     e_route = (*(common_father->get_route)) (common_father, src, dst);
740
741   xbt_assert2(e_route, "no route between \"%s\" and \"%s\"", src, dst);
742
743   if (global_routing->last_route)
744     xbt_dynar_free(&(global_routing->last_route));
745   global_routing->last_route = e_route->generic_route.link_list;
746
747   if (e_route->src_gateway)
748     xbt_free(e_route->src_gateway);
749   if (e_route->dst_gateway)
750     xbt_free(e_route->dst_gateway);
751
752   xbt_free(e_route);
753   xbt_dynar_free(&elem_father_list);
754
755   if (xbt_dynar_length(global_routing->last_route) == 0)
756     return NULL;
757   else
758     return global_routing->last_route;
759 }
760
761 /**
762  * \brief Recursive function for finalize
763  *
764  * \param rc the source host name 
765  * 
766  * This fuction is call by "finalize". It allow to finalize the 
767  * AS or routing components. It delete all the structures.
768  */
769 static void _finalize(routing_component_t rc)
770 {
771   if (rc) {
772     xbt_dict_cursor_t cursor = NULL;
773     char *key;
774     routing_component_t elem;
775     xbt_dict_foreach(rc->routing_sons, cursor, key, elem) {
776       _finalize(elem);
777     }
778     xbt_dict_t tmp_sons = rc->routing_sons;
779     char *tmp_name = rc->name;
780     xbt_dict_free(&tmp_sons);
781     xbt_free(tmp_name);
782     xbt_assert1(rc->finalize, "no defined method \"finalize\" in \"%s\"",
783                 current_routing->name);
784     (*(rc->finalize)) (rc);
785   }
786 }
787
788 /**
789  * \brief Generic method: delete all the routing structures
790  * 
791  * walk through the routing components tree and delete the structures
792  * by calling the differents "finalize" functions in each routing component
793  */
794 static void finalize(void)
795 {
796   /* delete recursibly all the tree */
797   _finalize(global_routing->root);
798   /* delete "where" dict */
799   xbt_dict_free(&(global_routing->where_network_elements));
800   /* delete last_route */
801   xbt_dynar_free(&(global_routing->last_route));
802   /* delete global routing structure */
803   xbt_free(global_routing);
804 }
805
806 static xbt_dynar_t recursive_get_onelink_routes(routing_component_t rc)
807 {
808   xbt_dynar_t ret = xbt_dynar_new(sizeof(onelink_t), xbt_free);
809
810   //adding my one link routes
811   unsigned int cpt;
812   void *link;
813   xbt_dynar_t onelink_mine = rc->get_onelink_routes(rc);
814   if (onelink_mine) {
815     xbt_dynar_foreach(onelink_mine, cpt, link) {
816       xbt_dynar_push(ret, &link);
817     }
818   }
819   //recursing
820   char *key;
821   xbt_dict_cursor_t cursor = NULL;
822   routing_component_t rc_child;
823   xbt_dict_foreach(rc->routing_sons, cursor, key, rc_child) {
824     xbt_dynar_t onelink_child = recursive_get_onelink_routes(rc_child);
825     if (onelink_child) {
826       xbt_dynar_foreach(onelink_child, cpt, link) {
827         xbt_dynar_push(ret, &link);
828       }
829     }
830   }
831   return ret;
832 }
833
834 static xbt_dynar_t get_onelink_routes(void)
835 {
836   return recursive_get_onelink_routes(global_routing->root);
837 }
838
839 static e_surf_network_element_type_t get_network_element_type(const char
840                                                               *name)
841 {
842   network_element_info_t rc = NULL;
843   rc = xbt_dict_get(global_routing->where_network_elements, name);
844   return rc->rc_type;
845 }
846
847 /**
848  * \brief Generic method: create the global routing schema
849  * 
850  * Make a global routing structure and set all the parsing functions.
851  */
852 void routing_model_create(size_t size_of_links, void *loopback)
853 {
854
855   /* config the uniq global routing */
856   global_routing = xbt_new0(s_routing_global_t, 1);
857   global_routing->where_network_elements = xbt_dict_new();
858   global_routing->root = NULL;
859   global_routing->get_route = get_route;
860   global_routing->get_onelink_routes = get_onelink_routes;
861   global_routing->get_network_element_type = get_network_element_type;
862   global_routing->finalize = finalize;
863   global_routing->loopback = loopback;
864   global_routing->size_of_link = size_of_links;
865   global_routing->last_route = xbt_dynar_new(size_of_links, NULL);
866
867   /* no current routing at moment */
868   current_routing = NULL;
869
870   /* parse generic elements */
871   surfxml_add_callback(STag_surfxml_host_cb_list, &parse_S_host_XML);
872   surfxml_add_callback(STag_surfxml_router_cb_list, &parse_S_router);
873
874   surfxml_add_callback(STag_surfxml_route_cb_list,
875                        &parse_S_route_new_and_endpoints_XML);
876   surfxml_add_callback(STag_surfxml_ASroute_cb_list,
877                        &parse_S_ASroute_new_and_endpoints);
878   surfxml_add_callback(STag_surfxml_bypassRoute_cb_list,
879                        &parse_S_bypassRoute_new_and_endpoints);
880
881   surfxml_add_callback(ETag_surfxml_link_ctn_cb_list,
882                        &parse_E_link_ctn_new_elem_XML);
883
884   surfxml_add_callback(ETag_surfxml_route_cb_list,
885                        &parse_E_route_store_route);
886   surfxml_add_callback(ETag_surfxml_ASroute_cb_list,
887                        &parse_E_ASroute_store_route);
888   surfxml_add_callback(ETag_surfxml_bypassRoute_cb_list,
889                        &parse_E_bypassRoute_store_route);
890
891   surfxml_add_callback(STag_surfxml_AS_cb_list, &parse_S_AS_XML);
892   surfxml_add_callback(ETag_surfxml_AS_cb_list, &parse_E_AS_XML);
893
894   surfxml_add_callback(STag_surfxml_cluster_cb_list,
895                        &routing_full_parse_Scluster);
896
897   surfxml_add_callback(STag_surfxml_config_cb_list, &parse_Sconfig);
898 }
899
900 /* ************************************************************************** */
901 /* *************************** FULL ROUTING ********************************* */
902
903 #define TO_ROUTE_FULL(i,j) routing->routing_table[(i)+(j)*table_size]
904
905 /* Routing model structure */
906
907 typedef struct {
908   s_routing_component_t generic_routing;
909   xbt_dict_t parse_routes;      /* store data during the parse process */
910   xbt_dict_t bypassRoutes;
911   route_extended_t *routing_table;
912 } s_routing_component_full_t, *routing_component_full_t;
913
914 /* Business methods */
915 static xbt_dynar_t full_get_onelink_routes(routing_component_t rc)
916 {
917   xbt_dynar_t ret = xbt_dynar_new(sizeof(onelink_t), xbt_free);
918
919   routing_component_full_t routing = (routing_component_full_t) rc;
920   size_t table_size = xbt_dict_length(routing->generic_routing.to_index);
921   xbt_dict_cursor_t c1 = NULL, c2 = NULL;
922   char *k1, *d1, *k2, *d2;
923   xbt_dict_foreach(routing->generic_routing.to_index, c1, k1, d1) {
924     xbt_dict_foreach(routing->generic_routing.to_index, c2, k2, d2) {
925       int *src_id = xbt_dict_get_or_null(routing->generic_routing.to_index, k1);
926       int *dst_id = xbt_dict_get_or_null(routing->generic_routing.to_index, k2);
927       xbt_assert2(src_id
928                   && dst_id,
929                   "Ask for route \"from\"(%s)  or \"to\"(%s) no found in the local table",
930                   src, dst);
931       route_extended_t route = TO_ROUTE_FULL(*src_id, *dst_id);
932       if (route) {
933         if (xbt_dynar_length(route->generic_route.link_list) == 1) {
934           void *link =
935               *(void **) xbt_dynar_get_ptr(route->generic_route.link_list,
936                                            0);
937           onelink_t onelink = xbt_new0(s_onelink_t, 1);
938           onelink->link_ptr = link;
939           if (routing->generic_routing.hierarchy == SURF_ROUTING_BASE) {
940             onelink->src = xbt_strdup(k1);
941             onelink->dst = xbt_strdup(k2);
942           } else if (routing->generic_routing.hierarchy ==
943                      SURF_ROUTING_RECURSIVE) {
944             onelink->src = xbt_strdup(route->src_gateway);
945             onelink->dst = xbt_strdup(route->dst_gateway);
946           }
947           xbt_dynar_push(ret, &onelink);
948         }
949       }
950     }
951   }
952   return ret;
953 }
954
955 static route_extended_t full_get_route(routing_component_t rc,
956                                        const char *src, const char *dst)
957 {
958   xbt_assert1(rc && src
959               && dst,
960               "Invalid params for \"get_route\" function at AS \"%s\"",
961               rc->name);
962
963   /* set utils vars */
964   routing_component_full_t routing = (routing_component_full_t) rc;
965   size_t table_size = xbt_dict_length(routing->generic_routing.to_index);
966
967   generic_src_dst_check(rc, src, dst);
968   int *src_id = xbt_dict_get_or_null(routing->generic_routing.to_index, src);
969   int *dst_id = xbt_dict_get_or_null(routing->generic_routing.to_index, dst);
970   xbt_assert2(src_id
971               && dst_id,
972               "Ask for route \"from\"(%s)  or \"to\"(%s) no found in the local table",
973               src, dst);
974
975   route_extended_t e_route = NULL;
976   route_extended_t new_e_route = NULL;
977   void *link;
978   unsigned int cpt = 0;
979
980   e_route = TO_ROUTE_FULL(*src_id, *dst_id);
981
982   if (e_route) {
983     new_e_route = xbt_new0(s_route_extended_t, 1);
984     new_e_route->src_gateway = xbt_strdup(e_route->src_gateway);
985     new_e_route->dst_gateway = xbt_strdup(e_route->dst_gateway);
986     new_e_route->generic_route.link_list =
987         xbt_dynar_new(global_routing->size_of_link, NULL);
988     xbt_dynar_foreach(e_route->generic_route.link_list, cpt, link) {
989       xbt_dynar_push(new_e_route->generic_route.link_list, &link);
990     }
991   }
992   return new_e_route;
993 }
994
995 static void full_finalize(routing_component_t rc)
996 {
997   routing_component_full_t routing = (routing_component_full_t) rc;
998   size_t table_size = xbt_dict_length(routing->generic_routing.to_index);
999   int i, j;
1000   if (routing) {
1001     /* Delete routing table */
1002     for (i = 0; i < table_size; i++)
1003       for (j = 0; j < table_size; j++)
1004         generic_free_extended_route(TO_ROUTE_FULL(i, j));
1005     xbt_free(routing->routing_table);
1006     /* Delete bypass dict */
1007     xbt_dict_free(&routing->bypassRoutes);
1008     /* Delete index dict */
1009     xbt_dict_free(&(routing->generic_routing.to_index));
1010     /* Delete structure */
1011     xbt_free(rc);
1012   }
1013 }
1014
1015 /* Creation routing model functions */
1016
1017 static void *model_full_create(void)
1018 {
1019   routing_component_full_t new_component =
1020       xbt_new0(s_routing_component_full_t, 1);
1021   new_component->generic_routing.set_processing_unit =
1022       generic_set_processing_unit;
1023   new_component->generic_routing.set_autonomous_system =
1024       generic_set_autonomous_system;
1025   new_component->generic_routing.set_route = generic_set_route;
1026   new_component->generic_routing.set_ASroute = generic_set_ASroute;
1027   new_component->generic_routing.set_bypassroute = generic_set_bypassroute;
1028   new_component->generic_routing.get_route = full_get_route;
1029   new_component->generic_routing.get_onelink_routes =
1030       full_get_onelink_routes;
1031   new_component->generic_routing.get_bypass_route =
1032       generic_get_bypassroute;
1033   new_component->generic_routing.finalize = full_finalize;
1034   new_component->generic_routing.to_index = xbt_dict_new();
1035   new_component->bypassRoutes = xbt_dict_new();
1036   new_component->generic_routing.parse_routes = xbt_dict_new();
1037   return new_component;
1038 }
1039
1040 static void model_full_load(void)
1041 {
1042   /* use "surfxml_add_callback" to add a parse function call */
1043 }
1044
1045 static void model_full_unload(void)
1046 {
1047   /* use "surfxml_del_callback" to remove a parse function call */
1048 }
1049
1050 static void model_full_end(void)
1051 {
1052
1053   char *key, *end;
1054   const char *sep = "#";
1055   int src_id, dst_id;
1056   unsigned int i, j;
1057   route_t route;
1058   route_extended_t e_route;
1059   void *data;
1060
1061   xbt_dict_cursor_t cursor = NULL;
1062   xbt_dynar_t keys = NULL;
1063
1064   /* set utils vars */
1065   routing_component_full_t routing =
1066       ((routing_component_full_t) current_routing);
1067   size_t table_size = xbt_dict_length(routing->generic_routing.to_index);
1068
1069   /* Create the routing table */
1070   routing->routing_table =
1071       xbt_new0(route_extended_t, table_size * table_size);
1072
1073   /* Put the routes in position */
1074   xbt_dict_foreach(routing->generic_routing.parse_routes, cursor, key, data) {
1075     keys = xbt_str_split_str(key, sep);
1076     src_id = strtol(xbt_dynar_get_as(keys, 0, char *), &end, 10);
1077     dst_id = strtol(xbt_dynar_get_as(keys, 1, char *), &end, 10);
1078     TO_ROUTE_FULL(src_id, dst_id) =
1079         generic_new_extended_route(current_routing->hierarchy, data, 1);
1080     xbt_dynar_free(&keys);
1081   }
1082
1083   /* delete the parse table */
1084   xbt_dict_foreach(routing->generic_routing.parse_routes, cursor, key, data) {
1085     route = (route_t) data;
1086     xbt_dynar_free(&(route->link_list));
1087     xbt_free(data);
1088   }
1089
1090   /* delete parse dict */
1091   xbt_dict_free(&(routing->generic_routing.parse_routes));
1092
1093   /* Add the loopback if needed */
1094   if (current_routing->hierarchy == SURF_ROUTING_BASE) {
1095     for (i = 0; i < table_size; i++) {
1096       e_route = TO_ROUTE_FULL(i, i);
1097       if (!e_route) {
1098         e_route = xbt_new0(s_route_extended_t, 1);
1099         e_route->src_gateway = NULL;
1100         e_route->dst_gateway = NULL;
1101         e_route->generic_route.link_list =
1102             xbt_dynar_new(global_routing->size_of_link, NULL);
1103         xbt_dynar_push(e_route->generic_route.link_list,
1104                        &global_routing->loopback);
1105         TO_ROUTE_FULL(i, i) = e_route;
1106       }
1107     }
1108   }
1109
1110   /* Shrink the dynar routes (save unused slots) */
1111   for (i = 0; i < table_size; i++)
1112     for (j = 0; j < table_size; j++)
1113       if (TO_ROUTE_FULL(i, j))
1114         xbt_dynar_shrink(TO_ROUTE_FULL(i, j)->generic_route.link_list, 0);
1115 }
1116
1117 /* ************************************************************************** */
1118 /* *************************** FLOYD ROUTING ******************************** */
1119
1120 #define TO_FLOYD_COST(i,j) cost_table[(i)+(j)*table_size]
1121 #define TO_FLOYD_PRED(i,j) (routing->predecessor_table)[(i)+(j)*table_size]
1122 #define TO_FLOYD_LINK(i,j) (routing->link_table)[(i)+(j)*table_size]
1123
1124 /* Routing model structure */
1125
1126 typedef struct {
1127   s_routing_component_t generic_routing;
1128   /* vars for calculate the floyd algorith. */
1129   int *predecessor_table;
1130   route_extended_t *link_table; /* char* -> int* */
1131   xbt_dict_t bypassRoutes;
1132 } s_routing_component_floyd_t, *routing_component_floyd_t;
1133
1134 static route_extended_t floyd_get_route(routing_component_t rc,
1135                                         const char *src, const char *dst);
1136
1137 /* Business methods */
1138 static xbt_dynar_t floyd_get_onelink_routes(routing_component_t rc)
1139 {
1140   xbt_dynar_t ret = xbt_dynar_new(sizeof(onelink_t), xbt_free);
1141
1142   routing_component_floyd_t routing = (routing_component_floyd_t) rc;
1143   //size_t table_size = xbt_dict_length(routing->generic_routing.to_index);
1144   xbt_dict_cursor_t c1 = NULL, c2 = NULL;
1145   char *k1, *d1, *k2, *d2;
1146   xbt_dict_foreach(routing->generic_routing.to_index, c1, k1, d1) {
1147     xbt_dict_foreach(routing->generic_routing.to_index, c2, k2, d2) {
1148       route_extended_t route = floyd_get_route(rc, k1, k2);
1149       if (route) {
1150         if (xbt_dynar_length(route->generic_route.link_list) == 1) {
1151           void *link =
1152               *(void **) xbt_dynar_get_ptr(route->generic_route.link_list,
1153                                            0);
1154           onelink_t onelink = xbt_new0(s_onelink_t, 1);
1155           onelink->link_ptr = link;
1156           if (routing->generic_routing.hierarchy == SURF_ROUTING_BASE) {
1157             onelink->src = xbt_strdup(k1);
1158             onelink->dst = xbt_strdup(k2);
1159           } else if (routing->generic_routing.hierarchy ==
1160                      SURF_ROUTING_RECURSIVE) {
1161             onelink->src = xbt_strdup(route->src_gateway);
1162             onelink->dst = xbt_strdup(route->dst_gateway);
1163           }
1164           xbt_dynar_push(ret, &onelink);
1165         }
1166       }
1167     }
1168   }
1169   return ret;
1170 }
1171
1172 static route_extended_t floyd_get_route(routing_component_t rc,
1173                                         const char *src, const char *dst)
1174 {
1175   xbt_assert1(rc && src
1176               && dst,
1177               "Invalid params for \"get_route\" function at AS \"%s\"",
1178               rc->name);
1179
1180   /* set utils vars */
1181   routing_component_floyd_t routing = (routing_component_floyd_t) rc;
1182   size_t table_size = xbt_dict_length(routing->generic_routing.to_index);
1183
1184   generic_src_dst_check(rc, src, dst);
1185   int *src_id = xbt_dict_get_or_null(routing->generic_routing.to_index, src);
1186   int *dst_id = xbt_dict_get_or_null(routing->generic_routing.to_index, dst);
1187   xbt_assert2(src_id
1188               && dst_id,
1189               "Ask for route \"from\"(%s)  or \"to\"(%s) no found in the local table",
1190               src, dst);
1191
1192   /* create a result route */
1193   route_extended_t new_e_route = xbt_new0(s_route_extended_t, 1);
1194   new_e_route->generic_route.link_list =
1195       xbt_dynar_new(global_routing->size_of_link, NULL);
1196   new_e_route->src_gateway = NULL;
1197   new_e_route->dst_gateway = NULL;
1198
1199   int first = 1;
1200   int pred = *dst_id;
1201   int prev_pred = 0;
1202   char *gw_src = NULL, *gw_dst =
1203       NULL, *prev_gw_src, *prev_gw_dst, *first_gw = NULL;
1204   unsigned int cpt;
1205   void *link;
1206   xbt_dynar_t links;
1207
1208   do {
1209     prev_pred = pred;
1210     pred = TO_FLOYD_PRED(*src_id, pred);
1211     if (pred == -1)             /* if no pred in route -> no route to host */
1212       break;
1213     xbt_assert2(TO_FLOYD_LINK(pred, prev_pred),
1214                 "Invalid link for the route between \"%s\" or \"%s\"", src,
1215                 dst);
1216
1217     prev_gw_src = gw_src;
1218     prev_gw_dst = gw_dst;
1219
1220     route_extended_t e_route = TO_FLOYD_LINK(pred, prev_pred);
1221     gw_src = e_route->src_gateway;
1222     gw_dst = e_route->dst_gateway;
1223
1224     if (first)
1225       first_gw = gw_dst;
1226
1227     if (rc->hierarchy == SURF_ROUTING_RECURSIVE && !first
1228         && strcmp(gw_dst, prev_gw_src)) {
1229       xbt_dynar_t e_route_as_to_as =
1230           (*(global_routing->get_route)) (gw_dst, prev_gw_src);
1231       xbt_assert2(e_route_as_to_as, "no route between \"%s\" and \"%s\"",
1232                   gw_dst, prev_gw_src);
1233       links = e_route_as_to_as;
1234       int pos = 0;
1235       xbt_dynar_foreach(links, cpt, link) {
1236         xbt_dynar_insert_at(new_e_route->generic_route.link_list, pos,
1237                             &link);
1238         pos++;
1239       }
1240     }
1241
1242     links = e_route->generic_route.link_list;
1243     xbt_dynar_foreach(links, cpt, link) {
1244       xbt_dynar_unshift(new_e_route->generic_route.link_list, &link);
1245     }
1246     first = 0;
1247
1248   } while (pred != *src_id);
1249   xbt_assert4(pred != -1, "no route from host %d to %d (\"%s\" to \"%s\")",
1250               *src_id, *dst_id, src, dst);
1251
1252   if (rc->hierarchy == SURF_ROUTING_RECURSIVE) {
1253     new_e_route->src_gateway = xbt_strdup(gw_src);
1254     new_e_route->dst_gateway = xbt_strdup(first_gw);
1255   }
1256
1257   return new_e_route;
1258 }
1259
1260 static void floyd_finalize(routing_component_t rc)
1261 {
1262   routing_component_floyd_t routing = (routing_component_floyd_t) rc;
1263   int i, j;
1264   size_t table_size;
1265   if (routing) {
1266     table_size = xbt_dict_length(routing->generic_routing.to_index);
1267     /* Delete link_table */
1268     for (i = 0; i < table_size; i++)
1269       for (j = 0; j < table_size; j++)
1270         generic_free_extended_route(TO_FLOYD_LINK(i, j));
1271     xbt_free(routing->link_table);
1272     /* Delete bypass dict */
1273     xbt_dict_free(&routing->bypassRoutes);
1274     /* Delete index dict */
1275     xbt_dict_free(&(routing->generic_routing.to_index));
1276     /* Delete dictionary index dict, predecessor and links table */
1277     xbt_free(routing->predecessor_table);
1278     /* Delete structure */
1279     xbt_free(rc);
1280   }
1281 }
1282
1283 static void *model_floyd_create(void)
1284 {
1285   routing_component_floyd_t new_component =
1286       xbt_new0(s_routing_component_floyd_t, 1);
1287   new_component->generic_routing.set_processing_unit =
1288       generic_set_processing_unit;
1289   new_component->generic_routing.set_autonomous_system =
1290       generic_set_autonomous_system;
1291   new_component->generic_routing.set_route = generic_set_route;
1292   new_component->generic_routing.set_ASroute = generic_set_ASroute;
1293   new_component->generic_routing.set_bypassroute = generic_set_bypassroute;
1294   new_component->generic_routing.get_route = floyd_get_route;
1295   new_component->generic_routing.get_onelink_routes =
1296       floyd_get_onelink_routes;
1297   new_component->generic_routing.get_bypass_route =
1298       generic_get_bypassroute;
1299   new_component->generic_routing.finalize = floyd_finalize;
1300   new_component->generic_routing.to_index = xbt_dict_new();
1301   new_component->bypassRoutes = xbt_dict_new();
1302   new_component->generic_routing.parse_routes = xbt_dict_new();
1303   return new_component;
1304 }
1305
1306 static void model_floyd_load(void)
1307 {
1308   /* use "surfxml_add_callback" to add a parse function call */
1309 }
1310
1311 static void model_floyd_unload(void)
1312 {
1313   /* use "surfxml_del_callback" to remove a parse function call */
1314 }
1315
1316 static void model_floyd_end(void)
1317 {
1318
1319   routing_component_floyd_t routing =
1320       ((routing_component_floyd_t) current_routing);
1321   xbt_dict_cursor_t cursor = NULL;
1322   double *cost_table;
1323   char *key, *data, *end;
1324   const char *sep = "#";
1325   xbt_dynar_t keys;
1326   int src_id, dst_id;
1327   unsigned int i, j, a, b, c;
1328
1329   /* set the size of inicial table */
1330   size_t table_size = xbt_dict_length(routing->generic_routing.to_index);
1331
1332   /* Create Cost, Predecessor and Link tables */
1333   cost_table = xbt_new0(double, table_size * table_size);       /* link cost from host to host */
1334   routing->predecessor_table = xbt_new0(int, table_size * table_size);  /* predecessor host numbers */
1335   routing->link_table = xbt_new0(route_extended_t, table_size * table_size);    /* actual link between src and dst */
1336
1337   /* Initialize costs and predecessors */
1338   for (i = 0; i < table_size; i++)
1339     for (j = 0; j < table_size; j++) {
1340       TO_FLOYD_COST(i, j) = DBL_MAX;
1341       TO_FLOYD_PRED(i, j) = -1;
1342       TO_FLOYD_LINK(i, j) = NULL;       /* fixed, missing in the previous version */
1343     }
1344
1345   /* Put the routes in position */
1346   xbt_dict_foreach(routing->generic_routing.parse_routes, cursor, key, data) {
1347     keys = xbt_str_split_str(key, sep);
1348     src_id = strtol(xbt_dynar_get_as(keys, 0, char *), &end, 10);
1349     dst_id = strtol(xbt_dynar_get_as(keys, 1, char *), &end, 10);
1350     TO_FLOYD_LINK(src_id, dst_id) =
1351         generic_new_extended_route(current_routing->hierarchy, data, 0);
1352     TO_FLOYD_PRED(src_id, dst_id) = src_id;
1353     /* set link cost */
1354     TO_FLOYD_COST(src_id, dst_id) = ((TO_FLOYD_LINK(src_id, dst_id))->generic_route.link_list)->used;   /* count of links, old model assume 1 */
1355     xbt_dynar_free(&keys);
1356   }
1357
1358   /* Add the loopback if needed */
1359   if (current_routing->hierarchy == SURF_ROUTING_BASE) {
1360     for (i = 0; i < table_size; i++) {
1361       route_extended_t e_route = TO_FLOYD_LINK(i, i);
1362       if (!e_route) {
1363         e_route = xbt_new0(s_route_extended_t, 1);
1364         e_route->src_gateway = NULL;
1365         e_route->dst_gateway = NULL;
1366         e_route->generic_route.link_list =
1367             xbt_dynar_new(global_routing->size_of_link, NULL);
1368         xbt_dynar_push(e_route->generic_route.link_list,
1369                        &global_routing->loopback);
1370         TO_FLOYD_LINK(i, i) = e_route;
1371         TO_FLOYD_PRED(i, i) = i;
1372         TO_FLOYD_COST(i, i) = 1;
1373       }
1374     }
1375   }
1376   /* Calculate path costs */
1377   for (c = 0; c < table_size; c++) {
1378     for (a = 0; a < table_size; a++) {
1379       for (b = 0; b < table_size; b++) {
1380         if (TO_FLOYD_COST(a, c) < DBL_MAX && TO_FLOYD_COST(c, b) < DBL_MAX) {
1381           if (TO_FLOYD_COST(a, b) == DBL_MAX ||
1382               (TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b) <
1383                TO_FLOYD_COST(a, b))) {
1384             TO_FLOYD_COST(a, b) =
1385                 TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b);
1386             TO_FLOYD_PRED(a, b) = TO_FLOYD_PRED(c, b);
1387           }
1388         }
1389       }
1390     }
1391   }
1392
1393   /* delete the parse table */
1394   xbt_dict_foreach(routing->generic_routing.parse_routes, cursor, key, data) {
1395     route_t route = (route_t) data;
1396     xbt_dynar_free(&(route->link_list));
1397     xbt_free(data);
1398   }
1399
1400   /* delete parse dict */
1401   xbt_dict_free(&(routing->generic_routing.parse_routes));
1402
1403   /* cleanup */
1404   xbt_free(cost_table);
1405 }
1406
1407 /* ************************************************************************** */
1408 /* ********** Dijkstra & Dijkstra Cached ROUTING **************************** */
1409
1410 typedef struct {
1411   s_routing_component_t generic_routing;
1412   xbt_dict_t bypassRoutes;
1413   xbt_graph_t route_graph;      /* xbt_graph */
1414   xbt_dict_t graph_node_map;    /* map */
1415   xbt_dict_t route_cache;       /* use in cache mode */
1416   int cached;
1417 } s_routing_component_dijkstra_t, *routing_component_dijkstra_t;
1418
1419
1420 typedef struct graph_node_data {
1421   int id;
1422   int graph_id;                 /* used for caching internal graph id's */
1423 } s_graph_node_data_t, *graph_node_data_t;
1424
1425 typedef struct graph_node_map_element {
1426   xbt_node_t node;
1427 } s_graph_node_map_element_t, *graph_node_map_element_t;
1428
1429 typedef struct route_cache_element {
1430   int *pred_arr;
1431   int size;
1432 } s_route_cache_element_t, *route_cache_element_t;
1433
1434 /* Free functions */
1435
1436 static void route_cache_elem_free(void *e)
1437 {
1438   route_cache_element_t elm = (route_cache_element_t) e;
1439   if (elm) {
1440     xbt_free(elm->pred_arr);
1441     xbt_free(elm);
1442   }
1443 }
1444
1445 static void graph_node_map_elem_free(void *e)
1446 {
1447   graph_node_map_element_t elm = (graph_node_map_element_t) e;
1448   if (elm) {
1449     xbt_free(elm);
1450   }
1451 }
1452
1453 static void graph_edge_data_free(void *e)
1454 {
1455   route_extended_t e_route = (route_extended_t) e;
1456   if (e_route) {
1457     xbt_dynar_free(&(e_route->generic_route.link_list));
1458     if (e_route->src_gateway)
1459       xbt_free(e_route->src_gateway);
1460     if (e_route->dst_gateway)
1461       xbt_free(e_route->dst_gateway);
1462     xbt_free(e_route);
1463   }
1464 }
1465
1466 /* Utility functions */
1467
1468 static xbt_node_t route_graph_new_node(routing_component_dijkstra_t rc,
1469                                        int id, int graph_id)
1470 {
1471   routing_component_dijkstra_t routing = (routing_component_dijkstra_t) rc;
1472   xbt_node_t node = NULL;
1473   graph_node_data_t data = NULL;
1474   graph_node_map_element_t elm = NULL;
1475
1476   data = xbt_new0(struct graph_node_data, 1);
1477   data->id = id;
1478   data->graph_id = graph_id;
1479   node = xbt_graph_new_node(routing->route_graph, data);
1480
1481   elm = xbt_new0(struct graph_node_map_element, 1);
1482   elm->node = node;
1483   xbt_dict_set_ext(routing->graph_node_map, (char *) (&id), sizeof(int),
1484                    (xbt_set_elm_t) elm, &graph_node_map_elem_free);
1485
1486   return node;
1487 }
1488
1489 static graph_node_map_element_t
1490 graph_node_map_search(routing_component_dijkstra_t rc, int id)
1491 {
1492   routing_component_dijkstra_t routing = (routing_component_dijkstra_t) rc;
1493   graph_node_map_element_t elm = (graph_node_map_element_t)
1494       xbt_dict_get_or_null_ext(routing->graph_node_map,
1495                                (char *) (&id),
1496                                sizeof(int));
1497   return elm;
1498 }
1499
1500 /* Parsing */
1501
1502 static void route_new_dijkstra(routing_component_dijkstra_t rc, int src_id,
1503                                int dst_id, route_extended_t e_route)
1504 {
1505   routing_component_dijkstra_t routing = (routing_component_dijkstra_t) rc;
1506
1507   xbt_node_t src = NULL;
1508   xbt_node_t dst = NULL;
1509   graph_node_map_element_t src_elm = (graph_node_map_element_t)
1510       xbt_dict_get_or_null_ext(routing->graph_node_map,
1511                                (char *) (&src_id),
1512                                sizeof(int));
1513   graph_node_map_element_t dst_elm = (graph_node_map_element_t)
1514       xbt_dict_get_or_null_ext(routing->graph_node_map,
1515                                (char *) (&dst_id),
1516                                sizeof(int));
1517
1518   if (src_elm)
1519     src = src_elm->node;
1520
1521   if (dst_elm)
1522     dst = dst_elm->node;
1523
1524   /* add nodes if they don't exist in the graph */
1525   if (src_id == dst_id && src == NULL && dst == NULL) {
1526     src = route_graph_new_node(rc, src_id, -1);
1527     dst = src;
1528   } else {
1529     if (src == NULL) {
1530       src = route_graph_new_node(rc, src_id, -1);
1531     }
1532     if (dst == NULL) {
1533       dst = route_graph_new_node(rc, dst_id, -1);
1534     }
1535   }
1536
1537   /* add link as edge to graph */
1538   xbt_graph_new_edge(routing->route_graph, src, dst, e_route);
1539 }
1540
1541 static void add_loopback_dijkstra(routing_component_dijkstra_t rc)
1542 {
1543   routing_component_dijkstra_t routing = (routing_component_dijkstra_t) rc;
1544
1545   xbt_dynar_t nodes = xbt_graph_get_nodes(routing->route_graph);
1546
1547   xbt_node_t node = NULL;
1548   unsigned int cursor2;
1549   xbt_dynar_foreach(nodes, cursor2, node) {
1550     xbt_dynar_t out_edges = xbt_graph_node_get_outedges(node);
1551     xbt_edge_t edge = NULL;
1552     unsigned int cursor;
1553
1554     int found = 0;
1555     xbt_dynar_foreach(out_edges, cursor, edge) {
1556       xbt_node_t other_node = xbt_graph_edge_get_target(edge);
1557       if (other_node == node) {
1558         found = 1;
1559         break;
1560       }
1561     }
1562
1563     if (!found) {
1564       route_extended_t e_route = xbt_new0(s_route_extended_t, 1);
1565       e_route->src_gateway = NULL;
1566       e_route->dst_gateway = NULL;
1567       e_route->generic_route.link_list =
1568           xbt_dynar_new(global_routing->size_of_link, NULL);
1569       xbt_dynar_push(e_route->generic_route.link_list,
1570                      &global_routing->loopback);
1571       xbt_graph_new_edge(routing->route_graph, node, node, e_route);
1572     }
1573   }
1574 }
1575
1576 /* Business methods */
1577 static xbt_dynar_t dijkstra_get_onelink_routes(routing_component_t rc)
1578 {
1579   xbt_die("\"dijkstra_get_onelink_routes\" function not implemented yet");
1580 }
1581
1582 static route_extended_t dijkstra_get_route(routing_component_t rc,
1583                                            const char *src,
1584                                            const char *dst)
1585 {
1586   xbt_assert1(rc && src
1587               && dst,
1588               "Invalid params for \"get_route\" function at AS \"%s\"",
1589               rc->name);
1590
1591   /* set utils vars */
1592   routing_component_dijkstra_t routing = (routing_component_dijkstra_t) rc;
1593
1594   generic_src_dst_check(rc, src, dst);
1595   int *src_id = xbt_dict_get_or_null(routing->generic_routing.to_index, src);
1596   int *dst_id = xbt_dict_get_or_null(routing->generic_routing.to_index, dst);
1597   xbt_assert2(src_id
1598               && dst_id,
1599               "Ask for route \"from\"(%s)  or \"to\"(%s) no found in the local table",
1600               src, dst);
1601
1602   /* create a result route */
1603   route_extended_t new_e_route = xbt_new0(s_route_extended_t, 1);
1604   new_e_route->generic_route.link_list =
1605       xbt_dynar_new(global_routing->size_of_link, NULL);
1606   new_e_route->src_gateway = NULL;
1607   new_e_route->dst_gateway = NULL;
1608
1609   int *pred_arr = NULL;
1610   int src_node_id = 0;
1611   int dst_node_id = 0;
1612   int *nodeid = NULL;
1613   int v;
1614   route_extended_t e_route;
1615   int size = 0;
1616   unsigned int cpt;
1617   void *link;
1618   xbt_dynar_t links = NULL;
1619   route_cache_element_t elm = NULL;
1620   xbt_dynar_t nodes = xbt_graph_get_nodes(routing->route_graph);
1621
1622   /* Use the graph_node id mapping set to quickly find the nodes */
1623   graph_node_map_element_t src_elm =
1624       graph_node_map_search(routing, *src_id);
1625   graph_node_map_element_t dst_elm =
1626       graph_node_map_search(routing, *dst_id);
1627   xbt_assert2(src_elm != NULL
1628               && dst_elm != NULL, "src %d or dst %d does not exist",
1629               *src_id, *dst_id);
1630   src_node_id = ((graph_node_data_t)
1631                  xbt_graph_node_get_data(src_elm->node))->graph_id;
1632   dst_node_id = ((graph_node_data_t)
1633                  xbt_graph_node_get_data(dst_elm->node))->graph_id;
1634
1635   /* if the src and dst are the same *//* fixed, missing in the previous version */
1636   if (src_node_id == dst_node_id) {
1637
1638     xbt_node_t node_s_v = xbt_dynar_get_as(nodes, src_node_id, xbt_node_t);
1639     xbt_node_t node_e_v = xbt_dynar_get_as(nodes, dst_node_id, xbt_node_t);
1640     xbt_edge_t edge =
1641         xbt_graph_get_edge(routing->route_graph, node_s_v, node_e_v);
1642
1643     xbt_assert2(edge != NULL, "no route between host %d and %d", *src_id,
1644                 *dst_id);
1645
1646     e_route = (route_extended_t) xbt_graph_edge_get_data(edge);
1647
1648     links = e_route->generic_route.link_list;
1649     xbt_dynar_foreach(links, cpt, link) {
1650       xbt_dynar_unshift(new_e_route->generic_route.link_list, &link);
1651     }
1652
1653     return new_e_route;
1654   }
1655
1656   if (routing->cached) {
1657     /*check if there is a cached predecessor list avail */
1658     elm = (route_cache_element_t)
1659         xbt_dict_get_or_null_ext(routing->route_cache, (char *) (&src_id),
1660                                  sizeof(int));
1661   }
1662
1663   if (elm) {                    /* cached mode and cache hit */
1664     pred_arr = elm->pred_arr;
1665   } else {                      /* not cached mode or cache miss */
1666     double *cost_arr = NULL;
1667     xbt_heap_t pqueue = NULL;
1668     int i = 0;
1669
1670     int nr_nodes = xbt_dynar_length(nodes);
1671     cost_arr = xbt_new0(double, nr_nodes);      /* link cost from src to other hosts */
1672     pred_arr = xbt_new0(int, nr_nodes); /* predecessors in path from src */
1673     pqueue = xbt_heap_new(nr_nodes, xbt_free);
1674
1675     /* initialize */
1676     cost_arr[src_node_id] = 0.0;
1677
1678     for (i = 0; i < nr_nodes; i++) {
1679       if (i != src_node_id) {
1680         cost_arr[i] = DBL_MAX;
1681       }
1682
1683       pred_arr[i] = 0;
1684
1685       /* initialize priority queue */
1686       nodeid = xbt_new0(int, 1);
1687       *nodeid = i;
1688       xbt_heap_push(pqueue, nodeid, cost_arr[i]);
1689
1690     }
1691
1692     /* apply dijkstra using the indexes from the graph's node array */
1693     while (xbt_heap_size(pqueue) > 0) {
1694       int *v_id = xbt_heap_pop(pqueue);
1695       xbt_node_t v_node = xbt_dynar_get_as(nodes, *v_id, xbt_node_t);
1696       xbt_dynar_t out_edges = xbt_graph_node_get_outedges(v_node);
1697       xbt_edge_t edge = NULL;
1698       unsigned int cursor;
1699
1700       xbt_dynar_foreach(out_edges, cursor, edge) {
1701         xbt_node_t u_node = xbt_graph_edge_get_target(edge);
1702         graph_node_data_t data = xbt_graph_node_get_data(u_node);
1703         int u_id = data->graph_id;
1704         route_extended_t tmp_e_route =
1705             (route_extended_t) xbt_graph_edge_get_data(edge);
1706         int cost_v_u = (tmp_e_route->generic_route.link_list)->used;    /* count of links, old model assume 1 */
1707
1708         if (cost_v_u + cost_arr[*v_id] < cost_arr[u_id]) {
1709           pred_arr[u_id] = *v_id;
1710           cost_arr[u_id] = cost_v_u + cost_arr[*v_id];
1711           nodeid = xbt_new0(int, 1);
1712           *nodeid = u_id;
1713           xbt_heap_push(pqueue, nodeid, cost_arr[u_id]);
1714         }
1715       }
1716
1717       /* free item popped from pqueue */
1718       xbt_free(v_id);
1719     }
1720
1721     xbt_free(cost_arr);
1722     xbt_heap_free(pqueue);
1723   }
1724
1725   /* compose route path with links */
1726   char *gw_src = NULL, *gw_dst =
1727       NULL, *prev_gw_src, *prev_gw_dst, *first_gw = NULL;
1728
1729   for (v = dst_node_id; v != src_node_id; v = pred_arr[v]) {
1730     xbt_node_t node_pred_v =
1731         xbt_dynar_get_as(nodes, pred_arr[v], xbt_node_t);
1732     xbt_node_t node_v = xbt_dynar_get_as(nodes, v, xbt_node_t);
1733     xbt_edge_t edge =
1734         xbt_graph_get_edge(routing->route_graph, node_pred_v, node_v);
1735
1736     xbt_assert2(edge != NULL, "no route between host %d and %d", *src_id,
1737                 *dst_id);
1738
1739     prev_gw_src = gw_src;
1740     prev_gw_dst = gw_dst;
1741
1742     e_route = (route_extended_t) xbt_graph_edge_get_data(edge);
1743     gw_src = e_route->src_gateway;
1744     gw_dst = e_route->dst_gateway;
1745
1746     if (v == dst_node_id)
1747       first_gw = gw_dst;
1748
1749     if (rc->hierarchy == SURF_ROUTING_RECURSIVE && v != dst_node_id
1750         && strcmp(gw_dst, prev_gw_src)) {
1751       xbt_dynar_t e_route_as_to_as =
1752           (*(global_routing->get_route)) (gw_dst, prev_gw_src);
1753       xbt_assert2(e_route_as_to_as, "no route between \"%s\" and \"%s\"",
1754                   gw_dst, prev_gw_src);
1755       links = e_route_as_to_as;
1756       int pos = 0;
1757       xbt_dynar_foreach(links, cpt, link) {
1758         xbt_dynar_insert_at(new_e_route->generic_route.link_list, pos,
1759                             &link);
1760         pos++;
1761       }
1762     }
1763
1764     links = e_route->generic_route.link_list;
1765     xbt_dynar_foreach(links, cpt, link) {
1766       xbt_dynar_unshift(new_e_route->generic_route.link_list, &link);
1767     }
1768     size++;
1769   }
1770
1771   if (rc->hierarchy == SURF_ROUTING_RECURSIVE) {
1772     new_e_route->src_gateway = xbt_strdup(gw_src);
1773     new_e_route->dst_gateway = xbt_strdup(first_gw);
1774   }
1775
1776   if (routing->cached && elm == NULL) {
1777     /* add to predecessor list of the current src-host to cache */
1778     elm = xbt_new0(struct route_cache_element, 1);
1779     elm->pred_arr = pred_arr;
1780     elm->size = size;
1781     xbt_dict_set_ext(routing->route_cache, (char *) (&src_id), sizeof(int),
1782                      (xbt_set_elm_t) elm, &route_cache_elem_free);
1783   }
1784
1785   if (!routing->cached)
1786     xbt_free(pred_arr);
1787
1788   return new_e_route;
1789 }
1790
1791 static void dijkstra_finalize(routing_component_t rc)
1792 {
1793   routing_component_dijkstra_t routing = (routing_component_dijkstra_t) rc;
1794
1795   if (routing) {
1796     xbt_graph_free_graph(routing->route_graph, &xbt_free,
1797                          &graph_edge_data_free, &xbt_free);
1798     xbt_dict_free(&routing->graph_node_map);
1799     if (routing->cached)
1800       xbt_dict_free(&routing->route_cache);
1801     /* Delete bypass dict */
1802     xbt_dict_free(&routing->bypassRoutes);
1803     /* Delete index dict */
1804     xbt_dict_free(&(routing->generic_routing.to_index));
1805     /* Delete structure */
1806     xbt_free(routing);
1807   }
1808 }
1809
1810 /* Creation routing model functions */
1811
1812 static void *model_dijkstra_both_create(int cached)
1813 {
1814   routing_component_dijkstra_t new_component =
1815       xbt_new0(s_routing_component_dijkstra_t, 1);
1816   new_component->generic_routing.set_processing_unit =
1817       generic_set_processing_unit;
1818   new_component->generic_routing.set_autonomous_system =
1819       generic_set_autonomous_system;
1820   new_component->generic_routing.set_route = generic_set_route;
1821   new_component->generic_routing.set_ASroute = generic_set_ASroute;
1822   new_component->generic_routing.set_bypassroute = generic_set_bypassroute;
1823   new_component->generic_routing.get_route = dijkstra_get_route;
1824   new_component->generic_routing.get_onelink_routes =
1825       dijkstra_get_onelink_routes;
1826   new_component->generic_routing.get_bypass_route =
1827       generic_get_bypassroute;
1828   new_component->generic_routing.finalize = dijkstra_finalize;
1829   new_component->cached = cached;
1830   new_component->generic_routing.to_index = xbt_dict_new();
1831   new_component->bypassRoutes = xbt_dict_new();
1832   new_component->generic_routing.parse_routes = xbt_dict_new();
1833   return new_component;
1834 }
1835
1836 static void *model_dijkstra_create(void)
1837 {
1838   return model_dijkstra_both_create(0);
1839 }
1840
1841 static void *model_dijkstracache_create(void)
1842 {
1843   return model_dijkstra_both_create(1);
1844 }
1845
1846 static void model_dijkstra_both_load(void)
1847 {
1848   /* use "surfxml_add_callback" to add a parse function call */
1849 }
1850
1851 static void model_dijkstra_both_unload(void)
1852 {
1853   /* use "surfxml_del_callback" to remove a parse function call */
1854 }
1855
1856 static void model_dijkstra_both_end(void)
1857 {
1858   routing_component_dijkstra_t routing =
1859       (routing_component_dijkstra_t) current_routing;
1860   xbt_dict_cursor_t cursor = NULL;
1861   char *key, *data, *end;
1862   const char *sep = "#";
1863   xbt_dynar_t keys;
1864   xbt_node_t node = NULL;
1865   unsigned int cursor2;
1866   xbt_dynar_t nodes = NULL;
1867   int src_id, dst_id;
1868   route_t route;
1869
1870   /* Create the topology graph */
1871   routing->route_graph = xbt_graph_new_graph(1, NULL);
1872   routing->graph_node_map = xbt_dict_new();
1873
1874   if (routing->cached)
1875     routing->route_cache = xbt_dict_new();
1876
1877   /* Put the routes in position */
1878   xbt_dict_foreach(routing->generic_routing.parse_routes, cursor, key, data) {
1879     keys = xbt_str_split_str(key, sep);
1880     src_id = strtol(xbt_dynar_get_as(keys, 0, char *), &end, 10);
1881     dst_id = strtol(xbt_dynar_get_as(keys, 1, char *), &end, 10);
1882     route_extended_t e_route =
1883         generic_new_extended_route(current_routing->hierarchy, data, 0);
1884     route_new_dijkstra(routing, src_id, dst_id, e_route);
1885     xbt_dynar_free(&keys);
1886   }
1887
1888   /* delete the parse table */
1889   xbt_dict_foreach(routing->generic_routing.parse_routes, cursor, key, data) {
1890     route = (route_t) data;
1891     xbt_dynar_free(&(route->link_list));
1892     xbt_free(data);
1893   }
1894
1895   /* delete parse dict */
1896   xbt_dict_free(&(routing->generic_routing.parse_routes));
1897
1898   /* Add the loopback if needed */
1899   if (current_routing->hierarchy == SURF_ROUTING_BASE)
1900     add_loopback_dijkstra(routing);
1901
1902   /* initialize graph indexes in nodes after graph has been built */
1903   nodes = xbt_graph_get_nodes(routing->route_graph);
1904
1905   xbt_dynar_foreach(nodes, cursor2, node) {
1906     graph_node_data_t data = xbt_graph_node_get_data(node);
1907     data->graph_id = cursor2;
1908   }
1909
1910 }
1911
1912 #ifdef HAVE_PCRE_LIB
1913 /* ************************************************** */
1914 /* ************** RULE-BASED ROUTING **************** */
1915
1916 /* Routing model structure */
1917
1918 typedef struct {
1919   s_routing_component_t generic_routing;
1920   xbt_dict_t dict_processing_units;
1921   xbt_dict_t dict_autonomous_systems;
1922   xbt_dynar_t list_route;
1923   xbt_dynar_t list_ASroute;
1924 } s_routing_component_rulebased_t, *routing_component_rulebased_t;
1925
1926 typedef struct s_rule_route s_rule_route_t, *rule_route_t;
1927 typedef struct s_rule_route_extended s_rule_route_extended_t,
1928     *rule_route_extended_t;
1929
1930 struct s_rule_route {
1931   xbt_dynar_t re_str_link;      // dynar of char*
1932   pcre *re_src;
1933   pcre *re_dst;
1934 };
1935
1936 struct s_rule_route_extended {
1937   s_rule_route_t generic_rule_route;
1938   char *re_src_gateway;
1939   char *re_dst_gateway;
1940 };
1941
1942 static void rule_route_free(void *e)
1943 {
1944   rule_route_t *elem = (rule_route_t *) (e);
1945   if (*elem) {
1946     xbt_dynar_free(&(*elem)->re_str_link);
1947     pcre_free((*elem)->re_src);
1948     pcre_free((*elem)->re_dst);
1949     xbt_free((*elem));
1950   }
1951   (*elem) = NULL;
1952 }
1953
1954 static void rule_route_extended_free(void *e)
1955 {
1956   rule_route_extended_t *elem = (rule_route_extended_t *) e;
1957   if (*elem) {
1958     xbt_dynar_free(&(*elem)->generic_rule_route.re_str_link);
1959     pcre_free((*elem)->generic_rule_route.re_src);
1960     pcre_free((*elem)->generic_rule_route.re_dst);
1961     xbt_free((*elem)->re_src_gateway);
1962     xbt_free((*elem)->re_dst_gateway);
1963     xbt_free((*elem));
1964   }
1965 }
1966
1967 /* Parse routing model functions */
1968
1969 static void model_rulebased_set_processing_unit(routing_component_t rc,
1970                                                 const char *name)
1971 {
1972   routing_component_rulebased_t routing =
1973       (routing_component_rulebased_t) rc;
1974   xbt_dict_set(routing->dict_processing_units, name, (void *) (-1), NULL);
1975 }
1976
1977 static void model_rulebased_set_autonomous_system(routing_component_t rc,
1978                                                   const char *name)
1979 {
1980   routing_component_rulebased_t routing =
1981       (routing_component_rulebased_t) rc;
1982   xbt_dict_set(routing->dict_autonomous_systems, name, (void *) (-1),
1983                NULL);
1984 }
1985
1986 static void model_rulebased_set_route(routing_component_t rc,
1987                                       const char *src, const char *dst,
1988                                       route_t route)
1989 {
1990   routing_component_rulebased_t routing =
1991       (routing_component_rulebased_t) rc;
1992   rule_route_t ruleroute = xbt_new0(s_rule_route_t, 1);
1993   const char *error;
1994   int erroffset;
1995   ruleroute->re_src = pcre_compile(src, 0, &error, &erroffset, NULL);
1996   xbt_assert3(ruleroute->re_src,
1997               "PCRE compilation failed at offset %d (\"%s\"): %s\n",
1998               erroffset, src, error);
1999   ruleroute->re_dst = pcre_compile(dst, 0, &error, &erroffset, NULL);
2000   xbt_assert3(ruleroute->re_src,
2001               "PCRE compilation failed at offset %d (\"%s\"): %s\n",
2002               erroffset, dst, error);
2003   ruleroute->re_str_link = route->link_list;
2004   xbt_dynar_push(routing->list_route, &ruleroute);
2005   xbt_free(route);
2006 }
2007
2008 static void model_rulebased_set_ASroute(routing_component_t rc,
2009                                         const char *src, const char *dst,
2010                                         route_extended_t route)
2011 {
2012   routing_component_rulebased_t routing =
2013       (routing_component_rulebased_t) rc;
2014   rule_route_extended_t ruleroute_e = xbt_new0(s_rule_route_extended_t, 1);
2015   const char *error;
2016   int erroffset;
2017   ruleroute_e->generic_rule_route.re_src =
2018       pcre_compile(src, 0, &error, &erroffset, NULL);
2019   xbt_assert3(ruleroute_e->generic_rule_route.re_src,
2020               "PCRE compilation failed at offset %d (\"%s\"): %s\n",
2021               erroffset, src, error);
2022   ruleroute_e->generic_rule_route.re_dst =
2023       pcre_compile(dst, 0, &error, &erroffset, NULL);
2024   xbt_assert3(ruleroute_e->generic_rule_route.re_src,
2025               "PCRE compilation failed at offset %d (\"%s\"): %s\n",
2026               erroffset, dst, error);
2027   ruleroute_e->generic_rule_route.re_str_link =
2028       route->generic_route.link_list;
2029   ruleroute_e->re_src_gateway = route->src_gateway;
2030   ruleroute_e->re_dst_gateway = route->dst_gateway;
2031   xbt_dynar_push(routing->list_ASroute, &ruleroute_e);
2032   xbt_free(route->src_gateway);
2033   xbt_free(route->dst_gateway);
2034   xbt_free(route);
2035 }
2036
2037 static void model_rulebased_set_bypassroute(routing_component_t rc,
2038                                             const char *src,
2039                                             const char *dst,
2040                                             route_extended_t e_route)
2041 {
2042   xbt_die("bypass routing not supported for Route-Based model");
2043 }
2044
2045 #define BUFFER_SIZE 4096        /* result buffer size */
2046 #define OVECCOUNT 30            /* should be a multiple of 3 */
2047
2048 static char *remplace(char *value, const char **src_list, int src_size,
2049                       const char **dst_list, int dst_size)
2050 {
2051
2052   char result_result[BUFFER_SIZE];
2053   int i_result_buffer;
2054   int value_length = (int) strlen(value);
2055   int number = 0;
2056
2057   int i = 0;
2058   i_result_buffer = 0;
2059   do {
2060     if (value[i] == '$') {
2061       i++;                      // skip $
2062
2063       // find the number      
2064       int number_length = 0;
2065       while ('0' <= value[i + number_length]
2066              && value[i + number_length] <= '9') {
2067         number_length++;
2068       }
2069       xbt_assert2(number_length != 0,
2070                   "bad string parameter, no number indication, at offset: %d (\"%s\")",
2071                   i, value);
2072
2073       // solve number
2074       number = atoi(value + i);
2075       i = i + number_length;
2076       xbt_assert2(i + 2 < value_length,
2077                   "bad string parameter, too few chars, at offset: %d (\"%s\")",
2078                   i, value);
2079
2080       // solve the indication
2081       const char **param_list;
2082       int param_size;
2083       if (value[i] == 's' && value[i + 1] == 'r' && value[i + 2] == 'c') {
2084         param_list = src_list;
2085         param_size = src_size;
2086       } else if (value[i] == 'd' && value[i + 1] == 's'
2087                  && value[i + 2] == 't') {
2088         param_list = dst_list;
2089         param_size = dst_size;
2090       } else {
2091         xbt_assert2(0,
2092                     "bad string parameter, support only \"src\" and \"dst\", at offset: %d (\"%s\")",
2093                     i, value);
2094       }
2095       i = i + 3;
2096
2097       xbt_assert4(param_size >= number,
2098                   "bad string parameter, not enough length param_size, at offset: %d (\"%s\") %d %d",
2099                   i, value, param_size, number);
2100
2101       const char *param = param_list[number];
2102       int size = strlen(param);
2103       int cp;
2104       for (cp = 0; cp < size; cp++) {
2105         result_result[i_result_buffer] = param[cp];
2106         i_result_buffer++;
2107         if (i_result_buffer >= BUFFER_SIZE)
2108           break;
2109       }
2110     } else {
2111       result_result[i_result_buffer] = value[i];
2112       i_result_buffer++;
2113       i++;                      // next char
2114     }
2115
2116   } while (i < value_length && i_result_buffer < BUFFER_SIZE);
2117
2118   xbt_assert2(i_result_buffer < BUFFER_SIZE,
2119               "solving string \"%s\", small buffer size (%d)", value,
2120               BUFFER_SIZE);
2121   result_result[i_result_buffer] = 0;
2122   return xbt_strdup(result_result);
2123 }
2124
2125 static route_extended_t rulebased_get_route(routing_component_t rc,
2126                                             const char *src,
2127                                             const char *dst);
2128 static xbt_dynar_t rulebased_get_onelink_routes(routing_component_t rc)
2129 {
2130   xbt_dynar_t ret = xbt_dynar_new (sizeof(onelink_t), xbt_free);
2131   routing_component_rulebased_t routing = (routing_component_rulebased_t)rc;
2132
2133   xbt_dict_cursor_t c1 = NULL;
2134   char *k1, *d1;
2135
2136   //find router
2137   char *router = NULL;
2138   xbt_dict_foreach(routing->dict_processing_units, c1, k1, d1) {
2139     if (strstr (k1, "router")){
2140       router = k1;
2141     }
2142   }
2143   if (!router){
2144     xbt_die ("rulebased_get_onelink_routes works only if the AS is a cluster, sorry.");
2145   }
2146
2147   xbt_dict_foreach(routing->dict_processing_units, c1, k1, d1) {
2148     route_extended_t route = rulebased_get_route (rc, router, k1);
2149
2150     int number_of_links = xbt_dynar_length(route->generic_route.link_list);
2151     if (number_of_links != 3) {
2152       xbt_die ("rulebased_get_onelink_routes works only if the AS is a cluster, sorry.");
2153     }
2154
2155     void *link_ptr;
2156     xbt_dynar_get_cpy (route->generic_route.link_list, 2, &link_ptr);
2157     onelink_t onelink = xbt_new0 (s_onelink_t, 1);
2158     onelink->src = xbt_strdup (k1);
2159     onelink->dst = xbt_strdup (router);
2160     onelink->link_ptr = link_ptr;
2161     xbt_dynar_push (ret, &onelink);
2162   }
2163   return ret;
2164 }
2165
2166 /* Business methods */
2167 static route_extended_t rulebased_get_route(routing_component_t rc,
2168                                             const char *src,
2169                                             const char *dst)
2170 {
2171   xbt_assert1(rc && src
2172               && dst,
2173               "Invalid params for \"get_route\" function at AS \"%s\"",
2174               rc->name);
2175
2176   /* set utils vars */
2177   routing_component_rulebased_t routing =
2178       (routing_component_rulebased_t) rc;
2179
2180   int are_processing_units;
2181   xbt_dynar_t rule_list;
2182   if (xbt_dict_get_or_null(routing->dict_processing_units, src)
2183       && xbt_dict_get_or_null(routing->dict_processing_units, dst)) {
2184     are_processing_units = 1;
2185     rule_list = routing->list_route;
2186   } else if (xbt_dict_get_or_null(routing->dict_autonomous_systems, src)
2187              && xbt_dict_get_or_null(routing->dict_autonomous_systems,
2188                                      dst)) {
2189     are_processing_units = 0;
2190     rule_list = routing->list_ASroute;
2191   } else
2192     xbt_assert2(NULL,
2193                 "Ask for route \"from\"(%s)  or \"to\"(%s) no found in the local table",
2194                 src, dst);
2195
2196   int rc_src = -1;
2197   int rc_dst = -1;
2198   int src_length = (int) strlen(src);
2199   int dst_length = (int) strlen(dst);
2200
2201   xbt_dynar_t links_list =
2202       xbt_dynar_new(global_routing->size_of_link, NULL);
2203
2204   rule_route_t ruleroute;
2205   unsigned int cpt;
2206   int ovector_src[OVECCOUNT];
2207   int ovector_dst[OVECCOUNT];
2208   const char **list_src = NULL;
2209   const char **list_dst = NULL;
2210   xbt_dynar_foreach(rule_list, cpt, ruleroute) {
2211     rc_src =
2212         pcre_exec(ruleroute->re_src, NULL, src, src_length, 0, 0,
2213                   ovector_src, OVECCOUNT);
2214     if (rc_src >= 0) {
2215       rc_dst =
2216           pcre_exec(ruleroute->re_dst, NULL, dst, dst_length, 0, 0,
2217                     ovector_dst, OVECCOUNT);
2218       if (rc_dst >= 0) {
2219         xbt_assert1(!pcre_get_substring_list
2220                     (src, ovector_src, rc_src, &list_src),
2221                     "error solving substring list for src \"%s\"", src);
2222         xbt_assert1(!pcre_get_substring_list
2223                     (dst, ovector_dst, rc_dst, &list_dst),
2224                     "error solving substring list for src \"%s\"", dst);
2225         char *link_name;
2226         xbt_dynar_foreach(ruleroute->re_str_link, cpt, link_name) {
2227           char *new_link_name =
2228               remplace(link_name, list_src, rc_src, list_dst, rc_dst);
2229           void *link =
2230               xbt_dict_get_or_null(surf_network_model->resource_set,
2231                                    new_link_name);
2232           if (link)
2233             xbt_dynar_push(links_list, &link);
2234           else
2235             THROW1(mismatch_error, 0, "Link %s not found", new_link_name);
2236           xbt_free(new_link_name);
2237         }
2238       }
2239     }
2240     if (rc_src >= 0 && rc_dst >= 0)
2241       break;
2242   }
2243
2244   route_extended_t new_e_route = NULL;
2245   if (rc_src >= 0 && rc_dst >= 0) {
2246     new_e_route = xbt_new0(s_route_extended_t, 1);
2247     new_e_route->generic_route.link_list = links_list;
2248   } else if (!strcmp(src, dst) && are_processing_units) {
2249     new_e_route = xbt_new0(s_route_extended_t, 1);
2250     xbt_dynar_push(links_list, &(global_routing->loopback));
2251     new_e_route->generic_route.link_list = links_list;
2252   } else {
2253     xbt_dynar_free(&link_list);
2254   }
2255
2256   if (!are_processing_units && new_e_route) {
2257     rule_route_extended_t ruleroute_extended =
2258         (rule_route_extended_t) ruleroute;
2259     new_e_route->src_gateway =
2260         remplace(ruleroute_extended->re_src_gateway, list_src, rc_src,
2261                  list_dst, rc_dst);
2262     new_e_route->dst_gateway =
2263         remplace(ruleroute_extended->re_dst_gateway, list_src, rc_src,
2264                  list_dst, rc_dst);
2265   }
2266
2267   if (list_src)
2268     pcre_free_substring_list(list_src);
2269   if (list_dst)
2270     pcre_free_substring_list(list_dst);
2271
2272   return new_e_route;
2273 }
2274
2275 static route_extended_t rulebased_get_bypass_route(routing_component_t rc,
2276                                                    const char *src,
2277                                                    const char *dst)
2278 {
2279   return NULL;
2280 }
2281
2282 static void rulebased_finalize(routing_component_t rc)
2283 {
2284   routing_component_rulebased_t routing =
2285       (routing_component_rulebased_t) rc;
2286   if (routing) {
2287     xbt_dict_free(&routing->dict_processing_units);
2288     xbt_dict_free(&routing->dict_autonomous_systems);
2289     xbt_dynar_free(&routing->list_route);
2290     xbt_dynar_free(&routing->list_ASroute);
2291     /* Delete structure */
2292     xbt_free(routing);
2293   }
2294 }
2295
2296 /* Creation routing model functions */
2297 static void *model_rulebased_create(void)
2298 {
2299   routing_component_rulebased_t new_component =
2300       xbt_new0(s_routing_component_rulebased_t, 1);
2301   new_component->generic_routing.set_processing_unit =
2302       model_rulebased_set_processing_unit;
2303   new_component->generic_routing.set_autonomous_system =
2304       model_rulebased_set_autonomous_system;
2305   new_component->generic_routing.set_route = model_rulebased_set_route;
2306   new_component->generic_routing.set_ASroute = model_rulebased_set_ASroute;
2307   new_component->generic_routing.set_bypassroute =
2308       model_rulebased_set_bypassroute;
2309   new_component->generic_routing.get_onelink_routes =
2310       rulebased_get_onelink_routes;
2311   new_component->generic_routing.get_route = rulebased_get_route;
2312   new_component->generic_routing.get_bypass_route = NULL;       //rulebased_get_bypass_route;
2313   new_component->generic_routing.finalize = rulebased_finalize;
2314   /* initialization of internal structures */
2315   new_component->dict_processing_units = xbt_dict_new();
2316   new_component->dict_autonomous_systems = xbt_dict_new();
2317   new_component->list_route =
2318       xbt_dynar_new(sizeof(rule_route_t), &rule_route_free);
2319   new_component->list_ASroute =
2320       xbt_dynar_new(sizeof(rule_route_extended_t),
2321                     &rule_route_extended_free);
2322   return new_component;
2323 }
2324
2325 static void model_rulebased_load(void)
2326 {
2327   /* use "surfxml_add_callback" to add a parse function call */
2328 }
2329
2330 static void model_rulebased_unload(void)
2331 {
2332   /* use "surfxml_del_callback" to remove a parse function call */
2333 }
2334
2335 static void model_rulebased_end(void)
2336 {
2337 }
2338
2339 #endif                          /* HAVE_PCRE_LIB */
2340
2341 /* ************************************************************************** */
2342 /* ******************************* NO ROUTING ******************************* */
2343
2344 /* Routing model structure */
2345 typedef struct {
2346   s_routing_component_t generic_routing;
2347 } s_routing_component_none_t, *routing_component_none_t;
2348
2349 /* Business methods */
2350 static xbt_dynar_t none_get_onelink_routes(routing_component_t rc)
2351 {
2352   return NULL;
2353 }
2354
2355 static route_extended_t none_get_route(routing_component_t rc,
2356                                        const char *src, const char *dst)
2357 {
2358   return NULL;
2359 }
2360
2361 static route_extended_t none_get_bypass_route(routing_component_t rc,
2362                                               const char *src,
2363                                               const char *dst)
2364 {
2365   return NULL;
2366 }
2367
2368 static void none_finalize(routing_component_t rc)
2369 {
2370   xbt_free(rc);
2371 }
2372
2373 static void none_set_processing_unit(routing_component_t rc,
2374                                      const char *name)
2375 {
2376 }
2377
2378 static void none_set_autonomous_system(routing_component_t rc,
2379                                        const char *name)
2380 {
2381 }
2382
2383 /* Creation routing model functions */
2384 static void *model_none_create(void)
2385 {
2386   routing_component_none_t new_component =
2387       xbt_new0(s_routing_component_none_t, 1);
2388   new_component->generic_routing.set_processing_unit =
2389       none_set_processing_unit;
2390   new_component->generic_routing.set_autonomous_system =
2391       none_set_autonomous_system;
2392   new_component->generic_routing.set_route = NULL;
2393   new_component->generic_routing.set_ASroute = NULL;
2394   new_component->generic_routing.set_bypassroute = NULL;
2395   new_component->generic_routing.get_route = none_get_route;
2396   new_component->generic_routing.get_onelink_routes =
2397       none_get_onelink_routes;
2398   new_component->generic_routing.get_bypass_route = none_get_bypass_route;
2399   new_component->generic_routing.finalize = none_finalize;
2400   return new_component;
2401 }
2402
2403 static void model_none_load(void)
2404 {
2405 }
2406
2407 static void model_none_unload(void)
2408 {
2409 }
2410
2411 static void model_none_end(void)
2412 {
2413 }
2414
2415 /* ************************************************** */
2416 /* ********** PATERN FOR NEW ROUTING **************** */
2417
2418 /* The minimal configuration of a new routing model need the next functions,
2419  * also you need to set at the start of the file, the new model in the model
2420  * list. Remember keep the null ending of the list.
2421  */
2422 /*** Routing model structure ***/
2423 // typedef struct {
2424 //   s_routing_component_t generic_routing;
2425 //   /* things that your routing model need */
2426 // } s_routing_component_NEW_t,*routing_component_NEW_t;
2427
2428 /*** Parse routing model functions ***/
2429 // static void model_NEW_set_processing_unit(routing_component_t rc, const char* name) {}
2430 // static void model_NEW_set_autonomous_system(routing_component_t rc, const char* name) {}
2431 // static void model_NEW_set_route(routing_component_t rc, const char* src, const char* dst, route_t route) {}
2432 // static void model_NEW_set_ASroute(routing_component_t rc, const char* src, const char* dst, route_extended_t route) {}
2433 // static void model_NEW_set_bypassroute(routing_component_t rc, const char* src, const char* dst, route_extended_t e_route) {}
2434
2435 /*** Business methods ***/
2436 // static route_extended_t NEW_get_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
2437 // static route_extended_t NEW_get_bypass_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
2438 // static void NEW_finalize(routing_component_t rc) { xbt_free(rc);}
2439
2440 /*** Creation routing model functions ***/
2441 // static void* model_NEW_create(void) {
2442 //   routing_component_NEW_t new_component =  xbt_new0(s_routing_component_NEW_t,1);
2443 //   new_component->generic_routing.set_processing_unit = model_NEW_set_processing_unit;
2444 //   new_component->generic_routing.set_autonomous_system = model_NEW_set_autonomous_system;
2445 //   new_component->generic_routing.set_route = model_NEW_set_route;
2446 //   new_component->generic_routing.set_ASroute = model_NEW_set_ASroute;
2447 //   new_component->generic_routing.set_bypassroute = model_NEW_set_bypassroute;
2448 //   new_component->generic_routing.get_route = NEW_get_route;
2449 //   new_component->generic_routing.get_bypass_route = NEW_get_bypass_route;
2450 //   new_component->generic_routing.finalize = NEW_finalize;
2451 //   /* initialization of internal structures */
2452 //   return new_component;
2453 // } /* mandatory */
2454 // static void  model_NEW_load(void) {}   /* mandatory */
2455 // static void  model_NEW_unload(void) {} /* mandatory */
2456 // static void  model_NEW_end(void) {}    /* mandatory */
2457
2458 /* ************************************************************************** */
2459 /* ************************* GENERIC PARSE FUNCTIONS ************************ */
2460
2461 static void generic_set_processing_unit(routing_component_t rc,
2462                                         const char *name)
2463 {
2464   DEBUG1("Load process unit \"%s\"", name);
2465   int *id = xbt_new0(int, 1);
2466   xbt_dict_t _to_index;
2467   _to_index = current_routing->to_index;
2468   *id = xbt_dict_length(_to_index);
2469   xbt_dict_set(_to_index, name, id, xbt_free);
2470 }
2471
2472 static void generic_set_autonomous_system(routing_component_t rc,
2473                                           const char *name)
2474 {
2475   DEBUG1("Load Autonomous system \"%s\"", name);
2476   int *id = xbt_new0(int, 1);
2477   xbt_dict_t _to_index;
2478   _to_index = current_routing->to_index;
2479   *id = xbt_dict_length(_to_index);
2480   xbt_dict_set(_to_index, name, id, xbt_free);
2481 }
2482
2483 static void generic_set_route(routing_component_t rc, const char *src,
2484                               const char *dst, route_t route)
2485 {
2486   DEBUG2("Load Route from \"%s\" to \"%s\"", src, dst);
2487   xbt_dict_t _parse_routes;
2488   xbt_dict_t _to_index;
2489   char *route_name;
2490   int *src_id, *dst_id;
2491   _to_index = current_routing->to_index;
2492   //TODO
2493   _parse_routes = current_routing->parse_routes;
2494
2495   src_id = xbt_dict_get_or_null(_to_index, src);
2496   dst_id = xbt_dict_get_or_null(_to_index, dst);
2497
2498   xbt_assert2(src_id
2499               && dst_id, "Network elements %s or %s not found", src, dst);
2500   route_name = bprintf("%d#%d", *src_id, *dst_id);
2501
2502   xbt_assert2(xbt_dynar_length(route->link_list) > 0,
2503               "Invalid count of links, must be greater than zero (%s,%s)",
2504               src, dst);
2505   xbt_assert2(!xbt_dict_get_or_null(_parse_routes, route_name),
2506               "The route between \"%s\" and \"%s\" already exist", src,
2507               dst);
2508
2509   xbt_dict_set(_parse_routes, route_name, route, NULL);
2510   xbt_free(route_name);
2511 }
2512
2513 static void generic_set_ASroute(routing_component_t rc, const char *src,
2514                                 const char *dst, route_extended_t e_route)
2515 {
2516   DEBUG4("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", src,
2517          e_route->src_gateway, dst, e_route->dst_gateway);
2518
2519   xbt_dict_t _parse_routes;
2520   xbt_dict_t _to_index;
2521   char *route_name;
2522   int *src_id, *dst_id;
2523   _to_index = current_routing->to_index;
2524   //TODO
2525   _parse_routes = current_routing->parse_routes;
2526
2527   src_id = xbt_dict_get_or_null(_to_index, src);
2528   dst_id = xbt_dict_get_or_null(_to_index, dst);
2529
2530   xbt_assert2(src_id
2531               && dst_id, "Network elements %s or %s not found", src, dst);
2532   route_name = bprintf("%d#%d", *src_id, *dst_id);
2533
2534   xbt_assert2(xbt_dynar_length(e_route->generic_route.link_list) > 0,
2535               "Invalid count of links, must be greater than zero (%s,%s)",
2536               src, dst);
2537   xbt_assert4(!xbt_dict_get_or_null(_parse_routes, route_name),
2538               "The route between \"%s\"(\"%s\") and \"%s\"(\"%s\") already exist",
2539               src, e_route->src_gateway, dst, e_route->dst_gateway);
2540
2541   xbt_dict_set(_parse_routes, route_name, e_route, NULL);
2542   xbt_free(route_name);
2543 }
2544
2545 static void generic_set_bypassroute(routing_component_t rc,
2546                                     const char *src, const char *dst,
2547                                     route_extended_t e_route)
2548 {
2549   DEBUG2("Load bypassRoute from \"%s\" to \"%s\"", src, dst);
2550   model_type_t modeltype = rc->routing;
2551   xbt_dict_t dict_bypassRoutes;
2552   char *route_name;
2553   if (modeltype == &routing_models[SURF_MODEL_FULL]) {
2554     dict_bypassRoutes = ((routing_component_full_t) rc)->bypassRoutes;
2555   } else if (modeltype == &routing_models[SURF_MODEL_FLOYD]) {
2556     dict_bypassRoutes = ((routing_component_floyd_t) rc)->bypassRoutes;
2557   } else if (modeltype == &routing_models[SURF_MODEL_DIJKSTRA] ||
2558              modeltype == &routing_models[SURF_MODEL_DIJKSTRACACHE]) {
2559     dict_bypassRoutes = ((routing_component_dijkstra_t) rc)->bypassRoutes;
2560   } else
2561     xbt_die("\"generic_set_bypassroute\" not supported");
2562   route_name = bprintf("%s#%s", src, dst);
2563   xbt_assert2(xbt_dynar_length(e_route->generic_route.link_list) > 0,
2564               "Invalid count of links, must be greater than zero (%s,%s)",
2565               src, dst);
2566   xbt_assert4(!xbt_dict_get_or_null(dict_bypassRoutes, route_name),
2567               "The bypass route between \"%s\"(\"%s\") and \"%s\"(\"%s\") already exist",
2568               src, e_route->src_gateway, dst, e_route->dst_gateway);
2569
2570   route_extended_t new_e_route =
2571       generic_new_extended_route(SURF_ROUTING_RECURSIVE, e_route, 0);
2572   xbt_dynar_free(&(e_route->generic_route.link_list));
2573   xbt_free(e_route);
2574
2575   xbt_dict_set(dict_bypassRoutes, route_name, new_e_route,
2576                (void (*)(void *)) generic_free_extended_route);
2577   xbt_free(route_name);
2578 }
2579
2580 /* ************************************************************************** */
2581 /* *********************** GENERIC BUSINESS METHODS ************************* */
2582
2583 static xbt_dynar_t generic_get_onelink_routes(routing_component_t rc)
2584 {
2585   xbt_die("\"generic_get_onelink_routes\" not implemented yet");
2586 }
2587
2588 static route_extended_t generic_get_bypassroute(routing_component_t rc,
2589                                                 const char *src,
2590                                                 const char *dst)
2591 {
2592   model_type_t modeltype = rc->routing;
2593   xbt_dict_t dict_bypassRoutes;
2594
2595   if (modeltype == &routing_models[SURF_MODEL_FULL]) {
2596     dict_bypassRoutes = ((routing_component_full_t) rc)->bypassRoutes;
2597   } else if (modeltype == &routing_models[SURF_MODEL_FLOYD]) {
2598     dict_bypassRoutes = ((routing_component_floyd_t) rc)->bypassRoutes;
2599   } else if (modeltype == &routing_models[SURF_MODEL_DIJKSTRA] ||
2600              modeltype == &routing_models[SURF_MODEL_DIJKSTRACACHE]) {
2601     dict_bypassRoutes = ((routing_component_dijkstra_t) rc)->bypassRoutes;
2602   } else
2603     xbt_die("\"generic_get_bypassroute\" not supported");
2604
2605
2606   routing_component_t src_as, dst_as;
2607   int index_src, index_dst;
2608   xbt_dynar_t path_src = NULL;
2609   xbt_dynar_t path_dst = NULL;
2610   routing_component_t current = NULL;
2611   routing_component_t *current_src = NULL;
2612   routing_component_t *current_dst = NULL;
2613
2614   /* (1) find the as where the src and dst are located */
2615   src_as = ((network_element_info_t)
2616             xbt_dict_get_or_null(global_routing->where_network_elements,
2617                                  src))->rc_component;
2618   dst_as = ((network_element_info_t)
2619             xbt_dict_get_or_null(global_routing->where_network_elements,
2620                                  dst))->rc_component;
2621   xbt_assert2(src_as
2622               && dst_as,
2623               "Ask for route \"from\"(%s) or \"to\"(%s) no found", src,
2624               dst);
2625
2626   /* (2) find the path to the root routing component */
2627   path_src = xbt_dynar_new(sizeof(routing_component_t), NULL);
2628   current = src_as;
2629   while (current != NULL) {
2630     xbt_dynar_push(path_src, &current);
2631     current = current->routing_father;
2632   }
2633   path_dst = xbt_dynar_new(sizeof(routing_component_t), NULL);
2634   current = dst_as;
2635   while (current != NULL) {
2636     xbt_dynar_push(path_dst, &current);
2637     current = current->routing_father;
2638   }
2639
2640   /* (3) find the common father */
2641   index_src = (path_src->used) - 1;
2642   index_dst = (path_dst->used) - 1;
2643   current_src = xbt_dynar_get_ptr(path_src, index_src);
2644   current_dst = xbt_dynar_get_ptr(path_dst, index_dst);
2645   while (index_src >= 0 && index_dst >= 0 && *current_src == *current_dst) {
2646     routing_component_t *tmp_src, *tmp_dst;
2647     tmp_src = xbt_dynar_pop_ptr(path_src);
2648     tmp_dst = xbt_dynar_pop_ptr(path_dst);
2649     index_src--;
2650     index_dst--;
2651     current_src = xbt_dynar_get_ptr(path_src, index_src);
2652     current_dst = xbt_dynar_get_ptr(path_dst, index_dst);
2653   }
2654
2655   int max_index_src = (path_src->used) - 1;
2656   int max_index_dst = (path_dst->used) - 1;
2657
2658   int max_index = max(max_index_src, max_index_dst);
2659   int i, max;
2660
2661   route_extended_t e_route_bypass = NULL;
2662
2663   for (max = 0; max <= max_index; max++) {
2664     for (i = 0; i < max; i++) {
2665       if (i <= max_index_src && max <= max_index_dst) {
2666         char *route_name = bprintf("%s#%s",
2667                                    (*(routing_component_t *)
2668                                     (xbt_dynar_get_ptr
2669                                      (path_src, i)))->name,
2670                                    (*(routing_component_t *)
2671                                     (xbt_dynar_get_ptr
2672                                      (path_dst, max)))->name);
2673         e_route_bypass =
2674             xbt_dict_get_or_null(dict_bypassRoutes, route_name);
2675         xbt_free(route_name);
2676       }
2677       if (e_route_bypass)
2678         break;
2679       if (max <= max_index_src && i <= max_index_dst) {
2680         char *route_name = bprintf("%s#%s",
2681                                    (*(routing_component_t *)
2682                                     (xbt_dynar_get_ptr
2683                                      (path_src, max)))->name,
2684                                    (*(routing_component_t *)
2685                                     (xbt_dynar_get_ptr
2686                                      (path_dst, i)))->name);
2687         e_route_bypass =
2688             xbt_dict_get_or_null(dict_bypassRoutes, route_name);
2689         xbt_free(route_name);
2690       }
2691       if (e_route_bypass)
2692         break;
2693     }
2694
2695     if (e_route_bypass)
2696       break;
2697
2698     if (max <= max_index_src && max <= max_index_dst) {
2699       char *route_name = bprintf("%s#%s",
2700                                  (*(routing_component_t *)
2701                                   (xbt_dynar_get_ptr
2702                                    (path_src, max)))->name,
2703                                  (*(routing_component_t *)
2704                                   (xbt_dynar_get_ptr
2705                                    (path_dst, max)))->name);
2706       e_route_bypass = xbt_dict_get_or_null(dict_bypassRoutes, route_name);
2707       xbt_free(route_name);
2708     }
2709     if (e_route_bypass)
2710       break;
2711   }
2712
2713   xbt_dynar_free(&path_src);
2714   xbt_dynar_free(&path_dst);
2715
2716   route_extended_t new_e_route = NULL;
2717
2718   if (e_route_bypass) {
2719     void *link;
2720     unsigned int cpt = 0;
2721     new_e_route = xbt_new0(s_route_extended_t, 1);
2722     new_e_route->src_gateway = xbt_strdup(e_route_bypass->src_gateway);
2723     new_e_route->dst_gateway = xbt_strdup(e_route_bypass->dst_gateway);
2724     new_e_route->generic_route.link_list =
2725         xbt_dynar_new(global_routing->size_of_link, NULL);
2726     xbt_dynar_foreach(e_route_bypass->generic_route.link_list, cpt, link) {
2727       xbt_dynar_push(new_e_route->generic_route.link_list, &link);
2728     }
2729   }
2730
2731   return new_e_route;
2732 }
2733
2734 /* ************************************************************************** */
2735 /* ************************* GENERIC AUX FUNCTIONS ************************** */
2736
2737 static route_extended_t
2738 generic_new_extended_route(e_surf_routing_hierarchy_t hierarchy,
2739                            void *data, int order)
2740 {
2741
2742   char *link_name;
2743   route_extended_t e_route, new_e_route;
2744   route_t route;
2745   unsigned int cpt;
2746   xbt_dynar_t links = NULL, links_id = NULL;
2747
2748   new_e_route = xbt_new0(s_route_extended_t, 1);
2749   new_e_route->generic_route.link_list =
2750       xbt_dynar_new(global_routing->size_of_link, NULL);
2751   new_e_route->src_gateway = NULL;
2752   new_e_route->dst_gateway = NULL;
2753
2754   xbt_assert0(hierarchy == SURF_ROUTING_BASE
2755               || hierarchy == SURF_ROUTING_RECURSIVE,
2756               "the hierarchy type is not defined");
2757
2758   if (hierarchy == SURF_ROUTING_BASE) {
2759
2760     route = (route_t) data;
2761     links = route->link_list;
2762
2763   } else if (hierarchy == SURF_ROUTING_RECURSIVE) {
2764
2765     e_route = (route_extended_t) data;
2766     xbt_assert0(e_route->src_gateway
2767                 && e_route->dst_gateway, "bad gateway, is null");
2768     links = e_route->generic_route.link_list;
2769
2770     /* remeber not erase the gateway names */
2771     new_e_route->src_gateway = e_route->src_gateway;
2772     new_e_route->dst_gateway = e_route->dst_gateway;
2773   }
2774
2775   links_id = new_e_route->generic_route.link_list;
2776
2777   xbt_dynar_foreach(links, cpt, link_name) {
2778
2779     void *link =
2780         xbt_dict_get_or_null(surf_network_model->resource_set, link_name);
2781     if (link) {
2782       if (order)
2783         xbt_dynar_push(links_id, &link);
2784       else
2785         xbt_dynar_unshift(links_id, &link);
2786     } else
2787       THROW1(mismatch_error, 0, "Link %s not found", link_name);
2788   }
2789
2790   return new_e_route;
2791 }
2792
2793 static void generic_free_route(route_t route)
2794 {
2795   if (route) {
2796     xbt_dynar_free(&(route->link_list));
2797     xbt_free(route);
2798   }
2799 }
2800
2801 static void generic_free_extended_route(route_extended_t e_route)
2802 {
2803   if (e_route) {
2804     xbt_dynar_free(&(e_route->generic_route.link_list));
2805     if (e_route->src_gateway)
2806       xbt_free(e_route->src_gateway);
2807     if (e_route->dst_gateway)
2808       xbt_free(e_route->dst_gateway);
2809     xbt_free(e_route);
2810   }
2811 }
2812
2813 static routing_component_t generic_as_exist(routing_component_t find_from,
2814                                             routing_component_t to_find)
2815 {
2816   //return to_find; // FIXME: BYPASSERROR OF FOREACH WITH BREAK
2817   xbt_dict_cursor_t cursor = NULL;
2818   char *key;
2819   int found = 0;
2820   routing_component_t elem;
2821   xbt_dict_foreach(find_from->routing_sons, cursor, key, elem) {
2822     if (to_find == elem || generic_as_exist(elem, to_find)) {
2823       found = 1;
2824       break;
2825     }
2826   }
2827   if (found)
2828     return to_find;
2829   return NULL;
2830 }
2831
2832 static routing_component_t
2833 generic_autonomous_system_exist(routing_component_t rc, char *element)
2834 {
2835   //return rc; // FIXME: BYPASSERROR OF FOREACH WITH BREAK
2836   routing_component_t element_as, result, elem;
2837   xbt_dict_cursor_t cursor = NULL;
2838   char *key;
2839   element_as = ((network_element_info_t)
2840                 xbt_dict_get_or_null
2841                 (global_routing->where_network_elements,
2842                  element))->rc_component;
2843   result = ((routing_component_t) - 1);
2844   if (element_as != rc)
2845     result = generic_as_exist(rc, element_as);
2846
2847   int found = 0;
2848   if (result) {
2849     xbt_dict_foreach(element_as->routing_sons, cursor, key, elem) {
2850       found = !strcmp(elem->name, element);
2851       if (found)
2852         break;
2853     }
2854     if (found)
2855       return element_as;
2856   }
2857   return NULL;
2858 }
2859
2860 static routing_component_t
2861 generic_processing_units_exist(routing_component_t rc, char *element)
2862 {
2863   routing_component_t element_as;
2864   element_as = ((network_element_info_t)
2865                 xbt_dict_get_or_null
2866                 (global_routing->where_network_elements,
2867                  element))->rc_component;
2868   if (element_as == rc)
2869     return element_as;
2870   return generic_as_exist(rc, element_as);
2871 }
2872
2873 static void generic_src_dst_check(routing_component_t rc, const char *src,
2874                                   const char *dst)
2875 {
2876
2877   routing_component_t src_as = ((network_element_info_t)
2878                                 xbt_dict_get_or_null
2879                                 (global_routing->where_network_elements,
2880                                  src))->rc_component;
2881   routing_component_t dst_as = ((network_element_info_t)
2882                                 xbt_dict_get_or_null
2883                                 (global_routing->where_network_elements,
2884                                  dst))->rc_component;
2885
2886   xbt_assert3(src_as != NULL && dst_as != NULL,
2887               "Ask for route \"from\"(%s) or \"to\"(%s) no found at AS \"%s\"",
2888               src, dst, rc->name);
2889   xbt_assert4(src_as == dst_as,
2890               "The src(%s in %s) and dst(%s in %s) are in differents AS",
2891               src, src_as->name, dst, dst_as->name);
2892   xbt_assert2(rc == dst_as,
2893               "The routing component of src and dst is not the same as the network elements belong (%s==%s)",
2894               rc->name, dst_as->name);
2895 }
2896
2897 static void parse_Sconfig(void)
2898 {
2899   //TODO
2900   DEBUG0("WARNING tag config not yet implemented.");
2901 }
2902
2903 static void routing_full_parse_Scluster(void)
2904 {
2905   static int AX_ptr = 0;
2906
2907   char *cluster_id = A_surfxml_cluster_id;
2908   char *cluster_prefix = A_surfxml_cluster_prefix;
2909   char *cluster_suffix = A_surfxml_cluster_suffix;
2910   char *cluster_radical = A_surfxml_cluster_radical;
2911   char *cluster_power = A_surfxml_cluster_power;
2912   char *cluster_bw = A_surfxml_cluster_bw;
2913   char *cluster_lat = A_surfxml_cluster_lat;
2914   char *cluster_bb_bw = A_surfxml_cluster_bb_bw;
2915   char *cluster_bb_lat = A_surfxml_cluster_bb_lat;
2916   char *host_id, *groups, *link_id;
2917   char *router_id, *link_router, *link_backbone, *route_src_dst;
2918   unsigned int iter;
2919   int start, end, i;
2920   xbt_dynar_t radical_elements;
2921   xbt_dynar_t radical_ends;
2922 #ifndef HAVE_PCRE_LIB
2923   xbt_dynar_t tab_elements_num = xbt_dynar_new(sizeof(int), NULL);
2924   char *route_src, *route_dst;
2925   int j;
2926 #endif
2927
2928   static unsigned int surfxml_buffer_stack_stack_ptr = 1;
2929   static unsigned int surfxml_buffer_stack_stack[1024];
2930
2931   surfxml_buffer_stack_stack[0] = 0;
2932
2933   surfxml_bufferstack_push(1);
2934
2935   SURFXML_BUFFER_SET(AS_id, cluster_id);
2936 #ifdef HAVE_PCRE_LIB
2937   SURFXML_BUFFER_SET(AS_routing, "RuleBased");
2938   DEBUG1("<AS id=\"%s\"\trouting=\"RuleBased\">", cluster_id);
2939 #else
2940   SURFXML_BUFFER_SET(AS_routing, "Full");
2941   DEBUG1("<AS id=\"%s\"\trouting=\"Full\">", cluster_id);
2942 #endif
2943   SURFXML_START_TAG(AS);
2944
2945   radical_elements = xbt_str_split(cluster_radical, ",");
2946   xbt_dynar_foreach(radical_elements, iter, groups) {
2947     radical_ends = xbt_str_split(groups, "-");
2948     switch (xbt_dynar_length(radical_ends)) {
2949     case 1:
2950       surf_parse_get_int(&start,
2951                          xbt_dynar_get_as(radical_ends, 0, char *));
2952       host_id = bprintf("%s%d%s", cluster_prefix, start, cluster_suffix);
2953 #ifndef HAVE_PCRE_LIB
2954       xbt_dynar_push_as(tab_elements_num, int, start);
2955 #endif
2956       link_id = bprintf("%s_link_%d", cluster_id, start);
2957
2958       DEBUG2("<host\tid=\"%s\"\tpower=\"%s\"/>", host_id, cluster_power);
2959       SURFXML_BUFFER_SET(host_id, host_id);
2960       SURFXML_BUFFER_SET(host_power, cluster_power);
2961       SURFXML_BUFFER_SET(host_availability, "1.0");
2962       SURFXML_BUFFER_SET(host_availability_file, "");
2963       A_surfxml_host_state = A_surfxml_host_state_ON;
2964       SURFXML_BUFFER_SET(host_state_file, "");
2965       SURFXML_START_TAG(host);
2966       SURFXML_END_TAG(host);
2967
2968       DEBUG3("<link\tid=\"%s\"\tbw=\"%s\"\tlat=\"%s\"/>", link_id,
2969              cluster_bw, cluster_lat);
2970       SURFXML_BUFFER_SET(link_id, link_id);
2971       SURFXML_BUFFER_SET(link_bandwidth, cluster_bw);
2972       SURFXML_BUFFER_SET(link_latency, cluster_lat);
2973       SURFXML_BUFFER_SET(link_bandwidth_file, "");
2974       SURFXML_BUFFER_SET(link_latency_file, "");
2975       A_surfxml_link_state = A_surfxml_link_state_ON;
2976       SURFXML_BUFFER_SET(link_state_file, "");
2977       A_surfxml_link_sharing_policy = A_surfxml_link_sharing_policy_SHARED;
2978       SURFXML_START_TAG(link);
2979       SURFXML_END_TAG(link);
2980
2981       break;
2982
2983     case 2:
2984
2985       surf_parse_get_int(&start,
2986                          xbt_dynar_get_as(radical_ends, 0, char *));
2987       surf_parse_get_int(&end, xbt_dynar_get_as(radical_ends, 1, char *));
2988       DEBUG2("Create hosts and links from %d to %d", start, end);
2989       for (i = start; i <= end; i++) {
2990         host_id = bprintf("%s%d%s", cluster_prefix, i, cluster_suffix);
2991 #ifndef HAVE_PCRE_LIB
2992         xbt_dynar_push_as(tab_elements_num, int, i);
2993 #endif
2994         link_id = bprintf("%s_link_%d", cluster_id, i);
2995
2996         DEBUG2("<host\tid=\"%s\"\tpower=\"%s\"/>", host_id, cluster_power);
2997         SURFXML_BUFFER_SET(host_id, host_id);
2998         SURFXML_BUFFER_SET(host_power, cluster_power);
2999         SURFXML_BUFFER_SET(host_availability, "1.0");
3000         SURFXML_BUFFER_SET(host_availability_file, "");
3001         A_surfxml_host_state = A_surfxml_host_state_ON;
3002         SURFXML_BUFFER_SET(host_state_file, "");
3003         SURFXML_START_TAG(host);
3004         SURFXML_END_TAG(host);
3005
3006         DEBUG3("<link\tid=\"%s\"\tbw=\"%s\"\tlat=\"%s\"/>", link_id,
3007                cluster_bw, cluster_lat);
3008         SURFXML_BUFFER_SET(link_id, link_id);
3009         SURFXML_BUFFER_SET(link_bandwidth, cluster_bw);
3010         SURFXML_BUFFER_SET(link_latency, cluster_lat);
3011         SURFXML_BUFFER_SET(link_bandwidth_file, "");
3012         SURFXML_BUFFER_SET(link_latency_file, "");
3013         A_surfxml_link_state = A_surfxml_link_state_ON;
3014         SURFXML_BUFFER_SET(link_state_file, "");
3015         A_surfxml_link_sharing_policy =
3016             A_surfxml_link_sharing_policy_SHARED;
3017         SURFXML_START_TAG(link);
3018         SURFXML_END_TAG(link);
3019       }
3020       break;
3021
3022     default:
3023       DEBUG0("Malformed radical");
3024     }
3025
3026     xbt_dynar_free(&radical_ends);
3027   }
3028
3029   DEBUG0(" ");
3030   router_id =
3031       bprintf("%s%s_router%s", cluster_prefix, cluster_id,
3032               cluster_suffix);
3033   link_router = bprintf("%s_link_%s_router", cluster_id, cluster_id);
3034   link_backbone = bprintf("%s_backbone", cluster_id);
3035
3036   DEBUG1("<router id=\"%s\"/>", router_id);
3037   SURFXML_BUFFER_SET(router_id, router_id);;
3038   SURFXML_START_TAG(router);
3039   SURFXML_END_TAG(router);
3040
3041   DEBUG3("<link\tid=\"%s\"\tbw=\"%s\"\tlat=\"%s\"/>", link_router,
3042          cluster_bw, cluster_lat);
3043   SURFXML_BUFFER_SET(link_id, link_router);
3044   SURFXML_BUFFER_SET(link_bandwidth, cluster_bw);
3045   SURFXML_BUFFER_SET(link_latency, cluster_lat);
3046   SURFXML_BUFFER_SET(link_bandwidth_file, "");
3047   SURFXML_BUFFER_SET(link_latency_file, "");
3048   A_surfxml_link_state = A_surfxml_link_state_ON;
3049   SURFXML_BUFFER_SET(link_state_file, "");
3050   A_surfxml_link_sharing_policy = A_surfxml_link_sharing_policy_SHARED;
3051   SURFXML_START_TAG(link);
3052   SURFXML_END_TAG(link);
3053
3054   DEBUG3("<link\tid=\"%s\"\tbw=\"%s\"\tlat=\"%s\"/>", link_backbone,
3055          cluster_bb_bw, cluster_bb_lat);
3056   SURFXML_BUFFER_SET(link_id, link_backbone);
3057   SURFXML_BUFFER_SET(link_bandwidth, cluster_bb_bw);
3058   SURFXML_BUFFER_SET(link_latency, cluster_bb_lat);
3059   SURFXML_BUFFER_SET(link_bandwidth_file, "");
3060   SURFXML_BUFFER_SET(link_latency_file, "");
3061   A_surfxml_link_state = A_surfxml_link_state_ON;
3062   SURFXML_BUFFER_SET(link_state_file, "");
3063   A_surfxml_link_sharing_policy = A_surfxml_link_sharing_policy_SHARED;
3064   SURFXML_START_TAG(link);
3065   SURFXML_END_TAG(link);
3066
3067   char *new_suffix = bprintf("%s", "");
3068
3069   radical_elements = xbt_str_split(cluster_suffix, ".");
3070   xbt_dynar_foreach(radical_elements, iter, groups) {
3071     if (strcmp(groups, "")) {
3072       new_suffix = bprintf("%s\\.%s", new_suffix, groups);
3073     }
3074   }
3075   route_src_dst = bprintf("%s(.*)%s", cluster_prefix, new_suffix);
3076
3077   DEBUG0(" ");
3078
3079 #ifdef HAVE_PCRE_LIB
3080
3081   DEBUG2("<route\tsrc=\"%s\"\tdst=\"%s\">", route_src_dst, route_src_dst);
3082   SURFXML_BUFFER_SET(route_src, route_src_dst);
3083   SURFXML_BUFFER_SET(route_dst, route_src_dst);
3084   SURFXML_START_TAG(route);
3085
3086   DEBUG1("<link:ctn\tid=\"%s_link_$1src\"/>", cluster_id);
3087   SURFXML_BUFFER_SET(link_ctn_id, bprintf("%s_link_$1src", cluster_id));
3088   SURFXML_START_TAG(link_ctn);
3089   SURFXML_END_TAG(link_ctn);
3090
3091   DEBUG1("<link:ctn\tid=\"%s_backbone\"/>", cluster_id);
3092   SURFXML_BUFFER_SET(link_ctn_id, bprintf("%s_backbone", cluster_id));
3093   SURFXML_START_TAG(link_ctn);
3094   SURFXML_END_TAG(link_ctn);
3095
3096   DEBUG1("<link:ctn\tid=\"%s_link_$1dst\"/>", cluster_id);
3097   SURFXML_BUFFER_SET(link_ctn_id, bprintf("%s_link_$1dst", cluster_id));
3098   SURFXML_START_TAG(link_ctn);
3099   SURFXML_END_TAG(link_ctn);
3100
3101   DEBUG0("</route>");
3102   SURFXML_END_TAG(route);
3103 #else
3104   for (i = 0; i <= xbt_dynar_length(tab_elements_num); i++) {
3105     for (j = 0; j <= xbt_dynar_length(tab_elements_num); j++) {
3106       if (i == xbt_dynar_length(tab_elements_num)) {
3107         route_src = router_id;
3108       } else {
3109         route_src =
3110             bprintf("%s%d%s", cluster_prefix,
3111                     xbt_dynar_get_as(tab_elements_num, i, int),
3112                     cluster_suffix);
3113       }
3114
3115       if (j == xbt_dynar_length(tab_elements_num)) {
3116         route_dst = router_id;
3117       } else {
3118         route_dst =
3119             bprintf("%s%d%s", cluster_prefix,
3120                     xbt_dynar_get_as(tab_elements_num, j, int),
3121                     cluster_suffix);
3122       }
3123
3124       DEBUG2("<route\tsrc=\"%s\"\tdst=\"%s\">", route_src, route_dst);
3125       SURFXML_BUFFER_SET(route_src, route_src);
3126       SURFXML_BUFFER_SET(route_dst, route_dst);
3127       SURFXML_START_TAG(route);
3128
3129       if (i == xbt_dynar_length(tab_elements_num)) {
3130         route_src = link_router;
3131       } else {
3132         route_src =
3133             bprintf("%s_link_%d", cluster_id,
3134                     xbt_dynar_get_as(tab_elements_num, i, int));
3135       }
3136
3137       if (j == xbt_dynar_length(tab_elements_num)) {
3138         route_dst = link_router;
3139       } else {
3140         route_dst =
3141             bprintf("%s_link_%d", cluster_id,
3142                     xbt_dynar_get_as(tab_elements_num, j, int));
3143       }
3144
3145       DEBUG1("<link:ctn\tid=\"%s\"/>", route_src);
3146       SURFXML_BUFFER_SET(link_ctn_id, route_src);
3147       SURFXML_START_TAG(link_ctn);
3148       SURFXML_END_TAG(link_ctn);
3149
3150       DEBUG1("<link:ctn\tid=\"%s_backbone\"/>", cluster_id);
3151       SURFXML_BUFFER_SET(link_ctn_id, bprintf("%s_backbone", cluster_id));
3152       SURFXML_START_TAG(link_ctn);
3153       SURFXML_END_TAG(link_ctn);
3154
3155       DEBUG1("<link:ctn\tid=\"%s\"/>", route_dst);
3156       SURFXML_BUFFER_SET(link_ctn_id, route_dst);
3157       SURFXML_START_TAG(link_ctn);
3158       SURFXML_END_TAG(link_ctn);
3159
3160       DEBUG0("</route>");
3161       SURFXML_END_TAG(route);
3162     }
3163   }
3164   xbt_dynar_free(&tab_elements_num);
3165 #endif
3166
3167   DEBUG0("</AS>");
3168   SURFXML_END_TAG(AS);
3169   DEBUG0(" ");
3170
3171   surfxml_bufferstack_pop(1);
3172 }
3173
3174 /*
3175  * New methods to init the routing model component from the lua script
3176  */
3177
3178 /*
3179  * calling parse_S_AS_lua with lua values
3180  */
3181 void routing_AS_init(const char *AS_id, const char *AS_routing)
3182 {
3183   parse_S_AS_lua((char *) AS_id, (char *) AS_routing);
3184 }
3185
3186 /*
3187  * calling parse_E_AS_lua to fisnish the creation of routing component
3188  */
3189 void routing_AS_end(const char *AS_id)
3190 {
3191   parse_E_AS_lua((char *) AS_id);
3192 }
3193
3194 /*
3195  * add a host to the network element list
3196  */
3197
3198 void routing_add_host(const char *host_id)
3199 {
3200   parse_S_host_lua((char *) host_id);
3201 }
3202
3203 /*
3204  * Set a new link on the actual list of link for a route or ASroute
3205  */
3206 void routing_add_link(const char *link_id)
3207 {
3208   parse_E_link_c_ctn_new_elem_lua((char *) link_id);
3209 }
3210
3211 /*
3212  *Set the endpoints for a route
3213  */
3214 void routing_set_route(const char *src_id, const char *dst_id)
3215 {
3216   parse_S_route_new_and_endpoints_lua((char *) src_id, (char *) dst_id);
3217 }
3218
3219 /*
3220  * Store the route by calling parse_E_route_store_route
3221  */
3222 void routing_store_route(void)
3223 {
3224   parse_E_route_store_route();
3225 }