Lines Matching defs:br
192 #define CHECK_BETTER(v,r,c) IFMVCV(r,c,{if((v = ERR(r,c)) < besterr) { besterr = v; br=r; bc=c; }}, v=INT_MAX;)// checks if (r,c) has better score than previous best
196 //#define CHECK_BETTER(v,r,c) if((v = ERR(r,c)) < besterr) { besterr = v; br=r; bc=c; }
204 int br = bestmv->row << 2, bc = bestmv->col << 2;
205 int tr = br, tc = bc;
254 if (tr == br && tc == bc)
257 tr = br;
289 if (tr == br && tc == bc)
292 tr = br;
296 bestmv->row = br << 1;
760 #define CHECK_BETTER(v,r,c) if ((v = ERR(r,c,besterr)) < besterr) { besterr = v; br=r; bc=c; } // checks if (r,c) has better score than previous best
792 int br = ref_mv->row >> 3, bc = ref_mv->col >> 3, tr, tc;
800 if (br < x->mv_row_min) br = x->mv_row_min;
802 if (br > x->mv_row_max) br = x->mv_row_max;
807 besterr = ERR(br, bc, thiserr);
811 tr = br;
830 br = nr;
836 if (tr == br && tc == bc)
841 tr = br;
861 br = nr;
870 if (tr == br && tc == bc)
876 tr = br;
894 best_mv->row = br;
897 return vfp->vf(src, src_stride, PRE(br, bc), d->pre_stride, &thiserr) + mv_err_cost(best_mv, center_mv, mvcost, error_per_bit) ;
