tools/../../3rdparty/md5/md5.cpp

Source codeSwitch to Preprocessed file
LineSource CodeCoverage
1/* -
2 * This code implements the MD5 message-digest algorithm. -
3 * The algorithm is due to Ron Rivest. This code was -
4 * written by Colin Plumb in 1993, no copyright is claimed. -
5 * This code is in the public domain; do with it what you wish. -
6 * -
7 * Equivalent code is available from RSA Data Security, Inc. -
8 * This code has been tested against that, and is equivalent, -
9 * except that you don't need to include two pages of legalese -
10 * with every copy. -
11 * -
12 * To compute the message digest of a chunk of bytes, declare an -
13 * MD5Context structure, pass it to MD5Init, call MD5Update as -
14 * needed on buffers full of bytes, and then call MD5Final, which -
15 * will fill a supplied 16-byte array with the digest. -
16 * -
17 * Changed so as no longer to depend on Colin Plumb's `usual.h' header -
18 * definitions; now uses stuff from dpkg's config.h. -
19 * - Ian Jackson <ian@chiark.greenend.org.uk>. -
20 * Still in the public domain. -
21 */ -
22 -
23#include <string.h> /* for memcpy() */ -
24#ifndef _WIN32_WCE -
25#include <sys/types.h> /* for stupid systems */ -
26#else -
27#include <windef.h> -
28#include <types.h> -
29#endif -
30 -
31#include "md5.h" -
32 -
33QT_BEGIN_NAMESPACE -
34 -
35static void -
36byteSwap(UWORD32 *buf, unsigned words) -
37{ -
38 const quint32 byteOrderTest = 0x1;
executed (the execution status of this line is deduced): const quint32 byteOrderTest = 0x1;
-
39 if (((char *)&byteOrderTest)[0] == 0) {
partially evaluated: ((char *)&byteOrderTest)[0] == 0
TRUEFALSE
no
Evaluation Count:0
yes
Evaluation Count:641059
0-641059
40 md5byte *p = (md5byte *)buf;
never executed (the execution status of this line is deduced): md5byte *p = (md5byte *)buf;
-
41 -
42 do { -
43 *buf++ = (UWORD32)((unsigned)p[3] << 8 | p[2]) << 16 |
never executed (the execution status of this line is deduced): *buf++ = (UWORD32)((unsigned)p[3] << 8 | p[2]) << 16 |
-
44 ((unsigned)p[1] << 8 | p[0]);
never executed (the execution status of this line is deduced): ((unsigned)p[1] << 8 | p[0]);
-
45 p += 4;
never executed (the execution status of this line is deduced): p += 4;
-
46 } while (--words);
never executed: }
never evaluated: --words
0
47 }
never executed: }
0
48}
executed: }
Execution Count:641059
641059
49 -
50/* -
51 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious -
52 * initialization constants. -
53 */ -
54static void -
55MD5Init(struct MD5Context *ctx) -
56{ -
57 ctx->buf[0] = 0x67452301;
executed (the execution status of this line is deduced): ctx->buf[0] = 0x67452301;
-
58 ctx->buf[1] = 0xefcdab89;
executed (the execution status of this line is deduced): ctx->buf[1] = 0xefcdab89;
-
59 ctx->buf[2] = 0x98badcfe;
executed (the execution status of this line is deduced): ctx->buf[2] = 0x98badcfe;
-
60 ctx->buf[3] = 0x10325476;
executed (the execution status of this line is deduced): ctx->buf[3] = 0x10325476;
-
61 -
62 ctx->bytes[0] = 0;
executed (the execution status of this line is deduced): ctx->bytes[0] = 0;
-
63 ctx->bytes[1] = 0;
executed (the execution status of this line is deduced): ctx->bytes[1] = 0;
-
64}
executed: }
Execution Count:2120
2120
65 -
66/* -
67 * Update context to reflect the concatenation of another buffer full -
68 * of bytes. -
69 */ -
70static void -
71MD5Update(struct MD5Context *ctx, md5byte const *buf, unsigned len) -
72{ -
73 UWORD32 t;
executed (the execution status of this line is deduced): UWORD32 t;
-
74 -
75 /* Update byte count */ -
76 -
77 t = ctx->bytes[0];
executed (the execution status of this line is deduced): t = ctx->bytes[0];
-
78 if ((ctx->bytes[0] = t + len) < t)
partially evaluated: (ctx->bytes[0] = t + len) < t
TRUEFALSE
no
Evaluation Count:0
yes
Evaluation Count:2657
0-2657
79 ctx->bytes[1]++; /* Carry from low to high */
never executed: ctx->bytes[1]++;
0
80 -
81 t = 64 - (t & 0x3f); /* Space available in ctx->in (at least 1) */
executed (the execution status of this line is deduced): t = 64 - (t & 0x3f);
-
82 if (t > len) {
evaluated: t > len
TRUEFALSE
yes
Evaluation Count:2453
yes
Evaluation Count:204
204-2453
83 memcpy((md5byte *)ctx->in + 64 - t, buf, len);
executed (the execution status of this line is deduced): memcpy((md5byte *)ctx->in + 64 - t, buf, len);
-
84 return;
executed: return;
Execution Count:2453
2453
85 } -
86 /* First chunk is an odd size */ -
87 memcpy((md5byte *)ctx->in + 64 - t, buf, t);
executed (the execution status of this line is deduced): memcpy((md5byte *)ctx->in + 64 - t, buf, t);
-
88 byteSwap(ctx->in, 16);
executed (the execution status of this line is deduced): byteSwap(ctx->in, 16);
-
89 MD5Transform(ctx->buf, ctx->in);
executed (the execution status of this line is deduced): MD5Transform(ctx->buf, ctx->in);
-
90 buf += t;
executed (the execution status of this line is deduced): buf += t;
-
91 len -= t;
executed (the execution status of this line is deduced): len -= t;
-
92 -
93 /* Process data in 64-byte chunks */ -
94 while (len >= 64) {
evaluated: len >= 64
TRUEFALSE
yes
Evaluation Count:636611
yes
Evaluation Count:204
204-636611
95 memcpy(ctx->in, buf, 64);
executed (the execution status of this line is deduced): memcpy(ctx->in, buf, 64);
-
96 byteSwap(ctx->in, 16);
executed (the execution status of this line is deduced): byteSwap(ctx->in, 16);
-
97 MD5Transform(ctx->buf, ctx->in);
executed (the execution status of this line is deduced): MD5Transform(ctx->buf, ctx->in);
-
98 buf += 64;
executed (the execution status of this line is deduced): buf += 64;
-
99 len -= 64;
executed (the execution status of this line is deduced): len -= 64;
-
100 }
executed: }
Execution Count:636611
636611
101 -
102 /* Handle any remaining bytes of data. */ -
103 memcpy(ctx->in, buf, len);
executed (the execution status of this line is deduced): memcpy(ctx->in, buf, len);
-
104}
executed: }
Execution Count:204
204
105 -
106/* -
107 * Final wrapup - pad to 64-byte boundary with the bit pattern -
108 * 1 0* (64-bit count of bits processed, MSB-first) -
109 */ -
110static void -
111MD5Final(struct MD5Context *ctx, md5byte digest[16]) -
112{ -
113 int count = ctx->bytes[0] & 0x3f; /* Number of bytes in ctx->in */
executed (the execution status of this line is deduced): int count = ctx->bytes[0] & 0x3f;
-
114 md5byte *p = (md5byte *)ctx->in + count;
executed (the execution status of this line is deduced): md5byte *p = (md5byte *)ctx->in + count;
-
115 -
116 /* Set the first char of padding to 0x80. There is always room. */ -
117 *p++ = 0x80;
executed (the execution status of this line is deduced): *p++ = 0x80;
-
118 -
119 /* Bytes of padding needed to make 56 bytes (-8..55) */ -
120 count = 56 - 1 - count;
executed (the execution status of this line is deduced): count = 56 - 1 - count;
-
121 -
122 if (count < 0) { /* Padding forces an extra block */
evaluated: count < 0
TRUEFALSE
yes
Evaluation Count:4
yes
Evaluation Count:2116
4-2116
123 memset(p, 0, count + 8);
executed (the execution status of this line is deduced): memset(p, 0, count + 8);
-
124 byteSwap(ctx->in, 16);
executed (the execution status of this line is deduced): byteSwap(ctx->in, 16);
-
125 MD5Transform(ctx->buf, ctx->in);
executed (the execution status of this line is deduced): MD5Transform(ctx->buf, ctx->in);
-
126 p = (md5byte *)ctx->in;
executed (the execution status of this line is deduced): p = (md5byte *)ctx->in;
-
127 count = 56;
executed (the execution status of this line is deduced): count = 56;
-
128 }
executed: }
Execution Count:4
4
129 memset(p, 0, count);
executed (the execution status of this line is deduced): memset(p, 0, count);
-
130 byteSwap(ctx->in, 14);
executed (the execution status of this line is deduced): byteSwap(ctx->in, 14);
-
131 -
132 /* Append length in bits and transform */ -
133 ctx->in[14] = ctx->bytes[0] << 3;
executed (the execution status of this line is deduced): ctx->in[14] = ctx->bytes[0] << 3;
-
134 ctx->in[15] = ctx->bytes[1] << 3 | ctx->bytes[0] >> 29;
executed (the execution status of this line is deduced): ctx->in[15] = ctx->bytes[1] << 3 | ctx->bytes[0] >> 29;
-
135 MD5Transform(ctx->buf, ctx->in);
executed (the execution status of this line is deduced): MD5Transform(ctx->buf, ctx->in);
-
136 -
137 byteSwap(ctx->buf, 4);
executed (the execution status of this line is deduced): byteSwap(ctx->buf, 4);
-
138 memcpy(digest, ctx->buf, 16);
executed (the execution status of this line is deduced): memcpy(digest, ctx->buf, 16);
-
139 memset(ctx, 0, sizeof(*ctx)); /* In case it's sensitive */
executed (the execution status of this line is deduced): memset(ctx, 0, sizeof(*ctx));
-
140}
executed: }
Execution Count:2120
2120
141 -
142#ifndef ASM_MD5 -
143 -
144/* The four core functions - F1 is optimized somewhat */ -
145 -
146/* #define F1(x, y, z) (x & y | ~x & z) */ -
147#define F1(x, y, z) (z ^ (x & (y ^ z))) -
148#define F2(x, y, z) F1(z, x, y) -
149#define F3(x, y, z) (x ^ y ^ z) -
150#define F4(x, y, z) (y ^ (x | ~z)) -
151 -
152/* This is the central step in the MD5 algorithm. */ -
153#define MD5STEP(f,w,x,y,z,in,s) \ -
154 (w += f(x,y,z) + in, w = (w<<s | w>>(32-s)) + x) -
155 -
156/* -
157 * The core of the MD5 algorithm, this alters an existing MD5 hash to -
158 * reflect the addition of 16 longwords of new data. MD5Update blocks -
159 * the data and converts bytes into longwords for this routine. -
160 */ -
161static void -
162MD5Transform(UWORD32 buf[4], UWORD32 const in[16]) -
163{ -
164 register UWORD32 a, b, c, d;
executed (the execution status of this line is deduced): register UWORD32 a, b, c, d;
-
165 -
166 a = buf[0];
executed (the execution status of this line is deduced): a = buf[0];
-
167 b = buf[1];
executed (the execution status of this line is deduced): b = buf[1];
-
168 c = buf[2];
executed (the execution status of this line is deduced): c = buf[2];
-
169 d = buf[3];
executed (the execution status of this line is deduced): d = buf[3];
-
170 -
171 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
executed (the execution status of this line is deduced): (a += (d ^ (b & (c ^ d))) + in[0] + 0xd76aa478, a = (a<<7 | a>>(32-7)) + b);
-
172 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
executed (the execution status of this line is deduced): (d += (c ^ (a & (b ^ c))) + in[1] + 0xe8c7b756, d = (d<<12 | d>>(32-12)) + a);
-
173 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
executed (the execution status of this line is deduced): (c += (b ^ (d & (a ^ b))) + in[2] + 0x242070db, c = (c<<17 | c>>(32-17)) + d);
-
174 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
executed (the execution status of this line is deduced): (b += (a ^ (c & (d ^ a))) + in[3] + 0xc1bdceee, b = (b<<22 | b>>(32-22)) + c);
-
175 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
executed (the execution status of this line is deduced): (a += (d ^ (b & (c ^ d))) + in[4] + 0xf57c0faf, a = (a<<7 | a>>(32-7)) + b);
-
176 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
executed (the execution status of this line is deduced): (d += (c ^ (a & (b ^ c))) + in[5] + 0x4787c62a, d = (d<<12 | d>>(32-12)) + a);
-
177 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
executed (the execution status of this line is deduced): (c += (b ^ (d & (a ^ b))) + in[6] + 0xa8304613, c = (c<<17 | c>>(32-17)) + d);
-
178 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
executed (the execution status of this line is deduced): (b += (a ^ (c & (d ^ a))) + in[7] + 0xfd469501, b = (b<<22 | b>>(32-22)) + c);
-
179 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
executed (the execution status of this line is deduced): (a += (d ^ (b & (c ^ d))) + in[8] + 0x698098d8, a = (a<<7 | a>>(32-7)) + b);
-
180 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
executed (the execution status of this line is deduced): (d += (c ^ (a & (b ^ c))) + in[9] + 0x8b44f7af, d = (d<<12 | d>>(32-12)) + a);
-
181 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
executed (the execution status of this line is deduced): (c += (b ^ (d & (a ^ b))) + in[10] + 0xffff5bb1, c = (c<<17 | c>>(32-17)) + d);
-
182 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
executed (the execution status of this line is deduced): (b += (a ^ (c & (d ^ a))) + in[11] + 0x895cd7be, b = (b<<22 | b>>(32-22)) + c);
-
183 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
executed (the execution status of this line is deduced): (a += (d ^ (b & (c ^ d))) + in[12] + 0x6b901122, a = (a<<7 | a>>(32-7)) + b);
-
184 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
executed (the execution status of this line is deduced): (d += (c ^ (a & (b ^ c))) + in[13] + 0xfd987193, d = (d<<12 | d>>(32-12)) + a);
-
185 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
executed (the execution status of this line is deduced): (c += (b ^ (d & (a ^ b))) + in[14] + 0xa679438e, c = (c<<17 | c>>(32-17)) + d);
-
186 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
executed (the execution status of this line is deduced): (b += (a ^ (c & (d ^ a))) + in[15] + 0x49b40821, b = (b<<22 | b>>(32-22)) + c);
-
187 -
188 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
executed (the execution status of this line is deduced): (a += (c ^ (d & (b ^ c))) + in[1] + 0xf61e2562, a = (a<<5 | a>>(32-5)) + b);
-
189 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
executed (the execution status of this line is deduced): (d += (b ^ (c & (a ^ b))) + in[6] + 0xc040b340, d = (d<<9 | d>>(32-9)) + a);
-
190 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
executed (the execution status of this line is deduced): (c += (a ^ (b & (d ^ a))) + in[11] + 0x265e5a51, c = (c<<14 | c>>(32-14)) + d);
-
191 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
executed (the execution status of this line is deduced): (b += (d ^ (a & (c ^ d))) + in[0] + 0xe9b6c7aa, b = (b<<20 | b>>(32-20)) + c);
-
192 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
executed (the execution status of this line is deduced): (a += (c ^ (d & (b ^ c))) + in[5] + 0xd62f105d, a = (a<<5 | a>>(32-5)) + b);
-
193 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
executed (the execution status of this line is deduced): (d += (b ^ (c & (a ^ b))) + in[10] + 0x02441453, d = (d<<9 | d>>(32-9)) + a);
-
194 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
executed (the execution status of this line is deduced): (c += (a ^ (b & (d ^ a))) + in[15] + 0xd8a1e681, c = (c<<14 | c>>(32-14)) + d);
-
195 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
executed (the execution status of this line is deduced): (b += (d ^ (a & (c ^ d))) + in[4] + 0xe7d3fbc8, b = (b<<20 | b>>(32-20)) + c);
-
196 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
executed (the execution status of this line is deduced): (a += (c ^ (d & (b ^ c))) + in[9] + 0x21e1cde6, a = (a<<5 | a>>(32-5)) + b);
-
197 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
executed (the execution status of this line is deduced): (d += (b ^ (c & (a ^ b))) + in[14] + 0xc33707d6, d = (d<<9 | d>>(32-9)) + a);
-
198 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
executed (the execution status of this line is deduced): (c += (a ^ (b & (d ^ a))) + in[3] + 0xf4d50d87, c = (c<<14 | c>>(32-14)) + d);
-
199 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
executed (the execution status of this line is deduced): (b += (d ^ (a & (c ^ d))) + in[8] + 0x455a14ed, b = (b<<20 | b>>(32-20)) + c);
-
200 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
executed (the execution status of this line is deduced): (a += (c ^ (d & (b ^ c))) + in[13] + 0xa9e3e905, a = (a<<5 | a>>(32-5)) + b);
-
201 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
executed (the execution status of this line is deduced): (d += (b ^ (c & (a ^ b))) + in[2] + 0xfcefa3f8, d = (d<<9 | d>>(32-9)) + a);
-
202 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
executed (the execution status of this line is deduced): (c += (a ^ (b & (d ^ a))) + in[7] + 0x676f02d9, c = (c<<14 | c>>(32-14)) + d);
-
203 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
executed (the execution status of this line is deduced): (b += (d ^ (a & (c ^ d))) + in[12] + 0x8d2a4c8a, b = (b<<20 | b>>(32-20)) + c);
-
204 -
205 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
executed (the execution status of this line is deduced): (a += (b ^ c ^ d) + in[5] + 0xfffa3942, a = (a<<4 | a>>(32-4)) + b);
-
206 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
executed (the execution status of this line is deduced): (d += (a ^ b ^ c) + in[8] + 0x8771f681, d = (d<<11 | d>>(32-11)) + a);
-
207 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
executed (the execution status of this line is deduced): (c += (d ^ a ^ b) + in[11] + 0x6d9d6122, c = (c<<16 | c>>(32-16)) + d);
-
208 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
executed (the execution status of this line is deduced): (b += (c ^ d ^ a) + in[14] + 0xfde5380c, b = (b<<23 | b>>(32-23)) + c);
-
209 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
executed (the execution status of this line is deduced): (a += (b ^ c ^ d) + in[1] + 0xa4beea44, a = (a<<4 | a>>(32-4)) + b);
-
210 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
executed (the execution status of this line is deduced): (d += (a ^ b ^ c) + in[4] + 0x4bdecfa9, d = (d<<11 | d>>(32-11)) + a);
-
211 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
executed (the execution status of this line is deduced): (c += (d ^ a ^ b) + in[7] + 0xf6bb4b60, c = (c<<16 | c>>(32-16)) + d);
-
212 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
executed (the execution status of this line is deduced): (b += (c ^ d ^ a) + in[10] + 0xbebfbc70, b = (b<<23 | b>>(32-23)) + c);
-
213 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
executed (the execution status of this line is deduced): (a += (b ^ c ^ d) + in[13] + 0x289b7ec6, a = (a<<4 | a>>(32-4)) + b);
-
214 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
executed (the execution status of this line is deduced): (d += (a ^ b ^ c) + in[0] + 0xeaa127fa, d = (d<<11 | d>>(32-11)) + a);
-
215 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
executed (the execution status of this line is deduced): (c += (d ^ a ^ b) + in[3] + 0xd4ef3085, c = (c<<16 | c>>(32-16)) + d);
-
216 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
executed (the execution status of this line is deduced): (b += (c ^ d ^ a) + in[6] + 0x04881d05, b = (b<<23 | b>>(32-23)) + c);
-
217 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
executed (the execution status of this line is deduced): (a += (b ^ c ^ d) + in[9] + 0xd9d4d039, a = (a<<4 | a>>(32-4)) + b);
-
218 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
executed (the execution status of this line is deduced): (d += (a ^ b ^ c) + in[12] + 0xe6db99e5, d = (d<<11 | d>>(32-11)) + a);
-
219 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
executed (the execution status of this line is deduced): (c += (d ^ a ^ b) + in[15] + 0x1fa27cf8, c = (c<<16 | c>>(32-16)) + d);
-
220 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
executed (the execution status of this line is deduced): (b += (c ^ d ^ a) + in[2] + 0xc4ac5665, b = (b<<23 | b>>(32-23)) + c);
-
221 -
222 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
executed (the execution status of this line is deduced): (a += (c ^ (b | ~d)) + in[0] + 0xf4292244, a = (a<<6 | a>>(32-6)) + b);
-
223 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
executed (the execution status of this line is deduced): (d += (b ^ (a | ~c)) + in[7] + 0x432aff97, d = (d<<10 | d>>(32-10)) + a);
-
224 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
executed (the execution status of this line is deduced): (c += (a ^ (d | ~b)) + in[14] + 0xab9423a7, c = (c<<15 | c>>(32-15)) + d);
-
225 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
executed (the execution status of this line is deduced): (b += (d ^ (c | ~a)) + in[5] + 0xfc93a039, b = (b<<21 | b>>(32-21)) + c);
-
226 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
executed (the execution status of this line is deduced): (a += (c ^ (b | ~d)) + in[12] + 0x655b59c3, a = (a<<6 | a>>(32-6)) + b);
-
227 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
executed (the execution status of this line is deduced): (d += (b ^ (a | ~c)) + in[3] + 0x8f0ccc92, d = (d<<10 | d>>(32-10)) + a);
-
228 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
executed (the execution status of this line is deduced): (c += (a ^ (d | ~b)) + in[10] + 0xffeff47d, c = (c<<15 | c>>(32-15)) + d);
-
229 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
executed (the execution status of this line is deduced): (b += (d ^ (c | ~a)) + in[1] + 0x85845dd1, b = (b<<21 | b>>(32-21)) + c);
-
230 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
executed (the execution status of this line is deduced): (a += (c ^ (b | ~d)) + in[8] + 0x6fa87e4f, a = (a<<6 | a>>(32-6)) + b);
-
231 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
executed (the execution status of this line is deduced): (d += (b ^ (a | ~c)) + in[15] + 0xfe2ce6e0, d = (d<<10 | d>>(32-10)) + a);
-
232 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
executed (the execution status of this line is deduced): (c += (a ^ (d | ~b)) + in[6] + 0xa3014314, c = (c<<15 | c>>(32-15)) + d);
-
233 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
executed (the execution status of this line is deduced): (b += (d ^ (c | ~a)) + in[13] + 0x4e0811a1, b = (b<<21 | b>>(32-21)) + c);
-
234 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
executed (the execution status of this line is deduced): (a += (c ^ (b | ~d)) + in[4] + 0xf7537e82, a = (a<<6 | a>>(32-6)) + b);
-
235 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
executed (the execution status of this line is deduced): (d += (b ^ (a | ~c)) + in[11] + 0xbd3af235, d = (d<<10 | d>>(32-10)) + a);
-
236 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
executed (the execution status of this line is deduced): (c += (a ^ (d | ~b)) + in[2] + 0x2ad7d2bb, c = (c<<15 | c>>(32-15)) + d);
-
237 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
executed (the execution status of this line is deduced): (b += (d ^ (c | ~a)) + in[9] + 0xeb86d391, b = (b<<21 | b>>(32-21)) + c);
-
238 -
239 buf[0] += a;
executed (the execution status of this line is deduced): buf[0] += a;
-
240 buf[1] += b;
executed (the execution status of this line is deduced): buf[1] += b;
-
241 buf[2] += c;
executed (the execution status of this line is deduced): buf[2] += c;
-
242 buf[3] += d;
executed (the execution status of this line is deduced): buf[3] += d;
-
243}
executed: }
Execution Count:638939
638939
244 -
245#endif -
246 -
247QT_END_NAMESPACE -
248 -
Source codeSwitch to Preprocessed file
Generated by Squish Coco Non-Commercial