mirror of
https://github.com/mollyim/webrtc.git
synced 2025-05-20 09:07:52 +01:00
adbd808e0a
Ring buffer template for a finite number of arrays of given type and size. Bug: webrtc:9076 Change-Id: Ia6c2065b0013f4a00f693966641f9aebe09f6f5c Reviewed-on: https://webrtc-review.googlesource.com/70161 Reviewed-by: Alex Loiko <aleloi@webrtc.org> Reviewed-by: Sam Zackrisson <saza@webrtc.org> Commit-Queue: Alessio Bazzica <alessiob@webrtc.org> Cr-Commit-Position: refs/heads/master@{#22939}
66 lines
2.1 KiB
C++
66 lines
2.1 KiB
C++
/*
|
|
* Copyright (c) 2018 The WebRTC project authors. All Rights Reserved.
|
|
*
|
|
* Use of this source code is governed by a BSD-style license
|
|
* that can be found in the LICENSE file in the root of the source
|
|
* tree. An additional intellectual property rights grant can be found
|
|
* in the file PATENTS. All contributing project authors may
|
|
* be found in the AUTHORS file in the root of the source tree.
|
|
*/
|
|
|
|
#ifndef MODULES_AUDIO_PROCESSING_AGC2_RNN_VAD_RING_BUFFER_H_
|
|
#define MODULES_AUDIO_PROCESSING_AGC2_RNN_VAD_RING_BUFFER_H_
|
|
|
|
#include <array>
|
|
#include <cstring>
|
|
#include <type_traits>
|
|
|
|
#include "api/array_view.h"
|
|
|
|
namespace webrtc {
|
|
namespace rnn_vad {
|
|
|
|
// Ring buffer for N arrays of type T each one with size S.
|
|
template <typename T, size_t S, size_t N>
|
|
class RingBuffer {
|
|
static_assert(S > 0, "");
|
|
static_assert(N > 0, "");
|
|
static_assert(std::is_arithmetic<T>::value,
|
|
"Integral or floating point required.");
|
|
|
|
public:
|
|
RingBuffer() : tail_(0) {}
|
|
RingBuffer(const RingBuffer&) = delete;
|
|
RingBuffer& operator=(const RingBuffer&) = delete;
|
|
~RingBuffer() = default;
|
|
// Set the ring buffer values to zero.
|
|
void Reset() { buffer_.fill(0); }
|
|
// Replace the least recently pushed array in the buffer with |new_values|.
|
|
void Push(rtc::ArrayView<const T, S> new_values) {
|
|
std::memcpy(buffer_.data() + S * tail_, new_values.data(), S * sizeof(T));
|
|
tail_ += 1;
|
|
if (tail_ == N)
|
|
tail_ = 0;
|
|
}
|
|
// Return an array view onto the array with a given delay. A view on the last
|
|
// and least recently push array is returned when |delay| is 0 and N - 1
|
|
// respectively.
|
|
rtc::ArrayView<const T, S> GetArrayView(size_t delay) const {
|
|
const int delay_int = static_cast<int>(delay);
|
|
RTC_DCHECK_LE(0, delay_int);
|
|
RTC_DCHECK_LT(delay_int, N);
|
|
int offset = tail_ - 1 - delay_int;
|
|
if (offset < 0)
|
|
offset += N;
|
|
return {buffer_.data() + S * offset, S};
|
|
}
|
|
|
|
private:
|
|
int tail_; // Index of the least recently pushed sub-array.
|
|
std::array<T, S * N> buffer_{};
|
|
};
|
|
|
|
} // namespace rnn_vad
|
|
} // namespace webrtc
|
|
|
|
#endif // MODULES_AUDIO_PROCESSING_AGC2_RNN_VAD_RING_BUFFER_H_
|