* Makefile.in (bb-reorder.o): Add dependency on $(FIBHEAP_H).

	* bb-reorder.c (make_reorder_chain): Deleted.
	(make_reorder_chain_1): Deleted.
	(find_traces): New function.
	(rotate_loop): New function.
	(mark_bb_visited): New function.
	(find_traces_1_round): New function.
	(copy_bb): New function.
	(bb_to_key): New function.
	(better_edge_p): New function.
	(connect_traces): New function.
	(copy_bb_p): New function.
	(get_uncond_jump_length): New function.
	(reorder_basic_blocks): Use new functions (Software Trace Cache).
	* cfgcleanup.c (outgoing_edges_match): Enable crossjumping across loop
	boundaries.


git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@62645 138bc75d-0d04-0410-961f-82ee72b054a4

1 files changed, 0 insertions, 11 deletions

diff --git a/gcc/cfgcleanup.c b/gcc/cfgcleanup.c
index 19e9fd54468..2a23cc08fab 100644
--- a/gcc/cfgcleanup.c
+++ b/gcc/cfgcleanup.c
@@ -1143,17 +1143,6 @@ outgoing_edges_match (mode, bb1, bb2)
 	  || !onlyjump_p (bb2->end))
 	return false;
 
-      /* Do not crossjump across loop boundaries.  This is a temporary
-	 workaround for the common scenario in which crossjumping results
-	 in killing the duplicated loop condition, making bb-reorder rotate
-	 the loop incorrectly, leaving an extra unconditional jump inside
-	 the loop.
-
-	 This check should go away once bb-reorder knows how to duplicate
-	 code in this case or rotate the loops to avoid this scenario.  */
-      if (bb1->loop_depth != bb2->loop_depth)
-	return false;
-
       b1 = BRANCH_EDGE (bb1);
       b2 = BRANCH_EDGE (bb2);
       f1 = FALLTHRU_EDGE (bb1);