| /external/brotli/c/enc/ |
| D | entropy_encode.c | 167 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 …]
|
| 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 | 160 icp_entry_->log_root_descriptor.tree_size = 3; in SetUp()
305 uint64_t tree_size; in TEST_F() local
311 tree_size = 8; in TEST_F()
326 leaf_index, tree_size, proof, 3, leaf_hash, AVB_AFTL_HASH_SIZE, hash); in TEST_F()
332 tree_size = 8; in TEST_F()
347 leaf_index, tree_size, proof, 3, leaf_hash, AVB_AFTL_HASH_SIZE, hash); in TEST_F()
353 tree_size = 3; in TEST_F()
360 leaf_index, tree_size, proof, 1, leaf_hash, AVB_AFTL_HASH_SIZE, hash); in TEST_F()
366 tree_size = 5; in TEST_F()
381 leaf_index, tree_size, proof, 3, leaf_hash, AVB_AFTL_HASH_SIZE, hash); in TEST_F()
|
| D | avb_aftl_util_unittest.cc | 94 EXPECT_GT(icp_entry->log_root_descriptor.tree_size, 0ull); in TestAftlIcpEntry()
|
| D | avb_util_unittest.cc | 179 h.tree_size = htobe64(n64); in TEST_F()
203 EXPECT_EQ(n64, s.tree_size); in TEST_F()
|
| D | avbtool_unittest.cc | 1183 EXPECT_EQ(16384UL, d.tree_size); in AddHashtreeFooterTest()
1205 size_t zht_ht_end = zht_ht_begin + d.tree_size; in AddHashtreeFooterTest()
1478 EXPECT_EQ(16384UL, d.tree_size); in AddHashtreeFooterFECTest()
1502 size_t zht_ht_end = zht_ht_begin + d.tree_size; in AddHashtreeFooterFECTest()
|
| /external/llvm-project/lldb/examples/scripting/ |
| D | tree_utils.py | 79 def tree_size(root): function
94 left_size = tree_size(root.GetChildAtIndex(1))
95 right_size = tree_size(root.GetChildAtIndex(2))
|
| /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 | 200 def root_from_icp(leaf_index, tree_size, proof, leaf_hash): argument
217 if tree_size < 0:
218 raise AftlError('Invalid tree_size value: {}'.format(tree_size))
219 if leaf_index >= tree_size:
221 raise AftlError(err_str.format(leaf_index, tree_size))
228 inner = (leaf_index ^ (tree_size - 1)).bit_length()
497 self.log_root_descriptor.tree_size,
669 (self.version, self.tree_size, self.root_hash_size) = struct.unpack(
693 self.tree_size = 0
732 self.version, self.tree_size, self.root_hash_size,
[all …]
|
| D | aftltool.py | 200 def root_from_icp(leaf_index, tree_size, proof, leaf_hash): argument
217 if tree_size < 0:
218 raise AftlError('Invalid tree_size value: {}'.format(tree_size))
219 if leaf_index >= tree_size:
221 raise AftlError(err_str.format(leaf_index, tree_size))
228 inner = (leaf_index ^ (tree_size - 1)).bit_length()
497 self.log_root_descriptor.tree_size,
669 (self.version, self.tree_size, self.root_hash_size) = struct.unpack(
693 self.tree_size = 0
732 self.version, self.tree_size, self.root_hash_size,
[all …]
|
| D | avbtool.py | 1394 self.tree_offset, self.tree_size, self.data_block_size,
1427 self.tree_size = 0
1452 o.write(' Tree Size: {} bytes\n'.format(self.tree_size))
1480 self.tree_offset, self.tree_size, self.data_block_size,
1514 (hash_level_offsets, tree_size) = calc_hash_level_offsets(
1521 tree_size)
1529 hash_tree_ondisk = image.read(self.tree_size)
1530 is_zeroed = (self.tree_size == 0) or (hash_tree_ondisk[0:8] == b'ZeRoHaSH')
2252 new_image_size = desc.tree_offset + desc.tree_size
2291 zero_ht_num_bytes = ht_desc.tree_size
[all …]
|
| D | avbtool | 1394 self.tree_offset, self.tree_size, self.data_block_size,
1427 self.tree_size = 0
1452 o.write(' Tree Size: {} bytes\n'.format(self.tree_size))
1480 self.tree_offset, self.tree_size, self.data_block_size,
1514 (hash_level_offsets, tree_size) = calc_hash_level_offsets(
1521 tree_size)
1529 hash_tree_ondisk = image.read(self.tree_size)
1530 is_zeroed = (self.tree_size == 0) or (hash_tree_ondisk[0:8] == b'ZeRoHaSH')
2252 new_image_size = desc.tree_offset + desc.tree_size
2291 zero_ht_num_bytes = ht_desc.tree_size
[all …]
|
| D | aftltool_test.py | 185 self.test_sth_1.tree_size = 2
261 self.test_sth_2.tree_size = 4
955 self.assertEqual(d.tree_size, 0)
967 self.assertEqual(d.tree_size, 741)
1035 d.tree_size = -1
|
| /external/tensorflow/tensorflow/core/ops/compat/ops_history_v1/ |
| D | TensorForestTreeSize.pbtxt | 8 name: "tree_size"
|
| /external/tensorflow/tensorflow/core/ops/compat/ops_history_v2/ |
| 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/libavb_aftl/ |
| D | avb_aftl_util.h | 95 uint64_t tree_size, /* The size of the Merkle tree. */
|
| D | avb_aftl_validate.c | 71 icp_entry->log_root_descriptor.tree_size, in avb_aftl_verify_icp_root_hash()
|
| D | avb_aftl_types.h | 112 uint64_t tree_size; member
|
| D | avb_aftl_util.c | 230 uint64_t tree_size, in avb_aftl_root_from_icp() argument
250 64 - avb_aftl_count_leading_zeros(leaf_index ^ (tree_size - 1)); in avb_aftl_root_from_icp()
378 &(icp_entry->log_root_descriptor.tree_size), aftl_blob, blob_end)) { in parse_trillian_log_root_descriptor()
|
| /external/avb/proto/ |
| D | trillian.proto | 242 // uint64 tree_size;
258 // | ver=1 | tree_size |len| root_hashlen |
|
| /external/llvm-project/lldb/docs/use/ |
| D | python.rst | 577 def tree_size(root):
592 left_size = tree_size(root.GetChildAtIndex(1))
593 right_size = tree_size(root.GetChildAtIndex(2))
|
| /external/tensorflow/tensorflow/go/op/ |
| D | wrappers.go | 32660 func TensorForestTreeSize(scope *Scope, tree_handle tf.Output) (tree_size tf.Output) {
|