56 static uint32_t _K[] = { 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6 };
68 #define	BCOUNT	(ctxt->c.b64[0] / 8)
75 	ctxt->c.b64[0] += 8;			\
76 	if (COUNT % 64 == 0)			\
84 	if (COUNT % 64 == 0)			\
99 	bcopy(&ctxt->m.b8[0], &tctxt.m.b8[0], 64);  in sha1_step()
100 	ctxt->m.b8[0] = tctxt.m.b8[3]; ctxt->m.b8[1] = tctxt.m.b8[2];  in sha1_step()
101 	ctxt->m.b8[2] = tctxt.m.b8[1]; ctxt->m.b8[3] = tctxt.m.b8[0];  in sha1_step()
134 	a = H(0); b = H(1); c = H(2); d = H(3); e = H(4);  in sha1_step()
136 	for (t = 0; t < 20; t++) {  in sha1_step()
137 		s = t & 0x0f;  in sha1_step()
139 			W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));  in sha1_step()
145 		s = t & 0x0f;  in sha1_step()
146 		W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));  in sha1_step()
151 		s = t & 0x0f;  in sha1_step()
152 		W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));  in sha1_step()
157 		s = t & 0x0f;  in sha1_step()
158 		W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));  in sha1_step()
163 	H(0) = H(0) + a;  in sha1_step()
169 	bzero(&ctxt->m.b8[0], 64);  in sha1_step()
178 	H(0) = 0x67452301;  in sha1_init()
179 	H(1) = 0xefcdab89;  in sha1_init()
180 	H(2) = 0x98badcfe;  in sha1_init()
181 	H(3) = 0x10325476;  in sha1_init()
182 	H(4) = 0xc3d2e1f0;  in sha1_init()
191 	PUTPAD(0x80);  in sha1_pad()
200 		padstart = COUNT % 64;	/* should be 0 */  in sha1_pad()
207 	PUTPAD(ctxt->c.b8[0]); PUTPAD(ctxt->c.b8[1]);  in sha1_pad()
215 	PUTPAD(ctxt->c.b8[1]); PUTPAD(ctxt->c.b8[0]);  in sha1_pad()
227 	off = 0;  in sha1_loop()
237 		ctxt->c.b64[0] += copysiz * 8;  in sha1_loop()
238 		if (COUNT % 64 == 0)  in sha1_loop()
252 	bcopy(&ctxt->h.b8[0], digest, SHA1_RESULTLEN);  in sha1_result()
254 	digest[0] = ctxt->h.b8[3]; digest[1] = ctxt->h.b8[2];  in sha1_result()
255 	digest[2] = ctxt->h.b8[1]; digest[3] = ctxt->h.b8[0];  in sha1_result()