Home
last modified time | relevance | path

Searched refs:total_count_ (Results 1 – 11 of 11) sorted by relevance

/external/brotli/c/enc/
Dhistogram_inc.h14 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()
Dentropy_encode.c48 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()
Dbit_cost_inc.h22 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()
Dentropy_encode.h21 uint32_t total_count_; member
28 self->total_count_ = count; in InitHuffmanTree()
Dbrotli_bit_stream.c415 return TO_BROTLI_BOOL(v0->total_count_ < v1->total_count_); in SortHuffmanTree()
489 if (tree[i].total_count_ <= tree[j].total_count_) { in BrotliBuildAndStoreHuffmanTreeFast()
496 if (tree[i].total_count_ <= tree[j].total_count_) { in BrotliBuildAndStoreHuffmanTreeFast()
504 node[-1].total_count_ = in BrotliBuildAndStoreHuffmanTreeFast()
505 tree[left].total_count_ + tree[right].total_count_; in BrotliBuildAndStoreHuffmanTreeFast()
1264 lit_histo.total_count_, in BrotliStoreMetaBlockFast()
1270 cmd_histo.total_count_, in BrotliStoreMetaBlockFast()
1276 dist_histo.total_count_, in BrotliStoreMetaBlockFast()
Dcluster_inc.h36 if (out[idx1].total_count_ == 0) {
39 } else if (out[idx2].total_count_ == 0) {
159 if (histogram->total_count_ == 0) {
Dblock_splitter_inc.h88 insert_cost[i] = FastLog2((uint32_t)histograms[i].total_count_); in FN()
/external/webp/src/utils/
Dhuffman_encode_utils.c125 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()
Dhuffman_encode_utils.h38 uint32_t total_count_; // Symbol frequency. member
/external/compiler-rt/lib/asan/
Dasan_memory_profile.cc37 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
/external/libchrome/mojo/public/cpp/bindings/tests/
Dassociated_interface_unittest.cc349 : total_count_(total_count), in NotificationCounter()
360 CHECK_LT(current_count_, total_count_); in OnGotNotification()
362 finshed = current_count_ == total_count_; in OnGotNotification()
371 const size_t total_count_; member in mojo::test::__anonfa0053440111::NotificationCounter