FFmpeg
llviddsp.c
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2016 Alexandra Hájková
3  *
4  * This file is part of FFmpeg.
5  *
6  * FFmpeg is free software; you can redistribute it and/or modify
7  * it under the terms of the GNU General Public License as published by
8  * the Free Software Foundation; either version 2 of the License, or
9  * (at your option) any later version.
10  *
11  * FFmpeg is distributed in the hope that it will be useful,
12  * but WITHOUT ANY WARRANTY; without even the implied warranty of
13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14  * GNU General Public License for more details.
15  *
16  * You should have received a copy of the GNU General Public License along
17  * with FFmpeg; if not, write to the Free Software Foundation, Inc.,
18  * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
19  */
20 
21 #include <string.h>
22 
23 #include "libavutil/common.h"
24 #include "libavutil/intreadwrite.h"
25 #include "libavutil/mem.h"
26 
28 
29 #include "checkasm.h"
30 
31 #define randomize_buffers(buf, size) \
32  do { \
33  int j; \
34  uint8_t *tmp_buf = (uint8_t *)buf;\
35  for (j = 0; j < size; j++) \
36  tmp_buf[j] = rnd() & 0xFF; \
37  } while (0)
38 
39 #define init_buffer(a0, a1, type, width)\
40  if (!a0 || !a1)\
41  fail();\
42  randomize_buffers(a0, width * sizeof(type));\
43  memcpy(a1, a0, width*sizeof(type));\
44 
46 {
47  uint8_t *dst0 = av_mallocz(width);
48  uint8_t *dst1 = av_mallocz(width);
49  uint8_t *src0 = av_calloc(width, sizeof(*src0));
50  uint8_t *src1 = av_calloc(width, sizeof(*src1));
51  declare_func(void, uint8_t *dst, uint8_t *src, ptrdiff_t w);
52 
53  init_buffer(src0, src1, uint8_t, width);
54 
55  if (!dst0 || !dst1)
56  fail();
57 
58 
59  call_ref(dst0, src0, width);
60  call_new(dst1, src1, width);
61  if (memcmp(dst0, dst1, width))
62  fail();
63  bench_new(dst1, src1, width);
64 
65  av_free(src0);
66  av_free(src1);
67  av_free(dst0);
68  av_free(dst1);
69 }
70 
72  int a0, a1, b0, b1;
73  uint8_t *dst0 = av_mallocz(width);
74  uint8_t *dst1 = av_mallocz(width);
75  uint8_t *src0 = av_calloc(width, sizeof(*src0));
76  uint8_t *src1 = av_calloc(width, sizeof(*src1));
77  uint8_t *diff0 = av_calloc(width, sizeof(*diff0));
78  uint8_t *diff1 = av_calloc(width, sizeof(*diff1));
79  declare_func(void, uint8_t *dst, const uint8_t *src1,
80  const uint8_t *diff, ptrdiff_t w,
81  int *left, int *left_top);
82 
83  init_buffer(src0, src1, uint8_t, width);
84  init_buffer(diff0, diff1, uint8_t, width);
85 
86  a0 = rnd() & 0xFF;
87  b0 = rnd() & 0xFF;
88  a1 = a0;
89  b1 = b0;
90 
91 
92  call_ref(dst0, src0, diff0, width, &a0, &b0);
93  call_new(dst1, src1, diff1, width, &a1, &b1);
94  if (memcmp(dst0, dst1, width) || (a0 != a1) || (b0 != b1))
95  fail();
96  bench_new(dst1, src1, diff1, width, &a1, &b1);
97 
98  av_free(src0);
99  av_free(src1);
100  av_free(diff0);
101  av_free(diff1);
102  av_free(dst0);
103  av_free(dst1);
104 }
105 
106 static void check_add_left_pred(LLVidDSPContext *c, int width, int acc)
107 {
108  int res0, res1;
109  uint8_t *dst0 = av_mallocz(width);
110  uint8_t *dst1 = av_mallocz(width);
111  uint8_t *src0 = av_calloc(width, sizeof(*src0));
112  uint8_t *src1 = av_calloc(width, sizeof(*src1));
113  declare_func(int, uint8_t *dst, const uint8_t *src, ptrdiff_t w, int acc);
114 
115  init_buffer(src0, src1, uint8_t, width);
116 
117  if (!dst0 || !dst1)
118  fail();
119 
120  res0 = call_ref(dst0, src0, width, acc);
121  res1 = call_new(dst1, src1, width, acc);
122  if ((res0 & 0xFF) != (res1 & 0xFF) || memcmp(dst0, dst1, width))
123  fail();
124  bench_new(dst1, src1, width, acc);
125 
126  av_free(src0);
127  av_free(src1);
128  av_free(dst0);
129  av_free(dst1);
130 }
131 
132 static void check_add_left_pred_16(LLVidDSPContext *c, unsigned mask, int width, unsigned acc)
133 {
134  int res0, res1;
135  uint16_t *dst0 = av_calloc(width, sizeof(*dst0));
136  uint16_t *dst1 = av_calloc(width, sizeof(*dst1));
137  uint16_t *src0 = av_calloc(width, sizeof(*src0));
138  uint16_t *src1 = av_calloc(width, sizeof(*src1));
139  declare_func(int, uint16_t *dst, const uint16_t *src, unsigned mask, ptrdiff_t w, unsigned acc);
140 
141  init_buffer(src0, src1, uint16_t, width);
142 
143  if (!dst0 || !dst1)
144  fail();
145 
146  res0 = call_ref(dst0, src0, mask, width, acc);
147  res1 = call_new(dst1, src1, mask, width, acc);
148  if ((res0 &0xFFFF) != (res1 &0xFFFF)|| memcmp(dst0, dst1, width))
149  fail();
150  bench_new(dst1, src1, mask, width, acc);
151 
152  av_free(src0);
153  av_free(src1);
154  av_free(dst0);
155  av_free(dst1);
156 }
157 
159  int src_size, stride;
160  uint8_t *src0, *src1;
161  declare_func(void, uint8_t *src, const ptrdiff_t stride,
162  const ptrdiff_t width);
163 
164  stride = w + 32;
165  src_size = (stride + 32) * 2; /* dsp need previous line, and ignore the start of the line */
166  src0 = av_mallocz(src_size);
167  src1 = av_mallocz(src_size);
168 
169  init_buffer(src0, src1, uint8_t, src_size);
170 
171  call_ref(src0 + stride + 32, stride, w);
172  call_new(src1 + stride + 32, stride, w);
173  if (memcmp(src0, src1, stride)||/* previous line doesn't change */
174  memcmp(src0+stride, src1 + stride, w + 32)) {
175  fail();
176  }
177  bench_new(src1 + stride + 32, stride, w);
178 
179  av_free(src0);
180  av_free(src1);
181 }
182 
184 {
186  static int saved_width = 0;
187  int width = saved_width;
188  int accRnd = rnd() & 0xFF;
189 
190  if (!width)
191  saved_width = width = 16 * av_clip(rnd(), 16, 128);
192 
194 
195  if (check_func(c.add_bytes, "add_bytes"))
197  report("add_bytes");
198 
199  if (check_func(c.add_median_pred, "add_median_pred"))
201  report("add_median_pred");
202 
203  if (check_func(c.add_left_pred, "add_left_pred_zero"))
205  report("add_left_pred_zero");
206 
207  if (check_func(c.add_left_pred, "add_left_pred_rnd_acc"))
208  check_add_left_pred(&c, width, accRnd);
209  report("add_left_pred_rnd_acc");
210 
211  if (check_func(c.add_left_pred_int16, "add_left_pred_int16"))
212  check_add_left_pred_16(&c, 255, width, accRnd);
213  report("add_left_pred_int16");
214 
215  if (check_func(c.add_gradient_pred, "add_gradient_pred"))
217  report("add_gradient_pred");
218 }
av_clip
#define av_clip
Definition: common.h:100
src1
const pixel * src1
Definition: h264pred_template.c:420
mask
int mask
Definition: mediacodecdec_common.c:154
check_func
#define check_func(func,...)
Definition: checkasm.h:205
check_add_median_pred
static void check_add_median_pred(LLVidDSPContext *c, int width)
Definition: llviddsp.c:71
call_ref
#define call_ref(...)
Definition: checkasm.h:220
b1
static double b1(void *priv, double x, double y)
Definition: vf_xfade.c:2034
fail
#define fail()
Definition: checkasm.h:214
ff_llviddsp_init
av_cold void ff_llviddsp_init(LLVidDSPContext *c)
Definition: lossless_videodsp.c:114
checkasm.h
LLVidDSPContext
Definition: lossless_videodsp.h:28
check_add_left_pred
static void check_add_left_pred(LLVidDSPContext *c, int width, int acc)
Definition: llviddsp.c:106
rnd
#define rnd()
Definition: checkasm.h:198
intreadwrite.h
av_mallocz
#define av_mallocz(s)
Definition: tableprint_vlc.h:31
call_new
#define call_new(...)
Definition: checkasm.h:323
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
Definition: undefined.txt:32
check_add_left_pred_16
static void check_add_left_pred_16(LLVidDSPContext *c, unsigned mask, int width, unsigned acc)
Definition: llviddsp.c:132
checkasm_check_llviddsp
void checkasm_check_llviddsp(void)
Definition: llviddsp.c:183
init_buffer
#define init_buffer(a0, a1, type, width)
Definition: llviddsp.c:39
dst
uint8_t ptrdiff_t const uint8_t ptrdiff_t int intptr_t intptr_t int int16_t * dst
Definition: dsp.h:87
diff
static av_always_inline int diff(const struct color_info *a, const struct color_info *b, const int trans_thresh)
Definition: vf_paletteuse.c:166
a0
static double a0(void *priv, double x, double y)
Definition: vf_xfade.c:2028
report
#define report
Definition: checkasm.h:217
bench_new
#define bench_new(...)
Definition: checkasm.h:408
common.h
av_calloc
void * av_calloc(size_t nmemb, size_t size)
Definition: mem.c:264
left
Tag MUST be and< 10hcoeff half pel interpolation filter coefficients, hcoeff[0] are the 2 middle coefficients[1] are the next outer ones and so on, resulting in a filter like:...eff[2], hcoeff[1], hcoeff[0], hcoeff[0], hcoeff[1], hcoeff[2] ... the sign of the coefficients is not explicitly stored but alternates after each coeff and coeff[0] is positive, so ...,+,-,+,-,+,+,-,+,-,+,... hcoeff[0] is not explicitly stored but found by subtracting the sum of all stored coefficients with signs from 32 hcoeff[0]=32 - hcoeff[1] - hcoeff[2] - ... a good choice for hcoeff and htaps is htaps=6 hcoeff={40,-10, 2} an alternative which requires more computations at both encoder and decoder side and may or may not be better is htaps=8 hcoeff={42,-14, 6,-2}ref_frames minimum of the number of available reference frames and max_ref_frames for example the first frame after a key frame always has ref_frames=1spatial_decomposition_type wavelet type 0 is a 9/7 symmetric compact integer wavelet 1 is a 5/3 symmetric compact integer wavelet others are reserved stored as delta from last, last is reset to 0 if always_reset||keyframeqlog quality(logarithmic quantizer scale) stored as delta from last, last is reset to 0 if always_reset||keyframemv_scale stored as delta from last, last is reset to 0 if always_reset||keyframe FIXME check that everything works fine if this changes between framesqbias dequantization bias stored as delta from last, last is reset to 0 if always_reset||keyframeblock_max_depth maximum depth of the block tree stored as delta from last, last is reset to 0 if always_reset||keyframequant_table quantization tableHighlevel bitstream structure:==============================--------------------------------------------|Header|--------------------------------------------|------------------------------------|||Block0||||split?||||yes no||||......... intra?||||:Block01 :yes no||||:Block02 :....... ..........||||:Block03 ::y DC ::ref index:||||:Block04 ::cb DC ::motion x :||||......... :cr DC ::motion y :||||....... ..........|||------------------------------------||------------------------------------|||Block1|||...|--------------------------------------------|------------ ------------ ------------|||Y subbands||Cb subbands||Cr subbands||||--- ---||--- ---||--- ---|||||LL0||HL0||||LL0||HL0||||LL0||HL0|||||--- ---||--- ---||--- ---||||--- ---||--- ---||--- ---|||||LH0||HH0||||LH0||HH0||||LH0||HH0|||||--- ---||--- ---||--- ---||||--- ---||--- ---||--- ---|||||HL1||LH1||||HL1||LH1||||HL1||LH1|||||--- ---||--- ---||--- ---||||--- ---||--- ---||--- ---|||||HH1||HL2||||HH1||HL2||||HH1||HL2|||||...||...||...|||------------ ------------ ------------|--------------------------------------------Decoding process:=================------------|||Subbands|------------||||------------|Intra DC||||LL0 subband prediction ------------|\ Dequantization ------------------- \||Reference frames|\ IDWT|------- -------|Motion \|||Frame 0||Frame 1||Compensation . OBMC v -------|------- -------|--------------. \------> Frame n output Frame Frame<----------------------------------/|...|------------------- Range Coder:============Binary Range Coder:------------------- The implemented range coder is an adapted version based upon "Range encoding: an algorithm for removing redundancy from a digitised message." by G. N. N. Martin. The symbols encoded by the Snow range coder are bits(0|1). The associated probabilities are not fix but change depending on the symbol mix seen so far. bit seen|new state ---------+----------------------------------------------- 0|256 - state_transition_table[256 - old_state];1|state_transition_table[old_state];state_transition_table={ 0, 0, 0, 0, 0, 0, 0, 0, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 190, 191, 192, 194, 194, 195, 196, 197, 198, 199, 200, 201, 202, 202, 204, 205, 206, 207, 208, 209, 209, 210, 211, 212, 213, 215, 215, 216, 217, 218, 219, 220, 220, 222, 223, 224, 225, 226, 227, 227, 229, 229, 230, 231, 232, 234, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 248, 0, 0, 0, 0, 0, 0, 0};FIXME Range Coding of integers:------------------------- FIXME Neighboring Blocks:===================left and top are set to the respective blocks unless they are outside of the image in which case they are set to the Null block top-left is set to the top left block unless it is outside of the image in which case it is set to the left block if this block has no larger parent block or it is at the left side of its parent block and the top right block is not outside of the image then the top right block is used for top-right else the top-left block is used Null block y, cb, cr are 128 level, ref, mx and my are 0 Motion Vector Prediction:=========================1. the motion vectors of all the neighboring blocks are scaled to compensate for the difference of reference frames scaled_mv=(mv *(256 *(current_reference+1)/(mv.reference+1))+128)> the median of the scaled left
Definition: snow.txt:386
check_add_bytes
static void check_add_bytes(LLVidDSPContext *c, int width)
Definition: llviddsp.c:45
src0
const pixel *const src0
Definition: h264pred_template.c:419
mem.h
lossless_videodsp.h
w
uint8_t w
Definition: llvidencdsp.c:39
declare_func
#define declare_func(ret,...)
Definition: checkasm.h:209
av_free
#define av_free(p)
Definition: tableprint_vlc.h:34
check_add_gradient_pred
static void check_add_gradient_pred(LLVidDSPContext *c, int w)
Definition: llviddsp.c:158
b0
static double b0(void *priv, double x, double y)
Definition: vf_xfade.c:2033
a1
static double a1(void *priv, double x, double y)
Definition: vf_xfade.c:2029
stride
#define stride
Definition: h264pred_template.c:536
width
#define width
Definition: dsp.h:89
src
#define src
Definition: vp8dsp.c:248