1 ; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
2 ; RUN: opt < %s -passes=loop-interchange -cache-line-size=64 -verify-dom-info -verify-loop-info -verify-scev -verify-loop-lcssa -loop-interchange-threshold=0 -S 2>&1 | FileCheck %s
3 ;; Checks the order of the inner phi nodes does not cause havoc.
4 ;; The inner loop has a reduction into c. The IV is not the first phi.
6 target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-a:0:32-n32-S64"
10 ; Function Attrs: norecurse nounwind
11 define void @test(i32 %T, ptr noalias nocapture %C, ptr noalias nocapture readonly %A, ptr noalias nocapture readonly %B) local_unnamed_addr #0 {
14 ; CHECK-NEXT: br label [[FOR3_PREHEADER:%.*]]
15 ; CHECK: for1.header.preheader:
16 ; CHECK-NEXT: br label [[FOR1_HEADER:%.*]]
18 ; CHECK-NEXT: [[I:%.*]] = phi i32 [ [[INC20:%.*]], [[FOR1_INC19:%.*]] ], [ 0, [[FOR1_HEADER_PREHEADER:%.*]] ]
19 ; CHECK-NEXT: [[MUL:%.*]] = mul nsw i32 [[I]], 90
20 ; CHECK-NEXT: br label [[FOR2_HEADER_PREHEADER:%.*]]
21 ; CHECK: for2.header.preheader:
22 ; CHECK-NEXT: br label [[FOR2_HEADER:%.*]]
24 ; CHECK-NEXT: [[J:%.*]] = phi i32 [ [[INC17:%.*]], [[FOR2_INC16:%.*]] ], [ 0, [[FOR2_HEADER_PREHEADER]] ]
25 ; CHECK-NEXT: br label [[FOR3_SPLIT1:%.*]]
26 ; CHECK: for3.preheader:
27 ; CHECK-NEXT: br label [[FOR3:%.*]]
29 ; CHECK-NEXT: [[K:%.*]] = phi i32 [ [[TMP1:%.*]], [[FOR3_SPLIT:%.*]] ], [ 1, [[FOR3_PREHEADER]] ]
30 ; CHECK-NEXT: br label [[FOR1_HEADER_PREHEADER]]
32 ; CHECK-NEXT: [[ADD:%.*]] = add nsw i32 [[K]], [[MUL]]
33 ; CHECK-NEXT: [[ARRAYIDX:%.*]] = getelementptr inbounds [90 x [90 x i16]], ptr [[A:%.*]], i32 [[ADD]], i32 [[I]], i32 [[J]]
34 ; CHECK-NEXT: [[TMP0:%.*]] = load i16, ptr [[ARRAYIDX]], align 2
35 ; CHECK-NEXT: [[ADD15:%.*]] = add nsw i16 [[TMP0]], 1
36 ; CHECK-NEXT: store i16 [[ADD15]], ptr [[ARRAYIDX]]
37 ; CHECK-NEXT: [[INC:%.*]] = add nuw nsw i32 [[K]], 1
38 ; CHECK-NEXT: [[EXITCOND:%.*]] = icmp eq i32 [[INC]], 90
39 ; CHECK-NEXT: br label [[FOR2_INC16]]
41 ; CHECK-NEXT: [[TMP1]] = add nuw nsw i32 [[K]], 1
42 ; CHECK-NEXT: [[TMP2:%.*]] = icmp eq i32 [[TMP1]], 90
43 ; CHECK-NEXT: br i1 [[TMP2]], label [[FOR1_LOOPEXIT:%.*]], label [[FOR3]]
45 ; CHECK-NEXT: [[INC17]] = add nuw nsw i32 [[J]], 1
46 ; CHECK-NEXT: [[EXITCOND47:%.*]] = icmp eq i32 [[INC17]], 90
47 ; CHECK-NEXT: br i1 [[EXITCOND47]], label [[FOR1_INC19]], label [[FOR2_HEADER]]
49 ; CHECK-NEXT: [[INC20]] = add nuw nsw i32 [[I]], 1
50 ; CHECK-NEXT: [[EXITCOND48:%.*]] = icmp eq i32 [[INC20]], 90
51 ; CHECK-NEXT: br i1 [[EXITCOND48]], label [[FOR3_SPLIT]], label [[FOR1_HEADER]]
52 ; CHECK: for1.loopexit:
53 ; CHECK-NEXT: br label [[EXIT:%.*]]
55 ; CHECK-NEXT: ret void
60 for1.header: ; preds = %entry
61 %i = phi i32 [ %inc20, %for1.inc19 ], [ 0, %entry ]
62 %mul = mul nsw i32 %i, 90
65 for2.header: ; preds = %for2.inc16, %for1.header
66 %j = phi i32 [ 0, %for1.header ], [ %inc17, %for2.inc16 ]
69 for3: ; preds = %for3, %for2.header
70 %k = phi i32 [ 1, %for2.header ], [ %inc, %for3 ]
71 %add = add nsw i32 %k, %mul
72 %arrayidx = getelementptr inbounds [90 x [90 x i16]], ptr %A, i32 %add, i32 %i, i32 %j
73 %0 = load i16, ptr %arrayidx, align 2
74 %add15 = add nsw i16 %0, 1
75 store i16 %add15, ptr %arrayidx
76 %inc = add nuw nsw i32 %k, 1
77 %exitcond = icmp eq i32 %inc, 90
78 br i1 %exitcond, label %for2.inc16, label %for3
80 for2.inc16: ; preds = %for.body6
81 %inc17 = add nuw nsw i32 %j, 1
82 %exitcond47 = icmp eq i32 %inc17, 90
83 br i1 %exitcond47, label %for1.inc19, label %for2.header
85 for1.inc19: ; preds = %for2.inc16
86 %inc20 = add nuw nsw i32 %i, 1
87 %exitcond48 = icmp eq i32 %inc20, 90
88 br i1 %exitcond48, label %for1.loopexit, label %for1.header
90 for1.loopexit: ; preds = %for1.inc19
93 exit: ; preds = %for1.loopexit