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. */
6 #include "src/kernel/routing/FloydZone.hpp"
7 #include "src/kernel/routing/NetPoint.hpp"
8 #include "src/surf/network_interface.hpp"
14 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_floyd, surf, "Routing part of surf");
16 #define TO_FLOYD_COST(i, j) (costTable_)[(i) + (j)*table_size]
17 #define TO_FLOYD_PRED(i, j) (predecessorTable_)[(i) + (j)*table_size]
18 #define TO_FLOYD_LINK(i, j) (linkTable_)[(i) + (j)*table_size]
24 FloydZone::FloydZone(NetZone* father, const char* name) : RoutedZone(father, name)
26 predecessorTable_ = nullptr;
31 FloydZone::~FloydZone()
33 if (linkTable_ == nullptr) // Dealing with a parse error in the file?
35 int table_size = vertices_.size();
36 /* Delete link_table */
37 for (int i = 0; i < table_size; i++)
38 for (int j = 0; j < table_size; j++)
39 routing_route_free(TO_FLOYD_LINK(i, j));
42 xbt_free(predecessorTable_);
46 void FloydZone::getLocalRoute(NetPoint* src, NetPoint* dst, sg_platf_route_cbarg_t route, double* lat)
48 size_t table_size = vertices_.size();
50 getRouteCheckParams(src, dst);
52 /* create a result route */
53 std::vector<sg_platf_route_cbarg_t> route_stack;
54 unsigned int cur = dst->id();
56 int pred = TO_FLOYD_PRED(src->id(), cur);
58 THROWF(arg_error, 0, "No route from '%s' to '%s'", src->name().c_str(), dst->name().c_str());
59 route_stack.push_back(TO_FLOYD_LINK(pred, cur));
61 } while (cur != src->id());
63 if (hierarchy_ == RoutingMode::recursive) {
64 route->gw_src = route_stack.back()->gw_src;
65 route->gw_dst = route_stack.front()->gw_dst;
68 sg_netpoint_t prev_dst_gw = nullptr;
69 while (!route_stack.empty()) {
70 sg_platf_route_cbarg_t e_route = route_stack.back();
71 route_stack.pop_back();
72 if (hierarchy_ == RoutingMode::recursive && prev_dst_gw != nullptr &&
73 strcmp(prev_dst_gw->name().c_str(), e_route->gw_src->name().c_str())) {
74 getGlobalRoute(prev_dst_gw, e_route->gw_src, route->link_list, lat);
77 for (auto link : *e_route->link_list) {
78 route->link_list->push_back(link);
80 *lat += link->latency();
83 prev_dst_gw = e_route->gw_dst;
87 void FloydZone::addRoute(sg_platf_route_cbarg_t route)
89 /* set the size of table routing */
90 int table_size = static_cast<int>(vertices_.size());
92 addRouteCheckParams(route);
95 /* Create Cost, Predecessor and Link tables */
96 costTable_ = xbt_new0(double, table_size* table_size); /* link cost from host to host */
97 predecessorTable_ = xbt_new0(int, table_size* table_size); /* predecessor host numbers */
98 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
100 /* Initialize costs and predecessors */
101 for (int i = 0; i < table_size; i++)
102 for (int j = 0; j < table_size; j++) {
103 TO_FLOYD_COST(i, j) = DBL_MAX;
104 TO_FLOYD_PRED(i, j) = -1;
105 TO_FLOYD_LINK(i, j) = nullptr;
109 /* Check that the route does not already exist */
110 if (route->gw_dst) // netzone route (to adapt the error message, if any)
111 xbt_assert(nullptr == TO_FLOYD_LINK(route->src->id(), route->dst->id()),
112 "The route between %s@%s and %s@%s already exists (Rq: routes are symmetrical by default).",
113 route->src->name().c_str(), route->gw_src->name().c_str(), route->dst->name().c_str(),
114 route->gw_dst->name().c_str());
116 xbt_assert(nullptr == TO_FLOYD_LINK(route->src->id(), route->dst->id()),
117 "The route between %s and %s already exists (Rq: routes are symmetrical by default).",
118 route->src->name().c_str(), route->dst->name().c_str());
120 TO_FLOYD_LINK(route->src->id(), route->dst->id()) = newExtendedRoute(hierarchy_, route, 1);
121 TO_FLOYD_PRED(route->src->id(), route->dst->id()) = route->src->id();
122 TO_FLOYD_COST(route->src->id(), route->dst->id()) =
123 (TO_FLOYD_LINK(route->src->id(), route->dst->id()))->link_list->size();
125 if (route->symmetrical == true) {
126 if (route->gw_dst) // netzone route (to adapt the error message, if any)
128 nullptr == TO_FLOYD_LINK(route->dst->id(), route->src->id()),
129 "The route between %s@%s and %s@%s already exists. You should not declare the reverse path as symmetrical.",
130 route->dst->name().c_str(), route->gw_dst->name().c_str(), route->src->name().c_str(),
131 route->gw_src->name().c_str());
133 xbt_assert(nullptr == TO_FLOYD_LINK(route->dst->id(), route->src->id()),
134 "The route between %s and %s already exists. You should not declare the reverse path as symmetrical.",
135 route->dst->name().c_str(), route->src->name().c_str());
137 if (route->gw_dst && route->gw_src) {
138 NetPoint* gw_tmp = route->gw_src;
139 route->gw_src = route->gw_dst;
140 route->gw_dst = gw_tmp;
143 if (!route->gw_src && !route->gw_dst)
144 XBT_DEBUG("Load Route from \"%s\" to \"%s\"", route->dst->name().c_str(), route->src->name().c_str());
146 XBT_DEBUG("Load NetzoneRoute from \"%s(%s)\" to \"%s(%s)\"", route->dst->name().c_str(), route->gw_src->name().c_str(),
147 route->src->name().c_str(), route->gw_dst->name().c_str());
149 TO_FLOYD_LINK(route->dst->id(), route->src->id()) = newExtendedRoute(hierarchy_, route, 0);
150 TO_FLOYD_PRED(route->dst->id(), route->src->id()) = route->dst->id();
151 TO_FLOYD_COST(route->dst->id(), route->src->id()) =
152 (TO_FLOYD_LINK(route->dst->id(), route->src->id()))->link_list->size(); /* count of links, old model assume 1 */
156 void FloydZone::seal()
158 /* set the size of table routing */
159 size_t table_size = vertices_.size();
162 /* Create Cost, Predecessor and Link tables */
163 costTable_ = xbt_new0(double, table_size* table_size); /* link cost from host to host */
164 predecessorTable_ = xbt_new0(int, table_size* table_size); /* predecessor host numbers */
165 linkTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size); /* actual link between src and dst */
167 /* Initialize costs and predecessors */
168 for (unsigned int i = 0; i < table_size; i++)
169 for (unsigned int j = 0; j < table_size; j++) {
170 TO_FLOYD_COST(i, j) = DBL_MAX;
171 TO_FLOYD_PRED(i, j) = -1;
172 TO_FLOYD_LINK(i, j) = nullptr;
176 /* Add the loopback if needed */
177 if (surf_network_model->loopback_ && hierarchy_ == RoutingMode::base) {
178 for (unsigned int i = 0; i < table_size; i++) {
179 sg_platf_route_cbarg_t e_route = TO_FLOYD_LINK(i, i);
181 e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
182 e_route->gw_src = nullptr;
183 e_route->gw_dst = nullptr;
184 e_route->link_list = new std::vector<surf::LinkImpl*>();
185 e_route->link_list->push_back(surf_network_model->loopback_);
186 TO_FLOYD_LINK(i, i) = e_route;
187 TO_FLOYD_PRED(i, i) = i;
188 TO_FLOYD_COST(i, i) = 1;
192 /* Calculate path costs */
193 for (unsigned int c = 0; c < table_size; c++) {
194 for (unsigned int a = 0; a < table_size; a++) {
195 for (unsigned int b = 0; b < table_size; b++) {
196 if (TO_FLOYD_COST(a, c) < DBL_MAX && TO_FLOYD_COST(c, b) < DBL_MAX) {
197 if (fabs(TO_FLOYD_COST(a, b) - DBL_MAX) < std::numeric_limits<double>::epsilon() ||
198 (TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b) < TO_FLOYD_COST(a, b))) {
199 TO_FLOYD_COST(a, b) = TO_FLOYD_COST(a, c) + TO_FLOYD_COST(c, b);
200 TO_FLOYD_PRED(a, b) = TO_FLOYD_PRED(c, b);