735   assert(ICI.isEquality() && "Cannot fold non-equality comparison.");  in FoldAllocaCmp()
874   if (!ICI.isEquality() && DivIsSigned != ICI.isSigned())  in FoldICmpDivCst()
1028   if (!ICI.isEquality()) {  in FoldICmpShrCst()
1107   assert(I.isEquality() && "Cannot fold icmp gt/lt");  in FoldICmpCstShrCst()
1171   assert(I.isEquality() && "Cannot fold icmp gt/lt");  in FoldICmpCstShlCst()
1228     if (ICI.isEquality() && LHSI->hasOneUse()) {  in visitICmpInstWithInstAndIntCst()
1279         if (!ICI.isEquality() && XorCst->getValue().isSignBit()) {  in visitICmpInstWithInstAndIntCst()
1289         if (!ICI.isEquality() && XorCst->isMaxValue(true)) {  in visitICmpInstWithInstAndIntCst()
1326         if (ICI.isEquality() ||  in visitICmpInstWithInstAndIntCst()
1343         if (ICI.isEquality() && RHSV.getActiveBits() <= Ty->getBitWidth()) {  in visitICmpInstWithInstAndIntCst()
1437           ICI.isEquality() && !Shift->isArithmeticShift() &&  in visitICmpInstWithInstAndIntCst()
1525     if (ICI.isEquality() && RHS == LHSI->getOperand(1) && (-RHSV).isPowerOf2())  in visitICmpInstWithInstAndIntCst()
1533     if (ICI.isEquality() && LHSI->hasOneUse() && match(RHS, m_Zero())) {  in visitICmpInstWithInstAndIntCst()
1559     if (!ICI.isEquality() || !RHS->isNullValue() || !LHSI->hasOneUse())  in visitICmpInstWithInstAndIntCst()
1653         } else if (ICI.isEquality()) {  in visitICmpInstWithInstAndIntCst()
1668     if (ICI.isEquality()) {  in visitICmpInstWithInstAndIntCst()
1760     if (ICI.isEquality() && BO->isExact() && BO->hasOneUse()) {  in visitICmpInstWithInstAndIntCst()
1807     if (!ICI.isEquality()) {  in visitICmpInstWithInstAndIntCst()
1855   if (ICI.isEquality()) {  in visitICmpInstWithInstAndIntCst()
2068     if (ICI.isEquality())  in visitICmpInstWithCastAndCast()
2094     if (ICI.isEquality())  in visitICmpInstWithCastAndCast()
2860       if (I.isEquality() && CI->isZero() &&  in visitICmpInst()
2909     if (I.isEquality()) {  in visitICmpInst()
3289   if (Op0->getType()->isPointerTy() && I.isEquality()) {  in visitICmpInst()
3346       NoOp0WrapProblem = ICmpInst::isEquality(Pred) ||  in visitICmpInst()
3350       NoOp1WrapProblem = ICmpInst::isEquality(Pred) ||  in visitICmpInst()
3550         if (I.isEquality())    // a+x icmp eq/ne b+x --> a icmp b  in visitICmpInst()
3574         if (!I.isEquality())  in visitICmpInst()
3635         isKnownToBeAPowerOfTwo(A, DL, false, 0, AC, &I, DT) && I.isEquality())  in visitICmpInst()
3673   if (I.isEquality()) {  in visitICmpInst()
3853   if (I.isEquality()) {  in FoldFCmp_IntToFP_Cst()