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. */
9 #include "src/kernel/routing/AsFloyd.hpp"
10 #include "src/surf/network_interface.hpp"
12 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_floyd, surf, "Routing part of surf");
14 #define TO_FLOYD_COST(i,j) (costTable_)[(i)+(j)*table_size]
15 #define TO_FLOYD_PRED(i,j) (predecessorTable_)[(i)+(j)*table_size]
16 #define TO_FLOYD_LINK(i,j) (linkTable_)[(i)+(j)*table_size]
22 AsFloyd::AsFloyd(As* father, const char* name) : AsRoutedGraph(father, name)
24 predecessorTable_ = nullptr;
30 if (linkTable_ == nullptr) // Dealing with a parse error in the file?
32 int table_size = vertices_.size();
33 /* Delete link_table */
34 for (int i = 0; i < table_size; i++)
35 for (int j = 0; j < table_size; j++)
36 routing_route_free(TO_FLOYD_LINK(i, j));
39 xbt_free(predecessorTable_);
43 void AsFloyd::getLocalRoute(NetCard* src, NetCard* dst, sg_platf_route_cbarg_t route, double* lat)
45 size_t table_size = vertices_.size();
47 getRouteCheckParams(src, dst);
49 /* create a result route */
50 std::vector<sg_platf_route_cbarg_t> route_stack;
51 unsigned int cur = dst->id();
53 int pred = TO_FLOYD_PRED(src->id(), cur);
55 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->name().c_str(), dst->name().c_str());
56 route_stack.push_back(TO_FLOYD_LINK(pred, cur));
58 } while (cur != src->id());
60 if (hierarchy_ == RoutingMode::recursive) {
61 route->gw_src = route_stack.back()->gw_src;
62 route->gw_dst = route_stack.front()->gw_dst;
65 sg_netcard_t prev_dst_gw = nullptr;
66 while (!route_stack.empty()) {
67 sg_platf_route_cbarg_t e_route = route_stack.back();
68 route_stack.pop_back();
69 if (hierarchy_ == RoutingMode::recursive && prev_dst_gw != nullptr &&
70 strcmp(prev_dst_gw->name().c_str(), e_route->gw_src->name().c_str())) {
71 routing_platf->getRouteAndLatency(prev_dst_gw, e_route->gw_src, route->link_list, lat);
74 for (auto link: *e_route->link_list) {
75 route->link_list->push_back(link);
77 *lat += link->latency();
80 prev_dst_gw = e_route->gw_dst;
84 void AsFloyd::addRoute(sg_platf_route_cbarg_t route)
86 /* set the size of table routing */
87 int table_size = static_cast<int>(vertices_.size());
89 addRouteCheckParams(route);
92 /* Create Cost, Predecessor and Link tables */
93 costTable_ = xbt_new0(double, table_size * table_size); /* link cost from host to host */
94 predecessorTable_ = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
95 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
97 /* Initialize costs and predecessors */
98 for (int i = 0; i < table_size; i++)
99 for (int j = 0; j < table_size; j++) {
100 TO_FLOYD_COST(i, j) = DBL_MAX;
101 TO_FLOYD_PRED(i, j) = -1;
102 TO_FLOYD_LINK(i, j) = nullptr;
106 /* Check that the route does not already exist */
107 if (route->gw_dst) // AS route (to adapt the error message, if any)
108 xbt_assert(nullptr == TO_FLOYD_LINK(route->src->id(), route->dst->id()),
109 "The route between %s@%s and %s@%s already exists (Rq: routes are symmetrical by default).",
110 route->src->name().c_str(), route->gw_src->name().c_str(), route->dst->name().c_str(),
111 route->gw_dst->name().c_str());
113 xbt_assert(nullptr == TO_FLOYD_LINK(route->src->id(), route->dst->id()),
114 "The route between %s and %s already exists (Rq: routes are symmetrical by default).",
115 route->src->name().c_str(), route->dst->name().c_str());
117 TO_FLOYD_LINK(route->src->id(), route->dst->id()) = newExtendedRoute(hierarchy_, route, 1);
118 TO_FLOYD_PRED(route->src->id(), route->dst->id()) = route->src->id();
119 TO_FLOYD_COST(route->src->id(), route->dst->id()) = (TO_FLOYD_LINK(route->src->id(), route->dst->id()))->link_list->size();
122 if (route->symmetrical == true) {
123 if (route->gw_dst) // AS route (to adapt the error message, if any)
125 nullptr == TO_FLOYD_LINK(route->dst->id(), route->src->id()),
126 "The route between %s@%s and %s@%s already exists. You should not declare the reverse path as symmetrical.",
127 route->dst->name().c_str(), route->gw_dst->name().c_str(), route->src->name().c_str(),
128 route->gw_src->name().c_str());
130 xbt_assert(nullptr == TO_FLOYD_LINK(route->dst->id(), route->src->id()),
131 "The route between %s and %s already exists. You should not declare the reverse path as symmetrical.",
132 route->dst->name().c_str(), route->src->name().c_str());
134 if(route->gw_dst && route->gw_src) {
135 NetCard* gw_tmp = route->gw_src;
136 route->gw_src = route->gw_dst;
137 route->gw_dst = gw_tmp;
140 if(!route->gw_src && !route->gw_dst)
141 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", route->dst->name().c_str(), route->src->name().c_str());
143 XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", route->dst->name().c_str(), route->gw_src->name().c_str(),
144 route->src->name().c_str(), route->gw_dst->name().c_str());
146 TO_FLOYD_LINK(route->dst->id(), route->src->id()) = newExtendedRoute(hierarchy_, route, 0);
147 TO_FLOYD_PRED(route->dst->id(), route->src->id()) = route->dst->id();
148 TO_FLOYD_COST(route->dst->id(), route->src->id()) = (TO_FLOYD_LINK(route->dst->id(), route->src->id()))->link_list->size(); /* count of links, old model assume 1 */
152 void AsFloyd::seal(){
153 /* set the size of table routing */
154 size_t table_size = vertices_.size();
157 /* Create Cost, Predecessor and Link tables */
158 costTable_ = xbt_new0(double, table_size * table_size); /* link cost from host to host */
159 predecessorTable_ = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
160 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
162 /* Initialize costs and predecessors */
163 for (unsigned int i = 0; i < table_size; i++)
164 for (unsigned int j = 0; j < table_size; j++) {
165 TO_FLOYD_COST(i, j) = DBL_MAX;
166 TO_FLOYD_PRED(i, j) = -1;
167 TO_FLOYD_LINK(i, j) = nullptr;
171 /* Add the loopback if needed */
172 if (surf_network_model->loopback_ && hierarchy_ == RoutingMode::base) {
173 for (unsigned int i = 0; i < table_size; i++) {
174 sg_platf_route_cbarg_t e_route = TO_FLOYD_LINK(i, i);
176 e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
177 e_route->gw_src = nullptr;
178 e_route->gw_dst = nullptr;
179 e_route->link_list = new std::vector<Link*>();
180 e_route->link_list->push_back(surf_network_model->loopback_);
181 TO_FLOYD_LINK(i, i) = e_route;
182 TO_FLOYD_PRED(i, i) = i;
183 TO_FLOYD_COST(i, i) = 1;
187 /* Calculate path costs */
188 for (unsigned int c = 0; c < table_size; c++) {
189 for (unsigned int a = 0; a < table_size; a++) {
190 for (unsigned int b = 0; b < table_size; b++) {
191 if (TO_FLOYD_COST(a, c) < DBL_MAX && TO_FLOYD_COST(c, b) < DBL_MAX) {
192 if (fabs(TO_FLOYD_COST(a, b) - DBL_MAX) < std::numeric_limits<double>::epsilon() ||
193 (TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b) < TO_FLOYD_COST(a, b))) {
194 TO_FLOYD_COST(a, b) = TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b);
195 TO_FLOYD_PRED(a, b) = TO_FLOYD_PRED(c, b);