Home
last modified time | relevance | path

Searched refs:leafs (Results 1 - 6 of 6) sorted by relevance

/kernel/linux/linux-6.6/tools/arch/x86/kcpuid/
H A Dkcpuid.c59 * then the leafs[0] is the main leaf
61 struct subleaf *leafs; member
66 /* array of main leafs */
68 /* number of valid leafs */
155 if (!func->leafs) { in cpuid_store()
156 func->leafs = malloc(sizeof(struct subleaf)); in cpuid_store()
157 if (!func->leafs) in cpuid_store()
163 func->leafs = realloc(func->leafs, (s + 1) * sizeof(*leaf)); in cpuid_store()
164 if (!func->leafs) in cpuid_store()
[all...]
/kernel/linux/linux-6.6/tools/testing/selftests/drivers/net/netdevsim/
H A Ddevlink.sh624 local leafs=`rate_leafs_get $DL_HANDLE`
625 local num_leafs=`echo $leafs | wc -w`
627 check_err $? "Expected $VF_COUNT rate leafs but got $num_leafs"
630 for r_obj in $leafs
638 for r_obj in $leafs
/kernel/linux/linux-5.10/fs/btrfs/
H A Dbackref.h45 u64 time_seq, struct ulist **leafs,
H A Dbackref.c1453 * Finds all leafs with a reference to the specified combination of bytenr and
1455 * free each list element). The leafs will be stored in the leafs ulist, which
1462 u64 time_seq, struct ulist **leafs,
1467 *leafs = ulist_alloc(GFP_NOFS);
1468 if (!*leafs)
1472 *leafs, NULL, extent_item_pos, NULL, ignore_offset);
1474 free_leaf_list(*leafs);
1460 btrfs_find_all_leafs(struct btrfs_trans_handle *trans, struct btrfs_fs_info *fs_info, u64 bytenr, u64 time_seq, struct ulist **leafs, const u64 *extent_item_pos, bool ignore_offset) global() argument
/kernel/linux/linux-5.10/kernel/trace/
H A Dtrace_events_filter.c2298 WARN_ONCE(1, "all leafs should have field defined %d", i); in update_pred_fn()
/kernel/linux/linux-6.6/kernel/trace/
H A Dtrace_events_filter.c2754 WARN_ONCE(1, "all leafs should have field defined %d", i); in update_pred_fn()

Completed in 13 milliseconds