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