| /Linux-v5.15/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 | 31 struct extent_buffer *leaf; in insert_with_overflow() local
43 leaf = path->nodes[0]; in insert_with_overflow()
45 ptr = btrfs_item_ptr(leaf, path->slots[0], char); in insert_with_overflow()
46 BUG_ON(data_size > btrfs_item_size(leaf, item)); in insert_with_overflow()
47 ptr += btrfs_item_size(leaf, item) - data_size; in insert_with_overflow()
66 struct extent_buffer *leaf; in btrfs_insert_xattr_item() local
83 leaf = path->nodes[0]; in btrfs_insert_xattr_item()
85 btrfs_set_dir_item_key(leaf, dir_item, &disk_key); in btrfs_insert_xattr_item()
86 btrfs_set_dir_type(leaf, dir_item, BTRFS_FT_XATTR); in btrfs_insert_xattr_item()
87 btrfs_set_dir_name_len(leaf, dir_item, name_len); in btrfs_insert_xattr_item()
[all …]
|
| D | inode-item.c | 11 struct btrfs_inode_ref *btrfs_find_name_in_backref(struct extent_buffer *leaf, in btrfs_find_name_in_backref() argument
22 item_size = btrfs_item_size_nr(leaf, slot); in btrfs_find_name_in_backref()
23 ptr = btrfs_item_ptr_offset(leaf, slot); in btrfs_find_name_in_backref()
26 len = btrfs_inode_ref_name_len(leaf, ref); in btrfs_find_name_in_backref()
31 if (memcmp_extent_buffer(leaf, name, name_ptr, name_len) == 0) in btrfs_find_name_in_backref()
38 struct extent_buffer *leaf, int slot, u64 ref_objectid, in btrfs_find_name_in_ext_backref() argument
48 item_size = btrfs_item_size_nr(leaf, slot); in btrfs_find_name_in_ext_backref()
49 ptr = btrfs_item_ptr_offset(leaf, slot); in btrfs_find_name_in_ext_backref()
60 ref_name_len = btrfs_inode_extref_name_len(leaf, extref); in btrfs_find_name_in_ext_backref()
63 btrfs_inode_extref_parent(leaf, extref) == ref_objectid && in btrfs_find_name_in_ext_backref()
[all …]
|
| D | file-item.c | 143 struct extent_buffer *leaf; in btrfs_insert_file_extent() local
157 leaf = path->nodes[0]; in btrfs_insert_file_extent()
158 item = btrfs_item_ptr(leaf, path->slots[0], in btrfs_insert_file_extent()
160 btrfs_set_file_extent_disk_bytenr(leaf, item, disk_offset); in btrfs_insert_file_extent()
161 btrfs_set_file_extent_disk_num_bytes(leaf, item, disk_num_bytes); in btrfs_insert_file_extent()
162 btrfs_set_file_extent_offset(leaf, item, offset); in btrfs_insert_file_extent()
163 btrfs_set_file_extent_num_bytes(leaf, item, num_bytes); in btrfs_insert_file_extent()
164 btrfs_set_file_extent_ram_bytes(leaf, item, ram_bytes); in btrfs_insert_file_extent()
165 btrfs_set_file_extent_generation(leaf, item, trans->transid); in btrfs_insert_file_extent()
166 btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG); in btrfs_insert_file_extent()
[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 | ctree.c | 1672 * If @key is found, 0 is returned and you can find the item in the leaf level
1675 * If @key isn't found, 1 is returned and the leaf level of the path (level 0)
1831 * accounts the size btrfs_item, deduct it here so leaf in btrfs_search_slot()
2045 struct extent_buffer *leaf; in btrfs_search_slot_for_read() local
2054 * but in case the previous item is the last in a leaf, path points in btrfs_search_slot_for_read()
2055 * to the first free slot in the previous leaf, i.e. at an invalid in btrfs_search_slot_for_read()
2058 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
2061 if (p->slots[0] >= btrfs_header_nritems(leaf)) { in btrfs_search_slot_for_read()
2082 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
2083 if (p->slots[0] == btrfs_header_nritems(leaf)) in btrfs_search_slot_for_read()
[all …]
|
| D | extent-tree.c | 49 struct extent_buffer *leaf,
123 struct extent_buffer *leaf; in btrfs_lookup_extent_info() local
173 leaf = path->nodes[0]; in btrfs_lookup_extent_info()
174 item_size = btrfs_item_size_nr(leaf, path->slots[0]); in btrfs_lookup_extent_info()
176 ei = btrfs_item_ptr(leaf, path->slots[0], in btrfs_lookup_extent_info()
178 num_refs = btrfs_extent_refs(leaf, ei); in btrfs_lookup_extent_info()
179 extent_flags = btrfs_extent_flags(leaf, ei); in btrfs_lookup_extent_info()
319 * - number of pointers in the tree leaf
322 * the tree leaf
332 * (btrfs_header_owner(leaf), inode objectid, offset in file)
[all …]
|
| D | file.c | 694 struct extent_buffer *leaf; in btrfs_drop_extents() local
745 leaf = path->nodes[0]; in btrfs_drop_extents()
746 btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1); in btrfs_drop_extents()
754 leaf = path->nodes[0]; in btrfs_drop_extents()
755 if (path->slots[0] >= btrfs_header_nritems(leaf)) { in btrfs_drop_extents()
765 leaf = path->nodes[0]; in btrfs_drop_extents()
769 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in btrfs_drop_extents()
782 fi = btrfs_item_ptr(leaf, path->slots[0], in btrfs_drop_extents()
784 extent_type = btrfs_file_extent_type(leaf, fi); in btrfs_drop_extents()
788 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); in btrfs_drop_extents()
[all …]
|
| /Linux-v5.15/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
150 ltp = xfs_dir2_leaf_tail_p(geo, leaf); in xfs_dir3_leaf_check_int()
160 /* Leaves and bests don't overlap in leaf format. */ in xfs_dir3_leaf_check_int()
185 * We verify the magic numbers before decoding the leaf header so that on debug
297 * Initialize a new leaf block, leaf1 or leafn magic accepted.
307 struct xfs_dir2_leaf *leaf = bp->b_addr; in xfs_dir3_leaf_init() local
323 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 | 36 * Routines to implement leaf blocks of attributes as Btrees of hashed names.
74 STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index);
80 * of an attr leaf block. The region starts at the tail of the block and expands
82 * size for an empty leaf block and is reduced from there.
240 struct xfs_attr_leafblock *leaf, in xfs_attr3_leaf_verify_entry() argument
268 lentry = xfs_attr3_leaf_name_local(leaf, idx); in xfs_attr3_leaf_verify_entry()
275 rentry = xfs_attr3_leaf_name_remote(leaf, idx); in xfs_attr3_leaf_verify_entry()
297 struct xfs_attr_leafblock *leaf = bp->b_addr; in xfs_attr3_leaf_verify() local
306 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf); in xfs_attr3_leaf_verify()
318 if (ichdr.firstused < xfs_attr3_leaf_hdr_size(leaf)) in xfs_attr3_leaf_verify()
[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-v5.15/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-v5.15/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-v5.15/fs/unicode/ |
| D | utf8-norm.c | 145 * node, otherwise it is a leaf node
170 * leaf[0]: The unicode version, stored as a generation number that is
174 * leaf[1]: Canonical Combining Class. During normalization, we need
182 * leaf[2]: Decomposition. If leaf[1] == 255, then leaf[2] is the
203 #define LEAF_GEN(LEAF) ((LEAF)[0]) argument
204 #define LEAF_CCC(LEAF) ((LEAF)[1]) argument
205 #define LEAF_STR(LEAF) ((const char *)((LEAF) + 2)) argument
214 /* Size of the synthesized leaf used for Hangul syllable decomposition. */
289 /* Fill in base of leaf. */ in utf8hangul()
313 * Returns the leaf if one exists, NULL otherwise.
[all …]
|
| 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 …]
|
| /Linux-v5.15/drivers/net/can/usb/ |
| D | Kconfig | 46 Leaf Light, Kvaser USBcan II and Kvaser Memorator Pro 5xHS.
49 - Kvaser Leaf Light
50 - Kvaser Leaf Professional HS
51 - Kvaser Leaf SemiPro HS
52 - Kvaser Leaf Professional LS
53 - Kvaser Leaf Professional SWC
54 - Kvaser Leaf Professional LIN
55 - Kvaser Leaf SemiPro LS
56 - Kvaser Leaf SemiPro SWC
59 - Kvaser Leaf Light GI
[all …]
|
| /Linux-v5.15/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-v5.15/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-v5.15/drivers/net/can/usb/kvaser_usb/ |
| D | kvaser_usb_leaf.c | 3 * - Kvaser linux leaf driver (version 4.78)
56 /* Leaf/usbcan command ids */
93 /* Only Leaf-based devices can report M16C error factors,
182 } __packed leaf; member
305 } __packed leaf; member
320 /* Summary of a kvaser error event, for a unified Leaf/Usbcan error
335 } leaf; member
362 switch (dev->card_data.leaf.family) { in kvaser_usb_leaf_frame_to_cmd()
364 cmd_tx_can_flags = &cmd->u.tx_can.leaf.flags; in kvaser_usb_leaf_frame_to_cmd()
487 switch (dev->card_data.leaf.family) { in kvaser_usb_leaf_get_software_info_inner()
[all …]
|
| /Linux-v5.15/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-v5.15/net/ipv6/ |
| D | ip6_fib.c | 245 rcu_assign_pointer(table->tb6_root.leaf, in fib6_alloc_table()
461 err = fib6_rt_dump(w->leaf, w->args); in fib6_node_dump()
462 w->leaf = NULL; in fib6_node_dump()
524 w->leaf = rt; in fib6_dump_node()
545 w->leaf = NULL; in fib6_dump_node()
760 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_1() local
762 key = (struct rt6key *)((u8 *)leaf + offset); in fib6_add_1()
788 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
789 fib6_info_release(leaf); in fib6_add_1()
792 rcu_access_pointer(fn->leaf) == in fib6_add_1()
[all …]
|
| /Linux-v5.15/fs/gfs2/ |
| D | dir.c | 34 * beginning of the leaf block. The dirents reside in leaves when
41 * used as an array of 64-bit block pointers pointing to the leaf blocks. The
43 * block pointer in the array that points to the same leaf. In fact, when a
45 * point to the same leaf.
47 * When a leaf is completely full, the size of the hash table can be
770 * get_leaf_nr - Get a leaf number associated with the index
772 * @index: hash table index of the targeted leaf
773 * @leaf_out: Resulting leaf block number
816 struct gfs2_leaf *leaf; in gfs2_dirent_search() local
834 leaf = (struct gfs2_leaf *)bh->b_data; in gfs2_dirent_search()
[all …]
|
