Searched refs:BLAKE2S_BLOCK_SIZE (Results 1 – 4 of 4) sorted by relevance
24 const size_t fill = BLAKE2S_BLOCK_SIZE - state->buflen; in blake2s_update()31 BLAKE2S_BLOCK_SIZE); in blake2s_update()36 if (inlen > BLAKE2S_BLOCK_SIZE) { in blake2s_update()37 const size_t nblocks = DIV_ROUND_UP(inlen, BLAKE2S_BLOCK_SIZE); in blake2s_update()40 BLAKE2S_BLOCK_SIZE); in blake2s_update()41 in += BLAKE2S_BLOCK_SIZE * (nblocks - 1); in blake2s_update()42 inlen -= BLAKE2S_BLOCK_SIZE * (nblocks - 1); in blake2s_update()54 BLAKE2S_BLOCK_SIZE - state->buflen); /* Padding */ in blake2s_final()
48 (nblocks > 1 && inc != BLAKE2S_BLOCK_SIZE)); in blake2s_compress_generic()52 memcpy(m, block, BLAKE2S_BLOCK_SIZE); in blake2s_compress_generic()102 block += BLAKE2S_BLOCK_SIZE; in blake2s_compress_generic()
15 BLAKE2S_BLOCK_SIZE = 64, enumerator29 u8 buf[BLAKE2S_BLOCK_SIZE];79 state->buflen = BLAKE2S_BLOCK_SIZE; in blake2s_init_key()
816 static const u8 compiletime_seed[BLAKE2S_BLOCK_SIZE] __initconst __latent_entropy; in random_init()820 for (i = 0, arch_bits = BLAKE2S_BLOCK_SIZE * 8; in random_init()821 i < BLAKE2S_BLOCK_SIZE; i += sizeof(entropy)) { in random_init()1249 u8 block[BLAKE2S_BLOCK_SIZE]; in write_pool_user()