| /freebsd-13.1/contrib/llvm-project/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 | Instruction.cpp | 758 bool Instruction::isCommutative() const { in isCommutative() function in Instruction
760 return II->isCommutative(); in isCommutative()
762 return isCommutative(getOpcode()); in isCommutative()
|
| H A D | Instructions.cpp | 2639 if (!isCommutative()) in swapOperands()
3674 bool CmpInst::isCommutative() const { in isCommutative() function in CmpInst
3676 return IC->isCommutative(); in isCommutative()
3677 return cast<FCmpInst>(this)->isCommutative(); in isCommutative()
|
| H A D | ConstantFold.cpp | 1119 if (Instruction::isCommutative(Opcode)) in ConstantFoldBinaryInstruction()
1258 if (Instruction::isCommutative(Opcode)) in ConstantFoldBinaryInstruction()
|
| /freebsd-13.1/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | CodeGenIntrinsics.h | 115 bool isCommutative; member
|
| H A D | CodeGenTarget.cpp | 666 isCommutative = false; in CodeGenIntrinsic()
859 isCommutative = true; in setProperty()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/RISCV/ |
| H A D | RISCVTargetTransformInfo.cpp | 75 if (Instruction::isCommutative(Opcode) || Idx == ImmArgIdx) { in getIntImmCostInst()
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | Instruction.h | 556 bool isCommutative() const LLVM_READONLY;
557 static bool isCommutative(unsigned Opcode) {
|
| H A D | InlineAsm.h | 141 bool isCommutative = false; member
|
| H A D | IntrinsicInst.h | 58 bool isCommutative() const { in isCommutative() function
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | EarlyCSE.cpp | 216 if (BinOp->isCommutative() && BinOp->getOperand(0) > BinOp->getOperand(1)) in getHashValueImpl()
296 if (II && II->isCommutative() && II->getNumArgOperands() == 2) { in getHashValueImpl()
341 if (!LHSBinOp->isCommutative()) in isEqualImpl()
366 LII->isCommutative() && LII->getNumArgOperands() == 2) { in isEqualImpl()
|
| H A D | Reassociate.cpp | 224 assert(I->isCommutative() && "Expected commutative operator."); in canonicalizeOperands()
460 assert(I->isAssociative() && I->isCommutative() && in LinearizeExprTree()
2193 if (I->isCommutative()) in OptimizeInst()
|
| H A D | TailRecursionElimination.cpp | 372 if (!I->isAssociative() || !I->isCommutative()) in canTransformAccumulatorRecursion()
|
| H A D | LoopRerollPass.cpp | 1401 if (!Swapped && BaseInst->isCommutative() && !SomeOpMatched && in validate()
|
| H A D | NewGVN.cpp | 1079 if (Instruction::isCommutative(Opcode)) { in createBinaryExpression()
1149 if (I->isCommutative()) { in createExpression()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanSLP.cpp | 174 return Instruction::isCommutative( in areCommutative()
|
| H A D | SLPVectorizer.cpp | 244 static bool isCommutative(Instruction *I) { in isCommutative() function
246 return Cmp->isCommutative(); in isCommutative()
248 return BO->isCommutative(); in isCommutative()
1146 unsigned FromIdx = isCommutative(I2) ? 0 : OpIdx1; in getScoreAtLevelRec()
1147 unsigned ToIdx = isCommutative(I2) in getScoreAtLevelRec()
1320 bool IsInverseOperation = !isCommutative(cast<Instruction>(VL[Lane])); in appendOperandsOfVL()
3098 if (cast<CmpInst>(VL0)->isCommutative()) { in buildTree_rec()
3147 if (isa<BinaryOperator>(VL0) && VL0->isCommutative()) { in buildTree_rec()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineNegator.cpp | 125 if (I->isCommutative() && InstCombiner::getComplexity(I->getOperand(0)) < in getSortedOperandsOfBinOp()
|
| H A D | InstructionCombining.cpp | 396 if (I.isCommutative() && getComplexity(I.getOperand(0)) < in SimplifyAssociativeOrCommutative()
458 if (I.isAssociative() && I.isCommutative()) { in SimplifyAssociativeOrCommutative()
571 if (Instruction::isCommutative(ROp)) in rightDistributesOverLeft()
628 bool InnerCommutative = Instruction::isCommutative(InnerOpcode); in tryFactorization()
1642 if (Inst.isCommutative() && in foldVectorBinop()
1749 if (Inst.isAssociative() && Inst.isCommutative()) { in foldVectorBinop()
|
| H A D | InstCombineSelect.cpp | 98 if (!BO->isCommutative() && !match(BO, m_BinOp(m_Value(Y), m_Specific(X)))) in foldSelectBinOpIdentity()
377 } else if (!TI->isCommutative()) { in foldSelectOpOp()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonVectorLoopCarriedReuse.cpp | 441 if ((I && I->isCommutative()) || (C1 && isCallInstCommutative(C1))) { in findValueToReuse()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | IRSimilarityIdentifier.cpp | 622 if (IA->isCommutative() && !isa<FPMathOperator>(IA)) { in compareStructure()
|
| H A D | IVDescriptors.cpp | 321 if (!Cur->isCommutative() && !IsAPhi && !isa<SelectInst>(Cur) && in AddReductionVar()
|
| H A D | InstructionSimplify.cpp | 261 (Instruction::isCommutative(OpcodeToExpand) && L == B1 && R == B0)) { in expandBinOp()
347 if (!Instruction::isCommutative(Opcode)) in SimplifyAssociativeBinOp()
454 if (Simplified->isCommutative() && in ThreadBinOpOverSelect()
610 if (Instruction::isCommutative(Opcode)) in foldOrCommuteConstant()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | InterleavedLoadCombinePass.cpp | 910 if ((!C) && BO.isCommutative()) { in computePolynomialBinOp()
|