Searched refs:negate_expr_p (Results 1 – 6 of 6) sorted by relevance
93 static bool negate_expr_p (tree);1058 negate_expr_p (tree t) in negate_expr_p() function1139 return negate_expr_p (tem); in negate_expr_p()1258 if (negate_expr_p (tem)) in fold_negate_expr()1262 if (negate_expr_p (tem)) in fold_negate_expr()1283 if (negate_expr_p (tem)) in fold_negate_expr()1293 if (negate_expr_p (tem)) in fold_negate_expr()8971 && negate_expr_p (arg1) in fold_binary()9051 if (negate_expr_p (arg1) in fold_binary()10086 && negate_expr_p (arg1)) in fold_binary()[all …]
1217 * fold-const.c (negate_expr_p): Use TYPE_OVERFLOW_UNDEFINED.1232 * fold-const.c (negate_expr_p): Use TYPE_OVERFLOW_WRAPS.
5815 (negate_expr_p): We can always negate integer constants unless5830 to negate_expr_p/negate_expr.11179 * fold-const.c (negate_expr_p): MULT_EXPRs and RDIV_EXPRs are easy11858 * fold-const.c (negate_expr_p <MINUS_EXPR>): Change to match the32528 * fold-const.c (negate_expr_p): New function to determine whether
4287 * fold-const.c (negate_expr_p): Do not introduce undefined4598 * fold-const.c (negate_expr_p): We can negate BIT_NOT_EXPR
17144 (negate_expr_p): ... this function.38569 * fold-const.c (negate_expr_p) <RSHIFT_EXPR>: We can optimize42701 * fold-const.c (negate_expr_p, negate_expr): Optimize -(A+B) into
3201 * fold-const.c (negate_expr_p): Return true for BIT_NOT_EXPR.3335 * fold-const.c (negate_expr_p): Add case for signed divides if overflow