[PowerPC] Remaining KnownBits should be constant when performing non-sign comparison

[lkail]

Summary

In PPCTargetLowering::DAGCombineTruncBoolExt, when checking if it's correct to perform the transformation for non-sign comparison, as the comment says

// This is neither a signed nor an unsigned comparison, just make sure                                                                                                                  
// that the high bits are equal.

Origin check

if (Op1Known.Zero != Op2Known.Zero || Op1Known.One != Op2Known.One)
  return SDValue();

is not strong enough. For example,

Op1Known = 111x000x;
Op2Known = 111x000x;

Bit 4, besides bit 0, is still unknown and affects the final result.

This patch fixes https://bugs.llvm.org/show_bug.cgi?id=48388.

[nemanjai]

llvm/lib/Target/PowerPC/PPCISelLowering.cpp

13192

Hmm, but we've cleared bit zero from both known zero and known ones for both. So they will both be non-constant, won't they? I think that we would have to rewrite the above lines to something like this:

// We don't really care about what is known about the first bit (if
// anything), so pretend that it is known zero for both to ensure
// they can be compared as constants.
Op1Known.Zero.setBit(0); Op1Known.One.clearBit(0);
Op2Known.Zero.setBit(0); Op2Known.One.clearBit(0);

[lkail]

llvm/lib/Target/PowerPC/PPCISelLowering.cpp

13192

Good catch! This check is over kill, since we are requiring Op1[1..BitWidth) == Op2[1..BitWidth). I tend to extract bits in [1..BitWidth) from Op1 and Op2 and do same constant check as above.

[lkail]

@nemanjai 's solution can make code more compact. Thanks.

[nemanjai]

LGTM. Thanks.

llvm/lib/Target/PowerPC/PPCISelLowering.cpp

if (ISD::isSignedIntSetCC(CC)) {
       KnownBits Op1Known = DAG.computeKnownBits(N->getOperand(0));
       KnownBits Op2Known = DAG.computeKnownBits(N->getOperand(1));
 
       // We don't really care about what is known about the first bit (if
       // anything), so clear it in all masks prior to comparing them.
       Op1Known.Zero.clearBit(0); Op1Known.One.clearBit(0);
       Op2Known.Zero.clearBit(0); Op2Known.One.clearBit(0);
 
-      if (Op1Known.Zero != Op2Known.Zero || Op1Known.One != Op2Known.One)
+      if (!Op1Known.isConstant() || !Op2Known.isConstant() ||
+          Op1Known.getConstant() != Op2Known.getConstant())
         return SDValue();
     }
   }
 
   // We now know that the higher-order bits are irrelevant, we just need to
   // make sure that all of the intermediate operations are bit operations, and
   // all inputs are extensions.
   if (N->getOperand(0).getOpcode() != ISD::AND &&

llvm/test/CodeGen/PowerPC/pr48388.ll

+; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py
+; RUN: llc -verify-machineinstrs -mtriple=powerpc64le -ppc-asm-full-reg-names \
+; RUN:   < %s | FileCheck %s
+
+define i64 @julia_div_i64(i64 %0, i64 %1) local_unnamed_addr #0 {
+; CHECK-LABEL: julia_div_i64:
+; CHECK:       # %bb.0: # %entry
+; CHECK-NEXT:    divd r6, r3, r4
+; CHECK-NEXT:    li r5, 32767
+; CHECK-NEXT:    sldi r5, r5, 32
+; CHECK-NEXT:    oris r7, r5, 40069
+; CHECK-NEXT:    oris r5, r5, 40079
+; CHECK-NEXT:    cmpdi r3, 0
+; CHECK-NEXT:    ori r7, r7, 13456
+; CHECK-NEXT:    ori r5, r5, 65264
+; CHECK-NEXT:    iselgt r9, r5, r7
+; CHECK-NEXT:    cmpdi r4, 0
+; CHECK-NEXT:    mulld r8, r6, r4
+; CHECK-NEXT:    iselgt r4, r5, r7
+; CHECK-NEXT:    xor r4, r9, r4
+; CHECK-NEXT:    cntlzd r4, r4
+; CHECK-NEXT:    rldicl r4, r4, 58, 63
+; CHECK-NEXT:    xor r3, r8, r3
+; CHECK-NEXT:    addic r5, r3, -1
+; CHECK-NEXT:    subfe r3, r5, r3
+; CHECK-NEXT:    and r3, r4, r3
+; CHECK-NEXT:    add r3, r6, r3
+; CHECK-NEXT:    blr
+entry:
+  %2 = sdiv i64 %0, %1
+  %3 = icmp sgt i64 %0, 0
+  %4 = icmp sgt i64 %1, 0
+  %5 = select i1 %3, i64 140735820070640, i64 140735819363472
+  %6 = select i1 %4, i64 140735820070640, i64 140735819363472
+  %7 = icmp eq i64 %5, %6
+  %8 = mul i64 %2, %1
+  %9 = icmp ne i64 %8, %0
+  %10 = and i1 %7, %9
+  %11 = zext i1 %10 to i64
+  %12 = add i64 %2, %11
+  ret i64 %12
+}