https://gcc.gnu.org/bugzilla/show_bug.cgi?id=114725
--- Comment #4 from GCC Commits <cvs-commit at gcc dot gnu.org> --- The master branch has been updated by Andrew Macleod <[email protected]>: https://gcc.gnu.org/g:8b9cd6490ce507a8e3612044137bd2024e8658c4 commit r16-4604-g8b9cd6490ce507a8e3612044137bd2024e8658c4 Author: Andrew MacLeod <[email protected]> Date: Thu Oct 23 17:19:02 2025 -0400 Split signed bitwise AND operations. The algorithm for bitwise AND struggles with complex signed operations which cross the signed/unsigned barrier. When this happens, process it as 2 seperate ranges [LB, -1] and [0, UB], and combine the results. PR tree-optimization/114725.c gcc/ * range-op.cc (operator_bitwise_and::wi_fold): Split signed operations crossing zero into 2 operations. gcc/testsuite/ * gcc.dg/pr114725.c: New.
