GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/util/string.cc
Date: 2026-04-26 02:35:59
Exec Total Coverage
Lines: 319 332 96.1%
Branches: 273 392 69.6%
Line Branch Exec Source
1 /**
2 * This file is part of the CernVM File System.
3 *
4 * Some common functions.
5 */
6
7 #ifndef __STDC_FORMAT_MACROS
8 // NOLINTNEXTLINE
9 #define __STDC_FORMAT_MACROS
10 #endif
11
12 #include "string.h"
13
14 #include <cctype>
15 #include <cstdio>
16 #include <cstdlib>
17 #include <cstring>
18 #include <ctime>
19 #include <algorithm>
20 #include <vector>
21 #include <map>
22 #include <stdio.h>
23 #include <errno.h>
24 #include <fcntl.h>
25 #include <inttypes.h>
26 #include <stdint.h>
27 #include <time.h>
28 #include <string>
29 #include <unistd.h>
30
31
32 using namespace std; // NOLINT
33
34 #ifdef CVMFS_NAMESPACE_GUARD
35 namespace CVMFS_NAMESPACE_GUARD {
36 #endif
37
38 const char b64_table[] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K',
39 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V',
40 'W', 'X', 'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f', 'g',
41 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
42 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', '0', '1', '2',
43 '3', '4', '5', '6', '7', '8', '9', '+', '/'};
44
45 /**
46 * Decode Base64 and Base64Url
47 */
48 const int8_t db64_table[] = {
49 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
50 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
51 -1, -1, -1, -1, -1, 62, -1, 62, -1, 63, 52, 53, 54, 55, 56, 57, 58, 59, 60,
52 61, -1, -1, -1, 0, -1, -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10,
53 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1,
54 63, -1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42,
55 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1,
56
57 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
58 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
59 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
60 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
61 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
62 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
63 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
64 };
65
66 namespace {
67
68 /**
69 * Used for cas insensitive HasSuffix
70 */
71 struct IgnoreCaseComperator {
72 23643 IgnoreCaseComperator() { }
73 812 bool operator()(const std::string::value_type a,
74 const std::string::value_type b) const {
75 812 return std::tolower(a) == std::tolower(b);
76 }
77 };
78
79 } // anonymous namespace
80
81
3/4
✓ Branch 1 taken 64 times.
✓ Branch 2 taken 2380 times.
✓ Branch 4 taken 2444 times.
✗ Branch 5 not taken.
 2444 string StringifyBool(const bool value) { return value ? "yes" : "no"; }
