Circular Buffer C implementation, must create a buffer structure instance in your main and then dinamically allocate memory for the buffer array.
circularBuff.cpp
- Committer:
- ivaariasga
- Date:
- 2019-05-17
- Revision:
- 0:f6f6750994d2
File content as of revision 0:f6f6750994d2:
#include "circularBuff.h" int circ_buf_rst(circ_buf_t * cbuf) { int r = -1; if(cbuf) { cbuf->head = 0; cbuf->tail = 0; r = 0; } return r; } bool circ_buf_empty(circ_buf_t cbuf) { // We define empty as head == tail return (cbuf.head == cbuf.tail); } bool circ_buf_full(circ_buf_t cbuf) { // We determine "full" case by head being one position behind the tail // Note that this means we are wasting one space in the buffer! // Instead, you could have an "empty" flag and determine buffer full that way return ((cbuf.head + 1) % cbuf.size) == cbuf.tail; } int circ_buf_put(circ_buf_t * cbuf, uint8_t data) { int r = -1; if(cbuf) { cbuf->buffer[cbuf->head] = data; cbuf->head = (cbuf->head + 1) % cbuf->size; if(cbuf->head == cbuf->tail) { cbuf->tail = (cbuf->tail + 1) % cbuf->size; } r = 0; } return r; } int circ_buf_get(circ_buf_t * cbuf, uint8_t * data) { int r = -1; if(cbuf && data && !circ_buf_empty(*cbuf)) { *data = cbuf->buffer[cbuf->tail]; cbuf->tail = (cbuf->tail + 1) % cbuf->size; r = 0; } return r; }