1 ; RUN: opt -loop-accesses -analyze < %s | FileCheck %s 2 ; RUN: opt -passes='require<scalar-evolution>,require<aa>,loop(print-access-info)' -disable-output < %s 2>&1 | FileCheck %s 3 4 ; Analyze this loop: 5 ; for (i = 0; i < n; i++) 6 ; A[i + 4] = A[i] * 2; 7 8 ; CHECK: Memory dependences are safe with a maximum dependence distance of 8 bytes 9 10 target datalayout = "e-m:o-i64:64-f80:128-n8:16:32:64-S128" 11 target triple = "x86_64-apple-macosx10.10.0" 12 13 @A = common global i16* null, align 8 14 15 define void @f() { 16 entry: 17 %a = load i16*, i16** @A, align 8 18 br label %for.body 19 20 for.body: ; preds = %for.body, %entry 21 %ind = phi i64 [ 0, %entry ], [ %add, %for.body ] 22 23 %arrayidxA = getelementptr inbounds i16, i16* %a, i64 %ind 24 %loadA = load i16, i16* %arrayidxA, align 2 25 26 %mul = mul i16 %loadA, 2 27 28 %next = add nuw nsw i64 %ind, 4 29 %arrayidxA_next = getelementptr inbounds i16, i16* %a, i64 %next 30 store i16 %mul, i16* %arrayidxA_next, align 2 31 32 %add = add nuw nsw i64 %ind, 1 33 %exitcond = icmp eq i64 %add, 20 34 br i1 %exitcond, label %for.end, label %for.body 35 36 for.end: ; preds = %for.body 37 ret void 38 } 39
