| /external/cronet/tot/net/cert/ |
| D | merkle_tree_leaf_unittest.cc | 73 MerkleTreeLeaf leaf; in TEST_F() local
74 ASSERT_TRUE(GetMerkleTreeLeaf(test_cert_.get(), x509_sct_.get(), &leaf)); in TEST_F()
76 EXPECT_EQ(SignedEntryData::LOG_ENTRY_TYPE_X509, leaf.signed_entry.type); in TEST_F()
77 EXPECT_FALSE(leaf.signed_entry.leaf_certificate.empty()); in TEST_F()
78 EXPECT_TRUE(leaf.signed_entry.tbs_certificate.empty()); in TEST_F()
80 EXPECT_EQ(x509_sct_->timestamp, leaf.timestamp); in TEST_F()
81 EXPECT_EQ(x509_sct_->extensions, leaf.extensions); in TEST_F()
85 MerkleTreeLeaf leaf; in TEST_F() local
87 GetMerkleTreeLeaf(test_precert_.get(), precert_sct_.get(), &leaf)); in TEST_F()
89 EXPECT_EQ(SignedEntryData::LOG_ENTRY_TYPE_PRECERT, leaf.signed_entry.type); in TEST_F()
[all …]
|
| D | ct_log_verifier_unittest.cc | 126 size_t leaf; member
198 size_t leaf, in VerifyAuditProof() argument
203 return log.VerifyAuditProof(ct::MerkleAuditProof(leaf, tree_size, proof), in VerifyAuditProof()
223 size_t leaf, in CheckVerifyAuditProof() argument
229 VerifyAuditProof(log, leaf, tree_size, proof, root_hash, leaf_hash)) in CheckVerifyAuditProof()
230 << "proof for leaf " << leaf << " did not pass verification"; in CheckVerifyAuditProof()
232 VerifyAuditProof(log, leaf - 1, tree_size, proof, root_hash, leaf_hash)) in CheckVerifyAuditProof()
235 VerifyAuditProof(log, leaf + 1, tree_size, proof, root_hash, leaf_hash)) in CheckVerifyAuditProof()
238 VerifyAuditProof(log, leaf ^ 2, tree_size, proof, root_hash, leaf_hash)) in CheckVerifyAuditProof()
241 VerifyAuditProof(log, leaf, tree_size * 2, proof, root_hash, leaf_hash)) in CheckVerifyAuditProof()
[all …]
|
| /external/cronet/stable/net/cert/ |
| D | merkle_tree_leaf_unittest.cc | 73 MerkleTreeLeaf leaf; in TEST_F() local
74 ASSERT_TRUE(GetMerkleTreeLeaf(test_cert_.get(), x509_sct_.get(), &leaf)); in TEST_F()
76 EXPECT_EQ(SignedEntryData::LOG_ENTRY_TYPE_X509, leaf.signed_entry.type); in TEST_F()
77 EXPECT_FALSE(leaf.signed_entry.leaf_certificate.empty()); in TEST_F()
78 EXPECT_TRUE(leaf.signed_entry.tbs_certificate.empty()); in TEST_F()
80 EXPECT_EQ(x509_sct_->timestamp, leaf.timestamp); in TEST_F()
81 EXPECT_EQ(x509_sct_->extensions, leaf.extensions); in TEST_F()
85 MerkleTreeLeaf leaf; in TEST_F() local
87 GetMerkleTreeLeaf(test_precert_.get(), precert_sct_.get(), &leaf)); in TEST_F()
89 EXPECT_EQ(SignedEntryData::LOG_ENTRY_TYPE_PRECERT, leaf.signed_entry.type); in TEST_F()
[all …]
|
| D | ct_log_verifier_unittest.cc | 126 size_t leaf; member
198 size_t leaf, in VerifyAuditProof() argument
203 return log.VerifyAuditProof(ct::MerkleAuditProof(leaf, tree_size, proof), in VerifyAuditProof()
223 size_t leaf, in CheckVerifyAuditProof() argument
229 VerifyAuditProof(log, leaf, tree_size, proof, root_hash, leaf_hash)) in CheckVerifyAuditProof()
230 << "proof for leaf " << leaf << " did not pass verification"; in CheckVerifyAuditProof()
232 VerifyAuditProof(log, leaf - 1, tree_size, proof, root_hash, leaf_hash)) in CheckVerifyAuditProof()
235 VerifyAuditProof(log, leaf + 1, tree_size, proof, root_hash, leaf_hash)) in CheckVerifyAuditProof()
238 VerifyAuditProof(log, leaf ^ 2, tree_size, proof, root_hash, leaf_hash)) in CheckVerifyAuditProof()
241 VerifyAuditProof(log, leaf, tree_size * 2, proof, root_hash, leaf_hash)) in CheckVerifyAuditProof()
[all …]
|
| D | cert_verify_proc_builtin_unittest.cc | 389 auto [leaf, root] = CertBuilder::CreateSimpleChain2(); in TEST_F()
397 leaf->SetCrlDistributionPointUrl( in TEST_F()
398 CreateAndServeCrl(&test_server, root.get(), {leaf->GetSerialNumber()})); in TEST_F()
403 scoped_refptr<X509Certificate> chain = leaf->GetX509CertificateChain(); in TEST_F()
426 auto [leaf, intermediate, root] = CertBuilder::CreateSimpleChain3(); in TEST_F()
430 scoped_refptr<X509Certificate> chain = leaf->GetX509CertificateChain(); in TEST_F()
444 auto [leaf, intermediate, root] = CertBuilder::CreateSimpleChain3(); in TEST_F()
465 scoped_refptr<X509Certificate> chain = leaf->GetX509CertificateChain(); in TEST_F()
485 auto [leaf, root] = CertBuilder::CreateSimpleChain2(); in TEST_F()
488 leaf->SetCertificatePolicies({kEVTestCertPolicy}); in TEST_F()
[all …]
|
| /external/jemalloc_new/src/ |
| D | rtree.c | 53 rtree_leaf_dalloc_impl(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *leaf) { in rtree_leaf_dalloc_impl() argument
78 rtree_leaf_elm_t *leaf = in rtree_delete_subtree() local
81 if (leaf != NULL) { in rtree_delete_subtree()
82 rtree_leaf_dalloc(tsdn, rtree, leaf); in rtree_delete_subtree()
135 rtree_leaf_elm_t *leaf = atomic_load_p(elmp, ATOMIC_RELAXED); in rtree_leaf_init() local
136 if (leaf == NULL) { in rtree_leaf_init()
137 leaf = rtree_leaf_alloc(tsdn, rtree, ZU(1) << in rtree_leaf_init()
139 if (leaf == NULL) { in rtree_leaf_init()
147 atomic_store_p(elmp, leaf, ATOMIC_RELEASE); in rtree_leaf_init()
151 return leaf; in rtree_leaf_init()
[all …]
|
| /external/bcc/examples/networking/vlan_learning/ |
| D | vlan_learning.c | 28 struct ifindex_leaf_t *leaf = ingress.lookup(&src_mac); in handle_phys2virt() local
29 if (leaf) { in handle_phys2virt()
30 lock_xadd(&leaf->tx_pkts, 1); in handle_phys2virt()
31 lock_xadd(&leaf->tx_bytes, skb->len); in handle_phys2virt()
33 int out_ifindex = leaf->out_ifindex; in handle_phys2virt()
44 bpf_clone_redirect(skb, leaf->out_ifindex, 0); in handle_phys2virt()
55 struct ifindex_leaf_t *leaf = egress.lookup(&src_ifindex); in handle_virt2phys() local
56 if (leaf) { in handle_virt2phys()
57 lock_xadd(&leaf->tx_pkts, 1); in handle_virt2phys()
58 lock_xadd(&leaf->tx_bytes, skb->len); in handle_virt2phys()
[all …]
|
| /external/bcc/tests/python/ |
| D | test_call1.c | 19 u64 *leaf = stats.lookup(&key); in parse_ether() local
20 if (leaf) (*leaf)++; in parse_ether()
35 u64 *leaf = stats.lookup(&key); in parse_arp() local
36 if (leaf) (*leaf)++; in parse_arp()
47 u64 *leaf = stats.lookup(&key); in parse_ip() local
48 if (leaf) (*leaf)++; in parse_ip()
56 u64 *leaf = stats.lookup(&key); in eop() local
57 if (leaf) (*leaf)++; in eop()
|
| /external/e2fsprogs/lib/ext2fs/ |
| D | nls_utf8.c | 487 utf8leaf_t *leaf;
496 leaf = utf8lookup(data, hangul, s);
497 if (!leaf)
500 leaf_age = utf8agetab[LEAF_GEN(leaf)];
517 utf8leaf_t *leaf;
526 leaf = utf8lookup(data, hangul, s);
527 if (!leaf)
529 leaf_age = utf8agetab[LEAF_GEN(leaf)];
545 utf8leaf_t *leaf;
554 leaf = utf8nlookup(data, hangul, s, len);
[all …]
|
| /external/f2fs-tools/lib/ |
| D | nls_utf8.c | 484 utf8leaf_t *leaf;
493 leaf = utf8lookup(data, hangul, s);
494 if (!leaf)
497 leaf_age = utf8agetab[LEAF_GEN(leaf)];
514 utf8leaf_t *leaf;
523 leaf = utf8lookup(data, hangul, s);
524 if (!leaf)
526 leaf_age = utf8agetab[LEAF_GEN(leaf)];
542 utf8leaf_t *leaf;
551 leaf = utf8nlookup(data, hangul, s, len);
[all …]
|
| /external/grpc-grpc-java/context/src/test/java/io/grpc/ |
| D | PersistentHashArrayMappedTrieTest.java | 38 Leaf<Key, Object> leaf = new Leaf<>(key, value1); in leaf_replace() local
39 Node<Key, Object> ret = leaf.put(key, value2, key.hashCode(), 0); in leaf_replace()
43 assertSame(value1, leaf.get(key, key.hashCode(), 0)); in leaf_replace()
45 assertEquals(1, leaf.size()); in leaf_replace()
55 Leaf<Key, Object> leaf = new Leaf<>(key1, value1); in leaf_collision() local
56 Node<Key, Object> ret = leaf.put(key2, value2, key2.hashCode(), 0); in leaf_collision()
61 assertSame(value1, leaf.get(key1, key1.hashCode(), 0)); in leaf_collision()
62 assertSame(null, leaf.get(key2, key2.hashCode(), 0)); in leaf_collision()
64 assertEquals(1, leaf.size()); in leaf_collision()
74 Leaf<Key, Object> leaf = new Leaf<>(key1, value1); in leaf_insert() local
[all …]
|
| /external/rust/android-crates-io/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_btree_test.cc | 205 CordRepBtree* leaf = CordRepBtree::Create(MakeHexFlat(0)); in MakeLeaf() local
207 leaf = CordRepBtree::Append(leaf, MakeHexFlat(i)); in MakeLeaf()
209 return leaf; in MakeLeaf()
359 auto* leaf = CordRepBtree::Create(flat); in TEST() local
360 EXPECT_THAT(leaf->size(), Eq(1u)); in TEST()
361 EXPECT_THAT(leaf->height(), Eq(0)); in TEST()
362 EXPECT_THAT(leaf->Edges(), ElementsAre(flat)); in TEST()
363 CordRepBtree::Unref(leaf); in TEST()
367 auto* leaf = CordRepBtree::Create(MakeFlat("a")); in TEST() local
368 CordRepBtree* tree = CordRepBtree::New(leaf); in TEST()
[all …]
|
| /external/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_btree_test.cc | 205 CordRepBtree* leaf = CordRepBtree::Create(MakeHexFlat(0)); in MakeLeaf() local
207 leaf = CordRepBtree::Append(leaf, MakeHexFlat(i)); in MakeLeaf()
209 return leaf; in MakeLeaf()
359 auto* leaf = CordRepBtree::Create(flat); in TEST() local
360 EXPECT_THAT(leaf->size(), Eq(1u)); in TEST()
361 EXPECT_THAT(leaf->height(), Eq(0)); in TEST()
362 EXPECT_THAT(leaf->Edges(), ElementsAre(flat)); in TEST()
363 CordRepBtree::Unref(leaf); in TEST()
367 auto* leaf = CordRepBtree::Create(MakeFlat("a")); in TEST() local
368 CordRepBtree* tree = CordRepBtree::New(leaf); in TEST()
[all …]
|
| /external/angle/third_party/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_btree_test.cc | 205 CordRepBtree* leaf = CordRepBtree::Create(MakeHexFlat(0)); in MakeLeaf() local
207 leaf = CordRepBtree::Append(leaf, MakeHexFlat(i)); in MakeLeaf()
209 return leaf; in MakeLeaf()
359 auto* leaf = CordRepBtree::Create(flat); in TEST() local
360 EXPECT_THAT(leaf->size(), Eq(1u)); in TEST()
361 EXPECT_THAT(leaf->height(), Eq(0)); in TEST()
362 EXPECT_THAT(leaf->Edges(), ElementsAre(flat)); in TEST()
363 CordRepBtree::Unref(leaf); in TEST()
367 auto* leaf = CordRepBtree::Create(MakeFlat("a")); in TEST() local
368 CordRepBtree* tree = CordRepBtree::New(leaf); in TEST()
[all …]
|
| /external/cronet/stable/third_party/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_btree_test.cc | 205 CordRepBtree* leaf = CordRepBtree::Create(MakeHexFlat(0)); in MakeLeaf() local
207 leaf = CordRepBtree::Append(leaf, MakeHexFlat(i)); in MakeLeaf()
209 return leaf; in MakeLeaf()
359 auto* leaf = CordRepBtree::Create(flat); in TEST() local
360 EXPECT_THAT(leaf->size(), Eq(1u)); in TEST()
361 EXPECT_THAT(leaf->height(), Eq(0)); in TEST()
362 EXPECT_THAT(leaf->Edges(), ElementsAre(flat)); in TEST()
363 CordRepBtree::Unref(leaf); in TEST()
367 auto* leaf = CordRepBtree::Create(MakeFlat("a")); in TEST() local
368 CordRepBtree* tree = CordRepBtree::New(leaf); in TEST()
[all …]
|
| /external/cronet/tot/third_party/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_btree_test.cc | 205 CordRepBtree* leaf = CordRepBtree::Create(MakeHexFlat(0)); in MakeLeaf() local
207 leaf = CordRepBtree::Append(leaf, MakeHexFlat(i)); in MakeLeaf()
209 return leaf; in MakeLeaf()
359 auto* leaf = CordRepBtree::Create(flat); in TEST() local
360 EXPECT_THAT(leaf->size(), Eq(1u)); in TEST()
361 EXPECT_THAT(leaf->height(), Eq(0)); in TEST()
362 EXPECT_THAT(leaf->Edges(), ElementsAre(flat)); in TEST()
363 CordRepBtree::Unref(leaf); in TEST()
367 auto* leaf = CordRepBtree::Create(MakeFlat("a")); in TEST() local
368 CordRepBtree* tree = CordRepBtree::New(leaf); in TEST()
[all …]
|
| /external/cronet/stable/third_party/llvm-libc/src/src/__support/ |
| D | freetrie.cpp | 22 Node *leaf = node; in remove() local
23 while (leaf->lower || leaf->upper) in remove()
24 leaf = leaf->lower ? leaf->lower : leaf->upper; in remove()
25 if (leaf == node) { in remove()
31 replace_node(leaf, nullptr); in remove()
32 new_node = leaf; in remove()
|
| /external/cronet/tot/third_party/llvm-libc/src/src/__support/ |
| D | freetrie.cpp | 22 Node *leaf = node; in remove() local
23 while (leaf->lower || leaf->upper) in remove()
24 leaf = leaf->lower ? leaf->lower : leaf->upper; in remove()
25 if (leaf == node) { in remove()
31 replace_node(leaf, nullptr); in remove()
32 new_node = leaf; in remove()
|
| /external/llvm-libc/src/__support/ |
| D | freetrie.cpp | 22 Node *leaf = node; in remove() local
23 while (leaf->lower || leaf->upper) in remove()
24 leaf = leaf->lower ? leaf->lower : leaf->upper; in remove()
25 if (leaf == node) { in remove()
31 replace_node(leaf, nullptr); in remove()
32 new_node = leaf; in remove()
|
| /external/bcc/tools/ |
| D | deadlock.c | 77 struct thread_to_held_mutex_leaf_t *leaf = in trace_mutex_acquire() local
79 if (!leaf) { in trace_mutex_acquire()
92 if (leaf->held_mutexes[i].mutex == mutex) { in trace_mutex_acquire()
104 if (!leaf->held_mutexes[i].mutex) { in trace_mutex_acquire()
106 leaf->held_mutexes[i].mutex = mutex; in trace_mutex_acquire()
107 leaf->held_mutexes[i].stack_id = stack_id; in trace_mutex_acquire()
115 edge_key.mutex1 = leaf->held_mutexes[i].mutex; in trace_mutex_acquire()
119 edge_leaf.mutex1_stack_id = leaf->held_mutexes[i].stack_id; in trace_mutex_acquire()
151 struct thread_to_held_mutex_leaf_t *leaf = in trace_mutex_release() local
153 if (!leaf) { in trace_mutex_release()
[all …]
|
| /external/rust/android-crates-io/crates/termtree/src/ |
| D | lib.rs | 63 pub fn push(&mut self, leaf: impl Into<Tree<D>>) -> &mut Self { in push()
64 self.leaves.push(leaf.into()); in push()
94 while let Some((last, leaf, spaces)) = queue.pop_front() { in fmt()
97 leaf.glyphs.last_item in fmt()
99 leaf.glyphs.middle_item in fmt()
101 leaf.glyphs.item_indent, in fmt()
104 if leaf.multiline { in fmt()
107 leaf.glyphs.last_skip in fmt()
109 leaf.glyphs.middle_skip in fmt()
111 leaf.glyphs.skip_indent, in fmt()
[all …]
|
| /external/rust/android-crates-io/crates/mls-rs/src/tree_kem/ |
| D | leaf_node.rs | 356 .map(|(leaf, hpke_secret_key)| (leaf, hpke_secret_key, signature_key)) in get_basic_test_node_capabilities()
393 pub fn get_test_client_identity(leaf: &LeafNode) -> Vec<u8> { in get_test_client_identity()
394 leaf.signing_identity in get_test_client_identity()
496 let (mut leaf, leaf_secret) = in test_node_update_no_meta_changes()
499 let original_leaf = leaf.clone(); in test_node_update_no_meta_changes()
501 let new_secret = leaf in test_node_update_no_meta_changes()
514 assert_ne!(original_leaf.public_key, leaf.public_key); in test_node_update_no_meta_changes()
517 leaf.ungreased_capabilities(), in test_node_update_no_meta_changes()
522 leaf.ungreased_extensions(), in test_node_update_no_meta_changes()
526 assert_eq!(leaf.signing_identity, original_leaf.signing_identity); in test_node_update_no_meta_changes()
[all …]
|
| /external/tensorflow/tensorflow/compiler/xla/service/gpu/ |
| D | outfeed_manager.cc | 49 for (auto& leaf : outfeed_buffers.leaves()) { in TransferLiteralFromOutfeed() local
50 const Shape& shape = ShapeUtil::GetSubshape(literal.shape(), leaf.first); in TransferLiteralFromOutfeed()
52 leaf.second = in TransferLiteralFromOutfeed()
54 leaf.second->set_destination( in TransferLiteralFromOutfeed()
55 std::make_unique<MutableBorrowingLiteral>(literal, leaf.first)); in TransferLiteralFromOutfeed()
65 for (auto& leaf : outfeed_buffers.leaves()) { in TransferLiteralFromOutfeed() local
66 const Shape& shape = ShapeUtil::GetSubshape(literal.shape(), leaf.first); in TransferLiteralFromOutfeed()
68 leaf.second->WaitUntilAvailable(); in TransferLiteralFromOutfeed()
|
| /external/mesa3d/src/intel/compiler/ |
| D | brw_nir_lower_rt_intrinsics.c | 185 struct brw_nir_rt_bvh_instance_leaf_defs leaf; in lower_rt_intrinsics_impl() local
186 brw_nir_rt_load_bvh_instance_leaf(b, &leaf, hit_in.inst_leaf_ptr); in lower_rt_intrinsics_impl()
189 b, world_ray_in.orig, leaf.world_to_object, true); in lower_rt_intrinsics_impl()
197 struct brw_nir_rt_bvh_instance_leaf_defs leaf; in lower_rt_intrinsics_impl() local
198 brw_nir_rt_load_bvh_instance_leaf(b, &leaf, hit_in.inst_leaf_ptr); in lower_rt_intrinsics_impl()
201 b, world_ray_in.dir, leaf.world_to_object, false); in lower_rt_intrinsics_impl()
226 struct brw_nir_rt_bvh_instance_leaf_defs leaf; in lower_rt_intrinsics_impl() local
227 brw_nir_rt_load_bvh_instance_leaf(b, &leaf, hit_in.inst_leaf_ptr); in lower_rt_intrinsics_impl()
228 sysval = leaf.instance_index; in lower_rt_intrinsics_impl()
233 struct brw_nir_rt_bvh_instance_leaf_defs leaf; in lower_rt_intrinsics_impl() local
[all …]
|
| /external/e2fsprogs/util/ |
| D | mkutf8data.c | 381 void *leaf = NULL; in lookup() local
384 while (!leaf && node) { in lookup()
392 leaf = node->right; in lookup()
401 leaf = node->left; in lookup()
408 return leaf; in lookup()
531 static int insert(struct tree *tree, char *key, int keylen, void *leaf) in insert() argument
557 *cursor = leaf; in insert()
575 leaf = node->left; in insert()
580 tree->root = leaf; in insert()
583 parent->left = leaf; in insert()
[all …]
|