| /freebsd/contrib/llvm-project/llvm/include/llvm/SandboxIR/ |
| H A D | IntrinsicInst.h | 27 bool isCommutative() const { in isCommutative() function
28 return cast<llvm::IntrinsicInst>(Val)->isCommutative(); in isCommutative()
|
| H A D | Instruction.h | 321 bool isCommutative() const { in isCommutative() function
322 return cast<llvm::Instruction>(Val)->isCommutative(); in isCommutative()
2520 WRAP_MEMBER(isCommutative);
2559 WRAP_MEMBER(isCommutative);
2593 WRAP_MEMBER(isCommutative);
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | InlineAsm.cpp | 95 isCommutative = false; in Parse()
137 isCommutative) // Reject %%%%% in Parse()
139 isCommutative = true; in Parse()
|
| H A D | Instruction.cpp | 1278 bool Instruction::isCommutative() const { in isCommutative() function in Instruction
1280 return II->isCommutative(); in isCommutative()
1282 return isCommutative(getOpcode()); in isCommutative()
|
| H A D | ConstantFold.cpp | 790 if (Instruction::isCommutative(Opcode)) in ConstantFoldBinaryInstruction()
927 if (Instruction::isCommutative(Opcode)) in ConstantFoldBinaryInstruction()
|
| H A D | Instructions.cpp | 2735 if (!isCommutative()) in swapOperands()
3533 bool CmpInst::isCommutative() const { in isCommutative() function in CmpInst
3535 return IC->isCommutative(); in isCommutative()
3536 return cast<FCmpInst>(this)->isCommutative(); in isCommutative()
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/Basic/ |
| H A D | CodeGenIntrinsics.h | 78 bool isCommutative = false; member
|
| H A D | CodeGenIntrinsics.cpp | 380 isCommutative = true; in setProperty()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | Operator.h | 128 bool isCommutative() const { return Instruction::isCommutative(getOpcode()); } in isCommutative() function
|
| H A D | Instruction.h | 763 LLVM_ABI bool isCommutative() const LLVM_READONLY;
764 static bool isCommutative(unsigned Opcode) {
|
| H A D | InlineAsm.h | 146 bool isCommutative = false; member
|
| H A D | Instructions.h | 1328 static bool isCommutative(Predicate P) { return isEquality(P); }
1332 bool isCommutative() const { return isCommutative(getPredicate()); }
1464 static bool isCommutative(Predicate Pred) {
1471 bool isCommutative() const { return isCommutative(getPredicate()); }
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/ |
| H A D | RISCVGatherScatterLowering.cpp | 149 if (!Splat && Instruction::isCommutative(BO->getOpcode())) { in matchStridedStart()
266 Instruction::isCommutative(BO->getOpcode())) { in matchStridedRecurrence()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | EarlyCSE.cpp | 239 if (BinOp->isCommutative() && BinOp->getOperand(0) > BinOp->getOperand(1)) in getHashValueImpl()
316 if (II && II->isCommutative() && II->arg_size() >= 2) { in getHashValueImpl()
375 if (!LHSBinOp->isCommutative()) in isEqualImpl()
399 LII->isCommutative() && LII->arg_size() >= 2) { in isEqualImpl()
|
| H A D | Reassociate.cpp | 238 assert(I->isCommutative() && "Expected commutative operator."); in canonicalizeOperands()
390 assert(I->isAssociative() && I->isCommutative() && in LinearizeExprTree()
2164 if (I->isCommutative()) in OptimizeInst()
|
| H A D | TailRecursionElimination.cpp | 379 if (!I->isAssociative() || !I->isCommutative()) in canTransformAccumulatorRecursion()
|
| H A D | NewGVN.cpp | 1119 if (Instruction::isCommutative(Opcode)) { in createBinaryExpression()
1192 if (I->isCommutative()) { in createExpression()
1321 if (CI->isCommutative()) { in createCallExpression()
|
| H A D | LICM.cpp | 2860 assert(BO->isCommutative() && BO0->isCommutative() && in hoistBOAssociation()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstructionCombining.cpp | 457 if (I.isCommutative() && getComplexity(I.getOperand(0)) < in SimplifyAssociativeOrCommutative()
461 if (I.isCommutative()) { in SimplifyAssociativeOrCommutative()
527 if (I.isAssociative() && I.isCommutative()) { in SimplifyAssociativeOrCommutative()
641 if (Instruction::isCommutative(ROp)) in rightDistributesOverLeft()
707 bool InnerCommutative = Instruction::isCommutative(InnerOpcode); in tryFactorization()
1761 !CI->isCommutative()) in FoldOpIntoSelect()
2005 assert(BO.isCommutative() && BO0->isCommutative() && BO1->isCommutative() && in foldBinopWithRecurrence()
2398 if (Inst.isCommutative() && in foldVectorBinop()
2451 if (Inst.isAssociative() && Inst.isCommutative()) { in foldVectorBinop()
|
| H A D | InstCombineNegator.cpp | 114 if (I->isCommutative() && InstCombiner::getComplexity(I->getOperand(0)) < in getSortedOperandsOfBinOp()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | IRNormalizer.cpp | 172 if (!(I->isCommutative() && Operands.size() >= 2)) in sortCommutativeOperands()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanSLP.cpp | 222 return Instruction::isCommutative( in areCommutative()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonVectorLoopCarriedReuse.cpp | 426 if ((I && I->isCommutative()) || (C1 && isCallInstCommutative(C1))) { in findValueToReuse()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | InterleavedLoadCombinePass.cpp | 912 if ((!C) && BO.isCommutative()) { in computePolynomialBinOp()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | IRSimilarityIdentifier.cpp | 834 if (IA->isCommutative() && !isa<FPMathOperator>(IA) && in compareStructure()
|