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 #include "surf_routing_dijkstra.hpp"
8 #include "surf_routing_private.h"
12 extern routing_platf_t routing_platf;
15 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_dijkstra, surf, "Routing part of surf -- dijkstra routing logic");
18 AS_t model_dijkstra_create(void){
19 return new AsDijkstra(0);
22 AS_t model_dijkstracache_create(void){
23 return new AsDijkstra(1);
26 void model_dijkstra_both_end(AS_t as)
33 static void route_cache_elem_free(void *e)
35 route_cache_element_t elm = (route_cache_element_t) e;
37 xbt_free(elm->pred_arr);
42 static void graph_node_map_elem_free(void *e)
44 graph_node_map_element_t elm = (graph_node_map_element_t) e;
48 static void graph_edge_data_free(void *e) // FIXME: useless code duplication
50 sg_platf_route_cbarg_t e_route = (sg_platf_route_cbarg_t) e;
52 xbt_dynar_free(&(e_route->link_list));
57 /* Utility functions */
59 xbt_node_t AsDijkstra::routeGraphNewNode(int id, int graph_id)
61 xbt_node_t node = NULL;
62 graph_node_data_t data = NULL;
63 graph_node_map_element_t elm = NULL;
65 data = xbt_new0(struct graph_node_data, 1);
67 data->graph_id = graph_id;
68 node = xbt_graph_new_node(p_routeGraph, data);
70 elm = xbt_new0(struct graph_node_map_element, 1);
72 xbt_dict_set_ext(p_graphNodeMap, (char *) (&id), sizeof(int),
73 (xbt_set_elm_t) elm, NULL);
78 graph_node_map_element_t AsDijkstra::nodeMapSearch(int id)
80 graph_node_map_element_t elm = (graph_node_map_element_t)
81 xbt_dict_get_or_null_ext(p_graphNodeMap,
89 void AsDijkstra::newRoute(int src_id, int dst_id, sg_platf_route_cbarg_t e_route)
91 XBT_DEBUG("Load Route from \"%d\" to \"%d\"", src_id, dst_id);
92 xbt_node_t src = NULL;
93 xbt_node_t dst = NULL;
95 graph_node_map_element_t src_elm = (graph_node_map_element_t)
96 xbt_dict_get_or_null_ext(p_graphNodeMap,
99 graph_node_map_element_t dst_elm = (graph_node_map_element_t)
100 xbt_dict_get_or_null_ext(p_graphNodeMap,
111 /* add nodes if they don't exist in the graph */
112 if (src_id == dst_id && src == NULL && dst == NULL) {
113 src = this->routeGraphNewNode(src_id, -1);
117 src = this->routeGraphNewNode(src_id, -1);
120 dst = this->routeGraphNewNode(dst_id, -1);
124 /* add link as edge to graph */
125 xbt_graph_new_edge(p_routeGraph, src, dst, e_route);
128 void AsDijkstra::addLoopback() {
129 xbt_dynar_t nodes = xbt_graph_get_nodes(p_routeGraph);
131 xbt_node_t node = NULL;
132 unsigned int cursor2;
133 xbt_dynar_foreach(nodes, cursor2, node) {
134 xbt_dynar_t out_edges = xbt_graph_node_get_outedges(node);
135 xbt_edge_t edge = NULL;
139 xbt_dynar_foreach(out_edges, cursor, edge) {
140 xbt_node_t other_node = xbt_graph_edge_get_target(edge);
141 if (other_node == node) {
148 sg_platf_route_cbarg_t e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
149 e_route->link_list = xbt_dynar_new(sizeof(sg_routing_link_t), NULL);
150 xbt_dynar_push(e_route->link_list, &routing_platf->p_loopback);
151 xbt_graph_new_edge(p_routeGraph, node, node, e_route);
156 xbt_dynar_t AsDijkstra::getOnelinkRoutes()
158 xbt_dynar_t ret = xbt_dynar_new(sizeof(OnelinkPtr), xbt_free);
159 sg_platf_route_cbarg_t route = xbt_new0(s_sg_platf_route_cbarg_t,1);
160 route->link_list = xbt_dynar_new(sizeof(sg_routing_link_t),NULL);
163 RoutingEdgePtr src_elm, dst_elm;
164 size_t table_size = xbt_dynar_length(p_indexNetworkElm);
165 for(src=0; src < table_size; src++) {
166 for(dst=0; dst< table_size; dst++) {
167 xbt_dynar_reset(route->link_list);
168 src_elm = xbt_dynar_get_as(p_indexNetworkElm, src, RoutingEdgePtr);
169 dst_elm = xbt_dynar_get_as(p_indexNetworkElm, dst, RoutingEdgePtr);
170 this->getRouteAndLatency(src_elm, dst_elm,route, NULL);
172 if (xbt_dynar_length(route->link_list) == 1) {
173 void *link = *(void **) xbt_dynar_get_ptr(route->link_list, 0);
174 OnelinkPtr onelink = new Onelink();
175 onelink->p_linkPtr = link;
176 if (p_hierarchy == SURF_ROUTING_BASE) {
177 onelink->p_src = src_elm;
178 onelink->p_dst = dst_elm;
179 } else if (p_hierarchy == SURF_ROUTING_RECURSIVE) {
180 onelink->p_src = route->gw_src;
181 onelink->p_dst = route->gw_dst;
183 xbt_dynar_push(ret, &onelink);
190 void AsDijkstra::getRouteAndLatency(RoutingEdgePtr src, RoutingEdgePtr dst, sg_platf_route_cbarg_t route, double *lat)
195 srcDstCheck(src, dst);
196 int *src_id = &(src->m_id);
197 int *dst_id = &(dst->m_id);
199 if (!src_id || !dst_id)
200 THROWF(arg_error,0,"No route from '%s' to '%s'",src->p_name,dst->p_name);
202 int *pred_arr = NULL;
207 sg_platf_route_cbarg_t e_route;
210 NetworkCm02LinkPtr link;
211 xbt_dynar_t links = NULL;
212 route_cache_element_t elm = NULL;
213 xbt_dynar_t nodes = xbt_graph_get_nodes(p_routeGraph);
215 /* Use the graph_node id mapping set to quickly find the nodes */
216 graph_node_map_element_t src_elm = nodeMapSearch(*src_id);
217 graph_node_map_element_t dst_elm = nodeMapSearch(*dst_id);
219 src_node_id = ((graph_node_data_t)
220 xbt_graph_node_get_data(src_elm->node))->graph_id;
221 dst_node_id = ((graph_node_data_t)
222 xbt_graph_node_get_data(dst_elm->node))->graph_id;
224 /* if the src and dst are the same */
225 if (src_node_id == dst_node_id) {
227 xbt_node_t node_s_v = xbt_dynar_get_as(nodes, src_node_id, xbt_node_t);
228 xbt_node_t node_e_v = xbt_dynar_get_as(nodes, dst_node_id, xbt_node_t);
229 xbt_edge_t edge = xbt_graph_get_edge(p_routeGraph, node_s_v, node_e_v);
232 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->p_name, dst->p_name);
234 e_route = (sg_platf_route_cbarg_t) xbt_graph_edge_get_data(edge);
236 links = e_route->link_list;
237 xbt_dynar_foreach(links, cpt, link) {
238 xbt_dynar_unshift(route->link_list, &link);
240 *lat += link->getLatency();
246 /*check if there is a cached predecessor list avail */
247 elm = (route_cache_element_t)
248 xbt_dict_get_or_null_ext(p_routeCache, (char *) (&src_id),
252 if (elm) { /* cached mode and cache hit */
253 pred_arr = elm->pred_arr;
254 } else { /* not cached mode or cache miss */
255 double *cost_arr = NULL;
256 xbt_heap_t pqueue = NULL;
259 int nr_nodes = xbt_dynar_length(nodes);
260 cost_arr = xbt_new0(double, nr_nodes); /* link cost from src to other hosts */
261 pred_arr = xbt_new0(int, nr_nodes); /* predecessors in path from src */
262 pqueue = xbt_heap_new(nr_nodes, xbt_free);
265 cost_arr[src_node_id] = 0.0;
267 for (i = 0; i < nr_nodes; i++) {
268 if (i != src_node_id) {
269 cost_arr[i] = DBL_MAX;
274 /* initialize priority queue */
275 nodeid = xbt_new0(int, 1);
277 xbt_heap_push(pqueue, nodeid, cost_arr[i]);
281 /* apply dijkstra using the indexes from the graph's node array */
282 while (xbt_heap_size(pqueue) > 0) {
283 int *v_id = (int *) xbt_heap_pop(pqueue);
284 xbt_node_t v_node = xbt_dynar_get_as(nodes, *v_id, xbt_node_t);
285 xbt_dynar_t out_edges = xbt_graph_node_get_outedges(v_node);
286 xbt_edge_t edge = NULL;
289 xbt_dynar_foreach(out_edges, cursor, edge) {
290 xbt_node_t u_node = xbt_graph_edge_get_target(edge);
291 graph_node_data_t data = (graph_node_data_t) xbt_graph_node_get_data(u_node);
292 int u_id = data->graph_id;
293 sg_platf_route_cbarg_t tmp_e_route = (sg_platf_route_cbarg_t) xbt_graph_edge_get_data(edge);
294 int cost_v_u = (tmp_e_route->link_list)->used; /* count of links, old model assume 1 */
296 if (cost_v_u + cost_arr[*v_id] < cost_arr[u_id]) {
297 pred_arr[u_id] = *v_id;
298 cost_arr[u_id] = cost_v_u + cost_arr[*v_id];
299 nodeid = xbt_new0(int, 1);
301 xbt_heap_push(pqueue, nodeid, cost_arr[u_id]);
305 /* free item popped from pqueue */
310 xbt_heap_free(pqueue);
313 /* compose route path with links */
314 RoutingEdgePtr gw_src = NULL, gw_dst, prev_gw_src, first_gw = NULL;
315 RoutingEdgePtr gw_dst_net_elm = NULL, prev_gw_src_net_elm = NULL;
317 for (v = dst_node_id; v != src_node_id; v = pred_arr[v]) {
318 xbt_node_t node_pred_v =
319 xbt_dynar_get_as(nodes, pred_arr[v], xbt_node_t);
320 xbt_node_t node_v = xbt_dynar_get_as(nodes, v, xbt_node_t);
322 xbt_graph_get_edge(p_routeGraph, node_pred_v, node_v);
325 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->p_name, dst->p_name);
327 prev_gw_src = gw_src;
329 e_route = (sg_platf_route_cbarg_t) xbt_graph_edge_get_data(edge);
330 gw_src = e_route->gw_src;
331 gw_dst = e_route->gw_dst;
333 if (v == dst_node_id)
336 if (p_hierarchy == SURF_ROUTING_RECURSIVE && v != dst_node_id
337 && strcmp(gw_dst->p_name, prev_gw_src->p_name)) {
338 xbt_dynar_t e_route_as_to_as=NULL;
340 routing_platf->getRouteAndLatency(gw_dst_net_elm, prev_gw_src_net_elm, &e_route_as_to_as, NULL);
342 THROWF(arg_error,0,"No route from '%s' to '%s'", src->p_name, dst->p_name);
343 links = e_route_as_to_as;
345 xbt_dynar_foreach(links, cpt, link) {
346 xbt_dynar_insert_at(route->link_list, pos, &link);
348 *lat += link->getLatency();
353 links = e_route->link_list;
354 xbt_dynar_foreach(links, cpt, link) {
355 xbt_dynar_unshift(route->link_list, &link);
357 *lat += link->getLatency();
362 if (p_hierarchy == SURF_ROUTING_RECURSIVE) {
363 route->gw_src = gw_src;
364 route->gw_dst = first_gw;
367 if (m_cached && elm == NULL) {
368 /* add to predecessor list of the current src-host to cache */
369 elm = xbt_new0(struct route_cache_element, 1);
370 elm->pred_arr = pred_arr;
372 xbt_dict_set_ext(p_routeCache, (char *) (&src_id), sizeof(int),
373 (xbt_set_elm_t) elm, NULL);
380 AsDijkstra::~AsDijkstra()
382 xbt_graph_free_graph(p_routeGraph, &xbt_free,
383 &graph_edge_data_free, &xbt_free);
384 xbt_dict_free(&p_graphNodeMap);
386 xbt_dict_free(&p_routeCache);
389 /* Creation routing model functions */
391 AsDijkstra::AsDijkstra() : AsGeneric(), m_cached(0) {}
393 AsDijkstra::AsDijkstra(int cached) : AsGeneric(), m_cached(cached)
395 /*new_component->generic_routing.parse_route = model_dijkstra_both_parse_route;
396 new_component->generic_routing.parse_ASroute = model_dijkstra_both_parse_route;
397 new_component->generic_routing.get_route_and_latency = dijkstra_get_route_and_latency;
398 new_component->generic_routing.get_onelink_routes =
399 dijkstra_get_onelink_routes;
400 new_component->generic_routing.get_graph = generic_get_graph;
401 new_component->generic_routing.finalize = dijkstra_finalize;
402 new_component->cached = cached;*/
405 void AsDijkstra::end()
407 xbt_node_t node = NULL;
408 unsigned int cursor2;
409 xbt_dynar_t nodes = NULL;
411 /* Create the topology graph */
413 p_routeGraph = xbt_graph_new_graph(1, NULL);
415 p_graphNodeMap = xbt_dict_new_homogeneous(&graph_node_map_elem_free);
417 if (m_cached && p_routeCache)
418 p_routeCache = xbt_dict_new_homogeneous(&route_cache_elem_free);
420 /* Add the loopback if needed */
421 if (routing_platf->p_loopback && p_hierarchy == SURF_ROUTING_BASE)
424 /* initialize graph indexes in nodes after graph has been built */
425 nodes = xbt_graph_get_nodes(p_routeGraph);
427 xbt_dynar_foreach(nodes, cursor2, node) {
428 graph_node_data_t data = (graph_node_data_t) xbt_graph_node_get_data(node);
429 data->graph_id = cursor2;
433 void AsDijkstra::parseRoute(sg_platf_route_cbarg_t route)
435 char *src = (char*)(route->src);
436 char *dst = (char*)(route->dst);
439 if(!route->gw_dst && !route->gw_src)
440 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", src, dst);
442 XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", src,
443 route->gw_src->p_name, dst, route->gw_dst->p_name);
445 if(route->gw_dst->p_rcType == SURF_NETWORK_ELEMENT_NULL)
446 xbt_die("The gw_dst '%s' does not exist!",route->gw_dst->p_name);
447 if(route->gw_src->p_rcType == SURF_NETWORK_ELEMENT_NULL)
448 xbt_die("The gw_src '%s' does not exist!",route->gw_src->p_name);
451 RoutingEdgePtr src_net_elm, dst_net_elm;
453 src_net_elm = sg_routing_edge_by_name_or_null(src);
454 dst_net_elm = sg_routing_edge_by_name_or_null(dst);
456 xbt_assert(src_net_elm, "Network elements %s not found", src);
457 xbt_assert(dst_net_elm, "Network elements %s not found", dst);
459 /* Create the topology graph */
461 p_routeGraph = xbt_graph_new_graph(1, NULL);
463 p_graphNodeMap = xbt_dict_new_homogeneous(&graph_node_map_elem_free);
465 if (m_cached && !p_routeCache)
466 p_routeCache = xbt_dict_new_homogeneous(&route_cache_elem_free);
468 sg_platf_route_cbarg_t e_route = newExtendedRoute(p_hierarchy, route, 1);
469 newRoute(src_net_elm->m_id, dst_net_elm->m_id, e_route);
472 if ( (route->symmetrical == TRUE && as_route == 0)
473 || (route->symmetrical == TRUE && as_route == 1)
476 if(!route->gw_dst && !route->gw_src)
477 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", dst, src);
479 XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", dst,
480 route->gw_dst->p_name, src, route->gw_src->p_name);
482 xbt_dynar_t nodes = xbt_graph_get_nodes(p_routeGraph);
483 xbt_node_t node_s_v = xbt_dynar_get_as(nodes, src_net_elm->m_id, xbt_node_t);
484 xbt_node_t node_e_v = xbt_dynar_get_as(nodes, dst_net_elm->m_id, xbt_node_t);
486 xbt_graph_get_edge(p_routeGraph, node_e_v, node_s_v);
489 THROWF(arg_error,0,"(AS)Route from '%s' to '%s' already exists",src,dst);
491 if (route->gw_dst && route->gw_src) {
492 RoutingEdgePtr gw_tmp;
493 gw_tmp = route->gw_src;
494 route->gw_src = route->gw_dst;
495 route->gw_dst = gw_tmp;
497 sg_platf_route_cbarg_t link_route_back = newExtendedRoute(p_hierarchy, route, 0);
498 newRoute(dst_net_elm->m_id, src_net_elm->m_id, link_route_back);
500 xbt_dynar_free(&route->link_list);