GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/crypto/hash.cc
Date: 2026-04-26 02:35:59
Exec Total Coverage
Lines: 275 306 89.9%
Branches: 169 268 63.1%
Line Branch Exec Source
1 /**
2 * This file is part of the CernVM File System.
3 */
4
5
6 #include "crypto/hash.h"
7
8 #include <alloca.h>
9 #include <errno.h>
10 #include <fcntl.h>
11 #include <openssl/hmac.h>
12 #include <openssl/md5.h>
13 #include <openssl/ripemd.h>
14 #include <openssl/sha.h>
15 #include <unistd.h>
16
17 #include <cstdio>
18 #include <cstring>
19
20 #include "KeccakHash.h"
21 #include "crypto/openssl_version.h"
22 #include "util/exception.h"
23
24
25 using namespace std; // NOLINT
26
27 #ifdef CVMFS_NAMESPACE_GUARD
28 namespace CVMFS_NAMESPACE_GUARD {
29 #endif
30
31 namespace shash {
32
33 const char *kAlgorithmIds[] = {"", "", "-rmd160", "-shake128", ""};
34
35
36 110 bool HexPtr::IsValid() const {
37 110 const unsigned l = str->length();
38
2/2
✓ Branch 0 taken 5 times.
✓ Branch 1 taken 105 times.
 110 if (l == 0)
39 5 return false;
40 105 const char *c = str->data(); // Walks through the string
41 105 unsigned i = 0; // String position of *c
42
43
2/2
✓ Branch 0 taken 4100 times.
✓ Branch 1 taken 25 times.
 4125 for (; i < l; ++i, ++c) {
44
2/2
✓ Branch 0 taken 70 times.
✓ Branch 1 taken 4030 times.
 4100 if (*c == '-')
45 70 break;
46
6/8
✓ Branch 0 taken 4030 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 4030 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 1635 times.
✓ Branch 5 taken 2395 times.
✓ Branch 6 taken 10 times.
✓ Branch 7 taken 1625 times.
 4030 if ((*c < '0') || (*c > 'f') || ((*c > '9') && (*c < 'a')))
47 10 return false;
48 }
49
50 // Walk through all algorithms
51
2/2
✓ Branch 0 taken 350 times.
✓ Branch 1 taken 75 times.
 425 for (unsigned j = 0; j < kAny; ++j) {
52 350 const unsigned hex_length = 2 * kDigestSizes[j];
53 350 const unsigned algo_id_length = kAlgorithmIdSizes[j];
54
2/2
✓ Branch 0 taken 110 times.
✓ Branch 1 taken 240 times.
 350 if (i == hex_length) {
55 // Right suffix?
56
4/4
✓ Branch 0 taken 305 times.
✓ Branch 1 taken 20 times.
✓ Branch 2 taken 265 times.
✓ Branch 3 taken 40 times.
 325 for (; (i < l) && (i - hex_length < algo_id_length); ++i, ++c) {
57
2/2
✓ Branch 0 taken 50 times.
✓ Branch 1 taken 215 times.
 265 if (*c != kAlgorithmIds[j][i - hex_length])
58 50 break;
59 }
60
3/4
✓ Branch 0 taken 20 times.
✓ Branch 1 taken 90 times.
✓ Branch 2 taken 20 times.
✗ Branch 3 not taken.
 110 if ((i == l) && (l == hex_length + algo_id_length))
61 20 return true;
62 90 i = hex_length;
63 90 c = str->data() + i;
64 }
65 }
66
67 75 return false;
68 }
69
70
71 ✗ Algorithms ParseHashAlgorithm(const string &algorithm_option) {
72 ✗ if (algorithm_option == "sha1")
73 ✗ return kSha1;
74 ✗ if (algorithm_option == "rmd160")
75 ✗ return kRmd160;
76 ✗ if (algorithm_option == "shake128")
77 ✗ return kShake128;
78 ✗ return kAny;
79 }
80
81
82 330297 Any MkFromHexPtr(const HexPtr hex, const char suffix) {
83 330297 Any result;
84
85 330297 const unsigned length = hex.str->length();
86
2/2
✓ Branch 0 taken 5 times.
✓ Branch 1 taken 330292 times.
 330297 if (length == 2 * kDigestSizes[kMd5])
87 5 result = Any(kMd5, hex);
88
2/2
✓ Branch 0 taken 329891 times.
✓ Branch 1 taken 406 times.
 330297 if (length == 2 * kDigestSizes[kSha1])
89 329891 result = Any(kSha1, hex);
90 // TODO(jblomer) compare -rmd160, -shake128
91
2/2
✓ Branch 0 taken 23 times.
✓ Branch 1 taken 330274 times.
 330297 if ((length == 2 * kDigestSizes[kRmd160] + kAlgorithmIdSizes[kRmd160]))
92 23 result = Any(kRmd160, hex);
93
2/2
✓ Branch 0 taken 29 times.
✓ Branch 1 taken 330268 times.
 330297 if ((length == 2 * kDigestSizes[kShake128] + kAlgorithmIdSizes[kShake128]))
94 29 result = Any(kShake128, hex);
95
96 330297 result.suffix = suffix;
97 330297 return result;
98 }
99
100
101 /**
102 * Similar to MkFromHexPtr but the suffix is deducted from the HexPtr string.
103 */
104 22043 Any MkFromSuffixedHexPtr(const HexPtr hex) {
105 22043 Any result;
106
107 22043 const unsigned length = hex.str->length();
108
2/2
✓ Branch 0 taken 2064 times.
✓ Branch 1 taken 19979 times.
 22043 if ((length == 2 * kDigestSizes[kMd5])
109
2/2
✓ Branch 0 taken 5 times.
✓ Branch 1 taken 2059 times.
 2064 || (length == 2 * kDigestSizes[kMd5] + 1)) {
110 19984 const Suffix suffix = (length == 2 * kDigestSizes[kMd5] + 1)
111
2/2
✓ Branch 0 taken 5 times.
✓ Branch 1 taken 19979 times.
 19984 ? *(hex.str->rbegin())
112 19984 : kSuffixNone;
113 19984 result = Any(kMd5, hex, suffix);
114 }
115
2/2
✓ Branch 0 taken 20944 times.
✓ Branch 1 taken 1099 times.
 22043 if ((length == 2 * kDigestSizes[kSha1])
116
2/2
✓ Branch 0 taken 929 times.
✓ Branch 1 taken 20015 times.
 20944 || (length == 2 * kDigestSizes[kSha1] + 1)) {
117 2028 const Suffix suffix = (length == 2 * kDigestSizes[kSha1] + 1)
118
2/2
✓ Branch 0 taken 929 times.
✓ Branch 1 taken 1099 times.
 2028 ? *(hex.str->rbegin())
119 2028 : kSuffixNone;
120 2028 result = Any(kSha1, hex, suffix);
121 }
122
2/2
✓ Branch 0 taken 22038 times.
✓ Branch 1 taken 5 times.
 22043 if ((length == 2 * kDigestSizes[kRmd160] + kAlgorithmIdSizes[kRmd160])
123 22038 || (length
124
2/2
✓ Branch 0 taken 11 times.
✓ Branch 1 taken 22027 times.
 22038 == 2 * kDigestSizes[kRmd160] + kAlgorithmIdSizes[kRmd160] + 1)) {
125 const Suffix suffix = (length
126 16 == 2 * kDigestSizes[kRmd160]
127 16 + kAlgorithmIdSizes[kRmd160] + 1)
128
2/2
✓ Branch 0 taken 11 times.
✓ Branch 1 taken 5 times.
 16 ? *(hex.str->rbegin())
129 16 : kSuffixNone;
130 16 result = Any(kRmd160, hex, suffix);
131 }
132
2/2
✓ Branch 0 taken 22038 times.
✓ Branch 1 taken 5 times.
 22043 if ((length == 2 * kDigestSizes[kShake128] + kAlgorithmIdSizes[kShake128])
133 22038 || (length
134
2/2
✓ Branch 0 taken 5 times.
✓ Branch 1 taken 22033 times.
 22038 == 2 * kDigestSizes[kShake128] + kAlgorithmIdSizes[kShake128] + 1)) {
135 const Suffix suffix = (length
136 10 == 2 * kDigestSizes[kShake128]
137 10 + kAlgorithmIdSizes[kShake128] + 1)
138
2/2
✓ Branch 0 taken 5 times.
✓ Branch 1 taken 5 times.
 10 ? *(hex.str->rbegin())
139 10 : kSuffixNone;
140 10 result = Any(kShake128, hex, suffix);
141 }
142
143 22043 return result;
144 }
145
146
147 /**
148 * Allows the caller to create the context on the stack.
149 */
150 1467828 unsigned GetContextSize(const Algorithms algorithm) {
151
4/5
✓ Branch 0 taken 207619 times.
✓ Branch 1 taken 1259973 times.
✓ Branch 2 taken 62 times.
✓ Branch 3 taken 564 times.
✗ Branch 4 not taken.
 1467828 switch (algorithm) {
152 207619 case kMd5:
153 207619 return sizeof(MD5_CTX);
154 1259973 case kSha1:
155 1259973 return sizeof(SHA_CTX);
156 62 case kRmd160:
157 62 return sizeof(RIPEMD160_CTX);
158 564 case kShake128:
159 564 return sizeof(Keccak_HashInstance);
160 ✗ default:
161 ✗ PANIC(kLogDebug | kLogSyslogErr,
162 "tried to generate hash context for unspecified hash. Aborting...");
163 }
164 }
165
166 1471261 void Init(ContextPtr context) {
167 HashReturn keccak_result;
168
4/5
✓ Branch 0 taken 207622 times.
✓ Branch 1 taken 1263153 times.
✓ Branch 2 taken 62 times.
✓ Branch 3 taken 564 times.
✗ Branch 4 not taken.
 1471261 switch (context.algorithm) {
169 207622 case kMd5:
170
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 207622 times.
 207622 assert(context.size == sizeof(MD5_CTX));
171 207622 MD5_Init(reinterpret_cast<MD5_CTX *>(context.buffer));
172 207622 break;
173 1263153 case kSha1:
174
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 1263153 times.
 1263153 assert(context.size == sizeof(SHA_CTX));
175 1263153 SHA1_Init(reinterpret_cast<SHA_CTX *>(context.buffer));
176 1264138 break;
177 62 case kRmd160:
178
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 62 times.
 62 assert(context.size == sizeof(RIPEMD160_CTX));
179 62 RIPEMD160_Init(reinterpret_cast<RIPEMD160_CTX *>(context.buffer));
180 62 break;
181 564 case kShake128:
182
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 564 times.
 564 assert(context.size == sizeof(Keccak_HashInstance));
183 564 keccak_result = Keccak_HashInitialize_SHAKE128(
184 reinterpret_cast<Keccak_HashInstance *>(context.buffer));
185
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 564 times.
 564 assert(keccak_result == SUCCESS);
186 564 break;
187 ✗ default:
188 ✗ PANIC(NULL); // Undefined hash
189 }
190 1472386 }
191
192 465794675 void Update(const unsigned char *buffer, const unsigned buffer_length,
193 ContextPtr context) {
194 HashReturn keccak_result;
195
4/5
✓ Branch 0 taken 117546510 times.
✓ Branch 1 taken 117560855 times.
✓ Branch 2 taken 115343432 times.
✓ Branch 3 taken 115343913 times.
✗ Branch 4 not taken.
 465794675 switch (context.algorithm) {
196 117546510 case kMd5:
197
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 117546510 times.
 117546510 assert(context.size == sizeof(MD5_CTX));
198 117546510 MD5_Update(reinterpret_cast<MD5_CTX *>(context.buffer), buffer,
199 buffer_length);
200 117546510 break;
201 117560855 case kSha1:
202
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 117560855 times.
 117560855 assert(context.size == sizeof(SHA_CTX));
203 117560855 SHA1_Update(reinterpret_cast<SHA_CTX *>(context.buffer), buffer,
204 buffer_length);
205 117563640 break;
206 115343432 case kRmd160:
207
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 115343432 times.
 115343432 assert(context.size == sizeof(RIPEMD160_CTX));
208 115343432 RIPEMD160_Update(reinterpret_cast<RIPEMD160_CTX *>(context.buffer),
209 buffer, buffer_length);
210 115343432 break;
211 115343913 case kShake128:
212
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 115343913 times.
 115343913 assert(context.size == sizeof(Keccak_HashInstance));
213 230687826 keccak_result = Keccak_HashUpdate(
214 115343913 reinterpret_cast<Keccak_HashInstance *>(context.buffer), buffer,
215 115343913 buffer_length * 8);
216
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 115343913 times.
 115343913 assert(keccak_result == SUCCESS);
217 115343913 break;
218 ✗ default:
219 ✗ PANIC(NULL); // Undefined hash
220 }
221 465797495 }
222
223 1472965 void Final(ContextPtr context, Any *any_digest) {
224 HashReturn keccak_result;
225
4/5
✓ Branch 0 taken 207618 times.
✓ Branch 1 taken 1264951 times.
✓ Branch 2 taken 62 times.
✓ Branch 3 taken 564 times.
✗ Branch 4 not taken.
 1472965 switch (context.algorithm) {
226 207618 case kMd5:
227
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 207618 times.
 207618 assert(context.size == sizeof(MD5_CTX));
228 207618 MD5_Final(any_digest->digest,
229 207618 reinterpret_cast<MD5_CTX *>(context.buffer));
230 207618 break;
231 1264951 case kSha1:
232
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 1264951 times.
 1264951 assert(context.size == sizeof(SHA_CTX));
233 1264951 SHA1_Final(any_digest->digest,
234 1264951 reinterpret_cast<SHA_CTX *>(context.buffer));
235 1267051 break;
236 62 case kRmd160:
237
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 62 times.
 62 assert(context.size == sizeof(RIPEMD160_CTX));
238 62 RIPEMD160_Final(any_digest->digest,
239 62 reinterpret_cast<RIPEMD160_CTX *>(context.buffer));
240 62 break;
241 564 case kShake128:
242
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 564 times.
 564 assert(context.size == sizeof(Keccak_HashInstance));
243 1128 keccak_result = Keccak_HashFinal(
244 564 reinterpret_cast<Keccak_HashInstance *>(context.buffer), NULL);
245
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 564 times.
 564 assert(keccak_result == SUCCESS);
246 1128 keccak_result = Keccak_HashSqueeze(
247 564 reinterpret_cast<Keccak_HashInstance *>(context.buffer),
248 564 any_digest->digest, kDigestSizes[kShake128] * 8);
249 564 break;
250 ✗ default:
251 ✗ PANIC(NULL); // Undefined hash
252 }
253 1475295 any_digest->algorithm = context.algorithm;
254 1475295 }
255
256
257 11829 void HashMem(const unsigned char *buffer, const unsigned buffer_size,
258 Any *any_digest) {
259 11829 const Algorithms algorithm = any_digest->algorithm;
260
1/2
✓ Branch 1 taken 11829 times.
✗ Branch 2 not taken.
 11829 ContextPtr context(algorithm);
261 11829 context.buffer = alloca(context.size);
262
263
1/2
✓ Branch 1 taken 11829 times.
✗ Branch 2 not taken.
 11829 Init(context);
264
1/2
✓ Branch 1 taken 11829 times.
✗ Branch 2 not taken.
 11829 Update(buffer, buffer_size, context);
265
1/2
✓ Branch 1 taken 11829 times.
✗ Branch 2 not taken.
 11829 Final(context, any_digest);
266 11829 }
267
268
269 797 void HashString(const std::string &content, Any *any_digest) {
270 797 HashMem(reinterpret_cast<const unsigned char *>(content.data()),
271 797 content.length(), any_digest);
272 797 }
273
274
275 103722 void Hmac(const string &key,
276 const unsigned char *buffer,
277 const unsigned buffer_size,
278 Any *any_digest) {
279 103722 const Algorithms algorithm = any_digest->algorithm;
280
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 103722 times.
 103722 assert(algorithm != kAny);
281
282 103722 const unsigned block_size = kBlockSizes[algorithm];
283 103722 unsigned char key_block[block_size];
284 103722 memset(key_block, 0, block_size);
285
2/2
✓ Branch 1 taken 3669 times.
✓ Branch 2 taken 100053 times.
 103722 if (key.length() > block_size) {
286
1/2
✓ Branch 1 taken 3669 times.
✗ Branch 2 not taken.
 3669 Any hash_key(algorithm);
287
1/2
✓ Branch 3 taken 3669 times.
✗ Branch 4 not taken.
 3669 HashMem(reinterpret_cast<const unsigned char *>(key.data()), key.length(),
288 &hash_key);
289 3669 memcpy(key_block, hash_key.digest, kDigestSizes[algorithm]);
290 } else {
291
2/2
✓ Branch 1 taken 100038 times.
✓ Branch 2 taken 15 times.
 100053 if (key.length() > 0)
292 100038 memcpy(key_block, key.data(), key.length());
293 }
294
295 103722 unsigned char pad_block[block_size];
296 // Inner hash
297
1/2
✓ Branch 1 taken 103722 times.
✗ Branch 2 not taken.
 103722 Any hash_inner(algorithm);
298
1/2
✓ Branch 1 taken 103722 times.
✗ Branch 2 not taken.
 103722 ContextPtr context_inner(algorithm);
299 103722 context_inner.buffer = alloca(context_inner.size);
300
1/2
✓ Branch 1 taken 103722 times.
✗ Branch 2 not taken.
 103722 Init(context_inner);
301
2/2
✓ Branch 0 taken 6638208 times.
✓ Branch 1 taken 103722 times.
 6741930 for (unsigned i = 0; i < block_size; ++i)
302 6638208 pad_block[i] = key_block[i] ^ 0x36;
303
1/2
✓ Branch 1 taken 103722 times.
✗ Branch 2 not taken.
 103722 Update(pad_block, block_size, context_inner);
304
1/2
✓ Branch 1 taken 103722 times.
✗ Branch 2 not taken.
 103722 Update(buffer, buffer_size, context_inner);
305
1/2
✓ Branch 1 taken 103722 times.
✗ Branch 2 not taken.
 103722 Final(context_inner, &hash_inner);
306
307 // Outer hash
308
1/2
✓ Branch 1 taken 103722 times.
✗ Branch 2 not taken.
 103722 ContextPtr context_outer(algorithm);
309 103722 context_outer.buffer = alloca(context_outer.size);
310
1/2
✓ Branch 1 taken 103722 times.
✗ Branch 2 not taken.
 103722 Init(context_outer);
311
2/2
✓ Branch 0 taken 6638208 times.
✓ Branch 1 taken 103722 times.
 6741930 for (unsigned i = 0; i < block_size; ++i)
312 6638208 pad_block[i] = key_block[i] ^ 0x5c;
313
1/2
✓ Branch 1 taken 103722 times.
✗ Branch 2 not taken.
 103722 Update(pad_block, block_size, context_outer);
314
1/2
✓ Branch 1 taken 103722 times.
✗ Branch 2 not taken.
 103722 Update(hash_inner.digest, kDigestSizes[algorithm], context_outer);
315
316
1/2
✓ Branch 1 taken 103722 times.
✗ Branch 2 not taken.
 103722 Final(context_outer, any_digest);
317 103722 }
318
319
320 4605 bool HashFd(int fd, Any *any_digest) {
321 4605 const Algorithms algorithm = any_digest->algorithm;
322
1/2
✓ Branch 1 taken 4605 times.
✗ Branch 2 not taken.
 4605 ContextPtr context(algorithm);
323 4605 context.buffer = alloca(context.size);
324
325
1/2
✓ Branch 1 taken 4605 times.
✗ Branch 2 not taken.
 4605 Init(context);
326 unsigned char io_buffer[4096];
327 int actual_bytes;
328
3/4
✓ Branch 1 taken 2069393 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 2064788 times.
✓ Branch 4 taken 4605 times.
 2069393 while ((actual_bytes = read(fd, io_buffer, 4096)) != 0) {
329
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 2064788 times.
 2064788 if (actual_bytes == -1) {
330 ✗ if (errno == EINTR)
331 ✗ continue;
332 ✗ return false;
333 }
334
1/2
✓ Branch 1 taken 2064788 times.
✗ Branch 2 not taken.
 2064788 Update(io_buffer, actual_bytes, context);
335 }
336
1/2
✓ Branch 1 taken 4605 times.
✗ Branch 2 not taken.
 4605 Final(context, any_digest);
337 4605 return true;
338 }
339
340
341 4605 bool HashFile(const std::string &filename, Any *any_digest) {
342 4605 const int fd = open(filename.c_str(), O_RDONLY);
343
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 4605 times.
 4605 if (fd == -1)
344 ✗ return false;
345
346 4605 const bool result = HashFd(fd, any_digest);
347 4605 close(fd);
348 4605 return result;
349 }
350
351
352 /**
353 * Fast constructor for hashing path names.
354 */
355 5833 Md5::Md5(const AsciiPtr ascii) {
356 5833 algorithm = kMd5;
357 5833 const string *str = ascii.str;
358
359 MD5_CTX md5_state;
360
1/2
✓ Branch 1 taken 5833 times.
✗ Branch 2 not taken.
 5833 MD5_Init(&md5_state);
361
1/2
✓ Branch 3 taken 5833 times.
✗ Branch 4 not taken.
 5833 MD5_Update(&md5_state, reinterpret_cast<const unsigned char *>(&(*str)[0]),
362 str->length());
363
1/2
✓ Branch 1 taken 5833 times.
✗ Branch 2 not taken.
 5833 MD5_Final(digest, &md5_state);
364 5833 }
365
366
367 7403407 Md5::Md5(const char *chars, const unsigned length) {
368 7403407 algorithm = kMd5;
369
370 MD5_CTX md5_state;
371
1/2
✓ Branch 1 taken 7403407 times.
✗ Branch 2 not taken.
 7403407 MD5_Init(&md5_state);
372
1/2
✓ Branch 1 taken 7403407 times.
✗ Branch 2 not taken.
 7403407 MD5_Update(&md5_state, reinterpret_cast<const unsigned char *>(chars),
373 length);
374
1/2
✓ Branch 1 taken 7403407 times.
✗ Branch 2 not taken.
 7403407 MD5_Final(digest, &md5_state);
375 7403407 }
376
377
378 ✗ Md5::Md5(const uint64_t lo, const uint64_t hi) {
379 ✗ algorithm = kMd5;
380 ✗ memcpy(digest, &lo, 8);
381 ✗ memcpy(digest + 8, &hi, 8);
382 }
383
384 6411 void Md5::ToIntPair(uint64_t *lo, uint64_t *hi) const {
385 6411 memcpy(lo, digest, 8);
386 6411 memcpy(hi, digest + 8, 8);
387 6411 }
388
389
390 100046 Md5 Any::CastToMd5() {
391
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 100046 times.
 100046 assert(algorithm == kMd5);
392 100046 Md5 result;
393 100046 memcpy(result.digest, digest, kDigestSizes[kMd5]);
394 100046 return result;
395 }
396
397 #ifndef OPENSSL_API_INTERFACE_V09
398 30 static string HexFromSha256(unsigned char digest[SHA256_DIGEST_LENGTH]) {
399 30 string result;
400
1/2
✓ Branch 1 taken 30 times.
✗ Branch 2 not taken.
 30 result.reserve(2 * SHA256_DIGEST_LENGTH);
401
2/2
✓ Branch 0 taken 960 times.
✓ Branch 1 taken 30 times.
 990 for (unsigned i = 0; i < SHA256_DIGEST_LENGTH; ++i) {
402 960 const char d1 = digest[i] / 16;
403 960 const char d2 = digest[i] % 16;
404
3/4
✓ Branch 0 taken 555 times.
✓ Branch 1 taken 405 times.
✓ Branch 3 taken 960 times.
✗ Branch 4 not taken.
 960 result.push_back(d1 + ((d1 <= 9) ? '0' : 'a' - 10));
405
3/4
✓ Branch 0 taken 665 times.
✓ Branch 1 taken 295 times.
✓ Branch 3 taken 960 times.
✗ Branch 4 not taken.
 960 result.push_back(d2 + ((d2 <= 9) ? '0' : 'a' - 10));
406 }
407 30 return result;
408 }
409 #endif
410
411 5 string Sha256File(const string &filename) {
412 #ifdef OPENSSL_API_INTERFACE_V09
413 PANIC(NULL);
414 #else
415
1/2
✓ Branch 2 taken 5 times.
✗ Branch 3 not taken.
 5 const int fd = open(filename.c_str(), O_RDONLY);
416
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 5 times.
 5 if (fd < 0)
417 ✗ return "";
418
419 SHA256_CTX ctx;
420
1/2
✓ Branch 1 taken 5 times.
✗ Branch 2 not taken.
 5 SHA256_Init(&ctx);
421
422 unsigned char io_buffer[4096];
423 int actual_bytes;
424
2/4
✓ Branch 1 taken 5 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 5 times.
 5 while ((actual_bytes = read(fd, io_buffer, 4096)) != 0) {
425 ✗ if (actual_bytes == -1) {
426 ✗ if (errno == EINTR)
427 ✗ continue;
428 ✗ close(fd);
429 ✗ return "";
430 }
431 ✗ SHA256_Update(&ctx, io_buffer, actual_bytes);
432 }
433
1/2
✓ Branch 1 taken 5 times.
✗ Branch 2 not taken.
 5 close(fd);
434
435 unsigned char digest[SHA256_DIGEST_LENGTH];
436
1/2
✓ Branch 1 taken 5 times.
✗ Branch 2 not taken.
 5 SHA256_Final(digest, &ctx);
437
1/2
✓ Branch 1 taken 5 times.
✗ Branch 2 not taken.
 5 return HexFromSha256(digest);
438 #endif
439 }
440
441 10 string Sha256Mem(const unsigned char *buffer, const unsigned buffer_size) {
442 #ifdef OPENSSL_API_INTERFACE_V09
443 PANIC(NULL);
444 #else
445 unsigned char digest[SHA256_DIGEST_LENGTH];
446
1/2
✓ Branch 1 taken 10 times.
✗ Branch 2 not taken.
 10 SHA256(buffer, buffer_size, digest);
447
1/2
✓ Branch 1 taken 10 times.
✗ Branch 2 not taken.
 20 return HexFromSha256(digest);
448 #endif
449 }
450
451 5 string Sha256String(const string &content) {
452 5 return Sha256Mem(reinterpret_cast<const unsigned char *>(content.data()),
453 5 content.length());
454 }
455
456
457 35 std::string Hmac256(const std::string &key,
458 const std::string &content,
459 bool raw_output) {
460 #ifdef OPENSSL_API_INTERFACE_V09
461 PANIC(NULL);
462 #else
463 unsigned char digest[SHA256_DIGEST_LENGTH];
464 35 const unsigned block_size = 64;
465 35 const unsigned key_length = key.length();
466 unsigned char key_block[block_size];
467 35 memset(key_block, 0, block_size);
468
2/2
✓ Branch 0 taken 5 times.
✓ Branch 1 taken 30 times.
 35 if (key_length > block_size) {
469
1/2
✓ Branch 2 taken 5 times.
✗ Branch 3 not taken.
 5 SHA256(reinterpret_cast<const unsigned char *>(key.data()), key_length,
470 key_block);
471 } else {
472
1/2
✓ Branch 1 taken 30 times.
✗ Branch 2 not taken.
 30 if (key.length() > 0)
473 30 memcpy(key_block, key.data(), key_length);
474 }
475
476 unsigned char pad_block[block_size];
477 // Inner hash
478 SHA256_CTX ctx_inner;
479 unsigned char digest_inner[SHA256_DIGEST_LENGTH];
480
1/2
✓ Branch 1 taken 35 times.
✗ Branch 2 not taken.
 35 SHA256_Init(&ctx_inner);
481
2/2
✓ Branch 0 taken 2240 times.
✓ Branch 1 taken 35 times.
 2275 for (unsigned i = 0; i < block_size; ++i)
482 2240 pad_block[i] = key_block[i] ^ 0x36;
483
1/2
✓ Branch 1 taken 35 times.
✗ Branch 2 not taken.
 35 SHA256_Update(&ctx_inner, pad_block, block_size);
484
1/2
✓ Branch 3 taken 35 times.
✗ Branch 4 not taken.
 35 SHA256_Update(&ctx_inner, content.data(), content.length());
485
1/2
✓ Branch 1 taken 35 times.
✗ Branch 2 not taken.
 35 SHA256_Final(digest_inner, &ctx_inner);
486
487 // Outer hash
488 SHA256_CTX ctx_outer;
489
1/2
✓ Branch 1 taken 35 times.
✗ Branch 2 not taken.
 35 SHA256_Init(&ctx_outer);
490
2/2
✓ Branch 0 taken 2240 times.
✓ Branch 1 taken 35 times.
 2275 for (unsigned i = 0; i < block_size; ++i)
491 2240 pad_block[i] = key_block[i] ^ 0x5c;
492
1/2
✓ Branch 1 taken 35 times.
✗ Branch 2 not taken.
 35 SHA256_Update(&ctx_outer, pad_block, block_size);
493
1/2
✓ Branch 1 taken 35 times.
✗ Branch 2 not taken.
 35 SHA256_Update(&ctx_outer, digest_inner, SHA256_DIGEST_LENGTH);
494
495
1/2
✓ Branch 1 taken 35 times.
✗ Branch 2 not taken.
 35 SHA256_Final(digest, &ctx_outer);
496
2/2
✓ Branch 0 taken 20 times.
✓ Branch 1 taken 15 times.
 35 if (raw_output)
497
1/2
✓ Branch 2 taken 20 times.
✗ Branch 3 not taken.
 20 return string(reinterpret_cast<const char *>(digest), SHA256_DIGEST_LENGTH);
498
1/2
✓ Branch 1 taken 15 times.
✗ Branch 2 not taken.
 15 return HexFromSha256(digest);
499 #endif
500 }
501
502 } // namespace shash
503
504 #ifdef CVMFS_NAMESPACE_GUARD
505 } // namespace CVMFS_NAMESPACE_GUARD
506 #endif
507