1 /* Copyright (c) 2009, 2010, 2011. 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. */
7 #ifndef _SURF_SURF_ROUTING_PRIVATE_H
8 #define _SURF_SURF_ROUTING_PRIVATE_H
11 #include "gras_config.h"
13 #include "surf_private.h"
14 #include "xbt/dynar.h"
16 #include "xbt/config.h"
17 #include "xbt/graph.h"
19 #include "surf/surfxml_parse.h"
21 /* ************************************************************************** */
22 /* ******************************* NO ROUTING ******************************* */
23 /* Only save the AS tree, and forward calls to child ASes */
24 AS_t model_none_create(void);
25 AS_t model_none_create_sized(size_t childsize);
26 void model_none_finalize(AS_t as);
27 /* ************************************************************************** */
28 /* ***************** GENERIC PARSE FUNCTIONS (declarations) ***************** */
29 AS_t model_generic_create_sized(size_t childsize);
30 void model_generic_finalize(AS_t as);
32 void generic_parse_PU(AS_t rc, const char *name);
33 void generic_parse_AS(AS_t rc, const char *name);
34 void generic_parse_bypassroute(AS_t rc, const char *src, const char *dst,
35 route_extended_t e_route);
37 /* ************************************************************************** */
38 /* *************** GENERIC BUSINESS METHODS (declarations) ****************** */
40 double generic_get_link_latency(AS_t rc, const char *src, const char *dst,
41 route_extended_t e_route);
42 xbt_dynar_t generic_get_onelink_routes(AS_t rc);
43 route_extended_t generic_get_bypassroute(AS_t rc,
47 /* ************************************************************************** */
48 /* ****************** GENERIC AUX FUNCTIONS (declarations) ****************** */
51 generic_new_extended_route(e_surf_routing_hierarchy_t hierarchy,
52 void *data, int order);
54 generic_new_route(e_surf_routing_hierarchy_t hierarchy,
55 void *data, int order);
56 void generic_free_route(route_t route);
57 void generic_free_extended_route(route_extended_t e_route);
59 generic_autonomous_system_exist(AS_t rc, char *element);
61 generic_processing_units_exist(AS_t rc, char *element);
62 void generic_src_dst_check(AS_t rc, const char *src,
66 /* ************************************************************************** */
67 /* *************************** FLOYD ROUTING ******************************** */
68 AS_t model_floyd_create(void); /* create structures for floyd routing model */
69 void model_floyd_end(AS_t as); /* finalize the creation of floyd routing model */
70 void model_floyd_parse_route(AS_t rc, const char *src,
71 const char *dst, route_extended_t route);
73 /* ************************************************** */
74 /* ************** RULE-BASED ROUTING **************** */
75 AS_t model_rulebased_create(void); /* create structures for rulebased routing model */
77 /* ************************************************** */
78 /* ************** Cluster ROUTING **************** */
79 AS_t model_cluster_create(void); /* create structures for cluster routing model */
81 /* Pass info from the cluster parser to the cluster routing */
82 void surf_routing_cluster_add_link(const char* host_id,surf_parsing_link_up_down_t info);
83 void surf_routing_cluster_add_backbone(AS_t as, void* bb);
85 /* ************************************************** */
86 /* ************** Vivaldi ROUTING **************** */
87 AS_t model_vivaldi_create(void); /* create structures for vivaldi routing model */
88 #define HOST_PEER(peername) bprintf("peer_%s", peername)
89 #define ROUTER_PEER(peername) bprintf("router_%s", peername)
90 #define LINK_UP_PEER(peername) bprintf("link_%s_up", peername)
91 #define LINK_DOWN_PEER(peername) bprintf("link_%s_down", peername)
93 /* ************************************************************************** */
94 /* ********** Dijkstra & Dijkstra Cached ROUTING **************************** */
95 AS_t model_dijkstra_both_create(int cached); /* create by calling dijkstra or dijkstracache */
96 AS_t model_dijkstra_create(void); /* create structures for dijkstra routing model */
97 AS_t model_dijkstracache_create(void); /* create structures for dijkstracache routing model */
98 void model_dijkstra_both_end(AS_t as); /* finalize the creation of dijkstra routing model */
99 void model_dijkstra_both_parse_route (AS_t rc, const char *src,
100 const char *dst, route_extended_t route);
102 /* ************************************************************************** */
103 /* *************************** FULL ROUTING ********************************* */
104 AS_t model_full_create(void); /* create structures for full routing model */
105 void model_full_end(AS_t as); /* finalize the creation of full routing model */
106 void model_full_set_route( /* Set the route and ASroute between src and dst */
107 AS_t rc, const char *src, const char *dst, route_extended_t route);
110 #endif /* _SURF_SURF_ROUTING_PRIVATE_H */