Man page - ck_sequence(3)
Packages contas this manual
- ck_hs_fas(3)
- ck_pr_fence_store_atomic(3)
- ck_ht_entry_key(3)
- ck_bitmap_size(3)
- ck_ht_stat(3)
- ck_pr_xor(3)
- ck_ht_init(3)
- ck_ht_gc(3)
- ck_ring_enqueue_spsc_size(3)
- ck_ht_destroy(3)
- ck_ht_entry_key_set_direct(3)
- ck_pr_add(3)
- ck_pr_load(3)
- ck_ht_entry_set(3)
- ck_ring_capacity(3)
- ck_rhs_put_unique(3)
- ck_epoch_register(3)
- ck_pr_fence_memory(3)
- ck_ht_put_spmc(3)
- ck_bitmap_bts(3)
- ck_rhs_next(3)
- ck_hs_grow(3)
- ck_pr_fence_load_atomic(3)
- ck_pr_fence_atomic_store(3)
- ck_array_buffer(3)
- ck_rhs_gc(3)
- ck_bitmap_clear(3)
- ck_pr_fence_atomic_load(3)
- ck_bitmap_buffer(3)
- ck_ht_next(3)
- ck_bitmap_init(3)
- ck_rhs_count(3)
- ck_epoch_recycle(3)
- ck_hs_iterator_init(3)
- ck_pr_bts(3)
- ck_ring_enqueue_spmc_size(3)
- ck_hs_gc(3)
- ck_ring_dequeue_spmc(3)
- ck_ht_entry_key_set(3)
- ck_ht_reset_spmc(3)
- ck_pr_sub(3)
- ck_ht_entry_value_direct(3)
- ck_ht_reset_size_spmc(3)
- ck_bitmap_reset(3)
- ck_ht_entry_empty(3)
- ck_rhs_stat(3)
- ck_epoch_synchronize(3)
- ck_tflock(3)
- ck_rwlock(3)
- ck_bitmap_union(3)
- ck_rhs_rebuild(3)
- ck_ht_remove_spmc(3)
- ck_pr_inc(3)
- ck_pr_fence_store_load(3)
- ck_rhs_apply(3)
- ck_sequence(3)
- ck_rhs_init(3)
- ck_rhs_remove(3)
- ck_pflock(3)
- ck_epoch_poll(3)
- ck_hs_set(3)
- ck_pr_fence_acquire(3)
- ck_pr_fas(3)
- ck_bitmap_test(3)
- ck_pr_store(3)
- ck_hs_stat(3)
- ck_ring_size(3)
- ck_pr_fence_atomic(3)
- ck_ht_get_spmc(3)
- ck_array_length(3)
- ck_ht_entry_value(3)
- ck_hs_rebuild(3)
- ck_array_put(3)
- ck_array_remove(3)
- ck_ring_init(3)
- ck_ht_entry_key_direct(3)
- ck_hs_get(3)
- ck_pr_btc(3)
- ck_rhs_put(3)
- ck_bitmap_base(3)
- ck_pr_fence_release(3)
- ck_bitmap_bits(3)
- ck_array_deinit(3)
- ck_ht_hash_direct(3)
- ck_hs_remove(3)
- ck_rhs_get(3)
- ck_hs_move(3)
- ck_pr_neg(3)
- ck_hs_put(3)
- ck_pr_btr(3)
- ck_epoch_reclaim(3)
- ck_epoch_begin(3)
- ck_bitmap_set(3)
- ck_hs_next(3)
- ck_epoch_end(3)
- ck_rhs_set(3)
- ck_ring_dequeue_spsc(3)
- ck_cohort(3)
- ck_ring_enqueue_spsc(3)
- ck_ht_set_spmc(3)
- ck_pr_faa(3)
- ck_pr_and(3)
- ck_hs_reset(3)
- ck_hs_reset_size(3)
- ck_pr_cas(3)
- ck_ht_grow_spmc(3)
- ck_array_initialized(3)
- ck_pr_fence_load_depends(3)
- ck_pr_not(3)
- ck_ht_entry_key_length(3)
- ck_spinlock(3)
- ck_rhs_grow(3)
- ck_elide(3)
- ck_hs_destroy(3)
- ck_hs_apply(3)
- ck_epoch_init(3)
- ck_pr_rtm(3)
- ck_epoch_barrier(3)
- ck_ring_enqueue_spmc(3)
- ck_bitmap_next(3)
- ck_ht_iterator_init(3)
- ck_rhs_destroy(3)
- ck_ht_entry_set_direct(3)
- ck_ring_trydequeue_spmc(3)
- ck_ht_count(3)
- ck_hs_init(3)
- ck_pr_barrier(3)
- ck_queue(3)
- ck_pr_stall(3)
- ck_swlock(3)
- ck_rhs_fas(3)
- ck_rhs_reset_size(3)
- ck_epoch_call(3)
- ck_pr(3)
- ck_epoch_unregister(3)
- ck_array_put_unique(3)
- ck_bitmap_iterator_init(3)
- ck_rhs_move(3)
- ck_pr_fence_load_store(3)
- ck_array_commit(3)
- ck_rhs_reset(3)
- ck_pr_fence_load(3)
- ck_hs_count(3)
- ck_hs_put_unique(3)
- ck_ht_hash(3)
- ck_array_init(3)
- ck_rhs_iterator_init(3)
- ck_pr_or(3)
- ck_rwcohort(3)
- ck_pr_dec(3)
- ck_pr_fence_store(3)
- ck_brlock(3)
apt-get install libck-dev
Manual
| ck_sequence(3) | Library Functions Manual | ck_sequence(3) |
NAME
ck_sequence_init,
ck_sequence_read_begin,
ck_sequence_read_retry,
ck_sequence_write_begin,
ck_sequence_write_end —
sequence locks
LIBRARY
Concurrency Kit (libck, -lck)
SYNOPSIS
#include
<ck_sequence.h>
ck_sequence_t seqlock =
CK_SEQUENCE_INITIALIZER;
void
ck_sequence_init(ck_sequence_t
*sq);
unsigned int
ck_sequence_read_begin(const
ck_sequence_t *sq);
bool
ck_sequence_read_retry(const
ck_sequence_t *sq,
unsigned int
version);
void
ck_sequence_write_begin(ck_sequence_t
*sq);
void
ck_sequence_write_end(ck_sequence_t
*sq);
DESCRIPTION
It is recommended to use ck_sequence when a small amount of data
that cannot be accessed atomically has to be synchronized with readers in a
fashion that does not block any writer. Readers are able to execute their
read-side critical sections without any atomic operations. A ck_sequence_t
must be initialized before use. It may be initialized using either a static
initializer (CK_SEQUENCE_INITIALIZER) or using
ck_sequence_init().
Before readers attempt to read data that may be concurrently modified they
must first save the return value of
ck_sequence_read_begin().
While or after a reader has completed copying the data associated with a
ck_sequence_t it must pass the earlier return value of
ck_sequence_read_begin() to
ck_sequence_read_retry().
If ck_sequence_read_retry() returns true then the
copy of data may be inconsistent and the read process must be retried.
Writers must rely on their own synchronization primitives. Once a writer has
entered its respective critical section, it must call
ck_sequence_write_begin()
to signal intent to update the data protected by the ck_sequence_t. Before
the writer leaves its critical section it must execute
ck_sequence_write_end()
to indicate that the updates have left respective objects in a consistent
state.
EXAMPLE
#include <ck_sequence.h>
#include <stdlib.h>
static struct example {
int a;
int b;
int c;
} global;
static ck_sequence_t seqlock = CK_SEQUENCE_INITIALIZER;
void
reader(void)
{
struct example copy;
unsigned int version;
/*
* Attempt a read of the data structure. If the structure
* has been modified between ck_sequence_read_begin and
* ck_sequence_read_retry then attempt another read since
* the data may be in an inconsistent state.
*/
do {
version = ck_sequence_read_begin(&seqlock);
copy = global;
} while (ck_sequence_read_retry(&seqlock, version));
/*
* The previous may also be expressed using CK_SEQUENCE_READ.
* Generally recommend to only use ck_sequence_read_retry
* if you would like to detect a conflicting write at some
* higher granularity.
*/
CK_SEQUENCE_READ(&seqlock, &version) {
copy = global;
}
return;
}
void
writer(void)
{
for (;;) {
ck_sequence_write_begin(&seqlock);
global.a = rand();
global.b = global.a + global.b;
global.c = global.b + global.c;
ck_sequence_write_end(&seqlock);
}
return;
}
SEE ALSO
ck_brlock(3), ck_bytelock(3), ck_rwlock(3)
Additional information available at http://concurrencykit.org/
| July 26, 2013. |