1 /* Copyright (c) 2009-2021. 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 "surf/surf.hpp"
10 #include "xbt/string.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 unsigned long graph_id_ = UINT_MAX; /* used for caching internal graph id's */
29 void DijkstraZone::route_graph_delete(xbt_graph_t g)
32 g, [](void* n) { delete static_cast<GraphNodeData*>(n); }, [](void* e) { delete static_cast<Route*>(e); },
36 void DijkstraZone::do_seal()
39 xbt_node_t node = nullptr;
41 /* Add the loopback if needed */
42 if (get_network_model()->loopback_ && get_hierarchy() == RoutingMode::base) {
43 xbt_dynar_foreach (xbt_graph_get_nodes(route_graph_.get()), cursor, node) {
45 xbt_edge_t edge = nullptr;
47 xbt_dynar_foreach (xbt_graph_node_get_outedges(node), cursor2, edge) {
48 if (xbt_graph_edge_get_target(edge) == node) { // There is an edge from node to itself
55 auto* route = new Route();
56 route->link_list_.push_back(get_network_model()->loopback_);
57 xbt_graph_new_edge(route_graph_.get(), node, node, route);
62 /* initialize graph indexes in nodes after graph has been built */
63 const_xbt_dynar_t nodes = xbt_graph_get_nodes(route_graph_.get());
65 xbt_dynar_foreach (nodes, cursor, node) {
66 auto* data = static_cast<GraphNodeData*>(xbt_graph_node_get_data(node));
67 data->graph_id_ = cursor;
71 xbt_node_t DijkstraZone::route_graph_new_node(int id)
73 xbt_node_t node = xbt_graph_new_node(route_graph_.get(), new GraphNodeData(id));
74 graph_node_map_.emplace(id, node);
79 xbt_node_t DijkstraZone::node_map_search(int id)
81 auto ret = graph_node_map_.find(id);
82 return ret == graph_node_map_.end() ? nullptr : ret->second;
87 void DijkstraZone::get_local_route(const NetPoint* src, const NetPoint* dst, Route* route, double* lat)
89 get_route_check_params(src, dst);
90 int src_id = src->id();
91 int dst_id = dst->id();
93 const_xbt_dynar_t nodes = xbt_graph_get_nodes(route_graph_.get());
95 /* Use the graph_node id mapping set to quickly find the nodes */
96 const s_xbt_node_t* src_elm = node_map_search(src_id);
97 const s_xbt_node_t* dst_elm = node_map_search(dst_id);
99 unsigned int src_node_id = static_cast<GraphNodeData*>(xbt_graph_node_get_data(src_elm))->graph_id_;
100 unsigned int dst_node_id = static_cast<GraphNodeData*>(xbt_graph_node_get_data(dst_elm))->graph_id_;
102 /* if the src and dst are the same */
103 if (src_node_id == dst_node_id) {
104 const s_xbt_node_t* node_s_v = xbt_dynar_get_as(nodes, src_node_id, xbt_node_t);
105 const s_xbt_node_t* node_e_v = xbt_dynar_get_as(nodes, dst_node_id, xbt_node_t);
106 const s_xbt_edge_t* edge = xbt_graph_get_edge(route_graph_.get(), node_s_v, node_e_v);
109 throw std::invalid_argument(xbt::string_printf("No route from '%s' to '%s'", src->get_cname(), dst->get_cname()));
111 const Route* e_route = static_cast<Route*>(xbt_graph_edge_get_data(edge));
113 for (auto const& link : e_route->link_list_) {
114 route->link_list_.insert(route->link_list_.begin(), link);
116 *lat += link->get_latency();
120 auto elm = route_cache_.emplace(src_id, std::vector<int>());
121 std::vector<int>& pred_arr = elm.first->second;
123 if (elm.second) { /* new element was inserted (not cached mode, or cache miss) */
124 unsigned long nr_nodes = xbt_dynar_length(nodes);
125 std::vector<unsigned long> cost_arr(nr_nodes); /* link cost from src to other hosts */
126 pred_arr.resize(nr_nodes); /* predecessors in path from src */
127 using Qelt = std::pair<double, int>;
128 std::priority_queue<Qelt, std::vector<Qelt>, std::greater<>> pqueue;
131 cost_arr[src_node_id] = 0;
133 for (unsigned long i = 0; i < nr_nodes; i++) {
134 if (i != src_node_id) {
135 cost_arr[i] = ULONG_MAX;
140 /* initialize priority queue */
141 pqueue.emplace(cost_arr[i], i);
144 /* apply dijkstra using the indexes from the graph's node array */
145 while (not pqueue.empty()) {
146 int v_id = pqueue.top().second;
148 const s_xbt_node_t* v_node = xbt_dynar_get_as(nodes, v_id, xbt_node_t);
149 xbt_edge_t edge = nullptr;
152 xbt_dynar_foreach (xbt_graph_node_get_outedges(v_node), cursor, edge) {
153 const s_xbt_node_t* u_node = xbt_graph_edge_get_target(edge);
154 const GraphNodeData* data = static_cast<GraphNodeData*>(xbt_graph_node_get_data(u_node));
155 int u_id = data->graph_id_;
156 const Route* tmp_e_route = static_cast<Route*>(xbt_graph_edge_get_data(edge));
157 unsigned long cost_v_u = tmp_e_route->link_list_.size(); /* count of links, old model assume 1 */
159 if (cost_v_u + cost_arr[v_id] < cost_arr[u_id]) {
160 pred_arr[u_id] = v_id;
161 cost_arr[u_id] = cost_v_u + cost_arr[v_id];
162 pqueue.emplace(cost_arr[u_id], u_id);
168 /* compose route path with links */
169 NetPoint* gw_src = nullptr;
170 NetPoint* first_gw = nullptr;
172 for (unsigned int v = dst_node_id; v != src_node_id; v = pred_arr[v]) {
173 const s_xbt_node_t* node_pred_v = xbt_dynar_get_as(nodes, pred_arr[v], xbt_node_t);
174 const s_xbt_node_t* node_v = xbt_dynar_get_as(nodes, v, xbt_node_t);
175 const s_xbt_edge_t* edge = xbt_graph_get_edge(route_graph_.get(), node_pred_v, node_v);
178 throw std::invalid_argument(xbt::string_printf("No route from '%s' to '%s'", src->get_cname(), dst->get_cname()));
180 const Route* e_route = static_cast<Route*>(xbt_graph_edge_get_data(edge));
182 const NetPoint* prev_gw_src = gw_src;
183 gw_src = e_route->gw_src_;
184 NetPoint* gw_dst = e_route->gw_dst_;
186 if (v == dst_node_id)
189 if (get_hierarchy() == RoutingMode::recursive && v != dst_node_id &&
190 gw_dst->get_name() != prev_gw_src->get_name()) {
191 std::vector<resource::LinkImpl*> e_route_as_to_as;
193 NetPoint* gw_dst_net_elm = nullptr;
194 NetPoint* prev_gw_src_net_elm = nullptr;
195 get_global_route(gw_dst_net_elm, prev_gw_src_net_elm, e_route_as_to_as, nullptr);
196 auto pos = route->link_list_.begin();
197 for (auto const& link : e_route_as_to_as) {
198 route->link_list_.insert(pos, link);
200 *lat += link->get_latency();
205 for (auto const& link : e_route->link_list_) {
206 route->link_list_.insert(route->link_list_.begin(), link);
208 *lat += link->get_latency();
212 if (get_hierarchy() == RoutingMode::recursive) {
213 route->gw_src_ = gw_src;
214 route->gw_dst_ = first_gw;
218 route_cache_.clear();
221 void DijkstraZone::add_route(NetPoint* src, NetPoint* dst, NetPoint* gw_src, NetPoint* gw_dst,
222 const std::vector<resource::LinkImpl*>& link_list_, bool symmetrical)
224 add_route_check_params(src, dst, gw_src, gw_dst, link_list_, symmetrical);
226 new_edge(src->id(), dst->id(), new_extended_route(get_hierarchy(), gw_src, gw_dst, link_list_, true));
229 new_edge(dst->id(), src->id(), new_extended_route(get_hierarchy(), gw_dst, gw_src, link_list_, false));
232 void DijkstraZone::new_edge(int src_id, int dst_id, Route* route)
234 XBT_DEBUG("Create Route from '%d' to '%d'", src_id, dst_id);
236 // Get the extremities, or create them if they don't exist yet
237 xbt_node_t src = node_map_search(src_id);
239 src = route_graph_new_node(src_id);
241 xbt_node_t dst = node_map_search(dst_id);
243 dst = route_graph_new_node(dst_id);
245 // Make sure that this graph edge was not already added to the graph
246 if (xbt_graph_get_edge(route_graph_.get(), src, dst) != nullptr) {
247 if (route->gw_dst_ == nullptr || route->gw_src_ == nullptr)
248 throw std::invalid_argument(
249 xbt::string_printf("Route from %s to %s already exists", route->src_->get_cname(), route->dst_->get_cname()));
251 throw std::invalid_argument(xbt::string_printf("Route from %s@%s to %s@%s already exists",
252 route->src_->get_cname(), route->gw_src_->get_cname(),
253 route->dst_->get_cname(), route->gw_dst_->get_cname()));
257 xbt_graph_new_edge(route_graph_.get(), src, dst, route);
259 } // namespace routing
260 } // namespace kernel
263 NetZone* create_dijkstra_zone(const std::string& name, bool cache)
265 return (new kernel::routing::DijkstraZone(name, cache))->get_iface();
269 } // namespace simgrid