Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(190)

Side by Side Diff: webrtc/modules/audio_processing/aec3/vector_math.h

Issue 2856113003: Revert of Added ARM Neon SIMD optimizations for AEC3 (Closed)
Patch Set: Created 3 years, 7 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
1 /* 1 /*
2 * Copyright (c) 2017 The WebRTC project authors. All Rights Reserved. 2 * Copyright (c) 2017 The WebRTC project authors. All Rights Reserved.
3 * 3 *
4 * Use of this source code is governed by a BSD-style license 4 * Use of this source code is governed by a BSD-style license
5 * that can be found in the LICENSE file in the root of the source 5 * that can be found in the LICENSE file in the root of the source
6 * tree. An additional intellectual property rights grant can be found 6 * tree. An additional intellectual property rights grant can be found
7 * in the file PATENTS. All contributing project authors may 7 * in the file PATENTS. All contributing project authors may
8 * be found in the AUTHORS file in the root of the source tree. 8 * be found in the AUTHORS file in the root of the source tree.
9 */ 9 */
10 10
11 #ifndef WEBRTC_MODULES_AUDIO_PROCESSING_AEC3_VECTOR_MATH_H_ 11 #ifndef WEBRTC_MODULES_AUDIO_PROCESSING_AEC3_VECTOR_MATH_H_
12 #define WEBRTC_MODULES_AUDIO_PROCESSING_AEC3_VECTOR_MATH_H_ 12 #define WEBRTC_MODULES_AUDIO_PROCESSING_AEC3_VECTOR_MATH_H_
13 13
14 #include "webrtc/typedefs.h" 14 #include "webrtc/typedefs.h"
15 #if defined(WEBRTC_HAS_NEON)
16 #include <arm_neon.h>
17 #endif
18 #if defined(WEBRTC_ARCH_X86_FAMILY) 15 #if defined(WEBRTC_ARCH_X86_FAMILY)
19 #include <emmintrin.h> 16 #include <emmintrin.h>
20 #endif 17 #endif
21 #include <math.h> 18 #include <math.h>
22 #include <algorithm> 19 #include <algorithm>
23 #include <array> 20 #include <array>
24 #include <functional> 21 #include <functional>
25 22
26 #include "webrtc/base/array_view.h" 23 #include "webrtc/base/array_view.h"
27 #include "webrtc/base/checks.h" 24 #include "webrtc/base/checks.h"
(...skipping 21 matching lines...) Expand all
49 __m128 g = _mm_loadu_ps(&x[j]); 46 __m128 g = _mm_loadu_ps(&x[j]);
50 g = _mm_sqrt_ps(g); 47 g = _mm_sqrt_ps(g);
51 _mm_storeu_ps(&x[j], g); 48 _mm_storeu_ps(&x[j], g);
52 } 49 }
53 50
54 for (; j < x_size; ++j) { 51 for (; j < x_size; ++j) {
55 x[j] = sqrtf(x[j]); 52 x[j] = sqrtf(x[j]);
56 } 53 }
57 } break; 54 } break;
58 #endif 55 #endif
59 #if defined(WEBRTC_HAS_NEON)
60 case Aec3Optimization::kNeon: {
61 const int x_size = static_cast<int>(x.size());
62 const int vector_limit = x_size >> 2;
63
64 int j = 0;
65 for (; j < vector_limit * 4; j += 4) {
66 float32x4_t g = vld1q_f32(&x[j]);
67 #if !defined(WEBRTC_ARCH_ARM64)
68 float32x4_t y = vrsqrteq_f32(g);
69
70 // Code to handle sqrt(0).
71 // If the input to sqrtf() is zero, a zero will be returned.
72 // If the input to vrsqrteq_f32() is zero, positive infinity is
73 // returned.
74 const uint32x4_t vec_p_inf = vdupq_n_u32(0x7F800000);
75 // check for divide by zero
76 const uint32x4_t div_by_zero =
77 vceqq_u32(vec_p_inf, vreinterpretq_u32_f32(y));
78 // zero out the positive infinity results
79 y = vreinterpretq_f32_u32(
80 vandq_u32(vmvnq_u32(div_by_zero), vreinterpretq_u32_f32(y)));
81 // from arm documentation
82 // The Newton-Raphson iteration:
83 // y[n+1] = y[n] * (3 - d * (y[n] * y[n])) / 2)
84 // converges to (1/√d) if y0 is the result of VRSQRTE applied to d.
85 //
86 // Note: The precision did not improve after 2 iterations.
87 for (int i = 0; i < 2; i++) {
88 y = vmulq_f32(vrsqrtsq_f32(vmulq_f32(y, y), g), y);
89 }
90 // sqrt(g) = g * 1/sqrt(g)
91 g = vmulq_f32(g, y);
92 #else
93 g = vsqrtq_f32(g);
94 #endif
95 vst1q_f32(&x[j], g);
96 }
97
98 for (; j < x_size; ++j) {
99 x[j] = sqrtf(x[j]);
100 }
101 }
102 #endif
103 break;
104 default: 56 default:
105 std::for_each(x.begin(), x.end(), [](float& a) { a = sqrtf(a); }); 57 std::for_each(x.begin(), x.end(), [](float& a) { a = sqrtf(a); });
106 } 58 }
107 } 59 }
108 60
109 // Elementwise vector multiplication z = x * y. 61 // Elementwise vector multiplication z = x * y.
110 void Multiply(rtc::ArrayView<const float> x, 62 void Multiply(rtc::ArrayView<const float> x,
111 rtc::ArrayView<const float> y, 63 rtc::ArrayView<const float> y,
112 rtc::ArrayView<float> z) { 64 rtc::ArrayView<float> z) {
113 RTC_DCHECK_EQ(z.size(), x.size()); 65 RTC_DCHECK_EQ(z.size(), x.size());
114 RTC_DCHECK_EQ(z.size(), y.size()); 66 RTC_DCHECK_EQ(z.size(), y.size());
115 switch (optimization_) { 67 switch (optimization_) {
116 #if defined(WEBRTC_ARCH_X86_FAMILY) 68 #if defined(WEBRTC_ARCH_X86_FAMILY)
117 case Aec3Optimization::kSse2: { 69 case Aec3Optimization::kSse2: {
118 const int x_size = static_cast<int>(x.size()); 70 const int x_size = static_cast<int>(x.size());
119 const int vector_limit = x_size >> 2; 71 const int vector_limit = x_size >> 2;
120 72
121 int j = 0; 73 int j = 0;
122 for (; j < vector_limit * 4; j += 4) { 74 for (; j < vector_limit * 4; j += 4) {
123 const __m128 x_j = _mm_loadu_ps(&x[j]); 75 const __m128 x_j = _mm_loadu_ps(&x[j]);
124 const __m128 y_j = _mm_loadu_ps(&y[j]); 76 const __m128 y_j = _mm_loadu_ps(&y[j]);
125 const __m128 z_j = _mm_mul_ps(x_j, y_j); 77 const __m128 z_j = _mm_mul_ps(x_j, y_j);
126 _mm_storeu_ps(&z[j], z_j); 78 _mm_storeu_ps(&z[j], z_j);
127 } 79 }
128 80
129 for (; j < x_size; ++j) { 81 for (; j < x_size; ++j) {
130 z[j] = x[j] * y[j];
131 }
132 } break;
133 #endif
134 #if defined(WEBRTC_HAS_NEON)
135 case Aec3Optimization::kNeon: {
136 const int x_size = static_cast<int>(x.size());
137 const int vector_limit = x_size >> 2;
138
139 int j = 0;
140 for (; j < vector_limit * 4; j += 4) {
141 const float32x4_t x_j = vld1q_f32(&x[j]);
142 const float32x4_t y_j = vld1q_f32(&y[j]);
143 const float32x4_t z_j = vmulq_f32(x_j, y_j);
144 vst1q_f32(&z[j], z_j);
145 }
146
147 for (; j < x_size; ++j) {
148 z[j] = x[j] * y[j]; 82 z[j] = x[j] * y[j];
149 } 83 }
150 } break; 84 } break;
151 #endif 85 #endif
152 default: 86 default:
153 std::transform(x.begin(), x.end(), y.begin(), z.begin(), 87 std::transform(x.begin(), x.end(), y.begin(), z.begin(),
154 std::multiplies<float>()); 88 std::multiplies<float>());
155 } 89 }
156 } 90 }
157 91
(...skipping 12 matching lines...) Expand all
170 __m128 z_j = _mm_loadu_ps(&z[j]); 104 __m128 z_j = _mm_loadu_ps(&z[j]);
171 z_j = _mm_add_ps(x_j, z_j); 105 z_j = _mm_add_ps(x_j, z_j);
172 _mm_storeu_ps(&z[j], z_j); 106 _mm_storeu_ps(&z[j], z_j);
173 } 107 }
174 108
175 for (; j < x_size; ++j) { 109 for (; j < x_size; ++j) {
176 z[j] += x[j]; 110 z[j] += x[j];
177 } 111 }
178 } break; 112 } break;
179 #endif 113 #endif
180 #if defined(WEBRTC_HAS_NEON)
181 case Aec3Optimization::kNeon: {
182 const int x_size = static_cast<int>(x.size());
183 const int vector_limit = x_size >> 2;
184
185 int j = 0;
186 for (; j < vector_limit * 4; j += 4) {
187 const float32x4_t x_j = vld1q_f32(&x[j]);
188 float32x4_t z_j = vld1q_f32(&z[j]);
189 z_j = vaddq_f32(z_j, x_j);
190 vst1q_f32(&z[j], z_j);
191 }
192
193 for (; j < x_size; ++j) {
194 z[j] += x[j];
195 }
196 } break;
197 #endif
198 default: 114 default:
199 std::transform(x.begin(), x.end(), z.begin(), z.begin(), 115 std::transform(x.begin(), x.end(), z.begin(), z.begin(),
200 std::plus<float>()); 116 std::plus<float>());
201 } 117 }
202 } 118 }
203 119
204 private: 120 private:
205 Aec3Optimization optimization_; 121 Aec3Optimization optimization_;
206 }; 122 };
207 123
208 } // namespace aec3 124 } // namespace aec3
209 125
210 } // namespace webrtc 126 } // namespace webrtc
211 127
212 #endif // WEBRTC_MODULES_AUDIO_PROCESSING_AEC3_VECTOR_MATH_H_ 128 #endif // WEBRTC_MODULES_AUDIO_PROCESSING_AEC3_VECTOR_MATH_H_
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698