Thu, 22 Jan 2015 13:21:57 +0100
Incorporate requested changes from Mozilla in review:
https://bugzilla.mozilla.org/show_bug.cgi?id=1123480#c6
michael@0 | 1 | /* |
michael@0 | 2 | * Copyright (C) 2010 Google Inc. All rights reserved. |
michael@0 | 3 | * |
michael@0 | 4 | * Redistribution and use in source and binary forms, with or without |
michael@0 | 5 | * modification, are permitted provided that the following conditions |
michael@0 | 6 | * are met: |
michael@0 | 7 | * |
michael@0 | 8 | * 1. Redistributions of source code must retain the above copyright |
michael@0 | 9 | * notice, this list of conditions and the following disclaimer. |
michael@0 | 10 | * 2. Redistributions in binary form must reproduce the above copyright |
michael@0 | 11 | * notice, this list of conditions and the following disclaimer in the |
michael@0 | 12 | * documentation and/or other materials provided with the distribution. |
michael@0 | 13 | * 3. Neither the name of Apple Computer, Inc. ("Apple") nor the names of |
michael@0 | 14 | * its contributors may be used to endorse or promote products derived |
michael@0 | 15 | * from this software without specific prior written permission. |
michael@0 | 16 | * |
michael@0 | 17 | * THIS SOFTWARE IS PROVIDED BY APPLE AND ITS CONTRIBUTORS "AS IS" AND ANY |
michael@0 | 18 | * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
michael@0 | 19 | * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
michael@0 | 20 | * DISCLAIMED. IN NO EVENT SHALL APPLE OR ITS CONTRIBUTORS BE LIABLE FOR ANY |
michael@0 | 21 | * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
michael@0 | 22 | * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
michael@0 | 23 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
michael@0 | 24 | * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
michael@0 | 25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
michael@0 | 26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
michael@0 | 27 | */ |
michael@0 | 28 | |
michael@0 | 29 | #ifndef ReverbConvolver_h |
michael@0 | 30 | #define ReverbConvolver_h |
michael@0 | 31 | |
michael@0 | 32 | #include "ReverbAccumulationBuffer.h" |
michael@0 | 33 | #include "ReverbInputBuffer.h" |
michael@0 | 34 | #include "nsAutoPtr.h" |
michael@0 | 35 | #include "mozilla/MemoryReporting.h" |
michael@0 | 36 | #ifdef LOG |
michael@0 | 37 | #undef LOG |
michael@0 | 38 | #endif |
michael@0 | 39 | #include "base/condition_variable.h" |
michael@0 | 40 | #include "base/lock.h" |
michael@0 | 41 | #include "base/thread.h" |
michael@0 | 42 | |
michael@0 | 43 | namespace WebCore { |
michael@0 | 44 | |
michael@0 | 45 | class ReverbConvolverStage; |
michael@0 | 46 | |
michael@0 | 47 | class ReverbConvolver { |
michael@0 | 48 | public: |
michael@0 | 49 | // maxFFTSize can be adjusted (from say 2048 to 32768) depending on how much precision is necessary. |
michael@0 | 50 | // For certain tweaky de-convolving applications the phase errors add up quickly and lead to non-sensical results with |
michael@0 | 51 | // larger FFT sizes and single-precision floats. In these cases 2048 is a good size. |
michael@0 | 52 | // If not doing multi-threaded convolution, then should not go > 8192. |
michael@0 | 53 | ReverbConvolver(const float* impulseResponseData, size_t impulseResponseLength, size_t renderSliceSize, size_t maxFFTSize, size_t convolverRenderPhase, bool useBackgroundThreads); |
michael@0 | 54 | ~ReverbConvolver(); |
michael@0 | 55 | |
michael@0 | 56 | void process(const float* sourceChannelData, size_t sourceChannelLength, |
michael@0 | 57 | float* destinationChannelData, size_t destinationChannelLength, |
michael@0 | 58 | size_t framesToProcess); |
michael@0 | 59 | void reset(); |
michael@0 | 60 | |
michael@0 | 61 | size_t impulseResponseLength() const { return m_impulseResponseLength; } |
michael@0 | 62 | |
michael@0 | 63 | ReverbInputBuffer* inputBuffer() { return &m_inputBuffer; } |
michael@0 | 64 | |
michael@0 | 65 | bool useBackgroundThreads() const { return m_useBackgroundThreads; } |
michael@0 | 66 | void backgroundThreadEntry(); |
michael@0 | 67 | |
michael@0 | 68 | size_t latencyFrames() const; |
michael@0 | 69 | |
michael@0 | 70 | size_t sizeOfIncludingThis(mozilla::MallocSizeOf aMallocSizeOf) const; |
michael@0 | 71 | private: |
michael@0 | 72 | nsTArray<nsAutoPtr<ReverbConvolverStage> > m_stages; |
michael@0 | 73 | nsTArray<nsAutoPtr<ReverbConvolverStage> > m_backgroundStages; |
michael@0 | 74 | size_t m_impulseResponseLength; |
michael@0 | 75 | |
michael@0 | 76 | ReverbAccumulationBuffer m_accumulationBuffer; |
michael@0 | 77 | |
michael@0 | 78 | // One or more background threads read from this input buffer which is fed from the realtime thread. |
michael@0 | 79 | ReverbInputBuffer m_inputBuffer; |
michael@0 | 80 | |
michael@0 | 81 | // First stage will be of size m_minFFTSize. Each next stage will be twice as big until we hit m_maxFFTSize. |
michael@0 | 82 | size_t m_minFFTSize; |
michael@0 | 83 | size_t m_maxFFTSize; |
michael@0 | 84 | |
michael@0 | 85 | // But don't exceed this size in the real-time thread (if we're doing background processing). |
michael@0 | 86 | size_t m_maxRealtimeFFTSize; |
michael@0 | 87 | |
michael@0 | 88 | // Background thread and synchronization |
michael@0 | 89 | base::Thread m_backgroundThread; |
michael@0 | 90 | Lock m_backgroundThreadLock; |
michael@0 | 91 | ConditionVariable m_backgroundThreadCondition; |
michael@0 | 92 | bool m_useBackgroundThreads; |
michael@0 | 93 | bool m_wantsToExit; |
michael@0 | 94 | bool m_moreInputBuffered; |
michael@0 | 95 | }; |
michael@0 | 96 | |
michael@0 | 97 | } // namespace WebCore |
michael@0 | 98 | |
michael@0 | 99 | #endif // ReverbConvolver_h |