mCRL2
Loading...
Searching...
No Matches
shared_mutex.h
Go to the documentation of this file.
1// Author(s): Maurice Laveaux
2// Copyright: see the accompanying file COPYING or copy at
3// https://github.com/mCRL2org/mCRL2/blob/master/COPYING
4//
5// Distributed under the Boost Software License, Version 1.0.
6// (See accompanying file LICENSE_1_0.txt or copy at
7// http://www.boost.org/LICENSE_1_0.txt)
8//
9
10#ifndef MCRL2_UTILITIES_DETAIL_SHARED_MUTEX_H
11#define MCRL2_UTILITIES_DETAIL_SHARED_MUTEX_H
12
13#include <algorithm>
14#include <atomic>
15#include <cassert>
16#include <concepts>
17#include <memory>
18#include <mutex>
19#include <shared_mutex>
20#include <vector>
21
22#include "mcrl2/utilities/configuration.h"
23
24namespace mcrl2::utilities
25{
26
27// Forward declaration.
28class shared_mutex;
29
31{
32 /// \brief The list of other mutexes.
34
35 /// \brief Mutex for adding/removing shared_guards.
37
38 /// Adds a shared mutex to the data.
39 inline
40 void register_mutex(shared_mutex* shared_mutex)
41 {
42 std::lock_guard guard(mutex);
43 other.emplace_back(shared_mutex);
44 }
45
46 // Removes a shared mutex from the data
47 inline void unregister_mutex(shared_mutex* shared_mutex)
48 {
49 std::lock_guard guard(mutex);
50 auto it = std::find(other.begin(), other.end(), shared_mutex);
51 assert(it != other.end());
52
53 other.erase(it);
54 }
55};
56
57/// An implementation of a shared mutex (also called readers-write lock in the literature) based on
58/// the notion of busy and forbidden flags.
59class alignas(128) shared_mutex
60{
61public:
64 {
65 m_shared->register_mutex(this);
66 }
67
69 {
70 m_shared->unregister_mutex(this);
71 }
72
73 /// The copy/move constructor/assignment should not be called while any lock_guard or shared_guard is alive.
76 {
77 m_shared->register_mutex(this);
78 }
79
80 shared_mutex(shared_mutex&& other) noexcept
82 {
83 m_shared->register_mutex(this);
84 }
85
87 {
88 if (this != &other)
89 {
90 // Remove ourselves, and register into the other shared.
91 m_shared->unregister_mutex(this);
92
93 m_shared = other.m_shared;
94 m_shared->register_mutex(this);
95 }
96 return *this;
97 }
98
100 {
101 if (this != &other)
102 {
103 m_shared->unregister_mutex(this);
104
105 m_shared = other.m_shared;
106 m_shared->register_mutex(this);
107 m_shared->unregister_mutex(&other);
108 }
109 return *this;
110 }
111
112 /// \brief Obtain exclusive access, and stop all other threads that use this mutex.
113 /// \details Equivalent to std::shared_mutex::lock. Blocks until exclusive access is acquired.
114 /// \pre The calling thread does not hold a (shared) lock on this mutex.
115 /// \post All threads sharing this mutex are suspended outside of their shared sections.
116 inline
117 void lock()
118 {
119 if constexpr (mcrl2::utilities::detail::GlobalThreadSafe)
120 {
121 // Only one thread can halt everything.
122 m_shared->mutex.lock();
124 }
125 }
126
127 /// \brief Try to obtain exclusive access without blocking on other exclusive locks.
128 /// \details Equivalent to std::shared_mutex::try_lock.
129 /// \pre The calling thread does not hold a (shared) lock on this mutex.
130 /// \returns True iff exclusive access was acquired.
131 [[nodiscard]]
132 inline
133 bool try_lock()
134 {
135 if constexpr (mcrl2::utilities::detail::GlobalThreadSafe)
136 {
137 // Try to obtain the lock. If the surrounding mutex cannot be locked, this fails.
138 if (!m_shared->mutex.try_lock())
139 {
140 return false;
141 }
142
144 }
145 return true;
146 }
147
148 /// \brief Release exclusive access.
149 /// \details Equivalent to std::shared_mutex::unlock.
150 /// \pre The calling thread holds the exclusive lock.
151 inline
152 void unlock()
153 {
154 if constexpr (mcrl2::utilities::detail::GlobalThreadSafe)
155 {
156 for (shared_mutex* mutex : m_shared->other)
157 {
158 mutex->set_forbidden(false);
159 }
160
161 m_shared->mutex.unlock();
162 }
163 }
164
165 /// \brief Acquires a shared lock on this mutex.
166 /// \details Equivalent to std::shared_mutex::lock_shared, except that recursive shared
167 /// locking by the owning thread is explicitly allowed: every lock_shared() must
168 /// be balanced by exactly one unlock_shared().
169 /// \post No thread can acquire the exclusive lock until the last unlock_shared().
170 inline
172 {
173 if (mcrl2::utilities::detail::GlobalThreadSafe && m_lock_depth == 0)
174 {
175 assert(!m_busy_flag);
176 m_busy_flag.store(true);
177
178 // Wait for the forbidden flag to become false.
179 while (m_forbidden_flag.load())
180 {
181 m_busy_flag = false;
182
183 // Wait for the global lock.
184 m_shared->mutex.lock();
185 m_shared->mutex.unlock();
186
187 m_busy_flag = true;
188 }
189 }
190
191 ++m_lock_depth;
192 }
193
194 /// \brief Tries to acquire a shared lock on this mutex without blocking.
195 /// \details Equivalent to std::shared_mutex::try_lock_shared.
196 /// \returns True iff the shared lock was acquired.
197 [[nodiscard]]
198 inline
200 {
201 if (mcrl2::utilities::detail::GlobalThreadSafe && m_lock_depth == 0)
202 {
203 assert(!m_busy_flag);
204 m_busy_flag.store(true);
205
206 if (m_forbidden_flag.load())
207 {
208 // An exclusive lock is being held or requested.
209 m_busy_flag.store(false);
210 return false;
211 }
212 }
213
214 ++m_lock_depth;
215 return true;
216 }
217
218 /// \brief Releases a shared lock on this mutex.
219 /// \details Equivalent to std::shared_mutex::unlock_shared.
220 /// \pre The calling thread holds a shared lock on this mutex.
221 inline
223 {
224 assert(!mcrl2::utilities::detail::GlobalThreadSafe || m_lock_depth > 0);
225
226 --m_lock_depth;
227 if (mcrl2::utilities::detail::GlobalThreadSafe && m_lock_depth == 0)
228 {
229 assert(m_busy_flag);
230 m_busy_flag.store(false, std::memory_order_release);
231 }
232 }
233
234 /// \returns True iff the shared mutex is in the shared section
235 bool is_shared_locked() const
236 {
237 return m_lock_depth != 0;
238 }
239
240private:
241 inline
243 {
244 // Shared and exclusive sections MUST be disjoint.
245 assert(!m_busy_flag);
246
247 assert(std::find(m_shared->other.begin(), m_shared->other.end(), this) != m_shared->other.end());
248
249 // Indicate that threads must wait.
250 for (shared_mutex* mutex : m_shared->other)
251 {
252 if (mutex != this)
253 {
254 mutex->set_forbidden(true);
255 }
256 }
257
258 // Wait for all pools to indicate that they are not busy.
259 for (const shared_mutex* mutex : m_shared->other)
260 {
261 if (mutex != this)
262 {
263 mutex->wait_for_busy();
264 }
265 }
266 }
267
268 /// \returns True iff the shared mutex has its busy flag set.
269 inline
270 bool is_busy() const
271 {
272 return m_busy_flag.load();
273 }
274
275 /// \brief Waits for the busy flag to become false.
276 inline
277 void wait_for_busy() const
278 {
279 while (m_busy_flag.load()) { /* wait */ };
280 }
281
282 inline
283 void set_forbidden(bool value)
284 {
285 m_forbidden_flag.store(value);
286 }
287
288 /// \brief A boolean flag indicating whether this thread is working inside the global aterm pool.
289 std::atomic<bool> m_busy_flag = false;
290 std::atomic<bool> m_forbidden_flag = false;
291
292 /// \brief It can happen that un/lock_shared calls are nested, so keep track of the nesting depth and only
293 /// actually perform un/locking at the root.
295
296 std::shared_ptr<shared_mutex_data> m_shared;
297};
298
299namespace detail
300{
301
302/// \brief The Cpp17Lockable named requirement; the standard library provides no concept for it.
303template<typename Mutex>
304concept IsLockable = requires(Mutex m) {
305 { m.lock() } -> std::same_as<void>;
306 { m.unlock() } -> std::same_as<void>;
307 { m.try_lock() } -> std::same_as<bool>;
308};
309
310/// \brief The Cpp17SharedLockable named requirement; the standard library provides no concept for it.
311template<typename Mutex>
312concept IsSharedLockable = requires(Mutex m) {
313 { m.lock_shared() } -> std::same_as<void>;
314 { m.try_lock_shared() } -> std::same_as<bool>;
315 { m.unlock_shared() } -> std::same_as<void>;
316};
317
318} // namespace detail
319
320// The interface must behave as std::shared_mutex, such that the standard library lock guards apply.
321static_assert(detail::IsLockable<shared_mutex>,
322 "shared_mutex must satisfy Cpp17Lockable, like std::shared_mutex, for use with std::unique_lock");
323static_assert(detail::IsSharedLockable<shared_mutex>,
324 "shared_mutex must satisfy Cpp17SharedLockable, like std::shared_mutex, for use with std::shared_lock");
325
326/// \brief An exclusive lock guard for the shared_mutex, as in the standard library.
328
329/// \brief A shared lock guard for the shared_mutex, as in the standard library.
330using shared_guard = std::shared_lock<shared_mutex>;
331
332} // namespace mcrl2::utilities
333
334#endif // MCRL2_UTILITIES_DETAIL_SHARED_MUTEX_H
atermpp::aterm create_nested_function(const std::string &function_name, const std::string &leaf_name, std::size_t number_of_arguments, std::size_t depth)
Create a nested function application f_depth. Where f_0 = c and f_i = f(f_i-1,...,...
atermpp::aterm create_nested_function(const std::string &function_name, const std::string &leaf_name, std::size_t depth)
Create a nested function application f_depth. Where f_0 = c and f_i = f(f_i-1,...,...
void benchmark_threads(std::size_t number_of_threads, F f)
Run the given function f on number_of_threads threads (including the main thread) and report the elap...
The aterm_core base class that provides protection of the underlying shared terms.
Definition aterm_core.h:151
aterm_core & operator=(aterm_core &&other) noexcept
Move assignment operator.
~aterm_core() noexcept
Standard destructor.
aterm_core & operator=(const aterm_core &other) noexcept
Assignment operator.
aterm_core(const aterm_core &other) noexcept
Copy constructor.
aterm_core(aterm_core &&other) noexcept
Move constructor.
aterm_core() noexcept
Default constructor.
aterm_core & assign(const aterm_core &other, detail::thread_aterm_pool &pool) noexcept
Assignment operator, to be used if busy and forbidden flags are explicitly available.
aterm_core & unprotected_assign(const aterm_core &other) noexcept
Assignment operator, to be used when the busy flags do not need to be set.
aterm_core(const detail::_aterm *t) noexcept
Constructor based on an internal term data structure. This is not for public use.
aterm(aterm &&other) noexcept=default
aterm()
Default constructor.
Definition aterm.h:51
aterm & operator=(const aterm &other) noexcept=default
aterm(const aterm &other) noexcept=default
This class has user-declared copy constructor so declare default copy and move operators.
aterm(detail::_term_appl *t)
Constructor.
Definition aterm.h:33
aterm & operator=(aterm &&other) noexcept=default
aterm(const function_symbol &sym, ForwardIterator begin, ForwardIterator end)
Constructor that provides an aterm based on a function symbol and forward iterator providing the argu...
Definition aterm.h:70
This class allocates _aterm_appl objects where the size is based on the arity of the function symbol.
Definition aterm.h:113
T * allocate_args(const function_symbol &symbol, unprotected_aterm_core *)
Allocates space for an _aterm_appl where the arity is given by the function symbol.
Definition aterm.h:143
T * allocate_args(const function_symbol &symbol, ForwardIterator, ForwardIterator)
Allocates space for an _aterm_appl where the arity is given by the function symbol.
Definition aterm.h:134
std::allocator< char > m_packed_allocator
Definition aterm.h:182
static constexpr std::size_t term_appl_size(std::size_t arity)
Definition aterm.h:116
void destroy(T *element)
Specialize destroy for _aterm_appl to only destroy the function symbol. The reference count for the a...
Definition aterm.h:158
constexpr std::size_t capacity() const
Definition aterm.h:177
void deallocate(T *element, std::size_t)
Definition aterm.h:167
constexpr bool has_free_slots() const noexcept
Definition aterm.h:179
constexpr std::size_t consolidate() const noexcept
Definition aterm.h:178
void construct(T *element, const function_symbol &symbol, ForwardIterator begin, ForwardIterator end)
Constructs an _aterm_appl with arguments taken from begin, the arity is given by the function symbol.
Definition aterm.h:152
This class stores a term followed by N arguments. Where N should be equal to the arity of the functio...
Definition aterm.h:34
_aterm_appl(const function_symbol &symbol, Iterator it, Iterator end, bool)
constructs a term application with the given symbol and its arguments from the iterator.
Definition aterm.h:74
_aterm_appl(const function_symbol &sym, const Terms &... arguments)
Constructs a term application with the given symbol and arguments.
Definition aterm.h:39
_aterm_appl(const function_symbol &sym, std::array< unprotected_aterm_core, N > arguments)
Constructs a term application with the given symbol and arguments.
Definition aterm.h:65
std::array< unprotected_aterm_core, N > m_arguments
Definition aterm.h:102
operator _aterm_appl< 1 > &()
Convert any known number of arguments aterm<N> to the default _aterm_appl.
Definition aterm.h:96
_aterm_appl(const function_symbol &sym, Iterator it, Iterator end)
constructs a term application with the given symbol and an iterator where the number of elements is e...
Definition aterm.h:50
const aterm_core & arg(std::size_t index) const
Definition aterm.h:90
The underlying integer term that actually carries the integer data.
Definition aterm_int.h:21
std::size_t value() const noexcept
Definition aterm_int.h:29
_aterm_int(std::size_t value)
Constructs the underlying term from a given value.
Definition aterm_int.h:24
This is the class to which an aterm points.
Definition aterm_core.h:48
bool is_marked() const
Check if the term is already marked.
Definition aterm_core.h:73
_aterm(const function_symbol &symbol)
Create a term from a function symbol.
Definition aterm_core.h:51
function_symbol m_function_symbol
Definition aterm_core.h:79
const function_symbol & function() const noexcept
Definition aterm_core.h:55
void mark() const
Mark this term to be garbage collected.
Definition aterm_core.h:61
void unmark() const
Remove the mark from a term.
Definition aterm_core.h:67
Stores the data for a function symbol (name, arity) pair.
const std::string & name() const noexcept
bool operator==(const _function_symbol &f) const noexcept
std::size_t arity() const noexcept
This class provides for all types of term storage. It also provides garbage collection via its mark a...
bool create_appl_iterator(aterm &term, const function_symbol &sym, TermConverter converter, InputIterator begin, InputIterator end)
Creates a function application with the given function symbol and the arguments as provided by the gi...
constexpr bool is_dynamic_storage() const
std::vector< callback_pair > m_deletion_hooks
This array stores creation, resp deletion, hooks for function symbols.
void print_performance_stats(const char *identifier) const
Prints various performance statistics for this storage.
bool create_appl(aterm &term, const function_symbol &sym, const Terms &... arguments)
Creates a function application with the given function symbol and arguments.
bool create_int(aterm &term, std::size_t value)
Creates a integral term with the given value.
bool create_appl_iterator(aterm &term, const function_symbol &sym, ForwardIterator begin, ForwardIterator end)
Creates a function application with the given function symbol and the arguments as provided by the gi...
void resize_if_needed()
Resizes the hash table if necessary.
bool verify_sweep()
Check that all arguments of a term application are marked properly.
unordered_set m_term_set
This is the set of term pointers to keep the terms unique.
void add_deletion_hook(function_symbol sym, term_callback callback)
Add a callback that is triggered whenever a term with the given function symbol is destroyed.
aterm_pool & m_pool
The pool that this storage belongs to.
bool create_appl_dynamic(aterm &term, const function_symbol &sym, ForwardIterator begin, ForwardIterator end)
Creates a function application with the given function symbol and the arguments as provided by the gi...
std::size_t capacity() const noexcept
bool emplace(aterm_core &term, Args &&... args)
Inserts a term constructed by the given arguments, checks for existing term.
iterator destroy(iterator it)
Removes an element from the unordered set and deallocates it.
void call_deletion_hook(unprotected_aterm_core term)
Calls the deletion hook attached to the function symbol of this term.
aterm_pool_storage(const aterm_pool_storage &other)
A fake copy constructor to fix the issues with GCC 4 and 5.
mcrl2::utilities::cache_metric m_term_metric
Count the number of times a term has been found in or is added to the set.
bool create_appl_dynamic(aterm &term, const function_symbol &sym, TermConverter converter, InputIterator begin, InputIterator end)
Creates a function application with the given function symbol and the arguments as provided by the gi...
bool verify_term(const _aterm &term)
Verify that the given term was constructed properly.
bool verify_mark()
Check that all arguments of a term application are marked properly.
bool create_term(aterm &term, const function_symbol &sym)
Creates a term with the given function symbol.
bool resize_is_needed() const
Check whether resizing the hash table is needed.
void sweep()
sweep Destroys all terms that are not reachable. Requires that mark() was called first.
The interface for the term library. Provides the storage of of all classes of terms.
Definition aterm_pool.h:83
const function_symbol & as_int() noexcept
Definition aterm_pool.h:121
void enable_resize(bool enable)
Enable automatic hash table resizing when passing true and disable otherwise.
Definition aterm_pool.h:136
bool create_appl(aterm &term, const function_symbol &sym, const Terms &... arguments)
Creates a function application with the given function symbol and arguments.
std::atomic< bool > m_enable_garbage_collection
Definition aterm_pool.h:225
function_symbol create_function_symbol(const std::string &name, std::size_t arity, bool check_for_registered_functions=false)
Creates a function symbol pair (name, arity).
function_symbol create_function_symbol(std::string &&name, std::size_t arity, bool check_for_registered_functions=false)
Creates a function symbol pair (name, arity).
void remove_thread_aterm_pool(thread_aterm_pool_interface &pool)
Remove thread specific aterm pool.
std::vector< thread_aterm_pool_interface * > m_thread_pools
The set of local aterm pools.
Definition aterm_pool.h:199
bool create_int(aterm &term, std::size_t val)
Creates a integral term with the given value.
function_symbol_pool m_function_symbol_pool
Storage for the function symbols.
Definition aterm_pool.h:202
void collect_impl(mcrl2::utilities::shared_mutex &mutex)
Collect garbage on all storages.
bool resize_is_needed(mcrl2::utilities::shared_mutex &shared) const
Resizes all storages if necessary.
arbitrary_function_application_storage m_appl_dynamic_storage
Storage for term_appl with a dynamic number of arguments larger than 7.
Definition aterm_pool.h:220
const function_symbol & as_empty_list() noexcept
Definition aterm_pool.h:127
const function_symbol & as_list() noexcept
Definition aterm_pool.h:124
aterm_core m_empty_list
Represents an empty list.
Definition aterm_pool.h:233
void print_performance_statistics() const
Prints various performance statistics for the term pool.
std::atomic< long > m_count_until_collection
Track the number of terms destroyed and reduce the freelist.
Definition aterm_pool.h:223
void register_thread_aterm_pool(thread_aterm_pool_interface &pool)
Register a thread specific aterm pool.
bool create_term(aterm &term, const function_symbol &sym)
Creates a term with the given function symbol.
void collect(mcrl2::utilities::shared_mutex &mutex)
Force garbage collection on all storages.
bool create_appl_dynamic(aterm &term, const function_symbol &sym, ForwardIterator begin, ForwardIterator end)
Creates a function application with the given function symbol and the arguments as provided by the gi...
bool create_appl_dynamic(aterm &term, const function_symbol &sym, ATermConverter convert_to_aterm, InputIterator begin, InputIterator end)
Creates a function application with the given function symbol and the arguments as provided by the gi...
aterm & empty_list() noexcept
Definition aterm_pool.h:118
mcrl2::utilities::shared_mutex m_shared_mutex
Automatic hash table resizing is enabled.
Definition aterm_pool.h:230
void add_deletion_hook(function_symbol sym, term_callback callback)
Add a callback that is triggered whenever a term with the given function symbol is destroyed.
function_symbol_pool & get_symbol_pool()
Definition aterm_pool.h:138
integer_term_storage m_int_storage
Storage for integral terms.
Definition aterm_pool.h:205
std::atomic< bool > m_enable_resize
Garbage collection is enabled.
Definition aterm_pool.h:227
void created_term(mcrl2::utilities::shared_mutex &mutex, long &count_until_check)
Triggers garbage collection and resizing when conditions are met.
void resize_if_needed(mcrl2::utilities::shared_mutex &shared)
Resizes all storages if necessary.
void enable_garbage_collection(bool enable)
Enable garbage collection when passing true and disable otherwise.
Definition aterm_pool.h:133
std::size_t capacity() const noexcept
The number of terms that can be stored without resizing.
This class stores a set of function symbols.
void sweep()
Collect all garbage function symbols.
void deregister(const std::string &prefix)
Restore the index back to index before registering this prefix.
bool resize_is_needed() const
Check whether a resize is needed.
std::shared_ptr< std::size_t > register_prefix(const std::string &prefix)
void resize_if_needed()
Resize the function symbol pool if necessary.
const function_symbol & as_int() noexcept
unordered_set m_symbol_set
Stores the underlying function symbols.
const function_symbol & as_empty_list() noexcept
void create_helper(const std::string &name)
function_symbol create(const std::string &name, std::size_t arity, bool check_for_registered_functions=false)
Creates a function symbol pair (name, arity), returns a pointer to an existing element if this pair i...
std::size_t get_sufficiently_large_postfix_index(const std::string &prefix) const
Get an index such that no function symbol with name prefix + returned value and any value above it al...
std::size_t capacity() const noexcept
mcrl2::utilities::cache_metric m_function_symbol_metrics
Track the number of function symbols found in or added to the set.
function_symbol create(std::string &&name, std::size_t arity, bool check_for_registered_functions=false)
const function_symbol & as_list() noexcept
void mark()
Mark the terms created by this thread to prevent them being garbage collected.
Definition aterm_pool.h:47
thread_aterm_pool_interface(aterm_pool &pool, std::function< void()> mark_function, std::function< void()> print_function, std::function< std::size_t()> protection_set_size_function)
Definition aterm_pool.h:237
void print_local_performance_statistics() const
Print performance statistics for data stored for this thread.
Definition aterm_pool.h:53
std::function< std::size_t()> m_protection_set_size_function
Definition aterm_pool.h:71
std::stack< std::reference_wrapper< _aterm > > m_todo
A reusable todo stack.
void swap(function_symbol &f) noexcept
Swap this function with its argument.
bool operator!=(const function_symbol &f) const
Inequality test.
function_symbol & operator=(const function_symbol &other) noexcept=default
function_symbol(function_symbol &&other) noexcept=default
bool operator>=(const function_symbol &f) const
Comparison operation.
bool operator==(const function_symbol &f) const
Equality test.
function_symbol(detail::_function_symbol::ref &&f)
Constructor for internal use only.
bool operator<(const function_symbol &f) const
Comparison operation.
function_symbol(const function_symbol &other) noexcept=default
This class has non-trivial destructor so declare default copy and move operators.
void destroy()
Calls the function symbol pool to free our used memory.
function_symbol & operator=(function_symbol &&other) noexcept=default
std::size_t arity() const
Return the arity (number of arguments) of the function symbol (function_symbol).
detail::_function_symbol::ref m_function_symbol
The shared reference to the underlying function symbol.
const std::string & name() const
Return the name of the function_symbol.
bool operator>(const function_symbol &f) const
Comparison operation.
bool operator<=(const function_symbol &f) const
Comparison operation.
Iterator for term_appl.
term_appl_iterator operator++(int)
Postfix increment.
bool operator==(const term_appl_iterator &other) const
Equality of iterators.
term_appl_iterator operator-(ptrdiff_t n) const
Decrease by a constant value.
term_appl_iterator & operator--()
Prefix decrement.
ptrdiff_t operator-(const term_appl_iterator &other) const
The negative distance from this to the other iterator.
term_appl_iterator & operator++()
Prefix increment.
term_appl_iterator & operator-=(difference_type n)
Decrease the iterator with n steps.
const Term & operator[](difference_type n) const
The dereference operator.
term_appl_iterator operator+(ptrdiff_t n) const
Increase by a constant value.
friend term_appl_iterator< Derived > detail::aterm_appl_iterator_cast(term_appl_iterator< Base > a)
term_appl_iterator operator--(int)
Post decrement an iterator.
const Term * operator->() const
Dereference the current iterator.
term_appl_iterator & operator+=(difference_type n)
Increase the iterator with n steps.
const Term & operator*() const
The dereference operator.
term_appl_iterator(const Term *t)
Constructor.
ptrdiff_t distance_to(const term_appl_iterator &other) const
Provide the distance to the other iterator.
A unordered_map class in which aterms can be stored.
An unprotected term does not change the reference count of the shared term when it is copied or moved...
Definition aterm_core.h:34
bool type_is_list() const noexcept
Dynamic check whether the term is an aterm_list.
Definition aterm_core.h:75
void swap(unprotected_aterm_core &t) noexcept
Swaps this term with its argument.
Definition aterm_core.h:120
bool operator==(const unprotected_aterm_core &t) const
Comparison operator.
Definition aterm_core.h:87
unprotected_aterm_core() noexcept
Default constuctor.
Definition aterm_core.h:43
bool type_is_appl() const noexcept
Dynamic check whether the term is an aterm.
Definition aterm_core.h:57
bool defined() const
Returns true if this term is not equal to the term assigned by the default constructor of aterms,...
Definition aterm_core.h:111
friend detail::_aterm * detail::address(const unprotected_aterm_core &t)
const detail::_aterm * m_term
Definition aterm_core.h:38
const function_symbol & function() const
Yields the function symbol in an aterm.
Definition aterm_core.h:129
bool type_is_int() const noexcept
Dynamic check whether the term is an aterm_int.
Definition aterm_core.h:65
unprotected_aterm_core(const detail::_aterm *term) noexcept
Constructor.
Definition aterm_core.h:49
File output class.
Definition logger.h:316
void output(const log_level_t level, const time_t timestamp, const std::string &msg, const bool print_time_information) override
Definition logger.h:346
static void set_stream(FILE *stream)
Definition logger.h:332
~file_output() override=default
static std::atomic< FILE * > & get_stream()
Obtain the underlying stream used to print to a file.
Definition logger.h:319
static std::string format(const log_level_t level, const time_t timestamp, const std::string &msg, const bool print_time_information)
Format msg,.
Definition logger.h:257
Mixin that takes care of formatting of a message.
Definition logger.h:271
static std::atomic< std::size_t > & caret_pos()
Definition logger.h:290
static std::atomic< bool > & last_message_ended_with_newline()
Records whether the last message that was printed ended with a new line.
Definition logger.h:276
static std::atomic< std::size_t > & last_caret_pos()
Definition logger.h:297
static std::string format(log_level_t level, time_t timestamp, const std::string &msg, bool print_time_information)
Prefix each line in s with some extra information. The things that are added are:
Definition logger.cpp:33
static std::atomic< bool > & last_message_was_status()
Definition logger.h:283
Class for logging messages.
Definition logger.h:128
static void clear_report_time_info()
Indicate that timing information should not be printed.
Definition logger.h:228
static void unregister_output_policy(output_policy &policy)
Unregister output policy.
Definition logger.h:190
static void set_report_time_info()
Indicate that timing information should be printed.
Definition logger.h:222
log_level_t m_level
The loglevel of the current message.
Definition logger.h:135
static std::set< output_policy * > & output_policies()
Output policies.
Definition logger.h:155
static log_level_t get_reporting_level()
Get reporting level.
Definition logger.h:216
static void set_reporting_level(const log_level_t level)
Set reporting level.
Definition logger.h:209
std::ostringstream & get()
Get access to the stream provided by the logger.
Definition logger.h:241
logger(const log_level_t l)
Default constructor.
Definition logger.h:163
static void clear_output_policies()
Clear all output policies.
Definition logger.h:201
time_t m_timestamp
Timestamp of the current message.
Definition logger.h:138
static void register_output_policy(output_policy &policy)
Register output policy.
Definition logger.h:183
static std::atomic< bool > & m_print_time_information()
An indication whether time information should be printed.
Definition logger.h:147
~logger()
Destructor; flushes output. Flushing during destruction is important to confer thread safety to the l...
Definition logger.h:173
static bool get_report_time_info()
Get whether timing information is printed.
Definition logger.h:235
static std::atomic< log_level_t > & log_level()
Definition logger.h:140
std::ostringstream m_os
Stream that is printed to internally Collects the full debug message that we are currently printing.
Definition logger.h:132
Interface class for output policy.
Definition logger.h:101
virtual void output(log_level_t level, time_t timestamp, const std::string &msg, bool print_time_information)=0
Output message.
virtual ~output_policy()=default
Destructor.
output_policy()=default
Constructor.
Iterator over thread-local values.
void advance_to_next_present()
Scan forward from the current (bucket, index) position to the next present entry, caching it in m_cur...
Iter(const ThreadLocal *tl, bool begin)
bool operator!=(const Iter &other) const
bool operator==(const Iter &other) const
Per-object thread-local storage container.
const T * get_or(F &&create)
Get the thread-local value for the current thread, or create it if it doesn't exist.
static void deallocate_bucket(Entry *bucket_ptr, std::size_t)
Helper to deallocate a bucket.
static Entry * allocate_bucket(std::size_t size)
Helper to allocate a bucket.
T * get_or_mut(F &&create)
Get a mutable pointer to the thread-local value for the current thread, or create it.
const T * get() const
Get the thread-local value for the current thread, if it exists.
std::array< std::atomic< Entry * >, BUCKETS > buckets
const T * get_inner(const detail::ThreadBucket &thread) const
Get the value for the given thread, if it exists.
const T * get_or_try(F &&create)
Get the thread-local value for the current thread, or create it if it doesn't exist.
static constexpr std::size_t POINTER_WIDTH
Iter end() const
Get the end iterator.
static constexpr std::size_t BUCKETS
void for_each_mut(const F &func)
Apply func to every present thread-local value via a mutable reference.
Iter begin() const
Get an iterator over all thread-local values.
std::atomic< std::size_t > values_count
void clear()
Clear all thread-local values.
std::size_t size() const
Get the number of thread-local values (approximate).
~ThreadLocal()
Destructor that cleans up all allocated buckets.
ThreadLocal()
Create a new empty ThreadLocal container.
const T * insert(const detail::ThreadBucket &thread, T value)
Insert a value for the given thread.
Fixed-size block allocator compatible with the STL allocator interface.
static Entry * sentinel_ptr() noexcept
bool refill_local_free(LocalState &state)
std::size_t consolidate()
Removes empty blocks and returns the number of blocks removed.
T * allocate_new_block(LocalState &state)
void for_each_local_state(const F &func)
static constexpr std::size_t N
T * allocate(size_type n, const void *hint=nullptr)
A helper class to keep track of the number of hits and misses for cache-like data structures.
void reset()
Resets the cache counters.
void miss()
Should be called when searching the cache was a miss.
void hit()
Should be called when searching the cache was a hit.
Iterator over all keys in a bucket list.
bool operator!=(const key_iterator &it) const noexcept
reference operator*() const
Only allowed whenever it points to an actual node (not before_begin or end)
bool operator==(const key_iterator &it) const noexcept
operator key_iterator() const
Implicit conversion to const_iterator.
pointer operator->() const
Only allowed whenever it points to an actual node (not before_begin or end)
const node_base * get_node() const noexcept
The nodes of the bucket list without carrying any additional informations. Used to make no different ...
Definition bucket_list.h:50
std::atomic< node_base * > m_next
Pointer to the next node.
Definition bucket_list.h:73
void set_next(node_base *next) noexcept
Set the next pointer to the given next pointer.
Definition bucket_list.h:66
bool exchange(node_base *&expected, node_base *value)
Definition bucket_list.h:69
node(Args &&... args)
Constructs a key by using the given arguments.
Definition bucket_list.h:83
const Key & key() const noexcept
Definition bucket_list.h:89
This essentially implements the std::forward_list, with the difference that it does not own the nodes...
Definition bucket_list.h:44
void splice_after(const_iterator pos, bucket_list &other)
Moves the elements from other into this bucket after the given position.
iterator erase_after(NodeAllocator &allocator, const_iterator it)
Removes the element after the given iterator from the list. The returned iterator.
void clear(NodeAllocator &allocator)
Empties the bucket list.
const_iterator before_begin() const
std::pair< iterator, bool > emplace_front_unique(NodeAllocator &allocator, const Equals &equals, Args &&...args)
Constructs an element using the allocator with the given arguments and insert it in the front of the ...
void splice_front(const_iterator pos, bucket_list &other)
Moves the first node from the given bucket into this bucket after the given position.
node_base m_head
The first node in the bucket list.
void emplace_front(NodeAllocator &allocator, Args &&...args)
Constructs an element using the allocator with the given arguments and insert it in the front.
Inherit from this class to prevent it from being copyable.
Definition noncopyable.h:20
noncopyable & operator=(const noncopyable &)=delete
noncopyable & operator=(noncopyable &&)=default
noncopyable(const noncopyable &)=delete
noncopyable(noncopyable &&)=default
void unlock()
Release exclusive access.
std::atomic< bool > m_forbidden_flag
bool try_lock()
Try to obtain exclusive access without blocking on other exclusive locks.
std::atomic< bool > m_busy_flag
A boolean flag indicating whether this thread is working inside the global aterm pool.
void wait_for_busy() const
Waits for the busy flag to become false.
void lock_shared()
Acquires a shared lock on this mutex.
void unlock_shared()
Releases a shared lock on this mutex.
shared_mutex(const shared_mutex &other)
The copy/move constructor/assignment should not be called while any lock_guard or shared_guard is ali...
std::size_t m_lock_depth
It can happen that un/lock_shared calls are nested, so keep track of the nesting depth and only actua...
bool try_lock_shared()
Tries to acquire a shared lock on this mutex without blocking.
std::shared_ptr< shared_mutex_data > m_shared
shared_mutex & operator=(shared_mutex &&other) noexcept
shared_mutex & operator=(const shared_mutex &other)
shared_mutex(shared_mutex &&other) noexcept
void lock()
Obtain exclusive access, and stop all other threads that use this mutex.
Stores a reference count that can be incremented and decremented.
static void count_reference_count_changes()
Increment the number of reference count changes.
std::size_t reference_count() const
Obtain the reference count.
void increment_reference_count() const
Increment the reference count by one.
static std::atomic< std::size_t > & reference_count_changes()
Obtain the number of times that this reference count has changed.
void decrement_reference_count() const
Decrement the reference count by one.
A reference counted reference to a shared_reference_counted object.
bool operator==(const shared_reference< T > &other) const noexcept
Address equality operator.
shared_reference< T > & operator=(shared_reference< T > &&other) noexcept
Move assignment constructor.
bool defined() const
Check whether the shared_reference has a valid reference.
shared_reference() noexcept
The default constructor.
utilities::tagged_pointer< T > m_reference
shared_reference< T > & operator=(const shared_reference< T > &other) noexcept
Copy assignment constructor.
shared_reference(shared_reference< T > &&other) noexcept
Move constructor.
shared_reference(const shared_reference< T > &other) noexcept
Copy constructor.
shared_reference(T *reference) noexcept
Takes ownership of the passed reference, which means that its reference count is incremented.
void swap(shared_reference< T > &other) noexcept
Swaps *this with the other shared reference.
A pointer storage object that uses a least significant bit as a mark. Can be used by objects that are...
bool operator==(const tagged_pointer &other) const
bool operator==(std::nullptr_t) const
void untag() const
Remove the tag.
void swap(tagged_pointer< T > &other) noexcept
void tag() const
Apply a tag to the pointer that can be checked with tagged().
tagged_pointer & operator=(std::nullptr_t)
std::conditional_t< detail::GlobalThreadSafe, detail::atomic_wrapper< T * >, T * > m_pointer
A class for a map of keys to values in T based using the simple hash table set implementation.
An iterator over all elements in the unordered set.
unordered_set_iterator(bucket_it it, bucket_it end, key_it_type before_it, key_it_type key)
Construct an iterator over all keys passed in this bucket and all remaining buckets.
void goto_next_bucket()
Iterate to the next non-empty bucket.
unordered_set_iterator(bucket_it it)
Construct the end iterator.
unordered_set_iterator(bucket_it it, bucket_it end)
Construct the begin iterator (over all elements).
bool operator==(const unordered_set_iterator &other) const
bool operator!=(const unordered_set_iterator &other) const
A unordered_set with a subset of the interface of std::unordered_set that only stores a single pointe...
std::vector< std::mutex > m_bucket_mutexes
const_local_iterator cbegin(size_type n) const
const_local_iterator end(size_type n) const
void erase(const Args &... args)
Erases the given key_type(args...) from the unordered set.
const_iterator find_impl(size_type bucket_index, const Args &... args) const
Searches for the element in the given bucket.
const_local_iterator begin(size_type n) const
size_type count(const Args &... args) const
Counts the number of occurrences of the given key (1 when it exists and 0 otherwise).
size_type find_bucket_index(const Args &... args) const
std::vector< bucket_type > m_buckets
std::pair< iterator, bool > emplace_impl(size_type bucket_index, Args &&... args)
Inserts T(args...) into the given bucket, assumes that it did not exists before.
const_iterator cend() const
size_type bucket_count() const noexcept
bool empty() const noexcept
void erase_impl(const Args &... args)
Removes T(args...) from the set.
const_iterator begin() const
static constexpr bool allow_transparent
True iff the hash and equals functions allow transparent lookup,.
const_iterator end() const
std::conditional_t< ThreadSafe, std::atomic< size_type >, size_type > m_buckets_mask
Always equal to m_buckets.size() - 1.
size_type max_bucket_count() const noexcept
allocator_type & get_allocator() noexcept
std::pair< iterator, bool > emplace(Args &&... args)
Inserts an element Key(args...) into the set if it did not already exist.
void rehash_if_needed()
Resizes the hash table if necessary.
iterator find(const Args &... args)
bool rehash_is_needed() const
Checks whether a rehash is required.
const_iterator cbegin() const
std::conditional_t< ThreadSafe, std::atomic< size_type >, size_type > m_number_of_elements
The number of elements stored in this set.
size_type size() const noexcept
void clear()
Removes all elements from the set.
unordered_set(const unordered_set &set)
iterator erase(const_iterator it)
Erases the element pointed to by the iterator.
size_type max_size() const noexcept
void max_load_factor(float factor)
size_type bucket(const key_type &key) const noexcept
size_type capacity() const noexcept
local_iterator end(size_type n)
unordered_set(unordered_set &&other)=default
const_local_iterator cend(size_type n) const
const_iterator find(const Args &... args) const
Searches whether an object key_type(args...) occurs in the set.
void rehash(size_type number_of_buckets)
Resize the number buckets to at least number_of_buckets.
unordered_set & operator=(const unordered_set &set)
local_iterator begin(size_type n)
size_type bucket_size(size_type n) const noexcept
unordered_set(size_type bucket_count, const hasher &hash=hasher(), const key_equal &equals=key_equal())
Constructs an unordered_set that contains bucket_count number of buckets.
unordered_set & operator=(unordered_set &&other)=default
const allocator_type & get_allocator() const noexcept
void reserve(size_type count)
Resizes the set to the given number of elements.
Implements a simple stopwatch that starts on construction.
Definition stopwatch.h:17
#define mCRL2log(LEVEL)
mCRL2log(LEVEL) provides the stream used to log.
Definition logger.h:392
static constexpr bool EnableGarbageCollection
Enable garbage collection.
static constexpr bool EnableHashtableMetrics
Enable to print hashtable collision, size and number of buckets.
aterm_pool & g_term_pool()
obtain a reference to the global aterm pool.
void debug_print(std::ostream &o, const _aterm *t, std::size_t d=3)
bool equal_args(const _aterm_appl< 8 > &term, const Tp &... t)
Definition aterm_hash.h:383
void make_list_forward(term_list< Term > &result, Iter first, Iter last, ATermConverter convert_to_aterm)
Constructs a list starting from first to last. Each element is converted using the TermConverter.
static constexpr bool EnableCreationMetrics
Enable to obtain the percentage of terms found compared to allocated.
void make_list_forward(term_list< Term > &result, Iter first, Iter last, ATermConverter convert_to_aterm, ATermFilter aterm_filter)
Constructs a list traversing the iterator from first to last, putting the result in place in the vari...
function_symbol g_as_empty_list
term_list< Term > make_list_backward(Iter first, Iter last, ATermConverter convert_to_aterm, ATermFilter aterm_filter)
Constructs a list starting from first to last. The iterators are traversed backwards and each element...
std::size_t combine(const std::size_t hnr, const unprotected_aterm_core &term)
Auxiliary function to combine hnr with aterms.
Definition aterm_hash.h:160
term_list< Term > make_list_forward(Iter first, Iter last, ATermConverter convert_to_aterm)
Constructs a list starting from first to last. Each element is converted using the TermConverter.
function_symbol g_as_list
static constexpr bool EnableGarbageCollectionMetrics
Enable to print garbage collection statistics.
void start_gc_stress_thread()
Spawns a dedicated background thread that continuously triggers garbage collection.
term_list< Term > make_list_backward(Iter first, Iter last, ATermConverter convert_to_aterm)
Constructs a list starting from first to last. The iterators are traversed backwards and each element...
aterm_pool & g_aterm_pool_instance()
A reference to the global term pool storage.
static constexpr bool EnableAggressiveGarbageCollection
Performs garbage collection intensively for testing purposes.
term_list< Term > make_list_forward(Iter first, Iter last, ATermConverter convert_to_aterm, ATermFilter aterm_filter)
Constructs a list starting from first to last. Each element is converted using the TermConverter and ...
function_symbol g_as_int
These function symbols are used to indicate integer, list and empty list terms.
std::size_t combine_args(std::size_t seed, const Tp &... t)
Definition aterm_hash.h:254
static constexpr bool EnableBlockAllocator
Enable the block allocator for terms.
static std::size_t xorshift(const std::size_t n, const std::size_t i)
Definition aterm_hash.h:277
void make_list_backward(term_list< Term > &result, Iter first, Iter last, ATermConverter convert_to_aterm, ATermFilter aterm_filter)
Construct a list iterating from the last to the first element. Result is put in the variable result.
void make_list_backward(term_list< Term > &result, Iter first, Iter last, ATermConverter convert_to_aterm)
Constructs a list starting from first to last where the result is put in result.
static constexpr bool EnableVariableRegistrationMetrics
Keep track of the number of variables registered.
std::array< std::byte, sizeof(aterm_pool)> g_aterm_pool_storage
Storage for a global term pool that is not initialized.
term_appl_iterator< Derived > aterm_appl_iterator_cast(term_appl_iterator< Base > a)
This function can be used to translate an term_appl_iterator of one sort into another.
void mark_term(const _aterm &root, std::stack< std::reference_wrapper< _aterm > > &todo)
Marks a term and recursively all arguments that are not reachable.
static constexpr bool EnableGCStressThread
Spawns a dedicated background thread that continuously triggers garbage collection.
constexpr std::size_t DynamicNumberOfArguments
Indicates that the number of arguments is not known at compile time.
Definition aterm_hash.h:77
The main namespace for the aterm++ library.
std::string pp(const atermpp::aterm &t)
Transform an aterm to an ascii string.
Definition aterm.h:329
void add_deletion_hook(const function_symbol &, term_callback)
Check for reasonably sized aterm (32 bits, 4 bytes) This check might break on perfectly valid archite...
void make_term_appl(Term &target, const function_symbol &sym, ForwardIterator begin, ForwardIterator end)
Constructor an aterm in a variable based on a function symbol and an forward iterator providing the a...
Definition aterm.h:180
output_policy & default_output_policy()
The default output policy used by the logger.
Definition logger.h:366
log_level_t log_level_from_string(const std::string_view s)
Convert string to log level.
Definition logger.h:55
std::string_view log_level_to_string(const log_level_t level)
Convert log level to string This string is used to prefix messages in the logging output.
Definition logger.h:44
std::string format_time(const time_t *t)
Definition logger.cpp:18
std::set< output_policy * > initialise_output_policies()
Initialise the output policies. This returns the singleton set containing the default output policy.
Definition logger.h:375
log_level_t
Log levels that are supported.
Definition logger.h:30
@ warning
Definition logger.h:33
@ verbose
Definition logger.h:36
bool mCRL2logEnabled(const log_level_t level)
Definition logger.h:383
std::size_t hash_combine(const std::size_t h1, const std::size_t h2)
static constexpr Sentinel EndIterator
A end of the iterator sentinel.
Definition bucket_list.h:24
auto allocate(Allocator &allocator, const Args &... args) -> decltype(allocator.allocate_args(args...))
A compile time check for allocate_args in the given allocator, calls allocate(1) otherwise.
Definition bucket_list.h:28
static constexpr bool GlobalThreadSafe
Enables thread safety for the whole toolset.
static constexpr std::size_t FreeChunkSize
Number of entries per shared free chunk handed between threads.
std::size_t hash_combine_cheap(const std::size_t seed, const std::size_t hash_number)
Auxiliary function to combine seed with a hash number.
static constexpr uintptr_t BlockAllocSentinel
Sentinel written to next to identify freed entries during consolidation.
std::size_t get_thread_id()
Get a unique identifier for the current thread.
float bytes_to_megabytes(std::size_t bytes)
std::string string_join(const Container &c, const std::string &separator)
Joins a sequence of strings. This is a replacement for boost::algorithm::join, since it gives stack o...
static constexpr std::size_t minimum_size
static constexpr long BucketsPerMutex
Number of buckets per mutex.
void number2string(std::size_t number, std::string &buffer, std::size_t start_position)
Convert a number to a string in the buffer starting at position start_position.
T * tag(const T *p)
Applies a tag to a pointer.
std::vector< std::string > split_paragraphs(const std::string &text)
Split a string into paragraphs.
std::string read_text(std::istream &in)
Read text from a stream.
bool tagged(const T *p)
void trim(std::string &text)
Remove all trailing and leading spaces from the input.
std::string regex_replace(const std::string &src, const std::string &dest, const std::string &text)
Regular expression replacement in a string.
T * pointer(const detail::atomic_wrapper< T * > &p)
T * pointer(const T *p)
std::string read_text(const std::string &filename, bool warn=false)
Read text from a file.
std::string word_wrap_text(const std::string &text, unsigned int max_line_length=78)
Apply word wrapping to a text.
bool is_numeric_string(const std::string &s)
Test if a string is a number.
std::string to_string(const T &x)
Transform parameter into string.
T * tag(const detail::atomic_wrapper< T * > &p)
std::vector< std::string > regex_split(const std::string &text, const std::string &sep)
Split a string using a regular expression separator.
std::string remove_comments(const std::string &text)
Remove comments from a text (everything from '' until end of line).
constexpr bool is_iterable_v
Definition type_traits.h:51
std::string trim_copy(const std::string &text)
Remove all trailing and leading spaces from the input.
static constexpr bool EnableLockfreeInsertion
Enables lockfree implementation of emplace.
std::string remove_whitespace(const std::string &text)
Removes whitespace from a string.
static constexpr bool EnableReferenceCountMetrics
Enable to count the number of reference count changes.
std::string number2string(std::size_t number)
Convert a number to string.
std::vector< std::string > split(const std::string &line, const std::string &separators)
Split the text.
void print_performance_statistics(const T &unordered_set)
Prints various information for unordered_set like data structures.
bool tagged(const detail::atomic_wrapper< T * > &p)
constexpr bool is_iterator_v
Definition type_traits.h:54
void swap(atermpp::aterm &t1, atermpp::aterm &t2) noexcept
Swaps two term_applss.
Definition aterm.h:364
void swap(mcrl2::utilities::shared_reference< T > &a, mcrl2::utilities::shared_reference< T > &b) noexcept
void swap(atermpp::unprotected_aterm_core &t1, atermpp::unprotected_aterm_core &t2) noexcept
Swaps two aterms.
Definition aterm.h:351
int main(int argc, char *argv[])
bool operator()(const _aterm &term, const function_symbol &symbol, const Args &... args) const noexcept
Definition aterm_hash.h:391
bool operator()(const _aterm &term, const function_symbol &symbol, std::array< unprotected_aterm_core, N > key) const noexcept
Returns true iff first and second are value-equivalent.
Definition aterm_hash.h:124
bool operator()(const _aterm &first, const _aterm &second) const noexcept
Definition aterm_hash.h:290
bool operator()(const _aterm &term, const function_symbol &symbol) const noexcept
Definition aterm_hash.h:315
bool operator()(const _aterm &term, const function_symbol &symbol, unprotected_aterm_core *arguments) const noexcept
Definition aterm_hash.h:321
Computes the hash of the given term.
Definition aterm_hash.h:100
std::size_t operator()(const function_symbol &symbol, const Args &... args) const noexcept
Definition aterm_hash.h:262
std::size_t operator()(const function_symbol &symbol, std::array< unprotected_aterm_core, N > key) const noexcept
Computes the hash of the given term.
Definition aterm_hash.h:84
std::size_t operator()(const function_symbol &symbol) const noexcept
Definition aterm_hash.h:187
std::size_t operator()(const _aterm &term) const noexcept
Implementation.
Definition aterm_hash.h:169
std::size_t operator()(const function_symbol &symbol, unprotected_aterm_core *arguments) const noexcept
Definition aterm_hash.h:194
Returns true iff the given term(s) or value are equivalent.
Definition aterm_hash.h:151
bool operator()(const _aterm_int &term, std::size_t value) const noexcept
Definition aterm_hash.h:401
bool operator()(const _aterm_int &first, const _aterm_int &second) const noexcept
Definition aterm_hash.h:396
Computes the hash of the integral term arguments.
Definition aterm_hash.h:112
std::size_t operator()(const _aterm_int &term) const noexcept
Definition aterm_hash.h:270
std::size_t operator()(std::size_t value) const noexcept
Definition aterm_hash.h:282
void operator()(Term &result, const Term &t) const
Definition aterm_list.h:35
const Term & operator()(const Term &t) const
Definition aterm_list.h:40
Term & operator()(Term &t) const
Definition aterm_list.h:45
True iff the given function symbols are equal to eachother or to the given key.
bool operator()(const _function_symbol &first, const _function_symbol &second) const noexcept
Computes the hash for given function symbol objects and for the function_symbol_key.
std::size_t operator()(const _function_symbol &symbol) const noexcept
The shared block list and free chunks. Protected by the allocator mutex.
BlockList(BlockList &&)=default
BlockList & operator=(BlockList &&)=default
std::vector< BlockEntry< T > * > free_chunks
Heads of linked chains of freed entries available for redistribution.
A fixed-size block of N entries linked in a singly-linked list.
std::array< BlockEntry< T >, N > data
Entry in the thread-local bucket.
std::atomic< bool > present
std::array< std::byte, sizeof(T)> value
Information about a thread's position in the bucket structure.
std::size_t bucket_size
Size of the current bucket.
ThreadBucket(std::size_t thread_id)
std::size_t bucket
Which bucket this thread's entry is in.
std::size_t index
Index within the bucket.
std::size_t id
Unique thread identifier.
Per-thread allocation state: current bump block and thread-local freelist.
std::size_t bump_offset
N or greater means the block is exhausted.
atomic_wrapper & operator=(const atomic_wrapper< T > &other)
atomic_wrapper(const atomic_wrapper< T > &other)
No-op mutex used when ThreadSafe=false.
Checks whether condition holds for all types passed as variadic template.
Definition type_traits.h:43
A typetrait that is std::true_type iff std::begin() and std::end() can be called on type T.
Definition type_traits.h:22
A typetrait that is std::true_type iff the given type has the iterator traits.
Definition type_traits.h:38
std::mutex mutex
Mutex for adding/removing shared_guards.
void unregister_mutex(shared_mutex *shared_mutex)
void register_mutex(shared_mutex *shared_mutex)
Adds a shared mutex to the data.
std::vector< shared_mutex * > other
The list of other mutexes.
std::size_t operator()(const atermpp::aterm &t) const
Definition aterm.h:373
std::size_t operator()(const atermpp::aterm_core &t) const
Definition aterm_hash.h:63
std::size_t operator()(const atermpp::detail::_aterm *term) const
Definition aterm_hash.h:29
std::size_t operator()(const atermpp::detail::_function_symbol &f) const
std::size_t operator()(const atermpp::function_symbol &f) const
std::size_t operator()(const atermpp::unprotected_aterm_core &term) const
Definition aterm_hash.h:52
std::size_t operator()(const mcrl2::utilities::tagged_pointer< T > &p) const
std::size_t operator()(const std::pair< X, Y > &p) const
std::size_t operator()(const std::vector< X > &v) const
Union entry: active as value while live, as next while on a freelist.
#define MCRL2_UNORDERED_SET_CLASS
#define MCRL2_UNORDERED_SET_TEMPLATES