HomeSort by relevance Sort by last modified time
    Searched defs:tree_size (Results 1 - 3 of 3) sorted by null

  /external/opencv3/3rdparty/libwebp/utils/
huffman_encode.c 197 // 3 * tree_size is enough to cover all the nodes representing a
211 int tree_size = tree_size_orig; local
229 qsort(tree, tree_size, sizeof(*tree), CompareHuffmanTrees);
231 if (tree_size > 1) { // Normal case.
233 while (tree_size > 1) { // Finish when we have only one root.
235 tree_pool[tree_pool_size++] = tree[tree_size - 1];
236 tree_pool[tree_pool_size++] = tree[tree_size - 2];
239 tree_size -= 2;
243 for (k = 0; k < tree_size; ++k) {
248 memmove(tree + (k + 1), tree + k, (tree_size - k) * sizeof(*tree))
    [all...]
  /external/webp/src/utils/
huffman_encode.c 192 int tree_size = tree_size_orig; local
210 qsort(tree, tree_size, sizeof(*tree), CompareHuffmanTrees);
212 if (tree_size > 1) { // Normal case.
214 while (tree_size > 1) { // Finish when we have only one root.
216 tree_pool[tree_pool_size++] = tree[tree_size - 1];
217 tree_pool[tree_pool_size++] = tree[tree_size - 2];
220 tree_size -= 2;
224 for (k = 0; k < tree_size; ++k) {
229 memmove(tree + (k + 1), tree + k, (tree_size - k) * sizeof(*tree));
235 tree_size = tree_size + 1
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/
langhooks.h 262 size_t (*tree_size) (enum tree_code); member in struct:lang_hooks

Completed in 73 milliseconds