1 ; RUN: opt %loadPolly -polly-print-optree -disable-output < %s | FileCheck %s -match-full-lines
3 ; Test support for (synthesizable) inducation variables.
5 ; for (int j = 0; j < n; j += 1) {
13 define void @func(i32 %n, ptr noalias nonnull %A) {
18 %j = phi i32 [0, %entry], [%j.inc, %inc]
19 %j.cmp = icmp slt i32 %j, %n
20 br i1 %j.cmp, label %bodyA, label %exit
23 %val = sitofp i32 %j to double
27 store double %val, ptr %A
31 %j.inc = add nuw nsw i32 %j, 1
43 ; CHECK: Instructions copied: 1
44 ; CHECK: Operand trees forwarded: 1
45 ; CHECK: Statements with forwarded operand trees: 1
48 ; CHECK: After statements {
49 ; CHECK-NEXT: Stmt_bodyA
50 ; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 1]
51 ; CHECK-NEXT: [n] -> { Stmt_bodyA[i0] -> MemRef_val[] };
52 ; CHECK-NEXT: Instructions {
53 ; CHECK-NEXT: %val = sitofp i32 %j to double
55 ; CHECK-NEXT: Stmt_bodyB
56 ; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
57 ; CHECK-NEXT: [n] -> { Stmt_bodyB[i0] -> MemRef_A[0] };
58 ; CHECK-NEXT: Instructions {
59 ; CHECK-NEXT: %val = sitofp i32 %j to double
60 ; CHECK-NEXT: store double %val, ptr %A, align 8