Skip to content

Commit 54a92fc

Browse files
committed
NewGVN: Fix PR 34452 by passing instruction all the way down when we do aggregate value simplification
llvm-svn: 312509
1 parent 1a58258 commit 54a92fc

File tree

2 files changed

+58
-7
lines changed

2 files changed

+58
-7
lines changed

llvm/lib/Transforms/Scalar/NewGVN.cpp

Lines changed: 9 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -597,8 +597,8 @@ class NewGVN {
597597
private:
598598
// Expression handling.
599599
const Expression *createExpression(Instruction *) const;
600-
const Expression *createBinaryExpression(unsigned, Type *, Value *,
601-
Value *) const;
600+
const Expression *createBinaryExpression(unsigned, Type *, Value *, Value *,
601+
Instruction *) const;
602602
PHIExpression *createPHIExpression(Instruction *, bool &HasBackEdge,
603603
bool &OriginalOpsConstant) const;
604604
const DeadExpression *createDeadExpression() const;
@@ -933,8 +933,8 @@ bool NewGVN::setBasicExpressionInfo(Instruction *I, BasicExpression *E) const {
933933
}
934934

935935
const Expression *NewGVN::createBinaryExpression(unsigned Opcode, Type *T,
936-
Value *Arg1,
937-
Value *Arg2) const {
936+
Value *Arg1, Value *Arg2,
937+
Instruction *I) const {
938938
auto *E = new (ExpressionAllocator) BasicExpression(2);
939939

940940
E->setType(T);
@@ -952,7 +952,7 @@ const Expression *NewGVN::createBinaryExpression(unsigned Opcode, Type *T,
952952
E->op_push_back(lookupOperandLeader(Arg2));
953953

954954
Value *V = SimplifyBinOp(Opcode, E->getOperand(0), E->getOperand(1), SQ);
955-
if (const Expression *SimplifiedE = checkSimplificationResults(E, nullptr, V))
955+
if (const Expression *SimplifiedE = checkSimplificationResults(E, I, V))
956956
return SimplifiedE;
957957
return E;
958958
}
@@ -1739,8 +1739,9 @@ NewGVN::performSymbolicAggrValueEvaluation(Instruction *I) const {
17391739
// expression.
17401740
assert(II->getNumArgOperands() == 2 &&
17411741
"Expect two args for recognised intrinsics.");
1742-
return createBinaryExpression(
1743-
Opcode, EI->getType(), II->getArgOperand(0), II->getArgOperand(1));
1742+
return createBinaryExpression(Opcode, EI->getType(),
1743+
II->getArgOperand(0),
1744+
II->getArgOperand(1), I);
17441745
}
17451746
}
17461747
}
@@ -1979,6 +1980,7 @@ void NewGVN::touchAndErase(Map &M, const KeyType &Key) {
19791980
}
19801981

19811982
void NewGVN::addAdditionalUsers(Value *To, Value *User) const {
1983+
assert(User && To != User);
19821984
if (isa<Instruction>(To))
19831985
AdditionalUsers[To].insert(User);
19841986
}
Lines changed: 49 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,49 @@
1+
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
2+
; RUN: opt -newgvn -S < %s | FileCheck %s
3+
;; Ensure we don't crash when simplifying aggregate value expressions
4+
source_filename = "bugpoint-output-09f7a24.bc"
5+
6+
@WHOLELINE = external local_unnamed_addr global i32, align 4
7+
8+
; Function Attrs: nounwind uwtable
9+
define void @sgrep() local_unnamed_addr #0 {
10+
; CHECK-LABEL: @sgrep(
11+
; CHECK-NEXT: entry:
12+
; CHECK-NEXT: [[TMP0:%.*]] = load i32, i32* @WHOLELINE, align 4, !tbaa !1
13+
; CHECK-NEXT: [[TOBOOL:%.*]] = icmp eq i32 [[TMP0]], 0
14+
; CHECK-NEXT: [[DOT:%.*]] = select i1 [[TOBOOL]], i32 2048, i32 2047
15+
; CHECK-NEXT: br label [[WHILE_BODY_US:%.*]]
16+
; CHECK: while.body.us:
17+
; CHECK-NEXT: [[START_1230_US:%.*]] = phi i32 [ [[DOT]], [[ENTRY:%.*]] ], [ 0, [[WHILE_BODY_US]] ]
18+
; CHECK-NEXT: [[TMP1:%.*]] = sext i32 [[START_1230_US]] to i64
19+
; CHECK-NEXT: [[TMP2:%.*]] = call { i64, i1 } @llvm.sadd.with.overflow.i64(i64 0, i64 [[TMP1]])
20+
; CHECK-NEXT: br label [[WHILE_BODY_US]]
21+
;
22+
entry:
23+
%0 = load i32, i32* @WHOLELINE, align 4, !tbaa !1
24+
%tobool = icmp eq i32 %0, 0
25+
%. = select i1 %tobool, i32 2048, i32 2047
26+
br label %while.body.us
27+
28+
while.body.us: ; preds = %while.body.us, %entry
29+
%start.1230.us = phi i32 [ %., %entry ], [ 0, %while.body.us ]
30+
%1 = sext i32 %start.1230.us to i64
31+
%2 = call { i64, i1 } @llvm.sadd.with.overflow.i64(i64 0, i64 %1)
32+
%.res302 = extractvalue { i64, i1 } %2, 0
33+
%3 = icmp sge i64 undef, %.res302
34+
br label %while.body.us
35+
}
36+
37+
; Function Attrs: nounwind readnone speculatable
38+
declare { i64, i1 } @llvm.sadd.with.overflow.i64(i64, i64) #1
39+
40+
attributes #0 = { nounwind uwtable "correctly-rounded-divide-sqrt-fp-math"="false" "disable-tail-calls"="false" "less-precise-fpmad"="false" "no-frame-pointer-elim"="false" "no-infs-fp-math"="false" "no-jump-tables"="false" "no-nans-fp-math"="false" "no-signed-zeros-fp-math"="false" "no-trapping-math"="false" "polly-optimized" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+fxsr,+mmx,+sse,+sse2,+x87" "unsafe-fp-math"="false" "use-soft-float"="false" }
41+
attributes #1 = { nounwind readnone speculatable }
42+
43+
!llvm.ident = !{!0}
44+
45+
!0 = !{!"clang version 6.0.0 (trunk 311664) (llvm/trunk 311666)"}
46+
!1 = !{!2, !2, i64 0}
47+
!2 = !{!"int", !3, i64 0}
48+
!3 = !{!"omnipotent char", !4, i64 0}
49+
!4 = !{!"Simple C/C++ TBAA"}

0 commit comments

Comments
 (0)