FFmpeg coverage

Directory:	../../../ffmpeg/
File:	src/libavcodec/faandct.c
Date:	2026-09-14 12:48:48

	Exec	Total	Coverage
Lines:	68	101	67.3%
Functions:	2	3	66.7%
Branches:	4	6	66.7%

  
      Line
      Branch
      Exec
      Source
    
      /*
    
       * Floating point AAN DCT
    
       * this implementation is based upon the IJG integer AAN DCT (see jfdctfst.c)
    
       *
    
       * Copyright (c) 2003 Michael Niedermayer <michaelni@gmx.at>
    
       * Copyright (c) 2003 Roman Shaposhnik
    
       *
    
       * Permission to use, copy, modify, and/or distribute this software for any
    
       * purpose with or without fee is hereby granted, provided that the above
    
       * copyright notice and this permission notice appear in all copies.
    
       *
    
       * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
    
       * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
    
       * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
    
       * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
    
       * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
    
       * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
    
       * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
    
       */
    
      /**
    
       * @file
    
       * @brief
    
       *     Floating point AAN DCT
    
       * @author Michael Niedermayer <michaelni@gmx.at>
    
       */
    
      #include <math.h>
    
      #include "faandct.h"
    
      #include "libavutil/emms.h"
    
      #include "libavutil/internal.h"
    
      #include "libavutil/mathematics.h"
    
      typedef float FLOAT;
    
      /* numbers generated by arbitrary precision arithmetic followed by truncation
    
      to 36 fractional digits (enough for a 128-bit IEEE quad, see /usr/include/math.h
    
      for this approach). Unfortunately, long double is not always available correctly,
    
      e.g ppc has issues.
    
      TODO: add L suffixes when ppc and toolchains sort out their stuff.
    
      */
    
      #define B0 1.000000000000000000000000000000000000
    
      #define B1 0.720959822006947913789091890943021267 // (cos(pi*1/16)sqrt(2))^-1
    
      #define B2 0.765366864730179543456919968060797734 // (cos(pi*2/16)sqrt(2))^-1
    
      #define B3 0.850430094767256448766702844371412325 // (cos(pi*3/16)sqrt(2))^-1
    
      #define B4 1.000000000000000000000000000000000000 // (cos(pi*4/16)sqrt(2))^-1
    
      #define B5 1.272758580572833938461007018281767032 // (cos(pi*5/16)sqrt(2))^-1
    
      #define B6 1.847759065022573512256366378793576574 // (cos(pi*6/16)sqrt(2))^-1
    
      #define B7 3.624509785411551372409941227504289587 // (cos(pi*7/16)sqrt(2))^-1
    
      #define A1 M_SQRT1_2              // cos(pi*4/16)
    
      #define A2 0.54119610014619698435 // cos(pi*6/16)sqrt(2)
    
      #define A5 0.38268343236508977170 // cos(pi*6/16)
    
      #define A4 1.30656296487637652774 // cos(pi*2/16)sqrt(2)
    
      static const FLOAT postscale[64]={
    
      B0*B0, B0*B1, B0*B2, B0*B3, B0*B4, B0*B5, B0*B6, B0*B7,
    
      B1*B0, B1*B1, B1*B2, B1*B3, B1*B4, B1*B5, B1*B6, B1*B7,
    
      B2*B0, B2*B1, B2*B2, B2*B3, B2*B4, B2*B5, B2*B6, B2*B7,
    
      B3*B0, B3*B1, B3*B2, B3*B3, B3*B4, B3*B5, B3*B6, B3*B7,
    
      B4*B0, B4*B1, B4*B2, B4*B3, B4*B4, B4*B5, B4*B6, B4*B7,
    
      B5*B0, B5*B1, B5*B2, B5*B3, B5*B4, B5*B5, B5*B6, B5*B7,
    
      B6*B0, B6*B1, B6*B2, B6*B3, B6*B4, B6*B5, B6*B6, B6*B7,
    
      B7*B0, B7*B1, B7*B2, B7*B3, B7*B4, B7*B5, B7*B6, B7*B7,
    
      };
    
      20000
      static av_always_inline void row_fdct(FLOAT temp[64], int16_t *data)
    
      {
    
          FLOAT tmp0, tmp1, tmp2, tmp3, tmp4, tmp5, tmp6, tmp7;
    
          FLOAT tmp10, tmp11, tmp12, tmp13;
    
          FLOAT z2, z4, z11, z13;
    
          int i;
    
        2/2✓ Branch 0 taken 160000 times.
✓ Branch 1 taken 20000 times.

      180000
          for (i=0; i<8*8; i+=8) {
    
      160000
              tmp0= data[0 + i] + data[7 + i];
    
      160000
              tmp7= data[0 + i] - data[7 + i];
    
      160000
              tmp1= data[1 + i] + data[6 + i];
    
      160000
              tmp6= data[1 + i] - data[6 + i];
    
      160000
              tmp2= data[2 + i] + data[5 + i];
    
      160000
              tmp5= data[2 + i] - data[5 + i];
    
      160000
              tmp3= data[3 + i] + data[4 + i];
    
      160000
              tmp4= data[3 + i] - data[4 + i];
    
      160000
              tmp10= tmp0 + tmp3;
    
      160000
              tmp13= tmp0 - tmp3;
    
      160000
              tmp11= tmp1 + tmp2;
    
      160000
              tmp12= tmp1 - tmp2;
    
      160000
              temp[0 + i]= tmp10 + tmp11;
    
      160000
              temp[4 + i]= tmp10 - tmp11;
    
      160000
              tmp12 += tmp13;
    
      160000
              tmp12 *= A1;
    
      160000
              temp[2 + i]= tmp13 + tmp12;
    
      160000
              temp[6 + i]= tmp13 - tmp12;
    
      160000
              tmp4 += tmp5;
    
      160000
              tmp5 += tmp6;
    
      160000
              tmp6 += tmp7;
    
      160000
              z2= tmp4*(A2+A5) - tmp6*A5;
    
      160000
              z4= tmp6*(A4-A5) + tmp4*A5;
    
      160000
              tmp5*=A1;
    
      160000
              z11= tmp7 + tmp5;
    
      160000
              z13= tmp7 - tmp5;
    
      160000
              temp[5 + i]= z13 + z2;
    
      160000
              temp[3 + i]= z13 - z2;
    
      160000
              temp[1 + i]= z11 + z4;
    
      160000
              temp[7 + i]= z11 - z4;
    
          }
    
      20000
      }
    
      20000
      void ff_faandct(int16_t *data)
    
      {
    
          FLOAT tmp0, tmp1, tmp2, tmp3, tmp4, tmp5, tmp6, tmp7;
    
          FLOAT tmp10, tmp11, tmp12, tmp13;
    
          FLOAT z2, z4, z11, z13;
    
          FLOAT temp[64];
    
          int i;
    
      20000
          emms_c();
    
      20000
          row_fdct(temp, data);
    
        2/2✓ Branch 0 taken 160000 times.
✓ Branch 1 taken 20000 times.

      180000
          for (i=0; i<8; i++) {
    
      160000
              tmp0= temp[8*0 + i] + temp[8*7 + i];
    
      160000
              tmp7= temp[8*0 + i] - temp[8*7 + i];
    
      160000
              tmp1= temp[8*1 + i] + temp[8*6 + i];
    
      160000
              tmp6= temp[8*1 + i] - temp[8*6 + i];
    
      160000
              tmp2= temp[8*2 + i] + temp[8*5 + i];
    
      160000
              tmp5= temp[8*2 + i] - temp[8*5 + i];
    
      160000
              tmp3= temp[8*3 + i] + temp[8*4 + i];
    
      160000
              tmp4= temp[8*3 + i] - temp[8*4 + i];
    
      160000
              tmp10= tmp0 + tmp3;
    
      160000
              tmp13= tmp0 - tmp3;
    
      160000
              tmp11= tmp1 + tmp2;
    
      160000
              tmp12= tmp1 - tmp2;
    
      160000
              data[8*0 + i]= lrintf(postscale[8*0 + i] * (tmp10 + tmp11));
    
      160000
              data[8*4 + i]= lrintf(postscale[8*4 + i] * (tmp10 - tmp11));
    
      160000
              tmp12 += tmp13;
    
      160000
              tmp12 *= A1;
    
      160000
              data[8*2 + i]= lrintf(postscale[8*2 + i] * (tmp13 + tmp12));
    
      160000
              data[8*6 + i]= lrintf(postscale[8*6 + i] * (tmp13 - tmp12));
    
      160000
              tmp4 += tmp5;
    
      160000
              tmp5 += tmp6;
    
      160000
              tmp6 += tmp7;
    
      160000
              z2= tmp4*(A2+A5) - tmp6*A5;
    
      160000
              z4= tmp6*(A4-A5) + tmp4*A5;
    
      160000
              tmp5*=A1;
    
      160000
              z11= tmp7 + tmp5;
    
      160000
              z13= tmp7 - tmp5;
    
      160000
              data[8*5 + i]= lrintf(postscale[8*5 + i] * (z13 + z2));
    
      160000
              data[8*3 + i]= lrintf(postscale[8*3 + i] * (z13 - z2));
    
      160000
              data[8*1 + i]= lrintf(postscale[8*1 + i] * (z11 + z4));
    
      160000
              data[8*7 + i]= lrintf(postscale[8*7 + i] * (z11 - z4));
    
          }
    
      20000
      }
    
      ✗
      void ff_faandct248(int16_t *data)
    
      {
    
          FLOAT tmp0, tmp1, tmp2, tmp3, tmp4, tmp5, tmp6, tmp7;
    
          FLOAT tmp10, tmp11, tmp12, tmp13;
    
          FLOAT temp[64];
    
          int i;
    
      ✗
          emms_c();
    
      ✗
          row_fdct(temp, data);
    
      ✗
          for (i=0; i<8; i++) {
    
      ✗
              tmp0 = temp[8*0 + i] + temp[8*1 + i];
    
      ✗
              tmp1 = temp[8*2 + i] + temp[8*3 + i];
    
      ✗
              tmp2 = temp[8*4 + i] + temp[8*5 + i];
    
      ✗
              tmp3 = temp[8*6 + i] + temp[8*7 + i];
    
      ✗
              tmp4 = temp[8*0 + i] - temp[8*1 + i];
    
      ✗
              tmp5 = temp[8*2 + i] - temp[8*3 + i];
    
      ✗
              tmp6 = temp[8*4 + i] - temp[8*5 + i];
    
      ✗
              tmp7 = temp[8*6 + i] - temp[8*7 + i];
    
      ✗
              tmp10 = tmp0 + tmp3;
    
      ✗
              tmp11 = tmp1 + tmp2;
    
      ✗
              tmp12 = tmp1 - tmp2;
    
      ✗
              tmp13 = tmp0 - tmp3;
    
      ✗
              data[8*0 + i] = lrintf(postscale[8*0 + i] * (tmp10 + tmp11));
    
      ✗
              data[8*4 + i] = lrintf(postscale[8*4 + i] * (tmp10 - tmp11));
    
      ✗
              tmp12 += tmp13;
    
      ✗
              tmp12 *= A1;
    
      ✗
              data[8*2 + i] = lrintf(postscale[8*2 + i] * (tmp13 + tmp12));
    
      ✗
              data[8*6 + i] = lrintf(postscale[8*6 + i] * (tmp13 - tmp12));
    
      ✗
              tmp10 = tmp4 + tmp7;
    
      ✗
              tmp11 = tmp5 + tmp6;
    
      ✗
              tmp12 = tmp5 - tmp6;
    
      ✗
              tmp13 = tmp4 - tmp7;
    
      ✗
              data[8*1 + i] = lrintf(postscale[8*0 + i] * (tmp10 + tmp11));
    
      ✗
              data[8*5 + i] = lrintf(postscale[8*4 + i] * (tmp10 - tmp11));
    
      ✗
              tmp12 += tmp13;
    
      ✗
              tmp12 *= A1;
    
      ✗
              data[8*3 + i] = lrintf(postscale[8*2 + i] * (tmp13 + tmp12));
    
      ✗
              data[8*7 + i] = lrintf(postscale[8*6 + i] * (tmp13 - tmp12));
    
          }
    
      ✗
      }

