File: tut-simplify-cfg1.ll

package info (click to toggle)
llvm-toolchain-17 1%3A17.0.6-22
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,799,624 kB
  • sloc: cpp: 6,428,607; ansic: 1,383,196; asm: 793,408; python: 223,504; objc: 75,364; f90: 60,502; lisp: 33,869; pascal: 15,282; sh: 9,684; perl: 7,453; ml: 4,937; awk: 3,523; makefile: 2,889; javascript: 2,149; xml: 888; fortran: 619; cs: 573
file content (90 lines) | stat: -rw-r--r-- 2,215 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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt %loadexampleirtransforms -passes=tut-simplifycfg -tut-simplifycfg-version=v1 -S < %s | FileCheck %s
; RUN: opt %loadexampleirtransforms -passes=tut-simplifycfg -tut-simplifycfg-version=v2 -S < %s | FileCheck %s
; RUN: opt %loadexampleirtransforms -passes=tut-simplifycfg -tut-simplifycfg-version=v3 -S < %s | FileCheck %s

define i32 @simp1() {
; CHECK-LABEL: @simp1(
; CHECK-NEXT:  entry:
; CHECK-NEXT:    ret i32 10
;
entry:
  br i1 true, label %if.then, label %if.else

if.then:
  ret i32 10

if.else:
  ret i32 12
}

define i32 @simp2() {
; CHECK-LABEL: @simp2(
; CHECK-NEXT:  entry:
; CHECK-NEXT:    ret i32 200
;
entry:
  br i1 false, label %if.then, label %if.else

if.then:
  ret i32 99

if.else:
  ret i32 200
}

declare void @foo(i64)

define i64 @merge_into_predecessor(i64 %a, i64 %b) {
; CHECK-LABEL: @merge_into_predecessor(
; CHECK-NEXT:  entry:
; CHECK-NEXT:    [[R:%.*]] = add i64 [[A:%.*]], [[B:%.*]]
; CHECK-NEXT:    call void @foo(i64 [[R]])
; CHECK-NEXT:    call void @foo(i64 [[A]])
; CHECK-NEXT:    ret i64 [[R]]
;
entry:
  br label %bb.next

bb.next:
  %r = add i64 %a, %b
  call void @foo(i64 %r)
  call void @foo(i64 %a)
  br label %bb.next.next

bb.next.next:
  ret i64 %r
}

define i64 @merge_into_predecessor_with_phi(i64 %a, i64 %b, i1 %c) {
; CHECK-LABEL: @merge_into_predecessor_with_phi(
; CHECK-NEXT:  entry:
; CHECK-NEXT:    call void @foo(i64 [[B:%.*]])
; CHECK-NEXT:    [[R:%.*]] = add i64 [[A:%.*]], [[B]]
; CHECK-NEXT:    call void @foo(i64 [[R]])
; CHECK-NEXT:    call void @foo(i64 [[A]])
; CHECK-NEXT:    br i1 [[C:%.*]], label [[BB_NEXT_NEXT:%.*]], label [[BB_EXIT:%.*]]
; CHECK:       bb.next.next:
; CHECK-NEXT:    br label [[BB_EXIT]]
; CHECK:       bb.exit:
; CHECK-NEXT:    [[RET:%.*]] = phi i64 [ [[R]], [[ENTRY:%.*]] ], [ 10, [[BB_NEXT_NEXT]] ]
; CHECK-NEXT:    ret i64 [[RET]]
;
entry:
  call void @foo(i64 %b)
  br label %bb.next

bb.next:
  %r = add i64 %a, %b
  call void @foo(i64 %r)
  call void @foo(i64 %a)
  br i1 %c, label %bb.next.next, label %bb.exit

bb.next.next:
  br label %bb.exit

bb.exit:
  %ret = phi i64 [ %r, %bb.next], [ 10, %bb.next.next]
  ret i64 %ret

}