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 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691
use core::{
any::Any,
borrow::{Borrow, BorrowMut},
error::Error,
fmt,
future::Future,
hash::{Hash, Hasher},
iter::FusedIterator,
marker::{PhantomData, Tuple, Unsize},
mem::{self, ManuallyDrop, MaybeUninit},
ops::{CoerceUnsized, Coroutine, CoroutineState, Deref, DerefMut, DispatchFromDyn, Receiver},
panic::UnwindSafe,
pin::Pin,
ptr::{self, NonNull},
task::{Context, Poll},
};
#[cfg(feature = "pinned-init")]
use pinned_init::{Init, PinInit};
#[cfg(feature = "pinned-init")]
use crate::OPin;
use crate::{IntoInner, RawConvertable};
/// A pointer type that uniquely owns its data on the stack. but via the
/// implementation of a mutable reference to its `ManuallyDrop` wrapped form.
///
/// This object behaves just like `Box<T>`, aside from the fact that its pointed
/// value is stored somewhere else on the stack, while the storage place itself
/// is directly unreachable.
///
/// See [the module level documentation](crate) for more information.
#[repr(transparent)]
pub struct OnStack<'a, T: ?Sized> {
#[doc(hidden)]
pub inner: &'a mut ManuallyDrop<T>,
#[doc(hidden)]
pub marker: PhantomData<T>,
}
impl<'a, T: ?Sized + fmt::Debug> fmt::Debug for OnStack<'a, T> {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
f.debug_struct("OnStack")
.field("inner", &self.inner)
.finish()
}
}
impl<'a, T: ?Sized> fmt::Pointer for OnStack<'a, T> {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
fmt::Pointer::fmt(&((&**self) as *const T), f)
}
}
impl<'a, T: ?Sized + fmt::Display> fmt::Display for OnStack<'a, T> {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
(self.inner).fmt(f)
}
}
impl<'a, T: ?Sized> Receiver for OnStack<'a, T> {}
impl<'a, T: ?Sized + Unsize<U>, U: ?Sized> CoerceUnsized<OnStack<'a, U>> for OnStack<'a, T> {}
impl<'a, T: ?Sized, U: ?Sized> DispatchFromDyn<OnStack<'a, U>> for OnStack<'a, T> where T: Unsize<U> {}
impl<'a, T: ?Sized + UnwindSafe> UnwindSafe for OnStack<'a, T> {}
impl<'a, T: ?Sized> Unpin for OnStack<'a, T> {}
/// Constructs a smart pointer [on the current calling stack](OnStack) from the
/// value.
///
/// Unlike other pointers like `Box<T>`, this returned pointer consumes no
/// additional memory on the heap, at the cost of restricted lifetime of the
/// current calling context.
///
/// This pointer serves no additional functionality, unless used with [`Pin`].
///
/// # Examples
///
/// ```rust
/// // Basic usage
/// use owned_pin::{on_stack, IntoInner};
///
/// let pointer = on_stack!(String::from("Hello!"));
/// let string = IntoInner::into_inner(pointer);
/// assert_eq!(string, "Hello!");
/// ```
///
/// ```rust
/// // Pinning the pointer
/// use owned_pin::{on_stack, OnStack};
///
/// let pointer = on_stack!(String::from("Hello!"));
/// let pinned = OnStack::into_pin(pointer);
/// // Use this pinned pointer while keeping the semantic ownership.
/// ```
#[macro_export]
macro_rules! on_stack {
($value:expr) => {
$crate::OnStack {
inner: &mut $crate::ManuallyDrop::new($value),
marker: $crate::PhantomData,
}
};
}
/// Constructs an uninitialized smart pointer [on the current calling
/// stack](OnStack).
///
/// This macro is the shorthand for
/// [`on_stack!(MaybeUninit::uninit())`](on_stack); users can specify the
/// desired type in the arguments of this macro.
///
/// The user can either write this pointer with a value to obtain the
/// initialized result, or use an [in-place initializer](OnStack::init).
///
/// # Examples
///
/// ```rust
/// use owned_pin::{uninit_on_stack, OnStack};
///
/// let uninit = uninit_on_stack!(String);
/// let pointer = OnStack::write(uninit, "Hello!".into());
/// assert_eq!(*pointer, "Hello!");
/// ```
#[macro_export]
macro_rules! uninit_on_stack {
($($ty:ty)?) => {
$crate::on_stack!($crate::MaybeUninit$(::<$ty>)?::uninit())
};
}
/// Initializes an owned value directly on the stack using an initializer of
/// [`Init`](pinned_init::Init).
///
/// # Examples
///
/// ```rust
/// use owned_pin::init_on_stack;
/// use pinned_init::pin_data;
///
/// #[pin_data]
/// struct X {
/// a: [u64; 100],
/// }
///
/// // This value is directly written to the target place,
/// // instead of being temporarily placed on the stack.
/// init_on_stack!(let x = X {
/// a <- [0; 100]
/// });
/// assert_eq!(x.a, [0; 100]);
/// ```
#[macro_export]
#[cfg(feature = "pinned-init")]
macro_rules! init_on_stack {
(let $value:tt $(: $ty:ty)? = $($init:tt)*) => {
let __uninit = $crate::uninit_on_stack!();
let $value = $crate::OnStack::init(
__uninit,
$crate::init!($($init)*)
)
.unwrap();
};
}
/// Attempts to initialize an owned value directly on the stack using an
/// initializer of [`Init`](pinned_init::Init).
///
/// # Examples
///
/// ```rust
/// use owned_pin::try_init_on_stack;
/// use pinned_init::pin_data;
///
/// #[pin_data]
/// struct X {
/// a: [u64; 100],
/// }
///
/// // This value is directly written to the target place,
/// // instead of being temporarily placed on the stack.
/// try_init_on_stack!(let x = X {
/// a <- [0; 100]
/// });
/// assert_eq!(x.unwrap().a, [0; 100]);
/// ```
#[macro_export]
#[cfg(feature = "pinned-init")]
macro_rules! try_init_on_stack {
(let $value:tt $(: $ty:ty)? = $($init:tt)*) => {
let __uninit = $crate::uninit_on_stack!();
let $value = $crate::OnStack::init(
__uninit,
$crate::init!($($init)*),
);
};
}
impl<'a, T: ?Sized> OnStack<'a, T> {
/// Constructs an owned reference to somewhere on the stack.
///
/// For safe construction methods, see [`on_stack`](crate::on_stack).
///
/// # Safety
///
/// `inner` must own its referent, a.k.a. not being (in)directly reborrowed
/// from other references, and must not be used anymore anywhere else.
pub unsafe fn new_unchecked(inner: &'a mut ManuallyDrop<T>) -> Self {
OnStack {
inner,
marker: PhantomData,
}
}
/// Consumes the `OnStack` pointer, returning a wrapped raw pointer, which
/// will be properly aligned and non-null.
///
/// This function behaves just like `Box::into_raw`, aside from the fact
/// that the pointer's lifetime is discarded as well.
pub fn into_raw(pointer: Self) -> *mut T {
OnStack::leak(pointer)
}
/// Constructs an `OnStack` pointer from a raw pointer.
///
/// # Safety
///
/// Beside the basic requirement stated in
/// [`new_unchecked`](OnStack::new_unchecked), the caller must also ensure
/// the satisfaction of creating a unique & valid reference from this
/// pointer.
pub unsafe fn from_raw(pointer: *mut T) -> Self {
// SAFETY: The contract is satisfied above.
unsafe { OnStack::new_unchecked(&mut *(pointer as *mut ManuallyDrop<T>)) }
}
/// Converts a `OnStack<T>` into a `Pin<OnStack<T>>`. If `T` does not
/// implement Unpin, then `*pointer` will be pinned in memory and unable
/// to be moved.
///
/// See [`opin`](crate::opin) for methods that directly pin values.
pub fn into_pin(pointer: Self) -> Pin<OnStack<'a, T>> {
// It's not possible to move or replace the insides of a `Pin<OnStack<T>>`
// when `T: !Unpin`, so it's safe to pin it directly without any additional
// requirements.
unsafe { Pin::new_unchecked(pointer) }
}
/// Consumes and leaks the `OnStack` pointer, returning a mutable reference,
/// `&'a mut T`.
///
/// Unlike `Box::leak`, this function cannot chose its own lifetime,
/// because the pointer itself is constrained by a certain lifetime.
///
/// Like `Box::leak`, the destructor of the value will not be run.
pub fn leak(pointer: Self) -> &'a mut T {
unsafe {
let ret = ptr::read(&pointer.inner);
mem::forget(pointer);
ret
}
}
}
// SAFETY: The implementation of `OnStack<T>` is correct.
unsafe impl<'a, T: ?Sized> RawConvertable for OnStack<'a, T> {
type Metadata = ();
/// Consumes the `OnStack` pointer, returning a wrapped raw pointer, which
/// will be properly aligned and non-null.
///
/// This function behaves just like `Box::into_raw`, aside from the fact
/// that the pointer's lifetime is discarded as well.
fn into_raw(this: Self) -> (NonNull<T>, ()) {
let ptr = OnStack::into_raw(this);
// SAFETY: The pointer to the stack memory is always not-null, whether its
// dangling for ZSTs for not.
(unsafe { NonNull::new_unchecked(ptr) }, ())
}
/// Constructs an `OnStack` pointer from a raw pointer.
///
/// # Safety
///
/// Beside the basic requirement stated in
/// [`new_unchecked`](OnStack::new_unchecked), the caller must also ensure
/// the satisfaction of creating a unique & valid reference from this
/// pointer.
unsafe fn from_raw(pointer: NonNull<T>, _: ()) -> Self {
// SAFETY: The contract is satisfied above.
unsafe { OnStack::from_raw(pointer.as_ptr()) }
}
}
impl<'a, T> OnStack<'a, MaybeUninit<T>> {
/// Converts to an initialized `OnStack` pointer.
///
/// # Safety
///
/// As with [`MaybeUninit::assume_init`], it is up to the caller to
/// guarantee that the value really is in an initialized state. Calling
/// this when the content is not yet fully initialized causes immediate
/// undefined behavior.
pub unsafe fn assume_init(self) -> OnStack<'a, T> {
// SAFETY: `&mut MaybeUninit<T>` shares the same memory layout as `&mut T`.
unsafe { mem::transmute(self) }
}
/// Writes the value and converts to an initialized `OnStack` pointer.
pub fn write(mut pointer: Self, value: T) -> OnStack<'a, T> {
(*pointer).write(value);
// SAFETY: We just wrote a valid value onto the storage place.
unsafe { pointer.assume_init() }
}
}
#[cfg(feature = "pinned-init")]
impl<'a, T> OnStack<'a, MaybeUninit<T>> {
/// Initialize a uninitialized pointer [on stack](OnStack) using an
/// initializer that implements [`Init`] trait.
pub fn init<E>(mut pointer: Self, init: impl Init<T, E>) -> Result<OnStack<'a, T>, E> {
// SAFETY: The memory slot is valid.
unsafe { init.__init(pointer.as_mut_ptr())? };
// SAFETY: The slot is now initialized.
Ok(unsafe { pointer.assume_init() })
}
/// Initialize a pinned and uninitialized pointer [on stack](OnStack) using
/// an initializer that implements [`PinInit`] trait.
pub fn pin_init<E>(pointer: Pin<Self>, init: impl PinInit<T, E>) -> Result<OPin<'a, T>, E> {
// SAFETY: `this` is never moved out.
let mut this = unsafe { Pin::into_inner_unchecked(pointer) };
// SAFETY: The memory slot is valid and this type ensures that it will stay
// pinned.
unsafe { init.__pinned_init(this.as_mut_ptr())? };
// SAFETY: The slot is now initialized.
Ok(OnStack::into_pin(unsafe { this.assume_init() }))
}
}
impl<'a> OnStack<'a, dyn Any> {
/// Attempts to downcast the `OnStack` pointer to a concrete type.
pub fn downcast<T: Any>(self) -> Result<OnStack<'a, T>, Self> {
if self.is::<T>() {
Ok(unsafe { self.downcast_unchecked() })
} else {
Err(self)
}
}
/// Downcasts the `OnStack` pointer to a concrete type.
///
/// # Safety
///
/// The contained value must be of type `T`. Calling this method
/// with the incorrect type is *undefined behavior*.
pub unsafe fn downcast_unchecked<T: Any>(self) -> OnStack<'a, T> {
debug_assert!(self.is::<T>());
// SAFETY: `self` is `T`.
unsafe {
let raw = Self::into_raw(self);
OnStack::from_raw(raw.cast::<T>())
}
}
}
impl<'a, T: ?Sized> Deref for OnStack<'a, T> {
type Target = T;
fn deref(&self) -> &Self::Target {
self.inner
}
}
impl<'a, T: ?Sized> DerefMut for OnStack<'a, T> {
fn deref_mut(&mut self) -> &mut Self::Target {
self.inner
}
}
impl<'a, T: ?Sized> AsRef<T> for OnStack<'a, T> {
fn as_ref(&self) -> &T {
self
}
}
impl<'a, T: ?Sized> AsMut<T> for OnStack<'a, T> {
fn as_mut(&mut self) -> &mut T {
self
}
}
impl<'a, T: ?Sized> Borrow<T> for OnStack<'a, T> {
fn borrow(&self) -> &T {
self
}
}
impl<'a, T: ?Sized> BorrowMut<T> for OnStack<'a, T> {
fn borrow_mut(&mut self) -> &mut T {
self
}
}
impl<'a, T> IntoInner for OnStack<'a, T> {
fn into_inner(self) -> T {
// SAFETY: We own this place of memory according to the contract in
// `new_unchecked` function.
unsafe {
let value = ManuallyDrop::take(&mut *self.inner);
// Prevent the drop function to be called.
mem::forget(self);
value
}
}
}
impl<'a, T: ?Sized> Drop for OnStack<'a, T> {
fn drop(&mut self) {
// SAFETY: We own this place of memory according to the contract in
// `new_unchecked` function.
unsafe { ManuallyDrop::drop(self.inner) }
}
}
impl<T: ?Sized + PartialEq> PartialEq for OnStack<'_, T> {
#[inline]
fn eq(&self, other: &Self) -> bool {
self.deref() == other.deref()
}
}
impl<T: ?Sized + Eq> Eq for OnStack<'_, T> {}
impl<T: ?Sized + PartialOrd> PartialOrd for OnStack<'_, T> {
#[inline]
fn partial_cmp(&self, other: &Self) -> Option<core::cmp::Ordering> {
self.deref().partial_cmp(other)
}
}
impl<T: ?Sized + Ord> Ord for OnStack<'_, T> {
#[inline]
fn cmp(&self, other: &Self) -> core::cmp::Ordering {
self.deref().cmp(other)
}
}
impl<T: ?Sized + Hash> Hash for OnStack<'_, T> {
fn hash<H: Hasher>(&self, state: &mut H) {
self.deref().hash(state)
}
}
impl<'a, T: ?Sized + Future + Unpin> Future for OnStack<'a, T> {
type Output = T::Output;
fn poll(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> {
Pin::new(&mut **self.inner).poll(cx)
}
}
impl<'a, A, T: ?Sized + Coroutine<A> + Unpin> Coroutine<A> for OnStack<'a, T> {
type Yield = T::Yield;
type Return = T::Return;
fn resume(mut self: Pin<&mut Self>, arg: A) -> CoroutineState<Self::Yield, Self::Return> {
Pin::new(&mut **self.inner).resume(arg)
}
}
impl<'a, T: ?Sized + Iterator> Iterator for OnStack<'a, T> {
type Item = T::Item;
fn next(&mut self) -> Option<Self::Item> {
self.inner.next()
}
}
impl<'a, T: ?Sized + DoubleEndedIterator> DoubleEndedIterator for OnStack<'a, T> {
fn next_back(&mut self) -> Option<Self::Item> {
self.inner.next_back()
}
}
impl<'a, T: ?Sized + FusedIterator> FusedIterator for OnStack<'a, T> {}
impl<'a, T: ?Sized + ExactSizeIterator> ExactSizeIterator for OnStack<'a, T> {
fn len(&self) -> usize {
self.inner.len()
}
}
impl<'a, T: ?Sized + Error> Error for OnStack<'a, T> {
fn source(&self) -> Option<&(dyn Error + 'static)> {
self.inner.source()
}
fn provide<'b>(&'b self, request: &mut core::error::Request<'b>) {
self.inner.provide(request);
}
}
impl<'a, A: Tuple, T: FnOnce<A>> FnOnce<A> for OnStack<'a, T> {
type Output = T::Output;
extern "rust-call" fn call_once(self, args: A) -> Self::Output {
self.into_inner().call_once(args)
}
}
impl<'a, A: Tuple, T: FnMut<A>> FnMut<A> for OnStack<'a, T> {
extern "rust-call" fn call_mut(&mut self, args: A) -> Self::Output {
(self.inner).call_mut(args)
}
}
impl<'a, A: Tuple, T: Fn<A>> Fn<A> for OnStack<'a, T> {
extern "rust-call" fn call(&self, args: A) -> Self::Output {
(self.inner).call(args)
}
}
impl<T: ?Sized + Hasher> Hasher for OnStack<'_, T> {
fn finish(&self) -> u64 {
self.inner.finish()
}
fn write(&mut self, bytes: &[u8]) {
self.inner.write(bytes)
}
fn write_u8(&mut self, i: u8) {
self.inner.write_u8(i)
}
fn write_u16(&mut self, i: u16) {
self.inner.write_u16(i)
}
fn write_u32(&mut self, i: u32) {
self.inner.write_u32(i)
}
fn write_u64(&mut self, i: u64) {
self.inner.write_u64(i)
}
fn write_u128(&mut self, i: u128) {
self.inner.write_u128(i)
}
fn write_usize(&mut self, i: usize) {
self.inner.write_usize(i)
}
fn write_i8(&mut self, i: i8) {
self.inner.write_i8(i)
}
fn write_i16(&mut self, i: i16) {
self.inner.write_i16(i)
}
fn write_i32(&mut self, i: i32) {
self.inner.write_i32(i)
}
fn write_i64(&mut self, i: i64) {
self.inner.write_i64(i)
}
fn write_i128(&mut self, i: i128) {
self.inner.write_i128(i)
}
fn write_isize(&mut self, i: isize) {
self.inner.write_isize(i)
}
}
impl<'a, T: ?Sized> From<OnStack<'a, T>> for Pin<OnStack<'a, T>> {
fn from(value: OnStack<'a, T>) -> Self {
OnStack::into_pin(value)
}
}
/// Pins a value onto the current calling stack.
///
/// If the value is `Unpin`, the user can safety [move out](crate::unpin) the
/// value and use it again.
///
/// # Examples
///
/// ```rust
/// use owned_pin::{opin, unpin};
///
/// // Pins the value onto the stack.
/// let pinned = opin!(String::from("Hello!"));
/// // Retrieves back the data because `String` is `Unpin`.
/// let string: String = unpin(pinned);
/// assert_eq!(string, "Hello!");
/// ```
#[macro_export]
#[allow_internal_unstable(unsafe_pin_internals)]
macro_rules! opin {
($value:expr) => {
$crate::Pin {
pointer: $crate::on_stack!($value),
}
};
}
/// Pins an uninitialized value onto the current calling stack.
///
/// This macro is the shorthand for
/// [`opin!(MaybeUninit::uninit())`](crate::opin); users can specify the desired
/// type in the arguments of this macro.
///
/// To initialize this value, the [`pin_init`](OnStack::pin_init) method should
/// be used in most cases.
///
/// See [`pinned-init`](pinned_init) crate for how to directly initialize a
/// pinned value.
#[macro_export]
macro_rules! opin_uninit {
($($ty:ty)?) => {
$crate::opin!($crate::MaybeUninit$(::<$ty>)?::uninit())
};
}
/// Initializes and pins an owned value directly on the stack using an
/// initializer of [`PinInit`](pinned_init::PinInit).
///
/// # Examples
///
/// ```rust
/// use owned_pin::{opin_init, OPin};
/// use pinned_init::pin_data;
///
/// #[pin_data]
/// struct A {
/// x: u32
/// }
///
/// opin_init!(let a = A { x: 64 });
/// assert_eq!(a.x, 64);
/// ```
#[macro_export]
#[cfg(feature = "pinned-init")]
macro_rules! opin_init {
(let $value:tt $(: $ty:ty)? = $($init:tt)*) => {
let __uninit = $crate::opin_uninit!($($ty:ty)?);
let $value = $crate::OnStack::pin_init(
__uninit,
$crate::pin_init!($($init)*)
)
.unwrap();
};
}
/// Attempts to initialize and pin an owned value directly on the stack using an
/// initializer of [`PinInit`](pinned_init::PinInit).
///
/// # Examples
///
/// ```rust
/// use owned_pin::{try_opin_init, OPin};
/// use pinned_init::pin_data;
///
/// #[pin_data]
/// struct A {
/// x: u32
/// }
///
/// try_opin_init!(let a = A { x: 64 });
/// assert_eq!(a.unwrap().x, 64);
#[macro_export]
#[cfg(feature = "pinned-init")]
macro_rules! try_opin_init {
(let $value:tt $(: $ty:ty)? = $($init:tt)*) => {
let __uninit = $crate::opin_uninit!($($ty:ty)?);
let $value = $crate::OnStack::pin_init(
__uninit,
$crate::pin_init!($($init)*)
);
};
}