Lines Matching refs:sad_list
305 int *sad_list,
313 if (sad_list &&
314 sad_list[0] != INT_MAX && sad_list[1] != INT_MAX &&
315 sad_list[2] != INT_MAX && sad_list[3] != INT_MAX &&
316 sad_list[4] != INT_MAX) {
318 whichdir = (sad_list[1] < sad_list[3] ? 0 : 1) +
319 (sad_list[2] < sad_list[4] ? 0 : 2);
397 int *sad_list,
404 (void) sad_list; // to silence compiler warning
497 int *sad_list,
649 // sad_list[0]: sad at the best integer pel
650 // sad_list[1]: sad at delta {0, -1} (left) from the best integer pel
651 // sad_list[2]: sad at delta { 1, 0} (bottom) from the best integer pel
652 // sad_list[3]: sad at delta { 0, 1} (right) from the best integer pel
653 // sad_list[4]: sad at delta {-1, 0} (top) from the best integer pel
654 if (sad_list) {
656 sad_list[0] = bestsad;
661 sad_list[i + 1] = vfp->sdf(what->buf, what->stride,
673 sad_list[i + 1] = INT_MAX;
675 sad_list[i + 1] = vfp->sdf(what->buf, what->stride,
690 // are 4 1-away neighbors, and sad_list is non-null
698 int *sad_list,
723 if (sad_list != NULL) {
724 sad_list[0] = sad_list[1] = sad_list[2] = sad_list[3] = sad_list[4] =
778 int do_sad = (num_candidates[0] == 4 && sad_list != NULL);
852 // Note: If we enter the if below, then sad_list must be non-NULL.
854 sad_list[0] = bestsad;
860 sad_list[i + 1] =
872 sad_list[i + 1] =
892 sad_list[1] = sad_list[2] = sad_list[3] = sad_list[4] = INT_MAX;
893 sad_list[((k + 2) % 4) + 1] = sad_list[0];
894 sad_list[0] = bestsad;
900 sad_list[next_chkpts_indices[i] + 1] =
911 sad_list[next_chkpts_indices[i] + 1] = INT_MAX;
914 sad_list[next_chkpts_indices[i] + 1] =
932 // sad_list[0]: sad at the best integer pel
933 // sad_list[1]: sad at delta {0, -1} (left) from the best integer pel
934 // sad_list[2]: sad at delta { 1, 0} (bottom) from the best integer pel
935 // sad_list[3]: sad at delta { 0, 1} (right) from the best integer pel
936 // sad_list[4]: sad at delta {-1, 0} (top) from the best integer pel
937 if (sad_list) {
939 if (sad_list[0] == INT_MAX) {
940 sad_list[0] = bestsad;
945 sad_list[i + 1] = vfp->sdf(what->buf, what->stride,
954 sad_list[i + 1] = INT_MAX;
956 sad_list[i + 1] = vfp->sdf(what->buf, what->stride,
966 if (sad_list[i + 1] != INT_MAX) {
967 sad_list[i + 1] +=
1017 int *sad_list,
1042 do_init_search, sad_list, vfp, use_mvcost,
1052 int *sad_list,
1084 do_init_search, sad_list, vfp, use_mvcost,
1094 int *sad_list,
1126 do_init_search, sad_list, vfp, use_mvcost,
1136 int *sad_list,
1142 sad_per_bit, do_init_search, sad_list, vfp, use_mvcost,
1151 int *sad_list,
1157 sad_per_bit, do_init_search, sad_list, vfp,
1756 int *sad_list,
1763 if (sad_list) {
1764 sad_list[0] = INT_MAX;
1765 sad_list[1] = INT_MAX;
1766 sad_list[2] = INT_MAX;
1767 sad_list[3] = INT_MAX;
1768 sad_list[4] = INT_MAX;
1774 sad_list, fn_ptr, 1, ref_mv, tmp_mv);
1778 sad_list, fn_ptr, 1, ref_mv, tmp_mv);
1782 sad_list, fn_ptr, 1, ref_mv, tmp_mv);
1786 sad_list, fn_ptr, 1, ref_mv, tmp_mv);
1790 sad_list, fn_ptr, 1, ref_mv, tmp_mv);