50 lines · plain
1; RUN: opt < %s -disable-output "-passes=print<ddg>" 2>&1 | FileCheck %s2 3; CHECK-LABEL: 'DDG' for loop 'test1.for.body':4 5; CHECK: Node Address:[[ROOT:0x[0-9a-f]*]]:root6; 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:[[N2]]:pi-block11; CHECK: %i1.02 = phi i64 [ 0, %for.body.lr.ph ], [ %inc, %test1.for.body ]12 13; CHECK: Node Address:[[N1]]:pi-block14; CHECK: %i2.03 = phi i64 [ 0, %for.body.lr.ph ], [ %inc2, %test1.for.body ]15 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++) {19;; a[i1] = 1;20;; b[i2] = -1;21;; }22;; }23 24define void @test1(i64 %n, ptr noalias %a, ptr noalias %b) {25entry:26 %cmp1 = icmp ult i64 0, %n27 br i1 %cmp1, label %for.body.lr.ph, label %for.end28 29for.body.lr.ph: ; preds = %entry30 br label %test1.for.body31 32test1.for.body: ; preds = %for.body.lr.ph, %test1.for.body33 %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.0236 store float 1.000000e+00, ptr %arrayidx, align 437 %arrayidx1 = getelementptr inbounds float, ptr %b, i64 %i2.0338 store float -1.000000e+00, ptr %arrayidx1, align 439 %inc = add i64 %i1.02, 140 %inc2 = add i64 %i2.03, 141 %cmp = icmp ult i64 %inc, %n42 br i1 %cmp, label %test1.for.body, label %for.cond.for.end_crit_edge43 44for.cond.for.end_crit_edge: ; preds = %test1.for.body45 br label %for.end46 47for.end: ; preds = %for.cond.for.end_crit_edge, %entry48 ret void49}50