82
83 28558167 string StringifyInt(const int64_t value) {
84 char buffer[48];
85 28558167 snprintf(buffer, sizeof(buffer), "%" PRId64, value);
86
1/2
✓ Branch 2 taken 28535447 times.
✗ Branch 3 not taken.
 28558167 return string(buffer);
87 }
88
89 14297821 std::string StringifyUint(const uint64_t value) {
90 char buffer[48];
91 14297821 snprintf(buffer, sizeof(buffer), "%" PRIu64, value);
92
1/2
✓ Branch 2 taken 14297821 times.
✗ Branch 3 not taken.
 14297821 return string(buffer);
93 }
94
95 56 string StringifyByteAsHex(const unsigned char value) {
96 char buffer[3];
97 56 snprintf(buffer, sizeof(buffer), "%02x", value);
98
1/2
✓ Branch 2 taken 56 times.
✗ Branch 3 not taken.
 56 return string(buffer);
99 }
100
101 68 string StringifyDouble(const double value) {
102 char buffer[64];
103 68 snprintf(buffer, sizeof(buffer), "%.03f", value);
104
1/2
✓ Branch 2 taken 68 times.
✗ Branch 3 not taken.
 68 return string(buffer);
105 }
106
107 /**
108 * Converts seconds since UTC 0 into something readable
109 */
110 1727 string StringifyTime(const time_t seconds, const bool utc) {
111 struct tm timestamp;
112
2/2
✓ Branch 0 taken 940 times.
✓ Branch 1 taken 787 times.
 1727 if (utc) {
113 940 localtime_r(&seconds, &timestamp);
114 } else {
115 787 gmtime_r(&seconds, &timestamp);
116 }
117
118 1727 const char *months[] = {"Jan", "Feb", "Mar", "Apr", "May", "Jun",
119 "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"};
120 char buffer[21];
121 1727 snprintf(buffer, sizeof(buffer), "%d %s %d %02d:%02d:%02d", timestamp.tm_mday,
122 1727 months[timestamp.tm_mon], timestamp.tm_year + 1900,
123 timestamp.tm_hour, timestamp.tm_min, timestamp.tm_sec);
124
125
1/2
✓ Branch 2 taken 1727 times.
✗ Branch 3 not taken.
 1727 return string(buffer);
126 }
127
128 /**
129 * Converts seconds since UTC 0 into something like 12 Sep 14:59:37 CDT
130 */
131 80 string StringifyLocalTime(const time_t seconds) {
132 struct tm timestamp;
133 80 localtime_r(&seconds, &timestamp);
134
135 80 const char *months[] = {"Jan", "Feb", "Mar", "Apr", "May", "Jun",
136 "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"};
137 char buffer[26];
138 (void)/* cast to void ignores return and placates clang-tidy */
139 80 snprintf(buffer, sizeof(buffer), "%d %s %d %02d:%02d:%02d %s",
140 80 timestamp.tm_mday, months[timestamp.tm_mon],
141 80 timestamp.tm_year + 1900, timestamp.tm_hour, timestamp.tm_min,
142 timestamp.tm_sec, timestamp.tm_zone);
143
144
1/2
✓ Branch 2 taken 80 times.
✗ Branch 3 not taken.
 80 return string(buffer);
145 }
146
147
148 /**
149 * Current time in format Wed, 01 Mar 2006 12:00:00 GMT
150 */
151 48543 std::string RfcTimestamp() {
152 48543 const char *months[] = {"Jan", "Feb", "Mar", "Apr", "May", "Jun",
153 "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"};
154 48543 const char *day_of_week[] = {"Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"};
155
156 struct tm timestamp;
157 48543 const time_t now = time(NULL);
158 48543 gmtime_r(&now, &timestamp);
159
160 char buffer[30];
161 48543 snprintf(buffer, sizeof(buffer), "%s, %02d %s %d %02d:%02d:%02d %s",
162 48543 day_of_week[timestamp.tm_wday], timestamp.tm_mday,
163 48543 months[timestamp.tm_mon], timestamp.tm_year + 1900,
164 timestamp.tm_hour, timestamp.tm_min, timestamp.tm_sec,
165 timestamp.tm_zone);
166
1/2
✓ Branch 2 taken 48543 times.
✗ Branch 3 not taken.
 48543 return string(buffer);
167 }
168
169
170 /**
171 * Current time in format YYYYMMDDTHHMMSSZ. Used in AWS4 requests.
172 */
173 19 std::string IsoTimestamp() {
174 struct tm timestamp;
175 19 const time_t now = time(NULL);
176 19 gmtime_r(&now, &timestamp);
177
178 char buffer[17];
179 19 snprintf(buffer, sizeof(buffer), "%04d%02d%02dT%02d%02d%02dZ",
180 19 timestamp.tm_year + 1900, timestamp.tm_mon + 1, timestamp.tm_mday,
181 timestamp.tm_hour, timestamp.tm_min, timestamp.tm_sec);
182
1/2
✓ Branch 2 taken 19 times.
✗ Branch 3 not taken.
 19 return string(buffer);
183 }
184
185
186 /**
187 * UTC time in format YYYYMMDDHHMMSS. Used in cvmfs whitelists.
188 */
189 278 std::string WhitelistTimestamp(time_t when) {
190 struct tm timestamp;
191 278 gmtime_r(&when, &timestamp);
192
193 char buffer[15];
194 278 snprintf(buffer, sizeof(buffer), "%04d%02d%02d%02d%02d%02d",
195 278 timestamp.tm_year + 1900, timestamp.tm_mon + 1, timestamp.tm_mday,
196 timestamp.tm_hour, timestamp.tm_min, timestamp.tm_sec);
197
1/2
✓ Branch 2 taken 278 times.
✗ Branch 3 not taken.
 278 return string(buffer);
198 }
199
200
201 1490537 string StringifyTimeval(const timeval value) {
202 char buffer[64];
203 1490537 int64_t msec = value.tv_sec * 1000;
204 1490537 msec += value.tv_usec / 1000;
205 1490537 snprintf(buffer, sizeof(buffer), "%" PRId64 ".%03d", msec,
206 1490537 static_cast<int>(value.tv_usec % 1000));
207
1/2
✓ Branch 2 taken 1490537 times.
✗ Branch 3 not taken.
 1490537 return string(buffer);
208 }
209
210 /**
211 * Parses a timestamp of the form YYYY-MM-DDTHH:MM:SSZ
212 * Return 0 on error
213 */
214 4903 time_t IsoTimestamp2UtcTime(const std::string &iso8601) {
215 4903 time_t utc_time = 0;
216 4903 const unsigned length = iso8601.length();
217
218
2/2
✓ Branch 0 taken 28 times.
✓ Branch 1 taken 4875 times.
 4903 if (length != 20)
219 28 return utc_time;
220
2/4
✓ Branch 2 taken 4875 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 4875 times.
✗ Branch 6 not taken.
 9750 if ((iso8601[4] != '-') || (iso8601[7] != '-') || (iso8601[10] != 'T')
221
5/10
✓ Branch 0 taken 4875 times.
✗ Branch 1 not taken.
✓ Branch 3 taken 4875 times.
✗ Branch 4 not taken.
✓ Branch 6 taken 4875 times.
✗ Branch 7 not taken.
✗ Branch 9 not taken.
✓ Branch 10 taken 4875 times.
✗ Branch 11 not taken.
✓ Branch 12 taken 4875 times.
 9750 || (iso8601[13] != ':') || (iso8601[16] != ':') || (iso8601[19] != 'Z')) {
222 ✗ return utc_time;
223 }
224
225 struct tm tm_wl;
226 4875 memset(&tm_wl, 0, sizeof(struct tm));
227
2/4
✓ Branch 1 taken 4875 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 4875 times.
✗ Branch 5 not taken.
 4875 tm_wl.tm_year = static_cast<int>(String2Int64(iso8601.substr(0, 4))) - 1900;
228
2/4
✓ Branch 1 taken 4875 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 4875 times.
✗ Branch 5 not taken.
 4875 tm_wl.tm_mon = static_cast<int>(String2Int64(iso8601.substr(5, 2))) - 1;
229
2/4
✓ Branch 1 taken 4875 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 4875 times.
✗ Branch 5 not taken.
 4875 tm_wl.tm_mday = static_cast<int>(String2Int64(iso8601.substr(8, 2)));
230
2/4
✓ Branch 1 taken 4875 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 4875 times.
✗ Branch 5 not taken.
 4875 tm_wl.tm_hour = static_cast<int>(String2Int64(iso8601.substr(11, 2)));
231
2/4
✓ Branch 1 taken 4875 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 4875 times.
✗ Branch 5 not taken.
 4875 tm_wl.tm_min = static_cast<int>(String2Int64(iso8601.substr(14, 2)));
232
2/4
✓ Branch 1 taken 4875 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 4875 times.
✗ Branch 5 not taken.
 4875 tm_wl.tm_sec = static_cast<int>(String2Int64(iso8601.substr(17, 2)));
233 4875 utc_time = timegm(&tm_wl);
234
2/2
✓ Branch 0 taken 14 times.
✓ Branch 1 taken 4861 times.
 4875 if (utc_time < 0)
235 14 return 0;
236
237 4861 return utc_time;
238 }
239
240 55124 int64_t String2Int64(const string &value) {
241 int64_t result;
242 55124 sscanf(value.c_str(), "%" PRId64, &result);
243 55124 return result;
244 }
245
246 327764 uint64_t String2Uint64(const string &value) {
247 uint64_t result;
248
2/2
✓ Branch 1 taken 327568 times.
✓ Branch 2 taken 196 times.
 327764 if (sscanf(value.c_str(), "%" PRIu64, &result) == 1) {
249 327568 return result;
250 }
251 196 return 0;
252 }
253
254 /**
255 * Parse a string into a a uint64_t.
256 *
257 * Unlike String2Uint64, this:
258 * - Checks to make sure the full string is parsed
259 * - Can indicate an error occurred.
260 *
261 * If an error occurs, this returns false and sets errno appropriately.
262 */
263 1444 bool String2Uint64Parse(const std::string &value, uint64_t *result) {
264 1444 char *endptr = NULL;
265 1444 errno = 0;
266 1444 long long myval = strtoll(value.c_str(), &endptr, 10); // NOLINT
267
2/2
✓ Branch 3 taken 900 times.
✓ Branch 4 taken 395 times.
 2739 if ((value.size() == 0) || (endptr != (value.c_str() + value.size()))
268
6/6
✓ Branch 0 taken 1295 times.
✓ Branch 1 taken 149 times.
✓ Branch 2 taken 9 times.
✓ Branch 3 taken 891 times.
✓ Branch 4 taken 553 times.
✓ Branch 5 taken 891 times.
 2739 || (myval < 0)) {
269 553 errno = EINVAL;
270 553 return false;
271 }
272
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 891 times.
 891 if (errno) {
273 ✗ return false;
274 }
275
2/2
✓ Branch 0 taken 882 times.
✓ Branch 1 taken 9 times.
 891 if (result) {
276 882 *result = myval;
277 }
278 891 return true;
279 }
280
281 80 void String2Uint64Pair(const string &value, uint64_t *a, uint64_t *b) {
282 80 sscanf(value.c_str(), "%" PRIu64 " %" PRIu64, a, b);
283 80 }
284
285 249919 bool HasPrefix(const string &str, const string &prefix,
286 const bool ignore_case) {
287
2/2
✓ Branch 2 taken 55745 times.
✓ Branch 3 taken 194174 times.
 249919 if (prefix.length() > str.length())
288 55745 return false;
289
290
2/2
✓ Branch 1 taken 721390 times.
✓ Branch 2 taken 66677 times.
 788067 for (unsigned i = 0, l = prefix.length(); i < l; ++i) {
291
2/2
✓ Branch 0 taken 101554 times.
✓ Branch 1 taken 619836 times.
 721390 if (ignore_case) {
292
2/2
✓ Branch 2 taken 53194 times.
✓ Branch 3 taken 48360 times.
 101554 if (toupper(str[i]) != toupper(prefix[i]))
293 53194 return false;
294 } else {
295
2/2
✓ Branch 2 taken 74303 times.
✓ Branch 3 taken 545533 times.
 619836 if (str[i] != prefix[i])
296 74303 return false;
297 }
298 }
299 66677 return true;
300 }
301
302 24033 bool HasSuffix(const std::string &str, const std::string &suffix,
303 const bool ignore_case) {
304
2/2
✓ Branch 2 taken 390 times.
✓ Branch 3 taken 23643 times.
 24033 if (suffix.size() > str.size())
305 390 return false;
306 23643 const IgnoreCaseComperator icmp;
307 return (ignore_case)
308
3/4
✓ Branch 0 taken 512 times.
✓ Branch 1 taken 23131 times.
✓ Branch 6 taken 512 times.
✗ Branch 7 not taken.
 23643 ? std::equal(suffix.rbegin(), suffix.rend(), str.rbegin(), icmp)
309
1/2
✓ Branch 4 taken 23131 times.
✗ Branch 5 not taken.
 23643 : std::equal(suffix.rbegin(), suffix.rend(), str.rbegin());
310 }
311
312 52752 vector<string> SplitString(const string &str, char delim) {
313 52752 return SplitStringBounded(0, str, delim);
314 }
315
316 52866 vector<string> SplitStringBounded(unsigned max_chunks, const string &str,
317 char delim) {
318 52866 vector<string> result;
319
320 // edge case... one chunk is always the whole string
321
2/2
✓ Branch 0 taken 19 times.
✓ Branch 1 taken 52847 times.
 52866 if (1 == max_chunks) {
322
1/2
✓ Branch 1 taken 19 times.
✗ Branch 2 not taken.
 19 result.push_back(str);
323 19 return result;
324 }
325
326 // split the string
327 52847 const unsigned size = str.size();
328 52847 unsigned marker = 0;
329 52847 unsigned chunks = 1;
330 unsigned i;
331
2/2
✓ Branch 0 taken 1351876 times.
✓ Branch 1 taken 52809 times.
 1404685 for (i = 0; i < size; ++i) {
332
2/2
✓ Branch 1 taken 75890 times.
✓ Branch 2 taken 1275986 times.
 1351876 if (str[i] == delim) {
333
2/4
✓ Branch 1 taken 75890 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 75890 times.
✗ Branch 5 not taken.
 75890 result.push_back(str.substr(marker, i - marker));
334 75890 marker = i + 1;
335
336 // we got what we want... good bye
337
2/2
✓ Branch 0 taken 38 times.
✓ Branch 1 taken 75852 times.
 75890 if (++chunks == max_chunks)
338 38 break;
339 }
340 }
341
342 // push the remainings of the string and return
343
2/4
✓ Branch 1 taken 52847 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 52847 times.
✗ Branch 5 not taken.
 52847 result.push_back(str.substr(marker));
344 52847 return result;
345 }
346
347 165 vector<string> SplitStringMultiChar(const string &str, const string &delim) {
348 165 size_t pos_start = 0, pos_end = 0, delim_len = delim.length();
349 165 std::string substring;
350 165 std::vector<std::string> result;
351
352
2/2
✓ Branch 1 taken 145 times.
✓ Branch 2 taken 165 times.
 310 while ((pos_end = str.find(delim, pos_start)) != string::npos) {
353
1/2
✓ Branch 1 taken 145 times.
✗ Branch 2 not taken.
 145 substring = str.substr(pos_start, pos_end - pos_start);
354 145 pos_start = pos_end + delim_len;
355
1/2
✓ Branch 1 taken 145 times.
✗ Branch 2 not taken.
 145 result.push_back(substring);
356 }
357
358
2/4
✓ Branch 1 taken 165 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 165 times.
✗ Branch 5 not taken.
 165 result.push_back(str.substr(pos_start));
359 330 return result;
360 165 }
361
362 9780 string JoinStrings(const vector<string> &strings, const string &joint) {
363
1/2
✓ Branch 2 taken 9780 times.
✗ Branch 3 not taken.
 9780 string result = "";
364 9780 const unsigned size = strings.size();
365
366
2/2
✓ Branch 0 taken 7452 times.
✓ Branch 1 taken 2328 times.
 9780 if (size > 0) {
367
1/2
✓ Branch 2 taken 7452 times.
✗ Branch 3 not taken.
 7452 result = strings[0];
368
2/2
✓ Branch 0 taken 928 times.
✓ Branch 1 taken 7452 times.
 8380 for (unsigned i = 1; i < size; ++i)
369
2/4
✓ Branch 2 taken 928 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 928 times.
✗ Branch 6 not taken.
 928 result += joint + strings[i];
370 }
371
372 9780 return result;
373 }
374
375 3304 void ParseKeyvalMem(const unsigned char *buffer, const unsigned buffer_size,
376 map<char, string> *content) {
377 3304 string line;
378 3304 unsigned pos = 0;
379
2/2
✓ Branch 0 taken 221406 times.
✓ Branch 1 taken 98 times.
 221504 while (pos < buffer_size) {
380
2/2
✓ Branch 0 taken 19411 times.
✓ Branch 1 taken 201995 times.
 221406 if (static_cast<char>(buffer[pos]) == '\n') {
381
2/2
✓ Branch 1 taken 3206 times.
✓ Branch 2 taken 16205 times.
 19411 if (line == "--")
382 3206 return;
383
384
1/2
✓ Branch 1 taken 16205 times.
✗ Branch 2 not taken.
 16205 if (line != "") {
385
3/11
✗ Branch 1 not taken.
✓ Branch 2 taken 16205 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
✓ Branch 8 taken 16205 times.
✗ Branch 9 not taken.
✗ Branch 10 not taken.
✓ Branch 11 taken 16205 times.
✗ Branch 12 not taken.
✗ Branch 13 not taken.
 16205 const string tail = (line.length() == 1) ? "" : line.substr(1);
386 // Special handling of 'Z' key because it can exist multiple times
387
3/4
✓ Branch 1 taken 16205 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 16145 times.
✓ Branch 4 taken 60 times.
 16205 if (line[0] != 'Z') {
388
3/6
✓ Branch 1 taken 16145 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 16145 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 16145 times.
✗ Branch 8 not taken.
 16145 (*content)[line[0]] = tail;
389 } else {
390
4/7
✓ Branch 2 taken 60 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 60 times.
✗ Branch 6 not taken.
✓ Branch 8 taken 30 times.
✓ Branch 9 taken 30 times.
 60 if (content->find(line[0]) == content->end()) {
391
3/6
✓ Branch 1 taken 30 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 30 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 30 times.
✗ Branch 8 not taken.
 30 (*content)[line[0]] = tail;
392 } else {
393
6/12
✓ Branch 1 taken 30 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 30 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 30 times.
✗ Branch 8 not taken.
✓ Branch 10 taken 30 times.
✗ Branch 11 not taken.
✓ Branch 13 taken 30 times.
✗ Branch 14 not taken.
✓ Branch 16 taken 30 times.
✗ Branch 17 not taken.
 30 (*content)[line[0]] = (*content)[line[0]] + "|" + tail;
394 }
395 }
396 16205 }
397
1/2
✓ Branch 1 taken 16205 times.
✗ Branch 2 not taken.
 16205 line = "";
398 } else {
399
1/2
✓ Branch 1 taken 201995 times.
✗ Branch 2 not taken.
 201995 line += static_cast<char>(buffer[pos]);
400 }
401 218200 pos++;
402 }
403
2/2
✓ Branch 1 taken 98 times.
✓ Branch 2 taken 3206 times.
 3304 }
