|
xenium
|
| ▼Nxenium | |
| ▼Npolicy | |
| Cabandon | Policy to configure the abandon strategy for generic_epoch_based reclamation |
| Callocation_strategy | Policy to configure the allocation strategy |
| Cbackoff | Policy to configure the backoff strategy |
| Cbuckets | Policy to configure the number of buckets in harris_michael_hash_map |
| Ccapacity | Policy to configure the capacity of various containers |
| Ccompare | Policy to configure the comparison function |
| Ccontainer | Policy to configure the internal container type of some data structures |
| Cdefault_to_weak | Policy to configure whether try_push/try_pop in vyukov_bounded_queue should default to try_push_weak/try_pop_weak |
| Centries_per_node | Policy to configure the number of entries per allocated node in ramalhete_queue |
| Chash | Policy to configure the hash function |
| Cinsert_padding | Policy to configure whether to insert padding after the internal header for lock_free_ref_count reclamation |
| Cmap_to_bucket | Policy to configure the function that maps the hash value to a bucket in harris_michael_hash_map |
| Cmemoize_hash | Policy to configure whether the hash value should be stored and used during lookup operations in harris_michael_hash_map |
| Cpadding_bytes | Policy to configure the number of padding bytes to add to each entry in kirsch_kfifo_queue and kirsch_bounded_kfifo_queue to reduce false sharing |
| Cpop_retries | Policy to configure the number of iterations to spin on a queue entry while waiting for a pending push operation to finish |
| Creclaimer | Policy to configure the reclamation scheme to be used |
| Cregion_extension | Policy to configure the extension of critical regions in generic_epoch_based reclamation |
| Cscan | Policy to configure the scan strategy for generic_epoch_based reclamation |
| Cscan_frequency | Policy to configure the scan frequency for generic_epoch_based reclamation |
| Cslots | Policy to configure the number of slots used in seqlock |
| Cthread_local_free_list_size | Policy to configure the size of thread-local free-lists for lock reclamation |
| Cvalue_reclaimer | Policy to configure the reclaimer used for internally alloced nodes in vyukov_hash_map |
| ▼Nreclamation | |
| ▼Nabandon | This namespace contains various abandonment strategies to be used in the generic_epoch_based reclamation scheme |
| Calways | Always abandon the remaining retired nodes when the thread leaves its critical region |
| Cnever | Never abandon any nodes (except when the thread terminates) |
| Cwhen_exceeds_threshold | Abandon the retired nodes upon leaving the critical region when the number of nodes exceeds the specified threshold |
| ▼Ndetail | |
| Cconcurrent_ptr | T must be derived from enable_concurrent_ptr<T>. D is a deleter |
| ▼Nhe_allocation | |
| Cdynamic_strategy | Hazard era allocation strategy for a dynamic number of hazard eras per thread |
| Cstatic_strategy | Hazard era allocation strategy for a static number of hazard eras per thread |
| ▼Nhp_allocation | |
| Cdynamic_strategy | Hazard pointer allocation strategy for a dynamic number of hazard pointers per thread |
| Cstatic_strategy | Hazard pointer allocation strategy for a static number of hazard pointers per thread |
| ▼Nscan | This namespace contains various scan strategies to be used in the generic_epoch_based reclamation scheme |
| Call_threads | Scan all threads (default behaviour in EBR/NEBR) |
| Cn_threads | Scan N threads |
| Cone_thread | Scan a single thread (default behaviour in DEBRA) |
| Cbad_hazard_era_alloc | This exception is thrown if a thread tries to allocate a new hazard era, but the number of available hazard eras is exhausted. This can only happen when xenium::reclamation::he_allocation::static_strategy is used |
| Cbad_hazard_pointer_alloc | This exception is thrown if a thread tries to allocate a new hazard pointer, but the number of available hazard pointers is exhausted. This can only happen when xenium::reclamation::hp_allocation::static_strategy is used |
| Cgeneric_epoch_based | A generalized implementation of epoch based reclamation |
| Chazard_eras | An implementation of the hazard eras scheme proposed by Ramalhete and Correia [RC17] |
| Chazard_pointer | An implementation of the hazard pointers reclamation scheme as proposed by Michael [Mic04] |
| Clock_free_ref_count | An implementation of the lock-free reference counting (LFRC) schemea as proposed by Valois [Val95, MS95] |
| Cquiescent_state_based | Quiescent state based reclamation |
| Cstamp_it | Stamp-it |
| Caligned_object | A small helper class for correctly aligned dynamic allocations of over-aligned types |
| Cchase_work_stealing_deque | A lock-free work stealing deque |
| ▼Charris_michael_hash_map | A generic lock-free hash-map |
| Caccessor | An accessor to safely access the value of an element |
| Citerator | A ForwardIterator to safely iterate the hash-map |
| ▼Charris_michael_list_based_set | A lock-free container that contains a sorted set of unique objects of type Key |
| Citerator | A ForwardIterator to safely iterate the list |
| Chash | Slim wrapper around std::hash with specialization for pointer types |
| Chash< Key * > | Specialized hash functor for pointer types to get rid of the alignment |
| Ckirsch_bounded_kfifo_queue | A bounded lock-free multi-producer/multi-consumer k-FIFO queue |
| Ckirsch_kfifo_queue | An unbounded lock-free multi-producer/multi-consumer k-FIFO queue |
| Cleft_right | Generic implementation of the LeftRight algorithm proposed by Ramalhete and Correia [RC15] |
| Cmanaged_ptr | A helper struct to define that the lifetime of value objects of type T has to be managed by the specified reclaimer. (only supported by vyukov_hash_map) |
| Cmarked_ptr | A pointer with an embedded mark/tag value |
| Cmichael_scott_queue | An unbounded generic lock-free multi-producer/multi-consumer FIFO queue |
| Cnikolaev_bounded_queue | A bounded lock-free multi-producer/multi-consumer queue |
| Cnikolaev_queue | An unbounded lock-free multi-producer/multi-consumer queue |
| Cno_backoff | Dummy backoff strategy that does nothing |
| Cramalhete_queue | A fast unbounded lock-free multi-producer/multi-consumer FIFO queue |
| Cseqlock | An implementation of the sequence lock (also often referred to as "sequential lock") |
| Csingle_backoff | Simple backoff strategy that always perfoms a single hardware_pause operation |
| Cvyukov_bounded_queue | A bounded generic multi-producer/multi-consumer FIFO queue |
| ▼Cvyukov_hash_map | A concurrent hash-map that uses fine-grained locking |
| Citerator | A ForwardIterator to safely iterate vyukov_hash_map |
1.8.17