-/* Copyright (c) 2010-2016. The SimGrid Team.
- * All rights reserved. */
+/* Copyright (c) 2010-2019. 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. */
#include "simgrid/jedule/jedule.hpp"
-#include "simgrid/jedule/jedule_platform.hpp"
+#include "simgrid/host.h"
#include "simgrid/s4u/NetZone.hpp"
#include "xbt/asserts.h"
-#include "xbt/dynar.h"
#include <algorithm>
#if SIMGRID_HAVE_JEDULE
+namespace {
+std::unordered_map<const char*, jed_container_t> host2_simgrid_parent_container;
+std::unordered_map<std::string, jed_container_t> container_name2container;
+}
+
namespace simgrid {
namespace jedule {
Subset::Subset(int start_idx, int end_idx, Container* parent)
Container::~Container()
{
- if(!this->children.empty())
- for (auto child: this->children)
+ if (not this->children.empty())
+ for (auto const& child : this->children)
delete child;
}
-void Container::addChild(jed_container_t child)
+void Container::add_child(jed_container_t child)
{
- xbt_assert(this != nullptr);
xbt_assert(child != nullptr);
this->children.push_back(child);
child->parent = this;
}
-void Container::addResources(std::vector<sg_host_t> hosts)
+void Container::add_resources(std::vector<sg_host_t> hosts)
{
- this->is_lowest = 1;
+ this->is_lowest_ = 1;
this->children.clear();
- this->last_id = 0;
+ this->last_id_ = 0;
//FIXME do we need to sort?: xbt_dynar_sort_strings(host_names);
- for (auto host : hosts) {
+ for (auto const& host : hosts) {
const char *host_name = sg_host_get_name(host);
- this->name2id.insert({host_name, this->last_id});
- (this->last_id)++;
+ this->name2id.insert({host_name, this->last_id_});
+ (this->last_id_)++;
host2_simgrid_parent_container.insert({host_name, this});
this->resource_list.push_back(host);
}
}
-void Container::createHierarchy(sg_netzone_t from_as)
+void Container::create_hierarchy(sg_netzone_t from_as)
{
- if (from_as->children()->empty()) {
+ if (from_as->get_children().empty()) {
// I am no AS
// add hosts to jedule platform
- std::vector<sg_host_t> table;
- from_as->hosts(&table);
- this->addResources(table);
+ std::vector<sg_host_t> table = from_as->get_all_hosts();
+ this->add_resources(table);
} else {
- for (auto nz : *from_as->children()) {
- jed_container_t child_container = new simgrid::jedule::Container(std::string(nz->name()));
- this->addChild(child_container);
- child_container->createHierarchy(nz);
+ for (auto const& nz : from_as->get_children()) {
+ jed_container_t child_container = new simgrid::jedule::Container(std::string(nz->get_cname()));
+ this->add_child(child_container);
+ child_container->create_hierarchy(nz);
}
}
}
-std::vector<int> Container::getHierarchy()
+std::vector<int> Container::get_hierarchy()
{
- xbt_assert( this!= nullptr );
-
if(this->parent != nullptr ) {
- if(!this->parent->children.empty()) {
+ if (not this->parent->children.empty()) {
// we are in the last level
- return this->parent->getHierarchy();
+ return this->parent->get_hierarchy();
} else {
unsigned int i =0;
int child_nb = -1;
- for (auto child : this->parent->children) {
+ for (auto const& child : this->parent->children) {
if( child == this) {
child_nb = i;
break;
}
xbt_assert( child_nb > - 1);
- std::vector<int> heir_list = this->parent->getHierarchy();
+ std::vector<int> heir_list = this->parent->get_hierarchy();
heir_list.insert(heir_list.begin(), child_nb);
return heir_list;
}
}
}
-std::string Container::getHierarchyAsString()
+std::string Container::get_hierarchy_as_string()
{
std::string output("");
- std::vector<int> heir_list = this->getHierarchy();
+ std::vector<int> heir_list = this->get_hierarchy();
unsigned int length = heir_list.size();
unsigned int i = 0;
- for (auto id : heir_list) {
+ for (auto const& id : heir_list) {
output += std::to_string(id);
if( i != length-1 ) {
output += ".";
return output;
}
-void Container::printResources(FILE * jed_file)
+void Container::print_resources(FILE* jed_file)
{
unsigned int i=0;
- xbt_assert(!this->resource_list.empty());
+ xbt_assert(not this->resource_list.empty());
unsigned int res_nb = this->resource_list.size();
- std::string resid = this->getHierarchyAsString();
+ std::string resid = this->get_hierarchy_as_string();
fprintf(jed_file, " <rset id=\"%s\" nb=\"%u\" names=\"", resid.c_str(), res_nb);
- for (auto res: this->resource_list) {
+ for (auto const& res : this->resource_list) {
const char * res_name = sg_host_get_name(res);
fprintf(jed_file, "%s", res_name);
if( i != res_nb-1 ) {
void Container::print(FILE* jed_file)
{
- xbt_assert( this != nullptr );
fprintf(jed_file, " <res name=\"%s\">\n", this->name.c_str());
- if( !this->children.empty()){
- for (auto child: this->children) {
+ if (not this->children.empty()) {
+ for (auto const& child : this->children) {
child->print(jed_file);
}
} else {
- this->printResources(jed_file);
+ this->print_resources(jed_file);
}
fprintf(jed_file, " </res>\n");
}
std::vector<unsigned int> id_list;
- for (auto host_name : hostgroup) {
+ for (auto const& host_name : hostgroup) {
xbt_assert( host_name != nullptr );
- jed_container_t parent = host2_simgrid_parent_container.at(host_name);
- unsigned int id = parent->name2id.at(host_name);
+ jed_container_t parent_cont = host2_simgrid_parent_container.at(host_name);
+ unsigned int id = parent_cont->name2id.at(host_name);
id_list.push_back(id);
}
unsigned int nb_ids = id_list.size();
// find parent container
// group by parent container
std::unordered_map<const char*, std::vector<const char*>> parent2hostgroup;
- for (auto host: *host_list) {
+ for (auto const& host : *host_list) {
const char *host_name = sg_host_get_name(host);
jed_container_t parent = host2_simgrid_parent_container.at(host_name);
xbt_assert( parent != nullptr );
host_group->second.push_back(host_name);
}
- for (auto elm: parent2hostgroup) {
+ for (auto const& elm : parent2hostgroup) {
jed_container_t parent = container_name2container.at(elm.first);
add_subsets_to(subset_list, elm.second, parent);
}
