]>
git.proxmox.com Git - rustc.git/blob - vendor/crossbeam-epoch-0.8.2/src/epoch.rs
3 //! The last bit in this number is unused and is always zero. Every so often the global epoch is
4 //! incremented, i.e. we say it "advances". A pinned participant may advance the global epoch only
5 //! if all currently pinned participants have been pinned in the current epoch.
7 //! If an object became garbage in some epoch, then we can be sure that after two advancements no
8 //! participant will hold a reference to it. That is the crux of safe memory reclamation.
10 use core
::sync
::atomic
::{AtomicUsize, Ordering}
;
12 /// An epoch that can be marked as pinned or unpinned.
14 /// Internally, the epoch is represented as an integer that wraps around at some unspecified point
15 /// and a flag that represents whether it is pinned or unpinned.
16 #[derive(Copy, Clone, Default, Debug, Eq, PartialEq)]
18 /// The least significant bit is set if pinned. The rest of the bits hold the epoch.
23 /// Returns the starting epoch in unpinned state.
25 pub fn starting() -> Self {
29 /// Returns the number of epochs `self` is ahead of `rhs`.
31 /// Internally, epochs are represented as numbers in the range `(isize::MIN / 2) .. (isize::MAX
32 /// / 2)`, so the returned distance will be in the same interval.
33 pub fn wrapping_sub(self, rhs
: Self) -> isize {
34 // The result is the same with `(self.data & !1).wrapping_sub(rhs.data & !1) as isize >> 1`,
35 // because the possible difference of LSB in `(self.data & !1).wrapping_sub(rhs.data & !1)`
36 // will be ignored in the shift operation.
37 self.data
.wrapping_sub(rhs
.data
& !1) as isize >> 1
40 /// Returns `true` if the epoch is marked as pinned.
42 pub fn is_pinned(self) -> bool
{
46 /// Returns the same epoch, but marked as pinned.
48 pub fn pinned(self) -> Epoch
{
54 /// Returns the same epoch, but marked as unpinned.
56 pub fn unpinned(self) -> Epoch
{
62 /// Returns the successor epoch.
64 /// The returned epoch will be marked as pinned only if the previous one was as well.
66 pub fn successor(self) -> Epoch
{
68 data
: self.data
.wrapping_add(2),
73 /// An atomic value that holds an `Epoch`.
74 #[derive(Default, Debug)]
75 pub struct AtomicEpoch
{
76 /// Since `Epoch` is just a wrapper around `usize`, an `AtomicEpoch` is similarly represented
77 /// using an `AtomicUsize`.
82 /// Creates a new atomic epoch.
84 pub fn new(epoch
: Epoch
) -> Self {
85 let data
= AtomicUsize
::new(epoch
.data
);
89 /// Loads a value from the atomic epoch.
91 pub fn load(&self, ord
: Ordering
) -> Epoch
{
93 data
: self.data
.load(ord
),
97 /// Stores a value into the atomic epoch.
99 pub fn store(&self, epoch
: Epoch
, ord
: Ordering
) {
100 self.data
.store(epoch
.data
, ord
);
103 /// Stores a value into the atomic epoch if the current value is the same as `current`.
105 /// The return value is always the previous value. If it is equal to `current`, then the value
108 /// The `Ordering` argument describes the memory ordering of this operation.
110 pub fn compare_and_swap(&self, current
: Epoch
, new
: Epoch
, ord
: Ordering
) -> Epoch
{
111 let data
= self.data
.compare_and_swap(current
.data
, new
.data
, ord
);