Searched refs:length (Results 1 – 14 of 14) sorted by relevance
| /crypto/ |
| A D | xxhash_generic.c | 42 unsigned int length) in xxhash64_update() argument
46 xxh64_update(&dctx->xxhstate, data, length); in xxhash64_update()
61 unsigned int length, u8 *out) in xxhash64_digest() argument
65 put_unaligned_le64(xxh64(data, length, tctx->seed), out); in xxhash64_digest()
|
| A D | crc32c.c | 84 unsigned int length) in chksum_update() argument
88 ctx->crc = crc32c(ctx->crc, data, length); in chksum_update()
115 unsigned int length, u8 *out) in chksum_digest() argument
119 return __chksum_finup(&mctx->key, data, length, out); in chksum_digest()
|
| A D | scatterwalk.c | 39 while (nbytes > sg->length) { in scatterwalk_skip()
40 nbytes -= sg->length; in scatterwalk_skip()
135 if (src->length > len) in scatterwalk_ffwd()
138 len -= src->length; in scatterwalk_ffwd()
143 sg_set_page(dst, sg_page(src), src->length - len, src->offset + len); in scatterwalk_ffwd()
|
| A D | af_alg.c | 664 if (offset >= sg[i].length) { in af_alg_count_tsgl()
665 offset -= sg[i].length; in af_alg_count_tsgl()
666 bytes -= sg[i].length; in af_alg_count_tsgl()
670 bytes_count = sg[i].length - offset; in af_alg_count_tsgl()
742 sg[i].length -= plen; in af_alg_pull_tsgl()
748 if (sg[i].length) in af_alg_pull_tsgl()
1004 PAGE_SIZE - sg->offset - sg->length); in af_alg_sendmsg()
1007 sg->offset + sg->length, in af_alg_sendmsg()
1012 sg->length += len; in af_alg_sendmsg()
1013 ctx->merge = (sg->offset + sg->length) & in af_alg_sendmsg()
[all …]
|
| A D | scompress.c | 195 if (dlen <= req->dst->length) { in scomp_acomp_comp_decomp()
217 if (slen <= req->src->length) { in scomp_acomp_comp_decomp()
|
| A D | testmgr.c | 600 size_t length; in build_test_sglist() member
620 partitions[tsgl->nents].length = len_this_sg; in build_test_sglist()
627 partitions[tsgl->nents].length = 0; in build_test_sglist()
630 partitions[tsgl->nents - 1].length += len_remaining; in build_test_sglist()
664 testmgr_poison(addr, partitions[i].length + in build_test_sglist()
696 unsigned int len = sg->length; in verify_correct_output()
733 if (tsgl->sgl[i].length != tsgl->sgl_saved[i].length) in is_test_sglist_corrupted()
1350 tsgl->sgl[0].length, result); in test_shash_vec_cfg()
1386 tsgl->sgl[i].length, result); in test_shash_vec_cfg()
1398 tsgl->sgl[i].length); in test_shash_vec_cfg()
[all …]
|
| A D | Kconfig | 405 Anubis is a variable key length cipher which can use keys from
406 128 bits to 320 bits in length. It was evaluated as a entrant
434 This is a variable key length cipher which can use keys from 32
435 bits to 448 bits in length. It's fast, simple and specifically
532 Keys are allowed to be from 0 to 256 bits in length, in steps
616 Adiantum tweakable, length-preserving encryption mode
643 bits in length. This algorithm is required for driver-based
661 rather than to Salsa20. XChaCha20 extends ChaCha20's nonce length
710 HCTR2 length-preserving encryption mode
|
| A D | algif_aead.c | 162 if (!(process_sg->length) || !sg_page(process_sg)) in _aead_recvmsg()
|
| A D | ahash.c | 93 walk->entrylen = sg->length; in hash_walk_new_entry()
219 if (nbytes > sg->length) in shash_ahash_digest()
|
| A D | hctr2.c | 210 n = min_t(unsigned int, miter.length, bulk_len - i); in hctr2_hash_message()
|
| A D | adiantum.c | 265 n = min_t(unsigned int, miter.length, bulk_len - i); in adiantum_hash_message()
|
| /crypto/asymmetric_keys/ |
| A D | verify_pefile.c | 136 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()
|
| /crypto/krb5/ |
| A D | selftest.c | 45 unsigned int off = sg->offset, len = umin(sg->length, limit);
|
| A D | rfc3961_simplified.c | 95 n = min(miter.length, len - i); in crypto_shash_update_sg()
|
Completed in 39 milliseconds