Skip to content

Commit 891c8d5

Browse files
sebpopsebpop
committed
add back global decl test changes
1 parent 117c20c commit 891c8d5

File tree

10 files changed

+80
-40
lines changed

10 files changed

+80
-40
lines changed

‎llvm/test/Analysis/DependenceAnalysis/Coupled.ll‎

Lines changed: 20 additions & 18 deletions
Original file line numberDiff line numberDiff line change
@@ -5,12 +5,13 @@
55
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128"
66
target triple = "x86_64-apple-macosx10.6.0"
77

8+
@A.global = global [100 x [100 x i32]] zeroinitializer
89

910
;; for (long int i = 0; i < 50; i++) {
1011
;; A[i][i] = i;
1112
;; *B++ = A[i + 10][i + 9];
1213

13-
define void @couple0(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
14+
define void @couple0(ptr %B, i32 %n) nounwind uwtable ssp {
1415
; CHECK-LABEL: 'couple0'
1516
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx1, align 4 --> Dst: store i32 %conv, ptr %arrayidx1, align 4
1617
; CHECK-NEXT: da analyze - none!
@@ -26,6 +27,7 @@ define void @couple0(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
2627
; CHECK-NEXT: da analyze - none!
2728
;
2829
entry:
30+
%A = getelementptr inbounds [100 x [100 x i32]], ptr @A.global, i32 0, i32 0
2931
br label %for.body
3032

3133
for.body: ; preds = %entry, %for.body
@@ -495,16 +497,15 @@ for.end: ; preds = %for.body
495497

496498

497499
;; for (long int i = 0; i <= 15; i++) {
498-
;; A[3*i - 18][18 - i] = i;
500+
;; A[3*i + 18][18 - i] = i;
499501
;; *B++ = A[i][i];
500502

501-
define void @couple11(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
503+
define void @couple11(ptr %B, i32 %n) nounwind uwtable ssp {
502504
; CHECK-LABEL: 'couple11'
503505
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx2, align 4 --> Dst: store i32 %conv, ptr %arrayidx2, align 4
504506
; CHECK-NEXT: da analyze - none!
505507
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx2, align 4 --> Dst: %0 = load i32, ptr %arrayidx4, align 4
506-
; CHECK-NEXT: da analyze - flow [0|<] splitable!
507-
; CHECK-NEXT: da analyze - split level = 1, iteration = 9!
508+
; CHECK-NEXT: da analyze - none!
508509
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx2, align 4 --> Dst: store i32 %0, ptr %B.addr.01, align 4
509510
; CHECK-NEXT: da analyze - confused!
510511
; CHECK-NEXT: Src: %0 = load i32, ptr %arrayidx4, align 4 --> Dst: %0 = load i32, ptr %arrayidx4, align 4
@@ -515,6 +516,7 @@ define void @couple11(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
515516
; CHECK-NEXT: da analyze - none!
516517
;
517518
entry:
519+
%A = getelementptr inbounds [100 x [100 x i32]], ptr @A.global, i32 0, i32 0
518520
br label %for.body
519521

520522
for.body: ; preds = %entry, %for.body
@@ -523,7 +525,7 @@ for.body: ; preds = %entry, %for.body
523525
%conv = trunc i64 %i.02 to i32
524526
%sub = sub nsw i64 18, %i.02
525527
%mul = mul nsw i64 %i.02, 3
526-
%sub1 = add nsw i64 %mul, -18
528+
%sub1 = add nsw i64 %mul, 18
527529
%arrayidx2 = getelementptr inbounds [100 x i32], ptr %A, i64 %sub1, i64 %sub
528530
store i32 %conv, ptr %arrayidx2, align 4
529531
%arrayidx4 = getelementptr inbounds [100 x i32], ptr %A, i64 %i.02, i64 %i.02
@@ -540,16 +542,15 @@ for.end: ; preds = %for.body
540542

541543

542544
;; for (long int i = 0; i <= 12; i++) {
543-
;; A[3*i - 18][22 - i] = i;
545+
;; A[3*i + 18][22 - i] = i;
544546
;; *B++ = A[i][i];
545547

546-
define void @couple12(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
548+
define void @couple12(ptr %B, i32 %n) nounwind uwtable ssp {
547549
; CHECK-LABEL: 'couple12'
548550
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx2, align 4 --> Dst: store i32 %conv, ptr %arrayidx2, align 4
549551
; CHECK-NEXT: da analyze - none!
550552
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx2, align 4 --> Dst: %0 = load i32, ptr %arrayidx4, align 4
551-
; CHECK-NEXT: da analyze - flow [<] splitable!
552-
; CHECK-NEXT: da analyze - split level = 1, iteration = 11!
553+
; CHECK-NEXT: da analyze - none!
553554
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx2, align 4 --> Dst: store i32 %0, ptr %B.addr.01, align 4
554555
; CHECK-NEXT: da analyze - confused!
555556
; CHECK-NEXT: Src: %0 = load i32, ptr %arrayidx4, align 4 --> Dst: %0 = load i32, ptr %arrayidx4, align 4
@@ -560,6 +561,7 @@ define void @couple12(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
560561
; CHECK-NEXT: da analyze - none!
561562
;
562563
entry:
564+
%A = getelementptr inbounds [100 x [100 x i32]], ptr @A.global, i32 0, i32 0
563565
br label %for.body
564566

565567
for.body: ; preds = %entry, %for.body
@@ -568,7 +570,7 @@ for.body: ; preds = %entry, %for.body
568570
%conv = trunc i64 %i.02 to i32
569571
%sub = sub nsw i64 22, %i.02
570572
%mul = mul nsw i64 %i.02, 3
571-
%sub1 = add nsw i64 %mul, -18
573+
%sub1 = add nsw i64 %mul, 18
572574
%arrayidx2 = getelementptr inbounds [100 x i32], ptr %A, i64 %sub1, i64 %sub
573575
store i32 %conv, ptr %arrayidx2, align 4
574576
%arrayidx4 = getelementptr inbounds [100 x i32], ptr %A, i64 %i.02, i64 %i.02
@@ -585,7 +587,7 @@ for.end: ; preds = %for.body
585587

586588

587589
;; for (long int i = 0; i < 12; i++) {
588-
;; A[3*i - 18][22 - i] = i;
590+
;; A[3*i + 18][22 - i] = i;
589591
;; *B++ = A[i][i];
590592

591593
define void @couple13(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
@@ -612,7 +614,7 @@ for.body: ; preds = %entry, %for.body
612614
%conv = trunc i64 %i.02 to i32
613615
%sub = sub nsw i64 22, %i.02
614616
%mul = mul nsw i64 %i.02, 3
615-
%sub1 = add nsw i64 %mul, -18
617+
%sub1 = add nsw i64 %mul, 18
616618
%arrayidx2 = getelementptr inbounds [100 x i32], ptr %A, i64 %sub1, i64 %sub
617619
store i32 %conv, ptr %arrayidx2, align 4
618620
%arrayidx4 = getelementptr inbounds [100 x i32], ptr %A, i64 %i.02, i64 %i.02
@@ -628,15 +630,15 @@ for.end: ; preds = %for.body
628630
}
629631

630632
;; for (long int i = 0; i < 100; i++) {
631-
;; A[3*i - 18][18 - i][i] = i;
633+
;; A[3*i + 18][18 - i][i] = i;
632634
;; *B++ = A[i][i][i];
633635

634636
define void @couple14(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
635637
; CHECK-LABEL: 'couple14'
636638
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx3, align 4 --> Dst: store i32 %conv, ptr %arrayidx3, align 4
637639
; CHECK-NEXT: da analyze - none!
638640
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx3, align 4 --> Dst: %0 = load i32, ptr %arrayidx6, align 4
639-
; CHECK-NEXT: da analyze - flow [0|<]!
641+
; CHECK-NEXT: da analyze - none!
640642
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx3, align 4 --> Dst: store i32 %0, ptr %B.addr.01, align 4
641643
; CHECK-NEXT: da analyze - confused!
642644
; CHECK-NEXT: Src: %0 = load i32, ptr %arrayidx6, align 4 --> Dst: %0 = load i32, ptr %arrayidx6, align 4
@@ -655,7 +657,7 @@ for.body: ; preds = %entry, %for.body
655657
%conv = trunc i64 %i.02 to i32
656658
%sub = sub nsw i64 18, %i.02
657659
%mul = mul nsw i64 %i.02, 3
658-
%sub1 = add nsw i64 %mul, -18
660+
%sub1 = add nsw i64 %mul, 18
659661
%arrayidx3 = getelementptr inbounds [100 x [100 x i32]], ptr %A, i64 %sub1, i64 %sub, i64 %i.02
660662
store i32 %conv, ptr %arrayidx3, align 4
661663
%arrayidx6 = getelementptr inbounds [100 x [100 x i32]], ptr %A, i64 %i.02, i64 %i.02, i64 %i.02
@@ -672,7 +674,7 @@ for.end: ; preds = %for.body
672674

673675

674676
;; for (long int i = 0; i < 100; i++) {
675-
;; A[3*i - 18][22 - i][i] = i;
677+
;; A[3*i + 18][22 - i][i] = i;
676678
;; *B++ = A[i][i][i];
677679

678680
define void @couple15(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
@@ -699,7 +701,7 @@ for.body: ; preds = %entry, %for.body
699701
%conv = trunc i64 %i.02 to i32
700702
%sub = sub nsw i64 22, %i.02
701703
%mul = mul nsw i64 %i.02, 3
702-
%sub1 = add nsw i64 %mul, -18
704+
%sub1 = add nsw i64 %mul, 18
703705
%arrayidx3 = getelementptr inbounds [100 x [100 x i32]], ptr %A, i64 %sub1, i64 %sub, i64 %i.02
704706
store i32 %conv, ptr %arrayidx3, align 4
705707
%arrayidx6 = getelementptr inbounds [100 x [100 x i32]], ptr %A, i64 %i.02, i64 %i.02, i64 %i.02

‎llvm/test/Analysis/DependenceAnalysis/DADelin.ll‎

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -139,17 +139,17 @@ for.cond.cleanup: ; preds = %for.cond.cleanup3,
139139

140140
;; for (int i = 0; i < n; i++)
141141
;; for (int j = 0; j < m; j++)
142-
;; for (int k = 0; k < o; k++)
142+
;; for (int k = 1; k < o; k++)
143143
;; = A[i*m*o + j*o + k]
144144
;; A[i*m*o + j*o + k - 1] =
145145
define void @t3(i32 %n, i32 %m, i32 %o, ptr nocapture %A) {
146146
; CHECK-LABEL: 't3'
147147
; CHECK-NEXT: Src: %0 = load i32, ptr %arrayidx, align 4 --> Dst: %0 = load i32, ptr %arrayidx, align 4
148148
; CHECK-NEXT: da analyze - none!
149149
; CHECK-NEXT: Src: %0 = load i32, ptr %arrayidx, align 4 --> Dst: store i32 %add12, ptr %arrayidx2, align 4
150-
; CHECK-NEXT: da analyze - anti [* * *|<]!
150+
; CHECK-NEXT: da analyze - consistent anti [0 0 1]!
151151
; CHECK-NEXT: Src: store i32 %add12, ptr %arrayidx2, align 4 --> Dst: store i32 %add12, ptr %arrayidx2, align 4
152-
; CHECK-NEXT: da analyze - output [* * *]!
152+
; CHECK-NEXT: da analyze - none!
153153
;
154154
entry:
155155
%cmp49 = icmp sgt i32 %n, 0
@@ -178,7 +178,7 @@ for.body8.lr.ph: ; preds = %for.cond5.preheader
178178
br label %for.body8
179179

180180
for.body8: ; preds = %for.body8, %for.body8.lr.ph
181-
%k.046 = phi i32 [ 0, %for.body8.lr.ph ], [ %inc, %for.body8 ]
181+
%k.046 = phi i32 [ 1, %for.body8.lr.ph ], [ %inc, %for.body8 ]
182182
%add11 = add nsw i32 %k.046, %add
183183
%arrayidx = getelementptr inbounds i32, ptr %A, i32 %add11
184184
%0 = load i32, ptr %arrayidx, align 4
@@ -275,7 +275,7 @@ for.cond.cleanup: ; preds = %for.cond.cleanup3,
275275
;; for (int j = 0; j < m; j++)
276276
;; for (int k = 0; k < o; k++)
277277
;; = A[i*m*o + j*o + k]
278-
;; A[i*m*o + j*o + k - o] =
278+
;; A[i*m*o + j*o + k + o] =
279279
define void @t5(i32 %n, i32 %m, i32 %o, ptr nocapture %A) {
280280
; CHECK-LABEL: 't5'
281281
; CHECK-NEXT: Src: %0 = load i32, ptr %arrayidx, align 4 --> Dst: %0 = load i32, ptr %arrayidx, align 4
@@ -317,7 +317,7 @@ for.body8: ; preds = %for.body8, %for.bod
317317
%arrayidx = getelementptr inbounds i32, ptr %A, i32 %add11
318318
%0 = load i32, ptr %arrayidx, align 4
319319
%add12 = add nsw i32 %0, 1
320-
%add111 = sub nsw i32 %add11, %o
320+
%add111 = add nsw i32 %add11, %o
321321
%arrayidx2 = getelementptr inbounds i32, ptr %A, i32 %add111
322322
store i32 %add12, ptr %arrayidx2, align 4
323323
%inc = add nuw nsw i32 %k.046, 1

‎llvm/test/Analysis/DependenceAnalysis/FlipFlopBaseAddress.ll‎

Lines changed: 4 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
; RUN: opt < %s -disable-output "-passes=print<da>" -aa-pipeline=basic-aa 2>&1 \
33
; RUN: | FileCheck %s
44

5+
@test_array_100x42x42 = global [100 x [42 x [42 x i32]]] zeroinitializer
6+
57
; Check that dependence analysis correctly handles flip-flop of base addresses.
68
; Bug 41488 - https://github.com/llvm/llvm-project/issues/41488
79

@@ -219,12 +221,13 @@ exit:
219221
; Same as the above case, there are loop-carried dependencies between the
220222
; store.
221223

222-
define void @non_invariant_baseptr_with_identical_obj2(ptr %A) {
224+
define void @non_invariant_baseptr_with_identical_obj2() {
223225
; CHECK-LABEL: 'non_invariant_baseptr_with_identical_obj2'
224226
; CHECK-NEXT: Src: store i32 1, ptr %idx, align 4 --> Dst: store i32 1, ptr %idx, align 4
225227
; CHECK-NEXT: da analyze - confused!
226228
;
227229
entry:
230+
%A = getelementptr inbounds [100 x [42 x [42 x i32]]], ptr @test_array_100x42x42, i32 0, i32 0
228231
br label %loop.i.header
229232

230233
loop.i.header:

‎llvm/test/Analysis/DependenceAnalysis/Invariant.ll‎

Lines changed: 4 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
; RUN: opt < %s -disable-output "-passes=print<da>" -aa-pipeline=basic-aa 2>&1 \
33
; RUN: | FileCheck %s
44

5+
@test_array_40x40 = global [40 x [40 x float]] zeroinitializer
6+
57
; Test for a bug, which caused an assert when an invalid
68
; SCEVAddRecExpr is created in addToCoefficient.
79

@@ -16,7 +18,7 @@
1618
; return res;
1719
; }
1820

19-
define float @foo(float %g, ptr %rr) nounwind {
21+
define float @foo(float %g) nounwind {
2022
; CHECK-LABEL: 'foo'
2123
; CHECK-NEXT: Src: %0 = load float, ptr %arrayidx4, align 4 --> Dst: %0 = load float, ptr %arrayidx4, align 4
2224
; CHECK-NEXT: da analyze - consistent input [S 0]!
@@ -26,6 +28,7 @@ define float @foo(float %g, ptr %rr) nounwind {
2628
; CHECK-NEXT: da analyze - none!
2729
;
2830
entry:
31+
%rr = getelementptr inbounds [40 x [40 x float]], ptr @test_array_40x40, i32 0, i32 0
2932
br label %for.cond1.preheader
3033

3134
for.cond1.preheader:

‎llvm/test/Analysis/DependenceAnalysis/PreliminaryNoValidityCheckFixedSize.ll‎

Lines changed: 4 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,6 +7,8 @@
77
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128"
88
target triple = "x86_64-apple-macosx10.6.0"
99

10+
@test_array_100x100x100 = global [100 x [100 x [100 x i64]]] zeroinitializer
11+
1012
;; for (long int i = 0; i < n; i++) {
1113
;; for (long int j = 0; j < n; j++) {
1214
;; for (long int k = 0; k < n; k++) {
@@ -15,7 +17,7 @@ target triple = "x86_64-apple-macosx10.6.0"
1517
;; for (long int k = 0; k < n; k++) {
1618
;; *B++ = A[i + 3][j + 2][k + 1];
1719

18-
define void @p2(i64 %n, ptr %A, ptr %B) nounwind uwtable ssp {
20+
define void @p2(i64 %n, ptr %B) nounwind uwtable ssp {
1921
; CHECK-LABEL: 'p2'
2022
; CHECK-NEXT: Src: store i64 %i.011, ptr %arrayidx8, align 8 --> Dst: store i64 %i.011, ptr %arrayidx8, align 8
2123
; CHECK-NEXT: da analyze - none!
@@ -45,6 +47,7 @@ define void @p2(i64 %n, ptr %A, ptr %B) nounwind uwtable ssp {
4547
; LIN-NEXT: da analyze - confused!
4648
;
4749
entry:
50+
%A = getelementptr inbounds [100 x [100 x [100 x i64]]], ptr @test_array_100x100x100, i32 0, i32 0
4851
%cmp10 = icmp sgt i64 %n, 0
4952
br i1 %cmp10, label %for.cond1.preheader.preheader, label %for.end26
5053

‎llvm/test/Analysis/DependenceAnalysis/Separability.ll‎

Lines changed: 10 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -5,6 +5,8 @@
55
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128"
66
target triple = "x86_64-apple-macosx10.6.0"
77

8+
@test_array_100x100x100 = global [100 x [100 x [100 x i32]]] zeroinitializer
9+
@test_array_100x100x100x100 = global [100 x [100 x [100 x [100 x i32]]]] zeroinitializer
810

911
;; for (long int i = 0; i < 50; i++)
1012
;; for (long int j = 0; j < 50; j++)
@@ -13,7 +15,7 @@ target triple = "x86_64-apple-macosx10.6.0"
1315
;; A[n][i][j + k] = i;
1416
;; *B++ = A[10][i + 10][2*j - l];
1517

16-
define void @sep0(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
18+
define void @sep0(ptr %B, i32 %n) nounwind uwtable ssp {
1719
; CHECK-LABEL: 'sep0'
1820
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx11, align 4 --> Dst: store i32 %conv, ptr %arrayidx11, align 4
1921
; CHECK-NEXT: da analyze - output [0 * * S]!
@@ -29,6 +31,7 @@ define void @sep0(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
2931
; CHECK-NEXT: da analyze - none!
3032
;
3133
entry:
34+
%A = getelementptr inbounds [100 x [100 x [100 x i32]]], ptr @test_array_100x100x100, i32 0, i32 0
3235
br label %for.cond1.preheader
3336

3437
for.cond1.preheader: ; preds = %entry, %for.inc22
@@ -95,7 +98,7 @@ for.end24: ; preds = %for.inc22
9598
;; A[i][i][j + k] = i;
9699
;; *B++ = A[10][i + 10][2*j - l];
97100

98-
define void @sep1(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
101+
define void @sep1(ptr %B, i32 %n) nounwind uwtable ssp {
99102
; CHECK-LABEL: 'sep1'
100103
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx11, align 4 --> Dst: store i32 %conv, ptr %arrayidx11, align 4
101104
; CHECK-NEXT: da analyze - output [0 * * S]!
@@ -111,6 +114,7 @@ define void @sep1(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
111114
; CHECK-NEXT: da analyze - none!
112115
;
113116
entry:
117+
%A = getelementptr inbounds [100 x [100 x [100 x i32]]], ptr @test_array_100x100x100, i32 0, i32 0
114118
br label %for.cond1.preheader
115119

116120
for.cond1.preheader: ; preds = %entry, %for.inc22
@@ -177,7 +181,7 @@ for.end24: ; preds = %for.inc22
177181
;; A[i][i][i + k][l] = i;
178182
;; *B++ = A[10][i + 10][j + k][l + 10];
179183

180-
define void @sep2(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
184+
define void @sep2(ptr %B, i32 %n) nounwind uwtable ssp {
181185
; CHECK-LABEL: 'sep2'
182186
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx12, align 4 --> Dst: store i32 %conv, ptr %arrayidx12, align 4
183187
; CHECK-NEXT: da analyze - consistent output [0 S 0 0]!
@@ -193,6 +197,7 @@ define void @sep2(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
193197
; CHECK-NEXT: da analyze - none!
194198
;
195199
entry:
200+
%A = getelementptr inbounds [100 x [100 x [100 x [100 x i32]]]], ptr @test_array_100x100x100x100, i32 0, i32 0
196201
br label %for.cond1.preheader
197202

198203
for.cond1.preheader: ; preds = %entry, %for.inc26
@@ -259,7 +264,7 @@ for.end28: ; preds = %for.inc26
259264
;; A[i][i][i + k][l + k] = i;
260265
;; *B++ = A[10][i + 10][j + k][l + 10];
261266

262-
define void @sep3(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
267+
define void @sep3(ptr %B, i32 %n) nounwind uwtable ssp {
263268
; CHECK-LABEL: 'sep3'
264269
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx13, align 4 --> Dst: store i32 %conv, ptr %arrayidx13, align 4
265270
; CHECK-NEXT: da analyze - consistent output [0 S 0 0]!
@@ -275,6 +280,7 @@ define void @sep3(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
275280
; CHECK-NEXT: da analyze - none!
276281
;
277282
entry:
283+
%A = getelementptr inbounds [100 x [100 x [100 x [100 x i32]]]], ptr @test_array_100x100x100x100, i32 0, i32 0
278284
br label %for.cond1.preheader
279285

280286
for.cond1.preheader: ; preds = %entry, %for.inc27

0 commit comments

Comments
 (0)