michael@0: /* michael@0: * Copyright (C) 2010 Google Inc. All rights reserved. michael@0: * michael@0: * Redistribution and use in source and binary forms, with or without michael@0: * modification, are permitted provided that the following conditions michael@0: * are met: michael@0: * michael@0: * 1. Redistributions of source code must retain the above copyright michael@0: * notice, this list of conditions and the following disclaimer. michael@0: * 2. Redistributions in binary form must reproduce the above copyright michael@0: * notice, this list of conditions and the following disclaimer in the michael@0: * documentation and/or other materials provided with the distribution. michael@0: * 3. Neither the name of Apple Computer, Inc. ("Apple") nor the names of michael@0: * its contributors may be used to endorse or promote products derived michael@0: * from this software without specific prior written permission. michael@0: * michael@0: * THIS SOFTWARE IS PROVIDED BY APPLE AND ITS CONTRIBUTORS "AS IS" AND ANY michael@0: * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED michael@0: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE michael@0: * DISCLAIMED. IN NO EVENT SHALL APPLE OR ITS CONTRIBUTORS BE LIABLE FOR ANY michael@0: * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES michael@0: * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; michael@0: * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND michael@0: * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT michael@0: * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF michael@0: * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. michael@0: */ michael@0: michael@0: #include "HRTFDatabase.h" michael@0: michael@0: #include "HRTFElevation.h" michael@0: michael@0: using namespace std; michael@0: michael@0: namespace WebCore { michael@0: michael@0: const int HRTFDatabase::MinElevation = -45; michael@0: const int HRTFDatabase::MaxElevation = 90; michael@0: const unsigned HRTFDatabase::RawElevationAngleSpacing = 15; michael@0: const unsigned HRTFDatabase::NumberOfRawElevations = 10; // -45 -> +90 (each 15 degrees) michael@0: const unsigned HRTFDatabase::InterpolationFactor = 1; michael@0: const unsigned HRTFDatabase::NumberOfTotalElevations = NumberOfRawElevations * InterpolationFactor; michael@0: michael@0: nsReturnRef HRTFDatabase::create(float sampleRate) michael@0: { michael@0: return nsReturnRef(new HRTFDatabase(sampleRate)); michael@0: } michael@0: michael@0: HRTFDatabase::HRTFDatabase(float sampleRate) michael@0: : m_sampleRate(sampleRate) michael@0: { michael@0: m_elevations.SetLength(NumberOfTotalElevations); michael@0: michael@0: unsigned elevationIndex = 0; michael@0: for (int elevation = MinElevation; elevation <= MaxElevation; elevation += RawElevationAngleSpacing) { michael@0: nsAutoRef hrtfElevation(HRTFElevation::createBuiltin(elevation, sampleRate)); michael@0: MOZ_ASSERT(hrtfElevation.get()); michael@0: if (!hrtfElevation.get()) michael@0: return; michael@0: michael@0: m_elevations[elevationIndex] = hrtfElevation.out(); michael@0: elevationIndex += InterpolationFactor; michael@0: } michael@0: michael@0: // Now, go back and interpolate elevations. michael@0: if (InterpolationFactor > 1) { michael@0: for (unsigned i = 0; i < NumberOfTotalElevations; i += InterpolationFactor) { michael@0: unsigned j = (i + InterpolationFactor); michael@0: if (j >= NumberOfTotalElevations) michael@0: j = i; // for last elevation interpolate with itself michael@0: michael@0: // Create the interpolated convolution kernels and delays. michael@0: for (unsigned jj = 1; jj < InterpolationFactor; ++jj) { michael@0: float x = static_cast(jj) / static_cast(InterpolationFactor); michael@0: m_elevations[i + jj] = HRTFElevation::createByInterpolatingSlices(m_elevations[i].get(), m_elevations[j].get(), x, sampleRate); michael@0: MOZ_ASSERT(m_elevations[i + jj].get()); michael@0: } michael@0: } michael@0: } michael@0: } michael@0: michael@0: size_t HRTFDatabase::sizeOfIncludingThis(mozilla::MallocSizeOf aMallocSizeOf) const michael@0: { michael@0: size_t amount = aMallocSizeOf(this); michael@0: amount += m_elevations.SizeOfExcludingThis(aMallocSizeOf); michael@0: for (size_t i = 0; i < m_elevations.Length(); i++) { michael@0: amount += m_elevations[i]->sizeOfIncludingThis(aMallocSizeOf); michael@0: } michael@0: michael@0: return amount; michael@0: } michael@0: michael@0: void HRTFDatabase::getKernelsFromAzimuthElevation(double azimuthBlend, unsigned azimuthIndex, double elevationAngle, HRTFKernel* &kernelL, HRTFKernel* &kernelR, michael@0: double& frameDelayL, double& frameDelayR) michael@0: { michael@0: unsigned elevationIndex = indexFromElevationAngle(elevationAngle); michael@0: MOZ_ASSERT(elevationIndex < m_elevations.Length() && m_elevations.Length() > 0); michael@0: michael@0: if (!m_elevations.Length()) { michael@0: kernelL = 0; michael@0: kernelR = 0; michael@0: return; michael@0: } michael@0: michael@0: if (elevationIndex > m_elevations.Length() - 1) michael@0: elevationIndex = m_elevations.Length() - 1; michael@0: michael@0: HRTFElevation* hrtfElevation = m_elevations[elevationIndex].get(); michael@0: MOZ_ASSERT(hrtfElevation); michael@0: if (!hrtfElevation) { michael@0: kernelL = 0; michael@0: kernelR = 0; michael@0: return; michael@0: } michael@0: michael@0: hrtfElevation->getKernelsFromAzimuth(azimuthBlend, azimuthIndex, kernelL, kernelR, frameDelayL, frameDelayR); michael@0: } michael@0: michael@0: unsigned HRTFDatabase::indexFromElevationAngle(double elevationAngle) michael@0: { michael@0: // Clamp to allowed range. michael@0: elevationAngle = mozilla::clamped(elevationAngle, michael@0: static_cast(MinElevation), michael@0: static_cast(MaxElevation)); michael@0: michael@0: unsigned elevationIndex = static_cast(InterpolationFactor * (elevationAngle - MinElevation) / RawElevationAngleSpacing); michael@0: return elevationIndex; michael@0: } michael@0: michael@0: } // namespace WebCore