Home
last modified time | relevance | path

Searched refs:tree_size (Results 1 – 8 of 8) sorted by relevance

/third_party/skia/third_party/externals/brotli/c/enc/
Dentropy_encode.c167 size_t* tree_size, in BrotliWriteHuffmanTreeRepetitions() argument
172 tree[*tree_size] = value; in BrotliWriteHuffmanTreeRepetitions()
173 extra_bits_data[*tree_size] = 0; in BrotliWriteHuffmanTreeRepetitions()
174 ++(*tree_size); in BrotliWriteHuffmanTreeRepetitions()
178 tree[*tree_size] = value; in BrotliWriteHuffmanTreeRepetitions()
179 extra_bits_data[*tree_size] = 0; in BrotliWriteHuffmanTreeRepetitions()
180 ++(*tree_size); in BrotliWriteHuffmanTreeRepetitions()
186 tree[*tree_size] = value; in BrotliWriteHuffmanTreeRepetitions()
187 extra_bits_data[*tree_size] = 0; in BrotliWriteHuffmanTreeRepetitions()
188 ++(*tree_size); in BrotliWriteHuffmanTreeRepetitions()
[all …]
Dentropy_encode.h70 size_t* tree_size,
/third_party/node/deps/brotli/c/enc/
Dentropy_encode.c167 size_t* tree_size, in BrotliWriteHuffmanTreeRepetitions() argument
172 tree[*tree_size] = value; in BrotliWriteHuffmanTreeRepetitions()
173 extra_bits_data[*tree_size] = 0; in BrotliWriteHuffmanTreeRepetitions()
174 ++(*tree_size); in BrotliWriteHuffmanTreeRepetitions()
178 tree[*tree_size] = value; in BrotliWriteHuffmanTreeRepetitions()
179 extra_bits_data[*tree_size] = 0; in BrotliWriteHuffmanTreeRepetitions()
180 ++(*tree_size); in BrotliWriteHuffmanTreeRepetitions()
186 tree[*tree_size] = value; in BrotliWriteHuffmanTreeRepetitions()
187 extra_bits_data[*tree_size] = 0; in BrotliWriteHuffmanTreeRepetitions()
188 ++(*tree_size); in BrotliWriteHuffmanTreeRepetitions()
[all …]
Dentropy_encode.h70 size_t* tree_size,
/third_party/skia/third_party/externals/libwebp/src/utils/
Dhuffman_encode_utils.c192 int tree_size = tree_size_orig; in GenerateOptimalTree() local
210 qsort(tree, tree_size, sizeof(*tree), CompareHuffmanTrees); in GenerateOptimalTree()
212 if (tree_size > 1) { // Normal case. in GenerateOptimalTree()
214 while (tree_size > 1) { // Finish when we have only one root. in GenerateOptimalTree()
216 tree_pool[tree_pool_size++] = tree[tree_size - 1]; in GenerateOptimalTree()
217 tree_pool[tree_pool_size++] = tree[tree_size - 2]; in GenerateOptimalTree()
220 tree_size -= 2; in GenerateOptimalTree()
224 for (k = 0; k < tree_size; ++k) { in GenerateOptimalTree()
229 memmove(tree + (k + 1), tree + k, (tree_size - k) * sizeof(*tree)); in GenerateOptimalTree()
235 tree_size = tree_size + 1; in GenerateOptimalTree()
[all …]
/third_party/ltp/testcases/kernel/mce-test/stress/tools/fs-metadata/
Dfs-metadata.sh123 local tree_size=$(echo "scale=2; (1-$width^$depth)/(1-$width) *2*4/1024 " | bc)
124 local total_size=$(echo "scale=2; $tree_size * 2 * $thread " | bc)
127 k_log "The k-tree size is $tree_size M, the total free space reqirements is about $total_size M."
/third_party/ffmpeg/libavcodec/
Dxxan.c87 int tree_size, eof; in xan_unpack_luma() local
94 tree_size = bytestream2_get_byte(&s->gb); in xan_unpack_luma()
96 tree_root = eof + tree_size; in xan_unpack_luma()
97 bytestream2_skip(&s->gb, tree_size * 2); in xan_unpack_luma()
/third_party/skia/third_party/externals/libwebp/
DChangeLog3668 …nd related functions CompareHuffmanTrees() and SetBitDepths()): - Move 'tree_size' initialization …
3672 …nd related functions CompareHuffmanTrees() and SetBitDepths()): - Move 'tree_size' initialization …