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

  /external/opencv3/3rdparty/libwebp/utils/
huffman_encode.h 42 int VP8LCreateHuffmanTree(int* const histogram, int tree_depth_limit,
huffman_encode.c 427 int VP8LCreateHuffmanTree(int* const histogram, int tree_depth_limit,
  /external/webp/src/utils/
huffman_encode.h 52 void VP8LCreateHuffmanTree(uint32_t* const histogram, int tree_depth_limit,
huffman_encode.c 406 void VP8LCreateHuffmanTree(uint32_t* const histogram, int tree_depth_limit,
  /external/opencv3/3rdparty/libwebp/enc/
vp8l.c 229 ok = ok && VP8LCreateHuffmanTree(histo->literal_, 15, codes + 0);
230 ok = ok && VP8LCreateHuffmanTree(histo->red_, 15, codes + 1);
231 ok = ok && VP8LCreateHuffmanTree(histo->blue_, 15, codes + 2);
232 ok = ok && VP8LCreateHuffmanTree(histo->alpha_, 15, codes + 3);
233 ok = ok && VP8LCreateHuffmanTree(histo->distance_, 15, codes + 4);
239 // If one VP8LCreateHuffmanTree() above fails, we need to clean up behind.
331 if (!VP8LCreateHuffmanTree(histogram, 7, &huffman_code)) {
    [all...]
  /external/webp/src/enc/
vp8l.c 479 VP8LCreateHuffmanTree(histo->literal_, 15, buf_rle, huff_tree, codes + 0);
480 VP8LCreateHuffmanTree(histo->red_, 15, buf_rle, huff_tree, codes + 1);
481 VP8LCreateHuffmanTree(histo->blue_, 15, buf_rle, huff_tree, codes + 2);
482 VP8LCreateHuffmanTree(histo->alpha_, 15, buf_rle, huff_tree, codes + 3);
483 VP8LCreateHuffmanTree(histo->distance_, 15, buf_rle, huff_tree, codes + 4);
581 VP8LCreateHuffmanTree(histogram, 7, buf_rle, huff_tree, &huffman_code);
    [all...]

Completed in 315 milliseconds