4 * Copyright (C) 2012 - 2013 Guillaume Martres
5 * Copyright (C) 2013 Anand Meher Kotra
7 * This file is part of FFmpeg.
9 * FFmpeg is free software; you can redistribute it and/or
10 * modify it under the terms of the GNU Lesser General Public
11 * License as published by the Free Software Foundation; either
12 * version 2.1 of the License, or (at your option) any later version.
14 * FFmpeg is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * Lesser General Public License for more details.
19 * You should have received a copy of the GNU Lesser General Public
20 * License along with FFmpeg; if not, write to the Free Software
21 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
26 static const uint8_t l0_l1_cand_idx[12][2] = {
41 void ff_hevc_set_neighbour_available(HEVCContext *s, int x0, int y0,
44 HEVCLocalContext *lc = s->HEVClc;
45 int x0b = x0 & ((1 << s->sps->log2_ctb_size) - 1);
46 int y0b = y0 & ((1 << s->sps->log2_ctb_size) - 1);
48 lc->na.cand_up = (lc->ctb_up_flag || y0b);
49 lc->na.cand_left = (lc->ctb_left_flag || x0b);
50 lc->na.cand_up_left = (!x0b && !y0b) ? lc->ctb_up_left_flag : lc->na.cand_left && lc->na.cand_up;
51 lc->na.cand_up_right_sap =
52 ((x0b + nPbW) == (1 << s->sps->log2_ctb_size)) ?
53 lc->ctb_up_right_flag && !y0b : lc->na.cand_up;
54 lc->na.cand_up_right =
55 lc->na.cand_up_right_sap
56 && (x0 + nPbW) < lc->end_of_tiles_x;
57 lc->na.cand_bottom_left = ((y0 + nPbH) >= lc->end_of_tiles_y) ? 0 : lc->na.cand_left;
61 * 6.4.1 Derivation process for z-scan order block availability
63 static av_always_inline int z_scan_block_avail(HEVCContext *s, int xCurr, int yCurr,
66 #define MIN_TB_ADDR_ZS(x, y) \
67 s->pps->min_tb_addr_zs[(y) * (s->sps->tb_mask+2) + (x)]
69 int xCurr_ctb = xCurr >> s->sps->log2_ctb_size;
70 int yCurr_ctb = yCurr >> s->sps->log2_ctb_size;
71 int xN_ctb = xN >> s->sps->log2_ctb_size;
72 int yN_ctb = yN >> s->sps->log2_ctb_size;
73 if( yN_ctb < yCurr_ctb || xN_ctb < xCurr_ctb )
76 int Curr = MIN_TB_ADDR_ZS((xCurr >> s->sps->log2_min_tb_size) & s->sps->tb_mask,
77 (yCurr >> s->sps->log2_min_tb_size) & s->sps->tb_mask);
78 int N = MIN_TB_ADDR_ZS((xN >> s->sps->log2_min_tb_size) & s->sps->tb_mask,
79 (yN >> s->sps->log2_min_tb_size) & s->sps->tb_mask);
84 //check if the two luma locations belong to the same mostion estimation region
85 static av_always_inline int is_diff_mer(HEVCContext *s, int xN, int yN, int xP, int yP)
87 uint8_t plevel = s->pps->log2_parallel_merge_level;
89 return xN >> plevel == xP >> plevel &&
90 yN >> plevel == yP >> plevel;
93 #define MATCH_MV(x) (AV_RN32A(&A.x) == AV_RN32A(&B.x))
94 #define MATCH(x) (A.x == B.x)
96 // check if the mv's and refidx are the same between A and B
97 static av_always_inline int compare_mv_ref_idx(struct MvField A, struct MvField B)
99 int a_pf = A.pred_flag;
100 int b_pf = B.pred_flag;
103 return MATCH(ref_idx[0]) && MATCH_MV(mv[0]) &&
104 MATCH(ref_idx[1]) && MATCH_MV(mv[1]);
105 } else if (a_pf == PF_L0) {
106 return MATCH(ref_idx[0]) && MATCH_MV(mv[0]);
107 } else if (a_pf == PF_L1) {
108 return MATCH(ref_idx[1]) && MATCH_MV(mv[1]);
114 static av_always_inline void mv_scale(Mv *dst, Mv *src, int td, int tb)
116 int tx, scale_factor;
118 td = av_clip_int8(td);
119 tb = av_clip_int8(tb);
120 tx = (0x4000 + abs(td / 2)) / td;
121 scale_factor = av_clip((tb * tx + 32) >> 6, -4096, 4095);
122 dst->x = av_clip_int16((scale_factor * src->x + 127 +
123 (scale_factor * src->x < 0)) >> 8);
124 dst->y = av_clip_int16((scale_factor * src->y + 127 +
125 (scale_factor * src->y < 0)) >> 8);
128 static int check_mvset(Mv *mvLXCol, Mv *mvCol,
130 RefPicList *refPicList, int X, int refIdxLx,
131 RefPicList *refPicList_col, int listCol, int refidxCol)
133 int cur_lt = refPicList[X].isLongTerm[refIdxLx];
134 int col_lt = refPicList_col[listCol].isLongTerm[refidxCol];
135 int col_poc_diff, cur_poc_diff;
137 if (cur_lt != col_lt) {
143 col_poc_diff = colPic - refPicList_col[listCol].list[refidxCol];
144 cur_poc_diff = poc - refPicList[X].list[refIdxLx];
146 if (cur_lt || col_poc_diff == cur_poc_diff || !col_poc_diff) {
147 mvLXCol->x = mvCol->x;
148 mvLXCol->y = mvCol->y;
150 mv_scale(mvLXCol, mvCol, col_poc_diff, cur_poc_diff);
155 #define CHECK_MVSET(l) \
156 check_mvset(mvLXCol, temp_col.mv + l, \
158 refPicList, X, refIdxLx, \
159 refPicList_col, L ## l, temp_col.ref_idx[l])
161 // derive the motion vectors section 8.5.3.1.8
162 static int derive_temporal_colocated_mvs(HEVCContext *s, MvField temp_col,
163 int refIdxLx, Mv *mvLXCol, int X,
164 int colPic, RefPicList *refPicList_col)
166 RefPicList *refPicList = s->ref->refPicList;
168 if (temp_col.pred_flag == PF_INTRA)
171 if (!(temp_col.pred_flag & PF_L0))
172 return CHECK_MVSET(1);
173 else if (temp_col.pred_flag == PF_L0)
174 return CHECK_MVSET(0);
175 else if (temp_col.pred_flag == PF_BI) {
176 int check_diffpicount = 0;
178 for (j = 0; j < 2; j++) {
179 for (i = 0; i < refPicList[j].nb_refs; i++) {
180 if (refPicList[j].list[i] > s->poc) {
186 if (!check_diffpicount) {
188 return CHECK_MVSET(0);
190 return CHECK_MVSET(1);
192 if (s->sh.collocated_list == L1)
193 return CHECK_MVSET(0);
195 return CHECK_MVSET(1);
202 #define TAB_MVF(x, y) \
203 tab_mvf[(y) * min_pu_width + x]
205 #define TAB_MVF_PU(v) \
206 TAB_MVF(((x ## v) >> s->sps->log2_min_pu_size), \
207 ((y ## v) >> s->sps->log2_min_pu_size))
209 #define DERIVE_TEMPORAL_COLOCATED_MVS \
210 derive_temporal_colocated_mvs(s, temp_col, \
211 refIdxLx, mvLXCol, X, colPic, \
212 ff_hevc_get_ref_list(s, ref, x, y))
215 * 8.5.3.1.7 temporal luma motion vector prediction
217 static int temporal_luma_motion_vector(HEVCContext *s, int x0, int y0,
218 int nPbW, int nPbH, int refIdxLx,
223 int x, y, x_pu, y_pu;
224 int min_pu_width = s->sps->min_pu_width;
225 int availableFlagLXCol = 0;
228 HEVCFrame *ref = s->ref->collocated_ref;
233 tab_mvf = ref->tab_mvf;
236 //bottom right collocated motion vector
241 (y0 >> s->sps->log2_ctb_size) == (y >> s->sps->log2_ctb_size) &&
242 y < s->sps->height &&
246 if (s->threads_type == FF_THREAD_FRAME)
247 ff_thread_await_progress(&ref->tf, y, 0);
248 x_pu = x >> s->sps->log2_min_pu_size;
249 y_pu = y >> s->sps->log2_min_pu_size;
250 temp_col = TAB_MVF(x_pu, y_pu);
251 availableFlagLXCol = DERIVE_TEMPORAL_COLOCATED_MVS;
254 // derive center collocated motion vector
255 if (tab_mvf && !availableFlagLXCol) {
256 x = x0 + (nPbW >> 1);
257 y = y0 + (nPbH >> 1);
260 if (s->threads_type == FF_THREAD_FRAME)
261 ff_thread_await_progress(&ref->tf, y, 0);
262 x_pu = x >> s->sps->log2_min_pu_size;
263 y_pu = y >> s->sps->log2_min_pu_size;
264 temp_col = TAB_MVF(x_pu, y_pu);
265 availableFlagLXCol = DERIVE_TEMPORAL_COLOCATED_MVS;
267 return availableFlagLXCol;
270 #define AVAILABLE(cand, v) \
271 (cand && !(TAB_MVF_PU(v).pred_flag == PF_INTRA))
273 #define PRED_BLOCK_AVAILABLE(v) \
274 z_scan_block_avail(s, x0, y0, x ## v, y ## v)
276 #define COMPARE_MV_REFIDX(a, b) \
277 compare_mv_ref_idx(TAB_MVF_PU(a), TAB_MVF_PU(b))
280 * 8.5.3.1.2 Derivation process for spatial merging candidates
282 static void derive_spatial_merge_candidates(HEVCContext *s, int x0, int y0,
285 int singleMCLFlag, int part_idx,
287 struct MvField mergecandlist[])
289 HEVCLocalContext *lc = s->HEVClc;
290 RefPicList *refPicList = s->ref->refPicList;
291 MvField *tab_mvf = s->ref->tab_mvf;
293 const int min_pu_width = s->sps->min_pu_width;
295 const int cand_bottom_left = lc->na.cand_bottom_left;
296 const int cand_left = lc->na.cand_left;
297 const int cand_up_left = lc->na.cand_up_left;
298 const int cand_up = lc->na.cand_up;
299 const int cand_up_right = lc->na.cand_up_right_sap;
301 const int xA1 = x0 - 1;
302 const int yA1 = y0 + nPbH - 1;
304 const int xB1 = x0 + nPbW - 1;
305 const int yB1 = y0 - 1;
307 const int xB0 = x0 + nPbW;
308 const int yB0 = y0 - 1;
310 const int xA0 = x0 - 1;
311 const int yA0 = y0 + nPbH;
313 const int xB2 = x0 - 1;
314 const int yB2 = y0 - 1;
316 const int nb_refs = (s->sh.slice_type == P_SLICE) ?
317 s->sh.nb_refs[0] : FFMIN(s->sh.nb_refs[0], s->sh.nb_refs[1]);
321 int nb_merge_cand = 0;
322 int nb_orig_merge_cand = 0;
331 if (!singleMCLFlag && part_idx == 1 &&
332 (lc->cu.part_mode == PART_Nx2N ||
333 lc->cu.part_mode == PART_nLx2N ||
334 lc->cu.part_mode == PART_nRx2N) ||
335 is_diff_mer(s, xA1, yA1, x0, y0)) {
338 is_available_a1 = AVAILABLE(cand_left, A1);
339 if (is_available_a1) {
340 mergecandlist[nb_merge_cand] = TAB_MVF_PU(A1);
341 if (merge_idx == 0) return;
346 if (!singleMCLFlag && part_idx == 1 &&
347 (lc->cu.part_mode == PART_2NxN ||
348 lc->cu.part_mode == PART_2NxnU ||
349 lc->cu.part_mode == PART_2NxnD) ||
350 is_diff_mer(s, xB1, yB1, x0, y0)) {
353 is_available_b1 = AVAILABLE(cand_up, B1);
354 if (is_available_b1 &&
355 !(is_available_a1 && COMPARE_MV_REFIDX(B1, A1))) {
356 mergecandlist[nb_merge_cand] = TAB_MVF_PU(B1);
357 if (merge_idx == nb_merge_cand) return;
362 // above right spatial merge candidate
363 is_available_b0 = AVAILABLE(cand_up_right, B0) &&
364 xB0 < s->sps->width &&
365 PRED_BLOCK_AVAILABLE(B0) &&
366 !is_diff_mer(s, xB0, yB0, x0, y0);
368 if (is_available_b0 &&
369 !(is_available_b1 && COMPARE_MV_REFIDX(B0, B1))) {
370 mergecandlist[nb_merge_cand] = TAB_MVF_PU(B0);
371 if (merge_idx == nb_merge_cand) return;
375 // left bottom spatial merge candidate
376 is_available_a0 = AVAILABLE(cand_bottom_left, A0) &&
377 yA0 < s->sps->height &&
378 PRED_BLOCK_AVAILABLE(A0) &&
379 !is_diff_mer(s, xA0, yA0, x0, y0);
381 if (is_available_a0 &&
382 !(is_available_a1 && COMPARE_MV_REFIDX(A0, A1))) {
383 mergecandlist[nb_merge_cand] = TAB_MVF_PU(A0);
384 if (merge_idx == nb_merge_cand) return;
388 // above left spatial merge candidate
389 is_available_b2 = AVAILABLE(cand_up_left, B2) &&
390 !is_diff_mer(s, xB2, yB2, x0, y0);
392 if (is_available_b2 &&
393 !(is_available_a1 && COMPARE_MV_REFIDX(B2, A1)) &&
394 !(is_available_b1 && COMPARE_MV_REFIDX(B2, B1)) &&
395 nb_merge_cand != 4) {
396 mergecandlist[nb_merge_cand] = TAB_MVF_PU(B2);
397 if (merge_idx == nb_merge_cand) return;
401 // temporal motion vector candidate
402 if (s->sh.slice_temporal_mvp_enabled_flag &&
403 nb_merge_cand < s->sh.max_num_merge_cand) {
404 Mv mv_l0_col, mv_l1_col;
405 int available_l0 = temporal_luma_motion_vector(s, x0, y0, nPbW, nPbH,
407 int available_l1 = (s->sh.slice_type == B_SLICE) ?
408 temporal_luma_motion_vector(s, x0, y0, nPbW, nPbH,
409 0, &mv_l1_col, 1) : 0;
411 if (available_l0 || available_l1) {
412 mergecandlist[nb_merge_cand].pred_flag = available_l0 + (available_l1 << 1);
414 mergecandlist[nb_merge_cand].mv[0] = mv_l0_col;
415 mergecandlist[nb_merge_cand].ref_idx[0] = 0;
418 mergecandlist[nb_merge_cand].mv[1] = mv_l1_col;
419 mergecandlist[nb_merge_cand].ref_idx[1] = 0;
421 if (merge_idx == nb_merge_cand) return;
426 nb_orig_merge_cand = nb_merge_cand;
428 // combined bi-predictive merge candidates (applies for B slices)
429 if (s->sh.slice_type == B_SLICE && nb_orig_merge_cand > 1 &&
430 nb_orig_merge_cand < s->sh.max_num_merge_cand) {
433 for (comb_idx = 0; nb_merge_cand < s->sh.max_num_merge_cand &&
434 comb_idx < nb_orig_merge_cand * (nb_orig_merge_cand - 1); comb_idx++) {
435 int l0_cand_idx = l0_l1_cand_idx[comb_idx][0];
436 int l1_cand_idx = l0_l1_cand_idx[comb_idx][1];
437 MvField l0_cand = mergecandlist[l0_cand_idx];
438 MvField l1_cand = mergecandlist[l1_cand_idx];
440 if ((l0_cand.pred_flag & PF_L0) && (l1_cand.pred_flag & PF_L1) &&
441 (refPicList[0].list[l0_cand.ref_idx[0]] !=
442 refPicList[1].list[l1_cand.ref_idx[1]] ||
443 AV_RN32A(&l0_cand.mv[0]) != AV_RN32A(&l1_cand.mv[1]))) {
444 mergecandlist[nb_merge_cand].ref_idx[0] = l0_cand.ref_idx[0];
445 mergecandlist[nb_merge_cand].ref_idx[1] = l1_cand.ref_idx[1];
446 mergecandlist[nb_merge_cand].pred_flag = PF_BI;
447 AV_COPY32(&mergecandlist[nb_merge_cand].mv[0], &l0_cand.mv[0]);
448 AV_COPY32(&mergecandlist[nb_merge_cand].mv[1], &l1_cand.mv[1]);
449 if (merge_idx == nb_merge_cand) return;
455 // append Zero motion vector candidates
456 while (nb_merge_cand < s->sh.max_num_merge_cand) {
457 mergecandlist[nb_merge_cand].pred_flag = PF_L0 + ((s->sh.slice_type == B_SLICE) << 1);
458 AV_ZERO32(mergecandlist[nb_merge_cand].mv+0);
459 AV_ZERO32(mergecandlist[nb_merge_cand].mv+1);
460 mergecandlist[nb_merge_cand].ref_idx[0] = zero_idx < nb_refs ? zero_idx : 0;
461 mergecandlist[nb_merge_cand].ref_idx[1] = zero_idx < nb_refs ? zero_idx : 0;
463 if (merge_idx == nb_merge_cand) return;
470 * 8.5.3.1.1 Derivation process of luma Mvs for merge mode
472 void ff_hevc_luma_mv_merge_mode(HEVCContext *s, int x0, int y0, int nPbW,
473 int nPbH, int log2_cb_size, int part_idx,
474 int merge_idx, MvField *mv)
476 int singleMCLFlag = 0;
477 int nCS = 1 << log2_cb_size;
478 LOCAL_ALIGNED(4, MvField, mergecand_list, [MRG_MAX_NUM_CANDS]);
481 HEVCLocalContext *lc = s->HEVClc;
483 if (s->pps->log2_parallel_merge_level > 2 && nCS == 8) {
492 ff_hevc_set_neighbour_available(s, x0, y0, nPbW, nPbH);
493 derive_spatial_merge_candidates(s, x0, y0, nPbW, nPbH, log2_cb_size,
494 singleMCLFlag, part_idx,
495 merge_idx, mergecand_list);
497 if (mergecand_list[merge_idx].pred_flag == PF_BI &&
498 (nPbW2 + nPbH2) == 12) {
499 mergecand_list[merge_idx].pred_flag = PF_L0;
502 *mv = mergecand_list[merge_idx];
505 static av_always_inline void dist_scale(HEVCContext *s, Mv *mv,
506 int min_pu_width, int x, int y,
507 int elist, int ref_idx_curr, int ref_idx)
509 RefPicList *refPicList = s->ref->refPicList;
510 MvField *tab_mvf = s->ref->tab_mvf;
511 int ref_pic_elist = refPicList[elist].list[TAB_MVF(x, y).ref_idx[elist]];
512 int ref_pic_curr = refPicList[ref_idx_curr].list[ref_idx];
514 if (ref_pic_elist != ref_pic_curr) {
515 int poc_diff = s->poc - ref_pic_elist;
518 mv_scale(mv, mv, poc_diff, s->poc - ref_pic_curr);
522 static int mv_mp_mode_mx(HEVCContext *s, int x, int y, int pred_flag_index,
523 Mv *mv, int ref_idx_curr, int ref_idx)
525 MvField *tab_mvf = s->ref->tab_mvf;
526 int min_pu_width = s->sps->min_pu_width;
528 RefPicList *refPicList = s->ref->refPicList;
530 if (((TAB_MVF(x, y).pred_flag) & (1 << pred_flag_index)) &&
531 refPicList[pred_flag_index].list[TAB_MVF(x, y).ref_idx[pred_flag_index]] == refPicList[ref_idx_curr].list[ref_idx]) {
532 *mv = TAB_MVF(x, y).mv[pred_flag_index];
538 static int mv_mp_mode_mx_lt(HEVCContext *s, int x, int y, int pred_flag_index,
539 Mv *mv, int ref_idx_curr, int ref_idx)
541 MvField *tab_mvf = s->ref->tab_mvf;
542 int min_pu_width = s->sps->min_pu_width;
544 RefPicList *refPicList = s->ref->refPicList;
546 if ((TAB_MVF(x, y).pred_flag) & (1 << pred_flag_index)) {
547 int currIsLongTerm = refPicList[ref_idx_curr].isLongTerm[ref_idx];
550 refPicList[pred_flag_index].isLongTerm[(TAB_MVF(x, y).ref_idx[pred_flag_index])];
552 if (colIsLongTerm == currIsLongTerm) {
553 *mv = TAB_MVF(x, y).mv[pred_flag_index];
555 dist_scale(s, mv, min_pu_width, x, y,
556 pred_flag_index, ref_idx_curr, ref_idx);
563 #define MP_MX(v, pred, mx) \
565 (x ## v) >> s->sps->log2_min_pu_size, \
566 (y ## v) >> s->sps->log2_min_pu_size, \
567 pred, &mx, ref_idx_curr, ref_idx)
569 #define MP_MX_LT(v, pred, mx) \
570 mv_mp_mode_mx_lt(s, \
571 (x ## v) >> s->sps->log2_min_pu_size, \
572 (y ## v) >> s->sps->log2_min_pu_size, \
573 pred, &mx, ref_idx_curr, ref_idx)
575 void ff_hevc_luma_mv_mvp_mode(HEVCContext *s, int x0, int y0, int nPbW,
576 int nPbH, int log2_cb_size, int part_idx,
577 int merge_idx, MvField *mv,
578 int mvp_lx_flag, int LX)
580 HEVCLocalContext *lc = s->HEVClc;
581 MvField *tab_mvf = s->ref->tab_mvf;
582 int isScaledFlag_L0 = 0;
583 int availableFlagLXA0 = 1;
584 int availableFlagLXB0 = 1;
585 int numMVPCandLX = 0;
586 int min_pu_width = s->sps->min_pu_width;
599 Mv mvpcand_list[2] = { { 0 } };
602 int ref_idx_curr = 0;
604 int pred_flag_index_l0;
605 int pred_flag_index_l1;
607 const int cand_bottom_left = lc->na.cand_bottom_left;
608 const int cand_left = lc->na.cand_left;
609 const int cand_up_left = lc->na.cand_up_left;
610 const int cand_up = lc->na.cand_up;
611 const int cand_up_right = lc->na.cand_up_right_sap;
613 ref_idx = mv->ref_idx[LX];
614 pred_flag_index_l0 = LX;
615 pred_flag_index_l1 = !LX;
617 // left bottom spatial candidate
621 is_available_a0 = AVAILABLE(cand_bottom_left, A0) &&
622 yA0 < s->sps->height &&
623 PRED_BLOCK_AVAILABLE(A0);
625 //left spatial merge candidate
629 is_available_a1 = AVAILABLE(cand_left, A1);
630 if (is_available_a0 || is_available_a1)
633 if (is_available_a0) {
634 if (MP_MX(A0, pred_flag_index_l0, mxA)) {
637 if (MP_MX(A0, pred_flag_index_l1, mxA)) {
642 if (is_available_a1) {
643 if (MP_MX(A1, pred_flag_index_l0, mxA)) {
646 if (MP_MX(A1, pred_flag_index_l1, mxA)) {
651 if (is_available_a0) {
652 if (MP_MX_LT(A0, pred_flag_index_l0, mxA)) {
655 if (MP_MX_LT(A0, pred_flag_index_l1, mxA)) {
660 if (is_available_a1) {
661 if (MP_MX_LT(A1, pred_flag_index_l0, mxA)) {
664 if (MP_MX_LT(A1, pred_flag_index_l1, mxA)) {
668 availableFlagLXA0 = 0;
672 // above right spatial merge candidate
676 is_available_b0 = AVAILABLE(cand_up_right, B0) &&
677 xB0 < s->sps->width &&
678 PRED_BLOCK_AVAILABLE(B0);
680 if (is_available_b0) {
681 if (MP_MX(B0, pred_flag_index_l0, mxB)) {
684 if (MP_MX(B0, pred_flag_index_l1, mxB)) {
689 // above spatial merge candidate
693 is_available_b1 = AVAILABLE(cand_up, B1);
695 if (is_available_b1) {
696 if (MP_MX(B1, pred_flag_index_l0, mxB)) {
699 if (MP_MX(B1, pred_flag_index_l1, mxB)) {
704 // above left spatial merge candidate
707 is_available_b2 = AVAILABLE(cand_up_left, B2);
709 if (is_available_b2) {
710 if (MP_MX(B2, pred_flag_index_l0, mxB)) {
713 if (MP_MX(B2, pred_flag_index_l1, mxB)) {
717 availableFlagLXB0 = 0;
720 if (!isScaledFlag_L0) {
721 if (availableFlagLXB0) {
722 availableFlagLXA0 = 1;
725 availableFlagLXB0 = 0;
728 if (is_available_b0) {
729 availableFlagLXB0 = MP_MX_LT(B0, pred_flag_index_l0, mxB);
730 if (!availableFlagLXB0)
731 availableFlagLXB0 = MP_MX_LT(B0, pred_flag_index_l1, mxB);
734 if (is_available_b1 && !availableFlagLXB0) {
735 availableFlagLXB0 = MP_MX_LT(B1, pred_flag_index_l0, mxB);
736 if (!availableFlagLXB0)
737 availableFlagLXB0 = MP_MX_LT(B1, pred_flag_index_l1, mxB);
740 if (is_available_b2 && !availableFlagLXB0) {
741 availableFlagLXB0 = MP_MX_LT(B2, pred_flag_index_l0, mxB);
742 if (!availableFlagLXB0)
743 availableFlagLXB0 = MP_MX_LT(B2, pred_flag_index_l1, mxB);
747 if (availableFlagLXA0)
748 mvpcand_list[numMVPCandLX++] = mxA;
750 if (availableFlagLXB0 && (!availableFlagLXA0 || mxA.x != mxB.x || mxA.y != mxB.y))
751 mvpcand_list[numMVPCandLX++] = mxB;
753 //temporal motion vector prediction candidate
754 if (numMVPCandLX < 2 && s->sh.slice_temporal_mvp_enabled_flag &&
755 mvp_lx_flag == numMVPCandLX) {
757 int available_col = temporal_luma_motion_vector(s, x0, y0, nPbW,
761 mvpcand_list[numMVPCandLX++] = mv_col;
764 mv->mv[LX] = mvpcand_list[mvp_lx_flag];