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 <senf/Utils/Console/STLSupport.hh>
35 #include "StatisticsTargets.hh"
37 //#include "Statistics.mpp"
39 //-/////////////////////////////////////////////////////////////////////////////////////////////////
41 //-/////////////////////////////////////////////////////////////////////////////////////////////////
42 // senf::StatisticsBase
44 prefix_ void senf::StatisticsBase::enter(unsigned n, float min, float avg, float max, float dev)
50 for (unsigned i (0); i < n; ++i)
52 Children::iterator i (children_.begin());
53 Children::iterator const i_end (children_.end());
54 for (; i != i_end; ++i)
55 i->second.enter(n, min_, avg_, max_, dev_);
58 prefix_ senf::Collector & senf::StatisticsBase::operator[](unsigned rank)
60 Children::iterator i (children_.find(rank));
61 if (i == children_.end())
62 throw InvalidRankException();
66 prefix_ senf::Collector const & senf::StatisticsBase::operator[](unsigned rank)
69 Children::const_iterator i (children_.find(rank));
70 if (i == children_.end())
71 throw InvalidRankException();
75 prefix_ senf::Collector & senf::StatisticsBase::collect(unsigned rank)
77 std::pair<Children::iterator, bool> state (
78 children_.insert(std::make_pair(rank, Collector(this, rank))) );
80 throw DuplicateRankException();
81 return state.first->second;
84 prefix_ senf::StatisticsBase::OutputProxy<senf::StatisticsBase>
85 senf::StatisticsBase::output(unsigned n)
87 OutputMap::iterator i (outputs_.find(n));
88 if (i == outputs_.end()) {
89 i = outputs_.insert(std::make_pair(n, OutputEntry(n))).first;
91 nm << "output" << path() << ":" << n;
92 base().dir.node().add(nm.str(), i->second.dir);
93 detail::StatisticsLoggerRegistry::instance().apply(*this, n, i->second.dir);
97 return OutputProxy<StatisticsBase>(this, &(i->second));
100 prefix_ void senf::StatisticsBase::consoleList(unsigned level, std::ostream & os)
103 namespace fmt = senf::format;
105 os << boost::format("%s%-5d%|15t| %12.5g %19.5g %12.5g\n")
106 % std::string(2*level,' ') % rank()
107 % fmt::eng(min()).setw() % fmt::eng(avg(),dev()).setw() % fmt::eng(max()).setw();
109 OutputMap::const_iterator i (outputs_.begin());
110 OutputMap::const_iterator i_end (outputs_.end());
111 for (; i != i_end; ++i)
112 os << boost::format(" %3d %12.5g %19.5g %12.5g\n")
114 % fmt::eng(i->second.min).setw()
115 % fmt::eng(i->second.avg, i->second.dev).setw()
116 % fmt::eng(i->second.max).setw();
119 Children::const_iterator i (children_.begin());
120 Children::const_iterator const i_end (children_.end());
121 for (; i != i_end; ++i)
122 i->second.consoleList(level+1, os);
126 prefix_ void senf::StatisticsBase::generateOutput()
128 queue_.push_front(QueueEntry(min_, avg_, max_, dev_));
129 while (queue_.size() > maxQueueLen_)
132 OutputMap::iterator i (outputs_.begin());
133 OutputMap::iterator const i_end (outputs_.end());
134 for (; i != i_end; ++i) {
135 i->second.min = i->second.avg = i->second.max = i->second.dev = 0.0f;
136 Queue::const_iterator j (queue_.begin());
137 Queue::const_iterator const j_end (queue_.end());
139 for (; n < i->second.n && j != j_end; ++n, ++j) {
140 i->second.min += j->min;
141 i->second.avg += j->avg;
142 i->second.max += j->max;
143 i->second.dev += j->dev;
149 i->second.signal(i->second.min, i->second.avg, i->second.max, i->second.dev);
153 //-/////////////////////////////////////////////////////////////////////////////////////////////////
154 // senf::StatisticsBase::OutputEntry
156 prefix_ void senf::StatisticsBase::OutputEntry::consoleList(std::ostream & os)
158 for (boost::ptr_vector<TargetBase>::iterator i (targets_.begin());
159 i != targets_.end(); ++i)
160 if (! i->label.empty())
161 os << i->label << "\n";
164 //-/////////////////////////////////////////////////////////////////////////////////////////////////
167 prefix_ senf::Statistics::Statistics()
168 #ifndef SENF_DISABLE_CONSOLE
172 #ifndef SENF_DISABLE_CONSOLE
173 namespace fty = console::factory;
175 dir.add("list", fty::Command(&Statistics::consoleList, this)
176 .doc("List statistics collection intervals and current values.\n"
179 " RANK Number of values collected. Since the statistics collectors form\n"
180 " a tree, the value is indented according to it's tree location.\n"
181 " WIN Size of output average window.\n"
182 " MIN Last entered minimum value.\n"
183 " AVG Last entered average value.\n"
184 " DEV Standard deviation of average value over the collector rank.\n"
185 " MAX Last entered maximum value.") );
186 dir.add("collect", fty::Command(&Statistics::consoleCollect, this)
187 .doc("Add statistics collection groups. The argument gives a sequence of collector\n"
188 "ranks each building on the preceding collector:\n"
190 " $ collect (10 60 60)\n"
192 "Will start by collecting every 10 values together to a new value. 60 of such\n"
193 "combined values will be collected together in the next step again followed by\n"
194 "a collection of 60 values. If the statistics is entered with a frequency of\n"
195 "10 values per second, this will provide combined statistics over the second,\n"
196 "minutes and hours ranges.\n"
198 "You may call collect multiple times. Any missing collection ranks will be\n"
200 .arg("ranks","chain of collector ranks") );
201 dir.add("output", fty::Command(&Statistics::consoleOutput, this)
202 .doc("Generate statistics output. This statement will add an additional output\n"
203 "generator. This generator will be attached to the collector specified by\n"
204 "the {rank} parameter. This parameter is a chain of successive rank values\n"
205 "which specifies the exact collector to use. If the collector does not\n"
206 "exist, it will be created (this is like automatically calling 'collect'\n"
207 "with {rank} as argument).\n"
209 "If the output is to be sent somewhere it must be connected to a statistics\n"
212 "The output may optionally be built using a sliding average over the last\n"
217 "will output the basic statistics value each time a new value is entered.\n"
219 " $ output (10 60) 5\n"
221 "Assuming that new data values are entered 10 times per second, this command\n"
222 "will generate output once every minute. The value will be the average over\n"
223 "the last 5 minutes.")
224 .arg("rank","Rank chain selecting the value to generate output for")
225 .arg("window","Optional size of sliding average window",
226 console::kw::default_value = 1u) );
230 prefix_ void senf::Statistics::consoleList(std::ostream & os)
232 os << "RANK WIN MIN AVG MAX\n";
233 StatisticsBase::consoleList(0, os);
236 prefix_ void senf::Statistics::consoleCollect(std::vector<unsigned> & ranks)
238 StatisticsBase * stats (this);
239 std::vector<unsigned>::const_iterator i (ranks.begin());
240 std::vector<unsigned>::const_iterator const i_end (ranks.end());
243 for (; i != i_end; ++i)
244 stats = &(*stats)[*i];
246 catch (InvalidRankException &) {}
248 for (; i != i_end; ++i)
249 stats = & (stats->collect(*i));
253 prefix_ boost::shared_ptr<senf::console::DirectoryNode>
254 senf::Statistics::consoleOutput(std::vector<unsigned> & ranks, unsigned window)
256 StatisticsBase * stats (this);
257 std::vector<unsigned>::const_iterator i (ranks.begin());
258 std::vector<unsigned>::const_iterator const i_end (ranks.end());
261 for (; i != i_end; ++i)
262 stats = &(*stats)[*i];
264 catch (InvalidRankException &) {}
266 for (; i != i_end; ++i)
267 stats = & (stats->collect(*i));
269 return stats->output(window).dir().node().thisptr();
272 prefix_ senf::Statistics & senf::Statistics::v_base()
277 prefix_ std::string senf::Statistics::v_path()
283 //-/////////////////////////////////////////////////////////////////////////////////////////////////
286 prefix_ void senf::Collector::enter(unsigned n, float min, float avg, float max, float dev)
288 if (min < accMin_) accMin_ = min;
289 if (max > accMax_) accMax_ = max;
291 if (i_ + n >= rank_) {
292 accSum_ += (rank_-i_)*avg;
293 accSumSq_ += (rank_-i_)*(rank_-i_)*(avg*avg + dev*dev);
294 float accAvg (accSum_ / rank_);
295 float accDev (std::sqrt(std::max(0.0f,accSumSq_ / rank_ - accAvg*accAvg)));
296 StatisticsBase::enter(1, accMin_, accAvg, accMax_, accDev);
305 std::div_t d (std::div(int(n), int(rank_)));
306 StatisticsBase::enter(d.quot, min, avg, max, dev);
313 accSumSq_ += n*n*(avg*avg+dev*dev);
315 if (min < accMin_) accMin_ = min;
316 if (max > accMax_) accMax_ = max;
320 prefix_ senf::Statistics & senf::Collector::v_base()
322 return owner_->base();
325 prefix_ std::string senf::Collector::v_path()
328 return owner_->path() + "-" + senf::str(rank_);
331 //-/////////////////////////////////////////////////////////////////////////////////////////////////
333 //#include "Statistics.mpp"
339 // comment-column: 40
340 // c-file-style: "senf"
341 // indent-tabs-mode: nil
342 // ispell-local-dictionary: "american"
343 // compile-command: "scons -u test"