Searched refs:total_count_ (Results 1 - 7 of 7) sorted by relevance

/xsrc/external/mit/brotli/dist/c/enc/
H A Dhistogram_inc.h14 size_t total_count_;
20 self->total_count_ = 0;
32 ++self->total_count_;
37 self->total_count_ += n;
45 self->total_count_ += v->total_count_;
H A Dbit_cost_inc.h22 if (histogram->total_count_ == 0) {
36 return (kTwoSymbolHistogramCost + (double)histogram->total_count_);
75 const double log2total = FastLog2(histogram->total_count_);
H A Dentropy_encode.c50 if (v0->total_count_ != v1->total_count_) {
51 return TO_BROTLI_BOOL(v0->total_count_ < v1->total_count_);
117 if (tree[i].total_count_ <= tree[j].total_count_) {
124 if (tree[i].total_count_ <= tree[j].total_count_) {
135 tree[j_end].total_count_ =
136 tree[left].total_count_
[all...]
H A Dentropy_encode.h21 uint32_t total_count_; member in struct:HuffmanTree
28 self->total_count_ = count;
H A Dbrotli_bit_stream.c400 return TO_BROTLI_BOOL(v0->total_count_ < v1->total_count_);
474 if (tree[i].total_count_ <= tree[j].total_count_) {
481 if (tree[i].total_count_ <= tree[j].total_count_) {
489 node[-1].total_count_ =
490 tree[left].total_count_ + tree[right].total_count_;
1247 lit_histo.total_count_,
[all...]
H A Dcluster_inc.h36 if (out[idx1].total_count_ == 0) {
39 } else if (out[idx2].total_count_ == 0) {
159 if (histogram->total_count_ == 0) {
H A Dblock_splitter_inc.h88 insert_cost[i] = FastLog2((uint32_t)histograms[i].total_count_);

Completed in 7 milliseconds