Searched refs:rounds (Results 51 - 63 of 63) sorted by relevance
123
/linux-master/tools/testing/selftests/net/netfilter/ |
H A D | nft_concat_range.sh | 1490 rounds=100 1491 [ "$KSFT_MACHINE_SLOW" = "yes" ] && rounds=10 1496 for i in $(seq 1 $rounds); do
|
/linux-master/arch/arm64/crypto/ |
H A D | sha512-armv8.pl | 85 $rounds=80; 94 $rounds=64; 257 sub $Ktbl,$Ktbl,#`$SZ*($rounds+1)` // rewind 428 sub $Ktbl,$Ktbl,#$rounds*$SZ-16 // rewind
|
/linux-master/arch/arm/crypto/ |
H A D | ghash-ce-core.S | 397 .macro aes_encrypt, rkp, rounds, regs:vararg 399 cmp \rounds, #12 530 * char *iv, int rounds, u32 counter) 548 * char *iv, int rounds, u32 counter) 566 * char *iv, int rounds, u32 counter) 621 * char *iv, int rounds, u32 counter,
|
/linux-master/arch/x86/crypto/ |
H A D | sha256-avx2-asm.S | 116 _XFER_SIZE = 2*64*4 # 2 blocks, 64 rounds, 4 bytes/round 587 ## schedule 48 input dwords, by doing 3 rounds of 12 each 617 ## Do last 16 rounds with no scheduling
|
H A D | sha1_ssse3_asm.S | 109 * This macro implements 80 rounds of SHA-1 for one 64-byte block 250 * RR does two rounds of SHA-1 back to back with W[] pre-calc 306 .elseif (i < 80) // rounds 32-79 347 /* message scheduling pre-compute for rounds 0-15 */ 362 /* message scheduling pre-compute for rounds 16-31 368 * some "heavy-lifting" vectorization for rounds 16-31 due to w[i]->w[i-3] 373 # vector iteration / 4 scalar rounds 403 /* message scheduling pre-compute for rounds 32-79
|
H A D | sha256-ssse3-asm.S | 401 ## schedule 48 input dwords, by doing 3 rounds of 16 each
|
H A D | sha256-avx-asm.S | 391 ## schedule 48 input dwords, by doing 3 rounds of 16 each
|
H A D | sha512-avx2-asm.S | 614 ## schedule 64 input dwords, by doing 12 rounds of 4 each
|
H A D | aesni-intel_asm.S | 885 .irpc index, 1234 # do 4 rounds 892 .irpc index, 56789 # do next 5 rounds
|
H A D | aesni-intel_avx-x86_64.S | 1102 .rep \REP # do REP rounds 2052 .rep \REP # do REP rounds
|
/linux-master/mm/ |
H A D | mempolicy.c | 2389 unsigned long rounds; local 2454 * Calculate rounds/partial rounds to minimize __alloc_pages_bulk calls. 2457 * if (rounds > 0) and (delta == 0), resume_node will always be 2460 rounds = rem_pages / weight_total; 2467 node_pages = weight * rounds; 2479 /* node_pages can be 0 if an allocation fails and rounds == 0 */
|
/linux-master/include/crypto/ |
H A D | aria.h | 37 int rounds; member in struct:aria_ctx
|
/linux-master/tools/net/ynl/ |
H A D | ynl-gen-c.py | 1012 rounds = len(pns_key_list) ** 2 # it's basically bubble sort 1013 for _ in range(rounds):
|
Completed in 213 milliseconds
123