Skip to content

Commit 117c20c

Browse files
committed
split test changes
1 parent 0fd840e commit 117c20c

File tree

10 files changed

+40
-80
lines changed

10 files changed

+40
-80
lines changed

llvm/test/Analysis/DependenceAnalysis/Coupled.ll

Lines changed: 18 additions & 20 deletions
Original file line numberDiff line numberDiff line change
@@ -5,13 +5,12 @@
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
98

109
;; for (long int i = 0; i < 50; i++) {
1110
;; A[i][i] = i;
1211
;; *B++ = A[i + 10][i + 9];
1312

14-
define void @couple0(ptr %B, i32 %n) nounwind uwtable ssp {
13+
define void @couple0(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
1514
; CHECK-LABEL: 'couple0'
1615
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx1, align 4 --> Dst: store i32 %conv, ptr %arrayidx1, align 4
1716
; CHECK-NEXT: da analyze - none!
@@ -27,7 +26,6 @@ define void @couple0(ptr %B, i32 %n) nounwind uwtable ssp {
2726
; CHECK-NEXT: da analyze - none!
2827
;
2928
entry:
30-
%A = getelementptr inbounds [100 x [100 x i32]], ptr @A.global, i32 0, i32 0
3129
br label %for.body
3230

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

498496

499497
;; for (long int i = 0; i <= 15; i++) {
500-
;; A[3*i + 18][18 - i] = i;
498+
;; A[3*i - 18][18 - i] = i;
501499
;; *B++ = A[i][i];
502500

503-
define void @couple11(ptr %B, i32 %n) nounwind uwtable ssp {
501+
define void @couple11(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
504502
; CHECK-LABEL: 'couple11'
505503
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx2, align 4 --> Dst: store i32 %conv, ptr %arrayidx2, align 4
506504
; CHECK-NEXT: da analyze - none!
507505
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx2, align 4 --> Dst: %0 = load i32, ptr %arrayidx4, align 4
508-
; CHECK-NEXT: da analyze - none!
506+
; CHECK-NEXT: da analyze - flow [0|<] splitable!
507+
; CHECK-NEXT: da analyze - split level = 1, iteration = 9!
509508
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx2, align 4 --> Dst: store i32 %0, ptr %B.addr.01, align 4
510509
; CHECK-NEXT: da analyze - confused!
511510
; CHECK-NEXT: Src: %0 = load i32, ptr %arrayidx4, align 4 --> Dst: %0 = load i32, ptr %arrayidx4, align 4
@@ -516,7 +515,6 @@ define void @couple11(ptr %B, i32 %n) nounwind uwtable ssp {
516515
; CHECK-NEXT: da analyze - none!
517516
;
518517
entry:
519-
%A = getelementptr inbounds [100 x [100 x i32]], ptr @A.global, i32 0, i32 0
520518
br label %for.body
521519

522520
for.body: ; preds = %entry, %for.body
@@ -525,7 +523,7 @@ for.body: ; preds = %entry, %for.body
525523
%conv = trunc i64 %i.02 to i32
526524
%sub = sub nsw i64 18, %i.02
527525
%mul = mul nsw i64 %i.02, 3
528-
%sub1 = add nsw i64 %mul, 18
526+
%sub1 = add nsw i64 %mul, -18
529527
%arrayidx2 = getelementptr inbounds [100 x i32], ptr %A, i64 %sub1, i64 %sub
530528
store i32 %conv, ptr %arrayidx2, align 4
531529
%arrayidx4 = getelementptr inbounds [100 x i32], ptr %A, i64 %i.02, i64 %i.02
@@ -542,15 +540,16 @@ for.end: ; preds = %for.body
542540

543541

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

548-
define void @couple12(ptr %B, i32 %n) nounwind uwtable ssp {
546+
define void @couple12(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
549547
; CHECK-LABEL: 'couple12'
550548
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx2, align 4 --> Dst: store i32 %conv, ptr %arrayidx2, align 4
551549
; CHECK-NEXT: da analyze - none!
552550
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx2, align 4 --> Dst: %0 = load i32, ptr %arrayidx4, align 4
553-
; CHECK-NEXT: da analyze - none!
551+
; CHECK-NEXT: da analyze - flow [<] splitable!
552+
; CHECK-NEXT: da analyze - split level = 1, iteration = 11!
554553
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx2, align 4 --> Dst: store i32 %0, ptr %B.addr.01, align 4
555554
; CHECK-NEXT: da analyze - confused!
556555
; CHECK-NEXT: Src: %0 = load i32, ptr %arrayidx4, align 4 --> Dst: %0 = load i32, ptr %arrayidx4, align 4
@@ -561,7 +560,6 @@ define void @couple12(ptr %B, i32 %n) nounwind uwtable ssp {
561560
; CHECK-NEXT: da analyze - none!
562561
;
563562
entry:
564-
%A = getelementptr inbounds [100 x [100 x i32]], ptr @A.global, i32 0, i32 0
565563
br label %for.body
566564

567565
for.body: ; preds = %entry, %for.body
@@ -570,7 +568,7 @@ for.body: ; preds = %entry, %for.body
570568
%conv = trunc i64 %i.02 to i32
571569
%sub = sub nsw i64 22, %i.02
572570
%mul = mul nsw i64 %i.02, 3
573-
%sub1 = add nsw i64 %mul, 18
571+
%sub1 = add nsw i64 %mul, -18
574572
%arrayidx2 = getelementptr inbounds [100 x i32], ptr %A, i64 %sub1, i64 %sub
575573
store i32 %conv, ptr %arrayidx2, align 4
576574
%arrayidx4 = getelementptr inbounds [100 x i32], ptr %A, i64 %i.02, i64 %i.02
@@ -587,7 +585,7 @@ for.end: ; preds = %for.body
587585

588586

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

593591
define void @couple13(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
@@ -614,7 +612,7 @@ for.body: ; preds = %entry, %for.body
614612
%conv = trunc i64 %i.02 to i32
615613
%sub = sub nsw i64 22, %i.02
616614
%mul = mul nsw i64 %i.02, 3
617-
%sub1 = add nsw i64 %mul, 18
615+
%sub1 = add nsw i64 %mul, -18
618616
%arrayidx2 = getelementptr inbounds [100 x i32], ptr %A, i64 %sub1, i64 %sub
619617
store i32 %conv, ptr %arrayidx2, align 4
620618
%arrayidx4 = getelementptr inbounds [100 x i32], ptr %A, i64 %i.02, i64 %i.02
@@ -630,15 +628,15 @@ for.end: ; preds = %for.body
630628
}
631629

632630
;; for (long int i = 0; i < 100; i++) {
633-
;; A[3*i + 18][18 - i][i] = i;
631+
;; A[3*i - 18][18 - i][i] = i;
634632
;; *B++ = A[i][i][i];
635633

636634
define void @couple14(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
637635
; CHECK-LABEL: 'couple14'
638636
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx3, align 4 --> Dst: store i32 %conv, ptr %arrayidx3, align 4
639637
; CHECK-NEXT: da analyze - none!
640638
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx3, align 4 --> Dst: %0 = load i32, ptr %arrayidx6, align 4
641-
; CHECK-NEXT: da analyze - none!
639+
; CHECK-NEXT: da analyze - flow [0|<]!
642640
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx3, align 4 --> Dst: store i32 %0, ptr %B.addr.01, align 4
643641
; CHECK-NEXT: da analyze - confused!
644642
; CHECK-NEXT: Src: %0 = load i32, ptr %arrayidx6, align 4 --> Dst: %0 = load i32, ptr %arrayidx6, align 4
@@ -657,7 +655,7 @@ for.body: ; preds = %entry, %for.body
657655
%conv = trunc i64 %i.02 to i32
658656
%sub = sub nsw i64 18, %i.02
659657
%mul = mul nsw i64 %i.02, 3
660-
%sub1 = add nsw i64 %mul, 18
658+
%sub1 = add nsw i64 %mul, -18
661659
%arrayidx3 = getelementptr inbounds [100 x [100 x i32]], ptr %A, i64 %sub1, i64 %sub, i64 %i.02
662660
store i32 %conv, ptr %arrayidx3, align 4
663661
%arrayidx6 = getelementptr inbounds [100 x [100 x i32]], ptr %A, i64 %i.02, i64 %i.02, i64 %i.02
@@ -674,7 +672,7 @@ for.end: ; preds = %for.body
674672

675673

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

680678
define void @couple15(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
@@ -701,7 +699,7 @@ for.body: ; preds = %entry, %for.body
701699
%conv = trunc i64 %i.02 to i32
702700
%sub = sub nsw i64 22, %i.02
703701
%mul = mul nsw i64 %i.02, 3
704-
%sub1 = add nsw i64 %mul, 18
702+
%sub1 = add nsw i64 %mul, -18
705703
%arrayidx3 = getelementptr inbounds [100 x [100 x i32]], ptr %A, i64 %sub1, i64 %sub, i64 %i.02
706704
store i32 %conv, ptr %arrayidx3, align 4
707705
%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 = 1; k < o; k++)
142+
;; for (int k = 0; 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 - consistent anti [0 0 1]!
150+
; CHECK-NEXT: da analyze - anti [* * *|<]!
151151
; CHECK-NEXT: Src: store i32 %add12, ptr %arrayidx2, align 4 --> Dst: store i32 %add12, ptr %arrayidx2, align 4
152-
; CHECK-NEXT: da analyze - none!
152+
; CHECK-NEXT: da analyze - output [* * *]!
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 [ 1, %for.body8.lr.ph ], [ %inc, %for.body8 ]
181+
%k.046 = phi i32 [ 0, %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 = add nsw i32 %add11, %o
320+
%add111 = sub 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: 1 addition & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -2,8 +2,6 @@
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-
75
; Check that dependence analysis correctly handles flip-flop of base addresses.
86
; Bug 41488 - https://github.com/llvm/llvm-project/issues/41488
97

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

224-
define void @non_invariant_baseptr_with_identical_obj2() {
222+
define void @non_invariant_baseptr_with_identical_obj2(ptr %A) {
225223
; CHECK-LABEL: 'non_invariant_baseptr_with_identical_obj2'
226224
; CHECK-NEXT: Src: store i32 1, ptr %idx, align 4 --> Dst: store i32 1, ptr %idx, align 4
227225
; CHECK-NEXT: da analyze - confused!
228226
;
229227
entry:
230-
%A = getelementptr inbounds [100 x [42 x [42 x i32]]], ptr @test_array_100x42x42, i32 0, i32 0
231228
br label %loop.i.header
232229

233230
loop.i.header:

llvm/test/Analysis/DependenceAnalysis/Invariant.ll

Lines changed: 1 addition & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -2,8 +2,6 @@
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-
75
; Test for a bug, which caused an assert when an invalid
86
; SCEVAddRecExpr is created in addToCoefficient.
97

@@ -18,7 +16,7 @@
1816
; return res;
1917
; }
2018

21-
define float @foo(float %g) nounwind {
19+
define float @foo(float %g, ptr %rr) nounwind {
2220
; CHECK-LABEL: 'foo'
2321
; CHECK-NEXT: Src: %0 = load float, ptr %arrayidx4, align 4 --> Dst: %0 = load float, ptr %arrayidx4, align 4
2422
; CHECK-NEXT: da analyze - consistent input [S 0]!
@@ -28,7 +26,6 @@ define float @foo(float %g) nounwind {
2826
; CHECK-NEXT: da analyze - none!
2927
;
3028
entry:
31-
%rr = getelementptr inbounds [40 x [40 x float]], ptr @test_array_40x40, i32 0, i32 0
3229
br label %for.cond1.preheader
3330

3431
for.cond1.preheader:

llvm/test/Analysis/DependenceAnalysis/PreliminaryNoValidityCheckFixedSize.ll

Lines changed: 1 addition & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -7,8 +7,6 @@
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-
1210
;; for (long int i = 0; i < n; i++) {
1311
;; for (long int j = 0; j < n; j++) {
1412
;; for (long int k = 0; k < n; k++) {
@@ -17,7 +15,7 @@ target triple = "x86_64-apple-macosx10.6.0"
1715
;; for (long int k = 0; k < n; k++) {
1816
;; *B++ = A[i + 3][j + 2][k + 1];
1917

20-
define void @p2(i64 %n, ptr %B) nounwind uwtable ssp {
18+
define void @p2(i64 %n, ptr %A, ptr %B) nounwind uwtable ssp {
2119
; CHECK-LABEL: 'p2'
2220
; CHECK-NEXT: Src: store i64 %i.011, ptr %arrayidx8, align 8 --> Dst: store i64 %i.011, ptr %arrayidx8, align 8
2321
; CHECK-NEXT: da analyze - none!
@@ -47,7 +45,6 @@ define void @p2(i64 %n, ptr %B) nounwind uwtable ssp {
4745
; LIN-NEXT: da analyze - confused!
4846
;
4947
entry:
50-
%A = getelementptr inbounds [100 x [100 x [100 x i64]]], ptr @test_array_100x100x100, i32 0, i32 0
5148
%cmp10 = icmp sgt i64 %n, 0
5249
br i1 %cmp10, label %for.cond1.preheader.preheader, label %for.end26
5350

llvm/test/Analysis/DependenceAnalysis/Separability.ll

Lines changed: 4 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -5,8 +5,6 @@
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
108

119
;; for (long int i = 0; i < 50; i++)
1210
;; for (long int j = 0; j < 50; j++)
@@ -15,7 +13,7 @@ target triple = "x86_64-apple-macosx10.6.0"
1513
;; A[n][i][j + k] = i;
1614
;; *B++ = A[10][i + 10][2*j - l];
1715

18-
define void @sep0(ptr %B, i32 %n) nounwind uwtable ssp {
16+
define void @sep0(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
1917
; CHECK-LABEL: 'sep0'
2018
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx11, align 4 --> Dst: store i32 %conv, ptr %arrayidx11, align 4
2119
; CHECK-NEXT: da analyze - output [0 * * S]!
@@ -31,7 +29,6 @@ define void @sep0(ptr %B, i32 %n) nounwind uwtable ssp {
3129
; CHECK-NEXT: da analyze - none!
3230
;
3331
entry:
34-
%A = getelementptr inbounds [100 x [100 x [100 x i32]]], ptr @test_array_100x100x100, i32 0, i32 0
3532
br label %for.cond1.preheader
3633

3734
for.cond1.preheader: ; preds = %entry, %for.inc22
@@ -98,7 +95,7 @@ for.end24: ; preds = %for.inc22
9895
;; A[i][i][j + k] = i;
9996
;; *B++ = A[10][i + 10][2*j - l];
10097

101-
define void @sep1(ptr %B, i32 %n) nounwind uwtable ssp {
98+
define void @sep1(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
10299
; CHECK-LABEL: 'sep1'
103100
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx11, align 4 --> Dst: store i32 %conv, ptr %arrayidx11, align 4
104101
; CHECK-NEXT: da analyze - output [0 * * S]!
@@ -114,7 +111,6 @@ define void @sep1(ptr %B, i32 %n) nounwind uwtable ssp {
114111
; CHECK-NEXT: da analyze - none!
115112
;
116113
entry:
117-
%A = getelementptr inbounds [100 x [100 x [100 x i32]]], ptr @test_array_100x100x100, i32 0, i32 0
118114
br label %for.cond1.preheader
119115

120116
for.cond1.preheader: ; preds = %entry, %for.inc22
@@ -181,7 +177,7 @@ for.end24: ; preds = %for.inc22
181177
;; A[i][i][i + k][l] = i;
182178
;; *B++ = A[10][i + 10][j + k][l + 10];
183179

184-
define void @sep2(ptr %B, i32 %n) nounwind uwtable ssp {
180+
define void @sep2(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
185181
; CHECK-LABEL: 'sep2'
186182
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx12, align 4 --> Dst: store i32 %conv, ptr %arrayidx12, align 4
187183
; CHECK-NEXT: da analyze - consistent output [0 S 0 0]!
@@ -197,7 +193,6 @@ define void @sep2(ptr %B, i32 %n) nounwind uwtable ssp {
197193
; CHECK-NEXT: da analyze - none!
198194
;
199195
entry:
200-
%A = getelementptr inbounds [100 x [100 x [100 x [100 x i32]]]], ptr @test_array_100x100x100x100, i32 0, i32 0
201196
br label %for.cond1.preheader
202197

203198
for.cond1.preheader: ; preds = %entry, %for.inc26
@@ -264,7 +259,7 @@ for.end28: ; preds = %for.inc26
264259
;; A[i][i][i + k][l + k] = i;
265260
;; *B++ = A[10][i + 10][j + k][l + 10];
266261

267-
define void @sep3(ptr %B, i32 %n) nounwind uwtable ssp {
262+
define void @sep3(ptr %A, ptr %B, i32 %n) nounwind uwtable ssp {
268263
; CHECK-LABEL: 'sep3'
269264
; CHECK-NEXT: Src: store i32 %conv, ptr %arrayidx13, align 4 --> Dst: store i32 %conv, ptr %arrayidx13, align 4
270265
; CHECK-NEXT: da analyze - consistent output [0 S 0 0]!
@@ -280,7 +275,6 @@ define void @sep3(ptr %B, i32 %n) nounwind uwtable ssp {
280275
; CHECK-NEXT: da analyze - none!
281276
;
282277
entry:
283-
%A = getelementptr inbounds [100 x [100 x [100 x [100 x i32]]]], ptr @test_array_100x100x100x100, i32 0, i32 0
284278
br label %for.cond1.preheader
285279

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

0 commit comments

Comments
 (0)