return false;
}
+/* Returns true if the expression T has no side effects
+ including not trapping. */
+static inline bool
+expr_no_side_effects_p (tree t)
+{
+ if (TREE_SIDE_EFFECTS (t))
+ return false;
+ if (generic_expr_could_trap_p (t))
+ return false;
+ return true;
+}
+
/* Return true if EXPR1 and EXPR2 have the same value, but not necessarily
same type. The types can differ through nop conversions. */
return !cfun || (cfun->curr_properties & PROP_gimple_lvec) == 0;
}
+/* Returns true if the expression T has no side effects
+ including not trapping. */
+static inline bool
+expr_no_side_effects_p (tree t)
+{
+ /* For gimple, there should only be gimple val's here. */
+ gcc_assert (is_gimple_val (t));
+ return true;
+}
+
/* Return true if pow(cst, x) should be optimized into exp(log(cst) * x).
As a workaround for SPEC CPU2017 628.pop2_s, don't do it if arg0
is an exact integer, arg1 = phi_res +/- cst1 and phi_res = PHI <cst2, ...>
(simplify
(cond (ne @0 integer_zerop) (op@2 @3 @1) integer_zerop )
(if (bitwise_equal_p (@0, @3)
- && tree_expr_nonzero_p (@1))
+ && tree_expr_nonzero_p (@1)
+ /* Cannot make a expression with side effects
+ unconditional. */
+ && expr_no_side_effects_p (@3))
@2)))
/* Note we prefer the != case here
(for op (mult bit_and)
(simplify
(cond (ne @0 integer_zerop) (op:c@2 @1 @3) integer_zerop)
- (if (bitwise_equal_p (@0, @3))
+ (if (bitwise_equal_p (@0, @3)
+ /* Cannot make a expression with side effects
+ unconditional. */
+ && expr_no_side_effects_p (@1))
@2)))
/* Simplifications of shift and rotates. */
--- /dev/null
+/* { dg-do run } */
+/* PR middle-end/116772 */
+/* The division by `/b` should not
+ be made uncondtional. */
+
+int mult0(int a,int b) __attribute__((noipa));
+
+int mult0(int a,int b){
+ return (b!=0 ? (a/b)*b : 0);
+}
+
+int bit_and0(int a,int b) __attribute__((noipa));
+
+int bit_and0(int a,int b){
+ return (b!=0 ? (a/b)&b : 0);
+}
+
+int main() {
+ if (mult0(3, 0) != 0)
+ __builtin_abort();
+ if (bit_and0(3, 0) != 0)
+ __builtin_abort();
+ return 0;
+}