| /Linux-v6.1/fs/btrfs/ |
| D | tree-checker.c | 10 * The objective is to do leaf/node validation checks when tree block is read
33 * @type: leaf or node
34 * @identifier: the necessary info to locate the leaf/node.
46 * Append generic "corrupt leaf/node root=%llu block=%llu slot=%d: " to @fmt.
65 btrfs_header_level(eb) == 0 ? "leaf" : "node", in generic_err()
92 btrfs_header_level(eb) == 0 ? "leaf" : "node", in file_extent_err()
102 #define CHECK_FE_ALIGNED(leaf, slot, fi, name, alignment) \ argument
104 if (unlikely(!IS_ALIGNED(btrfs_file_extent_##name((leaf), (fi)), \
106 file_extent_err((leaf), (slot), \
108 (#name), btrfs_file_extent_##name((leaf), (fi)), \
[all …]
|
| D | dir-item.c | 30 struct extent_buffer *leaf; in insert_with_overflow() local
42 leaf = path->nodes[0]; in insert_with_overflow()
43 ptr = btrfs_item_ptr(leaf, path->slots[0], char); in insert_with_overflow()
44 ASSERT(data_size <= btrfs_item_size(leaf, path->slots[0])); in insert_with_overflow()
45 ptr += btrfs_item_size(leaf, path->slots[0]) - data_size; in insert_with_overflow()
64 struct extent_buffer *leaf; in btrfs_insert_xattr_item() local
81 leaf = path->nodes[0]; in btrfs_insert_xattr_item()
83 btrfs_set_dir_item_key(leaf, dir_item, &disk_key); in btrfs_insert_xattr_item()
84 btrfs_set_dir_type(leaf, dir_item, BTRFS_FT_XATTR); in btrfs_insert_xattr_item()
85 btrfs_set_dir_name_len(leaf, dir_item, name_len); in btrfs_insert_xattr_item()
[all …]
|
| D | inode-item.c | 12 struct btrfs_inode_ref *btrfs_find_name_in_backref(struct extent_buffer *leaf, in btrfs_find_name_in_backref() argument
23 item_size = btrfs_item_size(leaf, slot); in btrfs_find_name_in_backref()
24 ptr = btrfs_item_ptr_offset(leaf, slot); in btrfs_find_name_in_backref()
27 len = btrfs_inode_ref_name_len(leaf, ref); in btrfs_find_name_in_backref()
32 if (memcmp_extent_buffer(leaf, name, name_ptr, name_len) == 0) in btrfs_find_name_in_backref()
39 struct extent_buffer *leaf, int slot, u64 ref_objectid, in btrfs_find_name_in_ext_backref() argument
49 item_size = btrfs_item_size(leaf, slot); in btrfs_find_name_in_ext_backref()
50 ptr = btrfs_item_ptr_offset(leaf, slot); in btrfs_find_name_in_ext_backref()
61 ref_name_len = btrfs_inode_extref_name_len(leaf, extref); in btrfs_find_name_in_ext_backref()
64 btrfs_inode_extref_parent(leaf, extref) == ref_objectid && in btrfs_find_name_in_ext_backref()
[all …]
|
| D | file-item.c | 151 struct extent_buffer *leaf; in btrfs_insert_hole_extent() local
165 leaf = path->nodes[0]; in btrfs_insert_hole_extent()
166 item = btrfs_item_ptr(leaf, path->slots[0], in btrfs_insert_hole_extent()
168 btrfs_set_file_extent_disk_bytenr(leaf, item, 0); in btrfs_insert_hole_extent()
169 btrfs_set_file_extent_disk_num_bytes(leaf, item, 0); in btrfs_insert_hole_extent()
170 btrfs_set_file_extent_offset(leaf, item, 0); in btrfs_insert_hole_extent()
171 btrfs_set_file_extent_num_bytes(leaf, item, num_bytes); in btrfs_insert_hole_extent()
172 btrfs_set_file_extent_ram_bytes(leaf, item, num_bytes); in btrfs_insert_hole_extent()
173 btrfs_set_file_extent_generation(leaf, item, trans->transid); in btrfs_insert_hole_extent()
174 btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG); in btrfs_insert_hole_extent()
[all …]
|
| D | ctree.c | 1768 struct extent_buffer *leaf = path->nodes[0]; in search_leaf() local
1775 * If we are doing an insertion, the leaf has enough free space and the in search_leaf()
1778 * binary search on the leaf (with search_for_key_slot()), allowing other in search_leaf()
1783 * Cache the leaf free space, since we will need it later and it in search_leaf()
1786 leaf_free_space = btrfs_leaf_free_space(leaf); in search_leaf()
1789 * !path->locks[1] means we have a single node tree, the leaf is in search_leaf()
1795 ASSERT(btrfs_header_nritems(leaf) > 0); in search_leaf()
1796 btrfs_item_key(leaf, &first_key, 0); in search_leaf()
1817 * leaf and there's no need to split the leaf. in search_leaf()
1850 ret = search_for_key_slot(leaf, search_low_slot, key, in search_leaf()
[all …]
|
| D | xattr.c | 29 struct extent_buffer *leaf; in btrfs_getxattr() local
48 leaf = path->nodes[0]; in btrfs_getxattr()
51 ret = btrfs_dir_data_len(leaf, di); in btrfs_getxattr()
56 if (btrfs_dir_data_len(leaf, di) > size) { in btrfs_getxattr()
62 * The way things are packed into the leaf is like this in btrfs_getxattr()
66 * where the data starts in the in memory leaf in btrfs_getxattr()
69 btrfs_dir_name_len(leaf, di)); in btrfs_getxattr()
70 read_extent_buffer(leaf, buffer, data_ptr, in btrfs_getxattr()
71 btrfs_dir_data_len(leaf, di)); in btrfs_getxattr()
72 ret = btrfs_dir_data_len(leaf, di); in btrfs_getxattr()
[all …]
|
| D | file.c | 521 struct extent_buffer *leaf; in btrfs_drop_extents() local
571 leaf = path->nodes[0]; in btrfs_drop_extents()
572 btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1); in btrfs_drop_extents()
579 leaf = path->nodes[0]; in btrfs_drop_extents()
580 if (path->slots[0] >= btrfs_header_nritems(leaf)) { in btrfs_drop_extents()
589 leaf = path->nodes[0]; in btrfs_drop_extents()
593 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in btrfs_drop_extents()
606 fi = btrfs_item_ptr(leaf, path->slots[0], in btrfs_drop_extents()
608 extent_type = btrfs_file_extent_type(leaf, fi); in btrfs_drop_extents()
612 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); in btrfs_drop_extents()
[all …]
|
| /Linux-v6.1/fs/xfs/libxfs/ |
| D | xfs_dir2_leaf.c | 104 struct xfs_dir2_leaf *leaf = bp->b_addr; in xfs_dir3_leaf1_check() local
107 xfs_dir2_leaf_hdr_from_disk(dp->i_mount, &leafhdr, leaf); in xfs_dir3_leaf1_check()
116 return xfs_dir3_leaf_check_int(dp->i_mount, &leafhdr, leaf, false); in xfs_dir3_leaf1_check()
142 struct xfs_dir2_leaf *leaf, in xfs_dir3_leaf_check_int() argument
152 ltp = xfs_dir2_leaf_tail_p(geo, leaf); in xfs_dir3_leaf_check_int()
162 /* Leaves and bests don't overlap in leaf format. */ in xfs_dir3_leaf_check_int()
190 * We verify the magic numbers before decoding the leaf header so that on debug
302 * Initialize a new leaf block, leaf1 or leafn magic accepted.
312 struct xfs_dir2_leaf *leaf = bp->b_addr; in xfs_dir3_leaf_init() local
328 memset(leaf, 0, sizeof(*leaf)); in xfs_dir3_leaf_init()
[all …]
|
| D | xfs_iext_tree.c | 98 * There are two types of blocks in the btree: leaf and inner (non-leaf) blocks.
100 * The leaf blocks are made up by %KEYS_PER_NODE extent records, which each
103 * leaf blocks (if there are any).
105 * The inner (non-leaf) blocks first contain KEYS_PER_NODE lookup keys, followed
109 * Leaf: | rec 1 | rec 2 | rec 3 | rec 4 | rec N | prev-ptr | next-ptr |
142 return &cur->leaf->recs[cur->pos]; in cur_rec()
148 if (!cur->leaf) in xfs_iext_valid()
202 cur->leaf = xfs_iext_find_first_leaf(ifp); in xfs_iext_first()
212 cur->leaf = xfs_iext_find_last_leaf(ifp); in xfs_iext_last()
213 if (!cur->leaf) { in xfs_iext_last()
[all …]
|
| D | xfs_dir2_node.c | 64 struct xfs_dir2_leaf *leaf = bp->b_addr; in xfs_dir3_leafn_check() local
67 xfs_dir2_leaf_hdr_from_disk(dp->i_mount, &leafhdr, leaf); in xfs_dir3_leafn_check()
76 return xfs_dir3_leaf_check_int(dp->i_mount, &leafhdr, leaf, false); in xfs_dir3_leafn_check()
400 * Convert a leaf-format directory to a node-format directory.
401 * We need to change the magic number of the leaf block, and copy
402 * the freespace table out of the leaf block into its own block.
407 struct xfs_buf *lbp) /* leaf buffer */ in xfs_dir2_leaf_to_node()
414 int i; /* leaf freespace index */ in xfs_dir2_leaf_to_node()
415 xfs_dir2_leaf_t *leaf; /* leaf structure */ in xfs_dir2_leaf_to_node() local
416 xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */ in xfs_dir2_leaf_to_node()
[all …]
|
| D | xfs_attr_leaf.c | 37 * Routines to implement leaf blocks of attributes as Btrees of hashed names.
75 STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index);
81 * of an attr leaf block. The region starts at the tail of the block and expands
83 * size for an empty leaf block and is reduced from there.
241 struct xfs_attr_leafblock *leaf, in xfs_attr3_leaf_verify_entry() argument
269 lentry = xfs_attr3_leaf_name_local(leaf, idx); in xfs_attr3_leaf_verify_entry()
276 rentry = xfs_attr3_leaf_name_remote(leaf, idx); in xfs_attr3_leaf_verify_entry()
293 * Validate an attribute leaf block.
295 * Empty leaf blocks can occur under the following circumstances:
300 * 4. The attribute is small enough to fit in a leaf block;
[all …]
|
| D | xfs_dir2_block.c | 207 * If there are stale entries we'll use one for the leaf. in xfs_dir2_block_need_space()
221 * Tag just before the first leaf entry. in xfs_dir2_block_need_space()
226 /* Data object just before the first leaf entry. */ in xfs_dir2_block_need_space()
231 * leaf data starts now, if it works at all. in xfs_dir2_block_need_space()
246 * Tag just before the first leaf entry. in xfs_dir2_block_need_space()
250 /* Data object just before the first leaf entry. */ in xfs_dir2_block_need_space()
255 * the space before the first leaf entry needs to be free so it in xfs_dir2_block_need_space()
274 * It is the biggest freespace, can it hold the leaf too? in xfs_dir2_block_need_space()
294 * compact the leaf entries.
309 int fromidx; /* source leaf index */ in xfs_dir2_block_compact()
[all …]
|
| /Linux-v6.1/tools/arch/x86/kcpuid/ |
| D | kcpuid.c | 51 /* Represent one leaf (basic or extended) */
55 * then the leafs[0] is the main leaf
120 static void leaf_print_raw(struct subleaf *leaf) in leaf_print_raw() argument
122 if (has_subleafs(leaf->index)) { in leaf_print_raw()
123 if (leaf->sub == 0) in leaf_print_raw()
124 printf("0x%08x: subleafs:\n", leaf->index); in leaf_print_raw()
127 leaf->sub, leaf->eax, leaf->ebx, leaf->ecx, leaf->edx); in leaf_print_raw()
130 leaf->index, leaf->eax, leaf->ebx, leaf->ecx, leaf->edx); in leaf_print_raw()
139 struct subleaf *leaf; in cpuid_store() local
154 perror("malloc func leaf"); in cpuid_store()
[all …]
|
| D | cpuid.csv | 2 # LEAF, SUBLEAF, register_name, bits, short_name, long_description
4 # Leaf 00H
7 # Leaf 01H
83 # Leaf 02H
86 # Leaf 03H
90 # Leaf 04H
108 # Leaf 05H
123 # Leaf 06H
152 # Leaf 07H
202 # Leaf 08H
[all …]
|
| /Linux-v6.1/arch/x86/kernel/ |
| D | sev-shared.c | 256 static int sev_cpuid_hv(struct cpuid_leaf *leaf) in sev_cpuid_hv() argument
268 if (cpuid_function_is_indexed(leaf->fn) && leaf->subfn) in sev_cpuid_hv()
271 ret = __sev_cpuid_hv(leaf->fn, GHCB_CPUID_REQ_EAX, &leaf->eax); in sev_cpuid_hv()
272 ret = ret ? : __sev_cpuid_hv(leaf->fn, GHCB_CPUID_REQ_EBX, &leaf->ebx); in sev_cpuid_hv()
273 ret = ret ? : __sev_cpuid_hv(leaf->fn, GHCB_CPUID_REQ_ECX, &leaf->ecx); in sev_cpuid_hv()
274 ret = ret ? : __sev_cpuid_hv(leaf->fn, GHCB_CPUID_REQ_EDX, &leaf->edx); in sev_cpuid_hv()
353 snp_cpuid_get_validated_func(struct cpuid_leaf *leaf) in snp_cpuid_get_validated_func() argument
361 if (e->eax_in != leaf->fn) in snp_cpuid_get_validated_func()
364 if (cpuid_function_is_indexed(leaf->fn) && e->ecx_in != leaf->subfn) in snp_cpuid_get_validated_func()
377 leaf->eax = e->eax; in snp_cpuid_get_validated_func()
[all …]
|
| /Linux-v6.1/arch/loongarch/mm/ |
| D | cache.c | 44 static void flush_cache_leaf(unsigned int leaf) in flush_cache_leaf() argument
48 struct cache_desc *cdesc = current_cpu_data.cache_leaves + leaf; in flush_cache_leaf()
55 flush_cache_line(leaf, addr); in flush_cache_leaf()
68 int leaf; in __flush_cache_all() local
72 leaf = cache_present - 1; in __flush_cache_all()
73 if (cache_inclusive(cdesc + leaf)) { in __flush_cache_all()
74 flush_cache_leaf(leaf); in __flush_cache_all()
78 for (leaf = 0; leaf < cache_present; leaf++) in __flush_cache_all()
79 flush_cache_leaf(leaf); in __flush_cache_all()
94 #define populate_cache_properties(cfg0, cdesc, level, leaf) \ argument
[all …]
|
| /Linux-v6.1/arch/x86/kernel/cpu/ |
| D | topology.c | 3 * Check for extended topology enumeration cpuid leaf 0xb and if it
15 /* leaf 0xb SMT level */
18 /* extended topology sub-leaf types */
33 * Check if given CPUID extended topology "leaf" is implemented
35 static int check_extended_topology_leaf(int leaf) in check_extended_topology_leaf() argument
39 cpuid_count(leaf, SMT_LEVEL, &eax, &ebx, &ecx, &edx); in check_extended_topology_leaf()
47 * Return best CPUID Extended Topology Leaf supported
69 int leaf; in detect_extended_topology_early() local
71 leaf = detect_extended_topology_leaf(c); in detect_extended_topology_early()
72 if (leaf < 0) in detect_extended_topology_early()
[all …]
|
| /Linux-v6.1/drivers/net/can/usb/ |
| D | Kconfig | 53 Leaf Light, Kvaser USBcan II and Kvaser Memorator Pro 5xHS.
56 - Kvaser Leaf Light
57 - Kvaser Leaf Professional HS
58 - Kvaser Leaf SemiPro HS
59 - Kvaser Leaf Professional LS
60 - Kvaser Leaf Professional SWC
61 - Kvaser Leaf Professional LIN
62 - Kvaser Leaf SemiPro LS
63 - Kvaser Leaf SemiPro SWC
66 - Kvaser Leaf Light GI
[all …]
|
| /Linux-v6.1/arch/x86/include/asm/xen/ |
| D | cpuid.h | 46 * Leaf 1 (0x40000x00)
47 * EAX: Largest Xen-information leaf. All leaves up to an including @EAX
57 * Leaf 2 (0x40000x01)
64 * Leaf 3 (0x40000x02)
77 * Leaf 4 (0x40000x03)
78 * Sub-leaf 0: EAX: bit 0: emulated tsc
85 * Sub-leaf 1: EAX: tsc offset low part
89 * Sub-leaf 2: EAX: host tsc frequency in kHz
93 * Leaf 5 (0x40000x04)
95 * Sub-leaf 0: EAX: Features
[all …]
|
| /Linux-v6.1/fs/unicode/ |
| D | mkutf8data.c | 123 * node, otherwise it is a leaf node
148 * leaf[0]: The unicode version, stored as a generation number that is
152 * leaf[1]: Canonical Combining Class. During normalization, we need
160 * leaf[2]: Decomposition. If leaf[1] == 255, then leaf[2] is the
175 #define LEAF_GEN(LEAF) ((LEAF)[0]) argument
176 #define LEAF_CCC(LEAF) ((LEAF)[1]) argument
177 #define LEAF_STR(LEAF) ((const char*)((LEAF) + 2)) argument
343 #define LEAF 0 macro
383 void *leaf = NULL; in lookup() local
386 while (!leaf && node) { in lookup()
[all …]
|
| D | utf8-norm.c | 128 * node, otherwise it is a leaf node
153 * leaf[0]: The unicode version, stored as a generation number that is
157 * leaf[1]: Canonical Combining Class. During normalization, we need
165 * leaf[2]: Decomposition. If leaf[1] == 255, then leaf[2] is the
186 #define LEAF_GEN(LEAF) ((LEAF)[0]) argument
187 #define LEAF_CCC(LEAF) ((LEAF)[1]) argument
188 #define LEAF_STR(LEAF) ((const char *)((LEAF) + 2)) argument
197 /* Size of the synthesized leaf used for Hangul syllable decomposition. */
272 /* Fill in base of leaf. */ in utf8hangul()
296 * Returns the leaf if one exists, NULL otherwise.
[all …]
|
| /Linux-v6.1/arch/mips/kernel/ |
| D | cacheinfo.c | 7 /* Populates leaf and increments to next leaf */
8 #define populate_cache(cache, leaf, c_level, c_type) \ argument
10 leaf->type = c_type; \
11 leaf->level = c_level; \
12 leaf->coherency_line_size = c->cache.linesz; \
13 leaf->number_of_sets = c->cache.sets; \
14 leaf->ways_of_associativity = c->cache.ways; \
15 leaf->size = c->cache.linesz * c->cache.sets * \
17 leaf++; \
|
| /Linux-v6.1/drivers/gpu/drm/i915/selftests/ |
| D | i915_syncmap.c | 146 static int check_seqno(struct i915_syncmap *leaf, unsigned int idx, u32 seqno) in check_seqno() argument
148 if (leaf->height) { in check_seqno()
149 pr_err("%s: not a leaf, height is %d\n", in check_seqno()
150 __func__, leaf->height); in check_seqno()
154 if (__sync_seqno(leaf)[idx] != seqno) { in check_seqno() local
156 __func__, idx, __sync_seqno(leaf)[idx], seqno); in check_seqno()
172 pr_err("Inserting first context=%llx did not return leaf (height=%d, prefix=%llx\n", in check_one()
211 * Check that inserting a new id, creates a leaf and only that leaf. in igt_syncmap_one()
247 pr_err("Inserting context=%llx did not return leaf (height=%d, prefix=%llx\n", in check_leaf()
253 …pr_err("First entry into leaf (context=%llx) does not contain a single entry, found %x (count=%d)!… in check_leaf()
[all …]
|
| /Linux-v6.1/tools/testing/selftests/cgroup/ |
| D | test_cpu.c | 411 struct cpu_hogger leaf[3] = {NULL}; in run_cpucg_nested_weight_test() local
442 for (i = 0; i < ARRAY_SIZE(leaf); i++) { in run_cpucg_nested_weight_test()
453 leaf[i].cgroup = cg_name_indexed(ancestor, "cpucg_leaf", i); in run_cpucg_nested_weight_test()
454 if (!leaf[i].cgroup) in run_cpucg_nested_weight_test()
457 if (cg_create(leaf[i].cgroup)) in run_cpucg_nested_weight_test()
460 if (cg_write_numeric(leaf[i].cgroup, "cpu.weight", weight)) in run_cpucg_nested_weight_test()
464 for (i = 0; i < ARRAY_SIZE(leaf); i++) { in run_cpucg_nested_weight_test()
475 pid = cg_run_nowait(leaf[i].cgroup, hog_cpus_timed, in run_cpucg_nested_weight_test()
479 leaf[i].pid = pid; in run_cpucg_nested_weight_test()
482 for (i = 0; i < ARRAY_SIZE(leaf); i++) { in run_cpucg_nested_weight_test()
[all …]
|
| /Linux-v6.1/net/ipv6/ |
| D | ip6_fib.c | 246 rcu_assign_pointer(table->tb6_root.leaf, in fib6_alloc_table()
462 err = fib6_rt_dump(w->leaf, w->args); in fib6_node_dump()
463 w->leaf = NULL; in fib6_node_dump()
525 w->leaf = rt; in fib6_dump_node()
546 w->leaf = NULL; in fib6_dump_node()
762 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_1() local
764 key = (struct rt6key *)((u8 *)leaf + offset); in fib6_add_1()
790 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
791 fib6_info_release(leaf); in fib6_add_1()
794 rcu_access_pointer(fn->leaf) == in fib6_add_1()
[all …]
|
