Lines Matching defs:sum
568 #define rice_encode_count(sum, n, k) (((n)*((k)+1))+((sum-(n>>1))>>(k)))
571 * Solve for d/dk(rice_encode_count) = n-((sum-(n>>1))>>(k+1)) = 0.
573 static int find_optimal_param(uint64_t sum, int n, int max_param)
578 if (sum <= n >> 1)
580 sum2 = sum - (n >> 1);
624 uint64_t sum = 0;
626 sum += *(res++);
627 sums[pmax][i] = sum;
985 uint64_t sum[4];
989 /* calculate sum of 2nd order residual for each channel */
990 sum[0] = sum[1] = sum[2] = sum[3] = 0;
994 sum[2] += FFABS((lt + rt) >> 1);
995 sum[3] += FFABS(lt - rt);
996 sum[0] += FFABS(lt);
997 sum[1] += FFABS(rt);
1001 k = find_optimal_param(2 * sum[i], n, max_rice_param);
1002 sum[i] = rice_encode_count( 2 * sum[i], n, k);
1006 score[0] = sum[0] + sum[1];
1007 score[1] = sum[0] + sum[3];
1008 score[2] = sum[1] + sum[3];
1009 score[3] = sum[2] + sum[3];