Chromium Code Reviews| Index: webrtc/modules/audio_coding/neteq/merge.cc |
| diff --git a/webrtc/modules/audio_coding/neteq/merge.cc b/webrtc/modules/audio_coding/neteq/merge.cc |
| index fa033cf63eaa5f4695c5bba76bed2b9ebb0155d5..040c1b72bdcb07eafbb9bdfbf961ba4631f437c6 100644 |
| --- a/webrtc/modules/audio_coding/neteq/merge.cc |
| +++ b/webrtc/modules/audio_coding/neteq/merge.cc |
| @@ -309,8 +309,8 @@ int16_t Merge::CorrelateAndPeakSearch(int16_t expanded_max, int16_t input_max, |
| int expand_period) const { |
| // Calculate correlation without any normalization. |
| const int max_corr_length = kMaxCorrelationLength; |
| - int stop_position_downsamp = std::min( |
| - max_corr_length, expand_->max_lag() / (fs_mult_ * 2) + 1); |
| + int stop_position_downsamp = |
| + std::min(max_corr_length, expand_->max_lag() / (fs_mult_ * 2) + 1); |
| int correlation_shift = 0; |
| if (expanded_max * input_max > 26843546) { |
| correlation_shift = 3; |
| @@ -364,9 +364,9 @@ int16_t Merge::CorrelateAndPeakSearch(int16_t expanded_max, int16_t input_max, |
| // Ensure that underrun does not occur for 10ms case => we have to get at |
| // least 10ms + overlap . (This should never happen thanks to the above |
| // modification of peak-finding starting point.) |
| - while ((best_correlation_index + input_length) < |
| - static_cast<int>(timestamps_per_call_ + expand_->overlap_length()) || |
| - best_correlation_index + input_length < start_position) { |
| + while (((best_correlation_index + input_length) < |
| + static_cast<int>(timestamps_per_call_ + expand_->overlap_length())) || |
| + ((best_correlation_index + input_length) < start_position)) { |
|
kwiberg-webrtc
2015/06/10 11:58:32
Why the extra parentheses? There were too many to
|
| assert(false); // Should never happen. |
| best_correlation_index += expand_period; // Jump one lag ahead. |
| } |