208     v = INT_MAX;                                                          \
231     v = INT_MAX;                                                           \
307   unsigned int besterr = INT_MAX;                                       \
420   if (cost_list && cost_list[0] != INT_MAX && cost_list[1] != INT_MAX &&  in av1_find_best_sub_pixel_tree_pruned_evenmore()
421       cost_list[2] != INT_MAX && cost_list[3] != INT_MAX &&  in av1_find_best_sub_pixel_tree_pruned_evenmore()
422       cost_list[4] != INT_MAX && is_cost_list_wellbehaved(cost_list)) {  in av1_find_best_sub_pixel_tree_pruned_evenmore()
486   if (cost_list && cost_list[0] != INT_MAX && cost_list[1] != INT_MAX &&  in av1_find_best_sub_pixel_tree_pruned_more()
487       cost_list[2] != INT_MAX && cost_list[3] != INT_MAX &&  in av1_find_best_sub_pixel_tree_pruned_more()
488       cost_list[4] != INT_MAX && is_cost_list_wellbehaved(cost_list)) {  in av1_find_best_sub_pixel_tree_pruned_more()
555   if (cost_list && cost_list[0] != INT_MAX && cost_list[1] != INT_MAX &&  in av1_find_best_sub_pixel_tree_pruned()
556       cost_list[2] != INT_MAX && cost_list[3] != INT_MAX &&  in av1_find_best_sub_pixel_tree_pruned()
557       cost_list[4] != INT_MAX) {  in av1_find_best_sub_pixel_tree_pruned()
735   unsigned int besterr = INT_MAX;  in av1_find_best_sub_pixel_tree()
784       return INT_MAX;  in av1_find_best_sub_pixel_tree()
817         cost_array[idx] = INT_MAX;  in av1_find_best_sub_pixel_tree()
852       cost_array[idx] = INT_MAX;  in av1_find_best_sub_pixel_tree()
1054         cost_list[i + 1] = INT_MAX;  in calc_int_cost_list()
1079   if (cost_list[0] == INT_MAX) {  in calc_int_sad_list()
1092           cost_list[i + 1] = INT_MAX;  in calc_int_sad_list()
1103         if (cost_list[i + 1] != INT_MAX) {  in calc_int_sad_list()
1131   int bestsad = INT_MAX;  in pattern_search()
1144         INT_MAX;  in pattern_search()
1310         cost_list[1] = cost_list[2] = cost_list[3] = cost_list[4] = INT_MAX;  in pattern_search()
1332               cost_list[next_chkpts_indices[i] + 1] = INT_MAX;  in pattern_search()
1572   unsigned int best_sad = INT_MAX;  in exhuastive_mesh_search()
1667   unsigned int bestsad = INT_MAX;  in av1_diamond_search_sad_c()
1808   if (bestsme < INT_MAX)  in full_pixel_diamond()
1825       if (thissme < INT_MAX)  in full_pixel_diamond()
1844     if (thissme < INT_MAX)  in full_pixel_diamond()
1884     return INT_MAX;  in full_pixel_exhaustive()
1911   if (bestsme < INT_MAX)  in full_pixel_exhaustive()
2018   unsigned int best_sad = INT_MAX;  in av1_refining_search_8p_c()
2089                    (sf->exhaustive_searches_thresh < INT_MAX) &&  in is_exhaustive_allowed()
2101   int best_sad = INT_MAX;  in vector_match()
2321     cost_list[0] = INT_MAX;  in av1_full_pixel_search()
2322     cost_list[1] = INT_MAX;  in av1_full_pixel_search()
2323     cost_list[2] = INT_MAX;  in av1_full_pixel_search()
2324     cost_list[3] = INT_MAX;  in av1_full_pixel_search()
2325     cost_list[4] = INT_MAX;  in av1_full_pixel_search()
2422         int best_hash_cost = INT_MAX;  in av1_full_pixel_search()
2503     v = INT_MAX;                                          \
2526     v = INT_MAX;                                                              \
2593   unsigned int besterr = INT_MAX;  in av1_find_best_obmc_sub_pixel_tree_up()
2666         cost_array[idx] = INT_MAX;  in av1_find_best_obmc_sub_pixel_tree_up()
2699       cost_array[idx] = INT_MAX;  in av1_find_best_obmc_sub_pixel_tree_up()
2818   int best_sad = INT_MAX;  in obmc_diamond_search_sad()
2902   if (bestsme < INT_MAX)  in obmc_full_pixel_diamond()
2920       if (thissme < INT_MAX)  in obmc_full_pixel_diamond()
2940     if (thissme < INT_MAX)  in obmc_full_pixel_diamond()
2970     if (thissme < INT_MAX)  in av1_obmc_full_pixel_search()
3118       sadpb, cond_cost_list(cpi, cost_list), &ref_mv, INT_MAX, 1,  in av1_simple_motion_search()
3124       var < INT_MAX && !cpi->common.cur_frame_force_integer_mv && use_subpixel;  in av1_simple_motion_search()