File: deadcode.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 (37 lines) | stat: -rw-r--r-- 949 bytes parent folder | download | duplicates (12)
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
; RUN: opt < %s -passes=reassociate -disable-output

; It has been detected that dead loops like the one in this test case can be
; created by -passes=jump-threading (it was detected by a csmith generated program).
;
; According to -passes=verify this is valid input (even if it could be discussed if
; the dead loop really satisfies SSA form).
;
; The problem found was that the -passes=reassociate pass ends up in an infinite loop
; when analysing the 'deadloop1' basic block. See "Bugzilla - Bug 30818".
define void @deadloop1() {
  br label %endlabel

deadloop1:
  %1 = xor i32 %2, 7
  %2 = xor i32 %1, 8
  br label %deadloop1

endlabel:
  ret void
}


; Another example showing that dead code could result in infinite loops in
; reassociate pass. See "Bugzilla - Bug 30818".
define void @deadloop2() {
  br label %endlabel

deadloop2:
  %1 = and i32 %2, 7
  %2 = and i32 %3, 8
  %3 = and i32 %1, 6
  br label %deadloop2

endlabel:
  ret void
}