1 /* Copyright (c) 2010-2016. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
7 #include "simgrid/jedule/jedule.hpp"
8 #include "simgrid/jedule/jedule_platform.hpp"
9 #include "simgrid/s4u/NetZone.hpp"
10 #include "xbt/asserts.h"
11 #include "xbt/dynar.h"
14 #if SIMGRID_HAVE_JEDULE
18 Subset::Subset(int start_idx, int end_idx, Container* parent)
19 : start_idx(start_idx), parent(parent)
21 nres=end_idx-start_idx+1;
25 Container::Container(std::string name): name(name)
27 container_name2container.insert({this->name, this});
30 Container::~Container()
32 if(!this->children.empty())
33 for (auto child: this->children)
37 void Container::addChild(jed_container_t child)
39 xbt_assert(this != nullptr);
40 xbt_assert(child != nullptr);
41 this->children.push_back(child);
45 void Container::addResources(std::vector<sg_host_t> hosts)
48 this->children.clear();
51 //FIXME do we need to sort?: xbt_dynar_sort_strings(host_names);
53 for (auto host : hosts) {
54 const char *host_name = sg_host_get_name(host);
55 this->name2id.insert({host_name, this->last_id});
57 host2_simgrid_parent_container.insert({host_name, this});
58 this->resource_list.push_back(host);
62 void Container::createHierarchy(sg_netzone_t from_as)
65 if (from_as->children()->empty()) {
67 // add hosts to jedule platform
68 std::vector<sg_host_t> table;
69 from_as->hosts(&table);
70 this->addResources(table);
72 for (auto nz : *from_as->children()) {
73 jed_container_t child_container = new simgrid::jedule::Container(std::string(nz->name()));
74 this->addChild(child_container);
75 child_container->createHierarchy(nz);
80 std::vector<int> Container::getHierarchy()
82 xbt_assert( this!= nullptr );
84 if(this->parent != nullptr ) {
86 if(!this->parent->children.empty()) {
87 // we are in the last level
88 return this->parent->getHierarchy();
93 for (auto child : this->parent->children) {
101 xbt_assert( child_nb > - 1);
102 std::vector<int> heir_list = this->parent->getHierarchy();
103 heir_list.insert(heir_list.begin(), child_nb);
108 std::vector<int> heir_list = {top_level};
113 std::string Container::getHierarchyAsString()
115 std::string output("");
117 std::vector<int> heir_list = this->getHierarchy();
119 unsigned int length = heir_list.size();
121 for (auto id : heir_list) {
122 output += std::to_string(id);
123 if( i != length-1 ) {
131 void Container::printResources(FILE * jed_file)
134 xbt_assert(!this->resource_list.empty());
136 unsigned int res_nb = this->resource_list.size();
137 std::string resid = this->getHierarchyAsString();
139 fprintf(jed_file, " <rset id=\"%s\" nb=\"%u\" names=\"", resid.c_str(), res_nb);
140 for (auto res: this->resource_list) {
141 const char * res_name = sg_host_get_name(res);
142 fprintf(jed_file, "%s", res_name);
143 if( i != res_nb-1 ) {
144 fprintf(jed_file, "|");
148 fprintf(jed_file, "\" />\n");
151 void Container::print(FILE* jed_file)
153 xbt_assert( this != nullptr );
154 fprintf(jed_file, " <res name=\"%s\">\n", this->name.c_str());
155 if( !this->children.empty()){
156 for (auto child: this->children) {
157 child->print(jed_file);
160 this->printResources(jed_file);
162 fprintf(jed_file, " </res>\n");
168 static void add_subsets_to(std::vector<jed_subset_t> *subset_list, std::vector<const char*> hostgroup, jed_container_t parent)
170 // get ids for each host
173 // create subset for each id group
175 xbt_assert( parent != nullptr );
177 std::vector<unsigned int> id_list;
179 for (auto host_name : hostgroup) {
180 xbt_assert( host_name != nullptr );
181 jed_container_t parent = host2_simgrid_parent_container.at(host_name);
182 unsigned int id = parent->name2id.at(host_name);
183 id_list.push_back(id);
185 unsigned int nb_ids = id_list.size();
186 std::sort(id_list.begin(), id_list.end());
191 for(unsigned int i=0; i<nb_ids; i++) {
192 if( id_list[i] - id_list[pos] > 1 ) {
193 subset_list->push_back(new simgrid::jedule::Subset(id_list[start], id_list[pos], parent));
196 if( i == nb_ids-1 ) {
197 subset_list->push_back(new simgrid::jedule::Subset(id_list[i], id_list[i], parent));
200 if( i == nb_ids-1 ) {
201 subset_list->push_back(new simgrid::jedule::Subset(id_list[start], id_list[i], parent));
210 void get_resource_selection_by_hosts(std::vector<jed_subset_t> *subset_list, std::vector<sg_host_t> *host_list)
212 xbt_assert( host_list != nullptr );
213 // for each host name
214 // find parent container
215 // group by parent container
216 std::unordered_map<const char*, std::vector<const char*>> parent2hostgroup;
217 for (auto host: *host_list) {
218 const char *host_name = sg_host_get_name(host);
219 jed_container_t parent = host2_simgrid_parent_container.at(host_name);
220 xbt_assert( parent != nullptr );
222 auto host_group = parent2hostgroup.find(parent->name.c_str());
223 if (host_group == parent2hostgroup.end())
224 parent2hostgroup.insert({parent->name.c_str(), std::vector<const char*>(1,host_name)});
226 host_group->second.push_back(host_name);
229 for (auto elm: parent2hostgroup) {
230 jed_container_t parent = container_name2container.at(elm.first);
231 add_subsets_to(subset_list, elm.second, parent);