Home
last modified time | relevance | path

Searched refs:num_nodes (Results 1 – 25 of 46) sorted by relevance

12

/openbsd/gnu/gcc/gcc/
H A Dddg.c390 for (i = 0; i < g->num_nodes; i++) in build_intra_loop_deps()
442 int num_nodes = 0; in create_ddg() local
460 num_nodes++; in create_ddg()
464 if (num_nodes <= 1) in create_ddg()
471 g->num_nodes = num_nodes; in create_ddg()
527 for (i = 0; i < g->num_nodes; i++) in free_ddg()
573 for (i = 0; i < g->num_nodes; i++) in print_ddg()
776 for (i = 0; i < g->num_nodes; i++) in get_node_of_insn()
846 int num_nodes = g->num_nodes; in create_ddg_all_sccs() local
911 int num_nodes = g->num_nodes; in find_nodes_on_paths() local
[all …]
H A Dcfgloop.c228 int num_nodes = 1; in flow_loop_nodes_find() local
237 num_nodes++; in flow_loop_nodes_find()
259 num_nodes++; in flow_loop_nodes_find()
266 return num_nodes; in flow_loop_nodes_find()
789 gcc_assert (loop->num_nodes); in get_loop_body()
852 gcc_assert (loop->num_nodes); in get_loop_body_in_dom_order()
877 gcc_assert (loop->num_nodes); in get_loop_body_in_bfs_order()
884 while (i < loop->num_nodes) in get_loop_body_in_bfs_order()
974 loop->num_nodes++; in add_bb_to_loop()
976 loop->pred[i]->num_nodes++; in add_bb_to_loop()
[all …]
H A Dmodulo-sched.c359 xcalloc (g->num_nodes, in set_node_sched_params()
364 for (i = 0; i < g->num_nodes; i++) in set_node_sched_params()
379 for (i = 0; i < num_nodes; i++) in print_node_sched_params()
1489 int num_nodes = g->num_nodes; in sms_schedule_by_order() local
1667 for (i = 0; i < num_nodes; i++) in check_nodes_order()
1716 int num_nodes = g->num_nodes; in order_nodes_of_sccs() local
1748 while (pos < g->num_nodes) in order_nodes_of_sccs()
1765 int num_nodes = g->num_nodes; in calculate_order_params() local
1775 for (u = 0; u < num_nodes; u++) in calculate_order_params()
1785 for (u = 0; u < num_nodes; u++) in calculate_order_params()
[all …]
H A Dcfgloopmanip.c167 qtop = queue + base_loop->num_nodes + 1; in fix_bb_placements()
477 for (i = 0; i < loop->num_nodes; i++) in loopify()
480 for (i = 0; i < loop->num_nodes; i++) in loopify()
529 n = loop->num_nodes; in unloop()
573 for (i = 0; i < loop->num_nodes; i++) in fix_loop_placement()
586 act->num_nodes -= loop->num_nodes; in fix_loop_placement()
742 ret = can_copy_bbs_p (bbs, loop->num_nodes); in can_duplicate_loop_p()
817 n = loop->num_nodes; in duplicate_loop_to_header_edge()
823 if (!can_copy_bbs_p (bbs, loop->num_nodes)) in duplicate_loop_to_header_edge()
1372 for (i = 0; i < nloop->num_nodes; i++) in loop_version()
[all …]
H A Dtree-if-conv.c167 for (i = 0; i < loop->num_nodes; i++) in tree_if_conversion()
515 if (loop->num_nodes <= 2) in if_convertible_loop_p()
553 for (i = 0; i < loop->num_nodes; i++) in if_convertible_loop_p()
669 for (i = 0; i < loop->num_nodes; i++) in clean_predicate_lists()
854 unsigned int orig_loop_num_nodes = loop->num_nodes; in process_phi_nodes()
895 unsigned int orig_loop_num_nodes = loop->num_nodes; in combine_blocks()
1064 gcc_assert (loop->num_nodes); in get_loop_body_in_if_conv_order()
1067 blocks = XCNEWVEC (basic_block, loop->num_nodes); in get_loop_body_in_if_conv_order()
1073 while (index < loop->num_nodes) in get_loop_body_in_if_conv_order()
1095 if (index == loop->num_nodes in get_loop_body_in_if_conv_order()
[all …]
H A Dtree-ssa-loop-ivcanon.c123 for (i = 0; i < loop->num_nodes; i++) in tree_num_loop_insns()
435 for (i = 0; i < loop->num_nodes; i++) in empty_loop_p()
530 for (n_before = 1; n_before <= loop->num_nodes; n_before++) in remove_empty_loop()
534 scale_bbs_frequencies_int (body + n_before, loop->num_nodes - n_before, in remove_empty_loop()
H A Dtree-ssa-loop-unswitch.c219 for (; i < loop->num_nodes; i++) in tree_unswitch_single_loop()
223 if (i == loop->num_nodes) in tree_unswitch_single_loop()
H A Dtree-vectorizer.c258 for (i = 0; i < loop->num_nodes; i++) in rename_variables_in_loop()
844 if (!can_copy_bbs_p (bbs, loop->num_nodes)) in slpeel_tree_duplicate_loop_to_edge_cfg()
863 new_bbs = XNEWVEC (basic_block, loop->num_nodes); in slpeel_tree_duplicate_loop_to_edge_cfg()
865 copy_bbs (bbs, loop->num_nodes, new_bbs, in slpeel_tree_duplicate_loop_to_edge_cfg()
985 || loop->num_nodes != 2 in slpeel_can_duplicate_loop_p()
1397 for (i = 0; i < loop->num_nodes; i++) in new_loop_vec_info()
1455 nbbs = loop->num_nodes; in destroy_loop_vec_info()
H A Dddg.h120 int num_nodes; member
H A Dloop-unswitch.c328 for (i = 0; i < loop->num_nodes; i++) in unswitch_single_loop()
332 if (i == loop->num_nodes) in unswitch_single_loop()
H A Dtree-vect-analyze.c99 int nbbs = loop->num_nodes; in vect_determine_vectorization_factor()
232 int nbbs = loop->num_nodes; in vect_analyze_operations()
1558 unsigned int nbbs = loop->num_nodes; in vect_mark_stmts_to_be_vectorized()
1872 || loop->num_nodes != 2 in vect_analyze_loop_form()
1879 else if (loop->num_nodes != 2) in vect_analyze_loop_form()
H A Dloop-invariant.c514 for (i = 0; i < loop->num_nodes; i++) in compute_always_reached()
539 for (i = 0; i < loop->num_nodes; i++) in find_exits()
616 for (i = 0; i < loop->num_nodes; i++) in find_defs()
864 for (i = 0; i < loop->num_nodes; i++) in find_invariants_body()
H A Dcfgloopanal.c369 for (i = 0; i < loop->num_nodes; i++) in num_loop_insns()
392 for (i = 0; i < loop->num_nodes; i++) in average_num_loop_insns()
H A Dcfgloop.h80 unsigned num_nodes; member
H A Dloop-unroll.c960 for (i = 0; i < loop->num_nodes; i++) in unroll_loop_runtime_iterations()
1514 for (i = 0; i < loop->num_nodes; i++) in referenced_in_one_insn_in_loop_p()
1716 opt_info->insns_to_split = htab_create (5 * loop->num_nodes, in analyze_insns_in_loop()
1737 opt_info->insns_with_var_to_expand = htab_create (5 * loop->num_nodes, in analyze_insns_in_loop()
1740 for (i = 0; i < loop->num_nodes; i++) in analyze_insns_in_loop()
H A Dtree-ssa-loop-prefetch.c466 for (i = 0; i < loop->num_nodes; i++) in gather_memory_references()
888 if (loop->num_nodes > 2) in should_unroll_loop_p()
/openbsd/lib/libcrypto/lhash/
H A Dlhash.c85 unsigned int num_nodes; member
103 lh->num_nodes++; in expand()
165 lh->num_nodes--; in contract()
220 ret->num_nodes = MIN_NODES / 2; in lh_new()
239 for (i = 0; i < lh->num_nodes; i++) { in lh_free()
267 if (lh->up_load <= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)) in lh_insert()
315 if ((lh->num_nodes > MIN_NODES) && in lh_delete()
316 (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes))) in lh_delete()
363 for (i = lh->num_nodes - 1; i >= 0; i--) { in doall_util_fn()
381 if ((lh->num_nodes > MIN_NODES) && in doall_util_fn()
[all …]
/openbsd/sys/dev/pci/drm/amd/amdgpu/
H A Dta_xgmi_if.h97 uint32_t num_nodes; member
102 uint32_t num_nodes; member
107 uint32_t num_nodes; member
112 uint32_t num_nodes; member
H A Damdgpu_xgmi.c346 for (i = 0; i < top->num_nodes; i++) in amdgpu_xgmi_show_num_hops()
365 for (i = 0; i < top->num_nodes; i++) in amdgpu_xgmi_show_num_links()
695 for (i = 0 ; i < top->num_nodes; ++i) in amdgpu_xgmi_get_hops_count()
707 for (i = 0 ; i < top->num_nodes; ++i) in amdgpu_xgmi_get_num_links()
793 top_info->num_nodes = count; in amdgpu_xgmi_add_device()
806 top_info->num_nodes = count; in amdgpu_xgmi_add_device()
H A Damdgpu_psp.c1350 for (j = 0; j < mirror_top_info->num_nodes; j++) { in psp_xgmi_reflect_topology_info()
1383 if (!topology || topology->num_nodes > TA_XGMI__MAX_CONNECTED_NODES) in psp_xgmi_get_topology_info()
1393 topology_info_input->num_nodes = number_devices; in psp_xgmi_get_topology_info()
1395 for (i = 0; i < topology_info_input->num_nodes; i++) { in psp_xgmi_get_topology_info()
1409 topology->num_nodes = xgmi_cmd->xgmi_out_message.get_topology_info.num_nodes; in psp_xgmi_get_topology_info()
1410 for (i = 0; i < topology->num_nodes; i++) { in psp_xgmi_get_topology_info()
1441 for (i = 0; i < topology->num_nodes; i++) { in psp_xgmi_get_topology_info()
1466 if (!topology || topology->num_nodes > TA_XGMI__MAX_CONNECTED_NODES) in psp_xgmi_set_topology_info()
1474 topology_info_input->num_nodes = number_devices; in psp_xgmi_set_topology_info()
1476 for (i = 0; i < topology_info_input->num_nodes; i++) { in psp_xgmi_set_topology_info()
/openbsd/gnu/usr.bin/gcc/gcc/
H A Dcfgloop.c138 for (i = 0; i < loop->num_nodes; i++)
333 int num_nodes = 1; local
344 num_nodes++;
365 num_nodes++;
372 return num_nodes;
997 if (!loop->num_nodes)
1019 if (tv != loop->num_nodes)
1034 loop->num_nodes++;
1036 loop->pred[i]->num_nodes++;
1047 loop->num_nodes--;
[all …]
/openbsd/sys/dev/pci/drm/amd/amdkfd/
H A Dkfd_device.c573 for (i = 0; i < num_nodes; i++) { in kfd_cleanup_nodes()
640 if (kfd->num_nodes == 0) { in kgd2kfd_device_init()
681 kfd->num_nodes != 1) { in kgd2kfd_device_init()
752 kfd->num_nodes); in kgd2kfd_device_init()
784 kfd->num_nodes != 1) { in kgd2kfd_device_init()
873 for (i = 0; i < kfd->num_nodes; i++) { in kgd2kfd_pre_reset()
881 for (i = 0; i < kfd->num_nodes; i++) in kgd2kfd_pre_reset()
902 for (i = 0; i < kfd->num_nodes; i++) { in kgd2kfd_post_reset()
912 for (i = 0; i < kfd->num_nodes; i++) { in kgd2kfd_post_reset()
944 for (i = 0; i < kfd->num_nodes; i++) { in kgd2kfd_suspend()
[all …]
H A Dkfd_crat.c1281 uint16_t num_nodes; in kfd_parse_crat_table() local
1292 num_nodes = crat_table->num_domains; in kfd_parse_crat_table()
1295 pr_debug("Parsing CRAT table with %d nodes\n", num_nodes); in kfd_parse_crat_table()
1297 for (node_id = 0; node_id < num_nodes; node_id++) { in kfd_parse_crat_table()
1990 bool use_ta_info = kdev->kfd->num_nodes == 1; in kfd_fill_gpu_xgmi_link_to_gpu()
2091 (cu_info.cu_active_number / kdev->kfd->num_nodes); in kfd_create_vcrat_image_gpu()
2214 int ret = 0, num_nodes; in kfd_create_crat_image_virtual() local
2229 num_nodes = num_online_nodes(); in kfd_create_crat_image_virtual()
2231 num_nodes * (sizeof(struct crat_subtype_computeunit) + in kfd_create_crat_image_virtual()
2233 (num_nodes - 1) * sizeof(struct crat_subtype_iolink)); in kfd_create_crat_image_virtual()
H A Dkfd_mqd_manager.c113 cu_active_per_node = cu_info.cu_active_number / mm->dev->kfd->num_nodes; in mqd_symmetrically_map_cu_mask()
/openbsd/sys/dev/pci/
H A Dif_ice.c5932 for (i = 0; i < num_nodes; i++) in ice_sched_remove_elems()
17799 for (i = 0; i < num_nodes; i++) in ice_sched_suspend_resume_elems()
17842 num_nodes[i]++; in ice_sched_calc_vsi_support_nodes()
17863 num_nodes[i]++; in ice_sched_calc_vsi_support_nodes()
17902 for (i = 0; i < num_nodes; i++) { in ice_sched_add_elems()
17928 *num_nodes_added = num_nodes; in ice_sched_add_elems()
18002 if (!num_nodes) in ice_sched_add_nodes_to_hw_layer()
18120 i, num_nodes[i], in ice_sched_add_vsi_support_nodes()
18169 num_nodes); in ice_sched_add_vsi_to_topo()
18242 num_nodes[i] = num ? num : 1; in ice_sched_calc_vsi_child_nodes()
[all …]

12