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::getRouteAndLatency(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;
52 unsigned int cur = dst->id();
54 pred = TO_FLOYD_PRED(src->id(), cur);
56 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->name().c_str(), dst->name().c_str());
57 route_stack.push_back(TO_FLOYD_LINK(pred, cur));
59 } while (cur != src->id());
61 if (hierarchy_ == RoutingMode::recursive) {
62 route->gw_src = route_stack.back()->gw_src;
63 route->gw_dst = route_stack.front()->gw_dst;
66 sg_netcard_t prev_dst_gw = nullptr;
67 while (!route_stack.empty()) {
68 sg_platf_route_cbarg_t e_route = route_stack.back();
69 route_stack.pop_back();
70 if (hierarchy_ == RoutingMode::recursive && prev_dst_gw != nullptr &&
71 strcmp(prev_dst_gw->name().c_str(), e_route->gw_src->name().c_str())) {
72 routing_platf->getRouteAndLatency(prev_dst_gw, e_route->gw_src, route->link_list, lat);
75 for (auto link: *e_route->link_list) {
76 route->link_list->push_back(link);
78 *lat += link->latency();
81 prev_dst_gw = e_route->gw_dst;
85 void AsFloyd::addRoute(sg_platf_route_cbarg_t route)
87 /* set the size of table routing */
88 int table_size = static_cast<int>(vertices_.size());
90 addRouteCheckParams(route);
93 /* Create Cost, Predecessor and Link tables */
94 costTable_ = xbt_new0(double, table_size * table_size); /* link cost from host to host */
95 predecessorTable_ = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
96 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
98 /* Initialize costs and predecessors */
99 for (int i = 0; i < table_size; i++)
100 for (int j = 0; j < table_size; j++) {
101 TO_FLOYD_COST(i, j) = DBL_MAX;
102 TO_FLOYD_PRED(i, j) = -1;
103 TO_FLOYD_LINK(i, j) = nullptr;
107 /* Check that the route does not already exist */
108 if (route->gw_dst) // AS route (to adapt the error message, if any)
109 xbt_assert(nullptr == TO_FLOYD_LINK(route->src->id(), route->dst->id()),
110 "The route between %s@%s and %s@%s already exists (Rq: routes are symmetrical by default).",
111 route->src->name().c_str(), route->gw_src->name().c_str(), route->dst->name().c_str(),
112 route->gw_dst->name().c_str());
114 xbt_assert(nullptr == TO_FLOYD_LINK(route->src->id(), route->dst->id()),
115 "The route between %s and %s already exists (Rq: routes are symmetrical by default).",
116 route->src->name().c_str(), route->dst->name().c_str());
118 TO_FLOYD_LINK(route->src->id(), route->dst->id()) = newExtendedRoute(hierarchy_, route, 1);
119 TO_FLOYD_PRED(route->src->id(), route->dst->id()) = route->src->id();
120 TO_FLOYD_COST(route->src->id(), route->dst->id()) = (TO_FLOYD_LINK(route->src->id(), route->dst->id()))->link_list->size();
123 if (route->symmetrical == true) {
124 if (route->gw_dst) // AS route (to adapt the error message, if any)
126 nullptr == TO_FLOYD_LINK(route->dst->id(), route->src->id()),
127 "The route between %s@%s and %s@%s already exists. You should not declare the reverse path as symmetrical.",
128 route->dst->name().c_str(), route->gw_dst->name().c_str(), route->src->name().c_str(),
129 route->gw_src->name().c_str());
131 xbt_assert(nullptr == TO_FLOYD_LINK(route->dst->id(), route->src->id()),
132 "The route between %s and %s already exists. You should not declare the reverse path as symmetrical.",
133 route->dst->name().c_str(), route->src->name().c_str());
135 if(route->gw_dst && route->gw_src) {
136 NetCard* gw_tmp = route->gw_src;
137 route->gw_src = route->gw_dst;
138 route->gw_dst = gw_tmp;
141 if(!route->gw_src && !route->gw_dst)
142 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", route->dst->name().c_str(), route->src->name().c_str());
144 XBT_DEBUG("Load ASroute from \"%s(%s)\" to \"%s(%s)\"", route->dst->name().c_str(), route->gw_src->name().c_str(),
145 route->src->name().c_str(), route->gw_dst->name().c_str());
147 TO_FLOYD_LINK(route->dst->id(), route->src->id()) = newExtendedRoute(hierarchy_, route, 0);
148 TO_FLOYD_PRED(route->dst->id(), route->src->id()) = route->dst->id();
149 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 */
153 void AsFloyd::seal(){
154 /* set the size of table routing */
155 size_t table_size = vertices_.size();
158 /* Create Cost, Predecessor and Link tables */
159 costTable_ = xbt_new0(double, table_size * table_size); /* link cost from host to host */
160 predecessorTable_ = xbt_new0(int, table_size * table_size); /* predecessor host numbers */
161 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
163 /* Initialize costs and predecessors */
164 for (unsigned int i = 0; i < table_size; i++)
165 for (unsigned int j = 0; j < table_size; j++) {
166 TO_FLOYD_COST(i, j) = DBL_MAX;
167 TO_FLOYD_PRED(i, j) = -1;
168 TO_FLOYD_LINK(i, j) = nullptr;
172 /* Add the loopback if needed */
173 if (routing_platf->loopback_ && hierarchy_ == RoutingMode::base) {
174 for (unsigned int i = 0; i < table_size; i++) {
175 sg_platf_route_cbarg_t e_route = TO_FLOYD_LINK(i, i);
177 e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
178 e_route->gw_src = nullptr;
179 e_route->gw_dst = nullptr;
180 e_route->link_list = new std::vector<Link*>();
181 e_route->link_list->push_back(routing_platf->loopback_);
182 TO_FLOYD_LINK(i, i) = e_route;
183 TO_FLOYD_PRED(i, i) = i;
184 TO_FLOYD_COST(i, i) = 1;
188 /* Calculate path costs */
189 for (unsigned int c = 0; c < table_size; c++) {
190 for (unsigned int a = 0; a < table_size; a++) {
191 for (unsigned int b = 0; b < table_size; b++) {
192 if (TO_FLOYD_COST(a, c) < DBL_MAX && TO_FLOYD_COST(c, b) < DBL_MAX) {
193 if (fabs(TO_FLOYD_COST(a, b) - DBL_MAX) < std::numeric_limits<double>::epsilon() ||
194 (TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b) < TO_FLOYD_COST(a, b))) {
195 TO_FLOYD_COST(a, b) = TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b);
196 TO_FLOYD_PRED(a, b) = TO_FLOYD_PRED(c, b);