mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-02-21 06:30:16 +00:00
369cc938d2
This is a complete re-write if the bottom-up vectorization class. Before this commit we scanned the instruction tree 3 times. First in search of merge points for the trees. Second, for estimating the cost. And finally for vectorization. There was a lot of code duplication and adding the DCE exposed bugs. The new design is simpler and DCE was a part of the design. In this implementation we build the tree once. After that we estimate the cost by scanning the different entries in the constructed tree (in any order). The vectorization phase also works on the built tree. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@185774 91177308-0d34-0410-b5e6-96231b3b80d8
110 lines
3.9 KiB
LLVM
110 lines
3.9 KiB
LLVM
; RUN: opt < %s -basicaa -slp-vectorizer -S -mtriple=x86_64-apple-macosx10.8.0 -mcpu=corei7-avx | FileCheck %s
|
|
|
|
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128"
|
|
target triple = "x86_64-apple-macosx10.8.0"
|
|
|
|
; int foo(int * restrict B, int * restrict A, int n, int m) {
|
|
; B[0] = n * A[0] + m * A[0];
|
|
; B[1] = n * A[1] + m * A[1];
|
|
; B[2] = n * A[2] + m * A[2];
|
|
; B[3] = n * A[3] + m * A[3];
|
|
; return 0;
|
|
; }
|
|
|
|
; CHECK: @foo
|
|
; CHECK: load <4 x i32>
|
|
; CHECK: mul <4 x i32>
|
|
; CHECK: store <4 x i32>
|
|
; CHECK: ret
|
|
define i32 @foo(i32* noalias nocapture %B, i32* noalias nocapture %A, i32 %n, i32 %m) #0 {
|
|
entry:
|
|
%0 = load i32* %A, align 4
|
|
%mul238 = add i32 %m, %n
|
|
%add = mul i32 %0, %mul238
|
|
store i32 %add, i32* %B, align 4
|
|
%arrayidx4 = getelementptr inbounds i32* %A, i64 1
|
|
%1 = load i32* %arrayidx4, align 4
|
|
%add8 = mul i32 %1, %mul238
|
|
%arrayidx9 = getelementptr inbounds i32* %B, i64 1
|
|
store i32 %add8, i32* %arrayidx9, align 4
|
|
%arrayidx10 = getelementptr inbounds i32* %A, i64 2
|
|
%2 = load i32* %arrayidx10, align 4
|
|
%add14 = mul i32 %2, %mul238
|
|
%arrayidx15 = getelementptr inbounds i32* %B, i64 2
|
|
store i32 %add14, i32* %arrayidx15, align 4
|
|
%arrayidx16 = getelementptr inbounds i32* %A, i64 3
|
|
%3 = load i32* %arrayidx16, align 4
|
|
%add20 = mul i32 %3, %mul238
|
|
%arrayidx21 = getelementptr inbounds i32* %B, i64 3
|
|
store i32 %add20, i32* %arrayidx21, align 4
|
|
ret i32 0
|
|
}
|
|
|
|
|
|
; int extr_user(int * restrict B, int * restrict A, int n, int m) {
|
|
; B[0] = n * A[0] + m * A[0];
|
|
; B[1] = n * A[1] + m * A[1];
|
|
; B[2] = n * A[2] + m * A[2];
|
|
; B[3] = n * A[3] + m * A[3];
|
|
; return A[0];
|
|
; }
|
|
|
|
; CHECK: @extr_user
|
|
; CHECK: load <4 x i32>
|
|
; CHECK-NEXT: extractelement <4 x i32>
|
|
; CHECK: store <4 x i32>
|
|
; CHECK-NEXT: ret
|
|
define i32 @extr_user(i32* noalias nocapture %B, i32* noalias nocapture %A, i32 %n, i32 %m) {
|
|
entry:
|
|
%0 = load i32* %A, align 4
|
|
%mul238 = add i32 %m, %n
|
|
%add = mul i32 %0, %mul238
|
|
store i32 %add, i32* %B, align 4
|
|
%arrayidx4 = getelementptr inbounds i32* %A, i64 1
|
|
%1 = load i32* %arrayidx4, align 4
|
|
%add8 = mul i32 %1, %mul238
|
|
%arrayidx9 = getelementptr inbounds i32* %B, i64 1
|
|
store i32 %add8, i32* %arrayidx9, align 4
|
|
%arrayidx10 = getelementptr inbounds i32* %A, i64 2
|
|
%2 = load i32* %arrayidx10, align 4
|
|
%add14 = mul i32 %2, %mul238
|
|
%arrayidx15 = getelementptr inbounds i32* %B, i64 2
|
|
store i32 %add14, i32* %arrayidx15, align 4
|
|
%arrayidx16 = getelementptr inbounds i32* %A, i64 3
|
|
%3 = load i32* %arrayidx16, align 4
|
|
%add20 = mul i32 %3, %mul238
|
|
%arrayidx21 = getelementptr inbounds i32* %B, i64 3
|
|
store i32 %add20, i32* %arrayidx21, align 4
|
|
ret i32 %0 ;<--------- This value has multiple users
|
|
}
|
|
|
|
; In this example we have an external user that is not the first element in the vector.
|
|
; CHECK: @extr_user1
|
|
; CHECK: load <4 x i32>
|
|
; CHECK-NEXT: extractelement <4 x i32>
|
|
; CHECK: store <4 x i32>
|
|
; CHECK-NEXT: ret
|
|
define i32 @extr_user1(i32* noalias nocapture %B, i32* noalias nocapture %A, i32 %n, i32 %m) {
|
|
entry:
|
|
%0 = load i32* %A, align 4
|
|
%mul238 = add i32 %m, %n
|
|
%add = mul i32 %0, %mul238
|
|
store i32 %add, i32* %B, align 4
|
|
%arrayidx4 = getelementptr inbounds i32* %A, i64 1
|
|
%1 = load i32* %arrayidx4, align 4
|
|
%add8 = mul i32 %1, %mul238
|
|
%arrayidx9 = getelementptr inbounds i32* %B, i64 1
|
|
store i32 %add8, i32* %arrayidx9, align 4
|
|
%arrayidx10 = getelementptr inbounds i32* %A, i64 2
|
|
%2 = load i32* %arrayidx10, align 4
|
|
%add14 = mul i32 %2, %mul238
|
|
%arrayidx15 = getelementptr inbounds i32* %B, i64 2
|
|
store i32 %add14, i32* %arrayidx15, align 4
|
|
%arrayidx16 = getelementptr inbounds i32* %A, i64 3
|
|
%3 = load i32* %arrayidx16, align 4
|
|
%add20 = mul i32 %3, %mul238
|
|
%arrayidx21 = getelementptr inbounds i32* %B, i64 3
|
|
store i32 %add20, i32* %arrayidx21, align 4
|
|
ret i32 %1 ;<--------- This value has multiple users
|
|
}
|