/*
- Copyright (C) 2012 Carl Hetherington <cth@carlh.net>
+ Copyright (C) 2012-2019 Carl Hetherington <cth@carlh.net>
- This program is free software; you can redistribute it and/or modify
+ This file is part of DCP-o-matic.
+
+ DCP-o-matic 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.
- This program is distributed in the hope that it will be useful,
+ DCP-o-matic 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 this program; if not, write to the Free Software
- Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ along with DCP-o-matic. If not, see <http://www.gnu.org/licenses/>.
*/
* @brief Some timing classes for debugging and profiling.
*/
-#include <iostream>
-#include <sys/time.h>
#include "timer.h"
#include "util.h"
+#include "compose.hpp"
+#include <iostream>
+#include <sys/time.h>
#include "i18n.h"
using namespace std;
+using boost::optional;
/** @param n Name to use when giving output */
PeriodTimer::PeriodTimer (string n)
_state = s;
}
+StateTimer::StateTimer (string n)
+ : _name (n)
+{
+
+}
+
+void
+StateTimer::set (string s)
+{
+ set_internal (s);
+}
+
/** @param s New state that the caller is in */
void
-StateTimer::set_state (string s)
+StateTimer::set_internal (optional<string> s)
{
double const last = _time;
struct timeval t;
gettimeofday (&t, 0);
_time = seconds (t);
- if (_totals.find (s) == _totals.end ()) {
- _totals[s] = 0;
+ if (s && _counts.find(*s) == _counts.end()) {
+ _counts[*s] = Counts();
}
- _totals[_state] += _time - last;
+ if (_state) {
+ _counts[*_state].total_time += _time - last;
+ _counts[*_state].number++;
+ }
_state = s;
}
+void
+StateTimer::unset ()
+{
+ set_internal (optional<string>());
+}
+
+bool compare (pair<double, string> a, pair<double, string> b)
+{
+ return a.first > b.first;
+}
+
/** Destroy StateTimer and generate a summary of the state timings on cout */
StateTimer::~StateTimer ()
{
- if (_state.empty ()) {
+ if (!_state) {
return;
}
+ unset ();
+
+ int longest = 0;
+ for (map<string, Counts>::iterator i = _counts.begin(); i != _counts.end(); ++i) {
+ longest = max (longest, int(i->first.length()));
+ }
+
+ list<pair<double, string> > sorted;
+
+ for (map<string, Counts>::iterator i = _counts.begin(); i != _counts.end(); ++i) {
+ string name = i->first + string(longest + 1 - i->first.size(), ' ');
+ char buffer[64];
+ snprintf (buffer, 64, "%.4f", i->second.total_time);
+ string total_time (buffer);
+ sorted.push_back (make_pair(i->second.total_time, String::compose("\t%1%2 %3 %4", name, total_time, i->second.number, (i->second.total_time / i->second.number))));
+ }
- set_state (N_(""));
+ sorted.sort (compare);
cout << _name << N_(":\n");
- for (map<string, double>::iterator i = _totals.begin(); i != _totals.end(); ++i) {
- cout << N_("\t") << i->first << " " << i->second << N_("\n");
+ for (list<pair<double, string> >::iterator i = sorted.begin(); i != sorted.end(); ++i) {
+ cout << N_("\t") << i->second << "\n";
}
}