Home
last modified time | relevance | path

Searched refs:leaf (Results 1 - 25 of 64) sorted by relevance

123

/third_party/f2fs-tools/lib/
H A Dnls_utf8.c220 * node, otherwise it is a leaf node
245 * leaf[0]: The unicode version, stored as a generation number that is
249 * leaf[1]: Canonical Combining Class. During normalization, we need
257 * leaf[2]: Decomposition. If leaf[1] == 255, then leaf[2] is the
289 /* Size of the synthesized leaf used for Hangul syllable decomposition. */
364 /* Fill in base of leaf. */ in utf8hangul()
388 * Returns the leaf if one exists, NULL otherwise.
466 * Returns the leaf i
735 utf8leaf_t *leaf; utf8byte() local
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcord_rep_btree_test.cc164 // Recursively collects all leaf edges from `tree` and appends them to `edges`.
177 // Recursively collects and returns all leaf edges from `tree`.
192 CordRepBtree* leaf = CordRepBtree::Create(MakeHexFlat(0)); in MakeLeaf() local
194 leaf = CordRepBtree::Append(leaf, MakeHexFlat(i)); in MakeLeaf()
196 return leaf; in MakeLeaf()
351 auto* leaf = CordRepBtree::Create(flat); in TEST() local
352 EXPECT_THAT(leaf->size(), Eq(1)); in TEST()
353 EXPECT_THAT(leaf->height(), Eq(0)); in TEST()
354 EXPECT_THAT(leaf in TEST()
359 auto* leaf = CordRepBtree::Create(MakeFlat("a")); TEST() local
371 auto* leaf = CordRepBtree::Create(flats.back()); TEST_P() local
374 refs.RefIf(shared(), leaf); TEST_P() local
389 auto* leaf = CordRepBtree::Create(flats.front()); TEST_P() local
392 refs.RefIf(shared(), leaf); TEST_P() local
410 auto* leaf = CordRepBtree::Create(flats.front()); TEST_P() local
413 refs.RefIf(shared(), leaf); TEST_P() local
432 auto* leaf = MakeLeaf(); TEST_P() local
433 refs.RefIf(shared(), leaf); TEST_P() local
446 auto* leaf = MakeLeaf(); TEST_P() local
447 refs.RefIf(shared(), leaf); TEST_P() local
795 CordRepBtree* leaf = CordRepBtree::Create(MakeFlat("abc")); TEST() local
825 CordRepBtree* leaf = CordRepBtree::Create(MakeFlat(consumer.Next(3))); TEST_P() local
827 refs.RefIf(shared(), leaf); TEST_P() local
928 CordRepBtree* leaf = CordRepBtree::Create(MakeFlat("abc")); TEST_P() local
929 refs.RefIf(shared(), leaf); TEST_P() local
982 CordRepBtree* leaf = CordRepBtree::Create(MakeFlat("Hello world")); TEST_P() local
983 refs.RefIf(shared(), leaf); TEST_P() local
1020 CordRepBtree* leaf = CordRepBtree::Create(MakeFlat("Hello world")); TEST_P() local
1251 CordRepBtree* leaf = CordRepBtree::Create(MakeFlat("abc")); TEST() local
[all...]
H A Dcord_rep_btree.cc172 // Deletes a leaf node data edge. Requires `rep` to be an EXTERNAL or FLAT
194 // (leg) down to the leaf level of a btree, and 'unwind' / 'Finalize' methods to
281 // 'single leaf' (`depth` == 0) and 'single depth' (`depth` == 1) cases in Unwind()
467 CordRepBtree* leaf = ops.BuildStack(tree, depth); in AddCordRep() local
469 leaf->AddEdge<edge_type>(ops.owned(depth), rep, length); in AddCordRep()
476 CordRepBtree* leaf = CordRepBtree::New(0); in NewLeaf() local
479 const size_t cap = leaf->capacity(); in NewLeaf()
484 leaf->edges_[end++] = flat; in NewLeaf()
487 leaf->length = length; in NewLeaf()
488 leaf in NewLeaf()
495 CordRepBtree* leaf = CordRepBtree::New(0); NewLeaf() local
552 CordRepBtree* leaf = ops.BuildStack(tree, depth); AddData() local
[all...]
/third_party/mesa3d/src/intel/compiler/
H A Dbrw_nir_lower_rt_intrinsics.c202 struct brw_nir_rt_bvh_instance_leaf_defs leaf; in lower_rt_intrinsics_impl() local
203 brw_nir_rt_load_bvh_instance_leaf(b, &leaf, hit_in.inst_leaf_ptr); in lower_rt_intrinsics_impl()
204 sysval = leaf.instance_index; in lower_rt_intrinsics_impl()
209 struct brw_nir_rt_bvh_instance_leaf_defs leaf; in lower_rt_intrinsics_impl() local
210 brw_nir_rt_load_bvh_instance_leaf(b, &leaf, hit_in.inst_leaf_ptr); in lower_rt_intrinsics_impl()
211 sysval = leaf.object_to_world[nir_intrinsic_column(intrin)]; in lower_rt_intrinsics_impl()
216 struct brw_nir_rt_bvh_instance_leaf_defs leaf; in lower_rt_intrinsics_impl() local
217 brw_nir_rt_load_bvh_instance_leaf(b, &leaf, hit_in.inst_leaf_ptr); in lower_rt_intrinsics_impl()
218 sysval = leaf.world_to_object[nir_intrinsic_column(intrin)]; in lower_rt_intrinsics_impl()
245 struct brw_nir_rt_bvh_instance_leaf_defs leaf; in lower_rt_intrinsics_impl() local
[all...]
H A Dbrw_nir_lower_ray_queries.c394 struct brw_nir_rt_bvh_instance_leaf_defs leaf; in lower_ray_query_intrinsic() local
395 brw_nir_rt_load_bvh_instance_leaf(b, &leaf, hit_in.inst_leaf_ptr); in lower_ray_query_intrinsic()
396 sysval = leaf.instance_id; in lower_ray_query_intrinsic()
401 struct brw_nir_rt_bvh_instance_leaf_defs leaf; in lower_ray_query_intrinsic() local
402 brw_nir_rt_load_bvh_instance_leaf(b, &leaf, hit_in.inst_leaf_ptr); in lower_ray_query_intrinsic()
403 sysval = leaf.instance_index; in lower_ray_query_intrinsic()
408 struct brw_nir_rt_bvh_instance_leaf_defs leaf; in lower_ray_query_intrinsic() local
409 brw_nir_rt_load_bvh_instance_leaf(b, &leaf, hit_in.inst_leaf_ptr); in lower_ray_query_intrinsic()
410 sysval = leaf.contribution_to_hit_group_index; in lower_ray_query_intrinsic()
443 struct brw_nir_rt_bvh_instance_leaf_defs leaf; in lower_ray_query_intrinsic() local
450 struct brw_nir_rt_bvh_instance_leaf_defs leaf; lower_ray_query_intrinsic() local
[all...]
/third_party/ltp/testcases/kernel/mce-test/stress/tools/fs-metadata/
H A Dk-tree-gen.c45 * return val: if it is leaf, return 0, or return 1
51 char dir[MAX_PATH], cwd[MAX_PATH], leaf[MAX_PATH]; in k_tree_gen() local
59 sprintf(leaf, "%d-f", cnt); in k_tree_gen()
63 fd = open(leaf, O_CREAT | O_RDWR); in k_tree_gen()
67 write(fd, leaf, 3); in k_tree_gen()
69 read(fd, leaf, 3); in k_tree_gen()
/third_party/node/deps/openssl/openssl/crypto/
H A Dsparse_array.c66 void (*leaf)(ossl_uintmax_t, void *, void *), void *arg) in sa_doall()
92 } else if (leaf != NULL) { in sa_doall()
93 (*leaf)(idx, p[n], arg); in sa_doall()
134 void ossl_sa_doall(const OPENSSL_SA *sa, void (*leaf)(ossl_uintmax_t, void *)) in ossl_sa_doall() argument
138 tramp.func = leaf; in ossl_sa_doall()
144 void (*leaf)(ossl_uintmax_t, void *, void *), in ossl_sa_doall_arg()
148 sa_doall(sa, NULL, leaf, arg); in ossl_sa_doall_arg()
65 sa_doall(const OPENSSL_SA *sa, void (*node)(void **), void (*leaf)(ossl_uintmax_t, void *, void *), void *arg) sa_doall() argument
143 ossl_sa_doall_arg(const OPENSSL_SA *sa, void (*leaf)(ossl_uintmax_t, void *, void *), void *arg) ossl_sa_doall_arg() argument
/third_party/openssl/crypto/
H A Dsparse_array.c66 void (*leaf)(ossl_uintmax_t, void *, void *), void *arg) in sa_doall()
92 } else if (leaf != NULL) { in sa_doall()
93 (*leaf)(idx, p[n], arg); in sa_doall()
134 void ossl_sa_doall(const OPENSSL_SA *sa, void (*leaf)(ossl_uintmax_t, void *)) in ossl_sa_doall() argument
138 tramp.func = leaf; in ossl_sa_doall()
144 void (*leaf)(ossl_uintmax_t, void *, void *), in ossl_sa_doall_arg()
148 sa_doall(sa, NULL, leaf, arg); in ossl_sa_doall_arg()
65 sa_doall(const OPENSSL_SA *sa, void (*node)(void **), void (*leaf)(ossl_uintmax_t, void *, void *), void *arg) sa_doall() argument
143 ossl_sa_doall_arg(const OPENSSL_SA *sa, void (*leaf)(ossl_uintmax_t, void *, void *), void *arg) ossl_sa_doall_arg() argument
/third_party/node/deps/openssl/openssl/include/crypto/
H A Dsparse_array.h47 void (*leaf)(ossl_uintmax_t, type *)) \
50 (void (*)(ossl_uintmax_t, void *))leaf); \
54 void (*leaf)(ossl_uintmax_t, type *, void *), \
58 (void (*)(ossl_uintmax_t, void *, void *))leaf, arg); \
83 void ossl_sa_doall(const OPENSSL_SA *sa, void (*leaf)(ossl_uintmax_t, void *));
85 void (*leaf)(ossl_uintmax_t, void *, void *), void *);
/third_party/openssl/include/crypto/
H A Dsparse_array.h47 void (*leaf)(ossl_uintmax_t, type *)) \
50 (void (*)(ossl_uintmax_t, void *))leaf); \
54 void (*leaf)(ossl_uintmax_t, type *, void *), \
58 (void (*)(ossl_uintmax_t, void *, void *))leaf, arg); \
83 void ossl_sa_doall(const OPENSSL_SA *sa, void (*leaf)(ossl_uintmax_t, void *));
85 void (*leaf)(ossl_uintmax_t, void *, void *), void *);
/third_party/protobuf/java/core/src/test/java/com/google/protobuf/
H A DIsValidUtf8Test.java135 ByteString leaf = factory.newByteString(realBytes); in assertValidUtf8()
136 ByteString sub = leaf.substring(0, bytes.length); in assertValidUtf8()
137 assertTrue(not ^ leaf.isValidUtf8()); in assertValidUtf8()
140 RopeByteString.newInstanceForTest(ByteString.EMPTY, leaf), in assertValidUtf8()
142 RopeByteString.newInstanceForTest(leaf, ByteString.EMPTY), in assertValidUtf8()
144 RopeByteString.newInstanceForTest(sub, leaf) in assertValidUtf8()
/third_party/node/deps/ngtcp2/ngtcp2/lib/
H A Dngtcp2_ksl.c89 head->leaf = 1; in ksl_head_init()
104 if (!blk->leaf) { in ksl_free_blk()
150 rblk->leaf = blk->leaf; in ksl_split_blk()
228 nhead->leaf = 0; in ksl_split_head()
305 if (blk->leaf) { in ngtcp2_ksl_insert()
323 for (; !blk->leaf;) { in ngtcp2_ksl_insert()
536 if (!blk->leaf && blk->n == 2 && in ngtcp2_ksl_remove()
552 if (blk->leaf) { in ngtcp2_ksl_remove()
619 if (blk->leaf) { in ngtcp2_ksl_lower_bound()
[all...]
/third_party/node/deps/ngtcp2/nghttp3/lib/
H A Dnghttp3_ksl.c90 head->leaf = 1; in ksl_head_init()
105 if (!blk->leaf) { in ksl_free_blk()
151 rblk->leaf = blk->leaf; in ksl_split_blk()
231 nhead->leaf = 0; in ksl_split_head()
311 if (blk->leaf) { in nghttp3_ksl_insert()
329 for (; !blk->leaf;) { in nghttp3_ksl_insert()
544 if (!blk->leaf && blk->n == 2 && in nghttp3_ksl_remove()
560 if (blk->leaf) { in nghttp3_ksl_remove()
627 if (blk->leaf) { in nghttp3_ksl_lower_bound()
[all...]
/third_party/node/deps/npm/node_modules/@sigstore/verify/dist/timestamp/
H A Dtsa.js40 const [leaf, ...cas] = ca.certChain;
41 const signingKey = core_1.crypto.createPublicKey(leaf.publicKey);
46 untrustedCert: leaf,
68 // Filters the list of CAs to those which have a leaf signing certificate which
/third_party/libabigail/tests/data/test-diff-filter/
H A Dtest42-leaf-report-v0.cc2 // g++ -shared -g -o libtest42-leaf-report-v0.so test42-leaf-report-v0.cc
4 struct leaf struct
11 leaf *m0;
H A Dtest42-leaf-report-v1.cc2 // g++ -shared -g -o libtest42-leaf-report-v1.so test42-leaf-report-v1.cc
4 struct leaf struct
12 leaf *m0;
/third_party/node/deps/npm/node_modules/@sigstore/verify/dist/key/
H A Dcertificate.js6 function verifyCertificateChain(leaf, certificateAuthorities) {
8 // leaf certificate.
10 start: leaf.notBefore,
11 end: leaf.notAfter,
19 untrustedCert: leaf,
46 // Construct certificate path from leaf to root
55 // Construct all possible paths from the leaf
73 // Recursively build all possible paths from the leaf to the root
153 // Ensure that all certificates beyond the leaf are CAs
179 // certificates (NOT including the leaf) ar
[all...]
/third_party/libabigail/tests/data/test-abidiff/
H A Dtest-PR27985-v0.c1 struct leaf struct
8 struct leaf* ptr;
H A Dtest-PR27985-v1.c1 struct leaf struct
8 struct leaf* ptr;
/third_party/libabigail/tests/data/test-diff-suppr/
H A Dtest35-leaf-v1.cc3 // g++ -shared -g -o libtest35-leaf-v1.so test35-leaf-v1.cc
5 struct leaf struct
19 leaf *m0;
H A Dtest35-leaf-v0.cc3 // g++ -shared -g -o libtest35-leaf-v0.so test35-leaf-v0.cc
5 struct leaf struct
17 leaf *m0;
/third_party/musl/libc-test/src/functional/
H A Dsearch_tsearch.c38 if (v == leaf) in act()
40 t_error("visited leaf node \"%s\", wanted \"%c\"\n", e->k, wantc); in act()
41 if (v == postorder || v == leaf) in act()
52 if (v == preorder || v == leaf) in getparent()
/third_party/mesa3d/src/compiler/isaspec/
H A Dencode.py90 self.bitset = bitset # leaf bitset
131 self.bitset = bitset # leaf bitset
201 for leaf in self.encode_leafs(root):
202 for case in s.bitset_cases(leaf):
223 for leaf in leafs:
224 if leaf.get_root() != root:
226 yield leaf
441 <%def name="encode_params(leaf, field)">
444 .${param[1]} = ${s.expr_extractor(leaf, param[0], 'p')}, /* ${param[0]} */
449 <%def name="render_expr(leaf, exp
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DIntervalMap.h196 // Both leaf and branch nodes store vectors of pairs.
438 // Compute the leaf node branching factor that makes a node fit in three
452 // Now that we have the leaf branching factor, compute the actual allocation
461 /// Allocator - The recycling allocator used for both branch and leaf nodes.
482 // A NodeRef doesn't know whether it references a leaf node or a branch node.
693 // When all of the leaf nodes from all the subtrees are concatenated, they must
694 // satisfy the same constraints as a single leaf node. They must be sorted,
789 /// path - The path entries, path[0] is the root node, path.back() is a leaf.
802 template <typename NodeT> NodeT &leaf() const {
971 // 1: Root points to leaf
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
H A Dbtree.h21 // size nodes (usually 256 bytes) and doesn't store child pointers for leaf
273 // Upper bound for the available space for values. This is largest for leaf
466 // and leaf nodes in the btree, though the nodes are allocated in such a way
520 // // [1, kNodeSlots] for root leaf nodes, kNodeSlots for non-root leaf
527 // // The array of values. The capacity is `max_count` for leaf nodes and
534 // // There are 0 children for leaf nodes and kNodeSlots + 1 children for
565 // A lower bound for the overhead of fields other than values in a leaf node.
570 // Compute how many values we can fit onto a leaf node taking into account
594 // The node is internal (i.e. is not a leaf nod
[all...]

Completed in 17 milliseconds

123