Lines Matching defs:sum
560 #define rice_encode_count(sum, n, k) (((n)*((k)+1))+((sum-(n>>1))>>(k)))
563 * Solve for d/dk(rice_encode_count) = n-((sum-(n>>1))>>(k+1)) = 0.
565 static int find_optimal_param(uint32_t sum, int n)
570 if (sum <= n >> 1)
572 sum2 = sum - (n >> 1);
614 uint32_t sum = 0;
616 sum += *(res++);
617 sums[pmax][i] = sum;
1039 uint64_t sum[4];
1043 /* calculate sum of 2nd order residual for each channel */
1044 sum[0] = sum[1] = sum[2] = sum[3] = 0;
1048 sum[2] += FFABS((lt + rt) >> 1);
1049 sum[3] += FFABS(lt - rt);
1050 sum[0] += FFABS(lt);
1051 sum[1] += FFABS(rt);
1055 k = find_optimal_param(2 * sum[i], n);
1056 sum[i] = rice_encode_count( 2 * sum[i], n, k);
1060 score[0] = sum[0] + sum[1];
1061 score[1] = sum[0] + sum[3];
1062 score[2] = sum[1] + sum[3];
1063 score[3] = sum[2] + sum[3];