Searched refs:best_idx (Results 1 – 6 of 6) sorted by relevance
848 unsigned best_idx; in sparse_backing_alloc() local852 best_idx = 0; in sparse_backing_alloc()862 best_idx = idx; in sparse_backing_alloc()913 best_idx = 0; in sparse_backing_alloc()918 *pstart_page = best_backing->chunks[best_idx].begin; in sparse_backing_alloc()919 best_backing->chunks[best_idx].begin += *pnum_pages; in sparse_backing_alloc()921 if (best_backing->chunks[best_idx].begin >= best_backing->chunks[best_idx].end) { in sparse_backing_alloc()922 memmove(&best_backing->chunks[best_idx], &best_backing->chunks[best_idx + 1], in sparse_backing_alloc()923 sizeof(*best_backing->chunks) * (best_backing->num_chunks - best_idx - 1)); in sparse_backing_alloc()
470 best_idx = None494 best_idx = i497 if best_idx is None:501 other_encoding = todo[best_idx]507 del todo[best_idx]
1015 int best_idx = -1; in PickBestCandidate() local1021 best_idx = i; in PickBestCandidate()1026 assert(best_idx != -1); in PickBestCandidate()1029 if (i == best_idx) { in PickBestCandidate()1040 (best_idx == LL_DISP_NONE || best_idx == LOSSY_DISP_NONE) in PickBestCandidate()
754 int idx, best_idx = -1; in vp9_find_best_sub_pixel_tree() local817 best_idx = idx; in vp9_find_best_sub_pixel_tree()853 best_idx = 4; in vp9_find_best_sub_pixel_tree()862 if (best_idx < 4 && best_idx >= 0) { in vp9_find_best_sub_pixel_tree()863 br += search_step[best_idx].row; in vp9_find_best_sub_pixel_tree()864 bc += search_step[best_idx].col; in vp9_find_best_sub_pixel_tree()865 } else if (best_idx == 4) { in vp9_find_best_sub_pixel_tree()870 if (iters_per_step > 0 && best_idx != -1) { in vp9_find_best_sub_pixel_tree()915 best_idx = -1; in vp9_find_best_sub_pixel_tree()
2941 int best_idx = -1; in av1_refine_warped_mv() local2961 best_idx = idx; in av1_refine_warped_mv()2970 if (best_idx == -1) break; in av1_refine_warped_mv()2972 if (best_idx >= 0) { in av1_refine_warped_mv()2973 best_mv->row += neighbors[best_idx].row; in av1_refine_warped_mv()2974 best_mv->col += neighbors[best_idx].col; in av1_refine_warped_mv()
2014 int best_idx = 0; in ref_mv_idx_to_search() local2016 if (idx_rdcost[i] < idx_rdcost[best_idx]) { in ref_mv_idx_to_search()2017 best_idx = i; in ref_mv_idx_to_search()2028 (1.0 * idx_rdcost[i]) / idx_rdcost[best_idx] < dth && in ref_mv_idx_to_search()