| /freebsd-12.1/contrib/gcc/ |
| H A D | lcm.c | 114 sbitmap_vector_ones (antin, last_basic_block); in compute_antinout_edge() 339 sbitmap_ones (laterin[last_basic_block]); in compute_laterin() 341 sbitmap_a_and_b (laterin[last_basic_block], in compute_laterin() 342 laterin[last_basic_block], in compute_laterin() 465 last_basic_block); in pre_edge_lcm() 491 sbitmap_vector_ones (avout, last_basic_block); in compute_available() 673 sbitmap_ones (nearerout[last_basic_block]); in compute_nearerout() 675 sbitmap_a_and_b (nearerout[last_basic_block], in compute_nearerout() 676 nearerout[last_basic_block], in compute_nearerout() 786 last_basic_block + 1); in pre_edge_rev_lcm() [all …]
|
| H A D | mode-switching.c | 418 = XCNEWVEC (struct bb_info, last_basic_block + entry_exit_extra); in optimize_mode_switching() 436 antic = sbitmap_vector_alloc (last_basic_block, n_entities); in optimize_mode_switching() 437 transp = sbitmap_vector_alloc (last_basic_block, n_entities); in optimize_mode_switching() 438 comp = sbitmap_vector_alloc (last_basic_block, n_entities); in optimize_mode_switching() 440 sbitmap_vector_ones (transp, last_basic_block); in optimize_mode_switching() 540 kill = sbitmap_vector_alloc (last_basic_block, n_entities); in optimize_mode_switching() 548 sbitmap_vector_zero (antic, last_basic_block); in optimize_mode_switching() 549 sbitmap_vector_zero (comp, last_basic_block); in optimize_mode_switching()
|
| H A D | cfganal.c | 170 pre = XCNEWVEC (int, last_basic_block); in mark_dfs_back_edges() 171 post = XCNEWVEC (int, last_basic_block); in mark_dfs_back_edges() 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() 954 size = last_basic_block; in dfs_enumerate_from()
|
| 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() 788 int *postorder = XNEWVEC (int, last_basic_block); in df_analyze() 877 int size = last_basic_block *sizeof (void *); in df_compact_blocks() 899 (last_basic_block - i) *sizeof (void *)); in df_compact_blocks() 903 for (i = NUM_FIXED_BLOCKS; i < last_basic_block; i++) in df_compact_blocks() 925 for (; i < last_basic_block; i++) in df_compact_blocks()
|
| H A D | gcse.c | 1018 sbitmap_vector_zero (transp, last_basic_block); in compute_local_properties() 1020 sbitmap_vector_ones (transp, last_basic_block); in compute_local_properties() 1024 sbitmap_vector_zero (comp, last_basic_block); in compute_local_properties() 1026 sbitmap_vector_zero (antloc, last_basic_block); in compute_local_properties() 3402 implicit_sets = XCNEWVEC (rtx, last_basic_block); in one_cprop_pass() 3688 bypass_last_basic_block = last_basic_block; in bypass_conditional_jumps() 3820 sbitmap_vector_zero (ae_kill, last_basic_block); in compute_pre_data() 4784 visited = XCNEWVEC (char, last_basic_block); in hoist_expr_reaches_here_p() 6048 sbitmap_vector_zero (ae_gen, last_basic_block); in build_store_vectors() 6084 sbitmap_vector_zero (ae_kill, last_basic_block); in build_store_vectors() [all …]
|
| H A D | sched-rgn.c | 537 max_hdr = XNEWVEC (int, last_basic_block); in find_rgns() 538 dfs_nr = XCNEWVEC (int, last_basic_block); in find_rgns() 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() 553 for (i = 0; i < last_basic_block; i++) in find_rgns() 1043 order = xmalloc (last_basic_block * sizeof (*order)); in extend_rgns() 1372 visited = sbitmap_alloc (last_basic_block); in compute_trg_info() 2914 blocks = sbitmap_alloc (last_basic_block); in init_regions() [all …]
|
| H A D | tree-ssa-dce.c | 826 control_dependence_map = XNEWVEC (bitmap, last_basic_block); in tree_dce_init() 827 for (i = 0; i < last_basic_block; ++i) in tree_dce_init() 830 last_stmt_necessary = sbitmap_alloc (last_basic_block); in tree_dce_init() 850 for (i = 0; i < last_basic_block; ++i) in tree_dce_done() 893 visited_control_parents = sbitmap_alloc (last_basic_block); in perform_tree_ssa_dce()
|
| H A D | cfgloopanal.c | 265 #define LOOP_REPR(LOOP) ((LOOP)->num + last_basic_block) 276 int *queue1 = XNEWVEC (int, last_basic_block + loops->num); in mark_irreducible_loops() 277 int *queue2 = XNEWVEC (int, last_basic_block + loops->num); in mark_irreducible_loops() 290 g = new_graph (last_basic_block + loops->num); in mark_irreducible_loops()
|
| H A D | dominance.c | 165 init_ar (di->dfs_order, TBB, (unsigned int) last_basic_block + 1, 0); in init_dom_info() 280 my_i = di->dfs_order[last_basic_block]; in calc_dfs_tree_nonrec() 318 di->dfs_order[last_basic_block] = di->dfsnum; in calc_dfs_tree() 350 di->dfs_parent[di->dfsnum] = di->dfs_order[last_basic_block]; in calc_dfs_tree() 364 di->dfs_parent[di->dfsnum] = di->dfs_order[last_basic_block]; in calc_dfs_tree() 525 k1 = di->dfs_order[last_basic_block]; in calc_idoms()
|
| H A D | tree-into-ssa.c | 370 = (basic_block *) xmalloc (sizeof (basic_block) * (last_basic_block + 1)); in compute_global_livein() 1040 gcc_assert (bb_index < (unsigned) last_basic_block); in find_idf() 1105 VEC_reserve (tree_vec, heap, phis_to_rewrite, last_basic_block + 1); in mark_phi_for_rewrite() 2097 interesting_blocks = sbitmap_alloc (last_basic_block); in rewrite_into_ssa() 2101 dfs = (bitmap *) xmalloc (last_basic_block * sizeof (bitmap)); in rewrite_into_ssa() 2361 gcc_assert (bb->index < last_basic_block); in prepare_def_site_for() 2964 phis_to_rewrite = VEC_alloc (tree_vec, heap, last_basic_block); in update_ssa() 3058 dfs = XNEWVEC (bitmap, last_basic_block); in update_ssa() 3105 tmp = sbitmap_alloc (last_basic_block); in update_ssa() 3128 fprintf (dump_file, "Number of blocks in CFG: %d\n", last_basic_block); in update_ssa() [all …]
|
| H A D | tree-ssa-loop-manip.c | 571 for (i = first_new_block; i < (unsigned) last_basic_block; i++) in copy_phi_node_args() 574 for (i = first_new_block; i < (unsigned) last_basic_block; i++) in copy_phi_node_args() 577 for (i = first_new_block; i < (unsigned) last_basic_block; i++) in copy_phi_node_args() 609 first_new_block = last_basic_block; in tree_duplicate_loop_to_header_edge()
|
| H A D | tracer.c | 202 fibnode_t *blocks = XCNEWVEC (fibnode_t, last_basic_block); in tail_duplicate() 204 int *counts = XNEWVEC (int, last_basic_block); in tail_duplicate()
|
| H A D | cfgbuild.c | 261 edge_cache = sbitmap_alloc (last_basic_block); in make_edges() 506 gcc_assert (last_basic_block == n_basic_blocks); in find_basic_blocks_1() 537 last_basic_block = NUM_FIXED_BLOCKS; in find_basic_blocks()
|
| 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 | cfgrtl.c | 302 bb->index = last_basic_block++; in create_basic_block_structure() 328 if ((size_t) last_basic_block >= VEC_length (basic_block, basic_block_info)) in rtl_create_basic_block() 331 size_t new_size = last_basic_block + (last_basic_block + 3) / 4; in rtl_create_basic_block() 1523 blocks = sbitmap_alloc (last_basic_block); in commit_edge_insertions() 1568 blocks = sbitmap_alloc (last_basic_block); in commit_edge_insertions_watch_calls() 2754 int last_bb = last_basic_block; in rtl_flow_call_edges_add()
|
| H A D | tree-ssa-loop-im.c | 701 old_last_basic_block = last_basic_block; in loop_commit_inserts() 703 for (i = old_last_basic_block; i < (unsigned) last_basic_block; i++) in loop_commit_inserts() 1504 sbitmap contains_call = sbitmap_alloc (last_basic_block); in tree_ssa_lim_initialize()
|
| H A D | bb-reorder.c | 775 if (new_bb->index >= array_size || last_basic_block > array_size) in copy_bb() 780 new_size = MAX (last_basic_block, new_bb->index + 1); in copy_bb() 1914 array_size = GET_ARRAY_SIZE (last_basic_block); in reorder_basic_blocks() 2171 int max_edges = 2 * last_basic_block; in partition_hot_cold_basic_blocks()
|
| H A D | predict.c | 1250 heads = XNEWVEC (int, last_basic_block); in tree_bb_level_predictions() 1251 memset (heads, ENTRY_BLOCK, sizeof (int) * last_basic_block); in tree_bb_level_predictions() 1252 heads[ENTRY_BLOCK_PTR->next_bb->index] = last_basic_block; in tree_bb_level_predictions() 1512 if (y == last_basic_block) in predict_paths_leading_to()
|
| H A D | cfghooks.c | 80 last_visited = XCNEWVEC (basic_block, last_basic_block); in verify_flow_info() 81 edge_checksum = XCNEWVEC (size_t, last_basic_block); in verify_flow_info()
|
| 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 | tree-cfg.c | 133 last_basic_block = NUM_FIXED_BLOCKS; in init_empty_tree_cfg() 389 bb->index = last_basic_block; in create_bb() 397 if ((size_t) last_basic_block == VEC_length (basic_block, basic_block_info)) in create_bb() 400 size_t new_size = last_basic_block + (last_basic_block + 3) / 4; in create_bb() 408 SET_BASIC_BLOCK (last_basic_block, bb); in create_bb() 411 last_basic_block++; in create_bb() 959 label_for_bb = XCNEWVEC (tree, last_basic_block); in cleanup_dead_labels() 2310 n_basic_blocks, n_edges, last_basic_block); in dump_tree_cfg() 5305 int last_bb = last_basic_block; in tree_flow_call_edges_add()
|
| H A D | tree-ssa-live.c | 523 live->num_blocks = last_basic_block; in new_tree_live_info() 713 stack = XNEWVEC (int, last_basic_block); in calculate_live_on_entry() 824 on_exit = (bitmap *)xmalloc (last_basic_block * sizeof (bitmap)); in calculate_live_on_exit() 825 for (x = 0; x < (unsigned)last_basic_block; x++) in calculate_live_on_exit()
|
| 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 | recog.c | 2734 blocks = sbitmap_alloc (last_basic_block); in split_all_insns() 2797 int old_last_basic_block = last_basic_block; in split_all_insns() 2801 if (old_last_basic_block != last_basic_block && upd_life) in split_all_insns() 2802 blocks = sbitmap_resize (blocks, last_basic_block, 1); in split_all_insns() 3054 blocks = sbitmap_alloc (last_basic_block); in peephole2_optimize()
|
| H A D | cfg.c | 180 for (; i < last_basic_block; i++) in compact_blocks() 183 last_basic_block = n_basic_blocks; in compact_blocks()
|