[clang] [llvm] [ConstantRange] Estimate tighter lower (upper) bounds for masked binary and (or) (PR #120352)
Stephen Senran Zhang via llvm-commits
llvm-commits at lists.llvm.org
Mon Dec 23 19:43:00 PST 2024
zsrkmyn wrote:
> > I'm thinking if I need to add a new test mode to test the optimal lower (upper) bound only for AND (OR).
>
> If you cannot make it optimal for all non-wrapped cases, please just add some special cases (e.g., `[7, 14) & [-1, 0) = [7, 14)`) before `TestBinaryOpExhaustive`.
Ah, I mean, the lower bound by this patch is optimal, but the upper isn't, so tests failed. :-D But adding special cases should work.
https://github.com/llvm/llvm-project/pull/120352
More information about the llvm-commits
mailing list