Lines Matching defs:minima
662 if(d < minima[minima_count-1].height){\
665 while(d >= minima[j].height) j++;\
667 memmove(&minima [j+1], &minima [j], (minima_count - j - 1)*sizeof(Minima));\
669 minima[j].checked= 0;\
670 minima[j].height= d;\
671 minima[j].x= ax;\
672 minima[j].y= ay;\
687 Minima minima[MAX_SAB_SIZE];
710 minima[j].height= score_map[i];
711 minima[j].x= key & ((1<<ME_MAP_MV_BITS)-1); key>>=ME_MAP_MV_BITS;
712 minima[j].y= key & ((1<<ME_MAP_MV_BITS)-1);
713 minima[j].x-= (1<<(ME_MAP_MV_BITS-1));
714 minima[j].y-= (1<<(ME_MAP_MV_BITS-1));
717 if( minima[j].x > xmax || minima[j].x < xmin
718 || minima[j].y > ymax || minima[j].y < ymin)
721 minima[j].checked=0;
722 if(minima[j].x || minima[j].y)
723 minima[j].height+= (mv_penalty[((minima[j].x)<<shift)-pred_x] + mv_penalty[((minima[j].y)<<shift)-pred_y])*penalty_factor;
728 AV_QSORT(minima, j, Minima, minima_cmp);
731 minima[j].height=256*256*256*64;
732 minima[j].checked=0;
733 minima[j].x= minima[j].y=0;
737 const int x= minima[i].x;
738 const int y= minima[i].y;
741 if(minima[i].checked) continue;
752 minima[i].checked= 1;
755 best[0]= minima[0].x;
756 best[1]= minima[0].y;
757 dmin= minima[0].height;