[gcc r15-3865] Speed up get_bitmask_from_range

[Richard Biener via Gcc-cvs]

https://gcc.gnu.org/g:0e095df4b4c61bc57413cf3cbca56ff1a038de40

commit r15-3865-g0e095df4b4c61bc57413cf3cbca56ff1a038de40
Author: Richard Biener <rguent...@suse.de>
Date:   Wed Sep 25 13:37:59 2024 +0200

    Speed up get_bitmask_from_range
    
    When min != max we know min ^ max != 0.
    
            * value-range.cc (get_bitmask_from_range): Remove redundant
            compare of xorv with zero.

Diff:
---
 gcc/value-range.cc | 5 +----
 1 file changed, 1 insertion(+), 4 deletions(-)

diff --git a/gcc/value-range.cc b/gcc/value-range.cc
index 9c3eb78459dd..3046232bbca2 100644
--- a/gcc/value-range.cc
+++ b/gcc/value-range.cc
@@ -48,10 +48,7 @@ get_bitmask_from_range (tree type,
     }
 
   wide_int xorv = min ^ max;
-
-  if (xorv != 0)
-    xorv = wi::mask (prec - wi::clz (xorv), false, prec);
-
+  xorv = wi::mask (prec - wi::clz (xorv), false, prec);
   return irange_bitmask (wi::zero (prec), min | xorv);
 }