brintos

brintos / llvm-project-archived public Read only

0
0
Text · 2.6 KiB · 2b71826 Raw
85 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py UTC_ARGS: --version 22; Test insertions of byte-swapped memory values into a nonzero index of an undef.3;4; RUN: llc < %s -mtriple=s390x-linux-gnu -mcpu=z15 | FileCheck %s5 6declare i16 @llvm.bswap.i16(i16)7declare i32 @llvm.bswap.i32(i32)8declare i64 @llvm.bswap.i64(i64)9declare <8 x i16> @llvm.bswap.v8i16(<8 x i16>)10declare <4 x i32> @llvm.bswap.v4i32(<4 x i32>)11declare <2 x i64> @llvm.bswap.v2i64(<2 x i64>)12 13; Test v8i16 insertion into an undef, with an arbitrary index.14define <8 x i16> @f1(ptr %ptr) {15; CHECK-LABEL: f1:16; CHECK:       # %bb.0:17; CHECK-NEXT:    vlbrreph %v24, 0(%r2)18; CHECK-NEXT:    br %r1419  %val = load i16, ptr %ptr20  %swap = call i16 @llvm.bswap.i16(i16 %val)21  %ret = insertelement <8 x i16> undef, i16 %swap, i32 522  ret <8 x i16> %ret23}24 25; Test v8i16 insertion into an undef, using a vector bswap.26define <8 x i16> @f2(ptr %ptr) {27; CHECK-LABEL: f2:28; CHECK:       # %bb.0:29; CHECK-NEXT:    vlbrreph %v24, 0(%r2)30; CHECK-NEXT:    br %r1431  %val = load i16, ptr %ptr32  %insert = insertelement <8 x i16> undef, i16 %val, i32 533  %ret = call <8 x i16> @llvm.bswap.v8i16(<8 x i16> %insert)34  ret <8 x i16> %ret35}36 37; Test v4i32 insertion into an undef, with an arbitrary index.38define <4 x i32> @f3(ptr %ptr) {39; CHECK-LABEL: f3:40; CHECK:       # %bb.0:41; CHECK-NEXT:    vlbrrepf %v24, 0(%r2)42; CHECK-NEXT:    br %r1443  %val = load i32, ptr %ptr44  %swap = call i32 @llvm.bswap.i32(i32 %val)45  %ret = insertelement <4 x i32> undef, i32 %swap, i32 246  ret <4 x i32> %ret47}48 49; Test v4i32 insertion into an undef, using a vector bswap.50define <4 x i32> @f4(ptr %ptr) {51; CHECK-LABEL: f4:52; CHECK:       # %bb.0:53; CHECK-NEXT:    vlbrrepf %v24, 0(%r2)54; CHECK-NEXT:    br %r1455  %val = load i32, ptr %ptr56  %insert = insertelement <4 x i32> undef, i32 %val, i32 257  %ret = call <4 x i32> @llvm.bswap.v4i32(<4 x i32> %insert)58  ret <4 x i32> %ret59}60 61; Test v2i64 insertion into an undef, with an arbitrary index.62define <2 x i64> @f5(ptr %ptr) {63; CHECK-LABEL: f5:64; CHECK:       # %bb.0:65; CHECK-NEXT:    vlbrrepg %v24, 0(%r2)66; CHECK-NEXT:    br %r1467  %val = load i64, ptr %ptr68  %swap = call i64 @llvm.bswap.i64(i64 %val)69  %ret = insertelement <2 x i64> undef, i64 %swap, i32 170  ret <2 x i64> %ret71}72 73; Test v2i64 insertion into an undef, using a vector bwap.74define <2 x i64> @f6(ptr %ptr) {75; CHECK-LABEL: f6:76; CHECK:       # %bb.0:77; CHECK-NEXT:    vlbrrepg %v24, 0(%r2)78; CHECK-NEXT:    br %r1479  %val = load i64, ptr %ptr80  %insert = insertelement <2 x i64> undef, i64 %val, i32 181  %ret = call <2 x i64> @llvm.bswap.v2i64(<2 x i64> %insert)82  ret <2 x i64> %ret83}84 85