OLD | NEW |
---|---|
1 /* | 1 /* |
2 * Copyright (c) 2014 The WebRTC project authors. All Rights Reserved. | 2 * Copyright (c) 2014 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/common_audio/blocker.h" | 11 #include "webrtc/common_audio/blocker.h" |
12 | 12 |
13 #include <string.h> | 13 #include <string.h> |
14 | 14 |
15 #include "webrtc/base/checks.h" | 15 #include "webrtc/base/checks.h" |
16 | 16 |
17 namespace { | 17 namespace { |
18 | 18 |
19 // Adds |a| and |b| frame by frame into |result| (basically matrix addition). | 19 // Adds |a| and |b| frame by frame into |result| (basically matrix addition). |
20 void AddFrames(const float* const* a, | 20 void AddFrames(const float* const* a, |
21 int a_start_index, | 21 size_t a_start_index, |
22 const float* const* b, | 22 const float* const* b, |
23 int b_start_index, | 23 int b_start_index, |
24 int num_frames, | 24 size_t num_frames, |
25 int num_channels, | 25 int num_channels, |
26 float* const* result, | 26 float* const* result, |
27 int result_start_index) { | 27 size_t result_start_index) { |
28 for (int i = 0; i < num_channels; ++i) { | 28 for (int i = 0; i < num_channels; ++i) { |
29 for (int j = 0; j < num_frames; ++j) { | 29 for (size_t j = 0; j < num_frames; ++j) { |
30 result[i][j + result_start_index] = | 30 result[i][j + result_start_index] = |
31 a[i][j + a_start_index] + b[i][j + b_start_index]; | 31 a[i][j + a_start_index] + b[i][j + b_start_index]; |
32 } | 32 } |
33 } | 33 } |
34 } | 34 } |
35 | 35 |
36 // Copies |src| into |dst| channel by channel. | 36 // Copies |src| into |dst| channel by channel. |
37 void CopyFrames(const float* const* src, | 37 void CopyFrames(const float* const* src, |
38 int src_start_index, | 38 size_t src_start_index, |
39 int num_frames, | 39 size_t num_frames, |
40 int num_channels, | 40 int num_channels, |
41 float* const* dst, | 41 float* const* dst, |
42 int dst_start_index) { | 42 size_t dst_start_index) { |
43 for (int i = 0; i < num_channels; ++i) { | 43 for (int i = 0; i < num_channels; ++i) { |
44 memcpy(&dst[i][dst_start_index], | 44 memcpy(&dst[i][dst_start_index], |
45 &src[i][src_start_index], | 45 &src[i][src_start_index], |
46 num_frames * sizeof(dst[i][dst_start_index])); | 46 num_frames * sizeof(dst[i][dst_start_index])); |
47 } | 47 } |
48 } | 48 } |
49 | 49 |
50 // Moves |src| into |dst| channel by channel. | 50 // Moves |src| into |dst| channel by channel. |
51 void MoveFrames(const float* const* src, | 51 void MoveFrames(const float* const* src, |
52 int src_start_index, | 52 size_t src_start_index, |
53 int num_frames, | 53 size_t num_frames, |
54 int num_channels, | 54 int num_channels, |
55 float* const* dst, | 55 float* const* dst, |
56 int dst_start_index) { | 56 size_t dst_start_index) { |
57 for (int i = 0; i < num_channels; ++i) { | 57 for (int i = 0; i < num_channels; ++i) { |
58 memmove(&dst[i][dst_start_index], | 58 memmove(&dst[i][dst_start_index], |
59 &src[i][src_start_index], | 59 &src[i][src_start_index], |
60 num_frames * sizeof(dst[i][dst_start_index])); | 60 num_frames * sizeof(dst[i][dst_start_index])); |
61 } | 61 } |
62 } | 62 } |
63 | 63 |
64 void ZeroOut(float* const* buffer, | 64 void ZeroOut(float* const* buffer, |
65 int starting_idx, | 65 size_t starting_idx, |
66 int num_frames, | 66 size_t num_frames, |
67 int num_channels) { | 67 int num_channels) { |
68 for (int i = 0; i < num_channels; ++i) { | 68 for (int i = 0; i < num_channels; ++i) { |
69 memset(&buffer[i][starting_idx], 0, | 69 memset(&buffer[i][starting_idx], 0, |
70 num_frames * sizeof(buffer[i][starting_idx])); | 70 num_frames * sizeof(buffer[i][starting_idx])); |
71 } | 71 } |
72 } | 72 } |
73 | 73 |
74 // Pointwise multiplies each channel of |frames| with |window|. Results are | 74 // Pointwise multiplies each channel of |frames| with |window|. Results are |
75 // stored in |frames|. | 75 // stored in |frames|. |
76 void ApplyWindow(const float* window, | 76 void ApplyWindow(const float* window, |
77 int num_frames, | 77 size_t num_frames, |
78 int num_channels, | 78 int num_channels, |
79 float* const* frames) { | 79 float* const* frames) { |
80 for (int i = 0; i < num_channels; ++i) { | 80 for (int i = 0; i < num_channels; ++i) { |
81 for (int j = 0; j < num_frames; ++j) { | 81 for (size_t j = 0; j < num_frames; ++j) { |
82 frames[i][j] = frames[i][j] * window[j]; | 82 frames[i][j] = frames[i][j] * window[j]; |
83 } | 83 } |
84 } | 84 } |
85 } | 85 } |
86 | 86 |
87 int gcd(int a, int b) { | 87 size_t gcd(size_t a, size_t b) { |
88 int tmp; | 88 size_t tmp; |
89 while (b) { | 89 while (b) { |
90 tmp = a; | 90 tmp = a; |
91 a = b; | 91 a = b; |
92 b = tmp % b; | 92 b = tmp % b; |
93 } | 93 } |
94 return a; | 94 return a; |
95 } | 95 } |
96 | 96 |
97 } // namespace | 97 } // namespace |
98 | 98 |
99 namespace webrtc { | 99 namespace webrtc { |
100 | 100 |
101 Blocker::Blocker(int chunk_size, | 101 Blocker::Blocker(size_t chunk_size, |
102 int block_size, | 102 size_t block_size, |
103 int num_input_channels, | 103 int num_input_channels, |
104 int num_output_channels, | 104 int num_output_channels, |
105 const float* window, | 105 const float* window, |
106 int shift_amount, | 106 size_t shift_amount, |
107 BlockerCallback* callback) | 107 BlockerCallback* callback) |
108 : chunk_size_(chunk_size), | 108 : chunk_size_(chunk_size), |
109 block_size_(block_size), | 109 block_size_(block_size), |
110 num_input_channels_(num_input_channels), | 110 num_input_channels_(num_input_channels), |
111 num_output_channels_(num_output_channels), | 111 num_output_channels_(num_output_channels), |
112 initial_delay_(block_size_ - gcd(chunk_size, shift_amount)), | 112 initial_delay_(block_size_ - gcd(chunk_size, shift_amount)), |
113 frame_offset_(0), | 113 frame_offset_(0), |
114 input_buffer_(num_input_channels_, chunk_size_ + initial_delay_), | 114 input_buffer_(num_input_channels_, chunk_size_ + initial_delay_), |
115 output_buffer_(chunk_size_ + initial_delay_, num_output_channels_), | 115 output_buffer_(chunk_size_ + initial_delay_, num_output_channels_), |
116 input_block_(block_size_, num_input_channels_), | 116 input_block_(block_size_, num_input_channels_), |
117 output_block_(block_size_, num_output_channels_), | 117 output_block_(block_size_, num_output_channels_), |
118 window_(new float[block_size_]), | 118 window_(new float[block_size_]), |
119 shift_amount_(shift_amount), | 119 shift_amount_(shift_amount), |
120 callback_(callback) { | 120 callback_(callback) { |
121 CHECK_LE(num_output_channels_, num_input_channels_); | 121 CHECK_LE(num_output_channels_, num_input_channels_); |
122 CHECK(window); | 122 CHECK(window); |
123 | 123 |
124 memcpy(window_.get(), window, block_size_ * sizeof(*window_.get())); | 124 memcpy(window_.get(), window, block_size_ * sizeof(*window_.get())); |
125 input_buffer_.MoveReadPosition(-initial_delay_); | 125 input_buffer_.MoveReadPosition(-static_cast<int>(initial_delay_)); |
Peter Kasting
2015/07/23 00:26:47
A couple places we call MoveReadPosition() with a
Andrew MacDonald
2015/07/24 19:01:55
I think that makes a lot of sense. CL up here:
htt
Peter Kasting
2015/07/27 23:23:38
I will update once you land this.
| |
126 } | 126 } |
127 | 127 |
128 // When block_size < chunk_size the input and output buffers look like this: | 128 // When block_size < chunk_size the input and output buffers look like this: |
129 // | 129 // |
130 // delay* chunk_size chunk_size + delay* | 130 // delay* chunk_size chunk_size + delay* |
131 // buffer: <-------------|---------------------|---------------|> | 131 // buffer: <-------------|---------------------|---------------|> |
132 // _a_ _b_ _c_ | 132 // _a_ _b_ _c_ |
133 // | 133 // |
134 // On each call to ProcessChunk(): | 134 // On each call to ProcessChunk(): |
135 // 1. New input gets read into sections _b_ and _c_ of the input buffer. | 135 // 1. New input gets read into sections _b_ and _c_ of the input buffer. |
(...skipping 22 matching lines...) Expand all Loading... | |
158 // 5. We copy section _a_ of the output buffer into output. | 158 // 5. We copy section _a_ of the output buffer into output. |
159 // 6. For both the input and the output buffers, we copy sections _b_ and _c_ | 159 // 6. For both the input and the output buffers, we copy sections _b_ and _c_ |
160 // into section _a_ and _b_. | 160 // into section _a_ and _b_. |
161 // 7. We set the new frame_offset to be the difference between the first frame | 161 // 7. We set the new frame_offset to be the difference between the first frame |
162 // of |bl| and the border between sections _a_ and _b_. | 162 // of |bl| and the border between sections _a_ and _b_. |
163 // | 163 // |
164 // * delay here refers to inintial_delay_ | 164 // * delay here refers to inintial_delay_ |
165 // | 165 // |
166 // TODO(claguna): Look at using ring buffers to eliminate some copies. | 166 // TODO(claguna): Look at using ring buffers to eliminate some copies. |
167 void Blocker::ProcessChunk(const float* const* input, | 167 void Blocker::ProcessChunk(const float* const* input, |
168 int chunk_size, | 168 size_t chunk_size, |
169 int num_input_channels, | 169 int num_input_channels, |
170 int num_output_channels, | 170 int num_output_channels, |
171 float* const* output) { | 171 float* const* output) { |
172 CHECK_EQ(chunk_size, chunk_size_); | 172 CHECK_EQ(chunk_size, chunk_size_); |
173 CHECK_EQ(num_input_channels, num_input_channels_); | 173 CHECK_EQ(num_input_channels, num_input_channels_); |
174 CHECK_EQ(num_output_channels, num_output_channels_); | 174 CHECK_EQ(num_output_channels, num_output_channels_); |
175 | 175 |
176 input_buffer_.Write(input, num_input_channels, chunk_size_); | 176 input_buffer_.Write(input, num_input_channels, chunk_size_); |
177 int first_frame_in_block = frame_offset_; | 177 size_t first_frame_in_block = frame_offset_; |
178 | 178 |
179 // Loop through blocks. | 179 // Loop through blocks. |
180 while (first_frame_in_block < chunk_size_) { | 180 while (first_frame_in_block < chunk_size_) { |
181 input_buffer_.Read(input_block_.channels(), num_input_channels, | 181 input_buffer_.Read(input_block_.channels(), num_input_channels, |
182 block_size_); | 182 block_size_); |
183 input_buffer_.MoveReadPosition(-block_size_ + shift_amount_); | 183 input_buffer_.MoveReadPosition( |
184 -static_cast<int>(block_size_) + static_cast<int>(shift_amount_)); | |
184 | 185 |
185 ApplyWindow(window_.get(), | 186 ApplyWindow(window_.get(), |
186 block_size_, | 187 block_size_, |
187 num_input_channels_, | 188 num_input_channels_, |
188 input_block_.channels()); | 189 input_block_.channels()); |
189 callback_->ProcessBlock(input_block_.channels(), | 190 callback_->ProcessBlock(input_block_.channels(), |
190 block_size_, | 191 block_size_, |
191 num_input_channels_, | 192 num_input_channels_, |
192 num_output_channels_, | 193 num_output_channels_, |
193 output_block_.channels()); | 194 output_block_.channels()); |
(...skipping 33 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
227 ZeroOut(output_buffer_.channels(), | 228 ZeroOut(output_buffer_.channels(), |
228 initial_delay_, | 229 initial_delay_, |
229 chunk_size_, | 230 chunk_size_, |
230 num_output_channels_); | 231 num_output_channels_); |
231 | 232 |
232 // Calculate new starting frames. | 233 // Calculate new starting frames. |
233 frame_offset_ = first_frame_in_block - chunk_size_; | 234 frame_offset_ = first_frame_in_block - chunk_size_; |
234 } | 235 } |
235 | 236 |
236 } // namespace webrtc | 237 } // namespace webrtc |
OLD | NEW |