Home
last modified time | relevance | path

Searched refs:leaf (Results 1 – 25 of 169) sorted by relevance

1234567

/linux/fs/btrfs/
H A Dtree-checker.c10 * The objective is to do leaf/node validation checks when tree block is read
38 * @type: leaf or node
39 * @identifier: the necessary info to locate the leaf/node.
51 * Append generic "corrupt leaf/node root=%llu block=%llu slot=%d: " to @fmt.
71 btrfs_header_level(eb) == 0 ? "leaf" : "node", in generic_err()
99 btrfs_header_level(eb) == 0 ? "leaf" : "node", in file_extent_err()
109 #define CHECK_FE_ALIGNED(leaf, slot, fi, name, alignment) \ argument
111 if (unlikely(!IS_ALIGNED(btrfs_file_extent_##name((leaf), (fi)), \
113 file_extent_err((leaf), (slot), \
115 (#name), btrfs_file_extent_##name((leaf), (f
120 file_extent_end(struct extent_buffer * leaf,struct btrfs_key * key,struct btrfs_file_extent_item * extent) file_extent_end() argument
175 check_prev_ino(struct extent_buffer * leaf,struct btrfs_key * key,int slot,struct btrfs_key * prev_key) check_prev_ino() argument
207 check_extent_data_item(struct extent_buffer * leaf,struct btrfs_key * key,int slot,struct btrfs_key * prev_key) check_extent_data_item() argument
365 check_csum_item(struct extent_buffer * leaf,struct btrfs_key * key,int slot,struct btrfs_key * prev_key) check_csum_item() argument
411 check_inode_key(struct extent_buffer * leaf,struct btrfs_key * key,int slot) check_inode_key() argument
463 check_root_key(struct extent_buffer * leaf,struct btrfs_key * key,int slot) check_root_key() argument
521 check_dir_item(struct extent_buffer * leaf,struct btrfs_key * key,struct btrfs_key * prev_key,int slot) check_dir_item() argument
682 check_block_group_item(struct extent_buffer * leaf,struct btrfs_key * key,int slot) check_block_group_item() argument
827 chunk_err(const struct btrfs_fs_info * fs_info,const struct extent_buffer * leaf,const struct btrfs_chunk * chunk,u64 logical,const char * fmt,...) chunk_err() argument
902 btrfs_check_chunk_valid(const struct btrfs_fs_info * fs_info,const struct extent_buffer * leaf,const struct btrfs_chunk * chunk,u64 logical,u32 sectorsize) btrfs_check_chunk_valid() argument
1076 check_leaf_chunk_item(struct extent_buffer * leaf,struct btrfs_chunk * chunk,struct btrfs_key * key,int slot) check_leaf_chunk_item() argument
1134 check_dev_item(struct extent_buffer * leaf,struct btrfs_key * key,int slot) check_dev_item() argument
1181 check_inode_item(struct extent_buffer * leaf,struct btrfs_key * key,int slot) check_inode_item() argument
1270 check_root_item(struct extent_buffer * leaf,struct btrfs_key * key,int slot) check_root_item() argument
1419 check_extent_item(struct extent_buffer * leaf,struct btrfs_key * key,int slot,struct btrfs_key * prev_key) check_extent_item() argument
1731 check_simple_keyed_refs(struct extent_buffer * leaf,struct btrfs_key * key,int slot) check_simple_keyed_refs() argument
1772 check_extent_data_ref(struct extent_buffer * leaf,struct btrfs_key * key,int slot) check_extent_data_ref() argument
1835 check_inode_ref(struct extent_buffer * leaf,struct btrfs_key * key,struct btrfs_key * prev_key,int slot) check_inode_ref() argument
1885 check_inode_extref(struct extent_buffer * leaf,struct btrfs_key * key,struct btrfs_key * prev_key,int slot) check_inode_extref() argument
1918 check_raid_stripe_extent(const struct extent_buffer * leaf,const struct btrfs_key * key,int slot) check_raid_stripe_extent() argument
1937 check_remap_key(const struct extent_buffer * leaf,const struct btrfs_key * key,int slot) check_remap_key() argument
2002 check_dev_extent_item(const struct extent_buffer * leaf,const struct btrfs_key * key,int slot,struct btrfs_key * prev_key) check_dev_extent_item() argument
2068 check_free_space_info(struct extent_buffer * leaf,struct btrfs_key * key,int slot) check_free_space_info() argument
2115 check_free_space_extent(struct extent_buffer * leaf,struct btrfs_key * key,int slot) check_free_space_extent() argument
2141 check_free_space_bitmap(struct extent_buffer * leaf,struct btrfs_key * key,int slot) check_free_space_bitmap() argument
2184 check_leaf_item(struct extent_buffer * leaf,struct btrfs_key * key,int slot,struct btrfs_key * prev_key) check_leaf_item() argument
2265 __btrfs_check_leaf(struct extent_buffer * leaf) __btrfs_check_leaf() argument
2415 btrfs_check_leaf(struct extent_buffer * leaf) btrfs_check_leaf() argument
[all...]
H A Dfile-item.c167 struct extent_buffer *leaf; in btrfs_insert_hole_extent() local
181 leaf = path->nodes[0]; in btrfs_insert_hole_extent()
182 item = btrfs_item_ptr(leaf, path->slots[0], in btrfs_insert_hole_extent()
184 btrfs_set_file_extent_disk_bytenr(leaf, item, 0); in btrfs_insert_hole_extent()
185 btrfs_set_file_extent_disk_num_bytes(leaf, item, 0); in btrfs_insert_hole_extent()
186 btrfs_set_file_extent_offset(leaf, item, 0); in btrfs_insert_hole_extent()
187 btrfs_set_file_extent_num_bytes(leaf, item, num_bytes); in btrfs_insert_hole_extent()
188 btrfs_set_file_extent_ram_bytes(leaf, item, num_bytes); in btrfs_insert_hole_extent()
189 btrfs_set_file_extent_generation(leaf, item, trans->transid); in btrfs_insert_hole_extent()
190 btrfs_set_file_extent_type(leaf, ite in btrfs_insert_hole_extent()
209 struct extent_buffer *leaf; btrfs_lookup_csum() local
507 struct extent_buffer *leaf; btrfs_lookup_csums_list() local
651 struct extent_buffer *leaf; btrfs_lookup_csums_bitmap() local
882 struct extent_buffer *leaf; truncate_one_csum() local
934 struct extent_buffer *leaf; btrfs_del_csums() local
1110 struct extent_buffer *leaf = NULL; btrfs_insert_data_csums() local
1328 struct extent_buffer *leaf = path->nodes[0]; btrfs_extent_item_to_extent_map() local
1391 const struct extent_buffer *leaf = path->nodes[0]; btrfs_file_extent_end() local
[all...]
H A Draid-stripe-tree.c23 struct extent_buffer *leaf; in btrfs_partially_delete_raid_extent() local
36 leaf = path->nodes[0]; in btrfs_partially_delete_raid_extent()
38 item_size = btrfs_item_size(leaf, slot); in btrfs_partially_delete_raid_extent()
44 extent = btrfs_item_ptr(leaf, slot, struct btrfs_stripe_extent); in btrfs_partially_delete_raid_extent()
51 devid = btrfs_raid_stride_devid(leaf, stride); in btrfs_partially_delete_raid_extent()
53 phys = btrfs_raid_stride_physical(leaf, stride) + frontpad; in btrfs_partially_delete_raid_extent()
71 struct extent_buffer *leaf; in btrfs_delete_raid_extent() local
109 * leaf even when the target entry is the first item on a leaf. in btrfs_delete_raid_extent()
112 * past the end of the leaf i in btrfs_delete_raid_extent()
301 struct extent_buffer *leaf; update_raid_extent_item() local
405 struct extent_buffer *leaf; btrfs_get_raid_extent_offset() local
[all...]
H A Dfile.c126 struct extent_buffer *leaf;
175 leaf = path->nodes[0]; in btrfs_drop_extents()
176 btrfs_item_key_to_cpu(leaf, &key, path->slots[0] - 1); in btrfs_drop_extents()
183 leaf = path->nodes[0]; in btrfs_drop_extents()
184 if (path->slots[0] >= btrfs_header_nritems(leaf)) { in btrfs_drop_extents()
186 btrfs_print_leaf(leaf); in btrfs_drop_extents()
197 leaf = path->nodes[0]; in btrfs_drop_extents()
201 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in btrfs_drop_extents()
214 fi = btrfs_item_ptr(leaf, path->slots[0], in btrfs_drop_extents()
216 extent_type = btrfs_file_extent_type(leaf, f in btrfs_drop_extents()
143 struct extent_buffer *leaf; btrfs_drop_extents() local
510 extent_mergeable(struct extent_buffer * leaf,int slot,u64 objectid,u64 bytenr,u64 orig_offset,u64 * start,u64 * end) extent_mergeable() argument
553 struct extent_buffer *leaf; btrfs_mark_extent_written() local
2062 hole_mergeable(struct btrfs_inode * inode,struct extent_buffer * leaf,int slot,u64 start,u64 end) hole_mergeable() argument
2097 struct extent_buffer *leaf; fill_holes() local
2316 struct extent_buffer *leaf; btrfs_insert_replace_extent() local
3646 struct extent_buffer *leaf = path->nodes[0]; find_desired_extent() local
[all...]
H A Droot-tree.c216 struct extent_buffer *leaf; in btrfs_find_orphan_roots() local
237 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
238 if (path->slots[0] >= btrfs_header_nritems(leaf)) { in btrfs_find_orphan_roots()
244 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
247 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in btrfs_find_orphan_roots()
336 struct extent_buffer *leaf; in btrfs_del_root_ref() local
353 leaf = path->nodes[0]; in btrfs_del_root_ref()
354 ref = btrfs_item_ptr(leaf, path->slots[0], in btrfs_del_root_ref()
357 if ((btrfs_root_ref_dirid(leaf, ref) != dirid) || in btrfs_del_root_ref()
358 (btrfs_root_ref_name_len(leaf, re in btrfs_del_root_ref()
406 struct extent_buffer *leaf; btrfs_add_root_ref() local
[all...]
H A Dextent-tree.c54 struct extent_buffer *leaf,
163 struct extent_buffer *leaf = path->nodes[0]; in btrfs_lookup_extent_info() local
165 const u32 item_size = btrfs_item_size(leaf, path->slots[0]); in btrfs_lookup_extent_info()
176 ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item); in btrfs_lookup_extent_info()
177 num_refs = btrfs_extent_refs(leaf, ei); in btrfs_lookup_extent_info()
186 extent_flags = btrfs_extent_flags(leaf, ei); in btrfs_lookup_extent_info()
187 owner = btrfs_get_extent_owner_root(fs_info, leaf, path->slots[0]); in btrfs_lookup_extent_info()
311 * - number of pointers in the tree leaf
314 * the tree leaf
324 * (btrfs_header_owner(leaf), inod
418 hash_extent_data_ref_item(const struct extent_buffer * leaf,const struct btrfs_extent_data_ref * ref) hash_extent_data_ref_item() argument
426 match_extent_data_ref(const struct extent_buffer * leaf,const struct btrfs_extent_data_ref * ref,u64 root_objectid,u64 owner,u64 offset) match_extent_data_ref() argument
446 struct extent_buffer *leaf; lookup_extent_data_ref() local
524 struct extent_buffer *leaf; insert_extent_data_ref() local
608 struct extent_buffer *leaf; remove_extent_data_ref() local
649 struct extent_buffer *leaf; extent_data_ref_count() local
807 struct extent_buffer *leaf; lookup_inline_extent_backref() local
1040 struct extent_buffer *leaf; setup_inline_extent_backref() local
1129 struct extent_buffer *leaf = path->nodes[0]; update_inline_extent_backref() local
1531 struct extent_buffer *leaf; __btrfs_inc_extent_ref() local
1673 __run_delayed_extent_op(struct btrfs_delayed_extent_op * extent_op,struct extent_buffer * leaf,struct btrfs_extent_item * ei) __run_delayed_extent_op() argument
1699 struct extent_buffer *leaf; run_delayed_extent_op() local
2427 struct extent_buffer *leaf; check_committed_ref() local
2525 struct extent_buffer *leaf = path->nodes[0]; btrfs_cross_ref_exist() local
3103 btrfs_get_extent_owner_root(struct btrfs_fs_info * fs_info,struct extent_buffer * leaf,int slot) btrfs_get_extent_owner_root() argument
3276 struct extent_buffer *leaf; __btrfs_free_extent() local
4998 struct extent_buffer *leaf; alloc_reserved_file_extent() local
5079 struct extent_buffer *leaf; alloc_reserved_tree_block() local
[all...]
H A Dexport.c159 struct extent_buffer *leaf; in btrfs_get_parent() local
198 leaf = path->nodes[0]; in btrfs_get_parent()
200 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); in btrfs_get_parent()
207 ref = btrfs_item_ptr(leaf, path->slots[0], in btrfs_get_parent()
209 key.objectid = btrfs_root_ref_dirid(leaf, ref); in btrfs_get_parent()
240 struct extent_buffer *leaf; in btrfs_get_name() local
276 leaf = path->nodes[0]; in btrfs_get_name()
279 rref = btrfs_item_ptr(leaf, path->slots[0], in btrfs_get_name()
282 name_len = btrfs_root_ref_name_len(leaf, rref); in btrfs_get_name()
284 iref = btrfs_item_ptr(leaf, path->slots[0], in btrfs_get_name()
[all …]
/linux/arch/x86/boot/startup/
H A Dsev-shared.c169 static int __sev_cpuid_hv_msr(struct cpuid_leaf *leaf) in __sev_cpuid_hv_msr() argument
181 if (cpuid_function_is_indexed(leaf->fn) && leaf->subfn) in __sev_cpuid_hv_msr()
184 ret = __sev_cpuid_hv(leaf->fn, GHCB_CPUID_REQ_EAX, &leaf->eax); in __sev_cpuid_hv_msr()
185 ret = ret ? : __sev_cpuid_hv(leaf->fn, GHCB_CPUID_REQ_EBX, &leaf->ebx); in __sev_cpuid_hv_msr()
186 ret = ret ? : __sev_cpuid_hv(leaf->fn, GHCB_CPUID_REQ_ECX, &leaf->ecx); in __sev_cpuid_hv_msr()
187 ret = ret ? : __sev_cpuid_hv(leaf->fn, GHCB_CPUID_REQ_EDX, &leaf->edx); in __sev_cpuid_hv_msr()
262 snp_cpuid_get_validated_func(struct cpuid_leaf *leaf) in snp_cpuid_get_validated_func() argument
270 if (e->eax_in != leaf->fn) in snp_cpuid_get_validated_func()
273 if (cpuid_function_is_indexed(leaf->fn) && e->ecx_in != leaf->subfn) in snp_cpuid_get_validated_func()
286 leaf->eax = e->eax; in snp_cpuid_get_validated_func()
[all …]
/linux/drivers/gpu/drm/nouveau/nvkm/subdev/mc/
H A Dnv04.c75 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/arch/loongarch/mm/
H A Dcache.c34 static void flush_cache_leaf(unsigned int leaf) in flush_cache_leaf() argument
38 struct cache_desc *cdesc = current_cpu_data.cache_leaves + leaf; in flush_cache_leaf()
45 flush_cache_line(leaf, addr); in flush_cache_leaf()
58 int leaf; in __flush_cache_all() local
62 leaf = cache_present - 1; in __flush_cache_all()
63 if (cache_inclusive(cdesc + leaf)) { in __flush_cache_all()
64 flush_cache_leaf(leaf); in __flush_cache_all()
68 for (leaf = 0; leaf < cache_present; leaf++) in __flush_cache_all()
69 flush_cache_leaf(leaf); in __flush_cache_all()
84 #define populate_cache_properties(cfg0, cdesc, level, leaf) \ argument
[all …]
/linux/tools/arch/x86/kcpuid/
H A Dkcpuid.c59 /* Represent one leaf (basic or extended) */
63 * then the leafs[0] is the main leaf
139 #define cpuid(leaf, a, b, c, d) \ in cpuid_store()
140 __cpuid_count(leaf, 0, a, b, c, d) in cpuid_store()
142 #define cpuid_count(leaf, subleaf, a, b, c, d) \ in cpuid_store()
143 __cpuid_count(leaf, subleaf, a, b, c, d) in cpuid_store()
160 static void leaf_print_raw(struct subleaf *leaf) in cpuid_store()
162 if (has_subleafs(leaf->index)) { in cpuid_store()
163 if (leaf->sub == 0) in cpuid_store()
164 printf("0x%08x: subleafs:\n", leaf in cpuid_store()
114 leaf_print_raw(struct subleaf * leaf) leaf_print_raw() argument
133 struct subleaf *leaf; cpuid_store() local
289 struct subleaf *leaf; parse_line() local
483 show_leaf(struct subleaf * leaf) show_leaf() argument
[all...]
/linux/drivers/gpu/drm/nouveau/nvkm/core/
H A Dintr.c30 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/drivers/gpu/drm/nouveau/nvkm/subdev/vfn/
H A Dtu102.c29 tu102_vfn_intr_reset(struct nvkm_intr *intr, int leaf, u32 mask) in tu102_vfn_intr_reset() argument
33 nvkm_wr32(vfn->subdev.device, vfn->addr.priv + 0x1000 + (leaf * 4), mask); in tu102_vfn_intr_reset()
37 tu102_vfn_intr_allow(struct nvkm_intr *intr, int leaf, u32 mask) in tu102_vfn_intr_allow() argument
41 nvkm_wr32(vfn->subdev.device, vfn->addr.priv + 0x1200 + (leaf * 4), mask); in tu102_vfn_intr_allow()
45 tu102_vfn_intr_block(struct nvkm_intr *intr, int leaf, u32 mask) in tu102_vfn_intr_block() argument
49 nvkm_wr32(vfn->subdev.device, vfn->addr.priv + 0x1400 + (leaf * 4), mask); in tu102_vfn_intr_block()
74 int pending = 0, leaf; in tu102_vfn_intr_pending() local
76 for (leaf = 0; leaf < 8; leaf++) { in tu102_vfn_intr_pending()
77 if (intr_top & BIT(leaf / 2)) { in tu102_vfn_intr_pending()
78 intr->stat[leaf] = nvkm_rd32(device, vfn->addr.priv + 0x1000 + (leaf * 4)); in tu102_vfn_intr_pending()
[all …]
/linux/drivers/net/ethernet/dec/tulip/
H A Deeprom.c243 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/fs/unicode/
H A Dmkutf8data.c383 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 …]
/linux/Documentation/arch/x86/
H A Dtopology.rst156 1) CPUID leaf 0x80000026 [Extended CPU Topology] (Core::X86::Cpuid::ExCpuTopology)
158 The extended CPUID leaf 0x80000026 is the extension of the CPUID leaf 0xB
162 Support for the leaf is discovered by checking if the maximum extended
174 CPUID leaf 0x80000026 also provides more information regarding the power
178 If CPUID leaf 0x80000026 is supported, further parsing is not required.
180 2) CPUID leaf 0x0000000B [Extended Topology Enumeration] (Core::X86::Cpuid::ExtTopEnum)
182 The extended CPUID leaf 0x0000000B is the predecessor on the extended
183 CPUID leaf 0x80000026 and only describes the core, and the socket domains
186 The support for the leaf is discovered by checking if the maximum supported
198 If CPUID leaf 0xB is supported, further parsing is not required.
[all …]
/linux/fs/xfs/libxfs/
H A Dxfs_attr_leaf.c38 * Routines to implement leaf blocks of attributes as Btrees of hashed names.
76 STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index);
78 /* Compute the byte offset of the end of the leaf entry array. */
82 const struct xfs_attr_leafblock *leaf) in xfs_attr_leaf_entries_end() argument
85 xfs_attr3_leaf_hdr_size(leaf); in xfs_attr_leaf_entries_end()
109 const struct xfs_attr_leafblock *leaf) in xfs_attr_leaf_ichdr_freemaps_verify() argument
112 xfs_attr_leaf_entries_end(ichdr->count, leaf); in xfs_attr_leaf_ichdr_freemaps_verify()
135 * of an attr leaf block. The region starts at the tail of the block and expands
137 * size for an empty leaf block and is reduced from there.
299 struct xfs_attr_leafblock *leaf, in xfs_attr3_leaf_verify_entry() argument
373 struct xfs_attr_leafblock *leaf = bp->b_addr; xfs_attr3_leaf_verify() local
1105 struct xfs_attr_leafblock *leaf; xfs_attr_shortform_allfit() local
1214 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_to_shortform() local
1300 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_to_node() local
1374 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_create() local
1513 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_add() local
1594 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_add_work() local
2148 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_toosmall() local
2272 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_remove() local
2548 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_lookup_int() local
2663 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_getvalue() local
2869 xfs_attr_leaf_entsize(xfs_attr_leafblock_t * leaf,int index) xfs_attr_leaf_entsize() argument
2924 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_clearflag() local
2991 struct xfs_attr_leafblock *leaf; xfs_attr3_leaf_setflag() local
[all...]
/linux/arch/x86/kernel/cpu/
H A Dtopology_ext.c46 static inline bool topo_subleaf(struct topo_scan *tscan, u32 leaf, u32 subleaf, in topo_subleaf()
60 u32 level : 8, // Current topology level. Same as sub leaf number in topo_subleaf()
67 switch (leaf) { in topo_subleaf()
74 cpuid_read_subleaf(leaf, subleaf, &sl); in topo_subleaf()
80 pr_err_once("Topology: leaf 0x%x:%d Unknown domain type %u\n", in topo_subleaf()
81 leaf, subleaf, sl.type); in topo_subleaf()
97 pr_warn_once(FW_BUG "CPUID leaf 0x%x subleaf %d APIC ID mismatch %x != %x\n", in topo_subleaf()
98 leaf, subleaf, tscan->c->topo.initial_apicid, sl.x2apic_id); in topo_subleaf()
105 static bool parse_topology_leaf(struct topo_scan *tscan, u32 leaf) in parse_topology_leaf()
111 for (subleaf = 0, last_dom = 0; topo_subleaf(tscan, leaf, sublea in parse_topology_leaf()
45 topo_subleaf(struct topo_scan * tscan,u32 leaf,u32 subleaf,unsigned int * last_dom) topo_subleaf() argument
104 parse_topology_leaf(struct topo_scan * tscan,u32 leaf) parse_topology_leaf() argument
[all...]
H A Dtopology_amd.c39 * this leaf, just set the CORE domain shift and let the later in parse_8000_0008()
78 } leaf; in parse_8000_001e()
83 cpuid_read(0x8000001e, &leaf); in parse_8000_001e()
86 * If leaf 0xb/0x26 is available, then the APIC ID and the domain in parse_8000_001e()
90 tscan->c->topo.initial_apicid = leaf.ext_apic_id; in parse_8000_001e()
99 unsigned int nthreads = leaf.core_nthreads + 1; in parse_8000_001e()
106 store_node(tscan, leaf.nnodes_per_socket + 1, leaf.node_id); in parse_8000_001e()
110 tscan->c->topo.cu_id = leaf.core_id; in parse_8000_001e()
112 cacheinfo_amd_init_llc_id(tscan->c, leaf in parse_8000_001e()
77 } leaf; parse_8000_001e() local
[all...]
/linux/arch/mips/kernel/
H A Dcacheinfo.c8 #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/net/ipv6/
H A Dip6_fib.c240 rcu_assign_pointer(table->tb6_root.leaf, in fib6_alloc_table()
474 err = fib6_rt_dump(w->leaf, w->args); in fib6_node_dump()
475 w->leaf = NULL; in fib6_node_dump()
537 w->leaf = rt; in fib6_dump_node()
558 w->leaf = NULL; in fib6_dump_node()
783 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, in fib6_add_1()
785 key = (struct rt6key *)((u8 *)leaf + offset); in fib6_add_1()
811 RCU_INIT_POINTER(fn->leaf, NULL); in fib6_add_1()
812 fib6_info_release(leaf); in fib6_add_1()
784 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, fib6_add_1() local
1068 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, fib6_purge_rt() local
1095 struct fib6_info *leaf = rcu_dereference_protected(fn->leaf, fib6_add_rt2node() local
1647 struct fib6_info *leaf = rcu_dereference(fn->leaf); fib6_node_lookup_1() local
1730 struct fib6_info *leaf = rcu_dereference(fn->leaf); fib6_locate_1() local
1973 struct fib6_info *leaf, *replace_rt = NULL; fib6_del_route() local
[all...]
/linux/tools/testing/selftests/cgroup/
H A Dtest_cpu.c486 struct cpu_hogger leaf[3] = {}; in run_cpucg_nested_weight_test() local
517 for (i = 0; i < ARRAY_SIZE(leaf); i++) { in run_cpucg_nested_weight_test()
528 leaf[i].cgroup = cg_name_indexed(ancestor, "cpucg_leaf", i); in run_cpucg_nested_weight_test()
529 if (!leaf[i].cgroup) in run_cpucg_nested_weight_test()
532 if (cg_create(leaf[i].cgroup)) in run_cpucg_nested_weight_test()
535 if (cg_write_numeric(leaf[i].cgroup, "cpu.weight", weight)) in run_cpucg_nested_weight_test()
539 for (i = 0; i < ARRAY_SIZE(leaf); i++) { in run_cpucg_nested_weight_test()
550 pid = cg_run_nowait(leaf[i].cgroup, hog_cpus_timed, in run_cpucg_nested_weight_test()
554 leaf[i].pid = pid; in run_cpucg_nested_weight_test()
557 for (i = 0; i < ARRAY_SIZE(leaf); in run_cpucg_nested_weight_test()
[all...]
/linux/tools/testing/selftests/bpf/progs/
H A Dxdpwall.c118 __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/drivers/infiniband/hw/irdma/
H A Dpble.c320 struct irdma_pble_info *leaf = lvl2->leaf; in free_lvl2() local
322 for (i = 0; i < lvl2->leaf_cnt; i++, leaf++) { in free_lvl2()
323 if (leaf->addr) in free_lvl2()
325 &leaf->chunkinfo); in free_lvl2()
334 lvl2->leaf = NULL; in free_lvl2()
350 struct irdma_pble_info *leaf; in get_lvl2_pble() local
360 lvl2->leafmem.size = (sizeof(*leaf) * total); in get_lvl2_pble()
365 lvl2->leaf = lvl2->leafmem.va; in get_lvl2_pble()
366 leaf = lvl2->leaf; in get_lvl2_pble()
371 lvl2->leaf = NULL; in get_lvl2_pble()
[all …]
/linux/drivers/gpu/drm/nouveau/include/nvkm/core/
H A Dintr.h24 void (*block)(struct nvkm_intr *, int leaf, u32 mask);
25 void (*allow)(struct nvkm_intr *, int leaf, u32 mask);
26 void (*reset)(struct nvkm_intr *, int leaf, u32 mask);
31 int leaf; member
60 int leaf; member

1234567