| /netbsd/src/external/gpl3/gcc/dist/gcc/ |
| D | ddg.cc | 457 for (i = 0; i < g->num_nodes; i++) in build_intra_loop_deps()
523 int num_nodes = 0; in create_ddg() local
543 num_nodes++; in create_ddg()
548 if (num_nodes <= 1) in create_ddg()
555 g->num_nodes = num_nodes; in create_ddg()
556 g->nodes = (ddg_node_ptr) xcalloc (num_nodes, sizeof (struct ddg_node)); in create_ddg()
581 g->nodes[i].successors = sbitmap_alloc (num_nodes); in create_ddg()
583 g->nodes[i].predecessors = sbitmap_alloc (num_nodes); in create_ddg()
590 g->nodes[i].max_dist = XCNEWVEC (int, num_nodes); in create_ddg()
591 for (j = 0; j < num_nodes; j++) in create_ddg()
[all …]
|
| D | modulo-sched.cc | 296 gcc_checking_assert (id >= ps->g->num_nodes); in ps_reg_move()
297 return &ps->reg_moves[id - ps->g->num_nodes]; in ps_reg_move()
305 if (id < ps->g->num_nodes) in ps_rtl_insn()
319 gcc_assert (id < ps->g->num_nodes); in ps_first_note()
328 if (id < ps->g->num_nodes) in ps_num_consecutive_stages()
440 return g->num_nodes / issue_rate; in res_MII()
452 node_sched_param_vec.safe_grow_cleared (g->num_nodes, true); in set_node_sched_params()
459 node_sched_param_vec.safe_grow_cleared (ps->g->num_nodes in extend_node_sched_params()
494 print_node_sched_params (FILE *file, int num_nodes, partial_schedule_ptr ps) in print_node_sched_params() argument
500 for (i = 0; i < num_nodes; i++) in print_node_sched_params()
[all …]
|
| D | cfgloop.cc | 152 for (i = 0; i < loop->num_nodes; i++) in flow_loop_dump()
235 int num_nodes = 1; in flow_loop_nodes_find() local
247 num_nodes++; in flow_loop_nodes_find()
266 num_nodes++; in flow_loop_nodes_find()
274 return num_nodes; in flow_loop_nodes_find()
375 root->num_nodes = n_basic_blocks_for_fn (fn); in init_loops_structure()
448 loops->tree_root->num_nodes = n_basic_blocks_for_fn (cfun); in flow_loops_find()
512 loop->num_nodes = flow_loop_nodes_find (loop->header, loop); in flow_loops_find()
893 gcc_assert (loop->num_nodes); in get_loop_body()
895 body = XNEWVEC (basic_block, loop->num_nodes); in get_loop_body()
[all …]
|
| D | tree-ssa-loop-unswitch.cc | 319 found = loop->num_nodes; in tree_unswitch_single_loop()
324 for (; i < loop->num_nodes; i++) in tree_unswitch_single_loop()
328 if (i == loop->num_nodes) in tree_unswitch_single_loop()
335 if (found == loop->num_nodes) in tree_unswitch_single_loop()
370 if (found == loop->num_nodes) in tree_unswitch_single_loop()
392 tos = worklist = XNEWVEC (basic_block, loop->num_nodes); in tree_unswitch_single_loop()
394 for (i = 0; i < loop->num_nodes; i++) in tree_unswitch_single_loop()
443 for (; found < loop->num_nodes; found++) in tree_unswitch_single_loop()
448 if (found == loop->num_nodes) in tree_unswitch_single_loop()
685 for (i = 0; i < loop->num_nodes; i++) in find_loop_guard()
[all …]
|
| D | cfgloopmanip.cc | 143 act->num_nodes -= loop->num_nodes; in fix_loop_placement()
208 queue = XNEWVEC (basic_block, base_loop->num_nodes + 1); in fix_bb_placements()
209 qtop = queue + base_loop->num_nodes + 1; in fix_bb_placements()
232 for (unsigned i = 0; i < from->loop_father->num_nodes; ++i) in fix_bb_placements()
465 loop->num_nodes++; in add_loop()
497 scale_bbs_frequencies (bbs, loop->num_nodes, p); in scale_loop_frequencies()
630 for (i = 0; i < loop->num_nodes; i++) in update_dominators_in_loop()
633 for (i = 0; i < loop->num_nodes; i++) in update_dominators_in_loop()
879 n = loop->num_nodes; in unloop()
1043 ret = can_copy_bbs_p (bbs, loop->num_nodes); in can_duplicate_loop_p()
[all …]
|
| D | tree-if-conv.cc | 1225 gcc_assert (loop->num_nodes); in get_loop_body_in_if_conv_order()
1228 blocks = XCNEWVEC (basic_block, loop->num_nodes); in get_loop_body_in_if_conv_order()
1234 while (index < loop->num_nodes) in get_loop_body_in_if_conv_order()
1259 if (index == loop->num_nodes in get_loop_body_in_if_conv_order()
1260 && visited_count != loop->num_nodes) in get_loop_body_in_if_conv_order()
1292 for (i = 0; i < loop->num_nodes; i++) in predicate_bbs()
1295 for (i = 0; i < loop->num_nodes; i++) in predicate_bbs()
1373 for (unsigned int i = 0; i < loop->num_nodes; i++) in build_region()
1418 for (i = 0; i < loop->num_nodes; i++) in if_convertible_loop_p_1()
1429 for (i = 0; i < loop->num_nodes; i++) in if_convertible_loop_p_1()
[all …]
|
| D | tree-ssa-loop-split.cc | 501 for (j = 0; j < loop1->num_nodes; j++) in fix_loop_bb_probability()
512 for (j = 0; j < loop2->num_nodes; j++) in fix_loop_bb_probability()
554 if (!can_copy_bbs_p (bbs, loop1->num_nodes)) in split_loop()
561 for (i = 0; i < loop1->num_nodes; i++) in split_loop()
1382 for (unsigned i = 0; i < loop->num_nodes; i++) in compute_added_num_insns()
1616 for (unsigned i = 0; i < loop->num_nodes; i++) in split_loop_on_cond()
1619 for (unsigned i = 0; i < loop->num_nodes; i++) in split_loop_on_cond()
|
| D | gimple-loop-interchange.cc | 318 for (unsigned i = 0; i < m_loop->num_nodes; i++) in can_interchange_p()
1228 for (unsigned i = 0; i < outer->num_nodes; i++) in move_code_to_inner_loop()
1752 && loop->num_nodes != loop->inner->num_nodes + 3) in proper_loop_form_for_interchange()
1789 for (unsigned i = 0; i < loop->num_nodes; i++) in proper_loop_form_for_interchange()
1936 for (unsigned i = 0; i < loop->num_nodes; i++) in prepare_data_references()
1941 for (unsigned i = 0; loop_nest && i < loop->num_nodes; ++i) in prepare_data_references()
1967 for (unsigned i = 0; i < loop->num_nodes; i++) in prepare_data_references()
|
| D | ddg.h | 113 int num_nodes; member
|
| D | gimple-loop-jam.cc | 150 loop->num_nodes = n; in merge_loop_tree()
361 gcc_assert (!next->num_nodes); in fuse_loops()
|
| D | loop-unroll.cc | 896 for (i = 0; i < loop->num_nodes; i++) in unroll_loop_runtime_iterations()
1285 for (i = 0; i < loop->num_nodes; i++) in referenced_in_one_insn_in_loop_p()
1311 for (i = 0; debug_uses && i < loop->num_nodes; i++) in reset_debug_uses_in_loop()
1567 = new hash_table<iv_split_hasher> (5 * loop->num_nodes); in analyze_insns_in_loop()
1589 = new hash_table<var_expand_hasher> (5 * loop->num_nodes); in analyze_insns_in_loop()
1594 for (i = 0; i < loop->num_nodes; i++) in analyze_insns_in_loop()
|
| D | df-core.cc | 1304 stack = XNEWVEC (edge_iterator, loop->num_nodes + 1); in loop_post_order_compute()
1364 post_order->reserve_exact (loop->num_nodes); in loop_inverted_post_order_compute()
1367 stack = XNEWVEC (edge_iterator, loop->num_nodes + 1); in loop_inverted_post_order_compute()
1427 df->postorder = XNEWVEC (int, loop->num_nodes); in df_analyze_loop()
1431 gcc_assert ((unsigned) df->n_blocks == loop->num_nodes); in df_analyze_loop()
1432 gcc_assert (df->postorder_inverted.length () == loop->num_nodes); in df_analyze_loop()
|
| D | cfgloopanal.cc | 184 for (i = 0; i < loop->num_nodes; i++) in num_loop_insns()
210 for (i = 0; i < loop->num_nodes; i++) in average_num_loop_insns()
|
| D | tree-vect-loop-manip.cc | 1063 bbs = XNEWVEC (basic_block, scalar_loop->num_nodes + 1); in slpeel_tree_duplicate_loop_to_edge_cfg()
1065 get_loop_body_with_size (scalar_loop, pbbs, scalar_loop->num_nodes); in slpeel_tree_duplicate_loop_to_edge_cfg()
1070 if (!can_copy_bbs_p (pbbs, scalar_loop->num_nodes)) in slpeel_tree_duplicate_loop_to_edge_cfg()
1091 new_bbs = XNEWVEC (basic_block, scalar_loop->num_nodes + 1); in slpeel_tree_duplicate_loop_to_edge_cfg()
1094 copy_bbs (bbs, scalar_loop->num_nodes + 1, new_bbs, in slpeel_tree_duplicate_loop_to_edge_cfg()
1127 add_phi_args_after_copy (new_bbs, scalar_loop->num_nodes + 1, NULL); in slpeel_tree_duplicate_loop_to_edge_cfg()
1130 for (unsigned i = (at_exit ? 0 : 1); i < scalar_loop->num_nodes + 1; i++) in slpeel_tree_duplicate_loop_to_edge_cfg()
1310 || loop->num_nodes != num_bb in slpeel_can_duplicate_loop_p()
2634 for (unsigned i = 0; i < loop->num_nodes; ++i) in vect_do_peeling()
2984 for (unsigned int i = 0; i < epilog->num_nodes; i++) in vect_do_peeling()
|
| /netbsd/src/crypto/external/bsd/openssl/dist/crypto/lhash/ |
| D | lh_stats.c | 65 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()
|
| D | lhash.c | 63 ret->num_nodes = MIN_NODES / 2; in OPENSSL_LH_new()
94 for (i = 0; i < lh->num_nodes; i++) { in OPENSSL_LH_flush()
114 if ((lh->up_load <= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)) && !expand(lh)) in OPENSSL_LH_insert()
156 if ((lh->num_nodes > MIN_NODES) && in OPENSSL_LH_delete()
157 (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes))) in OPENSSL_LH_delete()
190 for (i = lh->num_nodes - 1; i >= 0; i--) { in doall_util_fn()
238 lh->num_nodes++; in expand()
278 lh->num_nodes--; in contract()
|
| D | lhash_local.h | 23 unsigned int num_nodes; member
|
| /netbsd/src/external/gpl2/lvm2/dist/libdm/regex/ |
| D | matcher.c | 36 unsigned num_nodes; member
74 for (i = 0; i < m->num_nodes; i++) { in _create_bitsets()
76 n->firstpos = dm_bitset_create(m->scratch, m->num_nodes); in _create_bitsets()
77 n->lastpos = dm_bitset_create(m->scratch, m->num_nodes); in _create_bitsets()
78 n->followpos = dm_bitset_create(m->scratch, m->num_nodes); in _create_bitsets()
87 for (i = 0; i < m->num_nodes; i++) { in _calc_functions()
148 for (j = 0; j < m->num_nodes; j++) { in _calc_functions()
159 for (j = 0; j < m->num_nodes; j++) { in _calc_functions()
196 unsigned iwidth = (m->num_nodes / DM_BITS_PER_INT) + 1; in _calc_states()
206 if (!(bs = dm_bitset_create(m->scratch, m->num_nodes))) in _calc_states()
[all …]
|
| /netbsd/src/external/gpl2/lvm2/dist/daemons/clvmd/ |
| D | clvmd-cman.c | 62 static int num_nodes; variable
144 for (i=0; i<num_nodes; i++) { in _get_num_nodes()
295 for (i = 0; i < num_nodes; i++) { in count_clvmds_running()
313 num_nodes = cman_get_node_count(c_handle); in get_members()
314 if (num_nodes == -1) { in get_members()
320 if (num_nodes > count_nodes && nodes) { in get_members()
326 count_nodes = num_nodes + 10; /* Overallocate a little */ in get_members()
353 for (i = 0; i < num_nodes; i++) { in _csid_from_name()
367 for (i = 0; i < num_nodes; i++) { in _name_from_csid()
383 for (i = 0; i < num_nodes; i++) { in name_from_nodeid()
|
| D | clvmd-gulm.c | 74 static int num_nodes; variable
333 num_nodes++; in set_node_state()
345 num_nodes--; in set_node_state()
357 ninfo->name, ninfo->state, num_nodes); in set_node_state()
627 DEBUGLOG("num_nodes = %d\n", num_nodes); in _get_num_nodes()
628 return num_nodes; in _get_num_nodes()
645 num_nodes++; in gulm_add_up_node()
|
| D | clvmd-corosync.c | 83 static int num_nodes; variable
295 num_nodes = member_list_entries; in corosync_cpg_confchg_callback()
414 DEBUGLOG("num_nodes = %d\n", num_nodes); in _get_num_nodes()
415 return num_nodes; in _get_num_nodes()
|
| D | clvmd-openais.c | 87 static int num_nodes; variable
323 num_nodes = member_list_entries; in openais_cpg_confchg_callback()
439 DEBUGLOG("num_nodes = %d\n", num_nodes); in _get_num_nodes()
440 return num_nodes; in _get_num_nodes()
|
| /netbsd/src/external/gpl2/lvm2/dist/libdm/datastruct/ |
| D | hash.c | 28 unsigned num_nodes; member
183 t->num_nodes++; in dm_hash_insert_binary()
198 t->num_nodes--; in dm_hash_remove_binary()
219 return t->num_nodes; in dm_hash_get_num_entries()
238 t->num_nodes = 0u; in dm_hash_wipe()
|
| /netbsd/src/tests/crypto/libcrypto/conf/ |
| D | d_conf-3x.out | 2 num_nodes = 24
|
| D | d_conf-1x.out | 2 num_nodes = 24
|