diff options
author | Sanjay Patel <spatel@rotateright.com> | 2016-03-01 23:55:18 +0000 |
---|---|---|
committer | Sanjay Patel <spatel@rotateright.com> | 2016-03-01 23:55:18 +0000 |
commit | 147e9279570a5afa297f9b1a7f5ff0b26a05758d (patch) | |
tree | bc8153ff050c6bf9026fb5965ecfc48c23a55569 /llvm/lib/Transforms/InstCombine/InstCombineCasts.cpp | |
parent | 947648f5023cb23644cd0071bc958783f74994e4 (diff) | |
download | bcm5719-llvm-147e9279570a5afa297f9b1a7f5ff0b26a05758d.tar.gz bcm5719-llvm-147e9279570a5afa297f9b1a7f5ff0b26a05758d.zip |
[InstCombine] convert 'isPositive' and 'isNegative' vector comparisons to shifts (PR26701)
As noted in the code comment, I don't think we can do the same transform that we do for
*scalar* integers comparisons to *vector* integers comparisons because it might pessimize
the general case.
Exhibit A for an incomplete integer comparison ISA remains x86 SSE/AVX: it only has EQ and GT
for integer vectors.
But we should now recognize all the variants of this construct and produce the optimal code
for the cases shown in:
https://llvm.org/bugs/show_bug.cgi?id=26701
llvm-svn: 262424
Diffstat (limited to 'llvm/lib/Transforms/InstCombine/InstCombineCasts.cpp')
-rw-r--r-- | llvm/lib/Transforms/InstCombine/InstCombineCasts.cpp | 22 |
1 files changed, 17 insertions, 5 deletions
diff --git a/llvm/lib/Transforms/InstCombine/InstCombineCasts.cpp b/llvm/lib/Transforms/InstCombine/InstCombineCasts.cpp index 6d0e8821e8f..3cf38c33853 100644 --- a/llvm/lib/Transforms/InstCombine/InstCombineCasts.cpp +++ b/llvm/lib/Transforms/InstCombine/InstCombineCasts.cpp @@ -976,16 +976,28 @@ Instruction *InstCombiner::transformSExtICmp(ICmpInst *ICI, Instruction &CI) { // (x <s 0) ? -1 : 0 -> ashr x, 31 -> all ones if negative // (x >s -1) ? -1 : 0 -> not (ashr x, 31) -> all ones if positive if ((Pred == ICmpInst::ICMP_SLT && Op1C->isNullValue()) || - (Pred == ICmpInst::ICMP_SGT && Op1C->isAllOnesValue())) { + (Pred == ICmpInst::ICMP_SGT && Op1C->isAllOnesValue()) || + // The following patterns should only be present for vectors. + // For scalar integers, the comparison should be canonicalized to one of + // the above forms. We don't do that for vectors because vector ISAs may + // not have a full range of comparison operators. This transform, + // however, will simplify the IR, so we always do it. + // + // (x <=s -1) ? -1 : 0 -> ashr x, 31 -> all ones if negative + // (x >=s 0) ? -1 : 0 -> not (ashr x, 31) -> all ones if positive + (Pred == ICmpInst::ICMP_SLE && Op1C->isAllOnesValue()) || + (Pred == ICmpInst::ICMP_SGE && Op1C->isNullValue())) { Value *Sh = ConstantInt::get(Op0->getType(), - Op0->getType()->getScalarSizeInBits()-1); - Value *In = Builder->CreateAShr(Op0, Sh, Op0->getName()+".lobit"); + Op0->getType()->getScalarSizeInBits() - 1); + Value *In = Builder->CreateAShr(Op0, Sh, Op0->getName() + ".lobit"); if (In->getType() != CI.getType()) In = Builder->CreateIntCast(In, CI.getType(), true/*SExt*/); - if (Pred == ICmpInst::ICMP_SGT) - In = Builder->CreateNot(In, In->getName()+".not"); + // Invert the sign bit if the comparison was checking for 'is positive'. + if (Pred == ICmpInst::ICMP_SGT || Pred == ICmpInst::ICMP_SGE) + In = Builder->CreateNot(In, In->getName() + ".not"); + return replaceInstUsesWith(CI, In); } } |