OLD | NEW |
1 /*********************************************************************** | 1 /*********************************************************************** |
2 Copyright (C) 2014 Vidyo | 2 Copyright (C) 2014 Vidyo |
3 Redistribution and use in source and binary forms, with or without | 3 Redistribution and use in source and binary forms, with or without |
4 modification, are permitted provided that the following conditions | 4 modification, are permitted provided that the following conditions |
5 are met: | 5 are met: |
6 - Redistributions of source code must retain the above copyright notice, | 6 - Redistributions of source code must retain the above copyright notice, |
7 this list of conditions and the following disclaimer. | 7 this list of conditions and the following disclaimer. |
8 - Redistributions in binary form must reproduce the above copyright | 8 - Redistributions in binary form must reproduce the above copyright |
9 notice, this list of conditions and the following disclaimer in the | 9 notice, this list of conditions and the following disclaimer in the |
10 documentation and/or other materials provided with the distribution. | 10 documentation and/or other materials provided with the distribution. |
(...skipping 10 matching lines...) Expand all Loading... |
21 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | 21 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
22 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | 22 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
23 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | 23 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
24 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | 24 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
25 POSSIBILITY OF SUCH DAMAGE. | 25 POSSIBILITY OF SUCH DAMAGE. |
26 ***********************************************************************/ | 26 ***********************************************************************/ |
27 #ifndef SILK_NSQ_NEON_H | 27 #ifndef SILK_NSQ_NEON_H |
28 #define SILK_NSQ_NEON_H | 28 #define SILK_NSQ_NEON_H |
29 | 29 |
30 #include "cpu_support.h" | 30 #include "cpu_support.h" |
| 31 #include "SigProc_FIX.h" |
31 | 32 |
32 #undef silk_short_prediction_create_arch_coef | 33 #undef silk_short_prediction_create_arch_coef |
33 /* For vectorized calc, reverse a_Q12 coefs, convert to 32-bit, and shift for vq
dmulhq_s32. */ | 34 /* For vectorized calc, reverse a_Q12 coefs, convert to 32-bit, and shift for vq
dmulhq_s32. */ |
34 static OPUS_INLINE void silk_short_prediction_create_arch_coef_neon(opus_int32 *
out, const opus_int16 *in, opus_int order) | 35 static OPUS_INLINE void silk_short_prediction_create_arch_coef_neon(opus_int32 *
out, const opus_int16 *in, opus_int order) |
35 { | 36 { |
36 out[15] = in[0] << 15; | 37 out[15] = silk_LSHIFT32(in[0], 15); |
37 out[14] = in[1] << 15; | 38 out[14] = silk_LSHIFT32(in[1], 15); |
38 out[13] = in[2] << 15; | 39 out[13] = silk_LSHIFT32(in[2], 15); |
39 out[12] = in[3] << 15; | 40 out[12] = silk_LSHIFT32(in[3], 15); |
40 out[11] = in[4] << 15; | 41 out[11] = silk_LSHIFT32(in[4], 15); |
41 out[10] = in[5] << 15; | 42 out[10] = silk_LSHIFT32(in[5], 15); |
42 out[9] = in[6] << 15; | 43 out[9] = silk_LSHIFT32(in[6], 15); |
43 out[8] = in[7] << 15; | 44 out[8] = silk_LSHIFT32(in[7], 15); |
44 out[7] = in[8] << 15; | 45 out[7] = silk_LSHIFT32(in[8], 15); |
45 out[6] = in[9] << 15; | 46 out[6] = silk_LSHIFT32(in[9], 15); |
46 | 47 |
47 if (order == 16) | 48 if (order == 16) |
48 { | 49 { |
49 out[5] = in[10] << 15; | 50 out[5] = silk_LSHIFT32(in[10], 15); |
50 out[4] = in[11] << 15; | 51 out[4] = silk_LSHIFT32(in[11], 15); |
51 out[3] = in[12] << 15; | 52 out[3] = silk_LSHIFT32(in[12], 15); |
52 out[2] = in[13] << 15; | 53 out[2] = silk_LSHIFT32(in[13], 15); |
53 out[1] = in[14] << 15; | 54 out[1] = silk_LSHIFT32(in[14], 15); |
54 out[0] = in[15] << 15; | 55 out[0] = silk_LSHIFT32(in[15], 15); |
55 } | 56 } |
56 else | 57 else |
57 { | 58 { |
58 out[5] = 0; | 59 out[5] = 0; |
59 out[4] = 0; | 60 out[4] = 0; |
60 out[3] = 0; | 61 out[3] = 0; |
61 out[2] = 0; | 62 out[2] = 0; |
62 out[1] = 0; | 63 out[1] = 0; |
63 out[0] = 0; | 64 out[0] = 0; |
64 } | 65 } |
(...skipping 39 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
104 opus_int order); | 105 opus_int order); |
105 | 106 |
106 #undef silk_NSQ_noise_shape_feedback_loop | 107 #undef silk_NSQ_noise_shape_feedback_loop |
107 #define silk_NSQ_noise_shape_feedback_loop(data0, data1, coef, order, arch) \ | 108 #define silk_NSQ_noise_shape_feedback_loop(data0, data1, coef, order, arch) \ |
108 (SILK_NSQ_NOISE_SHAPE_FEEDBACK_LOOP_IMPL[(arch)&OPUS_ARCHMASK](data0, data1, \ | 109 (SILK_NSQ_NOISE_SHAPE_FEEDBACK_LOOP_IMPL[(arch)&OPUS_ARCHMASK](data0, data1, \ |
109 coef, order)) | 110 coef, order)) |
110 | 111 |
111 #endif | 112 #endif |
112 | 113 |
113 #endif /* SILK_NSQ_NEON_H */ | 114 #endif /* SILK_NSQ_NEON_H */ |
OLD | NEW |