Fix for integer overflow in NetEq.

webrtc/common_audio/signal_processing/include/signal_processing_library.h

 /*
  *  Copyright (c) 2012 The WebRTC project authors. All Rights Reserved.
  *
  *  Use of this source code is governed by a BSD-style license
  *  that can be found in the LICENSE file in the root of the source
  *  tree. An additional intellectual property rights grant can be found
  *  in the file PATENTS.  All contributing project authors may
  *  be found in the AUTHORS file in the root of the source tree.
  */
 
@@ skipping 595 matching lines @@
 //      - scaling       : The number of right bit shifts to apply on each term
 //                        during calculation to avoid overflow, i.e., the
 //                        output will be in Q(-|scaling|)
 //
 // Return value         : The dot product in Q(-scaling)
 int32_t WebRtcSpl_DotProductWithScale(const int16_t* vector1,
                                       const int16_t* vector2,
                                       size_t length,
                                       int scaling);
 
+// Same as above, but the result is stored in a 64 bit integer.
+int64_t WebRtcSpl_DotProductWithScale_64b(const int16_t* vector1,
+                                          const int16_t* vector2,
+                                          size_t length,

[kwiberg-webrtc, 2016/12/13 08:45:36]

Please consider using ArrayView when creating new functions.

+                                          int scaling);
+
 // Filter operations.
 size_t WebRtcSpl_FilterAR(const int16_t* ar_coef,
                           size_t ar_coef_length,
                           const int16_t* in_vector,
                           size_t in_vector_length,
                           int16_t* filter_state,
                           size_t filter_state_length,
                           int16_t* filter_state_low,
                           size_t filter_state_low_length,
                           int16_t* out_vector,
@@ skipping 1007 matching lines @@
 // This function multiply a 16-bit word by a 16-bit word, and accumulate this
 // value to a 32-bit integer.
 //
 // Input:
 //      - a    : The value of the first 16-bit word.
 //      - b    : The value of the second 16-bit word.
 //      - c    : The value of an 32-bit integer.
 //
 // Return Value: The value of a * b + c.
 //