X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/026c5a576fbea1da8f6290f4435d5424ce0efe8b..84402e8e2ee2a2d0bef25fdceb0a263ed8b471f6:/src/instr/jedule/jedule_platform.cpp diff --git a/src/instr/jedule/jedule_platform.cpp b/src/instr/jedule/jedule_platform.cpp index a228b90dbd..f7167ed4c3 100644 --- a/src/instr/jedule/jedule_platform.cpp +++ b/src/instr/jedule/jedule_platform.cpp @@ -1,4 +1,4 @@ -/* Copyright (c) 2010-2019. The SimGrid Team. All rights reserved. */ +/* Copyright (c) 2010-2020. 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. */ @@ -19,33 +19,24 @@ std::unordered_map container_name2container; namespace simgrid { namespace jedule { Subset::Subset(int start_idx, int end_idx, Container* parent) -: start_idx(start_idx), parent(parent) + : start_idx(start_idx), nres(end_idx - start_idx + 1), parent(parent) { - nres=end_idx-start_idx+1; } -Container::Container(std::string name) : name(std::move(name)) +Container::Container(const std::string& name) : name(name) { container_name2container.insert({this->name, this}); } -Container::~Container() -{ - if (not this->children.empty()) - for (auto const& child : this->children) - delete child; -} - void Container::add_child(jed_container_t child) { xbt_assert(child != nullptr); - this->children.push_back(child); + this->children.emplace_back(child); child->parent = this; } void Container::add_resources(std::vector hosts) { - this->is_lowest_ = 1; this->children.clear(); this->last_id_ = 0; @@ -58,9 +49,8 @@ void Container::add_resources(std::vector hosts) } } -void Container::create_hierarchy(sg_netzone_t from_as) +void Container::create_hierarchy(const_sg_netzone_t from_as) { - if (from_as->get_children().empty()) { // I am no AS // add hosts to jedule platform @@ -78,7 +68,6 @@ void Container::create_hierarchy(sg_netzone_t from_as) std::vector Container::get_hierarchy() { if(this->parent != nullptr ) { - if (not this->parent->children.empty()) { // we are in the last level return this->parent->get_hierarchy(); @@ -87,7 +76,7 @@ std::vector Container::get_hierarchy() int child_nb = -1; for (auto const& child : this->parent->children) { - if( child == this) { + if (child.get() == this) { child_nb = i; break; } @@ -157,10 +146,11 @@ void Container::print(FILE* jed_file) fprintf(jed_file, " \n"); } -} -} +} // namespace jedule +} // namespace simgrid -static void add_subsets_to(std::vector *subset_list, std::vector hostgroup, jed_container_t parent) +static void add_subsets_to(std::vector& subset_list, std::vector hostgroup, + jed_container_t parent) { // get ids for each host // sort ids @@ -185,33 +175,32 @@ static void add_subsets_to(std::vector *subset_list, std::vector 1 ) { - subset_list->push_back(new simgrid::jedule::Subset(id_list[start], id_list[pos], parent)); + subset_list.emplace_back(id_list[start], id_list[pos], parent); start = i; if( i == nb_ids-1 ) { - subset_list->push_back(new simgrid::jedule::Subset(id_list[i], id_list[i], parent)); + subset_list.emplace_back(id_list[i], id_list[i], parent); } } else { if( i == nb_ids-1 ) { - subset_list->push_back(new simgrid::jedule::Subset(id_list[start], id_list[i], parent)); + subset_list.emplace_back(id_list[start], id_list[i], parent); } } pos = i; } } - } -void get_resource_selection_by_hosts(std::vector *subset_list, std::vector *host_list) +void get_resource_selection_by_hosts(std::vector& subset_list, + const std::vector& host_list) { - xbt_assert( host_list != nullptr ); // for each host name // find parent container // group by parent container std::unordered_map> parent2hostgroup; - for (auto const& 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); + const simgrid::jedule::Container* parent = host2_simgrid_parent_container.at(host_name); xbt_assert( parent != nullptr ); auto host_group = parent2hostgroup.find(parent->name.c_str());