X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/loba.git/blobdiff_plain/cd488767770ec6e9fb9437dcdd589af3fb02fbb7..de044764fcc724b2bbfa26ccf77804070498aa12:/options.cpp diff --git a/options.cpp b/options.cpp index 86cec69..6a6a887 100644 --- a/options.cpp +++ b/options.cpp @@ -7,6 +7,8 @@ XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(main); +#include "deployment.h" +#include "process.h" #include "loba_simple.h" #include "loba_fairstrategy.h" @@ -45,9 +47,14 @@ namespace opt { bool bookkeeping = false; // Application parameters - cost_func comp_cost("1e9, 0"); // fixme: find better defaults - cost_func comm_cost("1, 0"); // fixme: find better defaults - unsigned maxiter = 10; // fixme: find better defaults + // fixme: find better defaults + cost_func comp_cost("1e9, 0"); + cost_func comm_cost("1, 0"); + + // Parameters for the end of the simulation + // fixme: find better defaults + unsigned comp_maxiter = 10; + unsigned lb_maxiter = comp_maxiter; bool exit_on_close = false; // Named parameters lists @@ -78,87 +85,87 @@ namespace opt { namespace { - // some helper functions for opt::print() + // local helper class + class opt_helper { + public: + static const char* on_off(bool b); + const char* descr(const char* str); + template + const char* val_or_string(const T& val, const char* str, + const T& deflt = 0); + template + static bool nol_find_prefix(const T& nol, const char* descr, + std::string& name); + + private: + std::string descr_str; + std::string val_or_string_str; + }; - std::string* descr_str; - std::string* val_or_string_str; - - void print_helper_init() - { - descr_str = new std::string; - val_or_string_str = new std::string; - } +} // namespace - void print_helper_destroy() - { - delete val_or_string_str; - delete descr_str; - } +const char* opt_helper::on_off(bool b) +{ + return b ? "on" : "off"; +} - const char* descr(const char* str) - { - const int descr_width = 35; - std::string* res = descr_str; - *res = str; - res->resize(descr_width, '.'); - return res->c_str(); - } +const char* opt_helper::descr(const char* str) +{ + const int descr_width = 35; + std::string& res = descr_str; + res = str; + res.resize(descr_width, '.'); + return res.c_str(); +} - const char* on_off(bool b) - { - return b ? "on" : "off"; +template +const char* opt_helper::val_or_string(const T& val, const char* str, + const T& deflt) +{ + std::string& res = val_or_string_str; + if (val != deflt) { + std::ostringstream oss; + oss << val; + res = oss.str(); + } else { + res = str; } + return res.c_str(); +} - template - const char* val_or_string(const T& val, const char* str, const T& deflt = 0) - { - std::string* res = val_or_string_str; - if (val != deflt) { - std::ostringstream oss; - oss << val; - *res = oss.str(); - } else { - *res = str; +template +bool opt_helper::nol_find_prefix(const T& nol, const char* descr, + std::string& name) +{ + bool result = nol.exists(name); + if (!result) { + std::stack candidates; + for (typename T::iterator it = nol.begin() ; it != nol.end() ; ++it) { + const std::string& fullname = nol.get_name(it); + if (fullname.compare(0, name.length(), name) == 0) + candidates.push(fullname); } - return res->c_str(); - } - - // helper function for opt::parse_args() - - template - bool nol_find_prefix(const T& nol, const char* descr, std::string& name) - { - bool result = nol.exists(name); - if (!result) { - std::stack candidates; - for (typename T::iterator it = nol.begin() ; it != nol.end() ; ++it) { - const std::string& fullname = nol.get_name(it); - if (fullname.compare(0, name.length(), name) == 0) - candidates.push(fullname); - } - switch (candidates.size()) { - case 0: - ERROR2("unknownw %s -- %s", descr, name.c_str()); - break; - case 1: - name = candidates.top(); + switch (candidates.size()) { + case 0: + ERROR2("unknownw %s -- %s", descr, name.c_str()); + break; + case 1: + name = candidates.top(); + candidates.pop(); + result = true; + DEBUG2("infered %s -- %s", descr, name.c_str()); + break; + default: + ERROR2("ambiguous %s -- %s", descr, name.c_str()); + while (!candidates.empty()) { + ERROR1(" candidates are -- %s", candidates.top().c_str()); candidates.pop(); - result = true; - DEBUG2("infered %s -- %s", descr, name.c_str()); - break; - default: - ERROR2("ambiguous %s -- %s", descr, name.c_str()); - while (!candidates.empty()) { - ERROR1(" candidates are -- %s", candidates.top().c_str()); - candidates.pop(); - } - break; } + break; } - return result; } - -} // namespace + return result; +} bool opt::parse_args(int* argc, char* argv[]) { @@ -169,13 +176,14 @@ bool opt::parse_args(int* argc, char* argv[]) int c; opterr = 0; - while ((c = getopt(*argc, argv, "a:bc:C:ehi:l:L:N:T:vV")) != -1) { + while ((c = getopt(*argc, argv, "a:bc:C:ehi:I:l:L:N:T:vV")) != -1) { switch (c) { case 'a': opt::loba_algo = optarg; - result = nol_find_prefix(opt::loba_algorithms, - "load balancing algorithm", - opt::loba_algo); + result = opt_helper::nol_find_prefix(opt::loba_algorithms, + "load balancing algorithm", + opt::loba_algo) + && result; break; case 'b': opt::bookkeeping = true; @@ -193,7 +201,12 @@ bool opt::parse_args(int* argc, char* argv[]) opt::comm_cost = cost_func(optarg); break; case 'i': - std::istringstream(optarg) >> opt::maxiter; + std::istringstream(optarg) >> opt::comp_maxiter; + break; + case 'I': + std::istringstream(optarg) >> opt::lb_maxiter; + ERROR0("option -I not implemented yet"); + result = false; break; case 'l': std::istringstream(optarg) >> opt::log_rate; @@ -206,8 +219,9 @@ bool opt::parse_args(int* argc, char* argv[]) break; case 'T': opt::auto_depl::topology = optarg; - result = nol_find_prefix(opt::topologies, "topology", - opt::auto_depl::topology); + result = opt_helper::nol_find_prefix(opt::topologies, "topology", + opt::auto_depl::topology) + && result; break; case 'v': // nothing to do: this option is checked at the very @@ -247,32 +261,36 @@ bool opt::parse_args(int* argc, char* argv[]) void opt::print() { - print_helper_init(); + opt_helper h; + #define DESCR(description, format, value) \ - INFO2("| %s: " format, descr(description), value) + INFO2("| %s: " format, h.descr(description), value) + INFO0(",----[ Simulation parameters ]"); - DESCR("log rate", "%s", val_or_string(log_rate, "disabled")); + DESCR("log rate", "%s", h.val_or_string(log_rate, "disabled")); DESCR("platform file", "\"%s\"", platform_file.c_str()); if (auto_depl::enabled) { INFO0("| automatic deployment enabled"); - DESCR("- topology", "%s", auto_depl::topology.c_str()); - DESCR("- number of hosts", "%s", val_or_string(auto_depl::nhosts, - "auto")); - DESCR("- initial load", "%s", val_or_string(auto_depl::load, + DESCR("- topology", "%s", auto_depl::topology.c_str()); + DESCR("- number of hosts", "%s", h.val_or_string(auto_depl::nhosts, "auto")); + DESCR("- initial load", "%s", h.val_or_string(auto_depl::load, + "auto")); } else { DESCR("deployment file", "\"%s\"", deployment_file.c_str()); } - DESCR("load balancing algorithm", "%s", loba_algo.c_str()); - DESCR("bookkeeping", "%s", on_off(bookkeeping)); - DESCR("computation cost factors", "[%s]", comp_cost.to_string().c_str()); + DESCR("load balancing algorithm", "%s", loba_algo.c_str()); + DESCR("bookkeeping", "%s", h.on_off(bookkeeping)); + DESCR("computation cost factors", "[%s]", comp_cost.to_string().c_str()); DESCR("communication cost factors", "[%s]", comm_cost.to_string().c_str()); - DESCR("maximum number of iterations", "%s", - val_or_string(maxiter, "infinity")); - DESCR("exit on close", "%s", on_off(exit_on_close)); + DESCR("maximum number of comp. iterations", "%s", + h.val_or_string(comp_maxiter, "infinity")); + DESCR("maximum number of lb. iterations", "%s", + h.val_or_string(lb_maxiter, "infinity")); + DESCR("exit on close", "%s", h.on_off(exit_on_close)); INFO0("`----"); + #undef DESCR - print_helper_destroy(); } void opt::usage() @@ -328,7 +346,7 @@ void opt::usage() << " (" << opt::loba_algo << ")\n"; if (opt::help_requested > 1) so_list(opt::loba_algorithms); - std::clog << o("-b") << "enable bookkeeping\n"; + std::clog << o("-b") << "enable bookkeeping (\"virtual load\")\n"; std::clog << "\nApplication parameters\n"; std::clog << o("-c [fn,...]f0") @@ -337,10 +355,15 @@ void opt::usage() std::clog << o("-C [fn,...]f0") << "polynomial factors for communication cost" << " (" << opt::comm_cost.to_string() << ")\n"; - std::clog << o("-e") << "exit on reception of \"close\" message\n"; + + std::clog << "\nParameters for the end of the simulation\n"; std::clog << o("-i value") - << "maximum number of iterations, 0 for infinity" - << " (" << opt::maxiter << ")\n"; + << "maximum number of comp. iterations, 0 for infinity" + << " (" << opt::comp_maxiter << ")\n"; + std::clog << o("-I value") + << "maximum number of lb. iterations, 0 for infinity" + << " (" << opt::lb_maxiter << ")\n"; + std::clog << o("-e") << "exit on reception of \"close\" message\n"; if (opt::help_requested < 3) return; @@ -356,6 +379,8 @@ void opt::usage() << " proc : messages from base process class\n" << " loba : messages from load-balancer\n"; + // std::clog << "\nMiscellaneous low-level parameters\n"; + #undef so_list #undef so #undef o