Home
last modified time | relevance | path

Searched refs:nr_nodes (Results 1 – 20 of 20) sorted by relevance

/linux/mm/
H A Dhugetlb_internal.h83 #define for_each_node_mask_to_alloc(next_node, nr_nodes, node, mask) \ argument
84 for (nr_nodes = nodes_weight(*mask); \
85 nr_nodes > 0 && \
87 nr_nodes--)
89 #define for_each_node_mask_to_free(hs, nr_nodes, node, mask) \ argument
90 for (nr_nodes = nodes_weight(*mask); \
91 nr_nodes > 0 && \
93 nr_nodes--)
/linux/tools/perf/util/
H A Dbpf-trace-summary.c111 int nr_nodes; member
146 if (max_summary == 0 || max_summary > data->nr_nodes) in print_common_stats()
147 max_summary = data->nr_nodes; in print_common_stats()
194 nodes = reallocarray(data->nodes, data->nr_nodes + 1, sizeof(*nodes)); in update_thread_stats()
199 nodes = &data->nodes[data->nr_nodes++]; in update_thread_stats()
211 qsort(data->nodes, data->nr_nodes, sizeof(*data->nodes), nodecmp); in print_thread_stat()
253 data->nr_nodes = 1; in update_total_stats()
330 nodes = reallocarray(data->nodes, data->nr_nodes + 1, sizeof(*nodes)); in update_cgroup_stats()
335 nodes = &data->nodes[data->nr_nodes++]; in update_cgroup_stats()
348 qsort(data->nodes, data->nr_nodes, sizeo in print_cgroup_stat()
[all...]
H A Dbpf_lock_contention.c179 skel->rodata->nr_nodes = last + 1; in init_numa_data()
/linux/lib/
H A Drbtree_test.c172 static void check_postorder_foreach(int nr_nodes) in check_postorder_foreach() argument
179 WARN_ON_ONCE(count != nr_nodes); in check_postorder_foreach()
182 static void check_postorder(int nr_nodes) in check_postorder() argument
189 WARN_ON_ONCE(count != nr_nodes); in check_postorder()
192 static void check(int nr_nodes) in check() argument
212 WARN_ON_ONCE(count != nr_nodes); in check()
215 check_postorder(nr_nodes); in check()
216 check_postorder_foreach(nr_nodes); in check()
219 static void check_augmented(int nr_nodes) in check_augmented() argument
223 check(nr_nodes); in check_augmented()
/linux/arch/loongarch/mm/
H A Dcache.c36 int i, j, nr_nodes; in flush_cache_leaf() local
40 nr_nodes = cache_private(cdesc) ? 1 : loongson_sysconf.nr_nodes; in flush_cache_leaf()
53 } while (--nr_nodes > 0); in flush_cache_leaf()
/linux/arch/loongarch/include/asm/
H A Dbootinfo.h35 int nr_nodes; member
/linux/arch/powerpc/net/
H A Dbpf_jit_comp.c698 for (i = 0; i < tn->nr_nodes; i++) { in invoke_bpf_mod_ret()
1038 for (i = 0; i < fentry->nr_nodes; i++) { in __arch_prepare_bpf_trampoline()
1051 if (fmod_ret->nr_nodes) { in __arch_prepare_bpf_trampoline()
1052 branches = kcalloc(fmod_ret->nr_nodes, sizeof(u32), GFP_KERNEL); in __arch_prepare_bpf_trampoline()
1101 for (i = 0; i < fmod_ret->nr_nodes && image; i++) { in __arch_prepare_bpf_trampoline()
1118 for (i = 0; i < fexit->nr_nodes; i++) { in __arch_prepare_bpf_trampoline()
/linux/tools/perf/util/bpf_skel/
H A Dlock_contention.bpf.c915 const volatile int nr_nodes;
952 } else if (nr_nodes > 0) {
955 for (int i = 0; i < nr_nodes; i++) {
852 const volatile int nr_nodes; global() variable
/linux/arch/mips/include/asm/mach-loongson64/
H A Dloongson.h24 u32 nr_nodes; member
/linux/arch/riscv/net/
H A Dbpf_jit_comp64.c975 for (i = 0; i < tn->nr_nodes; i++) { in invoke_bpf()
1172 if (fentry->nr_nodes) { in __arch_prepare_bpf_trampoline()
1179 if (fmod_ret->nr_nodes) { in __arch_prepare_bpf_trampoline()
1180 branches_off = kvzalloc_objs(int, fmod_ret->nr_nodes); in __arch_prepare_bpf_trampoline()
1186 for (i = 0; i < fmod_ret->nr_nodes; i++) { in __arch_prepare_bpf_trampoline()
1221 for (i = 0; ctx->insns && i < fmod_ret->nr_nodes; i++) { in __arch_prepare_bpf_trampoline()
1232 if (fexit->nr_nodes) { in __arch_prepare_bpf_trampoline()
/linux/arch/mips/loongson64/
H A Denv.c265 loongson_sysconf.nr_nodes = (loongson_sysconf.nr_cpus + in prom_lefi_init_env()
/linux/arch/loongarch/net/
H A Dbpf_jit.c1768 for (i = 0; i < tn->nr_nodes; i++) { in invoke_bpf()
2019 if (fentry->nr_nodes) { in __arch_prepare_bpf_trampoline()
2025 if (fmod_ret->nr_nodes) { in __arch_prepare_bpf_trampoline()
2026 branches = kcalloc(fmod_ret->nr_nodes, sizeof(u32 *), GFP_KERNEL); in __arch_prepare_bpf_trampoline()
2031 for (i = 0; i < fmod_ret->nr_nodes; i++) { in __arch_prepare_bpf_trampoline()
2060 for (i = 0; ctx->image && i < fmod_ret->nr_nodes; i++) { in __arch_prepare_bpf_trampoline()
2070 if (fexit->nr_nodes) { in __arch_prepare_bpf_trampoline()
/linux/Documentation/block/
H A Dnull_blk.rst39 home_node=[0--nr_nodes]: Default: NUMA_NO_NODE
/linux/kernel/bpf/
H A Dtrampoline.c520 tnodes[kind].nr_nodes = tr->progs_cnt[kind]; in bpf_trampoline_get_progs()
545 tnodes[BPF_TRAMP_FENTRY].nr_nodes != 1) in bpf_tramp_arena_base()
731 if (tnodes[BPF_TRAMP_FEXIT].nr_nodes || in bpf_trampoline_update()
732 tnodes[BPF_TRAMP_MODIFY_RETURN].nr_nodes) { in bpf_trampoline_update()
H A Dbpf_struct_ops.c649 tnodes[BPF_TRAMP_FENTRY].nr_nodes = 1; in bpf_struct_ops_prepare_trampoline()
/linux/arch/x86/net/
H A Dbpf_jit_comp.c3342 for (i = 0; i < tl->nr_nodes; i++) { in invoke_bpf()
3369 for (i = 0; i < tl->nr_nodes; i++) { in invoke_bpf_mod_ret()
3641 if (fentry->nr_nodes) { in __arch_prepare_bpf_trampoline()
3648 if (fmod_ret->nr_nodes) { in __arch_prepare_bpf_trampoline()
3649 branches = kcalloc(fmod_ret->nr_nodes, sizeof(u8 *), in __arch_prepare_bpf_trampoline()
3688 if (fmod_ret->nr_nodes) { in __arch_prepare_bpf_trampoline()
3698 for (i = 0; i < fmod_ret->nr_nodes; i++) { in __arch_prepare_bpf_trampoline()
3709 if (fexit->nr_nodes) { in __arch_prepare_bpf_trampoline()
/linux/arch/arm64/net/
H A Dbpf_jit_comp.c2496 for (i = 0; i < tn->nr_nodes; i++) { in invoke_bpf_mod_ret()
2876 for (i = 0; i < fentry->nr_nodes; i++) { in prepare_trampoline()
2888 if (fmod_ret->nr_nodes) { in prepare_trampoline()
2889 branches = kcalloc(fmod_ret->nr_nodes, sizeof(__le32 *), in prepare_trampoline()
2913 for (i = 0; i < fmod_ret->nr_nodes && ctx->image != NULL; i++) { in prepare_trampoline()
2924 for (i = 0; i < fexit->nr_nodes; i++) { in prepare_trampoline()
/linux/fs/btrfs/
H A Dbackref.c3044 cache->nr_nodes++; in btrfs_backref_alloc_node()
3061 cache->nr_nodes--; in btrfs_backref_free_node()
3163 ASSERT(!cache->nr_nodes, "cache->nr_nodes=%d", cache->nr_nodes); in btrfs_backref_release_cache()
/linux/include/linux/
H A Dbpf.h1275 int nr_nodes; member
2200 return fentry_nodes->nr_nodes == 1 && in is_struct_ops_tramp()
2325 for (int i = 0; i < nodes[BPF_TRAMP_FENTRY].nr_nodes; i++) { in bpf_fsession_cnt()
2345 for (int i = 0; i < nodes[BPF_TRAMP_FENTRY].nr_nodes; i++) { in bpf_fsession_cookie_cnt()
/linux/Documentation/driver-api/crypto/iaa/
H A Diaa-crypto.rst596 [ 60.752346] iaa_crypto: rebalance_wq_table: nr_nodes=2, nr_cpus 160, nr_iaa 8, cpus_per_iaa 20