File: infinite-loop-two-predecessors.ll

package info (click to toggle)
llvm-toolchain-16 1%3A16.0.6-15~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,634,792 kB
  • sloc: cpp: 6,179,261; ansic: 1,216,205; asm: 741,319; python: 196,614; objc: 75,325; f90: 49,640; lisp: 32,396; pascal: 12,286; sh: 9,394; perl: 7,442; ml: 5,494; awk: 3,523; makefile: 2,723; javascript: 1,206; xml: 886; fortran: 581; cs: 573
file content (32 lines) | stat: -rw-r--r-- 789 bytes parent folder | download | duplicates (8)
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
; RUN: opt -S -o - %s -passes=inline | FileCheck %s

define void @f1() {
bb.0:
  br i1 false, label %bb.2, label %bb.1

bb.1:                                             ; preds = %bb.0
  br label %bb.2

bb.2:                                             ; preds = %bb.0, %bb.1
  %tmp0 = phi i1 [ true, %bb.1 ], [ false, %bb.0 ]
  br i1 %tmp0, label %bb.4, label %bb.3

bb.3:                                             ; preds = %bb.3, %bb.3
  br i1 undef, label %bb.3, label %bb.3

bb.4:                                             ; preds = %bb.2
  ret void
}

define void @f2() {
bb.0:
  call void @f1()
  ret void
}

; f1 should be inlined into f2 and simplified/collapsed to nothing.

; CHECK-LABEL: define void @f2() {
; CHECK-NEXT:  bb.0:
; CHECK-NEXT:    ret void
; CHECK-NEXT:  }