Searched full:leaf (Results 1 – 25 of 69) sorted by relevance
123
| /Documentation/networking/ |
| D | fib_trie.rst | 9 leaf
12 See struct leaf and struct leaf_info.
15 An internal node, holding an array of child (leaf or tnode) pointers,
71 Inserts a new leaf node in the trie. This is bit more complicated than
124 trie, key segment by key segment, until we find a leaf. check_leaf() does
125 the fib_semantic_match in the leaf's sorted prefix hlist.
132 prefix. The goal is always to reach a leaf and get a positive result from the
|
| /Documentation/devicetree/bindings/sound/ |
| D | brcm,cygnus-audio.txt | 12 - clocks: PLL and leaf clocks used by audio ports
13 - assigned-clocks: PLL and leaf clocks
18 - clock-names: names of 3 leaf clocks used by audio ports
|
| /Documentation/core-api/ |
| D | assoc_array.rst | 52 pack leaf object pointers into spare space in the node rather than making an
358 * A pointer to an object (a leaf).
440 metadata pointer. If the metadata pointer is there, any leaf whose key matches
449 any LEAF 9431809de993ba
450 any LEAF b4542910809cd
452 any LEAF f3842239082
457 any LEAF 1458952489
483 If the leaves in a full node and the leaf that is being inserted are
508 matching leaf pointer with the pointer to the new leaf after a barrier.
509 The metadata blocks don't change otherwise. An old leaf won't be freed
[all …]
|
| /Documentation/ABI/stable/ |
| D | sysfs-bus-firewire | 90 Contents of a respective textual descriptor leaf.
96 Contents of a respective textual descriptor leaf.
107 Contents of a respective textual descriptor leaf.
|
| /Documentation/filesystems/ext4/ |
| D | directory.rst | 150 ``struct ext4_dir_entry`` is placed at the end of each leaf block to
184 - Directory leaf block checksum.
186 The leaf directory block checksum is calculated against the FS UUID, the
216 minor_hash->block map to find leafe nodes. Leaf nodes contain a linear
219 entries simply overflow into the next leaf node, and the
221 us to this next leaf node is set.
234 and so only the leaf nodes will appear to have any interesting content.
|
| D | ifork.rst | 61 is a leaf node (``eh.eh_depth == 0``), then the header is followed by
123 internal node or a leaf node, described below.
133 Leaf nodes of the extent tree are recorded as ``struct ext4_extent``,
|
| D | verity.rst | 20 root to leaf, and the tree blocks within each level stored in their
|
| /Documentation/networking/devlink/ |
| D | netdevsim.rst | 65 - registerging/unregistering leaf rate objects per VF devlink port;
78 Same parameters are exposed for leaf objects in corresponding ports directories.
|
| /Documentation/devicetree/bindings/cpu/ |
| D | cpu-topology.txt | 112 A socket node can not be a leaf node.
126 A cluster node can not be a leaf node.
139 nodes are leaf nodes, otherwise they become containers of
144 A core node must be a leaf node if SMT is not supported.
146 Properties for core nodes that are leaf nodes:
154 If a core node is not a leaf node (CPUs supporting SMT) a core node's
165 always leaf nodes in the device tree.
169 A thread node must be a leaf node.
|
| /Documentation/virt/kvm/x86/ |
| D | mmu.rst | 122 shadow page contains 512 sptes, which can be either leaf or nonleaf sptes. A
123 shadow page may contain a mix of leaf and nonleaf sptes.
125 A nonleaf spte allows the hardware mmu to reach the leaf pages and
128 A leaf spte corresponds to either one or two translations encoded into
131 Leaf ptes point at guest pages.
133 The following table shows translations encoded by leaf ptes, with higher-level
155 If set, leaf sptes reachable from this page are for a linear range.
263 other means. Valid for leaf pages.
279 and unsynchronized pages" below). Leaf pages can be unsynchronized
469 information in leaf sptes. When a new memslot is added or an existing
|
| D | msr.rst | 57 leaf prior to usage.
128 of specific flags has to be checked in 0x40000001 cpuid leaf.
145 leaf prior to usage.
158 leaf prior to usage.
170 leaf prior to usage.
|
| D | cpuid.rst | 26 The value in eax corresponds to the maximum cpuid function present in this leaf,
|
| /Documentation/translations/zh_CN/core-api/ |
| D | assoc_array.rst | 393 any LEAF 9431809de993ba
394 any LEAF b4542910809cd
396 any LEAF f3842239082
401 any LEAF 1458952489
|
| /Documentation/RCU/Design/Memory-Ordering/ |
| D | Tree-RCU-Memory-Ordering.rst | 166 | by the CPU's leaf ``rcu_node`` structure's ``->lock`` as described |
354 pass will scan only the leaf ``rcu_node`` structures. However, if the
355 number of online CPUs for a given leaf ``rcu_node`` structure has
358 leaf ``rcu_node`` structure has transitioned to zero,
379 ``rcu_state`` structure's ``->gp_seq`` field) before setting each leaf
400 | its last ``rcu_gp_init()`` pass through its leaf ``rcu_node`` |
425 its leaf ``rcu_node`` lock. Therefore, all execution shown in this
491 while holding the corresponding CPU's leaf ``rcu_node`` structure's
514 transitions, they are heavier weight, and thus acquire the CPU's leaf
534 Each pass of quiescent state forcing is guaranteed to traverse the leaf
[all …]
|
| /Documentation/RCU/Design/Data-Structures/ |
| D | Data-Structures.rst | 28 of ``rcu_node`` structures. Each leaf node of the ``rcu_node`` tree has up
43 and other events are recorded by the leaf-level ``rcu_node``
65 | Because there are more types of events that affect the leaf-level |
67 | leaf ``rcu_node`` structures have fanout of 64, the contention on |
73 | thousands of CPUs may demonstrate that the fanout for the non-leaf |
77 | on the non-leaf ``rcu_node`` structures, you may use the |
79 | non-leaf fanout as needed. |
106 up the tree. This means that at the leaf-level ``rcu_node`` structure,
175 to the corresponding leaf ``rcu_node`` structure to allow
252 first leaf ``rcu_node`` structure.
[all …]
|
| /Documentation/translations/zh_CN/rust/ |
| D | general-information.rst | 60 抽象并不能用于所有的内核内部API和概念，但随着时间的推移，我们打算扩大覆盖范围。“Leaf”
|
| /Documentation/virt/acrn/ |
| D | cpuid.rst | 23 present in this leaf, and will be updated if more functions are added in the
|
| /Documentation/admin-guide/device-mapper/ |
| D | vdo-design.rst | 279 a leaf of a radix tree which consists of block map pages at each level.
293 the entire leaf level of the trees in memory, so each logical zone
294 maintains its own cache of leaf pages. The size of this cache is
296 time, and is large enough to hold all the non-leaf pages of the entire
368 the leaf page for its logical address. If any interior tree page is
393 the required leaf node. The location of the mapping (the "block map
534 There is a cache for block map leaf pages (the "block map cache"),
535 because there are usually too many block map leaf nodes to store
536 entirely in memory. If the desired leaf page is not in the cache, the
|
| /Documentation/admin-guide/mm/ |
| D | multigen_lru.rst | 39 0x0002 Clearing the accessed bit in leaf page table entries in large
46 0x0004 Clearing the accessed bit in non-leaf page table entries as
|
| /Documentation/arch/x86/ |
| D | cpuinfo.rst | 98 checked at runtime in the respective CPUID leaf [EAX=f, ECX=0] bit EDX[1].
101 cpuinfo_x86.x86_capability[] unnecessarily. For instance, the CPUID leaf
102 [EAX=7, ECX=0] has 30 features and is dense, but the CPUID leaf [EAX=7, EAX=1]
|
| /Documentation/filesystems/ |
| D | ubifs-authentication.rst | 80 - *Index*: an on-flash B+ tree where the leaf nodes contain filesystem data
258 updating and persisting changed parts from leaf node up to the root node
261 a Merkle tree. Since the leaf nodes of the index contain the actual filesystem
264 from the leaf nodes up to the root node including the master node. This process
266 Whenever a file is read, UBIFS can verify the hashes from each leaf node up to
|
| D | hpfs.rst | 160 (returning error ENOSPC). That's because file in non-leaf node in directory tree
165 to delete other files that are leaf (probability that the file is non-leaf is
|
| /Documentation/devicetree/bindings/clock/ |
| D | google,gs101-clock.yaml | 20 dividers; all other leaf clocks (other CMUs) are usually derived from CMU_TOP.
|
| D | samsung,exynos7885-clock.yaml | 24 dividers; all other leaf clocks (other CMUs) are usually derived from CMU_TOP.
|
| /Documentation/filesystems/xfs/ |
| D | xfs-online-fsck-design.rst | 1342 The mappings point to leaf blocks, remote value blocks, or dabtree blocks.
1345 Leaf blocks contain attribute key records that point to the name and the value.
1346 Names are always stored elsewhere in the same leaf block.
1348 elsewhere in the same leaf block.
1349 Remote value blocks contain values that are too large to fit inside a leaf.
1350 If the leaf information exceeds a single filesystem block, a dabtree (also
1351 rooted at block 0) is created to map hashes of the attribute names to leaf
1356 Scrub must read each block mapped by the attr fork and ignore the non-leaf
1361 attr leaf blocks.
1363 2. Walk the blocks of the attr fork looking for leaf blocks.
[all …]
|
123