GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/statistics.cc
Date: 2026-01-11 02:35:46
Exec Total Coverage
Lines: 158 160 98.8%
Branches: 88 131 67.2%
Line Branch Exec Source
1 /**
2 * This file is part of the CernVM File System.
3 */
4
5 #include "statistics.h"
6
7 #include <algorithm>
8 #include <cassert>
9
10 #include "json_document_write.h"
11 #include "util/concurrency.h"
12 #include "util/platform.h"
13 #include "util/smalloc.h"
14 #include "util/string.h"
15
16 using namespace std; // NOLINT
17
18 #ifdef CVMFS_NAMESPACE_GUARD
19 namespace CVMFS_NAMESPACE_GUARD {
20 #endif
21
22 namespace perf {
23
24 30 std::string Counter::ToString() { return StringifyInt(Get()); }
25 30 std::string Counter::Print() { return StringifyInt(Get()); }
26 30 std::string Counter::PrintK() { return StringifyInt(Get() / 1000); }
27 30 std::string Counter::PrintKi() { return StringifyInt(Get() / 1024); }
28 30 std::string Counter::PrintM() { return StringifyInt(Get() / (1000 * 1000)); }
29 30 std::string Counter::PrintMi() { return StringifyInt(Get() / (1024 * 1024)); }
30 60 std::string Counter::PrintRatio(Counter divider) {
31 60 const double enumerator_value = Get();
32 60 const double divider_value = divider.Get();
33 60 return StringifyDouble(enumerator_value / divider_value);
34 }
35
36
37 //-----------------------------------------------------------------------------
38
39
40 /**
41 * Creates a new Statistics binder which maintains the same Counters as the
42 * existing one. Changes to those counters are visible in both Statistics
43 * objects. The child can then independently add more counters. CounterInfo
44 * objects are reference counted and deleted when all the statistics objects
45 * dealing with it are destroyed.
46 */
47 912 Statistics *Statistics::Fork() {
48
1/2
✓ Branch 1 taken 912 times.
✗ Branch 2 not taken.
 912 Statistics *child = new Statistics();
49
50 912 const MutexLockGuard lock_guard(lock_);
51 1824 for (map<string, CounterInfo *>::iterator i = counters_.begin(),
52 912 iEnd = counters_.end();
53
2/2
✓ Branch 1 taken 35310 times.
✓ Branch 2 taken 912 times.
 36222 i != iEnd;
54 35310 ++i) {
55 35310 atomic_inc32(&i->second->refcnt);
56 }
57
1/2
✓ Branch 1 taken 912 times.
✗ Branch 2 not taken.
 912 child->counters_ = counters_;
58
59 912 return child;
60 912 }
61
62
63 1017 Counter *Statistics::Lookup(const std::string &name) const {
64 1017 const MutexLockGuard lock_guard(lock_);
65
1/2
✓ Branch 1 taken 1017 times.
✗ Branch 2 not taken.
 1017 const map<string, CounterInfo *>::const_iterator i = counters_.find(name);
66
2/2
✓ Branch 2 taken 557 times.
✓ Branch 3 taken 460 times.
 1017 if (i != counters_.end())
67 557 return &i->second->counter;
68 460 return NULL;
69 1017 }
70
71
72 30 string Statistics::LookupDesc(const std::string &name) {
73 30 const MutexLockGuard lock_guard(lock_);
74
1/2
✓ Branch 1 taken 30 times.
✗ Branch 2 not taken.
 30 const map<string, CounterInfo *>::const_iterator i = counters_.find(name);
75
1/2
✓ Branch 3 taken 30 times.
✗ Branch 4 not taken.
 30 if (i != counters_.end())
76
1/2
✓ Branch 2 taken 30 times.
✗ Branch 3 not taken.
 30 return i->second->desc;
77 ✗ return "";
78 30 }
79
80 30 string Statistics::PrintList(const PrintOptions print_options) {
81 30 string result;
82
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 30 times.
 30 if (print_options == kPrintHeader)
83 ✗ result += "Name|Value|Description\n";
84
85 30 const MutexLockGuard lock_guard(lock_);
86 30 for (map<string, CounterInfo *>::const_iterator i = counters_.begin(),
87 30 iEnd = counters_.end();
88
2/2
✓ Branch 1 taken 30 times.
✓ Branch 2 taken 30 times.
 60 i != iEnd;
89 30 ++i) {
90
4/8
✓ Branch 1 taken 30 times.
✗ Branch 2 not taken.
✓ Branch 5 taken 30 times.
✗ Branch 6 not taken.
✓ Branch 8 taken 30 times.
✗ Branch 9 not taken.
✓ Branch 11 taken 30 times.
✗ Branch 12 not taken.
 60 result += i->first + "|" + i->second->counter.ToString() + "|"
91
3/6
✓ Branch 3 taken 30 times.
✗ Branch 4 not taken.
✓ Branch 6 taken 30 times.
✗ Branch 7 not taken.
✓ Branch 9 taken 30 times.
✗ Branch 10 not taken.
 60 + i->second->desc + "\n";
92 }
93 60 return result;
94 30 }
95
96 /**
97 * Converts statistics counters into JSON string in following format
98 * {
99 * "name_major1": {
100 * "counter1": val1,
101 * "counter2": val2
102 * },
103 * "name_major2": {
104 * "counter3": val3
105 * }
106 * }
107 */
108 96 string Statistics::PrintJSON() {
109 96 const MutexLockGuard lock_guard(lock_);
110
111 96 JsonStringGenerator json_statistics;
112
113 // Make use of std::map key ordering and add counters namespace by namespace
114 96 JsonStringGenerator json_statistics_namespace;
115
1/2
✓ Branch 2 taken 96 times.
✗ Branch 3 not taken.
 96 std::string last_namespace = "";
116 96 for (map<string, CounterInfo *>::const_iterator i = counters_.begin(),
117 96 iEnd = counters_.end();
118
2/2
✓ Branch 1 taken 90 times.
✓ Branch 2 taken 96 times.
 186 i != iEnd;
119 90 ++i) {
120
1/2
✓ Branch 2 taken 90 times.
✗ Branch 3 not taken.
 90 std::vector<std::string> tokens = SplitString(i->first, '.');
121
122
2/2
✓ Branch 2 taken 60 times.
✓ Branch 3 taken 30 times.
 90 if (tokens[0] != last_namespace) {
123
3/4
✓ Branch 1 taken 60 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 30 times.
✓ Branch 4 taken 30 times.
 60 if (last_namespace != "") {
124
1/2
✓ Branch 1 taken 30 times.
✗ Branch 2 not taken.
 30 json_statistics.AddJsonObject(
125
1/2
✓ Branch 1 taken 30 times.
✗ Branch 2 not taken.
 60 last_namespace, json_statistics_namespace.GenerateString());
126 }
127 60 json_statistics_namespace.Clear();
128 }
129
130
1/2
✓ Branch 4 taken 90 times.
✗ Branch 5 not taken.
 90 json_statistics_namespace.Add(tokens[1], i->second->counter.Get());
131
132
1/2
✓ Branch 2 taken 90 times.
✗ Branch 3 not taken.
 90 last_namespace = tokens[0];
133 90 }
134
3/4
✓ Branch 1 taken 96 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 30 times.
✓ Branch 4 taken 66 times.
 96 if (last_namespace != "") {
135
1/2
✓ Branch 1 taken 30 times.
✗ Branch 2 not taken.
 30 json_statistics.AddJsonObject(last_namespace,
136
1/2
✓ Branch 1 taken 30 times.
✗ Branch 2 not taken.
 60 json_statistics_namespace.GenerateString());
137 }
138
139
1/2
✓ Branch 1 taken 96 times.
✗ Branch 2 not taken.
 192 return json_statistics.GenerateString();
140 96 }
141
142 /**
143 * Snapshot current state of the counters.
144 * Elements will either be updated or inserted into the map.
145 *
146 * Note: This function does NOT clear previous elements part of the map.
147 *
148 * Returns map of the updated counters and the timestamp of the snapshot.
149 */
150 24 void Statistics::SnapshotCounters(std::map<std::string, int64_t> *counters,
151 uint64_t *timestamp_ns) {
152 24 const MutexLockGuard lock_guard(lock_);
153 24 *timestamp_ns = platform_realtime_ns();
154 24 for (map<string, CounterInfo *>::const_iterator i = counters_.begin(),
155 24 iEnd = counters_.end();
156
2/2
✓ Branch 1 taken 72 times.
✓ Branch 2 taken 24 times.
 96 i != iEnd;
157 72 ++i) {
158 // modify or insert
159
1/2
✓ Branch 4 taken 72 times.
✗ Branch 5 not taken.
 72 (*counters)[i->first] = (*i->second).counter.Get();
160 }
161 24 }
162
163 203091 Counter *Statistics::Register(const string &name, const string &desc) {
164 203091 const MutexLockGuard lock_guard(lock_);
165
2/5
✓ Branch 2 taken 203091 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✓ Branch 6 taken 203091 times.
 203091 assert(counters_.find(name) == counters_.end());
166
2/4
✓ Branch 1 taken 203091 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 203091 times.
✗ Branch 5 not taken.
 203091 CounterInfo *counter_info = new CounterInfo(desc);
167
1/2
✓ Branch 1 taken 203091 times.
✗ Branch 2 not taken.
 203091 counters_[name] = counter_info;
168 203091 return &counter_info->counter;
169 203091 }
170
171
172 7391 Statistics::Statistics() {
173 7391 lock_ = reinterpret_cast<pthread_mutex_t *>(smalloc(sizeof(pthread_mutex_t)));
174 7391 const int retval = pthread_mutex_init(lock_, NULL);
175
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 7391 times.
 7391 assert(retval == 0);
176 7391 }
177
178
179 7381 Statistics::~Statistics() {
180 14762 for (map<string, CounterInfo *>::iterator i = counters_.begin(),
181 7381 iEnd = counters_.end();
182
2/2
✓ Branch 1 taken 238200 times.
✓ Branch 2 taken 7381 times.
 245581 i != iEnd;
183 238200 ++i) {
184 238200 const int32_t old_value = atomic_xadd32(&i->second->refcnt, -1);
185
2/2
✓ Branch 0 taken 202890 times.
✓ Branch 1 taken 35310 times.
 238200 if (old_value == 1)
186
1/2
✓ Branch 1 taken 202890 times.
✗ Branch 2 not taken.
 202890 delete i->second;
187 }
188 7381 pthread_mutex_destroy(lock_);
189 7381 free(lock_);
190 7381 }
191
192
193 //------------------------------------------------------------------------------
194
195
196 /**
197 * If necessary, capacity_s is extended to be a multiple of resolution_s
198 */
199 11270 Recorder::Recorder(uint32_t resolution_s, uint32_t capacity_s)
200 11270 : last_timestamp_(0), capacity_s_(capacity_s), resolution_s_(resolution_s) {
201
2/4
✓ Branch 0 taken 11270 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 11270 times.
✗ Branch 3 not taken.
 11270 assert((resolution_s > 0) && (capacity_s > resolution_s));
202 11270 const bool has_remainder = (capacity_s_ % resolution_s_) != 0;
203
2/2
✓ Branch 0 taken 60 times.
✓ Branch 1 taken 11210 times.
 11270 if (has_remainder) {
204 60 capacity_s_ += resolution_s_ - (capacity_s_ % resolution_s_);
205 }
206 11270 no_bins_ = capacity_s_ / resolution_s_;
207
1/2
✓ Branch 1 taken 11270 times.
✗ Branch 2 not taken.
 11270 bins_.reserve(no_bins_);
208
2/2
✓ Branch 0 taken 904980 times.
✓ Branch 1 taken 11270 times.
 916250 for (unsigned i = 0; i < no_bins_; ++i)
209
1/2
✓ Branch 1 taken 904980 times.
✗ Branch 2 not taken.
 904980 bins_.push_back(0);
210 11270 }
211
212
213 60 void Recorder::Tick() { TickAt(platform_monotonic_time()); }
214
215
216 3966 void Recorder::TickAt(uint64_t timestamp) {
217 3966 const uint64_t bin_abs = timestamp / resolution_s_;
218 3966 const uint64_t last_bin_abs = last_timestamp_ / resolution_s_;
219
220 // timestamp in the past: don't update last_timestamp_
221
2/2
✓ Branch 0 taken 60 times.
✓ Branch 1 taken 3906 times.
 3966 if (bin_abs < last_bin_abs) {
222 // Do we still remember this event?
223
2/2
✓ Branch 0 taken 30 times.
✓ Branch 1 taken 30 times.
 60 if ((last_bin_abs - bin_abs) < no_bins_)
224 30 bins_[bin_abs % no_bins_]++;
225 60 return;
226 }
227
228
2/2
✓ Branch 0 taken 894 times.
✓ Branch 1 taken 3012 times.
 3906 if (last_bin_abs == bin_abs) {
229 894 bins_[bin_abs % no_bins_]++;
230 } else {
231 // When clearing bins between last_timestamp_ and now, avoid cycling the
232 // ring buffer multiple times.
233 6024 const unsigned max_bins_clear = std::min(bin_abs,
234 3012 last_bin_abs + no_bins_ + 1);
235
2/2
✓ Branch 0 taken 66690 times.
✓ Branch 1 taken 3012 times.
 69702 for (uint64_t i = last_bin_abs + 1; i < max_bins_clear; ++i)
236 66690 bins_[i % no_bins_] = 0;
237 3012 bins_[bin_abs % no_bins_] = 1;
238 }
239
240 3906 last_timestamp_ = timestamp;
241 }
242
243
244 642 uint64_t Recorder::GetNoTicks(uint32_t retrospect_s) const {
245 642 const uint64_t now = platform_monotonic_time();
246
2/2
✓ Branch 0 taken 300 times.
✓ Branch 1 taken 342 times.
 642 if (retrospect_s > now)
247 300 retrospect_s = now;
248
249 642 const uint64_t last_bin_abs = last_timestamp_ / resolution_s_;
250 642 const uint64_t past_bin_abs = (now - retrospect_s) / resolution_s_;
251 1284 const int64_t min_bin_abs = std::max(
252 past_bin_abs,
253
2/2
✓ Branch 0 taken 393 times.
✓ Branch 1 taken 249 times.
 642 (last_bin_abs < no_bins_) ? 0 : (last_bin_abs - (no_bins_ - 1)));
254 642 uint64_t result = 0;
255
2/2
✓ Branch 0 taken 4713 times.
✓ Branch 1 taken 642 times.
 5355 for (int64_t i = last_bin_abs; i >= min_bin_abs; --i) {
256 4713 result += bins_[i % no_bins_];
257 }
258
259 642 return result;
260 }
261
262
263 //------------------------------------------------------------------------------
264
265
266 11000 void MultiRecorder::AddRecorder(uint32_t resolution_s, uint32_t capacity_s) {
267
1/2
✓ Branch 2 taken 11000 times.
✗ Branch 3 not taken.
 11000 recorders_.push_back(Recorder(resolution_s, capacity_s));
268 11000 }
269
270
271 252 uint64_t MultiRecorder::GetNoTicks(uint32_t retrospect_s) const {
272 252 const unsigned N = recorders_.size();
273
2/2
✓ Branch 0 taken 282 times.
✓ Branch 1 taken 30 times.
 312 for (unsigned i = 0; i < N; ++i) {
274
6/6
✓ Branch 2 taken 120 times.
✓ Branch 3 taken 162 times.
✓ Branch 4 taken 60 times.
✓ Branch 5 taken 60 times.
✓ Branch 6 taken 222 times.
✓ Branch 7 taken 60 times.
 282 if ((recorders_[i].capacity_s() >= retrospect_s) || (i == (N - 1))) {
275 222 return recorders_[i].GetNoTicks(retrospect_s);
276 }
277 }
278 30 return 0;
279 }
280
281
282 324 void MultiRecorder::Tick() {
283 324 const uint64_t now = platform_monotonic_time();
284
2/2
✓ Branch 1 taken 1116 times.
✓ Branch 2 taken 324 times.
 1440 for (unsigned i = 0; i < recorders_.size(); ++i)
285 1116 recorders_[i].TickAt(now);
286 324 }
287
288
289 600 void MultiRecorder::TickAt(uint64_t timestamp) {
290
2/2
✓ Branch 1 taken 1200 times.
✓ Branch 2 taken 600 times.
 1800 for (unsigned i = 0; i < recorders_.size(); ++i)
291 1200 recorders_[i].TickAt(timestamp);
292 600 }
293
294 } // namespace perf
295
296
297 #ifdef CVMFS_NAMESPACE_GUARD
298 } // namespace CVMFS_NAMESPACE_GUARD
299 #endif
300