1 ; RUN: opt -loop-distribute -enable-loop-distribute -S -verify-loop-info -verify-dom-info < %s \
4 ; Distributing this loop to avoid the dependence cycle would require to
5 ; reorder S1 and S2 to form the two partitions: {S2} | {S1, S3}. The analysis
6 ; provided by LoopAccessAnalysis does not allow us to reorder memory
7 ; operations so make sure we bail on this loop.
9 ; for (i = 0; i < n; i++) {
11 ; S2: A[i + 1] = A[i] * B[i];
12 ; S3: C[i] = d * E[i];
15 target datalayout = "e-m:o-i64:64-f80:128-n8:16:32:64-S128"
16 target triple = "x86_64-apple-macosx10.10.0"
18 define void @f(i32* noalias %a,
27 ; CHECK: br label %for.body
29 ; CHECK: br i1 %exitcond, label %for.end, label %for.body
33 for.body: ; preds = %for.body, %entry
34 %ind = phi i64 [ 0, %entry ], [ %add, %for.body ]
36 %arrayidxA = getelementptr inbounds i32, i32* %a, i64 %ind
37 %loadA = load i32, i32* %arrayidxA, align 4
39 %arrayidxB = getelementptr inbounds i32, i32* %b, i64 %ind
40 %loadB = load i32, i32* %arrayidxB, align 4
42 %mulA = mul i32 %loadB, %loadA
44 %arrayidxD = getelementptr inbounds i32, i32* %d, i64 %ind
45 %loadD = load i32, i32* %arrayidxD, align 4
47 %add = add nuw nsw i64 %ind, 1
48 %arrayidxA_plus_4 = getelementptr inbounds i32, i32* %a, i64 %add
49 store i32 %mulA, i32* %arrayidxA_plus_4, align 4
51 %arrayidxC = getelementptr inbounds i32, i32* %c, i64 %ind
53 %arrayidxE = getelementptr inbounds i32, i32* %e, i64 %ind
54 %loadE = load i32, i32* %arrayidxE, align 4
56 %mulC = mul i32 %loadD, %loadE
58 store i32 %mulC, i32* %arrayidxC, align 4
60 %exitcond = icmp eq i64 %add, 20
61 br i1 %exitcond, label %for.end, label %for.body
63 for.end: ; preds = %for.body