| /xsrc/external/mit/brotli/dist/c/enc/ |
| H A D | bit_cost_inc.h | 12 double FN(BrotliPopulationCost)(const HistogramType* histogram) {
22 if (histogram->total_count_ == 0) {
26 if (histogram->data_[i] > 0) {
36 return (kTwoSymbolHistogramCost + (double)histogram->total_count_);
39 const uint32_t histo0 = histogram->data_[s[0]];
40 const uint32_t histo1 = histogram->data_[s[1]];
41 const uint32_t histo2 = histogram->data_[s[2]];
52 histo[i] = histogram->data_[s[i]];
70 /* In this loop we compute the entropy of the histogram and simultaneously
71 build a simplified histogram o
[all...] |
| H A D | literal_cost.c | 61 size_t histogram[3][256] = { { 0 } }; local in function:EstimateBitCostsForLiteralsUTF8
72 ++histogram[utf8_pos][c];
88 --histogram[utf8_pos2][data[(pos + i - window_half) & mask]];
96 ++histogram[utf8_pos2][data[(pos + i + window_half) & mask]];
104 size_t histo = histogram[utf8_pos][data[masked_pos]];
133 size_t histogram[256] = { 0 }; local in function:BrotliEstimateBitCostsForLiterals
137 /* Bootstrap histogram. */
140 ++histogram[data[(pos + i) & mask]];
148 --histogram[data[(pos + i - window_half) & mask]];
153 ++histogram[dat
[all...] |
| H A D | brotli_bit_stream.c | 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, argument
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[
403 BrotliBuildAndStoreHuffmanTreeFast(MemoryManager * m,const uint32_t * histogram,const size_t histogram_total,const size_t max_bits,uint8_t * depth,uint16_t * bits,size_t * storage_ix,uint8_t * storage) argument
690 uint32_t histogram[BROTLI_MAX_CONTEXT_MAP_SYMBOLS]; local in function:EncodeContextMap
800 uint32_t histogram[BROTLI_MAX_CONTEXT_MAP_SYMBOLS]; local in function:StoreTrivialContextMap
1201 uint32_t histogram[BROTLI_NUM_LITERAL_SYMBOLS] = { 0 }; local in function:BrotliStoreMetaBlockFast
[all...] |
| H A D | compress_fragment.c | 68 Moreover, for long inputs we build a histogram from a sample of the input
79 uint32_t histogram[256] = { 0 }; local in function:BuildAndStoreLiteralPrefixCode
84 ++histogram[input[i]];
89 balancing effect of the LZ77 phase on the histogram. */
90 const uint32_t adjust = 2 * BROTLI_MIN(uint32_t, histogram[i], 11u);
91 histogram[i] += adjust;
97 ++histogram[input[i]];
104 effect of the LZ77 phase on the histogram (more frequent symbols are
106 const uint32_t adjust = 1 + 2 * BROTLI_MIN(uint32_t, histogram[i], 11u);
107 histogram[
127 BuildAndStoreCommandPrefixCode(const uint32_t histogram[128],uint8_t depth[128],uint16_t bits[128],size_t * storage_ix,uint8_t * storage) argument
[all...] |
| H A D | brotli_bit_stream.h | 38 MemoryManager* m, const uint32_t* histogram, const size_t histogram_total,
52 one histogram per block category and uses that for entropy coding.
|
| H A D | cluster_inc.h | 84 /* We maintain a vector of histogram pairs, with the property that the pair
147 /* Push new pairs formed with the combined histogram to the heap. */
156 /* What is the bit cost of moving histogram from cur_symbol to candidate. */
158 const HistogramType* histogram, const HistogramType* candidate) CODE({
159 if (histogram->total_count_ == 0) {
162 HistogramType tmp = *histogram;
168 /* Find the best 'out' histogram for each of the 'in' histograms.
295 /* For the second pass, we limit the total number of histogram pairs.
|
| H A D | backward_references_hq.c | 103 static void SetCost(const uint32_t* histogram, size_t histogram_size, argument
111 sum += histogram[i];
117 if (histogram[i] == 0) missing_symbol_sum++;
122 if (histogram[i] == 0) {
128 cost[i] = log2sum - (float)FastLog2(histogram[i]);
|
| H A D | compress_fragment_two_pass.c | 68 "bits" based on "histogram" and stores it into the bit stream. */
70 const uint32_t histogram[128],
77 BrotliCreateHuffmanTree(histogram, 64, 15, tree, depth);
78 BrotliCreateHuffmanTree(&histogram[64], 64, 14, tree, &depth[64]);
69 BuildAndStoreCommandPrefixCode(const uint32_t histogram[128],uint8_t depth[128],uint16_t bits[128],size_t * storage_ix,uint8_t * storage) argument
|
| /xsrc/external/mit/mesa-demos/dist/src/redbook/ |
| H A D | Makefile.am | 62 histogram \
|
| H A D | Makefile.in | 128 @HAVE_GLUT_TRUE@ histogram$(EXEEXT) image$(EXEEXT) \
250 histogram_SOURCES = histogram.c
251 histogram_OBJECTS = histogram.$(OBJEXT)
435 fogindex.c font.c hello.c histogram.c image.c light.c lines.c \
448 fogindex.c font.c hello.c histogram.c image.c light.c lines.c \
805 histogram$(EXEEXT): $(histogram_OBJECTS) $(histogram_DEPENDENCIES) $(EXTRA_histogram_DEPENDENCIES)
806 @rm -f histogram$(EXEEXT)
1034 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/histogram.Po@am__quote@
|
| /xsrc/external/mit/MesaLib.old/dist/src/mesa/ |
| H A D | Makefile.sources | 133 main/histogram.c \
134 main/histogram.h \
|
| /xsrc/external/mit/MesaLib/dist/docs/relnotes/ |
| H A D | 7.10.rst | 2773 - mesa: Clean up header file inclusion in histogram.h.
|
| H A D | 21.3.0.rst | 3996 - vulkan/overlay: don't display histogram and range for device and format
|