| /external/brotli/c/enc/ |
| D | entropy_encode.c | 165 size_t* tree_size, in BrotliWriteHuffmanTreeRepetitions() argument
170 tree[*tree_size] = value; in BrotliWriteHuffmanTreeRepetitions()
171 extra_bits_data[*tree_size] = 0; in BrotliWriteHuffmanTreeRepetitions()
172 ++(*tree_size); in BrotliWriteHuffmanTreeRepetitions()
176 tree[*tree_size] = value; in BrotliWriteHuffmanTreeRepetitions()
177 extra_bits_data[*tree_size] = 0; in BrotliWriteHuffmanTreeRepetitions()
178 ++(*tree_size); in BrotliWriteHuffmanTreeRepetitions()
184 tree[*tree_size] = value; in BrotliWriteHuffmanTreeRepetitions()
185 extra_bits_data[*tree_size] = 0; in BrotliWriteHuffmanTreeRepetitions()
186 ++(*tree_size); in BrotliWriteHuffmanTreeRepetitions()
[all …]
|
| D | entropy_encode.h | 70 size_t* tree_size,
|
| /external/webp/src/utils/ |
| D | huffman_encode_utils.c | 192 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/test/ |
| D | avb_aftl_validate_unittest.cc | 89 icp_entry_->log_root_descriptor.tree_size = 3; in SetUp()
200 uint64_t tree_size; in TEST_F() local
206 tree_size = 8; in TEST_F()
221 leaf_index, tree_size, proof, 3, leaf_hash, AVB_AFTL_HASH_SIZE, hash); in TEST_F()
227 tree_size = 8; in TEST_F()
242 leaf_index, tree_size, proof, 3, leaf_hash, AVB_AFTL_HASH_SIZE, hash); in TEST_F()
248 tree_size = 3; in TEST_F()
255 leaf_index, tree_size, proof, 1, leaf_hash, AVB_AFTL_HASH_SIZE, hash); in TEST_F()
261 tree_size = 5; in TEST_F()
276 leaf_index, tree_size, proof, 3, leaf_hash, AVB_AFTL_HASH_SIZE, hash); in TEST_F()
|
| D | avb_aftl_util_unittest.cc | 103 EXPECT_GT(icp_entry->log_root_descriptor.tree_size, 0ull); in TestAftlIcpEntry()
|
| D | avb_util_unittest.cc | 180 h.tree_size = htobe64(n64); in TEST_F()
204 EXPECT_EQ(n64, s.tree_size); in TEST_F()
|
| D | avbtool_unittest.cc | 1114 EXPECT_EQ(16384UL, d.tree_size); in AddHashtreeFooterTest()
1136 size_t zht_ht_end = zht_ht_begin + d.tree_size; in AddHashtreeFooterTest()
1395 EXPECT_EQ(16384UL, d.tree_size); in AddHashtreeFooterFECTest()
1419 size_t zht_ht_end = zht_ht_begin + d.tree_size; in AddHashtreeFooterFECTest()
|
| /external/avb/libavb_aftl/ |
| D | avb_aftl_util.c | 62 uint64_t tree_size; in avb_aftl_hash_log_root_descriptor() local
108 tree_size = avb_be64toh(icp_entry->log_root_descriptor.tree_size); in avb_aftl_hash_log_root_descriptor()
109 avb_memcpy(lrd_offset, &tree_size, sizeof(uint64_t)); in avb_aftl_hash_log_root_descriptor()
329 uint64_t tree_size, in avb_aftl_root_from_icp() argument
349 64 - avb_aftl_count_leading_zeros(leaf_index ^ (tree_size - 1)); in avb_aftl_root_from_icp()
420 avb_memcpy(&(icp_entry->log_root_descriptor.tree_size), in parse_trillian_log_root_descriptor()
422 avb_aftl_member_size(TrillianLogRootDescriptor, tree_size)); in parse_trillian_log_root_descriptor()
423 icp_entry->log_root_descriptor.tree_size = in parse_trillian_log_root_descriptor()
424 avb_be64toh(icp_entry->log_root_descriptor.tree_size); in parse_trillian_log_root_descriptor()
425 *aftl_blob += avb_aftl_member_size(TrillianLogRootDescriptor, tree_size); in parse_trillian_log_root_descriptor()
[all …]
|
| D | avb_aftl_util.h | 95 uint64_t tree_size, /* The size of the Merkle tree. */
|
| D | avb_aftl_types.h | 122 uint64_t tree_size; member
|
| D | avb_aftl_validate.c | 81 icp_entry->log_root_descriptor.tree_size, in avb_aftl_verify_icp_root_hash()
|
| /external/u-boot/lib/libavb/ |
| D | avb_hashtree_descriptor.c | 27 dest->tree_size = avb_be64toh(dest->tree_size); in avb_hashtree_descriptor_validate_and_byteswap()
|
| D | avb_hashtree_descriptor.h | 52 uint64_t tree_size; member
|
| /external/avb/libavb/ |
| D | avb_hashtree_descriptor.c | 46 dest->tree_size = avb_be64toh(dest->tree_size); in avb_hashtree_descriptor_validate_and_byteswap()
|
| D | avb_hashtree_descriptor.h | 71 uint64_t tree_size; member
|
| /external/avb/ |
| D | aftltool | 196 def root_from_icp(leaf_index, tree_size, proof, leaf_hash): argument
213 if tree_size < 0:
214 raise AftlError('Invalid tree_size value: {}'.format(tree_size))
215 if leaf_index >= tree_size:
217 raise AftlError(err_str.format(leaf_index, tree_size))
224 inner = (leaf_index ^ (tree_size - 1)).bit_length()
497 self.log_root_descriptor.tree_size,
679 (self.version, self.tree_size, self.root_hash_size) = struct.unpack(
703 self.tree_size = 0
742 self.version, self.tree_size, self.root_hash_size,
[all …]
|
| D | aftltool.py | 196 def root_from_icp(leaf_index, tree_size, proof, leaf_hash): argument
213 if tree_size < 0:
214 raise AftlError('Invalid tree_size value: {}'.format(tree_size))
215 if leaf_index >= tree_size:
217 raise AftlError(err_str.format(leaf_index, tree_size))
224 inner = (leaf_index ^ (tree_size - 1)).bit_length()
497 self.log_root_descriptor.tree_size,
679 (self.version, self.tree_size, self.root_hash_size) = struct.unpack(
703 self.tree_size = 0
742 self.version, self.tree_size, self.root_hash_size,
[all …]
|
| D | avbtool.py | 1329 self.tree_offset, self.tree_size, self.data_block_size,
1358 self.tree_size = 0
1380 o.write(' Tree Size: {} bytes\n'.format(self.tree_size))
1409 self.tree_offset, self.tree_size, self.data_block_size,
1443 (hash_level_offsets, tree_size) = calc_hash_level_offsets(
1450 tree_size)
1458 hash_tree_ondisk = image.read(self.tree_size)
1459 is_zeroed = (self.tree_size == 0) or (hash_tree_ondisk[0:8] == 'ZeRoHaSH')
2173 new_image_size = desc.tree_offset + desc.tree_size
2215 zero_ht_num_bytes = ht_desc.tree_size
[all …]
|
| D | avbtool | 1329 self.tree_offset, self.tree_size, self.data_block_size,
1358 self.tree_size = 0
1380 o.write(' Tree Size: {} bytes\n'.format(self.tree_size))
1409 self.tree_offset, self.tree_size, self.data_block_size,
1443 (hash_level_offsets, tree_size) = calc_hash_level_offsets(
1450 tree_size)
1458 hash_tree_ondisk = image.read(self.tree_size)
1459 is_zeroed = (self.tree_size == 0) or (hash_tree_ondisk[0:8] == 'ZeRoHaSH')
2173 new_image_size = desc.tree_offset + desc.tree_size
2215 zero_ht_num_bytes = ht_desc.tree_size
[all …]
|
| D | aftltool_test.py | 84 self.test_sth_1.tree_size = 2
136 self.test_sth_2.tree_size = 4
859 self.assertEqual(d.tree_size, 0)
871 self.assertEqual(d.tree_size, 741)
939 d.tree_size = -1
|
| /external/tensorflow/tensorflow/core/ops/compat/ops_history_v1/ |
| D | TensorForestTreeSize.pbtxt | 8 name: "tree_size"
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_TensorForestTreeSize.pbtxt | 11 name: "tree_size"
|
| /external/avb/proto/ |
| D | trillian.proto | 242 // uint64 tree_size;
258 // | ver=1 | tree_size |len| root_hashlen |
|
| /external/tensorflow/tensorflow/go/op/ |
| D | wrappers.go | 30416 func TensorForestTreeSize(scope *Scope, tree_handle tf.Output) (tree_size tf.Output) {
|
| /external/tensorflow/tensorflow/core/ops/ |
| D | ops.pbtxt | 49071 name: "tree_size"
|