| /Linux-v5.4/fs/unicode/ |
| D | mkutf8data.c | 1357 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 …]
|
| /Linux-v5.4/Documentation/core-api/ |
| D | generic-radix-tree.rst | 2 Generic radix trees/sparse arrays
6 :doc: Generic radix trees/sparse arrays
|
| /Linux-v5.4/Documentation/ |
| D | rbtree.txt | 9 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 …]
|
| /Linux-v5.4/drivers/mtd/ |
| D | mtdswap.c | 114 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 …]
|
| /Linux-v5.4/kernel/ |
| D | audit_tree.c | 29 struct list_head trees; /* with root here */ member
200 INIT_LIST_HEAD(&chunk->trees); in alloc_chunk()
301 list_splice_init(&old->trees, &new->trees); in replace_chunk()
302 list_for_each_entry(owner, &new->trees, same_root) in replace_chunk()
368 list_del_init(&chunk->trees); in untag_chunk()
440 list_add(&tree->same_root, &chunk->trees); in create_chunk()
512 list_add(&tree->same_root, &chunk->trees); in tag_chunk()
1015 while (!list_empty(&chunk->trees)) { in evict_chunk()
1016 owner = list_entry(chunk->trees.next, in evict_chunk()
|
| D | auditsc.c | 213 struct audit_tree_refs *p = ctx->trees; in put_tree_ref()
225 ctx->trees = p; in put_tree_ref()
234 struct audit_tree_refs *p = ctx->trees; in grow_tree_refs()
235 ctx->trees = kzalloc(sizeof(struct audit_tree_refs), GFP_KERNEL); in grow_tree_refs()
236 if (!ctx->trees) { in grow_tree_refs()
237 ctx->trees = p; in grow_tree_refs()
241 p->next = ctx->trees; in grow_tree_refs()
243 ctx->first_trees = ctx->trees; in grow_tree_refs()
262 for (q = p; q != ctx->trees; q = q->next, n = 31) { in unroll_tree_refs()
272 ctx->trees = p; in unroll_tree_refs()
[all …]
|
| D | audit.h | 140 struct audit_tree_refs *trees, *first_trees; member
|
| /Linux-v5.4/Documentation/maintainer/ |
| D | rebasing-and-merging.rst | 54 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
|
| /Linux-v5.4/Documentation/process/ |
| D | 2.Process.rst | 179 subsystem tree and into the -next trees (described below). When the
250 first in trees dedicated to network device drivers, wireless networking,
253 those managing lower-level trees, this process is known as the "chain of
261 Next trees
264 The chain of subsystem trees guides the flow of patches into the kernel,
273 the interesting subsystem trees, but that would be a big and error-prone
276 The answer comes in the form of -next trees, where subsystem trees are
277 collected for testing and review. The older of these trees, maintained by
280 trees; it also has some patches aimed at helping with debugging.
304 Linux-next trees are announced on the linux-kernel and linux-next mailing
[all …]
|
| D | howto.rst | 239 - Various stable trees with multiple major numbers
240 - Subsystem-specific trees
279 Various stable trees with multiple major numbers
291 Stable trees are maintained by the "stable" team <stable@vger.kernel.org>, and
301 Subsystem-specific trees
312 Most of these repositories are git trees, but there are also other SCMs
329 Before updates from subsystem trees are merged into the mainline tree,
331 testing repository exists into which virtually all subsystem trees are
|
| D | 7.AdvancedTopics.rst | 52 When you are ready to start putting up git trees for others to look at, you
95 an exported tree. Moving changesets between trees to avoid conflicts in
119 can affect your ability to get trees pulled in the future. Quoting Linus:
|
| /Linux-v5.4/Documentation/bpf/ |
| D | bpf_devel_QA.rst | 80 applied to one of the two BPF kernel trees.
85 get rejected or are not applicable to the BPF trees (but assigned to
90 A: There are two BPF kernel trees (git repositories). Once patches have
92 of the two BPF trees:
99 analogous to net and net-next trees for networking. Both bpf and
114 to other trees (e.g. tracing) with a small subset of the patches, but
115 net and net-next are always the main trees targeted for integration.
150 please make sure to rebase the patches against those trees in
169 automatically get accepted into net or net-next trees eventually:
174 them from the trees entirely. Therefore, we also reserve to rebase
[all …]
|
| /Linux-v5.4/Documentation/devicetree/bindings/clock/ |
| D | qoriq-clock.txt | 76 trees the children of the clockgen node are the clock providers.
109 device trees with these nodes, but new device trees should not use them.
|
| /Linux-v5.4/Documentation/devicetree/bindings/soc/fsl/cpm_qe/qe/ |
| D | par_io.txt | 26 the new device trees. Instead, each Par I/O bank should be represented
|
| D | ucc.txt | 33 do so, in order to support older device trees, but they should be updated
|
| /Linux-v5.4/Documentation/devicetree/bindings/powerpc/fsl/ |
| D | cpus.txt | 5 Power Architecture CPUs in Freescale SOCs are represented in device trees as
|
| /Linux-v5.4/Documentation/devicetree/bindings/serial/ |
| D | mtk-uart.txt | 40 For compatibility with older device trees an unnamed clock is used for the
|
| /Linux-v5.4/Documentation/devicetree/bindings/net/ |
| D | nixge.txt | 5 older device trees with DMA engines co-located in the address map,
|
| D | altera_tse.txt | 6 ALTR is supported for legacy device trees, but is deprecated.
|
| D | xilinx_axienet.txt | 44 this is possible). New device trees should specify this - the
|
| /Linux-v5.4/drivers/of/ |
| D | Kconfig | 58 bool "Support for dynamic device trees" if OF_UNITTEST
|
| /Linux-v5.4/Documentation/devicetree/bindings/ |
| D | submitting-patches.txt | 64 3) For a series going though multiple trees, the binding patch should be
|
| /Linux-v5.4/Documentation/translations/zh_CN/process/ |
| D | coding-style.rst | 560 (expand-file-name "~/src/linux-trees")
563 这会让 emacs 在 ``~/src/linux-trees`` 下的 C 源文件获得更好的内核代码风格。
|
| /Linux-v5.4/fs/reiserfs/ |
| D | Kconfig | 9 Balanced trees are more efficient than traditional file system
|
| /Linux-v5.4/Documentation/filesystems/ |
| D | sharedsubtree.txt | 906 a) Create the necessary number of mount trees to
909 b) Do not attach any of the trees to its destination.
916 propagation trees; where 'n' is the number of mounts in the
919 Also there should be 'm' new mount trees, where 'm' is
926 attach each of the mount trees to their corresponding
930 delete all the newly created trees.
|
