Thanks to visit codestin.com
Credit goes to www.ffmpeg.org

FFmpeg
hevc_pred.c
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2026 Jun Zhao <[email protected]>
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 #include "checkasm.h"
23 #include "libavcodec/hevc/pred.h"
24 #include "libavutil/intreadwrite.h"
25 #include "libavutil/mem_internal.h"
26 
27 static const uint32_t pixel_mask[3] = { 0xffffffff, 0x01ff01ff, 0x03ff03ff };
28 
29 #define SIZEOF_PIXEL ((bit_depth + 7) / 8)
30 #define BUF_SIZE (2 * 64 * 64) /* Enough for 32x32 with stride=64 */
31 #define PRED_SIZE 128 /* Increased to 4 * MAX_TB_SIZE to accommodate C code reads */
32 
33 #define randomize_buffers() \
34  do { \
35  uint32_t mask = pixel_mask[bit_depth - 8]; \
36  for (int i = 0; i < BUF_SIZE; i += 4) { \
37  uint32_t r = rnd() & mask; \
38  AV_WN32A(buf0 + i, r); \
39  AV_WN32A(buf1 + i, r); \
40  } \
41  /* Start from -4 so that AV_WN32A writes \
42  * top[-4..-1] and left[-4..-1], ensuring \
43  * top[-1] and left[-1] contain known data \
44  * since angular pred references them \
45  * (e.g. mode 10/26 edge filtering, \
46  * mode 18 diagonal, V/H neg extension). */\
47  for (int i = -4; i < PRED_SIZE; i += 4) { \
48  uint32_t r = rnd() & mask; \
49  AV_WN32A(top + i, r); \
50  AV_WN32A(left + i, r); \
51  } \
52  } while (0)
53 
54 #define randomize_ref_buffers() \
55  do { \
56  uint32_t mask = pixel_mask[bit_depth - 8]; \
57  for (int i = -4; i < PRED_SIZE; i += 4) { \
58  uint32_t r = rnd() & mask; \
59  AV_WN32A(top + i, r); \
60  AV_WN32A(left + i, r); \
61  } \
62  } while (0)
63 
64 static void check_pred_dc(HEVCPredContext *h,
65  uint8_t *buf0, uint8_t *buf1,
66  uint8_t *top, uint8_t *left, int bit_depth)
67 {
68  const char *const block_name[] = { "4x4", "8x8", "16x16", "32x32" };
69  const int block_size[] = { 4, 8, 16, 32 };
70  int log2_size;
71 
72  declare_func(void, uint8_t *src, const uint8_t *top,
73  const uint8_t *left, ptrdiff_t stride,
74  int log2_size, int c_idx);
75 
76  /* Test all 4 sizes: 4x4, 8x8, 16x16, 32x32 */
77  for (log2_size = 2; log2_size <= 5; log2_size++) {
78  int size = block_size[log2_size - 2];
79  ptrdiff_t stride = 64 * SIZEOF_PIXEL;
80 
81  if (check_func(h->pred_dc, "hevc_pred_dc_%s_%d",
82  block_name[log2_size - 2], bit_depth)) {
83  /* Test with c_idx=0 (luma, with edge smoothing for size < 32) */
85  call_ref(buf0, top, left, stride, log2_size, 0);
86  call_new(buf1, top, left, stride, log2_size, 0);
87  if (memcmp(buf0, buf1, size * stride))
88  fail();
89 
90  /* Test with c_idx=1 (chroma, no edge smoothing) */
92  call_ref(buf0, top, left, stride, log2_size, 1);
93  call_new(buf1, top, left, stride, log2_size, 1);
94  if (memcmp(buf0, buf1, size * stride))
95  fail();
96 
97  bench_new(buf1, top, left, stride, log2_size, 0);
98  }
99  }
100 }
101 
102 static void check_pred_planar(HEVCPredContext *h,
103  uint8_t *buf0, uint8_t *buf1,
104  uint8_t *top, uint8_t *left, int bit_depth)
105 {
106  const char *const block_name[] = { "4x4", "8x8", "16x16", "32x32" };
107  const int block_size[] = { 4, 8, 16, 32 };
108  int i;
109 
110  declare_func(void, uint8_t *src, const uint8_t *top,
111  const uint8_t *left, ptrdiff_t stride);
112 
113  /* Test all 4 sizes: 4x4, 8x8, 16x16, 32x32 */
114  for (i = 0; i < 4; i++) {
115  int size = block_size[i];
116  ptrdiff_t stride = 64 * SIZEOF_PIXEL;
117 
118  if (check_func(h->pred_planar[i], "hevc_pred_planar_%s_%d",
119  block_name[i], bit_depth)) {
121  call_ref(buf0, top, left, stride);
122  call_new(buf1, top, left, stride);
123  if (memcmp(buf0, buf1, size * stride))
124  fail();
125 
126  bench_new(buf1, top, left, stride);
127  }
128  }
129 }
130 
131 /*
132  * Angular prediction modes are divided into categories:
133  *
134  * Mode 10: Horizontal pure copy (H pure)
135  * Mode 26: Vertical pure copy (V pure)
136  * Modes 2-9: Horizontal positive angle (H pos) - uses left reference
137  * Modes 11-17: Horizontal negative angle (H neg) - needs reference extension
138  * Modes 18-25: Vertical negative angle (V neg) - needs reference extension
139  * Modes 27-34: Vertical positive angle (V pos) - uses top reference
140  *
141  * Each category has 4 NEON functions for 4x4, 8x8, 16x16, 32x32 sizes.
142  */
144  uint8_t *buf0, uint8_t *buf1,
145  uint8_t *top, uint8_t *left, int bit_depth)
146 {
147  const char *const block_name[] = { "4x4", "8x8", "16x16", "32x32" };
148  const int block_size[] = { 4, 8, 16, 32 };
149  int i, mode;
150 
151  declare_func(void, uint8_t *src, const uint8_t *top,
152  const uint8_t *left, ptrdiff_t stride, int c_idx, int mode);
153 
154  /* Test all 4 sizes */
155  for (i = 0; i < 4; i++) {
156  int size = block_size[i];
157  ptrdiff_t stride = 64 * SIZEOF_PIXEL;
158 
159  /* Test all 33 angular modes (2-34) */
160  for (mode = 2; mode <= 34; mode++) {
161  const char *mode_category;
162 
163  /* Determine mode category for descriptive test name */
164  if (mode == 10)
165  mode_category = "Hpure";
166  else if (mode == 26)
167  mode_category = "Vpure";
168  else if (mode >= 2 && mode <= 9)
169  mode_category = "Hpos";
170  else if (mode >= 11 && mode <= 17)
171  mode_category = "Hneg";
172  else if (mode >= 18 && mode <= 25)
173  mode_category = "Vneg";
174  else /* mode >= 27 && mode <= 34 */
175  mode_category = "Vpos";
176 
177  if (check_func(h->pred_angular[i],
178  "hevc_pred_angular_%s_%s_mode%d_%d",
179  block_name[i], mode_category, mode, bit_depth)) {
180  /* Test with c_idx=0 (luma) */
182  call_ref(buf0, top, left, stride, 0, mode);
183  call_new(buf1, top, left, stride, 0, mode);
184  if (memcmp(buf0, buf1, size * stride))
185  fail();
186 
187  /* Test with c_idx=1 (chroma) for modes 10/26 to cover
188  * the edge filtering skip path */
189  if (mode == 10 || mode == 26) {
191  call_ref(buf0, top, left, stride, 1, mode);
192  call_new(buf1, top, left, stride, 1, mode);
193  if (memcmp(buf0, buf1, size * stride))
194  fail();
195  }
196 
197  bench_new(buf1, top, left, stride, 0, mode);
198  }
199  }
200  }
201 }
202 
204  uint8_t *top, uint8_t *left, int bit_depth)
205 {
206  const char *const block_name[] = { "8x8", "16x16", "32x32" };
207  const int block_size[] = { 8, 16, 32 };
208  int i;
209 
210  /* 3-tap filter: out[i] = (in[i+1] + 2*in[i] + in[i-1] + 2) >> 2
211  * Filters 2*size-1 samples (indices 0..2*size-2) plus corner [-1].
212  * Output: filtered_left[-1..2*size-1] and filtered_top[-1..2*size-1] */
213  declare_func(void, uint8_t *filtered_left, uint8_t *filtered_top,
214  const uint8_t *left, const uint8_t *top, int size);
215 
216  for (i = 0; i < 3; i++) {
217  int size = block_size[i];
218  int n = 2 * size;
219 
220  if (check_func(h->ref_filter_3tap[i],
221  "hevc_ref_filter_3tap_%s_%d",
222  block_name[i], bit_depth)) {
223  /* Allocate output buffers with space for [-1] indexing.
224  * Need n+1 elements: indices [-1..n-1] = n+1 pixels.
225  * Use (n+1)*SIZEOF_PIXEL bytes starting at offset SIZEOF_PIXEL. */
226  LOCAL_ALIGNED_32(uint8_t, fl_ref_buf, [PRED_SIZE + 16]);
227  LOCAL_ALIGNED_32(uint8_t, fl_new_buf, [PRED_SIZE + 16]);
228  LOCAL_ALIGNED_32(uint8_t, ft_ref_buf, [PRED_SIZE + 16]);
229  LOCAL_ALIGNED_32(uint8_t, ft_new_buf, [PRED_SIZE + 16]);
230  uint8_t *fl_ref = fl_ref_buf + 8;
231  uint8_t *fl_new = fl_new_buf + 8;
232  uint8_t *ft_ref = ft_ref_buf + 8;
233  uint8_t *ft_new = ft_new_buf + 8;
234 
236  /* Clear output buffers so comparison is clean */
237  memset(fl_ref_buf, 0, PRED_SIZE + 16);
238  memset(fl_new_buf, 0, PRED_SIZE + 16);
239  memset(ft_ref_buf, 0, PRED_SIZE + 16);
240  memset(ft_new_buf, 0, PRED_SIZE + 16);
241 
242  call_ref(fl_ref, ft_ref, left, top, size);
243  call_new(fl_new, ft_new, left, top, size);
244 
245  /* Compare filtered_left[-1..2*size-1] and filtered_top[-1..2*size-1] */
246  if (memcmp(fl_ref - SIZEOF_PIXEL, fl_new - SIZEOF_PIXEL,
247  (n + 1) * SIZEOF_PIXEL))
248  fail();
249  if (memcmp(ft_ref - SIZEOF_PIXEL, ft_new - SIZEOF_PIXEL,
250  (n + 1) * SIZEOF_PIXEL))
251  fail();
252 
253  bench_new(fl_new, ft_new, left, top, size);
254  }
255  }
256 }
257 
259  uint8_t *top, uint8_t *left,
260  int bit_depth)
261 {
262  /* Strong intra smoothing: only 32x32 luma.
263  * Interpolates top into filtered_top[0..62], sets filtered_top[-1] and [63].
264  * Modifies left[0..62] in-place. */
265  declare_func(void, uint8_t *filtered_top, uint8_t *left,
266  const uint8_t *top);
267 
268  if (check_func(h->ref_filter_strong,
269  "hevc_ref_filter_strong_%d", bit_depth)) {
270  LOCAL_ALIGNED_32(uint8_t, ft_ref_buf, [PRED_SIZE + 16]);
271  LOCAL_ALIGNED_32(uint8_t, ft_new_buf, [PRED_SIZE + 16]);
272  LOCAL_ALIGNED_32(uint8_t, left_ref_buf, [PRED_SIZE + 16]);
273  LOCAL_ALIGNED_32(uint8_t, left_new_buf, [PRED_SIZE + 16]);
274  uint8_t *ft_ref = ft_ref_buf + 8;
275  uint8_t *ft_new = ft_new_buf + 8;
276  uint8_t *left_ref = left_ref_buf + 8;
277  uint8_t *left_new = left_new_buf + 8;
278 
280  memset(ft_ref_buf, 0, PRED_SIZE + 16);
281  memset(ft_new_buf, 0, PRED_SIZE + 16);
282 
283  /* Copy left so both ref and new start with the same input
284  * (left is modified in-place) */
285  memcpy(left_ref_buf, left - 8, PRED_SIZE + 16);
286  memcpy(left_new_buf, left - 8, PRED_SIZE + 16);
287 
288  call_ref(ft_ref, left_ref, top);
289  call_new(ft_new, left_new, top);
290 
291  /* Compare filtered_top[-1..63] = 65 pixels */
292  if (memcmp(ft_ref - SIZEOF_PIXEL, ft_new - SIZEOF_PIXEL,
293  65 * SIZEOF_PIXEL))
294  fail();
295 
296  /* Compare left[-1..63] = 65 pixels (left[-1] is unchanged,
297  * left[0..62] are modified, left[63] is unchanged) */
298  if (memcmp(left_ref - SIZEOF_PIXEL, left_new - SIZEOF_PIXEL,
299  65 * SIZEOF_PIXEL))
300  fail();
301 
302  bench_new(ft_new, left_new, top);
303  }
304 }
305 
306 void checkasm_check_hevc_pred(void)
307 {
308  LOCAL_ALIGNED_32(uint8_t, buf0, [BUF_SIZE]);
309  LOCAL_ALIGNED_32(uint8_t, buf1, [BUF_SIZE]);
310  LOCAL_ALIGNED_32(uint8_t, top_buf, [PRED_SIZE + 16]);
311  LOCAL_ALIGNED_32(uint8_t, left_buf, [PRED_SIZE + 16]);
312  /* Add offset of 8 bytes to allow negative indexing (top[-1], left[-1]) */
313  uint8_t *top = top_buf + 8;
314  uint8_t *left = left_buf + 8;
315  int bit_depth;
316 
317  for (bit_depth = 8; bit_depth <= 10; bit_depth += 2) {
319 
321  check_pred_dc(&h, buf0, buf1, top, left, bit_depth);
322  }
323  report("pred_dc");
324 
325  for (bit_depth = 8; bit_depth <= 10; bit_depth += 2) {
327 
329  check_pred_planar(&h, buf0, buf1, top, left, bit_depth);
330  }
331  report("pred_planar");
332 
333  for (bit_depth = 8; bit_depth <= 10; bit_depth += 2) {
335 
337  check_pred_angular(&h, buf0, buf1, top, left, bit_depth);
338  }
339  report("pred_angular");
340 
341  for (bit_depth = 8; bit_depth <= 10; bit_depth += 2) {
343 
346  }
347  report("ref_filter_3tap");
348 
349  for (bit_depth = 8; bit_depth <= 10; bit_depth += 2) {
351 
354  }
355  report("ref_filter_strong");
356 }
mem_internal.h
PRED_SIZE
#define PRED_SIZE
Definition: hevc_pred.c:31
check_pred_planar
static void check_pred_planar(HEVCPredContext *h, uint8_t *buf0, uint8_t *buf1, uint8_t *top, uint8_t *left, int bit_depth)
Definition: hevc_pred.c:97
mode
Definition: swscale.c:60
check_func
#define check_func(func,...)
Definition: checkasm.h:214
call_ref
#define call_ref(...)
Definition: checkasm.h:230
bit_depth
static void bit_depth(AudioStatsContext *s, const uint64_t *const mask, uint8_t *depth)
Definition: af_astats.c:246
randomize_ref_buffers
#define randomize_ref_buffers()
Definition: hevc_pred.c:49
fail
#define fail()
Definition: checkasm.h:224
checkasm.h
ff_hevc_pred_init
void ff_hevc_pred_init(HEVCPredContext *hpc, int bit_depth)
Definition: pred.c:43
intreadwrite.h
check_pred_angular
static void check_pred_angular(HEVCPredContext *h, uint8_t *buf0, uint8_t *buf1, uint8_t *top, uint8_t *left, int bit_depth)
Definition: hevc_pred.c:138
HEVCPredContext
Definition: pred.h:32
call_new
#define call_new(...)
Definition: checkasm.h:238
LOCAL_ALIGNED_32
#define LOCAL_ALIGNED_32(t, v,...)
Definition: mem_internal.h:132
pixel_mask
static const uint32_t pixel_mask[3]
Definition: hevc_pred.c:27
randomize_buffers
#define randomize_buffers()
Definition: hevc_pred.c:33
i
#define i(width, name, range_min, range_max)
Definition: cbs_h264.c:63
size
int size
Definition: twinvq_data.h:10344
check_pred_dc
static void check_pred_dc(HEVCPredContext *h, uint8_t *buf0, uint8_t *buf1, uint8_t *top, uint8_t *left, int bit_depth)
Definition: hevc_pred.c:59
SIZEOF_PIXEL
#define SIZEOF_PIXEL
Definition: hevc_pred.c:29
BUF_SIZE
#define BUF_SIZE
Definition: hevc_pred.c:30
report
#define report
Definition: checkasm.h:227
bench_new
#define bench_new(...)
Definition: checkasm.h:429
pred.h
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
mode
mode
Definition: ebur128.h:83
check_ref_filter_strong
static void check_ref_filter_strong(HEVCPredContext *h, uint8_t *top, uint8_t *left, int bit_depth)
Definition: hevc_pred.c:253
declare_func
#define declare_func(ret,...)
Definition: checkasm.h:219
h
h
Definition: vp9dsp_template.c:2070
stride
#define stride
Definition: h264pred_template.c:536
checkasm_check_hevc_pred
void checkasm_check_hevc_pred(void)
Definition: hevc_pred.c:301
src
#define src
Definition: vp8dsp.c:248
check_ref_filter_3tap
static void check_ref_filter_3tap(HEVCPredContext *h, uint8_t *top, uint8_t *left, int bit_depth)
Definition: hevc_pred.c:198