brintos

brintos / llvm-project-archived public Read only

0
0
Text · 3.5 KiB · 5d6531f Raw
92 lines · plain
1; RUN: opt %loadNPMPolly -polly-stmt-granularity=bb -polly-delicm-partial-writes=true '-passes=polly-custom<delicm>' -polly-print-delicm -disable-output < %s | FileCheck -match-full-lines %s2;3;    void func(double *A) {4;      for (int j = 0; j < 2; j += 1) { /* outer */5;        double phi = 0.0;6;        for (int i = 0; i < 4; i += 1) /* reduction */7;          phi += 4.2;8;        A[j] = phi;9;      }10;    }11;12define void @func(ptr noalias nonnull %A) {13entry:14  br label %outer.for15 16outer.for:17  %j = phi i32 [0, %entry], [%j.inc, %outer.inc]18  %j.cmp = icmp slt i32 %j, 219  br i1 %j.cmp, label %reduction.for, label %outer.exit20 21 22    reduction.for:23      %i = phi i32 [0, %outer.for], [%i.inc, %reduction.inc]24      %phi = phi double [0.0, %outer.for], [%add, %reduction.inc]25      %i.cmp = icmp slt i32 %i, 426      br i1 %i.cmp, label %body, label %reduction.exit27 28 29 30        body:31          %add = fadd double %phi, 4.232          br label %reduction.inc33 34 35 36    reduction.inc:37      %i.inc = add nuw nsw i32 %i, 138      br label %reduction.for39 40    reduction.exit:41      %A_idx = getelementptr inbounds double, ptr %A, i32 %j42      store double %phi, ptr %A_idx43      br label %outer.inc44 45 46 47outer.inc:48  %j.inc = add nuw nsw i32 %j, 149  br label %outer.for50 51outer.exit:52  br label %return53 54return:55  ret void56}57 58 59; CHECK:      After accesses {60; CHECK-NEXT:     Stmt_outer_for61; CHECK-NEXT:             MustWriteAccess :=  [Reduction Type: NONE] [Scalar: 1]62; CHECK-NEXT:                 { Stmt_outer_for[i0] -> MemRef_phi__phi[] };63; CHECK-NEXT:            new: { Stmt_outer_for[i0] -> MemRef_A[i0] : i0 <= 1 };64; CHECK-NEXT:     Stmt_reduction_for65; CHECK-NEXT:             ReadAccess :=       [Reduction Type: NONE] [Scalar: 1]66; CHECK-NEXT:                 { Stmt_reduction_for[i0, i1] -> MemRef_phi__phi[] };67; CHECK-NEXT:            new: { Stmt_reduction_for[i0, i1] -> MemRef_A[i0] };68; CHECK-NEXT:             MustWriteAccess :=  [Reduction Type: NONE] [Scalar: 1]69; CHECK-NEXT:                 { Stmt_reduction_for[i0, i1] -> MemRef_phi[] };70; CHECK-NEXT:            new: { Stmt_reduction_for[i0, i1] -> MemRef_A[i0] };71; CHECK-NEXT:     Stmt_body72; CHECK-NEXT:             MustWriteAccess :=  [Reduction Type: NONE] [Scalar: 1]73; CHECK-NEXT:                 { Stmt_body[i0, i1] -> MemRef_add[] };74; CHECK-NEXT:            new: { Stmt_body[i0, i1] -> MemRef_A[i0] };75; CHECK-NEXT:             ReadAccess :=       [Reduction Type: NONE] [Scalar: 1]76; CHECK-NEXT:                 { Stmt_body[i0, i1] -> MemRef_phi[] };77; CHECK-NEXT:            new: { Stmt_body[i0, i1] -> MemRef_A[i0] };78; CHECK-NEXT:     Stmt_reduction_inc79; CHECK-NEXT:             ReadAccess :=       [Reduction Type: NONE] [Scalar: 1]80; CHECK-NEXT:                 { Stmt_reduction_inc[i0, i1] -> MemRef_add[] };81; CHECK-NEXT:            new: { Stmt_reduction_inc[i0, i1] -> MemRef_A[i0] };82; CHECK-NEXT:             MustWriteAccess :=  [Reduction Type: NONE] [Scalar: 1]83; CHECK-NEXT:                 { Stmt_reduction_inc[i0, i1] -> MemRef_phi__phi[] };84; CHECK-NEXT:            new: { Stmt_reduction_inc[i0, i1] -> MemRef_A[i0] };85; CHECK-NEXT:     Stmt_reduction_exit86; CHECK-NEXT:             MustWriteAccess :=  [Reduction Type: NONE] [Scalar: 0]87; CHECK-NEXT:                 { Stmt_reduction_exit[i0] -> MemRef_A[i0] };88; CHECK-NEXT:             ReadAccess :=       [Reduction Type: NONE] [Scalar: 1]89; CHECK-NEXT:                 { Stmt_reduction_exit[i0] -> MemRef_phi[] };90; CHECK-NEXT:            new: { Stmt_reduction_exit[i0] -> MemRef_A[i0] };91; CHECK-NEXT: }92