Lines Matching full:bmi
72 union b_mode_info *bmi,
79 * Empty is defined as bmi == NULL */
82 if (overlaps[i].bmi == NULL)
84 overlaps[i].bmi = bmi;
114 static void calculate_overlaps_mb(B_OVERLAP *b_overlaps, union b_mode_info *bmi,
120 * overlapped by bmi and calculate and assign overlap for each of those
167 assign_overlap(b_ol_ul[row * 4 + col].overlaps, bmi, overlap);
174 union b_mode_info *bmi,
189 new_row = row - bmi->mv.as_mv.row;
190 new_col = col - bmi->mv.as_mv.col;
235 calculate_overlaps_mb(mb_overlap->overlaps, bmi,
249 static void estimate_mv(const OVERLAP_NODE *overlaps, union b_mode_info *bmi)
256 bmi->mv.as_int = 0;
259 if (overlaps[i].bmi == NULL)
261 col_acc += overlaps[i].overlap * overlaps[i].bmi->mv.as_mv.col;
262 row_acc += overlaps[i].overlap * overlaps[i].bmi->mv.as_mv.row;
268 bmi->mv.as_mv.col = col_acc / overlap_sum;
269 bmi->mv.as_mv.row = row_acc / overlap_sum;
273 bmi->mv.as_mv.col = 0;
274 bmi->mv.as_mv.row = 0;
291 union b_mode_info * const bmi = mi->bmi;
306 estimate_mv(block_overlaps[i].overlaps, &(bmi[i]));
308 &bmi[i].mv,
313 if (bmi[i].mv.as_int != 0)
316 filtered_mv->col += bmi[i].mv.as_mv.col;
317 filtered_mv->row += bmi[i].mv.as_mv.row;
340 &(prev_mi->bmi[sub_row * 4 + sub_col]),
422 neighbor->mv = mi->bmi[block_idx].mv.as_mv;
525 int_mv * const mv = &(mi->bmi[row*4 + col].mv);
