Go to the documentation of this file.
43 a7 =
W7 *
b[1] -
W1 *
b[7];
44 a5 =
W5 *
b[5] +
W3 *
b[3];
47 a6 =
W6 *
b[2] -
W2 *
b[6];
49 a4 =
W0 *
b[0] -
W0 *
b[4];
52 s1 = (int)(181
U * (
a1 - a5 + a7 -
a3) + 128) >> 8;
53 s2 = (int)(181
U * (
a1 - a5 - a7 +
a3) + 128) >> 8;
56 b[0] = (
a0 +
a2 +
a1 + a5 + (1 << 7)) >> 8;
57 b[1] = (a4 + a6 + s1 + (1 << 7)) >> 8;
58 b[2] = (a4 - a6 + s2 + (1 << 7)) >> 8;
59 b[3] = (
a0 -
a2 + a7 +
a3 + (1 << 7)) >> 8;
60 b[4] = (
a0 -
a2 - a7 -
a3 + (1 << 7)) >> 8;
61 b[5] = (a4 - a6 - s2 + (1 << 7)) >> 8;
62 b[6] = (a4 + a6 - s1 + (1 << 7)) >> 8;
63 b[7] = (
a0 +
a2 -
a1 - a5 + (1 << 7)) >> 8;
72 a1 = (
W1 *
b[8 * 1] +
W7 *
b[8 * 7] + 4) >> 3;
73 a7 = (
W7 *
b[8 * 1] -
W1 *
b[8 * 7] + 4) >> 3;
74 a5 = (
W5 *
b[8 * 5] +
W3 *
b[8 * 3] + 4) >> 3;
75 a3 = (
W3 *
b[8 * 5] -
W5 *
b[8 * 3] + 4) >> 3;
76 a2 = (
W2 *
b[8 * 2] +
W6 *
b[8 * 6] + 4) >> 3;
77 a6 = (
W6 *
b[8 * 2] -
W2 *
b[8 * 6] + 4) >> 3;
78 a0 = (
W0 *
b[8 * 0] +
W0 *
b[8 * 4] ) >> 3;
79 a4 = (
W0 *
b[8 * 0] -
W0 *
b[8 * 4] ) >> 3;
82 s1 = (int)(181
U * (
a1 - a5 + a7 -
a3) + 128) >> 8;
83 s2 = (int)(181
U * (
a1 - a5 - a7 +
a3) + 128) >> 8;
86 b[8 * 0] = (
a0 +
a2 +
a1 + a5 + (1 << 13)) >> 14;
87 b[8 * 1] = (a4 + a6 + s1 + (1 << 13)) >> 14;
88 b[8 * 2] = (a4 - a6 + s2 + (1 << 13)) >> 14;
89 b[8 * 3] = (
a0 -
a2 + a7 +
a3 + (1 << 13)) >> 14;
91 b[8 * 4] = (
a0 -
a2 - a7 -
a3 + (1 << 13)) >> 14;
92 b[8 * 5] = (a4 - a6 - s2 + (1 << 13)) >> 14;
93 b[8 * 6] = (a4 + a6 - s1 + (1 << 13)) >> 14;
94 b[8 * 7] = (
a0 +
a2 -
a1 - a5 + (1 << 13)) >> 14;
101 for (
i = 0;
i < 64;
i += 8)
103 for (
i = 0;
i < 8;
i++)
106 for (
i = 0;
i < 8;
i++) {
124 for (
i = 0;
i < 64;
i += 8)
126 for (
i = 0;
i < 8;
i++)
129 for (
i = 0;
i < 8;
i++) {
144 int dstStride,
int srcStride,
int h)
149 for (
i = 0;
i <
h;
i++) {
164 int dstStride,
int srcStride,
int w)
169 for (
i = 0;
i <
w;
i++) {
170 const int src_1 =
src[-srcStride];
172 const int src1 =
src[srcStride];
173 const int src2 =
src[2 * srcStride];
174 const int src3 =
src[3 * srcStride];
175 const int src4 =
src[4 * srcStride];
176 const int src5 =
src[5 * srcStride];
177 const int src6 =
src[6 * srcStride];
178 const int src7 =
src[7 * srcStride];
179 const int src8 =
src[8 * srcStride];
180 const int src9 =
src[9 * srcStride];
183 dst[2 * dstStride] =
cm[(9 * (
src2 + src3) - (
src1 + src4) + 8) >> 4];
184 dst[3 * dstStride] =
cm[(9 * (src3 + src4) - (
src2 + src5) + 8) >> 4];
185 dst[4 * dstStride] =
cm[(9 * (src4 + src5) - (src3 + src6) + 8) >> 4];
186 dst[5 * dstStride] =
cm[(9 * (src5 + src6) - (src4 + src7) + 8) >> 4];
187 dst[6 * dstStride] =
cm[(9 * (src6 + src7) - (src5 + src8) + 8) >> 4];
188 dst[7 * dstStride] =
cm[(9 * (src7 + src8) - (src6 + src9) + 8) >> 4];
static void wmv2_idct_col(short *b)
static void wmv2_idct_add_c(uint8_t *dest, ptrdiff_t line_size, int16_t *block)
static void put_mspel8_mc10_c(uint8_t *dst, const uint8_t *src, ptrdiff_t stride)
void ff_put_pixels8_l2_8(uint8_t *dst, const uint8_t *src1, const uint8_t *src2, int dst_stride, int src_stride1, int src_stride2, int h)
static uint8_t half(int a, int b)
static void wmv2_mspel8_h_lowpass(uint8_t *dst, const uint8_t *src, int dstStride, int srcStride, int h)
static void put_mspel8_mc22_c(uint8_t *dst, const uint8_t *src, ptrdiff_t stride)
static void put_mspel8_mc02_c(uint8_t *dst, const uint8_t *src, ptrdiff_t stride)
av_cold void ff_wmv2dsp_init_mips(WMV2DSPContext *c)
static double a2(void *priv, double x, double y)
void ff_put_pixels8x8_c(uint8_t *dst, const uint8_t *src, ptrdiff_t stride)
static void wmv2_idct_put_c(uint8_t *dest, ptrdiff_t line_size, int16_t *block)
static void put_mspel8_mc32_c(uint8_t *dst, const uint8_t *src, ptrdiff_t stride)
static double a3(void *priv, double x, double y)
av_cold void ff_wmv2dsp_init(WMV2DSPContext *c)
Undefined Behavior In the C some operations are like signed integer dereferencing freed accessing outside allocated Undefined Behavior must not occur in a C it is not safe even if the output of undefined operations is unused The unsafety may seem nit picking but Optimizing compilers have in fact optimized code on the assumption that no undefined Behavior occurs Optimizing code based on wrong assumptions can and has in some cases lead to effects beyond the output of computations The signed integer overflow problem in speed critical code Code which is highly optimized and works with signed integers sometimes has the problem that often the output of the computation does not c
static void put_mspel8_mc20_c(uint8_t *dst, const uint8_t *src, ptrdiff_t stride)
uint8_t ptrdiff_t const uint8_t ptrdiff_t int intptr_t intptr_t int int16_t * dst
static void put_mspel8_mc12_c(uint8_t *dst, const uint8_t *src, ptrdiff_t stride)
static double a0(void *priv, double x, double y)
static void put_mspel8_mc30_c(uint8_t *dst, const uint8_t *src, ptrdiff_t stride)
#define i(width, name, range_min, range_max)
static void wmv2_idct_row(short *b)
static void wmv2_mspel8_v_lowpass(uint8_t *dst, const uint8_t *src, int dstStride, int srcStride, int w)
The exact code depends on how similar the blocks are and how related they are to the block
static double a1(void *priv, double x, double y)