// to introduce PHI nodes too late to be cleaned up. If we detect such a
// trivial PHI, go ahead and zap it here.
if (Value *V = SimplifyInstruction(P, {*DL, TLInfo})) {
+ LargeOffsetGEPMap.erase(P);
P->replaceAllUsesWith(V);
P->eraseFromParent();
++NumPHIsElim;
--- /dev/null
+; Checks that case when GEP is bound to trivial PHI node is correctly handled.
+; RUN: opt %s -mtriple=aarch64-linux-gnu -codegenprepare -S -o - | FileCheck %s
+
+; CHECK: define void @crash([65536 x i32]** %s, i32 %n) {
+; CHECK-NEXT: entry:
+; CHECK-NEXT: %struct = load [65536 x i32]*, [65536 x i32]** %s
+; CHECK-NEXT: %gep0 = getelementptr [65536 x i32], [65536 x i32]* %struct, i64 0, i32 20000
+; CHECK-NEXT: store i32 %n, i32* %gep0
+; CHECK-NEXT: ret void
+; CHECK-NEXT: }
+
+define void @crash([65536 x i32]** %s, i32 %n) {
+entry:
+ %struct = load [65536 x i32]*, [65536 x i32]** %s
+ %cmp = icmp slt i32 0, %n
+ br i1 %cmp, label %baz, label %bar
+baz:
+ br label %bar
+
+foo:
+ %gep0 = getelementptr [65536 x i32], [65536 x i32]* %phi2, i64 0, i32 20000
+ br label %st
+
+st:
+ store i32 %n, i32* %gep0
+ br label %out
+
+bar:
+ %phi2 = phi [65536 x i32]* [ %struct, %baz ], [ %struct, %entry ]
+ br label %foo
+out:
+ ret void
+}