Searched refs:mark_dfs_back_edges (Results 1 – 16 of 16) sorted by relevance
370 mark_dfs_back_edges (); in tracer()
573 if (mark_dfs_back_edges ()) in analyze_function()
896 mark_dfs_back_edges (); in perform_tree_ssa_dce()
158 mark_dfs_back_edges (void) in mark_dfs_back_edges() function
943 extern bool mark_dfs_back_edges (void);
1804 mark_dfs_back_edges (); in estimate_bb_frequencies()
1906 mark_dfs_back_edges (); in reorder_basic_blocks()
290 mark_dfs_back_edges (); in tree_ssa_dominator_optimize()
3089 mark_dfs_back_edges (); in reg_to_stack()
2987 mark_dfs_back_edges (); in variable_tracking_main()
5271 mark_dfs_back_edges (); in identify_jump_threads()
3689 mark_dfs_back_edges (); in bypass_conditional_jumps()
11667 mark_dfs_back_edges, need_fake_edge_p, flow_call_edges_add,13341 (estimate_bb_frequencies): Call mark_dfs_back_edges.13834 (estimate_bb_frequencies): Call mark_dfs_back_edges.15893 * flow.c (mark_dfs_back_edges): Move from loop_p ; mark back15897 (mark_dfs_back_edges): Declare.15899 (mark_constant_function): Use mark_dfs_back_edges.15902 (reg_to_stack): Call mark_dfs_back_edges; count the predecessors.
19700 * cfganal.c (mark_dfs_back_edges, flow_reverse_top_sort_order_compute,21641 * cfganal.c (can_fallthru, mark_dfs_back_edges, flow_call_edges_add,
489 (mark_dfs_back_edges): Fixed comment.34480 mark_dfs_back_edges.
10710 (mark_dfs_back_edges): Likewise.