240 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 52; RUN: opt < %s -disable-output "-passes=print<da>" -aa-pipeline=basic-aa 2>&1 \3; RUN: | FileCheck %s4 5; The dependence test does not handle array accesses with difference between array accesses6; is not a multiple of the array element size.7 8; In this test, the element size is i32 = 4 bytes and the difference between the9; load and the store is 2 bytes.10 11define i32 @alias_with_different_offsets(ptr nocapture %A) {12; CHECK-LABEL: 'alias_with_different_offsets'13; CHECK-NEXT: Src: store i32 2, ptr %arrayidx, align 1 --> Dst: store i32 2, ptr %arrayidx, align 114; CHECK-NEXT: da analyze - confused!15; CHECK-NEXT: Src: store i32 2, ptr %arrayidx, align 1 --> Dst: %0 = load i32, ptr %A, align 116; CHECK-NEXT: da analyze - confused!17; CHECK-NEXT: Src: %0 = load i32, ptr %A, align 1 --> Dst: %0 = load i32, ptr %A, align 118; CHECK-NEXT: da analyze - none!19;20entry:21 %arrayidx = getelementptr inbounds i8, ptr %A, i64 222 store i32 2, ptr %arrayidx, align 123 %0 = load i32, ptr %A, align 124 ret i32 %025}26 27define i32 @alias_with_parametric_offset(ptr nocapture %A, i64 %n) {28; CHECK-LABEL: 'alias_with_parametric_offset'29; CHECK-NEXT: Src: store i32 2, ptr %arrayidx, align 1 --> Dst: store i32 2, ptr %arrayidx, align 130; CHECK-NEXT: da analyze - none!31; CHECK-NEXT: Src: store i32 2, ptr %arrayidx, align 1 --> Dst: %0 = load i32, ptr %A, align 132; CHECK-NEXT: da analyze - flow [|<]!33; CHECK-NEXT: Runtime Assumptions:34; CHECK-NEXT: Equal predicate: (zext i2 (trunc i64 %n to i2) to i64) == 035; CHECK-NEXT: Src: %0 = load i32, ptr %A, align 1 --> Dst: %0 = load i32, ptr %A, align 136; CHECK-NEXT: da analyze - none!37;38entry:39 %arrayidx = getelementptr inbounds i8, ptr %A, i64 %n40 store i32 2, ptr %arrayidx, align 141 %0 = load i32, ptr %A, align 142 ret i32 %043}44 45define i32 @alias_with_parametric_expr(ptr nocapture %A, i64 %n, i64 %m) {46; CHECK-LABEL: 'alias_with_parametric_expr'47; CHECK-NEXT: Src: store i32 2, ptr %arrayidx, align 1 --> Dst: store i32 2, ptr %arrayidx, align 148; CHECK-NEXT: da analyze - none!49; CHECK-NEXT: Src: store i32 2, ptr %arrayidx, align 1 --> Dst: %0 = load i32, ptr %arrayidx1, align 150; CHECK-NEXT: da analyze - flow [|<]!51; CHECK-NEXT: Runtime Assumptions:52; CHECK-NEXT: Equal predicate: (zext i2 ((trunc i64 %m to i2) + (-2 * (trunc i64 %n to i2))) to i64) == 053; CHECK-NEXT: Equal predicate: (zext i2 (-2 + (trunc i64 %m to i2)) to i64) == 054; CHECK-NEXT: Src: %0 = load i32, ptr %arrayidx1, align 1 --> Dst: %0 = load i32, ptr %arrayidx1, align 155; CHECK-NEXT: da analyze - none!56;57entry:58 %mul = mul nsw i64 %n, 1059 %add = add nsw i64 %mul, %m60 %arrayidx = getelementptr inbounds i8, ptr %A, i64 %add61 store i32 2, ptr %arrayidx, align 162 63 %add1 = add nsw i64 %m, 4264 %arrayidx1 = getelementptr inbounds i8, ptr %A, i64 %add165 %0 = load i32, ptr %arrayidx1, align 166 ret i32 %067}68 69define i32 @gep_i8_vs_i32(ptr nocapture %A, i64 %n, i64 %m) {70; CHECK-LABEL: 'gep_i8_vs_i32'71; CHECK-NEXT: Src: store i32 42, ptr %arrayidx0, align 1 --> Dst: store i32 42, ptr %arrayidx0, align 172; CHECK-NEXT: da analyze - none!73; CHECK-NEXT: Src: store i32 42, ptr %arrayidx0, align 1 --> Dst: store i32 42, ptr %arrayidx1, align 474; CHECK-NEXT: da analyze - output [|<]!75; CHECK-NEXT: Runtime Assumptions:76; CHECK-NEXT: Equal predicate: (zext i2 (trunc i64 %n to i2) to i64) == 077; CHECK-NEXT: Src: store i32 42, ptr %arrayidx1, align 4 --> Dst: store i32 42, ptr %arrayidx1, align 478; CHECK-NEXT: da analyze - none!79;80entry:81 %arrayidx0 = getelementptr inbounds i8, ptr %A, i64 %n82 store i32 42, ptr %arrayidx0, align 183 84 %arrayidx1 = getelementptr inbounds i32, ptr %A, i64 %m85 store i32 42, ptr %arrayidx1, align 486 ret i32 087}88 89define void @linearized_accesses(i64 %n, i64 %m, i64 %o, ptr %A) {90; CHECK-LABEL: 'linearized_accesses'91; CHECK-NEXT: Src: store i32 1, ptr %idx0, align 4 --> Dst: store i32 1, ptr %idx0, align 492; CHECK-NEXT: da analyze - output [* * *]!93; CHECK-NEXT: Src: store i32 1, ptr %idx0, align 4 --> Dst: store i32 1, ptr %idx1, align 494; CHECK-NEXT: da analyze - output [* * *|<]!95; CHECK-NEXT: Src: store i32 1, ptr %idx1, align 4 --> Dst: store i32 1, ptr %idx1, align 496; CHECK-NEXT: da analyze - none!97;98entry:99 br label %for.i100 101for.i:102 %i = phi i64 [ 0, %entry ], [ %i.inc, %for.i.inc ]103 br label %for.j104 105for.j:106 %j = phi i64 [ 0, %for.i ], [ %j.inc, %for.j.inc ]107 br label %for.k108 109for.k:110 %k = phi i64 [ 0, %for.j ], [ %k.inc, %for.k.inc ]111 %subscript0 = mul i64 %i, %m112 %subscript1 = add i64 %j, %subscript0113 %subscript2 = mul i64 %subscript1, %o114 %subscript3 = add i64 %subscript2, %k115 %idx0 = getelementptr inbounds i64, ptr %A, i64 %subscript3 ; (i64*)(A) + i*m*o + j*o + k116 store i32 1, ptr %idx0117 %idx1 = getelementptr inbounds i32, ptr %A, i64 %subscript3 ; (i32*)(A) + i*m*o + j*o + k118 store i32 1, ptr %idx1119 br label %for.k.inc120 121for.k.inc:122 %k.inc = add nsw i64 %k, 1123 %k.exitcond = icmp eq i64 %k.inc, %o124 br i1 %k.exitcond, label %for.j.inc, label %for.k125 126for.j.inc:127 %j.inc = add nsw i64 %j, 1128 %j.exitcond = icmp eq i64 %j.inc, %m129 br i1 %j.exitcond, label %for.i.inc, label %for.j130 131for.i.inc:132 %i.inc = add nsw i64 %i, 1133 %i.exitcond = icmp eq i64 %i.inc, %n134 br i1 %i.exitcond, label %end, label %for.i135 136end:137 ret void138}139 140define void @multidim_accesses(ptr %A) {141; CHECK-LABEL: 'multidim_accesses'142; CHECK-NEXT: Src: store i32 1, ptr %idx0, align 4 --> Dst: store i32 1, ptr %idx0, align 4143; CHECK-NEXT: da analyze - none!144; CHECK-NEXT: Src: store i32 1, ptr %idx0, align 4 --> Dst: store i32 1, ptr %idx1, align 4145; CHECK-NEXT: da analyze - output [<= * *|<]!146; CHECK-NEXT: Src: store i32 1, ptr %idx1, align 4 --> Dst: store i32 1, ptr %idx1, align 4147; CHECK-NEXT: da analyze - none!148;149; for (i = 0; i < 256; i++)150; for (j = 0; j < 256; j++)151; for (k = 0; k < 256; k++) {152; int *idx0 = (int *)((long long *)(A) + 256*256*i + 256*j + k);153; *idx0 = 1;154; int *idx1 = (int *)((int *)(A) + 256*256*i + 256*j + k);155; *idx1 = 1;156; }157entry:158 br label %for.i159 160for.i:161 %i = phi i64 [ 0, %entry ], [ %i.inc, %for.i.inc ]162 br label %for.j163 164for.j:165 %j = phi i64 [ 0, %for.i ], [ %j.inc, %for.j.inc ]166 br label %for.k167 168for.k:169 %k = phi i64 [ 0, %for.j ], [ %k.inc, %for.k.inc ]170 %idx0 = getelementptr inbounds [256 x [256 x [256 x i64]]], ptr %A, i64 0, i64 %i, i64 %j, i64 %k171 store i32 1, ptr %idx0172 %idx1 = getelementptr inbounds [256 x [256 x [256 x i32]]], ptr %A, i64 0, i64 %i, i64 %j, i64 %k173 store i32 1, ptr %idx1174 br label %for.k.inc175 176for.k.inc:177 %k.inc = add nsw i64 %k, 1178 %k.exitcond = icmp eq i64 %k.inc, 256179 br i1 %k.exitcond, label %for.j.inc, label %for.k180 181for.j.inc:182 %j.inc = add nsw i64 %j, 1183 %j.exitcond = icmp eq i64 %j.inc, 256184 br i1 %j.exitcond, label %for.i.inc, label %for.j185 186for.i.inc:187 %i.inc = add nsw i64 %i, 1188 %i.exitcond = icmp eq i64 %i.inc, 256189 br i1 %i.exitcond, label %end, label %for.i190 191end:192 ret void193}194 195; for (int i = 0; i < 256; i++)196; for (int j = 0; j < 256; j++)197; for (int k = 0; k < 256; k++) {198; int *idx = (int *)((int *)(A) + 256*256*i + 256*j + k);199; *((long long *)idx) = 1;200; }201;202; There are loop-carried dependencies across iterations in the store.203define void @multidim_accesses2(ptr %A) {204; CHECK-LABEL: 'multidim_accesses2'205; CHECK-NEXT: Src: store i64 1, ptr %idx, align 4 --> Dst: store i64 1, ptr %idx, align 4206; CHECK-NEXT: da analyze - confused!207;208entry:209 br label %for.i210 211for.i:212 %i = phi i64 [ 0, %entry ], [ %i.inc, %for.i.inc ]213 br label %for.j214 215for.j:216 %j = phi i64 [ 0, %for.i ], [ %j.inc, %for.j.inc ]217 br label %for.k218 219for.k:220 %k = phi i64 [ 0, %for.j ], [ %k.inc, %for.k ]221 %idx = getelementptr inbounds [256 x [256 x [256 x i32]]], ptr %A, i64 0, i64 %i, i64 %j, i64 %k222 store i64 1, ptr %idx223 %k.inc = add nsw i64 %k, 1224 %k.exitcond = icmp eq i64 %k.inc, 256225 br i1 %k.exitcond, label %for.j.inc, label %for.k226 227for.j.inc:228 %j.inc = add nsw i64 %j, 1229 %j.exitcond = icmp eq i64 %j.inc, 256230 br i1 %j.exitcond, label %for.i.inc, label %for.j231 232for.i.inc:233 %i.inc = add nsw i64 %i, 1234 %i.exitcond = icmp eq i64 %i.inc, 256235 br i1 %i.exitcond, label %end, label %for.i236 237end:238 ret void239}240