Files
clang-p2996/llvm/lib/Transforms/InstCombine/InstCombineCompares.cpp
Jacob Young bb59eb8ed5 [InstCombine] fold unsigned predicates on srem result (#122520)
This allows optimization of more signed floor implementations when the
divisor is a known power of two to an arithmetic shift.

Proof for the implemented optimizations:
https://alive2.llvm.org/ce/z/j6C-Nz

Proof for the test cases:
https://alive2.llvm.org/ce/z/M_PBjw

---------

Co-authored-by: Jacob Young <jacobly0@users.noreply.github.com>
2025-01-18 14:05:31 -08:00

331 KiB