Line	Branch	Exec	Source
1			/*
2			* Floating point AAN DCT
3			* this implementation is based upon the IJG integer AAN DCT (see jfdctfst.c)
4			*
5			* Copyright (c) 2003 Michael Niedermayer <michaelni@gmx.at>
6			* Copyright (c) 2003 Roman Shaposhnik
7			*
8			* Permission to use, copy, modify, and/or distribute this software for any
9			* purpose with or without fee is hereby granted, provided that the above
10			* copyright notice and this permission notice appear in all copies.
11			*
12			* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
13			* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
14			* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
15			* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
16			* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
17			* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
18			* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
19			*/
20
21			/**
22			* @file
23			* @brief
24			* Floating point AAN DCT
25			* @author Michael Niedermayer <michaelni@gmx.at>
26			*/
27
28			#include <math.h>
29
30			#include "faandct.h"
31			#include "libavutil/emms.h"
32			#include "libavutil/internal.h"
33			#include "libavutil/mathematics.h"
34
35			typedef float FLOAT;
36
37			/* numbers generated by arbitrary precision arithmetic followed by truncation
38			to 36 fractional digits (enough for a 128-bit IEEE quad, see /usr/include/math.h
39			for this approach). Unfortunately, long double is not always available correctly,
40			e.g ppc has issues.
41			TODO: add L suffixes when ppc and toolchains sort out their stuff.
42			*/
43			#define B0 1.000000000000000000000000000000000000
44			#define B1 0.720959822006947913789091890943021267 // (cos(pi*1/16)sqrt(2))^-1
45			#define B2 0.765366864730179543456919968060797734 // (cos(pi*2/16)sqrt(2))^-1
46			#define B3 0.850430094767256448766702844371412325 // (cos(pi*3/16)sqrt(2))^-1
47			#define B4 1.000000000000000000000000000000000000 // (cos(pi*4/16)sqrt(2))^-1
48			#define B5 1.272758580572833938461007018281767032 // (cos(pi*5/16)sqrt(2))^-1
49			#define B6 1.847759065022573512256366378793576574 // (cos(pi*6/16)sqrt(2))^-1
50			#define B7 3.624509785411551372409941227504289587 // (cos(pi*7/16)sqrt(2))^-1
51
52			#define A1 M_SQRT1_2 // cos(pi*4/16)
53			#define A2 0.54119610014619698435 // cos(pi*6/16)sqrt(2)
54			#define A5 0.38268343236508977170 // cos(pi*6/16)
55			#define A4 1.30656296487637652774 // cos(pi*2/16)sqrt(2)
56
57			static const FLOAT postscale[64]={
58			B0B0, B0B1, B0B2, B0B3, B0B4, B0B5, B0B6, B0B7,
59			B1B0, B1B1, B1B2, B1B3, B1B4, B1B5, B1B6, B1B7,
60			B2B0, B2B1, B2B2, B2B3, B2B4, B2B5, B2B6, B2B7,
61			B3B0, B3B1, B3B2, B3B3, B3B4, B3B5, B3B6, B3B7,
62			B4B0, B4B1, B4B2, B4B3, B4B4, B4B5, B4B6, B4B7,
63			B5B0, B5B1, B5B2, B5B3, B5B4, B5B5, B5B6, B5B7,
64			B6B0, B6B1, B6B2, B6B3, B6B4, B6B5, B6B6, B6B7,
65			B7B0, B7B1, B7B2, B7B3, B7B4, B7B5, B7B6, B7B7,
66			};
67
68		20000	static av_always_inline void row_fdct(FLOAT temp[64], int16_t *data)
69			{
70			FLOAT tmp0, tmp1, tmp2, tmp3, tmp4, tmp5, tmp6, tmp7;
71			FLOAT tmp10, tmp11, tmp12, tmp13;
72			FLOAT z2, z4, z11, z13;
73			int i;
74
75	2/2 ✓ Branch 0 taken 160000 times. ✓ Branch 1 taken 20000 times.	180000	for (i=0; i<8*8; i+=8) {
76		160000	tmp0= data[0 + i] + data[7 + i];
77		160000	tmp7= data[0 + i] - data[7 + i];
78		160000	tmp1= data[1 + i] + data[6 + i];
79		160000	tmp6= data[1 + i] - data[6 + i];
80		160000	tmp2= data[2 + i] + data[5 + i];
81		160000	tmp5= data[2 + i] - data[5 + i];
82		160000	tmp3= data[3 + i] + data[4 + i];
83		160000	tmp4= data[3 + i] - data[4 + i];
84
85		160000	tmp10= tmp0 + tmp3;
86		160000	tmp13= tmp0 - tmp3;
87		160000	tmp11= tmp1 + tmp2;
88		160000	tmp12= tmp1 - tmp2;
89
90		160000	temp[0 + i]= tmp10 + tmp11;
91		160000	temp[4 + i]= tmp10 - tmp11;
92
93		160000	tmp12 += tmp13;
94		160000	tmp12 *= A1;
95		160000	temp[2 + i]= tmp13 + tmp12;
96		160000	temp[6 + i]= tmp13 - tmp12;
97
98		160000	tmp4 += tmp5;
99		160000	tmp5 += tmp6;
100		160000	tmp6 += tmp7;
101
102		160000	z2= tmp4(A2+A5) - tmp6A5;
103		160000	z4= tmp6(A4-A5) + tmp4A5;
104
105		160000	tmp5*=A1;
106
107		160000	z11= tmp7 + tmp5;
108		160000	z13= tmp7 - tmp5;
109
110		160000	temp[5 + i]= z13 + z2;
111		160000	temp[3 + i]= z13 - z2;
112		160000	temp[1 + i]= z11 + z4;
113		160000	temp[7 + i]= z11 - z4;
114			}
115		20000	}
116
117		20000	void ff_faandct(int16_t *data)
118			{
119			FLOAT tmp0, tmp1, tmp2, tmp3, tmp4, tmp5, tmp6, tmp7;
120			FLOAT tmp10, tmp11, tmp12, tmp13;
121			FLOAT z2, z4, z11, z13;
122			FLOAT temp[64];
123			int i;
124
125		20000	emms_c();
126
127		20000	row_fdct(temp, data);
128
129	2/2 ✓ Branch 0 taken 160000 times. ✓ Branch 1 taken 20000 times.	180000	for (i=0; i<8; i++) {
130		160000	tmp0= temp[80 + i] + temp[87 + i];
131		160000	tmp7= temp[80 + i] - temp[87 + i];
132		160000	tmp1= temp[81 + i] + temp[86 + i];
133		160000	tmp6= temp[81 + i] - temp[86 + i];
134		160000	tmp2= temp[82 + i] + temp[85 + i];
135		160000	tmp5= temp[82 + i] - temp[85 + i];
136		160000	tmp3= temp[83 + i] + temp[84 + i];
137		160000	tmp4= temp[83 + i] - temp[84 + i];
138
139		160000	tmp10= tmp0 + tmp3;
140		160000	tmp13= tmp0 - tmp3;
141		160000	tmp11= tmp1 + tmp2;
142		160000	tmp12= tmp1 - tmp2;
143
144		160000	data[80 + i]= lrintf(postscale[80 + i] * (tmp10 + tmp11));
145		160000	data[84 + i]= lrintf(postscale[84 + i] * (tmp10 - tmp11));
146
147		160000	tmp12 += tmp13;
148		160000	tmp12 *= A1;
149		160000	data[82 + i]= lrintf(postscale[82 + i] * (tmp13 + tmp12));
150		160000	data[86 + i]= lrintf(postscale[86 + i] * (tmp13 - tmp12));
151
152		160000	tmp4 += tmp5;
153		160000	tmp5 += tmp6;
154		160000	tmp6 += tmp7;
155
156		160000	z2= tmp4(A2+A5) - tmp6A5;
157		160000	z4= tmp6(A4-A5) + tmp4A5;
158
159		160000	tmp5*=A1;
160
161		160000	z11= tmp7 + tmp5;
162		160000	z13= tmp7 - tmp5;
163
164		160000	data[85 + i]= lrintf(postscale[85 + i] * (z13 + z2));
165		160000	data[83 + i]= lrintf(postscale[83 + i] * (z13 - z2));
166		160000	data[81 + i]= lrintf(postscale[81 + i] * (z11 + z4));
167		160000	data[87 + i]= lrintf(postscale[87 + i] * (z11 - z4));
168			}
169		20000	}
170
171		✗	void ff_faandct248(int16_t *data)
172			{
173			FLOAT tmp0, tmp1, tmp2, tmp3, tmp4, tmp5, tmp6, tmp7;
174			FLOAT tmp10, tmp11, tmp12, tmp13;
175			FLOAT temp[64];
176			int i;
177
178		✗	emms_c();
179
180		✗	row_fdct(temp, data);
181
182		✗	for (i=0; i<8; i++) {
183		✗	tmp0 = temp[80 + i] + temp[81 + i];
184		✗	tmp1 = temp[82 + i] + temp[83 + i];
185		✗	tmp2 = temp[84 + i] + temp[85 + i];
186		✗	tmp3 = temp[86 + i] + temp[87 + i];
187		✗	tmp4 = temp[80 + i] - temp[81 + i];
188		✗	tmp5 = temp[82 + i] - temp[83 + i];
189		✗	tmp6 = temp[84 + i] - temp[85 + i];
190		✗	tmp7 = temp[86 + i] - temp[87 + i];
191
192		✗	tmp10 = tmp0 + tmp3;
193		✗	tmp11 = tmp1 + tmp2;
194		✗	tmp12 = tmp1 - tmp2;
195		✗	tmp13 = tmp0 - tmp3;
196
197		✗	data[80 + i] = lrintf(postscale[80 + i] * (tmp10 + tmp11));
198		✗	data[84 + i] = lrintf(postscale[84 + i] * (tmp10 - tmp11));
199
200		✗	tmp12 += tmp13;
201		✗	tmp12 *= A1;
202		✗	data[82 + i] = lrintf(postscale[82 + i] * (tmp13 + tmp12));
203		✗	data[86 + i] = lrintf(postscale[86 + i] * (tmp13 - tmp12));
204
205		✗	tmp10 = tmp4 + tmp7;
206		✗	tmp11 = tmp5 + tmp6;
207		✗	tmp12 = tmp5 - tmp6;
208		✗	tmp13 = tmp4 - tmp7;
209
210		✗	data[81 + i] = lrintf(postscale[80 + i] * (tmp10 + tmp11));
211		✗	data[85 + i] = lrintf(postscale[84 + i] * (tmp10 - tmp11));
212
213		✗	tmp12 += tmp13;
214		✗	tmp12 *= A1;
215		✗	data[83 + i] = lrintf(postscale[82 + i] * (tmp13 + tmp12));
216		✗	data[87 + i] = lrintf(postscale[86 + i] * (tmp13 - tmp12));
217			}
218		✗	}
219

Function (Line)	Call count	Block coverage
ff_faandct (line 117)	called 20000 times, returned 20000 times	100.0%
ff_faandct248 (line 171)	not called	0.0%
row_fdct (line 68)	called 20000 times, returned 20000 times	100.0%