| /linux-2.6.39/Documentation/ |
| D | prio_tree.txt | 32 overflow-sub-trees to handle each possible radix_index. For example,
33 in figure we have 3 overflow-sub-trees corresponding to radix indices
37 are indexed using heap and radix indices whereas the overflow-sub-trees below
39 indexed using heap and size indices. In overflow-sub-trees the size_index
65 5 [0,3,3] [2,2,4] [4,0,4] | Overflow-sub-trees
83 We do not optimize the height of overflow-sub-trees using index_bits.
84 The reason is: there can be many such overflow-sub-trees and all of
88 heap-and-size indexed overflow-sub-trees using prio_tree->index_bits.
89 Instead the overflow sub-trees are indexed using full BITS_PER_LONG bits
90 of size_index. This may lead to skewed sub-trees because most of the
[all …]
|
| 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 | 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 2.6.x
324 testing repository exists into which virtually all subsystem trees are
|
| D | 00-INDEX | 66 - description of various trees and how to apply their patches.
280 - info on what red-black trees are and what they are for.
|
| 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.
|
| /linux-2.6.39/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-2.6.39/kernel/ |
| D | audit_tree.c | 26 struct list_head trees; /* with root here */ member
155 INIT_LIST_HEAD(&chunk->trees); in alloc_chunk()
251 list_del_init(&chunk->trees); in untag_chunk()
274 list_replace_init(&chunk->trees, &new->trees); in untag_chunk()
297 list_for_each_entry(owner, &new->trees, same_root) in untag_chunk()
351 list_add(&tree->same_root, &chunk->trees); in create_chunk()
427 list_replace_init(&old->trees, &chunk->trees); in tag_chunk()
442 list_for_each_entry(owner, &chunk->trees, same_root) in tag_chunk()
447 list_add(&tree->same_root, &chunk->trees); in tag_chunk()
886 while (!list_empty(&chunk->trees)) { in evict_chunk()
[all …]
|
| D | auditsc.c | 200 struct audit_tree_refs *trees, *first_trees; member
346 struct audit_tree_refs *p = ctx->trees; in put_tree_ref()
358 ctx->trees = p; in put_tree_ref()
367 struct audit_tree_refs *p = ctx->trees; in grow_tree_refs()
368 ctx->trees = kzalloc(sizeof(struct audit_tree_refs), GFP_KERNEL); in grow_tree_refs()
369 if (!ctx->trees) { in grow_tree_refs()
370 ctx->trees = p; in grow_tree_refs()
374 p->next = ctx->trees; in grow_tree_refs()
376 ctx->first_trees = ctx->trees; in grow_tree_refs()
397 for (q = p; q != ctx->trees; q = q->next, n = 31) { in unroll_tree_refs()
[all …]
|
| /linux-2.6.39/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-2.6.39/Documentation/block/ |
| D | cfq-iosched.txt | 7 (for sequential workloads) and service trees (for random workloads) before
11 queues/service trees. This can be very helpful on highly seeky media like
|
| /linux-2.6.39/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
371 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
|
| /linux-2.6.39/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-2.6.39/Documentation/ko_KR/ |
| D | HOWTO | 325 git trees:
356 quilt trees:
|
| /linux-2.6.39/Documentation/filesystems/ |
| D | btrfs.txt | 87 btrfsck: do a limited check of the FS extent trees.
|
| 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 | 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
|
| /linux-2.6.39/fs/reiserfs/ |
| D | Kconfig | 8 Balanced trees are more efficient than traditional file system
|
| /linux-2.6.39/Documentation/devicetree/bindings/powerpc/fsl/ |
| 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
|
| /linux-2.6.39/Documentation/filesystems/pohmelfs/ |
| D | info.txt | 14 trees looking for stale requests, which have to be resent, or if number of
|
| /linux-2.6.39/Documentation/RCU/ |
| D | arrayRCU.txt | 21 to other array-of-list situations, such as radix trees.
|