diff options
| author | Jakub Jelinek <jakub@redhat.com> | 2020-11-27 11:38:31 +0100 |
|---|---|---|
| committer | Jakub Jelinek <jakub@redhat.com> | 2020-11-27 11:38:31 +0100 |
| commit | 83325a9db8348c3ba5e9c871d106ee1b76d40526 (patch) | |
| tree | d9cb52e1652545a0940f7fa917380bd0059e2734 /gcc/tree-scalar-evolution.c | |
| parent | bf0a63a1f47525d1c466dbb84616dcb72010affa (diff) | |
| download | gcc-83325a9db8348c3ba5e9c871d106ee1b76d40526.zip gcc-83325a9db8348c3ba5e9c871d106ee1b76d40526.tar.gz gcc-83325a9db8348c3ba5e9c871d106ee1b76d40526.tar.bz2 | |
tree-ssanames: Allow non-SSA_NAME arguments to get_range_info
My recent match.pd change required quite a lot of code due to the separate
need to handle INTEGER_CSTs and SSA_NAMEs, and after all, I didn't even
handle one case there, when in x * y / y the x is INTEGER_CST and y is
SSA_NAME.
The following patch allows to simplify it, by allowing non-SSA_NAME argument
to get_range_info, for INTEGER_CSTs it will return VR_RANGE with *min == *max
equal to the constnat, and for non-INTEGER_CST/SSA_NAMEs it will just return
VR_VARYING.
This allows not to simplify just the match.pd, but some other spots too.
2020-11-27 Jakub Jelinek <jakub@redhat.com>
* tree-ssanames.c (get_range_info): Handle INTEGER_CST by returning
VR_RANGE with both *min and *max set to the wide_int value of the
INTEGER_CST. Return VR_VARYING for non-SSA_NAMEs.
* match.pd ((t * 2) / 2) -> t): Handle also @0 being INTEGER_CST.
Simplify by calling get_range_info on everything.
* tree-ssa-strlen.c (maybe_diag_stxncpy_trunc): Simplify by calling
get_range_info on everything.
* tree-scalar-evolution.c (iv_can_overflow_p): Likewise.
Diffstat (limited to 'gcc/tree-scalar-evolution.c')
| -rw-r--r-- | gcc/tree-scalar-evolution.c | 18 |
1 files changed, 4 insertions, 14 deletions
diff --git a/gcc/tree-scalar-evolution.c b/gcc/tree-scalar-evolution.c index edab778..2c7923d 100644 --- a/gcc/tree-scalar-evolution.c +++ b/gcc/tree-scalar-evolution.c @@ -3043,22 +3043,12 @@ iv_can_overflow_p (class loop *loop, tree type, tree base, tree step) if (integer_zerop (step)) return false; - if (TREE_CODE (base) == INTEGER_CST) - base_min = base_max = wi::to_wide (base); - else if (TREE_CODE (base) == SSA_NAME - && INTEGRAL_TYPE_P (TREE_TYPE (base)) - && get_range_info (base, &base_min, &base_max) == VR_RANGE) - ; - else + if (!INTEGRAL_TYPE_P (TREE_TYPE (base)) + || get_range_info (base, &base_min, &base_max) != VR_RANGE) return true; - if (TREE_CODE (step) == INTEGER_CST) - step_min = step_max = wi::to_wide (step); - else if (TREE_CODE (step) == SSA_NAME - && INTEGRAL_TYPE_P (TREE_TYPE (step)) - && get_range_info (step, &step_min, &step_max) == VR_RANGE) - ; - else + if (!INTEGRAL_TYPE_P (TREE_TYPE (step)) + || get_range_info (step, &step_min, &step_max) != VR_RANGE) return true; if (!get_max_loop_iterations (loop, &nit)) |