3b6bb15e86
d9b8fa6098d fix: Fake broadcast address for 127.x.x.x aa649165a57 chore: Add code for future netprof TCP testing 9e5693de5ac chore: add to_string functions for netprof enums 52d915e6a90 cleanup: Heap allocate network profile objects 80fabd4a729 feat: Implement Tox network profiler 05abe083cb6 cleanup: Some random cleanups, mostly related to mem. 5cca24513b8 cleanup: Check that onion IP/Port packing worked. e092ecd1244 cleanup: Use tox memory allocator in some more places. 3cfe41c7587 fix: Avoid `memcpy`-ing structs into onion ping id data. e32ac001938 fix: Add more information on why the frame was not sent. ab887003687 fix: Allow TCP connections to fail `connect` calls. 7603170e663 refactor: Use tox memory in group connection allocations. 5bd8a85eb89 cleanup: Align internal logger with external on type of source line. e9bf524d9e1 cleanup: Add missing `#include` to sort_test.cc. d10c966b998 feat: Add `to_string` functions for toxencryptsave errors. 7bfd0dc8003 docs: Update the docs for group join functions 380dde9f2ae test: Add more logging to TCP connection constructor. 0f12f384c8c cleanup: Reduce stack frame sizes to below 4096 bytes. bc43cec0626 chore: Happy new year! fbe78f1702e cleanup: Add a `TOX_HIDE_DEPRECATED` check to hide deprecated symbols. 44d9da07e77 refactor: Use tox memory for group moderation/pack allocations. 7f26d520168 refactor: Use tox memory in group chats allocations. 2f62f3d0e77 refactor: Use tox Memory for group allocations. 8a968162041 chore: Add dispatch/events headers to bazel export. 2bbfb35abf6 docs: Output the error code string instead of int. in toxav logging d55d0e4eaef cleanup: Remove redundant code for checking if group exists 2a6dc643338 chore: Upgrade dependencies for websockify. fc0650601c1 fix: Allow peers to reconnect to group chats using a password git-subtree-dir: external/toxcore/c-toxcore git-subtree-split: d9b8fa6098de6c074038b6664d2572627540b148
117 lines
2.1 KiB
C
117 lines
2.1 KiB
C
/* SPDX-License-Identifier: GPL-3.0-or-later
|
|
* Copyright © 2016-2025 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;
|
|
}
|