cyclic-phi-handling.ll
1.33 KB
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
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt < %s -basic-aa -newgvn -S | FileCheck %s
target datalayout = "e-m:o-i64:64-f80:128-n8:16:32:64-S128"
define void @foo(i32 %arg, i32 %arg1, i32 (i32, i32)* %arg2) {
; CHECK-LABEL: @foo(
; CHECK-NEXT: bb:
; CHECK-NEXT: br label %bb3
; CHECK: bb3:
; CHECK-NEXT: [[TMP:%.*]] = phi i32 [ %arg1, %bb ], [ [[TMP:%.*]]4, %bb7 ]
; CHECK-NEXT: [[TMP4:%.*]] = phi i32 [ %arg, %bb ], [ [[TMP]], %bb7 ]
; CHECK-NEXT: [[TMP5:%.*]] = call i32 %arg2(i32 [[TMP4]], i32 [[TMP]])
; CHECK-NEXT: [[TMP6:%.*]] = icmp ne i32 [[TMP5]], 0
; CHECK-NEXT: br i1 [[TMP6]], label %bb7, label %bb8
; CHECK: bb7:
; CHECK-NEXT: br label %bb3
; CHECK: bb8:
; CHECK-NEXT: ret void
;
bb:
br label %bb3
;; While non-standard, llvm allows mutually dependent phi nodes
;; Ensure we do not infinite loop trying to process them
bb3: ; preds = %bb7, %bb
%tmp = phi i32 [ %arg1, %bb ], [ %tmp4, %bb7 ]
%tmp4 = phi i32 [ %arg, %bb ], [ %tmp, %bb7 ]
%tmp5 = call i32 %arg2(i32 %tmp4, i32 %tmp)
%tmp6 = icmp ne i32 %tmp5, 0
br i1 %tmp6, label %bb7, label %bb8
bb7: ; preds = %bb3
br label %bb3
bb8: ; preds = %bb3
ret void
}