mirror of
https://github.com/mollyim/webrtc.git
synced 2025-05-16 23:30:48 +01:00
![]() Finding the array element with the largest argmax is a fairly common operation, so it makes sense to have a Neon optimized version. The implementation is done by first finding both the min and max value, and then returning whichever has the largest argmax. Bug: chromium:12355 Change-Id: I088bd4f7d469b2424a7265de10fffb42764567a1 Reviewed-on: https://webrtc-review.googlesource.com/c/src/+/201622 Commit-Queue: Ivo Creusen <ivoc@webrtc.org> Reviewed-by: Per Åhgren <peah@webrtc.org> Cr-Commit-Position: refs/heads/master@{#33052} |
||
---|---|---|
.. | ||
include | ||
auto_corr_to_refl_coef.c | ||
auto_correlation.c | ||
complex_bit_reverse.c | ||
complex_bit_reverse_arm.S | ||
complex_bit_reverse_mips.c | ||
complex_fft.c | ||
complex_fft_mips.c | ||
complex_fft_tables.h | ||
copy_set_operations.c | ||
cross_correlation.c | ||
cross_correlation_mips.c | ||
cross_correlation_neon.c | ||
division_operations.c | ||
dot_product_with_scale.cc | ||
dot_product_with_scale.h | ||
downsample_fast.c | ||
downsample_fast_mips.c | ||
downsample_fast_neon.c | ||
energy.c | ||
filter_ar.c | ||
filter_ar_fast_q12.c | ||
filter_ar_fast_q12_armv7.S | ||
filter_ar_fast_q12_mips.c | ||
filter_ma_fast_q12.c | ||
get_hanning_window.c | ||
get_scaling_square.c | ||
ilbc_specific_functions.c | ||
levinson_durbin.c | ||
lpc_to_refl_coef.c | ||
min_max_operations.c | ||
min_max_operations_mips.c | ||
min_max_operations_neon.c | ||
randomization_functions.c | ||
real_fft.c | ||
real_fft_unittest.cc | ||
refl_coef_to_lpc.c | ||
resample.c | ||
resample_48khz.c | ||
resample_by_2.c | ||
resample_by_2_internal.c | ||
resample_by_2_internal.h | ||
resample_by_2_mips.c | ||
resample_fractional.c | ||
signal_processing_unittest.cc | ||
spl_init.c | ||
spl_inl.c | ||
spl_sqrt.c | ||
splitting_filter.c | ||
sqrt_of_one_minus_x_squared.c | ||
vector_scaling_operations.c | ||
vector_scaling_operations_mips.c |