1 /* Copyright (c) 2009-2019. 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 "simgrid/kernel/routing/DijkstraZone.hpp"
7 #include "simgrid/kernel/routing/NetPoint.hpp"
8 #include "src/surf/network_interface.hpp"
9 #include "src/surf/xml/platf_private.hpp"
10 #include "surf/surf.hpp"
16 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_dijkstra, surf, "Routing part of surf -- dijkstra routing logic");
24 explicit GraphNodeData(int id) : id_(id) {}
26 int graph_id_ = -1; /* used for caching internal graph id's */
29 DijkstraZone::DijkstraZone(NetZoneImpl* father, const std::string& name, resource::NetworkModel* netmodel, bool cached)
30 : RoutedZone(father, name, netmodel), cached_(cached)
34 static void graph_node_data_free(void* n)
36 delete static_cast<simgrid::kernel::routing::GraphNodeData*>(n);
39 static void graph_edge_data_free(void* e)
41 delete static_cast<simgrid::kernel::routing::RouteCreationArgs*>(e);
44 DijkstraZone::~DijkstraZone()
46 xbt_graph_free_graph(route_graph_, &graph_node_data_free, &graph_edge_data_free, nullptr);
49 void DijkstraZone::seal()
52 xbt_node_t node = nullptr;
55 route_graph_ = xbt_graph_new_graph(1, nullptr);
57 /* Add the loopback if needed */
58 if (network_model_->loopback_ && hierarchy_ == RoutingMode::base) {
60 xbt_dynar_foreach (xbt_graph_get_nodes(route_graph_), cursor, node) {
62 xbt_edge_t edge = nullptr;
64 xbt_dynar_foreach (xbt_graph_node_get_outedges(node), cursor2, edge) {
65 if (xbt_graph_edge_get_target(edge) == node) { // There is an edge from node to itself
72 RouteCreationArgs* route = new simgrid::kernel::routing::RouteCreationArgs();
73 route->link_list.push_back(network_model_->loopback_);
74 xbt_graph_new_edge(route_graph_, node, node, route);
79 /* initialize graph indexes in nodes after graph has been built */
80 xbt_dynar_t nodes = xbt_graph_get_nodes(route_graph_);
82 xbt_dynar_foreach (nodes, cursor, node) {
83 GraphNodeData* data = static_cast<GraphNodeData*>(xbt_graph_node_get_data(node));
84 data->graph_id_ = cursor;
88 xbt_node_t DijkstraZone::route_graph_new_node(int id)
90 xbt_node_t node = xbt_graph_new_node(route_graph_, new GraphNodeData(id));
91 graph_node_map_.emplace(id, node);
96 xbt_node_t DijkstraZone::node_map_search(int id)
98 auto ret = graph_node_map_.find(id);
99 return ret == graph_node_map_.end() ? nullptr : ret->second;
104 void DijkstraZone::get_local_route(NetPoint* src, NetPoint* dst, RouteCreationArgs* route, double* lat)
106 get_route_check_params(src, dst);
107 int src_id = src->id();
108 int dst_id = dst->id();
110 xbt_dynar_t nodes = xbt_graph_get_nodes(route_graph_);
112 /* Use the graph_node id mapping set to quickly find the nodes */
113 xbt_node_t src_elm = node_map_search(src_id);
114 xbt_node_t dst_elm = node_map_search(dst_id);
116 int src_node_id = static_cast<GraphNodeData*>(xbt_graph_node_get_data(src_elm))->graph_id_;
117 int dst_node_id = static_cast<GraphNodeData*>(xbt_graph_node_get_data(dst_elm))->graph_id_;
119 /* if the src and dst are the same */
120 if (src_node_id == dst_node_id) {
122 xbt_node_t node_s_v = xbt_dynar_get_as(nodes, src_node_id, xbt_node_t);
123 xbt_node_t node_e_v = xbt_dynar_get_as(nodes, dst_node_id, xbt_node_t);
124 xbt_edge_t edge = xbt_graph_get_edge(route_graph_, node_s_v, node_e_v);
127 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->get_cname(), dst->get_cname());
129 RouteCreationArgs* e_route = static_cast<RouteCreationArgs*>(xbt_graph_edge_get_data(edge));
131 for (auto const& link : e_route->link_list) {
132 route->link_list.insert(route->link_list.begin(), link);
134 *lat += static_cast<resource::LinkImpl*>(link)->get_latency();
138 auto elm = route_cache_.emplace(src_id, std::vector<int>());
139 std::vector<int>& pred_arr = elm.first->second;
141 if (elm.second) { /* new element was inserted (not cached mode, or cache miss) */
142 int nr_nodes = xbt_dynar_length(nodes);
143 std::vector<double> cost_arr(nr_nodes); /* link cost from src to other hosts */
144 pred_arr.resize(nr_nodes); /* predecessors in path from src */
145 typedef std::pair<double, int> Qelt;
146 std::priority_queue<Qelt, std::vector<Qelt>, std::greater<Qelt>> pqueue;
149 cost_arr[src_node_id] = 0.0;
151 for (int i = 0; i < nr_nodes; i++) {
152 if (i != src_node_id) {
153 cost_arr[i] = DBL_MAX;
158 /* initialize priority queue */
159 pqueue.emplace(cost_arr[i], i);
162 /* apply dijkstra using the indexes from the graph's node array */
163 while (not pqueue.empty()) {
164 int v_id = pqueue.top().second;
166 xbt_node_t v_node = xbt_dynar_get_as(nodes, v_id, xbt_node_t);
167 xbt_edge_t edge = nullptr;
170 xbt_dynar_foreach (xbt_graph_node_get_outedges(v_node), cursor, edge) {
171 xbt_node_t u_node = xbt_graph_edge_get_target(edge);
172 GraphNodeData* data = static_cast<GraphNodeData*>(xbt_graph_node_get_data(u_node));
173 int u_id = data->graph_id_;
174 RouteCreationArgs* tmp_e_route = static_cast<RouteCreationArgs*>(xbt_graph_edge_get_data(edge));
175 int cost_v_u = tmp_e_route->link_list.size(); /* count of links, old model assume 1 */
177 if (cost_v_u + cost_arr[v_id] < cost_arr[u_id]) {
178 pred_arr[u_id] = v_id;
179 cost_arr[u_id] = cost_v_u + cost_arr[v_id];
180 pqueue.emplace(cost_arr[u_id], u_id);
186 /* compose route path with links */
187 NetPoint* gw_src = nullptr;
188 NetPoint* first_gw = nullptr;
190 for (int v = dst_node_id; v != src_node_id; v = pred_arr[v]) {
191 xbt_node_t node_pred_v = xbt_dynar_get_as(nodes, pred_arr[v], xbt_node_t);
192 xbt_node_t node_v = xbt_dynar_get_as(nodes, v, xbt_node_t);
193 xbt_edge_t edge = xbt_graph_get_edge(route_graph_, node_pred_v, node_v);
196 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->get_cname(), dst->get_cname());
198 RouteCreationArgs* e_route = static_cast<RouteCreationArgs*>(xbt_graph_edge_get_data(edge));
200 NetPoint* prev_gw_src = gw_src;
201 gw_src = e_route->gw_src;
202 NetPoint* gw_dst = e_route->gw_dst;
204 if (v == dst_node_id)
207 if (hierarchy_ == RoutingMode::recursive && v != dst_node_id && gw_dst->get_name() != prev_gw_src->get_name()) {
208 std::vector<resource::LinkImpl*> e_route_as_to_as;
210 NetPoint* gw_dst_net_elm = nullptr;
211 NetPoint* prev_gw_src_net_elm = nullptr;
212 get_global_route(gw_dst_net_elm, prev_gw_src_net_elm, e_route_as_to_as, nullptr);
213 auto pos = route->link_list.begin();
214 for (auto const& link : e_route_as_to_as) {
215 route->link_list.insert(pos, link);
217 *lat += link->get_latency();
222 for (auto const& link : e_route->link_list) {
223 route->link_list.insert(route->link_list.begin(), link);
225 *lat += static_cast<resource::LinkImpl*>(link)->get_latency();
229 if (hierarchy_ == RoutingMode::recursive) {
230 route->gw_src = gw_src;
231 route->gw_dst = first_gw;
235 route_cache_.clear();
238 void DijkstraZone::add_route(NetPoint* src, NetPoint* dst, NetPoint* gw_src, NetPoint* gw_dst,
239 std::vector<resource::LinkImpl*>& link_list, bool symmetrical)
241 add_route_check_params(src, dst, gw_src, gw_dst, link_list, symmetrical);
243 if (not route_graph_)
244 route_graph_ = xbt_graph_new_graph(1, nullptr);
246 new_edge(src->id(), dst->id(), new_extended_route(hierarchy_, src, dst, gw_src, gw_dst, link_list, symmetrical, 1));
248 if (symmetrical == true)
249 new_edge(dst->id(), src->id(), new_extended_route(hierarchy_, dst, src, gw_dst, gw_src, link_list, symmetrical, 0));
252 void DijkstraZone::new_edge(int src_id, int dst_id, simgrid::kernel::routing::RouteCreationArgs* route)
254 XBT_DEBUG("Create Route from '%d' to '%d'", src_id, dst_id);
256 // Get the extremities, or create them if they don't exist yet
257 xbt_node_t src = node_map_search(src_id);
259 src = route_graph_new_node(src_id);
261 xbt_node_t dst = node_map_search(dst_id);
263 dst = route_graph_new_node(dst_id);
265 // Make sure that this graph edge was not already added to the graph
266 if (xbt_graph_get_edge(route_graph_, src, dst) != nullptr) {
267 if (route->gw_dst == nullptr || route->gw_src == nullptr)
268 THROWF(arg_error, 0, "Route from %s to %s already exists", route->src->get_cname(), route->dst->get_cname());
270 THROWF(arg_error, 0, "Route from %s@%s to %s@%s already exists", route->src->get_cname(),
271 route->gw_src->get_cname(), route->dst->get_cname(), route->gw_dst->get_cname());
275 xbt_graph_new_edge(route_graph_, src, dst, route);