Home
last modified time | relevance | path

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

12

/freebsd-12.1/contrib/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()
856 unsigned int orig_loop_num_nodes = loop->num_nodes; in process_phi_nodes()
897 unsigned int orig_loop_num_nodes = loop->num_nodes; in combine_blocks()
1066 gcc_assert (loop->num_nodes); in get_loop_body_in_if_conv_order()
1069 blocks = XCNEWVEC (basic_block, loop->num_nodes); in get_loop_body_in_if_conv_order()
1075 while (index < loop->num_nodes) in get_loop_body_in_if_conv_order()
1097 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 Dtree-vect-analyze.c100 int nbbs = loop->num_nodes; in vect_determine_vectorization_factor()
233 int nbbs = loop->num_nodes; in vect_analyze_operations()
1613 unsigned int nbbs = loop->num_nodes; in vect_mark_stmts_to_be_vectorized()
1927 || loop->num_nodes != 2 in vect_analyze_loop_form()
1934 else if (loop->num_nodes != 2) in vect_analyze_loop_form()
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 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 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 Dcfgloop.h80 unsigned num_nodes; member
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()
H A Dtree-vect-patterns.c613 unsigned int nbbs = loop->num_nodes; in vect_pattern_recog()
H A Dloop-doloop.c196 for (i = 0; i < loop->num_nodes; i++) in doloop_valid_p()
H A Dtree-ssa-loop-im.c1298 for (i = 0; i < loop->num_nodes; i++) in gather_mem_refs()
1447 for (i = 0; i < loop->num_nodes; i++) in fill_always_executed_in()
H A Dpredict.c717 for (j = 0; j < loop->num_nodes; j++) in predict_loops()
1713 for (i = 0; i < loop->num_nodes; i++) in estimate_loops_at_level()
/freebsd-12.1/crypto/openssl/crypto/lhash/
H A Dlh_stats.c65 BIO_printf(out, "num_nodes = %u\n", lh->num_nodes); in OPENSSL_LH_stats_bio()
87 for (i = 0; i < lh->num_nodes; i++) { in OPENSSL_LH_node_stats_bio()
101 for (i = 0; i < lh->num_nodes; i++) { in OPENSSL_LH_node_usage_stats_bio()
109 BIO_printf(out, "%lu nodes used out of %u\n", n_used, lh->num_nodes); in OPENSSL_LH_node_usage_stats_bio()
114 (int)(total / lh->num_nodes), in OPENSSL_LH_node_usage_stats_bio()
115 (int)((total % lh->num_nodes) * 100 / lh->num_nodes), in OPENSSL_LH_node_usage_stats_bio()
H A Dlhash.c63 ret->num_nodes = MIN_NODES / 2; in OPENSSL_LH_new()
84 for (i = 0; i < lh->num_nodes; i++) { in OPENSSL_LH_free()
103 if ((lh->up_load <= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)) && !expand(lh)) in OPENSSL_LH_insert()
149 if ((lh->num_nodes > MIN_NODES) && in OPENSSL_LH_delete()
150 (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes))) in OPENSSL_LH_delete()
191 for (i = lh->num_nodes - 1; i >= 0; i--) { in doall_util_fn()
240 lh->num_nodes++; in expand()
282 lh->num_nodes--; in contract()
H A Dlhash_lcl.h23 unsigned int num_nodes; member
/freebsd-12.1/contrib/netbsd-tests/crypto/libcrypto/conf/
H A Dd_conf.out2 num_nodes = 24
/freebsd-12.1/sys/xen/interface/
H A Dsysctl.h527 uint32_t num_nodes; member

12