X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/7dd253f0ff4dda733dd0f7c924a25df4b777f0d0..3a1ea70a418f393ca1677074e928c664022295bd:/src/kernel/routing/RoutedZone.cpp diff --git a/src/kernel/routing/RoutedZone.cpp b/src/kernel/routing/RoutedZone.cpp index 135b6246d3..0b7f207b88 100644 --- a/src/kernel/routing/RoutedZone.cpp +++ b/src/kernel/routing/RoutedZone.cpp @@ -1,4 +1,4 @@ -/* Copyright (c) 2009-2019. The SimGrid Team. All rights reserved. */ +/* Copyright (c) 2009-2020. The SimGrid Team. All rights reserved. */ /* This program is free software; you can redistribute it and/or modify it * under the terms of the license (GNU LGPL) which comes with this package. */ @@ -17,13 +17,7 @@ XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_routing_generic, surf_route, "Generic imple /* ***************************************************************** */ /* *********************** GENERIC METHODS ************************* */ -static const char* instr_node_name(xbt_node_t node) -{ - const void* data = xbt_graph_node_get_data(node); - return static_cast(data); -} - -xbt_node_t new_xbt_graph_node(xbt_graph_t graph, const char* name, std::map* nodes) +xbt_node_t new_xbt_graph_node(const s_xbt_graph_t* graph, const char* name, std::map* nodes) { auto elm = nodes->find(name); if (elm == nodes->end()) { @@ -34,10 +28,11 @@ xbt_node_t new_xbt_graph_node(xbt_graph_t graph, const char* name, std::mapsecond; } -xbt_edge_t new_xbt_graph_edge(xbt_graph_t graph, xbt_node_t s, xbt_node_t d, std::map* edges) +xbt_edge_t new_xbt_graph_edge(const s_xbt_graph_t* graph, xbt_node_t s, xbt_node_t d, + std::map* edges) { - const char* sn = instr_node_name(s); - const char* dn = instr_node_name(d); + const auto* sn = static_cast(xbt_graph_node_get_data(s)); + const auto* dn = static_cast(xbt_graph_node_get_data(d)); std::string name = std::string(sn) + dn; auto elm = edges->find(name); @@ -63,7 +58,7 @@ RoutedZone::RoutedZone(NetZoneImpl* father, const std::string& name, resource::N { } -void RoutedZone::get_graph(xbt_graph_t graph, std::map* nodes, +void RoutedZone::get_graph(const s_xbt_graph_t* graph, std::map* nodes, std::map* edges) { std::vector vertices = get_vertices(); @@ -73,7 +68,7 @@ void RoutedZone::get_graph(xbt_graph_t graph, std::map* if (my_src == my_dst) continue; - RouteCreationArgs* route = new RouteCreationArgs(); + auto* route = new RouteCreationArgs(); get_local_route(my_src, my_dst, route, nullptr); @@ -125,7 +120,7 @@ RouteCreationArgs* RoutedZone::new_extended_route(RoutingMode hierarchy, NetPoin std::vector& link_list, bool /* symmetrical */, bool change_order) { - RouteCreationArgs* result = new RouteCreationArgs(); + auto* result = new RouteCreationArgs(); xbt_assert(hierarchy == RoutingMode::base || hierarchy == RoutingMode::recursive, "The hierarchy of this netzone is neither BASIC nor RECURSIVE, I'm lost here."); @@ -148,7 +143,7 @@ RouteCreationArgs* RoutedZone::new_extended_route(RoutingMode hierarchy, NetPoin return result; } -void RoutedZone::get_route_check_params(NetPoint* src, NetPoint* dst) +void RoutedZone::get_route_check_params(NetPoint* src, NetPoint* dst) const { xbt_assert(src, "Cannot find a route from nullptr to %s", dst->get_cname()); xbt_assert(dst, "Cannot find a route from %s to nullptr", src->get_cname()); @@ -166,7 +161,7 @@ void RoutedZone::get_route_check_params(NetPoint* src, NetPoint* dst) src->get_cname(), dst->get_cname(), src_as->get_cname(), dst_as->get_cname(), get_cname()); } void RoutedZone::add_route_check_params(NetPoint* src, NetPoint* dst, NetPoint* gw_src, NetPoint* gw_dst, - std::vector& link_list, bool symmetrical) + const std::vector& link_list, bool symmetrical) const { const char* srcName = src->get_cname(); const char* dstName = dst->get_cname();