; RUN: opt %loadPolly -polly-scops -polly-invariant-load-hoisting=true -analyze < %s | FileCheck %s ; ; Verify that we only have one parameter and one invariant load for all ; three loads that occure in the region but actually access the same ; location. Also check that the execution context is the most generic ; one, e.g., here the universal set. ; ; CHECK: Invariant Accesses: { ; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 0] ; CHECK-NEXT: [bounds0l0, p] -> { Stmt_for_cond_4[i0, i1, i2] -> MemRef_bounds[0] }; ; CHECK-NEXT: Execution Context: [bounds0l0, p] -> { : } ; CHECK-NEXT: } ; ; CHECK: p0: %bounds0l0 ; CHECK-NEXT: p1: %p ; CHECK-NOT: p2 ; ; CHECK: Statements { ; CHECK-NEXT: Stmt_for_body_6 ; CHECK-NEXT: Domain := ; CHECK-NEXT: [bounds0l0, p] -> { Stmt_for_body_6[i0, i1, i2] : p = 0 and 0 <= i0 < bounds0l0 and 0 <= i1 < bounds0l0 and 0 <= i2 < bounds0l0 }; ; CHECK-NEXT: Schedule := ; CHECK-NEXT: [bounds0l0, p] -> { Stmt_for_body_6[i0, i1, i2] -> [i0, i1, i2] }; ; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 0] ; CHECK-NEXT: [bounds0l0, p] -> { Stmt_for_body_6[i0, i1, i2] -> MemRef_data[i0, i1, i2] }; ; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0] ; CHECK-NEXT: [bounds0l0, p] -> { Stmt_for_body_6[i0, i1, i2] -> MemRef_data[i0, i1, i2] }; ; CHECK-NEXT: } ; ; int bounds[1]; ; double data[1024][1024][1024]; ; ; void foo(int p) { ; int i, j, k; ; for (k = 0; k < bounds[0]; k++) ; if (p == 0) ; for (j = 0; j < bounds[0]; j++) ; for (i = 0; i < bounds[0]; i++) ; data[k][j][i] += i + j + k; ; } ; target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128" @bounds = common global [1 x i32] zeroinitializer, align 4 @data = common global [1024 x [1024 x [1024 x double]]] zeroinitializer, align 16 define void @foo(i32 %p) { entry: br label %for.cond for.cond: ; preds = %for.inc.16, %entry %indvars.iv5 = phi i64 [ %indvars.iv.next6, %for.inc.16 ], [ 0, %entry ] %bounds0l0 = load i32, i32* getelementptr inbounds ([1 x i32], [1 x i32]* @bounds, i64 0, i64 0), align 4 %tmp7 = sext i32 %bounds0l0 to i64 %cmp = icmp slt i64 %indvars.iv5, %tmp7 br i1 %cmp, label %for.body, label %for.end.18 for.body: ; preds = %for.cond %cmpp = icmp eq i32 %p, 0 br i1 %cmpp, label %for.cond.1, label %for.inc.16 for.cond.1: ; preds = %for.inc.13, %for.body %indvars.iv3 = phi i64 [ %indvars.iv.next4, %for.inc.13 ], [ 0, %for.body ] %bounds0l1 = load i32, i32* getelementptr inbounds ([1 x i32], [1 x i32]* @bounds, i64 0, i64 0), align 4 %tmp9 = sext i32 %bounds0l1 to i64 %cmp2 = icmp slt i64 %indvars.iv3, %tmp9 br i1 %cmp2, label %for.body.3, label %for.end.15 for.body.3: ; preds = %for.cond.1 br label %for.cond.4 for.cond.4: ; preds = %for.inc, %for.body.3 %indvars.iv = phi i64 [ %indvars.iv.next, %for.inc ], [ 0, %for.body.3 ] %bounds0l2 = load i32, i32* getelementptr inbounds ([1 x i32], [1 x i32]* @bounds, i64 0, i64 0), align 4 %tmp11 = sext i32 %bounds0l2 to i64 %cmp5 = icmp slt i64 %indvars.iv, %tmp11 br i1 %cmp5, label %for.body.6, label %for.end for.body.6: ; preds = %for.cond.4 %tmp12 = add nsw i64 %indvars.iv, %indvars.iv3 %tmp13 = add nsw i64 %tmp12, %indvars.iv5 %tmp14 = trunc i64 %tmp13 to i32 %conv = sitofp i32 %tmp14 to double %arrayidx11 = getelementptr inbounds [1024 x [1024 x [1024 x double]]], [1024 x [1024 x [1024 x double]]]* @data, i64 0, i64 %indvars.iv5, i64 %indvars.iv3, i64 %indvars.iv %tmp15 = load double, double* %arrayidx11, align 8 %add12 = fadd double %tmp15, %conv store double %add12, double* %arrayidx11, align 8 br label %for.inc for.inc: ; preds = %for.body.6 %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1 br label %for.cond.4 for.end: ; preds = %for.cond.4 br label %for.inc.13 for.inc.13: ; preds = %for.end %indvars.iv.next4 = add nuw nsw i64 %indvars.iv3, 1 br label %for.cond.1 for.end.15: ; preds = %for.cond.1 br label %for.inc.16 for.inc.16: ; preds = %for.end.15 %indvars.iv.next6 = add nuw nsw i64 %indvars.iv5, 1 br label %for.cond for.end.18: ; preds = %for.cond ret void }