| /linux/fs/unicode/ |
| H A 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/Documentation/core-api/ |
| H A D | generic-radix-tree.rst | 2 Generic radix trees/sparse arrays
6 :doc: Generic radix trees/sparse arrays
|
| /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/rust/proc-macro2/ |
| H A D | parse.rs | 171 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/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[i].root; in mtdswap_choose_wl_tree()
[all …]
|
| /linux/kernel/ |
| H A 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()
1017 while (!list_empty(&chunk->trees)) { in evict_chunk()
1018 owner = list_entry(chunk->trees.next, in evict_chunk()
|
| H A 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_obj(struct audit_tree_refs); 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 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
|
| H A D | modifying-patches.rst | 49 tracking your trees, and to people trying to troubleshoot bugs in your
|
| /linux/mm/ |
| H A D | zswap.c | 1670 struct xarray *trees, *tree; in zswap_swapon() local
1674 trees = kvzalloc_objs(*tree, nr); in zswap_swapon()
1675 if (!trees) { in zswap_swapon()
1681 xa_init(trees + i); in zswap_swapon()
1684 zswap_trees[type] = trees; in zswap_swapon()
1690 struct xarray *trees = zswap_trees[type]; in zswap_swapoff() local
1693 if (!trees) in zswap_swapoff()
1698 WARN_ON_ONCE(!xa_empty(trees + i)); in zswap_swapoff()
1700 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/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/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 entirely. Therefore, we also reserve to rebase
[all …]
|
| /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/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/powerpc/fsl/ |
| H A D | cpus.txt | 5 Power Architecture CPUs in Freescale SOCs are represented in device trees as
|
| /linux/Documentation/process/ |
| 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 | 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::
|
| 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
114 coordinating how the changes get merged through different maintainer trees.
|
| H A D | maintainer-netdev.rst | 26 volume of traffic have their own specific mailing lists and trees.
61 git trees and patch flow
64 There are two networking trees (git repositories) in play. Both are
69 for the future release. You can find the trees here:
139 sub-maintainer, who will send it on to the networking trees;
256 history in netdev trees is immutable.
|
| /linux/Documentation/devicetree/bindings/net/ |
| H A D | nixge.txt | 5 older device trees with DMA engines co-located in the address map,
|
| /linux/drivers/net/ethernet/mellanox/mlxsw/ |
| H A D | spectrum_router.h | 38 struct mlxsw_sp_lpm_tree *trees; member
|
| /linux/kernel/liveupdate/ |
| H A D | Kconfig | 37 Also, enables inspecting the KHO fdt trees with the debugfs binary
|