Gitiles
Code Review Sign In
gerrit-public.fairphone.software / toolchain / llvm-project / 00bb397b0dc79fcad27bfe63456a2100039706f2 / . / llvm / test / Transforms / JumpThreading / combine-metadata.ll
blob: 4ed6cfecc59aa1355bc64a4b90eee9229c3ac24f [file] [log] [blame]
Eric Christophercee313d2019-04-17 04:52:47 +0000[diff] [blame]1; RUN: opt < %s -jump-threading -S | FileCheck %s
2
3target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-v128:128:128-a0:0:64-f80:128:128"
4target triple = "i386-apple-darwin7"
5
6declare void @use(i32 *)
7
8; Check that we propagate nonnull to dominated loads, when we find an available
9; loaded value.
10; CHECK-LABEL: @test1(
11; CHECK-LABEL: ret1:
12; CHECK-NEXT: %[[p1:.*]] = load i32*, i32** %ptr
13; CHECK-NOT: !nonnull
14; CHECK-NEXT: store i32 1, i32* %[[p1]]
15; CHECK-NEXT: tail call void @use(i32* null)
16; CHECK-NEXT: ret void
17
18; CHECK-LABEL: ret2:
Eli Friedman4532a502020-05-14 12:59:45 -0700[diff] [blame]19; CHECK-NEXT: %[[p2:.*]] = load i32*, i32** %ptr, align 4, !nonnull !0
Eric Christophercee313d2019-04-17 04:52:47 +0000[diff] [blame]20; CHECK: tail call void @use(i32* %[[p2]])
21; CHECK-NEXT: ret void
22define void @test1(i32** %ptr, i1 %c) {
23 br i1 %c, label %d1, label %d2
24
25d1:
26 %p1 = load i32*, i32** %ptr, !nonnull !0
27 br label %d3
28
29d2:
30 br label %d3
31
32d3:
33 %pm = phi i32* [ null, %d2 ], [ %p1, %d1 ]
34 %p2 = load i32*, i32** %ptr
35 store i32 1, i32* %p2
36 %c2 = icmp eq i32* %pm, null
37 br i1 %c2, label %ret1, label %ret2
38
39ret1:
40 tail call void @use(i32* %pm) nounwind
41 ret void
42
43ret2:
44 tail call void @use(i32* %pm) nounwind
45 ret void
46}
47
48; Check that we propagate nonnull to dominated loads, when we find an available
49; loaded value.
50; CHECK-LABEL: @test2(
51; CHECK-LABEL: d3.thread:
Eli Friedman4532a502020-05-14 12:59:45 -0700[diff] [blame]52; CHECK-NEXT: %[[p1:.*]] = load i32*, i32** %ptr, align 4, !nonnull !0
Eric Christophercee313d2019-04-17 04:52:47 +0000[diff] [blame]53; CHECK-NEXT: store i32 1, i32* %[[p1]]
54; CHECK-NEXT: br label %ret1
55
56; CHECK-LABEL: d3:
57; CHECK-NEXT: %[[p_cmp:.*]] = load i32*, i32** %ptr
Eli Friedman4532a502020-05-14 12:59:45 -0700[diff] [blame]58; CHECK-NEXT: %[[p2:.*]] = load i32*, i32** %ptr, align 4, !nonnull !0
Eric Christophercee313d2019-04-17 04:52:47 +0000[diff] [blame]59; CHECK-NEXT: store i32 1, i32* %[[p2]]
60; CHECK-NEXT: icmp eq i32* %[[p_cmp]], null
61define void @test2(i32** %ptr, i1 %c) {
62 br i1 %c, label %d1, label %d2
63
64d1:
65 %p1 = load i32*, i32** %ptr
66 br label %d3
67
68d2:
69 br label %d3
70
71d3:
72 %pm = phi i32* [ null, %d2 ], [ %p1, %d1 ]
73 %p2 = load i32*, i32** %ptr, !nonnull !0
74 store i32 1, i32* %p2
75 %c2 = icmp eq i32* %pm, null
76 br i1 %c2, label %ret1, label %ret2
77
78ret1:
79 tail call void @use(i32* %pm) nounwind
80 ret void
81
82ret2:
83 tail call void @use(i32* %pm) nounwind
84 ret void
85}
86
87; Check that we do not propagate nonnull to loads predecessors that are combined
88; to a PHI node.
89; CHECK-LABEL: @test3(
90; CHECK-LABEL: d1:
91; CHECK-NEXT: %[[p1:.*]] = load i32*, i32** %ptr
92; CHECK-NOT: !nonnull
93
94; CHECK-LABEL: d2:
95; CHECK-NEXT: %[[p2:.*]] = load i32*, i32** %ptr
96; CHECK-NOT: !nonnull
97
98; CHECK-LABEL: d3:
99; CHECK-NEXT: phi i32* [ %[[p2]], %d2 ], [ %[[p1]], %d1 ]
100define void @test3(i32** %ptr) {
101d1:
102 %x = load i32*, i32** %ptr, !nonnull !0
103 br label %d3
104
105d2:
106 br label %d3
107
108d3:
109 %y = load i32*, i32** %ptr
110 store i32 1, i32* %y
Nikita Popov4ae17402020-06-20 12:52:53 +0200[diff] [blame]111 %c2 = icmp eq i32* %y, @p
Eric Christophercee313d2019-04-17 04:52:47 +0000[diff] [blame]112 br i1 %c2, label %ret1, label %ret2
113
114ret1:
115 ret void
116
117ret2:
118 ret void
119}
120
Nikita Popov4ae17402020-06-20 12:52:53 +0200[diff] [blame]121@p = external global i32
Eric Christophercee313d2019-04-17 04:52:47 +0000[diff] [blame]122
123!0 = !{}