Add SSE optimizations to SincResampler.

media/base/sinc_resampler.cc

 // Copyright (c) 2012 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 //
 // Input buffer layout, dividing the total buffer into regions (r0_ - r5_):
 //
 // |----------------|-----------------------------------------|----------------|
 //
 //                                   kBlockSize + kKernelSize / 2
 //                   <--------------------------------------------------------->
@@ skipping 18 matching lines @@
 // 5) Goto (2) until all of input is consumed.
 //
 // Note: we're glossing over how the sub-sample handling works with
 // |virtual_source_idx_|, etc.
 
 // MSVC++ requires this to be set before any other includes to get M_PI.
 #define _USE_MATH_DEFINES
 
 #include "media/base/sinc_resampler.h"
 
+#if defined(ARCH_CPU_X86_FAMILY) && defined(__SSE__)
+#include <xmmintrin.h>
+#endif
 #include <cmath>
 
+#include "base/cpu.h"
 #include "base/logging.h"
 
 namespace media {
 
 enum {
   // The kernel size can be adjusted for quality (higher is better) at the
   // expense of performance.  Must be an even number.
   // TODO(dalecurtis): Test performance to see if we can jack this up to 64+.
   kKernelSize = 32,
 
@@ skipping 10 matching lines @@
 
   // The size (in samples) of the internal buffer used by the resampler.
   kBufferSize = kBlockSize + kKernelSize
 };
 
 SincResampler::SincResampler(double io_sample_rate_ratio, const ReadCB& read_cb)
     : io_sample_rate_ratio_(io_sample_rate_ratio),
       virtual_source_idx_(0),
       buffer_primed_(false),
       read_cb_(read_cb),
-      // TODO(dalecurtis): When we switch to AVX/SSE optimization, we'll need to
-      // allocate with 32-byte alignment and ensure they're sized % 32 bytes.
+      // TODO(dalecurtis): Switch these to AlignedMemory<> instances.
       kernel_storage_(new float[kKernelStorageSize]),
       input_buffer_(new float[kBufferSize]),
       // Setup various region pointers in the buffer (see diagram above).
       r0_(input_buffer_.get() + kKernelSize / 2),
       r1_(input_buffer_.get()),
       r2_(r0_),
       r3_(r0_ + kBlockSize - kKernelSize / 2),
       r4_(r0_ + kBlockSize),
       r5_(r0_ + kKernelSize / 2) {
   DCHECK_EQ(kKernelSize % 2, 0) << "kKernelSize must be even!";
@@ skipping 78 matching lines @@
   while (remaining_frames) {
     while (virtual_source_idx_ < kBlockSize) {
       // |virtual_source_idx_| lies in between two kernel offsets so figure out
       // what they are.
       int source_idx = static_cast<int>(virtual_source_idx_);
       double subsample_remainder = virtual_source_idx_ - source_idx;
 
       double virtual_offset_idx = subsample_remainder * kKernelOffsetCount;
       int offset_idx = static_cast<int>(virtual_offset_idx);
 
+      // We'll compute "convolutions" for the two kernels which straddle
+      // |virtual_source_idx_|.
       float* k1 = kernel_storage_.get() + offset_idx * kKernelSize;
       float* k2 = k1 + kKernelSize;
 
       // Initialize input pointer based on quantized |virtual_source_idx_|.
       float* input_ptr = r1_ + source_idx;
 
-      // We'll compute "convolutions" for the two kernels which straddle
-      // |virtual_source_idx_|.
-      float sum1 = 0;
-      float sum2 = 0;
-
       // Figure out how much to weight each kernel's "convolution".
       double kernel_interpolation_factor = virtual_offset_idx - offset_idx;
-
-      // Generate a single output sample.
-      int n = kKernelSize;
-      float input;
-      // TODO(dalecurtis): For initial commit, I've ripped out all the SSE
-      // optimizations, these definitely need to go back in before release.
-      while (n--) {
-        input = *input_ptr++;
-        sum1 += input * *k1++;
-        sum2 += input * *k2++;
-      }
-
-      // Linearly interpolate the two "convolutions".
-      double result = (1.0 - kernel_interpolation_factor) * sum1
-          + kernel_interpolation_factor * sum2;
-
-      *destination++ = result;
+      *destination++ = Convolve(
+          input_ptr, k1, k2, kernel_interpolation_factor);
 
       // Advance the virtual index.
       virtual_source_idx_ += io_sample_rate_ratio_;
 
       if (!--remaining_frames)
         return;
     }
 
     // Wrap back around to the start.
     virtual_source_idx_ -= kBlockSize;
 
     // Step (3) Copy r3_ to r1_ and r4_ to r2_.
     // This wraps the last input frames back to the start of the buffer.
     memcpy(r1_, r3_, sizeof(*input_buffer_.get()) * (kKernelSize / 2));
     memcpy(r2_, r4_, sizeof(*input_buffer_.get()) * (kKernelSize / 2));
 
     // Step (4)
     // Refresh the buffer with more input.
     read_cb_.Run(r5_, kBlockSize);
   }
 }
 
 int SincResampler::ChunkSize() {
   return kBlockSize / io_sample_rate_ratio_;
 }
 
+float SincResampler::Convolve(const float* input_ptr, const float* k1,
+                              const float* k2,
+                              double kernel_interpolation_factor) {
+  // Rely on function level static initialization to keep ConvolveProc selection
+  // thread safe.
+  typedef float (*ConvolveProc)(const float* src, const float* k1,
+                                const float* k2,
+                                double kernel_interpolation_factor);
+#if defined(ARCH_CPU_X86_FAMILY) && defined(__SSE__)
+  static const ConvolveProc kConvolveProc =
+      base::CPU().has_sse() ? Convolve_SSE : Convolve_C;
+#else
+  static const ConvolveProc kConvolveProc = Convolve_C;
+#endif
+
+  return kConvolveProc(input_ptr, k1, k2, kernel_interpolation_factor);
+}
+
+float SincResampler::Convolve_C(const float* input_ptr, const float* k1,
+                                const float* k2,
+                                double kernel_interpolation_factor) {
+  float sum1 = 0;
+  float sum2 = 0;
+
+  // Generate a single output sample.  Unrolling this loop hurt performance in
+  // local testing.
+  int n = kKernelSize;
+  while (n--) {
+    sum1 += *input_ptr * *k1++;
+    sum2 += *input_ptr++ * *k2++;
+  }
+
+  // Linearly interpolate the two "convolutions".
+  return (1.0 - kernel_interpolation_factor) * sum1
+      + kernel_interpolation_factor * sum2;
+}
+
+#if defined(ARCH_CPU_X86_FAMILY) && defined(__SSE__)
+float SincResampler::Convolve_SSE(const float* input_ptr, const float* k1,
+                                  const float* k2,
+                                  double kernel_interpolation_factor) {
+  // Ensure |k1|, |k2| are 16-byte aligned for SSE usage.  Should always be true
+  // so long as kKernelSize is a multiple of 16.
+  DCHECK_EQ(0u, reinterpret_cast<uintptr_t>(k1) & 0x0F);
+  DCHECK_EQ(0u, reinterpret_cast<uintptr_t>(k2) & 0x0F);
+
+  __m128 m_input;
+  __m128 m_sums1 = _mm_setzero_ps();
+  __m128 m_sums2 = _mm_setzero_ps();
+
+  // Based on |input_ptr| alignment, we need to use loadu or load.  Unrolling
+  // these loops hurt performance in local testing.
+  if (reinterpret_cast<uintptr_t>(input_ptr) & 0x0F) {
+    for (int i = 0; i < kKernelSize; i += 4) {
+      m_input = _mm_loadu_ps(input_ptr + i);

[Ami GONE FROM CHROMIUM, 2012/07/21 17:25:09]

CL description says "eating at most one unaligned load"; I think you need to
clarify that :)

[DaleCurtis, 2012/07/24 00:13:07]

Done.

+      m_sums1 = _mm_add_ps(m_sums1, _mm_mul_ps(m_input, _mm_load_ps(k1 + i)));
+      m_sums2 = _mm_add_ps(m_sums2, _mm_mul_ps(m_input, _mm_load_ps(k2 + i)));
+    }
+  } else {
+    for (int i = 0; i < kKernelSize; i += 4) {
+      m_input = _mm_load_ps(input_ptr + i);
+      m_sums1 = _mm_add_ps(m_sums1, _mm_mul_ps(m_input, _mm_load_ps(k1 + i)));
+      m_sums2 = _mm_add_ps(m_sums2, _mm_mul_ps(m_input, _mm_load_ps(k2 + i)));
+    }
+  }
+
+  // Linearly interpolate the two "convolutions".
+  m_sums1 = _mm_mul_ps(m_sums1, _mm_set_ps1(1.0 - kernel_interpolation_factor));
+  m_sums2 = _mm_mul_ps(m_sums2, _mm_set_ps1(kernel_interpolation_factor));
+  m_sums1 = _mm_add_ps(m_sums1, m_sums2);
+
+  // Sum components together.
+  float result;
+  m_sums2 = _mm_add_ps(_mm_movehl_ps(m_sums1, m_sums1), m_sums1);
+  _mm_store_ss(&result, _mm_add_ss(m_sums2, _mm_shuffle_ps(
+      m_sums2, m_sums2, 1)));
+
+  return result;
+}
+#endif
+
 }  // namespace media