Home
last modified time | relevance | path

Searched refs:A (Results 1 – 4 of 4) sorted by relevance

/lib/
Dsha1.c54 #define SHA_ROUND(t, input, fn, constant, A, B, C, D, E) do { \ argument
56 E += TEMP + rol32(A,5) + (fn) + (constant); \
59 #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
60 #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
61 #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
62 #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
63 #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
83 __u32 A, B, C, D, E; in sha_transform() local
85 A = digest[0]; in sha_transform()
92 T_0_15( 0, A, B, C, D, E); in sha_transform()
[all …]
Dlocking-selftest.c329 LOCK_UNLOCK_2(A, B); \
330 LOCK_UNLOCK_2(B, A); /* fail */
356 LOCK_UNLOCK_2(A, B); \ in GENERATE_TESTCASE()
358 LOCK_UNLOCK_2(C, A); /* fail */
384 LOCK_UNLOCK_2(A, B); \
385 LOCK_UNLOCK_2(C, A); \
412 LOCK_UNLOCK_2(A, B); \
415 LOCK_UNLOCK_2(D, A); /* fail */
440 LOCK_UNLOCK_2(A, B); \
443 LOCK_UNLOCK_2(D, A); /* fail */
[all …]
Ddynamic_queue_limits.c13 #define POSDIFF(A, B) ((int)((A) - (B)) > 0 ? (A) - (B) : 0) argument
14 #define AFTER_EQ(A, B) ((int)((A) - (B)) >= 0) argument
DKconfig.debug689 The overhead should be minimal. A periodic hrtimer runs to
783 A timeout of 0 disables the check. The default is two minutes.
835 the kernel panics. If n = 0, then we wait forever. A timeout
1557 boot. A sample kprobe, jprobe and kretprobe are inserted and
1581 A benchmark measuring the performance of the rbtree library.
1589 A benchmark measuring the performance of the interval tree library