Home
last modified time | relevance | path

Searched refs:bulk_len (Results 1 – 2 of 2) sorted by relevance

/crypto/
A Dadiantum.c224 const unsigned int bulk_len = req->cryptlen - BLOCKCIPHER_BLOCK_SIZE; in adiantum_hash_header() local
229 .message_bits = cpu_to_le64((u64)bulk_len * 8) in adiantum_hash_header()
263 for (i = 0; i < bulk_len; i += n) { in adiantum_hash_message()
265 n = min_t(unsigned int, miter.length, bulk_len - i); in adiantum_hash_message()
306 err = crypto_shash_digest(&rctx->u.hash_desc, virt, bulk_len, in adiantum_finish()
313 memcpy(virt + bulk_len, &rctx->rbuf.bignum, sizeof(le128)); in adiantum_finish()
323 bulk_len, sizeof(le128), 1); in adiantum_finish()
366 err = crypto_shash_digest(&rctx->u.hash_desc, virt, bulk_len, in adiantum_crypt()
368 memcpy(&rctx->rbuf.bignum, virt + bulk_len, sizeof(le128)); in adiantum_crypt()
374 bulk_len, sizeof(le128), 0); in adiantum_crypt()
[all …]
A Dhctr2.c199 const unsigned int bulk_len = req->cryptlen - BLOCKCIPHER_BLOCK_SIZE; in hctr2_hash_message() local
201 unsigned int remainder = bulk_len % BLOCKCIPHER_BLOCK_SIZE; in hctr2_hash_message()
208 for (i = 0; i < bulk_len; i += n) { in hctr2_hash_message()
210 n = min_t(unsigned int, miter.length, bulk_len - i); in hctr2_hash_message()
271 int bulk_len = req->cryptlen - BLOCKCIPHER_BLOCK_SIZE; in hctr2_crypt() local
315 rctx->bulk_part_dst, bulk_len, in hctr2_crypt()

Completed in 26 milliseconds