Home
last modified time | relevance | path

Searched defs:B (Results 1 – 4 of 4) sorted by relevance

/lib/
Dsha1.c55 #define SHA_ROUND(t, input, fn, constant, A, B, C, D, E) do { \ argument
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
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
Diov_iter.c77 #define iterate_all_kinds(i, n, v, I, B, K) { \ argument
97 #define iterate_and_advance(i, n, v, I, B, K) { \ argument
/lib/crypto/
Ddes.c582 #define ROUND(L, R, A, B, K, d) \ argument
784 u32 L, R, A, B; in des_encrypt() local
805 u32 L, R, A, B; in des_decrypt() local
847 u32 L, R, A, B; in des3_ede_encrypt() local
876 u32 L, R, A, B; in des3_ede_decrypt() local