/* Minetest Copyright (C) 2013 celeron55, Perttu Ahola This program is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This program 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */ #ifndef PROFILER_HEADER #define PROFILER_HEADER #include "irrlichttypes_bloated.h" #include #include #include #include #include "util/timetaker.h" #include "util/numeric.h" // paging() /* Time profiler */ class Profiler { public: Profiler() { m_mutex.Init(); } void add(const std::string &name, float value) { JMutexAutoLock lock(m_mutex); { /* No average shall have been used; mark add used as -2 */ core::map::Node *n = m_avgcounts.find(name); if(n == NULL) m_avgcounts[name] = -2; else{ if(n->getValue() == -1) n->setValue(-2); assert(n->getValue() == -2); } } { core::map::Node *n = m_data.find(name); if(n == NULL) m_data[name] = value; else n->setValue(n->getValue() + value); } } void avg(const std::string &name, float value) { JMutexAutoLock lock(m_mutex); { core::map::Node *n = m_avgcounts.find(name); if(n == NULL) m_avgcounts[name] = 1; else{ /* No add shall have been used */ assert(n->getValue() != -2); if(n->getValue() <= 0) n->setValue(1); else n->setValue(n->getValue() + 1); } } { core::map::Node *n = m_data.find(name); if(n == NULL) m_data[name] = value; else n->setValue(n->getValue() + value); } } void clear() { JMutexAutoLock lock(m_mutex); for(core::map::Iterator i = m_data.getIterator(); i.atEnd() == false; i++) { i.getNode()->setValue(0); } m_avgcounts.clear(); } void print(std::ostream &o) { printPage(o, 1, 1); } void printPage(std::ostream &o, u32 page, u32 pagecount) { JMutexAutoLock lock(m_mutex); u32 minindex, maxindex; paging(m_data.size(), page, pagecount, minindex, maxindex); for(core::map::Iterator i = m_data.getIterator(); i.atEnd() == false; i++) { if(maxindex == 0) break; maxindex--; if(minindex != 0) { minindex--; continue; } std::string name = i.getNode()->getKey(); int avgcount = 1; core::map::Node *n = m_avgcounts.find(name); if(n){ if(n->getValue() >= 1) avgcount = n->getValue(); } o<<" "<getValue() / avgcount); o< GraphValues; void graphAdd(const std::string &id, float value) { JMutexAutoLock lock(m_mutex); std::map::iterator i = m_graphvalues.find(id); if(i == m_graphvalues.end()) m_graphvalues[id] = value; else i->second += value; } void graphGet(GraphValues &result) { JMutexAutoLock lock(m_mutex); result = m_graphvalues; m_graphvalues.clear(); } private: JMutex m_mutex; core::map m_data; core::map m_avgcounts; std::map m_graphvalues; }; enum ScopeProfilerType{ SPT_ADD, SPT_AVG, SPT_GRAPH_ADD }; class ScopeProfiler { public: ScopeProfiler(Profiler *profiler, const std::string &name, enum ScopeProfilerType type = SPT_ADD): m_profiler(profiler), m_name(name), m_timer(NULL), m_type(type) { if(m_profiler) m_timer = new TimeTaker(m_name.c_str()); } // name is copied ScopeProfiler(Profiler *profiler, const char *name, enum ScopeProfilerType type = SPT_ADD): m_profiler(profiler), m_name(name), m_timer(NULL), m_type(type) { if(m_profiler) m_timer = new TimeTaker(m_name.c_str()); } ~ScopeProfiler() { if(m_timer) { float duration_ms = m_timer->stop(true); float duration = duration_ms / 1000.0; if(m_profiler){ switch(m_type){ case SPT_ADD: m_profiler->add(m_name, duration); break; case SPT_AVG: m_profiler->avg(m_name, duration); break; case SPT_GRAPH_ADD: m_profiler->graphAdd(m_name, duration); break; } } delete m_timer; } } private: Profiler *m_profiler; std::string m_name; TimeTaker *m_timer; enum ScopeProfilerType m_type; }; #endif