HomeSort by relevance Sort by last modified time
    Searched refs:histogram_symbols (Results 1 - 5 of 5) sorted by null

  /external/webp/src/enc/
histogram_enc.h 115 uint16_t* const histogram_symbols);
vp8l_enc.c 714 const uint16_t* histogram_symbols,
723 int histogram_ix = histogram_symbols[0];
731 histogram_ix = histogram_symbols[(y >> histo_bits) * histo_xsize +
785 const uint16_t histogram_symbols[1] = { 0 }; // only one tree, one symbol local
850 err = StoreImageToBitMask(bw, width, 0, refs, histogram_symbols,
881 uint16_t* const histogram_symbols = local
883 sizeof(*histogram_symbols));
892 if (histogram_symbols == NULL) {
    [all...]
histogram_enc.c 584 uint16_t* const histogram_symbols) {
604 histogram_symbols[i] = kInvalidHistogramSymbol;
608 histogram_symbols[i] = cluster_id++;
    [all...]
  /external/brotli/c/enc/
block_splitter_inc.h 193 uint32_t* histogram_symbols = BROTLI_ALLOC(m, uint32_t, num_blocks);
268 histogram_symbols[i + j] = (uint32_t)num_clusters + remap[symbols[j]];
290 all_histograms, cluster_size, histogram_symbols, clusters, pairs,
311 best_out = (i == 0) ? histogram_symbols[0] : histogram_symbols[i - 1];
322 histogram_symbols[i] = best_out;
342 histogram_symbols[i] != histogram_symbols[i + 1]) {
343 const uint8_t id = (uint8_t)new_index[histogram_symbols[i]];
356 BROTLI_FREE(m, histogram_symbols);
    [all...]
cluster_inc.h 252 uint32_t* histogram_symbols) CODE({
271 histogram_symbols[i] = (uint32_t)i;
284 &histogram_symbols[i],
302 histogram_symbols, clusters,
310 out, histogram_symbols);
313 *out_size = FN(BrotliHistogramReindex)(m, out, histogram_symbols, in_size);

Completed in 236 milliseconds