| /Linux-v6.6/fs/btrfs/ |
| D | tree-checker.c | 10 * The objective is to do leaf/node validation checks when tree block is read
37 * @type: leaf or node
38 * @identifier: the necessary info to locate the leaf/node.
50 * Append generic "corrupt leaf/node root=%llu block=%llu slot=%d: " to @fmt.
69 btrfs_header_level(eb) == 0 ? "leaf" : "node", in generic_err()
96 btrfs_header_level(eb) == 0 ? "leaf" : "node", in file_extent_err()
106 #define CHECK_FE_ALIGNED(leaf, slot, fi, name, alignment) \ argument
108 if (unlikely(!IS_ALIGNED(btrfs_file_extent_##name((leaf), (fi)), \
110 file_extent_err((leaf), (slot), \
112 (#name), btrfs_file_extent_##name((leaf), (fi)), \
[all …]
|
| D | dir-item.c | 33 struct extent_buffer *leaf; in insert_with_overflow() local
45 leaf = path->nodes[0]; in insert_with_overflow()
46 ptr = btrfs_item_ptr(leaf, path->slots[0], char); in insert_with_overflow()
47 ASSERT(data_size <= btrfs_item_size(leaf, path->slots[0])); in insert_with_overflow()
48 ptr += btrfs_item_size(leaf, path->slots[0]) - data_size; in insert_with_overflow()
67 struct extent_buffer *leaf; in btrfs_insert_xattr_item() local
84 leaf = path->nodes[0]; in btrfs_insert_xattr_item()
86 btrfs_set_dir_item_key(leaf, dir_item, &disk_key); in btrfs_insert_xattr_item()
87 btrfs_set_dir_flags(leaf, dir_item, BTRFS_FT_XATTR); in btrfs_insert_xattr_item()
88 btrfs_set_dir_name_len(leaf, dir_item, name_len); in btrfs_insert_xattr_item()
[all …]
|
| D | inode-item.c | 18 struct btrfs_inode_ref *btrfs_find_name_in_backref(struct extent_buffer *leaf, in btrfs_find_name_in_backref() argument
29 item_size = btrfs_item_size(leaf, slot); in btrfs_find_name_in_backref()
30 ptr = btrfs_item_ptr_offset(leaf, slot); in btrfs_find_name_in_backref()
33 len = btrfs_inode_ref_name_len(leaf, ref); in btrfs_find_name_in_backref()
38 if (memcmp_extent_buffer(leaf, name->name, name_ptr, in btrfs_find_name_in_backref()
46 struct extent_buffer *leaf, int slot, u64 ref_objectid, in btrfs_find_name_in_ext_backref() argument
56 item_size = btrfs_item_size(leaf, slot); in btrfs_find_name_in_ext_backref()
57 ptr = btrfs_item_ptr_offset(leaf, slot); in btrfs_find_name_in_ext_backref()
68 ref_name_len = btrfs_inode_extref_name_len(leaf, extref); in btrfs_find_name_in_ext_backref()
71 btrfs_inode_extref_parent(leaf, extref) == ref_objectid && in btrfs_find_name_in_ext_backref()
[all …]
|
| D | file-item.c | 169 struct extent_buffer *leaf; in btrfs_insert_hole_extent() local
183 leaf = path->nodes[0]; in btrfs_insert_hole_extent()
184 item = btrfs_item_ptr(leaf, path->slots[0], in btrfs_insert_hole_extent()
186 btrfs_set_file_extent_disk_bytenr(leaf, item, 0); in btrfs_insert_hole_extent()
187 btrfs_set_file_extent_disk_num_bytes(leaf, item, 0); in btrfs_insert_hole_extent()
188 btrfs_set_file_extent_offset(leaf, item, 0); in btrfs_insert_hole_extent()
189 btrfs_set_file_extent_num_bytes(leaf, item, num_bytes); in btrfs_insert_hole_extent()
190 btrfs_set_file_extent_ram_bytes(leaf, item, num_bytes); in btrfs_insert_hole_extent()
191 btrfs_set_file_extent_generation(leaf, item, trans->transid); in btrfs_insert_hole_extent()
192 btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG); in btrfs_insert_hole_extent()
[all …]
|
| D | ctree.c | 54 * The leaf data grows from end-to-front in the node. this returns the address
55 * of the start of the last item, which is the stop of the leaf data stack.
57 static unsigned int leaf_data_end(const struct extent_buffer *leaf) in leaf_data_end() argument
59 u32 nr = btrfs_header_nritems(leaf); in leaf_data_end()
62 return BTRFS_LEAF_DATA_SIZE(leaf->fs_info); in leaf_data_end()
63 return btrfs_item_offset(leaf, nr - 1); in leaf_data_end()
67 * Move data in a @leaf (using memmove, safe for overlapping ranges).
69 * @leaf: leaf that we're doing a memmove on
75 * the leaf. The btrfs_item offset's start directly after the header, so we
76 * have to adjust any offsets to account for the header in the leaf. This
[all …]
|
| D | xattr.c | 33 struct extent_buffer *leaf; in btrfs_getxattr() local
52 leaf = path->nodes[0]; in btrfs_getxattr()
55 ret = btrfs_dir_data_len(leaf, di); in btrfs_getxattr()
60 if (btrfs_dir_data_len(leaf, di) > size) { in btrfs_getxattr()
66 * The way things are packed into the leaf is like this in btrfs_getxattr()
70 * where the data starts in the in memory leaf in btrfs_getxattr()
73 btrfs_dir_name_len(leaf, di)); in btrfs_getxattr()
74 read_extent_buffer(leaf, buffer, data_ptr, in btrfs_getxattr()
75 btrfs_dir_data_len(leaf, di)); in btrfs_getxattr()
76 ret = btrfs_dir_data_len(leaf, di); in btrfs_getxattr()
[all …]
|
| /Linux-v6.6/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.6/tools/arch/x86/kcpuid/ |
| D | kcpuid.c | 55 /* Represent one leaf (basic or extended) */
59 * then the leafs[0] is the main leaf
124 static void leaf_print_raw(struct subleaf *leaf) in leaf_print_raw() argument
126 if (has_subleafs(leaf->index)) { in leaf_print_raw()
127 if (leaf->sub == 0) in leaf_print_raw()
128 printf("0x%08x: subleafs:\n", leaf->index); in leaf_print_raw()
131 leaf->sub, leaf->eax, leaf->ebx, leaf->ecx, leaf->edx); in leaf_print_raw()
134 leaf->index, leaf->eax, leaf->ebx, leaf->ecx, leaf->edx); in leaf_print_raw()
143 struct subleaf *leaf; in cpuid_store() local
158 perror("malloc func leaf"); in cpuid_store()
[all …]
|
| /Linux-v6.6/arch/x86/kernel/ |
| D | sev-shared.c | 259 static int __sev_cpuid_hv_msr(struct cpuid_leaf *leaf) in __sev_cpuid_hv_msr() argument
271 if (cpuid_function_is_indexed(leaf->fn) && leaf->subfn) in __sev_cpuid_hv_msr()
274 ret = __sev_cpuid_hv(leaf->fn, GHCB_CPUID_REQ_EAX, &leaf->eax); in __sev_cpuid_hv_msr()
275 ret = ret ? : __sev_cpuid_hv(leaf->fn, GHCB_CPUID_REQ_EBX, &leaf->ebx); in __sev_cpuid_hv_msr()
276 ret = ret ? : __sev_cpuid_hv(leaf->fn, GHCB_CPUID_REQ_ECX, &leaf->ecx); in __sev_cpuid_hv_msr()
277 ret = ret ? : __sev_cpuid_hv(leaf->fn, GHCB_CPUID_REQ_EDX, &leaf->edx); in __sev_cpuid_hv_msr()
282 static int __sev_cpuid_hv_ghcb(struct ghcb *ghcb, struct es_em_ctxt *ctxt, struct cpuid_leaf *leaf) in __sev_cpuid_hv_ghcb() argument
287 ghcb_set_rax(ghcb, leaf->fn); in __sev_cpuid_hv_ghcb()
288 ghcb_set_rcx(ghcb, leaf->subfn); in __sev_cpuid_hv_ghcb()
307 leaf->eax = ghcb->save.rax; in __sev_cpuid_hv_ghcb()
[all …]
|
| /Linux-v6.6/drivers/gpu/drm/nouveau/nvkm/core/ |
| D | intr.c | 30 enum nvkm_intr_type type, int *leaf, u32 *mask) in nvkm_intr_xlat() argument
46 *leaf = data->leaf; in nvkm_intr_xlat()
54 *leaf = data->leaf; in nvkm_intr_xlat()
66 *leaf = type / 32; in nvkm_intr_xlat()
76 nvkm_intr_find(struct nvkm_subdev *subdev, enum nvkm_intr_type type, int *leaf, u32 *mask) in nvkm_intr_find() argument
82 ret = nvkm_intr_xlat(subdev, intr, type, leaf, mask); in nvkm_intr_find()
91 nvkm_intr_allow_locked(struct nvkm_intr *intr, int leaf, u32 mask) in nvkm_intr_allow_locked() argument
93 intr->mask[leaf] |= mask; in nvkm_intr_allow_locked()
96 intr->func->reset(intr, leaf, mask); in nvkm_intr_allow_locked()
97 intr->func->allow(intr, leaf, mask); in nvkm_intr_allow_locked()
[all …]
|
| /Linux-v6.6/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.6/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.6/drivers/gpu/drm/nouveau/nvkm/subdev/mc/ |
| D | nv04.c | 75 int leaf; in nv04_mc_intr_rearm() local
77 for (leaf = 0; leaf < intr->leaves; leaf++) in nv04_mc_intr_rearm()
78 nvkm_wr32(mc->subdev.device, 0x000140 + (leaf * 4), 0x00000001); in nv04_mc_intr_rearm()
85 int leaf; in nv04_mc_intr_unarm() local
87 for (leaf = 0; leaf < intr->leaves; leaf++) in nv04_mc_intr_unarm()
88 nvkm_wr32(mc->subdev.device, 0x000140 + (leaf * 4), 0x00000000); in nv04_mc_intr_unarm()
98 int leaf; in nv04_mc_intr_pending() local
100 for (leaf = 0; leaf < intr->leaves; leaf++) { in nv04_mc_intr_pending()
101 intr->stat[leaf] = nvkm_rd32(mc->subdev.device, 0x000100 + (leaf * 4)); in nv04_mc_intr_pending()
102 if (intr->stat[leaf]) in nv04_mc_intr_pending()
|
| /Linux-v6.6/drivers/gpu/drm/nouveau/nvkm/subdev/vfn/ |
| D | tu102.c | 27 tu102_vfn_intr_reset(struct nvkm_intr *intr, int leaf, u32 mask) in tu102_vfn_intr_reset() argument
31 nvkm_wr32(vfn->subdev.device, vfn->addr.priv + 0x1000 + (leaf * 4), mask); in tu102_vfn_intr_reset()
35 tu102_vfn_intr_allow(struct nvkm_intr *intr, int leaf, u32 mask) in tu102_vfn_intr_allow() argument
39 nvkm_wr32(vfn->subdev.device, vfn->addr.priv + 0x1200 + (leaf * 4), mask); in tu102_vfn_intr_allow()
43 tu102_vfn_intr_block(struct nvkm_intr *intr, int leaf, u32 mask) in tu102_vfn_intr_block() argument
47 nvkm_wr32(vfn->subdev.device, vfn->addr.priv + 0x1400 + (leaf * 4), mask); in tu102_vfn_intr_block()
72 int pending = 0, leaf; in tu102_vfn_intr_pending() local
74 for (leaf = 0; leaf < 8; leaf++) { in tu102_vfn_intr_pending()
75 if (intr_top & BIT(leaf / 2)) { in tu102_vfn_intr_pending()
76 intr->stat[leaf] = nvkm_rd32(device, vfn->addr.priv + 0x1000 + (leaf * 4)); in tu102_vfn_intr_pending()
[all …]
|
| /Linux-v6.6/drivers/net/can/usb/kvaser_usb/ |
| D | kvaser_usb_leaf.c | 3 * - Kvaser linux leaf driver (version 4.78)
54 /* Leaf/usbcan command ids */
87 /* Leaf frequency options */
105 /* Only Leaf-based devices can report M16C error factors,
180 } __packed leaf; member
350 } __packed leaf; member
374 [CMD_GET_SOFTWARE_INFO_REPLY] = kvaser_fsize(u.leaf.softinfo),
375 [CMD_RX_STD_MESSAGE] = kvaser_fsize(u.leaf.rx_can),
376 [CMD_RX_EXT_MESSAGE] = kvaser_fsize(u.leaf.rx_can),
377 [CMD_LEAF_LOG_MESSAGE] = kvaser_fsize(u.leaf.log_message),
[all …]
|
| /Linux-v6.6/drivers/net/can/usb/ |
| D | Kconfig | 70 Leaf Light, Kvaser USBcan II and Kvaser Memorator Pro 5xHS.
73 - Kvaser Leaf Light
74 - Kvaser Leaf Professional HS
75 - Kvaser Leaf SemiPro HS
76 - Kvaser Leaf Professional LS
77 - Kvaser Leaf Professional SWC
78 - Kvaser Leaf Professional LIN
79 - Kvaser Leaf SemiPro LS
80 - Kvaser Leaf SemiPro SWC
83 - Kvaser Leaf Light GI
[all …]
|
| /Linux-v6.6/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
102 * Leaf 5 (0x40000x04)
104 * Sub-leaf 0: EAX: Features
[all …]
|
| /Linux-v6.6/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.6/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.6/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 …]
|
