Home
last modified time | relevance | path

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

/external/libvpx/libvpx/vpx_dsp/
Dprob.h33 #define TREE_SIZE(leaf_count) (2 * (leaf_count)-2) argument
/external/tensorflow/tensorflow/compiler/xla/service/
Dhlo_sharding.cc44 flattened_list.reserve(sub_shardings.leaf_count()); in Tuple()
76 int64 leaf_count = RequiredLeaves(tuple_shape); in SingleTuple() local
78 flattened_list.resize(leaf_count, sharding); in SingleTuple()
Dhlo_sharding_metadata.cc284 TF_RET_CHECK(user_sharding_tree.leaf_count() == 1) in ApplyShardingFromUsers()
304 TF_RET_CHECK(sharding_tree.leaf_count() == 1); in ApplyShardingFromUsers()
Dhlo_parser.cc1726 int leaf_count = ShapeUtil::GetLeafCount(instruction->shape()); in ParseInstructionRhs() local
1729 if (leaf_count != replicated.size()) { in ParseInstructionRhs()
1731 StrCat("parameter has ", leaf_count, in ParseInstructionRhs()
/external/tensorflow/tensorflow/compiler/xla/
Dshape_tree_test.cc122 EXPECT_EQ(0, shape_tree.leaf_count()); in TEST_F()
Dshape_tree.h237 int64 leaf_count() const { return std::distance(leaf_begin(), leaf_end()); } in leaf_count() function
/external/e2fsprogs/lib/blkid/
Dprobe.h557 __u32 leaf_count; member
Dprobe.c1298 leaf_node_count = blkid_be32(bnode->leaf_count); in probe_hfsplus()