Lines Matching refs:cfun
70 pre = XCNEWVEC (int, last_basic_block_for_fn (cfun)); in mark_dfs_back_edges()
71 post = XCNEWVEC (int, last_basic_block_for_fn (cfun)); in mark_dfs_back_edges()
74 auto_vec<edge_iterator, 20> stack (n_basic_blocks_for_fn (cfun) + 1); in mark_dfs_back_edges()
77 auto_sbitmap visited (last_basic_block_for_fn (cfun)); in mark_dfs_back_edges()
83 stack.quick_push (ei_start (ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs)); in mark_dfs_back_edges()
97 if (dest != EXIT_BLOCK_PTR_FOR_FN (cfun) && ! bitmap_bit_p (visited, in mark_dfs_back_edges()
115 if (dest != EXIT_BLOCK_PTR_FOR_FN (cfun) in mark_dfs_back_edges()
116 && src != ENTRY_BLOCK_PTR_FOR_FN (cfun) in mark_dfs_back_edges()
122 && src != ENTRY_BLOCK_PTR_FOR_FN (cfun)) in mark_dfs_back_edges()
149 tos = worklist = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun)); in find_unreachable_blocks()
153 FOR_EACH_BB_FN (bb, cfun) in find_unreachable_blocks()
160 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs) in find_unreachable_blocks()
197 FOR_EACH_BB_FN (bb, cfun) in verify_no_unreachable_blocks()
227 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), in create_edge_list()
228 EXIT_BLOCK_PTR_FOR_FN (cfun), next_bb) in create_edge_list()
240 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), in create_edge_list()
241 EXIT_BLOCK_PTR_FOR_FN (cfun), next_bb) in create_edge_list()
268 n_basic_blocks_for_fn (cfun), elist->num_edges); in print_edge_list()
273 if (INDEX_EDGE_PRED_BB (elist, x) == ENTRY_BLOCK_PTR_FOR_FN (cfun)) in print_edge_list()
278 if (INDEX_EDGE_SUCC_BB (elist, x) == EXIT_BLOCK_PTR_FOR_FN (cfun)) in print_edge_list()
297 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), in verify_edge_list()
298 EXIT_BLOCK_PTR_FOR_FN (cfun), next_bb) in verify_edge_list()
323 FOR_BB_BETWEEN (p, ENTRY_BLOCK_PTR_FOR_FN (cfun), in verify_edge_list()
324 EXIT_BLOCK_PTR_FOR_FN (cfun), next_bb) in verify_edge_list()
325 FOR_BB_BETWEEN (s, ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb, NULL, next_bb) in verify_edge_list()
362 if (bb == ENTRY_BLOCK_PTR_FOR_FN (cfun)) in set_control_dependence_map_bit()
364 gcc_assert (bb != EXIT_BLOCK_PTR_FOR_FN (cfun)); in set_control_dependence_map_bit()
384 gcc_assert (get_edge_src (edge_index) != EXIT_BLOCK_PTR_FOR_FN (cfun)); in find_control_dependence()
391 && current_block != EXIT_BLOCK_PTR_FOR_FN (cfun); in find_control_dependence()
407 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), in control_dependences()
408 EXIT_BLOCK_PTR_FOR_FN (cfun), next_bb) in control_dependences()
413 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), in control_dependences()
414 EXIT_BLOCK_PTR_FOR_FN (cfun), next_bb) in control_dependences()
429 control_dependence_map.create (last_basic_block_for_fn (cfun)); in control_dependences()
430 control_dependence_map.quick_grow (last_basic_block_for_fn (cfun)); in control_dependences()
431 for (int i = 0; i < last_basic_block_for_fn (cfun); ++i) in control_dependences()
461 return BASIC_BLOCK_FOR_FN (cfun, m_el[i].first); in get_edge_src()
469 return BASIC_BLOCK_FOR_FN (cfun, m_el[i].second); in get_edge_dest()
542 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb, NULL, next_bb) in remove_fake_edges()
551 remove_fake_predecessors (EXIT_BLOCK_PTR_FOR_FN (cfun)); in remove_fake_exit_edges()
564 FOR_EACH_BB_FN (bb, cfun) in add_noreturn_fake_exit_edges()
566 make_single_succ_edge (bb, EXIT_BLOCK_PTR_FOR_FN (cfun), EDGE_FAKE); in add_noreturn_fake_exit_edges()
590 dfs.add_bb (EXIT_BLOCK_PTR_FOR_FN (cfun)); in connect_infinite_loops_to_exit()
593 basic_block unvisited_block = EXIT_BLOCK_PTR_FOR_FN (cfun); in connect_infinite_loops_to_exit()
601 edge e = make_edge (deadend_block, EXIT_BLOCK_PTR_FOR_FN (cfun), in connect_infinite_loops_to_exit()
624 auto_vec<edge_iterator, 20> stack (n_basic_blocks_for_fn (cfun) + 1); in post_order_compute()
627 auto_sbitmap visited (last_basic_block_for_fn (cfun)); in post_order_compute()
633 stack.quick_push (ei_start (ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs)); in post_order_compute()
646 if (dest != EXIT_BLOCK_PTR_FOR_FN (cfun) in post_order_compute()
662 && src != ENTRY_BLOCK_PTR_FOR_FN (cfun)) in post_order_compute()
682 if (delete_unreachable && (count != n_basic_blocks_for_fn (cfun))) in post_order_compute()
686 for (b = ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb; b in post_order_compute()
687 != EXIT_BLOCK_PTR_FOR_FN (cfun); b = next_bb) in post_order_compute()
787 post_order->reserve_exact (n_basic_blocks_for_fn (cfun)); in inverted_post_order_compute()
793 auto_vec<edge_iterator, 20> stack (n_basic_blocks_for_fn (cfun) + 1); in inverted_post_order_compute()
796 auto_sbitmap visited (last_basic_block_for_fn (cfun)); in inverted_post_order_compute()
803 FOR_ALL_BB_FN (bb, cfun) in inverted_post_order_compute()
810 if (EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)) in inverted_post_order_compute()
812 stack.quick_push (ei_start (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)); in inverted_post_order_compute()
813 bitmap_set_bit (visited, EXIT_BLOCK_PTR_FOR_FN (cfun)->index); in inverted_post_order_compute()
818 FOR_ALL_BB_FN (bb, cfun) in inverted_post_order_compute()
859 if (bb != EXIT_BLOCK_PTR_FOR_FN (cfun) in inverted_post_order_compute()
873 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), in inverted_post_order_compute()
874 EXIT_BLOCK_PTR_FOR_FN (cfun), next_bb) in inverted_post_order_compute()
907 basic_block be = dfs_find_deadend (ENTRY_BLOCK_PTR_FOR_FN (cfun)); in inverted_post_order_compute()
1035 = pre_and_rev_post_order_compute_fn (cfun, pre_order, rev_post_order, in pre_and_rev_post_order_compute()
1039 gcc_assert (pre_order_num == n_basic_blocks_for_fn (cfun)); in pre_and_rev_post_order_compute()
1044 == (n_basic_blocks_for_fn (cfun) - NUM_FIXED_BLOCKS)); in pre_and_rev_post_order_compute()
1469 m_stack (n_basic_blocks_for_fn (cfun)), in depth_first_search()
1470 m_visited_blocks (last_basic_block_for_fn (cfun)) in depth_first_search()
1527 auto_bb_flag visited (cfun); in dfs_enumerate_from()
1602 FOR_EACH_BB_FN (b, cfun) in compute_dominance_frontiers()
1610 if (runner == ENTRY_BLOCK_PTR_FOR_FN (cfun)) in compute_dominance_frontiers()
1669 < (unsigned) last_basic_block_for_fn (cfun)); in compute_idf()
1702 if (e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun)) in bitmap_intersection_of_succs()
1718 if (e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun)) in bitmap_intersection_of_succs()
1741 if (e->src == ENTRY_BLOCK_PTR_FOR_FN (cfun)) in bitmap_intersection_of_preds()
1757 if (e->src == ENTRY_BLOCK_PTR_FOR_FN (cfun)) in bitmap_intersection_of_preds()
1780 if (e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun)) in bitmap_union_of_succs()
1796 if (e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun)) in bitmap_union_of_succs()
1819 if (e->src== ENTRY_BLOCK_PTR_FOR_FN (cfun)) in bitmap_union_of_preds()
1835 if (e->src == ENTRY_BLOCK_PTR_FOR_FN (cfun)) in bitmap_union_of_preds()
1853 basic_block *order = XNEWVEC (basic_block, n_basic_blocks_for_fn (cfun)); in single_pred_before_succ_order()
1854 unsigned n = n_basic_blocks_for_fn (cfun) - NUM_FIXED_BLOCKS; in single_pred_before_succ_order()
1856 auto_sbitmap visited (last_basic_block_for_fn (cfun)); in single_pred_before_succ_order()
1863 MARK_VISITED (ENTRY_BLOCK_PTR_FOR_FN (cfun)); in single_pred_before_succ_order()
1864 FOR_EACH_BB_FN (x, cfun) in single_pred_before_succ_order()