Home
last modified time | relevance | path

Searched refs:histograms (Results 1 - 18 of 18) sorted by relevance

/third_party/skia/third_party/externals/libwebp/src/enc/
H A Dhistogram_enc.c31 // Maximum number of histograms allowed in greedy combining algorithm.
123 // Resets the pointers of the histograms to point to the bit buffer in the set.
128 uint8_t* memory = (uint8_t*) (set->histograms); in HistogramSetResetPointers()
129 memory += set->max_size * sizeof(*set->histograms); in HistogramSetResetPointers()
132 set->histograms[i] = (VP8LHistogram*) memory; in HistogramSetResetPointers()
134 set->histograms[i]->literal_ = (uint32_t*)(memory + sizeof(VP8LHistogram)); in HistogramSetResetPointers()
155 set->histograms = (VP8LHistogram**)memory; in VP8LAllocateHistogramSet()
160 VP8LHistogramInit(set->histograms[i], cache_bits, /*init_arrays=*/ 0); in VP8LAllocateHistogramSet()
167 const int cache_bits = set->histograms[0]->palette_code_bits_; in VP8LHistogramSetClear()
174 set->histograms in VP8LHistogramSetClear()
563 VP8LHistogram** const histograms = image_histo->histograms; HistogramBuild() local
589 VP8LHistogram** const histograms = image_histo->histograms; HistogramCopyAndAnalyze() local
621 VP8LHistogram** const histograms = image_histo->histograms; HistogramAnalyzeEntropyBin() local
653 VP8LHistogram** const histograms = image_histo->histograms; HistogramCombineEntropyBin() local
802 HistoQueuePush(HistoQueue* const histo_queue, VP8LHistogram** const histograms, int idx1, int idx2, double threshold) HistoQueuePush() argument
842 VP8LHistogram** const histograms = image_histo->histograms; HistogramCombineGreedy() local
916 VP8LHistogram** const histograms = image_histo->histograms; HistogramCombineStochastic() local
[all...]
H A Dhistogram_enc.h12 // Models the histograms of literal and distance codes.
30 // A simple container for histograms of data.
41 uint32_t trivial_symbol_; // True, if histograms for Red, Blue & Alpha
50 // Collection of histograms with fixed capacity, allocated as one
55 VP8LHistogram** histograms; member
85 // Allocate an array of pointer to histograms, allocated and initialized
89 // Set the histograms in set to 0.
H A Dvp8l_enc.c442 // Let's add one zero to the predicted histograms. The zeros are removed in AnalyzeEntropy()
702 // Iterate over all histograms and get the aggregate number of codes used. in GetHuffBitLengthsAndCodes()
704 const VP8LHistogram* const histo = histogram_image->histograms[i]; in GetHuffBitLengthsAndCodes()
746 VP8LHistogram* const histo = histogram_image->histograms[i]; in GetHuffBitLengthsAndCodes()
768 // and more spiking histograms. in StoreHuffmanTreeOfHuffmanTreeToBitMask()
1052 VP8LHistogramStoreRefs(refs, histogram_image->histograms[0]); in EncodeImageNoHuffman()
1194 // Free combined histograms. in EncodeImageInternal()
1198 // Free scratch histograms. in EncodeImageInternal()
/third_party/node/deps/brotli/c/enc/
H A Dmetablock_inc.h19 /* We merge histograms A and B if in FN()
37 /* Offset of the histograms of the previous two block types. */ in FN()
48 BlockSplit* split, HistogramType** histograms, size_t* histograms_size) { in InitBlockSplitter()
70 BROTLI_DCHECK(*histograms == 0); in InitBlockSplitter()
72 *histograms = BROTLI_ALLOC(m, HistogramType, *histograms_size); in InitBlockSplitter()
73 self->histograms_ = *histograms; in InitBlockSplitter()
74 if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(*histograms)) return; in InitBlockSplitter()
88 HistogramType* histograms = self->histograms_; variable
96 BitsEntropy(histograms[0].data_, self->alphabet_size_);
102 FN(HistogramClear)(&histograms[sel
45 InitBlockSplitter( MemoryManager* m, FN(BlockSplitter)* self, size_t alphabet_size, size_t min_block_size, double split_threshold, size_t num_symbols, BlockSplit* split, HistogramType** histograms, size_t* histograms_size) InitBlockSplitter() argument
[all...]
H A Dblock_splitter_inc.h15 HistogramType* histograms) { in InitialEntropyCodes()
19 FN(ClearHistograms)(histograms, num_histograms); in InitialEntropyCodes()
28 FN(HistogramAddVector)(&histograms[i], data + pos, stride); in InitialEntropyCodes()
49 HistogramType* histograms) { in RefineEntropyCodes()
59 FN(HistogramAddHistogram)(&histograms[iter % num_histograms], &sample); in RefineEntropyCodes()
69 const HistogramType* histograms, in FindBlocks()
88 insert_cost[i] = FastLog2((uint32_t)histograms[i].total_count_); in FindBlocks()
94 insert_cost[j] - BitCost(histograms[j].data_[i]); in FindBlocks()
180 HistogramType* histograms) {
182 FN(ClearHistograms)(histograms, num_histogram
12 InitialEntropyCodes(const DataType* data, size_t length, size_t stride, size_t num_histograms, HistogramType* histograms) InitialEntropyCodes() argument
46 RefineEntropyCodes(const DataType* data, size_t length, size_t stride, size_t num_histograms, HistogramType* histograms) RefineEntropyCodes() argument
66 FindBlocks(const DataType* data, const size_t length, const double block_switch_bitcost, const size_t num_histograms, const HistogramType* histograms, double* insert_cost, double* cost, uint8_t* switch_signal, uint8_t* block_id) FindBlocks() argument
[all...]
H A Dmetablock.c301 Gathers histograms for all context buckets. */
309 /* We merge histograms A and B if
327 /* Offset of the histograms of the previous two block types. */
338 size_t num_symbols, BlockSplit* split, HistogramLiteral** histograms, in InitContextBlockSplitter()
368 BROTLI_DCHECK(*histograms == 0); in InitContextBlockSplitter()
370 *histograms = BROTLI_ALLOC(m, HistogramLiteral, *histograms_size); in InitContextBlockSplitter()
371 self->histograms_ = *histograms; in InitContextBlockSplitter()
372 if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(*histograms)) return; in InitContextBlockSplitter()
387 HistogramLiteral* histograms = self->histograms_; in ContextBlockSplitterFinishBlock() local
400 BitsEntropy(histograms[ in ContextBlockSplitterFinishBlock()
335 InitContextBlockSplitter( MemoryManager* m, ContextBlockSplitter* self, size_t alphabet_size, size_t num_contexts, size_t min_block_size, double split_threshold, size_t num_symbols, BlockSplit* split, HistogramLiteral** histograms, size_t* histograms_size) InitContextBlockSplitter() argument
[all...]
H A Dblock_encoder_inc.h15 const HistogramType* histograms, const size_t histograms_size, in BuildAndStoreEntropyCodes()
27 BuildAndStoreHuffmanTree(&histograms[i].data_[0], self->histogram_length_, in BuildAndStoreEntropyCodes()
14 BuildAndStoreEntropyCodes(MemoryManager* m, BlockEncoder* self, const HistogramType* histograms, const size_t histograms_size, const size_t alphabet_size, HuffmanTree* tree, size_t* storage_ix, uint8_t* storage) BuildAndStoreEntropyCodes() argument
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dmetablock_inc.h19 /* We merge histograms A and B if in FN()
37 /* Offset of the histograms of the previous two block types. */ in FN()
48 BlockSplit* split, HistogramType** histograms, size_t* histograms_size) { in InitBlockSplitter()
70 BROTLI_DCHECK(*histograms == 0); in InitBlockSplitter()
72 *histograms = BROTLI_ALLOC(m, HistogramType, *histograms_size); in InitBlockSplitter()
73 self->histograms_ = *histograms; in InitBlockSplitter()
74 if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(*histograms)) return; in InitBlockSplitter()
88 HistogramType* histograms = self->histograms_; variable
96 BitsEntropy(histograms[0].data_, self->alphabet_size_);
102 FN(HistogramClear)(&histograms[sel
45 InitBlockSplitter( MemoryManager* m, FN(BlockSplitter)* self, size_t alphabet_size, size_t min_block_size, double split_threshold, size_t num_symbols, BlockSplit* split, HistogramType** histograms, size_t* histograms_size) InitBlockSplitter() argument
[all...]
H A Dblock_splitter_inc.h15 HistogramType* histograms) { in InitialEntropyCodes()
19 FN(ClearHistograms)(histograms, num_histograms); in InitialEntropyCodes()
28 FN(HistogramAddVector)(&histograms[i], data + pos, stride); in InitialEntropyCodes()
49 HistogramType* histograms) { in RefineEntropyCodes()
59 FN(HistogramAddHistogram)(&histograms[iter % num_histograms], &sample); in RefineEntropyCodes()
69 const HistogramType* histograms, in FindBlocks()
88 insert_cost[i] = FastLog2((uint32_t)histograms[i].total_count_); in FindBlocks()
94 insert_cost[j] - BitCost(histograms[j].data_[i]); in FindBlocks()
180 HistogramType* histograms) {
182 FN(ClearHistograms)(histograms, num_histogram
12 InitialEntropyCodes(const DataType* data, size_t length, size_t stride, size_t num_histograms, HistogramType* histograms) InitialEntropyCodes() argument
46 RefineEntropyCodes(const DataType* data, size_t length, size_t stride, size_t num_histograms, HistogramType* histograms) RefineEntropyCodes() argument
66 FindBlocks(const DataType* data, const size_t length, const double block_switch_bitcost, const size_t num_histograms, const HistogramType* histograms, double* insert_cost, double* cost, uint8_t* switch_signal, uint8_t* block_id) FindBlocks() argument
[all...]
H A Dmetablock.c301 Gathers histograms for all context buckets. */
309 /* We merge histograms A and B if
327 /* Offset of the histograms of the previous two block types. */
338 size_t num_symbols, BlockSplit* split, HistogramLiteral** histograms, in InitContextBlockSplitter()
368 BROTLI_DCHECK(*histograms == 0); in InitContextBlockSplitter()
370 *histograms = BROTLI_ALLOC(m, HistogramLiteral, *histograms_size); in InitContextBlockSplitter()
371 self->histograms_ = *histograms; in InitContextBlockSplitter()
372 if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(*histograms)) return; in InitContextBlockSplitter()
387 HistogramLiteral* histograms = self->histograms_; in ContextBlockSplitterFinishBlock() local
400 BitsEntropy(histograms[ in ContextBlockSplitterFinishBlock()
335 InitContextBlockSplitter( MemoryManager* m, ContextBlockSplitter* self, size_t alphabet_size, size_t num_contexts, size_t min_block_size, double split_threshold, size_t num_symbols, BlockSplit* split, HistogramLiteral** histograms, size_t* histograms_size) InitContextBlockSplitter() argument
[all...]
H A Dblock_encoder_inc.h15 const HistogramType* histograms, const size_t histograms_size, in BuildAndStoreEntropyCodes()
27 BuildAndStoreHuffmanTree(&histograms[i].data_[0], self->histogram_length_, in BuildAndStoreEntropyCodes()
14 BuildAndStoreEntropyCodes(MemoryManager* m, BlockEncoder* self, const HistogramType* histograms, const size_t histograms_size, const size_t alphabet_size, HuffmanTree* tree, size_t* storage_ix, uint8_t* storage) BuildAndStoreEntropyCodes() argument
/third_party/ffmpeg/libavcodec/
H A Didcinvideo.c152 unsigned char *histograms; in idcin_decode_init() local
164 histograms = (unsigned char *)s->avctx->extradata; in idcin_decode_init()
167 s->huff_nodes[i][j].count = histograms[histogram_index++]; in idcin_decode_init()
/third_party/skia/third_party/externals/angle2/src/tests/
H A Drun_perf_tests.py182 def _save_extra_output_files(args, results, histograms):
192 logging.info('Saving perf histograms to %s.' % perf_output_path)
194 out_file.write(json.dumps(histograms.AsDicts(), indent=2))
345 histograms = histogram_set.HistogramSet()
446 logging.info('Writing merged histograms to %s.' % merge_histogram_path)
454 histograms.Merge(merged_histogram)
462 _save_extra_output_files(args, results, histograms)
466 out_file.write(json.dumps(histograms.AsDicts(), indent=2))
/third_party/skia/third_party/externals/angle2/scripts/
H A Dprocess_angle_perf_results.py82 '--send-as-histograms',
337 histograms = histogram_set.HistogramSet()
338 histograms.ImportDicts(data)
339 return histograms
343 histograms = _load_histogram_set_from_dict(results)
361 histograms.AddSharedDiagnosticToAllHistograms(k.name, generic_set.GenericSet([v]))
363 return histograms.AsDicts()
/third_party/mesa3d/src/amd/vulkan/radix_sort/
H A Dradix_sort_vk.c100 // NOTE: Assumes .histograms are before .partitions. in radix_sort_vk_get_memory_requirements()
385 rs->internal.histograms.offset = 0; in radix_sort_vk_create()
386 rs->internal.histograms.range = keyval_bytes * (RS_RADIX_SIZE * sizeof(uint32_t)); in radix_sort_vk_create()
393 rs->internal.partitions.offset = rs->internal.histograms.offset + rs->internal.histograms.range; in radix_sort_vk_create()
543 // 2. Zero the `histograms` and `partitions`. in radix_sort_vk_sort_devaddr()
588 // Zero the histograms and partitions buffer. in radix_sort_vk_sort_devaddr()
590 // This assumes the partitions follow the histograms. in radix_sort_vk_sort_devaddr()
633 // Zero histograms and invalidate partitions. in radix_sort_vk_sort_devaddr()
649 rs->internal.histograms in radix_sort_vk_sort_devaddr()
[all...]
H A Dradix_sort_vk.h145 } histograms; member
/third_party/ffmpeg/libavfilter/
H A Dvf_tmidequalizer.c94 static void compute_contrast_function(const float *const histograms[256], in compute_contrast_function() argument
99 const float *const h1 = histograms[idx]; in compute_contrast_function()
108 const float *const h2 = histograms[nidx < 0 ? nidx + nb_frames: nidx]; in compute_contrast_function()
121 const float *const h2 = histograms[nidx < 0 ? nidx + nb_frames: nidx]; in compute_contrast_function()
/third_party/skia/third_party/externals/angle2/src/tests/test_utils/runner/
H A DHistogramWriter.cpp16 # error "Must have histograms enabled"
95 const proto::Histogram &histogram = histogramSet.histograms(histogramIndex); in getAsJSON()

Completed in 15 milliseconds