maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/polly/test/ScopInfo/reduction_simple_fp.ll

65 lines
1.9 KiB
LLVM
Raw Normal View History

ScopDetection: Only detect scops that have at least one read and one write Scops that only read seem generally uninteresting and scops that only write are most likely initializations where there is also little to optimize. To not waste compile time we bail early. Differential Revision: http://reviews.llvm.org/D7735 llvm-svn: 229820
2015-02-19 13:31:07 +08:00
; RUN: opt %loadPolly -polly-detect-unprofitable -polly-scops -analyze < %s | FileCheck %s
Missing reduction detection test cases llvm-svn: 211235
2014-06-19 07:08:14 +08:00
;
; CHECK: Function: f_no_fast_math
Introduce reduction types This change is particularly useful in the code generation as we need to know which binary operator/identity element we need to combine/initialize the privatization locations. + Print the reduction type for each memory access + Adjusted the test cases to comply with the new output format and to test for the right reduction type llvm-svn: 212126
2014-07-02 04:52:51 +08:00
; CHECK: Reduction Type: NONE
Missing reduction detection test cases llvm-svn: 211235
2014-06-19 07:08:14 +08:00
; CHECK: Function: f_fast_math
Change the printing of reduction types We use the C operator representation when applicable. + Update all the test cases accordingly. llvm-svn: 214486
2014-08-01 16:13:25 +08:00
; CHECK: Reduction Type: +
Missing reduction detection test cases llvm-svn: 211235
2014-06-19 07:08:14 +08:00
;
; void f(float *sum) {
; for (int i = 0; i < 100; i++)
; *sum += 3.41 * i;
; }
target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-n32-S64"
define void @f_no_fast_math(float* %sum) {
entry:
br label %for.cond
for.cond: ; preds = %for.inc, %entry
%i.0 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]
%exitcond = icmp ne i32 %i.0, 100
br i1 %exitcond, label %for.body, label %for.end
for.body: ; preds = %for.cond
%conv = sitofp i32 %i.0 to float
%pi = fptrunc double 3.41 to float
%mul = fmul float %conv, %pi
%tmp = load float* %sum, align 4
%add = fadd float %tmp, %mul
store float %add, float* %sum, align 4
br label %for.inc
for.inc: ; preds = %for.body
%inc = add nsw i32 %i.0, 1
br label %for.cond
for.end: ; preds = %for.cond
ret void
}
define void @f_fast_math(float* %sum) {
entry:
br label %for.cond
for.cond: ; preds = %for.inc, %entry
%i.0 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]
%exitcond = icmp ne i32 %i.0, 100
br i1 %exitcond, label %for.body, label %for.end
for.body: ; preds = %for.cond
%conv = sitofp i32 %i.0 to float
%pi = fptrunc double 3.41 to float
%mul = fmul fast float %conv, %pi
%tmp = load float* %sum, align 4
%add = fadd fast float %tmp, %mul
store float %add, float* %sum, align 4
br label %for.inc
for.inc: ; preds = %for.body
%inc = add nsw i32 %i.0, 1
br label %for.cond
for.end: ; preds = %for.cond
ret void
}