Lines Matching refs:i
42 ulong32 a,b,c,d,e,W[80],i; in ss_sha1_compress() local
48 for (i = 0; i < 16; i++) { in ss_sha1_compress()
49 LOAD32H(W[i], buf + (4*i)); in ss_sha1_compress()
60 for (i = 16; i < 80; i++) { in ss_sha1_compress()
61 W[i] = ROL(W[i-3] ^ W[i-8] ^ W[i-14] ^ W[i-16], 1); in ss_sha1_compress()
66 … #define FF0(a,b,c,d,e,i) e = (ROLc(a, 5) + F0(b,c,d) + e + W[i] + 0x5a827999UL); b = ROLc(b, 30); in ss_sha1_compress() argument
67 … #define FF1(a,b,c,d,e,i) e = (ROLc(a, 5) + F1(b,c,d) + e + W[i] + 0x6ed9eba1UL); b = ROLc(b, 30); in ss_sha1_compress() argument
68 … #define FF2(a,b,c,d,e,i) e = (ROLc(a, 5) + F2(b,c,d) + e + W[i] + 0x8f1bbcdcUL); b = ROLc(b, 30); in ss_sha1_compress() argument
69 … #define FF3(a,b,c,d,e,i) e = (ROLc(a, 5) + F3(b,c,d) + e + W[i] + 0xca62c1d6UL); b = ROLc(b, 30); in ss_sha1_compress() argument
73 for (i = 0; i < 20; ) { in ss_sha1_compress()
74 FF0(a,b,c,d,e,i++); t = e; e = d; d = c; c = b; b = a; a = t; in ss_sha1_compress()
77 for (; i < 40; ) { in ss_sha1_compress()
78 FF1(a,b,c,d,e,i++); t = e; e = d; d = c; c = b; b = a; a = t; in ss_sha1_compress()
81 for (; i < 60; ) { in ss_sha1_compress()
82 FF2(a,b,c,d,e,i++); t = e; e = d; d = c; c = b; b = a; a = t; in ss_sha1_compress()
85 for (; i < 80; ) { in ss_sha1_compress()
86 FF3(a,b,c,d,e,i++); t = e; e = d; d = c; c = b; b = a; a = t; in ss_sha1_compress()
91 for (i = 0; i < 20; ) { in ss_sha1_compress()
92 FF0(a,b,c,d,e,i++); in ss_sha1_compress()
93 FF0(e,a,b,c,d,i++); in ss_sha1_compress()
94 FF0(d,e,a,b,c,i++); in ss_sha1_compress()
95 FF0(c,d,e,a,b,i++); in ss_sha1_compress()
96 FF0(b,c,d,e,a,i++); in ss_sha1_compress()
100 for (; i < 40; ) { in ss_sha1_compress()
101 FF1(a,b,c,d,e,i++); in ss_sha1_compress()
102 FF1(e,a,b,c,d,i++); in ss_sha1_compress()
103 FF1(d,e,a,b,c,i++); in ss_sha1_compress()
104 FF1(c,d,e,a,b,i++); in ss_sha1_compress()
105 FF1(b,c,d,e,a,i++); in ss_sha1_compress()
109 for (; i < 60; ) { in ss_sha1_compress()
110 FF2(a,b,c,d,e,i++); in ss_sha1_compress()
111 FF2(e,a,b,c,d,i++); in ss_sha1_compress()
112 FF2(d,e,a,b,c,i++); in ss_sha1_compress()
113 FF2(c,d,e,a,b,i++); in ss_sha1_compress()
114 FF2(b,c,d,e,a,i++); in ss_sha1_compress()
118 for (; i < 80; ) { in ss_sha1_compress()
119 FF3(a,b,c,d,e,i++); in ss_sha1_compress()
120 FF3(e,a,b,c,d,i++); in ss_sha1_compress()
121 FF3(d,e,a,b,c,i++); in ss_sha1_compress()
122 FF3(c,d,e,a,b,i++); in ss_sha1_compress()
123 FF3(b,c,d,e,a,i++); in ss_sha1_compress()
187 int i; in sha1_done() local
224 for (i = 0; i < 5; i++) { in sha1_done()
225 STORE32H(md->sha1.state[i], out+(4*i)); in sha1_done()
258 int i; in sha1_test()
262 for (i = 0; i < (int)(sizeof(tests) / sizeof(tests[0])); i++) { in sha1_test()
264 sha1_process(&md, (unsigned char*)tests[i].msg, (unsigned long)XSTRLEN(tests[i].msg)); in sha1_test()
266 if (compare_testvector(tmp, sizeof(tmp), tests[i].hash, sizeof(tests[i].hash), "SHA1", i)) { in sha1_test()