| /linux-6.1.9/fs/btrfs/ |
| D | tree-checker.c | 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)), \
110 (!IS_ALIGNED(btrfs_file_extent_##name((leaf), (fi)), (alignment))); \
113 static u64 file_extent_end(struct extent_buffer *leaf, in file_extent_end() argument
120 if (btrfs_file_extent_type(leaf, extent) == BTRFS_FILE_EXTENT_INLINE) { in file_extent_end()
121 len = btrfs_file_extent_ram_bytes(leaf, extent); in file_extent_end()
122 end = ALIGN(key->offset + len, leaf->fs_info->sectorsize); in file_extent_end()
124 len = btrfs_file_extent_num_bytes(leaf, extent); in file_extent_end()
[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 | 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()
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()
169 struct extent_buffer *leaf = path->nodes[0]; in btrfs_setxattr() local
170 const u16 old_data_len = btrfs_dir_data_len(leaf, di); in btrfs_setxattr()
[all …]
|
| D | ctree.c | 1768 struct extent_buffer *leaf = path->nodes[0]; in search_leaf() local
1786 leaf_free_space = btrfs_leaf_free_space(leaf); in search_leaf()
1795 ASSERT(btrfs_header_nritems(leaf) > 0); in search_leaf()
1796 btrfs_item_key(leaf, &first_key, 0); in search_leaf()
1850 ret = search_for_key_slot(leaf, search_low_slot, key, in search_leaf()
2280 struct extent_buffer *leaf; in btrfs_search_slot_for_read() local
2293 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
2296 if (p->slots[0] >= btrfs_header_nritems(leaf)) { in btrfs_search_slot_for_read()
2317 leaf = p->nodes[0]; in btrfs_search_slot_for_read()
2318 if (p->slots[0] == btrfs_header_nritems(leaf)) in btrfs_search_slot_for_read()
[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 …]
|
| D | root-tree.c | 208 struct extent_buffer *leaf; in btrfs_find_orphan_roots() local
232 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
233 if (path->slots[0] >= btrfs_header_nritems(leaf)) { in btrfs_find_orphan_roots()
239 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
242 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in btrfs_find_orphan_roots()
337 struct extent_buffer *leaf; in btrfs_del_root_ref() local
354 leaf = path->nodes[0]; in btrfs_del_root_ref()
355 ref = btrfs_item_ptr(leaf, path->slots[0], in btrfs_del_root_ref()
358 if ((btrfs_root_ref_dirid(leaf, ref) != dirid) || in btrfs_del_root_ref()
359 (btrfs_root_ref_name_len(leaf, ref) != name_len) || in btrfs_del_root_ref()
[all …]
|
| D | extent-tree.c | 49 struct extent_buffer *leaf,
125 struct extent_buffer *leaf; in btrfs_lookup_extent_info() local
176 leaf = path->nodes[0]; in btrfs_lookup_extent_info()
177 item_size = btrfs_item_size(leaf, path->slots[0]); in btrfs_lookup_extent_info()
179 ei = btrfs_item_ptr(leaf, path->slots[0], in btrfs_lookup_extent_info()
181 num_refs = btrfs_extent_refs(leaf, ei); in btrfs_lookup_extent_info()
182 extent_flags = btrfs_extent_flags(leaf, ei); in btrfs_lookup_extent_info()
424 static u64 hash_extent_data_ref_item(struct extent_buffer *leaf, in hash_extent_data_ref_item() argument
427 return hash_extent_data_ref(btrfs_extent_data_ref_root(leaf, ref), in hash_extent_data_ref_item()
428 btrfs_extent_data_ref_objectid(leaf, ref), in hash_extent_data_ref_item()
[all …]
|
| /linux-6.1.9/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-6.1.9/fs/xfs/libxfs/ |
| D | xfs_iext_tree.c | 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()
219 if (xfs_iext_rec_is_empty(&cur->leaf->recs[i])) in xfs_iext_last()
230 if (!cur->leaf) { in xfs_iext_next()
241 cur->leaf->next) { in xfs_iext_next()
242 cur->leaf = cur->leaf->next; in xfs_iext_next()
252 if (!cur->leaf) { in xfs_iext_prev()
[all …]
|
| 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()
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()
329 leaf->hdr.info.magic = cpu_to_be16(type); in xfs_dir3_leaf_init()
339 ltp = xfs_dir2_leaf_tail_p(mp->m_dir_geo, leaf); in xfs_dir3_leaf_init()
396 xfs_dir2_leaf_t *leaf; /* leaf structure */ in xfs_dir2_block_to_leaf() local
[all …]
|
| D | xfs_attr_leaf.c | 75 STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index);
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()
315 struct xfs_attr_leafblock *leaf = bp->b_addr; in xfs_attr3_leaf_verify() local
324 xfs_attr3_leaf_hdr_from_disk(mp->m_attr_geo, &ichdr, leaf); in xfs_attr3_leaf_verify()
336 if (ichdr.firstused < xfs_attr3_leaf_hdr_size(leaf)) in xfs_attr3_leaf_verify()
354 fa = xfs_attr3_leaf_verify_entry(mp, buf_end, leaf, &ichdr, in xfs_attr3_leaf_verify()
1010 struct xfs_attr_leafblock *leaf; in xfs_attr_shortform_allfit() local
1018 leaf = bp->b_addr; in xfs_attr_shortform_allfit()
[all …]
|
| /linux-6.1.9/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-6.1.9/tools/arch/x86/kcpuid/ |
| D | kcpuid.c | 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
159 func->leafs = realloc(func->leafs, (s + 1) * sizeof(*leaf)); in cpuid_store()
166 leaf = &func->leafs[s]; in cpuid_store()
168 leaf->index = f; in cpuid_store()
[all …]
|
| /linux-6.1.9/drivers/net/ethernet/dec/tulip/ |
| D | eeprom.c | 243 struct medialeaf *leaf = &mtable->mleaf[i]; in tulip_parse_eeprom() local
246 leaf->type = 0; in tulip_parse_eeprom()
247 leaf->media = p[0] & 0x3f; in tulip_parse_eeprom()
248 leaf->leafdata = p; in tulip_parse_eeprom()
253 leaf->type = p[1]; in tulip_parse_eeprom()
256 leaf->media = p[2] & 0x0f; in tulip_parse_eeprom()
262 leaf->leafdata = p + 2; in tulip_parse_eeprom()
269 leaf->media = 11; in tulip_parse_eeprom()
275 leaf->media = p[2] & MEDIA_MASK; in tulip_parse_eeprom()
277 if (tp->chip_id == DM910X && leaf->media == 1) in tulip_parse_eeprom()
[all …]
|
| /linux-6.1.9/arch/x86/kernel/cpu/ |
| D | topology.c | 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()
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()
77 cpuid_count(leaf, SMT_LEVEL, &eax, &ebx, &ecx, &edx); in detect_extended_topology_early()
101 int leaf; in detect_extended_topology() local
103 leaf = detect_extended_topology_leaf(c); in detect_extended_topology()
104 if (leaf < 0) in detect_extended_topology()
110 cpuid_count(leaf, SMT_LEVEL, &eax, &ebx, &ecx, &edx); in detect_extended_topology()
[all …]
|
| /linux-6.1.9/fs/unicode/ |
| D | mkutf8data.c | 383 void *leaf = NULL; in lookup() local
386 while (!leaf && node) { in lookup()
394 leaf = node->right; in lookup()
403 leaf = node->left; in lookup()
410 return leaf; in lookup()
533 static int insert(struct tree *tree, char *key, int keylen, void *leaf) in insert() argument
559 *cursor = leaf; in insert()
577 leaf = node->left; in insert()
582 tree->root = leaf; in insert()
585 parent->left = leaf; in insert()
[all …]
|
| D | utf8-norm.c | 389 utf8leaf_t *leaf; in utf8nlen() local
394 leaf = utf8nlookup(um, n, hangul, s, len); in utf8nlen()
395 if (!leaf) in utf8nlen()
397 if (um->tables->utf8agetab[LEAF_GEN(leaf)] > in utf8nlen()
400 else if (LEAF_CCC(leaf) == DECOMPOSE) in utf8nlen()
401 ret += strlen(LEAF_STR(leaf)); in utf8nlen()
473 utf8leaf_t *leaf; in utf8byte() local
500 leaf = utf8lookup(u8c->um, u8c->n, u8c->hangul, u8c->s); in utf8byte()
502 leaf = utf8nlookup(u8c->um, u8c->n, u8c->hangul, in utf8byte()
507 if (!leaf) in utf8byte()
[all …]
|
| /linux-6.1.9/drivers/net/can/usb/kvaser_usb/ |
| D | kvaser_usb_leaf.c | 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),
378 [CMD_CHIP_STATE_EVENT] = kvaser_fsize(u.leaf.chip_state_event),
379 [CMD_CAN_ERROR_EVENT] = kvaser_fsize(u.leaf.can_error_event),
380 [CMD_GET_CAPABILITIES_RESP] = kvaser_fsize(u.leaf.cap_res),
382 [CMD_ERROR_EVENT] = kvaser_fsize(u.leaf.error_event),
[all …]
|
| /linux-6.1.9/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-6.1.9/arch/mips/kernel/ |
| D | cacheinfo.c | 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-6.1.9/tools/testing/selftests/bpf/progs/ |
| D | xdpwall.c | 118 __u8 *leaf; in filter_ipv6_addr() local
120 leaf = bpf_map_lookup_elem(&v6_addr_map, ipv6addr); in filter_ipv6_addr()
122 return leaf ? *leaf : 0; in filter_ipv6_addr()
127 __u8 *leaf; in filter_ipv4_addr() local
129 leaf = bpf_map_lookup_elem(&v4_addr_map, &ipaddr); in filter_ipv4_addr()
131 return leaf ? *leaf : 0; in filter_ipv4_addr()
221 __u8 *leaf = bpf_map_lookup_elem(&tcp_port_map, &port); in filter_tcp_port() local
223 return leaf ? *leaf : 0; in filter_tcp_port()
228 __u16 *leaf = bpf_map_lookup_elem(&udp_port_map, &port); in filter_udp_port() local
230 return leaf ? *leaf : 0; in filter_udp_port()
|
| /linux-6.1.9/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 …]
|
| /linux-6.1.9/drivers/infiniband/hw/irdma/ |
| D | pble.c | 312 struct irdma_pble_info *leaf = lvl2->leaf; in free_lvl2() local
314 for (i = 0; i < lvl2->leaf_cnt; i++, leaf++) { in free_lvl2()
315 if (leaf->addr) in free_lvl2()
317 &leaf->chunkinfo); in free_lvl2()
326 lvl2->leaf = NULL; in free_lvl2()
342 struct irdma_pble_info *leaf; in get_lvl2_pble() local
352 lvl2->leafmem.size = (sizeof(*leaf) * total); in get_lvl2_pble()
357 lvl2->leaf = lvl2->leafmem.va; in get_lvl2_pble()
358 leaf = lvl2->leaf; in get_lvl2_pble()
363 lvl2->leaf = NULL; in get_lvl2_pble()
[all …]
|