OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2010, Google Inc. All rights reserved. | 2 * Copyright (C) 2010, Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions | 5 * modification, are permitted provided that the following conditions |
6 * are met: | 6 * are met: |
7 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
(...skipping 27 matching lines...) Expand all Loading... |
38 #include "wtf/MainThread.h" | 38 #include "wtf/MainThread.h" |
39 | 39 |
40 // Note about empirical tuning: | 40 // Note about empirical tuning: |
41 // The maximum FFT size affects reverb performance and accuracy. | 41 // The maximum FFT size affects reverb performance and accuracy. |
42 // If the reverb is single-threaded and processes entirely in the real-time audi
o thread, | 42 // If the reverb is single-threaded and processes entirely in the real-time audi
o thread, |
43 // it's important not to make this too high. In this case 8192 is a good value. | 43 // it's important not to make this too high. In this case 8192 is a good value. |
44 // But, the Reverb object is multi-threaded, so we want this as high as possible
without losing too much accuracy. | 44 // But, the Reverb object is multi-threaded, so we want this as high as possible
without losing too much accuracy. |
45 // Very large FFTs will have worse phase errors. Given these constraints 32768 i
s a good compromise. | 45 // Very large FFTs will have worse phase errors. Given these constraints 32768 i
s a good compromise. |
46 const size_t MaxFFTSize = 32768; | 46 const size_t MaxFFTSize = 32768; |
47 | 47 |
48 namespace WebCore { | 48 namespace blink { |
49 | 49 |
50 ConvolverNode::ConvolverNode(AudioContext* context, float sampleRate) | 50 ConvolverNode::ConvolverNode(AudioContext* context, float sampleRate) |
51 : AudioNode(context, sampleRate) | 51 : AudioNode(context, sampleRate) |
52 , m_normalize(true) | 52 , m_normalize(true) |
53 { | 53 { |
54 ScriptWrappable::init(this); | 54 ScriptWrappable::init(this); |
55 addInput(); | 55 addInput(); |
56 addOutput(AudioNodeOutput::create(this, 2)); | 56 addOutput(AudioNodeOutput::create(this, 2)); |
57 | 57 |
58 // Node-specific default mixing rules. | 58 // Node-specific default mixing rules. |
(...skipping 119 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
178 // instead of trying to acquire the lock. | 178 // instead of trying to acquire the lock. |
179 return std::numeric_limits<double>::infinity(); | 179 return std::numeric_limits<double>::infinity(); |
180 } | 180 } |
181 | 181 |
182 void ConvolverNode::trace(Visitor* visitor) | 182 void ConvolverNode::trace(Visitor* visitor) |
183 { | 183 { |
184 visitor->trace(m_buffer); | 184 visitor->trace(m_buffer); |
185 AudioNode::trace(visitor); | 185 AudioNode::trace(visitor); |
186 } | 186 } |
187 | 187 |
188 } // namespace WebCore | 188 } // namespace blink |
189 | 189 |
190 #endif // ENABLE(WEB_AUDIO) | 190 #endif // ENABLE(WEB_AUDIO) |
OLD | NEW |