OLD | NEW |
1 /* | 1 /* |
2 * Copyright (c) 2013 The WebRTC project authors. All Rights Reserved. | 2 * Copyright (c) 2013 The WebRTC project authors. All Rights Reserved. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license | 4 * Use of this source code is governed by a BSD-style license |
5 * that can be found in the LICENSE file in the root of the source | 5 * that can be found in the LICENSE file in the root of the source |
6 * tree. An additional intellectual property rights grant can be found | 6 * tree. An additional intellectual property rights grant can be found |
7 * in the file PATENTS. All contributing project authors may | 7 * in the file PATENTS. All contributing project authors may |
8 * be found in the AUTHORS file in the root of the source tree. | 8 * be found in the AUTHORS file in the root of the source tree. |
9 */ | 9 */ |
10 | 10 |
11 #include "webrtc/modules/audio_processing/transient/wpd_tree.h" | 11 #include "webrtc/modules/audio_processing/transient/wpd_tree.h" |
12 | 12 |
13 #include <assert.h> | |
14 #include <math.h> | 13 #include <math.h> |
15 #include <string.h> | 14 #include <string.h> |
16 | 15 |
| 16 #include "webrtc/base/checks.h" |
17 #include "webrtc/modules/audio_processing/transient/dyadic_decimator.h" | 17 #include "webrtc/modules/audio_processing/transient/dyadic_decimator.h" |
18 #include "webrtc/modules/audio_processing/transient/wpd_node.h" | 18 #include "webrtc/modules/audio_processing/transient/wpd_node.h" |
19 | 19 |
20 namespace webrtc { | 20 namespace webrtc { |
21 | 21 |
22 WPDTree::WPDTree(size_t data_length, const float* high_pass_coefficients, | 22 WPDTree::WPDTree(size_t data_length, const float* high_pass_coefficients, |
23 const float* low_pass_coefficients, size_t coefficients_length, | 23 const float* low_pass_coefficients, size_t coefficients_length, |
24 int levels) | 24 int levels) |
25 : data_length_(data_length), | 25 : data_length_(data_length), |
26 levels_(levels), | 26 levels_(levels), |
27 num_nodes_((1 << (levels + 1)) - 1) { | 27 num_nodes_((1 << (levels + 1)) - 1) { |
28 assert(data_length > (static_cast<size_t>(1) << levels) && | 28 RTC_DCHECK_GT(data_length, (static_cast<size_t>(1) << levels)); |
29 high_pass_coefficients && | 29 RTC_DCHECK(high_pass_coefficients); |
30 low_pass_coefficients && | 30 RTC_DCHECK(low_pass_coefficients); |
31 levels > 0); | 31 RTC_DCHECK_GT(levels, 0); |
32 // Size is 1 more, so we can use the array as 1-based. nodes_[0] is never | 32 // Size is 1 more, so we can use the array as 1-based. nodes_[0] is never |
33 // allocated. | 33 // allocated. |
34 nodes_.reset(new std::unique_ptr<WPDNode>[num_nodes_ + 1]); | 34 nodes_.reset(new std::unique_ptr<WPDNode>[num_nodes_ + 1]); |
35 | 35 |
36 // Create the first node | 36 // Create the first node |
37 const float kRootCoefficient = 1.f; // Identity Coefficient. | 37 const float kRootCoefficient = 1.f; // Identity Coefficient. |
38 nodes_[1].reset(new WPDNode(data_length, &kRootCoefficient, 1)); | 38 nodes_[1].reset(new WPDNode(data_length, &kRootCoefficient, 1)); |
39 // Variables used to create the rest of the nodes. | 39 // Variables used to create the rest of the nodes. |
40 size_t index = 1; | 40 size_t index = 1; |
41 size_t index_left_child = 0; | 41 size_t index_left_child = 0; |
(...skipping 67 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
109 if (update_result != 0) { | 109 if (update_result != 0) { |
110 return -1; | 110 return -1; |
111 } | 111 } |
112 } | 112 } |
113 } | 113 } |
114 | 114 |
115 return 0; | 115 return 0; |
116 } | 116 } |
117 | 117 |
118 } // namespace webrtc | 118 } // namespace webrtc |
OLD | NEW |