| /Linux-v4.19/Documentation/devicetree/ |
| D | 00-INDEX | 1 Documentation for device trees, a data structure by which bootloaders pass
10 - Booting Linux without Open Firmware, describes history and format of device trees.
|
| /Linux-v4.19/Documentation/ |
| D | rbtree.txt | 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
171 sorted order. These work on arbitrary trees, and should not need to be
[all …]
|
| /Linux-v4.19/kernel/ |
| D | audit_tree.c | 28 struct list_head trees; /* with root here */ member
152 INIT_LIST_HEAD(&chunk->trees); in alloc_chunk()
277 list_del_init(&chunk->trees); in untag_chunk()
300 list_replace_init(&chunk->trees, &new->trees); in untag_chunk()
323 list_for_each_entry(owner, &new->trees, same_root) in untag_chunk()
379 list_add(&tree->same_root, &chunk->trees); in create_chunk()
465 list_replace_init(&old->trees, &chunk->trees); in tag_chunk()
480 list_for_each_entry(owner, &chunk->trees, same_root) in tag_chunk()
485 list_add(&tree->same_root, &chunk->trees); in tag_chunk()
968 while (!list_empty(&chunk->trees)) { in evict_chunk()
[all …]
|
| D | auditsc.c | 214 struct audit_tree_refs *p = ctx->trees; in put_tree_ref()
226 ctx->trees = p; in put_tree_ref()
235 struct audit_tree_refs *p = ctx->trees; in grow_tree_refs()
236 ctx->trees = kzalloc(sizeof(struct audit_tree_refs), GFP_KERNEL); in grow_tree_refs()
237 if (!ctx->trees) { in grow_tree_refs()
238 ctx->trees = p; in grow_tree_refs()
242 p->next = ctx->trees; in grow_tree_refs()
244 ctx->first_trees = ctx->trees; in grow_tree_refs()
265 for (q = p; q != ctx->trees; q = q->next, n = 31) { in unroll_tree_refs()
275 ctx->trees = p; in unroll_tree_refs()
[all …]
|
| D | audit.h | 152 struct audit_tree_refs *trees, *first_trees; member
|
| /Linux-v4.19/drivers/mtd/ |
| D | mtdswap.c | 127 struct mtdswap_tree trees[MTDSWAP_TREE_CNT]; member
173 #define TREE_ROOT(d, name) (&d->trees[MTDSWAP_ ## name].root)
176 #define TREE_COUNT(d, name) (d->trees[MTDSWAP_ ## name].count)
209 oldidx = tp - &d->trees[0]; in mtdswap_eb_detach()
211 d->trees[oldidx].count--; in mtdswap_eb_detach()
239 if (eb->root == &d->trees[idx].root) in mtdswap_rb_add()
243 root = &d->trees[idx].root; in mtdswap_rb_add()
246 d->trees[idx].count++; in mtdswap_rb_add()
780 if (d->trees[idx].root.rb_node != NULL) in __mtdswap_choose_gc_tree()
822 root = &d->trees[i].root; in mtdswap_choose_wl_tree()
[all …]
|
| /Linux-v4.19/Documentation/process/ |
| D | 2.Process.rst | 179 subsystem tree and into the -next trees (described below). When the
250 first in trees dedicated to network device drivers, wireless networking,
253 those managing lower-level trees, this process is known as the "chain of
261 Next trees
264 The chain of subsystem trees guides the flow of patches into the kernel,
273 the interesting subsystem trees, but that would be a big and error-prone
276 The answer comes in the form of -next trees, where subsystem trees are
277 collected for testing and review. The older of these trees, maintained by
280 trees; it also has some patches aimed at helping with debugging.
304 Linux-next trees are announced on the linux-kernel and linux-next mailing
[all …]
|
| 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:
|
| /Linux-v4.19/Documentation/devicetree/bindings/rtc/ |
| D | sun6i-rtc.txt | 11 Required properties for new device trees
|
| /Linux-v4.19/Documentation/bpf/ |
| D | bpf_devel_QA.rst | 80 applied to one of the two BPF kernel trees.
85 get rejected or are not applicable to the BPF trees (but assigned to
90 A: There are two BPF kernel trees (git repositories). Once patches have
92 of the two BPF trees:
99 analogous to net and net-next trees for networking. Both bpf and
114 to other trees (e.g. tracing) with a small subset of the patches, but
115 net and net-next are always the main trees targeted for integration.
150 please make sure to rebase the patches against those trees in
169 automatically get accepted into net or net-next trees eventually:
174 them from the trees entirely. Therefore, we also reserve to rebase
[all …]
|
| /Linux-v4.19/Documentation/devicetree/bindings/clock/ |
| D | qoriq-clock.txt | 69 trees the children of the clockgen node are the clock providers.
102 device trees with these nodes, but new device trees should not use them.
|
| /Linux-v4.19/Documentation/devicetree/bindings/spi/ |
| D | spi-gpio.txt | 22 GPIO lines used, they should not be used in new device trees.
|
| /Linux-v4.19/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
|
| /Linux-v4.19/Documentation/devicetree/bindings/powerpc/fsl/ |
| D | cpus.txt | 5 Power Architecture CPUs in Freescale SOCs are represented in device trees as
|
| /Linux-v4.19/Documentation/devicetree/bindings/serial/ |
| D | mtk-uart.txt | 31 For compatibility with older device trees an unnamed clock is used for the
|
| /Linux-v4.19/drivers/of/ |
| D | Kconfig | 57 bool "Support for dynamic device trees" if OF_UNITTEST
|
| /Linux-v4.19/Documentation/block/ |
| D | cfq-iosched.txt | 18 (for sequential workloads) and service trees (for random workloads) before
22 queues/service trees. This can be very helpful on highly seeky media like
235 CFQ has following service trees and various queues are put on these trees.
|
| /Linux-v4.19/Documentation/devicetree/bindings/ |
| D | submitting-patches.txt | 64 3) For a series going though multiple trees, the binding patch should be
|
| /Linux-v4.19/Documentation/translations/zh_CN/ |
| D | coding-style.rst | 553 (string-match (expand-file-name "~/src/linux-trees")
559 这会让 emacs 在 ``~/src/linux-trees`` 下的 C 源文件获得更好的内核代码风格。
|
| /Linux-v4.19/fs/reiserfs/ |
| D | Kconfig | 8 Balanced trees are more efficient than traditional file system
|
| /Linux-v4.19/Documentation/devicetree/bindings/net/ |
| D | altera_tse.txt | 6 ALTR is supported for legacy device trees, but is deprecated.
|
| /Linux-v4.19/Documentation/networking/ |
| D | netdev-FAQ.rst | 30 A: There are always two trees (git repositories) in play. Both are
35 for the future release. You can find the trees here:
40 Q: How often do changes from these trees make it to the mainline Linus tree?
|
| /Linux-v4.19/Documentation/filesystems/ |
| D | sharedsubtree.txt | 906 a) Create the necessary number of mount trees to
909 b) Do not attach any of the trees to its destination.
916 propagation trees; where 'n' is the number of mounts in the
919 Also there should be 'm' new mount trees, where 'm' is
926 attach each of the mount trees to their corresponding
930 delete all the newly created trees.
|
| /Linux-v4.19/drivers/clk/renesas/ |
| D | Kconfig | 33 Enable backward compatibility with old device trees describing a
|
