File: unreachable_bb.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 (30 lines) | stat: -rw-r--r-- 901 bytes parent folder | download | duplicates (11) 
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
 
; RUN: opt -regions -analyze < %s | FileCheck %s
; RUN: opt < %s -passes='print<regions>' 2>&1 | FileCheck %s

; We should not crash if there are some bbs that are not reachable.
define void @f() {
entry:
  br label %for.pre

notintree:                                        ; No predecessors!
  br label %ret

for.pre:                                          ; preds = %entry
  br label %for

for:                                              ; preds = %for.inc, %for.pre
  %indvar = phi i64 [ 0, %for.pre ], [ %indvar.next, %for.inc ]
  %exitcond = icmp ne i64 %indvar, 200
  br i1 %exitcond, label %for.inc, label %ret

for.inc:                                          ; preds = %for
  %indvar.next = add i64 %indvar, 1
  br label %for

ret:                                              ; preds = %for, %notintree
  ret void
}

; CHECK: [0] entry => <Function Return>
; CHECK:   [1] for => ret