35 lines · plain
1; Test that the reduction dependences are always initialised, even in a case2; where we have no reduction. If this object is NULL, then isl operations on3; it will fail.4; RUN: opt -S %loadNPMPolly '-passes=polly-custom<deps>' -polly-print-deps -disable-output < %s | FileCheck %s -check-prefix=VALUE5target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64"6 7; for(i = 0; i < 100; i++ )8; S1: A[i] = 2;9 10define void @sequential_writes() {11entry:12 %A = alloca [200 x i32]13 br label %S114 15S1:16 %indvar.1 = phi i64 [ 0, %entry ], [ %indvar.next.1, %S1 ]17 %arrayidx.1 = getelementptr [200 x i32], ptr %A, i64 0, i64 %indvar.118 store i32 2, ptr %arrayidx.119 %indvar.next.1 = add i64 %indvar.1, 120 %exitcond.1 = icmp ne i64 %indvar.next.1, 10021 br i1 %exitcond.1, label %S1, label %exit.122 23exit.1:24 ret void25}26 27; VALUE: RAW dependences:28; VALUE-NEXT: { }29; VALUE-NEXT: WAR dependences:30; VALUE-NEXT: { }31; VALUE-NEXT: WAW dependences:32; VALUE-NEXT: { }33; VALUE-NEXT: Reduction dependences:34; VALUE-NEXT: { }35