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
|
// Copyright (c) 2006-2009 Graydon Hoare
// Copyright (c) 2009-2013 Mozilla Foundation
// Permission is hereby granted, free of charge, to any
// person obtaining a copy of this software and associated
// documentation files (the "Software"), to deal in the
// Software without restriction, including without
// limitation the rights to use, copy, modify, merge,
// publish, distribute, sublicense, and/or sell copies of
// the Software, and to permit persons to whom the Software
// is furnished to do so, subject to the following
// conditions:
// The above copyright notice and this permission notice
// shall be included in all copies or substantial portions
// of the Software.
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
// ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
// TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
// PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
// SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
// CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
// IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
// DEALINGS IN THE SOFTWARE.
pub use self::fake::*;
pub trait SimdExt {
fn simd_eq(self, rhs: Self) -> Self;
}
impl SimdExt for fake::u32x4 {
fn simd_eq(self, rhs: Self) -> Self {
if self == rhs {
fake::u32x4(0xffffffff, 0xffffffff, 0xffffffff, 0xffffffff)
} else {
fake::u32x4(0, 0, 0, 0)
}
}
}
mod fake {
use core::ops::{Add, BitAnd, BitOr, BitXor, Shl, Shr, Sub};
#[derive(Clone, Copy, PartialEq, Eq)]
#[allow(non_camel_case_types)]
pub struct u32x4(pub u32, pub u32, pub u32, pub u32);
impl Add for u32x4 {
type Output = u32x4;
fn add(self, rhs: u32x4) -> u32x4 {
u32x4(
self.0.wrapping_add(rhs.0),
self.1.wrapping_add(rhs.1),
self.2.wrapping_add(rhs.2),
self.3.wrapping_add(rhs.3),
)
}
}
impl Sub for u32x4 {
type Output = u32x4;
fn sub(self, rhs: u32x4) -> u32x4 {
u32x4(
self.0.wrapping_sub(rhs.0),
self.1.wrapping_sub(rhs.1),
self.2.wrapping_sub(rhs.2),
self.3.wrapping_sub(rhs.3),
)
}
}
impl BitAnd for u32x4 {
type Output = u32x4;
fn bitand(self, rhs: u32x4) -> u32x4 {
u32x4(
self.0 & rhs.0,
self.1 & rhs.1,
self.2 & rhs.2,
self.3 & rhs.3,
)
}
}
impl BitOr for u32x4 {
type Output = u32x4;
fn bitor(self, rhs: u32x4) -> u32x4 {
u32x4(
self.0 | rhs.0,
self.1 | rhs.1,
self.2 | rhs.2,
self.3 | rhs.3,
)
}
}
impl BitXor for u32x4 {
type Output = u32x4;
fn bitxor(self, rhs: u32x4) -> u32x4 {
u32x4(
self.0 ^ rhs.0,
self.1 ^ rhs.1,
self.2 ^ rhs.2,
self.3 ^ rhs.3,
)
}
}
impl Shl<usize> for u32x4 {
type Output = u32x4;
fn shl(self, amt: usize) -> u32x4 {
u32x4(self.0 << amt, self.1 << amt, self.2 << amt, self.3 << amt)
}
}
impl Shl<u32x4> for u32x4 {
type Output = u32x4;
fn shl(self, rhs: u32x4) -> u32x4 {
u32x4(
self.0 << rhs.0,
self.1 << rhs.1,
self.2 << rhs.2,
self.3 << rhs.3,
)
}
}
impl Shr<usize> for u32x4 {
type Output = u32x4;
fn shr(self, amt: usize) -> u32x4 {
u32x4(self.0 >> amt, self.1 >> amt, self.2 >> amt, self.3 >> amt)
}
}
impl Shr<u32x4> for u32x4 {
type Output = u32x4;
fn shr(self, rhs: u32x4) -> u32x4 {
u32x4(
self.0 >> rhs.0,
self.1 >> rhs.1,
self.2 >> rhs.2,
self.3 >> rhs.3,
)
}
}
#[derive(Clone, Copy)]
#[allow(non_camel_case_types)]
pub struct u64x2(pub u64, pub u64);
impl Add for u64x2 {
type Output = u64x2;
fn add(self, rhs: u64x2) -> u64x2 {
u64x2(self.0.wrapping_add(rhs.0), self.1.wrapping_add(rhs.1))
}
}
}
|