404
405 329 bool ParseKeyvalPath(const string &filename, map<char, string> *content) {
406
1/2
✓ Branch 2 taken 329 times.
✗ Branch 3 not taken.
 329 const int fd = open(filename.c_str(), O_RDONLY);
407
2/2
✓ Branch 0 taken 14 times.
✓ Branch 1 taken 315 times.
 329 if (fd < 0)
408 14 return false;
409
410 unsigned char buffer[4096];
411
1/2
✓ Branch 1 taken 315 times.
✗ Branch 2 not taken.
 315 const ssize_t num_bytes = read(fd, buffer, sizeof(buffer));
412
1/2
✓ Branch 1 taken 315 times.
✗ Branch 2 not taken.
 315 close(fd);
413
414
3/4
✓ Branch 0 taken 301 times.
✓ Branch 1 taken 14 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 301 times.
 315 if ((num_bytes <= 0) || (unsigned(num_bytes) >= sizeof(buffer)))
415 14 return false;
416
417
1/2
✓ Branch 1 taken 301 times.
✗ Branch 2 not taken.
 301 ParseKeyvalMem(buffer, unsigned(num_bytes), content);
418 301 return true;
419 }
420
421 234563 string GetLineMem(const char *text, const int text_size) {
422 234563 int pos = 0;
423
4/4
✓ Branch 0 taken 9833126 times.
✓ Branch 1 taken 592 times.
✓ Branch 2 taken 9599155 times.
✓ Branch 3 taken 233971 times.
 9833718 while ((pos < text_size) && (text[pos] != '\n'))
424 9599155 pos++;
425
1/2
✓ Branch 2 taken 234563 times.
✗ Branch 3 not taken.
 234563 return string(text, pos);
426 }
427
428 1524612 bool GetLineFile(FILE *f, std::string *line) {
429 int retval;
430 1524612 line->clear();
431 while (true) {
432 107893395 retval = fgetc(f);
433
2/6
✗ Branch 1 not taken.
✓ Branch 2 taken 107893395 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✓ Branch 6 taken 107893395 times.
 107893395 if (ferror(f) && (errno == EINTR)) {
434 ✗ clearerr(f);
435 ✗ continue;
436
2/2
✓ Branch 0 taken 5752 times.
✓ Branch 1 taken 107887643 times.
 107893395 } else if (retval == EOF) {
437 5752 break;
438 }
439 107887643 const char c = static_cast<char>(retval);
440
2/2
✓ Branch 0 taken 1518860 times.
✓ Branch 1 taken 106368783 times.
 107887643 if (c == '\n')
441 1518860 break;
442 106368783 line->push_back(c);
443 106368783 }
444
4/4
✓ Branch 0 taken 5752 times.
✓ Branch 1 taken 1518860 times.
✓ Branch 3 taken 941 times.
✓ Branch 4 taken 4811 times.
 1524612 return (retval != EOF) || !line->empty();
445 }
446
447 6394 bool GetLineFd(const int fd, std::string *line) {
448 ssize_t retval;
449 char c;
450 6394 line->clear();
451 while (true) {
452
1/2
✓ Branch 1 taken 324788 times.
✗ Branch 2 not taken.
 324788 retval = read(fd, &c, 1);
453
2/2
✓ Branch 0 taken 66 times.
✓ Branch 1 taken 324722 times.
 324788 if (retval == 0) {
454 66 break;
455 }
456
1/4
✗ Branch 0 not taken.
✓ Branch 1 taken 324722 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
 324722 if ((retval == -1) && (errno == EINTR)) {
457 ✗ continue;
458 }
459
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 324722 times.
 324722 if (retval == -1) {
460 ✗ break;
461 }
462
2/2
✓ Branch 0 taken 6328 times.
✓ Branch 1 taken 318394 times.
 324722 if (c == '\n')
463 6328 break;
464
1/2
✓ Branch 1 taken 318394 times.
✗ Branch 2 not taken.
 318394 line->push_back(c);
465 }
466
4/4
✓ Branch 0 taken 66 times.
✓ Branch 1 taken 6328 times.
✓ Branch 3 taken 52 times.
✓ Branch 4 taken 14 times.
 6394 return (retval == 1) || !line->empty();
467 }
468
469 /**
470 * Removes leading and trailing whitespaces.
471 */
472 32953 string Trim(const string &raw, bool trim_newline) {
473
2/2
✓ Branch 1 taken 2843 times.
✓ Branch 2 taken 30110 times.
 32953 if (raw.empty())
474
1/2
✓ Branch 2 taken 2843 times.
✗ Branch 3 not taken.
 2843 return "";
475
476 30110 unsigned start_pos = 0;
477 32354 for (; (start_pos < raw.length())
478
7/8
✓ Branch 0 taken 31826 times.
✓ Branch 1 taken 528 times.
✓ Branch 3 taken 30652 times.
✓ Branch 4 taken 1174 times.
✓ Branch 6 taken 30652 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 2244 times.
✓ Branch 9 taken 30110 times.
 63006 && (raw[start_pos] == ' ' || raw[start_pos] == '\t'
479
2/2
✓ Branch 0 taken 4230 times.
✓ Branch 1 taken 26422 times.
 30652 || (trim_newline
480
4/4
✓ Branch 1 taken 3702 times.
✓ Branch 2 taken 528 times.
✓ Branch 4 taken 542 times.
✓ Branch 5 taken 3160 times.
 4230 && (raw[start_pos] == '\n' || raw[start_pos] == '\r')));
481 ++start_pos) {
482 }
483 30110 unsigned end_pos = raw.length() - 1; // at least one character in raw
484 37504 for (;
485 (end_pos >= start_pos)
486
7/8
✓ Branch 0 taken 36976 times.
✓ Branch 1 taken 528 times.
✓ Branch 3 taken 35666 times.
✓ Branch 4 taken 1310 times.
✓ Branch 6 taken 35666 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 7394 times.
✓ Branch 9 taken 30110 times.
 73170 && (raw[end_pos] == ' ' || raw[end_pos] == '\t'
487
6/6
✓ Branch 0 taken 9244 times.
✓ Branch 1 taken 26422 times.
✓ Branch 3 taken 5940 times.
✓ Branch 4 taken 3304 times.
✓ Branch 6 taken 2780 times.
✓ Branch 7 taken 3160 times.
 35666 || (trim_newline && (raw[end_pos] == '\n' || raw[end_pos] == '\r')));
488 --end_pos) {
489 }
490
491 30110 return raw.substr(start_pos, end_pos - start_pos + 1);
492 }
493
494 136 std::string TrimString(const std::string &path,
495 const std::string &toTrim,
496 const int trimMode) {
497 136 std::string trimmed = path;
498
1/2
✓ Branch 1 taken 136 times.
✗ Branch 2 not taken.
 136 if (trimmed != toTrim) {
499
3/4
✓ Branch 1 taken 272 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 204 times.
✓ Branch 4 taken 68 times.
 408 while ((trimMode & kTrimLeading) && HasPrefix(trimmed, toTrim, true)
500
5/6
✓ Branch 0 taken 272 times.
✓ Branch 1 taken 68 times.
✓ Branch 4 taken 204 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 204 times.
✓ Branch 7 taken 136 times.
 612 && (trimmed.size() > toTrim.size())) {
501
1/2
✓ Branch 2 taken 204 times.
✗ Branch 3 not taken.
 204 trimmed = trimmed.substr(toTrim.size());
502 }
503
3/4
✓ Branch 1 taken 204 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 136 times.
✓ Branch 4 taken 68 times.
 340 while ((trimMode & kTrimTrailing) && HasSuffix(trimmed, toTrim, true)
504
5/6
✓ Branch 0 taken 204 times.
✓ Branch 1 taken 68 times.
✓ Branch 4 taken 136 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 136 times.
✓ Branch 7 taken 136 times.
 476 && (trimmed.size() > toTrim.size())) {
505
1/2
✓ Branch 3 taken 136 times.
✗ Branch 4 not taken.
 136 trimmed = trimmed.substr(0, trimmed.size() - toTrim.size());
506 }
507 }
508 136 return trimmed;
509 }
510
511 /**
512 * Converts all characters to upper case
513 */
514 2243 string ToUpper(const string &mixed_case) {
515 2243 string result(mixed_case);
516
2/2
✓ Branch 1 taken 5477 times.
✓ Branch 2 taken 2243 times.
 7720 for (unsigned i = 0, l = result.length(); i < l; ++i) {
517
2/4
✓ Branch 1 taken 5477 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 5477 times.
✗ Branch 5 not taken.
 5477 result[i] = static_cast<char>(toupper(result[i]));
518 }
519 2243 return result;
520 }
521
522 3687 string ReplaceAll(const string &haystack, const string &needle,
523 const string &replace_by) {
524 3687 string result(haystack);
525 3687 size_t pos = 0;
526 3687 const unsigned needle_size = needle.size();
527
2/2
✓ Branch 1 taken 14 times.
✓ Branch 2 taken 3673 times.
 3687 if (needle == "")
528 14 return result;
529
530
2/2
✓ Branch 1 taken 2015 times.
✓ Branch 2 taken 3673 times.
 5688 while ((pos = result.find(needle, pos)) != string::npos)
531
1/2
✓ Branch 1 taken 2015 times.
✗ Branch 2 not taken.
 2015 result.replace(pos, needle_size, replace_by);
532 3673 return result;
533 }
534
535 461006 static inline void Base64Block(const unsigned char input[3], const char *table,
536 char output[4]) {
537 461006 output[0] = table[(input[0] & 0xFD) >> 2];
538 461006 output[1] = table[((input[0] & 0x03) << 4) | ((input[1] & 0xF0) >> 4)];
539 461006 output[2] = table[((input[1] & 0x0F) << 2) | ((input[2] & 0xD0) >> 6)];
540 461006 output[3] = table[input[2] & 0x3F];
541 461006 }
542
543 63705 string Base64(const string &data) {
544 63705 string result;
545
1/2
✓ Branch 2 taken 63705 times.
✗ Branch 3 not taken.
 63705 result.reserve((data.length() + 3) * 4 / 3);
546 63705 unsigned pos = 0;
547 const unsigned char *data_ptr = reinterpret_cast<const unsigned char *>(
548 63705 data.data());
549 63705 const unsigned length = data.length();
550
2/2
✓ Branch 0 taken 397793 times.
✓ Branch 1 taken 63705 times.
 461498 while (pos + 2 < length) {
551 char encoded_block[4];
552 397793 Base64Block(data_ptr + pos, b64_table, encoded_block);
553
1/2
✓ Branch 1 taken 397793 times.
✗ Branch 2 not taken.
 397793 result.append(encoded_block, 4);
554 397793 pos += 3;
555 }
556
2/2
✓ Branch 0 taken 63213 times.
✓ Branch 1 taken 492 times.
 63705 if (length % 3 != 0) {
557 unsigned char input[3];
558 63213 input[0] = data_ptr[pos];
559
2/2
✓ Branch 0 taken 42193 times.
✓ Branch 1 taken 21020 times.
 63213 input[1] = ((length % 3) == 2) ? data_ptr[pos + 1] : 0;
560 63213 input[2] = 0;
561 char encoded_block[4];
562 63213 Base64Block(input, b64_table, encoded_block);
563
1/2
✓ Branch 1 taken 63213 times.
✗ Branch 2 not taken.
 63213 result.append(encoded_block, 2);
564
3/4
✓ Branch 0 taken 42193 times.
✓ Branch 1 taken 21020 times.
✓ Branch 3 taken 63213 times.
✗ Branch 4 not taken.
 63213 result.push_back(((length % 3) == 2) ? encoded_block[2] : '=');
565
1/2
✓ Branch 1 taken 63213 times.
✗ Branch 2 not taken.
 63213 result.push_back('=');
566 }
567
568 63705 return result;
569 }
570
571 /**
572 * Safe encoding for URIs and path names: replace + by - and / by _
573 */
574 170 string Base64Url(const string &data) {
575 170 string base64 = Base64(data);
576
2/2
✓ Branch 1 taken 14280 times.
✓ Branch 2 taken 170 times.
 14450 for (unsigned i = 0, l = base64.length(); i < l; ++i) {
577
3/4
✓ Branch 1 taken 14280 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 204 times.
✓ Branch 4 taken 14076 times.
 14280 if (base64[i] == '+') {
578
1/2
✓ Branch 1 taken 204 times.
✗ Branch 2 not taken.
 204 base64[i] = '-';
579
3/4
✓ Branch 1 taken 14076 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 136 times.
✓ Branch 4 taken 13940 times.
 14076 } else if (base64[i] == '/') {
580
1/2
✓ Branch 1 taken 136 times.
✗ Branch 2 not taken.
 136 base64[i] = '_';
581 }
582 }
583 170 return base64;
584 }
585
586 1033221 static bool Debase64Block(const unsigned char input[4],
587 unsigned char output[3]) {
588 int32_t dec[4];
589
2/2
✓ Branch 0 taken 4132782 times.
✓ Branch 1 taken 1033187 times.
 5165969 for (int i = 0; i < 4; ++i) {
590 4132782 dec[i] = db64_table[input[i]];
591
2/2
✓ Branch 0 taken 34 times.
✓ Branch 1 taken 4132748 times.
 4132782 if (dec[i] < 0)
592 34 return false;
593 }
594
595 1033187 output[0] = (dec[0] << 2) | (dec[1] >> 4);
596 1033187 output[1] = ((dec[1] & 0x0F) << 4) | (dec[2] >> 2);
597 1033187 output[2] = ((dec[2] & 0x03) << 6) | dec[3];
598 1033187 return true;
599 }
600
601 /**
602 * Can decode both base64 and base64url
603 */
604 5049 bool Debase64(const string &data, string *decoded) {
605 5049 decoded->clear();
606 5049 decoded->reserve((data.length() + 4) * 3 / 4);
607 5049 unsigned pos = 0;
608 const unsigned char *data_ptr = reinterpret_cast<const unsigned char *>(
609 5049 data.data());
610 5049 const unsigned length = data.length();
611
2/2
✓ Branch 0 taken 34 times.
✓ Branch 1 taken 5015 times.
 5049 if (length == 0)
612 34 return true;
613
2/2
✓ Branch 0 taken 68 times.
✓ Branch 1 taken 4947 times.
 5015 if ((length % 4) != 0)
614 68 return false;
615
616
2/2
✓ Branch 0 taken 1033221 times.
✓ Branch 1 taken 4913 times.
 1038134 while (pos < length) {
617 unsigned char decoded_block[3];
618 1033221 const bool retval = Debase64Block(data_ptr + pos, decoded_block);
619
2/2
✓ Branch 0 taken 34 times.
✓ Branch 1 taken 1033187 times.
 1033221 if (!retval)
620 34 return false;
621
1/2
✓ Branch 1 taken 1033187 times.
✗ Branch 2 not taken.
 1033187 decoded->append(reinterpret_cast<char *>(decoded_block), 3);
622 1033187 pos += 4;
623 }
624
625
2/2
✓ Branch 0 taken 9826 times.
✓ Branch 1 taken 4913 times.
 14739 for (int i = 0; i < 2; ++i) {
626 9826 pos--;
627
2/2
✓ Branch 1 taken 1802 times.
✓ Branch 2 taken 8024 times.
 9826 if (data[pos] == '=')
628 1802 decoded->erase(decoded->length() - 1);
629 }
630 4913 return true;
631 }
632
633 /**
634 * Assumes that source is terminated by a newline
635 */
636 105 string Tail(const string &source, unsigned num_lines) {
637
6/6
✓ Branch 1 taken 75 times.
✓ Branch 2 taken 30 times.
✓ Branch 3 taken 15 times.
✓ Branch 4 taken 60 times.
✓ Branch 5 taken 45 times.
✓ Branch 6 taken 60 times.
 105 if (source.empty() || (num_lines == 0))
638
1/2
✓ Branch 2 taken 45 times.
✗ Branch 3 not taken.
 45 return "";
639
640 60 const int l = static_cast<int>(source.length());
641 60 int i = l - 1;
642
2/2
✓ Branch 0 taken 240 times.
✓ Branch 1 taken 45 times.
 285 for (; i >= 0; --i) {
643 240 const char c = source.data()[i];
644
2/2
✓ Branch 0 taken 75 times.
✓ Branch 1 taken 165 times.
 240 if (c == '\n') {
645
2/2
✓ Branch 0 taken 15 times.
✓ Branch 1 taken 60 times.
 75 if (num_lines == 0) {
646 15 return source.substr(i + 1);
647 }
648 60 num_lines--;
649 }
650 }
651 45 return source;
652 }
653
654 /**
655 * Get UTC Time.
656 *
657 * @param format format if timestamp (YYYY-MM-DD HH:MM:SS by default)
658 * @return a timestamp string on success, empty string on failure
659 */
660 ✗ std::string GetGMTimestamp(const std::string &format) {
661 struct tm time_ptr;
662 char date_and_time[100];
663 ✗ const time_t t = time(NULL);
664 ✗ gmtime_r(&t, &time_ptr); // take UTC
665 // return empty string if formatting fails
666 ✗ if (!strftime(date_and_time, 100, format.c_str(), &time_ptr)) {
667 ✗ return "";
668 }
669 ✗ std::string timestamp(date_and_time);
670 ✗ return timestamp;
671 }
672
673 #ifdef CVMFS_NAMESPACE_GUARD
674 } // namespace CVMFS_NAMESPACE_GUARD
675 #endif
676