1; NOTE: Assertions have been autogenerated by utils/update_test_checks.py UTC_ARGS: --version 5 2; RUN: opt -passes=loop-distribute -enable-loop-distribute -verify-loop-info -verify-dom-info -S < %s | FileCheck %s 3 4; If we can't find the bounds for one of the arrays in order to generate the 5; memchecks (e.g., C[i * i] below), loop shold not get distributed. 6; 7; for (i = 0; i < n; i++) { 8; A[i + 1] = A[i] * 3; 9; ------------------------------- 10; C[i * i] = B[i] * 2; 11; } 12 13; Verify that we didn't distribute by checking that we still have the original 14; number of branches. 15 16@A = common global ptr null, align 8 17@B = common global ptr null, align 8 18@C = common global ptr null, align 8 19 20define void @f() { 21; CHECK-LABEL: define void @f() { 22; CHECK-NEXT: [[ENTRY:.*]]: 23; CHECK-NEXT: [[A:%.*]] = load ptr, ptr @A, align 8 24; CHECK-NEXT: [[B:%.*]] = load ptr, ptr @B, align 8 25; CHECK-NEXT: [[C:%.*]] = load ptr, ptr @C, align 8 26; CHECK-NEXT: br label %[[FOR_BODY:.*]] 27; CHECK: [[FOR_BODY]]: 28; CHECK-NEXT: [[IND:%.*]] = phi i64 [ 0, %[[ENTRY]] ], [ [[ADD:%.*]], %[[FOR_BODY]] ] 29; CHECK-NEXT: [[ARRAYIDXA:%.*]] = getelementptr inbounds i32, ptr [[A]], i64 [[IND]] 30; CHECK-NEXT: [[LOADA:%.*]] = load i32, ptr [[ARRAYIDXA]], align 4 31; CHECK-NEXT: [[MULA:%.*]] = mul i32 [[LOADA]], 3 32; CHECK-NEXT: [[ADD]] = add nuw nsw i64 [[IND]], 1 33; CHECK-NEXT: [[ARRAYIDXA_PLUS_4:%.*]] = getelementptr inbounds i32, ptr [[A]], i64 [[ADD]] 34; CHECK-NEXT: store i32 [[MULA]], ptr [[ARRAYIDXA_PLUS_4]], align 4 35; CHECK-NEXT: [[ARRAYIDXB:%.*]] = getelementptr inbounds i32, ptr [[B]], i64 [[IND]] 36; CHECK-NEXT: [[LOADB:%.*]] = load i32, ptr [[ARRAYIDXB]], align 4 37; CHECK-NEXT: [[MULC:%.*]] = mul i32 [[LOADB]], 2 38; CHECK-NEXT: [[IND_2:%.*]] = mul i64 [[IND]], [[IND]] 39; CHECK-NEXT: [[ARRAYIDXC:%.*]] = getelementptr inbounds i32, ptr [[C]], i64 [[IND_2]] 40; CHECK-NEXT: store i32 [[MULC]], ptr [[ARRAYIDXC]], align 4 41; CHECK-NEXT: [[EXITCOND:%.*]] = icmp eq i64 [[ADD]], 20 42; CHECK-NEXT: br i1 [[EXITCOND]], label %[[FOR_END:.*]], label %[[FOR_BODY]] 43; CHECK: [[FOR_END]]: 44; CHECK-NEXT: ret void 45; 46entry: 47 %a = load ptr, ptr @A, align 8 48 %b = load ptr, ptr @B, align 8 49 %c = load ptr, ptr @C, align 8 50 br label %for.body 51 52for.body: ; preds = %for.body, %entry 53 %ind = phi i64 [ 0, %entry ], [ %add, %for.body ] 54 55 %arrayidxA = getelementptr inbounds i32, ptr %a, i64 %ind 56 %loadA = load i32, ptr %arrayidxA, align 4 57 58 %mulA = mul i32 %loadA, 3 59 60 %add = add nuw nsw i64 %ind, 1 61 %arrayidxA_plus_4 = getelementptr inbounds i32, ptr %a, i64 %add 62 store i32 %mulA, ptr %arrayidxA_plus_4, align 4 63 64 %arrayidxB = getelementptr inbounds i32, ptr %b, i64 %ind 65 %loadB = load i32, ptr %arrayidxB, align 4 66 67 %mulC = mul i32 %loadB, 2 68 69 %ind_2 = mul i64 %ind, %ind 70 %arrayidxC = getelementptr inbounds i32, ptr %c, i64 %ind_2 71 store i32 %mulC, ptr %arrayidxC, align 4 72 73 %exitcond = icmp eq i64 %add, 20 74 br i1 %exitcond, label %for.end, label %for.body 75 76for.end: ; preds = %for.body 77 ret void 78} 79