Home
last modified time | relevance | path

Searched refs:leaf_index (Results 1 – 16 of 16) sorted by relevance

/external/avb/test/
Davb_aftl_validate_unittest.cc243 icp_entry_->leaf_index = 2; in SetUp()
304 uint64_t leaf_index; in TEST_F() local
310 leaf_index = 0; in TEST_F()
326 leaf_index, tree_size, proof, 3, leaf_hash, AVB_AFTL_HASH_SIZE, hash); in TEST_F()
331 leaf_index = 5; in TEST_F()
347 leaf_index, tree_size, proof, 3, leaf_hash, AVB_AFTL_HASH_SIZE, hash); in TEST_F()
352 leaf_index = 2; in TEST_F()
360 leaf_index, tree_size, proof, 1, leaf_hash, AVB_AFTL_HASH_SIZE, hash); in TEST_F()
365 leaf_index = 1; in TEST_F()
381 leaf_index, tree_size, proof, 3, leaf_hash, AVB_AFTL_HASH_SIZE, hash); in TEST_F()
Davb_aftl_util_unittest.cc84 EXPECT_GT(icp_entry->leaf_index, 1ul); in TestAftlIcpEntry()
/external/avb/libavb_aftl/
Davb_aftl_util.h85 uint64_t leaf_index, /* The current Merkle tree leaf index. */
94 uint64_t leaf_index, /* The leaf index in the Merkle tree.*/
Davb_aftl_util.c156 uint64_t leaf_index, in avb_aftl_chain_inner() argument
172 if ((leaf_index >> i & 1) == 0) { in avb_aftl_chain_inner()
229 bool avb_aftl_root_from_icp(uint64_t leaf_index, 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()
286 leaf_index, in avb_aftl_root_from_icp()
645 if (!read_u64(&(icp_entry->leaf_index), aftl_blob, blob_end)) { in parse_icp_entry()
Davb_aftl_validate.c70 if (!avb_aftl_root_from_icp(icp_entry->leaf_index, in avb_aftl_verify_icp_root_hash()
Davb_aftl_types.h172 uint64_t leaf_index; member
/external/avb/
Daftltool181 def chain_inner(seed, proof, leaf_index): argument
193 if leaf_index >> i & 1 == 0:
200 def root_from_icp(leaf_index, tree_size, proof, leaf_hash): argument
215 if leaf_index < 0:
216 raise AftlError('Invalid leaf_index value: {}'.format(leaf_index))
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()
229 result = chain_inner(leaf_hash, proof[:inner], leaf_index)
392 self.leaf_index,
[all …]
Daftltool.py181 def chain_inner(seed, proof, leaf_index): argument
193 if leaf_index >> i & 1 == 0:
200 def root_from_icp(leaf_index, tree_size, proof, leaf_hash): argument
215 if leaf_index < 0:
216 raise AftlError('Invalid leaf_index value: {}'.format(leaf_index))
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()
229 result = chain_inner(leaf_hash, proof[:inner], leaf_index)
392 self.leaf_index,
[all …]
Daftltool_test.py234 self.test_entry_1.leaf_index = 1
287 self.test_entry_2.leaf_index = 2
323 self.test_avbm_resp.annotation_proof.proof.leaf_index = 9127
630 old_leaf_index = d.icp_entries[0].leaf_index
631 d.icp_entries[0].leaf_index = -10
633 d.icp_entries[0].leaf_index = old_leaf_index
753 self.assertEqual(entry.leaf_index, 0)
768 self.assertEqual(entry.leaf_index, 1)
798 entry.leaf_index = 2
806 entry.leaf_index = -1
[all …]
/external/tensorflow/tensorflow/compiler/xla/service/
Dhlo_replication_analysis.cc349 int leaf_index = 0; in ComputeHloReplication() local
355 if (replication && replication->at(leaf_index)) { in ComputeHloReplication()
358 ++leaf_index; in ComputeHloReplication()
Dbfloat16_normalization.cc133 hlo, [&](HloInstruction* leaf, const ShapeIndex& leaf_index, in ConvertType()
136 ShapeUtil::GetSubshape(hlo->shape(), leaf_index); in ConvertType()
189 hlo, [&](HloInstruction* leaf, const ShapeIndex& leaf_index, in ChangeOutputTypeThenInsertConvertBack()
192 ShapeUtil::GetSubshape(original_shape, leaf_index); in ChangeOutputTypeThenInsertConvertBack()
Dbfloat16_propagation.cc763 [hlo](HloInstruction* leaf, const ShapeIndex& leaf_index, in ResolveInconsistentFusions()
766 ShapeUtil::GetSubshape(hlo->shape(), leaf_index); in ResolveInconsistentFusions()
862 operand, [](HloInstruction* leaf, const ShapeIndex& leaf_index, in Run()
927 inst, [&](HloInstruction* leaf, const ShapeIndex& leaf_index, in Run()
931 inst->mutable_shape(), leaf_index))) { in Run()
Dhlo_computation.cc755 HloInstruction*(HloInstruction* leaf, const ShapeIndex& leaf_index, in DeepCopyHelper() argument
804 HloInstruction* leaf, const ShapeIndex& leaf_index, in DeepCopyInstruction()
806 if (indices_to_copy == nullptr || indices_to_copy->element(leaf_index)) { in DeepCopyInstruction()
810 *copies_added->mutable_element(leaf_index) = copy; in DeepCopyInstruction()
824 HloInstruction*(HloInstruction* leaf, const ShapeIndex& leaf_index, in DeepCopyInstructionWithCustomCopier() argument
Dhlo_computation.h306 HloInstruction*(HloInstruction* leaf, const ShapeIndex& leaf_index,
521 HloInstruction*(HloInstruction* leaf, const ShapeIndex& leaf_index,
/external/avb/proto/
Dtrillian.proto310 // leaf_index indicates the requested leaf index when this message is used for
313 int64 leaf_index = 1; field
/external/e2fsprogs/util/
Dmkutf8data.c353 int *(*leaf_index)(struct tree *, void *); member
980 *tree->leaf_index(tree, node->left) = in index_nodes()
995 *tree->leaf_index(tree, node->right) = index; in index_nodes()
1121 offset = *tree->leaf_index(tree, node->right); in size_nodes()
1659 trees[i].leaf_index = nfkdicf_index; in trees_init()
1666 trees[i+1].leaf_index = nfkdi_index; in trees_init()