47 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&(sha1_quadbyte)0xFF00FF00) \  argument
48     |(rol(block->l[i],8)&(sha1_quadbyte)0x00FF00FF))
50 #define blk0(i) block->l[i]  argument
53 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \  argument
54     ^block->l[(i+2)&15]^block->l[i&15],1))
57 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);  argument
58 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);  argument
59 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);  argument
60 #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
61 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);  argument
129     unsigned int i, j;  in SHA1_Update()  local
135         memcpy(&context->buffer[j], data, (i = 64-j));  in SHA1_Update()
137         for ( ; i + 63 < len; i += 64) {  in SHA1_Update()
138             SHA1_Transform(context->state, &data[i]);  in SHA1_Update()
142     else i = 0;  in SHA1_Update()
143     memcpy(&context->buffer[j], &data[i], len - i);  in SHA1_Update()
149     sha1_quadbyte i, j;  in SHA1_Final()  local
152     for (i = 0; i < 8; i++) {  in SHA1_Final()
153         finalcount[i] = (sha1_byte)((context->count[(i >= 4 ? 0 : 1)]  in SHA1_Final()
154          >> ((3-(i & 3)) * 8) ) & 255);  /* Endian independent */  in SHA1_Final()
162     for (i = 0; i < SHA1_DIGEST_LENGTH; i++) {  in SHA1_Final()
163         digest[i] = (sha1_byte)  in SHA1_Final()
164          ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);  in SHA1_Final()
167     i = j = 0;  in SHA1_Final()