File: infinite-loop-two-predecessors.ll

package info (click to toggle)
llvm-toolchain-11 1%3A11.0.1-2
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 995,808 kB
  • sloc: cpp: 4,767,656; ansic: 760,916; asm: 477,436; python: 170,940; objc: 69,804; lisp: 29,914; sh: 23,855; f90: 18,173; pascal: 7,551; perl: 7,471; ml: 5,603; awk: 3,489; makefile: 2,573; xml: 915; cs: 573; fortran: 503; javascript: 452
file content (32 lines) | stat: -rw-r--r-- 782 bytes parent folder | download | duplicates (14) 
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 -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:  }