67 #define MIN_TB_ADDR_ZS(x, y) \ 68 s->pps->min_tb_addr_zs[(y) * s->sps->min_tb_width + (x)] 73 if (xN < 0 || yN < 0 ||
85 int x0,
int y0,
int nPbW,
int nPbH,
86 int xA1,
int yA1,
int partIdx)
88 return !(nPbW << 1 == 1 << log2_cb_size &&
89 nPbH << 1 == 1 << log2_cb_size && partIdx == 1 &&
90 lc->
cu.
x + nPbW > xA1 &&
91 lc->
cu.
y + nPbH <= yA1);
98 int x0,
int y0,
int nPbW,
int nPbH,
99 int xA1,
int yA1,
int partIdx)
103 if (lc->
cu.
x < xA1 && lc->
cu.
y < yA1 &&
104 (lc->
cu.
x + (1 << log2_cb_size)) > xA1 &&
105 (lc->
cu.
y + (1 << log2_cb_size)) > yA1)
107 nPbW, nPbH, xA1, yA1, partIdx);
117 return xN >> plevel == xP >> plevel &&
118 yN >> plevel == yP >> plevel;
121 #define MATCH_MV(x) (AV_RN32A(&A.x) == AV_RN32A(&B.x)) 122 #define MATCH(x) (A.x == B.x) 142 int tx, scale_factor;
146 tx = (0x4000 + abs(td / 2)) / td;
147 scale_factor =
av_clip_c((tb * tx + 32) >> 6, -4096, 4095);
149 (scale_factor * src->
x < 0)) >> 8);
151 (scale_factor * src->
y < 0)) >> 8);
157 RefPicList *refPicList_col,
int listCol,
int refidxCol)
159 int cur_lt = refPicList[X].
isLongTerm[refIdxLx];
160 int col_lt = refPicList_col[listCol].
isLongTerm[refidxCol];
161 int col_poc_diff, cur_poc_diff;
163 if (cur_lt != col_lt) {
169 col_poc_diff = colPic - refPicList_col[listCol].
list[refidxCol];
170 cur_poc_diff = poc - refPicList[X].
list[refIdxLx];
175 if (cur_lt || col_poc_diff == cur_poc_diff) {
176 mvLXCol->
x = mvCol->
x;
177 mvLXCol->
y = mvCol->
y;
179 mv_scale(mvLXCol, mvCol, col_poc_diff, cur_poc_diff);
184 #define CHECK_MVSET(l) \ 185 check_mvset(mvLXCol, temp_col.mv + l, \ 187 refPicList, X, refIdxLx, \ 188 refPicList_col, L ## l, temp_col.ref_idx[l]) 192 int refIdxLx,
Mv *mvLXCol,
int X,
208 int check_diffpicount = 0;
210 for (i = 0; i < refPicList[0].
nb_refs; i++) {
211 if (refPicList[0].list[i] > s->
poc)
214 for (i = 0; i < refPicList[1].
nb_refs; i++) {
215 if (refPicList[1].list[i] > s->
poc)
218 if (check_diffpicount == 0 && X == 0)
220 else if (check_diffpicount == 0 && X == 1)
233 #define TAB_MVF(x, y) \ 234 tab_mvf[(y) * min_pu_width + x] 236 #define TAB_MVF_PU(v) \ 237 TAB_MVF(x ## v ## _pu, y ## v ## _pu) 239 #define DERIVE_TEMPORAL_COLOCATED_MVS \ 240 derive_temporal_colocated_mvs(s, temp_col, \ 241 refIdxLx, mvLXCol, X, colPic, \ 242 ff_hevc_get_ref_list(s, ref, x, y)) 248 int nPbW,
int nPbH,
int refIdxLx,
253 int x, y, x_pu, y_pu;
255 int availableFlagLXCol = 0;
261 memset(mvLXCol, 0,
sizeof(*mvLXCol));
274 y < s->sps->height &&
281 temp_col =
TAB_MVF(x_pu, y_pu);
286 if (tab_mvf && !availableFlagLXCol) {
287 x = x0 + (nPbW >> 1);
288 y = y0 + (nPbH >> 1);
294 temp_col =
TAB_MVF(x_pu, y_pu);
297 return availableFlagLXCol;
300 #define AVAILABLE(cand, v) \ 301 (cand && !TAB_MVF_PU(v).is_intra) 303 #define PRED_BLOCK_AVAILABLE(v) \ 304 check_prediction_block_available(s, log2_cb_size, \ 305 x0, y0, nPbW, nPbH, \ 306 x ## v, y ## v, part_idx) 308 #define COMPARE_MV_REFIDX(a, b) \ 309 compareMVrefidx(TAB_MVF_PU(a), TAB_MVF_PU(b)) 317 int singleMCLFlag,
int part_idx,
319 struct MvField mergecandlist[])
333 const int xA1 = x0 - 1;
334 const int yA1 = y0 + nPbH - 1;
338 const int xB1 = x0 + nPbW - 1;
339 const int yB1 = y0 - 1;
343 const int xB0 = x0 + nPbW;
344 const int yB0 = y0 - 1;
348 const int xA0 = x0 - 1;
349 const int yA0 = y0 + nPbH;
353 const int xB2 = x0 - 1;
354 const int yB2 = y0 - 1;
365 int nb_merge_cand = 0;
366 int nb_orig_merge_cand = 0;
379 if (!singleMCLFlag && part_idx == 1 &&
387 if (is_available_a1) {
397 if (!singleMCLFlag && part_idx == 1 &&
405 if (is_available_a1 && is_available_b1)
408 if (is_available_b1 && check_MER)
415 is_available_b0 = check_B0 &&
AVAILABLE(cand_up_right,
B0);
420 if (is_available_b1 && is_available_b0)
423 if (is_available_b0 && check_MER) {
425 if (merge_idx == nb_merge_cand)
434 is_available_a0 = check_A0 &&
AVAILABLE(cand_bottom_left, A0);
439 if (is_available_a1 && is_available_a0)
442 if (is_available_a0 && check_MER) {
443 mergecandlist[nb_merge_cand] =
TAB_MVF_PU(A0);
444 if (merge_idx == nb_merge_cand)
457 if (is_available_a1 && is_available_b2)
460 if (is_available_b1 && is_available_b2)
463 if (is_available_b2 && check_MER && check_MER_1 && nb_merge_cand != 4) {
465 if (merge_idx == nb_merge_cand)
472 nb_merge_cand < s->sh.max_num_merge_cand) {
473 Mv mv_l0_col, mv_l1_col;
478 0, &mv_l1_col, 1) : 0;
480 if (available_l0 || available_l1) {
481 mergecandlist[nb_merge_cand].
is_intra = 0;
482 mergecandlist[nb_merge_cand].
pred_flag[0] = available_l0;
483 mergecandlist[nb_merge_cand].
pred_flag[1] = available_l1;
484 AV_ZERO16(mergecandlist[nb_merge_cand].ref_idx);
485 mergecandlist[nb_merge_cand].
mv[0] = mv_l0_col;
486 mergecandlist[nb_merge_cand].
mv[1] = mv_l1_col;
488 if (merge_idx == nb_merge_cand)
494 nb_orig_merge_cand = nb_merge_cand;
498 nb_orig_merge_cand < s->sh.max_num_merge_cand) {
502 comb_idx < nb_orig_merge_cand * (nb_orig_merge_cand - 1); comb_idx++) {
505 MvField l0_cand = mergecandlist[l0_cand_idx];
506 MvField l1_cand = mergecandlist[l1_cand_idx];
514 mergecandlist[nb_merge_cand].
pred_flag[0] = 1;
515 mergecandlist[nb_merge_cand].
pred_flag[1] = 1;
516 AV_COPY32(&mergecandlist[nb_merge_cand].
mv[0], &l0_cand.
mv[0]);
517 AV_COPY32(&mergecandlist[nb_merge_cand].mv[1], &l1_cand.
mv[1]);
518 mergecandlist[nb_merge_cand].
is_intra = 0;
519 if (merge_idx == nb_merge_cand)
527 while (nb_merge_cand < s->sh.max_num_merge_cand) {
528 mergecandlist[nb_merge_cand].
pred_flag[0] = 1;
532 mergecandlist[nb_merge_cand].
is_intra = 0;
533 mergecandlist[nb_merge_cand].
ref_idx[0] = zero_idx < nb_refs ? zero_idx : 0;
534 mergecandlist[nb_merge_cand].
ref_idx[1] = zero_idx < nb_refs ? zero_idx : 0;
536 if (merge_idx == nb_merge_cand)
547 int nPbH,
int log2_cb_size,
int part_idx,
550 int singleMCLFlag = 0;
551 int nCS = 1 << log2_cb_size;
568 singleMCLFlag, part_idx,
569 merge_idx, mergecand_list);
571 if (mergecand_list[merge_idx].pred_flag[0] == 1 &&
572 mergecand_list[merge_idx].pred_flag[1] == 1 &&
573 (nPbW2 + nPbH2) == 12) {
574 mergecand_list[merge_idx].ref_idx[1] = -1;
575 mergecand_list[merge_idx].pred_flag[1] = 0;
578 *mv = mergecand_list[merge_idx];
582 int min_pu_width,
int x,
int y,
583 int elist,
int ref_idx_curr,
int ref_idx)
587 int ref_pic_elist = refPicList[elist].
list[
TAB_MVF(x, y).ref_idx[elist]];
588 int ref_pic_curr = refPicList[ref_idx_curr].
list[ref_idx];
590 if (ref_pic_elist != ref_pic_curr) {
591 int poc_diff = s->
poc - ref_pic_elist;
599 Mv *
mv,
int ref_idx_curr,
int ref_idx)
606 if (
TAB_MVF(x, y).pred_flag[pred_flag_index] == 1 &&
607 refPicList[pred_flag_index].list[
TAB_MVF(x, y).ref_idx[pred_flag_index]] == refPicList[ref_idx_curr].list[ref_idx]) {
608 *mv =
TAB_MVF(x, y).mv[pred_flag_index];
615 Mv *
mv,
int ref_idx_curr,
int ref_idx)
621 int currIsLongTerm = refPicList[ref_idx_curr].
isLongTerm[ref_idx];
624 refPicList[pred_flag_index].
isLongTerm[(
TAB_MVF(x, y).ref_idx[pred_flag_index])];
626 if (
TAB_MVF(x, y).pred_flag[pred_flag_index] &&
627 colIsLongTerm == currIsLongTerm) {
628 *mv =
TAB_MVF(x, y).mv[pred_flag_index];
631 pred_flag_index, ref_idx_curr, ref_idx);
637 #define MP_MX(v, pred, mx) \ 638 mv_mp_mode_mx(s, x ## v ## _pu, y ## v ## _pu, pred, \ 639 &mx, ref_idx_curr, ref_idx) 641 #define MP_MX_LT(v, pred, mx) \ 642 mv_mp_mode_mx_lt(s, x ## v ## _pu, y ## v ## _pu, pred, \ 643 &mx, ref_idx_curr, ref_idx) 646 int nPbH,
int log2_cb_size,
int part_idx,
648 int mvp_lx_flag,
int LX)
652 int isScaledFlag_L0 = 0;
653 int availableFlagLXA0 = 0;
654 int availableFlagLXB0 = 0;
655 int numMVPCandLX = 0;
671 int xB1_pu = 0, yB1_pu = 0;
672 int is_available_b1 = 0;
675 int xB2_pu = 0, yB2_pu = 0;
676 int is_available_b2 = 0;
677 Mv mvpcand_list[2] = { { 0 } };
680 int ref_idx_curr = 0;
682 int pred_flag_index_l0;
683 int pred_flag_index_l1;
695 int cand_bottom_left = (y0 + nPbH >= lc->
end_of_tiles_y) ? 0 : cand_left;
699 pred_flag_index_l0 = LX;
700 pred_flag_index_l1 = !LX;
717 if (is_available_a0 || is_available_a1)
720 if (is_available_a0) {
721 availableFlagLXA0 =
MP_MX(A0, pred_flag_index_l0, mxA);
722 if (!availableFlagLXA0)
723 availableFlagLXA0 =
MP_MX(A0, pred_flag_index_l1, mxA);
726 if (is_available_a1 && !availableFlagLXA0) {
727 availableFlagLXA0 =
MP_MX(
A1, pred_flag_index_l0, mxA);
728 if (!availableFlagLXA0)
729 availableFlagLXA0 =
MP_MX(
A1, pred_flag_index_l1, mxA);
732 if (is_available_a0 && !availableFlagLXA0) {
733 availableFlagLXA0 =
MP_MX_LT(A0, pred_flag_index_l0, mxA);
734 if (!availableFlagLXA0)
735 availableFlagLXA0 =
MP_MX_LT(A0, pred_flag_index_l1, mxA);
738 if (is_available_a1 && !availableFlagLXA0) {
739 availableFlagLXA0 =
MP_MX_LT(
A1, pred_flag_index_l0, mxA);
740 if (!availableFlagLXA0)
741 availableFlagLXA0 =
MP_MX_LT(
A1, pred_flag_index_l1, mxA);
744 if (availableFlagLXA0 && !mvp_lx_flag) {
758 if (is_available_b0) {
759 availableFlagLXB0 =
MP_MX(
B0, pred_flag_index_l0, mxB);
760 if (!availableFlagLXB0)
761 availableFlagLXB0 =
MP_MX(
B0, pred_flag_index_l1, mxB);
764 if (!availableFlagLXB0) {
773 if (is_available_b1) {
774 availableFlagLXB0 =
MP_MX(
B1, pred_flag_index_l0, mxB);
775 if (!availableFlagLXB0)
776 availableFlagLXB0 =
MP_MX(
B1, pred_flag_index_l1, mxB);
780 if (!availableFlagLXB0) {
788 if (is_available_b2) {
789 availableFlagLXB0 =
MP_MX(
B2, pred_flag_index_l0, mxB);
790 if (!availableFlagLXB0)
791 availableFlagLXB0 =
MP_MX(
B2, pred_flag_index_l1, mxB);
795 if (isScaledFlag_L0 == 0) {
796 if (availableFlagLXB0) {
797 availableFlagLXA0 = 1;
800 availableFlagLXB0 = 0;
803 if (is_available_b0) {
804 availableFlagLXB0 =
MP_MX_LT(
B0, pred_flag_index_l0, mxB);
805 if (!availableFlagLXB0)
806 availableFlagLXB0 =
MP_MX_LT(
B0, pred_flag_index_l1, mxB);
809 if (is_available_b1 && !availableFlagLXB0) {
810 availableFlagLXB0 =
MP_MX_LT(
B1, pred_flag_index_l0, mxB);
811 if (!availableFlagLXB0)
812 availableFlagLXB0 =
MP_MX_LT(
B1, pred_flag_index_l1, mxB);
815 if (is_available_b2 && !availableFlagLXB0) {
816 availableFlagLXB0 =
MP_MX_LT(
B2, pred_flag_index_l0, mxB);
817 if (!availableFlagLXB0)
818 availableFlagLXB0 =
MP_MX_LT(
B2, pred_flag_index_l1, mxB);
822 if (availableFlagLXA0)
823 mvpcand_list[numMVPCandLX++] = mxA;
825 if (availableFlagLXB0 && (!availableFlagLXA0 || mxA.
x != mxB.
x || mxA.
y != mxB.
y))
826 mvpcand_list[numMVPCandLX++] = mxB;
829 if (numMVPCandLX < 2 && s->sh.slice_temporal_mvp_enabled_flag &&
830 mvp_lx_flag == numMVPCandLX) {
836 mvpcand_list[numMVPCandLX++] = mv_col;
840 while (numMVPCandLX < 2)
841 mvpcand_list[numMVPCandLX++] = (
Mv){ 0, 0 };
843 mv->
mv[LX].
x = mvpcand_list[mvp_lx_flag].
x;
844 mv->
mv[LX].
y = mvpcand_list[mvp_lx_flag].
y;
static av_always_inline void mv_scale(Mv *dst, Mv *src, int td, int tb)
#define MP_MX(v, pred, mx)
int16_t x
horizontal component of motion vector
static int temporal_luma_motion_vector(HEVCContext *s, int x0, int y0, int nPbW, int nPbH, int refIdxLx, Mv *mvLXCol, int X)
static int mv_mp_mode_mx(HEVCContext *s, int x, int y, int pred_flag_index, Mv *mv, int ref_idx_curr, int ref_idx)
static int compareMVrefidx(struct MvField A, struct MvField B)
static av_always_inline av_const int8_t av_clip_int8_c(int a)
Clip a signed integer value into the -128,127 range.
static void derive_spatial_merge_candidates(HEVCContext *s, int x0, int y0, int nPbW, int nPbH, int log2_cb_size, int singleMCLFlag, int part_idx, int merge_idx, struct MvField mergecandlist[])
void ff_thread_await_progress(ThreadFrame *f, int n, int field)
Wait for earlier decoding threads to finish reference pictures.
static int derive_temporal_colocated_mvs(HEVCContext *s, MvField temp_col, int refIdxLx, Mv *mvLXCol, int X, int colPic, RefPicList *refPicList_col)
int log2_parallel_merge_level
log2_parallel_merge_level_minus2 + 2
static int mv_mp_mode_mx_lt(HEVCContext *s, int x, int y, int pred_flag_index, Mv *mv, int ref_idx_curr, int ref_idx)
#define MRG_MAX_NUM_CANDS
uint8_t ctb_up_right_flag
#define DERIVE_TEMPORAL_COLOCATED_MVS
#define AVAILABLE(cand, v)
#define MIN_TB_ADDR_ZS(x, y)
static av_always_inline av_const int av_clip_c(int a, int amin, int amax)
Clip a signed integer value into the amin-amax range.
unsigned int log2_ctb_size
#define MP_MX_LT(v, pred, mx)
static int check_mvset(Mv *mvLXCol, Mv *mvCol, int colPic, int poc, RefPicList *refPicList, int X, int refIdxLx, RefPicList *refPicList_col, int listCol, int refidxCol)
#define COMPARE_MV_REFIDX(a, b)
static const uint8_t l0_l1_cand_idx[12][2]
struct HEVCFrame * collocated_ref
static const int8_t mv[256][2]
static av_always_inline void dist_scale(HEVCContext *s, Mv *mv, int min_pu_width, int x, int y, int elist, int ref_idx_curr, int ref_idx)
unsigned int log2_min_pu_size
static int z_scan_block_avail(HEVCContext *s, int xCurr, int yCurr, int xN, int yN)
static int isDiffMER(HEVCContext *s, int xN, int yN, int xP, int yP)
int16_t y
vertical component of motion vector
static int check_prediction_block_available(HEVCContext *s, int log2_cb_size, int x0, int y0, int nPbW, int nPbH, int xA1, int yA1, int partIdx)
unsigned int log2_min_tb_size
void ff_hevc_luma_mv_merge_mode(HEVCContext *s, int x0, int y0, int nPbW, int nPbH, int log2_cb_size, int part_idx, int merge_idx, MvField *mv)
enum PartMode part_mode
PartMode.
static av_always_inline av_const int16_t av_clip_int16_c(int a)
Clip a signed integer value into the -32768,32767 range.
void ff_hevc_luma_mv_mvp_mode(HEVCContext *s, int x0, int y0, int nPbW, int nPbH, int log2_cb_size, int part_idx, int merge_idx, MvField *mv, int mvp_lx_flag, int LX)
#define LOCAL_ALIGNED(a, t, v,...)
void ff_hevc_set_neighbour_available(HEVCContext *s, int x0, int y0, int nPbW, int nPbH)
#define PRED_BLOCK_AVAILABLE(v)
static int same_prediction_block(HEVCLocalContext *lc, int log2_cb_size, int x0, int y0, int nPbW, int nPbH, int xA1, int yA1, int partIdx)