Libck-Dev

• ck_array_buffer(3) Concurrency Kit (libck, -lck) The returns a pointer to the array of pointers currently visible to readers after the last
• ck_array_commit(3) Concurrency Kit (libck, -lck) The function will commit any pending put or remove operations associated with the array.
• ck_array_deinit(3) Concurrency Kit (libck, -lck) The destroys the memory associated with the array pointed to by The argument is true if th
• CK_ARRAY_FOREACH(3) Concurrency Kit (libck, -lck) The macro iterates through the array pointed to by A pointer to an iterator object must be
• ck_array_init(3) Concurrency Kit (libck, -lck) The function initializes the array pointed to by the argument The mode value must be The a
• ck_array_initialized(3) Concurrency Kit (libck, -lck) The can be used to determine whether an array was recently initialized with or deinitializ
• ck_array_length(3) Concurrency Kit (libck, -lck) The function returns the number of items a concurrent traversal operation would encounter
• ck_array_put_unique(3) Concurrency Kit (libck, -lck) The function will attempt to insert the value of into the array pointed to by This functio
• ck_array_put(3) Concurrency Kit (libck, -lck) The function will attempt to insert the value of into the array pointed to by This functio
• ck_array_remove(3) Concurrency Kit (libck, -lck) The function will attempt to remove the value of into the array pointed to by the operatio
• ck_bitmap_base(3) Concurrency Kit (libck, -lck) The function returns the number of bytes that would be used to store the number of bits sp
• ck_bitmap_bits(3) Concurrency Kit (libck, -lck) The function returns the maximum number of addressable bits in the object pointed to by Th
• ck_bitmap_bts(3) Concurrency Kit (libck, -lck) sets the bit at the offset specified by the argument to and fetches its original value.
• ck_bitmap_buffer(3) Concurrency Kit (libck, -lck) The functions returns a pointer to the actual bit array.
• ck_bitmap_clear(3) Concurrency Kit (libck, -lck) The function sets all bits in the bitmap pointed to by to 0.
• ck_bitmap_init(3) Concurrency Kit (libck, -lck) The function initializes the bitmap pointed to by the pointer.
• ck_bitmap_iterator_init(3) Concurrency Kit (libck, -lck) The function will initialize the object pointed to by the argument for use with An iterato
• ck_bitmap_next(3) Concurrency Kit (libck, -lck) The function will increment the iterator object pointed to by to point to the next set bit
• ck_bitmap_reset(3) Concurrency Kit (libck, -lck) The resets the bit at offset specified by the argument to This function has no return valu
• ck_bitmap_set(3) Concurrency Kit (libck, -lck) The sets the bit at offset specified by the argument to This function has no return value.
• ck_bitmap_size(3) Concurrency Kit (libck, -lck) The function returns the number of bytes that are necessary to allocate for a bitmap that
• ck_bitmap_test(3) Concurrency Kit (libck, -lck) The determines if the bit at the offset specified by the argument is set to This function
• ck_bitmap_union(3) Concurrency Kit (libck, -lck) The function sets all bits in the bitmap pointed to by in the bitmap pointed to by This fu
• ck_brlock(3) Concurrency Kit (libck, -lck) 'unsigned int factor' Big reader locks are distributed reader-writer locks with low latenc
• CK_COHORT_INIT(3) Concurrency Kit (libck, -lck) 'void *local_lock' 'unsigned int pass_limit' Until a cohort instance is initialized using
• CK_COHORT_INSTANCE(3) Concurrency Kit (libck, -lck) The user must use this macro to declare instances of cohort types that they have defined.
• CK_COHORT_LOCK(3) Concurrency Kit (libck, -lck) 'void *local_context' This call attempts to acquire both the local and global (if necessar
• CK_COHORT_PROTOTYPE(3) Concurrency Kit (libck, -lck) 'LOCK_FXN global_unlock_method' 'LOCK_FXN local_lock_method' 'LOCK_FXN local_unlock_method
• CK_COHORT_TRYLOCK_PROTOTYPE(3) Concurrency Kit (libck, -lck) 'LOCK_FXN global_unlock_method' 'BOOL_LOCK_FXN global_locked_method' 'BOOL_LOCK_FXN glob
• CK_COHORT_TRYLOCK(3) Concurrency Kit (libck, -lck) 'void *local_trylock_context' 'void *lock_unlock_context' This call attempts to acquire bo
• CK_COHORT_UNLOCK(3) Concurrency Kit (libck, -lck) 'void *local_context' This call instructs to relinquish its local lock and potentially its
• ck_cohort(3) Concurrency Kit (libck, -lck) 'LOCK_FXN global_unlock_method' 'LOCK_FXN local_lock_method' 'LOCK_FXN local_unlock_method
• ck_elide(3) Concurrency Kit (libck, -lck) struct ck_elide_config { unsigned short skip_busy; short retry_busy; unsigned short skip_o
• ck_epoch_barrier(3) Concurrency Kit (libck, -lck) The function will block the caller until a grace period has been detected, according to th
• ck_epoch_begin(3) Concurrency Kit (libck, -lck) The function will mark the beginning of an epoch-protected code section.
• ck_epoch_call(3) Concurrency Kit (libck, -lck) typedef struct ck_epoch_entry ck_epoch_entry_t; typedef void ck_epoch_cb_t(ck_epoch_entry_
• ck_epoch_end(3) Concurrency Kit (libck, -lck) The function will mark the end of an epoch-protected code section.
• ck_epoch_init(3) Concurrency Kit (libck, -lck) The function initializes the epoch object pointed to by the pointer.
• ck_epoch_poll(3) Concurrency Kit (libck, -lck) The function will attempt to dispatch any functions associated with the object pointed to
• ck_epoch_reclaim(3) Concurrency Kit (libck, -lck) The function will unconditionally execute all callbacks that have been deferred with #incl
• ck_epoch_recycle(3) Concurrency Kit (libck, -lck) The function attempts to return an unused epoch record object for use by the caller.
• ck_epoch_register(3) Concurrency Kit (libck, -lck) The function associates a record object specified by the pointer with the epoch object poi
• ck_epoch_synchronize(3) Concurrency Kit (libck, -lck) The function will block the caller until a grace period has been detected, according to th
• ck_epoch_unregister(3) Concurrency Kit (libck, -lck) The function allows for the record pointed by the pointer to be used as a return value by
• ck_hs_apply(3) Concurrency Kit (libck, -lck) The function will lookup the hash set slot associated with and pass it to function pointed
• ck_hs_count(3) Concurrency Kit (libck, -lck) The function returns the number of keys currently stored in Behavior is undefined if is un
• ck_hs_destroy(3) Concurrency Kit (libck, -lck) The function will request that the underlying allocator, as specified by the function, imm
• ck_hs_fas(3) Concurrency Kit (libck, -lck) The function will fetch and store the key specified by the argument in the hash set pointe
• ck_hs_gc(3) Concurrency Kit (libck, -lck) The function will perform various maintenance routines on the hash set pointed to by inclu
• ck_hs_get(3) Concurrency Kit (libck, -lck) The function will return a pointer to a key in the hash set that is of equivalent value to
• ck_hs_grow(3) Concurrency Kit (libck, -lck) The function will resize the hash set in order to be able to store at least the number of
• CK_HS_HASH(3) Concurrency Kit (libck, -lck) The macro will invoke the hash function pointed to by the argument with the seed value ass
• ck_hs_init(3) Concurrency Kit (libck, -lck) The function initializes the hash set pointed to by the pointer.
• ck_hs_iterator_init(3) Concurrency Kit (libck, -lck) The function will initialize the object pointed to by the argument.
• ck_hs_move(3) Concurrency Kit (libck, -lck) The function will initialize from The hash function is set to comparison function to and t
• ck_hs_next(3) Concurrency Kit (libck, -lck) The function will increment the iterator object pointed to by to point to the next non-emp
• ck_hs_put_unique(3) Concurrency Kit (libck, -lck) The function will store the key specified by the argument in the hash set pointed to by th
• ck_hs_put(3) Concurrency Kit (libck, -lck) The function will store the key specified by the argument in the hash set pointed to by th
• ck_hs_rebuild(3) Concurrency Kit (libck, -lck) The function will regenerate the hash set pointed to by This has the side-effect of prunin
• ck_hs_remove(3) Concurrency Kit (libck, -lck) The function will attempt to remove the key specified by the argument in the hash set poin
• ck_hs_reset_size(3) Concurrency Kit (libck, -lck) The function will remove all keys stored in the hash set pointed to by the argument and cr
• ck_hs_reset(3) Concurrency Kit (libck, -lck) The function will remove all keys stored in the hash set pointed to by the argument.
• ck_hs_set(3) Concurrency Kit (libck, -lck) The function will store the key specified by the argument in the hash set pointed to by th
• ck_hs_stat(3) Concurrency Kit (libck, -lck) The function will store various hash set statistics in the object pointed to by The ck_hs_
• ck_ht_count(3) Concurrency Kit (libck, -lck) The function will return the number of entries in the hash table pointed to be the argumen
• ck_ht_destroy(3) Concurrency Kit (libck, -lck) The function will request that the underlying allocator, as specified by the function, imm
• ck_ht_entry_empty(3) Concurrency Kit (libck, -lck) The function will return if points to a valid key-value pair.
• ck_ht_entry_key_direct(3) Concurrency Kit (libck, -lck) The function will return the key value as specified in the object pointed to by the argume
• ck_ht_entry_key_length(3) Concurrency Kit (libck, -lck) The function will return the length of the key associated with the object pointed to by th
• ck_ht_entry_key_set_direct(3) Concurrency Kit (libck, -lck) The function will initialize the object pointed to by with the key value specified in the
• ck_ht_entry_key_set(3) Concurrency Kit (libck, -lck) The function will initialize the object pointed to by with a key pointed to by the argumen
• ck_ht_entry_key(3) Concurrency Kit (libck, -lck) The function will return the key pointer as specified in the object pointed to by the argu
• ck_ht_entry_set_direct(3) Concurrency Kit (libck, -lck) The function will initialize the object pointed to by with the hash value specified by the
• ck_ht_entry_set(3) Concurrency Kit (libck, -lck) The function will initialize the object pointed to by with a key pointed to by the argumen
• ck_ht_entry_value_direct(3) Concurrency Kit (libck, -lck) The function will return the value of the key-value pair as specified in the object pointe
• ck_ht_entry_value(3) Concurrency Kit (libck, -lck) The function will return the value pointer as specified in the object pointed to by the ar
• ck_ht_gc(3) Concurrency Kit (libck, -lck) The function will perform various maintenance routines on the hash table pointed to by inc
• ck_ht_get_spmc(3) Concurrency Kit (libck, -lck) The function will return the value associated with the key specified in the argument in th
• ck_ht_grow_spmc(3) Concurrency Kit (libck, -lck) The function will resize the hash table in order to be able to at least store the number o
• ck_ht_hash_direct(3) Concurrency Kit (libck, -lck) The function will generate a hash value in the object pointed to by the argument.
• ck_ht_hash(3) Concurrency Kit (libck, -lck) The function will generate a hash value in the object pointed to by the argument.
• ck_ht_init(3) Concurrency Kit (libck, -lck) The function initializes the hash table pointed to by the pointer.
• ck_ht_iterator_init(3) Concurrency Kit (libck, -lck) The function will initialize the object pointed to by the argument.
• ck_ht_next(3) Concurrency Kit (libck, -lck) The function will increment the iterator object pointed to by to point to the next non-emp
• ck_ht_put_spmc(3) Concurrency Kit (libck, -lck) The function will store the key-value pair specified in the argument in the hash table poi
• ck_ht_remove_spmc(3) Concurrency Kit (libck, -lck) The function will remove the key-value pair associated with the key specified by the argum
• ck_ht_reset_size_spmc(3) Concurrency Kit (libck, -lck) The function will remove all key-value pairs stored in the hash table pointed to by the ar
• ck_ht_reset_spmc(3) Concurrency Kit (libck, -lck) The function will remove all key-value pairs stored in the hash table pointed to by the ar
• ck_ht_set_spmc(3) Concurrency Kit (libck, -lck) The function will store the key-value pair specified in the argument in the hash table poi
• ck_ht_stat(3) Concurrency Kit (libck, -lck) The function will store various hash set statistics in the object pointed to by The ck_ht_
• ck_pflock(3) Concurrency Kit (libck, -lck) This is a centralized phase-fair reader-writer lock.
• ck_pr_add(3) Concurrency Kit (libck, -lck) The family of functions atomically add the value specified by to the value pointed to by T
• ck_pr_and(3) Concurrency Kit (libck, -lck) The family of functions atomically compute and store the result of a bitwise-and of the va
• ck_pr_barrier(3) Concurrency Kit (libck, -lck) The function is used to disable code movement optimizations across the invocation of the f
• ck_pr_btc(3) Concurrency Kit (libck, -lck) The family of functions atomically fetch the value of the bit in at index and set that bit
• ck_pr_btr(3) Concurrency Kit (libck, -lck) The family of functions atomically fetch the value of the bit in at index and set that bit
• ck_pr_bts(3) Concurrency Kit (libck, -lck) The family of functions atomically fetch the value of the bit in at index and set that bit
• ck_pr_cas(3) Concurrency Kit (libck, -lck) The family of functions atomically compare the value in for equality with and if so, repla
• ck_pr_dec(3) Concurrency Kit (libck, -lck) The family of functions atomically decrement the value pointed to by The ck_pr_dec_zero fa
• ck_pr_faa(3) Concurrency Kit (libck, -lck) The family of functions atomically fetch the value pointed to by and add the value specifi
• ck_pr_fas(3) Concurrency Kit (libck, -lck) The family of functions atomically fetch the value pointed to by and replace the value poi
• ck_pr_fence_acquire(3) Concurrency Kit (libck, -lck) This function enforces the partial ordering of any loads prior to invocation with respect
• ck_pr_fence_atomic_load(3) Concurrency Kit (libck, -lck) The function enforces the ordering of any atomic read-modify-write operations relative to
• ck_pr_fence_atomic_store(3) Concurrency Kit (libck, -lck) The function enforces the ordering of any atomic read-modify-write operations relative to
• ck_pr_fence_atomic(3) Concurrency Kit (libck, -lck) The function enforces the ordering of any atomic read-modify-write operations relative to
• ck_pr_fence_load_atomic(3) Concurrency Kit (libck, -lck) This function enforces the ordering of any memory load and operations with respect to stor
• ck_pr_fence_load_depends(3) Concurrency Kit (libck, -lck) The emits necessary fences for pure data-dependent loads.
• ck_pr_fence_load_store(3) Concurrency Kit (libck, -lck) This function enforces the ordering of any memory load and operations with respect to stor
• ck_pr_fence_load(3) Concurrency Kit (libck, -lck) This function enforces the ordering of any memory load and operations relative to the invo
• ck_pr_fence_memory(3) Concurrency Kit (libck, -lck) The function enforces the ordering of any memory operations with respect to the invocation
• ck_pr_fence_release(3) Concurrency Kit (libck, -lck) This function enforces the partial ordering of any loads prior to invocation with respect
• ck_pr_fence_store_atomic(3) Concurrency Kit (libck, -lck) The function enforces the ordering of any memory store, and atomic read-modify-write opera
• ck_pr_fence_store_load(3) Concurrency Kit (libck, -lck) The function enforces the ordering of any memory store, and atomic read-modify-write opera
• ck_pr_fence_store(3) Concurrency Kit (libck, -lck) The function enforces the ordering of any memory store, and atomic read-modify-write opera
• ck_pr_inc(3) Concurrency Kit (libck, -lck) The family of functions atomically increment the value pointed to by The ck_pr_inc_zero fa
• ck_pr_load(3) Concurrency Kit (libck, -lck) The family of functions atomically loads the value pointed to by and returns it.
• ck_pr_neg(3) Concurrency Kit (libck, -lck) The family of functions atomically negate the value pointed to by The ck_pr_neg_zero funct
• ck_pr_not(3) Concurrency Kit (libck, -lck) The family of functions atomically complement the value pointed to by These functions have
• ck_pr_or(3) Concurrency Kit (libck, -lck) The family of functions atomically compute and store the result of a bitwise-or of the val
• ck_pr_rtm(3) Concurrency Kit (libck, -lck) These family of functions implement support for restricted transactional memory, if availa
• ck_pr_stall(3) Concurrency Kit (libck, -lck) The function should be used inside retry paths of busy-wait loops.
• ck_pr_store(3) Concurrency Kit (libck, -lck) The family of functions atomically stores the value specified by into the location pointed
• ck_pr_sub(3) Concurrency Kit (libck, -lck) The family of functions atomically subtract the value specified by from the value pointed
• ck_pr_xor(3) Concurrency Kit (libck, -lck) The family of functions atomically compute and store the result of a bitwise-xor of the va
• ck_pr(3) Concurrency Kit (libck, -lck) ck_pr.h provides an interface to volatile atomic instructions, memory barriers and busy-wa
• ck_queue(3) Concurrency Kit (libck, -lck) See your system's manual page for for additional information.
• ck_rhs_apply(3) Concurrency Kit (libck, -lck) The function will lookup the hash set slot associated with and pass it to function pointed
• ck_rhs_count(3) Concurrency Kit (libck, -lck) The function returns the number of keys currently stored in Behavior is undefined if is un
• ck_rhs_destroy(3) Concurrency Kit (libck, -lck) The function will request that the underlying allocator, as specified by the function, imm
• ck_rhs_fas(3) Concurrency Kit (libck, -lck) The function will fetch and store the key specified by the argument in the hash set pointe
• ck_rhs_gc(3) Concurrency Kit (libck, -lck) The function will perform various maintenance routines on the hash set pointed to by inclu
• ck_rhs_get(3) Concurrency Kit (libck, -lck) The function will return a pointer to a key in the hash set that is of equivalent value to
• ck_rhs_grow(3) Concurrency Kit (libck, -lck) The function will resize the hash set in order to be able to store at least the number of
• CK_RHS_HASH(3) Concurrency Kit (libck, -lck) The macro will invoke the hash function pointed to by the argument with the seed value ass
• ck_rhs_init(3) Concurrency Kit (libck, -lck) The function initializes the hash set pointed to by the pointer.
• ck_rhs_iterator_init(3) Concurrency Kit (libck, -lck) The function will initialize the object pointed to by the argument.
• ck_rhs_move(3) Concurrency Kit (libck, -lck) The function will initialize from The hash function is set to comparison function to and t
• ck_rhs_next(3) Concurrency Kit (libck, -lck) The function will increment the iterator object pointed to by to point to the next non-emp
• ck_rhs_put_unique(3) Concurrency Kit (libck, -lck) The function will store the key specified by the argument in the hash set pointed to by th
• ck_rhs_put(3) Concurrency Kit (libck, -lck) The function will store the key specified by the argument in the hash set pointed to by th
• ck_rhs_rebuild(3) Concurrency Kit (libck, -lck) The function will regenerate the hash set pointed to by This has the side-effect of prunin
• ck_rhs_remove(3) Concurrency Kit (libck, -lck) The function will attempt to remove the key specified by the argument in the hash set poin
• ck_rhs_reset_size(3) Concurrency Kit (libck, -lck) The function will remove all keys stored in the hash set pointed to by the argument and cr
• ck_rhs_reset(3) Concurrency Kit (libck, -lck) The function will remove all keys stored in the hash set pointed to by the argument.
• ck_rhs_set(3) Concurrency Kit (libck, -lck) The function will store the key specified by the argument in the hash set pointed to by th
• ck_rhs_stat(3) Concurrency Kit (libck, -lck) The function will store various hash set statistics in the object pointed to by The ck_rhs
• ck_ring_capacity(3) Concurrency Kit (libck, -lck) The function returns the number of pointers that can be held in the buffer pointed to by N
• ck_ring_dequeue_spmc(3) Concurrency Kit (libck, -lck) The function dequeues a pointer from the bounded buffer pointed to by in FIFO fashion.
• ck_ring_dequeue_spsc(3) Concurrency Kit (libck, -lck) The function dequeues a pointer from the bounded buffer pointed to by in FIFO fashion.
• ck_ring_enqueue_spmc_size(3) Concurrency Kit (libck, -lck) The function enqueues the pointer into the bounded buffer pointed to by in FIFO fashion.
• ck_ring_enqueue_spmc(3) Concurrency Kit (libck, -lck) The function enqueues the pointer into the bounded buffer pointed to by in FIFO fashion.
• ck_ring_enqueue_spsc_size(3) Concurrency Kit (libck, -lck) The function enqueues the pointer into the bounded buffer pointed to by in FIFO fashion.
• ck_ring_enqueue_spsc(3) Concurrency Kit (libck, -lck) The function enqueues the pointer into the bounded buffer pointed to by in FIFO fashion.
• ck_ring_init(3) Concurrency Kit (libck, -lck) The function initializes a bounded FIFO buffer pointed to by for the storage of up to numb
• ck_ring_size(3) Concurrency Kit (libck, -lck) The function returns the number of pointers currently enqueued in the buffer pointed to by
• ck_ring_trydequeue_spmc(3) Concurrency Kit (libck, -lck) The function attempts to dequeue a pointer from the bounded buffer pointed to by in FIFO f
• CK_RWCOHORT_INIT(3) Concurrency Kit (libck, -lck) This macro initializes the lock instance pointed to by the argument.
• CK_RWCOHORT_INSTANCE(3) Concurrency Kit (libck, -lck) The user must use this macro to declare instances of lock types that they have defined usi
• CK_RWCOHORT_PROTOTYPE(3) Concurrency Kit (libck, -lck) The ck_rwcohort.h header file does not define any cohort types.
• CK_RWCOHORT_READ_LOCK(3) Concurrency Kit (libck, -lck) 'void *global_context' 'void *local_context' 'void *global_context' 'void *local_context'
• CK_RWCOHORT_READ_UNLOCK(3) Concurrency Kit (libck, -lck) 'void *global_context' 'void *local_context' 'void *global_context' 'void *local_context'
• CK_RWCOHORT_WRITE_LOCK(3) Concurrency Kit (libck, -lck) 'void *global_context' 'void *local_context' 'void *global_context' 'void *local_context'
• CK_RWCOHORT_WRITE_UNLOCK(3) Concurrency Kit (libck, -lck) 'void *global_context' 'void *local_context' 'void *global_context' 'void *local_context'
• ck_rwcohort(3) Concurrency Kit (libck, -lck) In each of the following macros, 'STRATEGY' should be replaced with either 'NEUTRAL', 'RP'
• ck_rwlock(3) Concurrency Kit (libck, -lck) This is a centralized write-biased reader-writer lock.
• ck_sequence(3) Concurrency Kit (libck, -lck) It is recommended to use ck_sequence when a small amount of data that cannot be accessed a
• ck_spinlock(3) Concurrency Kit (libck, -lck) A family of busy-wait spinlock implementations.
• ck_swlock(3) Concurrency Kit (libck, -lck) This is a centralized write-biased single-writer reader-writer lock.
• ck_tflock(3) Concurrency Kit (libck, -lck) This is a centralized task-fair reader-writer lock.