diff options
author | Vladislav Ivanishin <vlad@ispras.ru> | 2019-05-15 12:40:04 +0000 |
---|---|---|
committer | Alexander Monakov <amonakov@gcc.gnu.org> | 2019-05-15 15:40:04 +0300 |
commit | fb4b60c68edf7196770fdc65b3862662bc2d647b (patch) | |
tree | d8249b8d4e7703e16dc8b9f50cec875c1b087259 | |
parent | 6b94351209e4f044abdea22e8a8eb529abe0109b (diff) |
tree-ssa-uninit: clean up is_value_included_in
2019-05-15 Vladislav Ivanishin <vlad@ispras.ru>
* tree-ssa-uninit.c (is_value_included_in): Remove is_unsigned and merge
semantically equivalent branches (left over after prior refactorings).
From-SVN: r271207
-rw-r--r-- | gcc/ChangeLog | 5 | ||||
-rw-r--r-- | gcc/tree-ssa-uninit.c | 31 |
2 files changed, 11 insertions, 25 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index b531a2950ef..fe85101e435 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,8 @@ +2019-05-15 Vladislav Ivanishin <vlad@ispras.ru> + + * tree-ssa-uninit.c (is_value_included_in): Remove is_unsigned and merge + semantically equivalent branches (left over after prior refactorings). + 2019-05-15 Richard Biener <rguenther@suse.de> PR tree-optimization/88828 diff --git a/gcc/tree-ssa-uninit.c b/gcc/tree-ssa-uninit.c index 831587854c6..7362e374dea 100644 --- a/gcc/tree-ssa-uninit.c +++ b/gcc/tree-ssa-uninit.c @@ -1017,45 +1017,26 @@ static bool is_value_included_in (tree val, tree boundary, enum tree_code cmpc) { bool inverted = false; - bool is_unsigned; bool result; /* Only handle integer constant here. */ if (TREE_CODE (val) != INTEGER_CST || TREE_CODE (boundary) != INTEGER_CST) return true; - is_unsigned = TYPE_UNSIGNED (TREE_TYPE (val)); - if (cmpc == GE_EXPR || cmpc == GT_EXPR || cmpc == NE_EXPR) { cmpc = invert_tree_comparison (cmpc, false); inverted = true; } - if (is_unsigned) - { - if (cmpc == EQ_EXPR) - result = tree_int_cst_equal (val, boundary); - else if (cmpc == LT_EXPR) - result = tree_int_cst_lt (val, boundary); - else - { - gcc_assert (cmpc == LE_EXPR); - result = tree_int_cst_le (val, boundary); - } - } + if (cmpc == EQ_EXPR) + result = tree_int_cst_equal (val, boundary); + else if (cmpc == LT_EXPR) + result = tree_int_cst_lt (val, boundary); else { - if (cmpc == EQ_EXPR) - result = tree_int_cst_equal (val, boundary); - else if (cmpc == LT_EXPR) - result = tree_int_cst_lt (val, boundary); - else - { - gcc_assert (cmpc == LE_EXPR); - result = (tree_int_cst_equal (val, boundary) - || tree_int_cst_lt (val, boundary)); - } + gcc_assert (cmpc == LE_EXPR); + result = tree_int_cst_le (val, boundary); } if (inverted) |