Home
last modified time | relevance | path

Searched refs:length (Results 1 – 13 of 13) sorted by relevance

/crypto/
Dcrct10dif_generic.c52 unsigned int length) in chksum_update() argument
56 ctx->crc = crc_t10dif_generic(ctx->crc, data, length); in chksum_update()
83 unsigned int length, u8 *out) in chksum_digest() argument
85 return __chksum_finup(0, data, length, out); in chksum_digest()
Dxxhash_generic.c44 unsigned int length) in xxhash64_update() argument
48 xxh64_update(&dctx->xxhstate, data, length); in xxhash64_update()
63 unsigned int length, u8 *out) in xxhash64_digest() argument
67 put_unaligned_le64(xxh64(data, length, tctx->seed), out); in xxhash64_digest()
Dcrc32c_generic.c86 unsigned int length) in chksum_update() argument
90 ctx->crc = __crc32c_le(ctx->crc, data, length); in chksum_update()
117 unsigned int length, u8 *out) in chksum_digest() argument
121 return __chksum_finup(&mctx->key, data, length, out); in chksum_digest()
Dscatterwalk.c80 if (src->length > len) in scatterwalk_ffwd()
83 len -= src->length; in scatterwalk_ffwd()
88 sg_set_page(dst, sg_page(src), src->length - len, src->offset + len); in scatterwalk_ffwd()
Daf_alg.c546 if (offset >= sg[i].length) { in af_alg_count_tsgl()
547 offset -= sg[i].length; in af_alg_count_tsgl()
548 bytes -= sg[i].length; in af_alg_count_tsgl()
552 bytes_count = sg[i].length - offset; in af_alg_count_tsgl()
599 size_t plen = min_t(size_t, used, sg[i].length); in af_alg_pull_tsgl()
624 sg[i].length -= plen; in af_alg_pull_tsgl()
630 if (sg[i].length) in af_alg_pull_tsgl()
886 PAGE_SIZE - sg->offset - sg->length); in af_alg_sendmsg()
889 sg->offset + sg->length, in af_alg_sendmsg()
894 sg->length += len; in af_alg_sendmsg()
[all …]
Dkeywrap.c112 if (sg->length > skip) { in crypto_kw_scatterlist_ff()
117 skip -= sg->length; in crypto_kw_scatterlist_ff()
DKconfig474 Adiantum is a tweakable, length-preserving encryption mode
1180 Anubis is a variable key length cipher which can use keys from
1181 128 bits to 320 bits in length. It was evaluated as a entrant
1196 bits in length. This algorithm is required for driver-based
1207 This is a variable key length cipher which can use keys from 32
1208 bits to 448 bits in length. It's fast, simple and specifically
1231 This is a variable key length cipher which can use keys from 32
1232 bits to 448 bits in length. It's fast, simple and specifically
1447 rather than to Salsa20. XChaCha20 extends ChaCha20's nonce length
1485 Keys are allowed to be from 0 to 256 bits in length, in steps
[all …]
Dtestmgr.c536 size_t length; in build_test_sglist() member
556 partitions[tsgl->nents].length = len_this_sg; in build_test_sglist()
563 partitions[tsgl->nents].length = 0; in build_test_sglist()
566 partitions[tsgl->nents - 1].length += len_remaining; in build_test_sglist()
577 while (offset + partitions[i].length + TESTMGR_POISON_LEN > in build_test_sglist()
585 sg_set_buf(&tsgl->sgl[i], addr, partitions[i].length); in build_test_sglist()
593 copy_len = min(partitions[i].length, data->count); in build_test_sglist()
597 testmgr_poison(addr + copy_len, partitions[i].length + in build_test_sglist()
600 testmgr_poison(addr, partitions[i].length + in build_test_sglist()
632 unsigned int len = sg->length; in verify_correct_output()
[all …]
Dalgif_aead.c186 if (!(process_sg->length) || !sg_page(process_sg)) in _aead_recvmsg()
Dadiantum.c277 n = min_t(unsigned int, miter.length, bulk_len - i); in adiantum_hash_message()
Dshash.c315 nbytes <= min(sg->length, ((unsigned int)(PAGE_SIZE)) - offset))) { in shash_ahash_digest()
Dahash.c72 walk->entrylen = sg->length; in hash_walk_new_entry()
/crypto/asymmetric_keys/
Dverify_pefile.c136 wrapper.length, wrapper.revision, wrapper.cert_type); in pefile_strip_sig_wrapper()
144 if (wrapper.length > ctx->sig_len) { in pefile_strip_sig_wrapper()
146 ctx->sig_len, wrapper.length); in pefile_strip_sig_wrapper()
163 ctx->sig_len = wrapper.length; in pefile_strip_sig_wrapper()