| /freebsd-12.1/contrib/llvm/lib/IR/ |
| H A D | InlineAsm.cpp | 80 isCommutative = false; in Parse()
119 isCommutative) // Reject %%%%% in Parse()
121 isCommutative = true; in Parse()
|
| H A D | Instructions.cpp | 2253 if (!isCommutative()) in swapOperands()
3352 bool CmpInst::isCommutative() const { in isCommutative() function in CmpInst
3354 return IC->isCommutative(); in isCommutative()
3355 return cast<FCmpInst>(this)->isCommutative(); in isCommutative()
|
| H A D | ConstantFold.cpp | 1128 if (Instruction::isCommutative(Opcode)) in ConstantFoldBinaryInstruction()
1254 if (Instruction::isCommutative(Opcode)) in ConstantFoldBinaryInstruction()
|
| H A D | Constants.cpp | 2331 if (Instruction::isCommutative(Opcode)) { in getBinOpIdentity()
|
| /freebsd-12.1/contrib/llvm/include/llvm/IR/ |
| H A D | Instruction.h | 478 bool isCommutative() const { return isCommutative(getOpcode()); }
479 static bool isCommutative(unsigned Opcode) {
|
| H A D | InlineAsm.h | 139 bool isCommutative = false; member
|
| H A D | InstrTypes.h | 808 bool isCommutative() const;
|
| H A D | Instructions.h | 1291 bool isCommutative() const { return isEquality(); }
1401 bool isCommutative() const {
|
| /freebsd-12.1/contrib/llvm/utils/TableGen/ |
| H A D | CodeGenIntrinsics.h | 116 bool isCommutative; member
|
| H A D | CodeGenTarget.cpp | 536 isCommutative = false; in CodeGenIntrinsic()
677 isCommutative = true; in CodeGenIntrinsic()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | SpeculateAroundPHIs.cpp | 265 if (UserI->isBinaryOp() && UserI->isCommutative() && Idx != 1) in isSafeAndProfitableToSpeculateAroundPHI()
677 if (NewI->isBinaryOp() && NewI->isCommutative() && in speculatePHIs()
|
| H A D | Reassociate.cpp | 223 assert(I->isCommutative() && "Expected commutative operator."); in canonicalizeOperands()
453 assert(I->isAssociative() && I->isCommutative() && in LinearizeExprTree()
1956 if (!User->isCommutative() && User->getOperand(1) != I) in canonicalizeNegConstExpr()
1972 if (User->getOperand(0) == I && User->isCommutative()) in canonicalizeNegConstExpr()
2027 if (I->isCommutative()) in OptimizeInst()
|
| H A D | EarlyCSE.cpp | 135 if (BinOp->isCommutative() && BinOp->getOperand(0) > BinOp->getOperand(1)) in getHashValue()
207 if (!LHSBinOp->isCommutative()) in isEqual()
|
| H A D | TailRecursionElimination.cpp | 424 if (!I->isAssociative() || !I->isCommutative()) return nullptr; in canTransformAccumulatorRecursion()
|
| H A D | LoopRerollPass.cpp | 1368 if (!Swapped && BaseInst->isCommutative() && !SomeOpMatched && in validate()
|
| H A D | NewGVN.cpp | 1044 if (Instruction::isCommutative(Opcode)) { in createBinaryExpression()
1127 if (I->isCommutative()) { in createExpression()
|
| H A D | GVN.cpp | 278 if (I->isCommutative()) { in createExpr()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanSLP.cpp | 172 return Instruction::isCommutative( in areCommutative()
|
| H A D | SLPVectorizer.cpp | 1764 if (isa<BinaryOperator>(VL0) && VL0->isCommutative()) { in buildTree_rec()
2670 if (VL1->isCommutative() && isConsecutiveAccess(L, L1, *DL, *SE)) { in reorderAltShuffleOperands()
2673 } else if (VL2->isCommutative() && in reorderAltShuffleOperands()
2685 if (VL1->isCommutative() && isConsecutiveAccess(L, L1, *DL, *SE)) { in reorderAltShuffleOperands()
2688 } else if (VL2->isCommutative() && in reorderAltShuffleOperands()
2792 assert(((I->getOpcode() == Opcode && I->isCommutative()) || in reorderInputsAccordingToOpcode()
2793 (I->getOpcode() != Opcode && Instruction::isCommutative(Opcode))) && in reorderInputsAccordingToOpcode()
3285 if (isa<BinaryOperator>(VL0) && VL0->isCommutative()) in vectorizeTree()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/InstCombine/ |
| H A D | InstructionCombining.cpp | 309 if (I.isCommutative() && getComplexity(I.getOperand(0)) < in SimplifyAssociativeOrCommutative()
367 if (I.isAssociative() && I.isCommutative()) { in SimplifyAssociativeOrCommutative()
472 if (Instruction::isCommutative(ROp)) in rightDistributesOverLeft()
528 bool InnerCommutative = Instruction::isCommutative(InnerOpcode); in tryFactorization()
|
| H A D | InstCombineSelect.cpp | 96 if (!BO->isCommutative() && !match(BO, m_BinOp(m_Value(Y), m_Specific(X)))) in foldSelectBinOpIdentity()
358 } else if (!TI->isCommutative()) { in foldSelectOpOp()
|
| /freebsd-12.1/contrib/llvm/lib/CodeGen/ |
| H A D | InterleavedLoadCombinePass.cpp | 909 if ((!C) && BO.isCommutative()) { in computePolynomialBinOp()
|
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | IVDescriptors.cpp | 288 if (!Cur->isCommutative() && !IsAPhi && !isa<SelectInst>(Cur) && in AddReductionVar()
|
| H A D | InstructionSimplify.cpp | 184 if ((L == A && R == B) || (Instruction::isCommutative(OpcodeToExpand) in ExpandBinOp()
207 if ((L == B && R == C) || (Instruction::isCommutative(OpcodeToExpand) in ExpandBinOp()
277 if (!Instruction::isCommutative(Opcode)) in SimplifyAssociativeBinOp()
384 if (Simplified->isCommutative() && in ThreadBinOpOverSelect()
564 if (Instruction::isCommutative(Opcode)) in foldOrCommuteConstant()
|
| /freebsd-12.1/contrib/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | FastISel.cpp | 608 if (isa<Instruction>(I) && cast<Instruction>(I)->isCommutative()) { in selectBinaryOp()
|