-/* Copyright (c) 2006-2020. The SimGrid Team. All rights reserved. */
+/* Copyright (c) 2006-2021. 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. */
#include "simgrid/s4u/Engine.hpp"
#include "simgrid/s4u/Host.hpp"
#include "simgrid/s4u/NetZone.hpp"
+#include "simgrid/simix.hpp"
#include "simgrid/zone.h"
namespace simgrid {
return res;
}
+NetZone* NetZone::add_child(const NetZone* new_zone)
+{
+ pimpl_->add_child(new_zone->get_impl());
+ return this;
+}
+
const std::string& NetZone::get_name() const
{
return pimpl_->get_name();
}
+
const char* NetZone::get_cname() const
{
return pimpl_->get_cname();
}
+
NetZone* NetZone::get_father()
{
- return pimpl_->get_father()->get_iface();
+ return pimpl_->get_parent()->get_iface();
+}
+
+NetZone* NetZone::get_parent() const
+{
+ return pimpl_->get_parent()->get_iface();
+}
+
+NetZone* NetZone::set_parent(const NetZone* parent)
+{
+ pimpl_->set_parent(parent->get_impl());
+ return this;
}
/** @brief Returns the list of the hosts found in this NetZone (not recursively)
return pimpl_->get_all_hosts();
}
-int NetZone::get_host_count()
+int NetZone::get_host_count() const
{
return pimpl_->get_host_count();
}
{
pimpl_->add_bypass_route(src, dst, gw_src, gw_dst, link_list, symmetrical);
}
+
+void NetZone::extract_xbt_graph(const s_xbt_graph_t* graph, std::map<std::string, xbt_node_t, std::less<>>* nodes,
+ std::map<std::string, xbt_edge_t, std::less<>>* edges)
+{
+ for (auto const& child : get_children())
+ child->extract_xbt_graph(graph, nodes, edges);
+
+ pimpl_->get_graph(graph, nodes, edges);
+}
} // namespace s4u
} // namespace simgrid
void sg_zone_get_sons(const_sg_netzone_t netzone, xbt_dict_t whereto)
{
for (auto const& elem : netzone->get_children()) {
- xbt_dict_set(whereto, elem->get_cname(), static_cast<void*>(elem));
+ xbt_dict_set(whereto, elem->get_cname(), elem);
}
}