1; RUN: opt %loadPolly -polly-detect -analyze -S < %s | FileCheck %s 2; 3; Region with an exit node that has a PHI node multiple incoming edges from 4; inside the region. Motivation for supporting such cases in Polly. 5; 6; float test(long n, float A[static const restrict n]) { 7; float sum = 0; 8; for (long i = 0; i < n; i += 1) 9; sum += A[i]; 10; for (long i = 0; i < n; i += 1) 11; sum += A[i]; 12; return sum; 13; } 14; 15; 16 17target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128" 18 19define float @test(i64 %n, float* noalias nonnull %A) { 20entry: 21 br label %for.cond 22 23for.cond: ; preds = %for.inc, %entry 24 %sum.0 = phi float [ 0.000000e+00, %entry ], [ %add, %for.inc ] 25 %i.0 = phi i64 [ 0, %entry ], [ %add1, %for.inc ] 26 %cmp = icmp slt i64 %i.0, %n 27 br i1 %cmp, label %for.body, label %for.end 28 29for.body: ; preds = %for.cond 30 br label %for.inc 31 32for.inc: ; preds = %for.body 33 %arrayidx = getelementptr inbounds float, float* %A, i64 %i.0 34 %tmp = load float, float* %arrayidx, align 4 35 %add = fadd float %sum.0, %tmp 36 %add1 = add nuw nsw i64 %i.0, 1 37 br label %for.cond 38 39for.end: ; preds = %for.cond 40 %sum.0.lcssa = phi float [ %sum.0, %for.cond ] 41 br label %for.cond.3 42 43for.cond.3: ; preds = %for.inc.8, %for.end 44 %sum.1 = phi float [ %sum.0.lcssa, %for.end ], [ %add7, %for.inc.8 ] 45 %i2.0 = phi i64 [ 0, %for.end ], [ %add9, %for.inc.8 ] 46 %cmp4 = icmp slt i64 %i2.0, %n 47 br i1 %cmp4, label %for.body.5, label %for.end.10 48 49for.body.5: ; preds = %for.cond.3 50 br label %for.inc.8 51 52for.inc.8: ; preds = %for.body.5 53 %arrayidx6 = getelementptr inbounds float, float* %A, i64 %i2.0 54 %tmp1 = load float, float* %arrayidx6, align 4 55 %add7 = fadd float %sum.1, %tmp1 56 %add9 = add nuw nsw i64 %i2.0, 1 57 br label %for.cond.3 58 59for.end.10: ; preds = %for.cond.3 60 %sum.1.lcssa = phi float [ %sum.1, %for.cond.3 ] 61 ret float %sum.1.lcssa 62} 63 64; CHECK: Valid Region for Scop: for.cond => for.end.10 65