6 releases
Uses old Rust 2015
0.3.0 | Aug 16, 2023 |
---|---|
0.2.1 | Aug 16, 2023 |
0.1.10 | Feb 28, 2023 |
#542 in Concurrency
115KB
2K
SLoC
BackdropArc
An Arc (atomically reference counted smart pointer) that supports customized dropping strategies using backdrop.
backdrop_arc::Arc<T, BackdropStrategy>
works very much like a std::sync::Arc<T>
, except for two differences:
1. Drop strategies
When the last clone of a particular Arc goes out of scope, rather than dropping normally, the particular BackdropStrategy is invoked. This way, dropping large or complex structures can be done in a background thread, background tokio task, delayed until later, etc.
This allows better reasoning about how long code using an Arc will take, since this is no longer dependent on 'do I own the last Arc or not?'.
An backdrop_arc::Arc<T, S>
behaves much like a Arc<backdrop::Backdrop<Box<T>, S>>
,
in that the backdrop strategy is executed when the last Arc clone goes out of scope.
The difference with Arc<backdrop::Backdrop<Box<T>, S>>
is that there is no double pointer-indirection (arc -> box -> T), managing the allocated T
is done directly in the Arc.
2. No weak pointers => smaller arcs, predictable drop behaviour
std::sync::Arc<T>
allows the usage of weak pointers. This is very helpful internally in self-referential structures (trees, graphs) but frequently not needed.
On the other hand, weak pointers are not 'free':
- They make every Arc instance bigger (3 words instead of 2), since instead of storing
(ptr, reference_count)
they need to store(ptr, reference_count, weak_reference_count)
. - They make dropping an
Arc<T>
more complex. The 'drop glue' ofT
will run once the last strong reference goes out of scope. But to not make Weak pointers dangle, the deallocation ofT
only happens when the lastWeak
pointer goes out of scope (see here). As you can imagine, this 'two part drop' interacts badly withBackdropStrategy
where we want to e.g. move objects to a background thread on drop, because we need to make sure that the allocation ofT
lives long enough.
Therefore, backdrop_arc
is modeled on the excellent triomphe
library.
Converting a backdrop_arc::Arc
to and from a triomphe::Arc
is a zero-cost operation, as the two types are guaranteed to have the same representation in memory.
(The same holds true for backdrop_arc::UniqueArc
<-> triomphe::UniqueArc
)
Not supporting weak pointers enables a bunch of other features:
backdrop_arc::Arc
does not need any read-modify-update operations to handle the possibility of weak references.backdrop_arc::UniqueArc
allows one to construct a temporarily-mutable Arc which can be converted to a regularbackdrop_arc::Arc
later.backdrop_arc::OffsetArc
can be used transparently from C++ code and is compatible with (and can be converted to/from)backdrop_arc::Arc
.backdrop_arc::ArcBorrow
is functionally similar to&backdrop_arc::Arc<T>
, however in memory it's simply&T
. This makes it more flexible for FFI; the source of the borrow need not be an Arc pinned on the stack (and can instead be a pointer from C++, or anOffsetArc
). Additionally, this helps avoid pointer-chasing.backdrop_arc::Arc
has can be constructed for dynamically-sized types viafrom_header_and_iter
backdrop_arc::ArcUnion
is union of twobackdrop_arc:Arc
s which fits inside one word of memory
Features
backdrop_arc
supports no_std environments, as long asalloc
is available, by disabling the (enabled by default)std
feature.serde
: Enables serialization/deserialization with theserde
crate.stable_deref_trait
: Implements theStableDeref
trait from thestable_deref_trait
crate forbackdrop_arc::Arc
.arc-swap
: Usebackdrop_arc::Arc
together with thearc-swap
crate.triomphe
: Convert (zero-cost) betweentriomphe::Arc
<->backdrop_arc::Arc
(andbackdrop_arc::UniqueArc
<->triomphe::UniqueArc
).unsize
usebackdrop_arc::Arc
together with theunsize
crate.yoke
: Implements theCloneableCart
trait from the theyoke
crate forbackdrop_arc::Arc
, making it easier to use in zero-copy serialization scenarios.
Attribution
The source code of backdrop_arc
is very heavily based on (and originally a fork of) triomphe
,
which itself originates from servo_arc
.
MSRV
The Minimum Supported Rust Version of backdrop_arc is Rust 1.56.1, because backdrop
uses the edition 2021 Rust syntax.
There are no (required) Rust features or (required) dependencies besides backdrop
, making this a very lightweight and portable crate.
Changelog
- 0.3.0:
- Replace
Arc::clone_many
with a much more friendly implementation + signature, returning a new iterator type.
- Replace
- 0.2.0:
- Adds optional support for
yoke
(to use abackdrop_arc::Arc
as ayoke::CloneableCart
). Enable with theyoke
feature. - Adds
Arc::clone_many
andArc::clone_many_into_slice
, allowing you to clone an Arc many times at once with only a single atomic barrier.
- Adds optional support for
- 0.1.x: Initial version
Dependencies
~35–300KB