1; RUN: opt %loadPolly -polly-optree-normalize-phi=true -polly-optree -analyze < %s | FileCheck %s -match-full-lines 2; 3; Contains a self-referencing PHINode that would require a 4; transitive closure to handle. 5; 6; for (int j = 0; j < n; j += 1) { 7; double phi = 0.0; 8; for (int i = 0; i < m; i += 1) 9; phi = phi; 10; A[j] = phi; 11; } 12; 13define void @func(i32 %n, i32 %m, double* noalias nonnull %A) { 14entry: 15 br label %for 16 17for: 18 %j = phi i32 [0, %entry], [%j.inc, %inc] 19 %j.cmp = icmp slt i32 %j, %n 20 br i1 %j.cmp, label %for.preheader, label %exit 21 22 for.preheader: 23 br label %for.inner 24 25 for.inner: 26 %i = phi i32 [0, %for.preheader], [%i.inc, %for.inner] 27 %phi = phi double [0.0, %for.preheader], [%phi, %for.inner] 28 %i.inc = add nuw nsw i32 %i, 1 29 %i.cmp = icmp slt i32 %i.inc, %m 30 br i1 %i.cmp, label %for.inner, label %for.exit 31 32 for.exit: 33 %A_idx = getelementptr inbounds double, double* %A, i32 %j 34 store double %phi, double* %A_idx 35 br label %inc 36 37inc: 38 %j.inc = add nuw nsw i32 %j, 1 39 br label %for 40 41exit: 42 br label %return 43 44return: 45 ret void 46} 47 48 49; CHECK: ForwardOpTree executed, but did not modify anything 50