File: predicateinfo-cond.ll

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm-proposed-updates
  • size: 1,998,492 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (129 lines) | stat: -rw-r--r-- 3,094 bytes parent folder | download | duplicates (16)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt -S -passes=ipsccp < %s | FileCheck %s

; Test that information about the true/false value of conditions themselves
; is also used, not information implied by comparisions.

define i32 @switch(i32 %x) {
; CHECK-LABEL: @switch(
; CHECK-NEXT:    switch i32 [[X:%.*]], label [[CASE_DEFAULT:%.*]] [
; CHECK-NEXT:    i32 0, label [[CASE_0:%.*]]
; CHECK-NEXT:    i32 2, label [[CASE_2:%.*]]
; CHECK-NEXT:    ]
; CHECK:       case.0:
; CHECK-NEXT:    br label [[END:%.*]]
; CHECK:       case.2:
; CHECK-NEXT:    br label [[END]]
; CHECK:       case.default:
; CHECK-NEXT:    br label [[END]]
; CHECK:       end:
; CHECK-NEXT:    ret i32 1
;
  switch i32 %x, label %case.default [
  i32 0, label %case.0
  i32 2, label %case.2
  ]

case.0:
  %add = add i32 %x, 1
  br label %end

case.2:
  %sub = sub i32 %x, 1
  br label %end

case.default:
  br label %end

end:
  %phi = phi i32 [ %add, %case.0 ], [ %sub, %case.2 ], [ 1, %case.default]
  ret i32 %phi
}

define i1 @assume(i32 %x) {
; CHECK-LABEL: @assume(
; CHECK-NEXT:    [[CMP:%.*]] = icmp sge i32 [[X:%.*]], 0
; CHECK-NEXT:    call void @llvm.assume(i1 [[CMP]])
; CHECK-NEXT:    ret i1 true
;
  %cmp = icmp sge i32 %x, 0
  call void @llvm.assume(i1 %cmp)
  ret i1 %cmp
}

define i32 @branch(i32 %x) {
; CHECK-LABEL: @branch(
; CHECK-NEXT:    [[CMP:%.*]] = icmp sge i32 [[X:%.*]], 0
; CHECK-NEXT:    br i1 [[CMP]], label [[IF_THEN1:%.*]], label [[IF_THEN2:%.*]]
; CHECK:       if.then1:
; CHECK-NEXT:    br label [[IF2_THEN1:%.*]]
; CHECK:       if2.then1:
; CHECK-NEXT:    br label [[IF2_END:%.*]]
; CHECK:       if2.end:
; CHECK-NEXT:    ret i32 0
; CHECK:       if.then2:
; CHECK-NEXT:    br label [[IF3_THEN2:%.*]]
; CHECK:       if3.then2:
; CHECK-NEXT:    br label [[IF3_END:%.*]]
; CHECK:       if3.end:
; CHECK-NEXT:    ret i32 1
;
  %cmp = icmp sge i32 %x, 0
  br i1 %cmp, label %if.then1, label %if.then2

if.then1:
  br i1 %cmp, label %if2.then1, label %if2.then2

if2.then1:
  br label %if2.end

if2.then2:
  br label %if2.end

if2.end:
  %phi = phi i32 [ 0, %if2.then1 ], [ 1, %if2.then2 ]
  ret i32 %phi

if.then2:
  br i1 %cmp, label %if3.then1, label %if3.then2

if3.then1:
  br label %if3.end

if3.then2:
  br label %if3.end

if3.end:
  %phi2 = phi i32 [ 0, %if3.then1 ], [ 1, %if3.then2 ]
  ret i32 %phi2
}

define void @pr46814(i32 %a) {
; CHECK-LABEL: @pr46814(
; CHECK-NEXT:    [[C1:%.*]] = icmp uge i32 [[A:%.*]], 10
; CHECK-NEXT:    [[C2:%.*]] = icmp ult i32 [[A]], 20
; CHECK-NEXT:    [[C3:%.*]] = and i1 [[C1]], [[C2]]
; CHECK-NEXT:    br i1 [[C3]], label [[IF_1:%.*]], label [[EXIT:%.*]]
; CHECK:       if.1:
; CHECK-NEXT:    br label [[IF_2:%.*]]
; CHECK:       if.2:
; CHECK-NEXT:    br i1 true, label [[EXIT]], label [[EXIT]]
; CHECK:       exit:
; CHECK-NEXT:    ret void
;
  %c1 = icmp uge i32 %a, 10
  %c2 = icmp ult i32 %a, 20
  %c3 = and i1 %c1, %c2
  br i1 %c3, label %if.1, label %exit

if.1:
  br i1 %c3, label %if.2, label %exit

if.2:
  br i1 %c3, label %exit, label %exit

exit:
  ret void
}

declare void @llvm.assume(i1)