1 // SPDX-License-Identifier: GPL-2.0 2 3 //! Kernel types. 4 5 use crate::init::{self, PinInit}; 6 use core::{ 7 cell::UnsafeCell, 8 marker::{PhantomData, PhantomPinned}, 9 mem::{ManuallyDrop, MaybeUninit}, 10 ops::{Deref, DerefMut}, 11 ptr::NonNull, 12 }; 13 14 /// Used to transfer ownership to and from foreign (non-Rust) languages. 15 /// 16 /// Ownership is transferred from Rust to a foreign language by calling [`Self::into_foreign`] and 17 /// later may be transferred back to Rust by calling [`Self::from_foreign`]. 18 /// 19 /// This trait is meant to be used in cases when Rust objects are stored in C objects and 20 /// eventually "freed" back to Rust. 21 pub trait ForeignOwnable: Sized { 22 /// Type of values borrowed between calls to [`ForeignOwnable::into_foreign`] and 23 /// [`ForeignOwnable::from_foreign`]. 24 type Borrowed<'a>; 25 26 /// Converts a Rust-owned object to a foreign-owned one. 27 /// 28 /// The foreign representation is a pointer to void. There are no guarantees for this pointer. 29 /// For example, it might be invalid, dangling or pointing to uninitialized memory. Using it in 30 /// any way except for [`ForeignOwnable::from_foreign`], [`ForeignOwnable::borrow`], 31 /// [`ForeignOwnable::try_from_foreign`] can result in undefined behavior. 32 fn into_foreign(self) -> *const crate::ffi::c_void; 33 34 /// Borrows a foreign-owned object. 35 /// 36 /// # Safety 37 /// 38 /// `ptr` must have been returned by a previous call to [`ForeignOwnable::into_foreign`] for 39 /// which a previous matching [`ForeignOwnable::from_foreign`] hasn't been called yet. 40 unsafe fn borrow<'a>(ptr: *const crate::ffi::c_void) -> Self::Borrowed<'a>; 41 42 /// Converts a foreign-owned object back to a Rust-owned one. 43 /// 44 /// # Safety 45 /// 46 /// `ptr` must have been returned by a previous call to [`ForeignOwnable::into_foreign`] for 47 /// which a previous matching [`ForeignOwnable::from_foreign`] hasn't been called yet. 48 /// Additionally, all instances (if any) of values returned by [`ForeignOwnable::borrow`] for 49 /// this object must have been dropped. 50 unsafe fn from_foreign(ptr: *const crate::ffi::c_void) -> Self; 51 52 /// Tries to convert a foreign-owned object back to a Rust-owned one. 53 /// 54 /// A convenience wrapper over [`ForeignOwnable::from_foreign`] that returns [`None`] if `ptr` 55 /// is null. 56 /// 57 /// # Safety 58 /// 59 /// `ptr` must either be null or satisfy the safety requirements for 60 /// [`ForeignOwnable::from_foreign`]. 61 unsafe fn try_from_foreign(ptr: *const crate::ffi::c_void) -> Option<Self> { 62 if ptr.is_null() { 63 None 64 } else { 65 // SAFETY: Since `ptr` is not null here, then `ptr` satisfies the safety requirements 66 // of `from_foreign` given the safety requirements of this function. 67 unsafe { Some(Self::from_foreign(ptr)) } 68 } 69 } 70 } 71 72 impl ForeignOwnable for () { 73 type Borrowed<'a> = (); 74 75 fn into_foreign(self) -> *const crate::ffi::c_void { 76 core::ptr::NonNull::dangling().as_ptr() 77 } 78 79 unsafe fn borrow<'a>(_: *const crate::ffi::c_void) -> Self::Borrowed<'a> {} 80 81 unsafe fn from_foreign(_: *const crate::ffi::c_void) -> Self {} 82 } 83 84 /// Runs a cleanup function/closure when dropped. 85 /// 86 /// The [`ScopeGuard::dismiss`] function prevents the cleanup function from running. 87 /// 88 /// # Examples 89 /// 90 /// In the example below, we have multiple exit paths and we want to log regardless of which one is 91 /// taken: 92 /// 93 /// ``` 94 /// # use kernel::types::ScopeGuard; 95 /// fn example1(arg: bool) { 96 /// let _log = ScopeGuard::new(|| pr_info!("example1 completed\n")); 97 /// 98 /// if arg { 99 /// return; 100 /// } 101 /// 102 /// pr_info!("Do something...\n"); 103 /// } 104 /// 105 /// # example1(false); 106 /// # example1(true); 107 /// ``` 108 /// 109 /// In the example below, we want to log the same message on all early exits but a different one on 110 /// the main exit path: 111 /// 112 /// ``` 113 /// # use kernel::types::ScopeGuard; 114 /// fn example2(arg: bool) { 115 /// let log = ScopeGuard::new(|| pr_info!("example2 returned early\n")); 116 /// 117 /// if arg { 118 /// return; 119 /// } 120 /// 121 /// // (Other early returns...) 122 /// 123 /// log.dismiss(); 124 /// pr_info!("example2 no early return\n"); 125 /// } 126 /// 127 /// # example2(false); 128 /// # example2(true); 129 /// ``` 130 /// 131 /// In the example below, we need a mutable object (the vector) to be accessible within the log 132 /// function, so we wrap it in the [`ScopeGuard`]: 133 /// 134 /// ``` 135 /// # use kernel::types::ScopeGuard; 136 /// fn example3(arg: bool) -> Result { 137 /// let mut vec = 138 /// ScopeGuard::new_with_data(KVec::new(), |v| pr_info!("vec had {} elements\n", v.len())); 139 /// 140 /// vec.push(10u8, GFP_KERNEL)?; 141 /// if arg { 142 /// return Ok(()); 143 /// } 144 /// vec.push(20u8, GFP_KERNEL)?; 145 /// Ok(()) 146 /// } 147 /// 148 /// # assert_eq!(example3(false), Ok(())); 149 /// # assert_eq!(example3(true), Ok(())); 150 /// ``` 151 /// 152 /// # Invariants 153 /// 154 /// The value stored in the struct is nearly always `Some(_)`, except between 155 /// [`ScopeGuard::dismiss`] and [`ScopeGuard::drop`]: in this case, it will be `None` as the value 156 /// will have been returned to the caller. Since [`ScopeGuard::dismiss`] consumes the guard, 157 /// callers won't be able to use it anymore. 158 pub struct ScopeGuard<T, F: FnOnce(T)>(Option<(T, F)>); 159 160 impl<T, F: FnOnce(T)> ScopeGuard<T, F> { 161 /// Creates a new guarded object wrapping the given data and with the given cleanup function. 162 pub fn new_with_data(data: T, cleanup_func: F) -> Self { 163 // INVARIANT: The struct is being initialised with `Some(_)`. 164 Self(Some((data, cleanup_func))) 165 } 166 167 /// Prevents the cleanup function from running and returns the guarded data. 168 pub fn dismiss(mut self) -> T { 169 // INVARIANT: This is the exception case in the invariant; it is not visible to callers 170 // because this function consumes `self`. 171 self.0.take().unwrap().0 172 } 173 } 174 175 impl ScopeGuard<(), fn(())> { 176 /// Creates a new guarded object with the given cleanup function. 177 pub fn new(cleanup: impl FnOnce()) -> ScopeGuard<(), impl FnOnce(())> { 178 ScopeGuard::new_with_data((), move |()| cleanup()) 179 } 180 } 181 182 impl<T, F: FnOnce(T)> Deref for ScopeGuard<T, F> { 183 type Target = T; 184 185 fn deref(&self) -> &T { 186 // The type invariants guarantee that `unwrap` will succeed. 187 &self.0.as_ref().unwrap().0 188 } 189 } 190 191 impl<T, F: FnOnce(T)> DerefMut for ScopeGuard<T, F> { 192 fn deref_mut(&mut self) -> &mut T { 193 // The type invariants guarantee that `unwrap` will succeed. 194 &mut self.0.as_mut().unwrap().0 195 } 196 } 197 198 impl<T, F: FnOnce(T)> Drop for ScopeGuard<T, F> { 199 fn drop(&mut self) { 200 // Run the cleanup function if one is still present. 201 if let Some((data, cleanup)) = self.0.take() { 202 cleanup(data) 203 } 204 } 205 } 206 207 /// Stores an opaque value. 208 /// 209 /// `Opaque<T>` is meant to be used with FFI objects that are never interpreted by Rust code. 210 /// 211 /// It is used to wrap structs from the C side, like for example `Opaque<bindings::mutex>`. 212 /// It gets rid of all the usual assumptions that Rust has for a value: 213 /// 214 /// * The value is allowed to be uninitialized (for example have invalid bit patterns: `3` for a 215 /// [`bool`]). 216 /// * The value is allowed to be mutated, when a `&Opaque<T>` exists on the Rust side. 217 /// * No uniqueness for mutable references: it is fine to have multiple `&mut Opaque<T>` point to 218 /// the same value. 219 /// * The value is not allowed to be shared with other threads (i.e. it is `!Sync`). 220 /// 221 /// This has to be used for all values that the C side has access to, because it can't be ensured 222 /// that the C side is adhering to the usual constraints that Rust needs. 223 /// 224 /// Using `Opaque<T>` allows to continue to use references on the Rust side even for values shared 225 /// with C. 226 /// 227 /// # Examples 228 /// 229 /// ``` 230 /// # #![expect(unreachable_pub, clippy::disallowed_names)] 231 /// use kernel::types::Opaque; 232 /// # // Emulate a C struct binding which is from C, maybe uninitialized or not, only the C side 233 /// # // knows. 234 /// # mod bindings { 235 /// # pub struct Foo { 236 /// # pub val: u8, 237 /// # } 238 /// # } 239 /// 240 /// // `foo.val` is assumed to be handled on the C side, so we use `Opaque` to wrap it. 241 /// pub struct Foo { 242 /// foo: Opaque<bindings::Foo>, 243 /// } 244 /// 245 /// impl Foo { 246 /// pub fn get_val(&self) -> u8 { 247 /// let ptr = Opaque::get(&self.foo); 248 /// 249 /// // SAFETY: `Self` is valid from C side. 250 /// unsafe { (*ptr).val } 251 /// } 252 /// } 253 /// 254 /// // Create an instance of `Foo` with the `Opaque` wrapper. 255 /// let foo = Foo { 256 /// foo: Opaque::new(bindings::Foo { val: 0xdb }), 257 /// }; 258 /// 259 /// assert_eq!(foo.get_val(), 0xdb); 260 /// ``` 261 #[repr(transparent)] 262 pub struct Opaque<T> { 263 value: UnsafeCell<MaybeUninit<T>>, 264 _pin: PhantomPinned, 265 } 266 267 impl<T> Opaque<T> { 268 /// Creates a new opaque value. 269 pub const fn new(value: T) -> Self { 270 Self { 271 value: UnsafeCell::new(MaybeUninit::new(value)), 272 _pin: PhantomPinned, 273 } 274 } 275 276 /// Creates an uninitialised value. 277 pub const fn uninit() -> Self { 278 Self { 279 value: UnsafeCell::new(MaybeUninit::uninit()), 280 _pin: PhantomPinned, 281 } 282 } 283 284 /// Create an opaque pin-initializer from the given pin-initializer. 285 pub fn pin_init(slot: impl PinInit<T>) -> impl PinInit<Self> { 286 Self::ffi_init(|ptr: *mut T| { 287 // SAFETY: 288 // - `ptr` is a valid pointer to uninitialized memory, 289 // - `slot` is not accessed on error; the call is infallible, 290 // - `slot` is pinned in memory. 291 let _ = unsafe { init::PinInit::<T>::__pinned_init(slot, ptr) }; 292 }) 293 } 294 295 /// Creates a pin-initializer from the given initializer closure. 296 /// 297 /// The returned initializer calls the given closure with the pointer to the inner `T` of this 298 /// `Opaque`. Since this memory is uninitialized, the closure is not allowed to read from it. 299 /// 300 /// This function is safe, because the `T` inside of an `Opaque` is allowed to be 301 /// uninitialized. Additionally, access to the inner `T` requires `unsafe`, so the caller needs 302 /// to verify at that point that the inner value is valid. 303 pub fn ffi_init(init_func: impl FnOnce(*mut T)) -> impl PinInit<Self> { 304 // SAFETY: We contain a `MaybeUninit`, so it is OK for the `init_func` to not fully 305 // initialize the `T`. 306 unsafe { 307 init::pin_init_from_closure::<_, ::core::convert::Infallible>(move |slot| { 308 init_func(Self::raw_get(slot)); 309 Ok(()) 310 }) 311 } 312 } 313 314 /// Creates a fallible pin-initializer from the given initializer closure. 315 /// 316 /// The returned initializer calls the given closure with the pointer to the inner `T` of this 317 /// `Opaque`. Since this memory is uninitialized, the closure is not allowed to read from it. 318 /// 319 /// This function is safe, because the `T` inside of an `Opaque` is allowed to be 320 /// uninitialized. Additionally, access to the inner `T` requires `unsafe`, so the caller needs 321 /// to verify at that point that the inner value is valid. 322 pub fn try_ffi_init<E>( 323 init_func: impl FnOnce(*mut T) -> Result<(), E>, 324 ) -> impl PinInit<Self, E> { 325 // SAFETY: We contain a `MaybeUninit`, so it is OK for the `init_func` to not fully 326 // initialize the `T`. 327 unsafe { init::pin_init_from_closure::<_, E>(move |slot| init_func(Self::raw_get(slot))) } 328 } 329 330 /// Returns a raw pointer to the opaque data. 331 pub const fn get(&self) -> *mut T { 332 UnsafeCell::get(&self.value).cast::<T>() 333 } 334 335 /// Gets the value behind `this`. 336 /// 337 /// This function is useful to get access to the value without creating intermediate 338 /// references. 339 pub const fn raw_get(this: *const Self) -> *mut T { 340 UnsafeCell::raw_get(this.cast::<UnsafeCell<MaybeUninit<T>>>()).cast::<T>() 341 } 342 } 343 344 /// Types that are _always_ reference counted. 345 /// 346 /// It allows such types to define their own custom ref increment and decrement functions. 347 /// Additionally, it allows users to convert from a shared reference `&T` to an owned reference 348 /// [`ARef<T>`]. 349 /// 350 /// This is usually implemented by wrappers to existing structures on the C side of the code. For 351 /// Rust code, the recommendation is to use [`Arc`](crate::sync::Arc) to create reference-counted 352 /// instances of a type. 353 /// 354 /// # Safety 355 /// 356 /// Implementers must ensure that increments to the reference count keep the object alive in memory 357 /// at least until matching decrements are performed. 358 /// 359 /// Implementers must also ensure that all instances are reference-counted. (Otherwise they 360 /// won't be able to honour the requirement that [`AlwaysRefCounted::inc_ref`] keep the object 361 /// alive.) 362 pub unsafe trait AlwaysRefCounted { 363 /// Increments the reference count on the object. 364 fn inc_ref(&self); 365 366 /// Decrements the reference count on the object. 367 /// 368 /// Frees the object when the count reaches zero. 369 /// 370 /// # Safety 371 /// 372 /// Callers must ensure that there was a previous matching increment to the reference count, 373 /// and that the object is no longer used after its reference count is decremented (as it may 374 /// result in the object being freed), unless the caller owns another increment on the refcount 375 /// (e.g., it calls [`AlwaysRefCounted::inc_ref`] twice, then calls 376 /// [`AlwaysRefCounted::dec_ref`] once). 377 unsafe fn dec_ref(obj: NonNull<Self>); 378 } 379 380 /// An owned reference to an always-reference-counted object. 381 /// 382 /// The object's reference count is automatically decremented when an instance of [`ARef`] is 383 /// dropped. It is also automatically incremented when a new instance is created via 384 /// [`ARef::clone`]. 385 /// 386 /// # Invariants 387 /// 388 /// The pointer stored in `ptr` is non-null and valid for the lifetime of the [`ARef`] instance. In 389 /// particular, the [`ARef`] instance owns an increment on the underlying object's reference count. 390 pub struct ARef<T: AlwaysRefCounted> { 391 ptr: NonNull<T>, 392 _p: PhantomData<T>, 393 } 394 395 // SAFETY: It is safe to send `ARef<T>` to another thread when the underlying `T` is `Sync` because 396 // it effectively means sharing `&T` (which is safe because `T` is `Sync`); additionally, it needs 397 // `T` to be `Send` because any thread that has an `ARef<T>` may ultimately access `T` using a 398 // mutable reference, for example, when the reference count reaches zero and `T` is dropped. 399 unsafe impl<T: AlwaysRefCounted + Sync + Send> Send for ARef<T> {} 400 401 // SAFETY: It is safe to send `&ARef<T>` to another thread when the underlying `T` is `Sync` 402 // because it effectively means sharing `&T` (which is safe because `T` is `Sync`); additionally, 403 // it needs `T` to be `Send` because any thread that has a `&ARef<T>` may clone it and get an 404 // `ARef<T>` on that thread, so the thread may ultimately access `T` using a mutable reference, for 405 // example, when the reference count reaches zero and `T` is dropped. 406 unsafe impl<T: AlwaysRefCounted + Sync + Send> Sync for ARef<T> {} 407 408 impl<T: AlwaysRefCounted> ARef<T> { 409 /// Creates a new instance of [`ARef`]. 410 /// 411 /// It takes over an increment of the reference count on the underlying object. 412 /// 413 /// # Safety 414 /// 415 /// Callers must ensure that the reference count was incremented at least once, and that they 416 /// are properly relinquishing one increment. That is, if there is only one increment, callers 417 /// must not use the underlying object anymore -- it is only safe to do so via the newly 418 /// created [`ARef`]. 419 pub unsafe fn from_raw(ptr: NonNull<T>) -> Self { 420 // INVARIANT: The safety requirements guarantee that the new instance now owns the 421 // increment on the refcount. 422 Self { 423 ptr, 424 _p: PhantomData, 425 } 426 } 427 428 /// Consumes the `ARef`, returning a raw pointer. 429 /// 430 /// This function does not change the refcount. After calling this function, the caller is 431 /// responsible for the refcount previously managed by the `ARef`. 432 /// 433 /// # Examples 434 /// 435 /// ``` 436 /// use core::ptr::NonNull; 437 /// use kernel::types::{ARef, AlwaysRefCounted}; 438 /// 439 /// struct Empty {} 440 /// 441 /// # // SAFETY: TODO. 442 /// unsafe impl AlwaysRefCounted for Empty { 443 /// fn inc_ref(&self) {} 444 /// unsafe fn dec_ref(_obj: NonNull<Self>) {} 445 /// } 446 /// 447 /// let mut data = Empty {}; 448 /// let ptr = NonNull::<Empty>::new(&mut data as *mut _).unwrap(); 449 /// # // SAFETY: TODO. 450 /// let data_ref: ARef<Empty> = unsafe { ARef::from_raw(ptr) }; 451 /// let raw_ptr: NonNull<Empty> = ARef::into_raw(data_ref); 452 /// 453 /// assert_eq!(ptr, raw_ptr); 454 /// ``` 455 pub fn into_raw(me: Self) -> NonNull<T> { 456 ManuallyDrop::new(me).ptr 457 } 458 } 459 460 impl<T: AlwaysRefCounted> Clone for ARef<T> { 461 fn clone(&self) -> Self { 462 self.inc_ref(); 463 // SAFETY: We just incremented the refcount above. 464 unsafe { Self::from_raw(self.ptr) } 465 } 466 } 467 468 impl<T: AlwaysRefCounted> Deref for ARef<T> { 469 type Target = T; 470 471 fn deref(&self) -> &Self::Target { 472 // SAFETY: The type invariants guarantee that the object is valid. 473 unsafe { self.ptr.as_ref() } 474 } 475 } 476 477 impl<T: AlwaysRefCounted> From<&T> for ARef<T> { 478 fn from(b: &T) -> Self { 479 b.inc_ref(); 480 // SAFETY: We just incremented the refcount above. 481 unsafe { Self::from_raw(NonNull::from(b)) } 482 } 483 } 484 485 impl<T: AlwaysRefCounted> Drop for ARef<T> { 486 fn drop(&mut self) { 487 // SAFETY: The type invariants guarantee that the `ARef` owns the reference we're about to 488 // decrement. 489 unsafe { T::dec_ref(self.ptr) }; 490 } 491 } 492 493 /// A sum type that always holds either a value of type `L` or `R`. 494 /// 495 /// # Examples 496 /// 497 /// ``` 498 /// use kernel::types::Either; 499 /// 500 /// let left_value: Either<i32, &str> = Either::Left(7); 501 /// let right_value: Either<i32, &str> = Either::Right("right value"); 502 /// ``` 503 pub enum Either<L, R> { 504 /// Constructs an instance of [`Either`] containing a value of type `L`. 505 Left(L), 506 507 /// Constructs an instance of [`Either`] containing a value of type `R`. 508 Right(R), 509 } 510 511 /// Zero-sized type to mark types not [`Send`]. 512 /// 513 /// Add this type as a field to your struct if your type should not be sent to a different task. 514 /// Since [`Send`] is an auto trait, adding a single field that is `!Send` will ensure that the 515 /// whole type is `!Send`. 516 /// 517 /// If a type is `!Send` it is impossible to give control over an instance of the type to another 518 /// task. This is useful to include in types that store or reference task-local information. A file 519 /// descriptor is an example of such task-local information. 520 /// 521 /// This type also makes the type `!Sync`, which prevents immutable access to the value from 522 /// several threads in parallel. 523 pub type NotThreadSafe = PhantomData<*mut ()>; 524 525 /// Used to construct instances of type [`NotThreadSafe`] similar to how `PhantomData` is 526 /// constructed. 527 /// 528 /// [`NotThreadSafe`]: type@NotThreadSafe 529 #[allow(non_upper_case_globals)] 530 pub const NotThreadSafe: NotThreadSafe = PhantomData; 531