blob: cec9b57f89112997349375f537e30384ab237f66 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
|
// boost lockfree
//
// Copyright (C) 2011 Tim Blechmann
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#ifndef BOOST_LOCKFREE_POLICIES_HPP_INCLUDED
#define BOOST_LOCKFREE_POLICIES_HPP_INCLUDED
#include <boost/parameter.hpp>
#include <boost/mpl/bool.hpp>
#include <boost/mpl/size_t.hpp>
#include <boost/mpl/void.hpp>
namespace boost {
namespace lockfree {
#ifndef BOOST_DOXYGEN_INVOKED
namespace tag { struct allocator ; }
namespace tag { struct fixed_sized; }
namespace tag { struct capacity; }
#endif
/** Configures a data structure as \b fixed-sized.
*
* The internal nodes are stored inside an array and they are addressed by array indexing. This limits the possible size of the
* queue to the number of elements that can be addressed by the index type (usually 2**16-2), but on platforms that lack
* double-width compare-and-exchange instructions, this is the best way to achieve lock-freedom.
* This implies that a data structure is bounded.
* */
template <bool IsFixedSized>
struct fixed_sized:
boost::parameter::template_keyword<tag::fixed_sized, boost::mpl::bool_<IsFixedSized> >
{};
/** Sets the \b capacity of a data structure at compile-time.
*
* This implies that a data structure is bounded and fixed-sized.
* */
template <size_t Size>
struct capacity:
boost::parameter::template_keyword<tag::capacity, boost::mpl::size_t<Size> >
{};
/** Defines the \b allocator type of a data structure.
* */
template <class Alloc>
struct allocator:
boost::parameter::template_keyword<tag::allocator, Alloc>
{};
}
}
#endif /* BOOST_LOCKFREE_POLICIES_HPP_INCLUDED */
|
