Home
last modified time | relevance | path

Searched refs:cost_diff (Results 1 – 10 of 10) sorted by relevance

/external/cronet/stable/third_party/brotli/enc/
Dcluster.c24 if (p1->cost_diff != p2->cost_diff) { in HistogramPairIsLess()
25 return TO_BROTLI_BOOL(p1->cost_diff > p2->cost_diff); in HistogramPairIsLess()
Dcluster_inc.h21 p.cost_diff = p.cost_combo = 0;
32 p.cost_diff = 0.5 * ClusterCostDiff(cluster_size[idx1], cluster_size[idx2]);
33 p.cost_diff -= out[idx1].bit_cost_;
34 p.cost_diff -= out[idx2].bit_cost_;
44 BROTLI_MAX(double, 0.0, pairs[0].cost_diff);
49 if (cost_combo < threshold - p.cost_diff) {
55 p.cost_diff += p.cost_combo;
101 if (pairs[0].cost_diff >= cost_diff_threshold) {
Dcluster.h25 double cost_diff; member
/external/cronet/tot/third_party/brotli/enc/
Dcluster.c24 if (p1->cost_diff != p2->cost_diff) { in HistogramPairIsLess()
25 return TO_BROTLI_BOOL(p1->cost_diff > p2->cost_diff); in HistogramPairIsLess()
Dcluster_inc.h21 p.cost_diff = p.cost_combo = 0;
32 p.cost_diff = 0.5 * ClusterCostDiff(cluster_size[idx1], cluster_size[idx2]);
33 p.cost_diff -= out[idx1].bit_cost_;
34 p.cost_diff -= out[idx2].bit_cost_;
44 BROTLI_MAX(double, 0.0, pairs[0].cost_diff);
49 if (cost_combo < threshold - p.cost_diff) {
55 p.cost_diff += p.cost_combo;
101 if (pairs[0].cost_diff >= cost_diff_threshold) {
Dcluster.h25 double cost_diff; member
/external/brotli/c/enc/
Dcluster.c24 if (p1->cost_diff != p2->cost_diff) { in HistogramPairIsLess()
25 return TO_BROTLI_BOOL(p1->cost_diff > p2->cost_diff); in HistogramPairIsLess()
Dcluster_inc.h21 p.cost_diff = p.cost_combo = 0;
32 p.cost_diff = 0.5 * ClusterCostDiff(cluster_size[idx1], cluster_size[idx2]);
33 p.cost_diff -= out[idx1].bit_cost_;
34 p.cost_diff -= out[idx2].bit_cost_;
44 BROTLI_MAX(double, 0.0, pairs[0].cost_diff);
49 if (cost_combo < threshold - p.cost_diff) {
55 p.cost_diff += p.cost_combo;
100 if (pairs[0].cost_diff >= cost_diff_threshold) {
Dcluster.h25 double cost_diff; member
/external/webp/src/enc/
Dhistogram_enc.c753 int64_t cost_diff; member
794 assert(pair->cost_diff < 0); in HistoQueueUpdateHead()
798 if (pair->cost_diff < histo_queue->queue[0].cost_diff) { in HistoQueueUpdateHead()
819 pair->cost_diff = (int64_t)pair->cost_combo - sum_cost; in HistoQueueUpdatePair()
852 return pair.cost_diff; in HistoQueuePush()
971 (histo_queue.size == 0) ? 0 : histo_queue.queue[0].cost_diff; in HistogramCombineStochastic()