File: 2003-01-22-PredecessorProblem.ll

package info (click to toggle)
llvm-toolchain-15 1%3A15.0.6-4
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,554,644 kB
  • sloc: cpp: 5,922,452; ansic: 1,012,136; asm: 674,362; python: 191,568; objc: 73,855; f90: 42,327; lisp: 31,913; pascal: 11,973; javascript: 10,144; sh: 9,421; perl: 7,447; ml: 5,527; awk: 3,523; makefile: 2,520; xml: 885; cs: 573; fortran: 567
file content (29 lines) | stat: -rw-r--r-- 779 bytes parent folder | download | duplicates (13) 
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
 
; Testcase reduced from 197.parser by bugpoint
; RUN: opt < %s -passes=adce
; RUN: opt < %s -passes=adce -adce-remove-loops -S | FileCheck %s

define void @conjunction_prune() {
; <label>:0
        br label %bb19

bb19:           ; preds = %bb23, %bb22, %0
        %reg205 = phi ptr [ null, %bb22 ], [ null, %bb23 ], [ null, %0 ]                ; <ptr> [#uses=1]
; CHECK: br label %bb22
        br i1 false, label %bb21, label %bb22

bb21:           ; preds = %bb19
; CHECK: br label %bb22
        br label %bb22

bb22:           ; preds = %bb21, %bb19
; CHECK: br label %bb23
        br i1 false, label %bb19, label %bb23

bb23:           ; preds = %bb22
; CHECK: br label %bb28
        br i1 false, label %bb19, label %bb28

bb28:           ; preds = %bb23
        ret void
}