Newer
Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
// $Id$
//
// Copyright (C) 2008
// Fraunhofer Institute for Open Communication Systems (FOKUS)
// Competence Center NETwork research (NET), St. Augustin, GERMANY
// Stefan Bund <g0dil@berlios.de>
//
// This program 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,
// 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.,
// 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
/** \file
\brief Statistics non-inline non-template implementation */
#include "Statistics.hh"
//#include "Statistics.ih"
// Custom includes
#include <sstream>
#include "Console/Console.hh"
#include "StatisticsTargets.hh"
//#include "Statistics.mpp"
#define prefix_
///////////////////////////////cc.p////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////
// senf::StatisticsBase
prefix_ void senf::StatisticsBase::enter(float min, float avg, float max)
{
min_ = min;
avg_ = avg;
max_ = max;
generateOutput();
signalChildren();
}
prefix_ senf::Collector & senf::StatisticsBase::operator[](unsigned rank)
{
Children::iterator i (children_.find(rank));
if (i == children_.end())
throw InvalidRankException();
return i->second;
}
prefix_ senf::Collector & senf::StatisticsBase::collect(unsigned rank)
{
std::pair<Children::iterator, bool> state (
children_.insert(std::make_pair(rank, Collector(this, rank))) );
if (! state.second)
throw DuplicateRankException();
return state.first->second;
}
prefix_ senf::StatisticsBase::OutputProxy<senf::StatisticsBase>
senf::StatisticsBase::output(unsigned n)
{
OutputMap::iterator i (outputs_.find(n));
if (i == outputs_.end()) {
i = outputs_.insert(std::make_pair(n, OutputEntry(n))).first;
std::stringstream nm;
nm << "output" << path() << ":" << n;
base().dir.node().add(nm.str(), i->second.dir);
detail::StatisticsLoggerRegistry::instance().apply(*this, n, i->second.dir);
}
if (n > maxQueueLen_)
maxQueueLen_ = n;
return OutputProxy<StatisticsBase>(this, &(i->second));
}
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
//
// generate an engineering style notation i
//
char *format_eng( float f)
{
static buf[16];
if( f > 0){
int n = 0;
while( f > 1000.0f){
f /= 1000.f;
n+=3;
}
sprintf( buf, " %3.2fe%03d", f, n);
}
else if( f < 0){
int n = 0;
while( f < 1000.0f){
f *= 1000.f;
n+=3;
}
sprintf( buf, "-%3.2fe%03d", f, n);
}
else{
sprintf( buf, " 0.00");
}
return buf;
}
prefix_ void senf::StatisticsBase::consoleList(unsigned level, std::ostream & os)
const
{
os << boost::format("%s%-5d%|15t| %12g %12g %12g\n")
% std::string(2*level,' ') % rank() % min() % avg() % max();
{
OutputMap::const_iterator i (outputs_.begin());
OutputMap::const_iterator i_end (outputs_.end());
for (; i != i_end; ++i)
os << boost::format(" %3d %12s %12s %12s\n")
% format_eng(i->second.min/i->second.n)
% format_eng(i->second.avg/i->second.n)
% format_eng(i->second.max/i->second.n);
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
}
{
Children::const_iterator i (children_.begin());
Children::const_iterator const i_end (children_.end());
for (; i != i_end; ++i)
i->second.consoleList(level+1, os);
}
}
prefix_ void senf::StatisticsBase::generateOutput()
{
queue_.push_front(QueueEntry(min_, avg_, max_));
while (queue_.size() > maxQueueLen_)
queue_.pop_back();
OutputMap::iterator i (outputs_.begin());
OutputMap::iterator const i_end (outputs_.end());
for (; i != i_end; ++i) {
i->second.min = i->second.avg = i->second.max = 0.0f;
Queue::const_iterator j (queue_.begin());
Queue::const_iterator const j_end (queue_.end());
unsigned n (0);
for (; n < i->second.n && j != j_end; ++n, ++j) {
i->second.min += j->min;
i->second.avg += j->avg;
i->second.max += j->max;
}
i->second.signal(i->second.min/n, i->second.avg/n, i->second.max/n);
}
}
prefix_ void senf::StatisticsBase::signalChildren()
{
Children::iterator i (children_.begin());
Children::iterator const i_end (children_.end());
for (; i != i_end; ++i)
i->second.enter(min_, avg_, max_);
}
///////////////////////////////////////////////////////////////////////////
// senf::Statistics
prefix_ senf::Statistics::Statistics()
#ifndef SENF_DISABLE_CONSOLE
: dir (this)
#endif
{
#ifndef SENF_DISABLE_CONSOLE
dir.add("list", &Statistics::consoleList)
.doc("List statistics collection intervals and current values.\n"
"\n"
"Columns:\n"
" RANK Number of values collected. Since the statistics collectors form\n"
" a tree, the value is indented according to it's tree location.\n"
" WIN Size of output average window.\n"
" MIN Last entered minimum value.\n"
" AVG Last entered average value.\n"
" MAX Last entered maximum value.");
dir.add("collect", &Statistics::consoleCollect)
.doc("Add statistics collection groups. The argument gives a sequence of collector\n"
"ranks each building on the preceding collector:\n"
"\n"
" $ collect (10 60 60)\n"
"\n"
"Will start by collecting every 10 values together to a new value. 60 of such\n"
"combined values will be collected together in the next step again followed by\n"
"a collection of 60 values. If the statistics is entered with a frequency of\n"
"10 values per second, this will provide combined statistics over the second,\n"
"minutes and hours ranges.\n"
"\n"
"You may call collect multiple times. Any missing collection ranks will be\n"
"added.")
.arg("ranks","chain of collector ranks");
dir.add("output", &Statistics::consoleOutput)
.doc("Generate statistics output. This statement will add an additional output\n"
"generator. This generator will be attached to the collector specified by\n"
"the {rank} parameter. This parameter is a chain of successive rank values\n"
"which specifies the exact collector to use. If the collector does not\n"
"exist, it will be created (this is like automatically calling 'collect'\n"
"with {rank} as argument).\n"
"\n"
"If the output is to be sent somewhere it must be connected to a statistics\n"
"target.\n"
"\n"
"The output may optionally be built using a sliding average over the last\n"
"{window} values.\n"
"\n"
" $ output ()\n"
"\n"
"will output the basic statistics value each time a new value is entered.\n"
"\n"
" $ output (10 60) 5\n"
"\n"
"Assuming that new data values are entered 10 times per second, this command\n"
"will generate output once every minute. The value will be the average over\n"
"the last 5 minutes.")
.arg("rank","Rank chain selecting the value to generate output for")
.arg("window","Optional size of sliding average window",
senf::console::kw::default_value = 1u);
#endif
}
prefix_ void senf::Statistics::consoleList(std::ostream & os)
{
os << "RANK WIN MIN AVG MAX\n";
StatisticsBase::consoleList(0, os);
}
prefix_ void senf::Statistics::consoleCollect(std::vector<unsigned> & ranks)
{
StatisticsBase * stats (this);
std::vector<unsigned>::const_iterator i (ranks.begin());
std::vector<unsigned>::const_iterator const i_end (ranks.end());
try {
for (; i != i_end; ++i)
stats = &(*stats)[*i];
}
catch (InvalidRankException &) {}
for (; i != i_end; ++i)
stats = & (stats->collect(*i));
}
prefix_ boost::shared_ptr<senf::console::DirectoryNode>
senf::Statistics::consoleOutput(std::vector<unsigned> & ranks, unsigned window)
{
StatisticsBase * stats (this);
std::vector<unsigned>::const_iterator i (ranks.begin());
std::vector<unsigned>::const_iterator const i_end (ranks.end());
try {
for (; i != i_end; ++i)
stats = &(*stats)[*i];
}
catch (InvalidRankException &) {}
for (; i != i_end; ++i)
stats = & (stats->collect(*i));
return stats->output(window).dir().node().thisptr();
}
prefix_ senf::Statistics & senf::Statistics::v_base()
{
return *this;
}
prefix_ std::string senf::Statistics::v_path()
const
{
return "";
}
///////////////////////////////////////////////////////////////////////////
// senf::Collector
prefix_ void senf::Collector::enter(float min, float avg, float max)
{
accAvg_ += avg;
if (min < accMin_) accMin_ = min;
if (max > accMax_) accMax_ = max;
if (++i_ >= rank_) {
StatisticsBase::enter(accMin_, accAvg_ / rank_, accMax_);
i_ = 0;
accMin_ = FLT_MAX;
accAvg_ = 0.0f;
accMax_ = -FLT_MAX;
}
}
prefix_ senf::Statistics & senf::Collector::v_base()
{
return owner_->base();
}
prefix_ std::string senf::Collector::v_path()
const
{
return owner_->path() + "-" + senf::str(rank_);
}
///////////////////////////////cc.e////////////////////////////////////////
#undef prefix_
//#include "Statistics.mpp"
// Local Variables:
// mode: c++
// fill-column: 100
// comment-column: 40
// c-file-style: "senf"
// indent-tabs-mode: nil
// ispell-local-dictionary: "american"
// compile-command: "scons -u test"
// End: