GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/crypto/hash.cc
Date: 2026-03-15 02:35:27
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 66 bool HexPtr::IsValid() const {
37 66 const unsigned l = str->length();
38
2/2
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 63 times.
 66 if (l == 0)
39 3 return false;
40 63 const char *c = str->data(); // Walks through the string
41 63 unsigned i = 0; // String position of *c
42
43
2/2
✓ Branch 0 taken 2460 times.
✓ Branch 1 taken 15 times.
 2475 for (; i < l; ++i, ++c) {
44
2/2
✓ Branch 0 taken 42 times.
✓ Branch 1 taken 2418 times.
 2460 if (*c == '-')
45 42 break;
46
6/8
✓ Branch 0 taken 2418 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 2418 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 981 times.
✓ Branch 5 taken 1437 times.
✓ Branch 6 taken 6 times.
✓ Branch 7 taken 975 times.
 2418 if ((*c < '0') || (*c > 'f') || ((*c > '9') && (*c < 'a')))
47 6 return false;
48 }
49
50 // Walk through all algorithms
51
2/2
✓ Branch 0 taken 210 times.
✓ Branch 1 taken 45 times.
 255 for (unsigned j = 0; j < kAny; ++j) {
52 210 const unsigned hex_length = 2 * kDigestSizes[j];
53 210 const unsigned algo_id_length = kAlgorithmIdSizes[j];
54
2/2
✓ Branch 0 taken 66 times.
✓ Branch 1 taken 144 times.
 210 if (i == hex_length) {
55 // Right suffix?
56
4/4
✓ Branch 0 taken 183 times.
✓ Branch 1 taken 12 times.
✓ Branch 2 taken 159 times.
✓ Branch 3 taken 24 times.
 195 for (; (i < l) && (i - hex_length < algo_id_length); ++i, ++c) {
57
2/2
✓ Branch 0 taken 30 times.
✓ Branch 1 taken 129 times.
 159 if (*c != kAlgorithmIds[j][i - hex_length])
58 30 break;
59 }
60
3/4
✓ Branch 0 taken 12 times.
✓ Branch 1 taken 54 times.
✓ Branch 2 taken 12 times.
✗ Branch 3 not taken.
 66 if ((i == l) && (l == hex_length + algo_id_length))
61 12 return true;
62 54 i = hex_length;
63 54 c = str->data() + i;
64 }
65 }
66
67 45 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 167121 Any MkFromHexPtr(const HexPtr hex, const char suffix) {
83 167121 Any result;
84
85 167121 const unsigned length = hex.str->length();
86
2/2
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 167118 times.
 167121 if (length == 2 * kDigestSizes[kMd5])
87 3 result = Any(kMd5, hex);
88
2/2
✓ Branch 0 taken 167040 times.
✓ Branch 1 taken 81 times.
 167121 if (length == 2 * kDigestSizes[kSha1])
89 167040 result = Any(kSha1, hex);
90 // TODO(jblomer) compare -rmd160, -shake128
91
2/2
✓ Branch 0 taken 6 times.
✓ Branch 1 taken 167115 times.
 167121 if ((length == 2 * kDigestSizes[kRmd160] + kAlgorithmIdSizes[kRmd160]))
92 6 result = Any(kRmd160, hex);
93
2/2
✓ Branch 0 taken 7 times.
✓ Branch 1 taken 167114 times.
 167121 if ((length == 2 * kDigestSizes[kShake128] + kAlgorithmIdSizes[kShake128]))
94 7 result = Any(kShake128, hex);
95
96 167121 result.suffix = suffix;
97 167121 return result;
98 }
99
100
101 /**
102 * Similar to MkFromHexPtr but the suffix is deducted from the HexPtr string.
103 */
104 6706 Any MkFromSuffixedHexPtr(const HexPtr hex) {
105 6706 Any result;
106
107 6706 const unsigned length = hex.str->length();
108
2/2
✓ Branch 0 taken 404 times.
✓ Branch 1 taken 6302 times.
 6706 if ((length == 2 * kDigestSizes[kMd5])
109
2/2
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 401 times.
 404 || (length == 2 * kDigestSizes[kMd5] + 1)) {
110 6305 const Suffix suffix = (length == 2 * kDigestSizes[kMd5] + 1)
111
2/2
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 6302 times.
 6305 ? *(hex.str->rbegin())
112 6305 : kSuffixNone;
113 6305 result = Any(kMd5, hex, suffix);
114 }
115
2/2
✓ Branch 0 taken 6493 times.
✓ Branch 1 taken 213 times.
 6706 if ((length == 2 * kDigestSizes[kSha1])
116
2/2
✓ Branch 0 taken 171 times.
✓ Branch 1 taken 6322 times.
 6493 || (length == 2 * kDigestSizes[kSha1] + 1)) {
117 384 const Suffix suffix = (length == 2 * kDigestSizes[kSha1] + 1)
118
2/2
✓ Branch 0 taken 171 times.
✓ Branch 1 taken 213 times.
 384 ? *(hex.str->rbegin())
119 384 : kSuffixNone;
120 384 result = Any(kSha1, hex, suffix);
121 }
122
2/2
✓ Branch 0 taken 6703 times.
✓ Branch 1 taken 3 times.
 6706 if ((length == 2 * kDigestSizes[kRmd160] + kAlgorithmIdSizes[kRmd160])
123 6703 || (length
124
2/2
✓ Branch 0 taken 5 times.
✓ Branch 1 taken 6698 times.
 6703 == 2 * kDigestSizes[kRmd160] + kAlgorithmIdSizes[kRmd160] + 1)) {
125 const Suffix suffix = (length
126 8 == 2 * kDigestSizes[kRmd160]
127 8 + kAlgorithmIdSizes[kRmd160] + 1)
128
2/2
✓ Branch 0 taken 5 times.
✓ Branch 1 taken 3 times.
 8 ? *(hex.str->rbegin())
129 8 : kSuffixNone;
130 8 result = Any(kRmd160, hex, suffix);
131 }
132
2/2
✓ Branch 0 taken 6703 times.
✓ Branch 1 taken 3 times.
 6706 if ((length == 2 * kDigestSizes[kShake128] + kAlgorithmIdSizes[kShake128])
133 6703 || (length
134
2/2
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 6700 times.
 6703 == 2 * kDigestSizes[kShake128] + kAlgorithmIdSizes[kShake128] + 1)) {
135 const Suffix suffix = (length
136 6 == 2 * kDigestSizes[kShake128]
137 6 + kAlgorithmIdSizes[kShake128] + 1)
138
2/2
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 3 times.
 6 ? *(hex.str->rbegin())
139 6 : kSuffixNone;
140 6 result = Any(kShake128, hex, suffix);
141 }
142
143 6706 return result;
144 }
145
146
147 /**
148 * Allows the caller to create the context on the stack.
149 */
150 979861 unsigned GetContextSize(const Algorithms algorithm) {
151
4/5
✓ Branch 0 taken 209488 times.
✓ Branch 1 taken 770192 times.
✓ Branch 2 taken 38 times.
✓ Branch 3 taken 218 times.
✗ Branch 4 not taken.
 979861 switch (algorithm) {
152 209488 case kMd5:
153 209488 return sizeof(MD5_CTX);
154 770192 case kSha1:
155 770192 return sizeof(SHA_CTX);
156 38 case kRmd160:
157 38 return sizeof(RIPEMD160_CTX);
158 218 case kShake128:
159 218 return sizeof(Keccak_HashInstance);
160 ✗ default:
161 ✗ PANIC(kLogDebug | kLogSyslogErr,
162 "tried to generate hash context for unspecified hash. Aborting...");
163 }
164 }
165
166 980281 void Init(ContextPtr context) {
167 HashReturn keccak_result;
168
4/5
✓ Branch 0 taken 209497 times.
✓ Branch 1 taken 770531 times.
✓ Branch 2 taken 38 times.
✓ Branch 3 taken 218 times.
✗ Branch 4 not taken.
 980281 switch (context.algorithm) {
169 209497 case kMd5:
170
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 209497 times.
 209497 assert(context.size == sizeof(MD5_CTX));
171 209497 MD5_Init(reinterpret_cast<MD5_CTX *>(context.buffer));
172 209497 break;
173 770531 case kSha1:
174
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 770531 times.
 770531 assert(context.size == sizeof(SHA_CTX));
175 770531 SHA1_Init(reinterpret_cast<SHA_CTX *>(context.buffer));
176 770114 break;
177 38 case kRmd160:
178
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 38 times.
 38 assert(context.size == sizeof(RIPEMD160_CTX));
179 38 RIPEMD160_Init(reinterpret_cast<RIPEMD160_CTX *>(context.buffer));
180 38 break;
181 218 case kShake128:
182
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 218 times.
 218 assert(context.size == sizeof(Keccak_HashInstance));
183 218 keccak_result = Keccak_HashInitialize_SHAKE128(
184 reinterpret_cast<Keccak_HashInstance *>(context.buffer));
185
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 218 times.
 218 assert(keccak_result == SUCCESS);
186 218 break;
187 ✗ default:
188 ✗ PANIC(NULL); // Undefined hash
189 }
190 979867 }
191
192 281166762 void Update(const unsigned char *buffer, const unsigned buffer_length,
193 ContextPtr context) {
194 HashReturn keccak_result;
195
4/5
✓ Branch 0 taken 72314764 times.
✓ Branch 1 taken 70439741 times.
✓ Branch 2 taken 69206060 times.
✓ Branch 3 taken 69206227 times.
✗ Branch 4 not taken.
 281166762 switch (context.algorithm) {
196 72314764 case kMd5:
197
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 72314764 times.
 72314764 assert(context.size == sizeof(MD5_CTX));
198 72314764 MD5_Update(reinterpret_cast<MD5_CTX *>(context.buffer), buffer,
199 buffer_length);
200 72314764 break;
201 70439741 case kSha1:
202
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 70439741 times.
 70439741 assert(context.size == sizeof(SHA_CTX));
203 70439741 SHA1_Update(reinterpret_cast<SHA_CTX *>(context.buffer), buffer,
204 buffer_length);
205 70442798 break;
206 69206060 case kRmd160:
207
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 69206060 times.
 69206060 assert(context.size == sizeof(RIPEMD160_CTX));
208 69206060 RIPEMD160_Update(reinterpret_cast<RIPEMD160_CTX *>(context.buffer),
209 buffer, buffer_length);
210 69206060 break;
211 69206227 case kShake128:
212
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 69206227 times.
 69206227 assert(context.size == sizeof(Keccak_HashInstance));
213 138412454 keccak_result = Keccak_HashUpdate(
214 69206227 reinterpret_cast<Keccak_HashInstance *>(context.buffer), buffer,
215 69206227 buffer_length * 8);
216
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 69206227 times.
 69206227 assert(keccak_result == SUCCESS);
217 69206227 break;
218 ✗ default:
219 ✗ PANIC(NULL); // Undefined hash
220 }
221 281169849 }
222
223 970757 void Final(ContextPtr context, Any *any_digest) {
224 HashReturn keccak_result;
225
4/5
✓ Branch 0 taken 209485 times.
✓ Branch 1 taken 761085 times.
✓ Branch 2 taken 38 times.
✓ Branch 3 taken 218 times.
✗ Branch 4 not taken.
 970757 switch (context.algorithm) {
226 209485 case kMd5:
227
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 209485 times.
 209485 assert(context.size == sizeof(MD5_CTX));
228 209485 MD5_Final(any_digest->digest,
229 209485 reinterpret_cast<MD5_CTX *>(context.buffer));
230 209485 break;
231 761085 case kSha1:
232
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 761085 times.
 761085 assert(context.size == sizeof(SHA_CTX));
233 761085 SHA1_Final(any_digest->digest,
234 761085 reinterpret_cast<SHA_CTX *>(context.buffer));
235 766347 break;
236 38 case kRmd160:
237
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 38 times.
 38 assert(context.size == sizeof(RIPEMD160_CTX));
238 38 RIPEMD160_Final(any_digest->digest,
239 38 reinterpret_cast<RIPEMD160_CTX *>(context.buffer));
240 38 break;
241 218 case kShake128:
242
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 218 times.
 218 assert(context.size == sizeof(Keccak_HashInstance));
243 436 keccak_result = Keccak_HashFinal(
244 218 reinterpret_cast<Keccak_HashInstance *>(context.buffer), NULL);
245
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 218 times.
 218 assert(keccak_result == SUCCESS);
246 436 keccak_result = Keccak_HashSqueeze(
247 218 reinterpret_cast<Keccak_HashInstance *>(context.buffer),
248 218 any_digest->digest, kDigestSizes[kShake128] * 8);
249 218 break;
250 ✗ default:
251 ✗ PANIC(NULL); // Undefined hash
252 }
253 976088 any_digest->algorithm = context.algorithm;
254 976088 }
255
256
257 9917 void HashMem(const unsigned char *buffer, const unsigned buffer_size,
258 Any *any_digest) {
259 9917 const Algorithms algorithm = any_digest->algorithm;
260
1/2
✓ Branch 1 taken 9917 times.
✗ Branch 2 not taken.
 9917 ContextPtr context(algorithm);
261 9917 context.buffer = alloca(context.size);
262
263
1/2
✓ Branch 1 taken 9917 times.
✗ Branch 2 not taken.
 9917 Init(context);
264
1/2
✓ Branch 1 taken 9917 times.
✗ Branch 2 not taken.
 9917 Update(buffer, buffer_size, context);
265
1/2
✓ Branch 1 taken 9917 times.
✗ Branch 2 not taken.
 9917 Final(context, any_digest);
266 9917 }
267
268
269 351 void HashString(const std::string &content, Any *any_digest) {
270 351 HashMem(reinterpret_cast<const unsigned char *>(content.data()),
271 351 content.length(), any_digest);
272 351 }
273
274
275 103707 void Hmac(const string &key,
276 const unsigned char *buffer,
277 const unsigned buffer_size,
278 Any *any_digest) {
279 103707 const Algorithms algorithm = any_digest->algorithm;
280
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 103707 times.
 103707 assert(algorithm != kAny);
281
282 103707 const unsigned block_size = kBlockSizes[algorithm];
283 103707 unsigned char key_block[block_size];
284 103707 memset(key_block, 0, block_size);
285
2/2
✓ Branch 1 taken 3666 times.
✓ Branch 2 taken 100041 times.
 103707 if (key.length() > block_size) {
286
1/2
✓ Branch 1 taken 3666 times.
✗ Branch 2 not taken.
 3666 Any hash_key(algorithm);
287
1/2
✓ Branch 3 taken 3666 times.
✗ Branch 4 not taken.
 3666 HashMem(reinterpret_cast<const unsigned char *>(key.data()), key.length(),
288 &hash_key);
289 3666 memcpy(key_block, hash_key.digest, kDigestSizes[algorithm]);
290 } else {
291
2/2
✓ Branch 1 taken 100032 times.
✓ Branch 2 taken 9 times.
 100041 if (key.length() > 0)
292 100032 memcpy(key_block, key.data(), key.length());
293 }
294
295 103707 unsigned char pad_block[block_size];
296 // Inner hash
297
1/2
✓ Branch 1 taken 103707 times.
✗ Branch 2 not taken.
 103707 Any hash_inner(algorithm);
298
1/2
✓ Branch 1 taken 103707 times.
✗ Branch 2 not taken.
 103707 ContextPtr context_inner(algorithm);
299 103707 context_inner.buffer = alloca(context_inner.size);
300
1/2
✓ Branch 1 taken 103707 times.
✗ Branch 2 not taken.
 103707 Init(context_inner);
301
2/2
✓ Branch 0 taken 6637248 times.
✓ Branch 1 taken 103707 times.
 6740955 for (unsigned i = 0; i < block_size; ++i)
302 6637248 pad_block[i] = key_block[i] ^ 0x36;
303
1/2
✓ Branch 1 taken 103707 times.
✗ Branch 2 not taken.
 103707 Update(pad_block, block_size, context_inner);
304
1/2
✓ Branch 1 taken 103707 times.
✗ Branch 2 not taken.
 103707 Update(buffer, buffer_size, context_inner);
305
1/2
✓ Branch 1 taken 103707 times.
✗ Branch 2 not taken.
 103707 Final(context_inner, &hash_inner);
306
307 // Outer hash
308
1/2
✓ Branch 1 taken 103707 times.
✗ Branch 2 not taken.
 103707 ContextPtr context_outer(algorithm);
309 103707 context_outer.buffer = alloca(context_outer.size);
310
1/2
✓ Branch 1 taken 103707 times.
✗ Branch 2 not taken.
 103707 Init(context_outer);
311
2/2
✓ Branch 0 taken 6637248 times.
✓ Branch 1 taken 103707 times.
 6740955 for (unsigned i = 0; i < block_size; ++i)
312 6637248 pad_block[i] = key_block[i] ^ 0x5c;
313
1/2
✓ Branch 1 taken 103707 times.
✗ Branch 2 not taken.
 103707 Update(pad_block, block_size, context_outer);
314
1/2
✓ Branch 1 taken 103707 times.
✗ Branch 2 not taken.
 103707 Update(hash_inner.digest, kDigestSizes[algorithm], context_outer);
315
316
1/2
✓ Branch 1 taken 103707 times.
✗ Branch 2 not taken.
 103707 Final(context_outer, any_digest);
317 103707 }
318
319
320 6767 bool HashFd(int fd, Any *any_digest) {
321 6767 const Algorithms algorithm = any_digest->algorithm;
322
1/2
✓ Branch 1 taken 6767 times.
✗ Branch 2 not taken.
 6767 ContextPtr context(algorithm);
323 6767 context.buffer = alloca(context.size);
324
325
1/2
✓ Branch 1 taken 6767 times.
✗ Branch 2 not taken.
 6767 Init(context);
326 unsigned char io_buffer[4096];
327 int actual_bytes;
328
3/4
✓ Branch 1 taken 2764937 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 2758170 times.
✓ Branch 4 taken 6767 times.
 2764937 while ((actual_bytes = read(fd, io_buffer, 4096)) != 0) {
329
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 2758170 times.
 2758170 if (actual_bytes == -1) {
330 ✗ if (errno == EINTR)
331 ✗ continue;
332 ✗ return false;
333 }
334
1/2
✓ Branch 1 taken 2758170 times.
✗ Branch 2 not taken.
 2758170 Update(io_buffer, actual_bytes, context);
335 }
336
1/2
✓ Branch 1 taken 6767 times.
✗ Branch 2 not taken.
 6767 Final(context, any_digest);
337 6767 return true;
338 }
339
340
341 6767 bool HashFile(const std::string &filename, Any *any_digest) {
342 6767 const int fd = open(filename.c_str(), O_RDONLY);
343
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 6767 times.
 6767 if (fd == -1)
344 ✗ return false;
345
346 6767 const bool result = HashFd(fd, any_digest);
347 6767 close(fd);
348 6767 return result;
349 }
350
351
352 /**
353 * Fast constructor for hashing path names.
354 */
355 4322 Md5::Md5(const AsciiPtr ascii) {
356 4322 algorithm = kMd5;
357 4322 const string *str = ascii.str;
358
359 MD5_CTX md5_state;
360
1/2
✓ Branch 1 taken 4322 times.
✗ Branch 2 not taken.
 4322 MD5_Init(&md5_state);
361
1/2
✓ Branch 3 taken 4322 times.
✗ Branch 4 not taken.
 4322 MD5_Update(&md5_state, reinterpret_cast<const unsigned char *>(&(*str)[0]),
362 str->length());
363
1/2
✓ Branch 1 taken 4322 times.
✗ Branch 2 not taken.
 4322 MD5_Final(digest, &md5_state);
364 4322 }
365
366
367 1492179 Md5::Md5(const char *chars, const unsigned length) {
368 1492179 algorithm = kMd5;
369
370 MD5_CTX md5_state;
371
1/2
✓ Branch 1 taken 1492179 times.
✗ Branch 2 not taken.
 1492179 MD5_Init(&md5_state);
372
1/2
✓ Branch 1 taken 1492179 times.
✗ Branch 2 not taken.
 1492179 MD5_Update(&md5_state, reinterpret_cast<const unsigned char *>(chars),
373 length);
374
1/2
✓ Branch 1 taken 1492179 times.
✗ Branch 2 not taken.
 1492179 MD5_Final(digest, &md5_state);
375 1492179 }
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 5565 void Md5::ToIntPair(uint64_t *lo, uint64_t *hi) const {
385 5565 memcpy(lo, digest, 8);
386 5565 memcpy(hi, digest + 8, 8);
387 5565 }
388
389
390 100036 Md5 Any::CastToMd5() {
391
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 100036 times.
 100036 assert(algorithm == kMd5);
392 100036 Md5 result;
393 100036 memcpy(result.digest, digest, kDigestSizes[kMd5]);
394 100036 return result;
395 }
396
397 #ifndef OPENSSL_API_INTERFACE_V09
398 18 static string HexFromSha256(unsigned char digest[SHA256_DIGEST_LENGTH]) {
399 18 string result;
400
1/2
✓ Branch 1 taken 18 times.
✗ Branch 2 not taken.
 18 result.reserve(2 * SHA256_DIGEST_LENGTH);
401
2/2
✓ Branch 0 taken 576 times.
✓ Branch 1 taken 18 times.
 594 for (unsigned i = 0; i < SHA256_DIGEST_LENGTH; ++i) {
402 576 const char d1 = digest[i] / 16;
403 576 const char d2 = digest[i] % 16;
404
3/4
✓ Branch 0 taken 333 times.
✓ Branch 1 taken 243 times.
✓ Branch 3 taken 576 times.
✗ Branch 4 not taken.
 576 result.push_back(d1 + ((d1 <= 9) ? '0' : 'a' - 10));
405
3/4
✓ Branch 0 taken 399 times.
✓ Branch 1 taken 177 times.
✓ Branch 3 taken 576 times.
✗ Branch 4 not taken.
 576 result.push_back(d2 + ((d2 <= 9) ? '0' : 'a' - 10));
406 }
407 18 return result;
408 }
409 #endif
410
411 3 string Sha256File(const string &filename) {
412 #ifdef OPENSSL_API_INTERFACE_V09
413 PANIC(NULL);
414 #else
415
1/2
✓ Branch 2 taken 3 times.
✗ Branch 3 not taken.
 3 const int fd = open(filename.c_str(), O_RDONLY);
416
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3 times.
 3 if (fd < 0)
417 ✗ return "";
418
419 SHA256_CTX ctx;
420
1/2
✓ Branch 1 taken 3 times.
✗ Branch 2 not taken.
 3 SHA256_Init(&ctx);
421
422 unsigned char io_buffer[4096];
423 int actual_bytes;
424
2/4
✓ Branch 1 taken 3 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 3 times.
 3 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 3 times.
✗ Branch 2 not taken.
 3 close(fd);
434
435 unsigned char digest[SHA256_DIGEST_LENGTH];
436
1/2
✓ Branch 1 taken 3 times.
✗ Branch 2 not taken.
 3 SHA256_Final(digest, &ctx);
437
1/2
✓ Branch 1 taken 3 times.
✗ Branch 2 not taken.
 3 return HexFromSha256(digest);
438 #endif
439 }
440
441 6 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 6 times.
✗ Branch 2 not taken.
 6 SHA256(buffer, buffer_size, digest);
447
1/2
✓ Branch 1 taken 6 times.
✗ Branch 2 not taken.
 12 return HexFromSha256(digest);
448 #endif
449 }
450
451 3 string Sha256String(const string &content) {
452 3 return Sha256Mem(reinterpret_cast<const unsigned char *>(content.data()),
453 3 content.length());
454 }
455
456
457 21 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 21 const unsigned block_size = 64;
465 21 const unsigned key_length = key.length();
466 unsigned char key_block[block_size];
467 21 memset(key_block, 0, block_size);
468
2/2
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 18 times.
 21 if (key_length > block_size) {
469
1/2
✓ Branch 2 taken 3 times.
✗ Branch 3 not taken.
 3 SHA256(reinterpret_cast<const unsigned char *>(key.data()), key_length,
470 key_block);
471 } else {
472
1/2
✓ Branch 1 taken 18 times.
✗ Branch 2 not taken.
 18 if (key.length() > 0)
473 18 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 21 times.
✗ Branch 2 not taken.
 21 SHA256_Init(&ctx_inner);
481
2/2
✓ Branch 0 taken 1344 times.
✓ Branch 1 taken 21 times.
 1365 for (unsigned i = 0; i < block_size; ++i)
482 1344 pad_block[i] = key_block[i] ^ 0x36;
483
1/2
✓ Branch 1 taken 21 times.
✗ Branch 2 not taken.
 21 SHA256_Update(&ctx_inner, pad_block, block_size);
484
1/2
✓ Branch 3 taken 21 times.
✗ Branch 4 not taken.
 21 SHA256_Update(&ctx_inner, content.data(), content.length());
485
1/2
✓ Branch 1 taken 21 times.
✗ Branch 2 not taken.
 21 SHA256_Final(digest_inner, &ctx_inner);
486
487 // Outer hash
488 SHA256_CTX ctx_outer;
489
1/2
✓ Branch 1 taken 21 times.
✗ Branch 2 not taken.
 21 SHA256_Init(&ctx_outer);
490
2/2
✓ Branch 0 taken 1344 times.
✓ Branch 1 taken 21 times.
 1365 for (unsigned i = 0; i < block_size; ++i)
491 1344 pad_block[i] = key_block[i] ^ 0x5c;
492
1/2
✓ Branch 1 taken 21 times.
✗ Branch 2 not taken.
 21 SHA256_Update(&ctx_outer, pad_block, block_size);
493
1/2
✓ Branch 1 taken 21 times.
✗ Branch 2 not taken.
 21 SHA256_Update(&ctx_outer, digest_inner, SHA256_DIGEST_LENGTH);
494
495
1/2
✓ Branch 1 taken 21 times.
✗ Branch 2 not taken.
 21 SHA256_Final(digest, &ctx_outer);
496
2/2
✓ Branch 0 taken 12 times.
✓ Branch 1 taken 9 times.
 21 if (raw_output)
497
1/2
✓ Branch 2 taken 12 times.
✗ Branch 3 not taken.
 12 return string(reinterpret_cast<const char *>(digest), SHA256_DIGEST_LENGTH);
498
1/2
✓ Branch 1 taken 9 times.
✗ Branch 2 not taken.
 9 return HexFromSha256(digest);
499 #endif
500 }
501
502 } // namespace shash
503
504 #ifdef CVMFS_NAMESPACE_GUARD
505 } // namespace CVMFS_NAMESPACE_GUARD
506 #endif
507