Man page - ck_ring_dequeue_spsc(3)
Packages contains this manual
- ck_pr_fence_load_atomic(3)
- ck_bitmap_reset(3)
- ck_pr_fas(3)
- ck_pr_bts(3)
- ck_brlock(3)
- ck_array_remove(3)
- ck_hs_init(3)
- ck_pr_xor(3)
- ck_pr_rtm(3)
- ck_epoch_begin(3)
- ck_hs_grow(3)
- ck_bitmap_next(3)
- ck_pr_stall(3)
- ck_hs_destroy(3)
- ck_pr_faa(3)
- ck_pr_btc(3)
- ck_ring_init(3)
- ck_epoch_register(3)
- ck_ht_remove_spmc(3)
- ck_ht_stat(3)
- ck_rhs_iterator_init(3)
- ck_hs_gc(3)
- ck_ring_enqueue_spsc_size(3)
- ck_pr_neg(3)
- ck_rhs_reset(3)
- ck_ht_count(3)
- ck_bitmap_iterator_init(3)
- ck_hs_set(3)
- ck_rwcohort(3)
- ck_ht_destroy(3)
- ck_array_initialized(3)
- ck_rhs_remove(3)
- ck_hs_reset_size(3)
- ck_bitmap_test(3)
- ck_bitmap_set(3)
- ck_sequence(3)
- ck_pr_cas(3)
- ck_ring_size(3)
- ck_pr_store(3)
- ck_hs_rebuild(3)
- ck_pr_fence_release(3)
- ck_ht_entry_key_set_direct(3)
- ck_epoch_reclaim(3)
- ck_pr_add(3)
- ck_hs_put(3)
- ck_array_length(3)
- ck_array_buffer(3)
- ck_bitmap_init(3)
- ck_bitmap_base(3)
- ck_ring_enqueue_spmc_size(3)
- ck_rhs_next(3)
- ck_bitmap_size(3)
- ck_ht_entry_empty(3)
- ck_hs_fas(3)
- ck_pr_fence_store_load(3)
- ck_hs_next(3)
- ck_rhs_grow(3)
- ck_bitmap_clear(3)
- ck_pr_and(3)
- ck_queue(3)
- ck_ht_entry_key_length(3)
- ck_rhs_count(3)
- ck_bitmap_buffer(3)
- ck_ht_entry_key_set(3)
- ck_ht_get_spmc(3)
- ck_pr_fence_atomic_store(3)
- ck_ring_capacity(3)
- ck_ht_set_spmc(3)
- ck_pr_fence_load_depends(3)
- ck_ht_grow_spmc(3)
- ck_pr_fence_acquire(3)
- ck_ht_entry_value(3)
- ck_ht_reset_size_spmc(3)
- ck_bitmap_bits(3)
- ck_rhs_fas(3)
- ck_pr_fence_store_atomic(3)
- ck_ht_hash_direct(3)
- ck_pr_fence_memory(3)
- ck_swlock(3)
- ck_pr(3)
- ck_hs_get(3)
- ck_ht_entry_key(3)
- ck_rhs_rebuild(3)
- ck_array_init(3)
- ck_rhs_gc(3)
- ck_pflock(3)
- ck_ht_entry_set_direct(3)
- ck_ht_entry_value_direct(3)
- ck_epoch_poll(3)
- ck_pr_fence_load(3)
- ck_hs_move(3)
- ck_rhs_set(3)
- ck_epoch_barrier(3)
- ck_rhs_put_unique(3)
- ck_tflock(3)
- ck_pr_fence_atomic_load(3)
- ck_ht_hash(3)
- ck_ring_trydequeue_spmc(3)
- ck_epoch_unregister(3)
- ck_rhs_reset_size(3)
- ck_ht_init(3)
- ck_ht_gc(3)
- ck_rhs_get(3)
- ck_ring_enqueue_spsc(3)
- ck_pr_load(3)
- ck_epoch_synchronize(3)
- ck_pr_or(3)
- ck_pr_sub(3)
- ck_bitmap_union(3)
- ck_cohort(3)
- ck_rhs_move(3)
- ck_hs_reset(3)
- ck_ring_dequeue_spmc(3)
- ck_ht_entry_key_direct(3)
- ck_hs_apply(3)
- ck_pr_dec(3)
- ck_bitmap_bts(3)
- ck_ring_dequeue_spsc(3)
- ck_pr_fence_load_store(3)
- ck_pr_fence_store(3)
- ck_epoch_end(3)
- ck_rhs_put(3)
- ck_rwlock(3)
- ck_rhs_destroy(3)
- ck_pr_inc(3)
- ck_rhs_stat(3)
- ck_hs_iterator_init(3)
- ck_ring_enqueue_spmc(3)
- ck_ht_reset_spmc(3)
- ck_pr_barrier(3)
- ck_epoch_call(3)
- ck_ht_put_spmc(3)
- ck_rhs_apply(3)
- ck_array_commit(3)
- ck_hs_remove(3)
- ck_array_put_unique(3)
- ck_array_deinit(3)
- ck_array_put(3)
- ck_spinlock(3)
- ck_rhs_init(3)
- ck_hs_count(3)
- ck_hs_stat(3)
- ck_pr_btr(3)
- ck_ht_entry_set(3)
- ck_epoch_recycle(3)
- ck_hs_put_unique(3)
- ck_epoch_init(3)
- ck_ht_iterator_init(3)
- ck_pr_fence_atomic(3)
- ck_elide(3)
- ck_pr_not(3)
- ck_ht_next(3)
apt-get install libck-dev
Manual
NAME
ck_ring_dequeue_spsc — dequeue pointer from bounded FIFO
LIBRARY
Concurrency Kit (libck, -lck)
SYNOPSIS
#include <ck_ring.h>
bool
ck_ring_dequeue_spsc ( ck_ring_t *ring , ck_ring_buffer_t *buffer , void *result );
DESCRIPTION
The ck_ring_dequeue_spsc ( 3 ) function dequeues a pointer from the bounded buffer pointed to by ring in FIFO fashion. The pointer is stored in the pointer pointed to by result . The buffer pointed to by buffer must be unique to 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 result . This function is safe to call without locking for one concurrent invocation of ck_ring_dequeue_spsc ( 3 ) and up to one concurrent ck_ring_enqueue_spsc ( 3 ) invocation. This function provides wait-free progress guarantees.
EXAMPLE
#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
dequeue(void)
{
|
void *result; |
|||
|
/* Dequeue from ring until it is empty. */ |
|||
|
while (ck_ring_dequeue_spsc(&ring, &buffer, &result) == true) { |
|||
|
/* |
|||
|
* Results contains the oldest pointer in ring |
|||
|
* since the dequeue operation returned true. |
|||
|
*/ |
|||
|
operation(result); |
|||
|
} |
|||
|
/* An empty ring was encountered, leave. */ |
|||
|
return; |
}
RETURN VALUES
The function returns true if the buffer was non-empty. The result of the dequeue operation is stored in the value pointed to by result . The function will return false if the buffer was empty and the value in result will be undefined.
SEE ALSO
ck_ring_init (3), ck_ring_trydequeue_spmc (3), ck_ring_enqueue_spmc (3), ck_ring_enqueue_spmc_size (3), ck_ring_dequeue_spmc (3), ck_ring_enqueue_spsc (3), ck_ring_enqueue_spsc_size (3), ck_ring_capacity (3), ck_ring_size (3)
Additional information available at http://concurrencykit.org/ April 20, 2013 CK_RING_DEQUEUE_SPSC (3)