1 /* Copyright (c) 2010-2019. 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 "simgrid/jedule/jedule.hpp"
7 #include "simgrid/host.h"
8 #include "simgrid/s4u/NetZone.hpp"
9 #include "xbt/asserts.h"
12 #if SIMGRID_HAVE_JEDULE
15 std::unordered_map<const char*, jed_container_t> host2_simgrid_parent_container;
16 std::unordered_map<std::string, jed_container_t> container_name2container;
21 Subset::Subset(int start_idx, int end_idx, Container* parent)
22 : start_idx(start_idx), parent(parent)
24 nres=end_idx-start_idx+1;
27 Container::Container(const std::string& name) : name(name)
29 container_name2container.insert({this->name, this});
32 void Container::add_child(jed_container_t child)
34 xbt_assert(child != nullptr);
35 this->children.emplace_back(child);
39 void Container::add_resources(std::vector<sg_host_t> hosts)
42 this->children.clear();
45 for (auto const& host : hosts) {
46 const char *host_name = sg_host_get_name(host);
47 this->name2id.insert({host_name, this->last_id_});
49 host2_simgrid_parent_container.insert({host_name, this});
50 this->resource_list.push_back(host);
54 void Container::create_hierarchy(sg_netzone_t from_as)
57 if (from_as->get_children().empty()) {
59 // add hosts to jedule platform
60 std::vector<sg_host_t> table = from_as->get_all_hosts();
61 this->add_resources(table);
63 for (auto const& nz : from_as->get_children()) {
64 jed_container_t child_container = new simgrid::jedule::Container(nz->get_name());
65 this->add_child(child_container);
66 child_container->create_hierarchy(nz);
71 std::vector<int> Container::get_hierarchy()
73 if(this->parent != nullptr ) {
75 if (not this->parent->children.empty()) {
76 // we are in the last level
77 return this->parent->get_hierarchy();
82 for (auto const& child : this->parent->children) {
83 if (child.get() == this) {
90 xbt_assert( child_nb > - 1);
91 std::vector<int> heir_list = this->parent->get_hierarchy();
92 heir_list.insert(heir_list.begin(), child_nb);
97 std::vector<int> heir_list = {top_level};
102 std::string Container::get_hierarchy_as_string()
104 std::string output("");
106 std::vector<int> heir_list = this->get_hierarchy();
108 unsigned int length = heir_list.size();
110 for (auto const& id : heir_list) {
111 output += std::to_string(id);
112 if( i != length-1 ) {
120 void Container::print_resources(FILE* jed_file)
123 xbt_assert(not this->resource_list.empty());
125 unsigned int res_nb = this->resource_list.size();
126 std::string resid = this->get_hierarchy_as_string();
128 fprintf(jed_file, " <rset id=\"%s\" nb=\"%u\" names=\"", resid.c_str(), res_nb);
129 for (auto const& res : this->resource_list) {
130 const char * res_name = sg_host_get_name(res);
131 fprintf(jed_file, "%s", res_name);
132 if( i != res_nb-1 ) {
133 fprintf(jed_file, "|");
137 fprintf(jed_file, "\" />\n");
140 void Container::print(FILE* jed_file)
142 fprintf(jed_file, " <res name=\"%s\">\n", this->name.c_str());
143 if (not this->children.empty()) {
144 for (auto const& child : this->children) {
145 child->print(jed_file);
148 this->print_resources(jed_file);
150 fprintf(jed_file, " </res>\n");
156 static void add_subsets_to(std::vector<simgrid::jedule::Subset>& subset_list, std::vector<const char*> hostgroup,
157 jed_container_t parent)
159 // get ids for each host
162 // create subset for each id group
164 xbt_assert( parent != nullptr );
166 std::vector<unsigned int> id_list;
168 for (auto const& host_name : hostgroup) {
169 xbt_assert( host_name != nullptr );
170 jed_container_t parent_cont = host2_simgrid_parent_container.at(host_name);
171 unsigned int id = parent_cont->name2id.at(host_name);
172 id_list.push_back(id);
174 unsigned int nb_ids = id_list.size();
175 std::sort(id_list.begin(), id_list.end());
180 for(unsigned int i=0; i<nb_ids; i++) {
181 if( id_list[i] - id_list[pos] > 1 ) {
182 subset_list.emplace_back(id_list[start], id_list[pos], parent);
185 if( i == nb_ids-1 ) {
186 subset_list.emplace_back(id_list[i], id_list[i], parent);
189 if( i == nb_ids-1 ) {
190 subset_list.emplace_back(id_list[start], id_list[i], parent);
199 void get_resource_selection_by_hosts(std::vector<simgrid::jedule::Subset>& subset_list,
200 const std::vector<sg_host_t>& host_list)
202 // for each host name
203 // find parent container
204 // group by parent container
205 std::unordered_map<const char*, std::vector<const char*>> parent2hostgroup;
206 for (auto const& host : host_list) {
207 const char *host_name = sg_host_get_name(host);
208 jed_container_t parent = host2_simgrid_parent_container.at(host_name);
209 xbt_assert( parent != nullptr );
211 auto host_group = parent2hostgroup.find(parent->name.c_str());
212 if (host_group == parent2hostgroup.end())
213 parent2hostgroup.insert({parent->name.c_str(), std::vector<const char*>(1,host_name)});
215 host_group->second.push_back(host_name);
218 for (auto const& elm : parent2hostgroup) {
219 jed_container_t parent = container_name2container.at(elm.first);
220 add_subsets_to(subset_list, elm.second, parent);