| /linux-4.1.27/kernel/ |
| D | audit_tree.c | 26 struct list_head trees; /* with root here */ member
150 INIT_LIST_HEAD(&chunk->trees); in alloc_chunk()
247 list_del_init(&chunk->trees); in untag_chunk()
269 list_replace_init(&chunk->trees, &new->trees); in untag_chunk()
292 list_for_each_entry(owner, &new->trees, same_root) in untag_chunk()
346 list_add(&tree->same_root, &chunk->trees); in create_chunk()
423 list_replace_init(&old->trees, &chunk->trees); in tag_chunk()
438 list_for_each_entry(owner, &chunk->trees, same_root) in tag_chunk()
443 list_add(&tree->same_root, &chunk->trees); in tag_chunk()
922 while (!list_empty(&chunk->trees)) { in evict_chunk()
[all …]
|
| D | auditsc.c | 212 struct audit_tree_refs *p = ctx->trees; in put_tree_ref()
224 ctx->trees = p; in put_tree_ref()
233 struct audit_tree_refs *p = ctx->trees; in grow_tree_refs()
234 ctx->trees = kzalloc(sizeof(struct audit_tree_refs), GFP_KERNEL); in grow_tree_refs()
235 if (!ctx->trees) { in grow_tree_refs()
236 ctx->trees = p; in grow_tree_refs()
240 p->next = ctx->trees; in grow_tree_refs()
242 ctx->first_trees = ctx->trees; in grow_tree_refs()
263 for (q = p; q != ctx->trees; q = q->next, n = 31) { in unroll_tree_refs()
273 ctx->trees = p; in unroll_tree_refs()
[all …]
|
| D | audit.h | 149 struct audit_tree_refs *trees, *first_trees; member
|
| /linux-4.1.27/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-4.1.27/Documentation/ |
| D | rbtree.txt | 6 What are red-black trees, and what are they for?
9 Red-black trees are a type of self-balancing binary search tree, used for
10 storing sortable key/value data pairs. This differs from radix trees (which
16 Red-black trees are similar to AVL trees, but provide faster real-time bounded
23 There are a number of red-black trees in use in the kernel.
29 trees, as are epoll file descriptors, cryptographic keys, and network
35 Linux Weekly News article on red-black trees
38 Wikipedia entry on red-black trees
41 Linux implementation of red-black trees
168 sorted order. These work on arbitrary trees, and should not need to be
[all …]
|
| D | HOWTO | 212 http://lxr.linux.no/+trees
224 - subsystem specific kernel trees and patches
296 Subsystem Specific kernel trees and patches
306 Most of these repositories are git trees, but there are also other SCMs
322 Before updates from subsystem trees are merged into the mainline 4.x
324 testing repository exists into which virtually all subsystem trees are
|
| D | SubmittingPatches | 42 directly. Most subsystem maintainers run their own trees and want to see
43 patches prepared against those trees. See the "T:" entry for the subsystem
119 installations run kernels from secondary stable trees or
120 vendor/product-specific trees that cherry-pick only specific patches
305 conclusions on which patches should go to the stable trees. The networking
499 tracking your trees, and to people trying to troubleshoot bugs in your
|
| D | SubmittingDrivers | 5 various kernel trees. Note that if you are interested in video card drivers
|
| D | applying-patches.txt | 11 one of the many trees/branches should be applied to. Hopefully this document
15 description of the different kernel trees (and examples of how to apply
447 This concludes this list of explanations of the various kernel trees.
|
| D | 00-INDEX | 75 - description of various trees and how to apply their patches.
385 - info on what red-black trees are and what they are for.
|
| D | CodingStyle | 530 (string-match (expand-file-name "~/src/linux-trees")
537 files below ~/src/linux-trees.
|
| D | bcache.txt | 387 Statistics about the auxiliary search trees
|
| /linux-4.1.27/drivers/mtd/ |
| D | mtdswap.c | 127 struct mtdswap_tree trees[MTDSWAP_TREE_CNT]; member
175 #define TREE_ROOT(d, name) (&d->trees[MTDSWAP_ ## name].root)
178 #define TREE_COUNT(d, name) (d->trees[MTDSWAP_ ## name].count)
211 oldidx = tp - &d->trees[0]; in mtdswap_eb_detach()
213 d->trees[oldidx].count--; in mtdswap_eb_detach()
241 if (eb->root == &d->trees[idx].root) in mtdswap_rb_add()
245 root = &d->trees[idx].root; in mtdswap_rb_add()
248 d->trees[idx].count++; in mtdswap_rb_add()
816 if (d->trees[idx].root.rb_node != NULL) in __mtdswap_choose_gc_tree()
858 root = &d->trees[i].root; in mtdswap_choose_wl_tree()
[all …]
|
| /linux-4.1.27/Documentation/development-process/ |
| D | 2.Process | 163 subsystem tree and into the -next trees (described below). When the
234 first in trees dedicated to network device drivers, wireless networking,
237 those managing lower-level trees, this process is known as the "chain of
247 The chain of subsystem trees guides the flow of patches into the kernel,
256 the interesting subsystem trees, but that would be a big and error-prone
259 The answer comes in the form of -next trees, where subsystem trees are
260 collected for testing and review. The older of these trees, maintained by
263 trees; it also has some patches aimed at helping with debugging.
287 Linux-next trees are announced on the linux-kernel and linux-next mailing
367 upstream. For the management of certain kinds of trees (-mm, for example),
|
| D | 7.AdvancedTopics | 48 When you are ready to start putting up git trees for others to look at, you
91 an exported tree. Moving changesets between trees to avoid conflicts in
115 can affect your ability to get trees pulled in the future. Quoting Linus:
|
| D | 6.Followthrough | 117 default. Subsystem trees typically feed linux-next as well, making their
127 developers and, possibly, moving some patches between trees to ensure that
|
| D | 5.Posting | 70 against these other trees can require a significant amount of work
|
| /linux-4.1.27/Documentation/devicetree/bindings/powerpc/fsl/ |
| D | cpus.txt | 5 Power Architecture CPUs in Freescale SOCs are represented in device trees as
|
| D | mpc5200.txt | 27 To express this information as completely as possible, 5200B device trees
31 It is *strongly* recommended that 5200B device trees follow this convention
|
| D | mpic.txt | 64 device-trees omit this property on MPIC nodes even when the MPIC is
|
| /linux-4.1.27/Documentation/devicetree/bindings/ |
| D | chosen.txt | 12 Device trees may specify the device to be used for boot console output
|
| D | submitting-patches.txt | 57 3) For a series going though multiple trees, the binding patch should be
|
| /linux-4.1.27/Documentation/devicetree/bindings/powerpc/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 | 35 do so, in order to support older device trees, but they should be updated
|
| /linux-4.1.27/drivers/of/ |
| D | Kconfig | 37 bool "Support for dynamic device trees" if OF_UNITTEST
|
| /linux-4.1.27/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
236 CFQ has following service trees and various queues are put on these trees.
|
| D | biodoc.txt | 993 AS and deadline i/o schedulers use red black binary trees for disk position
1009 Front merges are handled by the binary trees in AS and deadline schedulers.
|
| /linux-4.1.27/Documentation/power/ |
| D | pm_qos_interface.txt | 119 and recompute the new aggregated target, calling the notification trees if the
124 call the notification trees if the target was changed as a result of removing
166 The per-device PM QoS framework has 2 different and distinct notification trees:
|
| /linux-4.1.27/Documentation/networking/ |
| D | netdev-FAQ.txt | 25 A: There are always two trees (git repositories) in play. Both are driven
30 You can find the trees here:
35 Q: How often do changes from these trees make it to the mainline Linus tree?
|
| D | eql.txt | 13 source trees. (Yes, it worked fine.)
|
| /linux-4.1.27/fs/reiserfs/ |
| D | Kconfig | 8 Balanced trees are more efficient than traditional file system
|
| /linux-4.1.27/Documentation/devicetree/bindings/net/ |
| D | altera_tse.txt | 6 ALTR is supported for legacy device trees, but is deprecated.
|
| /linux-4.1.27/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.
|
| D | overlayfs.txt | 40 directory trees to be in the same filesystem and there is no
209 the upper or the lower trees.
|
| D | hpfs.txt | 178 Old versions of this driver created sometimes unbalanced dnode trees. OS/2
180 unbalanced trees too :-) but both HPFS and HPFS386 contain bug that it rarely
181 crashes when the tree is not balanced. This driver handles unbalanced trees
|
| D | ubifs.txt | 65 trees), so the mount time and memory consumption do not linearly depend
|
| D | autofs4-mount-control.txt | 32 and expire" of nested mount trees have the file system mounted directly
|
| /linux-4.1.27/Documentation/devicetree/bindings/pinctrl/ |
| D | nvidia,tegra124-xusb-padctl.txt | 12 how to describe and reference PHYs in device trees.
|
| /linux-4.1.27/Documentation/ko_KR/ |
| D | HOWTO | 216 http://lxr.linux.no/+trees
|
| /linux-4.1.27/Documentation/arm/Atmel/ |
| D | README | 13 official Atmel product name. Anyway, files, directories, git trees,
|
| /linux-4.1.27/Documentation/devicetree/bindings/gpio/ |
| D | gpio.txt | 205 However, that property may still exist in older device trees for
207 trees that need to be compatible with older software.
|
| /linux-4.1.27/Documentation/filesystems/pohmelfs/ |
| D | info.txt | 14 trees looking for stale requests, which have to be resent, or if number of
|
| /linux-4.1.27/Documentation/RCU/ |
| D | arrayRCU.txt | 21 to other array-of-list situations, such as radix trees.
|
| D | RTFP.txt | 267 of processes. Finally, it is specific to AVL trees.
300 of processes. Finally, it is specific to AVL trees.
|
| /linux-4.1.27/Documentation/ja_JP/ |
| D | HOWTO | 248 http://lxr.linux.no/+trees
|
| /linux-4.1.27/Documentation/timers/ |
| D | hrtimers.txt | 92 such as radix trees and hashes, we chose the red black tree as the basic
|
| /linux-4.1.27/lib/ |
| D | Kconfig | 364 modify. The algorithms are non-recursive, and the trees are highly
|
| D | Kconfig.debug | 566 bool "Debug VM red-black trees"
|
| /linux-4.1.27/Documentation/filesystems/caching/ |
| D | object.txt | 40 correspond, but the cookies tree is a superset of the union of the object trees
|
| /linux-4.1.27/fs/befs/ |
| D | ChangeLog | 125 * Added workaround for mis-understanding of the nature of the b+trees used
|
| /linux-4.1.27/Documentation/cgroups/ |
| D | blkio-controller.txt | 378 If one disables idling on individual cfq queues and cfq service trees by
|
| /linux-4.1.27/Documentation/sound/alsa/ |
| D | HD-Audio.txt | 807 The tarball and GIT trees are found in the web page at:
|
| /linux-4.1.27/Documentation/filesystems/cifs/ |
| D | CHANGES | 852 especially in deep directory trees. Fix various build warnings.
|