File: dfa-constant-propagation.ll

package info (click to toggle)
llvm-toolchain-20 1%3A20.1.8-1
  • links: PTS, VCS
  • area: main
  • in suites: experimental
  • size: 2,111,696 kB
  • sloc: cpp: 7,438,781; ansic: 1,393,871; asm: 1,012,926; python: 241,771; f90: 86,635; objc: 75,411; lisp: 42,144; pascal: 17,286; sh: 8,596; ml: 5,082; perl: 4,730; makefile: 3,591; awk: 3,523; javascript: 2,251; xml: 892; fortran: 672
file content (32 lines) | stat: -rw-r--r-- 755 bytes parent folder | download | duplicates (16) 
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
 
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt -S -passes=dfa-jump-threading,sccp,simplifycfg %s | FileCheck %s

; This test checks that a constant propagation is applied for a basic loop.
; Related to bug 44679.
define i32 @test(i32 %a) {
; CHECK-LABEL: @test(
; CHECK-NEXT:  entry:
; CHECK-NEXT:    ret i32 3
;
entry:
  br label %while.cond

while.cond:
  %num = phi i32 [ 0, %entry ], [ %add, %case1 ]
  %state = phi i32 [ 1, %entry ], [ %state.next, %case1 ]
  switch i32 %state, label %end [
  i32 1, label %case1
  i32 2, label %case2
  ]

case1:
  %state.next = phi i32 [ 3, %case2 ], [ 2, %while.cond ]
  %add = add nsw i32 %num, %state
  br label %while.cond

case2:
  br label %case1

end:
  ret i32 %num
}