HomeSort by relevance Sort by last modified time
    Searched refs:bit_cost_ (Results 1 - 5 of 5) sorted by null

  /external/brotli/c/enc/
histogram_inc.h 15 double bit_cost_; local
21 self->bit_cost_ = HUGE_VAL;
cluster_inc.h 33 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_;
171 Note: we assume that out[]->bit_cost_ is already up-to-date. */
270 out[i].bit_cost_ = FN(BrotliPopulationCost)(&in[i]);
block_splitter_inc.h 249 histograms[j].bit_cost_ = FN(BrotliPopulationCost)(&histograms[j]);
  /external/webp/src/enc/
histogram_enc.h 43 double bit_cost_; // cached value of bit cost. member in struct:__anon43749
histogram_enc.c 367 const double sum_cost = a->bit_cost_ + b->bit_cost_;
372 out->bit_cost_ = cost;
385 double cost = -a->bit_cost_;
437 h->bit_cost_ = h->literal_cost_ + h->red_cost_ + h->blue_cost_ +
569 const double bit_cost = histograms[idx]->bit_cost_;
703 sum_cost = h1->bit_cost_ + h2->bit_cost_;
751 histograms[idx1]->bit_cost_ = histo_queue.queue[0].cost_combo;
    [all...]

Completed in 113 milliseconds