|
| 1 | +; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py |
| 2 | +; RUN: llc < %s -march=ve -mattr=+vpu | FileCheck %s |
| 3 | + |
| 4 | +declare <256 x i32> @llvm.vp.merge.v256i32(<256 x i1>, <256 x i32>, <256 x i32>, i32) |
| 5 | + |
| 6 | +define fastcc <256 x i32> @test_vp_merge_v256i32_vv(<256 x i32> %i0, <256 x i32> %i1, <256 x i1> %m, i32 %pivot) { |
| 7 | +; CHECK-LABEL: test_vp_merge_v256i32_vv: |
| 8 | +; CHECK: # %bb.0: |
| 9 | +; CHECK-NEXT: and %s0, %s0, (32)0 |
| 10 | +; CHECK-NEXT: lvl %s0 |
| 11 | +; CHECK-NEXT: vmrg %v1, %v1, %v0, %vm1 |
| 12 | +; CHECK-NEXT: lea %s16, 256 |
| 13 | +; CHECK-NEXT: lvl %s16 |
| 14 | +; CHECK-NEXT: vor %v0, (0)1, %v1 |
| 15 | +; CHECK-NEXT: b.l.t (, %s10) |
| 16 | + %r0 = call <256 x i32> @llvm.vp.merge.v256i32(<256 x i1> %m, <256 x i32> %i0, <256 x i32> %i1, i32 %pivot) |
| 17 | + ret <256 x i32> %r0 |
| 18 | +} |
| 19 | + |
| 20 | +define fastcc <256 x i32> @test_vp_merge_v256i32_vr(<256 x i32> %i0, i32 %s1, <256 x i1> %m, i32 %pivot) { |
| 21 | +; CHECK-LABEL: test_vp_merge_v256i32_vr: |
| 22 | +; CHECK: # %bb.0: |
| 23 | +; CHECK-NEXT: and %s1, %s1, (32)0 |
| 24 | +; CHECK-NEXT: lea %s2, 256 |
| 25 | +; CHECK-NEXT: lvl %s2 |
| 26 | +; CHECK-NEXT: vbrd %v1, %s0 |
| 27 | +; CHECK-NEXT: lvl %s1 |
| 28 | +; CHECK-NEXT: vmrg %v1, %v1, %v0, %vm1 |
| 29 | +; CHECK-NEXT: lea %s16, 256 |
| 30 | +; CHECK-NEXT: lvl %s16 |
| 31 | +; CHECK-NEXT: vor %v0, (0)1, %v1 |
| 32 | +; CHECK-NEXT: b.l.t (, %s10) |
| 33 | + %xins = insertelement <256 x i32> undef, i32 %s1, i32 0 |
| 34 | + %i1 = shufflevector <256 x i32> %xins, <256 x i32> undef, <256 x i32> zeroinitializer |
| 35 | + %r0 = call <256 x i32> @llvm.vp.merge.v256i32(<256 x i1> %m, <256 x i32> %i0, <256 x i32> %i1, i32 %pivot) |
| 36 | + ret <256 x i32> %r0 |
| 37 | +} |
| 38 | + |
| 39 | +declare <256 x float> @llvm.vp.merge.v256f32(<256 x i1>, <256 x float>, <256 x float>, i32) |
| 40 | + |
| 41 | +define fastcc <256 x float> @test_vp_merge_v256f32_vv(<256 x float> %i0, <256 x float> %i1, <256 x i1> %m, i32 %pivot) { |
| 42 | +; CHECK-LABEL: test_vp_merge_v256f32_vv: |
| 43 | +; CHECK: # %bb.0: |
| 44 | +; CHECK-NEXT: and %s0, %s0, (32)0 |
| 45 | +; CHECK-NEXT: lvl %s0 |
| 46 | +; CHECK-NEXT: vmrg %v1, %v1, %v0, %vm1 |
| 47 | +; CHECK-NEXT: lea %s16, 256 |
| 48 | +; CHECK-NEXT: lvl %s16 |
| 49 | +; CHECK-NEXT: vor %v0, (0)1, %v1 |
| 50 | +; CHECK-NEXT: b.l.t (, %s10) |
| 51 | + %r0 = call <256 x float> @llvm.vp.merge.v256f32(<256 x i1> %m, <256 x float> %i0, <256 x float> %i1, i32 %pivot) |
| 52 | + ret <256 x float> %r0 |
| 53 | +} |
| 54 | + |
| 55 | +define fastcc <256 x float> @test_vp_merge_v256f32_vr(<256 x float> %i0, float %s1, <256 x i1> %m, i32 %pivot) { |
| 56 | +; CHECK-LABEL: test_vp_merge_v256f32_vr: |
| 57 | +; CHECK: # %bb.0: |
| 58 | +; CHECK-NEXT: and %s1, %s1, (32)0 |
| 59 | +; CHECK-NEXT: lea %s2, 256 |
| 60 | +; CHECK-NEXT: lvl %s2 |
| 61 | +; CHECK-NEXT: vbrd %v1, %s0 |
| 62 | +; CHECK-NEXT: lvl %s1 |
| 63 | +; CHECK-NEXT: vmrg %v1, %v1, %v0, %vm1 |
| 64 | +; CHECK-NEXT: lea %s16, 256 |
| 65 | +; CHECK-NEXT: lvl %s16 |
| 66 | +; CHECK-NEXT: vor %v0, (0)1, %v1 |
| 67 | +; CHECK-NEXT: b.l.t (, %s10) |
| 68 | + %xins = insertelement <256 x float> undef, float %s1, i32 0 |
| 69 | + %i1 = shufflevector <256 x float> %xins, <256 x float> undef, <256 x i32> zeroinitializer |
| 70 | + %r0 = call <256 x float> @llvm.vp.merge.v256f32(<256 x i1> %m, <256 x float> %i0, <256 x float> %i1, i32 %pivot) |
| 71 | + ret <256 x float> %r0 |
| 72 | +} |
| 73 | + |
| 74 | +declare <256 x double> @llvm.vp.merge.v256f64(<256 x i1>, <256 x double>, <256 x double>, i32) |
| 75 | + |
| 76 | +define fastcc <256 x double> @test_vp_merge_v256f64_vv(<256 x double> %i0, <256 x double> %i1, <256 x i1> %m, i32 %pivot) { |
| 77 | +; CHECK-LABEL: test_vp_merge_v256f64_vv: |
| 78 | +; CHECK: # %bb.0: |
| 79 | +; CHECK-NEXT: and %s0, %s0, (32)0 |
| 80 | +; CHECK-NEXT: lvl %s0 |
| 81 | +; CHECK-NEXT: vmrg %v1, %v1, %v0, %vm1 |
| 82 | +; CHECK-NEXT: lea %s16, 256 |
| 83 | +; CHECK-NEXT: lvl %s16 |
| 84 | +; CHECK-NEXT: vor %v0, (0)1, %v1 |
| 85 | +; CHECK-NEXT: b.l.t (, %s10) |
| 86 | + %r0 = call <256 x double> @llvm.vp.merge.v256f64(<256 x i1> %m, <256 x double> %i0, <256 x double> %i1, i32 %pivot) |
| 87 | + ret <256 x double> %r0 |
| 88 | +} |
| 89 | + |
| 90 | +define fastcc <256 x double> @test_vp_merge_v256f64_vr(<256 x double> %i0, double %s1, <256 x i1> %m, i32 %pivot) { |
| 91 | +; CHECK-LABEL: test_vp_merge_v256f64_vr: |
| 92 | +; CHECK: # %bb.0: |
| 93 | +; CHECK-NEXT: and %s1, %s1, (32)0 |
| 94 | +; CHECK-NEXT: lea %s2, 256 |
| 95 | +; CHECK-NEXT: lvl %s2 |
| 96 | +; CHECK-NEXT: vbrd %v1, %s0 |
| 97 | +; CHECK-NEXT: lvl %s1 |
| 98 | +; CHECK-NEXT: vmrg %v1, %v1, %v0, %vm1 |
| 99 | +; CHECK-NEXT: lea %s16, 256 |
| 100 | +; CHECK-NEXT: lvl %s16 |
| 101 | +; CHECK-NEXT: vor %v0, (0)1, %v1 |
| 102 | +; CHECK-NEXT: b.l.t (, %s10) |
| 103 | + %xins = insertelement <256 x double> undef, double %s1, i32 0 |
| 104 | + %i1 = shufflevector <256 x double> %xins, <256 x double> undef, <256 x i32> zeroinitializer |
| 105 | + %r0 = call <256 x double> @llvm.vp.merge.v256f64(<256 x i1> %m, <256 x double> %i0, <256 x double> %i1, i32 %pivot) |
| 106 | + ret <256 x double> %r0 |
| 107 | +} |
| 108 | + |
| 109 | +declare <256 x i64> @llvm.vp.merge.v256i64(<256 x i1>, <256 x i64>, <256 x i64>, i32) |
| 110 | + |
| 111 | +define fastcc <256 x i64> @test_vp_merge_v256i64_vv(<256 x i64> %i0, <256 x i64> %i1, <256 x i1> %m, i32 %pivot) { |
| 112 | +; CHECK-LABEL: test_vp_merge_v256i64_vv: |
| 113 | +; CHECK: # %bb.0: |
| 114 | +; CHECK-NEXT: and %s0, %s0, (32)0 |
| 115 | +; CHECK-NEXT: lvl %s0 |
| 116 | +; CHECK-NEXT: vmrg %v1, %v1, %v0, %vm1 |
| 117 | +; CHECK-NEXT: lea %s16, 256 |
| 118 | +; CHECK-NEXT: lvl %s16 |
| 119 | +; CHECK-NEXT: vor %v0, (0)1, %v1 |
| 120 | +; CHECK-NEXT: b.l.t (, %s10) |
| 121 | + %r0 = call <256 x i64> @llvm.vp.merge.v256i64(<256 x i1> %m, <256 x i64> %i0, <256 x i64> %i1, i32 %pivot) |
| 122 | + ret <256 x i64> %r0 |
| 123 | +} |
| 124 | + |
| 125 | +define fastcc <256 x i64> @test_vp_merge_v256i64_vr(<256 x i64> %i0, i64 %s1, <256 x i1> %m, i32 %pivot) { |
| 126 | +; CHECK-LABEL: test_vp_merge_v256i64_vr: |
| 127 | +; CHECK: # %bb.0: |
| 128 | +; CHECK-NEXT: and %s1, %s1, (32)0 |
| 129 | +; CHECK-NEXT: lea %s2, 256 |
| 130 | +; CHECK-NEXT: lvl %s2 |
| 131 | +; CHECK-NEXT: vbrd %v1, %s0 |
| 132 | +; CHECK-NEXT: lvl %s1 |
| 133 | +; CHECK-NEXT: vmrg %v1, %v1, %v0, %vm1 |
| 134 | +; CHECK-NEXT: lea %s16, 256 |
| 135 | +; CHECK-NEXT: lvl %s16 |
| 136 | +; CHECK-NEXT: vor %v0, (0)1, %v1 |
| 137 | +; CHECK-NEXT: b.l.t (, %s10) |
| 138 | + %xins = insertelement <256 x i64> undef, i64 %s1, i32 0 |
| 139 | + %i1 = shufflevector <256 x i64> %xins, <256 x i64> undef, <256 x i32> zeroinitializer |
| 140 | + %r0 = call <256 x i64> @llvm.vp.merge.v256i64(<256 x i1> %m, <256 x i64> %i0, <256 x i64> %i1, i32 %pivot) |
| 141 | + ret <256 x i64> %r0 |
| 142 | +} |
0 commit comments