brintos

brintos / llvm-project-archived public Read only

0
0
Text · 7.3 KiB · d3353dd Raw
144 lines · plain
1; RUN: opt %loadNPMPolly -polly-stmt-granularity=bb '-passes=polly-custom<scops>' -polly-print-scops -disable-output < %s 2>&1 | FileCheck %s2;3;    int jd(int *restrict A, int x, int N, int c) {4;      for (int i = 0; i < N; i++)5;        for (int j = 0; j < N; j++)6;          if (i < c)7;            x += A[i];8;      return x;9;    }10 11; CHECK:      Statements {12; CHECK-NEXT:     Stmt_for_cond13; CHECK-NEXT:         Domain :=14; CHECK-NEXT:             [N, c] -> { Stmt_for_cond[i0] : 0 <= i0 <= N; Stmt_for_cond[0] : N < 0 };15; CHECK-NEXT:         Schedule :=16; CHECK-NEXT:             [N, c] -> { Stmt_for_cond[i0] -> [i0, 0, 0, 0] : i0 <= N; Stmt_for_cond[0] -> [0, 0, 0, 0] : N < 0 };17; CHECK-NEXT:         ReadAccess :=    [Reduction Type: NONE] [Scalar: 1]18; CHECK-NEXT:             [N, c] -> { Stmt_for_cond[i0] -> MemRef_x_addr_0__phi[] };19; CHECK-NEXT:         MustWriteAccess :=    [Reduction Type: NONE] [Scalar: 0]20; CHECK-NEXT:             [N, c] -> { Stmt_for_cond[i0] -> MemRef_A[i0] };21; CHECK-NEXT:         MustWriteAccess :=    [Reduction Type: NONE] [Scalar: 1]22; CHECK-NEXT:             [N, c] -> { Stmt_for_cond[i0] -> MemRef_x_addr_0[] };23; CHECK-NEXT:     Stmt_for_body24; CHECK-NEXT:         Domain :=25; CHECK-NEXT:             [N, c] -> { Stmt_for_body[i0] : 0 <= i0 < N };26; CHECK-NEXT:         Schedule :=27; CHECK-NEXT:             [N, c] -> { Stmt_for_body[i0] -> [i0, 1, 0, 0] };28; CHECK-NEXT:         ReadAccess :=    [Reduction Type: NONE] [Scalar: 1]29; CHECK-NEXT:             [N, c] -> { Stmt_for_body[i0] -> MemRef_x_addr_0[] };30; CHECK-NEXT:         MustWriteAccess :=    [Reduction Type: NONE] [Scalar: 1]31; CHECK-NEXT:             [N, c] -> { Stmt_for_body[i0] -> MemRef_x_addr_1__phi[] };32; CHECK-NEXT:     Stmt_for_cond133; CHECK-NEXT:         Domain :=34; CHECK-NEXT:             [N, c] -> { Stmt_for_cond1[i0, i1] : 0 <= i0 < N and 0 <= i1 <= N };35; CHECK-NEXT:         Schedule :=36; CHECK-NEXT:             [N, c] -> { Stmt_for_cond1[i0, i1] -> [i0, 2, i1, 0] };37; CHECK-NEXT:         MustWriteAccess :=    [Reduction Type: NONE] [Scalar: 1]38; CHECK-NEXT:             [N, c] -> { Stmt_for_cond1[i0, i1] -> MemRef_x_addr_1[] };39; CHECK-NEXT:         ReadAccess :=    [Reduction Type: NONE] [Scalar: 1]40; CHECK-NEXT:             [N, c] -> { Stmt_for_cond1[i0, i1] -> MemRef_x_addr_1__phi[] };41; CHECK-NEXT:     Stmt_for_body342; CHECK-NEXT:         Domain :=43; CHECK-NEXT:             [N, c] -> { Stmt_for_body3[i0, i1] : 0 <= i0 < N and 0 <= i1 < N };44; CHECK-NEXT:         Schedule :=45; CHECK-NEXT:             [N, c] -> { Stmt_for_body3[i0, i1] -> [i0, 2, i1, 1] };46; CHECK-NEXT:         ReadAccess :=    [Reduction Type: NONE] [Scalar: 1]47; CHECK-NEXT:             [N, c] -> { Stmt_for_body3[i0, i1] -> MemRef_x_addr_1[] };48; CHECK-NEXT:         MustWriteAccess :=    [Reduction Type: NONE] [Scalar: 1]49; CHECK-NEXT:             [N, c] -> { Stmt_for_body3[i0, i1] -> MemRef_x_addr_2__phi[] };50; CHECK-NEXT:     Stmt_if_then51; CHECK-NEXT:         Domain :=52; CHECK-NEXT:             [N, c] -> { Stmt_if_then[i0, i1] : 0 <= i0 < c and i0 < N and 0 <= i1 < N };53; CHECK-NEXT:         Schedule :=54; CHECK-NEXT:             [N, c] -> { Stmt_if_then[i0, i1] -> [i0, 2, i1, 2] };55; CHECK-NEXT:         ReadAccess :=    [Reduction Type: NONE] [Scalar: 0]56; CHECK-NEXT:             [N, c] -> { Stmt_if_then[i0, i1] -> MemRef_A[i0] };57; CHECK-NEXT:         ReadAccess :=    [Reduction Type: NONE] [Scalar: 1]58; CHECK-NEXT:             [N, c] -> { Stmt_if_then[i0, i1] -> MemRef_x_addr_1[] };59; CHECK-NEXT:         MustWriteAccess :=    [Reduction Type: NONE] [Scalar: 1]60; CHECK-NEXT:             [N, c] -> { Stmt_if_then[i0, i1] -> MemRef_x_addr_2__phi[] };61; CHECK-NEXT:     Stmt_if_end62; CHECK-NEXT:         Domain :=63; CHECK-NEXT:             [N, c] -> { Stmt_if_end[i0, i1] : 0 <= i0 < N and 0 <= i1 < N };64; CHECK-NEXT:         Schedule :=65; CHECK-NEXT:             [N, c] -> { Stmt_if_end[i0, i1] -> [i0, 2, i1, 3] };66; CHECK-NEXT:         MustWriteAccess :=    [Reduction Type: NONE] [Scalar: 1]67; CHECK-NEXT:             [N, c] -> { Stmt_if_end[i0, i1] -> MemRef_x_addr_2[] };68; CHECK-NEXT:         ReadAccess :=    [Reduction Type: NONE] [Scalar: 1]69; CHECK-NEXT:             [N, c] -> { Stmt_if_end[i0, i1] -> MemRef_x_addr_2__phi[] };70; CHECK-NEXT:     Stmt_for_inc71; CHECK-NEXT:         Domain :=72; CHECK-NEXT:             [N, c] -> { Stmt_for_inc[i0, i1] : 0 <= i0 < N and 0 <= i1 < N };73; CHECK-NEXT:         Schedule :=74; CHECK-NEXT:             [N, c] -> { Stmt_for_inc[i0, i1] -> [i0, 2, i1, 4] };75; CHECK-NEXT:         ReadAccess :=    [Reduction Type: NONE] [Scalar: 1]76; CHECK-NEXT:             [N, c] -> { Stmt_for_inc[i0, i1] -> MemRef_x_addr_2[] };77; CHECK-NEXT:         MustWriteAccess :=    [Reduction Type: NONE] [Scalar: 1]78; CHECK-NEXT:             [N, c] -> { Stmt_for_inc[i0, i1] -> MemRef_x_addr_1__phi[] };79; CHECK-NEXT:     Stmt_for_inc580; CHECK-NEXT:         Domain :=81; CHECK-NEXT:             [N, c] -> { Stmt_for_inc5[i0] : 0 <= i0 < N };82; CHECK-NEXT:         Schedule :=83; CHECK-NEXT:             [N, c] -> { Stmt_for_inc5[i0] -> [i0, 3, 0, 0] };84; CHECK-NEXT:         ReadAccess :=    [Reduction Type: NONE] [Scalar: 1]85; CHECK-NEXT:             [N, c] -> { Stmt_for_inc5[i0] -> MemRef_x_addr_1[] };86; CHECK-NEXT:         MustWriteAccess :=    [Reduction Type: NONE] [Scalar: 1]87; CHECK-NEXT:             [N, c] -> { Stmt_for_inc5[i0] -> MemRef_x_addr_0__phi[] };88; CHECK-NEXT: }89 90target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"91 92define i32 @jd(ptr noalias %A, i32 %x, i32 %N, i32 %c) {93entry:94  %tmp = sext i32 %N to i6495  %tmp1 = sext i32 %c to i6496  br label %for.cond97 98for.cond:                                         ; preds = %for.inc5, %entry99  %indvars.iv = phi i64 [ %indvars.iv.next, %for.inc5 ], [ 0, %entry ]100  %x.addr.0 = phi i32 [ %x, %entry ], [ %x.addr.1, %for.inc5 ]101  %arrayidx2 = getelementptr inbounds i32, ptr %A, i64 %indvars.iv102  store i32 %x.addr.0, ptr %arrayidx2103  %cmp = icmp slt i64 %indvars.iv, %tmp104  br i1 %cmp, label %for.body, label %for.end7105 106for.body:                                         ; preds = %for.cond107  br label %for.cond1108 109for.cond1:                                        ; preds = %for.inc, %for.body110  %x.addr.1 = phi i32 [ %x.addr.0, %for.body ], [ %x.addr.2, %for.inc ]111  %j.0 = phi i32 [ 0, %for.body ], [ %inc, %for.inc ]112  %exitcond = icmp ne i32 %j.0, %N113  br i1 %exitcond, label %for.body3, label %for.end114 115for.body3:                                        ; preds = %for.cond1116  %cmp4 = icmp slt i64 %indvars.iv, %tmp1117  br i1 %cmp4, label %if.then, label %if.end118 119if.then:                                          ; preds = %for.body3120  %arrayidx = getelementptr inbounds i32, ptr %A, i64 %indvars.iv121  %tmp2 = load i32, ptr %arrayidx, align 4122  %add = add nsw i32 %x.addr.1, %tmp2123  br label %if.end124 125if.end:                                           ; preds = %if.then, %for.body3126  %x.addr.2 = phi i32 [ %add, %if.then ], [ %x.addr.1, %for.body3 ]127  br label %for.inc128 129for.inc:                                          ; preds = %if.end130  %inc = add nsw i32 %j.0, 1131  br label %for.cond1132 133for.end:                                          ; preds = %for.cond1134  br label %for.inc5135 136for.inc5:                                         ; preds = %for.end137  %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1138  br label %for.cond139 140for.end7:                                         ; preds = %for.cond141  ret i32 %x.addr.0142}143 144