vec-const-07.ll
6.91 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
; Test vector replicates, v16i8 version.
;
; RUN: llc < %s -mtriple=s390x-linux-gnu -mcpu=z13 | FileCheck %s
; Test a byte-granularity replicate with the lowest useful value.
define <16 x i8> @f1() {
; CHECK-LABEL: f1:
; CHECK: vrepib %v24, 1
; CHECK: br %r14
ret <16 x i8> <i8 1, i8 1, i8 1, i8 1,
i8 1, i8 1, i8 1, i8 1,
i8 1, i8 1, i8 1, i8 1,
i8 1, i8 1, i8 1, i8 1>
}
; Test a byte-granularity replicate with an arbitrary value.
define <16 x i8> @f2() {
; CHECK-LABEL: f2:
; CHECK: vrepib %v24, -55
; CHECK: br %r14
ret <16 x i8> <i8 201, i8 201, i8 201, i8 201,
i8 201, i8 201, i8 201, i8 201,
i8 201, i8 201, i8 201, i8 201,
i8 201, i8 201, i8 201, i8 201>
}
; Test a byte-granularity replicate with the highest useful value.
define <16 x i8> @f3() {
; CHECK-LABEL: f3:
; CHECK: vrepib %v24, -2
; CHECK: br %r14
ret <16 x i8> <i8 254, i8 254, i8 254, i8 254,
i8 254, i8 254, i8 254, i8 254,
i8 254, i8 254, i8 254, i8 254,
i8 254, i8 254, i8 254, i8 254>
}
; Test a halfword-granularity replicate with the lowest useful value.
define <16 x i8> @f4() {
; CHECK-LABEL: f4:
; CHECK: vrepih %v24, 1
; CHECK: br %r14
ret <16 x i8> <i8 0, i8 1, i8 0, i8 1,
i8 0, i8 1, i8 0, i8 1,
i8 0, i8 1, i8 0, i8 1,
i8 0, i8 1, i8 0, i8 1>
}
; Test a halfword-granularity replicate with an arbitrary value.
define <16 x i8> @f5() {
; CHECK-LABEL: f5:
; CHECK: vrepih %v24, 25650
; CHECK: br %r14
ret <16 x i8> <i8 100, i8 50, i8 100, i8 50,
i8 100, i8 50, i8 100, i8 50,
i8 100, i8 50, i8 100, i8 50,
i8 100, i8 50, i8 100, i8 50>
}
; Test a halfword-granularity replicate with the highest useful value.
define <16 x i8> @f6() {
; CHECK-LABEL: f6:
; CHECK: vrepih %v24, -2
; CHECK: br %r14
ret <16 x i8> <i8 255, i8 254, i8 255, i8 254,
i8 255, i8 254, i8 255, i8 254,
i8 255, i8 254, i8 255, i8 254,
i8 255, i8 254, i8 255, i8 254>
}
; Test a word-granularity replicate with the lowest useful positive value.
define <16 x i8> @f7() {
; CHECK-LABEL: f7:
; CHECK: vrepif %v24, 1
; CHECK: br %r14
ret <16 x i8> <i8 0, i8 0, i8 0, i8 1,
i8 0, i8 0, i8 0, i8 1,
i8 0, i8 0, i8 0, i8 1,
i8 0, i8 0, i8 0, i8 1>
}
; Test a word-granularity replicate with the highest in-range value.
define <16 x i8> @f8() {
; CHECK-LABEL: f8:
; CHECK: vrepif %v24, 32767
; CHECK: br %r14
ret <16 x i8> <i8 0, i8 0, i8 127, i8 255,
i8 0, i8 0, i8 127, i8 255,
i8 0, i8 0, i8 127, i8 255,
i8 0, i8 0, i8 127, i8 255>
}
; Test a word-granularity replicate with the next highest value.
; This cannot use VREPIF.
define <16 x i8> @f9() {
; CHECK-LABEL: f9:
; CHECK-NOT: vrepif
; CHECK: br %r14
ret <16 x i8> <i8 0, i8 0, i8 128, i8 0,
i8 0, i8 0, i8 128, i8 0,
i8 0, i8 0, i8 128, i8 0,
i8 0, i8 0, i8 128, i8 0>
}
; Test a word-granularity replicate with the lowest in-range value.
define <16 x i8> @f10() {
; CHECK-LABEL: f10:
; CHECK: vrepif %v24, -32768
; CHECK: br %r14
ret <16 x i8> <i8 255, i8 255, i8 128, i8 0,
i8 255, i8 255, i8 128, i8 0,
i8 255, i8 255, i8 128, i8 0,
i8 255, i8 255, i8 128, i8 0>
}
; Test a word-granularity replicate with the next lowest value.
; This cannot use VREPIF.
define <16 x i8> @f11() {
; CHECK-LABEL: f11:
; CHECK-NOT: vrepif
; CHECK: br %r14
ret <16 x i8> <i8 255, i8 255, i8 127, i8 255,
i8 255, i8 255, i8 127, i8 255,
i8 255, i8 255, i8 127, i8 255,
i8 255, i8 255, i8 127, i8 255>
}
; Test a word-granularity replicate with the highest useful negative value.
define <16 x i8> @f12() {
; CHECK-LABEL: f12:
; CHECK: vrepif %v24, -2
; CHECK: br %r14
ret <16 x i8> <i8 255, i8 255, i8 255, i8 254,
i8 255, i8 255, i8 255, i8 254,
i8 255, i8 255, i8 255, i8 254,
i8 255, i8 255, i8 255, i8 254>
}
; Test a doubleword-granularity replicate with the lowest useful positive
; value.
define <16 x i8> @f13() {
; CHECK-LABEL: f13:
; CHECK: vrepig %v24, 1
; CHECK: br %r14
ret <16 x i8> <i8 0, i8 0, i8 0, i8 0,
i8 0, i8 0, i8 0, i8 1,
i8 0, i8 0, i8 0, i8 0,
i8 0, i8 0, i8 0, i8 1>
}
; Test a doubleword-granularity replicate with the highest in-range value.
define <16 x i8> @f14() {
; CHECK-LABEL: f14:
; CHECK: vrepig %v24, 32767
; CHECK: br %r14
ret <16 x i8> <i8 0, i8 0, i8 0, i8 0,
i8 0, i8 0, i8 127, i8 255,
i8 0, i8 0, i8 0, i8 0,
i8 0, i8 0, i8 127, i8 255>
}
; Test a doubleword-granularity replicate with the next highest value.
; This cannot use VREPIG.
define <16 x i8> @f15() {
; CHECK-LABEL: f15:
; CHECK-NOT: vrepig
; CHECK: br %r14
ret <16 x i8> <i8 0, i8 0, i8 0, i8 0,
i8 0, i8 0, i8 128, i8 0,
i8 0, i8 0, i8 0, i8 0,
i8 0, i8 0, i8 128, i8 0>
}
; Test a doubleword-granularity replicate with the lowest in-range value.
define <16 x i8> @f16() {
; CHECK-LABEL: f16:
; CHECK: vrepig %v24, -32768
; CHECK: br %r14
ret <16 x i8> <i8 255, i8 255, i8 255, i8 255,
i8 255, i8 255, i8 128, i8 0,
i8 255, i8 255, i8 255, i8 255,
i8 255, i8 255, i8 128, i8 0>
}
; Test a doubleword-granularity replicate with the next lowest value.
; This cannot use VREPIG.
define <16 x i8> @f17() {
; CHECK-LABEL: f17:
; CHECK-NOT: vrepig
; CHECK: br %r14
ret <16 x i8> <i8 255, i8 255, i8 255, i8 255,
i8 255, i8 255, i8 127, i8 255,
i8 255, i8 255, i8 255, i8 255,
i8 255, i8 255, i8 127, i8 255>
}
; Test a doubleword-granularity replicate with the highest useful negative
; value.
define <16 x i8> @f18() {
; CHECK-LABEL: f18:
; CHECK: vrepig %v24, -2
; CHECK: br %r14
ret <16 x i8> <i8 255, i8 255, i8 255, i8 255,
i8 255, i8 255, i8 255, i8 254,
i8 255, i8 255, i8 255, i8 255,
i8 255, i8 255, i8 255, i8 254>
}
; Repeat f14 with undefs optimistically treated as 0.
define <16 x i8> @f19() {
; CHECK-LABEL: f19:
; CHECK: vrepig %v24, 32767
; CHECK: br %r14
ret <16 x i8> <i8 0, i8 undef, i8 0, i8 0,
i8 0, i8 0, i8 127, i8 255,
i8 undef, i8 0, i8 undef, i8 0,
i8 0, i8 0, i8 127, i8 255>
}
; Repeat f18 with undefs optimistically treated as -1.
define <16 x i8> @f20() {
; CHECK-LABEL: f20:
; CHECK: vrepig %v24, -2
; CHECK: br %r14
ret <16 x i8> <i8 undef, i8 255, i8 255, i8 255,
i8 255, i8 255, i8 undef, i8 254,
i8 255, i8 255, i8 255, i8 undef,
i8 255, i8 undef, i8 255, i8 254>
}