2 * Based on the Mozilla SHA1 (see mozilla-sha1/sha1.c),
3 * optimized to do word accesses rather than byte accesses,
4 * and to avoid unnecessary copies into the context array.
12 /* Hash one 64-byte block of data */
13 static void blk_SHA1Block(blk_SHA_CTX
*ctx
, const unsigned int *data
);
15 void blk_SHA1_Init(blk_SHA_CTX
*ctx
)
20 /* Initialize H with the magic constants (see FIPS180 for constants)
22 ctx
->H
[0] = 0x67452301;
23 ctx
->H
[1] = 0xefcdab89;
24 ctx
->H
[2] = 0x98badcfe;
25 ctx
->H
[3] = 0x10325476;
26 ctx
->H
[4] = 0xc3d2e1f0;
30 void blk_SHA1_Update(blk_SHA_CTX
*ctx
, const void *data
, unsigned long len
)
34 ctx
->size
+= (unsigned long long) len
<< 3;
36 /* Read the data into W and process blocks as they get full
42 memcpy(lenW
+ (char *)ctx
->W
, data
, left
);
43 lenW
= (lenW
+ left
) & 63;
49 blk_SHA1Block(ctx
, ctx
->W
);
52 blk_SHA1Block(ctx
, data
);
57 memcpy(ctx
->W
, data
, len
);
63 void blk_SHA1_Final(unsigned char hashout
[20], blk_SHA_CTX
*ctx
)
65 static const unsigned char pad
[64] = { 0x80 };
66 unsigned int padlen
[2];
69 /* Pad with a binary 1 (ie 0x80), then zeroes, then length
71 padlen
[0] = htonl(ctx
->size
>> 32);
72 padlen
[1] = htonl(ctx
->size
);
74 blk_SHA1_Update(ctx
, pad
, 1+ (63 & (55 - ctx
->lenW
)));
75 blk_SHA1_Update(ctx
, padlen
, 8);
79 for (i
= 0; i
< 5; i
++)
80 ((unsigned int *)hashout
)[i
] = htonl(ctx
->H
[i
]);
83 #if defined(__i386__) || defined(__x86_64__)
85 #define SHA_ASM(op, x, n) ({ unsigned int __res; __asm__(op " %1,%0":"=r" (__res):"i" (n), "0" (x)); __res; })
86 #define SHA_ROL(x,n) SHA_ASM("rol", x, n)
87 #define SHA_ROR(x,n) SHA_ASM("ror", x, n)
91 #define SHA_ROT(X,l,r) (((X) << (l)) | ((X) >> (r)))
92 #define SHA_ROL(X,n) SHA_ROT(X,n,32-(n))
93 #define SHA_ROR(X,n) SHA_ROT(X,32-(n),n)
97 static void blk_SHA1Block(blk_SHA_CTX
*ctx
, const unsigned int *data
)
100 unsigned int A
,B
,C
,D
,E
,TEMP
;
110 TEMP = htonl(data[t]); W[t] = TEMP; \
111 TEMP += SHA_ROL(A,5) + (((C^D)&B)^D) + E + 0x5a827999; \
112 E = D; D = C; C = SHA_ROR(B, 2); B = A; A = TEMP; \
114 T_0_15( 0); T_0_15( 1); T_0_15( 2); T_0_15( 3); T_0_15( 4);
115 T_0_15( 5); T_0_15( 6); T_0_15( 7); T_0_15( 8); T_0_15( 9);
116 T_0_15(10); T_0_15(11); T_0_15(12); T_0_15(13); T_0_15(14);
120 for (t
= 16; t
<= 79; t
++)
121 W
[t
] = SHA_ROL(W
[t
-3] ^ W
[t
-8] ^ W
[t
-14] ^ W
[t
-16], 1);
124 TEMP = SHA_ROL(A,5) + (((C^D)&B)^D) + E + W[t] + 0x5a827999; \
125 E = D; D = C; C = SHA_ROR(B, 2); B = A; A = TEMP;
127 T_16_19(16); T_16_19(17); T_16_19(18); T_16_19(19);
130 TEMP = SHA_ROL(A,5) + (B^C^D) + E + W[t] + 0x6ed9eba1; \
131 E = D; D = C; C = SHA_ROR(B, 2); B = A; A = TEMP;
133 T_20_39(20); T_20_39(21); T_20_39(22); T_20_39(23); T_20_39(24);
134 T_20_39(25); T_20_39(26); T_20_39(27); T_20_39(28); T_20_39(29);
135 T_20_39(30); T_20_39(31); T_20_39(32); T_20_39(33); T_20_39(34);
136 T_20_39(35); T_20_39(36); T_20_39(37); T_20_39(38); T_20_39(39);
139 TEMP = SHA_ROL(A,5) + ((B&C)|(D&(B|C))) + E + W[t] + 0x8f1bbcdc; \
140 E = D; D = C; C = SHA_ROR(B, 2); B = A; A = TEMP;
142 T_40_59(40); T_40_59(41); T_40_59(42); T_40_59(43); T_40_59(44);
143 T_40_59(45); T_40_59(46); T_40_59(47); T_40_59(48); T_40_59(49);
144 T_40_59(50); T_40_59(51); T_40_59(52); T_40_59(53); T_40_59(54);
145 T_40_59(55); T_40_59(56); T_40_59(57); T_40_59(58); T_40_59(59);
148 TEMP = SHA_ROL(A,5) + (B^C^D) + E + W[t] + 0xca62c1d6; \
149 E = D; D = C; C = SHA_ROR(B, 2); B = A; A = TEMP;
151 T_60_79(60); T_60_79(61); T_60_79(62); T_60_79(63); T_60_79(64);
152 T_60_79(65); T_60_79(66); T_60_79(67); T_60_79(68); T_60_79(69);
153 T_60_79(70); T_60_79(71); T_60_79(72); T_60_79(73); T_60_79(74);
154 T_60_79(75); T_60_79(76); T_60_79(77); T_60_79(78); T_60_79(79);