1 /* Copyright (c) 2010-2018. 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;
28 Container::Container(std::string name): name(name)
30 container_name2container.insert({this->name, this});
33 Container::~Container()
35 if (not this->children.empty())
36 for (auto const& child : this->children)
40 void Container::add_child(jed_container_t child)
42 xbt_assert(child != nullptr);
43 this->children.push_back(child);
47 void Container::add_resources(std::vector<sg_host_t> hosts)
50 this->children.clear();
53 //FIXME do we need to sort?: xbt_dynar_sort_strings(host_names);
55 for (auto const& host : hosts) {
56 const char *host_name = sg_host_get_name(host);
57 this->name2id.insert({host_name, this->last_id_});
59 host2_simgrid_parent_container.insert({host_name, this});
60 this->resource_list.push_back(host);
64 void Container::create_hierarchy(sg_netzone_t from_as)
67 if (from_as->get_children()->empty()) {
69 // add hosts to jedule platform
70 std::vector<sg_host_t> table = from_as->get_all_hosts();
71 this->add_resources(table);
73 for (auto const& nz : *from_as->get_children()) {
74 jed_container_t child_container = new simgrid::jedule::Container(std::string(nz->get_cname()));
75 this->add_child(child_container);
76 child_container->create_hierarchy(nz);
81 std::vector<int> Container::get_hierarchy()
83 if(this->parent != nullptr ) {
85 if (not this->parent->children.empty()) {
86 // we are in the last level
87 return this->parent->get_hierarchy();
92 for (auto const& child : this->parent->children) {
100 xbt_assert( child_nb > - 1);
101 std::vector<int> heir_list = this->parent->get_hierarchy();
102 heir_list.insert(heir_list.begin(), child_nb);
107 std::vector<int> heir_list = {top_level};
112 std::string Container::get_hierarchy_as_string()
114 std::string output("");
116 std::vector<int> heir_list = this->get_hierarchy();
118 unsigned int length = heir_list.size();
120 for (auto const& id : heir_list) {
121 output += std::to_string(id);
122 if( i != length-1 ) {
130 void Container::print_resources(FILE* jed_file)
133 xbt_assert(not this->resource_list.empty());
135 unsigned int res_nb = this->resource_list.size();
136 std::string resid = this->get_hierarchy_as_string();
138 fprintf(jed_file, " <rset id=\"%s\" nb=\"%u\" names=\"", resid.c_str(), res_nb);
139 for (auto const& res : this->resource_list) {
140 const char * res_name = sg_host_get_name(res);
141 fprintf(jed_file, "%s", res_name);
142 if( i != res_nb-1 ) {
143 fprintf(jed_file, "|");
147 fprintf(jed_file, "\" />\n");
150 void Container::print(FILE* jed_file)
152 fprintf(jed_file, " <res name=\"%s\">\n", this->name.c_str());
153 if (not this->children.empty()) {
154 for (auto const& child : this->children) {
155 child->print(jed_file);
158 this->print_resources(jed_file);
160 fprintf(jed_file, " </res>\n");
166 static void add_subsets_to(std::vector<jed_subset_t> *subset_list, std::vector<const char*> hostgroup, jed_container_t parent)
168 // get ids for each host
171 // create subset for each id group
173 xbt_assert( parent != nullptr );
175 std::vector<unsigned int> id_list;
177 for (auto const& host_name : hostgroup) {
178 xbt_assert( host_name != nullptr );
179 jed_container_t parent = host2_simgrid_parent_container.at(host_name);
180 unsigned int id = parent->name2id.at(host_name);
181 id_list.push_back(id);
183 unsigned int nb_ids = id_list.size();
184 std::sort(id_list.begin(), id_list.end());
189 for(unsigned int i=0; i<nb_ids; i++) {
190 if( id_list[i] - id_list[pos] > 1 ) {
191 subset_list->push_back(new simgrid::jedule::Subset(id_list[start], id_list[pos], parent));
194 if( i == nb_ids-1 ) {
195 subset_list->push_back(new simgrid::jedule::Subset(id_list[i], id_list[i], parent));
198 if( i == nb_ids-1 ) {
199 subset_list->push_back(new simgrid::jedule::Subset(id_list[start], id_list[i], parent));
208 void get_resource_selection_by_hosts(std::vector<jed_subset_t> *subset_list, std::vector<sg_host_t> *host_list)
210 xbt_assert( host_list != nullptr );
211 // for each host name
212 // find parent container
213 // group by parent container
214 std::unordered_map<const char*, std::vector<const char*>> parent2hostgroup;
215 for (auto const& host : *host_list) {
216 const char *host_name = sg_host_get_name(host);
217 jed_container_t parent = host2_simgrid_parent_container.at(host_name);
218 xbt_assert( parent != nullptr );
220 auto host_group = parent2hostgroup.find(parent->name.c_str());
221 if (host_group == parent2hostgroup.end())
222 parent2hostgroup.insert({parent->name.c_str(), std::vector<const char*>(1,host_name)});
224 host_group->second.push_back(host_name);
227 for (auto const& elm : parent2hostgroup) {
228 jed_container_t parent = container_name2container.at(elm.first);
229 add_subsets_to(subset_list, elm.second, parent);