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"
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(NetZone_t from_as)
64 xbt_dict_cursor_t cursor = nullptr;
67 xbt_dict_t routing_sons = from_as->children();
69 if (xbt_dict_is_empty(routing_sons)) {
71 // add hosts to jedule platform
72 xbt_dynar_t table = from_as->hosts();
73 unsigned int dynar_cursor;
76 std::vector<sg_host_t> hosts;
78 xbt_dynar_foreach(table, dynar_cursor, host) {
79 hosts.push_back(host);
81 this->addResources(hosts);
82 xbt_dynar_free(&table);
84 xbt_dict_foreach(routing_sons, cursor, key, elem) {
85 jed_container_t child_container = new simgrid::jedule::Container(std::string(elem->name()));
86 this->addChild(child_container);
87 child_container->createHierarchy(elem);
92 std::vector<int> Container::getHierarchy()
94 xbt_assert( this!= nullptr );
96 if(this->parent != nullptr ) {
98 if(!this->parent->children.empty()) {
99 // we are in the last level
100 return this->parent->getHierarchy();
105 for (auto child : this->parent->children) {
113 xbt_assert( child_nb > - 1);
114 std::vector<int> heir_list = this->parent->getHierarchy();
115 heir_list.insert(heir_list.begin(), child_nb);
120 std::vector<int> heir_list = {top_level};
125 std::string Container::getHierarchyAsString()
127 std::string output("");
129 std::vector<int> heir_list = this->getHierarchy();
131 unsigned int length = heir_list.size();
133 for (auto id : heir_list) {
134 output += std::to_string(id);
135 if( i != length-1 ) {
143 void Container::printResources(FILE * jed_file)
146 xbt_assert(!this->resource_list.empty());
148 unsigned int res_nb = this->resource_list.size();
149 std::string resid = this->getHierarchyAsString();
151 fprintf(jed_file, " <rset id=\"%s\" nb=\"%u\" names=\"", resid.c_str(), res_nb);
152 for (auto res: this->resource_list) {
153 const char * res_name = sg_host_get_name(res);
154 fprintf(jed_file, "%s", res_name);
155 if( i != res_nb-1 ) {
156 fprintf(jed_file, "|");
160 fprintf(jed_file, "\" />\n");
163 void Container::print(FILE* jed_file)
165 xbt_assert( this != nullptr );
166 fprintf(jed_file, " <res name=\"%s\">\n", this->name.c_str());
167 if( !this->children.empty()){
168 for (auto child: this->children) {
169 child->print(jed_file);
172 this->printResources(jed_file);
174 fprintf(jed_file, " </res>\n");
180 static void add_subsets_to(std::vector<jed_subset_t> *subset_list, std::vector<const char*> hostgroup, jed_container_t parent)
182 // get ids for each host
185 // create subset for each id group
187 xbt_assert( parent != nullptr );
189 std::vector<unsigned int> id_list;
191 for (auto host_name : hostgroup) {
192 xbt_assert( host_name != nullptr );
193 jed_container_t parent = host2_simgrid_parent_container.at(host_name);
194 unsigned int id = parent->name2id.at(host_name);
195 id_list.push_back(id);
197 unsigned int nb_ids = id_list.size();
198 std::sort(id_list.begin(), id_list.end());
203 for(unsigned int i=0; i<nb_ids; i++) {
204 if( id_list[i] - id_list[pos] > 1 ) {
205 subset_list->push_back(new simgrid::jedule::Subset(id_list[start], id_list[pos], parent));
208 if( i == nb_ids-1 ) {
209 subset_list->push_back(new simgrid::jedule::Subset(id_list[i], id_list[i], parent));
212 if( i == nb_ids-1 ) {
213 subset_list->push_back(new simgrid::jedule::Subset(id_list[start], id_list[i], parent));
222 void get_resource_selection_by_hosts(std::vector<jed_subset_t> *subset_list, std::vector<sg_host_t> *host_list)
224 xbt_assert( host_list != nullptr );
225 // for each host name
226 // find parent container
227 // group by parent container
228 std::unordered_map<const char*, std::vector<const char*>> parent2hostgroup;
229 for (auto host: *host_list) {
230 const char *host_name = sg_host_get_name(host);
231 jed_container_t parent = host2_simgrid_parent_container.at(host_name);
232 xbt_assert( parent != nullptr );
234 auto host_group = parent2hostgroup.find(parent->name.c_str());
235 if (host_group == parent2hostgroup.end())
236 parent2hostgroup.insert({parent->name.c_str(), std::vector<const char*>(1,host_name)});
238 host_group->second.push_back(host_name);
241 for (auto elm: parent2hostgroup) {
242 jed_container_t parent = container_name2container.at(elm.first);
243 add_subsets_to(subset_list, elm.second, parent);