Searched refs:a (Results 1 – 6 of 6) sorted by relevance
| /crypt/ |
| A D | sha256-block.c | 10 uint32_t a = ctx->H[0]; in __sha256_process_block() local
29 uint32_t a_save = a; in __sha256_process_block()
63 uint32_t T2 = S0 (a) + Maj (a, b, c); in __sha256_process_block()
70 b = a; in __sha256_process_block()
71 a = T1 + T2; in __sha256_process_block()
76 a += a_save; in __sha256_process_block()
90 ctx->H[0] = a; in __sha256_process_block()
|
| A D | sha512-block.c | 10 uint64_t a = ctx->H[0]; in __sha512_process_block() local
36 uint64_t a_save = a; in __sha512_process_block()
70 uint64_t T2 = S0 (a) + Maj (a, b, c); in __sha512_process_block()
77 b = a; in __sha512_process_block()
78 a = T1 + T2; in __sha512_process_block()
83 a += a_save; in __sha512_process_block()
97 ctx->H[0] = a; in __sha512_process_block()
|
| A D | md5-block.c | 49 #define OP(a, b, c, d, s, T) \ in __md5_process_block() argument
52 a += FF (b, c, d) + (*cwp++ = SWAP (*words)) + T; \ in __md5_process_block()
54 CYCLIC (a, s); \ in __md5_process_block()
55 a += b; \ in __md5_process_block()
91 #define OP(f, a, b, c, d, k, s, T) \ in __md5_process_block() argument
94 a += f (b, c, d) + correct_words[k] + T; \ in __md5_process_block()
95 CYCLIC (a, s); \ in __md5_process_block()
96 a += b; \ in __md5_process_block()
|
| A D | README.ufc-crypt | 72 This also makes the benchmarks debatable compared to a real test with
101 each time a new salt is seen. According to the BSD crypt code this is
108 8 times. This saves a lot of variable swapping.
110 - Implement key access by a walking pointer rather than coding
113 - As described, the table based f function uses a 3 dimensional array:
127 No longer rebuilds sb tables when seeing a new salt.
|
| A D | Makefile | 68 $(addprefix $(objpfx),$(tests)): $(objpfx)libcrypt.a
|
| A D | crypt_util.c | 267 _ufc_prbits (ufc_long *a, int n) in __libc_lock_define_initialized()
275 tmp|=(a[t/24] & BITMASK[t % 24])?bytemask[j]:0; in __libc_lock_define_initialized()
|
Completed in 13 milliseconds