annotate src/opus-1.3/silk/arm/NSQ_neon.c @ 79:91c729825bca pa_catalina

Update build for AUDIO_COMPONENT_FIX
author Chris Cannam
date Wed, 30 Oct 2019 12:40:34 +0000
parents 7aeed7906520
children
rev   line source
Chris@69 1 /***********************************************************************
Chris@69 2 Copyright (C) 2014 Vidyo
Chris@69 3 Redistribution and use in source and binary forms, with or without
Chris@69 4 modification, are permitted provided that the following conditions
Chris@69 5 are met:
Chris@69 6 - Redistributions of source code must retain the above copyright notice,
Chris@69 7 this list of conditions and the following disclaimer.
Chris@69 8 - Redistributions in binary form must reproduce the above copyright
Chris@69 9 notice, this list of conditions and the following disclaimer in the
Chris@69 10 documentation and/or other materials provided with the distribution.
Chris@69 11 - Neither the name of Internet Society, IETF or IETF Trust, nor the
Chris@69 12 names of specific contributors, may be used to endorse or promote
Chris@69 13 products derived from this software without specific prior written
Chris@69 14 permission.
Chris@69 15 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
Chris@69 16 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
Chris@69 17 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
Chris@69 18 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
Chris@69 19 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
Chris@69 20 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
Chris@69 21 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
Chris@69 22 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
Chris@69 23 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
Chris@69 24 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
Chris@69 25 POSSIBILITY OF SUCH DAMAGE.
Chris@69 26 ***********************************************************************/
Chris@69 27 #ifdef HAVE_CONFIG_H
Chris@69 28 #include "config.h"
Chris@69 29 #endif
Chris@69 30
Chris@69 31 #include <arm_neon.h>
Chris@69 32 #include "main.h"
Chris@69 33 #include "stack_alloc.h"
Chris@69 34 #include "NSQ.h"
Chris@69 35 #include "celt/cpu_support.h"
Chris@69 36 #include "celt/arm/armcpu.h"
Chris@69 37
Chris@69 38 opus_int32 silk_noise_shape_quantizer_short_prediction_neon(const opus_int32 *buf32, const opus_int32 *coef32, opus_int order)
Chris@69 39 {
Chris@69 40 int32x4_t coef0 = vld1q_s32(coef32);
Chris@69 41 int32x4_t coef1 = vld1q_s32(coef32 + 4);
Chris@69 42 int32x4_t coef2 = vld1q_s32(coef32 + 8);
Chris@69 43 int32x4_t coef3 = vld1q_s32(coef32 + 12);
Chris@69 44
Chris@69 45 int32x4_t a0 = vld1q_s32(buf32 - 15);
Chris@69 46 int32x4_t a1 = vld1q_s32(buf32 - 11);
Chris@69 47 int32x4_t a2 = vld1q_s32(buf32 - 7);
Chris@69 48 int32x4_t a3 = vld1q_s32(buf32 - 3);
Chris@69 49
Chris@69 50 int32x4_t b0 = vqdmulhq_s32(coef0, a0);
Chris@69 51 int32x4_t b1 = vqdmulhq_s32(coef1, a1);
Chris@69 52 int32x4_t b2 = vqdmulhq_s32(coef2, a2);
Chris@69 53 int32x4_t b3 = vqdmulhq_s32(coef3, a3);
Chris@69 54
Chris@69 55 int32x4_t c0 = vaddq_s32(b0, b1);
Chris@69 56 int32x4_t c1 = vaddq_s32(b2, b3);
Chris@69 57
Chris@69 58 int32x4_t d = vaddq_s32(c0, c1);
Chris@69 59
Chris@69 60 int64x2_t e = vpaddlq_s32(d);
Chris@69 61
Chris@69 62 int64x1_t f = vadd_s64(vget_low_s64(e), vget_high_s64(e));
Chris@69 63
Chris@69 64 opus_int32 out = vget_lane_s32(vreinterpret_s32_s64(f), 0);
Chris@69 65
Chris@69 66 out += silk_RSHIFT( order, 1 );
Chris@69 67
Chris@69 68 return out;
Chris@69 69 }
Chris@69 70
Chris@69 71
Chris@69 72 opus_int32 silk_NSQ_noise_shape_feedback_loop_neon(const opus_int32 *data0, opus_int32 *data1, const opus_int16 *coef, opus_int order)
Chris@69 73 {
Chris@69 74 opus_int32 out;
Chris@69 75 if (order == 8)
Chris@69 76 {
Chris@69 77 int32x4_t a00 = vdupq_n_s32(data0[0]);
Chris@69 78 int32x4_t a01 = vld1q_s32(data1); /* data1[0] ... [3] */
Chris@69 79
Chris@69 80 int32x4_t a0 = vextq_s32 (a00, a01, 3); /* data0[0] data1[0] ...[2] */
Chris@69 81 int32x4_t a1 = vld1q_s32(data1 + 3); /* data1[3] ... [6] */
Chris@69 82
Chris@69 83 /*TODO: Convert these once in advance instead of once per sample, like
Chris@69 84 silk_noise_shape_quantizer_short_prediction_neon() does.*/
Chris@69 85 int16x8_t coef16 = vld1q_s16(coef);
Chris@69 86 int32x4_t coef0 = vmovl_s16(vget_low_s16(coef16));
Chris@69 87 int32x4_t coef1 = vmovl_s16(vget_high_s16(coef16));
Chris@69 88
Chris@69 89 /*This is not bit-exact with the C version, since we do not drop the
Chris@69 90 lower 16 bits of each multiply, but wait until the end to truncate
Chris@69 91 precision. This is an encoder-specific calculation (and unlike
Chris@69 92 silk_noise_shape_quantizer_short_prediction_neon(), is not meant to
Chris@69 93 simulate what the decoder will do). We still could use vqdmulhq_s32()
Chris@69 94 like silk_noise_shape_quantizer_short_prediction_neon() and save
Chris@69 95 half the multiplies, but the speed difference is not large, since we
Chris@69 96 then need two extra adds.*/
Chris@69 97 int64x2_t b0 = vmull_s32(vget_low_s32(a0), vget_low_s32(coef0));
Chris@69 98 int64x2_t b1 = vmlal_s32(b0, vget_high_s32(a0), vget_high_s32(coef0));
Chris@69 99 int64x2_t b2 = vmlal_s32(b1, vget_low_s32(a1), vget_low_s32(coef1));
Chris@69 100 int64x2_t b3 = vmlal_s32(b2, vget_high_s32(a1), vget_high_s32(coef1));
Chris@69 101
Chris@69 102 int64x1_t c = vadd_s64(vget_low_s64(b3), vget_high_s64(b3));
Chris@69 103 int64x1_t cS = vrshr_n_s64(c, 15);
Chris@69 104 int32x2_t d = vreinterpret_s32_s64(cS);
Chris@69 105
Chris@69 106 out = vget_lane_s32(d, 0);
Chris@69 107 vst1q_s32(data1, a0);
Chris@69 108 vst1q_s32(data1 + 4, a1);
Chris@69 109 return out;
Chris@69 110 }
Chris@69 111 return silk_NSQ_noise_shape_feedback_loop_c(data0, data1, coef, order);
Chris@69 112 }