1; RUN: opt < %s -disable-output "-passes=print<ddg>" 2>&1 | FileCheck %s
2
3; CHECK-LABEL: 'DDG' for loop 'test1.for.body':
4
5; CHECK: Node Address:[[ROOT:0x[0-9a-f]*]]:root
6; CHECK-NEXT: Edges:
7; CHECK-NEXT:  [rooted] to [[N1:0x[0-9a-f]*]]
8; CHECK-NEXT:  [rooted] to [[N2:0x[0-9a-f]*]]
9
10; CHECK: Node Address:[[N1]]:pi-block
11; CHECK: %i2.03 = phi i64 [ 0, %for.body.lr.ph ], [ %inc2, %test1.for.body ]
12
13; CHECK: Node Address:[[N2]]:pi-block
14; CHECK: %i1.02 = phi i64 [ 0, %for.body.lr.ph ], [ %inc, %test1.for.body ]
15
16
17;; // Two separate components in the graph. Root node must link to both.
18;; void test1(unsigned long n, float * restrict a, float * restrict b) {
19;;   for (unsigned long i1 = 0, i2 = 0; i1 < n; i1++, i2++) {
20;;     a[i1] = 1;
21;;     b[i2] = -1;
22;;   }
23;; }
24
25define void @test1(i64 %n, float* noalias %a, float* noalias %b) {
26entry:
27  %cmp1 = icmp ult i64 0, %n
28  br i1 %cmp1, label %for.body.lr.ph, label %for.end
29
30for.body.lr.ph:                                   ; preds = %entry
31  br label %test1.for.body
32
33test1.for.body:                                         ; preds = %for.body.lr.ph, %test1.for.body
34  %i2.03 = phi i64 [ 0, %for.body.lr.ph ], [ %inc2, %test1.for.body ]
35  %i1.02 = phi i64 [ 0, %for.body.lr.ph ], [ %inc, %test1.for.body ]
36  %arrayidx = getelementptr inbounds float, float* %a, i64 %i1.02
37  store float 1.000000e+00, float* %arrayidx, align 4
38  %arrayidx1 = getelementptr inbounds float, float* %b, i64 %i2.03
39  store float -1.000000e+00, float* %arrayidx1, align 4
40  %inc = add i64 %i1.02, 1
41  %inc2 = add i64 %i2.03, 1
42  %cmp = icmp ult i64 %inc, %n
43  br i1 %cmp, label %test1.for.body, label %for.cond.for.end_crit_edge
44
45for.cond.for.end_crit_edge:                       ; preds = %test1.for.body
46  br label %for.end
47
48for.end:                                          ; preds = %for.cond.for.end_crit_edge, %entry
49  ret void
50}
51