Home
last modified time | relevance | path

Searched refs:bit_cost_ (Results 1 – 5 of 5) sorted by relevance

/external/brotli/c/enc/
Dcluster_inc.h33 p.cost_diff -= out[idx1].bit_cost_;
34 p.cost_diff -= out[idx2].bit_cost_;
37 p.cost_combo = out[idx2].bit_cost_;
40 p.cost_combo = out[idx1].bit_cost_;
109 out[best_idx1].bit_cost_ = pairs[0].cost_combo;
164 return FN(BrotliPopulationCost)(&tmp) - candidate->bit_cost_;
270 out[i].bit_cost_ = FN(BrotliPopulationCost)(&in[i]);
Dhistogram_inc.h15 double bit_cost_;
21 self->bit_cost_ = HUGE_VAL; in FN()
Dblock_splitter_inc.h249 histograms[j].bit_cost_ = FN(BrotliPopulationCost)(&histograms[j]); in FN()
/external/webp/src/enc/
Dhistogram_enc.c367 const double sum_cost = a->bit_cost_ + b->bit_cost_; in HistogramAddEval()
372 out->bit_cost_ = cost; in HistogramAddEval()
385 double cost = -a->bit_cost_; in HistogramAddThresh()
437 h->bit_cost_ = h->literal_cost_ + h->red_cost_ + h->blue_cost_ + in UpdateHistogramCost()
569 const double bit_cost = histograms[idx]->bit_cost_; in HistogramCombineEntropyBin()
703 sum_cost = h1->bit_cost_ + h2->bit_cost_; in HistoQueuePush()
751 histograms[idx1]->bit_cost_ = histo_queue.queue[0].cost_combo; in HistogramCombineGreedy()
Dhistogram_enc.h43 double bit_cost_; // cached value of bit cost. member