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/FullZone.hpp"
7 #include "src/kernel/routing/NetPoint.hpp"
8 #include "src/surf/network_interface.hpp"
10 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_route_full, surf, "Routing part of surf");
12 #define TO_ROUTE_FULL(i, j) routingTable_[(i) + (j)*table_size]
17 FullZone::FullZone(NetZone* father, const char* name) : RoutedZone(father, name)
23 int table_size = static_cast<int>(vertices_.size());
25 /* Create table if needed */
27 routingTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size);
29 /* Add the loopback if needed */
30 if (surf_network_model->loopback_ && hierarchy_ == RoutingMode::base) {
31 for (int i = 0; i < table_size; i++) {
32 sg_platf_route_cbarg_t e_route = TO_ROUTE_FULL(i, i);
34 e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
35 e_route->gw_src = nullptr;
36 e_route->gw_dst = nullptr;
37 e_route->link_list = new std::vector<surf::LinkImpl*>();
38 e_route->link_list->push_back(surf_network_model->loopback_);
39 TO_ROUTE_FULL(i, i) = e_route;
48 int table_size = static_cast<int>(vertices_.size());
49 /* Delete routing table */
50 for (int i = 0; i < table_size; i++)
51 for (int j = 0; j < table_size; j++) {
52 if (TO_ROUTE_FULL(i, j)) {
53 delete TO_ROUTE_FULL(i, j)->link_list;
54 xbt_free(TO_ROUTE_FULL(i, j));
57 xbt_free(routingTable_);
61 void FullZone::getLocalRoute(NetPoint* src, NetPoint* dst, sg_platf_route_cbarg_t res, double* lat)
63 XBT_DEBUG("full getLocalRoute from %s[%d] to %s[%d]", src->cname(), src->id(), dst->cname(), dst->id());
65 size_t table_size = vertices_.size();
66 sg_platf_route_cbarg_t e_route = TO_ROUTE_FULL(src->id(), dst->id());
68 if (e_route != nullptr) {
69 res->gw_src = e_route->gw_src;
70 res->gw_dst = e_route->gw_dst;
71 for (auto link : *e_route->link_list) {
72 res->link_list->push_back(link);
74 *lat += link->latency();
79 void FullZone::addRoute(sg_platf_route_cbarg_t route)
81 NetPoint* src = route->src;
82 NetPoint* dst = route->dst;
83 addRouteCheckParams(route);
85 size_t table_size = vertices_.size();
88 routingTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size);
90 /* Check that the route does not already exist */
91 if (route->gw_dst) // inter-zone route (to adapt the error message, if any)
92 xbt_assert(nullptr == TO_ROUTE_FULL(src->id(), dst->id()),
93 "The route between %s@%s and %s@%s already exists (Rq: routes are symmetrical by default).",
94 src->cname(), route->gw_src->cname(), dst->cname(), route->gw_dst->cname());
96 xbt_assert(nullptr == TO_ROUTE_FULL(src->id(), dst->id()),
97 "The route between %s and %s already exists (Rq: routes are symmetrical by default).", src->cname(),
100 /* Add the route to the base */
101 TO_ROUTE_FULL(src->id(), dst->id()) = newExtendedRoute(hierarchy_, route, true);
103 if (route->symmetrical == true && src != dst) {
104 if (route->gw_dst && route->gw_src) {
105 NetPoint* gw_tmp = route->gw_src;
106 route->gw_src = route->gw_dst;
107 route->gw_dst = gw_tmp;
109 if (route->gw_dst) // inter-zone route (to adapt the error message, if any)
111 nullptr == TO_ROUTE_FULL(dst->id(), src->id()),
112 "The route between %s@%s and %s@%s already exists. You should not declare the reverse path as symmetrical.",
113 dst->cname(), route->gw_dst->cname(), src->cname(), route->gw_src->cname());
115 xbt_assert(nullptr == TO_ROUTE_FULL(dst->id(), src->id()),
116 "The route between %s and %s already exists. You should not declare the reverse path as symmetrical.",
117 dst->cname(), src->cname());
119 TO_ROUTE_FULL(dst->id(), src->id()) = newExtendedRoute(hierarchy_, route, false);