ck_ring_enqueue_spsc_size(3) enqueue pointer into bounded FIFO and return size of buffer


Concurrency Kit (libck, -lck)


In ck_ring.h Ft bool Fn ck_ring_enqueue_spsc_size ck_ring_t *ring ck_ring_buffer_t *buffer void *entry unsigned int *size


The Fn ck_ring_enqueue_spsc_size 3 function enqueues the pointer Fa entry into the bounded buffer pointed to by Fa ring in FIFO fashion. The buffer pointed to by Fa buffer must be unique to Fa ring and point to an array of ck_ring_buffer_t of sufficient length (according to the power-of-2 elements in the buffer). The decoupling of the ring from the buffer serves to address use-cases involving multiple address spaces and DMA, among others. If you are on non-POSIX platforms or wish for strict compliance with C, then it is recommended to pass a pointer of type void ** for Fa entry . This function is safe to call without locking for up to one concurrent invocation of Fn ck_ring_dequeue_spsc 3 . This function provides wait-free progress guarantees.


#include <ck_ring.h>
/* This ring was previously initialized with ck_ring_init. */
ck_ring_t ring;
/* The ring was initialized for 1023 elements. */
ck_ring_buffer_t buffer[1024];
        void *entry = some_object;
        unsigned int length;
        /* Attempt to enqueue pointer to some_object into buffer. */
        if (ck_ring_enqueue_spsc(&ring, &buffer, &entry, &length) == false) {
                 * The buffer was full and the enqueue operation
                 * has failed.
         * If buffer length was 100 items or more at the time entry was
         * enqueued, do something.
        if (length > 100) {


The function returns true if the value of Fa entry was successfully enqueued into Fa ring . This function will return the number of items in Fa ring with respect to the linearization point (the point in item that Fa entry is enqueued). The function will return false if the value of Fa entry could not be enqueued which only occurs if Fa ring was full.