Go to the documentation of this file.
37 for (
i = 0;
i < 8 * 8;
i++) {
45 sum += (
w *
b) * (
w *
b) >> 4;
54 for (
i = 0;
i < 8 * 8;
i++)
60 static int pix_sum_c(
const uint8_t *pix,
int line_size)
64 for (
i = 0;
i < 16;
i++) {
65 for (j = 0; j < 16; j += 8) {
76 pix += line_size - 16;
86 for (
i = 0;
i < 16;
i++) {
87 for (j = 0; j < 16; j += 8) {
89 register uint64_t x = *(uint64_t *) pix;
91 s += sq[(x >> 8) & 0xff];
92 s += sq[(x >> 16) & 0xff];
93 s += sq[(x >> 24) & 0xff];
94 s += sq[(x >> 32) & 0xff];
95 s += sq[(x >> 40) & 0xff];
96 s += sq[(x >> 48) & 0xff];
97 s += sq[(x >> 56) & 0xff];
99 register uint32_t x = *(uint32_t *) pix;
101 s += sq[(x >> 8) & 0xff];
102 s += sq[(x >> 16) & 0xff];
103 s += sq[(x >> 24) & 0xff];
104 x = *(uint32_t *) (pix + 4);
106 s += sq[(x >> 8) & 0xff];
107 s += sq[(x >> 16) & 0xff];
108 s += sq[(x >> 24) & 0xff];
112 pix += line_size - 16;
120 int w,
int h,
int sides)
122 uint8_t *ptr = buf, *last_line;
127 memset(ptr -
w, ptr[0],
w);
136 for (
i = 0;
i <
h;
i++)
140 for (
i = 0;
i <
h;
i++)
142 memcpy(last_line + (
i + 1) *
wrap, last_line,
width +
w +
w);
147 const uint8_t *
src,
int src_wrap,
151 const uint8_t *
s1, *
s2;
159 d[0] = (
s1[0] +
s1[1] +
s2[0] +
s2[1] + 2) >> 2;
160 d[1] = (
s1[2] +
s1[3] +
s2[2] +
s2[3] + 2) >> 2;
161 d[2] = (
s1[4] +
s1[5] +
s2[4] +
s2[5] + 2) >> 2;
162 d[3] = (
s1[6] +
s1[7] +
s2[6] +
s2[7] + 2) >> 2;
168 d[0] = (
s1[0] +
s1[1] +
s2[0] +
s2[1] + 2) >> 2;
180 const uint8_t *
src,
int src_wrap,
197 s4[0] +
s4[1] +
s4[2] +
s4[3] + 8) >> 4;
211 const uint8_t *
src,
int src_wrap,
219 for (
i = 0;
i < 8;
i++) {
224 *(dst++) = (
tmp + 32) >> 6;
225 src += 8 - 8 * src_wrap;
228 dst += dst_wrap -
width;
static void draw_edges_8_c(uint8_t *buf, int wrap, int width, int height, int w, int h, int sides)
static int pix_norm1_c(const uint8_t *pix, int line_size)
static int try_8x8basis_c(const int16_t rem[64], const int16_t weight[64], const int16_t basis[64], int scale)
static int16_t basis[64][64]
static void shrink22(uint8_t *dst, int dst_wrap, const uint8_t *src, int src_wrap, int width, int height)
av_cold void ff_mpegvideoencdsp_init_ppc(MpegvideoEncDSPContext *c, AVCodecContext *avctx)
void ff_mpegvideoencdsp_init_x86(MpegvideoEncDSPContext *c, AVCodecContext *avctx)
static void add_8x8basis_c(int16_t rem[64], const int16_t basis[64], int scale)
void av_image_copy_plane(uint8_t *dst, int dst_linesize, const uint8_t *src, int src_linesize, int bytewidth, int height)
Copy image plane from src to dst.
av_cold void ff_mpegvideoencdsp_init(MpegvideoEncDSPContext *c, AVCodecContext *avctx)
av_cold void ff_mpegvideoencdsp_init_mips(MpegvideoEncDSPContext *c, AVCodecContext *avctx)
static av_always_inline float scale(float x, float s)
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 int weight(int i, int blen, int offset)
static int pix_sum_c(const uint8_t *pix, int line_size)
#define av_assert2(cond)
assert() equivalent, that does lie in speed critical code.
#define i(width, name, range_min, range_max)
const uint32_t ff_square_tab[512]
static void shrink88(uint8_t *dst, int dst_wrap, const uint8_t *src, int src_wrap, int width, int height)
main external API structure.
av_cold void ff_mpegvideoencdsp_init_arm(MpegvideoEncDSPContext *c, AVCodecContext *avctx)
static void shrink44(uint8_t *dst, int dst_wrap, const uint8_t *src, int src_wrap, int width, int height)