mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-12-09 12:34:25 +00:00
d2a7cedeca
We already do: concat_vectors(scalar, undef) -> scalar_to_vector(scalar) When the scalar is legal. When it's not, but is a truncated legal scalar, we can also do: concat_vectors(trunc(scalar), undef) -> scalar_to_vector(scalar) Which is equivalent, since the upper lanes are undef anyway. While there, teach the combine to look at more than 2 operands. Differential Revision: http://reviews.llvm.org/D8883 llvm-svn: 234530
19 lines
608 B
LLVM
19 lines
608 B
LLVM
; RUN: llc < %s -mtriple aarch64-unknown-unknown -asm-verbose=false | FileCheck %s
|
|
|
|
target datalayout = "e-m:o-i64:64-i128:128-n32:64-S128"
|
|
|
|
; Test the (concat_vectors (bitcast (trunc (scalar))), undef..) pattern.
|
|
|
|
define <8 x i8> @test_concat_from_truncated_scalar(i32 %x) #0 {
|
|
entry:
|
|
; CHECK-LABEL: test_concat_from_truncated_scalar:
|
|
; CHECK-NEXT: fmov s0, w0
|
|
; CHECK-NEXT: ret
|
|
%t = trunc i32 %x to i16
|
|
%0 = bitcast i16 %t to <2 x i8>
|
|
%1 = shufflevector <2 x i8> %0, <2 x i8> undef, <8 x i32> <i32 0, i32 1, i32 2, i32 2, i32 2, i32 2, i32 2, i32 2>
|
|
ret <8 x i8> %1
|
|
}
|
|
|
|
attributes #0 = { nounwind }
|