llvm-project/polly/test/Dependences/reduction_simple_iv.ll

41 lines
1.2 KiB
LLVM

; RUN: opt %loadPolly -polly-dependences -analyze < %s | FileCheck %s
;
; CHECK: RAW dependences:
; CHECK: { }
; CHECK: WAR dependences:
; CHECK: { }
; CHECK: WAW dependences:
; CHECK: { }
; CHECK: Reduction dependences:
; CHECK: { Stmt_for_cond[i0] -> Stmt_for_cond[1 + i0] : i0 <= 99 and i0 >= 0 }
;
; void f(int* sum) {
; for (int i = 0; i <= 100; i++)
; sum += i * 3;
; }
target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"
define void @f(i32* %sum) {
entry:
br label %entry.split1
entry.split1: ; preds = %entry
br label %entry.split
entry.split: ; preds = %entry.split1
br label %for.cond
for.cond: ; preds = %for.cond, %entry.split
%i1.0 = phi i32 [ 0, %entry.split ], [ %inc, %for.cond ]
%sum.reload = load i32* %sum
%mul = mul nsw i32 %i1.0, 3
%add = add nsw i32 %sum.reload, %mul
%inc = add nsw i32 %i1.0, 1
store i32 %add, i32* %sum
%cmp = icmp slt i32 %i1.0, 100
br i1 %cmp, label %for.cond, label %for.end
for.end: ; preds = %for.cond
ret void
}