Home
last modified time | relevance | path

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

123456

/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dddg.c457 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 …]
H A Dmodulo-sched.c296 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); 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 …]
H A Dcfgloop.c150 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()
896 gcc_assert (loop->num_nodes); in get_loop_body()
898 body = XNEWVEC (basic_block, loop->num_nodes); in get_loop_body()
[all …]
H A Dtree-ssa-loop-unswitch.c313 found = loop->num_nodes; in tree_unswitch_single_loop()
318 for (; i < loop->num_nodes; i++) in tree_unswitch_single_loop()
322 if (i == loop->num_nodes) in tree_unswitch_single_loop()
329 if (found == loop->num_nodes) in tree_unswitch_single_loop()
364 if (found == loop->num_nodes) in tree_unswitch_single_loop()
386 tos = worklist = XNEWVEC (basic_block, loop->num_nodes); in tree_unswitch_single_loop()
388 for (i = 0; i < loop->num_nodes; i++) in tree_unswitch_single_loop()
437 for (; found < loop->num_nodes; found++) in tree_unswitch_single_loop()
442 if (found == loop->num_nodes) in tree_unswitch_single_loop()
664 for (i = 0; i < loop->num_nodes; i++) in find_loop_guard()
[all …]
H A Dcfgloopmanip.c143 act->num_nodes -= loop->num_nodes; in fix_loop_placement()
209 queue = XNEWVEC (basic_block, base_loop->num_nodes + 1); in fix_bb_placements()
210 qtop = queue + base_loop->num_nodes + 1; in fix_bb_placements()
233 for (unsigned i = 0; i < from->loop_father->num_nodes; ++i) in fix_bb_placements()
466 loop->num_nodes++; in add_loop()
498 scale_bbs_frequencies (bbs, loop->num_nodes, p); in scale_loop_frequencies()
631 for (i = 0; i < loop->num_nodes; i++) in update_dominators_in_loop()
634 for (i = 0; i < loop->num_nodes; i++) in update_dominators_in_loop()
945 n = loop->num_nodes; in unloop()
1109 ret = can_copy_bbs_p (bbs, loop->num_nodes); in can_duplicate_loop_p()
[all …]
H A Dtree-if-conv.c1213 gcc_assert (loop->num_nodes); in get_loop_body_in_if_conv_order()
1216 blocks = XCNEWVEC (basic_block, loop->num_nodes); in get_loop_body_in_if_conv_order()
1222 while (index < loop->num_nodes) in get_loop_body_in_if_conv_order()
1247 if (index == loop->num_nodes in get_loop_body_in_if_conv_order()
1248 && visited_count != loop->num_nodes) in get_loop_body_in_if_conv_order()
1280 for (i = 0; i < loop->num_nodes; i++) in predicate_bbs()
1283 for (i = 0; i < loop->num_nodes; i++) in predicate_bbs()
1361 for (unsigned int i = 0; i < loop->num_nodes; i++) in build_region()
1406 for (i = 0; i < loop->num_nodes; i++) in if_convertible_loop_p_1()
1417 for (i = 0; i < loop->num_nodes; i++) in if_convertible_loop_p_1()
[all …]
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dddg.cc457 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 …]
H A Dmodulo-sched.cc296 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 …]
H A Dcfgloop.cc152 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 …]
H A Dtree-ssa-loop-unswitch.cc319 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 …]
H A Dcfgloopmanip.cc143 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 …]
H A Dtree-if-conv.cc1225 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 …]
/netbsd-src/crypto/external/bsd/openssl/dist/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()
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()
/netbsd-src/crypto/external/bsd/openssl.old/dist/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()
/netbsd-src/external/gpl2/lvm2/dist/libdm/regex/
H A Dmatcher.c36 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/
H A Dclvmd-cman.c62 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()
H A Dclvmd-gulm.c74 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()
/netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/
H A Dcomplexity.cc98 unsigned num_nodes = 0; in from_vec_svalue() local
103 num_nodes += iter_c.m_num_nodes; in from_vec_svalue()
106 return complexity (num_nodes + 1, max_depth + 1); in from_vec_svalue()
H A Dcomplexity.h32 complexity (unsigned num_nodes, unsigned max_depth) in complexity()
33 : m_num_nodes (num_nodes), m_max_depth (max_depth) in complexity()
/netbsd-src/external/gpl2/lvm2/dist/libdm/datastruct/
H A Dhash.c28 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/sys/external/bsd/drm2/dist/drm/amd/amdgpu/
H A Dta_xgmi_if.h93 uint32_t num_nodes; member
98 uint32_t num_nodes; member
103 uint32_t num_nodes; member
H A Damdgpu_psp_v11_0.c750 if (!topology || topology->num_nodes > TA_XGMI__MAX_CONNECTED_NODES) in psp_v11_0_xgmi_get_topology_info()
759 topology_info_input->num_nodes = number_devices; in psp_v11_0_xgmi_get_topology_info()
761 for (i = 0; i < topology_info_input->num_nodes; i++) { in psp_v11_0_xgmi_get_topology_info()
775 topology->num_nodes = xgmi_cmd->xgmi_out_message.get_topology_info.num_nodes; in psp_v11_0_xgmi_get_topology_info()
776 for (i = 0; i < topology->num_nodes; i++) { in psp_v11_0_xgmi_get_topology_info()
793 if (!topology || topology->num_nodes > TA_XGMI__MAX_CONNECTED_NODES) in psp_v11_0_xgmi_set_topology_info()
801 topology_info_input->num_nodes = number_devices; in psp_v11_0_xgmi_set_topology_info()
803 for (i = 0; i < topology_info_input->num_nodes; i++) { in psp_v11_0_xgmi_set_topology_info()
H A Damdgpu_vram_mgr.c340 unsigned long lpfn, num_nodes, pages_per_node, pages_left; in amdgpu_vram_mgr_new() local
363 num_nodes = 1; in amdgpu_vram_mgr_new()
372 num_nodes = DIV_ROUND_UP(mem->num_pages, pages_per_node); in amdgpu_vram_mgr_new()
375 nodes = kvmalloc_array((uint32_t)num_nodes, sizeof(*nodes), in amdgpu_vram_mgr_new()

123456