Home
last modified time | relevance | path

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

/crypto/
A Dtwofish_common.c530 mds[0][q0[a ^ key[(j) + 8]] ^ key[j]] \
531 ^ mds[1][q0[b ^ key[(j) + 9]] ^ key[(j) + 1]] \
532 ^ mds[2][q1[c ^ key[(j) + 10]] ^ key[(j) + 2]] \
533 ^ mds[3][q1[d ^ key[(j) + 11]] ^ key[(j) + 3]]
544 q1[b ^ key[(j) + 17]], \
546 q1[d ^ key[(j) + 19]], j)
559 q0[b ^ key[(j) + 27]], j)
572 int i, j, k; in __twofish_setkey() local
634 for ( i = j = 0, k = 1; i < 256; i++, j += 2, k += 2 ) { in __twofish_setkey()
656 for ( i = j = 0, k = 1; i < 256; i++, j += 2, k += 2 ) { in __twofish_setkey()
[all …]
A Dblowfish_common.c350 short i, j, count; in blowfish_setkey() local
355 for (j = 0; j < 4; j++, count++) in blowfish_setkey()
363 for (j = 0, i = 0; i < 16 + 2; i++) { in blowfish_setkey()
364 temp = (((u32)key[j] << 24) | in blowfish_setkey()
365 ((u32)key[(j + 1) % keylen] << 16) | in blowfish_setkey()
366 ((u32)key[(j + 2) % keylen] << 8) | in blowfish_setkey()
367 ((u32)key[(j + 3) % keylen])); in blowfish_setkey()
370 j = (j + 4) % keylen; in blowfish_setkey()
384 for (j = 0, count = i * 256; j < 256; j += 2, count += 2) { in blowfish_setkey()
A Danubis.c532 int j = i; in anubis_setkey() local
533 inter[i] = T0[(kappa[j--] >> 24) ]; in anubis_setkey()
534 if (j < 0) in anubis_setkey()
535 j = N - 1; in anubis_setkey()
536 inter[i] ^= T1[(kappa[j--] >> 16) & 0xff]; in anubis_setkey()
537 if (j < 0) in anubis_setkey()
538 j = N - 1; in anubis_setkey()
539 inter[i] ^= T2[(kappa[j--] >> 8) & 0xff]; in anubis_setkey()
540 if (j < 0) in anubis_setkey()
541 j = N - 1; in anubis_setkey()
[all …]
A Dtcrypt.c353 for (j = 0; j < tcount; j++) { in test_mb_aead_speed()
375 for (j = 0; j < num_mb; ++j) { in test_mb_aead_speed()
523 unsigned int i, j; in test_aead_speed() local
611 for (j = 0; j < tcount; j++) { in test_aead_speed()
1136 for (j = 0; j < tcount; j++) { in test_mb_skcipher_speed()
1158 for (j = 0; j < num_mb; ++j) { in test_mb_skcipher_speed()
1355 for (j = 0; j < tcount; j++) { in test_skcipher_speed()
1378 j = 1; in test_skcipher_speed()
1380 sg_set_buf(sg + j, tvmem[j], PAGE_SIZE); in test_skcipher_speed()
1382 j++; in test_skcipher_speed()
[all …]
A Djitterentropy-kcapi.c111 __u64 j = 0; in jent_hash_time() local
134 for (j = 0; j < hash_loop_cnt; j++) { in jent_hash_time()
A Ddrbg.c2100 unsigned int j = 0; /* pointer to drbg_cores */ in drbg_init() local
2123 for (j = 0; ARRAY_SIZE(drbg_cores) > j; j++, i++) in drbg_init()
2124 drbg_fill_array(&drbg_algs[i], &drbg_cores[j], 1); in drbg_init()
2125 for (j = 0; ARRAY_SIZE(drbg_cores) > j; j++, i++) in drbg_init()
2126 drbg_fill_array(&drbg_algs[i], &drbg_cores[j], 0); in drbg_init()
A Decc.c661 unsigned int j; in vli_mmod_slow() local
663 for (j = 0; j < ndigits * 2; ++j) { in vli_mmod_slow()
664 u64 diff = v[i][j] - mod_m[j] - borrow; in vli_mmod_slow()
666 if (diff != v[i][j]) in vli_mmod_slow()
667 borrow = (diff > v[i][j]); in vli_mmod_slow()
668 v[1 - i][j] = diff; in vli_mmod_slow()
A Dtestmgr.c2724 unsigned int i, j, k; in test_cipher() local
2740 j = 0; in test_cipher()
2748 j++; in test_cipher()
3450 int err = 0, i, j, seedsize; in test_cprng() local
3479 for (j = 0; j < template[i].loops; j++) { in test_cprng()
5764 int j; in alg_test() local
5793 j = alg_find_test(driver); in alg_test()
5794 if (i < 0 && j < 0) in alg_test()
5798 if (j >= 0 && !alg_test_descs[j].fips_allowed) in alg_test()
5809 if (j >= 0 && j != i) in alg_test()
[all …]
A Daf_alg.c709 unsigned int i, j = 0; in af_alg_pull_tsgl() local
734 sg_set_page(dst + j, page, in af_alg_pull_tsgl()
738 j++; in af_alg_pull_tsgl()
A Dserpent_generic.c24 #define keyiter(a, b, c, d, i, j) \ argument
25 ({ b ^= d; b ^= c; b ^= a; b ^= PHI ^ i; b = rol32(b, 11); k[j] = b; })
/crypto/async_tx/
A Draid6test.c127 static int test_disks(int i, int j, int disks) in test_disks() argument
135 dataptrs[j] = recovj; in test_disks()
137 raid6_dual_recov(disks, PAGE_SIZE, i, j, dataptrs, dataoffs); in test_disks()
140 errb = memcmp(page_address(data[j]), page_address(recovj), PAGE_SIZE); in test_disks()
143 __func__, i, j, i, disk_type(i, disks), j, disk_type(j, disks), in test_disks()
147 dataptrs[j] = data[j]; in test_disks()
158 int i, j; in test() local
183 for (j = i+1; j < disks; j++) { in test()
185 err += test_disks(i, j, disks); in test()
A Dasync_pq.c200 int i, j; in async_gen_syndrome() local
210 for (i = 0, j = 0; i < src_cnt; i++) { in async_gen_syndrome()
215 coefs[j] = raid6_gfexp[i]; in async_gen_syndrome()
217 j++; in async_gen_syndrome()
230 unmap->addr[j++] = 0; in async_gen_syndrome()
240 unmap->addr[j++] = 0; in async_gen_syndrome()
318 int i, j = 0, src_cnt = 0; in async_syndrome_val() local
329 coefs[j] = raid6_gfexp[i]; in async_syndrome_val()
332 j++; in async_syndrome_val()
342 unmap->addr[j++] = pq[0]; in async_syndrome_val()
[all …]
A Dasync_xor.c200 int i, j; in async_xor_offs() local
206 for (i = 0, j = 0; i < src_cnt; i++) { in async_xor_offs()
210 unmap->addr[j++] = dma_map_page(device->dev, src_list[i], in async_xor_offs()
216 unmap->addr[j] = dma_map_page(device->dev, dest, offset, len, in async_xor_offs()

Completed in 42 milliseconds