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(x) (A.x == B.x)
141 int tx, scale_factor;
145 tx = (0x4000 + abs(td / 2)) / td;
146 scale_factor =
av_clip_c((tb * tx + 32) >> 6, -4096, 4095);
148 (scale_factor * src->
x < 0)) >> 8);
150 (scale_factor * src->
y < 0)) >> 8);
156 RefPicList *refPicList_col,
int listCol,
int refidxCol)
158 int cur_lt = refPicList[X].
isLongTerm[refIdxLx];
159 int col_lt = refPicList_col[listCol].
isLongTerm[refidxCol];
160 int col_poc_diff, cur_poc_diff;
162 if (cur_lt != col_lt) {
168 col_poc_diff = colPic - refPicList_col[listCol].
list[refidxCol];
169 cur_poc_diff = poc - refPicList[X].
list[refIdxLx];
174 if (cur_lt || col_poc_diff == cur_poc_diff) {
175 mvLXCol->
x = mvCol->
x;
176 mvLXCol->
y = mvCol->
y;
178 mv_scale(mvLXCol, mvCol, col_poc_diff, cur_poc_diff);
183 #define CHECK_MVSET(l) \
184 check_mvset(mvLXCol, temp_col.mv + l, \
186 refPicList, X, refIdxLx, \
187 refPicList_col, L ## l, temp_col.ref_idx[l])
191 int refIdxLx,
Mv *mvLXCol,
int X,
207 int check_diffpicount = 0;
209 for (i = 0; i < refPicList[0].
nb_refs; i++) {
210 if (refPicList[0].list[i] > s->
poc)
213 for (i = 0; i < refPicList[1].
nb_refs; i++) {
214 if (refPicList[1].list[i] > s->
poc)
217 if (check_diffpicount == 0 && X == 0)
219 else if (check_diffpicount == 0 && X == 1)
232 #define TAB_MVF(x, y) \
233 tab_mvf[(y) * min_pu_width + x]
235 #define TAB_MVF_PU(v) \
236 TAB_MVF(x ## v ## _pu, y ## v ## _pu)
238 #define DERIVE_TEMPORAL_COLOCATED_MVS \
239 derive_temporal_colocated_mvs(s, temp_col, \
240 refIdxLx, mvLXCol, X, colPic, \
241 ff_hevc_get_ref_list(s, ref, x, y))
247 int nPbW,
int nPbH,
int refIdxLx,
252 int x, y, x_pu, y_pu;
254 int availableFlagLXCol = 0;
272 y < s->sps->height &&
278 temp_col =
TAB_MVF(x_pu, y_pu);
283 if (tab_mvf && !availableFlagLXCol) {
284 x = x0 + (nPbW >> 1);
285 y = y0 + (nPbH >> 1);
290 temp_col =
TAB_MVF(x_pu, y_pu);
293 return availableFlagLXCol;
296 #define AVAILABLE(cand, v) \
297 (cand && !TAB_MVF_PU(v).is_intra)
299 #define PRED_BLOCK_AVAILABLE(v) \
300 check_prediction_block_available(s, log2_cb_size, \
301 x0, y0, nPbW, nPbH, \
302 x ## v, y ## v, part_idx)
304 #define COMPARE_MV_REFIDX(a, b) \
305 compareMVrefidx(TAB_MVF_PU(a), TAB_MVF_PU(b))
313 int singleMCLFlag,
int part_idx,
314 struct MvField mergecandlist[])
328 const int xA1 = x0 - 1;
329 const int yA1 = y0 + nPbH - 1;
333 const int xB1 = x0 + nPbW - 1;
334 const int yB1 = y0 - 1;
338 const int xB0 = x0 + nPbW;
339 const int yB0 = y0 - 1;
343 const int xA0 = x0 - 1;
344 const int yA0 = y0 + nPbH;
348 const int xB2 = x0 - 1;
349 const int yB2 = y0 - 1;
360 int nb_merge_cand = 0;
361 int nb_orig_merge_cand = 0;
374 if (!singleMCLFlag && part_idx == 1 &&
388 if (!singleMCLFlag && part_idx == 1 &&
396 if (is_available_a1 && is_available_b1)
399 if (is_available_b1 && check_MER)
406 is_available_b0 = check_B0 &&
AVAILABLE(cand_up_right,
B0);
411 if (is_available_b1 && is_available_b0)
414 if (is_available_b0 && check_MER)
421 is_available_a0 = check_A0 &&
AVAILABLE(cand_bottom_left, A0);
426 if (is_available_a1 && is_available_a0)
429 if (is_available_a0 && check_MER)
430 mergecandlist[nb_merge_cand++] =
TAB_MVF_PU(A0);
440 if (is_available_a1 && is_available_b2)
443 if (is_available_b1 && is_available_b2)
446 if (is_available_b2 && check_MER && check_MER_1 && nb_merge_cand != 4)
451 nb_merge_cand < s->sh.max_num_merge_cand) {
452 Mv mv_l0_col, mv_l1_col;
457 0, &mv_l1_col, 1) : 0;
459 if (available_l0 || available_l1) {
460 mergecandlist[nb_merge_cand].
is_intra = 0;
461 mergecandlist[nb_merge_cand].
pred_flag[0] = available_l0;
462 mergecandlist[nb_merge_cand].
pred_flag[1] = available_l1;
464 mergecandlist[nb_merge_cand].
mv[0] = mv_l0_col;
465 mergecandlist[nb_merge_cand].
ref_idx[0] = 0;
468 mergecandlist[nb_merge_cand].
mv[1] = mv_l1_col;
469 mergecandlist[nb_merge_cand].
ref_idx[1] = 0;
475 nb_orig_merge_cand = nb_merge_cand;
479 nb_orig_merge_cand < s->sh.max_num_merge_cand) {
483 comb_idx < nb_orig_merge_cand * (nb_orig_merge_cand - 1); comb_idx++) {
486 MvField l0_cand = mergecandlist[l0_cand_idx];
487 MvField l1_cand = mergecandlist[l1_cand_idx];
492 l0_cand.
mv[0].
x != l1_cand.
mv[1].
x ||
493 l0_cand.
mv[0].
y != l1_cand.
mv[1].
y)) {
496 mergecandlist[nb_merge_cand].
pred_flag[0] = 1;
497 mergecandlist[nb_merge_cand].
pred_flag[1] = 1;
498 mergecandlist[nb_merge_cand].
mv[0].
x = l0_cand.
mv[0].
x;
499 mergecandlist[nb_merge_cand].
mv[0].
y = l0_cand.
mv[0].
y;
500 mergecandlist[nb_merge_cand].
mv[1].
x = l1_cand.
mv[1].
x;
501 mergecandlist[nb_merge_cand].
mv[1].
y = l1_cand.
mv[1].
y;
502 mergecandlist[nb_merge_cand].
is_intra = 0;
509 while (nb_merge_cand < s->sh.max_num_merge_cand) {
510 mergecandlist[nb_merge_cand].
pred_flag[0] = 1;
512 mergecandlist[nb_merge_cand].
mv[0].
x = 0;
513 mergecandlist[nb_merge_cand].
mv[0].
y = 0;
514 mergecandlist[nb_merge_cand].
mv[1].
x = 0;
515 mergecandlist[nb_merge_cand].
mv[1].
y = 0;
516 mergecandlist[nb_merge_cand].
is_intra = 0;
517 mergecandlist[nb_merge_cand].
ref_idx[0] = zero_idx < nb_refs ? zero_idx : 0;
518 mergecandlist[nb_merge_cand].
ref_idx[1] = zero_idx < nb_refs ? zero_idx : 0;
529 int nPbH,
int log2_cb_size,
int part_idx,
532 int singleMCLFlag = 0;
533 int nCS = 1 << log2_cb_size;
534 struct MvField mergecand_list[MRG_MAX_NUM_CANDS] = { { { { 0 } } } };
550 singleMCLFlag, part_idx, mergecand_list);
552 if (mergecand_list[merge_idx].
pred_flag[0] == 1 &&
553 mergecand_list[merge_idx].
pred_flag[1] == 1 &&
554 (nPbW2 + nPbH2) == 12) {
555 mergecand_list[merge_idx].
ref_idx[1] = -1;
556 mergecand_list[merge_idx].
pred_flag[1] = 0;
559 *mv = mergecand_list[merge_idx];
563 int min_pu_width,
int x,
int y,
564 int elist,
int ref_idx_curr,
int ref_idx)
568 int ref_pic_elist = refPicList[elist].
list[
TAB_MVF(x, y).ref_idx[elist]];
569 int ref_pic_curr = refPicList[ref_idx_curr].
list[
ref_idx];
571 if (ref_pic_elist != ref_pic_curr) {
572 int poc_diff = s->
poc - ref_pic_elist;
588 refPicList[pred_flag_index].list[
TAB_MVF(x, y).ref_idx[pred_flag_index]] == refPicList[ref_idx_curr].list[ref_idx]) {
589 *mv =
TAB_MVF(x, y).mv[pred_flag_index];
605 refPicList[pred_flag_index].
isLongTerm[(
TAB_MVF(x, y).ref_idx[pred_flag_index])];
607 if (
TAB_MVF(x, y).pred_flag[pred_flag_index] &&
608 colIsLongTerm == currIsLongTerm) {
609 *mv =
TAB_MVF(x, y).mv[pred_flag_index];
612 pred_flag_index, ref_idx_curr, ref_idx);
618 #define MP_MX(v, pred, mx) \
619 mv_mp_mode_mx(s, x ## v ## _pu, y ## v ## _pu, pred, \
620 &mx, ref_idx_curr, ref_idx)
622 #define MP_MX_LT(v, pred, mx) \
623 mv_mp_mode_mx_lt(s, x ## v ## _pu, y ## v ## _pu, pred, \
624 &mx, ref_idx_curr, ref_idx)
627 int nPbH,
int log2_cb_size,
int part_idx,
629 int mvp_lx_flag,
int LX)
633 int isScaledFlag_L0 = 0;
634 int availableFlagLXA0 = 0;
635 int availableFlagLXB0 = 0;
636 int numMVPCandLX = 0;
652 int xB1_pu = 0, yB1_pu = 0;
653 int is_available_b1 = 0;
656 int xB2_pu = 0, yB2_pu = 0;
657 int is_available_b2 = 0;
658 Mv mvpcand_list[2] = { { 0 } };
661 int ref_idx_curr = 0;
663 int pred_flag_index_l0;
664 int pred_flag_index_l1;
676 int cand_bottom_left = (y0 + nPbH >= lc->
end_of_tiles_y) ? 0 : cand_left;
680 pred_flag_index_l0 = LX;
681 pred_flag_index_l1 = !LX;
698 if (is_available_a0 || is_available_a1)
701 if (is_available_a0) {
702 availableFlagLXA0 =
MP_MX(A0, pred_flag_index_l0, mxA);
703 if (!availableFlagLXA0)
704 availableFlagLXA0 =
MP_MX(A0, pred_flag_index_l1, mxA);
707 if (is_available_a1 && !availableFlagLXA0) {
708 availableFlagLXA0 =
MP_MX(
A1, pred_flag_index_l0, mxA);
709 if (!availableFlagLXA0)
710 availableFlagLXA0 =
MP_MX(
A1, pred_flag_index_l1, mxA);
713 if (is_available_a0 && !availableFlagLXA0) {
714 availableFlagLXA0 =
MP_MX_LT(A0, pred_flag_index_l0, mxA);
715 if (!availableFlagLXA0)
716 availableFlagLXA0 =
MP_MX_LT(A0, pred_flag_index_l1, mxA);
719 if (is_available_a1 && !availableFlagLXA0) {
720 availableFlagLXA0 =
MP_MX_LT(
A1, pred_flag_index_l0, mxA);
721 if (!availableFlagLXA0)
722 availableFlagLXA0 =
MP_MX_LT(
A1, pred_flag_index_l1, mxA);
734 if (is_available_b0) {
735 availableFlagLXB0 =
MP_MX(
B0, pred_flag_index_l0, mxB);
736 if (!availableFlagLXB0)
737 availableFlagLXB0 =
MP_MX(
B0, pred_flag_index_l1, mxB);
740 if (!availableFlagLXB0) {
749 if (is_available_b1) {
750 availableFlagLXB0 =
MP_MX(
B1, pred_flag_index_l0, mxB);
751 if (!availableFlagLXB0)
752 availableFlagLXB0 =
MP_MX(
B1, pred_flag_index_l1, mxB);
756 if (!availableFlagLXB0) {
764 if (is_available_b2) {
765 availableFlagLXB0 =
MP_MX(
B2, pred_flag_index_l0, mxB);
766 if (!availableFlagLXB0)
767 availableFlagLXB0 =
MP_MX(
B2, pred_flag_index_l1, mxB);
771 if (isScaledFlag_L0 == 0) {
772 if (availableFlagLXB0) {
773 availableFlagLXA0 = 1;
776 availableFlagLXB0 = 0;
779 if (is_available_b0) {
780 availableFlagLXB0 =
MP_MX_LT(
B0, pred_flag_index_l0, mxB);
781 if (!availableFlagLXB0)
782 availableFlagLXB0 =
MP_MX_LT(
B0, pred_flag_index_l1, mxB);
785 if (is_available_b1 && !availableFlagLXB0) {
786 availableFlagLXB0 =
MP_MX_LT(
B1, pred_flag_index_l0, mxB);
787 if (!availableFlagLXB0)
788 availableFlagLXB0 =
MP_MX_LT(
B1, pred_flag_index_l1, mxB);
791 if (is_available_b2 && !availableFlagLXB0) {
792 availableFlagLXB0 =
MP_MX_LT(
B2, pred_flag_index_l0, mxB);
793 if (!availableFlagLXB0)
794 availableFlagLXB0 =
MP_MX_LT(
B2, pred_flag_index_l1, mxB);
798 if (availableFlagLXA0)
799 mvpcand_list[numMVPCandLX++] = mxA;
801 if (availableFlagLXB0 && (!availableFlagLXA0 || mxA.
x != mxB.
x || mxA.
y != mxB.
y))
802 mvpcand_list[numMVPCandLX++] = mxB;
805 if (numMVPCandLX < 2 && s->sh.slice_temporal_mvp_enabled_flag) {
811 mvpcand_list[numMVPCandLX++] = mv_col;
815 while (numMVPCandLX < 2)
816 mvpcand_list[numMVPCandLX++] = (
Mv){ 0, 0 };
818 mv->
mv[LX].
x = mvpcand_list[mvp_lx_flag].
x;
819 mv->
mv[LX].
y = mvpcand_list[mvp_lx_flag].
y;