| /openbsd-src/gnu/llvm/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 | 816 bool Instruction::isCommutative() const { in isCommutative() function in Instruction
818 return II->isCommutative(); in isCommutative()
820 return isCommutative(getOpcode()); in isCommutative()
|
| H A D | Instructions.cpp | 3025 if (!isCommutative()) in swapOperands()
4062 bool CmpInst::isCommutative() const { in isCommutative() function in CmpInst
4064 return IC->isCommutative(); in isCommutative()
4065 return cast<FCmpInst>(this)->isCommutative(); in isCommutative()
|
| H A D | ConstantFold.cpp | 1124 if (Instruction::isCommutative(Opcode)) in ConstantFoldBinaryInstruction()
1272 if (Instruction::isCommutative(Opcode)) in ConstantFoldBinaryInstruction()
|
| /openbsd-src/gnu/llvm/llvm/utils/TableGen/ |
| H A D | CodeGenIntrinsics.h | 73 bool isCommutative; member
|
| H A D | CodeGenTarget.cpp | 679 isCommutative = false; in CodeGenIntrinsic()
870 isCommutative = true; in setProperty()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/IR/ |
| H A D | Instruction.h | 578 bool isCommutative() const LLVM_READONLY;
579 static bool isCommutative(unsigned Opcode) {
|
| H A D | InlineAsm.h | 143 bool isCommutative = false; member
|
| H A D | IntrinsicInst.h | 60 bool isCommutative() const { in isCommutative() function
|
| H A D | InstrTypes.h | 939 bool isCommutative() const;
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/ |
| H A D | EarlyCSE.cpp | 227 if (BinOp->isCommutative() && BinOp->getOperand(0) > BinOp->getOperand(1)) in getHashValueImpl()
307 if (II && II->isCommutative() && II->arg_size() == 2) { in getHashValueImpl()
352 if (!LHSBinOp->isCommutative()) in isEqualImpl()
377 LII->isCommutative() && LII->arg_size() == 2) { in isEqualImpl()
|
| H A D | Reassociate.cpp | 231 assert(I->isCommutative() && "Expected commutative operator."); in canonicalizeOperands()
468 assert(I->isAssociative() && I->isCommutative() && in LinearizeExprTree()
2209 if (I->isCommutative()) in OptimizeInst()
|
| H A D | TailRecursionElimination.cpp | 369 if (!I->isAssociative() || !I->isCommutative()) in canTransformAccumulatorRecursion()
|
| H A D | LoopRerollPass.cpp | 1394 if (!Swapped && BaseInst->isCommutative() && !SomeOpMatched && in validate()
|
| H A D | NewGVN.cpp | 1081 if (Instruction::isCommutative(Opcode)) { in createBinaryExpression()
1154 if (I->isCommutative()) { in createExpression()
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanSLP.cpp | 166 return Instruction::isCommutative( in areCommutative()
|
| H A D | SLPVectorizer.cpp | 276 static bool isCommutative(Instruction *I) { in isCommutative() function
278 return Cmp->isCommutative(); in isCommutative()
280 return BO->isCommutative(); in isCommutative()
1452 unsigned FromIdx = isCommutative(I2) ? 0 : OpIdx1; in getScoreAtLevelRec()
1453 unsigned ToIdx = isCommutative(I2) in getScoreAtLevelRec()
1918 bool IsInverseOperation = !isCommutative(cast<Instruction>(VL[Lane])); in appendOperandsOfVL()
4935 if (CI->isCommutative()) in generateKeySubkey()
5092 bool IsCommutative = isCommutative(S.MainOp) || isCommutative(S.AltOp); in buildTree_rec()
5544 if (cast<CmpInst>(VL0)->isCommutative()) { in buildTree_rec()
5593 if (isa<BinaryOperator>(VL0) && VL0->isCommutative()) { in buildTree_rec()
[all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineNegator.cpp | 123 if (I->isCommutative() && InstCombiner::getComplexity(I->getOperand(0)) < in getSortedOperandsOfBinOp()
|
| H A D | InstructionCombining.cpp | 417 if (I.isCommutative() && getComplexity(I.getOperand(0)) < in SimplifyAssociativeOrCommutative()
479 if (I.isAssociative() && I.isCommutative()) { in SimplifyAssociativeOrCommutative()
593 if (Instruction::isCommutative(ROp)) in rightDistributesOverLeft()
650 bool InnerCommutative = Instruction::isCommutative(InnerOpcode); in tryFactorization()
1740 if (Inst.isCommutative() && in foldVectorBinop()
1848 if (Inst.isAssociative() && Inst.isCommutative()) { in foldVectorBinop()
|
| H A D | InstCombineShifts.cpp | 1052 if (Op0BO->isCommutative() && Y->hasOneUse() && in visitShl()
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/Hexagon/ |
| H A D | HexagonVectorLoopCarriedReuse.cpp | 438 if ((I && I->isCommutative()) || (C1 && isCallInstCommutative(C1))) { in findValueToReuse()
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/ |
| H A D | InterleavedLoadCombinePass.cpp | 907 if ((!C) && BO.isCommutative()) { in computePolynomialBinOp()
|
| /openbsd-src/gnu/llvm/llvm/lib/Analysis/ |
| H A D | IRSimilarityIdentifier.cpp | 797 if (IA->isCommutative() && !isa<FPMathOperator>(IA) && in compareStructure()
|
| H A D | IVDescriptors.cpp | 369 if (!Cur->isCommutative() && !IsAPhi && !isa<SelectInst>(Cur) && in AddReductionVar()
|
| H A D | InstructionSimplify.cpp | 257 (Instruction::isCommutative(OpcodeToExpand) && L == B1 && R == B0)) { in expandBinOp()
345 if (!Instruction::isCommutative(Opcode)) in simplifyAssociativeBinOp()
454 if (Simplified->isCommutative() && in threadBinOpOverSelect()
623 if (Instruction::isCommutative(Opcode)) in foldOrCommuteConstant()
|