Debian Codegraph @

src/f32-vscaleexpminusmax/gen/f32-vscaleexpminusmax-avx2-p5-u40.c

raw
1 // Auto-generated file. Do not edit!
2 // Template: src/f32-vscaleexpminusmax/avx2-p5.c.in
3 // Generator: tools/xngen
4 //
5 // Copyright 2019 Google LLC
6 //
7 // This source code is licensed under the BSD-style license found in the
8 // LICENSE file in the root directory of this source tree.
9
10 #include <assert.h>
11
12 #include <immintrin.h>
13
14 #include "xnnpack/common.h"
15 #include "xnnpack/vscaleexpminusmax.h"
16
17
18 void xnn_f32_vscaleexpminusmax_ukernel__avx2_p5_u40(
19 size_t batch,
20 const float* input,
21 float* output,
22 float scale,
23 float max)
24 {
25 assert(batch != 0);
26 assert(batch % sizeof(float) == 0);
27 assert(input != NULL);
28 assert(output != NULL);
29
30 static const int32_t mask_table[14] = {-1, -1, -1, -1, -1, -1, -1, 0, 0, 0, 0, 0, 0, 0};
31
32 const __m256 vmagic_bias = _mm256_set1_ps(0x1.8000FEp23f);
33 // The smallest x for which expf(x) is normalized.
34 const __m256 vdenorm_cutoff = _mm256_set1_ps(-0x1.5D589Ep6f);
35 const __m256 vlog2e = _mm256_set1_ps(0x1.715476p+0f);
36 const __m256 vminus_ln2_hi = _mm256_set1_ps(-0x1.62E43p-1f);
37 const __m256 vminus_ln2_lo = _mm256_set1_ps(0x1.05C61p-29f);
38
39 const __m256 vc1 = _mm256_set1_ps(0x1.FFFFF6p-1f);
40 const __m256 vc2 = _mm256_set1_ps(0x1.FFFDC6p-2f);
41 const __m256 vc3 = _mm256_set1_ps(0x1.555A80p-3f);
42 const __m256 vc4 = _mm256_set1_ps(0x1.573A1Ap-5f);
43 const __m256 vc5 = _mm256_set1_ps(0x1.0F9F9Cp-7f);
44
45 const __m256 vscale = _mm256_set1_ps(scale);
46 const __m256 vi_max = _mm256_set1_ps(max);
47
48 for (; batch >= 40 * sizeof(float); batch -= 40 * sizeof(float)) {
49 // Load 40 (5x8) inputs at a time.
50 const __m256 vi0 = _mm256_loadu_ps(input);
51 const __m256 vi1 = _mm256_loadu_ps(input + 8);
52 const __m256 vi2 = _mm256_loadu_ps(input + 16);
53 const __m256 vi3 = _mm256_loadu_ps(input + 24);
54 const __m256 vi4 = _mm256_loadu_ps(input + 32);
55 input += 40;
56
57 // Subtract maximum input x := i - i_max. This implies x <= 0.
58 const __m256 vx0 = _mm256_sub_ps(vi0, vi_max);
59 const __m256 vx1 = _mm256_sub_ps(vi1, vi_max);
60 const __m256 vx2 = _mm256_sub_ps(vi2, vi_max);
61 const __m256 vx3 = _mm256_sub_ps(vi3, vi_max);
62 const __m256 vx4 = _mm256_sub_ps(vi4, vi_max);
63
64 // Compute reduced argument batch := round(x / log(2)).
65 __m256 vn0 = _mm256_fmadd_ps(vx0, vlog2e, vmagic_bias);
66 __m256 vn1 = _mm256_fmadd_ps(vx1, vlog2e, vmagic_bias);
67 __m256 vn2 = _mm256_fmadd_ps(vx2, vlog2e, vmagic_bias);
68 __m256 vn3 = _mm256_fmadd_ps(vx3, vlog2e, vmagic_bias);
69 __m256 vn4 = _mm256_fmadd_ps(vx4, vlog2e, vmagic_bias);
70
71 // Create a floating-point number s (scale) such that s == 2**batch for inputs which don't cause underflow, i.e.
72 // -87.33642 <= x <= 0.0, and -126 <= batch <= 0 accordingly.
73 const __m256 vs0 = _mm256_castsi256_ps(_mm256_slli_epi32(_mm256_castps_si256(vn0), 23));
74 const __m256 vs1 = _mm256_castsi256_ps(_mm256_slli_epi32(_mm256_castps_si256(vn1), 23));
75 const __m256 vs2 = _mm256_castsi256_ps(_mm256_slli_epi32(_mm256_castps_si256(vn2), 23));
76 const __m256 vs3 = _mm256_castsi256_ps(_mm256_slli_epi32(_mm256_castps_si256(vn3), 23));
77 const __m256 vs4 = _mm256_castsi256_ps(_mm256_slli_epi32(_mm256_castps_si256(vn4), 23));
78
79 // Subtract the large number back to get final batch := round(x / log(2)).
80 vn0 = _mm256_sub_ps(vn0, vmagic_bias);
81 vn1 = _mm256_sub_ps(vn1, vmagic_bias);
82 vn2 = _mm256_sub_ps(vn2, vmagic_bias);
83 vn3 = _mm256_sub_ps(vn3, vmagic_bias);
84 vn4 = _mm256_sub_ps(vn4, vmagic_bias);
85
86 // Compute reduced argument t := x - batch * log(2).
87 // Use Cody-Waite range reduction method (note two constants to represent log(2)) to improve accuracy.
88 __m256 vt0 = _mm256_fmadd_ps(vn0, vminus_ln2_hi, vx0);
89 __m256 vt1 = _mm256_fmadd_ps(vn1, vminus_ln2_hi, vx1);
90 __m256 vt2 = _mm256_fmadd_ps(vn2, vminus_ln2_hi, vx2);
91 __m256 vt3 = _mm256_fmadd_ps(vn3, vminus_ln2_hi, vx3);
92 __m256 vt4 = _mm256_fmadd_ps(vn4, vminus_ln2_hi, vx4);
93
94 vt0 = _mm256_fmadd_ps(vn0, vminus_ln2_lo, vt0);
95 vt1 = _mm256_fmadd_ps(vn1, vminus_ln2_lo, vt1);
96 vt2 = _mm256_fmadd_ps(vn2, vminus_ln2_lo, vt2);
97 vt3 = _mm256_fmadd_ps(vn3, vminus_ln2_lo, vt3);
98 vt4 = _mm256_fmadd_ps(vn4, vminus_ln2_lo, vt4);
99
100 // Compute degree-5 polynomial approximation for exp(t) on [-log(2)/2, log(2)/2].
101 __m256 vp0 = _mm256_fmadd_ps(vc5, vt0, vc4);
102 __m256 vp1 = _mm256_fmadd_ps(vc5, vt1, vc4);
103 __m256 vp2 = _mm256_fmadd_ps(vc5, vt2, vc4);
104 __m256 vp3 = _mm256_fmadd_ps(vc5, vt3, vc4);
105 __m256 vp4 = _mm256_fmadd_ps(vc5, vt4, vc4);
106
107 vp0 = _mm256_fmadd_ps(vp0, vt0, vc3);
108 vp1 = _mm256_fmadd_ps(vp1, vt1, vc3);
109 vp2 = _mm256_fmadd_ps(vp2, vt2, vc3);
110 vp3 = _mm256_fmadd_ps(vp3, vt3, vc3);
111 vp4 = _mm256_fmadd_ps(vp4, vt4, vc3);
112
113 vp0 = _mm256_fmadd_ps(vp0, vt0, vc2);
114 vp1 = _mm256_fmadd_ps(vp1, vt1, vc2);
115 vp2 = _mm256_fmadd_ps(vp2, vt2, vc2);
116 vp3 = _mm256_fmadd_ps(vp3, vt3, vc2);
117 vp4 = _mm256_fmadd_ps(vp4, vt4, vc2);
118
119 vp0 = _mm256_fmadd_ps(vp0, vt0, vc1);
120 vp1 = _mm256_fmadd_ps(vp1, vt1, vc1);
121 vp2 = _mm256_fmadd_ps(vp2, vt2, vc1);
122 vp3 = _mm256_fmadd_ps(vp3, vt3, vc1);
123 vp4 = _mm256_fmadd_ps(vp4, vt4, vc1);
124
125 // Reconstruct the final f value:
126 // f = s * (1 + t * (c1 + t * (c2 + t * (c3 + t * (c4 + t * c5)))))
127 // = s + (t * s) * (c1 + t * (c2 + t * (c3 + t * (c4 + t * c5))))
128 // = s + (t * s) * p
129 vt0 = _mm256_mul_ps(vt0, vs0);
130 vt1 = _mm256_mul_ps(vt1, vs1);
131 vt2 = _mm256_mul_ps(vt2, vs2);
132 vt3 = _mm256_mul_ps(vt3, vs3);
133 vt4 = _mm256_mul_ps(vt4, vs4);
134
135 __m256 vf0 = _mm256_fmadd_ps(vt0, vp0, vs0);
136 __m256 vf1 = _mm256_fmadd_ps(vt1, vp1, vs1);
137 __m256 vf2 = _mm256_fmadd_ps(vt2, vp2, vs2);
138 __m256 vf3 = _mm256_fmadd_ps(vt3, vp3, vs3);
139 __m256 vf4 = _mm256_fmadd_ps(vt4, vp4, vs4);
140
141 // For inputs below zero cutoff, replace output with +0.0f.
142 // Note that for NaN inputs, comparison result is false, and outputs are left unchanged.
143 vf0 = _mm256_andnot_ps(_mm256_cmp_ps(vx0, vdenorm_cutoff, _CMP_LT_OS), vf0);
144 vf1 = _mm256_andnot_ps(_mm256_cmp_ps(vx1, vdenorm_cutoff, _CMP_LT_OS), vf1);
145 vf2 = _mm256_andnot_ps(_mm256_cmp_ps(vx2, vdenorm_cutoff, _CMP_LT_OS), vf2);
146 vf3 = _mm256_andnot_ps(_mm256_cmp_ps(vx3, vdenorm_cutoff, _CMP_LT_OS), vf3);
147 vf4 = _mm256_andnot_ps(_mm256_cmp_ps(vx4, vdenorm_cutoff, _CMP_LT_OS), vf4);
148
149 // Multiply by scale.
150 vf0 = _mm256_mul_ps(vf0, vscale);
151 vf1 = _mm256_mul_ps(vf1, vscale);
152 vf2 = _mm256_mul_ps(vf2, vscale);
153 vf3 = _mm256_mul_ps(vf3, vscale);
154 vf4 = _mm256_mul_ps(vf4, vscale);
155
156 // Store 40 (5x8) outputs at a time.
157 _mm256_storeu_ps(output, vf0);
158 _mm256_storeu_ps(output + 8, vf1);
159 _mm256_storeu_ps(output + 16, vf2);
160 _mm256_storeu_ps(output + 24, vf3);
161 _mm256_storeu_ps(output + 32, vf4);
162 output += 40;
163 }
164 for (; batch >= 8 * sizeof(float); batch -= 8 * sizeof(float)) {
165 // Load 8 inputs at a time.
166 const __m256 vi = _mm256_loadu_ps(input);
167 input += 8;
168
169 // Subtract maximum input x := i - i_max. This implies x <= 0.
170 const __m256 vx = _mm256_sub_ps(vi, vi_max);
171
172 // Compute reduced argument batch := round(x / log(2)).
173 __m256 vn = _mm256_fmadd_ps(vx, vlog2e, vmagic_bias);
174
175 // Create a floating-point number s (scale) such that s == 2**batch for inputs which don't cause underflow, i.e.
176 // -87.33642 <= x <= 0.0, and -126 <= batch <= 0 accordingly.
177 const __m256 vs = _mm256_castsi256_ps(_mm256_slli_epi32(_mm256_castps_si256(vn), 23));
178
179 // Subtract the large number back to get final batch := round(x / log(2)).
180 vn = _mm256_sub_ps(vn, vmagic_bias);
181
182 // Compute reduced argument t := x - batch * log(2).
183 // Use Cody-Waite range reduction method (note two constants to represent log(2)) to improve accuracy.
184 __m256 vt = _mm256_fmadd_ps(vn, vminus_ln2_hi, vx);
185 vt = _mm256_fmadd_ps(vn, vminus_ln2_lo, vt);
186
187 // Compute degree-5 polynomial approximation for exp(t) on [-log(2)/2, log(2)/2].
188 __m256 vp = _mm256_fmadd_ps(vc5, vt, vc4);
189 vp = _mm256_fmadd_ps(vp, vt, vc3);
190 vp = _mm256_fmadd_ps(vp, vt, vc2);
191 vp = _mm256_fmadd_ps(vp, vt, vc1);
192
193 // Reconstruct the final f value:
194 // f = s * (1 + t * (c1 + t * (c2 + t * (c3 + t * (c4 + t * c5)))))
195 // = s + (t * s) * (c1 + t * (c2 + t * (c3 + t * (c4 + t * c5))))
196 // = s + (t * s) * p
197 vt = _mm256_mul_ps(vt, vs);
198 __m256 vf = _mm256_fmadd_ps(vt, vp, vs);
199
200 // For inputs below zero cutoff, replace output with +0.0f.
201 // Note that for NaN inputs, comparison result is false, and outputs are left unchanged.
202 vf = _mm256_andnot_ps(_mm256_cmp_ps(vx, vdenorm_cutoff, _CMP_LT_OS), vf);
203
204 // Multiply by scale.
205 vf = _mm256_mul_ps(vf, vscale);
206
207 // Store 64 (8x8) outputs at a time.
208 _mm256_storeu_ps(output, vf);
209 output += 8;
210 }
211 if (batch != 0) {
212 assert(batch >= 1 * sizeof(float));
213 assert(batch <= 7 * sizeof(float));
214 const __m256i vmask = _mm256_loadu_si256((const __m256i*) ((uintptr_t) &mask_table[7] - batch));
215
216 // Load up to 7 inputs at a time.
217 const __m256 vi = _mm256_maskload_ps(input, vmask);
218
219 // Subtract maximum input x := i - i_max. This implies x <= 0.
220 const __m256 vx = _mm256_sub_ps(vi, vi_max);
221
222 // Compute reduced argument batch := round(x / log(2)).
223 __m256 vn = _mm256_fmadd_ps(vx, vlog2e, vmagic_bias);
224
225 // Create a floating-point number s (scale) such that s == 2**batch for inputs which don't cause underflow, i.e.
226 // -87.33642 <= x <= 0.0, and -126 <= batch <= 0 accordingly.
227 const __m256 vs = _mm256_castsi256_ps(_mm256_slli_epi32(_mm256_castps_si256(vn), 23));
228
229 // Subtract the large number back to get final batch := round(x / log(2)).
230 vn = _mm256_sub_ps(vn, vmagic_bias);
231
232 // Compute reduced argument t := x - batch * log(2).
233 // Use Cody-Waite range reduction method (note two constants to represent log(2)) to improve accuracy.
234 __m256 vt = _mm256_fmadd_ps(vn, vminus_ln2_hi, vx);
235 vt = _mm256_fmadd_ps(vn, vminus_ln2_lo, vt);
236
237 // Compute degree-5 polynomial approximation for exp(t) on [-log(2)/2, log(2)/2].
238 __m256 vp = _mm256_fmadd_ps(vc5, vt, vc4);
239 vp = _mm256_fmadd_ps(vp, vt, vc3);
240 vp = _mm256_fmadd_ps(vp, vt, vc2);
241 vp = _mm256_fmadd_ps(vp, vt, vc1);
242
243 // Reconstruct the final f value:
244 // f = s * (1 + t * (c1 + t * (c2 + t * (c3 + t * (c4 + t * c5)))))
245 // = s + (t * s) * (c1 + t * (c2 + t * (c3 + t * (c4 + t * c5))))
246 // = s + (t * s) * p
247 vt = _mm256_mul_ps(vt, vs);
248 __m256 vf = _mm256_fmadd_ps(vt, vp, vs);
249
250 // For inputs below zero cutoff, replace output with +0.0f.
251 // Note that for NaN inputs, comparison result is false, and outputs are left unchanged.
252 vf = _mm256_andnot_ps(_mm256_cmp_ps(vx, vdenorm_cutoff, _CMP_LT_OS), vf);
253
254 // Multiply by scale.
255 vf = _mm256_mul_ps(vf, vscale);
256
257 // Store up to 7 outputs at a time.
258 _mm256_maskstore_ps(output, vmask, vf);
259 }
260 }