1 /* Copyright (c) 2009, 2010. The SimGrid Team.
2 * All rights reserved. */
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. */
8 #include "surf_private.h"
11 #include "xbt/config.h"
12 #include "xbt/graph.h"
15 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route,surf,"Routing part of surf");
17 ////////////////////////////////////////////////////////////////////////////////
18 // HERE START THE NEW CODE
19 ////////////////////////////////////////////////////////////////////////////////
21 //...... DEBUG ONLY .... //
22 static void print_tree(routing_component_t rc);
23 static void print_global(void);
24 static void print_AS_start(void);
25 static void print_AS_end(void);
26 static void print_host(void);
27 static void print_link(void);
28 static void print_route(void);
29 static void print_ctn(void);
30 static void DEBUG_exit(void);
32 ////////////////////////////////////////////////////////////////////////////////
33 // HERE START THE NEW CODE
34 ////////////////////////////////////////////////////////////////////////////////
37 routing_global_t global_routing = NULL;
38 routing_component_t current_routing = NULL;
39 model_type_t current_routing_model = NULL;
41 /* Prototypes of each model */
42 static void* model_full_create(void); /* create structures for full routing model */
43 static void model_full_load(void); /* load parse functions for full routing model */
44 static void model_full_unload(void); /* unload parse functions for full routing model */
45 static void model_full_end(void); /* finalize the creation of full routing model */
47 static void* model_floyd_create(void); /* create structures for floyd routing model */
48 static void model_floyd_load(void); /* load parse functions for floyd routing model */
49 static void model_floyd_unload(void); /* unload parse functions for floyd routing model */
50 static void model_floyd_end(void); /* finalize the creation of floyd routing model */
52 static void* model_dijkstra_both_create(int cached); /* create by calling dijkstra or dijkstracache */
53 static void* model_dijkstra_create(void); /* create structures for dijkstra routing model */
54 static void* model_dijkstracache_create(void); /* create structures for dijkstracache routing model */
55 static void model_dijkstra_both_load(void); /* load parse functions for dijkstra routing model */
56 static void model_dijkstra_both_unload(void); /* unload parse functions for dijkstra routing model */
57 static void model_dijkstra_both_end(void); /* finalize the creation of dijkstra routing model */
59 static void* model_none_create(void); /* none routing model */
60 static void model_none_load(void); /* none routing model */
61 static void model_none_unload(void); /* none routing model */
62 static void model_none_end(void); /* none routing model */
64 /* Table of routing models */
66 // SURF_MODEL_FULL = 0,
68 // SURF_MODEL_DIJKSTRA,
69 // SURF_MODEL_DIJKSTRACACHE,
71 // } e_surf_model_type_t;
73 /* this lines are olny for replace use like index in the model table */
74 #define SURF_MODEL_FULL 0
75 #define SURF_MODEL_FLOYD 1
76 #define SURF_MODEL_DIJKSTRA 2
77 #define SURF_MODEL_DIJKSTRACACHE 3
78 #define SURF_MODEL_NONE 4
80 /* must be finish with null and carefull if change de order */
81 struct s_model_type routing_models[] =
82 { {"Full", "Full routing data (fast, large memory requirements, fully expressive)",
83 model_full_create, model_full_load, model_full_unload, model_full_end },
84 {"Floyd", "Floyd routing data (slow initialization, fast lookup, lesser memory requirements, shortest path routing only)",
85 model_floyd_create, model_floyd_load, model_floyd_unload, model_floyd_end },
86 {"Dijkstra", "Dijkstra routing data (fast initialization, slow lookup, small memory requirements, shortest path routing only)",
87 model_dijkstra_create ,model_dijkstra_both_load, model_dijkstra_both_unload, model_dijkstra_both_end },
88 {"DijkstraCache", "Dijkstra routing data (fast initialization, fast lookup, small memory requirements, shortest path routing only)",
89 model_dijkstracache_create, model_dijkstra_both_load, model_dijkstra_both_unload, model_dijkstra_both_end },
90 {"none", "No routing (usable with Constant network only)",
91 model_none_create, model_none_load, model_none_unload, model_none_end },
92 {NULL,NULL,NULL,NULL,NULL,NULL}};
94 /* ************************************************************************** */
95 /* ***************** GENERIC PARSE FUNCTIONS (declarations) ***************** */
97 static void generic_set_processing_units(routing_component_t rc, const char* name);
98 static void generic_set_autonomous_system(routing_component_t rc, const char* name);
99 static void generic_set_route(routing_component_t rc, const char* src, const char* dst, route_t route);
100 static void generic_set_ASroute(routing_component_t rc, const char* src, const char* dst, route_extended_t e_route);
101 static void generic_set_bypassroute(routing_component_t rc, const char* src, const char* dst, route_extended_t e_route);
103 /* ************************************************************************** */
104 /* *************** GENERIC BUSINESS METHODS (declarations) ****************** */
106 static route_extended_t generic_get_bypassroute(routing_component_t rc, const char* src, const char* dst);
108 /* ************************************************************************** */
109 /* ****************** GENERIC AUX FUNCTIONS (declarations) ****************** */
111 static route_extended_t generic_new_extended_route(e_surf_routing_hierarchy_t hierarchy, void* data, int order);
112 static void generic_free_extended_route(route_extended_t e_route);
113 static routing_component_t generic_autonomous_system_exist(routing_component_t rc, char* element);
114 static routing_component_t generic_processing_units_exist(routing_component_t rc, char* element);
115 static void generic_src_dst_check(routing_component_t rc, const char* src, const char* dst);
117 /* ************************************************************************** */
118 /* **************************** GLOBAL FUNCTIONS **************************** */
120 /* global parse functions */
122 static char* src = NULL; /* temporary store the source name of a route */
123 static char* dst = NULL; /* temporary store the destination name of a route */
124 static char* gw_src = NULL; /* temporary store the gateway source name of a route */
125 static char* gw_dst = NULL; /* temporary store the gateway destination name of a route */
126 static xbt_dynar_t link_list = NULL; /* temporary store of current list link of a route */
129 * \brief Add a "host" to the network element list
131 static void parse_S_host(void) {
132 if( current_routing->hierarchy == SURF_ROUTING_NULL ) current_routing->hierarchy = SURF_ROUTING_BASE;
133 xbt_assert1(!xbt_dict_get_or_null(global_routing->where_network_elements,A_surfxml_host_id),
134 "Reading a host, processing unit \"%s\" already exist",A_surfxml_host_id);
135 xbt_assert1(current_routing->set_processing_units,
136 "no defined method \"set_processing_units\" in \"%s\"",current_routing->name);
137 (*(current_routing->set_processing_units))(current_routing,A_surfxml_host_id);
138 xbt_dict_set(global_routing->where_network_elements,A_surfxml_host_id,(void*)current_routing,NULL);
142 * \brief Add a "router" to the network element list
144 static void parse_S_router(void) {
145 if( current_routing->hierarchy == SURF_ROUTING_NULL ) current_routing->hierarchy = SURF_ROUTING_BASE;
146 xbt_assert1(!xbt_dict_get_or_null(global_routing->where_network_elements,A_surfxml_router_id),
147 "Reading a router, processing unit \"%s\" already exist",A_surfxml_router_id);
148 xbt_assert1(current_routing->set_processing_units,
149 "no defined method \"set_processing_units\" in \"%s\"",current_routing->name);
150 (*(current_routing->set_processing_units))(current_routing,A_surfxml_router_id);
151 xbt_dict_set(global_routing->where_network_elements,A_surfxml_router_id,(void*)current_routing,NULL);
155 * \brief Set the endponints for a route
157 static void parse_S_route_new_and_endpoints(void) {
158 if( src != NULL && dst != NULL && link_list != NULL )
159 THROW2(arg_error,0,"Route between %s to %s can not be defined",A_surfxml_route_src,A_surfxml_route_dst);
160 src = A_surfxml_route_src;
161 dst = A_surfxml_route_dst;
162 link_list = xbt_dynar_new(sizeof(char*), &xbt_free_ref);
166 * \brief Set the endponints and gateways for a ASroute
168 static void parse_S_ASroute_new_and_endpoints(void) {
169 if( src != NULL && dst != NULL && link_list != NULL )
170 THROW2(arg_error,0,"Route between %s to %s can not be defined",A_surfxml_ASroute_src,A_surfxml_ASroute_dst);
171 src = A_surfxml_ASroute_src;
172 dst = A_surfxml_ASroute_dst;
173 gw_src = A_surfxml_ASroute_gw_src;
174 gw_dst = A_surfxml_ASroute_gw_dst;
175 link_list = xbt_dynar_new(sizeof(char*), &xbt_free_ref);
179 * \brief Set the endponints for a bypassRoute
181 static void parse_S_bypassRoute_new_and_endpoints(void) {
182 if( src != NULL && dst != NULL && link_list != NULL )
183 THROW2(arg_error,0,"Bypass Route between %s to %s can not be defined",A_surfxml_bypassRoute_src,A_surfxml_bypassRoute_dst);
184 src = A_surfxml_bypassRoute_src;
185 dst = A_surfxml_bypassRoute_dst;
186 gw_src = A_surfxml_bypassRoute_gw_src;
187 gw_dst = A_surfxml_bypassRoute_gw_dst;
188 link_list = xbt_dynar_new(sizeof(char*), &xbt_free_ref);
192 * \brief Set a new link on the actual list of link for a route or ASroute
194 static void parse_E_link_c_ctn_new_elem(void) {
196 val = xbt_strdup(A_surfxml_link_c_ctn_id);
197 xbt_dynar_push(link_list, &val);
201 * \brief Store the route by calling the set_route function of the current routing component
203 static void parse_E_route_store_route(void) {
204 route_t route = xbt_new0(s_route_t,1);
205 route->link_list = link_list;
207 xbt_assert1(generic_processing_units_exist(current_routing,src),"the \"%s\" processing units gateway does not exist",src);
208 xbt_assert1(generic_processing_units_exist(current_routing,dst),"the \"%s\" processing units gateway does not exist",dst);
209 xbt_assert1(current_routing->set_route,"no defined method \"set_route\" in \"%s\"",current_routing->name);
210 (*(current_routing->set_route))(current_routing,src,dst,route);
217 * \brief Store the ASroute by calling the set_ASroute function of the current routing component
219 static void parse_E_ASroute_store_route(void) {
220 route_extended_t e_route = xbt_new0(s_route_extended_t,1);
221 e_route->generic_route.link_list = link_list;
222 e_route->src_gateway = xbt_strdup(gw_src);
223 e_route->dst_gateway = xbt_strdup(gw_dst);
225 xbt_assert1(generic_autonomous_system_exist(current_routing,src),"the \"%s\" autonomous system does not exist",src);
226 xbt_assert1(generic_autonomous_system_exist(current_routing,dst),"the \"%s\" autonomous system does not exist",dst);
227 xbt_assert1(generic_processing_units_exist(current_routing,gw_src),"the \"%s\" processing units gateway does not exist",gw_src);
228 xbt_assert1(generic_processing_units_exist(current_routing,gw_dst),"the \"%s\" processing units gateway does not exist",gw_dst);
229 xbt_assert1(current_routing->set_ASroute,"no defined method \"set_ASroute\" in \"%s\"",current_routing->name);
230 (*(current_routing->set_ASroute))(current_routing,src,dst,e_route);
239 * \brief Store the bypass route by calling the set_bypassroute function of the current routing component
241 static void parse_E_bypassRoute_store_route(void) {
242 route_extended_t e_route = xbt_new0(s_route_extended_t,1);
243 e_route->generic_route.link_list = link_list;
244 e_route->src_gateway = xbt_strdup(gw_src);
245 e_route->dst_gateway = xbt_strdup(gw_dst);
247 xbt_assert1(generic_autonomous_system_exist(current_routing,src),"the \"%s\" autonomous system does not exist",src);
248 xbt_assert1(generic_autonomous_system_exist(current_routing,dst),"the \"%s\" autonomous system does not exist",dst);
249 xbt_assert1(generic_processing_units_exist(current_routing,gw_src),"the \"%s\" processing units gateway does not exist",gw_src);
250 xbt_assert1(generic_processing_units_exist(current_routing,gw_dst),"the \"%s\" processing units gateway does not exist",gw_dst);
251 xbt_assert1(current_routing->set_bypassroute,"no defined method \"set_bypassroute\" in \"%s\"",current_routing->name);
252 (*(current_routing->set_bypassroute))(current_routing,src,dst,e_route);
261 * \brief Make a new routing component
263 * Detect the routing model type of the routing component, make the new structure and
264 * set the parsing functions to allows parsing the part of the routing tree
266 static void parse_S_AS(void) {
267 routing_component_t new_routing;
268 model_type_t model = NULL;
269 char* wanted = A_surfxml_AS_routing;
271 /* seach the routing model */
272 for (cpt=0;routing_models[cpt].name;cpt++)
273 if (!strcmp(wanted,routing_models[cpt].name))
274 model = &routing_models[cpt];
275 /* if its not exist, error */
276 if( model == NULL ) {
277 fprintf(stderr,"Routing model %s not found. Existing models:\n",wanted);
278 for (cpt=0;routing_models[cpt].name;cpt++)
279 if (!strcmp(wanted,routing_models[cpt].name))
280 fprintf(stderr," %s: %s\n",routing_models[cpt].name,routing_models[cpt].desc);
284 /* make a new routing component */
285 new_routing = (routing_component_t)(*(model->create))();
286 new_routing->routing = model;
287 new_routing->hierarchy = SURF_ROUTING_NULL;
288 new_routing->name = xbt_strdup(A_surfxml_AS_id);
289 new_routing->routing_sons = xbt_dict_new();
290 INFO2("Routing %s for AS %s",A_surfxml_AS_routing,A_surfxml_AS_id);
292 if( current_routing == NULL && global_routing->root == NULL ){
294 /* it is the first one */
295 new_routing->routing_father = NULL;
296 global_routing->root = new_routing;
298 } else if( current_routing != NULL && global_routing->root != NULL ) {
300 xbt_assert1(!xbt_dict_get_or_null(current_routing->routing_sons,A_surfxml_AS_id),
301 "The AS \"%s\" already exist",A_surfxml_AS_id);
302 /* it is a part of the tree */
303 new_routing->routing_father = current_routing;
304 /* set the father behavior */
305 if( current_routing->hierarchy == SURF_ROUTING_NULL ) current_routing->hierarchy = SURF_ROUTING_RECURSIVE;
306 /* add to the sons dictionary */
307 xbt_dict_set(current_routing->routing_sons,A_surfxml_AS_id,(void*)new_routing,NULL);
308 /* add to the father element list */
309 (*(current_routing->set_autonomous_system))(current_routing,A_surfxml_AS_id);
310 /* unload the prev parse rules */
311 (*(current_routing->routing->unload))();
314 THROW0(arg_error,0,"All defined components must be belong to a AS");
316 /* set the new parse rules */
317 (*(new_routing->routing->load))();
318 /* set the new current component of the tree */
319 current_routing = new_routing;
323 * \brief Finish the creation of a new routing component
325 * When you finish to read the routing component, other structures must be created.
326 * the "end" method allow to do that for any routing model type
328 static void parse_E_AS(void) {
330 if( current_routing == NULL ) {
331 THROW1(arg_error,0,"Close AS(%s), that never open",A_surfxml_AS_id);
333 xbt_dict_set(global_routing->where_network_elements,current_routing->name,current_routing->routing_father,NULL);
334 (*(current_routing->routing->unload))();
335 (*(current_routing->routing->end))();
336 current_routing = current_routing->routing_father;
337 if( current_routing != NULL )
338 (*(current_routing->routing->load))();
342 /* Aux Business methods */
345 * \brief Get the AS father and the first elements of the chain
347 * \param src the source host name
348 * \param dst the destination host name
350 * Get the common father of the to processing units, and the first different
351 * father in the chain
353 static xbt_dynar_t elements_father(const char* src,const char* dst) {
355 xbt_assert0(src&&dst,"bad parameters for \"elements_father\" method");
357 xbt_dynar_t result = xbt_dynar_new(sizeof(char*), NULL); // &xbt_free_ref
359 routing_component_t src_as, dst_as;
360 int index_src, index_dst, index_father_src, index_father_dst;
361 xbt_dynar_t path_src = NULL;
362 xbt_dynar_t path_dst = NULL;
363 routing_component_t current = NULL;
364 routing_component_t* current_src = NULL;
365 routing_component_t* current_dst = NULL;
366 routing_component_t* father = NULL;
368 /* (1) find the as where the src and dst are located */
369 src_as = xbt_dict_get_or_null(global_routing->where_network_elements,src);
370 dst_as = xbt_dict_get_or_null(global_routing->where_network_elements,dst);
371 xbt_assert2(src_as&&dst_as, "Ask for route \"from\"(%s) or \"to\"(%s) no found",src,dst);
373 /* (2) find the path to the root routing component */
374 path_src = xbt_dynar_new(sizeof(routing_component_t), NULL);
376 while( current != NULL ) {
377 xbt_dynar_push(path_src,¤t);
378 current = current->routing_father;
380 path_dst = xbt_dynar_new(sizeof(routing_component_t), NULL);
382 while( current != NULL ) {
383 xbt_dynar_push(path_dst,¤t);
384 current = current->routing_father;
387 /* (3) find the common father */
388 index_src = (path_src->used)-1;
389 index_dst = (path_dst->used)-1;
390 current_src = xbt_dynar_get_ptr(path_src,index_src);
391 current_dst = xbt_dynar_get_ptr(path_dst,index_dst);
392 while( index_src >= 0 && index_dst >= 0 && *current_src == *current_dst ) {
393 current_src = xbt_dynar_get_ptr(path_src,index_src);
394 current_dst = xbt_dynar_get_ptr(path_dst,index_dst);
400 current_src = xbt_dynar_get_ptr(path_src,index_src);
401 current_dst = xbt_dynar_get_ptr(path_dst,index_dst);
403 /* (4) they are not in the same routing component, make the path */
404 index_father_src = index_src+1;
405 index_father_dst = index_dst+1;
407 if(*current_src==*current_dst)
408 father = current_src;
410 father = xbt_dynar_get_ptr(path_src,index_father_src);
412 /* (5) result generation */
413 xbt_dynar_push(result,father); // first same the father of src and dst
414 xbt_dynar_push(result,current_src); // second the first different father of src
415 xbt_dynar_push(result,current_dst); // three the first different father of dst
417 xbt_dynar_free(&path_src);
418 xbt_dynar_free(&path_dst);
423 /* Global Business methods */
426 * \brief Recursive function for get_route
428 * \param src the source host name
429 * \param dst the destination host name
431 * This fuction is call by "get_route". It allow to walk through the
432 * routing components tree.
434 static route_extended_t _get_route(const char* src,const char* dst) {
439 DEBUG2("Solve route \"%s\" to \"%s\"",src,dst);
441 xbt_assert0(src&&dst,"bad parameters for \"_get_route\" method");
443 route_extended_t e_route, e_route_cnt, e_route_src, e_route_dst;
445 xbt_dynar_t elem_father_list = elements_father(src,dst);
447 routing_component_t common_father = xbt_dynar_get_as(elem_father_list, 0, routing_component_t);
448 routing_component_t src_father = xbt_dynar_get_as(elem_father_list, 1, routing_component_t);
449 routing_component_t dst_father = xbt_dynar_get_as(elem_father_list, 2, routing_component_t);
451 e_route = xbt_new0(s_route_extended_t,1);
452 e_route->src_gateway = NULL;
453 e_route->dst_gateway = NULL;
454 e_route->generic_route.link_list = xbt_dynar_new(global_routing->size_of_link,NULL);
456 if(src_father==dst_father) { /* SURF_ROUTING_BASE */
458 if( strcmp(src,dst) ){
459 e_route_cnt = (*(common_father->get_route))(common_father,src,dst);
460 xbt_assert2(e_route_cnt,"no route between \"%s\" and \"%s\"",src,dst);
461 xbt_dynar_foreach(e_route_cnt->generic_route.link_list, cpt, link) {
462 xbt_dynar_push(e_route->generic_route.link_list,&link);
464 xbt_dynar_free( &(e_route_cnt->generic_route.link_list) );
465 xbt_free(e_route_cnt);
468 } else { /* SURF_ROUTING_RECURSIVE */
470 route_extended_t e_route_bypass = (*(common_father->get_bypass_route))(common_father,src,dst);
473 e_route_cnt = e_route_bypass;
475 e_route_cnt = (*(common_father->get_route))(common_father,src_father->name,dst_father->name);
477 xbt_assert2(e_route_cnt,"no route between \"%s\" and \"%s\"",src_father->name,dst_father->name);
479 xbt_assert2( (e_route_cnt->src_gateway==NULL) == (e_route_cnt->dst_gateway==NULL) ,
480 "bad gateway for route between \"%s\" and \"%s\"",src,dst);
482 if( src != e_route_cnt->src_gateway ) {
483 e_route_src = _get_route(src,e_route_cnt->src_gateway);
484 xbt_assert2(e_route_src,"no route between \"%s\" and \"%s\"",src,e_route_cnt->src_gateway);
485 xbt_dynar_foreach(e_route_src->generic_route.link_list, cpt, link) {
486 xbt_dynar_push(e_route->generic_route.link_list,&link);
490 xbt_dynar_foreach(e_route_cnt->generic_route.link_list, cpt, link) {
491 xbt_dynar_push(e_route->generic_route.link_list,&link);
494 if( e_route_cnt->dst_gateway != dst ) {
495 e_route_dst = _get_route(e_route_cnt->dst_gateway,dst);
496 xbt_assert2(e_route_dst,"no route between \"%s\" and \"%s\"",e_route_cnt->dst_gateway,dst);
497 xbt_dynar_foreach(e_route_dst->generic_route.link_list, cpt, link) {
498 xbt_dynar_push(e_route->generic_route.link_list,&link);
502 e_route->src_gateway = e_route_cnt->src_gateway;
503 e_route->dst_gateway = e_route_cnt->dst_gateway;
505 xbt_dynar_free( &(e_route_src->generic_route.link_list) );
506 xbt_free(e_route_src);
507 xbt_dynar_free( &(e_route_cnt->generic_route.link_list) );
508 xbt_free(e_route_cnt);
509 xbt_dynar_free( &(e_route_dst->generic_route.link_list) );
510 xbt_free(e_route_dst);
513 xbt_dynar_free(&elem_father_list);
519 * \brief Generic method: find a route between hosts
521 * \param src the source host name
522 * \param dst the destination host name
524 * walk through the routing components tree and find a route between hosts
525 * by calling the differents "get_route" functions in each routing component
527 static xbt_dynar_t get_route(const char* src,const char* dst) {
529 if(global_routing->last_route) xbt_dynar_free( &(global_routing->last_route) );
531 route_extended_t e_route;
532 xbt_dynar_t elem_father_list = elements_father(src,dst);
533 routing_component_t common_father = xbt_dynar_get_as(elem_father_list, 0, routing_component_t);
536 e_route = _get_route(src,dst);
538 e_route = (*(common_father->get_route))(common_father,src,dst);
540 xbt_assert2(e_route,"no route between \"%s\" and \"%s\"",src,dst);
541 global_routing->last_route = e_route->generic_route.link_list;
544 xbt_dynar_free(&elem_father_list);
546 if( xbt_dynar_length(global_routing->last_route)==0 )
549 return global_routing->last_route;
553 * \brief Recursive function for finalize
555 * \param rc the source host name
557 * This fuction is call by "finalize". It allow to finalize the
558 * AS or routing components. It delete all the structures.
560 static void _finalize(routing_component_t rc) {
562 xbt_dict_cursor_t cursor = NULL;
564 routing_component_t elem;
565 xbt_dict_foreach(rc->routing_sons, cursor, key, elem) {
568 xbt_dict_t tmp_sons = rc->routing_sons;
569 char* tmp_name = rc->name;
570 xbt_dict_free(&tmp_sons);
572 xbt_assert1(rc->finalize,"no defined method \"finalize\" in \"%s\"",current_routing->name);
573 (*(rc->finalize))(rc);
578 * \brief Generic method: delete all the routing structures
580 * walk through the routing components tree and delete the structures
581 * by calling the differents "finalize" functions in each routing component
583 static void finalize(void) {
584 /* delete recursibly all the tree */
585 _finalize(global_routing->root);
586 /* delete "where" dict */
587 xbt_dict_free(&(global_routing->where_network_elements));
588 /* delete last_route */
589 xbt_dynar_free(&(global_routing->last_route));
590 /* delete global routing structure */
591 xbt_free(global_routing);
595 * \brief Generic method: create the global routing schema
597 * Make a global routing structure and set all the parsing functions.
599 void routing_model_create(size_t size_of_links, void* loopback) {
601 /* config the uniq global routing */
602 global_routing = xbt_new0(s_routing_global_t,1);
603 global_routing->where_network_elements = xbt_dict_new();
604 global_routing->root = NULL;
605 global_routing->get_route = get_route;
606 global_routing->finalize = finalize;
607 global_routing->loopback = loopback;
608 global_routing->size_of_link = size_of_links;
609 global_routing->last_route = xbt_dynar_new(size_of_links, NULL);
611 /* no current routing at moment */
612 current_routing = NULL;
614 /* parse generic elements */
615 surfxml_add_callback(STag_surfxml_host_cb_list, &parse_S_host);
616 surfxml_add_callback(STag_surfxml_router_cb_list, &parse_S_router);
618 surfxml_add_callback(STag_surfxml_route_cb_list, &parse_S_route_new_and_endpoints);
619 surfxml_add_callback(STag_surfxml_ASroute_cb_list, &parse_S_ASroute_new_and_endpoints);
620 surfxml_add_callback(STag_surfxml_bypassRoute_cb_list, &parse_S_bypassRoute_new_and_endpoints);
622 surfxml_add_callback(ETag_surfxml_link_c_ctn_cb_list, &parse_E_link_c_ctn_new_elem);
624 surfxml_add_callback(ETag_surfxml_route_cb_list, &parse_E_route_store_route);
625 surfxml_add_callback(ETag_surfxml_ASroute_cb_list, &parse_E_ASroute_store_route);
626 surfxml_add_callback(ETag_surfxml_bypassRoute_cb_list, &parse_E_bypassRoute_store_route);
628 surfxml_add_callback(STag_surfxml_AS_cb_list, &parse_S_AS);
629 surfxml_add_callback(ETag_surfxml_AS_cb_list, &parse_E_AS);
632 //surfxml_add_callback(ETag_surfxml_platform_cb_list, &DEBUG_exit);
634 // TODO checked if ANY AS are duplicated
637 /* ************************************************************************** */
638 /* *************************** FULL ROUTING ********************************* */
640 #define TO_ROUTE_FULL(i,j) routing->routing_table[(i)+(j)*table_size]
642 /* Routing model structure */
645 s_routing_component_t generic_routing;
646 xbt_dict_t parse_routes; /* store data during the parse process */
647 xbt_dict_t to_index; /* char* -> network_element_t */
648 xbt_dict_t bypassRoutes;
649 route_extended_t *routing_table;
650 } s_routing_component_full_t,*routing_component_full_t;
652 /* Business methods */
654 static route_extended_t full_get_route(routing_component_t rc, const char* src,const char* dst) {
655 xbt_assert1(rc&&src&&dst, "Invalid params for \"get_route\" function at AS \"%s\"",rc->name);
658 routing_component_full_t routing = (routing_component_full_t)rc;
659 int table_size = xbt_dict_length(routing->to_index);
661 generic_src_dst_check(rc,src,dst);
662 int *src_id = xbt_dict_get_or_null(routing->to_index,src);
663 int *dst_id = xbt_dict_get_or_null(routing->to_index,dst);
664 xbt_assert2(src_id && dst_id, "Ask for route \"from\"(%s) or \"to\"(%s) no found in the local table",src,dst);
666 route_extended_t e_route = NULL;
667 route_extended_t new_e_route = NULL;
671 e_route = TO_ROUTE_FULL(*src_id,*dst_id);
674 new_e_route = xbt_new0(s_route_extended_t,1);
675 new_e_route->src_gateway = e_route->src_gateway;
676 new_e_route->dst_gateway = e_route->dst_gateway;
677 new_e_route->generic_route.link_list = xbt_dynar_new(global_routing->size_of_link,NULL);
678 xbt_dynar_foreach(e_route->generic_route.link_list, cpt, link) {
679 xbt_dynar_push(new_e_route->generic_route.link_list,&link);
685 static void full_finalize(routing_component_t rc) {
686 routing_component_full_t routing = (routing_component_full_t)rc;
687 int table_size = xbt_dict_length(routing->to_index);
690 /* Delete routing table */
691 for (i=0;i<table_size;i++)
692 for (j=0;j<table_size;j++)
693 generic_free_extended_route(TO_ROUTE_FULL(i,j));
694 xbt_free(routing->routing_table);
695 /* Delete bypass dict */
696 xbt_dict_free(&routing->bypassRoutes);
697 /* Delete index dict */
698 xbt_dict_free(&(routing->to_index));
699 /* Delete structure */
704 /* Creation routing model functions */
706 static void* model_full_create(void) {
707 routing_component_full_t new_component = xbt_new0(s_routing_component_full_t,1);
708 new_component->generic_routing.set_processing_units = generic_set_processing_units;
709 new_component->generic_routing.set_autonomous_system = generic_set_autonomous_system;
710 new_component->generic_routing.set_route = generic_set_route;
711 new_component->generic_routing.set_ASroute = generic_set_ASroute;
712 new_component->generic_routing.set_bypassroute = generic_set_bypassroute;
713 new_component->generic_routing.get_route = full_get_route;
714 new_component->generic_routing.get_bypass_route = generic_get_bypassroute;
715 new_component->generic_routing.finalize = full_finalize;
716 new_component->to_index = xbt_dict_new();
717 new_component->bypassRoutes = xbt_dict_new();
718 new_component->parse_routes = xbt_dict_new();
719 return new_component;
722 static void model_full_load(void) {
723 /* use "surfxml_add_callback" to add a parse function call */
726 static void model_full_unload(void) {
727 /* use "surfxml_del_callback" to remove a parse function call */
730 static void model_full_end(void) {
732 char *key, *end; //*src_name, *dst_name
733 const char* sep = "#";
737 route_extended_t e_route;
740 xbt_dict_cursor_t cursor = NULL;
741 xbt_dynar_t keys = NULL;
744 routing_component_full_t routing = ((routing_component_full_t)current_routing);
745 int table_size = xbt_dict_length(routing->to_index);
747 /* Create the routing table */
748 routing->routing_table = xbt_new0(route_extended_t, table_size * table_size);
750 /* Put the routes in position */
751 xbt_dict_foreach(routing->parse_routes, cursor, key, data) {
752 keys = xbt_str_split_str(key, sep);
753 src_id = strtol(xbt_dynar_get_as(keys, 0, char *), &end, 10);
754 dst_id = strtol(xbt_dynar_get_as(keys, 1, char *), &end, 10);
755 TO_ROUTE_FULL(src_id,dst_id) = generic_new_extended_route(current_routing->hierarchy,data,1);
756 xbt_dynar_free(&keys);
759 /* delete the parse table */
760 xbt_dict_foreach(routing->parse_routes, cursor, key, data) {
761 route = (route_t)data;
762 xbt_dynar_free(&(route->link_list));
766 /* delete parse dict */
767 xbt_dict_free(&(routing->parse_routes));
769 /* Add the loopback if needed */
770 if(current_routing->hierarchy == SURF_ROUTING_BASE) {
771 for (i = 0; i < table_size; i++) {
772 e_route = TO_ROUTE_FULL(i, i);
773 if(!e_route) { // && !xbt_dynar_length(e_route->generic_route.link_list)
774 e_route = xbt_new0(s_route_extended_t,1);
775 e_route->src_gateway = NULL;
776 e_route->dst_gateway = NULL;
777 e_route->generic_route.link_list = xbt_dynar_new(global_routing->size_of_link,NULL);
778 xbt_dynar_push(e_route->generic_route.link_list,&global_routing->loopback);
779 TO_ROUTE_FULL(i, i) = e_route;
784 /* Shrink the dynar routes (save unused slots) */
785 for (i=0;i<table_size;i++)
786 for (j=0;j<table_size;j++)
787 if(TO_ROUTE_FULL(i,j))
788 xbt_dynar_shrink(TO_ROUTE_FULL(i,j)->generic_route.link_list,0);
791 /* ************************************************************************** */
792 /* *************************** FLOYD ROUTING ******************************** */
794 #define TO_FLOYD_COST(i,j) cost_table[(i)+(j)*table_size]
795 #define TO_FLOYD_PRED(i,j) (routing->predecessor_table)[(i)+(j)*table_size]
796 #define TO_FLOYD_LINK(i,j) (routing->link_table)[(i)+(j)*table_size]
798 /* Routing model structure */
801 s_routing_component_t generic_routing;
802 /* vars for calculate the floyd algorith. */
803 int *predecessor_table;
804 route_extended_t *link_table; /* char* -> int* */
806 xbt_dict_t bypassRoutes;
807 /* store data during the parse process */
808 xbt_dict_t parse_routes;
809 } s_routing_component_floyd_t,*routing_component_floyd_t;
811 /* Business methods */
813 static route_extended_t floyd_get_route(routing_component_t rc, const char* src,const char* dst) {
814 xbt_assert1(rc&&src&&dst, "Invalid params for \"get_route\" function at AS \"%s\"",rc->name);
817 routing_component_floyd_t routing = (routing_component_floyd_t) rc;
818 int table_size = xbt_dict_length(routing->to_index);
820 generic_src_dst_check(rc,src,dst);
821 int *src_id = xbt_dict_get_or_null(routing->to_index,src);
822 int *dst_id = xbt_dict_get_or_null(routing->to_index,dst);
823 xbt_assert2(src_id && dst_id, "Ask for route \"from\"(%s) or \"to\"(%s) no found in the local table",src,dst);
825 /* create a result route */
826 route_extended_t new_e_route = xbt_new0(s_route_extended_t,1);
827 new_e_route->generic_route.link_list = xbt_dynar_new(global_routing->size_of_link,NULL);
828 new_e_route->src_gateway = NULL;
829 new_e_route->dst_gateway = NULL;
834 char *gw_src,*gw_dst, *prev_gw_src,*prev_gw_dst, *first_gw;
841 pred = TO_FLOYD_PRED(*src_id, pred);
842 if(pred == -1) // if no pred in route -> no route to host
844 xbt_assert2(TO_FLOYD_LINK(pred,prev_pred),"Invalid link for the route between \"%s\" or \"%s\"", src, dst);
846 prev_gw_src = gw_src;
847 prev_gw_dst = gw_dst;
849 route_extended_t e_route = TO_FLOYD_LINK(pred,prev_pred);
850 gw_src = e_route->src_gateway;
851 gw_dst = e_route->dst_gateway;
853 if(first) first_gw = gw_dst;
855 if(rc->hierarchy == SURF_ROUTING_RECURSIVE && !first && strcmp(gw_dst,prev_gw_src)) {
856 //routing_component_t src_as = xbt_dict_get_or_null(global_routing->where_network_elements,gw_dst);
857 //routing_component_t dst_as = xbt_dict_get_or_null(global_routing->where_network_elements,prev_gw_src);
858 //xbt_assert4(src_as==dst_as,"bad routing, differents AS gateways in route \"%s\" to \"%s\" (\"%s\"-\"%s\")",src,dst,gw_dst,prev_gw_src);
859 //route_extended_t e_route_as_to_as = (*(src_as->get_route))(src_as,gw_dst,prev_gw_src);
860 // TODO: - check for error - is possible to generate a route like = as----as----as
861 xbt_dynar_t e_route_as_to_as = (*(global_routing->get_route))(gw_dst,prev_gw_src);
862 xbt_assert2(e_route_as_to_as,"no route between \"%s\" and \"%s\"",gw_dst,prev_gw_src);
863 //links = e_route_as_to_as->generic_route.link_list;
864 links = e_route_as_to_as;
866 xbt_dynar_foreach(links, cpt, link) {
867 xbt_dynar_insert_at(new_e_route->generic_route.link_list,pos,&link);
870 // xbt_dynar_free(&(e_route_as_to_as->generic_route.link_list));
871 // xbt_free(e_route_as_to_as);
874 links = e_route->generic_route.link_list;
875 xbt_dynar_foreach(links, cpt, link) {
876 xbt_dynar_unshift(new_e_route->generic_route.link_list,&link);
880 } while(pred != *src_id);
881 xbt_assert4(pred != -1, "no route from host %d to %d (\"%s\" to \"%s\")", *src_id, *dst_id,src,dst);
883 if(rc->hierarchy == SURF_ROUTING_RECURSIVE) {
884 new_e_route->src_gateway = gw_src;
885 new_e_route->dst_gateway = first_gw;
891 static void floyd_finalize(routing_component_t rc) {
892 routing_component_floyd_t routing = (routing_component_floyd_t)rc;
895 table_size = xbt_dict_length(routing->to_index);
896 /* Delete link_table */
897 for (i=0;i<table_size;i++)
898 for (j=0;j<table_size;j++)
899 generic_free_extended_route(TO_FLOYD_LINK(i,j));
900 xbt_free(routing->link_table);
901 /* Delete bypass dict */
902 xbt_dict_free(&routing->bypassRoutes);
903 /* Delete index dict */
904 xbt_dict_free(&(routing->to_index));
905 /* Delete dictionary index dict, predecessor and links table */
906 xbt_free(routing->predecessor_table);
907 /* Delete structure */
912 static void* model_floyd_create(void) {
913 routing_component_floyd_t new_component = xbt_new0(s_routing_component_floyd_t,1);
914 new_component->generic_routing.set_processing_units = generic_set_processing_units;
915 new_component->generic_routing.set_autonomous_system = generic_set_autonomous_system;
916 new_component->generic_routing.set_route = generic_set_route;
917 new_component->generic_routing.set_ASroute = generic_set_ASroute;
918 new_component->generic_routing.set_bypassroute = generic_set_bypassroute;
919 new_component->generic_routing.get_route = floyd_get_route;
920 new_component->generic_routing.get_bypass_route = generic_get_bypassroute;
921 new_component->generic_routing.finalize = floyd_finalize;
922 new_component->to_index = xbt_dict_new();
923 new_component->bypassRoutes = xbt_dict_new();
924 new_component->parse_routes = xbt_dict_new();
925 return new_component;
928 static void model_floyd_load(void) {
929 /* use "surfxml_add_callback" to add a parse function call */
932 static void model_floyd_unload(void) {
933 /* use "surfxml_del_callback" to remove a parse function call */
936 static void model_floyd_end(void) {
938 routing_component_floyd_t routing = ((routing_component_floyd_t)current_routing);
939 xbt_dict_cursor_t cursor = NULL;
941 char *key,*data, *end; //*src_name, *dst_name;
942 const char *sep = "#";
945 unsigned int i,j,a,b,c;
947 /* set the size of inicial table */
948 int table_size = xbt_dict_length(routing->to_index);
950 /* Create Cost, Predecessor and Link tables */
951 cost_table = xbt_new0(double, table_size*table_size); //link cost from host to host
952 routing->predecessor_table = xbt_new0(int, table_size*table_size); //predecessor host numbers
953 routing->link_table = xbt_new0(route_extended_t, table_size*table_size); //actual link between src and dst
955 /* Initialize costs and predecessors*/
956 for(i = 0; i<table_size;i++)
957 for(j = 0; j<table_size;j++) {
958 TO_FLOYD_COST(i,j) = DBL_MAX;
959 TO_FLOYD_PRED(i,j) = -1;
960 TO_FLOYD_LINK(i,j) = NULL; // FIXED DAVID
963 /* Put the routes in position */
964 xbt_dict_foreach(routing->parse_routes, cursor, key, data) {
965 keys = xbt_str_split_str(key, sep);
966 src_id = strtol(xbt_dynar_get_as(keys, 0, char *), &end, 10);
967 dst_id = strtol(xbt_dynar_get_as(keys, 1, char *), &end, 10);
968 TO_FLOYD_LINK(src_id,dst_id) = generic_new_extended_route(current_routing->hierarchy,data,0);
969 TO_FLOYD_PRED(src_id,dst_id) = src_id;
971 TO_FLOYD_COST(src_id,dst_id) = 1; // assume 1 for now // TODO DAVID REDO
972 xbt_dynar_free(&keys);
975 /* Add the loopback if needed */
976 if(current_routing->hierarchy == SURF_ROUTING_BASE) {
977 for (i = 0; i < table_size; i++) {
978 route_extended_t e_route = TO_FLOYD_LINK(i, i);
979 if(!e_route) { // && !xbt_dynar_length(e_route->generic_route.link_list)
980 e_route = xbt_new0(s_route_extended_t,1);
981 e_route->src_gateway = NULL;
982 e_route->dst_gateway = NULL;
983 e_route->generic_route.link_list = xbt_dynar_new(global_routing->size_of_link,NULL);
984 xbt_dynar_push(e_route->generic_route.link_list,&global_routing->loopback);
985 TO_FLOYD_LINK(i,i) = e_route;
986 TO_FLOYD_PRED(i,i) = i;
987 TO_FLOYD_COST(i,i) = 1;
991 //Calculate path costs
992 for(c=0;c<table_size;c++) {
993 for(a=0;a<table_size;a++) {
994 for(b=0;b<table_size;b++) {
995 if(TO_FLOYD_COST(a,c) < DBL_MAX && TO_FLOYD_COST(c,b) < DBL_MAX) {
996 if(TO_FLOYD_COST(a,b) == DBL_MAX ||
997 (TO_FLOYD_COST(a,c)+TO_FLOYD_COST(c,b) < TO_FLOYD_COST(a,b))) {
998 TO_FLOYD_COST(a,b) = TO_FLOYD_COST(a,c)+TO_FLOYD_COST(c,b);
999 TO_FLOYD_PRED(a,b) = TO_FLOYD_PRED(c,b);
1006 /* delete the parse table */
1007 xbt_dict_foreach(routing->parse_routes, cursor, key, data) {
1008 route_t route = (route_t)data;
1009 xbt_dynar_free(&(route->link_list));
1013 /* delete parse dict */
1014 xbt_dict_free(&(routing->parse_routes));
1017 xbt_free(cost_table);
1020 /* ************************************************************************** */
1021 /* ********** Dijkstra & Dijkstra Cached ROUTING **************************** */
1024 s_routing_component_t generic_routing;
1025 xbt_dict_t to_index;
1026 xbt_dict_t bypassRoutes;
1027 xbt_graph_t route_graph; /* xbt_graph */
1028 xbt_dict_t graph_node_map; /* map */
1029 xbt_dict_t route_cache; /* use in cache mode */
1031 xbt_dict_t parse_routes;
1032 } s_routing_component_dijkstra_t,*routing_component_dijkstra_t;
1035 typedef struct graph_node_data {
1037 int graph_id; //used for caching internal graph id's
1038 } s_graph_node_data_t, * graph_node_data_t;
1040 typedef struct graph_node_map_element {
1042 } s_graph_node_map_element_t, * graph_node_map_element_t;
1044 typedef struct route_cache_element {
1047 } s_route_cache_element_t, * route_cache_element_t;
1049 /* Free functions */
1051 static void route_cache_elem_free(void *e) {
1052 route_cache_element_t elm=(route_cache_element_t)e;
1054 xbt_free(elm->pred_arr);
1059 static void graph_node_map_elem_free(void *e) {
1060 graph_node_map_element_t elm = (graph_node_map_element_t)e;
1066 static void graph_edge_data_free(void *e) {
1067 route_extended_t e_route = (route_extended_t)e;
1069 xbt_dynar_free(&(e_route->generic_route.link_list));
1070 if(e_route->src_gateway) xbt_free(e_route->src_gateway);
1071 if(e_route->dst_gateway) xbt_free(e_route->dst_gateway);
1076 /* Utility functions */
1078 static xbt_node_t route_graph_new_node(routing_component_dijkstra_t rc, int id, int graph_id) {
1079 routing_component_dijkstra_t routing = (routing_component_dijkstra_t) rc;
1080 xbt_node_t node = NULL;
1081 graph_node_data_t data = NULL;
1082 graph_node_map_element_t elm = NULL;
1084 data = xbt_new0(struct graph_node_data, 1); // FIXED by david
1086 data->graph_id = graph_id;
1087 node = xbt_graph_new_node(routing->route_graph, data);
1089 elm = xbt_new0(struct graph_node_map_element, 1); // FIXED by david
1091 xbt_dict_set_ext(routing->graph_node_map, (char*)(&id), sizeof(int), (xbt_set_elm_t)elm, &graph_node_map_elem_free);
1096 static graph_node_map_element_t graph_node_map_search(routing_component_dijkstra_t rc, int id) {
1097 routing_component_dijkstra_t routing = (routing_component_dijkstra_t) rc;
1098 graph_node_map_element_t elm = (graph_node_map_element_t)xbt_dict_get_or_null_ext(routing->graph_node_map, (char*)(&id), sizeof(int));
1104 static void route_new_dijkstra(routing_component_dijkstra_t rc, int src_id, int dst_id, route_extended_t e_route ) {
1105 routing_component_dijkstra_t routing = (routing_component_dijkstra_t) rc;
1107 xbt_node_t src = NULL;
1108 xbt_node_t dst = NULL;
1109 graph_node_map_element_t src_elm = (graph_node_map_element_t)xbt_dict_get_or_null_ext(routing->graph_node_map, (char*)(&src_id), sizeof(int));
1110 graph_node_map_element_t dst_elm = (graph_node_map_element_t)xbt_dict_get_or_null_ext(routing->graph_node_map, (char*)(&dst_id), sizeof(int));
1113 src = src_elm->node;
1116 dst = dst_elm->node;
1118 //add nodes if they don't exist in the graph
1119 if(src_id == dst_id && src == NULL && dst == NULL) {
1120 src = route_graph_new_node(rc,src_id, -1);
1124 src = route_graph_new_node(rc,src_id, -1);
1127 dst = route_graph_new_node(rc,dst_id, -1);
1131 //add link as edge to graph
1132 xbt_graph_new_edge(routing->route_graph, src, dst, e_route);
1135 static void add_loopback_dijkstra(routing_component_dijkstra_t rc) {
1136 routing_component_dijkstra_t routing = (routing_component_dijkstra_t) rc;
1138 xbt_dynar_t nodes = xbt_graph_get_nodes(routing->route_graph);
1140 xbt_node_t node = NULL;
1141 unsigned int cursor2;
1142 xbt_dynar_foreach(nodes, cursor2, node) {
1143 xbt_dynar_t out_edges = xbt_graph_node_get_outedges(node);
1144 xbt_edge_t edge = NULL;
1145 unsigned int cursor;
1148 xbt_dynar_foreach(out_edges, cursor, edge) {
1149 xbt_node_t other_node = xbt_graph_edge_get_target(edge);
1150 if(other_node == node) {
1157 route_extended_t e_route = xbt_new0(s_route_extended_t,1);
1158 e_route->src_gateway = NULL;
1159 e_route->dst_gateway = NULL;
1160 e_route->generic_route.link_list = xbt_dynar_new(global_routing->size_of_link,NULL);
1161 xbt_dynar_push(e_route->generic_route.link_list,&global_routing->loopback);
1162 xbt_graph_new_edge(routing->route_graph, node, node, e_route);
1167 /* Business methods */
1169 static route_extended_t dijkstra_get_route(routing_component_t rc, const char* src,const char* dst) {
1170 xbt_assert1(rc&&src&&dst, "Invalid params for \"get_route\" function at AS \"%s\"",rc->name);
1172 /* set utils vars */
1173 routing_component_dijkstra_t routing = (routing_component_dijkstra_t) rc;
1175 generic_src_dst_check(rc,src,dst);
1176 int *src_id = xbt_dict_get_or_null(routing->to_index,src);
1177 int *dst_id = xbt_dict_get_or_null(routing->to_index,dst);
1178 xbt_assert2(src_id && dst_id, "Ask for route \"from\"(%s) or \"to\"(%s) no found in the local table",src,dst);
1180 /* create a result route */
1181 route_extended_t new_e_route = xbt_new0(s_route_extended_t,1);
1182 new_e_route->generic_route.link_list = xbt_dynar_new(global_routing->size_of_link,NULL);
1183 new_e_route->src_gateway = NULL;
1184 new_e_route->dst_gateway = NULL;
1186 int *pred_arr = NULL;
1187 int src_node_id = 0;
1188 int dst_node_id = 0;
1189 int * nodeid = NULL;
1191 route_extended_t e_route;
1195 xbt_dynar_t links = NULL;
1196 route_cache_element_t elm = NULL;
1197 xbt_dynar_t nodes = xbt_graph_get_nodes(routing->route_graph);
1199 /* Use the graph_node id mapping set to quickly find the nodes */
1200 graph_node_map_element_t src_elm = graph_node_map_search(routing,*src_id);
1201 graph_node_map_element_t dst_elm = graph_node_map_search(routing,*dst_id);
1202 xbt_assert2(src_elm != NULL && dst_elm != NULL, "src %d or dst %d does not exist", *src_id, *dst_id);
1203 src_node_id = ((graph_node_data_t)xbt_graph_node_get_data(src_elm->node))->graph_id;
1204 dst_node_id = ((graph_node_data_t)xbt_graph_node_get_data(dst_elm->node))->graph_id;
1206 /* if the src and dst are the same */ // FIXED by david
1207 if( src_node_id == dst_node_id ) {
1209 xbt_node_t node_s_v = xbt_dynar_get_as(nodes, src_node_id, xbt_node_t);
1210 xbt_node_t node_e_v = xbt_dynar_get_as(nodes, dst_node_id, xbt_node_t);
1211 xbt_edge_t edge = xbt_graph_get_edge(routing->route_graph, node_s_v, node_e_v);
1213 xbt_assert2(edge != NULL, "no route between host %d and %d", *src_id, *dst_id);
1215 e_route = (route_extended_t)xbt_graph_edge_get_data(edge);
1217 // TODO: correct the order
1218 links = e_route->generic_route.link_list;
1219 xbt_dynar_foreach(links, cpt, link) {
1220 xbt_dynar_unshift(new_e_route->generic_route.link_list,&link);
1226 if(routing->cached) {
1227 /*check if there is a cached predecessor list avail */
1228 elm = (route_cache_element_t)xbt_dict_get_or_null_ext(routing->route_cache, (char*)(&src_id), sizeof(int));
1231 if(elm) { //cached mode and cache hit
1232 pred_arr = elm->pred_arr;
1233 } else { //not cached mode or cache miss
1234 double * cost_arr = NULL;
1235 xbt_heap_t pqueue = NULL;
1238 int nr_nodes = xbt_dynar_length(nodes);
1239 cost_arr = xbt_new0(double, nr_nodes); // link cost from src to other hosts
1240 pred_arr = xbt_new0(int, nr_nodes); // predecessors in path from src
1241 pqueue = xbt_heap_new(nr_nodes, xbt_free);
1244 cost_arr[src_node_id] = 0.0;
1246 for(i = 0; i < nr_nodes; i++) {
1247 if(i != src_node_id) {
1248 cost_arr[i] = DBL_MAX;
1253 //initialize priority queue
1254 nodeid = xbt_new0(int, 1);
1256 xbt_heap_push(pqueue, nodeid, cost_arr[i]);
1260 // apply dijkstra using the indexes from the graph's node array
1261 while(xbt_heap_size(pqueue) > 0) {
1262 int * v_id = xbt_heap_pop(pqueue);
1263 xbt_node_t v_node = xbt_dynar_get_as(nodes, *v_id, xbt_node_t);
1264 xbt_dynar_t out_edges = xbt_graph_node_get_outedges(v_node);
1265 xbt_edge_t edge = NULL;
1266 unsigned int cursor;
1268 xbt_dynar_foreach(out_edges, cursor, edge) {
1269 xbt_node_t u_node = xbt_graph_edge_get_target(edge);
1270 graph_node_data_t data = xbt_graph_node_get_data(u_node);
1271 int u_id = data->graph_id;
1272 int cost_v_u = 1; //fixed link cost for now // TODO DAVID REDO
1274 if(cost_v_u + cost_arr[*v_id] < cost_arr[u_id]) {
1275 pred_arr[u_id] = *v_id;
1276 cost_arr[u_id] = cost_v_u + cost_arr[*v_id];
1277 nodeid = xbt_new0(int, 1);
1279 xbt_heap_push(pqueue, nodeid, cost_arr[u_id]);
1283 //free item popped from pqueue
1288 xbt_heap_free(pqueue);
1292 //compose route path with links
1293 char *gw_src,*gw_dst, *prev_gw_src,*prev_gw_dst, *first_gw;
1295 for(v = dst_node_id; v != src_node_id; v = pred_arr[v]) {
1296 xbt_node_t node_pred_v = xbt_dynar_get_as(nodes, pred_arr[v], xbt_node_t);
1297 xbt_node_t node_v = xbt_dynar_get_as(nodes, v, xbt_node_t);
1298 xbt_edge_t edge = xbt_graph_get_edge(routing->route_graph, node_pred_v, node_v);
1300 xbt_assert2(edge != NULL, "no route between host %d and %d", *src_id, *dst_id);
1302 prev_gw_src = gw_src;
1303 prev_gw_dst = gw_dst;
1305 e_route = (route_extended_t)xbt_graph_edge_get_data(edge);
1306 gw_src = e_route->src_gateway;
1307 gw_dst = e_route->dst_gateway;
1309 if(v==dst_node_id) first_gw = gw_dst;
1311 if(rc->hierarchy == SURF_ROUTING_RECURSIVE && v!=dst_node_id && strcmp(gw_dst,prev_gw_src)) {
1312 //routing_component_t src_as = xbt_dict_get_or_null(global_routing->where_network_elements,gw_dst);
1313 //routing_component_t dst_as = xbt_dict_get_or_null(global_routing->where_network_elements,prev_gw_src);
1314 //xbt_assert4(src_as==dst_as,"bad routing, differents AS gateways in route \"%s\" to \"%s\" (\"%s\"-\"%s\")",src,dst,gw_dst,prev_gw_src);
1315 //route_extended_t e_route_as_to_as = (*(src_as->get_route))(src_as,gw_dst,prev_gw_src);
1316 // TODO: - check for error - is possible to generate a route like = as----as----as
1317 xbt_dynar_t e_route_as_to_as = (*(global_routing->get_route))(gw_dst,prev_gw_src);
1318 xbt_assert2(e_route_as_to_as,"no route between \"%s\" and \"%s\"",gw_dst,prev_gw_src);
1319 //links = e_route_as_to_as->generic_route.link_list;
1320 links = e_route_as_to_as;
1322 xbt_dynar_foreach(links, cpt, link) {
1323 xbt_dynar_insert_at(new_e_route->generic_route.link_list,pos,&link);
1326 // xbt_dynar_free(&(e_route_as_to_as->generic_route.link_list));
1327 // xbt_free(e_route_as_to_as);
1330 links = e_route->generic_route.link_list;
1331 xbt_dynar_foreach(links, cpt, link) {
1332 xbt_dynar_unshift(new_e_route->generic_route.link_list,&link);
1337 if(rc->hierarchy == SURF_ROUTING_RECURSIVE) {
1338 new_e_route->src_gateway = gw_src;
1339 new_e_route->dst_gateway = first_gw;
1342 if(routing->cached && elm == NULL) {
1343 //add to predecessor list of the current src-host to cache
1344 elm = xbt_new0(struct route_cache_element, 1); // FIXED by david
1345 elm->pred_arr = pred_arr;
1347 xbt_dict_set_ext(routing->route_cache, (char*)(&src_id), sizeof(int), (xbt_set_elm_t)elm, &route_cache_elem_free);
1350 if(!routing->cached)
1356 static void dijkstra_finalize(routing_component_t rc) {
1357 routing_component_dijkstra_t routing = (routing_component_dijkstra_t) rc;
1360 xbt_graph_free_graph(routing->route_graph, &xbt_free, &graph_edge_data_free, &xbt_free);
1361 xbt_dict_free(&routing->graph_node_map);
1363 xbt_dict_free(&routing->route_cache);
1364 /* Delete bypass dict */
1365 xbt_dict_free(&routing->bypassRoutes);
1366 /* Delete index dict */
1367 xbt_dict_free(&(routing->to_index));
1368 /* Delete structure */
1373 /* Creation routing model functions */
1375 static void* model_dijkstra_both_create(int cached) {
1376 routing_component_dijkstra_t new_component = xbt_new0(s_routing_component_dijkstra_t,1);
1377 new_component->generic_routing.set_processing_units = generic_set_processing_units;
1378 new_component->generic_routing.set_autonomous_system = generic_set_autonomous_system;
1379 new_component->generic_routing.set_route = generic_set_route;
1380 new_component->generic_routing.set_ASroute = generic_set_ASroute;
1381 new_component->generic_routing.set_bypassroute = generic_set_bypassroute;
1382 new_component->generic_routing.get_route = dijkstra_get_route;
1383 new_component->generic_routing.get_bypass_route = generic_get_bypassroute;
1384 new_component->generic_routing.finalize = dijkstra_finalize;
1385 new_component->cached = cached;
1386 new_component->to_index = xbt_dict_new();
1387 new_component->bypassRoutes = xbt_dict_new();
1388 new_component->parse_routes = xbt_dict_new();
1389 return new_component;
1392 static void* model_dijkstra_create(void) {
1393 return model_dijkstra_both_create(0);
1396 static void* model_dijkstracache_create(void) {
1397 return model_dijkstra_both_create(1);
1400 static void model_dijkstra_both_load(void) {
1401 /* use "surfxml_add_callback" to add a parse function call */
1404 static void model_dijkstra_both_unload(void) {
1405 /* use "surfxml_del_callback" to remove a parse function call */
1408 static void model_dijkstra_both_end(void) {
1409 routing_component_dijkstra_t routing = (routing_component_dijkstra_t) current_routing;
1410 xbt_dict_cursor_t cursor = NULL;
1411 char *key, *data, *end;
1412 const char *sep = "#";
1414 xbt_node_t node = NULL;
1415 unsigned int cursor2;
1416 xbt_dynar_t nodes = NULL;
1420 /* Create the topology graph */
1421 routing->route_graph = xbt_graph_new_graph(1, NULL);
1422 routing->graph_node_map = xbt_dict_new();
1425 routing->route_cache = xbt_dict_new();
1427 /* Put the routes in position */
1428 xbt_dict_foreach(routing->parse_routes, cursor, key, data) {
1429 keys = xbt_str_split_str(key, sep);
1430 src_id = strtol(xbt_dynar_get_as(keys, 0, char *), &end, 10);
1431 dst_id = strtol(xbt_dynar_get_as(keys, 1, char *), &end, 10);
1432 route_extended_t e_route = generic_new_extended_route(current_routing->hierarchy,data,0);
1433 route_new_dijkstra(routing,src_id,dst_id,e_route);
1434 xbt_dynar_free(&keys);
1437 /* delete the parse table */
1438 xbt_dict_foreach(routing->parse_routes, cursor, key, data) {
1439 route = (route_t)data;
1440 xbt_dynar_free(&(route->link_list));
1444 /* delete parse dict */
1445 xbt_dict_free(&(routing->parse_routes));
1447 /* Add the loopback if needed */
1448 if(current_routing->hierarchy == SURF_ROUTING_BASE)
1449 add_loopback_dijkstra(routing);
1451 /* initialize graph indexes in nodes after graph has been built */
1452 nodes = xbt_graph_get_nodes(routing->route_graph);
1454 xbt_dynar_foreach(nodes, cursor2, node) {
1455 graph_node_data_t data = xbt_graph_node_get_data(node);
1456 data->graph_id = cursor2;
1461 /* ************************************************************************** */
1462 /* ******************************* NO ROUTING ******************************* */
1464 /* Routing model structure */
1466 s_routing_component_t generic_routing;
1467 } s_routing_component_none_t,*routing_component_none_t;
1469 /* Business methods */
1470 static route_extended_t none_get_route(routing_component_t rc, const char* src,const char* dst){
1473 static route_extended_t none_get_bypass_route(routing_component_t rc, const char* src,const char* dst){
1476 static void none_finalize(routing_component_t rc) {
1480 static void none_set_processing_units(routing_component_t rc, const char* name) {}
1481 static void none_set_autonomous_system(routing_component_t rc, const char* name) {}
1483 /* Creation routing model functions */
1484 static void* model_none_create(void) {
1485 routing_component_none_t new_component = xbt_new0(s_routing_component_none_t,1);
1486 new_component->generic_routing.set_processing_units = none_set_processing_units;
1487 new_component->generic_routing.set_autonomous_system = none_set_autonomous_system;
1488 new_component->generic_routing.set_route = NULL;
1489 new_component->generic_routing.set_ASroute = NULL;
1490 new_component->generic_routing.set_bypassroute = NULL;
1491 new_component->generic_routing.get_route = none_get_route;
1492 new_component->generic_routing.get_bypass_route = none_get_bypass_route;
1493 new_component->generic_routing.finalize = none_finalize;
1494 return new_component;
1497 static void model_none_load(void) {}
1498 static void model_none_unload(void) {}
1499 static void model_none_end(void) {}
1501 /* ************************************************** */
1502 /* ********** PATERN FOR NEW ROUTING **************** */
1504 /* The minimal configuration of a new routing model need the next functions,
1505 * also you need to set at the start of the file, the new model in the model
1506 * list. Remember keep the null ending of the list.
1508 /*** Routing model structure ***/
1510 s_routing_component_t generic_routing;
1511 /* things that your routing model need */
1512 } s_routing_component_NEW_t,*routing_component_NEW_t;
1514 /*** Parse routing model functions ***/
1515 static void model_NEW_set_processing_units(routing_component_t rc, const char* name) {}
1516 static void model_NEW_set_autonomous_system(routing_component_t rc, const char* name) {}
1517 static void model_NEW_set_route(routing_component_t rc, const char* src, const char* dst, route_t route) {}
1518 static void model_NEW_set_ASroute(routing_component_t rc, const char* src, const char* dst, route_extended_t route) {}
1519 static void model_NEW_set_bypassroute(routing_component_t rc, const char* src, const char* dst, route_extended_t e_route) {}
1521 /*** Business methods ***/
1522 static route_extended_t NEW_get_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
1523 static route_extended_t NEW_get_bypass_route(routing_component_t rc, const char* src,const char* dst) {return NULL;}
1524 static void NEW_finalize(routing_component_t rc) {}
1526 // /*** Creation routing model functions ***/
1527 static void* model_NEW_create(void) {
1528 routing_component_full_t new_component = xbt_new0(s_routing_component_full_t,1);
1529 new_component->generic_routing.set_processing_units = model_NEW_set_processing_units;
1530 new_component->generic_routing.set_autonomous_system = model_NEW_set_autonomous_system;
1531 new_component->generic_routing.set_route = model_NEW_set_route;
1532 new_component->generic_routing.set_ASroute = model_NEW_set_ASroute;
1533 new_component->generic_routing.set_bypassroute = model_NEW_set_bypassroute;
1534 new_component->generic_routing.get_route = NEW_get_route;
1535 new_component->generic_routing.get_bypass_route = NEW_get_bypass_route;
1536 new_component->generic_routing.finalize = NEW_finalize;
1537 /* initialization of internal structures */
1538 return new_component;
1540 static void model_NEW_load(void) {} /* mandatory */
1541 static void model_NEW_unload(void) {} /* mandatory */
1542 static void model_NEW_end(void) {} /* mandatory */
1544 /* ************************************************************************** */
1545 /* ************************* GENERIC PARSE FUNCTIONS ************************ */
1547 static void generic_set_processing_units(routing_component_t rc, const char* name) {
1548 DEBUG1("Load process unit \"%s\"",name);
1549 model_type_t modeltype = rc->routing;
1550 int *id = xbt_new0(int,1); // xbt_malloc(sizeof(int)); ?
1551 xbt_dict_t _to_index;
1552 if(modeltype==&routing_models[SURF_MODEL_FULL])
1553 _to_index = ((routing_component_full_t)rc)->to_index;
1555 else if(modeltype==&routing_models[SURF_MODEL_FLOYD])
1556 _to_index = ((routing_component_floyd_t)rc)->to_index;
1558 else if(modeltype==&routing_models[SURF_MODEL_DIJKSTRA]||
1559 modeltype==&routing_models[SURF_MODEL_DIJKSTRACACHE])
1560 _to_index = ((routing_component_dijkstra_t)rc)->to_index;
1562 else xbt_die("\"generic_set_processing_units\" not support");
1563 *id = xbt_dict_length(_to_index);
1564 xbt_dict_set(_to_index,name,id,xbt_free);
1567 static void generic_set_autonomous_system(routing_component_t rc, const char* name) {
1568 DEBUG1("Load Autonomous system \"%s\"",name);
1569 model_type_t modeltype = rc->routing;
1570 int *id = xbt_new0(int,1); // xbt_malloc(sizeof(int)); ?
1571 xbt_dict_t _to_index;
1572 if(modeltype==&routing_models[SURF_MODEL_FULL])
1573 _to_index = ((routing_component_full_t)rc)->to_index;
1575 else if(modeltype==&routing_models[SURF_MODEL_FLOYD])
1576 _to_index = ((routing_component_floyd_t)rc)->to_index;
1578 else if(modeltype==&routing_models[SURF_MODEL_DIJKSTRA]||
1579 modeltype==&routing_models[SURF_MODEL_DIJKSTRACACHE])
1580 _to_index = ((routing_component_dijkstra_t)rc)->to_index;
1582 else xbt_die("\"generic_set_autonomous_system\" not support");
1583 *id = xbt_dict_length(_to_index);
1584 xbt_dict_set(_to_index,name,id,xbt_free);
1587 static void generic_set_route(routing_component_t rc, const char* src, const char* dst, route_t route) {
1588 DEBUG2("Load Route from \"%s\" to \"%s\"",src,dst);
1589 model_type_t modeltype = rc->routing;
1590 xbt_dict_t _parse_routes;
1591 xbt_dict_t _to_index;
1593 int *src_id, *dst_id;
1595 if(modeltype==&routing_models[SURF_MODEL_FULL]) {
1596 _parse_routes = ((routing_component_full_t)rc)->parse_routes;
1597 _to_index = ((routing_component_full_t)rc)->to_index;
1599 } else if(modeltype==&routing_models[SURF_MODEL_FLOYD]) {
1600 _parse_routes = ((routing_component_floyd_t)rc)->parse_routes;
1601 _to_index = ((routing_component_floyd_t)rc)->to_index;
1603 } else if(modeltype==&routing_models[SURF_MODEL_DIJKSTRA]||
1604 modeltype==&routing_models[SURF_MODEL_DIJKSTRACACHE]) {
1605 _parse_routes = ((routing_component_dijkstra_t)rc)->parse_routes;
1606 _to_index = ((routing_component_dijkstra_t)rc)->to_index;
1608 } else xbt_die("\"generic_set_route\" not support");
1610 src_id = xbt_dict_get_or_null(_to_index, src);
1611 dst_id = xbt_dict_get_or_null(_to_index, dst);
1613 xbt_assert2(src_id&&dst_id,"Network elements %s or %s not found", src, dst);
1614 route_name = bprintf("%d#%d",*src_id,*dst_id);
1616 xbt_assert2(xbt_dynar_length(route->link_list)>0, "Invalid count of links, must be greater than zero (%s,%s)",src,dst);
1617 xbt_assert2(!xbt_dict_get_or_null(_parse_routes,route_name),
1618 "The route between \"%s\" and \"%s\" already exist",src,dst);
1620 xbt_dict_set(_parse_routes, route_name, route, NULL);
1621 xbt_free(route_name);
1624 static void generic_set_ASroute(routing_component_t rc, const char* src, const char* dst, route_extended_t e_route) {
1625 DEBUG4("Load ASroute from \"%s(%s)\" to \"%s(%s)\"",src,e_route->src_gateway,dst,e_route->dst_gateway);
1626 model_type_t modeltype = rc->routing;
1627 xbt_dict_t _parse_routes;
1628 xbt_dict_t _to_index;
1630 int *src_id, *dst_id;
1632 if(modeltype==&routing_models[SURF_MODEL_FULL]) {
1633 _parse_routes = ((routing_component_full_t)rc)->parse_routes;
1634 _to_index = ((routing_component_full_t)rc)->to_index;
1636 } else if(modeltype==&routing_models[SURF_MODEL_FLOYD]) {
1637 _parse_routes = ((routing_component_floyd_t)rc)->parse_routes;
1638 _to_index = ((routing_component_floyd_t)rc)->to_index;
1640 } else if(modeltype==&routing_models[SURF_MODEL_DIJKSTRA]||
1641 modeltype==&routing_models[SURF_MODEL_DIJKSTRACACHE]) {
1642 _parse_routes = ((routing_component_dijkstra_t)rc)->parse_routes;
1643 _to_index = ((routing_component_dijkstra_t)rc)->to_index;
1645 } else xbt_die("\"generic_set_route\" not support");
1647 src_id = xbt_dict_get_or_null(_to_index, src);
1648 dst_id = xbt_dict_get_or_null(_to_index, dst);
1650 xbt_assert2(src_id&&dst_id,"Network elements %s or %s not found", src, dst);
1651 route_name = bprintf("%d#%d",*src_id,*dst_id);
1653 xbt_assert2(xbt_dynar_length(e_route->generic_route.link_list)>0, "Invalid count of links, must be greater than zero (%s,%s)",src,dst);
1654 xbt_assert4(!xbt_dict_get_or_null(_parse_routes,route_name),
1655 "The route between \"%s\"(\"%s\") and \"%s\"(\"%s\") already exist",src,e_route->src_gateway,dst,e_route->dst_gateway);
1657 xbt_dict_set(_parse_routes, route_name, e_route, NULL);
1658 xbt_free(route_name);
1661 static void generic_set_bypassroute(routing_component_t rc, const char* src, const char* dst, route_extended_t e_route) {
1662 DEBUG2("Load bypassRoute from \"%s\" to \"%s\"",src,dst);
1663 model_type_t modeltype = rc->routing;
1664 xbt_dict_t dict_bypassRoutes;
1666 if(modeltype==&routing_models[SURF_MODEL_FULL]) {
1667 dict_bypassRoutes = ((routing_component_full_t)rc)->bypassRoutes;
1668 } else if(modeltype==&routing_models[SURF_MODEL_FLOYD]) {
1669 dict_bypassRoutes = ((routing_component_floyd_t)rc)->bypassRoutes;
1670 } else if(modeltype==&routing_models[SURF_MODEL_DIJKSTRA]||
1671 modeltype==&routing_models[SURF_MODEL_DIJKSTRACACHE]) {
1672 dict_bypassRoutes = ((routing_component_dijkstra_t)rc)->bypassRoutes;
1673 } else xbt_die("\"generic_set_bypassroute\" not support");
1674 route_name = bprintf("%s#%s",src,dst);
1675 xbt_assert2(xbt_dynar_length(e_route->generic_route.link_list)>0, "Invalid count of links, must be greater than zero (%s,%s)",src,dst);
1676 xbt_assert4(!xbt_dict_get_or_null(dict_bypassRoutes,route_name),
1677 "The bypass route between \"%s\"(\"%s\") and \"%s\"(\"%s\") already exist",src,e_route->src_gateway,dst,e_route->dst_gateway);
1679 route_extended_t new_e_route = generic_new_extended_route(SURF_ROUTING_RECURSIVE,e_route,0);
1680 xbt_dynar_free( &(e_route->generic_route.link_list) );
1683 xbt_dict_set(dict_bypassRoutes, route_name, new_e_route, (void(*)(void*))generic_free_extended_route );
1684 xbt_free(route_name);
1687 /* ************************************************************************** */
1688 /* *********************** GENERIC BUSINESS METHODS ************************* */
1690 static route_extended_t generic_get_bypassroute(routing_component_t rc, const char* src, const char* dst) {
1691 model_type_t modeltype = rc->routing;
1692 xbt_dict_t dict_bypassRoutes;
1694 if(modeltype==&routing_models[SURF_MODEL_FULL]) {
1695 dict_bypassRoutes = ((routing_component_full_t)rc)->bypassRoutes;
1696 } else if(modeltype==&routing_models[SURF_MODEL_FLOYD]) {
1697 dict_bypassRoutes = ((routing_component_floyd_t)rc)->bypassRoutes;
1698 } else if(modeltype==&routing_models[SURF_MODEL_DIJKSTRA]||
1699 modeltype==&routing_models[SURF_MODEL_DIJKSTRACACHE]) {
1700 dict_bypassRoutes = ((routing_component_dijkstra_t)rc)->bypassRoutes;
1701 } else xbt_die("\"generic_set_bypassroute\" not support");
1704 routing_component_t src_as, dst_as;
1705 int index_src, index_dst;
1706 xbt_dynar_t path_src = NULL;
1707 xbt_dynar_t path_dst = NULL;
1708 routing_component_t current = NULL;
1709 routing_component_t* current_src = NULL;
1710 routing_component_t* current_dst = NULL;
1712 /* (1) find the as where the src and dst are located */
1713 src_as = xbt_dict_get_or_null(global_routing->where_network_elements,src);
1714 dst_as = xbt_dict_get_or_null(global_routing->where_network_elements,dst);
1715 xbt_assert2(src_as&&dst_as, "Ask for route \"from\"(%s) or \"to\"(%s) no found",src,dst);
1717 /* (2) find the path to the root routing component */
1718 path_src = xbt_dynar_new(sizeof(routing_component_t), NULL);
1720 while( current != NULL ) {
1721 xbt_dynar_push(path_src,¤t);
1722 current = current->routing_father;
1724 path_dst = xbt_dynar_new(sizeof(routing_component_t), NULL);
1726 while( current != NULL ) {
1727 xbt_dynar_push(path_dst,¤t);
1728 current = current->routing_father;
1731 /* (3) find the common father */
1732 index_src = (path_src->used)-1;
1733 index_dst = (path_dst->used)-1;
1734 current_src = xbt_dynar_get_ptr(path_src,index_src);
1735 current_dst = xbt_dynar_get_ptr(path_dst,index_dst);
1736 while( index_src >= 0 && index_dst >= 0 && *current_src == *current_dst ) {
1737 routing_component_t *tmp_src,*tmp_dst;
1738 tmp_src = xbt_dynar_pop_ptr(path_src);
1739 tmp_dst = xbt_dynar_pop_ptr(path_dst);
1742 current_src = xbt_dynar_get_ptr(path_src,index_src);
1743 current_dst = xbt_dynar_get_ptr(path_dst,index_dst);
1746 int max_index_src = (path_src->used)-1;
1747 int max_index_dst = (path_dst->used)-1;
1749 int max_index = max(max_index_src,max_index_dst);
1752 route_extended_t e_route_bypass = NULL;
1754 for( max=0;max<=max_index;max++)
1758 if( i <= max_index_src && max <= max_index_dst ) {
1759 char* route_name = bprintf("%s#%s",
1760 (*(routing_component_t*)(xbt_dynar_get_ptr(path_src,i)))->name,
1761 (*(routing_component_t*)(xbt_dynar_get_ptr(path_dst,max)))->name);
1762 e_route_bypass = xbt_dict_get_or_null(dict_bypassRoutes,route_name);
1763 xbt_free(route_name);
1765 if( e_route_bypass ) break;
1766 if( max <= max_index_src && i <= max_index_dst ) {
1767 char* route_name = bprintf("%s#%s",
1768 (*(routing_component_t*)(xbt_dynar_get_ptr(path_src,max)))->name,
1769 (*(routing_component_t*)(xbt_dynar_get_ptr(path_dst,i)))->name);
1770 e_route_bypass = xbt_dict_get_or_null(dict_bypassRoutes,route_name);
1771 xbt_free(route_name);
1773 if( e_route_bypass ) break;
1776 if( e_route_bypass ) break;
1778 if( max <= max_index_src && max <= max_index_dst ) {
1779 char* route_name = bprintf("%s#%s",
1780 (*(routing_component_t*)(xbt_dynar_get_ptr(path_src,max)))->name,
1781 (*(routing_component_t*)(xbt_dynar_get_ptr(path_dst,max)))->name);
1782 e_route_bypass = xbt_dict_get_or_null(dict_bypassRoutes,route_name);
1783 xbt_free(route_name);
1785 if( e_route_bypass ) break;
1788 xbt_dynar_free(&path_src);
1789 xbt_dynar_free(&path_dst);
1791 route_extended_t new_e_route = NULL;
1793 if(e_route_bypass) {
1796 new_e_route = xbt_new0(s_route_extended_t,1);
1797 new_e_route->src_gateway = e_route_bypass->src_gateway;
1798 new_e_route->dst_gateway = e_route_bypass->dst_gateway;
1799 new_e_route->generic_route.link_list = xbt_dynar_new(global_routing->size_of_link,NULL);
1800 xbt_dynar_foreach(e_route_bypass->generic_route.link_list, cpt, link) {
1801 xbt_dynar_push(new_e_route->generic_route.link_list,&link);
1808 /* ************************************************************************** */
1809 /* ************************* GENERIC AUX FUNCTIONS ************************** */
1811 static route_extended_t generic_new_extended_route(e_surf_routing_hierarchy_t hierarchy, void* data, int order) {
1814 route_extended_t e_route, new_e_route;
1817 xbt_dynar_t links, links_id;
1819 new_e_route = xbt_new0(s_route_extended_t,1);
1820 new_e_route->generic_route.link_list = xbt_dynar_new(global_routing->size_of_link,NULL);
1821 new_e_route->src_gateway = NULL;
1822 new_e_route->dst_gateway = NULL;
1824 xbt_assert0(hierarchy == SURF_ROUTING_BASE || hierarchy == SURF_ROUTING_RECURSIVE,
1825 "the hierarchy type is not defined");
1827 if(hierarchy == SURF_ROUTING_BASE ) {
1829 route = (route_t)data;
1830 links = route->link_list;
1832 } else if(hierarchy == SURF_ROUTING_RECURSIVE ) {
1834 e_route = (route_extended_t)data;
1835 xbt_assert0(e_route->src_gateway&&e_route->dst_gateway,"bad gateway, is null");
1836 links = e_route->generic_route.link_list;
1838 /* remeber not erase the gateway names */
1839 new_e_route->src_gateway = e_route->src_gateway;
1840 new_e_route->dst_gateway = e_route->dst_gateway;
1843 links_id = new_e_route->generic_route.link_list;
1845 xbt_dynar_foreach(links, cpt, link_name) {
1847 void* link = xbt_dict_get_or_null(surf_network_model->resource_set, link_name);
1851 xbt_dynar_push(links_id,&link);
1853 xbt_dynar_unshift(links_id,&link);
1856 THROW1(mismatch_error,0,"Link %s not found", link_name);
1862 static void generic_free_extended_route(route_extended_t e_route) {
1864 xbt_dynar_free(&(e_route->generic_route.link_list));
1865 if(e_route->src_gateway) xbt_free(e_route->src_gateway);
1866 if(e_route->dst_gateway) xbt_free(e_route->dst_gateway);
1871 static routing_component_t generic_as_exist(routing_component_t find_from, routing_component_t to_find) {
1872 xbt_dict_cursor_t cursor = NULL;
1875 routing_component_t elem;
1876 xbt_dict_foreach(find_from->routing_sons, cursor, key, elem) {
1877 if( to_find == elem || generic_as_exist(elem,to_find) ){
1882 if(found) return to_find;
1886 static routing_component_t generic_autonomous_system_exist(routing_component_t rc, char* element) {
1887 routing_component_t element_as, result, elem;
1888 xbt_dict_cursor_t cursor = NULL;
1890 element_as = xbt_dict_get_or_null(global_routing->where_network_elements,element);
1891 result = ((routing_component_t)-1);
1893 result = generic_as_exist(rc,element_as);
1897 xbt_dict_foreach(element_as->routing_sons, cursor, key, elem) {
1898 if( !strcmp(elem->name,element) ) return element_as;
1904 static routing_component_t generic_processing_units_exist(routing_component_t rc, char* element) {
1905 routing_component_t element_as;
1906 element_as = xbt_dict_get_or_null(global_routing->where_network_elements,element);
1907 if(element_as==rc) return element_as;
1908 return generic_as_exist(rc,element_as);
1911 static void generic_src_dst_check(routing_component_t rc, const char* src, const char* dst) {
1913 routing_component_t src_as = xbt_dict_get_or_null(global_routing->where_network_elements,src);
1914 routing_component_t dst_as = xbt_dict_get_or_null(global_routing->where_network_elements,dst);
1916 xbt_assert3(src_as != NULL && dst_as != NULL,
1917 "Ask for route \"from\"(%s) or \"to\"(%s) no found at AS \"%s\"",src,dst,rc->name);
1918 xbt_assert4(src_as == dst_as,
1919 "The src(%s in %s) and dst(%s in %s) are in differents AS",src,src_as->name,dst,dst_as->name);
1920 xbt_assert2(rc == dst_as,
1921 "The routing component of src and dst is not the same as the network elements belong (%s==%s)",rc->name,dst_as->name);
1924 ////////////////////////////////////////////////////////////////////////////////
1925 // HERE FINISH THE NEW CODE
1926 ////////////////////////////////////////////////////////////////////////////////
1928 //...... DEBUG ONLY .... //
1929 static void print_tree(routing_component_t rc) {
1930 printf("(%s %s)\n",rc->name,rc->routing->name);
1932 xbt_dict_cursor_t cursor = NULL;
1935 if( rc->routing == &(routing_models[SURF_MODEL_FULL]) )
1936 { xbt_dict_foreach(((routing_component_full_t)rc)->to_index, cursor, key, val) { printf("<%s-%d> ",key,*val); } }
1937 else if( rc->routing == &(routing_models[SURF_MODEL_FLOYD]) )
1938 { xbt_dict_foreach(((routing_component_floyd_t)rc)->to_index, cursor, key, val) { printf("<%s-%d> ",key,*val); }
1941 xbt_assert0(0, "Invalid model for call \"print_tree\"");
1943 routing_component_t elem;
1944 xbt_dict_foreach(rc->routing_sons, cursor, key, elem) {
1951 //...... DEBUG ONLY .... //
1952 static void print_global() {
1953 xbt_dict_cursor_t cursor = NULL;
1955 routing_component_t elem;
1956 xbt_dict_foreach(global_routing->where_network_elements, cursor, key, elem) { printf("<%s>\n",key); }
1959 //...... DEBUG ONLY .... //
1960 static void print_AS_start(void) { printf("AS!!! %s y se rutea \"%s\"\n",A_surfxml_AS_id,A_surfxml_AS_routing); }
1961 static void print_AS_end(void) { printf("AS!!! %s\n",A_surfxml_AS_id); }
1962 static void print_host(void) { printf("host!!! %s\n",A_surfxml_host_id); }
1963 static void print_link(void) { printf("link!!! %s\n",A_surfxml_link_id); }
1964 static void print_route(void) { printf("route!!! %s a %s\n",A_surfxml_route_src,A_surfxml_route_dst); }
1965 static void print_ctn(void) { printf("ctn!!! %s\n",A_surfxml_link_c_ctn_id); }
1967 //...... DEBUG ONLY .... //
1968 static void DEBUG_exit(void) {
1970 // printf("-------- print tree elements -----\n");
1971 // print_tree(global_routing->root);
1972 // printf("----------------------------------\n\n");
1974 // printf("-------- network_elements --------\n");
1976 // printf("----------------------------------\n\n");
1978 // const char* names[] = { "11.A","11.B","11.C","121.A","121.B","122.A","13.A","13.B"};
1979 // int i,j,total = 8;
1981 // printf("-- print all the example routes --\n");
1982 // const char* names[] = { "11.A","11.B","11.C"};
1983 // int i,j,total = 3;
1985 // const char* names[] = { "141.A","141.B","143.A","143.B"};
1986 // int i,j,total = 4;
1988 // const char* names[] = { "15.A","15.B","15.C" };
1989 // int i,j,total = 3;
1991 // const char* names[] = { "142.A","142.B","142.C", "11.A","11.B","11.C","141.A","141.B","143.A","143.B","11.A","11.B","11.C","121.A","121.B","122.A","13.A","13.B"};
1992 // int i,j,total = 3+4+8+3;
1994 // const char* names[] = { "142.A","142.B","142.C" };
1995 // int i,j,total = 3;
1997 const char* names[] = { "11.A","11.B","11.C",
2002 "142.A","142.B","142.C",
2004 "15.A","15.B","15.C"};
2005 unsigned int i,j,total = 3+2+1+2+2+3+2+3;
2007 // const char* names[] = { "141.A","143.A" };
2008 // int i,j,total = 2;
2010 printf("-- print all the example routes --\n");
2013 for(i=0;i<total;i++) {
2014 for(j=0;j<total;j++) {
2015 printf("route from %s to %s >>>\n ",names[i],names[j]);
2016 links = (*(global_routing->get_route))(names[i],names[j]);
2019 xbt_dynar_foreach(links, cpt, link) {
2020 s_surf_resource_t* generic_resource = link;
2021 printf(" %s",generic_resource->name);
2026 printf("----------------------------------\n\n");
2028 printf("---------- call finalize ---------\n");
2029 (*(global_routing->finalize))();
2030 printf("----------------------------------\n");
2035 ////////////////////////////////////////////////////////////////////////////////
2036 // HERE END THE NEW CODE
2037 ////////////////////////////////////////////////////////////////////////////////
2040 // /* ************************************************************************** */
2041 // /* *************************** FULL ROUTING ********************************* */
2043 // s_routing_t generic_routing;
2044 // xbt_dynar_t *routing_table;
2046 // size_t size_of_link;
2047 // } s_routing_full_t,*routing_full_t;
2049 // #define ROUTE_FULL(i,j) ((routing_full_t)used_routing)->routing_table[(i)+(j)*(used_routing)->host_count]
2050 // #define HOST2ROUTER(id) ((id)+(2<<29))
2051 // #define ROUTER2HOST(id) ((id)-(2>>29))
2052 // #define ISROUTER(id) ((id)>=(2<<29))
2055 // * Free the onelink routes
2057 // static void onelink_route_elem_free(void *e) {
2058 // s_onelink_t tmp = (s_onelink_t)e;
2067 // static void routing_full_parse_Shost(void) {
2068 // int *val = xbt_malloc(sizeof(int));
2069 // DEBUG2("Seen host %s (#%d)",A_surfxml_host_id,used_routing->host_count);
2070 // *val = used_routing->host_count++;
2071 // xbt_dict_set(used_routing->host_id,A_surfxml_host_id,val,xbt_free);
2072 // #ifdef HAVE_TRACING
2073 // TRACE_surf_host_define_id (A_surfxml_host_id, *val);
2077 // static void routing_full_parse_Srouter(void) {
2078 // int *val = xbt_malloc(sizeof(int));
2079 // DEBUG3("Seen router %s (%d -> #%d)",A_surfxml_router_id,used_routing->router_count,
2080 // HOST2ROUTER(used_routing->router_count));
2081 // *val = HOST2ROUTER(used_routing->router_count++);
2082 // xbt_dict_set(used_routing->host_id,A_surfxml_router_id,val,xbt_free);
2083 // #ifdef HAVE_TRACING
2084 // TRACE_surf_host_define_id (A_surfxml_host_id, *val);
2085 // TRACE_surf_host_declaration (A_surfxml_host_id, 0);
2089 // static int src_id = -1;
2090 // static int dst_id = -1;
2091 // static void routing_full_parse_Sroute_set_endpoints(void)
2093 // src_id = *(int*)xbt_dict_get(used_routing->host_id,A_surfxml_route_src);
2094 // dst_id = *(int*)xbt_dict_get(used_routing->host_id,A_surfxml_route_dst);
2095 // DEBUG4("Route %s %d -> %s %d",A_surfxml_route_src,src_id,A_surfxml_route_dst,dst_id);
2096 // route_action = A_surfxml_route_action;
2099 // static void routing_full_parse_Eroute(void)
2102 // if (src_id != -1 && dst_id != -1) {
2103 // name = bprintf("%x#%x", src_id, dst_id);
2104 // manage_route(route_table, name, route_action, 0);
2109 // /* Cluster tag functions */
2111 // static void routing_full_parse_change_cpu_data(const char *hostName,
2112 // const char *surfxml_host_power,
2113 // const char *surfxml_host_availability,
2114 // const char *surfxml_host_availability_file,
2115 // const char *surfxml_host_state_file)
2119 // SURFXML_BUFFER_SET(host_id, hostName);
2120 // SURFXML_BUFFER_SET(host_power, surfxml_host_power /*hostPower */ );
2121 // SURFXML_BUFFER_SET(host_availability, surfxml_host_availability);
2122 // SURFXML_BUFFER_SET(host_availability_file, surfxml_host_availability_file);
2123 // SURFXML_BUFFER_SET(host_state_file, surfxml_host_state_file);
2126 // static void routing_full_parse_change_link_data(const char *linkName,
2127 // const char *surfxml_link_bandwidth,
2128 // const char *surfxml_link_bandwidth_file,
2129 // const char *surfxml_link_latency,
2130 // const char *surfxml_link_latency_file,
2131 // const char *surfxml_link_state_file)
2135 // SURFXML_BUFFER_SET(link_id, linkName);
2136 // SURFXML_BUFFER_SET(link_bandwidth, surfxml_link_bandwidth);
2137 // SURFXML_BUFFER_SET(link_bandwidth_file, surfxml_link_bandwidth_file);
2138 // SURFXML_BUFFER_SET(link_latency, surfxml_link_latency);
2139 // SURFXML_BUFFER_SET(link_latency_file, surfxml_link_latency_file);
2140 // SURFXML_BUFFER_SET(link_state_file, surfxml_link_state_file);
2143 // static void routing_full_parse_Scluster(void)
2145 // static int AX_ptr = 0;
2147 // char *cluster_id = A_surfxml_cluster_id;
2148 // char *cluster_prefix = A_surfxml_cluster_prefix;
2149 // char *cluster_suffix = A_surfxml_cluster_suffix;
2150 // char *cluster_radical = A_surfxml_cluster_radical;
2151 // char *cluster_power = A_surfxml_cluster_power;
2152 // char *cluster_bw = A_surfxml_cluster_bw;
2153 // char *cluster_lat = A_surfxml_cluster_lat;
2154 // char *cluster_bb_bw = A_surfxml_cluster_bb_bw;
2155 // char *cluster_bb_lat = A_surfxml_cluster_bb_lat;
2156 // char *backbone_name;
2157 // unsigned int it1,it2;
2158 // char *name1,*name2;
2159 // xbt_dynar_t names = NULL;
2160 // surfxml_bufferstack_push(1);
2162 // /* Make set a set to parse the prefix/suffix/radical into a neat list of names */
2163 // DEBUG4("Make <set id='%s' prefix='%s' suffix='%s' radical='%s'>",
2164 // cluster_id,cluster_prefix,cluster_suffix,cluster_radical);
2165 // SURFXML_BUFFER_SET(set_id, cluster_id);
2166 // SURFXML_BUFFER_SET(set_prefix, cluster_prefix);
2167 // SURFXML_BUFFER_SET(set_suffix, cluster_suffix);
2168 // SURFXML_BUFFER_SET(set_radical, cluster_radical);
2170 // SURFXML_START_TAG(set);
2171 // SURFXML_END_TAG(set);
2173 // names = xbt_dict_get(set_list,cluster_id);
2175 // xbt_dynar_foreach(names,it1,name1) {
2176 // /* create the host */
2177 // routing_full_parse_change_cpu_data(name1, cluster_power, "1.0", "", "");
2178 // A_surfxml_host_state = A_surfxml_host_state_ON;
2180 // SURFXML_START_TAG(host);
2181 // SURFXML_END_TAG(host);
2183 // /* Here comes the link */
2184 // routing_full_parse_change_link_data(name1, cluster_bw, "", cluster_lat, "", "");
2185 // A_surfxml_link_state = A_surfxml_link_state_ON;
2186 // A_surfxml_link_sharing_policy = A_surfxml_link_sharing_policy_SHARED;
2188 // SURFXML_START_TAG(link);
2189 // SURFXML_END_TAG(link);
2192 // /* Make backbone link */
2193 // backbone_name = bprintf("%s_bb", cluster_id);
2194 // routing_full_parse_change_link_data(backbone_name, cluster_bb_bw, "", cluster_bb_lat, "",
2196 // A_surfxml_link_state = A_surfxml_link_state_ON;
2197 // A_surfxml_link_sharing_policy = A_surfxml_link_sharing_policy_FATPIPE;
2199 // SURFXML_START_TAG(link);
2200 // SURFXML_END_TAG(link);
2202 // /* And now the internal routes */
2203 // xbt_dynar_foreach(names,it1,name1) {
2204 // xbt_dynar_foreach(names,it2,name2) {
2205 // if (strcmp(name1,name2)) {
2206 // A_surfxml_route_action = A_surfxml_route_action_POSTPEND;
2207 // SURFXML_BUFFER_SET(route_src,name1);
2208 // SURFXML_BUFFER_SET(route_dst,name2);
2209 // SURFXML_START_TAG(route); {
2210 // /* FIXME: name1 link is added by error about 20 lines below, so don't add it here
2211 // SURFXML_BUFFER_SET(link_c_ctn_id, name1);
2212 // SURFXML_START_TAG(link_c_ctn);
2213 // SURFXML_END_TAG(link_c_ctn);
2215 // SURFXML_BUFFER_SET(link_c_ctn_id, backbone_name);
2216 // SURFXML_START_TAG(link_c_ctn);
2217 // SURFXML_END_TAG(link_c_ctn);
2219 // SURFXML_BUFFER_SET(link_c_ctn_id, name2);
2220 // SURFXML_START_TAG(link_c_ctn);
2221 // SURFXML_END_TAG(link_c_ctn);
2223 // } SURFXML_END_TAG(route);
2228 // /* Make route multi with the outside world, i.e. cluster->$* */
2231 // * This also adds an elements to the routes within the cluster,
2232 // * and I guess it's wrong, but since this element is commented out in the above
2233 // * code creating the internal routes, we're good.
2234 // * To fix it, I'd say that we need a way to understand "$*-${cluster_id}" as "whole world, but the guys in that cluster"
2235 // * But for that, we need to install a real expression parser for src/dst attributes
2238 // * This also adds a dumb element (the private link) in place of the loopback. Then, since
2239 // * the loopback is added only if no link to self already exist, this fails.
2240 // * That's really dumb.
2243 // * It seems to me that it does not add the backbone to the path to outside world...
2245 // SURFXML_BUFFER_SET(route_c_multi_src, cluster_id);
2246 // SURFXML_BUFFER_SET(route_c_multi_dst, "$*");
2247 // A_surfxml_route_c_multi_symmetric = A_surfxml_route_c_multi_symmetric_NO;
2248 // A_surfxml_route_c_multi_action = A_surfxml_route_c_multi_action_PREPEND;
2250 // SURFXML_START_TAG(route_c_multi);
2252 // SURFXML_BUFFER_SET(link_c_ctn_id, "$src");
2254 // SURFXML_START_TAG(link_c_ctn);
2255 // SURFXML_END_TAG(link_c_ctn);
2257 // SURFXML_END_TAG(route_c_multi);
2259 // free(backbone_name);
2261 // /* Restore buff */
2262 // surfxml_bufferstack_pop(1);
2266 // static void routing_full_parse_end(void) {
2267 // routing_full_t routing = (routing_full_t) used_routing;
2269 // unsigned int cpt = 0;
2270 // xbt_dict_cursor_t cursor = NULL;
2271 // char *key, *data, *end;
2272 // const char *sep = "#";
2273 // xbt_dynar_t links, keys;
2274 // char *link_name = NULL;
2277 // int host_count = routing->generic_routing.host_count;
2279 // /* Create the routing table */
2280 // routing->routing_table = xbt_new0(xbt_dynar_t, host_count * host_count);
2281 // for (i=0;i<host_count;i++)
2282 // for (j=0;j<host_count;j++)
2283 // ROUTE_FULL(i,j) = xbt_dynar_new(routing->size_of_link,NULL);
2285 // /* Put the routes in position */
2286 // xbt_dict_foreach(route_table, cursor, key, data) {
2288 // links = (xbt_dynar_t) data;
2289 // keys = xbt_str_split_str(key, sep);
2291 // src_id = strtol(xbt_dynar_get_as(keys, 0, char *), &end, 16);
2292 // dst_id = strtol(xbt_dynar_get_as(keys, 1, char *), &end, 16);
2293 // xbt_dynar_free(&keys);
2295 // if(xbt_dynar_length(links) == 1){
2296 // s_onelink_t new_link = (s_onelink_t) xbt_malloc0(sizeof(s_onelink));
2297 // new_link->src_id = src_id;
2298 // new_link->dst_id = dst_id;
2299 // link_name = xbt_dynar_getfirst_as(links, char*);
2300 // new_link->link_ptr = xbt_dict_get_or_null(surf_network_model->resource_set, link_name);
2301 // DEBUG3("Adding onelink route from (#%d) to (#%d), link_name %s",src_id, dst_id, link_name);
2302 // xbt_dict_set(onelink_routes, link_name, (void *)new_link, onelink_route_elem_free);
2303 // #ifdef HAVE_TRACING
2304 // TRACE_surf_link_save_endpoints (link_name, src_id, dst_id);
2308 // if(ISROUTER(src_id) || ISROUTER(dst_id)) {
2309 // DEBUG2("There is route with a router here: (%d ,%d)",src_id,dst_id);
2310 // /* Check there is only one link in the route and store the information */
2314 // DEBUG4("Handle %d %d (from %d hosts): %ld links",
2315 // src_id,dst_id,routing->generic_routing.host_count,xbt_dynar_length(links));
2316 // xbt_dynar_foreach(links, cpt, link_name) {
2317 // void* link = xbt_dict_get_or_null(surf_network_model->resource_set, link_name);
2319 // xbt_dynar_push(ROUTE_FULL(src_id,dst_id),&link);
2321 // THROW1(mismatch_error,0,"Link %s not found", link_name);
2325 // /* Add the loopback if needed */
2326 // for (i = 0; i < host_count; i++)
2327 // if (!xbt_dynar_length(ROUTE_FULL(i, i)))
2328 // xbt_dynar_push(ROUTE_FULL(i,i),&routing->loopback);
2330 // /* Shrink the dynar routes (save unused slots) */
2331 // for (i=0;i<host_count;i++)
2332 // for (j=0;j<host_count;j++)
2333 // xbt_dynar_shrink(ROUTE_FULL(i,j),0);
2337 // * Business methods
2339 // static xbt_dynar_t routing_full_get_route(int src,int dst) {
2340 // xbt_assert0(!(ISROUTER(src) || ISROUTER(dst)), "Ask for route \"from\" or \"to\" a router node");
2341 // return ROUTE_FULL(src,dst);
2344 // static xbt_dict_t routing_full_get_onelink_routes(void){
2345 // return onelink_routes;
2348 // static int routing_full_is_router(int id){
2349 // return ISROUTER(id);
2352 // static void routing_full_finalize(void) {
2353 // routing_full_t routing = (routing_full_t)used_routing;
2357 // for (i = 0; i < used_routing->host_count; i++)
2358 // for (j = 0; j < used_routing->host_count; j++)
2359 // xbt_dynar_free(&ROUTE_FULL(i, j));
2360 // free(routing->routing_table);
2361 // xbt_dict_free(&used_routing->host_id);
2362 // xbt_dict_free(&onelink_routes);
2368 // static void routing_model_full_create(size_t size_of_link,void *loopback) {
2369 // /* initialize our structure */
2370 // routing_full_t routing = xbt_new0(s_routing_full_t,1);
2371 // routing->generic_routing.name = "Full";
2372 // routing->generic_routing.host_count = 0;
2373 // routing->generic_routing.get_route = routing_full_get_route;
2374 // routing->generic_routing.get_onelink_routes = routing_full_get_onelink_routes;
2375 // routing->generic_routing.is_router = routing_full_is_router;
2376 // routing->generic_routing.finalize = routing_full_finalize;
2378 // routing->size_of_link = size_of_link;
2379 // routing->loopback = loopback;
2381 // /* Set it in position */
2382 // used_routing = (routing_t) routing;
2384 // /* Set the dict for onehop routes */
2385 // onelink_routes = xbt_dict_new();
2387 // routing->generic_routing.host_id = xbt_dict_new();
2389 // /* Setup the parsing callbacks we need */
2390 // // surfxml_add_callback(STag_surfxml_host_cb_list, &routing_full_parse_Shost);
2391 // // surfxml_add_callback(STag_surfxml_router_cb_list, &routing_full_parse_Srouter);
2392 // // surfxml_add_callback(ETag_surfxml_platform_cb_list, &routing_full_parse_end);
2393 // // surfxml_add_callback(STag_surfxml_route_cb_list, &routing_full_parse_Sroute_set_endpoints);
2394 // // surfxml_add_callback(ETag_surfxml_route_cb_list, &routing_full_parse_Eroute);
2395 // // surfxml_add_callback(STag_surfxml_cluster_cb_list, &routing_full_parse_Scluster);
2397 // // surfxml_add_callback(STag_surfxml_host_cb_list, &routing_full_parse_Shost);
2398 // // surfxml_add_callback(STag_surfxml_router_cb_list, &routing_full_parse_Srouter);
2402 /* ************************************************************************** */
2404 // static void routing_shortest_path_parse_Scluster(void)
2406 // static int AX_ptr = 0;
2408 // char *cluster_id = A_surfxml_cluster_id;
2409 // char *cluster_prefix = A_surfxml_cluster_prefix;
2410 // char *cluster_suffix = A_surfxml_cluster_suffix;
2411 // char *cluster_radical = A_surfxml_cluster_radical;
2412 // char *cluster_power = A_surfxml_cluster_power;
2413 // char *cluster_bb_bw = A_surfxml_cluster_bb_bw;
2414 // char *cluster_bb_lat = A_surfxml_cluster_bb_lat;
2415 // char *backbone_name;
2417 // surfxml_bufferstack_push(1);
2420 // SURFXML_BUFFER_SET(set_id, cluster_id);
2421 // SURFXML_BUFFER_SET(set_prefix, cluster_prefix);
2422 // SURFXML_BUFFER_SET(set_suffix, cluster_suffix);
2423 // SURFXML_BUFFER_SET(set_radical, cluster_radical);
2425 // SURFXML_START_TAG(set);
2426 // SURFXML_END_TAG(set);
2428 // /* Make foreach */
2429 // SURFXML_BUFFER_SET(foreach_set_id, cluster_id);
2431 // SURFXML_START_TAG(foreach);
2433 // /* Make host for the foreach */
2434 // routing_full_parse_change_cpu_data("$1", cluster_power, "1.0", "", "");
2435 // A_surfxml_host_state = A_surfxml_host_state_ON;
2437 // SURFXML_START_TAG(host);
2438 // SURFXML_END_TAG(host);
2440 // SURFXML_END_TAG(foreach);
2442 // /* Make backbone link */
2443 // backbone_name = bprintf("%s_bb", cluster_id);
2444 // routing_full_parse_change_link_data(backbone_name, cluster_bb_bw, "", cluster_bb_lat, "",
2446 // A_surfxml_link_state = A_surfxml_link_state_ON;
2447 // A_surfxml_link_sharing_policy = A_surfxml_link_sharing_policy_FATPIPE;
2449 // SURFXML_START_TAG(link);
2450 // SURFXML_END_TAG(link);
2452 // free(backbone_name);
2454 // /* Restore buff */
2455 // surfxml_bufferstack_pop(1);
2458 // /* ************************************************************************** */
2459 // /* *************************** FLOYD ROUTING ********************************* */
2461 // s_routing_t generic_routing;
2462 // int *predecessor_table;
2463 // void** link_table;
2464 // xbt_dynar_t last_route;
2466 // size_t size_of_link;
2467 // } s_routing_floyd_t,*routing_floyd_t;
2469 // #define FLOYD_COST(i,j) cost_table[(i)+(j)*(used_routing)->host_count]
2470 // #define FLOYD_PRED(i,j) ((routing_floyd_t)used_routing)->predecessor_table[(i)+(j)*(used_routing)->host_count]
2471 // #define FLOYD_LINK(i,j) ((routing_floyd_t)used_routing)->link_table[(i)+(j)*(used_routing)->host_count]
2473 // static void routing_floyd_parse_end(void) {
2475 // routing_floyd_t routing = (routing_floyd_t) used_routing;
2477 // void* link_list = NULL;
2478 // double * cost_table;
2479 // xbt_dict_cursor_t cursor = NULL;
2480 // char *key,*data, *end;
2481 // const char *sep = "#";
2482 // xbt_dynar_t links, keys;
2484 // unsigned int i,j;
2485 // unsigned int a,b,c;
2486 // int host_count = routing->generic_routing.host_count;
2487 // char * link_name = NULL;
2488 // void * link = NULL;
2490 // /* Create Cost, Predecessor and Link tables */
2491 // cost_table = xbt_new0(double, host_count * host_count); //link cost from host to host
2492 // routing->predecessor_table = xbt_new0(int, host_count*host_count); //predecessor host numbers
2493 // routing->link_table = xbt_new0(void*,host_count*host_count); //actual link between src and dst
2494 // routing->last_route = xbt_dynar_new(routing->size_of_link, NULL);
2496 // /* Initialize costs and predecessors*/
2497 // for(i = 0; i<host_count;i++)
2498 // for(j = 0; j<host_count;j++) {
2499 // FLOYD_COST(i,j) = DBL_MAX;
2500 // FLOYD_PRED(i,j) = -1;
2503 // /* Put the routes in position */
2504 // xbt_dict_foreach(route_table, cursor, key, data) {
2506 // links = (xbt_dynar_t)data;
2507 // keys = xbt_str_split_str(key, sep);
2510 // src_id = strtol(xbt_dynar_get_as(keys, 0, char*), &end, 16);
2511 // dst_id = strtol(xbt_dynar_get_as(keys, 1, char*), &end, 16);
2512 // xbt_dynar_free(&keys);
2514 // DEBUG4("Handle %d %d (from %d hosts): %ld links",
2515 // src_id,dst_id,routing->generic_routing.host_count,xbt_dynar_length(links));
2516 // xbt_assert3(xbt_dynar_length(links) == 1, "%ld links in route between host %d and %d, should be 1", xbt_dynar_length(links), src_id, dst_id);
2518 // link_name = xbt_dynar_getfirst_as(links, char*);
2519 // link = xbt_dict_get_or_null(surf_network_model->resource_set, link_name);
2522 // link_list = link;
2524 // THROW1(mismatch_error,0,"Link %s not found", link_name);
2527 // FLOYD_LINK(src_id,dst_id) = link_list;
2528 // FLOYD_PRED(src_id, dst_id) = src_id;
2531 // FLOYD_COST(src_id, dst_id) = 1; // assume 1 for now
2535 // /* Add the loopback if needed */
2536 // for (i = 0; i < host_count; i++)
2537 // if (!FLOYD_PRED(i, i)) {
2538 // FLOYD_PRED(i, i) = i;
2539 // FLOYD_COST(i, i) = 1;
2540 // FLOYD_LINK(i, i) = routing->loopback;
2544 // //Calculate path costs
2546 // for(c=0;c<host_count;c++) {
2547 // for(a=0;a<host_count;a++) {
2548 // for(b=0;b<host_count;b++) {
2549 // if(FLOYD_COST(a,c) < DBL_MAX && FLOYD_COST(c,b) < DBL_MAX) {
2550 // if(FLOYD_COST(a,b) == DBL_MAX || (FLOYD_COST(a,c)+FLOYD_COST(c,b) < FLOYD_COST(a,b))) {
2551 // FLOYD_COST(a,b) = FLOYD_COST(a,c)+FLOYD_COST(c,b);
2552 // FLOYD_PRED(a,b) = FLOYD_PRED(c,b);
2560 // free(cost_table);
2564 // * Business methods
2566 // static xbt_dynar_t routing_floyd_get_route(int src_id,int dst_id) {
2568 // routing_floyd_t routing = (routing_floyd_t) used_routing;
2570 // int pred = dst_id;
2571 // int prev_pred = 0;
2573 // xbt_dynar_reset(routing->last_route);
2576 // prev_pred = pred;
2577 // pred = FLOYD_PRED(src_id, pred);
2579 // if(pred == -1) // if no pred in route -> no route to host
2582 // xbt_dynar_unshift(routing->last_route, &FLOYD_LINK(pred,prev_pred));
2584 // } while(pred != src_id);
2586 // xbt_assert2(pred != -1, "no route from host %d to %d", src_id, dst_id);
2588 // return routing->last_route;
2591 // static void routing_floyd_finalize(void) {
2592 // routing_floyd_t routing = (routing_floyd_t)used_routing;
2595 // free(routing->link_table);
2596 // free(routing->predecessor_table);
2597 // xbt_dynar_free(&routing->last_route);
2598 // xbt_dict_free(&used_routing->host_id);
2604 // static xbt_dict_t routing_floyd_get_onelink_routes(void){
2605 // xbt_assert0(0,"The get_onelink_routes feature is not supported in routing model Floyd");
2608 // static int routing_floyd_is_router(int id){
2609 // xbt_assert0(0,"The get_is_router feature is not supported in routing model Floyd");
2612 // static void routing_model_floyd_create(size_t size_of_link,void *loopback) {
2613 // /* initialize our structure */
2614 // routing_floyd_t routing = xbt_new0(s_routing_floyd_t,1);
2615 // routing->generic_routing.name = "Floyd";
2616 // routing->generic_routing.host_count = 0;
2617 // routing->generic_routing.host_id = xbt_dict_new();
2618 // routing->generic_routing.get_route = routing_floyd_get_route;
2619 // routing->generic_routing.get_onelink_routes = routing_floyd_get_onelink_routes;
2620 // routing->generic_routing.is_router = routing_floyd_is_router;
2621 // routing->generic_routing.finalize = routing_floyd_finalize;
2622 // routing->size_of_link = size_of_link;
2623 // routing->loopback = loopback;
2625 // /* Set it in position */
2626 // used_routing = (routing_t) routing;
2628 // /* Setup the parsing callbacks we need */
2629 // surfxml_add_callback(STag_surfxml_host_cb_list, &routing_full_parse_Shost);
2630 // surfxml_add_callback(ETag_surfxml_platform_cb_list, &routing_floyd_parse_end);
2631 // surfxml_add_callback(STag_surfxml_route_cb_list,
2632 // &routing_full_parse_Sroute_set_endpoints);
2633 // surfxml_add_callback(ETag_surfxml_route_cb_list, &routing_full_parse_Eroute);
2634 // surfxml_add_callback(STag_surfxml_cluster_cb_list, &routing_shortest_path_parse_Scluster);
2638 // /* ************************************************************************** */
2639 // /* ********** Dijkstra & Dijkstra Cached ROUTING **************************** */
2641 // s_routing_t generic_routing;
2642 // xbt_graph_t route_graph;
2643 // xbt_dict_t graph_node_map;
2644 // xbt_dict_t route_cache;
2645 // xbt_dynar_t last_route;
2648 // size_t size_of_link;
2649 // } s_routing_dijkstra_t,*routing_dijkstra_t;
2652 // typedef struct graph_node_data {
2654 // int graph_id; //used for caching internal graph id's
2655 // } s_graph_node_data_t, * graph_node_data_t;
2657 // typedef struct graph_node_map_element {
2659 // } s_graph_node_map_element_t, * graph_node_map_element_t;
2661 // typedef struct route_cache_element {
2664 // } s_route_cache_element_t, * route_cache_element_t;
2669 // static void route_cache_elem_free(void *e) {
2670 // route_cache_element_t elm=(route_cache_element_t)e;
2673 // free(elm->pred_arr);
2678 // static void graph_node_map_elem_free(void *e) {
2679 // graph_node_map_element_t elm = (graph_node_map_element_t)e;
2687 // * Utility functions
2689 // static xbt_node_t route_graph_new_node(int id, int graph_id) {
2690 // xbt_node_t node = NULL;
2691 // graph_node_data_t data = NULL;
2692 // graph_node_map_element_t elm = NULL;
2693 // routing_dijkstra_t routing = (routing_dijkstra_t) used_routing;
2695 // data = xbt_new0(struct graph_node_data, sizeof(struct graph_node_data));
2697 // data->graph_id = graph_id;
2698 // node = xbt_graph_new_node(routing->route_graph, data);
2700 // elm = xbt_new0(struct graph_node_map_element, sizeof(struct graph_node_map_element));
2701 // elm->node = node;
2702 // xbt_dict_set_ext(routing->graph_node_map, (char*)(&id), sizeof(int), (xbt_set_elm_t)elm, &graph_node_map_elem_free);
2707 // static graph_node_map_element_t graph_node_map_search(int id) {
2708 // routing_dijkstra_t routing = (routing_dijkstra_t) used_routing;
2710 // graph_node_map_element_t elm = (graph_node_map_element_t)xbt_dict_get_or_null_ext(routing->graph_node_map, (char*)(&id), sizeof(int));
2718 // static void route_new_dijkstra(int src_id, int dst_id, void* link) {
2719 // routing_dijkstra_t routing = (routing_dijkstra_t) used_routing;
2721 // xbt_node_t src = NULL;
2722 // xbt_node_t dst = NULL;
2723 // graph_node_map_element_t src_elm = (graph_node_map_element_t)xbt_dict_get_or_null_ext(routing->graph_node_map, (char*)(&src_id), sizeof(int));
2724 // graph_node_map_element_t dst_elm = (graph_node_map_element_t)xbt_dict_get_or_null_ext(routing->graph_node_map, (char*)(&dst_id), sizeof(int));
2727 // src = src_elm->node;
2730 // dst = dst_elm->node;
2732 // //add nodes if they don't exist in the graph
2733 // if(src_id == dst_id && src == NULL && dst == NULL) {
2734 // src = route_graph_new_node(src_id, -1);
2737 // if(src == NULL) {
2738 // src = route_graph_new_node(src_id, -1);
2741 // if(dst == NULL) {
2742 // dst = route_graph_new_node(dst_id, -1);
2746 // //add link as edge to graph
2747 // xbt_graph_new_edge(routing->route_graph, src, dst, link);
2751 // static void add_loopback_dijkstra(void) {
2752 // routing_dijkstra_t routing = (routing_dijkstra_t) used_routing;
2754 // xbt_dynar_t nodes = xbt_graph_get_nodes(routing->route_graph);
2756 // xbt_node_t node = NULL;
2757 // unsigned int cursor2;
2758 // xbt_dynar_foreach(nodes, cursor2, node) {
2759 // xbt_dynar_t out_edges = xbt_graph_node_get_outedges(node);
2760 // xbt_edge_t edge = NULL;
2761 // unsigned int cursor;
2764 // xbt_dynar_foreach(out_edges, cursor, edge) {
2765 // xbt_node_t other_node = xbt_graph_edge_get_target(edge);
2766 // if(other_node == node) {
2773 // xbt_graph_new_edge(routing->route_graph, node, node, &routing->loopback);
2777 // static void routing_dijkstra_parse_end(void) {
2778 // routing_dijkstra_t routing = (routing_dijkstra_t) used_routing;
2780 // xbt_dict_cursor_t cursor = NULL;
2781 // char *key, *data, *end;
2782 // const char *sep = "#";
2783 // xbt_dynar_t links, keys;
2784 // char* link_name = NULL;
2785 // void* link = NULL;
2786 // xbt_node_t node = NULL;
2787 // unsigned int cursor2;
2788 // xbt_dynar_t nodes = NULL;
2789 // /* Create the topology graph */
2790 // routing->route_graph = xbt_graph_new_graph(1, NULL);
2791 // routing->graph_node_map = xbt_dict_new();
2792 // routing->last_route = xbt_dynar_new(routing->size_of_link, NULL);
2793 // if(routing->cached)
2794 // routing->route_cache = xbt_dict_new();
2797 // /* Put the routes in position */
2798 // xbt_dict_foreach(route_table, cursor, key, data) {
2800 // links = (xbt_dynar_t) data;
2801 // keys = xbt_str_split_str(key, sep);
2803 // src_id = strtol(xbt_dynar_get_as(keys, 0, char *), &end, 16);
2804 // dst_id = strtol(xbt_dynar_get_as(keys, 1, char *), &end, 16);
2805 // xbt_dynar_free(&keys);
2807 // DEBUG4("Handle %d %d (from %d hosts): %ld links",
2808 // src_id,dst_id,routing->generic_routing.host_count,xbt_dynar_length(links));
2810 // xbt_assert3(xbt_dynar_length(links) == 1, "%ld links in route between host %d and %d, should be 1", xbt_dynar_length(links), src_id, dst_id);
2812 // link_name = xbt_dynar_getfirst_as(links, char*);
2813 // link = xbt_dict_get_or_null(surf_network_model->resource_set, link_name);
2815 // route_new_dijkstra(src_id,dst_id,link);
2817 // THROW1(mismatch_error,0,"Link %s not found", link_name);
2821 // /* Add the loopback if needed */
2822 // add_loopback_dijkstra();
2824 // /* initialize graph indexes in nodes after graph has been built */
2825 // nodes = xbt_graph_get_nodes(routing->route_graph);
2827 // xbt_dynar_foreach(nodes, cursor2, node) {
2828 // graph_node_data_t data = xbt_graph_node_get_data(node);
2829 // data->graph_id = cursor2;
2835 // * Business methods
2837 // static xbt_dynar_t routing_dijkstra_get_route(int src_id,int dst_id) {
2839 // routing_dijkstra_t routing = (routing_dijkstra_t) used_routing;
2840 // int * pred_arr = NULL;
2841 // int src_node_id = 0;
2842 // int dst_node_id = 0;
2843 // int * nodeid = NULL;
2846 // void * link = NULL;
2847 // route_cache_element_t elm = NULL;
2848 // xbt_dynar_t nodes = xbt_graph_get_nodes(routing->route_graph);
2850 // /*Use the graph_node id mapping set to quickly find the nodes */
2851 // graph_node_map_element_t src_elm = graph_node_map_search(src_id);
2852 // graph_node_map_element_t dst_elm = graph_node_map_search(dst_id);
2853 // xbt_assert2(src_elm != NULL && dst_elm != NULL, "src %d or dst %d does not exist", src_id, dst_id);
2854 // src_node_id = ((graph_node_data_t)xbt_graph_node_get_data(src_elm->node))->graph_id;
2855 // dst_node_id = ((graph_node_data_t)xbt_graph_node_get_data(dst_elm->node))->graph_id;
2857 // if(routing->cached) {
2858 // /*check if there is a cached predecessor list avail */
2859 // elm = (route_cache_element_t)xbt_dict_get_or_null_ext(routing->route_cache, (char*)(&src_id), sizeof(int));
2862 // if(elm) { //cached mode and cache hit
2863 // pred_arr = elm->pred_arr;
2864 // } else { //not cached mode or cache miss
2865 // double * cost_arr = NULL;
2866 // xbt_heap_t pqueue = NULL;
2869 // int nr_nodes = xbt_dynar_length(nodes);
2870 // cost_arr = xbt_new0(double, nr_nodes); //link cost from src to other hosts
2871 // pred_arr = xbt_new0(int, nr_nodes); //predecessors in path from src
2872 // pqueue = xbt_heap_new(nr_nodes, free);
2875 // cost_arr[src_node_id] = 0.0;
2877 // for(i = 0; i < nr_nodes; i++) {
2878 // if(i != src_node_id) {
2879 // cost_arr[i] = DBL_MAX;
2884 // //initialize priority queue
2885 // nodeid = xbt_new0(int, 1);
2887 // xbt_heap_push(pqueue, nodeid, cost_arr[i]);
2891 // // apply dijkstra using the indexes from the graph's node array
2892 // while(xbt_heap_size(pqueue) > 0) {
2893 // int * v_id = xbt_heap_pop(pqueue);
2894 // xbt_node_t v_node = xbt_dynar_get_as(nodes, *v_id, xbt_node_t);
2895 // xbt_dynar_t out_edges = xbt_graph_node_get_outedges(v_node);
2896 // xbt_edge_t edge = NULL;
2897 // unsigned int cursor;
2899 // xbt_dynar_foreach(out_edges, cursor, edge) {
2900 // xbt_node_t u_node = xbt_graph_edge_get_target(edge);
2901 // graph_node_data_t data = xbt_graph_node_get_data(u_node);
2902 // int u_id = data->graph_id;
2903 // int cost_v_u = 1; //fixed link cost for now
2905 // if(cost_v_u + cost_arr[*v_id] < cost_arr[u_id]) {
2906 // pred_arr[u_id] = *v_id;
2907 // cost_arr[u_id] = cost_v_u + cost_arr[*v_id];
2908 // nodeid = xbt_new0(int, 1);
2910 // xbt_heap_push(pqueue, nodeid, cost_arr[u_id]);
2914 // //free item popped from pqueue
2919 // xbt_heap_free(pqueue);
2923 // //compose route path with links
2924 // xbt_dynar_reset(routing->last_route);
2926 // for(v = dst_node_id; v != src_node_id; v = pred_arr[v]) {
2927 // xbt_node_t node_pred_v = xbt_dynar_get_as(nodes, pred_arr[v], xbt_node_t);
2928 // xbt_node_t node_v = xbt_dynar_get_as(nodes, v, xbt_node_t);
2929 // xbt_edge_t edge = xbt_graph_get_edge(routing->route_graph, node_pred_v, node_v);
2931 // xbt_assert2(edge != NULL, "no route between host %d and %d", src_id, dst_id);
2933 // link = xbt_graph_edge_get_data(edge);
2934 // xbt_dynar_unshift(routing->last_route, &link);
2939 // if(routing->cached && elm == NULL) {
2940 // //add to predecessor list of the current src-host to cache
2941 // elm = xbt_new0(struct route_cache_element, sizeof(struct route_cache_element));
2942 // elm->pred_arr = pred_arr;
2943 // elm->size = size;
2944 // xbt_dict_set_ext(routing->route_cache, (char*)(&src_id), sizeof(int), (xbt_set_elm_t)elm, &route_cache_elem_free);
2947 // if(!routing->cached)
2950 // return routing->last_route;
2954 // static void routing_dijkstra_finalize(void) {
2955 // routing_dijkstra_t routing = (routing_dijkstra_t)used_routing;
2958 // xbt_graph_free_graph(routing->route_graph, &free, NULL, &free);
2959 // xbt_dict_free(&routing->graph_node_map);
2960 // if(routing->cached)
2961 // xbt_dict_free(&routing->route_cache);
2962 // xbt_dynar_free(&routing->last_route);
2963 // xbt_dict_free(&used_routing->host_id);
2969 // static xbt_dict_t routing_dijkstraboth_get_onelink_routes(void){
2970 // xbt_assert0(0,"The get_onelink_routes feature is not supported in routing model dijkstraboth");
2973 // static int routing_dijkstraboth_is_router(int id){
2974 // xbt_assert0(0,"The get_is_router feature is not supported in routing model dijkstraboth");
2980 // static void routing_model_dijkstraboth_create(size_t size_of_link,void *loopback, int cached) {
2981 // /* initialize our structure */
2982 // routing_dijkstra_t routing = xbt_new0(s_routing_dijkstra_t,1);
2983 // routing->generic_routing.name = "Dijkstra";
2984 // routing->generic_routing.host_count = 0;
2985 // routing->generic_routing.get_route = routing_dijkstra_get_route;
2986 // routing->generic_routing.get_onelink_routes = routing_dijkstraboth_get_onelink_routes;
2987 // routing->generic_routing.is_router = routing_dijkstraboth_is_router;
2988 // routing->generic_routing.finalize = routing_dijkstra_finalize;
2989 // routing->size_of_link = size_of_link;
2990 // routing->loopback = loopback;
2991 // routing->cached = cached;
2993 // /* Set it in position */
2994 // used_routing = (routing_t) routing;
2996 // /* Setup the parsing callbacks we need */
2997 // routing->generic_routing.host_id = xbt_dict_new();
2998 // surfxml_add_callback(STag_surfxml_host_cb_list, &routing_full_parse_Shost);
2999 // surfxml_add_callback(ETag_surfxml_platform_cb_list, &routing_dijkstra_parse_end);
3000 // surfxml_add_callback(STag_surfxml_route_cb_list,
3001 // &routing_full_parse_Sroute_set_endpoints);
3002 // surfxml_add_callback(ETag_surfxml_route_cb_list, &routing_full_parse_Eroute);
3003 // surfxml_add_callback(STag_surfxml_cluster_cb_list, &routing_shortest_path_parse_Scluster);
3006 // static void routing_model_dijkstra_create(size_t size_of_link,void *loopback) {
3007 // routing_model_dijkstraboth_create(size_of_link, loopback, 0);
3010 // static void routing_model_dijkstracache_create(size_t size_of_link,void *loopback) {
3011 // routing_model_dijkstraboth_create(size_of_link, loopback, 1);
3014 /* ************************************************** */
3015 /* ********** NO ROUTING **************************** */
3018 // static void routing_none_finalize(void) {
3019 // if (used_routing) {
3020 // xbt_dict_free(&used_routing->host_id);
3021 // free(used_routing);
3022 // used_routing=NULL;
3026 // static void routing_model_none_create(size_t size_of_link,void *loopback) {
3027 // routing_t routing = xbt_new0(s_routing_t,1);
3028 // INFO0("Null routing");
3029 // routing->name = "none";
3030 // routing->host_count = 0;
3031 // routing->host_id = xbt_dict_new();
3032 // routing->get_onelink_routes = NULL;
3033 // routing->is_router = NULL;
3034 // routing->get_route = NULL;
3036 // routing->finalize = routing_none_finalize;
3038 // /* Set it in position */
3039 // used_routing = (routing_t) routing;