[llvm-branch-commits] [llvm] 22324a6 - [BasicAA] Add additional negative phi tests. NFC
Hans Wennborg via llvm-branch-commits
llvm-branch-commits at lists.llvm.org
Mon Jul 27 08:05:59 PDT 2020
Author: David Green
Date: 2020-07-27T17:02:13+02:00
New Revision: 22324a62231082a18c59052232d16c055c1a2968
URL: https://github.com/llvm/llvm-project/commit/22324a62231082a18c59052232d16c055c1a2968
DIFF: https://github.com/llvm/llvm-project/commit/22324a62231082a18c59052232d16c055c1a2968.diff
LOG: [BasicAA] Add additional negative phi tests. NFC
(cherry picked from commit 30fa57662760e1489cf70cb411c55fbe9fc189fe)
Added:
Modified:
llvm/test/Analysis/BasicAA/recphi.ll
Removed:
################################################################################
diff --git a/llvm/test/Analysis/BasicAA/recphi.ll b/llvm/test/Analysis/BasicAA/recphi.ll
index 130058c74560..3c8397cc0fec 100644
--- a/llvm/test/Analysis/BasicAA/recphi.ll
+++ b/llvm/test/Analysis/BasicAA/recphi.ll
@@ -83,3 +83,109 @@ if.then: ; preds = %f.exit
if.end: ; preds = %f.exit
ret i32 0
}
+
+; CHECK-LABEL: Function: reverse: 6 pointers, 0 call sites
+; CHECK: MustAlias: [10 x i32]* %tab, i8* %0
+; CHECK: MustAlias: [10 x i32]* %tab, i32* %arrayidx
+; CHECK: MustAlias: i32* %arrayidx, i8* %0
+; CHECK: PartialAlias: [10 x i32]* %tab, i32* %arrayidx1
+; CHECK: NoAlias: i32* %arrayidx1, i8* %0
+; CHECK: NoAlias: i32* %arrayidx, i32* %arrayidx1
+; CHECK: MayAlias: [10 x i32]* %tab, i32* %p.addr.05.i
+; CHECK: NoAlias: i32* %p.addr.05.i, i8* %0
+; CHECK: NoAlias: i32* %arrayidx, i32* %p.addr.05.i
+; CHECK: MayAlias: i32* %arrayidx1, i32* %p.addr.05.i
+; CHECK: MayAlias: [10 x i32]* %tab, i32* %incdec.ptr.i
+; CHECK: MayAlias: i32* %incdec.ptr.i, i8* %0
+; CHECK: MayAlias: i32* %arrayidx, i32* %incdec.ptr.i
+; CHECK: MayAlias: i32* %arrayidx1, i32* %incdec.ptr.i
+; CHECK: NoAlias: i32* %incdec.ptr.i, i32* %p.addr.05.i
+define i32 @reverse() nounwind {
+entry:
+ %tab = alloca [10 x i32], align 4
+ %0 = bitcast [10 x i32]* %tab to i8*
+ %arrayidx = getelementptr inbounds [10 x i32], [10 x i32]* %tab, i32 0, i32 0
+ store i32 0, i32* %arrayidx, align 4
+ %arrayidx1 = getelementptr inbounds [10 x i32], [10 x i32]* %tab, i32 0, i32 9
+ store i32 0, i32* %arrayidx1, align 4
+ %1 = add i32 1, 1
+ %cmp4.i = icmp slt i32 %1, 2
+ br i1 %cmp4.i, label %while.body.i, label %f.exit
+
+while.body.i: ; preds = %while.body.i, %entry
+ %2 = phi i32 [ 1, %while.body.i ], [ %1, %entry ]
+ %foo.06.i = phi i32 [ %sub.i, %while.body.i ], [ 2, %entry ]
+ %p.addr.05.i = phi i32* [ %incdec.ptr.i, %while.body.i ], [ %arrayidx1, %entry ]
+ %sub.i = sub nsw i32 %foo.06.i, %2
+ %incdec.ptr.i = getelementptr inbounds i32, i32* %p.addr.05.i, i32 -1
+ store i32 %sub.i, i32* %p.addr.05.i, align 4
+ %cmp.i = icmp sgt i32 %sub.i, 1
+ br i1 %cmp.i, label %while.body.i, label %f.exit
+
+f.exit: ; preds = %entry, %while.body.i
+ %3 = load i32, i32* %arrayidx1, align 4
+ %cmp = icmp eq i32 %3, 2
+ %4 = load i32, i32* %arrayidx, align 4
+ %cmp4 = icmp eq i32 %4, 1
+ %or.cond = and i1 %cmp, %cmp4
+ br i1 %or.cond, label %if.end, label %if.then
+
+if.then: ; preds = %f.exit
+ unreachable
+
+if.end: ; preds = %f.exit
+ ret i32 0
+}
+
+; CHECK-LABEL: Function: negative: 6 pointers, 1 call sites
+; CHECK: NoAlias: [3 x i16]* %int_arr.10, i16** %argv.6.par
+; CHECK: NoAlias: i16* %_tmp1, i16** %argv.6.par
+; CHECK: PartialAlias: [3 x i16]* %int_arr.10, i16* %_tmp1
+; CHECK: NoAlias: i16* %ls1.9.0, i16** %argv.6.par
+; CHECK: MayAlias: [3 x i16]* %int_arr.10, i16* %ls1.9.0
+; CHECK: MayAlias: i16* %_tmp1, i16* %ls1.9.0
+; CHECK: NoAlias: i16* %_tmp7, i16** %argv.6.par
+; CHECK: MayAlias: [3 x i16]* %int_arr.10, i16* %_tmp7
+; CHECK: MayAlias: i16* %_tmp1, i16* %_tmp7
+; CHECK: NoAlias: i16* %_tmp7, i16* %ls1.9.0
+; CHECK: NoAlias: i16* %_tmp11, i16** %argv.6.par
+; CHECK: PartialAlias: [3 x i16]* %int_arr.10, i16* %_tmp11
+; CHECK: NoAlias: i16* %_tmp1, i16* %_tmp11
+; CHECK: NoAlias: i16* %_tmp11, i16* %ls1.9.0
+; CHECK: MayAlias: i16* %_tmp11, i16* %_tmp7
+; CHECK: Both ModRef: Ptr: i16** %argv.6.par <-> %_tmp16 = call i16 @call(i32 %_tmp13)
+; CHECK: NoModRef: Ptr: [3 x i16]* %int_arr.10 <-> %_tmp16 = call i16 @call(i32 %_tmp13)
+; CHECK: NoModRef: Ptr: i16* %_tmp1 <-> %_tmp16 = call i16 @call(i32 %_tmp13)
+; CHECK: Both ModRef: Ptr: i16* %ls1.9.0 <-> %_tmp16 = call i16 @call(i32 %_tmp13)
+; CHECK: Both ModRef: Ptr: i16* %_tmp7 <-> %_tmp16 = call i16 @call(i32 %_tmp13)
+; CHECK: NoModRef: Ptr: i16* %_tmp11 <-> %_tmp16 = call i16 @call(i32 %_tmp13)
+define i16 @negative(i16 %argc.5.par, i16** nocapture readnone %argv.6.par) {
+ %int_arr.10 = alloca [3 x i16], align 1
+ %_tmp1 = getelementptr inbounds [3 x i16], [3 x i16]* %int_arr.10, i16 0, i16 2
+ br label %bb1
+
+bb1: ; preds = %bb1, %0
+ %i.7.0 = phi i16 [ 2, %0 ], [ %_tmp5, %bb1 ]
+ %ls1.9.0 = phi i16* [ %_tmp1, %0 ], [ %_tmp7, %bb1 ]
+ store i16 %i.7.0, i16* %ls1.9.0, align 1
+ %_tmp5 = add nsw i16 %i.7.0, -1
+ %_tmp7 = getelementptr i16, i16* %ls1.9.0, i16 -1
+ %_tmp9 = icmp sgt i16 %i.7.0, 0
+ br i1 %_tmp9, label %bb1, label %bb3
+
+bb3: ; preds = %bb1
+ %_tmp11 = getelementptr inbounds [3 x i16], [3 x i16]* %int_arr.10, i16 0, i16 1
+ %_tmp12 = load i16, i16* %_tmp11, align 1
+ %_tmp13 = sext i16 %_tmp12 to i32
+ %_tmp16 = call i16 @call(i32 %_tmp13)
+ %_tmp18.not = icmp eq i16 %_tmp12, 1
+ br i1 %_tmp18.not, label %bb5, label %bb4
+
+bb4: ; preds = %bb3
+ ret i16 1
+
+bb5: ; preds = %bb3, %bb4
+ ret i16 0
+}
+
+declare i16 @call(i32)
More information about the llvm-branch-commits
mailing list