1 /* Copyright (c) 2009-2015. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
7 #include "src/surf/surf_routing_full.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]
16 AsFull::AsFull(const char*name)
23 sg_platf_route_cbarg_t e_route;
26 int table_size = (int)xbt_dynar_length(vertices_);
28 /* Create table if necessary */
30 routingTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size);
32 /* Add the loopback if needed */
33 if (routing_platf->loopback_ && hierarchy_ == s4u::As::ROUTING_BASE) {
34 for (i = 0; i < table_size; i++) {
35 e_route = TO_ROUTE_FULL(i, i);
37 e_route = xbt_new0(s_sg_platf_route_cbarg_t, 1);
38 e_route->gw_src = NULL;
39 e_route->gw_dst = NULL;
40 e_route->link_list = new std::vector<Link*>();
41 e_route->link_list->push_back(routing_platf->loopback_);
42 TO_ROUTE_FULL(i, i) = e_route;
50 int table_size = (int)xbt_dynar_length(vertices_);
52 /* Delete routing table */
53 for (i = 0; i < table_size; i++)
54 for (j = 0; j < table_size; j++) {
55 if (TO_ROUTE_FULL(i,j)){
56 delete TO_ROUTE_FULL(i,j)->link_list;
57 xbt_free(TO_ROUTE_FULL(i,j));
60 xbt_free(routingTable_);
64 void AsFull::getRouteAndLatency(NetCard *src, NetCard *dst, sg_platf_route_cbarg_t res, double *lat)
66 XBT_DEBUG("full_get_route_and_latency from %s[%d] to %s[%d]",
67 src->name(), src->id(), dst->name(), dst->id());
70 size_t table_size = xbt_dynar_length(vertices_);
72 sg_platf_route_cbarg_t e_route = NULL;
74 e_route = TO_ROUTE_FULL(src->id(), dst->id());
77 res->gw_src = e_route->gw_src;
78 res->gw_dst = e_route->gw_dst;
79 for (auto link : *e_route->link_list) {
80 res->link_list->push_back(link);
82 *lat += static_cast<Link*>(link)->getLatency();
87 void AsFull::addRoute(sg_platf_route_cbarg_t route)
89 const char *src = route->src;
90 const char *dst = route->dst;
91 NetCard *src_net_elm = sg_netcard_by_name_or_null(src);
92 NetCard *dst_net_elm = sg_netcard_by_name_or_null(dst);
94 addRouteCheckParams(route);
96 size_t table_size = xbt_dynar_length(vertices_);
99 routingTable_ = xbt_new0(sg_platf_route_cbarg_t, table_size * table_size);
101 /* Check that the route does not already exist */
102 if (route->gw_dst) // AS route (to adapt the error message, if any)
103 xbt_assert(nullptr == TO_ROUTE_FULL(src_net_elm->id(), dst_net_elm->id()),
104 "The route between %s@%s and %s@%s already exists (Rq: routes are symmetrical by default).",
105 src,route->gw_src->name(),dst,route->gw_dst->name());
107 xbt_assert(nullptr == TO_ROUTE_FULL(src_net_elm->id(), dst_net_elm->id()),
108 "The route between %s and %s already exists (Rq: routes are symmetrical by default).", src,dst);
110 /* Add the route to the base */
111 TO_ROUTE_FULL(src_net_elm->id(), dst_net_elm->id()) = newExtendedRoute(hierarchy_, route, 1);
112 TO_ROUTE_FULL(src_net_elm->id(), dst_net_elm->id())->link_list->shrink_to_fit();
114 if (route->symmetrical == TRUE && src_net_elm != dst_net_elm) {
115 if (route->gw_dst && route->gw_src) {
116 NetCard* gw_tmp = route->gw_src;
117 route->gw_src = route->gw_dst;
118 route->gw_dst = gw_tmp;
120 if (route->gw_dst) // AS route (to adapt the error message, if any)
121 xbt_assert(nullptr == TO_ROUTE_FULL(dst_net_elm->id(), src_net_elm->id()),
122 "The route between %s@%s and %s@%s already exists. You should not declare the reverse path as symmetrical.",
123 dst,route->gw_dst->name(),src,route->gw_src->name());
125 xbt_assert(nullptr == TO_ROUTE_FULL(dst_net_elm->id(), src_net_elm->id()),
126 "The route between %s and %s already exists. You should not declare the reverse path as symmetrical.", dst,src);
128 TO_ROUTE_FULL(dst_net_elm->id(), src_net_elm->id()) = newExtendedRoute(hierarchy_, route, 0);
129 TO_ROUTE_FULL(dst_net_elm->id(), src_net_elm->id())->link_list->shrink_to_fit();