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 int generic_parse_PU(AS_t rc, sg_routing_edge_t elm);
33 int generic_parse_AS(AS_t rc, sg_routing_edge_t elm);
34 void generic_parse_bypassroute(AS_t rc, const char *src, const char *dst,
37 /* ************************************************************************** */
38 /* *************** GENERIC BUSINESS METHODS (declarations) ****************** */
40 xbt_dynar_t generic_get_onelink_routes(AS_t rc);
41 route_t generic_get_bypassroute(AS_t rc,
42 sg_routing_edge_t src,
43 sg_routing_edge_t dst,
46 /* ************************************************************************** */
47 /* ****************** GENERIC AUX FUNCTIONS (declarations) ****************** */
49 /* change a route containing link names into a route containing link entities.
50 * If change_order is true, the links are put in reverse order in the
52 route_t generic_new_extended_route(e_surf_routing_hierarchy_t hierarchy,
53 route_t data, int preserve_order);
55 generic_autonomous_system_exist(AS_t rc, char *element);
57 generic_processing_units_exist(AS_t rc, char *element);
58 void generic_src_dst_check(AS_t rc, sg_routing_edge_t src,
59 sg_routing_edge_t dst);
62 /* ************************************************************************** */
63 /* *************************** FLOYD ROUTING ******************************** */
64 AS_t model_floyd_create(void); /* create structures for floyd routing model */
65 void model_floyd_end(AS_t as); /* finalize the creation of floyd routing model */
66 void model_floyd_parse_route(AS_t rc, const char *src,
67 const char *dst, route_t route);
69 /* ************************************************** */
70 /* ************** RULE-BASED ROUTING **************** */
71 AS_t model_rulebased_create(void); /* create structures for rulebased routing model */
73 /* ************************************************** */
74 /* ************** Cluster ROUTING **************** */
75 AS_t model_cluster_create(void); /* create structures for cluster routing model */
77 /* Pass info from the cluster parser to the cluster routing */
78 void surf_routing_cluster_add_backbone(AS_t as, void* bb);
80 /* ************************************************** */
81 /* ************** Vivaldi ROUTING **************** */
82 AS_t model_vivaldi_create(void); /* create structures for vivaldi routing model */
83 #define HOST_PEER(peername) bprintf("peer_%s", peername)
84 #define ROUTER_PEER(peername) bprintf("router_%s", peername)
85 #define LINK_UP_PEER(peername) bprintf("link_%s_up", peername)
86 #define LINK_DOWN_PEER(peername) bprintf("link_%s_down", peername)
88 /* ************************************************************************** */
89 /* ********** Dijkstra & Dijkstra Cached ROUTING **************************** */
90 AS_t model_dijkstra_both_create(int cached); /* create by calling dijkstra or dijkstracache */
91 AS_t model_dijkstra_create(void); /* create structures for dijkstra routing model */
92 AS_t model_dijkstracache_create(void); /* create structures for dijkstracache routing model */
93 void model_dijkstra_both_end(AS_t as); /* finalize the creation of dijkstra routing model */
94 void model_dijkstra_both_parse_route (AS_t rc, const char *src,
95 const char *dst, route_t route);
97 /* ************************************************************************** */
98 /* *************************** FULL ROUTING ********************************* */
99 AS_t model_full_create(void); /* create structures for full routing model */
100 void model_full_end(AS_t as); /* finalize the creation of full routing model */
101 void model_full_set_route( /* Set the route and ASroute between src and dst */
102 AS_t rc, const char *src, const char *dst, route_t route);
105 #endif /* _SURF_SURF_ROUTING_PRIVATE_H */