| /Linux-v6.6/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-v6.6/Documentation/core-api/ |
| D | generic-radix-tree.rst | 2 Generic radix trees/sparse arrays
6 :doc: Generic radix trees/sparse arrays
|
| D | rbtree.rst | 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-v6.6/Documentation/arch/arm/google/ |
| D | chromebook-boot-flow.rst | 9 Image`_ which contains an OS image as well as a collection of device trees. It
34 Depthcharge_ will look through all device trees in the `FIT Image`_ trying to
36 through all device trees in the `FIT Image`_ trying to find the one that
42 trees:
59 trees with multiple revisions.
|
| /Linux-v6.6/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()
766 if (d->trees[idx].root.rb_node != NULL) in __mtdswap_choose_gc_tree()
808 root = &d->trees[i].root; in mtdswap_choose_wl_tree()
[all …]
|
| /Linux-v6.6/kernel/ |
| D | audit_tree.c | 29 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()
1010 while (!list_empty(&chunk->trees)) { in evict_chunk()
1011 owner = list_entry(chunk->trees.next, in evict_chunk()
|
| D | auditsc.c | 234 struct audit_tree_refs *p = ctx->trees; in put_tree_ref()
247 ctx->trees = p; in put_tree_ref()
256 struct audit_tree_refs *p = ctx->trees; in grow_tree_refs()
258 ctx->trees = kzalloc(sizeof(struct audit_tree_refs), GFP_KERNEL); in grow_tree_refs()
259 if (!ctx->trees) { in grow_tree_refs()
260 ctx->trees = p; in grow_tree_refs()
264 p->next = ctx->trees; in grow_tree_refs()
266 ctx->first_trees = ctx->trees; in grow_tree_refs()
286 for (q = p; q != ctx->trees; q = q->next, n = 31) { in unroll_tree_refs()
296 ctx->trees = p; in unroll_tree_refs()
[all …]
|
| /Linux-v6.6/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-v6.6/drivers/md/ |
| D | dm-bufio.c | 396 struct buffer_tree trees[]; member
406 down_read(&bc->trees[cache_index(block, bc->num_locks)].lock); in cache_read_lock()
411 up_read(&bc->trees[cache_index(block, bc->num_locks)].lock); in cache_read_unlock()
416 down_write(&bc->trees[cache_index(block, bc->num_locks)].lock); in cache_write_lock()
421 up_write(&bc->trees[cache_index(block, bc->num_locks)].lock); in cache_write_unlock()
446 down_write(&lh->cache->trees[index].lock); in __lh_lock()
448 down_read(&lh->cache->trees[index].lock); in __lh_lock()
454 up_write(&lh->cache->trees[index].lock); in __lh_unlock()
456 up_read(&lh->cache->trees[index].lock); in __lh_unlock()
512 init_rwsem(&bc->trees[i].lock); in cache_init()
[all …]
|
| /Linux-v6.6/Documentation/translations/zh_CN/core-api/ |
| D | generic-radix-tree.rst | 16 “DOC: Generic radix trees/sparse arrays”。
|
| /Linux-v6.6/Documentation/mm/damon/ |
| D | maintainer-profile.rst | 16 There are multiple Linux trees for DAMON development. Patches under
45 mm-stable[3] trees depend on the memory management subsystem maintainer.
|
| /Linux-v6.6/Documentation/process/ |
| D | 2.Process.rst | 174 subsystem tree and into the -next trees (described below). When the
245 first in trees dedicated to network device drivers, wireless networking,
248 those managing lower-level trees, this process is known as the "chain of
256 Next trees
259 The chain of subsystem trees guides the flow of patches into the kernel,
268 the interesting subsystem trees, but that would be a big and error-prone
271 The answer comes in the form of -next trees, where subsystem trees are
272 collected for testing and review. The older of these trees, maintained by
275 trees; it also has some patches aimed at helping with debugging.
299 Linux-next trees are announced on the linux-kernel and linux-next mailing
[all …]
|
| D | maintainer-soc.rst | 44 Most of these submaintainers have their own trees where they stage patches,
45 sending pull requests to the main SoC tree. These trees are usually, but not
80 coordinating how the changes get merged through different maintainer trees.
|
| D | stable-kernel-rules.rst | 43 There are three options to submit a change to -stable trees:
61 submitted, or already present in all newer stable trees still supported. This is
71 for stable trees, add the tag
|
| D | maintainer-netdev.rst | 26 volume of traffic have their own specific mailing lists and trees.
62 git trees and patch flow
65 There are two networking trees (git repositories) in play. Both are
70 for the future release. You can find the trees here:
140 sub-maintainer, who will send it on to the networking trees;
243 history in netdev trees is immutable.
|
| D | howto.rst | 239 - Various stable trees with multiple major numbers
240 - Subsystem-specific trees
279 Various stable trees with multiple major numbers
292 Stable trees are maintained by the "stable" team <stable@vger.kernel.org>, and
302 Subsystem-specific trees
313 Most of these repositories are git trees, but there are also other SCMs
330 Before updates from subsystem trees are merged into the mainline tree,
332 testing repository exists into which virtually all subsystem trees are
|
| /Linux-v6.6/Documentation/riscv/ |
| D | patch-acceptance.rst | 44 ECR. (Developers may, of course, maintain their own Linux kernel trees
58 (Implementers, may, of course, maintain their own Linux kernel trees containing
|
| /Linux-v6.6/arch/arm64/boot/dts/qcom/ |
| D | msm8916-samsung-e7.dts | 16 * to the other MSM8916 device trees. However, it is actually used through
|
| D | msm8916-samsung-e5.dts | 16 * to the other MSM8916 device trees. However, it is actually used through
|
| D | msm8916-samsung-grandmax.dts | 17 * to the other MSM8916 device trees. However, it is actually used through
|
| /Linux-v6.6/Documentation/bpf/ |
| D | bpf_devel_QA.rst | 102 applied to one of the two BPF kernel trees.
107 get rejected or are not applicable to the BPF trees (but assigned to
112 A: There are two BPF kernel trees (git repositories). Once patches have
114 of the two BPF trees:
121 analogous to net and net-next trees for networking. Both bpf and
137 to other trees (e.g. tracing) with a small subset of the patches, but
138 net and net-next are always the main trees targeted for integration.
174 please make sure to rebase the patches against those trees in
193 automatically get accepted into net or net-next trees eventually:
198 them from the trees entirely. Therefore, we also reserve to rebase
[all …]
|
| /Linux-v6.6/Documentation/devicetree/bindings/clock/ |
| D | qoriq-clock.txt | 77 trees the children of the clockgen node are the clock providers.
110 device trees with these nodes, but new device trees should not use them.
|
| /Linux-v6.6/Documentation/devicetree/bindings/powerpc/fsl/ |
| D | cpus.txt | 5 Power Architecture CPUs in Freescale SOCs are represented in device trees as
|
| /Linux-v6.6/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
|
| /Linux-v6.6/Documentation/devicetree/bindings/net/ |
| D | nixge.txt | 5 older device trees with DMA engines co-located in the address map,
|
