forked from Green-Sky/tomato
Green Sky
8eb4892b49
6d634674a9 cleanup: Remove old type-ordered event getters. d1d48d1dfc feat: add ngc events 994ffecc6b refactor: Make event dispatch ordered by receive time. 812f931d5f fix: Make sure there's enough space for CONSUME1 in fuzzers. 50f1b30fa9 test: Add fuzz tests to the coverage run. df76f5cf47 chore: Move from gcov to llvm source-based coverage. 072e3beb3f fix: issues with packet broadcast error reporting 6b6718e4d2 cleanup: Make group packet entry creation less error-prone 5b9c420ce1 refactor: packet broadcast functions now return errors af4cb31028 refactor: Use `operator==` for equality tests of `Node_format`. 9592d590cf refactor(test): Slightly nicer C++ interface to tox Random. c66e10fb7a refactor: Minor refactoring of get_close_nodes functions. ebc9643862 fix: don't pass garbage data buffer to packet send functions 32b68cffca cleanup: Some more test cleanups, removing overly smart code. 0426624dcb refactor: Assign malloc return to a local variable first. afc38f2458 test: Add more unit tests for `add_to_list`. 05ce5c1ab9 test: Add "infer" CI check to github, remove from circle. REVERT: 8f0d505f9a feat: add ngc events REVERT: 9b8216e70c refactor: Make event dispatch ordered by receive time. git-subtree-dir: external/toxcore/c-toxcore git-subtree-split: 6d634674a929edb0ab70689dcbcb195b3547be13
117 lines
2.1 KiB
C
117 lines
2.1 KiB
C
/* SPDX-License-Identifier: GPL-3.0-or-later
|
|
* Copyright © 2016-2018 The TokTok team.
|
|
* Copyright © 2013 Tox project.
|
|
* Copyright © 2013 plutooo
|
|
*/
|
|
#include "ring_buffer.h"
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include "../toxcore/ccompat.h"
|
|
|
|
struct RingBuffer {
|
|
uint16_t size; /* Max size */
|
|
uint16_t start;
|
|
uint16_t end;
|
|
void **data;
|
|
};
|
|
|
|
bool rb_full(const RingBuffer *b)
|
|
{
|
|
return (b->end + 1) % b->size == b->start;
|
|
}
|
|
|
|
bool rb_empty(const RingBuffer *b)
|
|
{
|
|
return b->end == b->start;
|
|
}
|
|
|
|
/**
|
|
* @retval NULL on success
|
|
* @return input value "p" on failure, so caller can free on failed rb_write
|
|
*/
|
|
void *rb_write(RingBuffer *b, void *p)
|
|
{
|
|
if (b == nullptr) {
|
|
return p;
|
|
}
|
|
|
|
void *rc = nullptr;
|
|
|
|
if ((b->end + 1) % b->size == b->start) { /* full */
|
|
rc = b->data[b->start];
|
|
}
|
|
|
|
b->data[b->end] = p;
|
|
b->end = (b->end + 1) % b->size;
|
|
|
|
if (b->end == b->start) {
|
|
b->start = (b->start + 1) % b->size;
|
|
}
|
|
|
|
return rc;
|
|
}
|
|
|
|
bool rb_read(RingBuffer *b, void **p)
|
|
{
|
|
if (b->end == b->start) { /* Empty */
|
|
*p = nullptr;
|
|
return false;
|
|
}
|
|
|
|
*p = b->data[b->start];
|
|
b->start = (b->start + 1) % b->size;
|
|
return true;
|
|
}
|
|
|
|
RingBuffer *rb_new(int size)
|
|
{
|
|
RingBuffer *buf = (RingBuffer *)calloc(1, sizeof(RingBuffer));
|
|
|
|
if (buf == nullptr) {
|
|
return nullptr;
|
|
}
|
|
|
|
buf->size = size + 1; /* include empty elem */
|
|
buf->data = (void **)calloc(buf->size, sizeof(void *));
|
|
|
|
if (buf->data == nullptr) {
|
|
free(buf);
|
|
return nullptr;
|
|
}
|
|
|
|
return buf;
|
|
}
|
|
|
|
void rb_kill(RingBuffer *b)
|
|
{
|
|
if (b != nullptr) {
|
|
free(b->data);
|
|
free(b);
|
|
}
|
|
}
|
|
|
|
uint16_t rb_size(const RingBuffer *b)
|
|
{
|
|
if (rb_empty(b)) {
|
|
return 0;
|
|
}
|
|
|
|
return
|
|
b->end > b->start ?
|
|
b->end - b->start :
|
|
(b->size - b->start) + b->end;
|
|
}
|
|
|
|
uint16_t rb_data(const RingBuffer *b, void **dest)
|
|
{
|
|
uint16_t i;
|
|
const uint16_t size = rb_size(b);
|
|
|
|
for (i = 0; i < size; ++i) {
|
|
dest[i] = b->data[(b->start + i) % b->size];
|
|
}
|
|
|
|
return i;
|
|
}
|