103 lines · plain
1; RUN: opt %loadNPMPolly -aa-pipeline=basic-aa -polly-invariant-load-hoisting=true '-passes=polly-custom<scops>' -polly-print-scops -disable-output < %s 2>&1 | FileCheck %s2 3; void f(long A[], int N, int *init_ptr) {4; long i, j;5;6; for (i = 0; i < N; ++i) {7; init = *init_ptr;8; for (i = 0; i < N; ++i) {9; A[i] = init + 2;10; }11; }12; }13 14; CHECK-LABEL: Function: f15;16; CHECK: Statements {17; CHECK-NEXT: Stmt_for_j18; CHECK-NEXT: Domain :=19; CHECK-NEXT: [N] -> { Stmt_for_j[i0, i1] : 0 <= i0 < N and 0 <= i1 < N };20; CHECK-NEXT: Schedule :=21; CHECK-NEXT: [N] -> { Stmt_for_j[i0, i1] -> [i0, i1] };22; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 1]23; CHECK-NEXT: [N] -> { Stmt_for_j[i0, i1] -> MemRef_init[] };24; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]25; CHECK-NEXT: [N] -> { Stmt_for_j[i0, i1] -> MemRef_A[i1] };26; CHECK-NEXT: }27;28; CHECK-LABEL: Function: g29;30; CHECK: Statements {31; CHECK-NEXT: Stmt_for_j32; CHECK-NEXT: Domain :=33; CHECK-NEXT: [N] -> { Stmt_for_j[i0, i1] : 0 <= i0 < N and 0 <= i1 < N };34; CHECK-NEXT: Schedule :=35; CHECK-NEXT: [N] -> { Stmt_for_j[i0, i1] -> [i0, i1] };36; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]37; CHECK-NEXT: [N] -> { Stmt_for_j[i0, i1] -> MemRef_A[i1] };38; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 1]39; CHECK-NEXT: [N] -> { Stmt_for_j[i0, i1] -> MemRef_init[] };40; CHECK-NEXT: }41 42target 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"43 44 45define void @f(ptr noalias %A, i64 %N, ptr noalias %init_ptr) nounwind {46entry:47 br label %for.i48 49for.i:50 %indvar.i = phi i64 [ 0, %entry ], [ %indvar.i.next, %for.i.end ]51 %indvar.i.next = add nsw i64 %indvar.i, 152 br label %entry.next53 54entry.next:55 %init = load i64, ptr %init_ptr56 br label %for.j57 58for.j:59 %indvar.j = phi i64 [ 0, %entry.next ], [ %indvar.j.next, %for.j ]60 %init_plus_two = add i64 %init, 261 %scevgep = getelementptr i64, ptr %A, i64 %indvar.j62 store i64 %init_plus_two, ptr %scevgep63 %indvar.j.next = add nsw i64 %indvar.j, 164 %exitcond.j = icmp eq i64 %indvar.j.next, %N65 br i1 %exitcond.j, label %for.i.end, label %for.j66 67for.i.end:68 %exitcond.i = icmp eq i64 %indvar.i.next, %N69 br i1 %exitcond.i, label %return, label %for.i70 71return:72 ret void73}74 75define void @g(ptr noalias %A, i64 %N, ptr noalias %init_ptr) nounwind {76entry:77 br label %for.i78 79for.i:80 %indvar.i = phi i64 [ 0, %entry ], [ %indvar.i.next, %for.i.end ]81 %indvar.i.next = add nsw i64 %indvar.i, 182 br label %entry.next83 84entry.next:85 %init = load i64, ptr %init_ptr86 br label %for.j87 88for.j:89 %indvar.j = phi i64 [ 0, %entry.next ], [ %indvar.j.next, %for.j ]90 %scevgep = getelementptr i64, ptr %A, i64 %indvar.j91 store i64 %init, ptr %scevgep92 %indvar.j.next = add nsw i64 %indvar.j, 193 %exitcond.j = icmp eq i64 %indvar.j.next, %N94 br i1 %exitcond.j, label %for.i.end, label %for.j95 96for.i.end:97 %exitcond.i = icmp eq i64 %indvar.i.next, %N98 br i1 %exitcond.i, label %return, label %for.i99 100return:101 ret void102}103