96 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_test_checks.py2; 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 %s3;; 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.5 6target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-a:0:32-n32-S64"7 8 9 10; Function Attrs: norecurse nounwind11define void @test(i32 %T, ptr noalias nocapture %C, ptr noalias nocapture readonly %A, ptr noalias nocapture readonly %B) local_unnamed_addr #0 {12; CHECK-LABEL: @test(13; CHECK-NEXT: entry:14; CHECK-NEXT: br label [[FOR3_PREHEADER:%.*]]15; CHECK: for1.header.preheader:16; CHECK-NEXT: br label [[FOR1_HEADER:%.*]]17; CHECK: for1.header:18; CHECK-NEXT: [[I:%.*]] = phi i32 [ [[INC20:%.*]], [[FOR1_INC19:%.*]] ], [ 0, [[FOR1_HEADER_PREHEADER:%.*]] ]19; CHECK-NEXT: [[MUL:%.*]] = mul nsw i32 [[I]], 9020; CHECK-NEXT: br label [[FOR2_HEADER_PREHEADER:%.*]]21; CHECK: for2.header.preheader:22; CHECK-NEXT: br label [[FOR2_HEADER:%.*]]23; CHECK: 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:%.*]]28; CHECK: for3:29; CHECK-NEXT: [[K:%.*]] = phi i32 [ [[TMP1:%.*]], [[FOR3_SPLIT:%.*]] ], [ 1, [[FOR3_PREHEADER]] ]30; CHECK-NEXT: br label [[FOR1_HEADER_PREHEADER]]31; CHECK: for3.split1: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 235; CHECK-NEXT: [[ADD15:%.*]] = add nsw i16 [[TMP0]], 136; CHECK-NEXT: store i16 [[ADD15]], ptr [[ARRAYIDX]]37; CHECK-NEXT: [[INC:%.*]] = add nuw nsw i32 [[K]], 138; CHECK-NEXT: [[EXITCOND:%.*]] = icmp eq i32 [[INC]], 9039; CHECK-NEXT: br label [[FOR2_INC16]]40; CHECK: for3.split:41; CHECK-NEXT: [[TMP1]] = add nuw nsw i32 [[K]], 142; CHECK-NEXT: [[TMP2:%.*]] = icmp eq i32 [[TMP1]], 9043; CHECK-NEXT: br i1 [[TMP2]], label [[FOR1_LOOPEXIT:%.*]], label [[FOR3]]44; CHECK: for2.inc16:45; CHECK-NEXT: [[INC17]] = add nuw nsw i32 [[J]], 146; CHECK-NEXT: [[EXITCOND47:%.*]] = icmp eq i32 [[INC17]], 9047; CHECK-NEXT: br i1 [[EXITCOND47]], label [[FOR1_INC19]], label [[FOR2_HEADER]]48; CHECK: for1.inc19:49; CHECK-NEXT: [[INC20]] = add nuw nsw i32 [[I]], 150; CHECK-NEXT: [[EXITCOND48:%.*]] = icmp eq i32 [[INC20]], 9051; CHECK-NEXT: br i1 [[EXITCOND48]], label [[FOR3_SPLIT]], label [[FOR1_HEADER]]52; CHECK: for1.loopexit:53; CHECK-NEXT: br label [[EXIT:%.*]]54; CHECK: exit:55; CHECK-NEXT: ret void56;57entry:58 br label %for1.header59 60for1.header: ; preds = %entry61 %i = phi i32 [ %inc20, %for1.inc19 ], [ 0, %entry ]62 %mul = mul nsw i32 %i, 9063 br label %for2.header64 65for2.header: ; preds = %for2.inc16, %for1.header66 %j = phi i32 [ 0, %for1.header ], [ %inc17, %for2.inc16 ]67 br label %for368 69for3: ; preds = %for3, %for2.header70 %k = phi i32 [ 1, %for2.header ], [ %inc, %for3 ]71 %add = add nsw i32 %k, %mul72 %arrayidx = getelementptr inbounds [90 x [90 x i16]], ptr %A, i32 %add, i32 %i, i32 %j73 %0 = load i16, ptr %arrayidx, align 274 %add15 = add nsw i16 %0, 175 store i16 %add15, ptr %arrayidx76 %inc = add nuw nsw i32 %k, 177 %exitcond = icmp eq i32 %inc, 9078 br i1 %exitcond, label %for2.inc16, label %for379 80for2.inc16: ; preds = %for.body681 %inc17 = add nuw nsw i32 %j, 182 %exitcond47 = icmp eq i32 %inc17, 9083 br i1 %exitcond47, label %for1.inc19, label %for2.header84 85for1.inc19: ; preds = %for2.inc1686 %inc20 = add nuw nsw i32 %i, 187 %exitcond48 = icmp eq i32 %inc20, 9088 br i1 %exitcond48, label %for1.loopexit, label %for1.header89 90for1.loopexit: ; preds = %for1.inc1991 br label %exit92 93exit: ; preds = %for1.loopexit94 ret void95}96