Lines Matching refs:INT_MAX

181     if (tmpmse >= INT_MAX) {                                                 \
182 v = INT_MAX; \
191 v = INT_MAX; \
214 v = INT_MAX; \
422 if (cost_list && cost_list[0] != INT_MAX && cost_list[1] != INT_MAX && in vp9_find_best_sub_pixel_tree_pruned_evenmore()
423 cost_list[2] != INT_MAX && cost_list[3] != INT_MAX && in vp9_find_best_sub_pixel_tree_pruned_evenmore()
424 cost_list[4] != INT_MAX && is_cost_list_wellbehaved(cost_list)) { in vp9_find_best_sub_pixel_tree_pruned_evenmore()
426 unsigned int minpt = INT_MAX; in vp9_find_best_sub_pixel_tree_pruned_evenmore()
481 if (cost_list && cost_list[0] != INT_MAX && cost_list[1] != INT_MAX && in vp9_find_best_sub_pixel_tree_pruned_more()
482 cost_list[2] != INT_MAX && cost_list[3] != INT_MAX && in vp9_find_best_sub_pixel_tree_pruned_more()
483 cost_list[4] != INT_MAX && is_cost_list_wellbehaved(cost_list)) { in vp9_find_best_sub_pixel_tree_pruned_more()
543 if (cost_list && cost_list[0] != INT_MAX && cost_list[1] != INT_MAX && in vp9_find_best_sub_pixel_tree_pruned()
544 cost_list[2] != INT_MAX && cost_list[3] != INT_MAX && in vp9_find_best_sub_pixel_tree_pruned()
545 cost_list[4] != INT_MAX) { in vp9_find_best_sub_pixel_tree_pruned()
696 if (tmpmse >= INT_MAX) { \
697 v = INT_MAX; \
706 v = INT_MAX; \
726 v = INT_MAX; \
1003 cost_list[i + 1] = INT_MAX; in calc_int_cost_list()
1033 int bestsad = INT_MAX; in vp9_pattern_search()
1203 int bestsad = INT_MAX; in vp9_pattern_search_sad()
1215 INT_MAX; in vp9_pattern_search_sad()
1380 cost_list[1] = cost_list[2] = cost_list[3] = cost_list[4] = INT_MAX; in vp9_pattern_search_sad()
1402 cost_list[next_chkpts_indices[i] + 1] = INT_MAX; in vp9_pattern_search_sad()
1429 if (cost_list[0] == INT_MAX) { in vp9_pattern_search_sad()
1442 cost_list[i + 1] = INT_MAX; in vp9_pattern_search_sad()
1453 if (cost_list[i + 1] != INT_MAX) { in vp9_pattern_search_sad()
1481 if (err >= INT_MAX) return INT_MAX; in vp9_get_mvpred_var()
1657 unsigned int best_sad = INT_MAX; in exhuastive_mesh_search()
1926 unsigned int bestsad = INT_MAX; in vp9_diamond_search_sad_c()
2056 int best_sad = INT_MAX; in vector_match()
2347 if (bestsme < INT_MAX) in full_pixel_diamond()
2364 if (thissme < INT_MAX) in full_pixel_diamond()
2383 if (thissme < INT_MAX) in full_pixel_diamond()
2419 return INT_MAX; in full_pixel_exhaustive()
2446 if (bestsme < INT_MAX) in full_pixel_exhaustive()
2626 unsigned int best_sad = INT_MAX; in vp9_refining_search_8p_c()
2677 cost_list[0] = INT_MAX; in vp9_full_pixel_search()
2678 cost_list[1] = INT_MAX; in vp9_full_pixel_search()
2679 cost_list[2] = INT_MAX; in vp9_full_pixel_search()
2680 cost_list[3] = INT_MAX; in vp9_full_pixel_search()
2681 cost_list[4] = INT_MAX; in vp9_full_pixel_search()
2715 if (sf->exhaustive_searches_thresh < INT_MAX && in vp9_full_pixel_search()