1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
|
/*
* 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:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "third_party/blink/renderer/platform/audio/audio_dsp_kernel.h"
#include "third_party/blink/renderer/platform/audio/audio_dsp_kernel_processor.h"
namespace blink {
// setNumberOfChannels() may later be called if the object is not yet in an
// "initialized" state.
AudioDSPKernelProcessor::AudioDSPKernelProcessor(float sample_rate,
unsigned number_of_channels)
: AudioProcessor(sample_rate, number_of_channels), has_just_reset_(true) {}
void AudioDSPKernelProcessor::Initialize() {
if (IsInitialized())
return;
MutexLocker locker(process_lock_);
DCHECK(!kernels_.size());
// Create processing kernels, one per channel.
for (unsigned i = 0; i < NumberOfChannels(); ++i)
kernels_.push_back(CreateKernel());
initialized_ = true;
has_just_reset_ = true;
}
void AudioDSPKernelProcessor::Uninitialize() {
if (!IsInitialized())
return;
MutexLocker locker(process_lock_);
kernels_.clear();
initialized_ = false;
}
void AudioDSPKernelProcessor::Process(const AudioBus* source,
AudioBus* destination,
size_t frames_to_process) {
DCHECK(source);
DCHECK(destination);
if (!source || !destination)
return;
if (!IsInitialized()) {
destination->Zero();
return;
}
MutexTryLocker try_locker(process_lock_);
if (try_locker.Locked()) {
bool channel_count_matches =
source->NumberOfChannels() == destination->NumberOfChannels() &&
source->NumberOfChannels() == kernels_.size();
DCHECK(channel_count_matches);
if (!channel_count_matches)
return;
for (unsigned i = 0; i < kernels_.size(); ++i)
kernels_[i]->Process(source->Channel(i)->Data(),
destination->Channel(i)->MutableData(),
frames_to_process);
} else {
// Unfortunately, the kernel is being processed by another thread.
// See also ConvolverNode::process().
destination->Zero();
}
}
void AudioDSPKernelProcessor::ProcessOnlyAudioParams(size_t frames_to_process) {
if (!IsInitialized())
return;
MutexTryLocker try_locker(process_lock_);
// Only update the AudioParams if we can get the lock. If not, some
// other thread is updating the kernels, so we'll have to skip it
// this time.
if (try_locker.Locked()) {
for (unsigned i = 0; i < kernels_.size(); ++i)
kernels_[i]->ProcessOnlyAudioParams(frames_to_process);
}
}
// Resets filter state
void AudioDSPKernelProcessor::Reset() {
DCHECK(IsMainThread());
if (!IsInitialized())
return;
// Forces snap to parameter values - first time.
// Any processing depending on this value must set it to false at the
// appropriate time.
has_just_reset_ = true;
MutexLocker locker(process_lock_);
for (unsigned i = 0; i < kernels_.size(); ++i)
kernels_[i]->Reset();
}
void AudioDSPKernelProcessor::SetNumberOfChannels(unsigned number_of_channels) {
if (number_of_channels == number_of_channels_)
return;
DCHECK(!IsInitialized());
if (!IsInitialized())
number_of_channels_ = number_of_channels;
}
bool AudioDSPKernelProcessor::RequiresTailProcessing() const {
// Always return true even if the tail time and latency might both be zero.
return true;
}
double AudioDSPKernelProcessor::TailTime() const {
DCHECK(!IsMainThread());
MutexTryLocker try_locker(process_lock_);
if (try_locker.Locked()) {
// It is expected that all the kernels have the same tailTime.
return !kernels_.IsEmpty() ? kernels_.front()->TailTime() : 0;
}
// Since we don't want to block the Audio Device thread, we return a large
// value instead of trying to acquire the lock.
return std::numeric_limits<double>::infinity();
}
double AudioDSPKernelProcessor::LatencyTime() const {
DCHECK(!IsMainThread());
MutexTryLocker try_locker(process_lock_);
if (try_locker.Locked()) {
// It is expected that all the kernels have the same latencyTime.
return !kernels_.IsEmpty() ? kernels_.front()->LatencyTime() : 0;
}
// Since we don't want to block the Audio Device thread, we return a large
// value instead of trying to acquire the lock.
return std::numeric_limits<double>::infinity();
}
} // namespace blink
|
