| /linux/fs/unicode/ |
| H A D | mkutf8data.c | 1357 struct tree *trees; variable
1621 /* Two trees per age: nfdi and nfdicf */ in trees_init()
1623 trees = calloc(trees_count, sizeof(struct tree)); in trees_init()
1625 /* Assign ages to the trees. */ 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()
1649 /* Set up the forwarding between trees. */ in trees_init()
1650 trees[trees_coun in trees_init()
[all...] |
| /linux/Documentation/core-api/ |
| H A D | generic-radix-tree.rst | 2 Generic radix trees/sparse arrays
6 :doc: Generic radix trees/sparse arrays
|
| H A 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
[all...] |
| /linux/Documentation/arch/arm/google/ |
| H A 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/drivers/md/ |
| H A D | dm-bufio.c | 389 * We spread entries across multiple trees to reduce contention
394 struct buffer_tree trees[]; member
407 read_lock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock); in cache_read_lock()
409 down_read(&bc->trees[cache_index(block, bc->num_locks)].u.lock); in cache_read_lock()
415 read_unlock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock); in cache_read_unlock()
417 up_read(&bc->trees[cache_index(block, bc->num_locks)].u.lock); in cache_read_unlock()
423 write_lock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock); in cache_write_lock()
425 down_write(&bc->trees[cache_index(block, bc->num_locks)].u.lock); in cache_write_lock()
431 write_unlock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock); in cache_write_unlock()
433 up_write(&bc->trees[cache_inde in cache_write_unlock()
[all...] |
| /linux/drivers/mtd/ |
| H A 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[ in mtdswap_choose_wl_tree()
[all...] |
| /linux/kernel/ |
| H A D | audit_tree.c | 29 struct list_head trees; /* with root here */ member
70 * chunk.trees anchors tree.same_root hash_lock
198 INIT_LIST_HEAD(&chunk->trees); in alloc_chunk()
270 /* tagging and untagging inodes with trees */
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()
[all...] |
| H A D | auditsc.c | 216 * ->first_trees points to its beginning, ->trees - to the current end of data.
217 * ->tree_count is the number of free entries in array pointed to by ->trees.
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()
[all...] |
| /linux/Documentation/maintainer/ |
| H A 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 o
[all...] |
| /linux/mm/ |
| H A D | zswap.c | 1738 struct xarray *trees, *tree; in zswap_swapon() local
1742 trees = kvcalloc(nr, sizeof(*tree), GFP_KERNEL); in zswap_swapon()
1743 if (!trees) { in zswap_swapon()
1749 xa_init(trees + i); in zswap_swapon()
1752 zswap_trees[type] = trees; in zswap_swapon()
1758 struct xarray *trees = zswap_trees[type]; in zswap_swapoff() local
1761 if (!trees) in zswap_swapoff()
1766 WARN_ON_ONCE(!xa_empty(trees + i)); in zswap_swapoff()
1768 kvfree(trees); in zswap_swapoff()
|
| /linux/Documentation/translations/zh_CN/core-api/ |
| H A D | generic-radix-tree.rst | 16 “DOC: Generic radix trees/sparse arrays”。
|
| /linux/Documentation/process/ |
| H A 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; i
[all...] |
| H A D | howto.rst | 238 - Various stable trees with multiple major numbers
239 - Subsystem-specific trees
278 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
|
| H A D | maintainer-soc.rst | 47 Most of these submaintainers have their own trees where they stage patches,
48 sending pull requests to the main SoC tree. These trees are usually, but not
112 coordinating how the changes get merged through different maintainer trees.
|
| H A 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 this tag in the sign-off area::
|
| /linux/Documentation/arch/riscv/ |
| H A 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/arch/arm64/boot/dts/qcom/ |
| H A D | msm8916-samsung-e7.dts | 16 * to the other MSM8916 device trees. However, it is actually used through
|
| H A D | msm8916-samsung-e5.dts | 16 * to the other MSM8916 device trees. However, it is actually used through
|
| H A D | msm8916-samsung-grandmax.dts | 17 * to the other MSM8916 device trees. However, it is actually used through
|
| /linux/Documentation/bpf/ |
| H A 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 entirel
[all...] |
| /linux/Documentation/devicetree/bindings/powerpc/fsl/ |
| H A D | cpus.txt | 5 Power Architecture CPUs in Freescale SOCs are represented in device trees as
|
| /linux/Documentation/devicetree/bindings/soc/fsl/cpm_qe/qe/ |
| H A D | par_io.txt | 26 the new device trees. Instead, each Par I/O bank should be represented
|
| /linux/Documentation/devicetree/bindings/ |
| H A D | submitting-patches.rst | 98 3) For a series going though multiple trees, the binding patch should be
102 but always via platform SoC trees on dedicated branches (see also
|
| /linux/Documentation/mm/damon/ |
| H A D | maintainer-profile.rst | 17 There are multiple Linux trees for DAMON development. Patches under
61 <https://git.kernel.org/akpm/mm/h/mm-stable>`_ trees depend on the memory
|
| /linux/Documentation/devicetree/bindings/net/ |
| H A D | nixge.txt | 5 older device trees with DMA engines co-located in the address map,
|