libblake_blake2s_digest.c


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

/* See LICENSE file for copyright and license details. */
#include "common.h"

void
libblake_blake2s_digest(struct libblake_blake2s_state *state, void *data_, size_t len, int last_node,
                        size_t output_len, unsigned char output[static output_len])
{
	unsigned char *data = data_;
	size_t r;

	r = libblake_blake2s_update(state, data, len);
	data = &data[r];
	len -= r;

	state->f[0] = UINT_LEAST32_C(0xFFFFffff);
	if (UNLIKELY(last_node))
		state->f[1] = UINT_LEAST32_C(0xFFFFffff);

	memset(&data[len], 0, 64 - len);

	/* This runs so seldom that we are not bothering with trying to optimise
	 * this since similar code in libblake_blake2s_force_update.c could not
	 * be optimised */
	state->t[0] = (state->t[0] + len) & UINT_LEAST32_C(0xFFFFffff);
	if (UNLIKELY(state->t[0] < len))
		state->t[1] = (state->t[1] + 1) & UINT_LEAST32_C(0xFFFFffff);

	libblake_internal_blake2s_compress(state, data);

	libblake_internal_blake2s_output_digest(state, output_len, output);
}