Searched full:trees (Results 1 – 25 of 80) sorted by relevance
1234
| /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.
|
| /Documentation/core-api/ |
| D | rbtree.rst | 2 Red-black Trees (rbtree) in Linux
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
36 information on the nature and implementation of Red Black Trees, see:
38 Linux Weekly News article on red-black trees
41 Wikipedia entry on red-black trees
[all …]
|
| D | generic-radix-tree.rst | 2 Generic radix trees/sparse arrays
6 :doc: Generic radix trees/sparse arrays
|
| /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
|
| D | modifying-patches.rst | 49 tracking your trees, and to people trying to troubleshoot bugs in your
|
| /Documentation/devicetree/bindings/clock/ |
| D | fsl,qoriq-clock-legacy.yaml | 14 device trees with these nodes, but new device trees should not use them.
|
| /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 | 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::
207 Trees chapter
|
| 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
|
| 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.
|
| D | 7.AdvancedTopics.rst | 52 When you are ready to start putting up git trees for others to look at, you
95 an exported tree. Moving changesets between trees to avoid conflicts in
119 can affect your ability to get trees pulled in the future. Quoting Linus:
|
| 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.
|
| /Documentation/arch/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
|
| /Documentation/mm/damon/ |
| D | maintainer-profile.rst | 14 SCM Trees
17 There are multiple Linux trees for DAMON development. Patches under
58 <https://git.kernel.org/akpm/mm/h/mm-stable>`_ trees depend on the memory
|
| /Documentation/translations/zh_CN/core-api/ |
| D | generic-radix-tree.rst | 16 “DOC: Generic radix trees/sparse arrays”。
|
| /Documentation/arch/arm/sti/ |
| D | overview.rst | 26 Device Trees.
|
| /Documentation/arch/arm/stm32/ |
| D | overview.rst | 28 Device Trees.
|
| /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 …]
|
| /Documentation/devicetree/bindings/powerpc/fsl/ |
| D | cpus.txt | 5 Power Architecture CPUs in Freescale SOCs are represented in device trees as
|
| /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
|
| D | ucc.txt | 33 do so, in order to support older device trees, but they should be updated
|
| /Documentation/devicetree/bindings/power/supply/ |
| D | samsung,battery.yaml | 17 product, so product device trees can specify these batteries. Operating
|
| /Documentation/filesystems/ |
| D | directory-locking.rst | 74 operations on directory trees, but we obviously do not have the full
77 Trees grow as we do operations; memory pressure prunes them. Normally
89 dcache trees. Lookup is already holding the parent locked. If alias is
241 suppose the parents are initially in different trees; we would lock the
|
| /Documentation/devicetree/bindings/net/ |
| D | nixge.txt | 5 older device trees with DMA engines co-located in the address map,
|
| /Documentation/devicetree/bindings/input/touchscreen/ |
| D | zinitix,bt400.yaml | 60 In older device trees this can be the accidental name for the analog
|
1234