Lines Matching defs:best
322 int best[8];
325 memset(best, 64, sizeof(int)*8);
350 if(score < best[i]){
351 memmove(&best[i+1], &best[i], sizeof(int)*(7-i));
353 best[i]= score;
397 if(score < best[i]){
398 memmove(&best[i+1], &best[i], sizeof(int)*(7-i));
400 best[i]= score;
513 COPY3_IF_LT(dmin, d, best[0], x, best[1], y)\
538 best[0]=x;\
539 best[1]=y;\
557 static av_always_inline int small_diamond_search(MpegEncContext * s, int *best, int dmin,
571 { /* ensure that the best point is in the MAP as h/qpel refinement needs it */
572 const int key= (best[1]<<ME_MAP_MV_BITS) + best[0] + map_generation;
573 const int index= ((best[1]<<ME_MAP_SHIFT) + best[0])&(ME_MAP_SIZE-1);
575 score_map[index]= cmp(s, best[0], best[1], 0, 0, size, h, ref_index, src_index, cmpf, chroma_cmpf, flags);
583 const int x= best[0];
584 const int y= best[1];
599 static int funny_diamond_search(MpegEncContext * s, int *best, int dmin,
615 const int x= best[0];
616 const int y= best[1];
635 if(x!=best[0] || y!=best[1])
641 dx= FFABS(x-best[0]);
642 dy= FFABS(y-best[1]);
660 static int hex_search(MpegEncContext * s, int *best, int dmin,
677 x= best[0];
678 y= best[1];
688 }while(best[0] != x || best[1] != y);
694 static int l2s_dia_search(MpegEncContext * s, int *best, int dmin,
714 x= best[0];
715 y= best[1];
719 }while(best[0] != x || best[1] != y);
722 x= best[0];
723 y= best[1];
732 static int umh_search(MpegEncContext * s, int *best, int dmin,
751 x= best[0];
752 y= best[1];
760 x= best[0];
761 y= best[1];
776 return hex_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags, 2);
779 static int full_search(MpegEncContext * s, int *best, int dmin,
800 x= best[0];
801 y= best[1];
808 best[0]= x;
809 best[1]= y;
844 static int sab_diamond_search(MpegEncContext * s, int *best, int dmin,
915 best[0]= minima[0].x;
916 best[1]= minima[0].y;
919 if( best[0] < xmax && best[0] > xmin
920 && best[1] < ymax && best[1] > ymin){
923 CHECK_MV(best[0]-1, best[1])
924 CHECK_MV(best[0]+1, best[1])
925 CHECK_MV(best[0], best[1]-1)
926 CHECK_MV(best[0], best[1]+1)
931 static int var_diamond_search(MpegEncContext * s, int *best, int dmin,
947 const int x= best[0];
948 const int y= best[1];
986 if(x!=best[0] || y!=best[1])
992 dx= FFABS(x-best[0]);
993 dy= FFABS(y-best[1]);
1008 static av_always_inline int diamond_search(MpegEncContext * s, int *best, int dmin,
1013 return funny_diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
1015 return sab_diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
1017 return small_diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
1019 return full_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
1021 return umh_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
1023 return hex_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags, c->dia_size&0xFF);
1025 return l2s_dia_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
1027 return var_diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
1041 int best[2]={0, 0}; /*!< x and y coordinates of the best motion vector.
1046 int dmin; /*!< the best value of d, i.e. the score
1047 corresponding to the mv stored in best[]. */
1141 //check(best[0],best[1],0, b0)
1142 dmin= diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
1144 //check(best[0],best[1],0, b1)
1145 *mx_ptr= best[0];
1146 *my_ptr= best[1];
1148 // printf("%d %d %d \n", best[0], best[1], dmin);
1174 int best[2]={0, 0};
1218 dmin= diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
1220 *mx_ptr= best[0];
1221 *my_ptr= best[1];
1223 // printf("%d %d %d \n", best[0], best[1], dmin);
1234 int best[2]={0, 0};
1278 dmin= diamond_search(s, best, dmin, src_index, ref_index, penalty_factor, size, h, flags);
1280 *mx_ptr= best[0];
1281 *my_ptr= best[1];
1283 // printf("%d %d %d \n", best[0], best[1], dmin);