1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
/* See LICENSE file for copyright and license details. */
#include "common.h"
/**
* Calculate a Keccak-family hashsum of a file,
* the content of the file is assumed non-sensitive
*
* @param fd The file descriptor of the file to hash
* @param state The hashing state, should not be initialised (memory leak otherwise)
* @param spec Specifications for the hashing algorithm
* @param suffix The data suffix, see `libkeccak_digest`
* @param hashsum Output array for the hashsum, have an allocation size of
* at least `((spec->output + 7) / 8) * sizeof(char)`, may be `NULL`
* @return Zero on success, -1 on error
*/
int
libkeccak_generalised_sum_fd(int fd, struct libkeccak_state *restrict state, const struct libkeccak_spec *restrict spec,
const char *restrict suffix, void *restrict hashsum)
{
ssize_t got;
#ifndef _WIN32
struct stat attr;
#endif
size_t blksize = 4096;
void *restrict chunk;
if (libkeccak_state_initialise(state, spec) < 0)
return -1;
#ifndef _WIN32
if (fstat(fd, &attr) == 0)
if (attr.st_blksize > 0)
blksize = (size_t)attr.st_blksize;
#endif
#if ALLOCA_LIMIT > 0
if (blksize > (size_t)ALLOCA_LIMIT)
blksize = (size_t)ALLOCA_LIMIT;
chunk = alloca(blksize);
#else
chunk = malloc(blksize);
if (!chunk)
return -1;
#endif
for (;;) {
got = read(fd, chunk, blksize);
if (got <= 0) {
if (!got)
break;
if (errno == EINTR)
continue;
goto fail;
}
if (libkeccak_fast_update(state, chunk, (size_t)got) < 0)
goto fail;
}
return libkeccak_fast_digest(state, NULL, 0, 0, suffix, hashsum);
fail:
#if ALLOCA_LIMIT <= 0
free(chunk);
#endif
return -1;
}
|
