File: pr61022.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 (67 lines) | stat: -rw-r--r-- 2,663 bytes parent folder | download | duplicates (10)
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
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt -S -passes=loop-predication < %s 2>&1 | FileCheck %s

declare void @llvm.experimental.deoptimize.isVoid(...)

define void @test_01(i1 %cond) {
; CHECK-LABEL: @test_01(
; CHECK-NEXT:  bb:
; CHECK-NEXT:    [[INST:%.*]] = call i1 @llvm.experimental.widenable.condition()
; CHECK-NEXT:    [[TMP0:%.*]] = freeze i1 true
; CHECK-NEXT:    [[TMP1:%.*]] = and i1 [[TMP0]], [[INST]]
; CHECK-NEXT:    br label [[LOOP:%.*]]
; CHECK:       unreached:
; CHECK-NEXT:    unreachable
; CHECK:       loop:
; CHECK-NEXT:    [[INST3:%.*]] = phi i32 [ 0, [[BB:%.*]] ], [ [[INST4:%.*]], [[BACKEDGE:%.*]] ]
; CHECK-NEXT:    [[INST4]] = add nsw i32 [[INST3]], 1
; CHECK-NEXT:    br i1 [[COND:%.*]], label [[BACKEDGE]], label [[GUARD_BLOCK:%.*]]
; CHECK:       normal_ret:
; CHECK-NEXT:    ret void
; CHECK:       backedge:
; CHECK-NEXT:    [[ASSUME_COND:%.*]] = phi i1 [ [[INST9:%.*]], [[GUARD_BLOCK]] ], [ true, [[LOOP]] ]
; CHECK-NEXT:    call void @llvm.assume(i1 [[ASSUME_COND]])
; CHECK-NEXT:    [[INST7:%.*]] = icmp sgt i32 [[INST3]], 137
; CHECK-NEXT:    br i1 [[INST7]], label [[UNREACHED:%.*]], label [[LOOP]]
; CHECK:       guard_block:
; CHECK-NEXT:    [[INST9]] = icmp ult i32 [[INST4]], 10000
; CHECK-NEXT:    br i1 [[TMP1]], label [[BACKEDGE]], label [[DEOPT:%.*]]
; CHECK:       deopt:
; CHECK-NEXT:    call void (...) @llvm.experimental.deoptimize.isVoid(i32 13) [ "deopt"() ]
; CHECK-NEXT:    ret void
; CHECK:       done:
; CHECK-NEXT:    ret void
;
bb:
  %inst = call i1 @llvm.experimental.widenable.condition()
  br label %loop

unreached:                                              ; preds = %backedge
  unreachable

loop:                                              ; preds = %backedge, %bb
  %inst3 = phi i32 [ 0, %bb ], [ %inst4, %backedge ]
  %inst4 = add nsw i32 %inst3, 1
  br i1 %cond, label %backedge, label %guard_block

normal_ret:                                              ; preds = %loop
  ret void

backedge:                                              ; preds = %guard_block, %loop
  %inst7 = icmp sgt i32 %inst3, 137
  br i1 %inst7, label %unreached, label %loop

guard_block:                                              ; preds = %loop, %loop
  %inst9 = icmp ult i32 %inst4, 10000
  %inst10 = and i1 %inst9, %inst
  br i1 %inst10, label %backedge, label %deopt

deopt:                                             ; preds = %guard_block
  call void (...) @llvm.experimental.deoptimize.isVoid(i32 13) [ "deopt"() ]
  ret void

done:                                             ; preds = %loop
  ret void
}

declare i1 @llvm.experimental.widenable.condition()