| /freebsd-12.1/contrib/gcc/ |
| H A D | ddg.c | 499 g->nodes[i].successors = sbitmap_alloc (num_nodes); in create_ddg() 703 scc->nodes = sbitmap_alloc (g->num_nodes); in create_scc() 847 sbitmap from = sbitmap_alloc (num_nodes); in create_ddg_all_sccs() 848 sbitmap to = sbitmap_alloc (num_nodes); in create_ddg_all_sccs() 849 sbitmap scc_nodes = sbitmap_alloc (num_nodes); in create_ddg_all_sccs() 914 sbitmap workset = sbitmap_alloc (num_nodes); in find_nodes_on_paths() 915 sbitmap reachable_from = sbitmap_alloc (num_nodes); in find_nodes_on_paths() 916 sbitmap reach_to = sbitmap_alloc (num_nodes); in find_nodes_on_paths() 917 sbitmap tmp = sbitmap_alloc (num_nodes); in find_nodes_on_paths() 1024 sbitmap workset = sbitmap_alloc (num_nodes); in longest_simple_path() [all …]
|
| H A D | modulo-sched.c | 1366 sbitmap psp = sbitmap_alloc (ps->g->num_nodes); in get_sched_window() 1367 sbitmap pss = sbitmap_alloc (ps->g->num_nodes); in get_sched_window() 1492 sbitmap sched_nodes = sbitmap_alloc (num_nodes); in sms_schedule_by_order() 1663 sbitmap tmp = sbitmap_alloc (num_nodes); in check_nodes_order() 1717 sbitmap prev_sccs = sbitmap_alloc (num_nodes); in order_nodes_of_sccs() 1718 sbitmap on_path = sbitmap_alloc (num_nodes); in order_nodes_of_sccs() 1719 sbitmap tmp = sbitmap_alloc (num_nodes); in order_nodes_of_sccs() 1720 sbitmap ones = sbitmap_alloc (num_nodes); in order_nodes_of_sccs() 1905 sbitmap workset = sbitmap_alloc (num_nodes); in order_nodes_in_scc() 1906 sbitmap tmp = sbitmap_alloc (num_nodes); in order_nodes_in_scc() [all …]
|
| H A D | cfganal.c | 178 visited = sbitmap_alloc (last_basic_block); in mark_dfs_back_edges() 667 visited = sbitmap_alloc (last_basic_block); in post_order_compute() 756 visited = sbitmap_alloc (last_basic_block); in pre_and_rev_post_order_compute() 869 data->visited_blocks = sbitmap_alloc (last_basic_block); in flow_dfs_compute_reverse_init() 961 visited = sbitmap_alloc (size); in dfs_enumerate_from()
|
| H A D | lcm.c | 190 difference = sbitmap_alloc (n_exprs); in compute_earliest() 191 temp_bitmap = sbitmap_alloc (n_exprs); in compute_earliest() 570 difference = sbitmap_alloc (n_exprs); in compute_farthest() 571 temp_bitmap = sbitmap_alloc (n_exprs); in compute_farthest()
|
| H A D | sched-rgn.c | 541 inner = sbitmap_alloc (last_basic_block); in find_rgns() 544 header = sbitmap_alloc (last_basic_block); in find_rgns() 547 in_queue = sbitmap_alloc (last_basic_block); in find_rgns() 550 in_stack = sbitmap_alloc (last_basic_block); in find_rgns() 695 extended_rgn_header = sbitmap_alloc (last_basic_block); in find_rgns() 1343 sbitmap src = sbitmap_alloc (pot_split[bb_src]->n_bits); in split_edges() 1372 visited = sbitmap_alloc (last_basic_block); in compute_trg_info() 2914 blocks = sbitmap_alloc (last_basic_block); in init_regions() 2985 large_region_blocks = sbitmap_alloc (last_basic_block); in schedule_insns() 2990 blocks = sbitmap_alloc (last_basic_block); in schedule_insns() [all …]
|
| H A D | tree-ssa-dce.c | 830 last_stmt_necessary = sbitmap_alloc (last_basic_block); in tree_dce_init() 834 processed = sbitmap_alloc (num_ssa_names + 1); in tree_dce_init() 893 visited_control_parents = sbitmap_alloc (last_basic_block); in perform_tree_ssa_dce()
|
| H A D | sched-ebb.c | 629 large_region_blocks = sbitmap_alloc (last_basic_block); in schedule_ebbs() 634 blocks = sbitmap_alloc (last_basic_block); in schedule_ebbs()
|
| H A D | df-core.c | 636 sbitmap visited = sbitmap_alloc (last_basic_block); in df_iterative_dataflow() 637 sbitmap pending = sbitmap_alloc (last_basic_block); in df_iterative_dataflow() 638 sbitmap considered = sbitmap_alloc (last_basic_block); in df_iterative_dataflow()
|
| H A D | loop-unroll.c | 493 wont_exit = sbitmap_alloc (npeel + 1); in peel_loop_completely() 681 wont_exit = sbitmap_alloc (max_unroll + 1); in unroll_loop_constant_iterations() 1017 wont_exit = sbitmap_alloc (max_unroll + 2); in unroll_loop_runtime_iterations() 1275 wont_exit = sbitmap_alloc (npeel + 1); in peel_loop_simple() 1427 wont_exit = sbitmap_alloc (nunroll + 1); in unroll_loop_stupid()
|
| H A D | sbitmap.h | 177 extern sbitmap sbitmap_alloc (unsigned int);
|
| H A D | tree-into-ssa.c | 2097 interesting_blocks = sbitmap_alloc (last_basic_block); in rewrite_into_ssa() 2513 old_ssa_names = sbitmap_alloc (num_ssa_names + NAME_SETS_GROWTH_FACTOR); in init_update_ssa() 2516 new_ssa_names = sbitmap_alloc (num_ssa_names + NAME_SETS_GROWTH_FACTOR); in init_update_ssa() 3072 sbitmap tmp = sbitmap_alloc (old_ssa_names->n_bits); in update_ssa() 3105 tmp = sbitmap_alloc (last_basic_block); in update_ssa()
|
| H A D | tree-ssa-propagate.c | 488 executable_blocks = sbitmap_alloc (last_basic_block); in ssa_prop_init() 491 bb_in_list = sbitmap_alloc (last_basic_block); in ssa_prop_init()
|
| H A D | bt-load.c | 647 sbitmap bb_in = sbitmap_alloc (max_uid); in compute_out() 671 sbitmap reaching_defs = sbitmap_alloc (max_uid); in link_btr_uses() 704 sbitmap reaching_defs_of_reg = sbitmap_alloc(max_uid); in link_btr_uses()
|
| H A D | cfgloopmanip.c | 160 in_queue = sbitmap_alloc (last_basic_block); in fix_bb_placements() 286 seen = sbitmap_alloc (last_basic_block); in remove_path() 473 seen = sbitmap_alloc (last_basic_block); in loopify()
|
| H A D | tree-ssa-loop-ivcanon.c | 235 wont_exit = sbitmap_alloc (n_unroll + 1); in try_unroll_loop_completely()
|
| H A D | loop-unswitch.c | 424 zero_bitmap = sbitmap_alloc (2); in unswitch_loop()
|
| H A D | tree-ssa-live.c | 195 used = sbitmap_alloc (limit); in compact_var_map() 1020 seen = sbitmap_alloc (num_partitions); in root_var_init() 1088 seen = sbitmap_alloc (num_partitions); in type_var_init()
|
| H A D | cfgloop.c | 626 headers = sbitmap_alloc (last_basic_block); in flow_loops_find() 1151 irreds = sbitmap_alloc (last_basic_block); in verify_loop_structure()
|
| H A D | cfgbuild.c | 261 edge_cache = sbitmap_alloc (last_basic_block); in make_edges()
|
| H A D | tree-ssa-copy.c | 513 visited = sbitmap_alloc (num_ssa_names); in dump_copy_of()
|
| H A D | tree-stdarg.c | 65 visited = sbitmap_alloc (last_basic_block); in reachable_at_most_once()
|
| H A D | tree-ssa-phiopt.c | 257 sbitmap visited = sbitmap_alloc (last_basic_block); in blocks_in_phiopt_order()
|
| H A D | var-tracking.c | 1845 visited = sbitmap_alloc (last_basic_block); in vt_find_locations() 1846 in_worklist = sbitmap_alloc (last_basic_block); in vt_find_locations() 1847 in_pending = sbitmap_alloc (last_basic_block); in vt_find_locations()
|
| H A D | tree-ssa-structalias.c | 971 graph->direct_nodes = sbitmap_alloc (graph->size); in build_pred_graph() 1283 ti->visited = sbitmap_alloc (size); in init_topo_info() 1581 si->visited = sbitmap_alloc (size); in init_scc_info() 1583 si->roots = sbitmap_alloc (size); in init_scc_info() 2038 changed = sbitmap_alloc (size); in solve_graph()
|
| H A D | tree-ssa-loop-manip.c | 883 wont_exit = sbitmap_alloc (factor); in tree_unroll_loop()
|