127 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_test_checks.py UTC_ARGS: --version 52; RUN: opt -passes=loop-distribute -enable-loop-distribute -verify-loop-info -verify-dom-info -S < %s \3; RUN: | FileCheck %s4 5; We should distribute this loop along === but not along ---. The last6; partition won't be vectorized due to conditional stores so it's better to7; keep it with the second partition which has a dependence cycle.8 9; (1st statement):10; for (i = 0; i < n; i++) {11; C[i] = D[i] * E[i];12;=============================13; A[i + 1] = A[i] * B[i];14;-----------------------------15; if (F[i])16; G[i] = H[i] * J[i];17; }18 19; Ensure that we have only two partitions, the first with one multiplication20; and the second with two.21define void @f(ptr noalias %a, ptr noalias %b, ptr noalias %c, ptr noalias %d, ptr noalias %e, ptr noalias %g, ptr noalias %h, ptr noalias %j, i64 %x) {22; CHECK-LABEL: define void @f(23; CHECK-SAME: ptr noalias [[A:%.*]], ptr noalias [[B:%.*]], ptr noalias [[C:%.*]], ptr noalias [[D:%.*]], ptr noalias [[E:%.*]], ptr noalias [[G:%.*]], ptr noalias [[H:%.*]], ptr noalias [[J:%.*]], i64 [[X:%.*]]) {24; CHECK-NEXT: [[ENTRY:.*:]]25; CHECK-NEXT: br label %[[ENTRY_SPLIT_LDIST1:.*]]26; CHECK: [[ENTRY_SPLIT_LDIST1]]:27; CHECK-NEXT: br label %[[FOR_BODY_LDIST1:.*]]28; CHECK: [[FOR_BODY_LDIST1]]:29; CHECK-NEXT: [[IND_LDIST1:%.*]] = phi i64 [ 0, %[[ENTRY_SPLIT_LDIST1]] ], [ [[ADD_LDIST1:%.*]], %[[IF_END_LDIST1:.*]] ]30; CHECK-NEXT: [[ARRAYIDXD_LDIST1:%.*]] = getelementptr inbounds i32, ptr [[D]], i64 [[IND_LDIST1]]31; CHECK-NEXT: [[LOADD_LDIST1:%.*]] = load i32, ptr [[ARRAYIDXD_LDIST1]], align 432; CHECK-NEXT: [[ARRAYIDXE_LDIST1:%.*]] = getelementptr inbounds i32, ptr [[E]], i64 [[IND_LDIST1]]33; CHECK-NEXT: [[LOADE_LDIST1:%.*]] = load i32, ptr [[ARRAYIDXE_LDIST1]], align 434; CHECK-NEXT: [[MULC_LDIST1:%.*]] = mul i32 [[LOADD_LDIST1]], [[LOADE_LDIST1]]35; CHECK-NEXT: [[ARRAYIDXC_LDIST1:%.*]] = getelementptr inbounds i32, ptr [[C]], i64 [[IND_LDIST1]]36; CHECK-NEXT: store i32 [[MULC_LDIST1]], ptr [[ARRAYIDXC_LDIST1]], align 437; CHECK-NEXT: [[ADD_LDIST1]] = add nuw nsw i64 [[IND_LDIST1]], 138; CHECK-NEXT: [[IF_COND_LDIST1:%.*]] = icmp eq i64 [[IND_LDIST1]], [[X]]39; CHECK-NEXT: br i1 [[IF_COND_LDIST1]], label %[[IF_THEN_LDIST1:.*]], label %[[IF_END_LDIST1]]40; CHECK: [[IF_THEN_LDIST1]]:41; CHECK-NEXT: br label %[[IF_END_LDIST1]]42; CHECK: [[IF_END_LDIST1]]:43; CHECK-NEXT: [[EXITCOND_LDIST1:%.*]] = icmp eq i64 [[ADD_LDIST1]], 2044; CHECK-NEXT: br i1 [[EXITCOND_LDIST1]], label %[[ENTRY_SPLIT:.*]], label %[[FOR_BODY_LDIST1]]45; CHECK: [[ENTRY_SPLIT]]:46; CHECK-NEXT: br label %[[FOR_BODY:.*]]47; CHECK: [[FOR_BODY]]:48; CHECK-NEXT: [[IND:%.*]] = phi i64 [ 0, %[[ENTRY_SPLIT]] ], [ [[ADD:%.*]], %[[IF_END:.*]] ]49; CHECK-NEXT: [[ARRAYIDXA:%.*]] = getelementptr inbounds i32, ptr [[A]], i64 [[IND]]50; CHECK-NEXT: [[LOADA:%.*]] = load i32, ptr [[ARRAYIDXA]], align 451; CHECK-NEXT: [[ARRAYIDXB:%.*]] = getelementptr inbounds i32, ptr [[B]], i64 [[IND]]52; CHECK-NEXT: [[LOADB:%.*]] = load i32, ptr [[ARRAYIDXB]], align 453; CHECK-NEXT: [[MULA:%.*]] = mul i32 [[LOADB]], [[LOADA]]54; CHECK-NEXT: [[ADD]] = add nuw nsw i64 [[IND]], 155; CHECK-NEXT: [[ARRAYIDXA_PLUS_4:%.*]] = getelementptr inbounds i32, ptr [[A]], i64 [[ADD]]56; CHECK-NEXT: store i32 [[MULA]], ptr [[ARRAYIDXA_PLUS_4]], align 457; CHECK-NEXT: [[IF_COND:%.*]] = icmp eq i64 [[IND]], [[X]]58; CHECK-NEXT: br i1 [[IF_COND]], label %[[IF_THEN:.*]], label %[[IF_END]]59; CHECK: [[IF_THEN]]:60; CHECK-NEXT: [[ARRAYIDXH:%.*]] = getelementptr inbounds i32, ptr [[H]], i64 [[IND]]61; CHECK-NEXT: [[LOADH:%.*]] = load i32, ptr [[ARRAYIDXH]], align 462; CHECK-NEXT: [[ARRAYIDXJ:%.*]] = getelementptr inbounds i32, ptr [[J]], i64 [[IND]]63; CHECK-NEXT: [[LOADJ:%.*]] = load i32, ptr [[ARRAYIDXJ]], align 464; CHECK-NEXT: [[MULG:%.*]] = mul i32 [[LOADH]], [[LOADJ]]65; CHECK-NEXT: [[ARRAYIDXG:%.*]] = getelementptr inbounds i32, ptr [[G]], i64 [[IND]]66; CHECK-NEXT: store i32 [[MULG]], ptr [[ARRAYIDXG]], align 467; CHECK-NEXT: br label %[[IF_END]]68; CHECK: [[IF_END]]:69; CHECK-NEXT: [[EXITCOND:%.*]] = icmp eq i64 [[ADD]], 2070; CHECK-NEXT: br i1 [[EXITCOND]], label %[[FOR_END:.*]], label %[[FOR_BODY]]71; CHECK: [[FOR_END]]:72; CHECK-NEXT: ret void73;74entry:75 br label %for.body76 77for.body: ; preds = %for.body, %entry78 %ind = phi i64 [ 0, %entry ], [ %add, %if.end ]79 80 %arrayidxD = getelementptr inbounds i32, ptr %d, i64 %ind81 %loadD = load i32, ptr %arrayidxD, align 482 83 %arrayidxE = getelementptr inbounds i32, ptr %e, i64 %ind84 %loadE = load i32, ptr %arrayidxE, align 485 86 %mulC = mul i32 %loadD, %loadE87 88 %arrayidxC = getelementptr inbounds i32, ptr %c, i64 %ind89 store i32 %mulC, ptr %arrayidxC, align 490 91 92 %arrayidxA = getelementptr inbounds i32, ptr %a, i64 %ind93 %loadA = load i32, ptr %arrayidxA, align 494 95 %arrayidxB = getelementptr inbounds i32, ptr %b, i64 %ind96 %loadB = load i32, ptr %arrayidxB, align 497 98 %mulA = mul i32 %loadB, %loadA99 100 %add = add nuw nsw i64 %ind, 1101 %arrayidxA_plus_4 = getelementptr inbounds i32, ptr %a, i64 %add102 store i32 %mulA, ptr %arrayidxA_plus_4, align 4103 104 %if.cond = icmp eq i64 %ind, %x105 br i1 %if.cond, label %if.then, label %if.end106 107if.then:108 %arrayidxH = getelementptr inbounds i32, ptr %h, i64 %ind109 %loadH = load i32, ptr %arrayidxH, align 4110 111 %arrayidxJ = getelementptr inbounds i32, ptr %j, i64 %ind112 %loadJ = load i32, ptr %arrayidxJ, align 4113 114 %mulG = mul i32 %loadH, %loadJ115 116 %arrayidxG = getelementptr inbounds i32, ptr %g, i64 %ind117 store i32 %mulG, ptr %arrayidxG, align 4118 br label %if.end119 120if.end:121 %exitcond = icmp eq i64 %add, 20122 br i1 %exitcond, label %for.end, label %for.body123 124for.end: ; preds = %for.body125 ret void126}127