FFmpeg coverage

Directory:	../../../ffmpeg/
File:	src/libavutil/md5.c
Date:	2024-11-20 23:03:26

	Exec	Total	Coverage
Lines:	57	57	100.0%
Functions:	6	6	100.0%
Branches:	12	12	100.0%

  
      Line
      Branch
      Exec
      Source
    
      /*
    
       * Copyright (C) 2006 Michael Niedermayer (michaelni@gmx.at)
    
       * Copyright (C) 2003-2005 by Christopher R. Hertel (crh@ubiqx.mn.org)
    
       *
    
       * References:
    
       *  IETF RFC 1321: The MD5 Message-Digest Algorithm
    
       *       Ron Rivest. IETF, April, 1992
    
       *
    
       * based on http://ubiqx.org/libcifs/source/Auth/MD5.c
    
       *          from Christopher R. Hertel (crh@ubiqx.mn.org)
    
       * Simplified, cleaned and IMO redundant comments removed by Michael.
    
       *
    
       * If you use gcc, then version 4.1 or later and -fomit-frame-pointer is
    
       * strongly recommended.
    
       *
    
       * This file is part of FFmpeg.
    
       *
    
       * FFmpeg is free software; you can redistribute it and/or
    
       * modify it under the terms of the GNU Lesser General Public
    
       * License as published by the Free Software Foundation; either
    
       * version 2.1 of the License, or (at your option) any later version.
    
       *
    
       * FFmpeg is distributed in the hope that it will be useful,
    
       * but WITHOUT ANY WARRANTY; without even the implied warranty of
    
       * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
    
       * Lesser General Public License for more details.
    
       *
    
       * You should have received a copy of the GNU Lesser General Public
    
       * License along with FFmpeg; if not, write to the Free Software
    
       * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
    
       */
    
      #include <stdint.h>
    
      #include <string.h>
    
      #include "bswap.h"
    
      #include "intreadwrite.h"
    
      #include "macros.h"
    
      #include "mem.h"
    
      #include "md5.h"
    
      typedef struct AVMD5 {
    
          uint64_t len;
    
          uint8_t  block[64];
    
          uint32_t ABCD[4];
    
      } AVMD5;
    
      const int av_md5_size = sizeof(AVMD5);
    
      3844
      struct AVMD5 *av_md5_alloc(void)
    
      {
    
      3844
          return av_mallocz(sizeof(struct AVMD5));
    
      }
    
      static const uint8_t S[4][4] = {
    
          { 7, 12, 17, 22 },  /* round 1 */
    
          { 5,  9, 14, 20 },  /* round 2 */
    
          { 4, 11, 16, 23 },  /* round 3 */
    
          { 6, 10, 15, 21 }   /* round 4 */
    
      };
    
      static const uint32_t T[64] = { // T[i]= fabs(sin(i+1)<<32)
    
          0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,   /* round 1 */
    
          0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
    
          0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
    
          0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
    
          0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,   /* round 2 */
    
          0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
    
          0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
    
          0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
    
          0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,   /* round 3 */
    
          0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
    
          0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05,
    
          0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
    
          0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,   /* round 4 */
    
          0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
    
          0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
    
          0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391,
    
      };
    
      #define CORE(i, a, b, c, d)                                             \
    
          do {                                                                \
    
              t  = S[i >> 4][i & 3];                                          \
    
              a += T[i];                                                      \
    
                                                                              \
    
              if (i < 32) {                                                   \
    
                  if (i < 16)                                                 \
    
                      a += (d ^ (b & (c ^ d)))  + AV_RL32(X+(       i  & 15));\
    
                  else                                                        \
    
                      a += ((d & b) | (~d & c)) + AV_RL32(X+((1 + 5*i) & 15));\
    
              } else {                                                        \
    
                  if (i < 48)                                                 \
    
                      a += (b ^ c ^ d)          + AV_RL32(X+((5 + 3*i) & 15));\
    
                  else                                                        \
    
                      a += (c ^ (b | ~d))       + AV_RL32(X+((    7*i) & 15));\
    
              }                                                               \
    
              a = b + (a << t | a >> (32 - t));                               \
    
          } while (0)
    
      516450
      static void body(uint32_t ABCD[4], const uint8_t *src, size_t nblocks)
    
      {
    
          const uint32_t *X;
    
          uint32_t a, b, c, d, t;
    
        2/2✓ Branch 0 taken 67851263 times.
✓ Branch 1 taken 516450 times.

      68367713
          for (size_t n = 0; n < nblocks; n++) {
    
      67851263
              a = ABCD[3];
    
      67851263
              b = ABCD[2];
    
      67851263
              c = ABCD[1];
    
      67851263
              d = ABCD[0];
    
      67851263
              X = (const uint32_t *)src + n * 16;
    
      #if CONFIG_SMALL
    
              for (int i = 0; i < 64; i++) {
    
                  CORE(i, a, b, c, d);
    
                  t = d;
    
                  d = c;
    
                  c = b;
    
                  b = a;
    
                  a = t;
    
              }
    
      #else
    
      #define CORE2(i)                                                        \
    
              CORE(i, a, b, c, d); CORE((i + 1), d, a, b, c);                 \
    
              CORE((i + 2), c, d, a, b); CORE((i + 3), b, c, d, a)
    
      #define CORE4(i) CORE2(i); CORE2((i + 4)); CORE2((i + 8)); CORE2((i + 12))
    
      67851263
              CORE4(0);
    
      67851263
              CORE4(16);
    
      67851263
              CORE4(32);
    
      67851263
              CORE4(48);
    
      #endif
    
      67851263
              ABCD[0] += d;
    
      67851263
              ABCD[1] += c;
    
      67851263
              ABCD[2] += b;
    
      67851263
              ABCD[3] += a;
    
          }
    
      516450
      }
    
      14460
      void av_md5_init(AVMD5 *ctx)
    
      {
    
      14460
          ctx->len     = 0;
    
      14460
          ctx->ABCD[0] = 0x10325476;
    
      14460
          ctx->ABCD[1] = 0x98badcfe;
    
      14460
          ctx->ABCD[2] = 0xefcdab89;
    
      14460
          ctx->ABCD[3] = 0x67452301;
    
      14460
      }
    
      933374
      void av_md5_update(AVMD5 *ctx, const uint8_t *src, size_t len)
    
      {
    
          const uint8_t *end;
    
          int j;
    
      933374
          j         = ctx->len & 63;
    
      933374
          ctx->len += len;
    
        2/2✓ Branch 0 taken 831786 times.
✓ Branch 1 taken 101588 times.

      933374
          if (j) {
    
      831786
              int cnt = FFMIN(len, 64 - j);
    
      831786
              memcpy(ctx->block + j, src, cnt);
    
      831786
              src += cnt;
    
      831786
              len -= cnt;
    
        2/2✓ Branch 0 taken 624355 times.
✓ Branch 1 taken 207431 times.

      831786
              if (j + cnt < 64)
    
      624355
                  return;
    
      207431
              body(ctx->ABCD, ctx->block, 1);
    
          }
    
      309019
          end = src + (len & ~63);
    
          if (!HAVE_FAST_UNALIGNED && ((intptr_t)src & 3)) {
    
             while (src < end) {
    
                 memcpy(ctx->block, src, 64);
    
                 body(ctx->ABCD, ctx->block, 1);
    
                 src += 64;
    
              }
    
          } else {
    
      309019
              size_t nblocks = len / 64;
    
      309019
              body(ctx->ABCD, src, nblocks);
    
      309019
              src = end;
    
          }
    
      309019
          len &= 63;
    
        2/2✓ Branch 0 taken 207443 times.
✓ Branch 1 taken 101576 times.

      309019
          if (len > 0)
    
      207443
              memcpy(ctx->block, src, len);
    
      }
    
      14504
      void av_md5_final(AVMD5 *ctx, uint8_t *dst)
    
      {
    
          int i;
    
      14504
          uint64_t finalcount = av_le2ne64(ctx->len << 3);
    
      14504
          av_md5_update(ctx, "\200", 1);
    
        2/2✓ Branch 0 taken 614827 times.
✓ Branch 1 taken 14504 times.

      629331
          while ((ctx->len & 63) != 56)
    
      614827
              av_md5_update(ctx, "", 1);
    
      14504
          av_md5_update(ctx, (uint8_t *) &finalcount, 8);
    
        2/2✓ Branch 0 taken 58016 times.
✓ Branch 1 taken 14504 times.

      72520
          for (i = 0; i < 4; i++)
    
      58016
              AV_WL32(dst + 4 * i, ctx->ABCD[3 - i]);
    
      14504
      }
    
      4849
      void av_md5_sum(uint8_t *dst, const uint8_t *src, size_t len)
    
      {
    
          AVMD5 ctx;
    
      4849
          av_md5_init(&ctx);
    
      4849
          av_md5_update(&ctx, src, len);
    
      4849
          av_md5_final(&ctx, dst);
    
      4849
      }

