Searched refs:num_clusters (Results 1 - 3 of 3) sorted by relevance

/xsrc/external/mit/brotli/dist/c/enc/
H A Dcluster_inc.h75 size_t num_clusters,
87 for (idx1 = 0; idx1 < num_clusters; ++idx1) {
89 for (idx2 = idx1 + 1; idx2 < num_clusters; ++idx2) {
96 while (num_clusters > min_cluster_size) {
116 for (i = 0; i < num_clusters; ++i) {
119 (num_clusters - i - 1) * sizeof(clusters[0]));
123 --num_clusters;
148 for (i = 0; i < num_clusters; ++i) {
153 return num_clusters;
169 When called, clusters[0..num_clusters) contain
[all...]
H A Dblock_splitter_inc.h204 size_t num_clusters = 0; local in function:FN
273 histogram_symbols[i + j] = (uint32_t)num_clusters + remap[symbols[j]];
275 num_clusters += num_new_clusters;
276 BROTLI_DCHECK(num_clusters == cluster_size_size);
277 BROTLI_DCHECK(num_clusters == all_histograms_size);
282 BROTLI_MIN(size_t, 64 * num_clusters, (num_clusters / 2) * num_clusters);
289 clusters = BROTLI_ALLOC(m, uint32_t, num_clusters);
291 for (i = 0; i < num_clusters;
[all...]
H A Dbrotli_bit_stream.c683 size_t num_clusters,
695 StoreVarLenUint8(num_clusters - 1, storage_ix, storage);
697 if (num_clusters == 1) {
717 BuildAndStoreHuffmanTree(histogram, num_clusters + max_run_length_prefix,
718 num_clusters + max_run_length_prefix,
680 EncodeContextMap(MemoryManager * m,const uint32_t * context_map,size_t context_map_size,size_t num_clusters,HuffmanTree * tree,size_t * storage_ix,uint8_t * storage) argument

Completed in 4 milliseconds