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 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246
|
/*
* 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
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS 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 APPLE INC. OR ITS 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 "config.h"
#if ENABLE(WEB_AUDIO)
#include "AudioNodeInput.h"
#include "AudioContext.h"
#include "AudioNode.h"
#include "AudioNodeOutput.h"
#include <algorithm>
using namespace std;
namespace WebCore {
AudioNodeInput::AudioNodeInput(AudioNode* node)
: AudioSummingJunction(node->context())
, m_node(node)
{
// Set to mono by default.
m_internalSummingBus = AudioBus::create(1, AudioNode::ProcessingSizeInFrames);
}
void AudioNodeInput::connect(AudioNodeOutput* output)
{
ASSERT(context()->isGraphOwner());
ASSERT(output && node());
if (!output || !node())
return;
// Check if we're already connected to this output.
if (m_outputs.contains(output))
return;
output->addInput(this);
m_outputs.add(output);
changedOutputs();
// Sombody has just connected to us, so count it as a reference.
node()->ref(AudioNode::RefTypeConnection);
}
void AudioNodeInput::disconnect(AudioNodeOutput* output)
{
ASSERT(context()->isGraphOwner());
ASSERT(output && node());
if (!output || !node())
return;
// First try to disconnect from "active" connections.
if (m_outputs.contains(output)) {
m_outputs.remove(output);
changedOutputs();
output->removeInput(this);
node()->deref(AudioNode::RefTypeConnection); // Note: it's important to return immediately after all deref() calls since the node may be deleted.
return;
}
// Otherwise, try to disconnect from disabled connections.
if (m_disabledOutputs.contains(output)) {
m_disabledOutputs.remove(output);
output->removeInput(this);
node()->deref(AudioNode::RefTypeConnection); // Note: it's important to return immediately after all deref() calls since the node may be deleted.
return;
}
ASSERT_NOT_REACHED();
}
void AudioNodeInput::disable(AudioNodeOutput* output)
{
ASSERT(context()->isGraphOwner());
ASSERT(output && node());
if (!output || !node())
return;
ASSERT(m_outputs.contains(output));
m_disabledOutputs.add(output);
m_outputs.remove(output);
changedOutputs();
// Propagate disabled state to outputs.
node()->disableOutputsIfNecessary();
}
void AudioNodeInput::enable(AudioNodeOutput* output)
{
ASSERT(context()->isGraphOwner());
ASSERT(output && node());
if (!output || !node())
return;
ASSERT(m_disabledOutputs.contains(output));
// Move output from disabled list to active list.
m_outputs.add(output);
m_disabledOutputs.remove(output);
changedOutputs();
// Propagate enabled state to outputs.
node()->enableOutputsIfNecessary();
}
void AudioNodeInput::didUpdate()
{
node()->checkNumberOfChannelsForInput(this);
}
void AudioNodeInput::updateInternalBus()
{
ASSERT(context()->isAudioThread() && context()->isGraphOwner());
unsigned numberOfInputChannels = numberOfChannels();
if (numberOfInputChannels == m_internalSummingBus->numberOfChannels())
return;
m_internalSummingBus = AudioBus::create(numberOfInputChannels, AudioNode::ProcessingSizeInFrames);
}
unsigned AudioNodeInput::numberOfChannels() const
{
AudioNode::ChannelCountMode mode = node()->internalChannelCountMode();
if (mode == AudioNode::Explicit)
return node()->channelCount();
// Find the number of channels of the connection with the largest number of channels.
unsigned maxChannels = 1; // one channel is the minimum allowed
for (HashSet<AudioNodeOutput*>::iterator i = m_outputs.begin(); i != m_outputs.end(); ++i) {
AudioNodeOutput* output = *i;
// Use output()->numberOfChannels() instead of output->bus()->numberOfChannels(),
// because the calling of AudioNodeOutput::bus() is not safe here.
maxChannels = max(maxChannels, output->numberOfChannels());
}
if (mode == AudioNode::ClampedMax)
maxChannels = min(maxChannels, static_cast<unsigned>(node()->channelCount()));
return maxChannels;
}
AudioBus* AudioNodeInput::bus()
{
ASSERT(context()->isAudioThread());
// Handle single connection specially to allow for in-place processing.
if (numberOfRenderingConnections() == 1 && node()->internalChannelCountMode() == AudioNode::Max)
return renderingOutput(0)->bus();
// Multiple connections case or complex ChannelCountMode (or no connections).
return internalSummingBus();
}
AudioBus* AudioNodeInput::internalSummingBus()
{
ASSERT(context()->isAudioThread());
return m_internalSummingBus.get();
}
void AudioNodeInput::sumAllConnections(AudioBus* summingBus, size_t framesToProcess)
{
ASSERT(context()->isAudioThread());
// We shouldn't be calling this method if there's only one connection, since it's less efficient.
ASSERT(numberOfRenderingConnections() > 1 || node()->internalChannelCountMode() != AudioNode::Max);
ASSERT(summingBus);
if (!summingBus)
return;
summingBus->zero();
AudioBus::ChannelInterpretation interpretation = node()->internalChannelInterpretation();
for (unsigned i = 0; i < numberOfRenderingConnections(); ++i) {
AudioNodeOutput* output = renderingOutput(i);
ASSERT(output);
// Render audio from this output.
AudioBus* connectionBus = output->pull(0, framesToProcess);
// Sum, with unity-gain.
summingBus->sumFrom(*connectionBus, interpretation);
}
}
AudioBus* AudioNodeInput::pull(AudioBus* inPlaceBus, size_t framesToProcess)
{
ASSERT(context()->isAudioThread());
// Handle single connection case.
if (numberOfRenderingConnections() == 1 && node()->internalChannelCountMode() == AudioNode::Max) {
// The output will optimize processing using inPlaceBus if it's able.
AudioNodeOutput* output = this->renderingOutput(0);
return output->pull(inPlaceBus, framesToProcess);
}
AudioBus* internalSummingBus = this->internalSummingBus();
if (!numberOfRenderingConnections()) {
// At least, generate silence if we're not connected to anything.
// FIXME: if we wanted to get fancy, we could propagate a 'silent hint' here to optimize the downstream graph processing.
internalSummingBus->zero();
return internalSummingBus;
}
// Handle multiple connections case.
sumAllConnections(internalSummingBus, framesToProcess);
return internalSummingBus;
}
} // namespace WebCore
#endif // ENABLE(WEB_AUDIO)
|