mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-08-31 12:30:06 +00:00
Essentially the same as the GEP change in r230786. A similar migration script can be used to update test cases, though a few more test case improvements/changes were required this time around: (r229269-r229278) import fileinput import sys import re pat = re.compile(r"((?:=|:|^)\s*load (?:atomic )?(?:volatile )?(.*?))(| addrspace\(\d+\) *)\*($| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$)") for line in sys.stdin: sys.stdout.write(re.sub(pat, r"\1, \2\3*\4", line)) Reviewers: rafael, dexonsmith, grosser Differential Revision: http://reviews.llvm.org/D7649 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@230794 91177308-0d34-0410-b5e6-96231b3b80d8
345 lines
12 KiB
LLVM
345 lines
12 KiB
LLVM
; RUN: opt < %s -basicaa -slp-vectorizer -slp-threshold=-100 -instcombine -dce -S -mtriple=i386-apple-macosx10.8.0 -mcpu=corei7-avx | FileCheck %s
|
|
|
|
target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-v128:128:128-a0:0:64-f80:128:128-n8:16:32-S128"
|
|
|
|
|
|
|
|
; Make sure we order the operands of commutative operations so that we get
|
|
; bigger vectorizable trees.
|
|
|
|
; CHECK-LABEL: shuffle_operands1
|
|
; CHECK: load <2 x double>
|
|
; CHECK: fadd <2 x double>
|
|
|
|
define void @shuffle_operands1(double * noalias %from, double * noalias %to,
|
|
double %v1, double %v2) {
|
|
%from_1 = getelementptr double, double *%from, i64 1
|
|
%v0_1 = load double , double * %from
|
|
%v0_2 = load double , double * %from_1
|
|
%v1_1 = fadd double %v0_1, %v1
|
|
%v1_2 = fadd double %v2, %v0_2
|
|
%to_2 = getelementptr double, double * %to, i64 1
|
|
store double %v1_1, double *%to
|
|
store double %v1_2, double *%to_2
|
|
ret void
|
|
}
|
|
|
|
; CHECK-LABEL: shuffle_preserve_broadcast
|
|
; CHECK: %[[BCAST:[a-z0-9]+]] = insertelement <2 x double> undef, double %v0_1
|
|
; CHECK: = insertelement <2 x double> %[[BCAST]], double %v0_1
|
|
define void @shuffle_preserve_broadcast(double * noalias %from,
|
|
double * noalias %to,
|
|
double %v1, double %v2) {
|
|
entry:
|
|
br label %lp
|
|
|
|
lp:
|
|
%p = phi double [ 1.000000e+00, %lp ], [ 0.000000e+00, %entry ]
|
|
%from_1 = getelementptr double, double *%from, i64 1
|
|
%v0_1 = load double , double * %from
|
|
%v0_2 = load double , double * %from_1
|
|
%v1_1 = fadd double %v0_1, %p
|
|
%v1_2 = fadd double %v0_1, %v0_2
|
|
%to_2 = getelementptr double, double * %to, i64 1
|
|
store double %v1_1, double *%to
|
|
store double %v1_2, double *%to_2
|
|
br i1 undef, label %lp, label %ext
|
|
|
|
ext:
|
|
ret void
|
|
}
|
|
|
|
; CHECK-LABEL: shuffle_preserve_broadcast2
|
|
; CHECK: %[[BCAST:[a-z0-9]+]] = insertelement <2 x double> undef, double %v0_1
|
|
; CHECK: = insertelement <2 x double> %[[BCAST]], double %v0_1
|
|
define void @shuffle_preserve_broadcast2(double * noalias %from,
|
|
double * noalias %to,
|
|
double %v1, double %v2) {
|
|
entry:
|
|
br label %lp
|
|
|
|
lp:
|
|
%p = phi double [ 1.000000e+00, %lp ], [ 0.000000e+00, %entry ]
|
|
%from_1 = getelementptr double, double *%from, i64 1
|
|
%v0_1 = load double , double * %from
|
|
%v0_2 = load double , double * %from_1
|
|
%v1_1 = fadd double %p, %v0_1
|
|
%v1_2 = fadd double %v0_2, %v0_1
|
|
%to_2 = getelementptr double, double * %to, i64 1
|
|
store double %v1_1, double *%to
|
|
store double %v1_2, double *%to_2
|
|
br i1 undef, label %lp, label %ext
|
|
|
|
ext:
|
|
ret void
|
|
}
|
|
|
|
; CHECK-LABEL: shuffle_preserve_broadcast3
|
|
; CHECK: %[[BCAST:[a-z0-9]+]] = insertelement <2 x double> undef, double %v0_1
|
|
; CHECK: = insertelement <2 x double> %[[BCAST]], double %v0_1
|
|
define void @shuffle_preserve_broadcast3(double * noalias %from,
|
|
double * noalias %to,
|
|
double %v1, double %v2) {
|
|
entry:
|
|
br label %lp
|
|
|
|
lp:
|
|
%p = phi double [ 1.000000e+00, %lp ], [ 0.000000e+00, %entry ]
|
|
%from_1 = getelementptr double, double *%from, i64 1
|
|
%v0_1 = load double , double * %from
|
|
%v0_2 = load double , double * %from_1
|
|
%v1_1 = fadd double %p, %v0_1
|
|
%v1_2 = fadd double %v0_1, %v0_2
|
|
%to_2 = getelementptr double, double * %to, i64 1
|
|
store double %v1_1, double *%to
|
|
store double %v1_2, double *%to_2
|
|
br i1 undef, label %lp, label %ext
|
|
|
|
ext:
|
|
ret void
|
|
}
|
|
|
|
|
|
; CHECK-LABEL: shuffle_preserve_broadcast4
|
|
; CHECK: %[[BCAST:[a-z0-9]+]] = insertelement <2 x double> undef, double %v0_1
|
|
; CHECK: = insertelement <2 x double> %[[BCAST]], double %v0_1
|
|
define void @shuffle_preserve_broadcast4(double * noalias %from,
|
|
double * noalias %to,
|
|
double %v1, double %v2) {
|
|
entry:
|
|
br label %lp
|
|
|
|
lp:
|
|
%p = phi double [ 1.000000e+00, %lp ], [ 0.000000e+00, %entry ]
|
|
%from_1 = getelementptr double, double *%from, i64 1
|
|
%v0_1 = load double , double * %from
|
|
%v0_2 = load double , double * %from_1
|
|
%v1_1 = fadd double %v0_2, %v0_1
|
|
%v1_2 = fadd double %p, %v0_1
|
|
%to_2 = getelementptr double, double * %to, i64 1
|
|
store double %v1_1, double *%to
|
|
store double %v1_2, double *%to_2
|
|
br i1 undef, label %lp, label %ext
|
|
|
|
ext:
|
|
ret void
|
|
}
|
|
|
|
; CHECK-LABEL: shuffle_preserve_broadcast5
|
|
; CHECK: %[[BCAST:[a-z0-9]+]] = insertelement <2 x double> undef, double %v0_1
|
|
; CHECK: = insertelement <2 x double> %[[BCAST]], double %v0_1
|
|
define void @shuffle_preserve_broadcast5(double * noalias %from,
|
|
double * noalias %to,
|
|
double %v1, double %v2) {
|
|
entry:
|
|
br label %lp
|
|
|
|
lp:
|
|
%p = phi double [ 1.000000e+00, %lp ], [ 0.000000e+00, %entry ]
|
|
%from_1 = getelementptr double, double *%from, i64 1
|
|
%v0_1 = load double , double * %from
|
|
%v0_2 = load double , double * %from_1
|
|
%v1_1 = fadd double %v0_1, %v0_2
|
|
%v1_2 = fadd double %p, %v0_1
|
|
%to_2 = getelementptr double, double * %to, i64 1
|
|
store double %v1_1, double *%to
|
|
store double %v1_2, double *%to_2
|
|
br i1 undef, label %lp, label %ext
|
|
|
|
ext:
|
|
ret void
|
|
}
|
|
|
|
|
|
; CHECK-LABEL: shuffle_preserve_broadcast6
|
|
; CHECK: %[[BCAST:[a-z0-9]+]] = insertelement <2 x double> undef, double %v0_1
|
|
; CHECK: = insertelement <2 x double> %[[BCAST]], double %v0_1
|
|
define void @shuffle_preserve_broadcast6(double * noalias %from,
|
|
double * noalias %to,
|
|
double %v1, double %v2) {
|
|
entry:
|
|
br label %lp
|
|
|
|
lp:
|
|
%p = phi double [ 1.000000e+00, %lp ], [ 0.000000e+00, %entry ]
|
|
%from_1 = getelementptr double, double *%from, i64 1
|
|
%v0_1 = load double , double * %from
|
|
%v0_2 = load double , double * %from_1
|
|
%v1_1 = fadd double %v0_1, %v0_2
|
|
%v1_2 = fadd double %v0_1, %p
|
|
%to_2 = getelementptr double, double * %to, i64 1
|
|
store double %v1_1, double *%to
|
|
store double %v1_2, double *%to_2
|
|
br i1 undef, label %lp, label %ext
|
|
|
|
ext:
|
|
ret void
|
|
}
|
|
|
|
; Make sure we don't scramble operands when we reorder them and destroy
|
|
; 'good' source order.
|
|
|
|
; CHECK-LABEL: good_load_order
|
|
|
|
; CHECK: %[[V1:[0-9]+]] = load <4 x float>, <4 x float>*
|
|
; CHECK: %[[V2:[0-9]+]] = insertelement <4 x float> undef, float %1, i32 0
|
|
; CHECK: %[[V3:[0-9]+]] = shufflevector <4 x float> %[[V2]], <4 x float> %[[V1]], <4 x i32> <i32 0, i32 4, i32 5, i32 6>
|
|
; CHECK: = fmul <4 x float> %[[V1]], %[[V3]]
|
|
|
|
@a = common global [32000 x float] zeroinitializer, align 16
|
|
|
|
define void @good_load_order() {
|
|
entry:
|
|
br label %for.cond1.preheader
|
|
|
|
for.cond1.preheader:
|
|
%0 = load float, float* getelementptr inbounds ([32000 x float]* @a, i64 0, i64 0), align 16
|
|
br label %for.body3
|
|
|
|
for.body3:
|
|
%1 = phi float [ %0, %for.cond1.preheader ], [ %10, %for.body3 ]
|
|
%indvars.iv = phi i64 [ 0, %for.cond1.preheader ], [ %indvars.iv.next, %for.body3 ]
|
|
%2 = add nsw i64 %indvars.iv, 1
|
|
%arrayidx = getelementptr inbounds [32000 x float], [32000 x float]* @a, i64 0, i64 %2
|
|
%3 = load float, float* %arrayidx, align 4
|
|
%arrayidx5 = getelementptr inbounds [32000 x float], [32000 x float]* @a, i64 0, i64 %indvars.iv
|
|
%mul6 = fmul float %3, %1
|
|
store float %mul6, float* %arrayidx5, align 4
|
|
%4 = add nsw i64 %indvars.iv, 2
|
|
%arrayidx11 = getelementptr inbounds [32000 x float], [32000 x float]* @a, i64 0, i64 %4
|
|
%5 = load float, float* %arrayidx11, align 4
|
|
%mul15 = fmul float %5, %3
|
|
store float %mul15, float* %arrayidx, align 4
|
|
%6 = add nsw i64 %indvars.iv, 3
|
|
%arrayidx21 = getelementptr inbounds [32000 x float], [32000 x float]* @a, i64 0, i64 %6
|
|
%7 = load float, float* %arrayidx21, align 4
|
|
%mul25 = fmul float %7, %5
|
|
store float %mul25, float* %arrayidx11, align 4
|
|
%8 = add nsw i64 %indvars.iv, 4
|
|
%arrayidx31 = getelementptr inbounds [32000 x float], [32000 x float]* @a, i64 0, i64 %8
|
|
%9 = load float, float* %arrayidx31, align 4
|
|
%mul35 = fmul float %9, %7
|
|
store float %mul35, float* %arrayidx21, align 4
|
|
%indvars.iv.next = add nuw nsw i64 %indvars.iv, 5
|
|
%arrayidx41 = getelementptr inbounds [32000 x float], [32000 x float]* @a, i64 0, i64 %indvars.iv.next
|
|
%10 = load float, float* %arrayidx41, align 4
|
|
%mul45 = fmul float %10, %9
|
|
store float %mul45, float* %arrayidx31, align 4
|
|
%11 = trunc i64 %indvars.iv.next to i32
|
|
%cmp2 = icmp slt i32 %11, 31995
|
|
br i1 %cmp2, label %for.body3, label %for.end
|
|
|
|
for.end:
|
|
ret void
|
|
}
|
|
|
|
; Check vectorization of following code for double data type-
|
|
; c[0] = a[0]+b[0];
|
|
; c[1] = b[1]+a[1]; // swapped b[1] and a[1]
|
|
|
|
; CHECK-LABEL: load_reorder_double
|
|
; CHECK: load <2 x double>, <2 x double>*
|
|
; CHECK: fadd <2 x double>
|
|
define void @load_reorder_double(double* nocapture %c, double* noalias nocapture readonly %a, double* noalias nocapture readonly %b){
|
|
%1 = load double, double* %a
|
|
%2 = load double, double* %b
|
|
%3 = fadd double %1, %2
|
|
store double %3, double* %c
|
|
%4 = getelementptr inbounds double, double* %b, i64 1
|
|
%5 = load double, double* %4
|
|
%6 = getelementptr inbounds double, double* %a, i64 1
|
|
%7 = load double, double* %6
|
|
%8 = fadd double %5, %7
|
|
%9 = getelementptr inbounds double, double* %c, i64 1
|
|
store double %8, double* %9
|
|
ret void
|
|
}
|
|
|
|
; Check vectorization of following code for float data type-
|
|
; c[0] = a[0]+b[0];
|
|
; c[1] = b[1]+a[1]; // swapped b[1] and a[1]
|
|
; c[2] = a[2]+b[2];
|
|
; c[3] = a[3]+b[3];
|
|
|
|
; CHECK-LABEL: load_reorder_float
|
|
; CHECK: load <4 x float>, <4 x float>*
|
|
; CHECK: fadd <4 x float>
|
|
define void @load_reorder_float(float* nocapture %c, float* noalias nocapture readonly %a, float* noalias nocapture readonly %b){
|
|
%1 = load float, float* %a
|
|
%2 = load float, float* %b
|
|
%3 = fadd float %1, %2
|
|
store float %3, float* %c
|
|
%4 = getelementptr inbounds float, float* %b, i64 1
|
|
%5 = load float, float* %4
|
|
%6 = getelementptr inbounds float, float* %a, i64 1
|
|
%7 = load float, float* %6
|
|
%8 = fadd float %5, %7
|
|
%9 = getelementptr inbounds float, float* %c, i64 1
|
|
store float %8, float* %9
|
|
%10 = getelementptr inbounds float, float* %a, i64 2
|
|
%11 = load float, float* %10
|
|
%12 = getelementptr inbounds float, float* %b, i64 2
|
|
%13 = load float, float* %12
|
|
%14 = fadd float %11, %13
|
|
%15 = getelementptr inbounds float, float* %c, i64 2
|
|
store float %14, float* %15
|
|
%16 = getelementptr inbounds float, float* %a, i64 3
|
|
%17 = load float, float* %16
|
|
%18 = getelementptr inbounds float, float* %b, i64 3
|
|
%19 = load float, float* %18
|
|
%20 = fadd float %17, %19
|
|
%21 = getelementptr inbounds float, float* %c, i64 3
|
|
store float %20, float* %21
|
|
ret void
|
|
}
|
|
|
|
; Check we properly reorder the below code so that it gets vectorized optimally-
|
|
; a[0] = (b[0]+c[0])+d[0];
|
|
; a[1] = d[1]+(b[1]+c[1]);
|
|
; a[2] = (b[2]+c[2])+d[2];
|
|
; a[3] = (b[3]+c[3])+d[3];
|
|
|
|
; CHECK-LABEL: opcode_reorder
|
|
; CHECK: load <4 x float>, <4 x float>*
|
|
; CHECK: fadd <4 x float>
|
|
define void @opcode_reorder(float* noalias nocapture %a, float* noalias nocapture readonly %b,
|
|
float* noalias nocapture readonly %c,float* noalias nocapture readonly %d){
|
|
%1 = load float, float* %b
|
|
%2 = load float, float* %c
|
|
%3 = fadd float %1, %2
|
|
%4 = load float, float* %d
|
|
%5 = fadd float %3, %4
|
|
store float %5, float* %a
|
|
%6 = getelementptr inbounds float, float* %d, i64 1
|
|
%7 = load float, float* %6
|
|
%8 = getelementptr inbounds float, float* %b, i64 1
|
|
%9 = load float, float* %8
|
|
%10 = getelementptr inbounds float, float* %c, i64 1
|
|
%11 = load float, float* %10
|
|
%12 = fadd float %9, %11
|
|
%13 = fadd float %7, %12
|
|
%14 = getelementptr inbounds float, float* %a, i64 1
|
|
store float %13, float* %14
|
|
%15 = getelementptr inbounds float, float* %b, i64 2
|
|
%16 = load float, float* %15
|
|
%17 = getelementptr inbounds float, float* %c, i64 2
|
|
%18 = load float, float* %17
|
|
%19 = fadd float %16, %18
|
|
%20 = getelementptr inbounds float, float* %d, i64 2
|
|
%21 = load float, float* %20
|
|
%22 = fadd float %19, %21
|
|
%23 = getelementptr inbounds float, float* %a, i64 2
|
|
store float %22, float* %23
|
|
%24 = getelementptr inbounds float, float* %b, i64 3
|
|
%25 = load float, float* %24
|
|
%26 = getelementptr inbounds float, float* %c, i64 3
|
|
%27 = load float, float* %26
|
|
%28 = fadd float %25, %27
|
|
%29 = getelementptr inbounds float, float* %d, i64 3
|
|
%30 = load float, float* %29
|
|
%31 = fadd float %28, %30
|
|
%32 = getelementptr inbounds float, float* %a, i64 3
|
|
store float %31, float* %32
|
|
ret void
|
|
}
|