Home
last modified time | relevance | path

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

123

/linux/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 …]
/linux/Documentation/core-api/
H A Dgeneric-radix-tree.rst2 Generic radix trees/sparse arrays
6 :doc: Generic radix trees/sparse arrays
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 …]
/linux/Documentation/arch/arm/google/
H A Dchromebook-boot-flow.rst9 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 Ddm-bufio.c394 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_index(block, bc->num_locks)].u.lock); in cache_write_unlock()
459 write_lock_bh(&lh->cache->trees[index].u.spinlock); in __lh_lock()
[all …]
/linux/rust/proc-macro2/
H A Dparse.rs171 let mut trees = TokenStreamBuilder::new(); in token_stream() localVariable
177 if let Ok((rest, ())) = doc_comment(input, &mut trees) { in token_stream()
188 None => return Ok(trees.build()), in token_stream()
207 let frame = (open_delimiter, trees); in token_stream()
211 trees = TokenStreamBuilder::new(); in token_stream()
229 let mut g = Group::new(open_delimiter, trees.build()); in token_stream()
236 trees = outer; in token_stream()
237 trees.push_token_from_parser(TokenTree::Group(crate::Group::_new_fallback(g))); in token_stream()
249 trees.push_token_from_parser(tt); in token_stream()
914 fn doc_comment<'a>(input: Cursor<'a>, trees: &mut TokenStreamBuilder) -> PResult<'a, ()> { in doc_comment()
[all …]
/linux/kernel/
H A Daudit_tree.c29 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()
1017 while (!list_empty(&chunk->trees)) { in evict_chunk()
1018 owner = list_entry(chunk->trees.next, in evict_chunk()
H A Dauditsc.c234 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/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
H A Dmodifying-patches.rst49 tracking your trees, and to people trying to troubleshoot bugs in your
/linux/mm/
H A Dzswap.c1676 struct xarray *trees, *tree; in zswap_swapon() local
1680 trees = kvcalloc(nr, sizeof(*tree), GFP_KERNEL); in zswap_swapon()
1681 if (!trees) { in zswap_swapon()
1687 xa_init(trees + i); in zswap_swapon()
1690 zswap_trees[type] = trees; in zswap_swapon()
1696 struct xarray *trees = zswap_trees[type]; in zswap_swapoff() local
1699 if (!trees) in zswap_swapoff()
1704 WARN_ON_ONCE(!xa_empty(trees + i)); in zswap_swapoff()
1706 kvfree(trees); in zswap_swapoff()
/linux/Documentation/translations/zh_CN/core-api/
H A Dgeneric-radix-tree.rst16 “DOC: Generic radix trees/sparse arrays”。
/linux/Documentation/process/
H A D2.Process.rst171 subsystem tree and into the -next trees (described below). When the
242 first in trees dedicated to network device drivers, wireless networking,
245 those managing lower-level trees, this process is known as the "chain of
253 Next trees
256 The chain of subsystem trees guides the flow of patches into the kernel,
265 the interesting subsystem trees, but that would be a big and error-prone
268 The answer comes in the form of -next trees, where subsystem trees are
269 collected for testing and review. The older of these trees, maintained by
272 trees; it also has some patches aimed at helping with debugging.
296 Linux-next trees are announced on the linux-kernel and linux-next mailing
[all …]
H A Dhowto.rst238 - 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 Dstable-kernel-rules.rst43 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 Dpatch-acceptance.rst44 ECR. (Developers may, of course, maintain their own Linux kernel trees
58 (Implementers, may, of course, maintain their own Linux kernel trees containing
/linux/Documentation/bpf/
H A Dbpf_devel_QA.rst102 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/arch/arm64/boot/dts/qcom/
H A Dmsm8916-samsung-e7.dts16 * to the other MSM8916 device trees. However, it is actually used through
H A Dmsm8916-samsung-e5.dts16 * to the other MSM8916 device trees. However, it is actually used through
H A Dmsm8916-samsung-grandmax.dts17 * to the other MSM8916 device trees. However, it is actually used through
/linux/Documentation/devicetree/bindings/soc/fsl/cpm_qe/qe/
H A Dpar_io.txt26 the new device trees. Instead, each Par I/O bank should be represented
/linux/Documentation/devicetree/bindings/powerpc/fsl/
H A Dcpus.txt5 Power Architecture CPUs in Freescale SOCs are represented in device trees as
/linux/Documentation/mm/damon/
H A Dmaintainer-profile.rst17 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 Dnixge.txt5 older device trees with DMA engines co-located in the address map,
/linux/drivers/net/ethernet/mellanox/mlxsw/
H A Dspectrum_router.h38 struct mlxsw_sp_lpm_tree *trees; member

123