Line	Branch	Exec	Source
1			/*
2			* Copyright (C) 2006 Michael Niedermayer (michaelni@gmx.at)
3			* Copyright (C) 2003-2005 by Christopher R. Hertel (crh@ubiqx.mn.org)
4			*
5			* References:
6			* IETF RFC 1321: The MD5 Message-Digest Algorithm
7			* Ron Rivest. IETF, April, 1992
8			*
9			* based on http://ubiqx.org/libcifs/source/Auth/MD5.c
10			* from Christopher R. Hertel (crh@ubiqx.mn.org)
11			* Simplified, cleaned and IMO redundant comments removed by Michael.
12			*
13			* If you use gcc, then version 4.1 or later and -fomit-frame-pointer is
14			* strongly recommended.
15			*
16			* This file is part of FFmpeg.
17			*
18			* FFmpeg is free software; you can redistribute it and/or
19			* modify it under the terms of the GNU Lesser General Public
20			* License as published by the Free Software Foundation; either
21			* version 2.1 of the License, or (at your option) any later version.
22			*
23			* FFmpeg is distributed in the hope that it will be useful,
24			* but WITHOUT ANY WARRANTY; without even the implied warranty of
25			* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
26			* Lesser General Public License for more details.
27			*
28			* You should have received a copy of the GNU Lesser General Public
29			* License along with FFmpeg; if not, write to the Free Software
30			* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
31			*/
32
33			#include <stdint.h>
34			#include <string.h>
35
36			#include "bswap.h"
37			#include "intreadwrite.h"
38			#include "macros.h"
39			#include "mem.h"
40			#include "md5.h"
41
42			typedef struct AVMD5 {
43			uint64_t len;
44			uint8_t block[64];
45			uint32_t ABCD[4];
46			} AVMD5;
47
48			const int av_md5_size = sizeof(AVMD5);
49
50		3844	struct AVMD5 *av_md5_alloc(void)
51			{
52		3844	return av_mallocz(sizeof(struct AVMD5));
53			}
54
55			static const uint8_t S[4][4] = {
56			{ 7, 12, 17, 22 }, /* round 1 */
57			{ 5, 9, 14, 20 }, /* round 2 */
58			{ 4, 11, 16, 23 }, /* round 3 */
59			{ 6, 10, 15, 21 } /* round 4 */
60			};
61
62			static const uint32_t T[64] = { // T[i]= fabs(sin(i+1)<<32)
63			0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee, /* round 1 */
64			0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
65			0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
66			0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
67
68			0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa, /* round 2 */
69			0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
70			0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
71			0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
72
73			0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c, /* round 3 */
74			0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
75			0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05,
76			0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
77
78			0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039, /* round 4 */
79			0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
80			0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
81			0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391,
82			};
83
84			#define CORE(i, a, b, c, d) \
85			do { \
86			t = S[i >> 4][i & 3]; \
87			a += T[i]; \
88			\
89			if (i < 32) { \
90			if (i < 16) \
91			a += (d ^ (b & (c ^ d))) + AV_RL32(X+( i & 15));\
92			else \
93			a += ((d & b) \| (~d & c)) + AV_RL32(X+((1 + 5*i) & 15));\
94			} else { \
95			if (i < 48) \
96			a += (b ^ c ^ d) + AV_RL32(X+((5 + 3*i) & 15));\
97			else \
98			a += (c ^ (b \| ~d)) + AV_RL32(X+(( 7*i) & 15));\
99			} \
100			a = b + (a << t \| a >> (32 - t)); \
101			} while (0)
102
103		516450	static void body(uint32_t ABCD[4], const uint8_t *src, size_t nblocks)
104			{
105			const uint32_t *X;
106			uint32_t a, b, c, d, t;
107
108	2/2 ✓ Branch 0 taken 67851263 times. ✓ Branch 1 taken 516450 times.	68367713	for (size_t n = 0; n < nblocks; n++) {
109		67851263	a = ABCD[3];
110		67851263	b = ABCD[2];
111		67851263	c = ABCD[1];
112		67851263	d = ABCD[0];
113
114		67851263	X = (const uint32_t )src + n 16;
115
116			#if CONFIG_SMALL
117			for (int i = 0; i < 64; i++) {
118			CORE(i, a, b, c, d);
119			t = d;
120			d = c;
121			c = b;
122			b = a;
123			a = t;
124			}
125			#else
126			#define CORE2(i) \
127			CORE(i, a, b, c, d); CORE((i + 1), d, a, b, c); \
128			CORE((i + 2), c, d, a, b); CORE((i + 3), b, c, d, a)
129			#define CORE4(i) CORE2(i); CORE2((i + 4)); CORE2((i + 8)); CORE2((i + 12))
130		67851263	CORE4(0);
131		67851263	CORE4(16);
132		67851263	CORE4(32);
133		67851263	CORE4(48);
134			#endif
135
136		67851263	ABCD[0] += d;
137		67851263	ABCD[1] += c;
138		67851263	ABCD[2] += b;
139		67851263	ABCD[3] += a;
140			}
141		516450	}
142
143		14460	void av_md5_init(AVMD5 *ctx)
144			{
145		14460	ctx->len = 0;
146
147		14460	ctx->ABCD[0] = 0x10325476;
148		14460	ctx->ABCD[1] = 0x98badcfe;
149		14460	ctx->ABCD[2] = 0xefcdab89;
150		14460	ctx->ABCD[3] = 0x67452301;
151		14460	}
152
153		933374	void av_md5_update(AVMD5 ctx, const uint8_t src, size_t len)
154			{
155			const uint8_t *end;
156			int j;
157
158		933374	j = ctx->len & 63;
159		933374	ctx->len += len;
160
161	2/2 ✓ Branch 0 taken 831786 times. ✓ Branch 1 taken 101588 times.	933374	if (j) {
162		831786	int cnt = FFMIN(len, 64 - j);
163		831786	memcpy(ctx->block + j, src, cnt);
164		831786	src += cnt;
165		831786	len -= cnt;
166	2/2 ✓ Branch 0 taken 624355 times. ✓ Branch 1 taken 207431 times.	831786	if (j + cnt < 64)
167		624355	return;
168		207431	body(ctx->ABCD, ctx->block, 1);
169			}
170
171		309019	end = src + (len & ~63);
172			if (!HAVE_FAST_UNALIGNED && ((intptr_t)src & 3)) {
173			while (src < end) {
174			memcpy(ctx->block, src, 64);
175			body(ctx->ABCD, ctx->block, 1);
176			src += 64;
177			}
178			} else {
179		309019	size_t nblocks = len / 64;
180		309019	body(ctx->ABCD, src, nblocks);
181		309019	src = end;
182			}
183		309019	len &= 63;
184	2/2 ✓ Branch 0 taken 207443 times. ✓ Branch 1 taken 101576 times.	309019	if (len > 0)
185		207443	memcpy(ctx->block, src, len);
186			}
187
188		14504	void av_md5_final(AVMD5 ctx, uint8_t dst)
189			{
190			int i;
191		14504	uint64_t finalcount = av_le2ne64(ctx->len << 3);
192
193		14504	av_md5_update(ctx, "\200", 1);
194	2/2 ✓ Branch 0 taken 614827 times. ✓ Branch 1 taken 14504 times.	629331	while ((ctx->len & 63) != 56)
195		614827	av_md5_update(ctx, "", 1);
196
197		14504	av_md5_update(ctx, (uint8_t *) &finalcount, 8);
198
199	2/2 ✓ Branch 0 taken 58016 times. ✓ Branch 1 taken 14504 times.	72520	for (i = 0; i < 4; i++)
200		58016	AV_WL32(dst + 4 * i, ctx->ABCD[3 - i]);
201		14504	}
202
203		4849	void av_md5_sum(uint8_t dst, const uint8_t src, size_t len)
204			{
205			AVMD5 ctx;
206
207		4849	av_md5_init(&ctx);
208		4849	av_md5_update(&ctx, src, len);
209		4849	av_md5_final(&ctx, dst);
210		4849	}
211

Function (Line)	Call count	Block coverage
av_md5_alloc (line 50)	called 3844 times, returned 3844 times	100.0%
av_md5_final (line 188)	called 14504 times, returned 14504 times	100.0%
av_md5_init (line 143)	called 14460 times, returned 14460 times	100.0%
av_md5_sum (line 203)	called 4849 times, returned 4849 times	100.0%
av_md5_update (line 153)	called 933374 times, returned 933374 times	100.0%
body (line 103)	called 516450 times, returned 516450 times	100.0%