-/* Copyright (c) 2016-2021. The SimGrid Team. All rights reserved. */
+/* Copyright (c) 2016-2022. 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. */
// our content, as known to our graph routing algorithm (maps vertex_id -> vertex)
std::vector<kernel::routing::NetPoint*> vertices_;
+ std::map<std::string, resource::StandardLinkImpl*, std::less<>> links_;
+ /* save split-duplex links separately, keep links_ with only LinkImpl* seen by the user
+ * members of a split-duplex are saved in the links_ */
+ std::map<std::string, std::unique_ptr<resource::SplitDuplexLinkImpl>, std::less<>> split_duplex_links_;
+ std::map<std::string, resource::HostImpl*, std::less<>> hosts_;
NetZoneImpl* parent_ = nullptr;
std::vector<NetZoneImpl*> children_; // sub-netzones
std::vector<resource::StandardLinkImpl*> get_link_list_impl(const std::vector<s4u::LinkInRoute>& link_list,
bool backroute) const;
+ static xbt_node_t new_xbt_graph_node(const s_xbt_graph_t* graph, const char* name,
+ std::map<std::string, xbt_node_t, std::less<>>* nodes);
+ static xbt_edge_t new_xbt_graph_edge(const s_xbt_graph_t* graph, xbt_node_t src, xbt_node_t dst,
+ std::map<std::string, xbt_edge_t, std::less<>>* edges);
+
public:
enum class RoutingMode {
base, /**< Base case: use simple link lists for routing */
s4u::NetZone* get_iface() { return &piface_; }
unsigned int get_table_size() const { return vertices_.size(); }
std::vector<kernel::routing::NetPoint*> get_vertices() const { return vertices_; }
- XBT_ATTRIB_DEPRECATED_v331("Please use get_parent()") NetZoneImpl* get_father() const { return parent_; }
NetZoneImpl* get_parent() const { return parent_; }
/** @brief Returns the list of direct children (no grand-children). This returns the internal data, no copy.
* Don't mess with it.*/
kernel::routing::NetPoint* get_netpoint() const { return netpoint_; }
std::vector<s4u::Host*> get_all_hosts() const;
- int get_host_count() const;
+ size_t get_host_count() const;
+
+ /**
+ * @brief Recursively gets all links declared in this netzone
+ *
+ * Include children netzones.
+ * @return List of links
+ */
+ std::vector<s4u::Link*> get_all_links() const;
+ /**
+ * @brief Recursively gets all links declared in this netzone.
+ *
+ * Using a filter function
+ * Include children netzones.
+ * @param filter Select links based on this filter
+ * @return List of links
+ */
+ std::vector<s4u::Link*> get_filtered_links(const std::function<bool(s4u::Link*)>& filter) const;
+ /** @brief Get total number of links declared in this netzone (and its children) */
+ size_t get_link_count() const;
+
+ /**
+ * @brief Searches by the link by its name inside this netzone.
+ * Recursively searches in children netzones
+ *
+ * @param name Link name
+ * @return Link object or nullptr if not found
+ */
+ resource::StandardLinkImpl* get_link_by_name_or_null(const std::string& name) const;
+
+ /**
+ * @brief Searches for split-duplex links by its name inside this netzone.
+ * Recursively searches in child netzones
+ *
+ * @param name Split-duplex Link name
+ * @return Link object or nullptr if not found
+ */
+ resource::SplitDuplexLinkImpl* get_split_duplex_link_by_name_or_null(const std::string& name) const;
+
+ /**
+ * @brief Searches for a host by its name (recursively)
+ * Including children netzones and VMs on physival hosts
+ *
+ * @param name Host (or VM) name
+ * @return HostImpl pointer
+ */
+ resource::HostImpl* get_host_by_name_or_null(const std::string& name) const;
+
+ /**
+ * @brief Gets list of hosts on this netzone recursively.
+ *
+ * Note: This includes hosts on children netzones and VMs on physical hosts.
+ *
+ * @param filter Filter function to select specific nodes
+ * @return List of hosts
+ */
+ std::vector<s4u::Host*> get_filtered_hosts(const std::function<bool(s4u::Host*)>& filter) const;
/** @brief Make a host within that NetZone */
s4u::Host* create_host(const std::string& name, const std::vector<double>& speed_per_pstate);
/** @brief Create a disk with the disk model from this NetZone */
s4u::Disk* create_disk(const std::string& name, double read_bandwidth, double write_bandwidth);
/** @brief Make a link within that NetZone */
- virtual s4u::Link* create_link(const std::string& name, const std::vector<double>& bandwidths);
+ s4u::Link* create_link(const std::string& name, const std::vector<double>& bandwidths);
s4u::SplitDuplexLink* create_split_duplex_link(const std::string& name, const std::vector<double>& bandwidths);
/** @brief Make a router within that NetZone */
NetPoint* create_router(const std::string& name);
std::unordered_set<NetZoneImpl*>& netzones);
virtual void get_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) = 0;
+ std::map<std::string, xbt_edge_t, std::less<>>* edges);
/*** Called on each newly created regular route (not on bypass routes) */
static xbt::signal<void(bool symmetrical, NetPoint* src, NetPoint* dst, NetPoint* gw_src, NetPoint* gw_dst,
virtual void do_seal()
{ /* obviously nothing to do by default */
}
+ /** @brief Allows subclasses (wi-fi) to have their own create link method, but keep links_ updated */
+ virtual resource::StandardLinkImpl* do_create_link(const std::string& name, const std::vector<double>& bandwidths);
void add_child(NetZoneImpl* new_zone);
};
} // namespace routing
