Home
last modified time | relevance | path

Searched refs:B (Results 1 – 5 of 5) sorted by relevance

/lib/
Dsha1.c55 #define SHA_ROUND(t, input, fn, constant, A, B, C, D, E) do { \ argument
58 B = ror32(B, 2); } while (0)
60 #define T_0_15(t, A, B, C, D, E) SHA_ROUND(t, SHA_SRC, (((C^D)&B)^D) , 0x5a827999, A, B, C, D, E ) argument
61 #define T_16_19(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (((C^D)&B)^D) , 0x5a827999, A, B, C, D, E ) argument
62 #define T_20_39(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (B^C^D) , 0x6ed9eba1, A, B, C, D, E ) argument
63 #define T_40_59(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, ((B&C)+(D&(B^C))) , 0x8f1bbcdc, A, B, C, D,… argument
64 #define T_60_79(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (B^C^D) , 0xca62c1d6, A, B, C, D, E ) argument
84 __u32 A, B, C, D, E; in sha_transform() local
87 B = digest[1]; in sha_transform()
93 T_0_15( 0, A, B, C, D, E); in sha_transform()
[all …]
Ddynamic_queue_limits.c14 #define POSDIFF(A, B) ((int)((A) - (B)) > 0 ? (A) - (B) : 0) argument
15 #define AFTER_EQ(A, B) ((int)((A) - (B)) >= 0) argument
Dlocking-selftest.c469 LOCK_UNLOCK_2(A, B); \
470 LOCK_UNLOCK_2(B, A); /* fail */
501 LOCK_UNLOCK_2(A, B); \
502 LOCK_UNLOCK_2(B, C); \
534 LOCK_UNLOCK_2(A, B); \
536 LOCK_UNLOCK_2(B, C); /* fail */
567 LOCK_UNLOCK_2(A, B); \
568 LOCK_UNLOCK_2(B, C); \
600 LOCK_UNLOCK_2(A, B); \
602 LOCK_UNLOCK_2(B, D); \
[all …]
Diov_iter.c77 #define iterate_all_kinds(i, n, v, I, B, K) { \ argument
83 iterate_bvec(i, n, v, __bi, skip, (B)) \
97 #define iterate_and_advance(i, n, v, I, B, K) { \ argument
106 iterate_bvec(i, n, v, __bi, skip, (B)) \
/lib/crypto/
Ddes.c582 #define ROUND(L, R, A, B, K, d) \ argument
583 B = K[0]; A = K[1]; K += d; \
584 B ^= R; A ^= R; \
585 B &= 0x3f3f3f3f; ROR(A, 4); \
586 L ^= S8[0xff & B]; A &= 0x3f3f3f3f; \
587 L ^= S6[0xff & (B >> 8)]; B >>= 16; \
590 L ^= S4[0xff & B]; \
591 L ^= S2[0xff & (B >> 8)]; \
784 u32 L, R, A, B; in des_encrypt() local
792 ROUND(L, R, A, B, K, 2); in des_encrypt()
[all …]