| /openbmc/linux/drivers/iommu/arm/arm-smmu/ |
| H A D | qcom_iommu.c | 158 size_t granule, bool leaf, void *cookie) in qcom_iommu_tlb_inv_range_nosync() argument
164 reg = leaf ? ARM_SMMU_CB_S1_TLBIVAL : ARM_SMMU_CB_S1_TLBIVA; in qcom_iommu_tlb_inv_range_nosync()
|
| /openbmc/linux/Documentation/networking/devlink/ |
| H A D | devlink-port.rst | 347 ``leaf``
348 Represents a single devlink port; created/destroyed by the driver. Since leaf
402 until leaf node is reached, and the winner is established.
|
| H A D | ice.rst | 379 pci/0000:4b:00.0/1: type leaf parent node_25
380 pci/0000:4b:00.0/2: type leaf parent node_25
|
| /openbmc/linux/drivers/md/persistent-data/ |
| H A D | dm-btree.c | 1204 dm_block_t *new_root, struct dm_block **leaf) in btree_get_overwrite_leaf() argument
1214 *leaf = shadow_current(&spine); in btree_get_overwrite_leaf()
1422 int (*fn)(void *context, uint64_t *keys, void *leaf), in walk_node() argument
1457 int (*fn)(void *context, uint64_t *keys, void *leaf), in dm_btree_walk() argument
|
| /openbmc/linux/tools/perf/ui/stdio/ |
| H A D | hist.c | 527 if (he->leaf && hist_entry__has_callchains(he) && symbol_conf.use_callchain) { in hist_entry__hierarchy_fprintf()
877 if (!h->leaf && !hist_entry__has_hierarchy_children(h, min_pcnt)) { in hists__fprintf()
|
| /openbmc/linux/Documentation/filesystems/ |
| H A 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
|
| H A D | xfs-online-fsck-design.rst | 1348 elsewhere in the same leaf block.
1361 attr leaf blocks.
1364 For each entry inside a leaf:
1448 leaf blocks, and dabtree leaf records pointing to non-dabtree blocks elsewhere
1468 or attr leaf blocks?
2487 │leaf│
2494 │leaf│→│leaf│→│leaf│→│leaf│
2509 │leaf│→│leaf│→│leaf│→│leaf│
2526 │leaf│→│leaf│→│leaf│→│leaf│
4350 leaf blocks.
[all …]
|
| H A D | fsverity.rst | 268 to the leaf level. Within each level, the blocks are returned in
760 how Merkle tree hashing works. To verify a leaf node, you need to
780 :Q: But couldn't you store just the leaf nodes and compute the rest?
783 leaf nodes of the Merkle tree. It's true that the tree can be
784 computed much faster if the leaf level is stored rather than just
788 "just the leaf nodes" you'd already be storing over 99% of the
|
| /openbmc/linux/arch/powerpc/kvm/ |
| H A D | book3s_64_mmu_radix.c | 1396 goto leaf; in debugfs_radix_read()
1408 goto leaf; in debugfs_radix_read()
1418 leaf: in debugfs_radix_read()
|
| /openbmc/linux/arch/x86/events/intel/ |
| H A D | pt.c | 46 [PT_CAP_ ## _n] = { .name = __stringify(_n), .leaf = _l, \
51 u32 leaf; member
78 u32 c = caps[cd->leaf * PT_CPUID_REGS_NUM + cd->reg]; in intel_pt_validate_cap()
|
| /openbmc/linux/net/sched/ |
| H A D | sch_multiq.c | 373 .leaf = multiq_leaf,
|
| H A D | sch_prio.c | 396 .leaf = prio_leaf,
|
| H A D | sch_drr.c | 465 .leaf = drr_class_leaf,
|
| H A D | sch_cbs.c | 529 .leaf = cbs_leaf,
|
| /openbmc/linux/Documentation/bpf/ |
| H A D | map_lpm_trie.rst | 105 from leftmost leaf first. This means that iteration will return more
|
| /openbmc/linux/Documentation/devicetree/bindings/clock/ |
| H A D | samsung,exynos850-clock.yaml | 24 dividers; all other leaf clocks (other CMUs) are usually derived from CMU_TOP.
|
| /openbmc/linux/fs/btrfs/ |
| H A D | ctree.h | 695 int btrfs_leaf_free_space(const struct extent_buffer *leaf);
|
| H A D | zoned.c | 297 struct extent_buffer *leaf; in calculate_emulated_zone_size() local
324 leaf = path->nodes[0]; in calculate_emulated_zone_size()
325 dext = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dev_extent); in calculate_emulated_zone_size()
326 fs_info->zone_size = btrfs_dev_extent_length(leaf, dext); in calculate_emulated_zone_size()
|
| /openbmc/linux/Documentation/admin-guide/cgroup-v1/ |
| H A D | blkio-controller.rst | 9 both at leaf nodes as well as at intermediate nodes in a storage hierarchy.
15 generic block layer and can be used on leaf nodes as well as higher
|
| /openbmc/linux/lib/ |
| H A D | rhashtable.c | 124 bool leaf) in nested_table_alloc() argument
135 if (ntbl && leaf) { in nested_table_alloc()
|
| /openbmc/linux/tools/power/x86/x86_energy_perf_policy/ |
| H A D | x86_energy_perf_policy.c | 1394 static void get_cpuid_or_exit(unsigned int leaf, in get_cpuid_or_exit() argument
1398 if (!__get_cpuid(leaf, eax, ebx, ecx, edx)) in get_cpuid_or_exit()
|
| /openbmc/qemu/docs/devel/ |
| H A D | qom.rst | 351 For the simplest case of a leaf class which doesn't need any of its
404 them is that the former is for simple leaf classes that don't need
|
| /openbmc/linux/drivers/infiniband/hw/irdma/ |
| H A D | verbs.c | 2343 pinfo = (level == PBLE_LEVEL_1) ? NULL : palloc->level2.leaf; in irdma_copy_user_pgaddrs()
2384 struct irdma_pble_info *leaf = lvl2->leaf; in irdma_check_mr_contiguous() local
2397 start_addr = leaf->addr; in irdma_check_mr_contiguous()
2399 for (i = 0; i < lvl2->leaf_cnt; i++, leaf++) { in irdma_check_mr_contiguous()
2400 arr = leaf->addr; in irdma_check_mr_contiguous()
2403 ret = irdma_check_mem_contiguous(arr, leaf->cnt, pg_size); in irdma_check_mr_contiguous()
2436 palloc->level2.leaf; in irdma_setup_pbles()
2747 palloc->level2.leaf + (iwmr->npages >> PBLE_512_SHIFT); in irdma_set_page()
|
| /openbmc/linux/Documentation/ABI/testing/ |
| H A D | sysfs-block-bcache | 134 For a cache, height of the btree excluding leaf nodes (i.e. a
|
| /openbmc/linux/kernel/trace/ |
| H A D | trace_functions_graph.c | 633 bool leaf, void *func, bool hex_format) in print_graph_retval() argument
653 if (leaf) { in print_graph_retval()
|