numo-narray-alt 0.9.11 → 0.9.12
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- checksums.yaml +4 -4
- data/Gemfile +0 -1
- data/README.md +7 -0
- data/ext/numo/narray/numo/narray.h +2 -2
- data/ext/numo/narray/numo/types/robj_macro.h +1 -1
- data/ext/numo/narray/src/mh/bincount.h +233 -0
- data/ext/numo/narray/src/mh/bit/and.h +225 -0
- data/ext/numo/narray/src/mh/bit/left_shift.h +225 -0
- data/ext/numo/narray/src/mh/bit/not.h +173 -0
- data/ext/numo/narray/src/mh/bit/or.h +225 -0
- data/ext/numo/narray/src/mh/bit/right_shift.h +225 -0
- data/ext/numo/narray/src/mh/bit/xor.h +225 -0
- data/ext/numo/narray/src/mh/coerce_cast.h +9 -0
- data/ext/numo/narray/src/mh/comp/binary_func.h +37 -0
- data/ext/numo/narray/src/mh/comp/eq.h +26 -0
- data/ext/numo/narray/src/mh/comp/ge.h +26 -0
- data/ext/numo/narray/src/mh/comp/gt.h +26 -0
- data/ext/numo/narray/src/mh/comp/le.h +26 -0
- data/ext/numo/narray/src/mh/comp/lt.h +26 -0
- data/ext/numo/narray/src/mh/comp/ne.h +26 -0
- data/ext/numo/narray/src/mh/comp/nearly_eq.h +26 -0
- data/ext/numo/narray/src/mh/divmod.h +142 -0
- data/ext/numo/narray/src/mh/eye.h +1 -1
- data/ext/numo/narray/src/mh/fill.h +94 -0
- data/ext/numo/narray/src/mh/format.h +108 -0
- data/ext/numo/narray/src/mh/format_to_a.h +89 -0
- data/ext/numo/narray/src/mh/inspect.h +33 -0
- data/ext/numo/narray/src/mh/isfinite.h +42 -0
- data/ext/numo/narray/src/mh/isinf.h +42 -0
- data/ext/numo/narray/src/mh/isnan.h +42 -0
- data/ext/numo/narray/src/mh/isneginf.h +42 -0
- data/ext/numo/narray/src/mh/isposinf.h +42 -0
- data/ext/numo/narray/src/mh/math/acos.h +2 -2
- data/ext/numo/narray/src/mh/math/acosh.h +2 -2
- data/ext/numo/narray/src/mh/math/asin.h +2 -2
- data/ext/numo/narray/src/mh/math/asinh.h +2 -2
- data/ext/numo/narray/src/mh/math/atan.h +2 -2
- data/ext/numo/narray/src/mh/math/atan2.h +3 -3
- data/ext/numo/narray/src/mh/math/atanh.h +2 -2
- data/ext/numo/narray/src/mh/math/cbrt.h +2 -2
- data/ext/numo/narray/src/mh/math/cos.h +2 -2
- data/ext/numo/narray/src/mh/math/cosh.h +2 -2
- data/ext/numo/narray/src/mh/math/erf.h +2 -2
- data/ext/numo/narray/src/mh/math/erfc.h +2 -2
- data/ext/numo/narray/src/mh/math/exp.h +2 -2
- data/ext/numo/narray/src/mh/math/exp10.h +2 -2
- data/ext/numo/narray/src/mh/math/exp2.h +2 -2
- data/ext/numo/narray/src/mh/math/expm1.h +2 -2
- data/ext/numo/narray/src/mh/math/frexp.h +3 -3
- data/ext/numo/narray/src/mh/math/hypot.h +3 -3
- data/ext/numo/narray/src/mh/math/ldexp.h +3 -3
- data/ext/numo/narray/src/mh/math/log.h +2 -2
- data/ext/numo/narray/src/mh/math/log10.h +2 -2
- data/ext/numo/narray/src/mh/math/log1p.h +2 -2
- data/ext/numo/narray/src/mh/math/log2.h +2 -2
- data/ext/numo/narray/src/mh/math/sin.h +2 -2
- data/ext/numo/narray/src/mh/math/sinc.h +2 -2
- data/ext/numo/narray/src/mh/math/sinh.h +2 -2
- data/ext/numo/narray/src/mh/math/sqrt.h +8 -8
- data/ext/numo/narray/src/mh/math/tan.h +2 -2
- data/ext/numo/narray/src/mh/math/tanh.h +2 -2
- data/ext/numo/narray/src/mh/math/unary_func.h +3 -3
- data/ext/numo/narray/src/mh/op/add.h +78 -0
- data/ext/numo/narray/src/mh/op/binary_func.h +423 -0
- data/ext/numo/narray/src/mh/op/div.h +118 -0
- data/ext/numo/narray/src/mh/op/mod.h +108 -0
- data/ext/numo/narray/src/mh/op/mul.h +78 -0
- data/ext/numo/narray/src/mh/op/sub.h +78 -0
- data/ext/numo/narray/src/mh/rand.h +2 -2
- data/ext/numo/narray/src/mh/round/ceil.h +11 -0
- data/ext/numo/narray/src/mh/round/floor.h +11 -0
- data/ext/numo/narray/src/mh/round/rint.h +9 -0
- data/ext/numo/narray/src/mh/round/round.h +11 -0
- data/ext/numo/narray/src/mh/round/trunc.h +11 -0
- data/ext/numo/narray/src/mh/round/unary_func.h +127 -0
- data/ext/numo/narray/src/mh/to_a.h +78 -0
- data/ext/numo/narray/src/t_bit.c +45 -234
- data/ext/numo/narray/src/t_dcomplex.c +584 -1809
- data/ext/numo/narray/src/t_dfloat.c +429 -2432
- data/ext/numo/narray/src/t_int16.c +481 -2283
- data/ext/numo/narray/src/t_int32.c +481 -2283
- data/ext/numo/narray/src/t_int64.c +481 -2283
- data/ext/numo/narray/src/t_int8.c +408 -1873
- data/ext/numo/narray/src/t_robject.c +448 -1977
- data/ext/numo/narray/src/t_scomplex.c +584 -1809
- data/ext/numo/narray/src/t_sfloat.c +429 -2434
- data/ext/numo/narray/src/t_uint16.c +480 -2278
- data/ext/numo/narray/src/t_uint32.c +480 -2278
- data/ext/numo/narray/src/t_uint64.c +480 -2278
- data/ext/numo/narray/src/t_uint8.c +407 -1868
- metadata +41 -2
|
@@ -0,0 +1,423 @@
|
|
|
1
|
+
#ifndef NUMO_NARRAY_MH_OP_BINARY_FUNC_H
|
|
2
|
+
#define NUMO_NARRAY_MH_OP_BINARY_FUNC_H 1
|
|
3
|
+
|
|
4
|
+
#define ITER_BINARY_INIT_VARS() \
|
|
5
|
+
size_t n; \
|
|
6
|
+
char* p1; \
|
|
7
|
+
char* p2; \
|
|
8
|
+
char* p3; \
|
|
9
|
+
ssize_t s1; \
|
|
10
|
+
ssize_t s2; \
|
|
11
|
+
ssize_t s3; \
|
|
12
|
+
INIT_COUNTER(lp, n); \
|
|
13
|
+
INIT_PTR(lp, 0, p1, s1); \
|
|
14
|
+
INIT_PTR(lp, 1, p2, s2); \
|
|
15
|
+
INIT_PTR(lp, 2, p3, s3);
|
|
16
|
+
|
|
17
|
+
#define ITER_BINARY_INPLACE_OR_NEW_ARY(fOpFunc, tDType) \
|
|
18
|
+
if (p1 == p3) { \
|
|
19
|
+
for (size_t i = 0; i < n; i++) { \
|
|
20
|
+
((tDType*)p1)[i] = m_##fOpFunc(((tDType*)p1)[i], ((tDType*)p2)[i]); \
|
|
21
|
+
} \
|
|
22
|
+
} else { \
|
|
23
|
+
for (size_t i = 0; i < n; i++) { \
|
|
24
|
+
((tDType*)p3)[i] = m_##fOpFunc(((tDType*)p1)[i], ((tDType*)p2)[i]); \
|
|
25
|
+
} \
|
|
26
|
+
}
|
|
27
|
+
|
|
28
|
+
#define ITER_BINARY_INPLACE_OR_NEW_ARY_ZERODIV(fOpFunc, tDType) \
|
|
29
|
+
if (p1 == p3) { \
|
|
30
|
+
for (size_t i = 0; i < n; i++) { \
|
|
31
|
+
if ((((tDType*)p2)[i]) == 0) { \
|
|
32
|
+
lp->err_type = rb_eZeroDivError; \
|
|
33
|
+
return; \
|
|
34
|
+
} \
|
|
35
|
+
((tDType*)p1)[i] = m_##fOpFunc(((tDType*)p1)[i], ((tDType*)p2)[i]); \
|
|
36
|
+
} \
|
|
37
|
+
} else { \
|
|
38
|
+
for (size_t i = 0; i < n; i++) { \
|
|
39
|
+
if ((((tDType*)p2)[i]) == 0) { \
|
|
40
|
+
lp->err_type = rb_eZeroDivError; \
|
|
41
|
+
return; \
|
|
42
|
+
} \
|
|
43
|
+
((tDType*)p3)[i] = m_##fOpFunc(((tDType*)p1)[i], ((tDType*)p2)[i]); \
|
|
44
|
+
} \
|
|
45
|
+
}
|
|
46
|
+
|
|
47
|
+
#define ITER_BINARY_INPLACE_OR_NEW_PTR_ARY(fOpFunc, tDType) \
|
|
48
|
+
if (p1 == p3) { \
|
|
49
|
+
for (size_t i = 0; i < n; i++) { \
|
|
50
|
+
*(tDType*)p1 = m_##fOpFunc(*(tDType*)p1, *(tDType*)p2); \
|
|
51
|
+
p1 += s1; \
|
|
52
|
+
p2 += s2; \
|
|
53
|
+
} \
|
|
54
|
+
} else { \
|
|
55
|
+
for (size_t i = 0; i < n; i++) { \
|
|
56
|
+
*(tDType*)p3 = m_##fOpFunc(*(tDType*)p1, *(tDType*)p2); \
|
|
57
|
+
p1 += s1; \
|
|
58
|
+
p2 += s2; \
|
|
59
|
+
p3 += s3; \
|
|
60
|
+
} \
|
|
61
|
+
}
|
|
62
|
+
|
|
63
|
+
#define ITER_BINARY_INPLACE_OR_NEW_PTR_ARY_ZERODIV(fOpFunc, tDType) \
|
|
64
|
+
if (p1 == p3) { \
|
|
65
|
+
for (size_t i = 0; i < n; i++) { \
|
|
66
|
+
if ((*(tDType*)p2) == 0) { \
|
|
67
|
+
lp->err_type = rb_eZeroDivError; \
|
|
68
|
+
return; \
|
|
69
|
+
} \
|
|
70
|
+
*(tDType*)p1 = m_##fOpFunc(*(tDType*)p1, *(tDType*)p2); \
|
|
71
|
+
p1 += s1; \
|
|
72
|
+
p2 += s2; \
|
|
73
|
+
} \
|
|
74
|
+
} else { \
|
|
75
|
+
for (size_t i = 0; i < n; i++) { \
|
|
76
|
+
if ((*(tDType*)p2) == 0) { \
|
|
77
|
+
lp->err_type = rb_eZeroDivError; \
|
|
78
|
+
return; \
|
|
79
|
+
} \
|
|
80
|
+
*(tDType*)p3 = m_##fOpFunc(*(tDType*)p1, *(tDType*)p2); \
|
|
81
|
+
p1 += s1; \
|
|
82
|
+
p2 += s2; \
|
|
83
|
+
p3 += s3; \
|
|
84
|
+
} \
|
|
85
|
+
}
|
|
86
|
+
|
|
87
|
+
#define ITER_BINARY_INPLACE_OR_NEW_SCL(fOpFunc, tDType) \
|
|
88
|
+
if (p1 == p3) { \
|
|
89
|
+
for (size_t i = 0; i < n; i++) { \
|
|
90
|
+
((tDType*)p1)[i] = m_##fOpFunc(((tDType*)p1)[i], *(tDType*)p2); \
|
|
91
|
+
} \
|
|
92
|
+
} else { \
|
|
93
|
+
for (size_t i = 0; i < n; i++) { \
|
|
94
|
+
((tDType*)p3)[i] = m_##fOpFunc(((tDType*)p1)[i], *(tDType*)p2); \
|
|
95
|
+
} \
|
|
96
|
+
}
|
|
97
|
+
|
|
98
|
+
#define ITER_BINARY_NEW_PTR_SCL(fOpFunc, tDType) \
|
|
99
|
+
for (size_t i = 0; i < n; i++) { \
|
|
100
|
+
*(tDType*)p3 = m_##fOpFunc(*(tDType*)p1, *(tDType*)p2); \
|
|
101
|
+
p1 += s1; \
|
|
102
|
+
p3 += s3; \
|
|
103
|
+
}
|
|
104
|
+
|
|
105
|
+
#define ITER_BINARY_FALLBACK_LOOP(fOpFunc, tDType) \
|
|
106
|
+
for (size_t i = 0; i < n; i++) { \
|
|
107
|
+
tDType x; \
|
|
108
|
+
tDType y; \
|
|
109
|
+
tDType z; \
|
|
110
|
+
GET_DATA_STRIDE(p1, s1, tDType, x); \
|
|
111
|
+
GET_DATA_STRIDE(p2, s2, tDType, y); \
|
|
112
|
+
z = m_##fOpFunc(x, y); \
|
|
113
|
+
SET_DATA_STRIDE(p3, s3, tDType, z); \
|
|
114
|
+
}
|
|
115
|
+
|
|
116
|
+
#define DEF_BINARY_SELF_FUNC(fOpFunc, tDType, tNAryClass) \
|
|
117
|
+
static VALUE tDType##_##fOpFunc##_self(VALUE self, VALUE other) { \
|
|
118
|
+
ndfunc_arg_in_t ain[2] = { { tNAryClass, 0 }, { tNAryClass, 0 } }; \
|
|
119
|
+
ndfunc_arg_out_t aout[1] = { { tNAryClass, 0 } }; \
|
|
120
|
+
ndfunc_t ndf = { iter_##tDType##_##fOpFunc, STRIDE_LOOP, 2, 1, ain, aout }; \
|
|
121
|
+
return na_ndloop(&ndf, 2, self, other); \
|
|
122
|
+
}
|
|
123
|
+
|
|
124
|
+
#define DEF_BINARY_FUNC(fOpFunc, sRbOp, tDType, tNAryClass) \
|
|
125
|
+
static VALUE tDType##_##fOpFunc(VALUE self, VALUE other) { \
|
|
126
|
+
VALUE klass = na_upcast(rb_obj_class(self), rb_obj_class(other)); \
|
|
127
|
+
if (klass == tNAryClass) { \
|
|
128
|
+
return tDType##_##fOpFunc##_self(self, other); \
|
|
129
|
+
} else { \
|
|
130
|
+
VALUE v = rb_funcall(klass, id_cast, 1, self); \
|
|
131
|
+
return rb_funcall(v, sRbOp, 1, other); \
|
|
132
|
+
} \
|
|
133
|
+
}
|
|
134
|
+
|
|
135
|
+
#define DEF_BINARY_SFLT_SSE2_ITER_FUNC(fOpFunc, fSimdOp) \
|
|
136
|
+
static void iter_sfloat_##fOpFunc(na_loop_t* const lp) { \
|
|
137
|
+
size_t i = 0; \
|
|
138
|
+
ITER_BINARY_INIT_VARS() \
|
|
139
|
+
\
|
|
140
|
+
size_t cnt; \
|
|
141
|
+
size_t cnt_simd_loop = -1; \
|
|
142
|
+
__m128 a; \
|
|
143
|
+
__m128 b; \
|
|
144
|
+
size_t num_pack; \
|
|
145
|
+
num_pack = SIMD_ALIGNMENT_SIZE / sizeof(sfloat); \
|
|
146
|
+
\
|
|
147
|
+
if (is_aligned(p1, sizeof(sfloat)) && is_aligned(p2, sizeof(sfloat)) && \
|
|
148
|
+
is_aligned(p3, sizeof(sfloat))) { \
|
|
149
|
+
if (s1 == sizeof(sfloat) && s2 == sizeof(sfloat) && s3 == sizeof(sfloat)) { \
|
|
150
|
+
if ((n >= num_pack) && \
|
|
151
|
+
is_same_aligned3( \
|
|
152
|
+
&((sfloat*)p1)[i], &((sfloat*)p2)[i], &((sfloat*)p3)[i], SIMD_ALIGNMENT_SIZE \
|
|
153
|
+
)) { \
|
|
154
|
+
cnt = get_count_of_elements_not_aligned_to_simd_size( \
|
|
155
|
+
&((sfloat*)p1)[i], SIMD_ALIGNMENT_SIZE, sizeof(sfloat) \
|
|
156
|
+
); \
|
|
157
|
+
if (p1 == p3) { \
|
|
158
|
+
for (i = 0; i < cnt; i++) { \
|
|
159
|
+
((sfloat*)p1)[i] = m_##fOpFunc(((sfloat*)p1)[i], ((sfloat*)p2)[i]); \
|
|
160
|
+
} \
|
|
161
|
+
} else { \
|
|
162
|
+
for (i = 0; i < cnt; i++) { \
|
|
163
|
+
((sfloat*)p3)[i] = m_##fOpFunc(((sfloat*)p1)[i], ((sfloat*)p2)[i]); \
|
|
164
|
+
} \
|
|
165
|
+
} \
|
|
166
|
+
cnt_simd_loop = (n - i) % num_pack; \
|
|
167
|
+
if (p1 == p3) { \
|
|
168
|
+
for (; i < n - cnt_simd_loop; i += num_pack) { \
|
|
169
|
+
a = _mm_load_ps(&((sfloat*)p1)[i]); \
|
|
170
|
+
b = _mm_load_ps(&((sfloat*)p2)[i]); \
|
|
171
|
+
a = fSimdOp(a, b); \
|
|
172
|
+
_mm_store_ps(&((sfloat*)p1)[i], a); \
|
|
173
|
+
} \
|
|
174
|
+
} else { \
|
|
175
|
+
for (; i < n - cnt_simd_loop; i += num_pack) { \
|
|
176
|
+
a = _mm_load_ps(&((sfloat*)p1)[i]); \
|
|
177
|
+
b = _mm_load_ps(&((sfloat*)p2)[i]); \
|
|
178
|
+
a = fSimdOp(a, b); \
|
|
179
|
+
_mm_stream_ps(&((sfloat*)p3)[i], a); \
|
|
180
|
+
} \
|
|
181
|
+
} \
|
|
182
|
+
} \
|
|
183
|
+
if (cnt_simd_loop != 0) { \
|
|
184
|
+
if (p1 == p3) { \
|
|
185
|
+
for (; i < n; i++) { \
|
|
186
|
+
((sfloat*)p1)[i] = m_##fOpFunc(((sfloat*)p1)[i], ((sfloat*)p2)[i]); \
|
|
187
|
+
} \
|
|
188
|
+
} else { \
|
|
189
|
+
for (; i < n; i++) { \
|
|
190
|
+
((sfloat*)p3)[i] = m_##fOpFunc(((sfloat*)p1)[i], ((sfloat*)p2)[i]); \
|
|
191
|
+
} \
|
|
192
|
+
} \
|
|
193
|
+
} \
|
|
194
|
+
return; \
|
|
195
|
+
} \
|
|
196
|
+
if (is_aligned_step(s1, sizeof(sfloat)) && is_aligned_step(s2, sizeof(sfloat)) && \
|
|
197
|
+
is_aligned_step(s3, sizeof(sfloat))) { \
|
|
198
|
+
if (s2 == 0) { \
|
|
199
|
+
if (s1 == sizeof(sfloat) && s3 == sizeof(sfloat)) { \
|
|
200
|
+
b = _mm_load1_ps(&((sfloat*)p2)[0]); \
|
|
201
|
+
if ((n >= num_pack) && \
|
|
202
|
+
is_same_aligned2(&((sfloat*)p1)[i], &((sfloat*)p3)[i], SIMD_ALIGNMENT_SIZE)) { \
|
|
203
|
+
cnt = get_count_of_elements_not_aligned_to_simd_size( \
|
|
204
|
+
&((sfloat*)p1)[i], SIMD_ALIGNMENT_SIZE, sizeof(sfloat) \
|
|
205
|
+
); \
|
|
206
|
+
if (p1 == p3) { \
|
|
207
|
+
for (i = 0; i < cnt; i++) { \
|
|
208
|
+
((sfloat*)p1)[i] = m_##fOpFunc(((sfloat*)p1)[i], *(sfloat*)p2); \
|
|
209
|
+
} \
|
|
210
|
+
} else { \
|
|
211
|
+
for (i = 0; i < cnt; i++) { \
|
|
212
|
+
((sfloat*)p3)[i] = m_##fOpFunc(((sfloat*)p1)[i], *(sfloat*)p2); \
|
|
213
|
+
} \
|
|
214
|
+
} \
|
|
215
|
+
cnt_simd_loop = (n - i) % num_pack; \
|
|
216
|
+
if (p1 == p3) { \
|
|
217
|
+
for (; i < n - cnt_simd_loop; i += num_pack) { \
|
|
218
|
+
a = _mm_load_ps(&((sfloat*)p1)[i]); \
|
|
219
|
+
a = fSimdOp(a, b); \
|
|
220
|
+
_mm_store_ps(&((sfloat*)p1)[i], a); \
|
|
221
|
+
} \
|
|
222
|
+
} else { \
|
|
223
|
+
for (; i < n - cnt_simd_loop; i += num_pack) { \
|
|
224
|
+
a = _mm_load_ps(&((sfloat*)p1)[i]); \
|
|
225
|
+
a = fSimdOp(a, b); \
|
|
226
|
+
_mm_stream_ps(&((sfloat*)p3)[i], a); \
|
|
227
|
+
} \
|
|
228
|
+
} \
|
|
229
|
+
} \
|
|
230
|
+
if (cnt_simd_loop != 0) { \
|
|
231
|
+
if (p1 == p3) { \
|
|
232
|
+
for (; i < n; i++) { \
|
|
233
|
+
((sfloat*)p1)[i] = m_##fOpFunc(((sfloat*)p1)[i], *(sfloat*)p2); \
|
|
234
|
+
} \
|
|
235
|
+
} else { \
|
|
236
|
+
for (; i < n; i++) { \
|
|
237
|
+
((sfloat*)p3)[i] = m_##fOpFunc(((sfloat*)p1)[i], *(sfloat*)p2); \
|
|
238
|
+
} \
|
|
239
|
+
} \
|
|
240
|
+
} \
|
|
241
|
+
} else { \
|
|
242
|
+
for (i = 0; i < n; i++) { \
|
|
243
|
+
*(sfloat*)p3 = m_##fOpFunc(*(sfloat*)p1, *(sfloat*)p2); \
|
|
244
|
+
p1 += s1; \
|
|
245
|
+
p3 += s3; \
|
|
246
|
+
} \
|
|
247
|
+
} \
|
|
248
|
+
} else { \
|
|
249
|
+
if (p1 == p3) { \
|
|
250
|
+
for (i = 0; i < n; i++) { \
|
|
251
|
+
*(sfloat*)p1 = m_##fOpFunc(*(sfloat*)p1, *(sfloat*)p2); \
|
|
252
|
+
p1 += s1; \
|
|
253
|
+
p2 += s2; \
|
|
254
|
+
} \
|
|
255
|
+
} else { \
|
|
256
|
+
for (i = 0; i < n; i++) { \
|
|
257
|
+
*(sfloat*)p3 = m_##fOpFunc(*(sfloat*)p1, *(sfloat*)p2); \
|
|
258
|
+
p1 += s1; \
|
|
259
|
+
p2 += s2; \
|
|
260
|
+
p3 += s3; \
|
|
261
|
+
} \
|
|
262
|
+
} \
|
|
263
|
+
} \
|
|
264
|
+
return; \
|
|
265
|
+
} \
|
|
266
|
+
} \
|
|
267
|
+
\
|
|
268
|
+
for (i = 0; i < n; i++) { \
|
|
269
|
+
sfloat x; \
|
|
270
|
+
sfloat y; \
|
|
271
|
+
sfloat z; \
|
|
272
|
+
GET_DATA_STRIDE(p1, s1, sfloat, x); \
|
|
273
|
+
GET_DATA_STRIDE(p2, s2, sfloat, y); \
|
|
274
|
+
z = m_##fOpFunc(x, y); \
|
|
275
|
+
SET_DATA_STRIDE(p3, s3, sfloat, z); \
|
|
276
|
+
} \
|
|
277
|
+
}
|
|
278
|
+
|
|
279
|
+
#define DEF_BINARY_DFLT_SSE2_ITER_FUNC(fOpFunc, fSimdOp) \
|
|
280
|
+
static void iter_dfloat_##fOpFunc(na_loop_t* const lp) { \
|
|
281
|
+
size_t i = 0; \
|
|
282
|
+
ITER_BINARY_INIT_VARS() \
|
|
283
|
+
\
|
|
284
|
+
size_t cnt; \
|
|
285
|
+
size_t cnt_simd_loop = -1; \
|
|
286
|
+
__m128d a; \
|
|
287
|
+
__m128d b; \
|
|
288
|
+
size_t num_pack; \
|
|
289
|
+
num_pack = SIMD_ALIGNMENT_SIZE / sizeof(dfloat); \
|
|
290
|
+
\
|
|
291
|
+
if (is_aligned(p1, sizeof(dfloat)) && is_aligned(p2, sizeof(dfloat)) && \
|
|
292
|
+
is_aligned(p3, sizeof(dfloat))) { \
|
|
293
|
+
if (s1 == sizeof(dfloat) && s2 == sizeof(dfloat) && s3 == sizeof(dfloat)) { \
|
|
294
|
+
if ((n >= num_pack) && \
|
|
295
|
+
is_same_aligned3( \
|
|
296
|
+
&((dfloat*)p1)[i], &((dfloat*)p2)[i], &((dfloat*)p3)[i], SIMD_ALIGNMENT_SIZE \
|
|
297
|
+
)) { \
|
|
298
|
+
cnt = get_count_of_elements_not_aligned_to_simd_size( \
|
|
299
|
+
&((dfloat*)p1)[i], SIMD_ALIGNMENT_SIZE, sizeof(dfloat) \
|
|
300
|
+
); \
|
|
301
|
+
if (p1 == p3) { \
|
|
302
|
+
for (i = 0; i < cnt; i++) { \
|
|
303
|
+
((dfloat*)p1)[i] = m_##fOpFunc(((dfloat*)p1)[i], ((dfloat*)p2)[i]); \
|
|
304
|
+
} \
|
|
305
|
+
} else { \
|
|
306
|
+
for (i = 0; i < cnt; i++) { \
|
|
307
|
+
((dfloat*)p3)[i] = m_##fOpFunc(((dfloat*)p1)[i], ((dfloat*)p2)[i]); \
|
|
308
|
+
} \
|
|
309
|
+
} \
|
|
310
|
+
cnt_simd_loop = (n - i) % num_pack; \
|
|
311
|
+
if (p1 == p3) { \
|
|
312
|
+
for (; i < n - cnt_simd_loop; i += num_pack) { \
|
|
313
|
+
a = _mm_load_pd(&((dfloat*)p1)[i]); \
|
|
314
|
+
b = _mm_load_pd(&((dfloat*)p2)[i]); \
|
|
315
|
+
a = fSimdOp(a, b); \
|
|
316
|
+
_mm_store_pd(&((dfloat*)p1)[i], a); \
|
|
317
|
+
} \
|
|
318
|
+
} else { \
|
|
319
|
+
for (; i < n - cnt_simd_loop; i += num_pack) { \
|
|
320
|
+
a = _mm_load_pd(&((dfloat*)p1)[i]); \
|
|
321
|
+
b = _mm_load_pd(&((dfloat*)p2)[i]); \
|
|
322
|
+
a = fSimdOp(a, b); \
|
|
323
|
+
_mm_stream_pd(&((dfloat*)p3)[i], a); \
|
|
324
|
+
} \
|
|
325
|
+
} \
|
|
326
|
+
} \
|
|
327
|
+
if (cnt_simd_loop != 0) { \
|
|
328
|
+
if (p1 == p3) { \
|
|
329
|
+
for (; i < n; i++) { \
|
|
330
|
+
((dfloat*)p1)[i] = m_##fOpFunc(((dfloat*)p1)[i], ((dfloat*)p2)[i]); \
|
|
331
|
+
} \
|
|
332
|
+
} else { \
|
|
333
|
+
for (; i < n; i++) { \
|
|
334
|
+
((dfloat*)p3)[i] = m_##fOpFunc(((dfloat*)p1)[i], ((dfloat*)p2)[i]); \
|
|
335
|
+
} \
|
|
336
|
+
} \
|
|
337
|
+
} \
|
|
338
|
+
return; \
|
|
339
|
+
} \
|
|
340
|
+
if (is_aligned_step(s1, sizeof(dfloat)) && is_aligned_step(s2, sizeof(dfloat)) && \
|
|
341
|
+
is_aligned_step(s3, sizeof(dfloat))) { \
|
|
342
|
+
if (s2 == 0) { \
|
|
343
|
+
if (s1 == sizeof(dfloat) && s3 == sizeof(dfloat)) { \
|
|
344
|
+
b = _mm_load1_pd(&((dfloat*)p2)[0]); \
|
|
345
|
+
if ((n >= num_pack) && \
|
|
346
|
+
is_same_aligned2(&((dfloat*)p1)[i], &((dfloat*)p3)[i], SIMD_ALIGNMENT_SIZE)) { \
|
|
347
|
+
cnt = get_count_of_elements_not_aligned_to_simd_size( \
|
|
348
|
+
&((dfloat*)p1)[i], SIMD_ALIGNMENT_SIZE, sizeof(dfloat) \
|
|
349
|
+
); \
|
|
350
|
+
if (p1 == p3) { \
|
|
351
|
+
for (; i < cnt; i++) { \
|
|
352
|
+
((dfloat*)p1)[i] = m_##fOpFunc(((dfloat*)p1)[i], *(dfloat*)p2); \
|
|
353
|
+
} \
|
|
354
|
+
} else { \
|
|
355
|
+
for (; i < cnt; i++) { \
|
|
356
|
+
((dfloat*)p3)[i] = m_##fOpFunc(((dfloat*)p1)[i], *(dfloat*)p2); \
|
|
357
|
+
} \
|
|
358
|
+
} \
|
|
359
|
+
cnt_simd_loop = (n - i) % num_pack; \
|
|
360
|
+
if (p1 == p3) { \
|
|
361
|
+
for (; i < n - cnt_simd_loop; i += num_pack) { \
|
|
362
|
+
a = _mm_load_pd(&((dfloat*)p1)[i]); \
|
|
363
|
+
a = fSimdOp(a, b); \
|
|
364
|
+
_mm_store_pd(&((dfloat*)p1)[i], a); \
|
|
365
|
+
} \
|
|
366
|
+
} else { \
|
|
367
|
+
for (; i < n - cnt_simd_loop; i += num_pack) { \
|
|
368
|
+
a = _mm_load_pd(&((dfloat*)p1)[i]); \
|
|
369
|
+
a = fSimdOp(a, b); \
|
|
370
|
+
_mm_stream_pd(&((dfloat*)p3)[i], a); \
|
|
371
|
+
} \
|
|
372
|
+
} \
|
|
373
|
+
} \
|
|
374
|
+
if (cnt_simd_loop != 0) { \
|
|
375
|
+
if (p1 == p3) { \
|
|
376
|
+
for (; i < n; i++) { \
|
|
377
|
+
((dfloat*)p1)[i] = m_##fOpFunc(((dfloat*)p1)[i], *(dfloat*)p2); \
|
|
378
|
+
} \
|
|
379
|
+
} else { \
|
|
380
|
+
for (; i < n; i++) { \
|
|
381
|
+
((dfloat*)p3)[i] = m_##fOpFunc(((dfloat*)p1)[i], *(dfloat*)p2); \
|
|
382
|
+
} \
|
|
383
|
+
} \
|
|
384
|
+
} \
|
|
385
|
+
} else { \
|
|
386
|
+
for (i = 0; i < n; i++) { \
|
|
387
|
+
*(dfloat*)p3 = m_##fOpFunc(*(dfloat*)p1, *(dfloat*)p2); \
|
|
388
|
+
p1 += s1; \
|
|
389
|
+
p3 += s3; \
|
|
390
|
+
} \
|
|
391
|
+
} \
|
|
392
|
+
} else { \
|
|
393
|
+
if (p1 == p3) { \
|
|
394
|
+
for (i = 0; i < n; i++) { \
|
|
395
|
+
*(dfloat*)p1 = m_##fOpFunc(*(dfloat*)p1, *(dfloat*)p2); \
|
|
396
|
+
p1 += s1; \
|
|
397
|
+
p2 += s2; \
|
|
398
|
+
} \
|
|
399
|
+
} else { \
|
|
400
|
+
for (i = 0; i < n; i++) { \
|
|
401
|
+
*(dfloat*)p3 = m_##fOpFunc(*(dfloat*)p1, *(dfloat*)p2); \
|
|
402
|
+
p1 += s1; \
|
|
403
|
+
p2 += s2; \
|
|
404
|
+
p3 += s3; \
|
|
405
|
+
} \
|
|
406
|
+
} \
|
|
407
|
+
} \
|
|
408
|
+
return; \
|
|
409
|
+
} \
|
|
410
|
+
} \
|
|
411
|
+
\
|
|
412
|
+
for (i = 0; i < n; i++) { \
|
|
413
|
+
dfloat x; \
|
|
414
|
+
dfloat y; \
|
|
415
|
+
dfloat z; \
|
|
416
|
+
GET_DATA_STRIDE(p1, s1, dfloat, x); \
|
|
417
|
+
GET_DATA_STRIDE(p2, s2, dfloat, y); \
|
|
418
|
+
z = m_##fOpFunc(x, y); \
|
|
419
|
+
SET_DATA_STRIDE(p3, s3, dfloat, z); \
|
|
420
|
+
} \
|
|
421
|
+
}
|
|
422
|
+
|
|
423
|
+
#endif /* NUMO_NARRAY_MH_OP_BINARY_FUNC_H */
|
|
@@ -0,0 +1,118 @@
|
|
|
1
|
+
#ifndef NUMO_NARRAY_MH_OP_DIV_H
|
|
2
|
+
#define NUMO_NARRAY_MH_OP_DIV_H 1
|
|
3
|
+
|
|
4
|
+
#include "binary_func.h"
|
|
5
|
+
|
|
6
|
+
#define DEF_NARRAY_FLT_DIV_METHOD_FUNC(tDType, tNAryClass) \
|
|
7
|
+
static void iter_##tDType##_div(na_loop_t* const lp) { \
|
|
8
|
+
ITER_BINARY_INIT_VARS() \
|
|
9
|
+
if (is_aligned(p1, sizeof(tDType)) && is_aligned(p2, sizeof(tDType)) && \
|
|
10
|
+
is_aligned(p3, sizeof(tDType))) { \
|
|
11
|
+
if (s1 == sizeof(tDType) && s2 == sizeof(tDType) && s3 == sizeof(tDType)) { \
|
|
12
|
+
ITER_BINARY_INPLACE_OR_NEW_ARY(div, tDType) \
|
|
13
|
+
return; \
|
|
14
|
+
} \
|
|
15
|
+
if (is_aligned_step(s1, sizeof(tDType)) && is_aligned_step(s2, sizeof(tDType)) && \
|
|
16
|
+
is_aligned_step(s3, sizeof(tDType))) { \
|
|
17
|
+
if (s2 == 0) { \
|
|
18
|
+
if (s1 == sizeof(tDType) && s3 == sizeof(tDType)) { \
|
|
19
|
+
ITER_BINARY_INPLACE_OR_NEW_SCL(div, tDType) \
|
|
20
|
+
} else { \
|
|
21
|
+
ITER_BINARY_NEW_PTR_SCL(div, tDType) \
|
|
22
|
+
} \
|
|
23
|
+
} else { \
|
|
24
|
+
ITER_BINARY_INPLACE_OR_NEW_PTR_ARY(div, tDType) \
|
|
25
|
+
} \
|
|
26
|
+
return; \
|
|
27
|
+
} \
|
|
28
|
+
} \
|
|
29
|
+
ITER_BINARY_FALLBACK_LOOP(div, tDType) \
|
|
30
|
+
} \
|
|
31
|
+
DEF_BINARY_SELF_FUNC(div, tDType, tNAryClass) \
|
|
32
|
+
DEF_BINARY_FUNC(div, '/', tDType, tNAryClass)
|
|
33
|
+
|
|
34
|
+
#define DEF_NARRAY_INT_DIV_METHOD_FUNC(tDType, tNAryClass) \
|
|
35
|
+
static void iter_##tDType##_div(na_loop_t* const lp) { \
|
|
36
|
+
ITER_BINARY_INIT_VARS() \
|
|
37
|
+
if (is_aligned(p1, sizeof(tDType)) && is_aligned(p2, sizeof(tDType)) && \
|
|
38
|
+
is_aligned(p3, sizeof(tDType))) { \
|
|
39
|
+
if (s1 == sizeof(tDType) && s2 == sizeof(tDType) && s3 == sizeof(tDType)) { \
|
|
40
|
+
ITER_BINARY_INPLACE_OR_NEW_ARY_ZERODIV(div, tDType) \
|
|
41
|
+
return; \
|
|
42
|
+
} \
|
|
43
|
+
if (is_aligned_step(s1, sizeof(tDType)) && is_aligned_step(s2, sizeof(tDType)) && \
|
|
44
|
+
is_aligned_step(s3, sizeof(tDType))) { \
|
|
45
|
+
if (s2 == 0) { \
|
|
46
|
+
if ((*(tDType*)p2) == 0) { \
|
|
47
|
+
lp->err_type = rb_eZeroDivError; \
|
|
48
|
+
return; \
|
|
49
|
+
} \
|
|
50
|
+
if (s1 == sizeof(tDType) && s3 == sizeof(tDType)) { \
|
|
51
|
+
ITER_BINARY_INPLACE_OR_NEW_SCL(div, tDType) \
|
|
52
|
+
} else { \
|
|
53
|
+
ITER_BINARY_NEW_PTR_SCL(div, tDType) \
|
|
54
|
+
} \
|
|
55
|
+
} else { \
|
|
56
|
+
ITER_BINARY_INPLACE_OR_NEW_PTR_ARY_ZERODIV(div, tDType) \
|
|
57
|
+
} \
|
|
58
|
+
return; \
|
|
59
|
+
} \
|
|
60
|
+
} \
|
|
61
|
+
ITER_BINARY_FALLBACK_LOOP(div, tDType) \
|
|
62
|
+
} \
|
|
63
|
+
DEF_BINARY_SELF_FUNC(div, tDType, tNAryClass) \
|
|
64
|
+
DEF_BINARY_FUNC(div, '/', tDType, tNAryClass)
|
|
65
|
+
|
|
66
|
+
#define DEF_NARRAY_INT8_DIV_METHOD_FUNC(tDType, tNAryClass) \
|
|
67
|
+
static void iter_##tDType##_div(na_loop_t* const lp) { \
|
|
68
|
+
ITER_BINARY_INIT_VARS() \
|
|
69
|
+
if (s2 == 0) { \
|
|
70
|
+
if ((*(tDType*)p2) == 0) { \
|
|
71
|
+
lp->err_type = rb_eZeroDivError; \
|
|
72
|
+
return; \
|
|
73
|
+
} \
|
|
74
|
+
if (s1 == sizeof(tDType) && s3 == sizeof(tDType)) { \
|
|
75
|
+
ITER_BINARY_INPLACE_OR_NEW_SCL(div, tDType) \
|
|
76
|
+
} else { \
|
|
77
|
+
ITER_BINARY_NEW_PTR_SCL(div, tDType) \
|
|
78
|
+
} \
|
|
79
|
+
} else { \
|
|
80
|
+
ITER_BINARY_INPLACE_OR_NEW_PTR_ARY_ZERODIV(div, tDType) \
|
|
81
|
+
} \
|
|
82
|
+
} \
|
|
83
|
+
DEF_BINARY_SELF_FUNC(div, tDType, tNAryClass) \
|
|
84
|
+
DEF_BINARY_FUNC(div, '/', tDType, tNAryClass)
|
|
85
|
+
|
|
86
|
+
#define DEF_NARRAY_ROBJ_DIV_METHOD_FUNC() \
|
|
87
|
+
static void iter_robject_div(na_loop_t* const lp) { \
|
|
88
|
+
ITER_BINARY_INIT_VARS() \
|
|
89
|
+
if (s2 == 0) { \
|
|
90
|
+
if ((*(robject*)p2) == 0) { \
|
|
91
|
+
lp->err_type = rb_eZeroDivError; \
|
|
92
|
+
return; \
|
|
93
|
+
} \
|
|
94
|
+
if (s1 == sizeof(robject) && s3 == sizeof(robject)) { \
|
|
95
|
+
ITER_BINARY_INPLACE_OR_NEW_SCL(div, robject) \
|
|
96
|
+
} else { \
|
|
97
|
+
ITER_BINARY_NEW_PTR_SCL(div, robject) \
|
|
98
|
+
} \
|
|
99
|
+
} else { \
|
|
100
|
+
ITER_BINARY_INPLACE_OR_NEW_PTR_ARY_ZERODIV(div, robject) \
|
|
101
|
+
} \
|
|
102
|
+
} \
|
|
103
|
+
DEF_BINARY_SELF_FUNC(div, robject, numo_cRObject) \
|
|
104
|
+
static VALUE robject_div(VALUE self, VALUE other) { \
|
|
105
|
+
return robject_div_self(self, other); \
|
|
106
|
+
}
|
|
107
|
+
|
|
108
|
+
#define DEF_NARRAY_SFLT_DIV_SSE2_METHOD_FUNC() \
|
|
109
|
+
DEF_BINARY_SFLT_SSE2_ITER_FUNC(div, _mm_div_ps) \
|
|
110
|
+
DEF_BINARY_SELF_FUNC(div, sfloat, numo_cSFloat) \
|
|
111
|
+
DEF_BINARY_FUNC(div, '/', sfloat, numo_cSFloat)
|
|
112
|
+
|
|
113
|
+
#define DEF_NARRAY_DFLT_DIV_SSE2_METHOD_FUNC() \
|
|
114
|
+
DEF_BINARY_DFLT_SSE2_ITER_FUNC(div, _mm_div_pd) \
|
|
115
|
+
DEF_BINARY_SELF_FUNC(div, dfloat, numo_cDFloat) \
|
|
116
|
+
DEF_BINARY_FUNC(div, '/', dfloat, numo_cDFloat)
|
|
117
|
+
|
|
118
|
+
#endif /* NUMO_NARRAY_MH_OP_DIV_H */
|