[SLP]Fix logical and/or reductions.
Need to emit select(cmp) instructions for poison-safe forms of select ops. Currently alive reports that `Target is more poisonous than source` for operations we generating for such instructions. https://alive2.llvm.org/ce/z/FiNiAA Differential Revision: https://reviews.llvm.org/D112562
This commit is contained in:
parent
b0277bef97
commit
cb4feae7bd
|
|
@ -8012,10 +8012,20 @@ class HorizontalReduction {
|
|||
Value *RHS, const Twine &Name, bool UseSelect) {
|
||||
unsigned RdxOpcode = RecurrenceDescriptor::getOpcode(Kind);
|
||||
switch (Kind) {
|
||||
case RecurKind::Or:
|
||||
if (UseSelect &&
|
||||
LHS->getType() == CmpInst::makeCmpResultType(LHS->getType()))
|
||||
return Builder.CreateSelect(LHS, Builder.getTrue(), RHS, Name);
|
||||
return Builder.CreateBinOp((Instruction::BinaryOps)RdxOpcode, LHS, RHS,
|
||||
Name);
|
||||
case RecurKind::And:
|
||||
if (UseSelect &&
|
||||
LHS->getType() == CmpInst::makeCmpResultType(LHS->getType()))
|
||||
return Builder.CreateSelect(LHS, RHS, Builder.getFalse(), Name);
|
||||
return Builder.CreateBinOp((Instruction::BinaryOps)RdxOpcode, LHS, RHS,
|
||||
Name);
|
||||
case RecurKind::Add:
|
||||
case RecurKind::Mul:
|
||||
case RecurKind::Or:
|
||||
case RecurKind::And:
|
||||
case RecurKind::Xor:
|
||||
case RecurKind::FAdd:
|
||||
case RecurKind::FMul:
|
||||
|
|
@ -8059,8 +8069,12 @@ class HorizontalReduction {
|
|||
static Value *createOp(IRBuilder<> &Builder, RecurKind RdxKind, Value *LHS,
|
||||
Value *RHS, const Twine &Name,
|
||||
const ReductionOpsListType &ReductionOps) {
|
||||
bool UseSelect = ReductionOps.size() == 2;
|
||||
assert((!UseSelect || isa<SelectInst>(ReductionOps[1][0])) &&
|
||||
bool UseSelect = ReductionOps.size() == 2 ||
|
||||
// Logical or/and.
|
||||
(ReductionOps.size() == 1 &&
|
||||
isa<SelectInst>(ReductionOps.front().front()));
|
||||
assert((!UseSelect || ReductionOps.size() != 2 ||
|
||||
isa<SelectInst>(ReductionOps[1][0])) &&
|
||||
"Expected cmp + select pairs for reduction");
|
||||
Value *Op = createOp(Builder, RdxKind, LHS, RHS, Name, UseSelect);
|
||||
if (RecurrenceDescriptor::isIntMinMaxRecurrenceKind(RdxKind)) {
|
||||
|
|
@ -8198,10 +8212,10 @@ class HorizontalReduction {
|
|||
/// Checks if the instruction is in basic block \p BB.
|
||||
/// For a cmp+sel min/max reduction check that both ops are in \p BB.
|
||||
static bool hasSameParent(Instruction *I, BasicBlock *BB) {
|
||||
if (isCmpSelMinMax(I)) {
|
||||
if (isCmpSelMinMax(I) || (isBoolLogicOp(I) && isa<SelectInst>(I))) {
|
||||
auto *Sel = cast<SelectInst>(I);
|
||||
auto *Cmp = cast<Instruction>(Sel->getCondition());
|
||||
return Sel->getParent() == BB && Cmp->getParent() == BB;
|
||||
auto *Cmp = dyn_cast<Instruction>(Sel->getCondition());
|
||||
return Sel->getParent() == BB && Cmp && Cmp->getParent() == BB;
|
||||
}
|
||||
return I->getParent() == BB;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -480,7 +480,7 @@ define i1 @logical_and_icmp_extra_op(<4 x i32> %x, <4 x i32> %y, i1 %c) {
|
|||
; CHECK-NEXT: [[S3:%.*]] = select i1 [[C:%.*]], i1 [[C]], i1 false
|
||||
; CHECK-NEXT: [[TMP2:%.*]] = freeze <4 x i1> [[TMP1]]
|
||||
; CHECK-NEXT: [[TMP3:%.*]] = call i1 @llvm.vector.reduce.and.v4i1(<4 x i1> [[TMP2]])
|
||||
; CHECK-NEXT: [[OP_EXTRA:%.*]] = and i1 [[TMP3]], [[S3]]
|
||||
; CHECK-NEXT: [[OP_EXTRA:%.*]] = select i1 [[TMP3]], i1 [[S3]], i1 false
|
||||
; CHECK-NEXT: ret i1 [[OP_EXTRA]]
|
||||
;
|
||||
%x0 = extractelement <4 x i32> %x, i32 0
|
||||
|
|
@ -509,7 +509,7 @@ define i1 @logical_or_icmp_extra_op(<4 x i32> %x, <4 x i32> %y, i1 %c) {
|
|||
; CHECK-NEXT: [[S3:%.*]] = select i1 [[C:%.*]], i1 true, i1 [[C]]
|
||||
; CHECK-NEXT: [[TMP2:%.*]] = freeze <4 x i1> [[TMP1]]
|
||||
; CHECK-NEXT: [[TMP3:%.*]] = call i1 @llvm.vector.reduce.or.v4i1(<4 x i1> [[TMP2]])
|
||||
; CHECK-NEXT: [[OP_EXTRA:%.*]] = or i1 [[TMP3]], [[S3]]
|
||||
; CHECK-NEXT: [[OP_EXTRA:%.*]] = select i1 [[TMP3]], i1 true, i1 [[S3]]
|
||||
; CHECK-NEXT: ret i1 [[OP_EXTRA]]
|
||||
;
|
||||
%x0 = extractelement <4 x i32> %x, i32 0
|
||||
|
|
|
|||
Loading…
Reference in New Issue