| /freebsd-14.2/contrib/llvm-project/llvm/lib/IR/ |
| H A D | InlineAsm.cpp | 94 isCommutative = false; in Parse()
136 isCommutative) // Reject %%%%% in Parse()
138 isCommutative = true; in Parse()
|
| H A D | Instruction.cpp | 1111 bool Instruction::isCommutative() const { in isCommutative() function in Instruction
1113 return II->isCommutative(); in isCommutative()
1115 return isCommutative(getOpcode()); in isCommutative()
|
| H A D | ConstantFold.cpp | 884 if (Instruction::isCommutative(Opcode)) in ConstantFoldBinaryInstruction()
1034 if (Instruction::isCommutative(Opcode)) in ConstantFoldBinaryInstruction()
|
| H A D | Instructions.cpp | 3027 if (!isCommutative()) in swapOperands()
4041 bool CmpInst::isCommutative() const { in isCommutative() function in CmpInst
4043 return IC->isCommutative(); in isCommutative()
4044 return cast<FCmpInst>(this)->isCommutative(); in isCommutative()
|
| /freebsd-14.2/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | CodeGenIntrinsics.cpp | 64 isCommutative = false; in CodeGenIntrinsic()
182 isCommutative = true; in setProperty()
|
| H A D | CodeGenIntrinsics.h | 67 bool isCommutative; member
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | Instruction.h | 675 bool isCommutative() const LLVM_READONLY;
676 static bool isCommutative(unsigned Opcode) {
|
| H A D | InlineAsm.h | 144 bool isCommutative = false; member
|
| H A D | IntrinsicInst.h | 72 bool isCommutative() const { in isCommutative() function
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/RISCV/ |
| H A D | RISCVGatherScatterLowering.cpp | 151 if (!Splat && Instruction::isCommutative(BO->getOpcode())) { in matchStridedStart()
272 Instruction::isCommutative(BO->getOpcode())) { in matchStridedRecurrence()
|
| H A D | RISCVTargetTransformInfo.cpp | 212 if (Instruction::isCommutative(Opcode) || Idx == ImmArgIdx) { in getIntImmCostInst()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | EarlyCSE.cpp | 241 if (BinOp->isCommutative() && BinOp->getOperand(0) > BinOp->getOperand(1)) in getHashValueImpl()
318 if (II && II->isCommutative() && II->arg_size() >= 2) { in getHashValueImpl()
378 if (!LHSBinOp->isCommutative()) in isEqualImpl()
402 LII->isCommutative() && LII->arg_size() >= 2) { in isEqualImpl()
|
| H A D | Reassociate.cpp | 238 assert(I->isCommutative() && "Expected commutative operator."); in canonicalizeOperands()
476 assert(I->isAssociative() && I->isCommutative() && in LinearizeExprTree()
2246 if (I->isCommutative()) in OptimizeInst()
|
| H A D | TailRecursionElimination.cpp | 369 if (!I->isAssociative() || !I->isCommutative()) in canTransformAccumulatorRecursion()
|
| H A D | NewGVN.cpp | 1078 if (Instruction::isCommutative(Opcode)) { in createBinaryExpression()
1151 if (I->isCommutative()) { in createExpression()
1280 if (CI->isCommutative()) { in createCallExpression()
|
| H A D | LoopRerollPass.cpp | 1364 if (!Swapped && BaseInst->isCommutative() && !SomeOpMatched && in validate()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanSLP.cpp | 166 return Instruction::isCommutative( in areCommutative()
|
| H A D | SLPVectorizer.cpp | 289 static bool isCommutative(Instruction *I) { in isCommutative() function
291 return Cmp->isCommutative(); in isCommutative()
293 return BO->isCommutative(); in isCommutative()
1467 unsigned FromIdx = isCommutative(I2) ? 0 : OpIdx1; in getScoreAtLevelRec()
1468 unsigned ToIdx = isCommutative(I2) in getScoreAtLevelRec()
1934 bool IsInverseOperation = !isCommutative(cast<Instruction>(VL[Lane])); in appendOperandsOfVL()
5190 if (CI->isCommutative()) in generateKeySubkey()
5683 bool IsCommutative = isCommutative(S.MainOp) || isCommutative(S.AltOp); in buildTree_rec()
6079 if (cast<CmpInst>(VL0)->isCommutative()) { in buildTree_rec()
6129 if (isa<BinaryOperator>(VL0) && VL0->isCommutative()) { in buildTree_rec()
[all …]
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstructionCombining.cpp | 410 if (I.isCommutative() && getComplexity(I.getOperand(0)) < in SimplifyAssociativeOrCommutative()
414 if (I.isCommutative()) { in SimplifyAssociativeOrCommutative()
480 if (I.isAssociative() && I.isCommutative()) { in SimplifyAssociativeOrCommutative()
594 if (Instruction::isCommutative(ROp)) in rightDistributesOverLeft()
658 bool InnerCommutative = Instruction::isCommutative(InnerOpcode); in tryFactorization()
1893 if (Inst.isCommutative() && in foldVectorBinop()
2002 if (Inst.isAssociative() && Inst.isCommutative()) { in foldVectorBinop()
|
| H A D | InstCombineNegator.cpp | 118 if (I->isCommutative() && InstCombiner::getComplexity(I->getOperand(0)) < in getSortedOperandsOfBinOp()
|
| H A D | InstCombineSimplifyDemanded.cpp | 1848 if (BO->isCommutative() in SimplifyDemandedVectorElts()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonVectorLoopCarriedReuse.cpp | 438 if ((I && I->isCommutative()) || (C1 && isCallInstCommutative(C1))) { in findValueToReuse()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | InterleavedLoadCombinePass.cpp | 913 if ((!C) && BO.isCommutative()) { in computePolynomialBinOp()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | IVDescriptors.cpp | 366 if (!Cur->isCommutative() && !IsAPhi && !isa<SelectInst>(Cur) && in AddReductionVar()
|
| H A D | IRSimilarityIdentifier.cpp | 840 if (IA->isCommutative() && !isa<FPMathOperator>(IA) && in compareStructure()
|