4 // Fraunhofer Institute for Open Communication Systems (FOKUS)
5 // Competence Center NETwork research (NET), St. Augustin, GERMANY
6 // Stefan Bund <g0dil@berlios.de>
8 // This program is free software; you can redistribute it and/or modify
9 // it under the terms of the GNU General Public License as published by
10 // the Free Software Foundation; either version 2 of the License, or
11 // (at your option) any later version.
13 // This program is distributed in the hope that it will be useful,
14 // but WITHOUT ANY WARRANTY; without even the implied warranty of
15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 // GNU General Public License for more details.
18 // You should have received a copy of the GNU General Public License
19 // along with this program; if not, write to the
20 // Free Software Foundation, Inc.,
21 // 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
24 \brief Statistics non-inline non-template implementation */
26 #include "Statistics.hh"
27 //#include "Statistics.ih"
33 #include <senf/Utils/Format.hh>
34 #include "StatisticsTargets.hh"
36 //#include "Statistics.mpp"
38 ///////////////////////////////cc.p////////////////////////////////////////
40 ///////////////////////////////////////////////////////////////////////////
41 // senf::StatisticsBase
43 prefix_ void senf::StatisticsBase::enter(unsigned n, float min, float avg, float max, float dev)
49 for (unsigned i (0); i < n; ++i)
51 Children::iterator i (children_.begin());
52 Children::iterator const i_end (children_.end());
53 for (; i != i_end; ++i)
54 i->second.enter(n, min_, avg_, max_, dev_);
57 prefix_ senf::Collector & senf::StatisticsBase::operator[](unsigned rank)
59 Children::iterator i (children_.find(rank));
60 if (i == children_.end())
61 throw InvalidRankException();
65 prefix_ senf::Collector & senf::StatisticsBase::collect(unsigned rank)
67 std::pair<Children::iterator, bool> state (
68 children_.insert(std::make_pair(rank, Collector(this, rank))) );
70 throw DuplicateRankException();
71 return state.first->second;
74 prefix_ senf::StatisticsBase::OutputProxy<senf::StatisticsBase>
75 senf::StatisticsBase::output(unsigned n)
77 OutputMap::iterator i (outputs_.find(n));
78 if (i == outputs_.end()) {
79 i = outputs_.insert(std::make_pair(n, OutputEntry(n))).first;
81 nm << "output" << path() << ":" << n;
82 base().dir.node().add(nm.str(), i->second.dir);
83 detail::StatisticsLoggerRegistry::instance().apply(*this, n, i->second.dir);
87 return OutputProxy<StatisticsBase>(this, &(i->second));
90 prefix_ void senf::StatisticsBase::consoleList(unsigned level, std::ostream & os)
93 namespace fmt = senf::format;
95 os << boost::format("%s%-5d%|15t| %12.5g %19.5g %12.5g\n")
96 % std::string(2*level,' ') % rank()
97 % fmt::eng(min()).setw() % fmt::eng(avg(),dev()).setw() % fmt::eng(max()).setw();
99 OutputMap::const_iterator i (outputs_.begin());
100 OutputMap::const_iterator i_end (outputs_.end());
101 for (; i != i_end; ++i)
102 os << boost::format(" %3d %12.5g %19.5g %12.5g\n")
104 % fmt::eng(i->second.min).setw()
105 % fmt::eng(i->second.avg, i->second.dev).setw()
106 % fmt::eng(i->second.max).setw();
109 Children::const_iterator i (children_.begin());
110 Children::const_iterator const i_end (children_.end());
111 for (; i != i_end; ++i)
112 i->second.consoleList(level+1, os);
116 prefix_ void senf::StatisticsBase::generateOutput()
118 queue_.push_front(QueueEntry(min_, avg_, max_, dev_));
119 while (queue_.size() > maxQueueLen_)
122 OutputMap::iterator i (outputs_.begin());
123 OutputMap::iterator const i_end (outputs_.end());
124 for (; i != i_end; ++i) {
125 i->second.min = i->second.avg = i->second.max = i->second.dev = 0.0f;
126 Queue::const_iterator j (queue_.begin());
127 Queue::const_iterator const j_end (queue_.end());
129 for (; n < i->second.n && j != j_end; ++n, ++j) {
130 i->second.min += j->min;
131 i->second.avg += j->avg;
132 i->second.max += j->max;
133 i->second.dev += j->dev;
139 i->second.signal(i->second.min, i->second.avg, i->second.max, i->second.dev);
143 ///////////////////////////////////////////////////////////////////////////
146 prefix_ senf::Statistics::Statistics()
147 #ifndef SENF_DISABLE_CONSOLE
151 #ifndef SENF_DISABLE_CONSOLE
152 namespace fty = senf::console::factory;
154 dir.add("list", fty::Command(&Statistics::consoleList, this)
155 .doc("List statistics collection intervals and current values.\n"
158 " RANK Number of values collected. Since the statistics collectors form\n"
159 " a tree, the value is indented according to it's tree location.\n"
160 " WIN Size of output average window.\n"
161 " MIN Last entered minimum value.\n"
162 " AVG Last entered average value.\n"
163 " DEV Standard deviation of average value over the collector rank.\n"
164 " MAX Last entered maximum value.") );
165 dir.add("collect", fty::Command(&Statistics::consoleCollect, this)
166 .doc("Add statistics collection groups. The argument gives a sequence of collector\n"
167 "ranks each building on the preceding collector:\n"
169 " $ collect (10 60 60)\n"
171 "Will start by collecting every 10 values together to a new value. 60 of such\n"
172 "combined values will be collected together in the next step again followed by\n"
173 "a collection of 60 values. If the statistics is entered with a frequency of\n"
174 "10 values per second, this will provide combined statistics over the second,\n"
175 "minutes and hours ranges.\n"
177 "You may call collect multiple times. Any missing collection ranks will be\n"
179 .arg("ranks","chain of collector ranks") );
180 dir.add("output", fty::Command(&Statistics::consoleOutput, this)
181 .doc("Generate statistics output. This statement will add an additional output\n"
182 "generator. This generator will be attached to the collector specified by\n"
183 "the {rank} parameter. This parameter is a chain of successive rank values\n"
184 "which specifies the exact collector to use. If the collector does not\n"
185 "exist, it will be created (this is like automatically calling 'collect'\n"
186 "with {rank} as argument).\n"
188 "If the output is to be sent somewhere it must be connected to a statistics\n"
191 "The output may optionally be built using a sliding average over the last\n"
196 "will output the basic statistics value each time a new value is entered.\n"
198 " $ output (10 60) 5\n"
200 "Assuming that new data values are entered 10 times per second, this command\n"
201 "will generate output once every minute. The value will be the average over\n"
202 "the last 5 minutes.")
203 .arg("rank","Rank chain selecting the value to generate output for")
204 .arg("window","Optional size of sliding average window",
205 senf::console::kw::default_value = 1u) );
209 prefix_ void senf::Statistics::consoleList(std::ostream & os)
211 os << "RANK WIN MIN AVG MAX\n";
212 StatisticsBase::consoleList(0, os);
215 prefix_ void senf::Statistics::consoleCollect(std::vector<unsigned> & ranks)
217 StatisticsBase * stats (this);
218 std::vector<unsigned>::const_iterator i (ranks.begin());
219 std::vector<unsigned>::const_iterator const i_end (ranks.end());
222 for (; i != i_end; ++i)
223 stats = &(*stats)[*i];
225 catch (InvalidRankException &) {}
227 for (; i != i_end; ++i)
228 stats = & (stats->collect(*i));
232 prefix_ boost::shared_ptr<senf::console::DirectoryNode>
233 senf::Statistics::consoleOutput(std::vector<unsigned> & ranks, unsigned window)
235 StatisticsBase * stats (this);
236 std::vector<unsigned>::const_iterator i (ranks.begin());
237 std::vector<unsigned>::const_iterator const i_end (ranks.end());
240 for (; i != i_end; ++i)
241 stats = &(*stats)[*i];
243 catch (InvalidRankException &) {}
245 for (; i != i_end; ++i)
246 stats = & (stats->collect(*i));
248 return stats->output(window).dir().node().thisptr();
251 prefix_ senf::Statistics & senf::Statistics::v_base()
256 prefix_ std::string senf::Statistics::v_path()
262 ///////////////////////////////////////////////////////////////////////////
265 prefix_ void senf::Collector::enter(unsigned n, float min, float avg, float max, float dev)
267 if (min < accMin_) accMin_ = min;
268 if (max > accMax_) accMax_ = max;
270 if (i_ + n >= rank_) {
271 accSum_ += (rank_-i_)*avg;
272 accSumSq_ += (rank_-i_)*(rank_-i_)*(avg*avg + dev*dev);
273 float accAvg (accSum_ / rank_);
274 float accDev (std::sqrt(std::max(0.0f,accSumSq_ / rank_ - accAvg*accAvg)));
275 StatisticsBase::enter(1, accMin_, accAvg, accMax_, accDev);
284 std::div_t d (std::div(int(n), int(rank_)));
285 StatisticsBase::enter(d.quot, min, avg, max, dev);
292 accSumSq_ += n*n*(avg*avg+dev*dev);
294 if (min < accMin_) accMin_ = min;
295 if (max > accMax_) accMax_ = max;
299 prefix_ senf::Statistics & senf::Collector::v_base()
301 return owner_->base();
304 prefix_ std::string senf::Collector::v_path()
307 return owner_->path() + "-" + senf::str(rank_);
310 ///////////////////////////////cc.e////////////////////////////////////////
312 //#include "Statistics.mpp"
318 // comment-column: 40
319 // c-file-style: "senf"
320 // indent-tabs-mode: nil
321 // ispell-local-dictionary: "american"
322 // compile-command: "scons -u test"