Searched refs:total_count_ (Results 1 – 11 of 11) sorted by relevance
14 size_t total_count_;20 self->total_count_ = 0; in FN()32 ++self->total_count_; in FN()37 self->total_count_ += n; in FN()45 self->total_count_ += v->total_count_; in FN()
48 if (v0->total_count_ != v1->total_count_) { in SortHuffmanTree()49 return TO_BROTLI_BOOL(v0->total_count_ < v1->total_count_); in SortHuffmanTree()115 if (tree[i].total_count_ <= tree[j].total_count_) { in BrotliCreateHuffmanTree()122 if (tree[i].total_count_ <= tree[j].total_count_) { in BrotliCreateHuffmanTree()133 tree[j_end].total_count_ = in BrotliCreateHuffmanTree()134 tree[left].total_count_ + tree[right].total_count_; in BrotliCreateHuffmanTree()
22 if (histogram->total_count_ == 0) { in FN()36 return (kTwoSymbolHistogramCost + (double)histogram->total_count_); in FN()75 const double log2total = FastLog2(histogram->total_count_); in FN()
21 uint32_t total_count_; member28 self->total_count_ = count; in InitHuffmanTree()
414 return TO_BROTLI_BOOL(v0->total_count_ < v1->total_count_); in SortHuffmanTree()488 if (tree[i].total_count_ <= tree[j].total_count_) { in BrotliBuildAndStoreHuffmanTreeFast()495 if (tree[i].total_count_ <= tree[j].total_count_) { in BrotliBuildAndStoreHuffmanTreeFast()503 node[-1].total_count_ = in BrotliBuildAndStoreHuffmanTreeFast()504 tree[left].total_count_ + tree[right].total_count_; in BrotliBuildAndStoreHuffmanTreeFast()1263 lit_histo.total_count_, in BrotliStoreMetaBlockFast()1269 cmd_histo.total_count_, in BrotliStoreMetaBlockFast()1275 dist_histo.total_count_, in BrotliStoreMetaBlockFast()
36 if (out[idx1].total_count_ == 0) {39 } else if (out[idx2].total_count_ == 0) {159 if (histogram->total_count_ == 0) {
88 insert_cost[i] = FastLog2((uint32_t)histograms[i].total_count_); in FN()
125 if (t1->total_count_ > t2->total_count_) { in CompareHuffmanTrees()127 } else if (t1->total_count_ < t2->total_count_) { in CompareHuffmanTrees()201 tree[idx].total_count_ = count; in GenerateOptimalTree()218 count = tree_pool[tree_pool_size - 1].total_count_ + in GenerateOptimalTree()219 tree_pool[tree_pool_size - 2].total_count_; in GenerateOptimalTree()225 if (tree[k].total_count_ <= count) { in GenerateOptimalTree()230 tree[k].total_count_ = count; in GenerateOptimalTree()
38 uint32_t total_count_; // Symbol frequency. member
37 total_count_++; in Insert()57 "showing top %zd%%\n", total_allocated_, total_count_, top_percent); in Print()71 uptr total_count_ = 0; member in __asan::HeapProfile
327 : total_count_(total_count), in NotificationCounter()338 CHECK_LT(current_count_, total_count_); in OnGotNotification()340 finshed = current_count_ == total_count_; in OnGotNotification()349 const size_t total_count_; member in mojo::test::__anonb499be8f0111::NotificationCounter