Replace calls to assert() with RTC_DCHECK_*() in .c code

webrtc/modules/audio_coding/codecs/isac/fix/source/entropy_coding_neon.c

 /*
  *  Copyright (c) 2013 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.
  */
 
 /* This file contains WebRtcIsacfix_MatrixProduct1Neon() and
  * WebRtcIsacfix_MatrixProduct2Neon() for ARM Neon platform. API's are in
  * entropy_coding.c. Results are bit exact with the c code for
  * generic platforms.
  */
 
 #include "entropy_coding.h"
 
 #include <arm_neon.h>
-#include <assert.h>
 #include <stddef.h>
 
 #include "signal_processing_library.h"
+#include "webrtc/base/checks.h"
 
 void WebRtcIsacfix_MatrixProduct1Neon(const int16_t matrix0[],
                                       const int32_t matrix1[],
                                       int32_t matrix_product[],
                                       const int matrix1_index_factor1,
                                       const int matrix0_index_factor1,
                                       const int matrix1_index_init_case,
                                       const int matrix1_index_step,
                                       const int matrix0_index_step,
                                       const int inner_loop_count,
                                       const int mid_loop_count,
                                       const int shift) {
   int j = 0, k = 0, n = 0;
   int matrix1_index = 0, matrix0_index = 0, matrix_prod_index = 0;
   int* matrix1_index_factor2 = &j;
   int* matrix0_index_factor2 = &k;
   if (matrix1_index_init_case != 0) {
     matrix1_index_factor2 = &k;
     matrix0_index_factor2 = &j;
   }
   int32x4_t shift32x4 = vdupq_n_s32(shift);
   int32x2_t shift32x2 = vdup_n_s32(shift);
   int32x4_t sum_32x4 =  vdupq_n_s32(0);
   int32x2_t sum_32x2 =  vdup_n_s32(0);
 
-  assert(inner_loop_count % 2 == 0);
-  assert(mid_loop_count % 2 == 0);
+  RTC_DCHECK_EQ(0, inner_loop_count % 2);
+  RTC_DCHECK_EQ(0, mid_loop_count % 2);
 
   if (matrix1_index_init_case != 0 && matrix1_index_factor1 == 1) {
     for (j = 0; j < SUBFRAMES; j++) {
       matrix_prod_index = mid_loop_count * j;
       for (k = 0; k < (mid_loop_count >> 2) << 2; k += 4) {
         sum_32x4 = veorq_s32(sum_32x4, sum_32x4);  // Initialize to zeros.
         matrix1_index = k;
         matrix0_index = matrix0_index_factor1 * j;
         for (n = 0; n < inner_loop_count; n++) {
           int32x4_t matrix0_32x4 =
@@ skipping 148 matching lines @@
       int32x2_t multi_32x2 = vqdmulh_s32(matrix0_32x2, matrix1_32x2);
       sum_32x2 = vqadd_s32(sum_32x2, multi_32x2);
       matrix1_index += 2;
       matrix0_index += matrix0_index_step;
     }
     sum_32x2 = vshr_n_s32(sum_32x2, 3);
     vst1_s32(&matrix_product[matrix_prod_index], sum_32x2);
     matrix_prod_index += 2;
   }
 }