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
|
// |reftest| skip-if(!this.hasOwnProperty("SIMD"))
/*
* Any copyright is dedicated to the Public Domain.
* https://creativecommons.org/publicdomain/zero/1.0/
*/
var Int8x16 = SIMD.Int8x16;
var Int16x8 = SIMD.Int16x8;
var Int32x4 = SIMD.Int32x4;
var Uint8x16 = SIMD.Uint8x16;
var Uint16x8 = SIMD.Uint16x8;
var Uint32x4 = SIMD.Uint32x4;
// Int8 shifts.
function lsh8(a, b) {
return (a << (b & 7)) << 24 >> 24;
}
function rsha8(a, b) {
return (a >> (b & 7)) << 24 >> 24;
}
function rshl8(a, b) {
return (a >>> (b & 7)) << 24 >> 24;
}
// Int16 shifts.
function lsh16(a, b) {
return (a << (b & 15)) << 16 >> 16;
}
function rsha16(a, b) {
return (a >> (b & 15)) << 16 >> 16;
}
function rshl16(a, b) {
return (a >>> (b & 15)) << 16 >> 16;
}
// Int32 shifts.
function lsh32(a, b) {
return (a << (b & 31)) | 0;
}
function rsha32(a, b) {
return (a >> (b & 31)) | 0;
}
function rshl32(a, b) {
return (a >>> (b & 31)) | 0;
}
// Uint8 shifts.
function ulsh8(a, b) {
return (a << (b & 7)) << 24 >>> 24;
}
function ursha8(a, b) {
return ((a << 24 >> 24) >> (b & 7)) << 24 >>> 24;
}
function urshl8(a, b) {
return (a >>> (b & 7)) << 24 >>> 24;
}
// Uint16 shifts.
function ulsh16(a, b) {
return (a << (b & 15)) << 16 >>> 16;
}
function ursha16(a, b) {
return ((a << 16 >> 16) >> (b & 15)) << 16 >>> 16;
}
function urshl16(a, b) {
return (a >>> (b & 15)) << 16 >>> 16;
}
// Uint32 shifts.
function ulsh32(a, b) {
return (a << (b & 31)) >>> 0;
}
function ursha32(a, b) {
return ((a | 0) >> (b & 31)) >>> 0;
}
function urshl32(a, b) {
return (a >>> (b & 31)) >>> 0;
}
function test() {
function TestError() {};
var good = {valueOf: () => 21};
var bad = {valueOf: () => {throw new TestError(); }};
for (var v of [
Int8x16(-1, 2, -3, 4, -5, 6, -7, 8, -9, 10, -11, 12, -13, 14, -15, 16),
Int8x16(INT8_MAX, INT8_MIN, INT8_MAX - 1, INT8_MIN + 1)
])
{
for (var bits = -2; bits < 12; bits++) {
testBinaryScalarFunc(v, bits, Int8x16.shiftLeftByScalar, lsh8);
testBinaryScalarFunc(v, bits, Int8x16.shiftRightByScalar, rsha8);
}
// Test that the shift count is coerced to an int32.
testBinaryScalarFunc(v, undefined, Int8x16.shiftLeftByScalar, lsh8);
testBinaryScalarFunc(v, 3.5, Int8x16.shiftLeftByScalar, lsh8);
testBinaryScalarFunc(v, good, Int8x16.shiftLeftByScalar, lsh8);
}
for (var v of [
Int16x8(-1, 2, -3, 4, -5, 6, -7, 8),
Int16x8(INT16_MAX, INT16_MIN, INT16_MAX - 1, INT16_MIN + 1)
])
{
for (var bits = -2; bits < 20; bits++) {
testBinaryScalarFunc(v, bits, Int16x8.shiftLeftByScalar, lsh16);
testBinaryScalarFunc(v, bits, Int16x8.shiftRightByScalar, rsha16);
}
// Test that the shift count is coerced to an int32.
testBinaryScalarFunc(v, undefined, Int16x8.shiftLeftByScalar, lsh16);
testBinaryScalarFunc(v, 3.5, Int16x8.shiftLeftByScalar, lsh16);
testBinaryScalarFunc(v, good, Int16x8.shiftLeftByScalar, lsh16);
}
for (var v of [
Int32x4(-1, 2, -3, 4),
Int32x4(INT32_MAX, INT32_MIN, INT32_MAX - 1, INT32_MIN + 1)
])
{
for (var bits = -2; bits < 36; bits++) {
testBinaryScalarFunc(v, bits, Int32x4.shiftLeftByScalar, lsh32);
testBinaryScalarFunc(v, bits, Int32x4.shiftRightByScalar, rsha32);
}
// Test that the shift count is coerced to an int32.
testBinaryScalarFunc(v, undefined, Int32x4.shiftLeftByScalar, lsh32);
testBinaryScalarFunc(v, 3.5, Int32x4.shiftLeftByScalar, lsh32);
testBinaryScalarFunc(v, good, Int32x4.shiftLeftByScalar, lsh32);
}
for (var v of [
Uint8x16(-1, 2, -3, 4, -5, 6, -7, 8, -9, 10, -11, 12, -13, 14, -15, 16),
Uint8x16(INT8_MAX, INT8_MIN, INT8_MAX - 1, INT8_MIN + 1, UINT8_MAX, UINT8_MAX - 1)
])
{
for (var bits = -2; bits < 12; bits++) {
testBinaryScalarFunc(v, bits, Uint8x16.shiftLeftByScalar, ulsh8);
testBinaryScalarFunc(v, bits, Uint8x16.shiftRightByScalar, urshl8);
}
// Test that the shift count is coerced to an int32.
testBinaryScalarFunc(v, undefined, Uint8x16.shiftLeftByScalar, ulsh8);
testBinaryScalarFunc(v, 3.5, Uint8x16.shiftLeftByScalar, ulsh8);
testBinaryScalarFunc(v, good, Uint8x16.shiftLeftByScalar, ulsh8);
}
for (var v of [
Uint16x8(-1, 2, -3, 4, -5, 6, -7, 8),
Uint16x8(INT16_MAX, INT16_MIN, INT16_MAX - 1, INT16_MIN + 1, UINT16_MAX, UINT16_MAX - 1)
])
{
for (var bits = -2; bits < 20; bits++) {
testBinaryScalarFunc(v, bits, Uint16x8.shiftLeftByScalar, ulsh16);
testBinaryScalarFunc(v, bits, Uint16x8.shiftRightByScalar, urshl16);
}
// Test that the shift count is coerced to an int32.
testBinaryScalarFunc(v, undefined, Uint16x8.shiftLeftByScalar, ulsh16);
testBinaryScalarFunc(v, 3.5, Uint16x8.shiftLeftByScalar, ulsh16);
testBinaryScalarFunc(v, good, Uint16x8.shiftLeftByScalar, ulsh16);
}
for (var v of [
Uint32x4(-1, 2, -3, 4),
Uint32x4(UINT32_MAX, UINT32_MAX - 1, 0, 1),
Uint32x4(INT32_MAX, INT32_MIN, INT32_MAX - 1, INT32_MIN + 1)
])
{
for (var bits = -2; bits < 36; bits++) {
testBinaryScalarFunc(v, bits, Uint32x4.shiftLeftByScalar, ulsh32);
testBinaryScalarFunc(v, bits, Uint32x4.shiftRightByScalar, urshl32);
}
// Test that the shift count is coerced to an int32.
testBinaryScalarFunc(v, undefined, Uint32x4.shiftLeftByScalar, ulsh32);
testBinaryScalarFunc(v, 3.5, Uint32x4.shiftLeftByScalar, ulsh32);
testBinaryScalarFunc(v, good, Uint32x4.shiftLeftByScalar, ulsh32);
}
var v = SIMD.Int8x16(1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16);
assertThrowsInstanceOf(() => SIMD.Int8x16.shiftLeftByScalar(v, bad), TestError);
assertThrowsInstanceOf(() => SIMD.Int8x16.shiftRightByScalar(v, bad), TestError);
var v = SIMD.Int16x8(1,2,3,4,5,6,7,8);
assertThrowsInstanceOf(() => SIMD.Int16x8.shiftLeftByScalar(v, bad), TestError);
assertThrowsInstanceOf(() => SIMD.Int16x8.shiftRightByScalar(v, bad), TestError);
var v = SIMD.Int32x4(1,2,3,4);
assertThrowsInstanceOf(() => SIMD.Int32x4.shiftLeftByScalar(v, bad), TestError);
assertThrowsInstanceOf(() => SIMD.Int32x4.shiftRightByScalar(v, bad), TestError);
var v = SIMD.Uint8x16(1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16);
assertThrowsInstanceOf(() => SIMD.Uint8x16.shiftLeftByScalar(v, bad), TestError);
assertThrowsInstanceOf(() => SIMD.Uint8x16.shiftRightByScalar(v, bad), TestError);
var v = SIMD.Uint16x8(1,2,3,4,5,6,7,8);
assertThrowsInstanceOf(() => SIMD.Uint16x8.shiftLeftByScalar(v, bad), TestError);
assertThrowsInstanceOf(() => SIMD.Uint16x8.shiftRightByScalar(v, bad), TestError);
var v = SIMD.Uint32x4(1,2,3,4);
assertThrowsInstanceOf(() => SIMD.Uint32x4.shiftLeftByScalar(v, bad), TestError);
assertThrowsInstanceOf(() => SIMD.Uint32x4.shiftRightByScalar(v, bad), TestError);
if (typeof reportCompare === "function")
reportCompare(true, true);
}
test();
|
