Convert RELEASE_ASSERT()/ASSERT(...) to CHECK()/DCHECK_op(...) in platform/audio

third_party/WebKit/Source/platform/audio/HRTFPanner.cpp

 /*
  * Copyright (C) 2010, Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  * 1.  Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2.  Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 192 matching lines @@
     if (desiredAzimuthIndex != m_azimuthIndex2 || elevation != m_elevation2) {
       // Cross-fade from 2 -> 1
       m_crossfadeIncr = -1 / fadeFrames;
       m_azimuthIndex1 = desiredAzimuthIndex;
       m_elevation1 = elevation;
     }
   }
 
   // This algorithm currently requires that we process in power-of-two size
   // chunks at least AudioUtilities::kRenderQuantumFrames.
-  ASSERT(1UL << static_cast<int>(log2(framesToProcess)) == framesToProcess);
+  DCHECK_EQ(1UL << static_cast<int>(log2(framesToProcess)), framesToProcess);
   DCHECK_GE(framesToProcess, AudioUtilities::kRenderQuantumFrames);
 
   const unsigned framesPerSegment = AudioUtilities::kRenderQuantumFrames;
   const unsigned numberOfSegments = framesToProcess / framesPerSegment;
 
   for (unsigned segment = 0; segment < numberOfSegments; ++segment) {
     // Get the HRTFKernels and interpolated delays.
     HRTFKernel* kernelL1;
     HRTFKernel* kernelR1;
     HRTFKernel* kernelL2;
     HRTFKernel* kernelR2;
     double frameDelayL1;
     double frameDelayR1;
     double frameDelayL2;
     double frameDelayR2;
     database->getKernelsFromAzimuthElevation(azimuthBlend, m_azimuthIndex1,
                                              m_elevation1, kernelL1, kernelR1,
                                              frameDelayL1, frameDelayR1);
     database->getKernelsFromAzimuthElevation(azimuthBlend, m_azimuthIndex2,
                                              m_elevation2, kernelL2, kernelR2,
                                              frameDelayL2, frameDelayR2);
 
     bool areKernelsGood = kernelL1 && kernelR1 && kernelL2 && kernelR2;
     DCHECK(areKernelsGood);
     if (!areKernelsGood) {
       outputBus->zero();
       return;
     }
 
-    ASSERT(frameDelayL1 / sampleRate() < MaxDelayTimeSeconds &&
-           frameDelayR1 / sampleRate() < MaxDelayTimeSeconds);
-    ASSERT(frameDelayL2 / sampleRate() < MaxDelayTimeSeconds &&
-           frameDelayR2 / sampleRate() < MaxDelayTimeSeconds);
+    DCHECK_LT(frameDelayL1 / sampleRate(), MaxDelayTimeSeconds);
+    DCHECK_LT(frameDelayR1 / sampleRate(), MaxDelayTimeSeconds);
+    DCHECK_LT(frameDelayL2 / sampleRate(), MaxDelayTimeSeconds);
+    DCHECK_LT(frameDelayR2 / sampleRate(), MaxDelayTimeSeconds);
 
     // Crossfade inter-aural delays based on transitions.
     double frameDelayL =
         (1 - m_crossfadeX) * frameDelayL1 + m_crossfadeX * frameDelayL2;
     double frameDelayR =
         (1 - m_crossfadeX) * frameDelayR1 + m_crossfadeX * frameDelayR2;
 
     // Calculate the source and destination pointers for the current segment.
     unsigned offset = segment * framesPerSegment;
     const float* segmentSourceL = sourceL + offset;
@@ skipping 96 matching lines @@
          (fftSize() / 2) / static_cast<double>(sampleRate());
 }
 
 double HRTFPanner::latencyTime() const {
   // The latency of a FFTConvolver is also fftSize() / 2, and is in addition to
   // its tailTime of the same value.
   return (fftSize() / 2) / static_cast<double>(sampleRate());
 }
 
 }  // namespace blink