Searched refs:tree_size (Results 1 – 18 of 18) sorted by relevance
/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/tensorflow/tensorflow/contrib/boosted_trees/resources/ |
D | decision_tree_ensemble_resource.h | 93 const int32 tree_size = decision_tree_ensemble_->trees_size(); in LastTree() local 94 QCHECK_GT(tree_size, 0); in LastTree() 95 return decision_tree_ensemble_->mutable_trees(tree_size - 1); in LastTree()
|
/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/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/tensorflow/tensorflow/core/api_def/base_api/ |
D | api_def_TensorForestTreeSize.pbtxt | 11 name: "tree_size"
|
/external/avb/ |
D | avbtool | 1282 self.tree_offset, self.tree_size, self.data_block_size, 1311 self.tree_size = 0 1333 o.write(' Tree Size: {} bytes\n'.format(self.tree_size)) 1362 self.tree_offset, self.tree_size, self.data_block_size, 1393 (hash_level_offsets, tree_size) = calc_hash_level_offsets( 1400 tree_size) 1408 hash_tree_ondisk = image.read(self.tree_size) 2076 new_image_size = desc.tree_offset + desc.tree_size 3316 (hash_level_offsets, tree_size) = calc_hash_level_offsets( 3333 tree_size) [all …]
|
/external/tensorflow/tensorflow/contrib/tensor_forest/python/ops/ |
D | model_ops.py | 28 from tensorflow.contrib.tensor_forest.python.ops.gen_model_ops import tree_size
|
/external/avb/test/ |
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 | 1080 EXPECT_EQ(16384UL, d.tree_size); in AddHashtreeFooterTest() 1307 EXPECT_EQ(16384UL, d.tree_size); in AddHashtreeFooterFECTest()
|
/external/tensorflow/tensorflow/contrib/tensor_forest/python/ |
D | tensor_forest.py | 698 return model_ops.tree_size(self.variables.tree)
|
/external/tensorflow/tensorflow/go/op/ |
D | wrappers.go | 3677 func TensorForestTreeSize(scope *Scope, tree_handle tf.Output) (tree_size tf.Output) {
|
/external/tensorflow/tensorflow/core/ops/ |
D | ops.pbtxt | 41364 name: "tree_size"
|
/external/tensorflow/tensorflow/core/ops/compat/ |
D | ops_history.v2.pbtxt | 84216 name: "tree_size"
|
D | ops_history.v1.pbtxt | 84843 name: "tree_size"
|