libqb
0.16.0
|
This implements a ring buffer that works in "chunks" not bytes. More...
#include <sys/types.h>
#include <stdint.h>
Macros | |
#define | QB_RB_FLAG_CREATE 0x01 |
create a ring buffer (rather than open and existing one) | |
#define | QB_RB_FLAG_OVERWRITE 0x02 |
New calls to qb_rb_chunk_write() will call qb_rb_chunk_reclaim() if there is not enough space. | |
#define | QB_RB_FLAG_SHARED_THREAD 0x04 |
The ringbuffer will be shared between pthreads not processes. | |
#define | QB_RB_FLAG_SHARED_PROCESS 0x08 |
The ringbuffer will be shared between processes. | |
#define | QB_RB_FLAG_NO_SEMAPHORE 0x10 |
Don't use semaphores, only atomic ops. | |
Typedefs | |
typedef struct qb_ringbuffer_s | qb_ringbuffer_t |
Functions | |
qb_ringbuffer_t * | qb_rb_open (const char *name, size_t size, uint32_t flags, size_t shared_user_data_size) |
Create the ring buffer with the given type. | |
void | qb_rb_close (qb_ringbuffer_t *rb) |
Dereference the ringbuffer and if we are the last user destroy it. | |
char * | qb_rb_name_get (qb_ringbuffer_t *rb) |
Get the name of the ringbuffer. | |
void * | qb_rb_shared_user_data_get (qb_ringbuffer_t *rb) |
Get a point to user shared data area. | |
ssize_t | qb_rb_chunk_write (qb_ringbuffer_t *rb, const void *data, size_t len) |
Write a chunk to the ring buffer. | |
void * | qb_rb_chunk_alloc (qb_ringbuffer_t *rb, size_t len) |
Allocate space for a chunk of the given size. | |
int32_t | qb_rb_chunk_commit (qb_ringbuffer_t *rb, size_t len) |
finalize the chunk. | |
ssize_t | qb_rb_chunk_peek (qb_ringbuffer_t *rb, void **data_out, int32_t ms_timeout) |
Read (without reclaiming) the last chunk. | |
void | qb_rb_chunk_reclaim (qb_ringbuffer_t *rb) |
Reclaim the oldest chunk. | |
ssize_t | qb_rb_chunk_read (qb_ringbuffer_t *rb, void *data_out, size_t len, int32_t ms_timeout) |
Read the oldest chunk into data_out. | |
int32_t | qb_rb_refcount_get (qb_ringbuffer_t *rb) |
Get the reference count. | |
ssize_t | qb_rb_space_free (qb_ringbuffer_t *rb) |
The amount of free space in the ring buffer. | |
ssize_t | qb_rb_space_used (qb_ringbuffer_t *rb) |
The total amount of data in the buffer. | |
ssize_t | qb_rb_chunks_used (qb_ringbuffer_t *rb) |
The total number of chunks in the buffer. | |
ssize_t | qb_rb_write_to_file (qb_ringbuffer_t *rb, int32_t fd) |
Write the contents of the Ring Buffer to file. | |
qb_ringbuffer_t * | qb_rb_create_from_file (int32_t fd, uint32_t flags) |
Load the saved ring buffer from file into tempory memory. | |
int32_t | qb_rb_chown (qb_ringbuffer_t *rb, uid_t owner, gid_t group) |
Like 'chown' it changes the owner and group of the ringbuffers resources. | |
int32_t | qb_rb_chmod (qb_ringbuffer_t *rb, mode_t mode) |
Like 'chmod' it changes the mode of the ringbuffers resources. | |
This implements a ring buffer that works in "chunks" not bytes.
So you write/read a complete chunk or not at all. There are two types of ring buffer normal and overwrite. Overwrite will reclaim the oldest chunks inorder to make way for new ones, the normal version will refuse to write a new chunk if the ring buffer is full.
This implementation is capable of working across processes, but one process must only write and the other prrocess read.
The read process will do the following:
The write process will do the following:
#define QB_RB_FLAG_CREATE 0x01 |
create a ring buffer (rather than open and existing one)
#define QB_RB_FLAG_NO_SEMAPHORE 0x10 |
Don't use semaphores, only atomic ops.
This mean that the timeout passed into qb_rb_chunk_read() will be ignored.
#define QB_RB_FLAG_OVERWRITE 0x02 |
New calls to qb_rb_chunk_write() will call qb_rb_chunk_reclaim() if there is not enough space.
If this is not set then new writes will be refused.
#define QB_RB_FLAG_SHARED_PROCESS 0x08 |
The ringbuffer will be shared between processes.
This effects the type of locks/semaphores that are used.
#define QB_RB_FLAG_SHARED_THREAD 0x04 |
The ringbuffer will be shared between pthreads not processes.
This effects the type of locks/semaphores that are used.
typedef struct qb_ringbuffer_s qb_ringbuffer_t |
int32_t qb_rb_chmod | ( | qb_ringbuffer_t * | rb, |
mode_t | mode | ||
) |
Like 'chmod' it changes the mode of the ringbuffers resources.
mode | mode to change to |
rb | ringbuffer instance |
0 | == ok |
-errno | for error |
int32_t qb_rb_chown | ( | qb_ringbuffer_t * | rb, |
uid_t | owner, | ||
gid_t | group | ||
) |
Like 'chown' it changes the owner and group of the ringbuffers resources.
owner | uid of the owner to change to |
group | gid of the group to change to |
rb | ringbuffer instance |
void* qb_rb_chunk_alloc | ( | qb_ringbuffer_t * | rb, |
size_t | len | ||
) |
Allocate space for a chunk of the given size.
If type == QB_RB_FLAG_OVERWRITE then this will always return non-null but if it's type is QB_RB_NORMAL then when there is not enough space then it will return NULL.
rb | ringbuffer instance |
len | (in) the size to allocate. |
int32_t qb_rb_chunk_commit | ( | qb_ringbuffer_t * | rb, |
size_t | len | ||
) |
finalize the chunk.
rb | ringbuffer instance |
len | (in) the size of the chunk. |
ssize_t qb_rb_chunk_peek | ( | qb_ringbuffer_t * | rb, |
void ** | data_out, | ||
int32_t | ms_timeout | ||
) |
Read (without reclaiming) the last chunk.
This function is a way of accessing the next chunk without a memcpy(). You can read the chunk data in place.
rb | ringbuffer instance |
data_out | (out) a pointer to the next chunk to read (not copied). |
ms_timeout | (in) time to wait for new data. |
ssize_t qb_rb_chunk_read | ( | qb_ringbuffer_t * | rb, |
void * | data_out, | ||
size_t | len, | ||
int32_t | ms_timeout | ||
) |
Read the oldest chunk into data_out.
This is the same as qb_rb_chunk_peek() memcpy() and qb_rb_chunk_reclaim().
rb | ringbuffer instance |
data_out | (in/out) the chunk will be memcpy'ed into this. |
len | (in) the size of data_out. |
ms_timeout | the amount od time to wait for new data. |
void qb_rb_chunk_reclaim | ( | qb_ringbuffer_t * | rb | ) |
Reclaim the oldest chunk.
You will need to call this if using qb_rb_chunk_peek().
rb | ringbuffer instance |
ssize_t qb_rb_chunk_write | ( | qb_ringbuffer_t * | rb, |
const void * | data, | ||
size_t | len | ||
) |
Write a chunk to the ring buffer.
This simply calls qb_rb_chunk_alloc() and then qb_rb_chunk_commit().
rb | ringbuffer instance |
data | (in) the data to write |
len | (in) the size of the chunk. |
ssize_t qb_rb_chunks_used | ( | qb_ringbuffer_t * | rb | ) |
The total number of chunks in the buffer.
rb | ringbuffer instance |
void qb_rb_close | ( | qb_ringbuffer_t * | rb | ) |
Dereference the ringbuffer and if we are the last user destroy it.
All files, mmaped memory, semaphores and locks will be destroyed.
rb | ringbuffer instance |
qb_ringbuffer_t* qb_rb_create_from_file | ( | int32_t | fd, |
uint32_t | flags | ||
) |
Load the saved ring buffer from file into tempory memory.
fd | file with saved ringbuffer data. |
flags | same flags as passed into qb_rb_open() |
char* qb_rb_name_get | ( | qb_ringbuffer_t * | rb | ) |
Get the name of the ringbuffer.
rb | ringbuffer instance |
qb_ringbuffer_t* qb_rb_open | ( | const char * | name, |
size_t | size, | ||
uint32_t | flags, | ||
size_t | shared_user_data_size | ||
) |
Create the ring buffer with the given type.
This creates allocates a ring buffer in shared memory.
name | the unique name of this ringbuffer. |
size | the requested size. |
flags | or'ed flags |
shared_user_data_size | size for a shared data area. |
int32_t qb_rb_refcount_get | ( | qb_ringbuffer_t * | rb | ) |
Get the reference count.
rb | ringbuffer instance |
void* qb_rb_shared_user_data_get | ( | qb_ringbuffer_t * | rb | ) |
Get a point to user shared data area.
rb | ringbuffer instance |
ssize_t qb_rb_space_free | ( | qb_ringbuffer_t * | rb | ) |
The amount of free space in the ring buffer.
rb | ringbuffer instance |
ssize_t qb_rb_space_used | ( | qb_ringbuffer_t * | rb | ) |
The total amount of data in the buffer.
rb | ringbuffer instance |
ssize_t qb_rb_write_to_file | ( | qb_ringbuffer_t * | rb, |
int32_t | fd | ||
) |
Write the contents of the Ring Buffer to file.
fd | open file to write the ringbuffer data to. |
rb | ringbuffer instance |