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);
647 uint64_t sum = (1LL + k) * (res_end - res);
649 sum += *(res++) >> k;
650 sums[k][i] = sum;
652 uint64_t sum = 0;
654 sum += *(res++);
655 sums[k][i] = sum;
1081 uint64_t sum[4];
1085 /* calculate sum of 2nd order residual for each channel */
1086 sum[0] = sum[1] = sum[2] = sum[3] = 0;
1090 sum[2] += FFABS((lt + rt) >> 1);
1091 sum[3] += FFABS(lt - rt);
1092 sum[0] += FFABS(lt);
1093 sum[1] += FFABS(rt);
1097 k = find_optimal_param(2 * sum[i], n, max_rice_param);
1098 sum[i] = rice_encode_count( 2 * sum[i], n, k);
1102 score[0] = sum[0] + sum[1];
1103 score[1] = sum[0] + sum[3];
1104 score[2] = sum[1] + sum[3];
1105 score[3] = sum[2] + sum[3];