36 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \  argument
37     |(rol(block->l[i],8)&0x00FF00FF))
39 #define blk0(i) block->l[i]  argument
43 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \  argument
44     ^block->l[(i+2)&15]^block->l[i&15],1))
47 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);  argument
48 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);  argument
49 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);  argument
50 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);  argument
51 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);  argument
133     uint32_t i, j;  in SHA1Update()  local
141         memcpy(&context->buffer[j], data, (i = 64-j));  in SHA1Update()
143         for ( ; i + 63 < len; i += 64) {  in SHA1Update()
144             SHA1Transform(context->state, &data[i]);  in SHA1Update()
148     else i = 0;  in SHA1Update()
149     memcpy(&context->buffer[j], &data[i], len - i);  in SHA1Update()
157     unsigned i;  in SHA1Final()  local
169     for (i = 0; i < 2; i++)  in SHA1Final()
171         uint32_t t = context->count[i];  in SHA1Final()
178     for (i = 0; i < 8; i++) {  in SHA1Final()
179         finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]  in SHA1Final()
180          >> ((3-(i & 3)) * 8) ) & 255);  /* Endian independent */  in SHA1Final()
190     for (i = 0; i < 20; i++) {  in SHA1Final()
191         digest[i] = (unsigned char)  in SHA1Final()
192          ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);  in SHA1Final()
208     int i;  in sha1Test()  local
213     for(i=0;i<BUFSIZE;i++)  in sha1Test()
214         buf[i] = i;  in sha1Test()
217     for(i=0;i<1000;i++)  in sha1Test()
222     for(i=0;i<20;i++)  in sha1Test()
223         printf("%02x", hash[i]);  in sha1Test()