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,
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,
45 /* ************************************************************************** */
46 /* ****************** GENERIC AUX FUNCTIONS (declarations) ****************** */
49 generic_new_extended_route(e_surf_routing_hierarchy_t hierarchy,
50 void *data, int order);
52 generic_new_route(e_surf_routing_hierarchy_t hierarchy,
53 void *data, int 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, const char *src,
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_link(const char* host_id,surf_parsing_link_up_down_t info);
79 void surf_routing_cluster_add_backbone(AS_t as, void* bb);
81 /* ************************************************** */
82 /* ************** Vivaldi ROUTING **************** */
83 AS_t model_vivaldi_create(void); /* create structures for vivaldi routing model */
84 #define HOST_PEER(peername) bprintf("peer_%s", peername)
85 #define ROUTER_PEER(peername) bprintf("router_%s", peername)
86 #define LINK_UP_PEER(peername) bprintf("link_%s_up", peername)
87 #define LINK_DOWN_PEER(peername) bprintf("link_%s_down", peername)
89 /* ************************************************************************** */
90 /* ********** Dijkstra & Dijkstra Cached ROUTING **************************** */
91 AS_t model_dijkstra_both_create(int cached); /* create by calling dijkstra or dijkstracache */
92 AS_t model_dijkstra_create(void); /* create structures for dijkstra routing model */
93 AS_t model_dijkstracache_create(void); /* create structures for dijkstracache routing model */
94 void model_dijkstra_both_end(AS_t as); /* finalize the creation of dijkstra routing model */
95 void model_dijkstra_both_parse_route (AS_t rc, const char *src,
96 const char *dst, route_t route);
98 /* ************************************************************************** */
99 /* *************************** FULL ROUTING ********************************* */
100 AS_t model_full_create(void); /* create structures for full routing model */
101 void model_full_end(AS_t as); /* finalize the creation of full routing model */
102 void model_full_set_route( /* Set the route and ASroute between src and dst */
103 AS_t rc, const char *src, const char *dst, route_t route);
106 #endif /* _SURF_SURF_ROUTING_PRIVATE_H */