Home
last modified time | relevance | path

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

1234

/dragonfly/crypto/libressl/crypto/lhash/
H A Dlh_stats.c76 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()
121 for (i = 0; i < lh->num_nodes; i++) { in lh_node_usage_stats()
129 fprintf(out, "%lu nodes used out of %u\n", n_used, lh->num_nodes); in lh_node_usage_stats()
134 (int)(total / lh->num_nodes), in lh_node_usage_stats()
135 (int)((total % lh->num_nodes) * 100 / lh->num_nodes), in lh_node_usage_stats()
189 BIO_printf(out, "num_nodes = %u\n", lh->num_nodes); in lh_stats_bio()
220 for (i = 0; i < lh->num_nodes; i++) { in lh_node_stats_bio()
235 for (i = 0; i < lh->num_nodes; i++) { in lh_node_usage_stats_bio()
248 (int)(total / lh->num_nodes), in lh_node_usage_stats_bio()
[all …]
H A Dlhash.c128 ret->num_nodes = MIN_NODES / 2; in lh_new()
146 for (i = 0; i < lh->num_nodes; i++) { in lh_free()
166 if (lh->up_load <= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)) in lh_insert()
217 if ((lh->num_nodes > MIN_NODES) && in lh_delete()
218 (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes))) in lh_delete()
256 for (i = lh->num_nodes - 1; i >= 0; i--) { in doall_util_fn()
292 lh->num_nodes++; in expand()
358 lh->num_nodes--; in contract()
/dragonfly/contrib/gcc-4.7/gcc/
H A Dddg.c524 for (i = 0; i < g->num_nodes; i++) in build_intra_loop_deps()
593 int num_nodes = 0; in create_ddg() local
616 num_nodes++; in create_ddg()
627 g->num_nodes = num_nodes; in create_ddg()
683 for (i = 0; i < g->num_nodes; i++) in free_ddg()
730 for (i = 0; i < g->num_nodes; i++) in print_ddg()
958 for (i = 0; i < g->num_nodes; i++) in get_node_of_insn()
1050 int num_nodes = g->num_nodes; in create_ddg_all_sccs() local
1089 check_sccs (sccs, num_nodes); in create_ddg_all_sccs()
1120 int num_nodes = g->num_nodes; in find_nodes_on_paths() local
[all …]
H A Dtree-ssa-loop-unswitch.c203 found = loop->num_nodes; in tree_unswitch_single_loop()
208 for (; i < loop->num_nodes; i++) in tree_unswitch_single_loop()
212 if (i == loop->num_nodes) in tree_unswitch_single_loop()
219 if (found == loop->num_nodes) in tree_unswitch_single_loop()
252 if (found == loop->num_nodes) in tree_unswitch_single_loop()
274 tos = worklist = XNEWVEC (basic_block, loop->num_nodes); in tree_unswitch_single_loop()
276 for (i = 0; i < loop->num_nodes; i++) in tree_unswitch_single_loop()
324 for (; found < loop->num_nodes; found++) in tree_unswitch_single_loop()
329 if (found == loop->num_nodes) in tree_unswitch_single_loop()
H A Dmodulo-sched.c319 if (id < ps->g->num_nodes) in ps_rtl_insn()
342 if (id < ps->g->num_nodes) in ps_num_consecutive_stages()
506 for (i = 0; i < num_nodes; i++) in print_node_sched_params()
1133 if (u < ps->g->num_nodes) in duplicate_insns_of_cycles()
2156 int num_nodes = g->num_nodes; in sms_schedule_by_order() local
2493 for (i = 0; i < num_nodes; i++) in check_nodes_order()
2550 int num_nodes = g->num_nodes; in order_nodes_of_sccs() local
2582 while (pos < g->num_nodes) in order_nodes_of_sccs()
2599 int num_nodes = g->num_nodes; in calculate_order_params() local
2609 for (u = 0; u < num_nodes; u++) in calculate_order_params()
[all …]
H A Dcfgloop.c231 int num_nodes = 1; in flow_loop_nodes_find() local
245 num_nodes++; in flow_loop_nodes_find()
266 num_nodes++; in flow_loop_nodes_find()
274 return num_nodes; in flow_loop_nodes_find()
814 gcc_assert (loop->num_nodes); in get_loop_body()
874 gcc_assert (loop->num_nodes); in get_loop_body_in_dom_order()
919 while (i < loop->num_nodes) in get_loop_body_in_bfs_order()
1191 loop->num_nodes++; in add_bb_to_loop()
1193 ploop->num_nodes++; in add_bb_to_loop()
1216 loop->num_nodes--; in remove_bb_from_loops()
[all …]
H A Dtree-if-conv.c870 gcc_assert (loop->num_nodes); in get_loop_body_in_if_conv_order()
879 while (index < loop->num_nodes) in get_loop_body_in_if_conv_order()
904 if (index == loop->num_nodes in get_loop_body_in_if_conv_order()
905 && visited_count != loop->num_nodes) in get_loop_body_in_if_conv_order()
937 for (i = 0; i < loop->num_nodes; i++) in predicate_bbs()
940 for (i = 0; i < loop->num_nodes; i++) in predicate_bbs()
1060 for (i = 0; i < loop->num_nodes; i++) in if_convertible_loop_p_1()
1087 for (i = 0; i < loop->num_nodes; i++) in if_convertible_loop_p_1()
1136 if (loop->num_nodes <= 2) in if_convertible_loop_p()
1352 for (i = 0; i < loop->num_nodes; i++) in insert_gimplified_predicates()
[all …]
H A Dcfgloopmanip.c143 act->num_nodes -= loop->num_nodes; in fix_loop_placement()
202 qtop = queue + base_loop->num_nodes + 1; in fix_bb_placements()
444 loop->num_nodes++; in add_loop()
493 for (i = 0; i < loop->num_nodes; i++) in update_dominators_in_loop()
496 for (i = 0; i < loop->num_nodes; i++) in update_dominators_in_loop()
815 n = loop->num_nodes; in unloop()
936 ret = can_copy_bbs_p (bbs, loop->num_nodes); in can_duplicate_loop_p()
1025 n = loop->num_nodes; in duplicate_loop_to_header_edge()
1031 if (!can_copy_bbs_p (bbs, loop->num_nodes)) in duplicate_loop_to_header_edge()
1036 new_bbs = XNEWVEC (basic_block, loop->num_nodes); in duplicate_loop_to_header_edge()
[all …]
H A Dcfgloopanal.c180 for (i = 0; i < loop->num_nodes; i++) in num_loop_insns()
205 for (i = 0; i < loop->num_nodes; i++) in average_num_loop_insns()
/dragonfly/contrib/gcc-8.0/gcc/
H A Dddg.c568 int num_nodes = 0; in create_ddg() local
591 num_nodes++; in create_ddg()
602 g->num_nodes = num_nodes; in create_ddg()
1003 auto_sbitmap tmp (num_nodes); in check_sccs()
1022 int num_nodes = g->num_nodes; in create_ddg_all_sccs() local
1023 auto_sbitmap from (num_nodes); in create_ddg_all_sccs()
1024 auto_sbitmap to (num_nodes); in create_ddg_all_sccs()
1089 int num_nodes = g->num_nodes; in find_nodes_on_paths() local
1095 auto_sbitmap tmp (num_nodes); in find_nodes_on_paths()
1195 int num_nodes = g->num_nodes; in longest_simple_path() local
[all …]
H A Dmodulo-sched.c307 if (id < ps->g->num_nodes) in ps_rtl_insn()
330 if (id < ps->g->num_nodes) in ps_num_consecutive_stages()
492 for (i = 0; i < num_nodes; i++) in print_node_sched_params()
1116 if (u < ps->g->num_nodes) in duplicate_insns_of_cycles()
2140 int num_nodes = g->num_nodes; in sms_schedule_by_order() local
2465 auto_sbitmap tmp (num_nodes); in check_nodes_order()
2527 int num_nodes = g->num_nodes; in order_nodes_of_sccs() local
2530 auto_sbitmap tmp (num_nodes); in order_nodes_of_sccs()
2559 while (pos < g->num_nodes) in order_nodes_of_sccs()
2572 int num_nodes = g->num_nodes; in calculate_order_params() local
[all …]
H A Dcfgloop.c235 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()
896 gcc_assert (loop->num_nodes); in get_loop_body()
956 gcc_assert (loop->num_nodes); in get_loop_body_in_dom_order()
1000 while (i < loop->num_nodes) in get_loop_body_in_bfs_order()
1257 loop->num_nodes++; in add_bb_to_loop()
1259 ploop->num_nodes++; in add_bb_to_loop()
1282 loop->num_nodes--; in remove_bb_from_loops()
[all …]
H A Dtree-ssa-loop-unswitch.c314 found = loop->num_nodes; in tree_unswitch_single_loop()
319 for (; i < loop->num_nodes; i++) in tree_unswitch_single_loop()
323 if (i == loop->num_nodes) in tree_unswitch_single_loop()
330 if (found == loop->num_nodes) in tree_unswitch_single_loop()
365 if (found == loop->num_nodes) in tree_unswitch_single_loop()
387 tos = worklist = XNEWVEC (basic_block, loop->num_nodes); in tree_unswitch_single_loop()
389 for (i = 0; i < loop->num_nodes; i++) in tree_unswitch_single_loop()
438 for (; found < loop->num_nodes; found++) in tree_unswitch_single_loop()
443 if (found == loop->num_nodes) in tree_unswitch_single_loop()
665 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()
210 qtop = queue + base_loop->num_nodes + 1; in fix_bb_placements()
467 loop->num_nodes++; in add_loop()
499 scale_bbs_frequencies (bbs, loop->num_nodes, p); in scale_loop_frequencies()
632 for (i = 0; i < loop->num_nodes; i++) in update_dominators_in_loop()
635 for (i = 0; i < loop->num_nodes; i++) in update_dominators_in_loop()
946 n = loop->num_nodes; in unloop()
1102 ret = can_copy_bbs_p (bbs, loop->num_nodes); in can_duplicate_loop_p()
1159 n = loop->num_nodes; in duplicate_loop_to_header_edge()
1165 if (!can_copy_bbs_p (bbs, loop->num_nodes)) in duplicate_loop_to_header_edge()
[all …]
H A Dtree-if-conv.c1195 gcc_assert (loop->num_nodes); in get_loop_body_in_if_conv_order()
1204 while (index < loop->num_nodes) in get_loop_body_in_if_conv_order()
1229 if (index == loop->num_nodes in get_loop_body_in_if_conv_order()
1230 && visited_count != loop->num_nodes) in get_loop_body_in_if_conv_order()
1262 for (i = 0; i < loop->num_nodes; i++) in predicate_bbs()
1265 for (i = 0; i < loop->num_nodes; i++) in predicate_bbs()
1388 for (i = 0; i < loop->num_nodes; i++) in if_convertible_loop_p_1()
1399 for (i = 0; i < loop->num_nodes; i++) in if_convertible_loop_p_1()
1524 if (loop->num_nodes <= 2) in if_convertible_loop_p()
2588 save_length = loop->inner ? loop->inner->num_nodes : loop->num_nodes; in version_loop_for_if_conversion()
[all …]
H A Dgimple-loop-interchange.cc318 for (unsigned i = 0; i < m_loop->num_nodes; i++) in can_interchange_p()
1223 for (unsigned i = 0; i < outer->num_nodes; i++) in move_code_to_inner_loop()
1732 && loop->num_nodes != loop->inner->num_nodes + 3) in proper_loop_form_for_interchange()
1769 for (unsigned i = 0; i < loop->num_nodes; i++) in proper_loop_form_for_interchange()
1916 for (unsigned i = 0; i < loop->num_nodes; i++) in prepare_data_references()
1921 for (unsigned i = 0; loop_nest && i < loop->num_nodes; ++i) in prepare_data_references()
1944 for (unsigned i = 0; i < loop->num_nodes; i++) in prepare_data_references()
H A Dgimple-loop-jam.c150 loop->num_nodes = n; in merge_loop_tree()
355 gcc_assert (!next->num_nodes); in fuse_loops()
H A Dddg.h112 int num_nodes; member
/dragonfly/contrib/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 …]
/dragonfly/contrib/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()
H A Dclvmd-corosync.c83 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()
H A Dclvmd-openais.c87 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()
/dragonfly/contrib/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()
/dragonfly/sys/dev/drm/amd/amdgpu/
H A Damdgpu_vram_mgr.c147 unsigned long lpfn, num_nodes, pages_per_node, pages_left; in amdgpu_vram_mgr_new() local
159 num_nodes = 1; in amdgpu_vram_mgr_new()
163 num_nodes = DIV_ROUND_UP(mem->num_pages, pages_per_node); in amdgpu_vram_mgr_new()
166 nodes = kvmalloc_array(num_nodes, sizeof(*nodes), in amdgpu_vram_mgr_new()
179 for (i = 0; i < num_nodes; ++i) { in amdgpu_vram_mgr_new()

1234