Home
last modified time | relevance | path

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

/external/webp/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 …]
/external/avb/libavb/
Davb_hashtree_descriptor.c46 dest->tree_size = avb_be64toh(dest->tree_size); in avb_hashtree_descriptor_validate_and_byteswap()
Davb_hashtree_descriptor.h57 uint64_t tree_size; member
/external/avb/
Davbtool1071 self.tree_offset, self.tree_size, self.data_block_size,
1099 self.tree_size = 0
1120 o.write(' Tree Size: {} bytes\n'.format(self.tree_size))
1148 self.tree_offset, self.tree_size, self.data_block_size,
1686 new_image_size = desc.tree_offset + desc.tree_size
2544 (hash_level_offsets, tree_size) = calc_hash_level_offsets(
2561 tree_size)
2569 ht_desc.tree_size = tree_size
2761 tree_size = 0
2770 tree_size += level_size
[all …]
/external/avb/test/
Davb_util_unittest.cc178 h.tree_size = htobe64(n64); in TEST_F()
202 EXPECT_EQ(n64, s.tree_size); in TEST_F()
Davbtool_unittest.cc815 EXPECT_EQ(16384UL, d.tree_size); in AddHashtreeFooterTest()
1041 EXPECT_EQ(16384UL, d.tree_size); in AddHashtreeFooterFECTest()