tree-ssa-dom.c (thread_across_edge): Speed up by avoiding a call to…

tree-ssa-dom.c (thread_across_edge): Speed up by avoiding a call to is_gimple_min_invariant if we know the result.

	* tree-ssa-dom.c (thread_across_edge): Speed up by avoiding a
	call to is_gimple_min_invariant if we know the result.

From-SVN: r92003

gcc/ChangeLog

@@ -3,6 +3,9 @@
 	* tree-data-ref.c (free_data_refs): Free each data_reference
 	object.
 
+	* tree-ssa-dom.c (thread_across_edge): Speed up by avoiding a
+	call to is_gimple_min_invariant if we know the result.
+
 2004-12-10  Jeff Law  <law@redhat.com>
 
 	* tree-ssa-alias.c (setup_pointers_and_addressables): Remove

gcc/tree-ssa-dom.c

@@ -745,12 +745,12 @@ thread_across_edge (struct dom_walk_data *walk_data, edge e)
 	     otherwise look it up in the hash tables.  */
 	  cached_lhs = local_fold (COND_EXPR_COND (dummy_cond));
 	  if (! is_gimple_min_invariant (cached_lhs))
-	    cached_lhs = lookup_avail_expr (dummy_cond, false);
- 	  if (!cached_lhs || ! is_gimple_min_invariant (cached_lhs))
 	    {
-	      cached_lhs = simplify_cond_and_lookup_avail_expr (dummy_cond,
-								NULL,
-								false);
+	      cached_lhs = lookup_avail_expr (dummy_cond, false);
+	      if (!cached_lhs || ! is_gimple_min_invariant (cached_lhs))
+		cached_lhs = simplify_cond_and_lookup_avail_expr (dummy_cond,
+								  NULL,
+								  false);
 	    }
 	}
       /* We can have conditionals which just test the state of a