| /freebsd/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 | 1203 bool Instruction::isCommutative() const { in isCommutative() function in Instruction
1205 return II->isCommutative(); in isCommutative()
1207 return isCommutative(getOpcode()); in isCommutative()
|
| H A D | ConstantFold.cpp | 801 if (Instruction::isCommutative(Opcode)) in ConstantFoldBinaryInstruction()
951 if (Instruction::isCommutative(Opcode)) in ConstantFoldBinaryInstruction()
|
| H A D | Instructions.cpp | 2672 if (!isCommutative()) in swapOperands()
3480 bool CmpInst::isCommutative() const { in isCommutative() function in CmpInst
3482 return IC->isCommutative(); in isCommutative()
3483 return cast<FCmpInst>(this)->isCommutative(); in isCommutative()
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/Basic/ |
| H A D | CodeGenIntrinsics.cpp | 64 isCommutative = false; in CodeGenIntrinsic()
182 isCommutative = true; in setProperty()
|
| H A D | CodeGenIntrinsics.h | 68 bool isCommutative; member
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | Instruction.h | 710 bool isCommutative() const LLVM_READONLY;
711 static bool isCommutative(unsigned Opcode) {
|
| H A D | InlineAsm.h | 142 /// isCommutative - This is set to true for a constraint that is commutative
144 bool isCommutative = false;
143 bool isCommutative = false; global() member
|
| H A D | IntrinsicInst.h | 73 bool isCommutative() const { in isCommutative() function
|
| H A D | Instructions.h | 1226 bool isCommutative() const { return isEquality(); }
1353 bool isCommutative() const {
|
| /freebsd/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()
|
| /freebsd/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()
388 assert(I->isAssociative() && I->isCommutative() && in LinearizeExprTree()
2163 if (I->isCommutative()) in OptimizeInst()
|
| H A D | TailRecursionElimination.cpp | 369 if (!I->isAssociative() || !I->isCommutative()) in canTransformAccumulatorRecursion()
|
| H A D | NewGVN.cpp | 1082 if (Instruction::isCommutative(Opcode)) { in createBinaryExpression()
1155 if (I->isCommutative()) { in createExpression()
1284 if (CI->isCommutative()) { in createCallExpression()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanSLP.cpp | 166 return Instruction::isCommutative( in areCommutative()
|
| H A D | SLPVectorizer.cpp | 353 static bool isCommutative(Instruction *I) { in isCommutative() function
355 return Cmp->isCommutative(); in isCommutative()
357 return BO->isCommutative() || in isCommutative()
383 return I->isCommutative(); in isCommutative()
1664 unsigned FromIdx = isCommutative(I2) ? 0 : OpIdx1; in getScoreAtLevelRec()
1665 unsigned ToIdx = isCommutative(I2) in getScoreAtLevelRec()
2157 bool IsInverseOperation = !isCommutative(cast<Instruction>(VL[Lane])); in appendOperandsOfVL()
6138 if (CI->isCommutative()) in generateKeySubkey()
6837 bool IsCommutative = isCommutative(S.MainOp) || isCommutative( in buildTree_rec()
[all...] |
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonVectorLoopCarriedReuse.cpp | 438 if ((I && I->isCommutative()) || (C1 && isCallInstCommutative(C1))) { in findValueToReuse()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineNegator.cpp | 118 if (I->isCommutative() && InstCombiner::getComplexity(I->getOperand(0)) < in getSortedOperandsOfBinOp()
|
| H A D | InstructionCombining.cpp | 428 if (I.isCommutative() && getComplexity(I.getOperand(0)) < in SimplifyAssociativeOrCommutative()
432 if (I.isCommutative()) { in SimplifyAssociativeOrCommutative()
498 if (I.isAssociative() && I.isCommutative()) { in SimplifyAssociativeOrCommutative()
612 if (Instruction::isCommutative(ROp)) in rightDistributesOverLeft()
678 bool InnerCommutative = Instruction::isCommutative(InnerOpcode); in tryFactorization()
2100 if (Inst.isCommutative() && in foldVectorBinop()
2209 if (Inst.isAssociative() && Inst.isCommutative()) { in foldVectorBinop()
|
| H A D | InstCombinePHI.cpp | 1428 assert(BO->isCommutative() && "Must be commutative"); in foldDependentIVs()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | InterleavedLoadCombinePass.cpp | 913 if ((!C) && BO.isCommutative()) { in computePolynomialBinOp()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | IRSimilarityIdentifier.cpp | 840 if (IA->isCommutative() && !isa<FPMathOperator>(IA) && in compareStructure()
|
| H A D | IVDescriptors.cpp | 366 if (!Cur->isCommutative() && !IsAPhi && !isa<SelectInst>(Cur) && in AddReductionVar()
|
| H A D | InstructionSimplify.cpp | 256 (Instruction::isCommutative(OpcodeToExpand) && L == B1 && R == B0)) { in expandBinOp()
344 if (!Instruction::isCommutative(Opcode)) in simplifyAssociativeBinOp()
454 if (Simplified->isCommutative() && in threadBinOpOverSelect()
627 if (Instruction::isCommutative(Opcode)) in foldOrCommuteConstant()
|