tree-cfg.c (tree_forwarder_block_p): Speed up by reordering two checks.
authorKazu Hirata <kazu@cs.umass.edu>
Tue, 23 Nov 2004 22:38:07 +0000 (22:38 +0000)
committerKazu Hirata <kazu@gcc.gnu.org>
Tue, 23 Nov 2004 22:38:07 +0000 (22:38 +0000)
* tree-cfg.c (tree_forwarder_block_p): Speed up by reordering
two checks.

From-SVN: r91108

gcc/ChangeLog
gcc/tree-cfg.c

index dbc9d4cc9e99cceb780c42f8fc6987257a2300a4..a16e9b6f04187095ba895926f6c4cb14aaf9797c 100644 (file)
@@ -1,3 +1,8 @@
+2004-11-23  Kazu Hirata  <kazu@cs.umass.edu>
+
+       * tree-cfg.c (tree_forwarder_block_p): Speed up by reordering
+       two checks.
+
 2004-11-23  Zack Weinberg  <zack@codesourcery.com>
 
        * function.h (struct function): Remove calls_longjmp.
index bcd025f717d79528d766a3d0796798395659a415..aa4ba4664df26498187093ff99033ffaf1385f00 100644 (file)
@@ -3907,9 +3907,6 @@ tree_forwarder_block_p (basic_block bb)
   gcc_assert (bb != ENTRY_BLOCK_PTR);
 #endif
 
-  if (find_edge (ENTRY_BLOCK_PTR, bb))
-    return false;
-
   /* Now walk through the statements.  We can ignore labels, anything else
      means this is not a forwarder block.  */
   for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
@@ -3928,6 +3925,9 @@ tree_forwarder_block_p (basic_block bb)
        }
     }
 
+  if (find_edge (ENTRY_BLOCK_PTR, bb))
+    return false;
+
   return true;
 }