Lines Matching refs:histogram
22 #include "./histogram.h"
346 /* Builds a Huffman tree from histogram[0:length] into depth[0:length] and
348 static void BuildAndStoreHuffmanTree(const uint32_t* histogram,
361 if (histogram[i]) {
388 BrotliCreateHuffmanTree(histogram, histogram_length, 15, tree, depth);
404 const uint32_t* histogram,
415 if (histogram[length]) {
420 total -= histogram[length];
444 if (histogram[l]) {
445 if (BROTLI_PREDICT_TRUE(histogram[l] >= count_limit)) {
446 InitHuffmanTree(node, histogram[l], -1, (int16_t)l);
690 uint32_t histogram[BROTLI_MAX_CONTEXT_MAP_SYMBOLS];
706 memset(histogram, 0, sizeof(histogram));
708 ++histogram[rle_symbols[i] & kSymbolMask];
717 BuildAndStoreHuffmanTree(histogram, num_clusters + max_run_length_prefix,
789 /* Stores a context map where the histogram type is always the block type. */
800 uint32_t histogram[BROTLI_MAX_CONTEXT_MAP_SYMBOLS];
804 memset(histogram, 0, alphabet_size * sizeof(histogram[0]));
808 histogram[repeat_code] = (uint32_t)num_types;
809 histogram[0] = 1;
811 histogram[i] = 1;
813 BuildAndStoreHuffmanTree(histogram, alphabet_size, alphabet_size,
1201 uint32_t histogram[BROTLI_NUM_LITERAL_SYMBOLS] = { 0 };
1211 ++histogram[input[pos & mask]];
1217 BrotliBuildAndStoreHuffmanTreeFast(m, histogram, num_literals,