1 /* Copyright (c) 2009-2016. The SimGrid Team. All rights reserved. */
3 /* This program is free software; you can redistribute it and/or modify it
4 * under the terms of the license (GNU LGPL) which comes with this package. */
6 #include "src/kernel/routing/AsDijkstra.hpp"
7 #include "src/kernel/routing/NetCard.hpp"
9 #include "src/surf/network_interface.hpp"
11 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_dijkstra, surf, "Routing part of surf -- dijkstra routing logic");
15 static void route_cache_elem_free(void *e)
17 route_cache_element_t elm = (route_cache_element_t) e;
19 xbt_free(elm->pred_arr);
24 static void graph_node_map_elem_free(void *e)
26 graph_node_map_element_t elm = (graph_node_map_element_t) e;
30 static void graph_edge_data_free(void *e) // FIXME: useless code duplication
32 sg_platf_route_cbarg_t e_route = (sg_platf_route_cbarg_t) e;
34 delete e_route->link_list;
39 /* Utility functions */
44 void AsDijkstra::seal()
46 xbt_node_t node = nullptr;
47 unsigned int cursor2, cursor;
49 /* Create the topology graph */
51 routeGraph_ = xbt_graph_new_graph(1, nullptr);
53 graphNodeMap_ = xbt_dict_new_homogeneous(&graph_node_map_elem_free);
55 /* Add the loopback if needed */
56 if (surf_network_model->loopback_ && hierarchy_ == RoutingMode::base) {
57 xbt_dynar_foreach(xbt_graph_get_nodes(routeGraph_), cursor, node) {
58 xbt_edge_t edge = nullptr;
61 xbt_dynar_foreach(xbt_graph_node_get_outedges(node), cursor2, edge) {
62 if (xbt_graph_edge_get_target(edge) == node) {
69 sg_platf_route_cbarg_t e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
70 e_route->link_list = new std::vector<Link*>();
71 e_route->link_list->push_back(surf_network_model->loopback_);
72 xbt_graph_new_edge(routeGraph_, node, node, e_route);
77 /* initialize graph indexes in nodes after graph has been built */
78 xbt_dynar_t nodes = xbt_graph_get_nodes(routeGraph_);
80 xbt_dynar_foreach(nodes, cursor, node) {
81 graph_node_data_t data = (graph_node_data_t) xbt_graph_node_get_data(node);
82 data->graph_id = cursor;
86 xbt_node_t AsDijkstra::routeGraphNewNode(int id, int graph_id)
88 xbt_node_t node = nullptr;
89 graph_node_data_t data = nullptr;
90 graph_node_map_element_t elm = nullptr;
92 data = xbt_new0(struct graph_node_data, 1);
94 data->graph_id = graph_id;
95 node = xbt_graph_new_node(routeGraph_, data);
97 elm = xbt_new0(struct graph_node_map_element, 1);
99 xbt_dict_set_ext(graphNodeMap_, (char *) (&id), sizeof(int), (xbt_dictelm_t) elm, nullptr);
104 graph_node_map_element_t AsDijkstra::nodeMapSearch(int id)
106 return (graph_node_map_element_t)xbt_dict_get_or_null_ext(graphNodeMap_, (char *) (&id), sizeof(int));
111 void AsDijkstra::newRoute(int src_id, int dst_id, sg_platf_route_cbarg_t e_route)
113 XBT_DEBUG("Load Route from \"%d\" to \"%d\"", src_id, dst_id);
114 xbt_node_t src = nullptr;
115 xbt_node_t dst = nullptr;
117 graph_node_map_element_t src_elm = nodeMapSearch(src_id);
118 graph_node_map_element_t dst_elm = nodeMapSearch(dst_id);
126 /* add nodes if they don't exist in the graph */
127 if (src_id == dst_id && src == nullptr && dst == nullptr) {
128 src = this->routeGraphNewNode(src_id, -1);
131 if (src == nullptr) {
132 src = this->routeGraphNewNode(src_id, -1);
134 if (dst == nullptr) {
135 dst = this->routeGraphNewNode(dst_id, -1);
139 /* add link as edge to graph */
140 xbt_graph_new_edge(routeGraph_, src, dst, e_route);
143 void AsDijkstra::getLocalRoute(NetCard* src, NetCard* dst, sg_platf_route_cbarg_t route, double* lat)
145 getRouteCheckParams(src, dst);
146 int src_id = src->id();
147 int dst_id = dst->id();
149 int *pred_arr = nullptr;
151 xbt_dynar_t nodes = xbt_graph_get_nodes(routeGraph_);
153 /* Use the graph_node id mapping set to quickly find the nodes */
154 graph_node_map_element_t src_elm = nodeMapSearch(src_id);
155 graph_node_map_element_t dst_elm = nodeMapSearch(dst_id);
157 int src_node_id = ((graph_node_data_t) xbt_graph_node_get_data(src_elm->node))->graph_id;
158 int dst_node_id = ((graph_node_data_t) xbt_graph_node_get_data(dst_elm->node))->graph_id;
160 /* if the src and dst are the same */
161 if (src_node_id == dst_node_id) {
163 xbt_node_t node_s_v = xbt_dynar_get_as(nodes, src_node_id, xbt_node_t);
164 xbt_node_t node_e_v = xbt_dynar_get_as(nodes, dst_node_id, xbt_node_t);
165 xbt_edge_t edge = xbt_graph_get_edge(routeGraph_, node_s_v, node_e_v);
168 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->name().c_str(), dst->name().c_str());
170 sg_platf_route_cbarg_t e_route = (sg_platf_route_cbarg_t)xbt_graph_edge_get_data(edge);
172 for (auto link: *e_route->link_list) {
173 route->link_list->insert(route->link_list->begin(), link);
175 *lat += static_cast<Link*>(link)->latency();
180 route_cache_element_t elm = nullptr;
181 if (routeCache_) { /* cache mode */
182 elm = (route_cache_element_t) xbt_dict_get_or_null_ext(routeCache_, (char *) (&src_id), sizeof(int));
185 if (elm) { /* cached mode and cache hit */
186 pred_arr = elm->pred_arr;
187 } else { /* not cached mode, or cache miss */
189 int nr_nodes = xbt_dynar_length(nodes);
190 double * cost_arr = xbt_new0(double, nr_nodes); /* link cost from src to other hosts */
191 pred_arr = xbt_new0(int, nr_nodes); /* predecessors in path from src */
192 xbt_heap_t pqueue = xbt_heap_new(nr_nodes, xbt_free_f);
195 cost_arr[src_node_id] = 0.0;
197 for (int i = 0; i < nr_nodes; i++) {
198 if (i != src_node_id) {
199 cost_arr[i] = DBL_MAX;
204 /* initialize priority queue */
205 int *nodeid = xbt_new0(int, 1);
207 xbt_heap_push(pqueue, nodeid, cost_arr[i]);
211 /* apply dijkstra using the indexes from the graph's node array */
212 while (xbt_heap_size(pqueue) > 0) {
213 int *v_id = (int *) xbt_heap_pop(pqueue);
214 xbt_node_t v_node = xbt_dynar_get_as(nodes, *v_id, xbt_node_t);
215 xbt_edge_t edge = nullptr;
218 xbt_dynar_foreach(xbt_graph_node_get_outedges(v_node), cursor, edge) {
219 xbt_node_t u_node = xbt_graph_edge_get_target(edge);
220 graph_node_data_t data = (graph_node_data_t) xbt_graph_node_get_data(u_node);
221 int u_id = data->graph_id;
222 sg_platf_route_cbarg_t tmp_e_route = (sg_platf_route_cbarg_t) xbt_graph_edge_get_data(edge);
223 int cost_v_u = tmp_e_route->link_list->size(); /* count of links, old model assume 1 */
225 if (cost_v_u + cost_arr[*v_id] < cost_arr[u_id]) {
226 pred_arr[u_id] = *v_id;
227 cost_arr[u_id] = cost_v_u + cost_arr[*v_id];
228 int *nodeid = xbt_new0(int, 1);
230 xbt_heap_push(pqueue, nodeid, cost_arr[u_id]);
234 /* free item popped from pqueue */
239 xbt_heap_free(pqueue);
242 /* compose route path with links */
243 NetCard *gw_src = nullptr, *gw_dst, *prev_gw_src, *first_gw = nullptr;
244 NetCard *gw_dst_net_elm = nullptr, *prev_gw_src_net_elm = nullptr;
246 for (int v = dst_node_id; v != src_node_id; v = pred_arr[v]) {
247 xbt_node_t node_pred_v = xbt_dynar_get_as(nodes, pred_arr[v], xbt_node_t);
248 xbt_node_t node_v = xbt_dynar_get_as(nodes, v, xbt_node_t);
249 xbt_edge_t edge = xbt_graph_get_edge(routeGraph_, node_pred_v, node_v);
252 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->name().c_str(), dst->name().c_str());
254 prev_gw_src = gw_src;
256 sg_platf_route_cbarg_t e_route = (sg_platf_route_cbarg_t)xbt_graph_edge_get_data(edge);
257 gw_src = e_route->gw_src;
258 gw_dst = e_route->gw_dst;
260 if (v == dst_node_id)
263 if (hierarchy_ == RoutingMode::recursive && v != dst_node_id &&
264 strcmp(gw_dst->name().c_str(), prev_gw_src->name().c_str())) {
265 std::vector<Link*> *e_route_as_to_as = new std::vector<Link*>();
267 getGlobalRoute(gw_dst_net_elm, prev_gw_src_net_elm, e_route_as_to_as, nullptr);
268 auto pos = route->link_list->begin();
269 for (auto link : *e_route_as_to_as) {
270 route->link_list->insert(pos, link);
272 *lat += link->latency();
277 for (auto link: *e_route->link_list) {
278 route->link_list->insert(route->link_list->begin(), link);
280 *lat += static_cast<Link*>(link)->latency();
285 if (hierarchy_ == RoutingMode::recursive) {
286 route->gw_src = gw_src;
287 route->gw_dst = first_gw;
290 if (routeCache_ && elm == nullptr) {
291 /* add to predecessor list of the current src-host to cache */
292 elm = xbt_new0(struct route_cache_element, 1);
293 elm->pred_arr = pred_arr;
295 xbt_dict_set_ext(routeCache_, (char *) (&src_id), sizeof(int), (xbt_dictelm_t) elm, nullptr);
302 AsDijkstra::~AsDijkstra()
304 xbt_graph_free_graph(routeGraph_, &xbt_free_f, &graph_edge_data_free, &xbt_free_f);
305 xbt_dict_free(&graphNodeMap_);
306 xbt_dict_free(&routeCache_);
309 /* Creation routing model functions */
311 AsDijkstra::AsDijkstra(As* father, const char* name, bool cached) : AsRoutedGraph(father, name)
314 routeCache_ = xbt_dict_new_homogeneous(&route_cache_elem_free);
317 void AsDijkstra::addRoute(sg_platf_route_cbarg_t route)
319 NetCard *src = route->src;
320 NetCard *dst = route->dst;
321 const char* srcName = src->name().c_str();
322 const char* dstName = dst->name().c_str();
324 addRouteCheckParams(route);
326 /* Create the topology graph */
328 routeGraph_ = xbt_graph_new_graph(1, nullptr);
330 graphNodeMap_ = xbt_dict_new_homogeneous(&graph_node_map_elem_free);
332 /* we don't check whether the route already exist, because the algorithm may find another path through some other nodes */
334 /* Add the route to the base */
335 sg_platf_route_cbarg_t e_route = newExtendedRoute(hierarchy_, route, 1);
336 newRoute(src->id(), dst->id(), e_route);
339 if (route->symmetrical == true) {
340 if(!route->gw_dst && !route->gw_src)
341 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", dstName, srcName);
343 XBT_DEBUG("Load ASroute from %s@%s to %s@%s", dstName, route->gw_dst->name().c_str(), srcName,
344 route->gw_src->name().c_str());
346 xbt_dynar_t nodes = xbt_graph_get_nodes(routeGraph_);
347 xbt_node_t node_s_v = xbt_dynar_get_as(nodes, src->id(), xbt_node_t);
348 xbt_node_t node_e_v = xbt_dynar_get_as(nodes, dst->id(), xbt_node_t);
349 xbt_edge_t edge = xbt_graph_get_edge(routeGraph_, node_e_v, node_s_v);
352 THROWF(arg_error, 0, "Route from %s@%s to %s@%s already exists", dstName, route->gw_dst->name().c_str(), srcName,
353 route->gw_src->name().c_str());
355 if (route->gw_dst && route->gw_src) {
356 NetCard *gw_tmp = route->gw_src;
357 route->gw_src = route->gw_dst;
358 route->gw_dst = gw_tmp;
360 sg_platf_route_cbarg_t link_route_back = newExtendedRoute(hierarchy_, route, 0);
361 newRoute(dst->id(), src->id(), link_route_back);