GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/statistics.cc
Date: 2025-11-09 02:35:23
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 9 std::string Counter::ToString() { return StringifyInt(Get()); }
25 9 std::string Counter::Print() { return StringifyInt(Get()); }
26 9 std::string Counter::PrintK() { return StringifyInt(Get() / 1000); }
27 9 std::string Counter::PrintKi() { return StringifyInt(Get() / 1024); }
28 9 std::string Counter::PrintM() { return StringifyInt(Get() / (1000 * 1000)); }
29 9 std::string Counter::PrintMi() { return StringifyInt(Get() / (1024 * 1024)); }
30 18 std::string Counter::PrintRatio(Counter divider) {
31 18 const double enumerator_value = Get();
32 18 const double divider_value = divider.Get();
33 18 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 787 Statistics *Statistics::Fork() {
48
1/2
✓ Branch 1 taken 787 times.
✗ Branch 2 not taken.
 787 Statistics *child = new Statistics();
49
50 787 const MutexLockGuard lock_guard(lock_);
51 1574 for (map<string, CounterInfo *>::iterator i = counters_.begin(),
52 787 iEnd = counters_.end();
53
2/2
✓ Branch 1 taken 31129 times.
✓ Branch 2 taken 787 times.
 31916 i != iEnd;
54 31129 ++i) {
55 31129 atomic_inc32(&i->second->refcnt);
56 }
57
1/2
✓ Branch 1 taken 787 times.
✗ Branch 2 not taken.
 787 child->counters_ = counters_;
58
59 787 return child;
60 787 }
61
62
63 431 Counter *Statistics::Lookup(const std::string &name) const {
64 431 const MutexLockGuard lock_guard(lock_);
65
1/2
✓ Branch 1 taken 431 times.
✗ Branch 2 not taken.
 431 const map<string, CounterInfo *>::const_iterator i = counters_.find(name);
66
2/2
✓ Branch 2 taken 232 times.
✓ Branch 3 taken 199 times.
 431 if (i != counters_.end())
67 232 return &i->second->counter;
68 199 return NULL;
69 431 }
70
71
72 9 string Statistics::LookupDesc(const std::string &name) {
73 9 const MutexLockGuard lock_guard(lock_);
74
1/2
✓ Branch 1 taken 9 times.
✗ Branch 2 not taken.
 9 const map<string, CounterInfo *>::const_iterator i = counters_.find(name);
75
1/2
✓ Branch 3 taken 9 times.
✗ Branch 4 not taken.
 9 if (i != counters_.end())
76
1/2
✓ Branch 2 taken 9 times.
✗ Branch 3 not taken.
 9 return i->second->desc;
77 ✗ return "";
78 9 }
79
80 9 string Statistics::PrintList(const PrintOptions print_options) {
81 9 string result;
82
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 9 times.
 9 if (print_options == kPrintHeader)
83 ✗ result += "Name|Value|Description\n";
84
85 9 const MutexLockGuard lock_guard(lock_);
86 9 for (map<string, CounterInfo *>::const_iterator i = counters_.begin(),
87 9 iEnd = counters_.end();
88
2/2
✓ Branch 1 taken 9 times.
✓ Branch 2 taken 9 times.
 18 i != iEnd;
89 9 ++i) {
90
4/8
✓ Branch 1 taken 9 times.
✗ Branch 2 not taken.
✓ Branch 5 taken 9 times.
✗ Branch 6 not taken.
✓ Branch 8 taken 9 times.
✗ Branch 9 not taken.
✓ Branch 11 taken 9 times.
✗ Branch 12 not taken.
 18 result += i->first + "|" + i->second->counter.ToString() + "|"
91
3/6
✓ Branch 3 taken 9 times.
✗ Branch 4 not taken.
✓ Branch 6 taken 9 times.
✗ Branch 7 not taken.
✓ Branch 9 taken 9 times.
✗ Branch 10 not taken.
 18 + i->second->desc + "\n";
92 }
93 18 return result;
94 9 }
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 39 string Statistics::PrintJSON() {
109 39 const MutexLockGuard lock_guard(lock_);
110
111 39 JsonStringGenerator json_statistics;
112
113 // Make use of std::map key ordering and add counters namespace by namespace
114 39 JsonStringGenerator json_statistics_namespace;
115
1/2
✓ Branch 2 taken 39 times.
✗ Branch 3 not taken.
 39 std::string last_namespace = "";
116 39 for (map<string, CounterInfo *>::const_iterator i = counters_.begin(),
117 39 iEnd = counters_.end();
118
2/2
✓ Branch 1 taken 30 times.
✓ Branch 2 taken 39 times.
 69 i != iEnd;
119 30 ++i) {
120
1/2
✓ Branch 2 taken 30 times.
✗ Branch 3 not taken.
 30 std::vector<std::string> tokens = SplitString(i->first, '.');
121
122
2/2
✓ Branch 2 taken 20 times.
✓ Branch 3 taken 10 times.
 30 if (tokens[0] != last_namespace) {
123
3/4
✓ Branch 1 taken 20 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 10 times.
✓ Branch 4 taken 10 times.
 20 if (last_namespace != "") {
124
1/2
✓ Branch 1 taken 10 times.
✗ Branch 2 not taken.
 10 json_statistics.AddJsonObject(
125
1/2
✓ Branch 1 taken 10 times.
✗ Branch 2 not taken.
 20 last_namespace, json_statistics_namespace.GenerateString());
126 }
127 20 json_statistics_namespace.Clear();
128 }
129
130
1/2
✓ Branch 4 taken 30 times.
✗ Branch 5 not taken.
 30 json_statistics_namespace.Add(tokens[1], i->second->counter.Get());
131
132
1/2
✓ Branch 2 taken 30 times.
✗ Branch 3 not taken.
 30 last_namespace = tokens[0];
133 30 }
134
3/4
✓ Branch 1 taken 39 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 10 times.
✓ Branch 4 taken 29 times.
 39 if (last_namespace != "") {
135
1/2
✓ Branch 1 taken 10 times.
✗ Branch 2 not taken.
 10 json_statistics.AddJsonObject(last_namespace,
136
1/2
✓ Branch 1 taken 10 times.
✗ Branch 2 not taken.
 20 json_statistics_namespace.GenerateString());
137 }
138
139
1/2
✓ Branch 1 taken 39 times.
✗ Branch 2 not taken.
 78 return json_statistics.GenerateString();
140 39 }
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 176 void Statistics::SnapshotCounters(std::map<std::string, int64_t> *counters,
151 uint64_t *timestamp_ns) {
152 176 const MutexLockGuard lock_guard(lock_);
153 176 *timestamp_ns = platform_realtime_ns();
154 176 for (map<string, CounterInfo *>::const_iterator i = counters_.begin(),
155 176 iEnd = counters_.end();
156
2/2
✓ Branch 1 taken 528 times.
✓ Branch 2 taken 176 times.
 704 i != iEnd;
157 528 ++i) {
158 // modify or insert
159
1/2
✓ Branch 4 taken 528 times.
✗ Branch 5 not taken.
 528 (*counters)[i->first] = (*i->second).counter.Get();
160 }
161 176 }
162
163 169998 Counter *Statistics::Register(const string &name, const string &desc) {
164 169998 const MutexLockGuard lock_guard(lock_);
165
2/5
✓ Branch 2 taken 169998 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✓ Branch 6 taken 169998 times.
 169998 assert(counters_.find(name) == counters_.end());
166
2/4
✓ Branch 1 taken 169998 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 169998 times.
✗ Branch 5 not taken.
 169998 CounterInfo *counter_info = new CounterInfo(desc);
167
1/2
✓ Branch 1 taken 169998 times.
✗ Branch 2 not taken.
 169998 counters_[name] = counter_info;
168 169998 return &counter_info->counter;
169 169998 }
170
171
172 7509 Statistics::Statistics() {
173 7509 lock_ = reinterpret_cast<pthread_mutex_t *>(smalloc(sizeof(pthread_mutex_t)));
174 7509 const int retval = pthread_mutex_init(lock_, NULL);
175
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 7509 times.
 7509 assert(retval == 0);
176 7509 }
177
178
179 7499 Statistics::~Statistics() {
180 14998 for (map<string, CounterInfo *>::iterator i = counters_.begin(),
181 7499 iEnd = counters_.end();
182
2/2
✓ Branch 1 taken 200926 times.
✓ Branch 2 taken 7499 times.
 208425 i != iEnd;
183 200926 ++i) {
184 200926 const int32_t old_value = atomic_xadd32(&i->second->refcnt, -1);
185
2/2
✓ Branch 0 taken 169797 times.
✓ Branch 1 taken 31129 times.
 200926 if (old_value == 1)
186
1/2
✓ Branch 1 taken 169797 times.
✗ Branch 2 not taken.
 169797 delete i->second;
187 }
188 7499 pthread_mutex_destroy(lock_);
189 7499 free(lock_);
190 7499 }
191
192
193 //------------------------------------------------------------------------------
194
195
196 /**
197 * If necessary, capacity_s is extended to be a multiple of resolution_s
198 */
199 4951 Recorder::Recorder(uint32_t resolution_s, uint32_t capacity_s)
200 4951 : last_timestamp_(0), capacity_s_(capacity_s), resolution_s_(resolution_s) {
201
2/4
✓ Branch 0 taken 4951 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 4951 times.
✗ Branch 3 not taken.
 4951 assert((resolution_s > 0) && (capacity_s > resolution_s));
202 4951 const bool has_remainder = (capacity_s_ % resolution_s_) != 0;
203
2/2
✓ Branch 0 taken 18 times.
✓ Branch 1 taken 4933 times.
 4951 if (has_remainder) {
204 18 capacity_s_ += resolution_s_ - (capacity_s_ % resolution_s_);
205 }
206 4951 no_bins_ = capacity_s_ / resolution_s_;
207
1/2
✓ Branch 1 taken 4951 times.
✗ Branch 2 not taken.
 4951 bins_.reserve(no_bins_);
208
2/2
✓ Branch 0 taken 401019 times.
✓ Branch 1 taken 4951 times.
 405970 for (unsigned i = 0; i < no_bins_; ++i)
209
1/2
✓ Branch 1 taken 401019 times.
✗ Branch 2 not taken.
 401019 bins_.push_back(0);
210 4951 }
211
212
213 18 void Recorder::Tick() { TickAt(platform_monotonic_time()); }
214
215
216 1193 void Recorder::TickAt(uint64_t timestamp) {
217 1193 const uint64_t bin_abs = timestamp / resolution_s_;
218 1193 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 18 times.
✓ Branch 1 taken 1175 times.
 1193 if (bin_abs < last_bin_abs) {
222 // Do we still remember this event?
223
2/2
✓ Branch 0 taken 9 times.
✓ Branch 1 taken 9 times.
 18 if ((last_bin_abs - bin_abs) < no_bins_)
224 9 bins_[bin_abs % no_bins_]++;
225 18 return;
226 }
227
228
2/2
✓ Branch 0 taken 269 times.
✓ Branch 1 taken 906 times.
 1175 if (last_bin_abs == bin_abs) {
229 269 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 1812 const unsigned max_bins_clear = std::min(bin_abs,
234 906 last_bin_abs + no_bins_ + 1);
235
2/2
✓ Branch 0 taken 20205 times.
✓ Branch 1 taken 906 times.
 21111 for (uint64_t i = last_bin_abs + 1; i < max_bins_clear; ++i)
236 20205 bins_[i % no_bins_] = 0;
237 906 bins_[bin_abs % no_bins_] = 1;
238 }
239
240 1175 last_timestamp_ = timestamp;
241 }
242
243
244 193 uint64_t Recorder::GetNoTicks(uint32_t retrospect_s) const {
245 193 const uint64_t now = platform_monotonic_time();
246
2/2
✓ Branch 0 taken 90 times.
✓ Branch 1 taken 103 times.
 193 if (retrospect_s > now)
247 90 retrospect_s = now;
248
249 193 const uint64_t last_bin_abs = last_timestamp_ / resolution_s_;
250 193 const uint64_t past_bin_abs = (now - retrospect_s) / resolution_s_;
251 386 const int64_t min_bin_abs = std::max(
252 past_bin_abs,
253
2/2
✓ Branch 0 taken 118 times.
✓ Branch 1 taken 75 times.
 193 (last_bin_abs < no_bins_) ? 0 : (last_bin_abs - (no_bins_ - 1)));
254 193 uint64_t result = 0;
255
2/2
✓ Branch 0 taken 1420 times.
✓ Branch 1 taken 193 times.
 1613 for (int64_t i = last_bin_abs; i >= min_bin_abs; --i) {
256 1420 result += bins_[i % no_bins_];
257 }
258
259 193 return result;
260 }
261
262
263 //------------------------------------------------------------------------------
264
265
266 4870 void MultiRecorder::AddRecorder(uint32_t resolution_s, uint32_t capacity_s) {
267
1/2
✓ Branch 2 taken 4870 times.
✗ Branch 3 not taken.
 4870 recorders_.push_back(Recorder(resolution_s, capacity_s));
268 4870 }
269
270
271 76 uint64_t MultiRecorder::GetNoTicks(uint32_t retrospect_s) const {
272 76 const unsigned N = recorders_.size();
273
2/2
✓ Branch 0 taken 85 times.
✓ Branch 1 taken 9 times.
 94 for (unsigned i = 0; i < N; ++i) {
274
6/6
✓ Branch 2 taken 36 times.
✓ Branch 3 taken 49 times.
✓ Branch 4 taken 18 times.
✓ Branch 5 taken 18 times.
✓ Branch 6 taken 67 times.
✓ Branch 7 taken 18 times.
 85 if ((recorders_[i].capacity_s() >= retrospect_s) || (i == (N - 1))) {
275 67 return recorders_[i].GetNoTicks(retrospect_s);
276 }
277 }
278 9 return 0;
279 }
280
281
282 98 void MultiRecorder::Tick() {
283 98 const uint64_t now = platform_monotonic_time();
284
2/2
✓ Branch 1 taken 338 times.
✓ Branch 2 taken 98 times.
 436 for (unsigned i = 0; i < recorders_.size(); ++i)
285 338 recorders_[i].TickAt(now);
286 98 }
287
288
289 180 void MultiRecorder::TickAt(uint64_t timestamp) {
290
2/2
✓ Branch 1 taken 360 times.
✓ Branch 2 taken 180 times.
 540 for (unsigned i = 0; i < recorders_.size(); ++i)
291 360 recorders_[i].TickAt(timestamp);
292 180 }
293
294 } // namespace perf
295
296
297 #ifdef CVMFS_NAMESPACE_GUARD
298 } // namespace CVMFS_NAMESPACE_GUARD
299 #endif
300