Man page - ck_pr_fence_load(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_pr_fence_load — enforce partial ordering of load operations
LIBRARY
Concurrency Kit (libck, -lck)
SYNOPSIS
#include <ck_pr.h>
void
ck_pr_fence_load ( void );
void
ck_pr_fence_strict_load ( void );
DESCRIPTION
This function enforces the ordering of any memory load and ck_pr_load ( 3 ) operations relative to the invocation of the function. Any store operations that were committed on remote processors and received by the calling processor before the invocation of ck_pr_fence_load () is also be made visible only after a call to ck_pr_fence_load (). This function always serves as an implicit compiler barrier. On architectures with CK_MD_TSO or CK_MD_PSO specified (total store ordering and partial store ordering respectively), this operation only serves as a compiler barrier and no fence instructions will be emitted. To force the unconditional emission of a load fence, use ck_pr_fence_strict_load (). Architectures implementing CK_MD_RMO always emit a load fence.
EXAMPLE
#include <ck_pr.h>
static unsigned
int a;
static unsigned int b;
void
function(void)
{
|
unsigned int snapshot_a, snapshot_b; |
||
|
snapshot_a = ck_pr_load_uint(&a); |
||
|
/* |
||
|
* Guarantee that the load from "a" completes |
||
|
* before the load from "b". |
||
|
*/ |
||
|
ck_pr_fence_load(); |
||
|
snapshot_b = ck_pr_load_uint(&b); |
||
|
return; |
}
RETURN VALUES
This function has no return value.
SEE ALSO
ck_pr_stall (3), ck_pr_fence_atomic (3), ck_pr_fence_atomic_store (3), ck_pr_fence_atomic_load (3), ck_pr_fence_load_atomic (3), ck_pr_fence_load_store (3), ck_pr_fence_load_depends (3), ck_pr_fence_store (3), ck_pr_fence_memory (3), ck_pr_barrier (3), ck_pr_fas (3), ck_pr_load (3), ck_pr_store (3), ck_pr_faa (3), ck_pr_inc (3), ck_pr_dec (3), ck_pr_neg (3), ck_pr_not (3), ck_pr_add (3), ck_pr_sub (3), ck_pr_and (3), ck_pr_or (3), ck_pr_xor (3), ck_pr_cas (3), ck_pr_btc (3), ck_pr_bts (3), ck_pr_btr (3)
Additional information available at http://concurrencykit.org/ April 7, 2013 ck_pr_fence_load (3)