124 lines · plain
1; Test insertions of memory values into a nonzero index of an undef.2;3; RUN: llc < %s -mtriple=s390x-linux-gnu -mcpu=z13 | FileCheck %s4 5; Test v16i8 insertion into an undef, with an arbitrary index.6define <16 x i8> @f1(ptr %ptr) {7; CHECK-LABEL: f1:8; CHECK: vlrepb %v24, 0(%r2)9; CHECK-NEXT: br %r1410 %val = load i8, ptr %ptr11 %ret = insertelement <16 x i8> undef, i8 %val, i32 1212 ret <16 x i8> %ret13}14 15; Test v16i8 insertion into an undef, with the first good index for VLVGP.16define <16 x i8> @f2(ptr %ptr) {17; CHECK-LABEL: f2:18; CHECK: {{vlrepb|vllezb}} %v24, 0(%r2)19; CHECK-NEXT: br %r1420 %val = load i8, ptr %ptr21 %ret = insertelement <16 x i8> undef, i8 %val, i32 722 ret <16 x i8> %ret23}24 25; Test v16i8 insertion into an undef, with the second good index for VLVGP.26define <16 x i8> @f3(ptr %ptr) {27; CHECK-LABEL: f3:28; CHECK: vlrepb %v24, 0(%r2)29; CHECK-NEXT: br %r1430 %val = load i8, ptr %ptr31 %ret = insertelement <16 x i8> undef, i8 %val, i32 1532 ret <16 x i8> %ret33}34 35; Test v8i16 insertion into an undef, with an arbitrary index.36define <8 x i16> @f4(ptr %ptr) {37; CHECK-LABEL: f4:38; CHECK: vlreph %v24, 0(%r2)39; CHECK-NEXT: br %r1440 %val = load i16, ptr %ptr41 %ret = insertelement <8 x i16> undef, i16 %val, i32 542 ret <8 x i16> %ret43}44 45; Test v8i16 insertion into an undef, with the first good index for VLVGP.46define <8 x i16> @f5(ptr %ptr) {47; CHECK-LABEL: f5:48; CHECK: {{vlreph|vllezh}} %v24, 0(%r2)49; CHECK-NEXT: br %r1450 %val = load i16, ptr %ptr51 %ret = insertelement <8 x i16> undef, i16 %val, i32 352 ret <8 x i16> %ret53}54 55; Test v8i16 insertion into an undef, with the second good index for VLVGP.56define <8 x i16> @f6(ptr %ptr) {57; CHECK-LABEL: f6:58; CHECK: vlreph %v24, 0(%r2)59; CHECK-NEXT: br %r1460 %val = load i16, ptr %ptr61 %ret = insertelement <8 x i16> undef, i16 %val, i32 762 ret <8 x i16> %ret63}64 65; Test v4i32 insertion into an undef, with an arbitrary index.66define <4 x i32> @f7(ptr %ptr) {67; CHECK-LABEL: f7:68; CHECK: vlrepf %v24, 0(%r2)69; CHECK-NEXT: br %r1470 %val = load i32, ptr %ptr71 %ret = insertelement <4 x i32> undef, i32 %val, i32 272 ret <4 x i32> %ret73}74 75; Test v4i32 insertion into an undef, with the first good index for VLVGP.76define <4 x i32> @f8(ptr %ptr) {77; CHECK-LABEL: f8:78; CHECK: {{vlrepf|vllezf}} %v24, 0(%r2)79; CHECK-NEXT: br %r1480 %val = load i32, ptr %ptr81 %ret = insertelement <4 x i32> undef, i32 %val, i32 182 ret <4 x i32> %ret83}84 85; Test v4i32 insertion into an undef, with the second good index for VLVGP.86define <4 x i32> @f9(ptr %ptr) {87; CHECK-LABEL: f9:88; CHECK: vlrepf %v24, 0(%r2)89; CHECK-NEXT: br %r1490 %val = load i32, ptr %ptr91 %ret = insertelement <4 x i32> undef, i32 %val, i32 392 ret <4 x i32> %ret93}94 95; Test v2i64 insertion into an undef.96define <2 x i64> @f10(ptr %ptr) {97; CHECK-LABEL: f10:98; CHECK: vlrepg %v24, 0(%r2)99; CHECK-NEXT: br %r14100 %val = load i64, ptr %ptr101 %ret = insertelement <2 x i64> undef, i64 %val, i32 1102 ret <2 x i64> %ret103}104 105; Test v4f32 insertion into an undef.106define <4 x float> @f11(ptr %ptr) {107; CHECK-LABEL: f11:108; CHECK: vlrepf %v24, 0(%r2)109; CHECK: br %r14110 %val = load float, ptr %ptr111 %ret = insertelement <4 x float> undef, float %val, i32 2112 ret <4 x float> %ret113}114 115; Test v2f64 insertion into an undef.116define <2 x double> @f12(ptr %ptr) {117; CHECK-LABEL: f12:118; CHECK: vlrepg %v24, 0(%r2)119; CHECK: br %r14120 %val = load double, ptr %ptr121 %ret = insertelement <2 x double> undef, double %val, i32 1122 ret <2 x double> %ret123}124