2015-11-19 13:08:04 -04:00
|
|
|
/****************************************************************************
|
|
|
|
*
|
2015-12-06 07:55:11 -04:00
|
|
|
* Copyright (C) 2015 PX4 Development Team. All rights reserved.
|
2015-11-19 13:08:04 -04:00
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
*
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in
|
|
|
|
* the documentation and/or other materials provided with the
|
|
|
|
* distribution.
|
|
|
|
* 3. Neither the name PX4 nor the names of its contributors may be
|
|
|
|
* used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
|
|
|
|
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
|
|
|
|
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
|
|
|
|
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
|
|
|
|
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
|
|
|
|
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
|
|
|
|
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @file RingBuffer.h
|
|
|
|
* @author Roman Bapst <bapstroman@gmail.com>
|
|
|
|
* Template RingBuffer.
|
|
|
|
*/
|
|
|
|
|
2016-01-19 02:19:10 -04:00
|
|
|
#define __STDC_FORMAT_MACROS
|
|
|
|
#include <inttypes.h>
|
2015-12-06 07:55:11 -04:00
|
|
|
#include <cstdio>
|
|
|
|
#include <cstring>
|
|
|
|
|
2015-11-19 13:08:04 -04:00
|
|
|
template <typename data_type>
|
|
|
|
class RingBuffer
|
|
|
|
{
|
|
|
|
public:
|
2015-12-06 07:55:11 -04:00
|
|
|
RingBuffer()
|
|
|
|
{
|
|
|
|
_buffer = NULL;
|
|
|
|
_head = _tail = _size = 0;
|
2015-12-07 17:40:20 -04:00
|
|
|
_first_write = true;
|
2015-12-06 07:55:11 -04:00
|
|
|
}
|
2016-01-31 03:48:41 -04:00
|
|
|
~RingBuffer() { delete[] _buffer; }
|
2015-11-19 13:08:04 -04:00
|
|
|
|
2015-12-06 07:55:11 -04:00
|
|
|
bool allocate(int size)
|
2015-11-19 13:08:04 -04:00
|
|
|
{
|
2015-12-06 07:55:11 -04:00
|
|
|
if (size <= 0) {
|
2015-11-19 13:08:04 -04:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2015-12-06 07:55:11 -04:00
|
|
|
if (_buffer != NULL) {
|
2016-01-31 03:48:41 -04:00
|
|
|
delete[] _buffer;
|
2015-12-06 07:55:11 -04:00
|
|
|
}
|
|
|
|
|
2015-11-19 13:08:04 -04:00
|
|
|
_buffer = new data_type[size];
|
|
|
|
|
|
|
|
if (_buffer == NULL) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
_size = size;
|
2016-04-05 22:53:14 -03:00
|
|
|
// set the time elements to zero so that bad data is not retrieved from the buffers
|
|
|
|
for (unsigned index=0; index < _size; index++) {
|
|
|
|
_buffer[index].time_us = 0;
|
|
|
|
}
|
2015-12-07 17:40:20 -04:00
|
|
|
_first_write = true;
|
2015-11-19 13:08:04 -04:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2016-01-31 03:48:41 -04:00
|
|
|
void unallocate()
|
|
|
|
{
|
|
|
|
if (_buffer != NULL) {
|
|
|
|
delete[] _buffer;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-02-13 07:31:02 -04:00
|
|
|
inline void push(data_type sample)
|
2015-11-19 13:08:04 -04:00
|
|
|
{
|
2015-12-07 17:40:20 -04:00
|
|
|
int head_new = _head;
|
|
|
|
|
|
|
|
if (_first_write) {
|
|
|
|
head_new = _head;
|
|
|
|
|
|
|
|
} else {
|
|
|
|
head_new = (_head + 1) % _size;
|
|
|
|
}
|
|
|
|
|
2015-12-06 07:55:11 -04:00
|
|
|
_buffer[head_new] = sample;
|
|
|
|
_head = head_new;
|
2015-11-19 13:08:04 -04:00
|
|
|
|
|
|
|
// move tail if we overwrite it
|
2015-12-07 17:40:20 -04:00
|
|
|
if (_head == _tail && !_first_write) {
|
2015-11-19 13:08:04 -04:00
|
|
|
_tail = (_tail + 1) % _size;
|
2015-12-07 17:40:20 -04:00
|
|
|
|
|
|
|
} else {
|
|
|
|
_first_write = false;
|
2015-11-19 13:08:04 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
inline data_type get_oldest()
|
|
|
|
{
|
|
|
|
return _buffer[_tail];
|
|
|
|
}
|
|
|
|
|
2015-12-06 07:55:11 -04:00
|
|
|
inline data_type get_newest()
|
|
|
|
{
|
|
|
|
return _buffer[_head];
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool pop_first_older_than(uint64_t timestamp, data_type *sample)
|
2015-11-19 13:08:04 -04:00
|
|
|
{
|
2015-12-06 07:55:11 -04:00
|
|
|
// start looking from newest observation data
|
2015-11-19 13:08:04 -04:00
|
|
|
for (unsigned i = 0; i < _size; i++) {
|
2015-12-06 07:55:11 -04:00
|
|
|
int index = (_head - i);
|
|
|
|
index = index < 0 ? _size + index : index;
|
|
|
|
|
|
|
|
if (timestamp >= _buffer[index].time_us && timestamp - _buffer[index].time_us < 100000) {
|
|
|
|
|
2015-12-21 06:26:50 -04:00
|
|
|
// TODO Re-evaluate the static cast and usage patterns
|
2016-01-31 04:01:44 -04:00
|
|
|
memcpy(static_cast<void *>(sample), static_cast<void *>(&_buffer[index]), sizeof(*sample));
|
2015-12-06 07:55:11 -04:00
|
|
|
|
|
|
|
// Now we can set the tail to the item which comes after the one we removed
|
|
|
|
// since we don't want to have any older data in the buffer
|
2015-12-21 06:26:50 -04:00
|
|
|
if (index == static_cast<int>(_head)) {
|
2015-12-06 07:55:11 -04:00
|
|
|
_tail = _head;
|
2015-12-07 17:40:20 -04:00
|
|
|
_first_write = true;
|
2015-12-06 07:55:11 -04:00
|
|
|
|
|
|
|
} else {
|
|
|
|
_tail = (index + 1) % _size;
|
|
|
|
}
|
|
|
|
|
|
|
|
_buffer[index].time_us = 0;
|
2015-11-19 13:08:04 -04:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2015-12-21 06:26:50 -04:00
|
|
|
if (index == static_cast<int>(_tail)) {
|
2015-12-06 07:55:11 -04:00
|
|
|
// we have reached the tail and haven't got a match
|
2015-11-19 13:08:04 -04:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
data_type &operator[](unsigned index)
|
|
|
|
{
|
|
|
|
return _buffer[index];
|
|
|
|
}
|
|
|
|
|
2016-04-21 19:21:36 -03:00
|
|
|
// return data at the specified index
|
2016-05-19 20:23:48 -03:00
|
|
|
inline data_type get_from_index(unsigned index)
|
2016-04-21 19:21:36 -03:00
|
|
|
{
|
|
|
|
if (index >= _size) {
|
|
|
|
index = _size-1;
|
|
|
|
}
|
|
|
|
return _buffer[index];
|
|
|
|
}
|
|
|
|
|
|
|
|
// push data to the specified index
|
2016-05-19 20:23:48 -03:00
|
|
|
inline void push_to_index(unsigned index, data_type sample)
|
2016-04-21 19:21:36 -03:00
|
|
|
{
|
|
|
|
if (index >= _size) {
|
|
|
|
index = _size-1;
|
|
|
|
}
|
|
|
|
_buffer[index] = sample;
|
|
|
|
}
|
|
|
|
|
|
|
|
// return the length of the buffer
|
|
|
|
unsigned get_length()
|
|
|
|
{
|
|
|
|
return _size;
|
|
|
|
}
|
|
|
|
|
2015-11-19 13:08:04 -04:00
|
|
|
private:
|
|
|
|
data_type *_buffer;
|
|
|
|
unsigned _head, _tail, _size;
|
2015-12-07 17:40:20 -04:00
|
|
|
bool _first_write;
|
2015-12-06 07:55:11 -04:00
|
|
|
|
|
|
|
// debug
|
|
|
|
uint64_t _time_last;
|
|
|
|
};
|