Lines Matching refs:NewOps
79 ArrayRef<Value *> NewOps,
4346 SmallVector<Value *, 8> NewOps; in simplifyWithOpReplaced() local
4351 NewOps.push_back(NewInstOp); in simplifyWithOpReplaced()
4354 NewOps.push_back(InstOp); in simplifyWithOpReplaced()
4359 if (isa<UndefValue>(NewOps.back()) && !Q.CanUseUndef) in simplifyWithOpReplaced()
4374 if (NewOps[0] == ConstantExpr::getBinOpIdentity(Opcode, I->getType())) in simplifyWithOpReplaced()
4375 return NewOps[1]; in simplifyWithOpReplaced()
4376 if (NewOps[1] == ConstantExpr::getBinOpIdentity(Opcode, I->getType(), in simplifyWithOpReplaced()
4378 return NewOps[0]; in simplifyWithOpReplaced()
4382 NewOps[0] == NewOps[1]) { in simplifyWithOpReplaced()
4391 return NewOps[0]; in simplifyWithOpReplaced()
4398 NewOps[0] == RepOp && NewOps[1] == RepOp) in simplifyWithOpReplaced()
4410 if ((NewOps[0] == Absorber || NewOps[1] == Absorber) && in simplifyWithOpReplaced()
4418 if (NewOps.size() == 2 && match(NewOps[1], m_Zero())) in simplifyWithOpReplaced()
4419 return NewOps[0]; in simplifyWithOpReplaced()
4436 ::simplifyInstructionWithOperands(I, NewOps, Q, MaxRecurse)); in simplifyWithOpReplaced()
4442 for (Value *NewOp : NewOps) { in simplifyWithOpReplaced()
7058 ArrayRef<Value *> NewOps, in simplifyInstructionWithOperands() argument
7069 if (llvm::all_of(NewOps, [](Value *V) { return isa<Constant>(V); })) { in simplifyInstructionWithOperands()
7070 SmallVector<Constant *, 8> NewConstOps(NewOps.size()); in simplifyInstructionWithOperands()
7071 transform(NewOps, NewConstOps.begin(), in simplifyInstructionWithOperands()
7077 return simplifyFNegInst(NewOps[0], I->getFastMathFlags(), Q, MaxRecurse); in simplifyInstructionWithOperands()
7079 return simplifyFAddInst(NewOps[0], NewOps[1], I->getFastMathFlags(), Q, in simplifyInstructionWithOperands()
7083 NewOps[0], NewOps[1], Q.IIQ.hasNoSignedWrap(cast<BinaryOperator>(I)), in simplifyInstructionWithOperands()
7086 return simplifyFSubInst(NewOps[0], NewOps[1], I->getFastMathFlags(), Q, in simplifyInstructionWithOperands()
7090 NewOps[0], NewOps[1], Q.IIQ.hasNoSignedWrap(cast<BinaryOperator>(I)), in simplifyInstructionWithOperands()
7093 return simplifyFMulInst(NewOps[0], NewOps[1], I->getFastMathFlags(), Q, in simplifyInstructionWithOperands()
7097 NewOps[0], NewOps[1], Q.IIQ.hasNoSignedWrap(cast<BinaryOperator>(I)), in simplifyInstructionWithOperands()
7100 return simplifySDivInst(NewOps[0], NewOps[1], in simplifyInstructionWithOperands()
7104 return simplifyUDivInst(NewOps[0], NewOps[1], in simplifyInstructionWithOperands()
7108 return simplifyFDivInst(NewOps[0], NewOps[1], I->getFastMathFlags(), Q, in simplifyInstructionWithOperands()
7111 return simplifySRemInst(NewOps[0], NewOps[1], Q, MaxRecurse); in simplifyInstructionWithOperands()
7113 return simplifyURemInst(NewOps[0], NewOps[1], Q, MaxRecurse); in simplifyInstructionWithOperands()
7115 return simplifyFRemInst(NewOps[0], NewOps[1], I->getFastMathFlags(), Q, in simplifyInstructionWithOperands()
7119 NewOps[0], NewOps[1], Q.IIQ.hasNoSignedWrap(cast<BinaryOperator>(I)), in simplifyInstructionWithOperands()
7122 return simplifyLShrInst(NewOps[0], NewOps[1], in simplifyInstructionWithOperands()
7126 return simplifyAShrInst(NewOps[0], NewOps[1], in simplifyInstructionWithOperands()
7130 return simplifyAndInst(NewOps[0], NewOps[1], Q, MaxRecurse); in simplifyInstructionWithOperands()
7132 return simplifyOrInst(NewOps[0], NewOps[1], Q, MaxRecurse); in simplifyInstructionWithOperands()
7134 return simplifyXorInst(NewOps[0], NewOps[1], Q, MaxRecurse); in simplifyInstructionWithOperands()
7136 return simplifyICmpInst(cast<ICmpInst>(I)->getPredicate(), NewOps[0], in simplifyInstructionWithOperands()
7137 NewOps[1], Q, MaxRecurse); in simplifyInstructionWithOperands()
7139 return simplifyFCmpInst(cast<FCmpInst>(I)->getPredicate(), NewOps[0], in simplifyInstructionWithOperands()
7140 NewOps[1], I->getFastMathFlags(), Q, MaxRecurse); in simplifyInstructionWithOperands()
7142 return simplifySelectInst(NewOps[0], NewOps[1], NewOps[2], Q, MaxRecurse); in simplifyInstructionWithOperands()
7146 return simplifyGEPInst(GEPI->getSourceElementType(), NewOps[0], in simplifyInstructionWithOperands()
7147 ArrayRef(NewOps).slice(1), GEPI->getNoWrapFlags(), Q, in simplifyInstructionWithOperands()
7152 return simplifyInsertValueInst(NewOps[0], NewOps[1], IV->getIndices(), Q, in simplifyInstructionWithOperands()
7156 return simplifyInsertElementInst(NewOps[0], NewOps[1], NewOps[2], Q); in simplifyInstructionWithOperands()
7159 return simplifyExtractValueInst(NewOps[0], EVI->getIndices(), Q, in simplifyInstructionWithOperands()
7163 return simplifyExtractElementInst(NewOps[0], NewOps[1], Q, MaxRecurse); in simplifyInstructionWithOperands()
7166 return simplifyShuffleVectorInst(NewOps[0], NewOps[1], in simplifyInstructionWithOperands()
7171 return simplifyPHINode(cast<PHINode>(I), NewOps, Q); in simplifyInstructionWithOperands()
7174 cast<CallInst>(I), NewOps.back(), in simplifyInstructionWithOperands()
7175 NewOps.drop_back(1 + cast<CallInst>(I)->getNumTotalBundleOperands()), Q); in simplifyInstructionWithOperands()
7177 return llvm::simplifyFreezeInst(NewOps[0], Q); in simplifyInstructionWithOperands()
7181 return simplifyCastInst(I->getOpcode(), NewOps[0], I->getType(), Q, in simplifyInstructionWithOperands()
7187 return simplifyLoadInst(cast<LoadInst>(I), NewOps[0], Q); in simplifyInstructionWithOperands()
7192 ArrayRef<Value *> NewOps, in simplifyInstructionWithOperands() argument
7194 assert(NewOps.size() == I->getNumOperands() && in simplifyInstructionWithOperands()
7196 return ::simplifyInstructionWithOperands(I, NewOps, SQ, RecursionLimit); in simplifyInstructionWithOperands()