diff options
| author | Aldy Hernandez <aldyh@redhat.com> | 2022-11-22 10:24:06 +0100 |
|---|---|---|
| committer | Aldy Hernandez <aldyh@redhat.com> | 2022-11-24 07:38:27 +0100 |
| commit | 42639a36bf2983d4a5adb02f3ab7e8c4bd1023c7 (patch) | |
| tree | 6af45986512fe1e4e2a34df14712b966656981b1 /gcc/tree-ssa-threadedge.cc | |
| parent | a3f7deefd45a018ffc56ad3fb944a9f715b50901 (diff) | |
| download | gcc-42639a36bf2983d4a5adb02f3ab7e8c4bd1023c7.zip gcc-42639a36bf2983d4a5adb02f3ab7e8c4bd1023c7.tar.gz gcc-42639a36bf2983d4a5adb02f3ab7e8c4bd1023c7.tar.bz2 | |
Remove ASSERT_EXPR.
This removes all uses of ASSERT_EXPR except the internal one in ipa-*.
gcc/ChangeLog:
* doc/gimple.texi: Remove ASSERT_EXPR references.
* fold-const.cc (tree_expr_nonzero_warnv_p): Same.
(fold_binary_loc): Same.
(tree_expr_nonnegative_warnv_p): Same.
* gimple-array-bounds.cc (get_base_decl): Same.
* gimple-pretty-print.cc (dump_unary_rhs): Same.
* gimple.cc (get_gimple_rhs_num_ops): Same.
* pointer-query.cc (handle_ssa_name): Same.
* tree-cfg.cc (verify_gimple_assign_single): Same.
* tree-pretty-print.cc (dump_generic_node): Same.
* tree-scalar-evolution.cc (scev_dfs::follow_ssa_edge_expr):Same.
(interpret_rhs_expr): Same.
* tree-ssa-operands.cc (operands_scanner::get_expr_operands): Same.
* tree-ssa-propagate.cc
(substitute_and_fold_dom_walker::before_dom_children): Same.
* tree-ssa-threadedge.cc: Same.
* tree-vrp.cc (overflow_comparison_p): Same.
* tree.def (ASSERT_EXPR): Add note.
* tree.h (ASSERT_EXPR_VAR): Remove.
(ASSERT_EXPR_COND): Remove.
* vr-values.cc (simplify_using_ranges::vrp_visit_cond_stmt):
Remove comment.
Diffstat (limited to 'gcc/tree-ssa-threadedge.cc')
| -rw-r--r-- | gcc/tree-ssa-threadedge.cc | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/gcc/tree-ssa-threadedge.cc b/gcc/tree-ssa-threadedge.cc index 905a98c..cc7020d 100644 --- a/gcc/tree-ssa-threadedge.cc +++ b/gcc/tree-ssa-threadedge.cc @@ -497,9 +497,9 @@ jump_threader::simplify_control_stmt_condition_1 } /* If the condition has the form (A & B) CMP 0 or (A | B) CMP 0 then - recurse into the LHS to see if there is a dominating ASSERT_EXPR - of A or of B that makes this condition always true or always false - along the edge E. */ + recurse into the LHS to see if there is a simplification that + makes this condition always true or always false along the edge + E. */ if ((cond_code == EQ_EXPR || cond_code == NE_EXPR) && TREE_CODE (op0) == SSA_NAME && integer_zerop (op1)) |