41 a1 =
W1 * b[1] +
W7 * b[7];
42 a7 =
W7 * b[1] -
W1 * b[7];
43 a5 =
W5 * b[5] +
W3 * b[3];
44 a3 =
W3 * b[5] -
W5 * b[3];
45 a2 =
W2 * b[2] +
W6 * b[6];
46 a6 =
W6 * b[2] -
W2 * b[6];
47 a0 =
W0 * b[0] +
W0 * b[4];
48 a4 =
W0 * b[0] -
W0 * b[4];
51 s1 = (
int)(181
U * (a1 - a5 + a7 - a3) + 128) >> 8;
52 s2 = (
int)(181
U * (a1 - a5 - a7 + a3) + 128) >> 8;
55 b[0] = (a0 + a2 + a1 + a5 + (1 << 7)) >> 8;
56 b[1] = (a4 + a6 + s1 + (1 << 7)) >> 8;
57 b[2] = (a4 - a6 + s2 + (1 << 7)) >> 8;
58 b[3] = (a0 - a2 + a7 + a3 + (1 << 7)) >> 8;
59 b[4] = (a0 - a2 - a7 - a3 + (1 << 7)) >> 8;
60 b[5] = (a4 - a6 - s2 + (1 << 7)) >> 8;
61 b[6] = (a4 + a6 - s1 + (1 << 7)) >> 8;
62 b[7] = (a0 + a2 - a1 - a5 + (1 << 7)) >> 8;
71 a1 = (
W1 * b[8 * 1] +
W7 * b[8 * 7] + 4) >> 3;
72 a7 = (
W7 * b[8 * 1] -
W1 * b[8 * 7] + 4) >> 3;
73 a5 = (
W5 * b[8 * 5] +
W3 * b[8 * 3] + 4) >> 3;
74 a3 = (
W3 * b[8 * 5] -
W5 * b[8 * 3] + 4) >> 3;
75 a2 = (
W2 * b[8 * 2] +
W6 * b[8 * 6] + 4) >> 3;
76 a6 = (
W6 * b[8 * 2] -
W2 * b[8 * 6] + 4) >> 3;
77 a0 = (
W0 * b[8 * 0] +
W0 * b[8 * 4] ) >> 3;
78 a4 = (
W0 * b[8 * 0] -
W0 * b[8 * 4] ) >> 3;
81 s1 = (
int)(181
U * (a1 - a5 + a7 - a3) + 128) >> 8;
82 s2 = (
int)(181
U * (a1 - a5 - a7 + a3) + 128) >> 8;
85 b[8 * 0] = (a0 + a2 + a1 + a5 + (1 << 13)) >> 14;
86 b[8 * 1] = (a4 + a6 + s1 + (1 << 13)) >> 14;
87 b[8 * 2] = (a4 - a6 + s2 + (1 << 13)) >> 14;
88 b[8 * 3] = (a0 - a2 + a7 + a3 + (1 << 13)) >> 14;
90 b[8 * 4] = (a0 - a2 - a7 - a3 + (1 << 13)) >> 14;
91 b[8 * 5] = (a4 - a6 - s2 + (1 << 13)) >> 14;
92 b[8 * 6] = (a4 + a6 - s1 + (1 << 13)) >> 14;
93 b[8 * 7] = (a0 + a2 - a1 - a5 + (1 << 13)) >> 14;
100 for (i = 0; i < 64; i += 8)
102 for (i = 0; i < 8; i++)
105 for (i = 0; i < 8; i++) {
123 for (i = 0; i < 64; i += 8)
125 for (i = 0; i < 8; i++)
128 for (i = 0; i < 8; i++) {
143 int dstStride,
int srcStride,
int h)
148 for (i = 0; i <
h; i++) {
149 dst[0] = cm[(9 * (src[0] + src[1]) - (src[-1] + src[2]) + 8) >> 4];
150 dst[1] = cm[(9 * (src[1] + src[2]) - (src[0] + src[3]) + 8) >> 4];
151 dst[2] = cm[(9 * (src[2] + src[3]) - (src[1] + src[4]) + 8) >> 4];
152 dst[3] = cm[(9 * (src[3] + src[4]) - (src[2] + src[5]) + 8) >> 4];
153 dst[4] = cm[(9 * (src[4] + src[5]) - (src[3] + src[6]) + 8) >> 4];
154 dst[5] = cm[(9 * (src[5] + src[6]) - (src[4] + src[7]) + 8) >> 4];
155 dst[6] = cm[(9 * (src[6] + src[7]) - (src[5] + src[8]) + 8) >> 4];
156 dst[7] = cm[(9 * (src[7] + src[8]) - (src[6] + src[9]) + 8) >> 4];
163 int dstStride,
int srcStride,
int w)
168 for (i = 0; i <
w; i++) {
169 const int src_1 = src[-srcStride];
170 const int src0 = src[0];
171 const int src1 = src[srcStride];
172 const int src2 = src[2 * srcStride];
173 const int src3 = src[3 * srcStride];
174 const int src4 = src[4 * srcStride];
175 const int src5 = src[5 * srcStride];
176 const int src6 = src[6 * srcStride];
177 const int src7 = src[7 * srcStride];
178 const int src8 = src[8 * srcStride];
179 const int src9 = src[9 * srcStride];
180 dst[0 * dstStride] = cm[(9 * (src0 +
src1) - (src_1 + src2) + 8) >> 4];
181 dst[1 * dstStride] = cm[(9 * (src1 + src2) - (src0 + src3) + 8) >> 4];
182 dst[2 * dstStride] = cm[(9 * (src2 + src3) - (src1 + src4) + 8) >> 4];
183 dst[3 * dstStride] = cm[(9 * (src3 + src4) - (src2 + src5) + 8) >> 4];
184 dst[4 * dstStride] = cm[(9 * (src4 + src5) - (src3 + src6) + 8) >> 4];
185 dst[5 * dstStride] = cm[(9 * (src5 + src6) - (src4 + src7) + 8) >> 4];
186 dst[6 * dstStride] = cm[(9 * (src6 + src7) - (src5 + src8) + 8) >> 4];
187 dst[7 * dstStride] = cm[(9 * (src7 + src8) - (src6 + src9) + 8) >> 4];
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)
Macro definitions for various function/variable attributes.
static void wmv2_idct_add_c(uint8_t *dest, ptrdiff_t line_size, int16_t *block)
The exact code depends on how similar the blocks are and how related they are to the block
static void put_mspel8_mc22_c(uint8_t *dst, const uint8_t *src, ptrdiff_t stride)
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 wmv2_idct_col(short *b)
static void put_mspel8_mc10_c(uint8_t *dst, const uint8_t *src, ptrdiff_t stride)
static void wmv2_mspel8_h_lowpass(uint8_t *dst, const uint8_t *src, int dstStride, int srcStride, int h)
static void put_mspel8_mc02_c(uint8_t *dst, const uint8_t *src, ptrdiff_t stride)
void ff_put_pixels8x8_c(uint8_t *dst, const uint8_t *src, ptrdiff_t stride)
av_cold void ff_wmv2dsp_init(WMV2DSPContext *c)
static void put_mspel8_mc32_c(uint8_t *dst, const uint8_t *src, ptrdiff_t stride)
qpel_mc_func put_mspel_pixels_tab[8]
static void wmv2_idct_put_c(uint8_t *dest, ptrdiff_t line_size, int16_t *block)
static void put_mspel8_mc12_c(uint8_t *dst, const uint8_t *src, ptrdiff_t stride)
av_cold void ff_wmv2dsp_init_mips(WMV2DSPContext *c)
static void put_mspel8_mc20_c(uint8_t *dst, const uint8_t *src, ptrdiff_t stride)
Libavcodec external API header.
GLint GLenum GLboolean GLsizei stride
static void put_mspel8_mc30_c(uint8_t *dst, const uint8_t *src, ptrdiff_t stride)
common internal and external API header
static void wmv2_mspel8_v_lowpass(uint8_t *dst, const uint8_t *src, int dstStride, int srcStride, int w)
void(* idct_put)(uint8_t *dest, ptrdiff_t line_size, int16_t *block)
static void wmv2_idct_row(short *b)
static uint8_t half(int a, int b)
void(* idct_add)(uint8_t *dest, ptrdiff_t line_size, int16_t *block)