/* Copyright (C) 2015-2019 Carl Hetherington This file is part of libdcp. libdcp is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. libdcp is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with libdcp. If not, see . In addition, as a special exception, the copyright holders give permission to link the code of portions of this program with the OpenSSL library under certain conditions as described in each individual source file, and distribute linked combinations including the two. You must obey the GNU General Public License in all respects for all of the code used other than OpenSSL. If you modify file(s) with this exception, you may extend this exception to your version of the file(s), but you are not obligated to do so. If you do not wish to do so, delete this exception statement from your version. If you delete this exception statement from all source files in the program, then also delete it here. */ #include "j2k_transcode.h" #include #include #include #include #include using std::cout; using std::cerr; using std::fixed; using std::make_shared; using std::setprecision; using std::vector; class Timer { public: Timer() { gettimeofday(&_start, 0); } float get() { struct timeval now; gettimeofday(&now, 0); return (now.tv_sec + now.tv_usec / 1e6) - (_start.tv_sec + _start.tv_usec / 1e6); } private: struct timeval _start; }; /** Test how fast J2K decodes can be cancelled */ int main(int argc, char* argv[]) { if (argc < 2) { cerr << "Syntax: " << argv[0] << " private-test-path\n"; exit(EXIT_FAILURE); } int const trials = 512; int const max_sleep_ms = 200; dcp::ArrayData j2k(boost::filesystem::path(argv[1]) / "thx.j2c"); float minimum = FLT_MAX; float maximum = 0; float total = 0; vector histo(25); for (int i = 0; i < trials; ++i) { auto cancel = make_shared(); boost::thread thread([&]() { try { dcp::decompress_j2k(j2k, 0, cancel); } catch (...) {} }); usleep((rand() % max_sleep_ms) * 1000); Timer timer; cancel->cancel(); thread.join(); auto time = timer.get(); minimum = std::min(minimum, time); maximum = std::max(maximum, time); total += time; int const ms = time * 1000; if (ms < static_cast(histo.size())) { histo[ms]++; } } cout << fixed << setprecision(3) << "min: " << minimum << "\n"; cout << fixed << setprecision(3) << "max: " << maximum << "\n"; cout << fixed << setprecision(3) << "ave: " << (total / trials) << "\n"; for (auto i = 0U; i < histo.size(); ++i) { std::cout << i << ": " << histo[i] << "\n"; } return 0; }