Lines Matching refs:col
29 int col;
139 int row, col;
159 for (col = 0; col < end_col; ++col)
165 (((first_blk_col + col) *
167 assign_overlap(b_ol_ul[row * 4 + col].overlaps, bmi, overlap);
178 int row, col, rel_row, rel_col;
186 col = (4 * b_col) << 3; /* Q3 */
190 new_col = col - bmi->mv.as_mv.col;
220 /* Check if the new block col starts at the last block col of the MB */
261 col_acc += overlaps[i].overlap * overlaps[i].bmi->mv.as_mv.col;
268 bmi->mv.as_mv.col = col_acc / overlap_sum;
273 bmi->mv.as_mv.col = 0;
288 int row, col;
292 filtered_mv->col = 0;
299 for (col = 0; col < 4; ++col)
301 int i = row * 4 + col;
302 int this_b_to_left_edge = mb_to_left_edge + ((col*4)<<3);
303 int this_b_to_right_edge = mb_to_right_edge - ((col*4)<<3);
316 filtered_mv->col += bmi[i].mv.as_mv.col;
323 filtered_mv->col /= non_zero_count;
501 int row, col, i;
518 for (col = 0; col < 4; ++col)
520 int mb_to_left_edge = mb->mb_to_left_edge + ((col*4)<<3);
521 int mb_to_right_edge = mb->mb_to_right_edge - ((col*4)<<3);
525 int_mv * const mv = &(mi->bmi[row*4 + col].mv);
533 [abs(col - neigh_pos[i].col)];
539 mv_col_sum += w*neighbors[i].mv.col;
548 mv->as_mv.col = mv_col_sum / w_sum;
572 neighbors[i].mv.row = neighbors[i].mv.col = 0;