1657   unsigned int best_sad = INT_MAX;  in exhuastive_mesh_search()  local
1667   best_sad =  in exhuastive_mesh_search()
1684         if (sad < best_sad) {  in exhuastive_mesh_search()
1686           if (sad < best_sad) {  in exhuastive_mesh_search()
1687             best_sad = sad;  in exhuastive_mesh_search()
1703             if (sads[i] < best_sad) {  in exhuastive_mesh_search()
1707               if (sad < best_sad) {  in exhuastive_mesh_search()
1708                 best_sad = sad;  in exhuastive_mesh_search()
1719             if (sad < best_sad) {  in exhuastive_mesh_search()
1721               if (sad < best_sad) {  in exhuastive_mesh_search()
1722                 best_sad = sad;  in exhuastive_mesh_search()
1732   return best_sad;  in exhuastive_mesh_search()
2056   int best_sad = INT_MAX;  in vector_match()  local
2063     if (this_sad < best_sad) {  in vector_match()
2064       best_sad = this_sad;  in vector_match()
2075     if (this_sad < best_sad) {  in vector_match()
2076       best_sad = this_sad;  in vector_match()
2087     if (this_sad < best_sad) {  in vector_match()
2088       best_sad = this_sad;  in vector_match()
2099     if (this_sad < best_sad) {  in vector_match()
2100       best_sad = this_sad;  in vector_match()
2111     if (this_sad < best_sad) {  in vector_match()
2112       best_sad = this_sad;  in vector_match()
2146   unsigned int best_sad, tmp_sad, this_sad[4];  in vp9_int_pro_motion_estimation()  local
2212   best_sad = cpi->fn_ptr[bsize].sdf(src_buf, src_stride, ref_buf, ref_stride);  in vp9_int_pro_motion_estimation()
2226     if (this_sad[idx] < best_sad) {  in vp9_int_pro_motion_estimation()
2227       best_sad = this_sad[idx];  in vp9_int_pro_motion_estimation()
2246   if (best_sad > tmp_sad) {  in vp9_int_pro_motion_estimation()
2248     best_sad = tmp_sad;  in vp9_int_pro_motion_estimation()
2263   return best_sad;  in vp9_int_pro_motion_estimation()
2468   double best_sad;  in vp9_refining_search_sad_new()  local
2475   best_sad = (*best_mv_dist) + lambda * (*best_mv_cost);  in vp9_refining_search_sad_new()
2499         if (thissad < best_sad) {  in vp9_refining_search_sad_new()
2500           best_sad = thissad;  in vp9_refining_search_sad_new()
2518           if (thissad < best_sad) {  in vp9_refining_search_sad_new()
2519             best_sad = thissad;  in vp9_refining_search_sad_new()
2537   return best_sad;  in vp9_refining_search_sad_new()
2551   unsigned int best_sad =  in vp9_refining_search_sad()  local
2572         if (sads[j] < best_sad) {  in vp9_refining_search_sad()
2576           if (sads[j] < best_sad) {  in vp9_refining_search_sad()
2577             best_sad = sads[j];  in vp9_refining_search_sad()
2591           if (sad < best_sad) {  in vp9_refining_search_sad()
2593             if (sad < best_sad) {  in vp9_refining_search_sad()
2594               best_sad = sad;  in vp9_refining_search_sad()
2611   return best_sad;  in vp9_refining_search_sad()
2626   unsigned int best_sad = INT_MAX;  in vp9_refining_search_8p_c()  local
2630   best_sad =  in vp9_refining_search_8p_c()
2646         if (sad < best_sad) {  in vp9_refining_search_8p_c()
2648           if (sad < best_sad) {  in vp9_refining_search_8p_c()
2649             best_sad = sad;  in vp9_refining_search_8p_c()
2663   return best_sad;  in vp9_refining_search_8p_c()