Home
last modified time | relevance | path

Searched refs:sbitmap_alloc (Results 1 – 25 of 82) sorted by relevance

1234

/dflybsd-src/contrib/gcc-4.7/gcc/
H A Dddg.c655 g->nodes[i].successors = sbitmap_alloc (num_nodes); in create_ddg()
657 g->nodes[i].predecessors = sbitmap_alloc (num_nodes); in create_ddg()
885 scc->nodes = sbitmap_alloc (g->num_nodes); in create_scc()
1029 sbitmap tmp = sbitmap_alloc (num_nodes); in check_sccs()
1051 sbitmap from = sbitmap_alloc (num_nodes); in create_ddg_all_sccs()
1052 sbitmap to = sbitmap_alloc (num_nodes); in create_ddg_all_sccs()
1053 sbitmap scc_nodes = sbitmap_alloc (num_nodes); in create_ddg_all_sccs()
1123 sbitmap workset = sbitmap_alloc (num_nodes); in find_nodes_on_paths()
1124 sbitmap reachable_from = sbitmap_alloc (num_nodes); in find_nodes_on_paths()
1125 sbitmap reach_to = sbitmap_alloc (num_nodes); in find_nodes_on_paths()
[all …]
H A Dmodulo-sched.c768 move->uses = sbitmap_alloc (first_move + nreg_moves); in schedule_reg_moves()
778 distance1_uses = distances[1] ? sbitmap_alloc (g->num_nodes) : NULL; in schedule_reg_moves()
808 must_follow = sbitmap_alloc (first_move + nreg_moves); in schedule_reg_moves()
943 sbitmap sched_nodes = sbitmap_alloc (g->num_nodes); in optimize_sc()
1038 must_precede = sbitmap_alloc (g->num_nodes); in optimize_sc()
1039 must_follow = sbitmap_alloc (g->num_nodes); in optimize_sc()
1876 sbitmap psp = sbitmap_alloc (ps->g->num_nodes); in get_sched_window()
1877 sbitmap pss = sbitmap_alloc (ps->g->num_nodes); in get_sched_window()
2158 sbitmap sched_nodes = sbitmap_alloc (num_nodes); in sms_schedule_by_order()
2159 sbitmap must_precede = sbitmap_alloc (num_nodes); in sms_schedule_by_order()
[all …]
H A Dcfganal.c182 visited = sbitmap_alloc (last_basic_block); in mark_dfs_back_edges()
675 visited = sbitmap_alloc (last_basic_block); in post_order_compute()
773 sbitmap visited = sbitmap_alloc (last_basic_block); in dfs_find_deadend()
828 visited = sbitmap_alloc (last_basic_block); in inverted_post_order_compute()
977 visited = sbitmap_alloc (last_basic_block); in pre_and_rev_post_order_compute()
1090 data->visited_blocks = sbitmap_alloc (last_basic_block); in flow_dfs_compute_reverse_init()
1182 visited = sbitmap_alloc (size); in dfs_enumerate_from()
H A Dlcm.c189 difference = sbitmap_alloc (n_exprs); in compute_earliest()
190 temp_bitmap = sbitmap_alloc (n_exprs); in compute_earliest()
571 difference = sbitmap_alloc (n_exprs); in compute_farthest()
572 temp_bitmap = sbitmap_alloc (n_exprs); in compute_farthest()
H A Ddomwalk.c147 sbitmap visited = sbitmap_alloc (last_basic_block + 1); in walk_dominator_tree()
H A Dsched-rgn.c644 inner = sbitmap_alloc (last_basic_block); in haifa_find_rgns()
647 header = sbitmap_alloc (last_basic_block); in haifa_find_rgns()
650 in_queue = sbitmap_alloc (last_basic_block); in haifa_find_rgns()
653 in_stack = sbitmap_alloc (last_basic_block); in haifa_find_rgns()
798 extended_rgn_header = sbitmap_alloc (last_basic_block); in haifa_find_rgns()
1459 sbitmap src = sbitmap_alloc (pot_split[bb_src]->n_bits); in split_edges()
1501 visited = sbitmap_alloc (last_basic_block); in compute_trg_info()
3135 insn_referenced = sbitmap_alloc (sched_max_luid); in sched_rgn_compute_dependencies()
H A Dtree-ssa-dce.c1491 last_stmt_necessary = sbitmap_alloc (last_basic_block); in tree_dce_init()
1493 bb_contains_live_stmts = sbitmap_alloc (last_basic_block); in tree_dce_init()
1497 processed = sbitmap_alloc (num_ssa_names + 1); in tree_dce_init()
1568 visited_control_parents = sbitmap_alloc (last_basic_block); in perform_tree_ssa_dce()
H A Dloop-unroll.c473 wont_exit = sbitmap_alloc (npeel + 1); in peel_loop_completely()
661 wont_exit = sbitmap_alloc (max_unroll + 1); in unroll_loop_constant_iterations()
1046 wont_exit = sbitmap_alloc (max_unroll + 2); in unroll_loop_runtime_iterations()
1305 wont_exit = sbitmap_alloc (npeel + 1); in peel_loop_simple()
1459 wont_exit = sbitmap_alloc (nunroll + 1); in unroll_loop_stupid()
H A Dsbitmap.h210 extern sbitmap sbitmap_alloc (unsigned int);
H A Dtree-ssa-propagate.c492 executable_blocks = sbitmap_alloc (last_basic_block); in ssa_prop_init()
495 bb_in_list = sbitmap_alloc (last_basic_block); in ssa_prop_init()
H A Dtree-into-ssa.c2482 interesting_blocks = sbitmap_alloc (last_basic_block); in rewrite_into_ssa()
2885 old_ssa_names = sbitmap_alloc (num_ssa_names + NAME_SETS_GROWTH_FACTOR); in init_update_ssa()
2888 new_ssa_names = sbitmap_alloc (num_ssa_names + NAME_SETS_GROWTH_FACTOR); in init_update_ssa()
3460 sbitmap tmp = sbitmap_alloc (old_ssa_names->n_bits); in update_ssa()
3493 interesting_blocks = sbitmap_alloc (last_basic_block); in update_ssa()
H A Dira-lives.c1376 born = sbitmap_alloc (ira_max_point); in remove_some_program_points_and_update_live_ranges()
1377 dead = sbitmap_alloc (ira_max_point); in remove_some_program_points_and_update_live_ranges()
1388 born_or_dead = sbitmap_alloc (ira_max_point); in remove_some_program_points_and_update_live_ranges()
H A Dbt-load.c643 sbitmap bb_in = sbitmap_alloc (max_uid); in compute_out()
667 sbitmap reaching_defs = sbitmap_alloc (max_uid); in link_btr_uses()
700 sbitmap reaching_defs_of_reg = sbitmap_alloc(max_uid); in link_btr_uses()
H A Dtracer.c242 bb_seen = sbitmap_alloc (last_basic_block * 2); in tail_duplicate()
H A Dcfgloopmanip.c195 in_queue = sbitmap_alloc (last_basic_block); in fix_bb_placements()
330 seen = sbitmap_alloc (last_basic_block); in remove_path()
489 seen = sbitmap_alloc (last_basic_block); in update_dominators_in_loop()
H A Dtree-ssa-loop-ivcanon.c387 wont_exit = sbitmap_alloc (n_unroll + 1); in try_unroll_loop_completely()
H A Dsbitmap.c80 sbitmap_alloc (unsigned int n_elms) in sbitmap_alloc() function
101 sbitmap const bmap = sbitmap_alloc (n_elms); in sbitmap_alloc_with_popcount()
/dflybsd-src/contrib/gcc-8.0/gcc/
H A Dsbitmap.c42 sbitmap_alloc (unsigned int n_elms) in sbitmap_alloc() function
891 sbitmap s = sbitmap_alloc (16); in test_set_range()
902 s = sbitmap_alloc (1024); in test_set_range()
926 sbitmap s = sbitmap_alloc (1024); in test_bit_in_range()
942 s = sbitmap_alloc (64); in test_bit_in_range()
951 s = sbitmap_alloc (1024); in test_bit_in_range()
H A Dsbitmap.h253 extern sbitmap sbitmap_alloc (unsigned int);
293 m_bitmap (sbitmap_alloc (size)) {} in auto_sbitmap()
H A Dtree-ssa-dce.c1510 last_stmt_necessary = sbitmap_alloc (last_basic_block_for_fn (cfun)); in tree_dce_init()
1512 bb_contains_live_stmts = sbitmap_alloc (last_basic_block_for_fn (cfun)); in tree_dce_init()
1516 processed = sbitmap_alloc (num_ssa_names + 1); in tree_dce_init()
1583 sbitmap_alloc (last_basic_block_for_fn (cfun)); in perform_tree_ssa_dce()
H A Dddg.c630 g->nodes[i].successors = sbitmap_alloc (num_nodes); in create_ddg()
632 g->nodes[i].predecessors = sbitmap_alloc (num_nodes); in create_ddg()
860 scc->nodes = sbitmap_alloc (g->num_nodes); in create_scc()
H A Dtracer.c274 bb_seen = sbitmap_alloc (last_basic_block_for_fn (cfun) * 2); in tail_duplicate()
H A Dshrink-wrap.c1129 SW (bb)->has_components = sbitmap_alloc (SBITMAP_SIZE (components)); in init_separate_shrink_wrap()
1130 SW (bb)->head_components = sbitmap_alloc (SBITMAP_SIZE (components)); in init_separate_shrink_wrap()
1131 SW (bb)->tail_components = sbitmap_alloc (SBITMAP_SIZE (components)); in init_separate_shrink_wrap()
/dflybsd-src/contrib/gcc-8.0/gcc/config/i386/
H A Dx86-tune-sched-core.c169 data->ready_try_change = sbitmap_alloc (n_ready); in core2i7_first_cycle_multipass_issue()
/dflybsd-src/contrib/gcc-8.0/gcc/cp/
H A Dvtable-class-hierarchy.c383 sbitmap inserted = sbitmap_alloc (num_vtable_map_nodes); in vtv_compute_class_hierarchy_transitive_closure()
415 temp_node->descendants = sbitmap_alloc (num_vtable_map_nodes); in vtv_compute_class_hierarchy_transitive_closure()

1234