GCC Code Coverage Report

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