git-subtree-dir: software/gecode git-subtree-split: 313e87646da4fc2752a70e83df16d993121a8e40
507 lines
16 KiB
C++
507 lines
16 KiB
C++
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
|
|
/*
|
|
* Main authors:
|
|
* Christian Schulte <schulte@gecode.org>
|
|
* Mikael Lagerkvist <lagerkvist@gecode.org>
|
|
*
|
|
* Copyright:
|
|
* Christian Schulte, 2004
|
|
* Mikael Lagerkvist, 2005
|
|
*
|
|
* This file is part of Gecode, the generic constraint
|
|
* development environment:
|
|
* http://www.gecode.org
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining
|
|
* a copy of this software and associated documentation files (the
|
|
* "Software"), to deal in the Software without restriction, including
|
|
* without limitation the rights to use, copy, modify, merge, publish,
|
|
* distribute, sublicense, and/or sell copies of the Software, and to
|
|
* permit persons to whom the Software is furnished to do so, subject to
|
|
* the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be
|
|
* included in all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
|
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
|
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
|
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
*
|
|
*/
|
|
|
|
#include "test/test.hh"
|
|
|
|
#ifdef GECODE_HAS_MTRACE
|
|
#include <mcheck.h>
|
|
#endif
|
|
|
|
#include <iostream>
|
|
|
|
#include <cstdlib>
|
|
#include <cstring>
|
|
#include <ctime>
|
|
#include <utility>
|
|
#include <vector>
|
|
#include <utility>
|
|
|
|
namespace Test {
|
|
|
|
// Log stream
|
|
std::ostringstream olog;
|
|
|
|
/*
|
|
* Base class for tests
|
|
*
|
|
*/
|
|
Base::Base(std::string s)
|
|
: _name(std::move(s)), _next(_tests), _rand(Gecode::Support::RandomGenerator()) {
|
|
_tests = this; _n_tests++;
|
|
}
|
|
|
|
Base* Base::_tests = nullptr;
|
|
unsigned int Base::_n_tests = 0;
|
|
|
|
/// Sort tests by name
|
|
class SortByName {
|
|
public:
|
|
forceinline bool
|
|
operator()(Base* x, Base* y) {
|
|
return x->name() > y->name();
|
|
}
|
|
};
|
|
|
|
void
|
|
Base::sort() {
|
|
Base** b = Gecode::heap.alloc<Base*>(_n_tests);
|
|
unsigned int i=0;
|
|
for (Base* t = _tests; t != nullptr; t = t->next())
|
|
b[i++] = t;
|
|
SortByName sbn;
|
|
Gecode::Support::quicksort(b, _n_tests,sbn);
|
|
i=0;
|
|
_tests = nullptr;
|
|
for ( ; i < _n_tests; i++) {
|
|
b[i]->next(_tests); _tests = b[i];
|
|
}
|
|
Gecode::heap.free(b,_n_tests);
|
|
}
|
|
|
|
Base::~Base() = default;
|
|
|
|
Options opt;
|
|
|
|
void report_error(const std::string& name, unsigned int seed, Options& options, std::ostream& ostream) {
|
|
ostream << "Options: -seed " << seed;
|
|
if (options.fixprob != Test::Options::deffixprob)
|
|
ostream << " -fixprob " << options.fixprob;
|
|
ostream << " -test " << name << std::endl;
|
|
if (options.log)
|
|
ostream << olog.str();
|
|
}
|
|
|
|
void
|
|
Options::parse(int argc, char* argv[]) {
|
|
int i = 1;
|
|
while (i < argc) {
|
|
if (!strcmp(argv[i],"-help") || !strcmp(argv[i],"--help")) {
|
|
std::cerr << "Options for testing:" << std::endl
|
|
<< "\t-threads (unsigned int) default: " << threads << std::endl
|
|
<< "\t\tnumber of threads to use. If 0, as many threads as there are cores are used."
|
|
<< "\t\tThreaded execution and logging can not be used at the same time."
|
|
<< std::endl
|
|
<< "\t-seed (unsigned int or \"time\") default: "
|
|
<< seed << std::endl
|
|
<< "\t\tseed for random number generator (unsigned int),"
|
|
<< std::endl
|
|
<< "\t\tor \"time\" for a random seed based on "
|
|
<< "current time" << std::endl
|
|
<< "\t-fixprob (unsigned int) default: "
|
|
<< fixprob << std::endl
|
|
<< "\t\t1/fixprob is the probability of computing a fixpoint"
|
|
<< std::endl
|
|
<< "\t-iter (unsigned int) default: " <<iter<< std::endl
|
|
<< "\t\tthe number of iterations" << std::endl
|
|
<< "\t-test (string) default: (none)" << std::endl
|
|
<< "\t\tsimple pattern for the tests to run" << std::endl
|
|
<< "\t\tprefixing with \"-\" negates the pattern" << std::endl
|
|
<< "\t\tprefixing with \"^\" requires a match at the beginning" << std::endl
|
|
<< "\t\tmultiple pattern-options may be given"
|
|
<< std::endl
|
|
<< "\t-start (string) default: (none)" << std::endl
|
|
<< "\t\tsimple pattern for the first test to run" << std::endl
|
|
<< "\t-log"
|
|
<< std::endl
|
|
<< "\t\tlog execution of tests"
|
|
<< std::endl
|
|
<< "\t\tthe optional argument determines the style of the log"
|
|
<< std::endl
|
|
<< "\t\twith text as the default style"
|
|
<< std::endl
|
|
<< "\t-stop (boolean) default: "
|
|
<< (stop ? "true" : "false") << std::endl
|
|
<< "\t\tstop on first error or continue" << std::endl
|
|
<< "\t-list" << std::endl
|
|
<< "\t\toutput list of all test cases and exit" << std::endl
|
|
;
|
|
exit(EXIT_SUCCESS);
|
|
} else if (!strcmp(argv[i],"-threads")) {
|
|
if (++i == argc) goto missing;
|
|
unsigned int argument = static_cast<unsigned int>(atoi(argv[i]));
|
|
if (argument == 0) {
|
|
threads = Gecode::Support::Thread::npu();
|
|
} else {
|
|
threads = argument;
|
|
}
|
|
} else if (!strcmp(argv[i],"-seed")) {
|
|
if (++i == argc) goto missing;
|
|
if (!strcmp(argv[i],"time")) {
|
|
seed = static_cast<unsigned int>(time(nullptr));
|
|
} else {
|
|
seed = static_cast<unsigned int>(atoi(argv[i]));
|
|
}
|
|
} else if (!strcmp(argv[i],"-iter")) {
|
|
if (++i == argc) goto missing;
|
|
iter = static_cast<unsigned int>(atoi(argv[i]));
|
|
} else if (!strcmp(argv[i],"-fixprob")) {
|
|
if (++i == argc) goto missing;
|
|
fixprob = static_cast<unsigned int>(atoi(argv[i]));
|
|
} else if (!strcmp(argv[i],"-test")) {
|
|
if (++i == argc) goto missing;
|
|
if (argv[i][0] == '^')
|
|
testpat.emplace_back(MT_FIRST, argv[i] + 1);
|
|
else if (argv[i][0] == '-')
|
|
testpat.emplace_back(MT_NOT, argv[i] + 1);
|
|
else
|
|
testpat.emplace_back(MT_ANY, argv[i]);
|
|
} else if (!strcmp(argv[i],"-start")) {
|
|
if (++i == argc) goto missing;
|
|
start_from = argv[i];
|
|
} else if (!strcmp(argv[i],"-log")) {
|
|
log = true;
|
|
} else if (!strcmp(argv[i],"-stop")) {
|
|
if (++i == argc) goto missing;
|
|
if(argv[i][0] == 't') {
|
|
stop = true;
|
|
} else if (argv[i][0] == 'f') {
|
|
stop = false;
|
|
}
|
|
} else if (!strcmp(argv[i],"-list")) {
|
|
list = true;
|
|
}
|
|
i++;
|
|
}
|
|
|
|
if (threads > 1 && log) {
|
|
std::cerr << "Logging and multi threading can not be used jointly." << std::endl;
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
return;
|
|
missing:
|
|
std::cerr << "Erroneous argument (" << argv[i-1] << ")" << std::endl
|
|
<< " missing parameter" << std::endl;
|
|
exit(EXIT_FAILURE);
|
|
}
|
|
|
|
bool Options::is_test_name_matching(const std::string& test_name) {
|
|
if (!testpat.empty()) {
|
|
bool positive_patterns = false;
|
|
bool match_found = false;
|
|
for (const auto& type_pattern: testpat) {
|
|
const auto& type = type_pattern.first;
|
|
const auto& pattern = type_pattern.second;
|
|
if (type == MT_NOT) { // Negative pattern
|
|
if (test_name.find(pattern) != std::string::npos) {
|
|
// Test matches a negative pattern, should not run
|
|
return false;
|
|
}
|
|
} else {
|
|
// Positive pattern
|
|
positive_patterns = true;
|
|
if (!match_found) {
|
|
// No match found yet, test with current pattern
|
|
if (((type == MT_ANY) && (test_name.find(pattern) != std::string::npos)) ||
|
|
((type == MT_FIRST) && (test_name.find(pattern) == 0)))
|
|
match_found = true;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (positive_patterns && match_found) {
|
|
// Some positive pattern matched the test name
|
|
return true;
|
|
} else if (positive_patterns && !match_found) {
|
|
// No positive pattern matched the test name
|
|
return false;
|
|
} else {
|
|
// No positive patterns, but no negative pattern ruled the test name out
|
|
return true;
|
|
}
|
|
} else {
|
|
// With no test-patterns, all tests should run.
|
|
return true;
|
|
}
|
|
}
|
|
|
|
/// Run a single test, returning true iff the test succeeded
|
|
bool run_test(Base* test, unsigned int test_seed, const Options& options, std::ostream& ostream) {
|
|
try {
|
|
ostream << test->name() << " ";
|
|
ostream.flush();
|
|
test->_rand.seed(test_seed);
|
|
for (unsigned int i = options.iter; i--;) {
|
|
unsigned int seed = test->_rand.seed();
|
|
if (test->run()) {
|
|
ostream << '+';
|
|
ostream.flush();
|
|
} else {
|
|
ostream << "-" << std::endl;
|
|
report_error(test->name(), seed, opt, ostream);
|
|
return false;
|
|
}
|
|
}
|
|
ostream << std::endl;
|
|
return true;
|
|
} catch (Gecode::Exception& e) {
|
|
ostream << "Exception in \"Gecode::" << e.what()
|
|
<< "." << std::endl
|
|
<< "Stopping..." << std::endl;
|
|
report_error(test->name(), options.seed, opt, ostream);
|
|
return false;
|
|
}
|
|
}
|
|
|
|
/// Run all the tests with the supplied options.
|
|
int run_tests(const std::vector<Base*>& tests, const Options& options) {
|
|
Gecode::Support::RandomGenerator seed_sequence(options.seed);
|
|
int result = EXIT_SUCCESS;
|
|
for (auto test : tests) {
|
|
unsigned int test_seed = seed_sequence.next();
|
|
if (!run_test(test, test_seed, options, std::cout)) {
|
|
if (opt.stop) {
|
|
return EXIT_FAILURE;
|
|
} else {
|
|
result = EXIT_FAILURE;
|
|
}
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
|
|
class TestExecutor;
|
|
|
|
/**
|
|
* Class that manages the state and control for running tests.
|
|
*/
|
|
class TestExecutionControl {
|
|
/// All the tests to run
|
|
const std::vector<Base*>& tests;
|
|
/// The options to use when running tests
|
|
const Options& options;
|
|
/// Mutex controlling output from the threads
|
|
Gecode::Support::Mutex output_mutex;
|
|
/// The next starting index among the tests.
|
|
std::atomic<size_t> next_tests;
|
|
/// The result
|
|
std::atomic<int> result;
|
|
/// The number of test runners that are to be set up.
|
|
std::atomic<int> running_threads;
|
|
/// Flag indicating some thread is waiting on the execution to be done.
|
|
std::atomic<bool> execution_done_wait_started;
|
|
/// Event for signalling that execution is done.
|
|
Gecode::Support::Event execution_done_event;
|
|
|
|
friend class TestExecutor;
|
|
|
|
/// Choose a batch size based on the number of tests to divide
|
|
static size_t choose_batch_size(size_t test_count, int thread_count) {
|
|
const int batches_per_thread = 5;
|
|
std::vector<size_t> batch_sizes = {25, 10, 5, 2};
|
|
for (auto batch_size : batch_sizes) {
|
|
if (test_count > batch_size * thread_count * batches_per_thread) {
|
|
return batch_size;
|
|
}
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
public:
|
|
TestExecutionControl(const std::vector<Base*>& tests0, const Options& options0, int thread_count)
|
|
: tests(tests0), options(options0), output_mutex(),
|
|
next_tests(0), result(EXIT_SUCCESS), running_threads(thread_count),
|
|
execution_done_wait_started(false), execution_done_event() {}
|
|
|
|
/// Get the current result (either \a EXIT_SUCCESS or \a EXIT_FAILURE). Requires all threads to be done first.
|
|
int get_result() {
|
|
assert(running_threads.load() == 0);
|
|
return result.load();
|
|
}
|
|
|
|
/** Wait for test-runners to be completed.
|
|
*
|
|
* Important: may only be called once by a single thread!
|
|
*/
|
|
void await_test_runners_completed() {
|
|
#ifndef NDEBUG
|
|
bool some_waiting =
|
|
#endif
|
|
execution_done_wait_started.exchange(true);
|
|
assert(some_waiting == false && "Only one thread is allowed to await the result");
|
|
execution_done_event.wait();
|
|
}
|
|
private:
|
|
/// Set flag that failure has occurred.
|
|
void set_failure() {
|
|
result.store(EXIT_FAILURE);
|
|
}
|
|
|
|
/// Indicate that a thread is done executing.
|
|
void thread_done() {
|
|
if (running_threads.fetch_sub(1) == 1) {
|
|
execution_done_event.signal();
|
|
}
|
|
}
|
|
|
|
/// Get the start of the next batch and the batch size.
|
|
/// Important, may be a number larger than available number of tests
|
|
std::pair<size_t, size_t> next_batch() {
|
|
const size_t current_start = next_tests.load();
|
|
const size_t batch_size = choose_batch_size(tests.size() - current_start, running_threads);
|
|
const size_t next_start = next_tests.fetch_add(batch_size);
|
|
return std::make_pair(next_start, batch_size);
|
|
}
|
|
|
|
/// True iff the runners should continue running tests
|
|
bool continue_testing() {
|
|
// Note: implementation should be cheap to call form multiple threads often
|
|
return !options.stop || result.load() == EXIT_SUCCESS;
|
|
}
|
|
|
|
/// Write a string to standard output, synchronized across all test runners
|
|
void write_output(std::string output) {
|
|
Gecode::Support::Lock lock(output_mutex);
|
|
std::cout << output;
|
|
std::cout.flush();
|
|
}
|
|
};
|
|
|
|
/**
|
|
* Class that is responsible for running tests.
|
|
*/
|
|
class TestExecutor : public Gecode::Support::Runnable {
|
|
/// The common controller for running tests
|
|
TestExecutionControl& tec;
|
|
/// The initial seed to start with
|
|
const int initial_seed;
|
|
public:
|
|
|
|
TestExecutor(TestExecutionControl& tec, const int initialSeed)
|
|
: tec(tec), initial_seed(initialSeed) {}
|
|
|
|
void run(void) override {
|
|
// Set up a local source of randomness seeds based on the initial seed supplied.
|
|
Gecode::Support::RandomGenerator seed_sequence(initial_seed);
|
|
|
|
// Loop runs tests continuously in batches from the test execution control
|
|
while (true) {
|
|
// Get next batch
|
|
const std::pair<size_t, size_t>& start_and_size = tec.next_batch();
|
|
const size_t batch_start = start_and_size.first;
|
|
const size_t batch_size = start_and_size.second;
|
|
if (batch_start >= tec.tests.size()) {
|
|
// No more tests to run
|
|
break;
|
|
}
|
|
// Run each test in the batch, handling output and failures
|
|
for (size_t i = batch_start; i < batch_start + batch_size && i < tec.tests.size(); ++i) {
|
|
if (!tec.continue_testing()) {
|
|
break;
|
|
}
|
|
auto test = tec.tests[i];
|
|
unsigned int test_seed = seed_sequence.next();
|
|
std::ostringstream test_output;
|
|
if (!run_test(test, test_seed, tec.options, test_output)) {
|
|
tec.set_failure();
|
|
}
|
|
tec.write_output(test_output.str());
|
|
}
|
|
if (!tec.continue_testing()) {
|
|
break;
|
|
}
|
|
}
|
|
|
|
// Signal that this thread is done. Last one signals the waiting main thread.
|
|
tec.thread_done();
|
|
}
|
|
};
|
|
|
|
/// Run all the tests with the supplied options i parallel.
|
|
int run_tests_parallel(const std::vector<Base*>& tests, const Options& options) {
|
|
using namespace Gecode::Support;
|
|
RandomGenerator seed_sequence(options.seed);
|
|
|
|
TestExecutionControl tec(tests, options, opt.threads);
|
|
|
|
for (unsigned int i = 0; i < opt.threads; ++i) {
|
|
Thread::run(new TestExecutor(tec, seed_sequence.next()));
|
|
}
|
|
tec.await_test_runners_completed();
|
|
|
|
return tec.get_result();
|
|
}
|
|
}
|
|
|
|
|
|
int
|
|
main(int argc, char* argv[]) {
|
|
using namespace Test;
|
|
#ifdef GECODE_HAS_MTRACE
|
|
mtrace();
|
|
#endif
|
|
|
|
opt.parse(argc, argv);
|
|
|
|
Base::sort();
|
|
|
|
if (opt.list) {
|
|
for (Base* t = Base::tests() ; t != nullptr; t = t->next() ) {
|
|
std::cout << t->name() << std::endl;
|
|
}
|
|
exit(EXIT_SUCCESS);
|
|
}
|
|
|
|
std::vector<Base*> tests;
|
|
bool started = opt.start_from == nullptr ? true : false;
|
|
for (Base* t = Base::tests() ; t != nullptr; t = t->next() ) {
|
|
if (!started) {
|
|
if (t->name().find(opt.start_from) != std::string::npos) {
|
|
started = true;
|
|
} else {
|
|
continue;
|
|
}
|
|
}
|
|
if (opt.is_test_name_matching(t->name())) {
|
|
tests.emplace_back(t);
|
|
}
|
|
}
|
|
|
|
if (opt.threads > 1) {
|
|
return run_tests_parallel(tests, opt);
|
|
} else {
|
|
return run_tests(tests, opt);
|
|
}
|
|
}
|
|
|
|
std::ostream&
|
|
operator<<(std::ostream& os, const Test::ind& i) {
|
|
for (int j=i.l; j--; )
|
|
os << " ";
|
|
return os;
|
|
}
|
|
|
|
// STATISTICS: test-core
|