annotate src/opus-1.3/celt/arm/celt_neon_intr.c @ 71:388bd4da45bf

Opus build for Windows (MinGW)
author Chris Cannam
date Fri, 25 Jan 2019 13:49:03 +0000
parents 7aeed7906520
children
rev   line source
Chris@69 1 /* Copyright (c) 2014-2015 Xiph.Org Foundation
Chris@69 2 Written by Viswanath Puttagunta */
Chris@69 3 /**
Chris@69 4 @file celt_neon_intr.c
Chris@69 5 @brief ARM Neon Intrinsic optimizations for celt
Chris@69 6 */
Chris@69 7
Chris@69 8 /*
Chris@69 9 Redistribution and use in source and binary forms, with or without
Chris@69 10 modification, are permitted provided that the following conditions
Chris@69 11 are met:
Chris@69 12
Chris@69 13 - Redistributions of source code must retain the above copyright
Chris@69 14 notice, this list of conditions and the following disclaimer.
Chris@69 15
Chris@69 16 - Redistributions in binary form must reproduce the above copyright
Chris@69 17 notice, this list of conditions and the following disclaimer in the
Chris@69 18 documentation and/or other materials provided with the distribution.
Chris@69 19
Chris@69 20 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
Chris@69 21 ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
Chris@69 22 LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
Chris@69 23 A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
Chris@69 24 OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
Chris@69 25 EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
Chris@69 26 PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
Chris@69 27 PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
Chris@69 28 LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
Chris@69 29 NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
Chris@69 30 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
Chris@69 31 */
Chris@69 32
Chris@69 33 #ifdef HAVE_CONFIG_H
Chris@69 34 #include "config.h"
Chris@69 35 #endif
Chris@69 36
Chris@69 37 #include <arm_neon.h>
Chris@69 38 #include "../pitch.h"
Chris@69 39
Chris@69 40 #if defined(FIXED_POINT)
Chris@69 41 void xcorr_kernel_neon_fixed(const opus_val16 * x, const opus_val16 * y, opus_val32 sum[4], int len)
Chris@69 42 {
Chris@69 43 int j;
Chris@69 44 int32x4_t a = vld1q_s32(sum);
Chris@69 45 /* Load y[0...3] */
Chris@69 46 /* This requires len>0 to always be valid (which we assert in the C code). */
Chris@69 47 int16x4_t y0 = vld1_s16(y);
Chris@69 48 y += 4;
Chris@69 49
Chris@69 50 for (j = 0; j + 8 <= len; j += 8)
Chris@69 51 {
Chris@69 52 /* Load x[0...7] */
Chris@69 53 int16x8_t xx = vld1q_s16(x);
Chris@69 54 int16x4_t x0 = vget_low_s16(xx);
Chris@69 55 int16x4_t x4 = vget_high_s16(xx);
Chris@69 56 /* Load y[4...11] */
Chris@69 57 int16x8_t yy = vld1q_s16(y);
Chris@69 58 int16x4_t y4 = vget_low_s16(yy);
Chris@69 59 int16x4_t y8 = vget_high_s16(yy);
Chris@69 60 int32x4_t a0 = vmlal_lane_s16(a, y0, x0, 0);
Chris@69 61 int32x4_t a1 = vmlal_lane_s16(a0, y4, x4, 0);
Chris@69 62
Chris@69 63 int16x4_t y1 = vext_s16(y0, y4, 1);
Chris@69 64 int16x4_t y5 = vext_s16(y4, y8, 1);
Chris@69 65 int32x4_t a2 = vmlal_lane_s16(a1, y1, x0, 1);
Chris@69 66 int32x4_t a3 = vmlal_lane_s16(a2, y5, x4, 1);
Chris@69 67
Chris@69 68 int16x4_t y2 = vext_s16(y0, y4, 2);
Chris@69 69 int16x4_t y6 = vext_s16(y4, y8, 2);
Chris@69 70 int32x4_t a4 = vmlal_lane_s16(a3, y2, x0, 2);
Chris@69 71 int32x4_t a5 = vmlal_lane_s16(a4, y6, x4, 2);
Chris@69 72
Chris@69 73 int16x4_t y3 = vext_s16(y0, y4, 3);
Chris@69 74 int16x4_t y7 = vext_s16(y4, y8, 3);
Chris@69 75 int32x4_t a6 = vmlal_lane_s16(a5, y3, x0, 3);
Chris@69 76 int32x4_t a7 = vmlal_lane_s16(a6, y7, x4, 3);
Chris@69 77
Chris@69 78 y0 = y8;
Chris@69 79 a = a7;
Chris@69 80 x += 8;
Chris@69 81 y += 8;
Chris@69 82 }
Chris@69 83
Chris@69 84 for (; j < len; j++)
Chris@69 85 {
Chris@69 86 int16x4_t x0 = vld1_dup_s16(x); /* load next x */
Chris@69 87 int32x4_t a0 = vmlal_s16(a, y0, x0);
Chris@69 88
Chris@69 89 int16x4_t y4 = vld1_dup_s16(y); /* load next y */
Chris@69 90 y0 = vext_s16(y0, y4, 1);
Chris@69 91 a = a0;
Chris@69 92 x++;
Chris@69 93 y++;
Chris@69 94 }
Chris@69 95
Chris@69 96 vst1q_s32(sum, a);
Chris@69 97 }
Chris@69 98
Chris@69 99 #else
Chris@69 100 /*
Chris@69 101 * Function: xcorr_kernel_neon_float
Chris@69 102 * ---------------------------------
Chris@69 103 * Computes 4 correlation values and stores them in sum[4]
Chris@69 104 */
Chris@69 105 static void xcorr_kernel_neon_float(const float32_t *x, const float32_t *y,
Chris@69 106 float32_t sum[4], int len) {
Chris@69 107 float32x4_t YY[3];
Chris@69 108 float32x4_t YEXT[3];
Chris@69 109 float32x4_t XX[2];
Chris@69 110 float32x2_t XX_2;
Chris@69 111 float32x4_t SUMM;
Chris@69 112 const float32_t *xi = x;
Chris@69 113 const float32_t *yi = y;
Chris@69 114
Chris@69 115 celt_assert(len>0);
Chris@69 116
Chris@69 117 YY[0] = vld1q_f32(yi);
Chris@69 118 SUMM = vdupq_n_f32(0);
Chris@69 119
Chris@69 120 /* Consume 8 elements in x vector and 12 elements in y
Chris@69 121 * vector. However, the 12'th element never really gets
Chris@69 122 * touched in this loop. So, if len == 8, then we only
Chris@69 123 * must access y[0] to y[10]. y[11] must not be accessed
Chris@69 124 * hence make sure len > 8 and not len >= 8
Chris@69 125 */
Chris@69 126 while (len > 8) {
Chris@69 127 yi += 4;
Chris@69 128 YY[1] = vld1q_f32(yi);
Chris@69 129 yi += 4;
Chris@69 130 YY[2] = vld1q_f32(yi);
Chris@69 131
Chris@69 132 XX[0] = vld1q_f32(xi);
Chris@69 133 xi += 4;
Chris@69 134 XX[1] = vld1q_f32(xi);
Chris@69 135 xi += 4;
Chris@69 136
Chris@69 137 SUMM = vmlaq_lane_f32(SUMM, YY[0], vget_low_f32(XX[0]), 0);
Chris@69 138 YEXT[0] = vextq_f32(YY[0], YY[1], 1);
Chris@69 139 SUMM = vmlaq_lane_f32(SUMM, YEXT[0], vget_low_f32(XX[0]), 1);
Chris@69 140 YEXT[1] = vextq_f32(YY[0], YY[1], 2);
Chris@69 141 SUMM = vmlaq_lane_f32(SUMM, YEXT[1], vget_high_f32(XX[0]), 0);
Chris@69 142 YEXT[2] = vextq_f32(YY[0], YY[1], 3);
Chris@69 143 SUMM = vmlaq_lane_f32(SUMM, YEXT[2], vget_high_f32(XX[0]), 1);
Chris@69 144
Chris@69 145 SUMM = vmlaq_lane_f32(SUMM, YY[1], vget_low_f32(XX[1]), 0);
Chris@69 146 YEXT[0] = vextq_f32(YY[1], YY[2], 1);
Chris@69 147 SUMM = vmlaq_lane_f32(SUMM, YEXT[0], vget_low_f32(XX[1]), 1);
Chris@69 148 YEXT[1] = vextq_f32(YY[1], YY[2], 2);
Chris@69 149 SUMM = vmlaq_lane_f32(SUMM, YEXT[1], vget_high_f32(XX[1]), 0);
Chris@69 150 YEXT[2] = vextq_f32(YY[1], YY[2], 3);
Chris@69 151 SUMM = vmlaq_lane_f32(SUMM, YEXT[2], vget_high_f32(XX[1]), 1);
Chris@69 152
Chris@69 153 YY[0] = YY[2];
Chris@69 154 len -= 8;
Chris@69 155 }
Chris@69 156
Chris@69 157 /* Consume 4 elements in x vector and 8 elements in y
Chris@69 158 * vector. However, the 8'th element in y never really gets
Chris@69 159 * touched in this loop. So, if len == 4, then we only
Chris@69 160 * must access y[0] to y[6]. y[7] must not be accessed
Chris@69 161 * hence make sure len>4 and not len>=4
Chris@69 162 */
Chris@69 163 if (len > 4) {
Chris@69 164 yi += 4;
Chris@69 165 YY[1] = vld1q_f32(yi);
Chris@69 166
Chris@69 167 XX[0] = vld1q_f32(xi);
Chris@69 168 xi += 4;
Chris@69 169
Chris@69 170 SUMM = vmlaq_lane_f32(SUMM, YY[0], vget_low_f32(XX[0]), 0);
Chris@69 171 YEXT[0] = vextq_f32(YY[0], YY[1], 1);
Chris@69 172 SUMM = vmlaq_lane_f32(SUMM, YEXT[0], vget_low_f32(XX[0]), 1);
Chris@69 173 YEXT[1] = vextq_f32(YY[0], YY[1], 2);
Chris@69 174 SUMM = vmlaq_lane_f32(SUMM, YEXT[1], vget_high_f32(XX[0]), 0);
Chris@69 175 YEXT[2] = vextq_f32(YY[0], YY[1], 3);
Chris@69 176 SUMM = vmlaq_lane_f32(SUMM, YEXT[2], vget_high_f32(XX[0]), 1);
Chris@69 177
Chris@69 178 YY[0] = YY[1];
Chris@69 179 len -= 4;
Chris@69 180 }
Chris@69 181
Chris@69 182 while (--len > 0) {
Chris@69 183 XX_2 = vld1_dup_f32(xi++);
Chris@69 184 SUMM = vmlaq_lane_f32(SUMM, YY[0], XX_2, 0);
Chris@69 185 YY[0]= vld1q_f32(++yi);
Chris@69 186 }
Chris@69 187
Chris@69 188 XX_2 = vld1_dup_f32(xi);
Chris@69 189 SUMM = vmlaq_lane_f32(SUMM, YY[0], XX_2, 0);
Chris@69 190
Chris@69 191 vst1q_f32(sum, SUMM);
Chris@69 192 }
Chris@69 193
Chris@69 194 void celt_pitch_xcorr_float_neon(const opus_val16 *_x, const opus_val16 *_y,
Chris@69 195 opus_val32 *xcorr, int len, int max_pitch, int arch) {
Chris@69 196 int i;
Chris@69 197 (void)arch;
Chris@69 198 celt_assert(max_pitch > 0);
Chris@69 199 celt_sig_assert((((unsigned char *)_x-(unsigned char *)NULL)&3)==0);
Chris@69 200
Chris@69 201 for (i = 0; i < (max_pitch-3); i += 4) {
Chris@69 202 xcorr_kernel_neon_float((const float32_t *)_x, (const float32_t *)_y+i,
Chris@69 203 (float32_t *)xcorr+i, len);
Chris@69 204 }
Chris@69 205
Chris@69 206 /* In case max_pitch isn't a multiple of 4, do non-unrolled version. */
Chris@69 207 for (; i < max_pitch; i++) {
Chris@69 208 xcorr[i] = celt_inner_prod_neon(_x, _y+i, len);
Chris@69 209 }
Chris@69 210 }
Chris@69 211 #endif