Feeding not optimized IL can result in predicate normalization
to simplify things so a predicate can get true or false. The
following re-orders the early exit in that case to come after
simplification and normalization to take care of that.
Bootstrapped and tested on x86_64-unknown-linux-gnu, pushed.
PR tree-optimization/110392
* gimple-predicate-analysis.cc (uninit_analysis::is_use_guarded):
Do early exits on true/false predicate only after normalization.
---
gcc/gimple-predicate-analysis.cc | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/gcc/gimple-predicate-analysis.cc b/gcc/gimple-predicate-analysis.cc
index 7f20f81ad86..373163ba9c8 100644
--- a/gcc/gimple-predicate-analysis.cc
+++ b/gcc/gimple-predicate-analysis.cc
@@ -2216,11 +2216,11 @@ uninit_analysis::is_use_guarded (gimple *use_stmt,
basic_block use_bb,
return false;
use_preds.simplify (use_stmt, /*is_use=*/true);
+ use_preds.normalize (use_stmt, /*is_use=*/true);
if (use_preds.is_false ())
return true;
if (use_preds.is_true ())
return false;
- use_preds.normalize (use_stmt, /*is_use=*/true);
/* Try to prune the dead incoming phi edges. */
if (!overlap (phi, opnds, visited, use_preds))
@@ -2238,11 +2238,11 @@ uninit_analysis::is_use_guarded (gimple *use_stmt,
basic_block use_bb,
return false;
m_phi_def_preds.simplify (phi);
+ m_phi_def_preds.normalize (phi);
if (m_phi_def_preds.is_false ())
return false;
if (m_phi_def_preds.is_true ())
return true;
- m_phi_def_preds.normalize (phi);
}
/* Return true if the predicate guarding the valid definition (i.e.,
--
2.35.3