Home
last modified time | relevance | path

Searched refs:num_children (Results 1 – 9 of 9) sorted by relevance

/linux-6.1.9/tools/testing/selftests/arm64/fp/
Dfp-stress.c42 static int num_children; variable
255 for (i = 0; i < num_children; i++) { in handle_child_signal()
285 for (i = 0; i < num_children; i++) in handle_exit_signal()
489 start_fpsimd(&children[num_children++], i, j); in main()
492 start_sve(&children[num_children++], sve_vls[j], i); in main()
495 start_ssve(&children[num_children++], sme_vls[j], i); in main()
496 start_za(&children[num_children++], sme_vls[j], i); in main()
529 for (i = 0; i < num_children; i++) in main()
/linux-6.1.9/drivers/net/ethernet/intel/ice/
Dice_sched.c64 if (!start_node->num_children || in ice_sched_find_node_by_teid()
70 for (i = 0; i < start_node->num_children; i++) in ice_sched_find_node_by_teid()
75 for (i = 0; i < start_node->num_children; i++) { in ice_sched_find_node_by_teid()
196 parent->children[parent->num_children++] = node; in ice_sched_add_node()
288 for (i = 0; i < pi->root->num_children; i++) in ice_sched_get_tc_node()
313 while (node->num_children) in ice_free_sched_node()
331 for (i = 0; i < parent->num_children; i++) in ice_free_sched_node()
333 for (j = i + 1; j < parent->num_children; j++) in ice_free_sched_node()
336 parent->num_children--; in ice_free_sched_node()
998 if ((parent->num_children + num_nodes) > max_child_nodes) { in ice_sched_add_nodes_to_hw_layer()
[all …]
Dice_dcb.c1549 for (i = 0; i < pi->root->num_children; i++) { in ice_update_port_tc_tree_cfg()
1567 for (i = 0; i < pi->root->num_children; i++) { in ice_update_port_tc_tree_cfg()
1578 if (i < pi->root->num_children) in ice_update_port_tc_tree_cfg()
Dice_type.h531 u8 num_children; member
/linux-6.1.9/tools/testing/selftests/cgroup/
Dtest_cpu.c236 int (*validate)(const struct cpu_hogger *children, int num_children)) in run_cpucg_weight_test() argument
321 overprovision_validate(const struct cpu_hogger *children, int num_children) in overprovision_validate() argument
325 for (i = 0; i < num_children - 1; i++) { in overprovision_validate()
367 underprovision_validate(const struct cpu_hogger *children, int num_children) in underprovision_validate() argument
371 for (i = 0; i < num_children - 1; i++) { in underprovision_validate()
/linux-6.1.9/drivers/net/ethernet/netronome/nfp/abm/
Dqdisc.c309 for (i = 0; i < mq->num_children; i++) in nfp_abm_qdisc_clear_mq()
361 qdisc->num_children = children; in nfp_abm_qdisc_alloc()
417 nfp_abm_qdisc_unlink_children(qdisc, 0, qdisc->num_children); in nfp_abm_qdisc_destroy()
439 if (WARN(id >= parent->num_children, in nfp_abm_qdisc_graft()
441 id, parent->num_children)) in nfp_abm_qdisc_graft()
794 for (i = 0; i < qdisc->num_children; i++) { in nfp_abm_mq_stats()
Dmain.h158 unsigned int num_children; member
/linux-6.1.9/mm/
Drmap.c96 anon_vma->num_children = 0; in anon_vma_alloc()
205 anon_vma->num_children++; /* self-parent link for new root */ in __anon_vma_prepare()
307 anon_vma->num_children < 2 && in anon_vma_clone()
383 anon_vma->parent->num_children++; in anon_vma_fork()
415 anon_vma->parent->num_children--; in unlink_anon_vmas()
441 VM_WARN_ON(anon_vma->num_children); in unlink_anon_vmas()
/linux-6.1.9/include/linux/
Drmap.h50 unsigned long num_children; member