X-Git-Url: https://main.carlh.net/gitweb/?p=dcpomatic.git;a=blobdiff_plain;f=src%2Flib%2Ftimer.cc;h=caef89e0e98e5c413539c0851216acde96f6f797;hp=69a7e3aa94b29e4988051f6ca61898d996b94f09;hb=2d4e8c5f69cc694625ad95dcee554499605f823b;hpb=f434d010e13ddf834a552be8833abb6f89767fe8

diff --git a/src/lib/timer.cc b/src/lib/timer.cc
index 69a7e3aa9..caef89e0e 100644
--- a/src/lib/timer.cc
+++ b/src/lib/timer.cc
@@ -1,34 +1,45 @@
 /*
-    Copyright (C) 2012 Carl Hetherington <cth@carlh.net>
+    Copyright (C) 2012-2021 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/>.
 
 */
 
+
 /** @file src/timer.cc
  *  @brief Some timing classes for debugging and profiling.
  */
 
-#include <iostream>
-#include <sys/time.h>
+
+#include "compose.hpp"
 #include "timer.h"
 #include "util.h"
+#include <sys/time.h>
+#include <iostream>
 
 #include "i18n.h"
 
-using namespace std;
+
+using std::cout;
+using std::list;
+using std::max;
+using std::pair;
+using std::string;
+using boost::optional;
+
 
 /** @param n Name to use when giving output */
 PeriodTimer::PeriodTimer (string n)
@@ -37,6 +48,7 @@ PeriodTimer::PeriodTimer (string n)
 	gettimeofday (&_start, 0);
 }
 
+
 /** Destroy PeriodTimer and output the time elapsed since its construction */
 PeriodTimer::~PeriodTimer ()
 {
@@ -45,9 +57,7 @@ PeriodTimer::~PeriodTimer ()
 	cout << N_("T: ") << _name << N_(": ") << (seconds (stop) - seconds (_start)) << N_("\n");
 }
 
-/** @param n Name to use when giving output.
- *  @param s Initial state.
- */
+
 StateTimer::StateTimer (string n, string s)
 	: _name (n)
 {
@@ -57,35 +67,79 @@ StateTimer::StateTimer (string n, string s)
 	_state = s;
 }
 
-/** @param s New state that the caller is in */
+
+StateTimer::StateTimer (string n)
+	: _name (n)
+{
+
+}
+
+
+void
+StateTimer::set (string s)
+{
+	set_internal (s);
+}
+
+
 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>());
+}
+
+
 /** Destroy StateTimer and generate a summary of the state timings on cout */
 StateTimer::~StateTimer ()
 {
-	if (_state.empty ()) {
+	if (!_state) {
 		return;
 	}
 
-	
-	set_state (N_(""));
+	unset ();
+
+	int longest = 0;
+	for (auto const& i: _counts) {
+		longest = max (longest, int(i.first.length()));
+	}
+
+	list<pair<double, string>> sorted;
+
+	for (auto const& i: _counts) {
+		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))));
+	}
+
+	sorted.sort ([](pair<double, string> const& a, pair<double, string> const& b) {
+		return a.first > b.first;
+	});
+
 
 	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 (auto const& i: sorted) {
+		cout << N_("\t") << i.second << "\n";
 	}
 }