xref: /linux/rust/kernel/sync/aref.rs (revision 23b0f90ba871f096474e1c27c3d14f455189d2d9)
1 // SPDX-License-Identifier: GPL-2.0
2 
3 //! Internal reference counting support.
4 //!
5 //! Many C types already have their own reference counting mechanism (e.g. by storing a
6 //! `refcount_t`). This module provides support for directly using their internal reference count
7 //! from Rust; instead of making users have to use an additional Rust-reference count in the form of
8 //! [`Arc`].
9 //!
10 //! The smart pointer [`ARef<T>`] acts similarly to [`Arc<T>`] in that it holds a refcount on the
11 //! underlying object, but this refcount is internal to the object. It essentially is a Rust
12 //! implementation of the `get_` and `put_` pattern used in C for reference counting.
13 //!
14 //! To make use of [`ARef<MyType>`], `MyType` needs to implement [`AlwaysRefCounted`]. It is a trait
15 //! for accessing the internal reference count of an object of the `MyType` type.
16 //!
17 //! [`Arc`]: crate::sync::Arc
18 //! [`Arc<T>`]: crate::sync::Arc
19 
20 use core::{marker::PhantomData, mem::ManuallyDrop, ops::Deref, ptr::NonNull};
21 
22 /// Types that are _always_ reference counted.
23 ///
24 /// It allows such types to define their own custom ref increment and decrement functions.
25 /// Additionally, it allows users to convert from a shared reference `&T` to an owned reference
26 /// [`ARef<T>`].
27 ///
28 /// This is usually implemented by wrappers to existing structures on the C side of the code. For
29 /// Rust code, the recommendation is to use [`Arc`](crate::sync::Arc) to create reference-counted
30 /// instances of a type.
31 ///
32 /// # Safety
33 ///
34 /// Implementers must ensure that increments to the reference count keep the object alive in memory
35 /// at least until matching decrements are performed.
36 ///
37 /// Implementers must also ensure that all instances are reference-counted. (Otherwise they
38 /// won't be able to honour the requirement that [`AlwaysRefCounted::inc_ref`] keep the object
39 /// alive.)
40 pub unsafe trait AlwaysRefCounted {
41     /// Increments the reference count on the object.
42     fn inc_ref(&self);
43 
44     /// Decrements the reference count on the object.
45     ///
46     /// Frees the object when the count reaches zero.
47     ///
48     /// # Safety
49     ///
50     /// Callers must ensure that there was a previous matching increment to the reference count,
51     /// and that the object is no longer used after its reference count is decremented (as it may
52     /// result in the object being freed), unless the caller owns another increment on the refcount
53     /// (e.g., it calls [`AlwaysRefCounted::inc_ref`] twice, then calls
54     /// [`AlwaysRefCounted::dec_ref`] once).
55     unsafe fn dec_ref(obj: NonNull<Self>);
56 }
57 
58 /// An owned reference to an always-reference-counted object.
59 ///
60 /// The object's reference count is automatically decremented when an instance of [`ARef`] is
61 /// dropped. It is also automatically incremented when a new instance is created via
62 /// [`ARef::clone`].
63 ///
64 /// # Invariants
65 ///
66 /// The pointer stored in `ptr` is non-null and valid for the lifetime of the [`ARef`] instance. In
67 /// particular, the [`ARef`] instance owns an increment on the underlying object's reference count.
68 pub struct ARef<T: AlwaysRefCounted> {
69     ptr: NonNull<T>,
70     _p: PhantomData<T>,
71 }
72 
73 // SAFETY: It is safe to send `ARef<T>` to another thread when the underlying `T` is `Sync` because
74 // it effectively means sharing `&T` (which is safe because `T` is `Sync`); additionally, it needs
75 // `T` to be `Send` because any thread that has an `ARef<T>` may ultimately access `T` using a
76 // mutable reference, for example, when the reference count reaches zero and `T` is dropped.
77 unsafe impl<T: AlwaysRefCounted + Sync + Send> Send for ARef<T> {}
78 
79 // SAFETY: It is safe to send `&ARef<T>` to another thread when the underlying `T` is `Sync`
80 // because it effectively means sharing `&T` (which is safe because `T` is `Sync`); additionally,
81 // it needs `T` to be `Send` because any thread that has a `&ARef<T>` may clone it and get an
82 // `ARef<T>` on that thread, so the thread may ultimately access `T` using a mutable reference, for
83 // example, when the reference count reaches zero and `T` is dropped.
84 unsafe impl<T: AlwaysRefCounted + Sync + Send> Sync for ARef<T> {}
85 
86 // Even if `T` is pinned, pointers to `T` can still move.
87 impl<T: AlwaysRefCounted> Unpin for ARef<T> {}
88 
89 impl<T: AlwaysRefCounted> ARef<T> {
90     /// Creates a new instance of [`ARef`].
91     ///
92     /// It takes over an increment of the reference count on the underlying object.
93     ///
94     /// # Safety
95     ///
96     /// Callers must ensure that the reference count was incremented at least once, and that they
97     /// are properly relinquishing one increment. That is, if there is only one increment, callers
98     /// must not use the underlying object anymore -- it is only safe to do so via the newly
99     /// created [`ARef`].
100     pub unsafe fn from_raw(ptr: NonNull<T>) -> Self {
101         // INVARIANT: The safety requirements guarantee that the new instance now owns the
102         // increment on the refcount.
103         Self {
104             ptr,
105             _p: PhantomData,
106         }
107     }
108 
109     /// Consumes the `ARef`, returning a raw pointer.
110     ///
111     /// This function does not change the refcount. After calling this function, the caller is
112     /// responsible for the refcount previously managed by the `ARef`.
113     ///
114     /// # Examples
115     ///
116     /// ```
117     /// use core::ptr::NonNull;
118     /// use kernel::sync::aref::{ARef, AlwaysRefCounted};
119     ///
120     /// struct Empty {}
121     ///
122     /// # // SAFETY: TODO.
123     /// unsafe impl AlwaysRefCounted for Empty {
124     ///     fn inc_ref(&self) {}
125     ///     unsafe fn dec_ref(_obj: NonNull<Self>) {}
126     /// }
127     ///
128     /// let mut data = Empty {};
129     /// let ptr = NonNull::<Empty>::new(&mut data).unwrap();
130     /// # // SAFETY: TODO.
131     /// let data_ref: ARef<Empty> = unsafe { ARef::from_raw(ptr) };
132     /// let raw_ptr: NonNull<Empty> = ARef::into_raw(data_ref);
133     ///
134     /// assert_eq!(ptr, raw_ptr);
135     /// ```
136     pub fn into_raw(me: Self) -> NonNull<T> {
137         ManuallyDrop::new(me).ptr
138     }
139 }
140 
141 impl<T: AlwaysRefCounted> Clone for ARef<T> {
142     fn clone(&self) -> Self {
143         self.inc_ref();
144         // SAFETY: We just incremented the refcount above.
145         unsafe { Self::from_raw(self.ptr) }
146     }
147 }
148 
149 impl<T: AlwaysRefCounted> Deref for ARef<T> {
150     type Target = T;
151 
152     fn deref(&self) -> &Self::Target {
153         // SAFETY: The type invariants guarantee that the object is valid.
154         unsafe { self.ptr.as_ref() }
155     }
156 }
157 
158 impl<T: AlwaysRefCounted> From<&T> for ARef<T> {
159     fn from(b: &T) -> Self {
160         b.inc_ref();
161         // SAFETY: We just incremented the refcount above.
162         unsafe { Self::from_raw(NonNull::from(b)) }
163     }
164 }
165 
166 impl<T: AlwaysRefCounted> Drop for ARef<T> {
167     fn drop(&mut self) {
168         // SAFETY: The type invariants guarantee that the `ARef` owns the reference we're about to
169         // decrement.
170         unsafe { T::dec_ref(self.ptr) };
171     }
172 }
173