mirror of
https://github.com/RPCS3/llvm.git
synced 2026-01-31 01:25:19 +01:00
79d60f6e81
Iterate over all elements and count the number of uses among them for each used load. Then make sure to REPLICATE the load which has the most uses in order to minimize the number of needed element insertions. Review: Ulrich Weigand https://reviews.llvm.org/D54322 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@346637 91177308-0d34-0410-b5e6-96231b3b80d8
20 lines
640 B
LLVM
20 lines
640 B
LLVM
; RUN: llc < %s -mtriple=s390x-linux-gnu -mcpu=z13 | FileCheck %s
|
|
|
|
; Test a vector which is built with elements from two loads replicates the
|
|
; load with most elements having its value.
|
|
|
|
; CHECK: vlef
|
|
; CHECK-NOT: vlvgf
|
|
|
|
define void @update(i32* %src1, i32* %src2, <4 x i32>* %dst) {
|
|
bb:
|
|
%tmp = load i32, i32* %src1
|
|
%tmp1 = load i32, i32* %src2
|
|
%tmp2 = insertelement <4 x i32> undef, i32 %tmp, i32 0
|
|
%tmp3 = insertelement <4 x i32> %tmp2, i32 %tmp1, i32 1
|
|
%tmp4 = insertelement <4 x i32> %tmp3, i32 %tmp1, i32 2
|
|
%tmp5 = insertelement <4 x i32> %tmp4, i32 %tmp1, i32 3
|
|
store <4 x i32> %tmp5, <4 x i32>* %dst
|
|
ret void
|
|
}
|