Home
last modified time | relevance | path

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

12

/freebsd-10-stable/crypto/openssl/crypto/lhash/
Dlh_stats.c78 fprintf(out, "num_nodes = %u\n", lh->num_nodes); in lh_stats()
106 for (i = 0; i < lh->num_nodes; i++) { in lh_node_stats()
120 for (i = 0; i < lh->num_nodes; i++) { in lh_node_usage_stats()
128 fprintf(out, "%lu nodes used out of %u\n", n_used, lh->num_nodes); in lh_node_usage_stats()
133 (int)(total / lh->num_nodes), in lh_node_usage_stats()
134 (int)((total % lh->num_nodes) * 100 / lh->num_nodes), in lh_node_usage_stats()
185 BIO_printf(out, "num_nodes = %u\n", lh->num_nodes); in lh_stats_bio()
214 for (i = 0; i < lh->num_nodes; i++) { in lh_node_stats_bio()
228 for (i = 0; i < lh->num_nodes; i++) { in lh_node_usage_stats_bio()
236 BIO_printf(out, "%lu nodes used out of %u\n", n_used, lh->num_nodes); in lh_node_usage_stats_bio()
[all …]
Dlhash.c128 ret->num_nodes = MIN_NODES / 2; in lh_new()
166 for (i = 0; i < lh->num_nodes; i++) { in lh_free()
185 if (lh->up_load <= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)) in lh_insert()
234 if ((lh->num_nodes > MIN_NODES) && in lh_delete()
235 (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes))) in lh_delete()
273 for (i = lh->num_nodes - 1; i >= 0; i--) { in doall_util_fn()
309 lh->num_nodes++; in expand()
377 lh->num_nodes--; in contract()
Dlhash.h143 unsigned int num_nodes; member
/freebsd-10-stable/contrib/gcc/
Dddg.c268 for (i = src_node->cuid + 1; i < g->num_nodes; i++) in add_deps_for_def()
301 for (i = use_node->cuid + 1; i < g->num_nodes; i++) in add_deps_for_use()
390 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()
472 g->nodes = (ddg_node_ptr) xcalloc (num_nodes, sizeof (struct ddg_node)); in create_ddg()
499 g->nodes[i].successors = sbitmap_alloc (num_nodes); in create_ddg()
501 g->nodes[i].predecessors = sbitmap_alloc (num_nodes); in create_ddg()
[all …]
Dcfgloop.c140 for (i = 0; i < loop->num_nodes; i++) in flow_loop_dump()
228 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()
678 loops->parray[0]->num_nodes = n_basic_blocks; in flow_loops_find()
738 loop->num_nodes = flow_loop_nodes_find (loop->header, loop); in flow_loops_find()
789 gcc_assert (loop->num_nodes); in get_loop_body()
791 tovisit = XCNEWVEC (basic_block, loop->num_nodes); in get_loop_body()
797 gcc_assert (loop->num_nodes == (unsigned) n_basic_blocks); in get_loop_body()
[all …]
Dmodulo-sched.c341 return (g->num_nodes / issue_rate); in res_MII()
359 xcalloc (g->num_nodes, in set_node_sched_params()
364 for (i = 0; i < g->num_nodes; i++) in set_node_sched_params()
373 print_node_sched_params (FILE * file, int num_nodes) in print_node_sched_params() argument
379 for (i = 0; i < num_nodes; i++) in print_node_sched_params()
407 for (i = 0; i < g->num_nodes; i++) in calculate_maxii()
440 for (i = 0; i < g->num_nodes; i++) in generate_reg_moves()
475 uses_of_defs = sbitmap_vector_alloc (nreg_moves, g->num_nodes); in generate_reg_moves()
549 for (i = 0; i < ps->g->num_nodes; i++) in undo_generate_reg_moves()
598 for (i = 0; i < g->num_nodes - 1; i++) in normalize_sched_times()
[all …]
Dcfgloopmanip.c166 queue = XNEWVEC (basic_block, base_loop->num_nodes + 1); in fix_bb_placements()
167 qtop = queue + base_loop->num_nodes + 1; in fix_bb_placements()
397 scale_bbs_frequencies_int (bbs, loop->num_nodes, num, den); in scale_loop_frequencies()
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()
[all …]
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 …]
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()
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()
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()
Dddg.h120 int num_nodes; member
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()
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()
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()
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()
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()
Dcfgloop.h80 unsigned num_nodes; member
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()
Dtree-vect-patterns.c613 unsigned int nbbs = loop->num_nodes; in vect_pattern_recog()
Dloop-doloop.c196 for (i = 0; i < loop->num_nodes; i++) in doloop_valid_p()
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()
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()
Dlambda-code.c2083 for (i = 0; i < loop->num_nodes; i++) in perfect_nest_p()
2294 for (i = 0; i < loop->num_nodes; i++) in can_convert_to_perfect_nest()
2567 for (i = loop->num_nodes - 1; i >= 0 ; i--) in perfect_nestify()
/freebsd-10-stable/contrib/netbsd-tests/crypto/libcrypto/conf/
Dd_conf.out2 num_nodes = 24

12