49 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 62; RUN: opt < %s -disable-output "-passes=print<da>" 2>&1 | FileCheck %s3 4; for (i = 0; i < 3; i++) {5; a[-k * i] = 1;6; a[-k * i + (2 * k + 1)] = 2;7; }8;9; When k = -1, dependency exists between the two stores. Accesses will be:10;11; - a[-k * i] : a[ 0], a[-1], a[-2]12; - a[-k * i + (2 * k + 1)] : a[-1], a[-2], a[-3]13;14; We cannot determine the sign of `k` and `2*k + 1` at compile time,15;16define void @unknown_sign(ptr %a, i64 %k) {17; CHECK-LABEL: 'unknown_sign'18; CHECK-NEXT: Src: store i8 1, ptr %idx.0, align 1 --> Dst: store i8 1, ptr %idx.0, align 119; CHECK-NEXT: da analyze - none!20; CHECK-NEXT: Src: store i8 1, ptr %idx.0, align 1 --> Dst: store i8 2, ptr %idx.1, align 121; CHECK-NEXT: da analyze - output [*|<]!22; CHECK-NEXT: Src: store i8 2, ptr %idx.1, align 1 --> Dst: store i8 2, ptr %idx.1, align 123; CHECK-NEXT: da analyze - none!24;25entry:26 %k.neg = sub nsw i64 0, %k27 %kk = mul nsw i64 %k, 228 %subscript.1.init = add i64 1, %kk29 br label %loop30 31loop:32 %i = phi i64 [ 0, %entry ], [ %i.next, %loop ]33 %subscript.0 = phi i64 [ 0, %entry ], [ %subscript.0.next, %loop ]34 %subscript.1 = phi i64 [ %subscript.1.init, %entry ], [ %subscript.1.next, %loop ]35 %idx.0 = getelementptr i8, ptr %a, i64 %subscript.036 %idx.1 = getelementptr i8, ptr %a, i64 %subscript.137 store i8 1, ptr %idx.038 store i8 2, ptr %idx.139 %i.next = add i64 %i, 140 %subscript.0.next = add nsw i64 %subscript.0, %k.neg41 %subscript.1.next = add nsw i64 %subscript.1, %k.neg42 %cond.exit = icmp eq i64 %i.next, 343 br i1 %cond.exit, label %exit, label %loop44 45exit:46 ret void47}48 49