Home
last modified time | relevance | path

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

123456

/openbmc/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 …]
/openbmc/openbmc/poky/meta/recipes-devtools/rsync/files/
H A D0001-Add-missing-prototypes-to-function-declarations.patch25 zlib/trees.c | 2 +-
94 diff --git a/zlib/trees.c b/zlib/trees.c
96 --- a/zlib/trees.c
97 +++ b/zlib/trees.c
/openbmc/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 …]
/openbmc/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.
/openbmc/linux/drivers/md/
H A Ddm-bufio.c401 struct buffer_tree trees[]; member
414 read_lock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock); in cache_read_lock()
416 down_read(&bc->trees[cache_index(block, bc->num_locks)].u.lock); in cache_read_lock()
422 read_unlock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock); in cache_read_unlock()
424 up_read(&bc->trees[cache_index(block, bc->num_locks)].u.lock); in cache_read_unlock()
430 write_lock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock); in cache_write_lock()
432 down_write(&bc->trees[cache_index(block, bc->num_locks)].u.lock); in cache_write_lock()
438 write_unlock_bh(&bc->trees[cache_index(block, bc->num_locks)].u.spinlock); in cache_write_unlock()
440 up_write(&bc->trees[cache_index(block, bc->num_locks)].u.lock); in cache_write_unlock()
466 write_lock_bh(&lh->cache->trees[index].u.spinlock); in __lh_lock()
[all …]
/openbmc/linux/drivers/mtd/
H A Dmtdswap.c114 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 …]
/openbmc/linux/kernel/
H A Daudit_tree.c29 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()
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 …]
/openbmc/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
/openbmc/openbmc/poky/meta/classes-recipe/
H A Ddevicetree.bbclass11 # addition to device trees this bbclass also handles compilation of device tree
16 # However this class on purpose separates the deployed device trees into the
18 # output. Additionally the device trees are populated into the sysroot for
24 # device trees built with them are at least GPL-2.0-only (and in some cases dual
/openbmc/openbmc/meta-openembedded/meta-python/recipes-devtools/python/
H A Dpython3-asciitree_0.3.3.bb1 SUMMARY = "Draws ASCII trees."
H A Dpython3-asttokens_3.0.0.bb1 SUMMARY = "The asttokens module annotates Python abstract syntax trees (ASTs)"
H A Dpython3-spidev_3.6.bb5 [here](http://elk.informatik.fh-augsburg.de/da/da-49/trees/pyap7k/lang/py-spi)\
/openbmc/linux/Documentation/translations/zh_CN/core-api/
H A Dgeneric-radix-tree.rst16 “DOC: Generic radix trees/sparse arrays”。
/openbmc/linux/Documentation/mm/damon/
H A Dmaintainer-profile.rst16 There are multiple Linux trees for DAMON development. Patches under
45 mm-stable[3] trees depend on the memory management subsystem maintainer.
/openbmc/docs/
H A Dsubtree.md4 no longer the case. Although the individual meta-\* trees still exist in gerrit
/openbmc/linux/Documentation/process/
H A D2.Process.rst174 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 …]
/openbmc/linux/Documentation/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
/openbmc/openbmc/meta-openembedded/meta-oe/recipes-support/composefs/
H A Dcomposefs_1.0.8.bb4 filesystem trees, stacking on top of an underlying "lower" Linux filesystem."
/openbmc/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
/openbmc/phosphor-hwmon/
H A DREADME.iio.md9 trees are setup with all the iio-channels under a single iio-hwmon platform
/openbmc/u-boot/doc/
H A DREADME.OFT4 As part of the ongoing cleanup of the Linux PPC trees, the preferred
/openbmc/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 …]

123456