Home
last modified time | relevance | path

Searched refs:trees (Results 1 – 25 of 163) sorted by relevance

1234567

/OK3568_Linux_fs/kernel/fs/unicode/
H A Dmkutf8data.c1357 struct tree *trees; variable
1623 trees = calloc(trees_count, sizeof(struct tree)); in trees_init()
1630 trees[--count].maxage = maxage; in trees_init()
1631 trees[--count].maxage = maxage; in trees_init()
1644 while (ages[j] < trees[i].maxage) in trees_init()
1646 trees[i].maxage = ages[j-1]; in trees_init()
1650 trees[trees_count-2].next = &trees[trees_count-1]; in trees_init()
1651 trees[trees_count-1].leaf_mark = nfdi_mark; in trees_init()
1652 trees[trees_count-2].leaf_mark = nfdicf_mark; in trees_init()
1654 trees[i].next = &trees[trees_count-2]; in trees_init()
[all …]
/OK3568_Linux_fs/kernel/Documentation/core-api/
H A Drbtree.rst9 What are red-black trees, and what are they for?
12 Red-black trees are a type of self-balancing binary search tree, used for
13 storing sortable key/value data pairs. This differs from radix trees (which
19 Red-black trees are similar to AVL trees, but provide faster real-time bounded
26 There are a number of red-black trees in use in the kernel.
32 trees, as are epoll file descriptors, cryptographic keys, and network
38 Linux Weekly News article on red-black trees
41 Wikipedia entry on red-black trees
44 Linux implementation of red-black trees
171 sorted order. These work on arbitrary trees, and should not need to be
[all …]
H A Dgeneric-radix-tree.rst2 Generic radix trees/sparse arrays
6 :doc: Generic radix trees/sparse arrays
/OK3568_Linux_fs/yocto/poky/meta/recipes-devtools/rsync/files/
H A D0001-Add-missing-prototypes-to-function-declarations.patch27 zlib/trees.c | 2 +-
139 diff --git a/zlib/trees.c b/zlib/trees.c
141 --- a/zlib/trees.c
142 +++ b/zlib/trees.c
/OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-aarch64/include/opencv2/flann/
H A Dminiflann.hpp85 KDTreeIndexParams(int trees=4);
95 CompositeIndexParams(int trees = 4, int branching = 32, int iterations = 11,
108 …n::flann_centers_init_t centers_init = cvflann::FLANN_CENTERS_RANDOM, int trees = 4, int leaf_size…
H A Dcomposite_index.h47 CompositeIndexParams(int trees = 4, int branching = 32, int iterations = 11,
52 (*this)["trees"] = trees;
/OK3568_Linux_fs/kernel/drivers/mtd/
H A Dmtdswap.c114 struct mtdswap_tree trees[MTDSWAP_TREE_CNT]; member
160 #define TREE_ROOT(d, name) (&d->trees[MTDSWAP_ ## name].root)
163 #define TREE_COUNT(d, name) (d->trees[MTDSWAP_ ## name].count)
196 oldidx = tp - &d->trees[0]; in mtdswap_eb_detach()
198 d->trees[oldidx].count--; in mtdswap_eb_detach()
226 if (eb->root == &d->trees[idx].root) in mtdswap_rb_add()
230 root = &d->trees[idx].root; in mtdswap_rb_add()
233 d->trees[idx].count++; in mtdswap_rb_add()
767 if (d->trees[idx].root.rb_node != NULL) in __mtdswap_choose_gc_tree()
809 root = &d->trees[i].root; in mtdswap_choose_wl_tree()
[all …]
/OK3568_Linux_fs/kernel/kernel/
H A Daudit_tree.c29 struct list_head trees; /* with root here */ member
198 INIT_LIST_HEAD(&chunk->trees); in alloc_chunk()
299 list_splice_init(&old->trees, &new->trees); in replace_chunk()
300 list_for_each_entry(owner, &new->trees, same_root) in replace_chunk()
366 list_del_init(&chunk->trees); in untag_chunk()
438 list_add(&tree->same_root, &chunk->trees); in create_chunk()
510 list_add(&tree->same_root, &chunk->trees); in tag_chunk()
1013 while (!list_empty(&chunk->trees)) { in evict_chunk()
1014 owner = list_entry(chunk->trees.next, in evict_chunk()
H A Dauditsc.c242 struct audit_tree_refs *p = ctx->trees; in put_tree_ref()
254 ctx->trees = p; in put_tree_ref()
263 struct audit_tree_refs *p = ctx->trees; in grow_tree_refs()
264 ctx->trees = kzalloc(sizeof(struct audit_tree_refs), GFP_KERNEL); in grow_tree_refs()
265 if (!ctx->trees) { in grow_tree_refs()
266 ctx->trees = p; in grow_tree_refs()
270 p->next = ctx->trees; in grow_tree_refs()
272 ctx->first_trees = ctx->trees; in grow_tree_refs()
291 for (q = p; q != ctx->trees; q = q->next, n = 31) { in unroll_tree_refs()
301 ctx->trees = p; in unroll_tree_refs()
[all …]
/OK3568_Linux_fs/kernel/Documentation/maintainer/
H A Drebasing-and-merging.rst54 That said, there are always exceptions. Some trees (linux-next being
90 If, instead, rebasing is limited to private trees, commits are based on a
99 Kernel work is accumulated in over 100 different subsystem trees, each of
110 from lower-level subsystem trees and from others, either sibling trees or
113 Merging from lower-level trees
135 Merging from sibling or upstream trees
139 trees tend to be a red flag when it comes time to push a branch upstream.
154 hide interactions with other trees that should not be happening (often) in
199 with the maintainer to carry both sets of changes in one of the trees or
201 merged into both trees. If the dependency is related to major
/OK3568_Linux_fs/yocto/poky/meta/classes/
H A Ddevicetree.bbclass5 # addition to device trees this bbclass also handles compilation of device tree
10 # However this class on purpose separates the deployed device trees into the
12 # output. Additionally the device trees are populated into the sysroot for
18 # device trees built with them are at least GPL-2.0-only (and in some cases dual
/OK3568_Linux_fs/buildroot/support/kconfig/patches/
H A D19-merge_config.sh-add-br2-external-support.patch9 external trees on a clean buildroot tree invocation.
23 + echo " -e colon-separated list of br2-external trees to use (optional)"
H A D20-merge_config.sh-Allow-to-define-config-prefix.patch8 echo " -e colon-separated list of br2-external trees to use (optional)"
/OK3568_Linux_fs/yocto/poky/meta/recipes-core/zlib/zlib/
H A DCVE-2018-25032.patch32 trees.c | 50 +++++++++++--------------------------
195 /* Depth of each subtree used as tie breaker for trees of equal frequency
217 ulg opt_len; /* bit length of current block with optimal trees */
218 ulg static_len; /* bit length of current block with static trees */
248 diff --git a/trees.c b/trees.c
250 --- a/trees.c
251 +++ b/trees.c
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/
H A Dpredict.def123 DEF_PREDICTOR (PRED_TREE_POINTER, "pointer (on trees)", HITRATE (70), 0)
129 DEF_PREDICTOR (PRED_TREE_OPCODE_POSITIVE, "opcode values positive (on trees)",
131 DEF_PREDICTOR (PRED_TREE_OPCODE_NONEQUAL, "opcode values nonequal (on trees)",
133 DEF_PREDICTOR (PRED_TREE_FPOPCODE, "fp_opcode (on trees)", HITRATE (90), 0)
145 DEF_PREDICTOR (PRED_TREE_EARLY_RETURN, "early return (on trees)", HITRATE (66),
H A Dlto-streamer.h524 vec<tree> trees; /* Maps indices to pointers. */ member
1090 encoder->trees.create (0); in lto_init_tree_ref_encoder()
1102 encoder->trees.release (); in lto_destroy_tree_ref_encoder()
1109 return encoder->trees.length (); in lto_tree_ref_encoder_size()
1117 return encoder->trees[idx]; in lto_tree_ref_encoder_get_tree()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/
H A Dpredict.def123 DEF_PREDICTOR (PRED_TREE_POINTER, "pointer (on trees)", HITRATE (70), 0)
129 DEF_PREDICTOR (PRED_TREE_OPCODE_POSITIVE, "opcode values positive (on trees)",
131 DEF_PREDICTOR (PRED_TREE_OPCODE_NONEQUAL, "opcode values nonequal (on trees)",
133 DEF_PREDICTOR (PRED_TREE_FPOPCODE, "fp_opcode (on trees)", HITRATE (90), 0)
145 DEF_PREDICTOR (PRED_TREE_EARLY_RETURN, "early return (on trees)", HITRATE (66),
H A Dlto-streamer.h524 vec<tree> trees; /* Maps indices to pointers. */ member
1090 encoder->trees.create (0); in lto_init_tree_ref_encoder()
1102 encoder->trees.release (); in lto_destroy_tree_ref_encoder()
1109 return encoder->trees.length (); in lto_tree_ref_encoder_size()
1117 return encoder->trees[idx]; in lto_tree_ref_encoder_get_tree()
/OK3568_Linux_fs/kernel/Documentation/riscv/
H A Dpatch-acceptance.rst24 course, maintain their own Linux kernel trees that contain code for
34 (Implementors, may, of course, maintain their own Linux kernel trees
/OK3568_Linux_fs/kernel/Documentation/process/
H A D2.Process.rst181 subsystem tree and into the -next trees (described below). When the
252 first in trees dedicated to network device drivers, wireless networking,
255 those managing lower-level trees, this process is known as the "chain of
263 Next trees
266 The chain of subsystem trees guides the flow of patches into the kernel,
275 the interesting subsystem trees, but that would be a big and error-prone
278 The answer comes in the form of -next trees, where subsystem trees are
279 collected for testing and review. The older of these trees, maintained by
282 trees; it also has some patches aimed at helping with debugging.
306 Linux-next trees are announced on the linux-kernel and linux-next mailing
[all …]
/OK3568_Linux_fs/yocto/meta-openembedded/meta-python/recipes-devtools/python/
H A Dpython3-asciitree_0.3.3.bb1 SUMMARY = "Draws ASCII trees."
H A Dpython3-asttokens_2.0.5.bb1 SUMMARY = "The asttokens module annotates Python abstract syntax trees (ASTs)"
H A Dpython3-spidev_3.5.bb5 [here](http://elk.informatik.fh-augsburg.de/da/da-49/trees/pyap7k/lang/py-spi)\
/OK3568_Linux_fs/kernel/Documentation/bpf/
H A Dbpf_devel_QA.rst75 applied to one of the two BPF kernel trees.
80 get rejected or are not applicable to the BPF trees (but assigned to
85 A: There are two BPF kernel trees (git repositories). Once patches have
87 of the two BPF trees:
94 analogous to net and net-next trees for networking. Both bpf and
109 to other trees (e.g. tracing) with a small subset of the patches, but
110 net and net-next are always the main trees targeted for integration.
145 please make sure to rebase the patches against those trees in
164 automatically get accepted into net or net-next trees eventually:
169 them from the trees entirely. Therefore, we also reserve to rebase
[all …]
/OK3568_Linux_fs/buildroot/package/libavl/
H A DConfig.in5 AVLTree is a small implementation of AVL trees for the C

1234567