Auto merge of #149581 - matthiaskrgr:rollup-w4dixyc, r=matthiaskrgr
Rollup of 3 pull requests Successful merges: - rust-lang/rust#148937 (Remove initialized-bytes tracking from `BorrowedBuf` and `BorrowedCursor`) - rust-lang/rust#149553 (added default_uwtables=true to aarch64_unknown_none targets) - rust-lang/rust#149578 (rustdoc: Fix broken link to `Itertools::format`) r? `@ghost` `@rustbot` modify labels: rollup
This commit is contained in:
commit
8202d11051
29 changed files with 70 additions and 369 deletions
|
|
@ -27,6 +27,7 @@ pub(crate) fn target() -> Target {
|
|||
max_atomic_width: Some(128),
|
||||
stack_probes: StackProbeType::Inline,
|
||||
panic_strategy: PanicStrategy::Abort,
|
||||
default_uwtable: true,
|
||||
..Default::default()
|
||||
};
|
||||
Target {
|
||||
|
|
|
|||
|
|
@ -23,6 +23,7 @@ pub(crate) fn target() -> Target {
|
|||
supported_sanitizers: SanitizerSet::KCFI | SanitizerSet::KERNELADDRESS,
|
||||
stack_probes: StackProbeType::Inline,
|
||||
panic_strategy: PanicStrategy::Abort,
|
||||
default_uwtable: true,
|
||||
..Default::default()
|
||||
};
|
||||
Target {
|
||||
|
|
|
|||
|
|
@ -2,27 +2,26 @@
|
|||
|
||||
use crate::fmt::{self, Debug, Formatter};
|
||||
use crate::mem::{self, MaybeUninit};
|
||||
use crate::{cmp, ptr};
|
||||
|
||||
/// A borrowed byte buffer which is incrementally filled and initialized.
|
||||
/// A borrowed buffer of initially uninitialized bytes, which is incrementally filled.
|
||||
///
|
||||
/// This type is a sort of "double cursor". It tracks three regions in the buffer: a region at the beginning of the
|
||||
/// buffer that has been logically filled with data, a region that has been initialized at some point but not yet
|
||||
/// logically filled, and a region at the end that is fully uninitialized. The filled region is guaranteed to be a
|
||||
/// subset of the initialized region.
|
||||
/// This type makes it safer to work with `MaybeUninit` buffers, such as to read into a buffer
|
||||
/// without having to initialize it first. It tracks the region of bytes that have been filled and
|
||||
/// the region that remains uninitialized.
|
||||
///
|
||||
/// In summary, the contents of the buffer can be visualized as:
|
||||
/// The contents of the buffer can be visualized as:
|
||||
/// ```not_rust
|
||||
/// [ capacity ]
|
||||
/// [ filled | unfilled ]
|
||||
/// [ initialized | uninitialized ]
|
||||
/// [ capacity ]
|
||||
/// [ len: filled and initialized | capacity - len: uninitialized ]
|
||||
/// ```
|
||||
///
|
||||
/// A `BorrowedBuf` is created around some existing data (or capacity for data) via a unique reference
|
||||
/// (`&mut`). The `BorrowedBuf` can be configured (e.g., using `clear` or `set_init`), but cannot be
|
||||
/// directly written. To write into the buffer, use `unfilled` to create a `BorrowedCursor`. The cursor
|
||||
/// has write-only access to the unfilled portion of the buffer (you can think of it as a
|
||||
/// write-only iterator).
|
||||
/// Note that `BorrowedBuf` does not distinguish between uninitialized data and data that was
|
||||
/// previously initialized but no longer contains valid data.
|
||||
///
|
||||
/// A `BorrowedBuf` is created around some existing data (or capacity for data) via a unique
|
||||
/// reference (`&mut`). The `BorrowedBuf` can be configured (e.g., using `clear` or `set_len`), but
|
||||
/// cannot be directly written. To write into the buffer, use `unfilled` to create a
|
||||
/// `BorrowedCursor`. The cursor has write-only access to the unfilled portion of the buffer.
|
||||
///
|
||||
/// The lifetime `'data` is a bound on the lifetime of the underlying data.
|
||||
pub struct BorrowedBuf<'data> {
|
||||
|
|
@ -30,14 +29,11 @@ pub struct BorrowedBuf<'data> {
|
|||
buf: &'data mut [MaybeUninit<u8>],
|
||||
/// The length of `self.buf` which is known to be filled.
|
||||
filled: usize,
|
||||
/// The length of `self.buf` which is known to be initialized.
|
||||
init: usize,
|
||||
}
|
||||
|
||||
impl Debug for BorrowedBuf<'_> {
|
||||
fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
|
||||
f.debug_struct("BorrowedBuf")
|
||||
.field("init", &self.init)
|
||||
.field("filled", &self.filled)
|
||||
.field("capacity", &self.capacity())
|
||||
.finish()
|
||||
|
|
@ -48,24 +44,22 @@ impl Debug for BorrowedBuf<'_> {
|
|||
impl<'data> From<&'data mut [u8]> for BorrowedBuf<'data> {
|
||||
#[inline]
|
||||
fn from(slice: &'data mut [u8]) -> BorrowedBuf<'data> {
|
||||
let len = slice.len();
|
||||
|
||||
BorrowedBuf {
|
||||
// SAFETY: initialized data never becoming uninitialized is an invariant of BorrowedBuf
|
||||
// SAFETY: Always in bounds. We treat the buffer as uninitialized, even though it's
|
||||
// already initialized.
|
||||
buf: unsafe { (slice as *mut [u8]).as_uninit_slice_mut().unwrap() },
|
||||
filled: 0,
|
||||
init: len,
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/// Creates a new `BorrowedBuf` from an uninitialized buffer.
|
||||
///
|
||||
/// Use `set_init` if part of the buffer is known to be already initialized.
|
||||
/// Use `set_filled` if part of the buffer is known to be already filled.
|
||||
impl<'data> From<&'data mut [MaybeUninit<u8>]> for BorrowedBuf<'data> {
|
||||
#[inline]
|
||||
fn from(buf: &'data mut [MaybeUninit<u8>]) -> BorrowedBuf<'data> {
|
||||
BorrowedBuf { buf, filled: 0, init: 0 }
|
||||
BorrowedBuf { buf, filled: 0 }
|
||||
}
|
||||
}
|
||||
|
||||
|
|
@ -74,14 +68,11 @@ impl<'data> From<&'data mut [MaybeUninit<u8>]> for BorrowedBuf<'data> {
|
|||
/// Use `BorrowedCursor::with_unfilled_buf` instead for a safer alternative.
|
||||
impl<'data> From<BorrowedCursor<'data>> for BorrowedBuf<'data> {
|
||||
#[inline]
|
||||
fn from(mut buf: BorrowedCursor<'data>) -> BorrowedBuf<'data> {
|
||||
let init = buf.init_mut().len();
|
||||
fn from(buf: BorrowedCursor<'data>) -> BorrowedBuf<'data> {
|
||||
BorrowedBuf {
|
||||
// SAFETY: no initialized byte is ever uninitialized as per
|
||||
// `BorrowedBuf`'s invariant
|
||||
// SAFETY: Always in bounds. We treat the buffer as uninitialized.
|
||||
buf: unsafe { buf.buf.buf.get_unchecked_mut(buf.buf.filled..) },
|
||||
filled: 0,
|
||||
init,
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
@ -99,12 +90,6 @@ impl<'data> BorrowedBuf<'data> {
|
|||
self.filled
|
||||
}
|
||||
|
||||
/// Returns the length of the initialized part of the buffer.
|
||||
#[inline]
|
||||
pub fn init_len(&self) -> usize {
|
||||
self.init
|
||||
}
|
||||
|
||||
/// Returns a shared reference to the filled portion of the buffer.
|
||||
#[inline]
|
||||
pub fn filled(&self) -> &[u8] {
|
||||
|
|
@ -159,33 +144,16 @@ impl<'data> BorrowedBuf<'data> {
|
|||
|
||||
/// Clears the buffer, resetting the filled region to empty.
|
||||
///
|
||||
/// The number of initialized bytes is not changed, and the contents of the buffer are not modified.
|
||||
/// The contents of the buffer are not modified.
|
||||
#[inline]
|
||||
pub fn clear(&mut self) -> &mut Self {
|
||||
self.filled = 0;
|
||||
self
|
||||
}
|
||||
|
||||
/// Asserts that the first `n` bytes of the buffer are initialized.
|
||||
///
|
||||
/// `BorrowedBuf` assumes that bytes are never de-initialized, so this method does nothing when called with fewer
|
||||
/// bytes than are already known to be initialized.
|
||||
///
|
||||
/// # Safety
|
||||
///
|
||||
/// The caller must ensure that the first `n` unfilled bytes of the buffer have already been initialized.
|
||||
#[inline]
|
||||
pub unsafe fn set_init(&mut self, n: usize) -> &mut Self {
|
||||
self.init = cmp::max(self.init, n);
|
||||
self
|
||||
}
|
||||
}
|
||||
|
||||
/// A writeable view of the unfilled portion of a [`BorrowedBuf`].
|
||||
///
|
||||
/// The unfilled portion consists of an initialized and an uninitialized part; see [`BorrowedBuf`]
|
||||
/// for details.
|
||||
///
|
||||
/// Data can be written directly to the cursor by using [`append`](BorrowedCursor::append) or
|
||||
/// indirectly by getting a slice of part or all of the cursor and writing into the slice. In the
|
||||
/// indirect case, the caller must call [`advance`](BorrowedCursor::advance) after writing to inform
|
||||
|
|
@ -238,48 +206,17 @@ impl<'a> BorrowedCursor<'a> {
|
|||
self.buf.filled
|
||||
}
|
||||
|
||||
/// Returns a mutable reference to the initialized portion of the cursor.
|
||||
#[inline]
|
||||
pub fn init_mut(&mut self) -> &mut [u8] {
|
||||
// SAFETY: We only slice the initialized part of the buffer, which is always valid
|
||||
unsafe {
|
||||
let buf = self.buf.buf.get_unchecked_mut(self.buf.filled..self.buf.init);
|
||||
buf.assume_init_mut()
|
||||
}
|
||||
}
|
||||
|
||||
/// Returns a mutable reference to the whole cursor.
|
||||
///
|
||||
/// # Safety
|
||||
///
|
||||
/// The caller must not uninitialize any bytes in the initialized portion of the cursor.
|
||||
/// The caller must not uninitialize any previously initialized bytes.
|
||||
#[inline]
|
||||
pub unsafe fn as_mut(&mut self) -> &mut [MaybeUninit<u8>] {
|
||||
// SAFETY: always in bounds
|
||||
unsafe { self.buf.buf.get_unchecked_mut(self.buf.filled..) }
|
||||
}
|
||||
|
||||
/// Advances the cursor by asserting that `n` bytes have been filled.
|
||||
///
|
||||
/// After advancing, the `n` bytes are no longer accessible via the cursor and can only be
|
||||
/// accessed via the underlying buffer. I.e., the buffer's filled portion grows by `n` elements
|
||||
/// and its unfilled portion (and the capacity of this cursor) shrinks by `n` elements.
|
||||
///
|
||||
/// If less than `n` bytes initialized (by the cursor's point of view), `set_init` should be
|
||||
/// called first.
|
||||
///
|
||||
/// # Panics
|
||||
///
|
||||
/// Panics if there are less than `n` bytes initialized.
|
||||
#[inline]
|
||||
pub fn advance(&mut self, n: usize) -> &mut Self {
|
||||
// The subtraction cannot underflow by invariant of this type.
|
||||
assert!(n <= self.buf.init - self.buf.filled);
|
||||
|
||||
self.buf.filled += n;
|
||||
self
|
||||
}
|
||||
|
||||
/// Advances the cursor by asserting that `n` bytes have been filled.
|
||||
///
|
||||
/// After advancing, the `n` bytes are no longer accessible via the cursor and can only be
|
||||
|
|
@ -288,42 +225,11 @@ impl<'a> BorrowedCursor<'a> {
|
|||
///
|
||||
/// # Safety
|
||||
///
|
||||
/// The caller must ensure that the first `n` bytes of the cursor have been properly
|
||||
/// initialised.
|
||||
/// The caller must ensure that the first `n` bytes of the cursor have been initialized. `n`
|
||||
/// must not exceed the remaining capacity of this cursor.
|
||||
#[inline]
|
||||
pub unsafe fn advance_unchecked(&mut self, n: usize) -> &mut Self {
|
||||
pub unsafe fn advance(&mut self, n: usize) -> &mut Self {
|
||||
self.buf.filled += n;
|
||||
self.buf.init = cmp::max(self.buf.init, self.buf.filled);
|
||||
self
|
||||
}
|
||||
|
||||
/// Initializes all bytes in the cursor.
|
||||
#[inline]
|
||||
pub fn ensure_init(&mut self) -> &mut Self {
|
||||
// SAFETY: always in bounds and we never uninitialize these bytes.
|
||||
let uninit = unsafe { self.buf.buf.get_unchecked_mut(self.buf.init..) };
|
||||
|
||||
// SAFETY: 0 is a valid value for MaybeUninit<u8> and the length matches the allocation
|
||||
// since it is comes from a slice reference.
|
||||
unsafe {
|
||||
ptr::write_bytes(uninit.as_mut_ptr(), 0, uninit.len());
|
||||
}
|
||||
self.buf.init = self.buf.capacity();
|
||||
|
||||
self
|
||||
}
|
||||
|
||||
/// Asserts that the first `n` unfilled bytes of the cursor are initialized.
|
||||
///
|
||||
/// `BorrowedBuf` assumes that bytes are never de-initialized, so this method does nothing when
|
||||
/// called with fewer bytes than are already known to be initialized.
|
||||
///
|
||||
/// # Safety
|
||||
///
|
||||
/// The caller must ensure that the first `n` bytes of the buffer have already been initialized.
|
||||
#[inline]
|
||||
pub unsafe fn set_init(&mut self, n: usize) -> &mut Self {
|
||||
self.buf.init = cmp::max(self.buf.init, self.buf.filled + n);
|
||||
self
|
||||
}
|
||||
|
||||
|
|
@ -341,10 +247,6 @@ impl<'a> BorrowedCursor<'a> {
|
|||
self.as_mut()[..buf.len()].write_copy_of_slice(buf);
|
||||
}
|
||||
|
||||
// SAFETY: We just added the entire contents of buf to the filled section.
|
||||
unsafe {
|
||||
self.set_init(buf.len());
|
||||
}
|
||||
self.buf.filled += buf.len();
|
||||
}
|
||||
|
||||
|
|
@ -367,17 +269,9 @@ impl<'a> BorrowedCursor<'a> {
|
|||
// there, one could mark some bytes as initialized even though there aren't.
|
||||
assert!(core::ptr::addr_eq(prev_ptr, buf.buf));
|
||||
|
||||
let filled = buf.filled;
|
||||
let init = buf.init;
|
||||
|
||||
// Update `init` and `filled` fields with what was written to the buffer.
|
||||
// `self.buf.filled` was the starting length of the `BorrowedBuf`.
|
||||
//
|
||||
// SAFETY: These amounts of bytes were initialized/filled in the `BorrowedBuf`,
|
||||
// and therefore they are initialized/filled in the cursor too, because the
|
||||
// buffer wasn't replaced.
|
||||
self.buf.init = self.buf.filled + init;
|
||||
self.buf.filled += filled;
|
||||
// SAFETY: These bytes were filled in the `BorrowedBuf`, so they're filled in the cursor
|
||||
// too, because the buffer wasn't replaced.
|
||||
self.buf.filled += buf.filled;
|
||||
|
||||
res
|
||||
}
|
||||
|
|
|
|||
|
|
@ -8,7 +8,6 @@ fn new() {
|
|||
let mut rbuf: BorrowedBuf<'_> = buf.into();
|
||||
|
||||
assert_eq!(rbuf.filled().len(), 0);
|
||||
assert_eq!(rbuf.init_len(), 16);
|
||||
assert_eq!(rbuf.capacity(), 16);
|
||||
assert_eq!(rbuf.unfilled().capacity(), 16);
|
||||
}
|
||||
|
|
@ -20,27 +19,16 @@ fn uninit() {
|
|||
let mut rbuf: BorrowedBuf<'_> = buf.into();
|
||||
|
||||
assert_eq!(rbuf.filled().len(), 0);
|
||||
assert_eq!(rbuf.init_len(), 0);
|
||||
assert_eq!(rbuf.capacity(), 16);
|
||||
assert_eq!(rbuf.unfilled().capacity(), 16);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn initialize_unfilled() {
|
||||
let buf: &mut [_] = &mut [MaybeUninit::uninit(); 16];
|
||||
let mut rbuf: BorrowedBuf<'_> = buf.into();
|
||||
|
||||
rbuf.unfilled().ensure_init();
|
||||
|
||||
assert_eq!(rbuf.init_len(), 16);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn advance_filled() {
|
||||
let buf: &mut [_] = &mut [0; 16];
|
||||
let mut rbuf: BorrowedBuf<'_> = buf.into();
|
||||
|
||||
rbuf.unfilled().advance(1);
|
||||
unsafe { rbuf.unfilled().advance(1) };
|
||||
|
||||
assert_eq!(rbuf.filled().len(), 1);
|
||||
assert_eq!(rbuf.unfilled().capacity(), 15);
|
||||
|
|
@ -51,7 +39,7 @@ fn clear() {
|
|||
let buf: &mut [_] = &mut [255; 16];
|
||||
let mut rbuf: BorrowedBuf<'_> = buf.into();
|
||||
|
||||
rbuf.unfilled().advance(16);
|
||||
unsafe { rbuf.unfilled().advance(16) };
|
||||
|
||||
assert_eq!(rbuf.filled().len(), 16);
|
||||
assert_eq!(rbuf.unfilled().capacity(), 0);
|
||||
|
|
@ -61,33 +49,9 @@ fn clear() {
|
|||
assert_eq!(rbuf.filled().len(), 0);
|
||||
assert_eq!(rbuf.unfilled().capacity(), 16);
|
||||
|
||||
assert_eq!(rbuf.unfilled().init_mut(), [255; 16]);
|
||||
}
|
||||
unsafe { rbuf.unfilled().advance(16) };
|
||||
|
||||
#[test]
|
||||
fn set_init() {
|
||||
let buf: &mut [_] = &mut [MaybeUninit::zeroed(); 16];
|
||||
let mut rbuf: BorrowedBuf<'_> = buf.into();
|
||||
|
||||
unsafe {
|
||||
rbuf.set_init(8);
|
||||
}
|
||||
|
||||
assert_eq!(rbuf.init_len(), 8);
|
||||
|
||||
rbuf.unfilled().advance(4);
|
||||
|
||||
unsafe {
|
||||
rbuf.set_init(2);
|
||||
}
|
||||
|
||||
assert_eq!(rbuf.init_len(), 8);
|
||||
|
||||
unsafe {
|
||||
rbuf.set_init(8);
|
||||
}
|
||||
|
||||
assert_eq!(rbuf.init_len(), 8);
|
||||
assert_eq!(rbuf.filled(), [255; 16]);
|
||||
}
|
||||
|
||||
#[test]
|
||||
|
|
@ -97,7 +61,6 @@ fn append() {
|
|||
|
||||
rbuf.unfilled().append(&[0; 8]);
|
||||
|
||||
assert_eq!(rbuf.init_len(), 8);
|
||||
assert_eq!(rbuf.filled().len(), 8);
|
||||
assert_eq!(rbuf.filled(), [0; 8]);
|
||||
|
||||
|
|
@ -105,7 +68,6 @@ fn append() {
|
|||
|
||||
rbuf.unfilled().append(&[1; 16]);
|
||||
|
||||
assert_eq!(rbuf.init_len(), 16);
|
||||
assert_eq!(rbuf.filled().len(), 16);
|
||||
assert_eq!(rbuf.filled(), [1; 16]);
|
||||
}
|
||||
|
|
@ -125,43 +87,12 @@ fn reborrow_written() {
|
|||
assert_eq!(cursor.written(), 32);
|
||||
|
||||
assert_eq!(buf.unfilled().written(), 32);
|
||||
assert_eq!(buf.init_len(), 32);
|
||||
assert_eq!(buf.filled().len(), 32);
|
||||
let filled = buf.filled();
|
||||
assert_eq!(&filled[..16], [1; 16]);
|
||||
assert_eq!(&filled[16..], [2; 16]);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn cursor_set_init() {
|
||||
let buf: &mut [_] = &mut [MaybeUninit::zeroed(); 16];
|
||||
let mut rbuf: BorrowedBuf<'_> = buf.into();
|
||||
|
||||
unsafe {
|
||||
rbuf.unfilled().set_init(8);
|
||||
}
|
||||
|
||||
assert_eq!(rbuf.init_len(), 8);
|
||||
assert_eq!(rbuf.unfilled().init_mut().len(), 8);
|
||||
assert_eq!(unsafe { rbuf.unfilled().as_mut().len() }, 16);
|
||||
|
||||
rbuf.unfilled().advance(4);
|
||||
|
||||
unsafe {
|
||||
rbuf.unfilled().set_init(2);
|
||||
}
|
||||
|
||||
assert_eq!(rbuf.init_len(), 8);
|
||||
|
||||
unsafe {
|
||||
rbuf.unfilled().set_init(8);
|
||||
}
|
||||
|
||||
assert_eq!(rbuf.init_len(), 12);
|
||||
assert_eq!(rbuf.unfilled().init_mut().len(), 8);
|
||||
assert_eq!(unsafe { rbuf.unfilled().as_mut().len() }, 12);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn cursor_with_unfilled_buf() {
|
||||
let buf: &mut [_] = &mut [MaybeUninit::uninit(); 16];
|
||||
|
|
@ -169,31 +100,30 @@ fn cursor_with_unfilled_buf() {
|
|||
let mut cursor = rbuf.unfilled();
|
||||
|
||||
cursor.with_unfilled_buf(|buf| {
|
||||
assert_eq!(buf.capacity(), 16);
|
||||
buf.unfilled().append(&[1, 2, 3]);
|
||||
assert_eq!(buf.filled(), &[1, 2, 3]);
|
||||
});
|
||||
|
||||
assert_eq!(cursor.init_mut().len(), 0);
|
||||
assert_eq!(cursor.written(), 3);
|
||||
|
||||
cursor.with_unfilled_buf(|buf| {
|
||||
assert_eq!(buf.capacity(), 13);
|
||||
assert_eq!(buf.init_len(), 0);
|
||||
|
||||
buf.unfilled().ensure_init();
|
||||
buf.unfilled().advance(4);
|
||||
unsafe {
|
||||
buf.unfilled().as_mut().write_filled(0);
|
||||
buf.unfilled().advance(4)
|
||||
};
|
||||
});
|
||||
|
||||
assert_eq!(cursor.init_mut().len(), 9);
|
||||
assert_eq!(cursor.written(), 7);
|
||||
|
||||
cursor.with_unfilled_buf(|buf| {
|
||||
assert_eq!(buf.capacity(), 9);
|
||||
assert_eq!(buf.init_len(), 9);
|
||||
});
|
||||
|
||||
assert_eq!(cursor.init_mut().len(), 9);
|
||||
assert_eq!(cursor.written(), 7);
|
||||
assert_eq!(rbuf.len(), 7);
|
||||
|
||||
assert_eq!(rbuf.filled(), &[1, 2, 3, 0, 0, 0, 0]);
|
||||
}
|
||||
|
|
|
|||
|
|
@ -709,8 +709,6 @@ fn file_test_read_buf() {
|
|||
let mut file = check!(File::open(filename));
|
||||
check!(file.read_buf(buf.unfilled()));
|
||||
assert_eq!(buf.filled(), &[1, 2, 3, 4]);
|
||||
// File::read_buf should omit buffer initialization.
|
||||
assert_eq!(buf.init_len(), 4);
|
||||
|
||||
check!(fs::remove_file(filename));
|
||||
}
|
||||
|
|
|
|||
|
|
@ -284,15 +284,6 @@ impl<R: ?Sized> BufReader<R> {
|
|||
}
|
||||
}
|
||||
|
||||
// This is only used by a test which asserts that the initialization-tracking is correct.
|
||||
#[cfg(test)]
|
||||
impl<R: ?Sized> BufReader<R> {
|
||||
#[allow(missing_docs)]
|
||||
pub fn initialized(&self) -> usize {
|
||||
self.buf.initialized()
|
||||
}
|
||||
}
|
||||
|
||||
impl<R: ?Sized + Seek> BufReader<R> {
|
||||
/// Seeks relative to the current position. If the new position lies within the buffer,
|
||||
/// the buffer will not be flushed, allowing for more efficient seeks.
|
||||
|
|
|
|||
|
|
@ -21,25 +21,19 @@ pub struct Buffer {
|
|||
// Each call to `fill_buf` sets `filled` to indicate how many bytes at the start of `buf` are
|
||||
// initialized with bytes from a read.
|
||||
filled: usize,
|
||||
// This is the max number of bytes returned across all `fill_buf` calls. We track this so that we
|
||||
// can accurately tell `read_buf` how many bytes of buf are initialized, to bypass as much of its
|
||||
// defensive initialization as possible. Note that while this often the same as `filled`, it
|
||||
// doesn't need to be. Calls to `fill_buf` are not required to actually fill the buffer, and
|
||||
// omitting this is a huge perf regression for `Read` impls that do not.
|
||||
initialized: usize,
|
||||
}
|
||||
|
||||
impl Buffer {
|
||||
#[inline]
|
||||
pub fn with_capacity(capacity: usize) -> Self {
|
||||
let buf = Box::new_uninit_slice(capacity);
|
||||
Self { buf, pos: 0, filled: 0, initialized: 0 }
|
||||
Self { buf, pos: 0, filled: 0 }
|
||||
}
|
||||
|
||||
#[inline]
|
||||
pub fn try_with_capacity(capacity: usize) -> io::Result<Self> {
|
||||
match Box::try_new_uninit_slice(capacity) {
|
||||
Ok(buf) => Ok(Self { buf, pos: 0, filled: 0, initialized: 0 }),
|
||||
Ok(buf) => Ok(Self { buf, pos: 0, filled: 0 }),
|
||||
Err(_) => {
|
||||
Err(io::const_error!(ErrorKind::OutOfMemory, "failed to allocate read buffer"))
|
||||
}
|
||||
|
|
@ -68,12 +62,6 @@ impl Buffer {
|
|||
self.pos
|
||||
}
|
||||
|
||||
// This is only used by a test which asserts that the initialization-tracking is correct.
|
||||
#[cfg(test)]
|
||||
pub fn initialized(&self) -> usize {
|
||||
self.initialized
|
||||
}
|
||||
|
||||
#[inline]
|
||||
pub fn discard_buffer(&mut self) {
|
||||
self.pos = 0;
|
||||
|
|
@ -110,13 +98,8 @@ impl Buffer {
|
|||
/// Read more bytes into the buffer without discarding any of its contents
|
||||
pub fn read_more(&mut self, mut reader: impl Read) -> io::Result<usize> {
|
||||
let mut buf = BorrowedBuf::from(&mut self.buf[self.filled..]);
|
||||
let old_init = self.initialized - self.filled;
|
||||
unsafe {
|
||||
buf.set_init(old_init);
|
||||
}
|
||||
reader.read_buf(buf.unfilled())?;
|
||||
self.filled += buf.len();
|
||||
self.initialized += buf.init_len() - old_init;
|
||||
Ok(buf.len())
|
||||
}
|
||||
|
||||
|
|
@ -137,16 +120,10 @@ impl Buffer {
|
|||
debug_assert!(self.pos == self.filled);
|
||||
|
||||
let mut buf = BorrowedBuf::from(&mut *self.buf);
|
||||
// SAFETY: `self.filled` bytes will always have been initialized.
|
||||
unsafe {
|
||||
buf.set_init(self.initialized);
|
||||
}
|
||||
|
||||
let result = reader.read_buf(buf.unfilled());
|
||||
|
||||
self.pos = 0;
|
||||
self.filled = buf.len();
|
||||
self.initialized = buf.init_len();
|
||||
|
||||
result?;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1052,30 +1052,6 @@ fn single_formatted_write() {
|
|||
assert_eq!(writer.get_ref().events, [RecordedEvent::Write("hello, world!\n".to_string())]);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn bufreader_full_initialize() {
|
||||
struct OneByteReader;
|
||||
impl Read for OneByteReader {
|
||||
fn read(&mut self, buf: &mut [u8]) -> crate::io::Result<usize> {
|
||||
if buf.len() > 0 {
|
||||
buf[0] = 0;
|
||||
Ok(1)
|
||||
} else {
|
||||
Ok(0)
|
||||
}
|
||||
}
|
||||
}
|
||||
let mut reader = BufReader::new(OneByteReader);
|
||||
// Nothing is initialized yet.
|
||||
assert_eq!(reader.initialized(), 0);
|
||||
|
||||
let buf = reader.fill_buf().unwrap();
|
||||
// We read one byte...
|
||||
assert_eq!(buf.len(), 1);
|
||||
// But we initialized the whole buffer!
|
||||
assert_eq!(reader.initialized(), reader.capacity());
|
||||
}
|
||||
|
||||
/// This is a regression test for https://github.com/rust-lang/rust/issues/127584.
|
||||
#[test]
|
||||
fn bufwriter_aliasing() {
|
||||
|
|
|
|||
|
|
@ -214,28 +214,19 @@ impl<I: Write + ?Sized> BufferedWriterSpec for BufWriter<I> {
|
|||
}
|
||||
|
||||
let mut len = 0;
|
||||
let mut init = 0;
|
||||
|
||||
loop {
|
||||
let buf = self.buffer_mut();
|
||||
let mut read_buf: BorrowedBuf<'_> = buf.spare_capacity_mut().into();
|
||||
|
||||
unsafe {
|
||||
// SAFETY: init is either 0 or the init_len from the previous iteration.
|
||||
read_buf.set_init(init);
|
||||
}
|
||||
|
||||
if read_buf.capacity() >= DEFAULT_BUF_SIZE {
|
||||
let mut cursor = read_buf.unfilled();
|
||||
match reader.read_buf(cursor.reborrow()) {
|
||||
Ok(()) => {
|
||||
let bytes_read = cursor.written();
|
||||
|
||||
if bytes_read == 0 {
|
||||
return Ok(len);
|
||||
}
|
||||
|
||||
init = read_buf.init_len() - bytes_read;
|
||||
len += bytes_read as u64;
|
||||
|
||||
// SAFETY: BorrowedBuf guarantees all of its filled bytes are init
|
||||
|
|
@ -248,10 +239,6 @@ impl<I: Write + ?Sized> BufferedWriterSpec for BufWriter<I> {
|
|||
Err(e) => return Err(e),
|
||||
}
|
||||
} else {
|
||||
// All the bytes that were already in the buffer are initialized,
|
||||
// treat them as such when the buffer is flushed.
|
||||
init += buf.len();
|
||||
|
||||
self.flush_buf()?;
|
||||
}
|
||||
}
|
||||
|
|
|
|||
|
|
@ -419,8 +419,6 @@ pub(crate) fn default_read_to_end<R: Read + ?Sized>(
|
|||
.and_then(|s| s.checked_add(1024)?.checked_next_multiple_of(DEFAULT_BUF_SIZE))
|
||||
.unwrap_or(DEFAULT_BUF_SIZE);
|
||||
|
||||
let mut initialized = 0; // Extra initialized bytes from previous loop iteration
|
||||
|
||||
const PROBE_SIZE: usize = 32;
|
||||
|
||||
fn small_probe_read<R: Read + ?Sized>(r: &mut R, buf: &mut Vec<u8>) -> Result<usize> {
|
||||
|
|
@ -449,8 +447,6 @@ pub(crate) fn default_read_to_end<R: Read + ?Sized>(
|
|||
}
|
||||
}
|
||||
|
||||
let mut consecutive_short_reads = 0;
|
||||
|
||||
loop {
|
||||
if buf.len() == buf.capacity() && buf.capacity() == start_cap {
|
||||
// The buffer might be an exact fit. Let's read into a probe buffer
|
||||
|
|
@ -474,11 +470,6 @@ pub(crate) fn default_read_to_end<R: Read + ?Sized>(
|
|||
spare = &mut spare[..buf_len];
|
||||
let mut read_buf: BorrowedBuf<'_> = spare.into();
|
||||
|
||||
// SAFETY: These bytes were initialized but not filled in the previous loop
|
||||
unsafe {
|
||||
read_buf.set_init(initialized);
|
||||
}
|
||||
|
||||
let mut cursor = read_buf.unfilled();
|
||||
let result = loop {
|
||||
match r.read_buf(cursor.reborrow()) {
|
||||
|
|
@ -489,9 +480,7 @@ pub(crate) fn default_read_to_end<R: Read + ?Sized>(
|
|||
}
|
||||
};
|
||||
|
||||
let unfilled_but_initialized = cursor.init_mut().len();
|
||||
let bytes_read = cursor.written();
|
||||
let was_fully_initialized = read_buf.init_len() == buf_len;
|
||||
|
||||
// SAFETY: BorrowedBuf's invariants mean this much memory is initialized.
|
||||
unsafe {
|
||||
|
|
@ -506,27 +495,8 @@ pub(crate) fn default_read_to_end<R: Read + ?Sized>(
|
|||
return Ok(buf.len() - start_len);
|
||||
}
|
||||
|
||||
if bytes_read < buf_len {
|
||||
consecutive_short_reads += 1;
|
||||
} else {
|
||||
consecutive_short_reads = 0;
|
||||
}
|
||||
|
||||
// store how much was initialized but not filled
|
||||
initialized = unfilled_but_initialized;
|
||||
|
||||
// Use heuristics to determine the max read size if no initial size hint was provided
|
||||
if size_hint.is_none() {
|
||||
// The reader is returning short reads but it doesn't call ensure_init().
|
||||
// In that case we no longer need to restrict read sizes to avoid
|
||||
// initialization costs.
|
||||
// When reading from disk we usually don't get any short reads except at EOF.
|
||||
// So we wait for at least 2 short reads before uncapping the read buffer;
|
||||
// this helps with the Windows issue.
|
||||
if !was_fully_initialized && consecutive_short_reads > 1 {
|
||||
max_read_size = usize::MAX;
|
||||
}
|
||||
|
||||
// we have passed a larger buffer than previously and the
|
||||
// reader still hasn't returned a short read
|
||||
if buf_len >= max_read_size && bytes_read == buf_len {
|
||||
|
|
@ -587,8 +557,13 @@ pub(crate) fn default_read_buf<F>(read: F, mut cursor: BorrowedCursor<'_>) -> Re
|
|||
where
|
||||
F: FnOnce(&mut [u8]) -> Result<usize>,
|
||||
{
|
||||
let n = read(cursor.ensure_init().init_mut())?;
|
||||
cursor.advance(n);
|
||||
// SAFETY: We do not uninitialize any part of the buffer.
|
||||
let n = read(unsafe { cursor.as_mut().write_filled(0) })?;
|
||||
assert!(n <= cursor.capacity());
|
||||
// SAFETY: We've initialized the entire buffer, and `read` can't make it uninitialized.
|
||||
unsafe {
|
||||
cursor.advance(n);
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
|
||||
|
|
@ -3098,31 +3073,21 @@ impl<T: Read> Read for Take<T> {
|
|||
// The condition above guarantees that `self.limit` fits in `usize`.
|
||||
let limit = self.limit as usize;
|
||||
|
||||
let extra_init = cmp::min(limit, buf.init_mut().len());
|
||||
|
||||
// SAFETY: no uninit data is written to ibuf
|
||||
let ibuf = unsafe { &mut buf.as_mut()[..limit] };
|
||||
|
||||
let mut sliced_buf: BorrowedBuf<'_> = ibuf.into();
|
||||
|
||||
// SAFETY: extra_init bytes of ibuf are known to be initialized
|
||||
unsafe {
|
||||
sliced_buf.set_init(extra_init);
|
||||
}
|
||||
|
||||
let mut cursor = sliced_buf.unfilled();
|
||||
let result = self.inner.read_buf(cursor.reborrow());
|
||||
|
||||
let new_init = cursor.init_mut().len();
|
||||
let filled = sliced_buf.len();
|
||||
|
||||
// cursor / sliced_buf / ibuf must drop here
|
||||
|
||||
// SAFETY: filled bytes have been filled and therefore initialized
|
||||
unsafe {
|
||||
// SAFETY: filled bytes have been filled and therefore initialized
|
||||
buf.advance_unchecked(filled);
|
||||
// SAFETY: new_init bytes of buf's unfilled buffer have been initialized
|
||||
buf.set_init(new_init);
|
||||
buf.advance(filled);
|
||||
}
|
||||
|
||||
self.limit -= filled as u64;
|
||||
|
|
|
|||
|
|
@ -209,15 +209,6 @@ fn read_buf_exact() {
|
|||
assert_eq!(c.read_buf_exact(buf.unfilled()).unwrap_err().kind(), io::ErrorKind::UnexpectedEof);
|
||||
}
|
||||
|
||||
#[test]
|
||||
#[should_panic]
|
||||
fn borrowed_cursor_advance_overflow() {
|
||||
let mut buf = [0; 512];
|
||||
let mut buf = BorrowedBuf::from(&mut buf[..]);
|
||||
buf.unfilled().advance(1);
|
||||
buf.unfilled().advance(usize::MAX);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn take_eof() {
|
||||
struct R;
|
||||
|
|
|
|||
|
|
@ -283,7 +283,7 @@ impl Read for Repeat {
|
|||
// SAFETY: No uninit bytes are being written.
|
||||
unsafe { buf.as_mut() }.write_filled(self.byte);
|
||||
// SAFETY: the entire unfilled portion of buf has been initialized.
|
||||
unsafe { buf.advance_unchecked(buf.capacity()) };
|
||||
unsafe { buf.advance(buf.capacity()) };
|
||||
Ok(())
|
||||
}
|
||||
|
||||
|
|
|
|||
|
|
@ -75,43 +75,36 @@ fn empty_reads() {
|
|||
let mut buf: BorrowedBuf<'_> = buf.into();
|
||||
e.read_buf(buf.unfilled()).unwrap();
|
||||
assert_eq!(buf.len(), 0);
|
||||
assert_eq!(buf.init_len(), 0);
|
||||
|
||||
let buf: &mut [_] = &mut [MaybeUninit::uninit()];
|
||||
let mut buf: BorrowedBuf<'_> = buf.into();
|
||||
e.read_buf(buf.unfilled()).unwrap();
|
||||
assert_eq!(buf.len(), 0);
|
||||
assert_eq!(buf.init_len(), 0);
|
||||
|
||||
let buf: &mut [_] = &mut [MaybeUninit::uninit(); 1024];
|
||||
let mut buf: BorrowedBuf<'_> = buf.into();
|
||||
e.read_buf(buf.unfilled()).unwrap();
|
||||
assert_eq!(buf.len(), 0);
|
||||
assert_eq!(buf.init_len(), 0);
|
||||
|
||||
let buf: &mut [_] = &mut [MaybeUninit::uninit(); 1024];
|
||||
let mut buf: BorrowedBuf<'_> = buf.into();
|
||||
Read::by_ref(&mut e).read_buf(buf.unfilled()).unwrap();
|
||||
assert_eq!(buf.len(), 0);
|
||||
assert_eq!(buf.init_len(), 0);
|
||||
|
||||
let buf: &mut [MaybeUninit<_>] = &mut [];
|
||||
let mut buf: BorrowedBuf<'_> = buf.into();
|
||||
e.read_buf_exact(buf.unfilled()).unwrap();
|
||||
assert_eq!(buf.len(), 0);
|
||||
assert_eq!(buf.init_len(), 0);
|
||||
|
||||
let buf: &mut [_] = &mut [MaybeUninit::uninit()];
|
||||
let mut buf: BorrowedBuf<'_> = buf.into();
|
||||
assert_eq!(e.read_buf_exact(buf.unfilled()).unwrap_err().kind(), ErrorKind::UnexpectedEof);
|
||||
assert_eq!(buf.len(), 0);
|
||||
assert_eq!(buf.init_len(), 0);
|
||||
|
||||
let buf: &mut [_] = &mut [MaybeUninit::uninit(); 1024];
|
||||
let mut buf: BorrowedBuf<'_> = buf.into();
|
||||
assert_eq!(e.read_buf_exact(buf.unfilled()).unwrap_err().kind(), ErrorKind::UnexpectedEof);
|
||||
assert_eq!(buf.len(), 0);
|
||||
assert_eq!(buf.init_len(), 0);
|
||||
|
||||
let buf: &mut [_] = &mut [MaybeUninit::uninit(); 1024];
|
||||
let mut buf: BorrowedBuf<'_> = buf.into();
|
||||
|
|
@ -120,7 +113,6 @@ fn empty_reads() {
|
|||
ErrorKind::UnexpectedEof,
|
||||
);
|
||||
assert_eq!(buf.len(), 0);
|
||||
assert_eq!(buf.init_len(), 0);
|
||||
|
||||
let mut buf = Vec::new();
|
||||
assert_eq!(e.read_to_end(&mut buf).unwrap(), 0);
|
||||
|
|
|
|||
|
|
@ -315,8 +315,6 @@ fn read_buf() {
|
|||
let mut buf = BorrowedBuf::from(buf.as_mut_slice());
|
||||
t!(s.read_buf(buf.unfilled()));
|
||||
assert_eq!(buf.filled(), &[1, 2, 3, 4]);
|
||||
// TcpStream::read_buf should omit buffer initialization.
|
||||
assert_eq!(buf.init_len(), 4);
|
||||
|
||||
t.join().ok().expect("thread panicked");
|
||||
})
|
||||
|
|
|
|||
|
|
@ -188,10 +188,8 @@ fn child_stdout_read_buf() {
|
|||
// ChildStdout::read_buf should omit buffer initialization.
|
||||
if cfg!(target_os = "windows") {
|
||||
assert_eq!(buf.filled(), b"abc\r\n");
|
||||
assert_eq!(buf.init_len(), 5);
|
||||
} else {
|
||||
assert_eq!(buf.filled(), b"abc\n");
|
||||
assert_eq!(buf.init_len(), 4);
|
||||
};
|
||||
}
|
||||
|
||||
|
|
|
|||
|
|
@ -34,7 +34,7 @@ impl FileDesc {
|
|||
)
|
||||
})?;
|
||||
// SAFETY: Exactly `result` bytes have been filled.
|
||||
unsafe { buf.advance_unchecked(result as usize) };
|
||||
unsafe { buf.advance(result as usize) };
|
||||
Ok(())
|
||||
}
|
||||
|
||||
|
|
|
|||
|
|
@ -185,7 +185,7 @@ impl FileDesc {
|
|||
|
||||
// SAFETY: `ret` bytes were written to the initialized portion of the buffer
|
||||
unsafe {
|
||||
cursor.advance_unchecked(ret as usize);
|
||||
cursor.advance(ret as usize);
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
|
|
@ -203,7 +203,7 @@ impl FileDesc {
|
|||
|
||||
// SAFETY: `ret` bytes were written to the initialized portion of the buffer
|
||||
unsafe {
|
||||
cursor.advance_unchecked(ret as usize);
|
||||
cursor.advance(ret as usize);
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
|
|
|
|||
|
|
@ -59,7 +59,7 @@ impl WasiFd {
|
|||
}];
|
||||
match wasi::fd_read(self.as_raw_fd() as wasi::Fd, &bufs) {
|
||||
Ok(n) => {
|
||||
buf.advance_unchecked(n);
|
||||
buf.advance(n);
|
||||
Ok(())
|
||||
}
|
||||
Err(e) => Err(err2io(e)),
|
||||
|
|
|
|||
|
|
@ -401,7 +401,7 @@ impl File {
|
|||
|
||||
// Safety: `num_bytes_read` bytes were written to the unfilled
|
||||
// portion of the buffer
|
||||
cursor.advance_unchecked(num_bytes_read);
|
||||
cursor.advance(num_bytes_read);
|
||||
|
||||
Ok(())
|
||||
}
|
||||
|
|
|
|||
|
|
@ -143,7 +143,7 @@ impl Socket {
|
|||
)
|
||||
})?;
|
||||
unsafe {
|
||||
buf.advance_unchecked(ret as usize);
|
||||
buf.advance(ret as usize);
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
|
|
|
|||
|
|
@ -191,7 +191,7 @@ impl Socket {
|
|||
netc::recv(self.as_raw_fd(), buf.as_mut().as_mut_ptr().cast(), buf.capacity(), flags)
|
||||
})?;
|
||||
unsafe {
|
||||
buf.advance_unchecked(ret as usize);
|
||||
buf.advance(ret as usize);
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
|
|
|
|||
|
|
@ -293,7 +293,7 @@ impl Socket {
|
|||
)
|
||||
})?;
|
||||
unsafe {
|
||||
buf.advance_unchecked(ret as usize);
|
||||
buf.advance(ret as usize);
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
|
|
|
|||
|
|
@ -167,7 +167,7 @@ impl Socket {
|
|||
)
|
||||
})?;
|
||||
unsafe {
|
||||
buf.advance_unchecked(ret as usize);
|
||||
buf.advance(ret as usize);
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
|
|
|
|||
|
|
@ -244,7 +244,7 @@ impl Socket {
|
|||
}
|
||||
}
|
||||
_ => {
|
||||
unsafe { buf.advance_unchecked(result as usize) };
|
||||
unsafe { buf.advance(result as usize) };
|
||||
Ok(())
|
||||
}
|
||||
}
|
||||
|
|
|
|||
|
|
@ -46,7 +46,7 @@ pub fn read_buf(fd: Fd, mut buf: BorrowedCursor<'_>) -> IoResult<()> {
|
|||
let mut userbuf = alloc::User::<[u8]>::uninitialized(buf.capacity());
|
||||
let len = raw::read(fd, userbuf.as_mut_ptr().cast(), userbuf.len()).from_sgx_result()?;
|
||||
userbuf[..len].copy_to_enclave(&mut buf.as_mut()[..len]);
|
||||
buf.advance_unchecked(len);
|
||||
buf.advance(len);
|
||||
Ok(())
|
||||
}
|
||||
}
|
||||
|
|
|
|||
|
|
@ -121,7 +121,7 @@ impl Handle {
|
|||
Ok(read) => {
|
||||
// Safety: `read` bytes were written to the initialized portion of the buffer
|
||||
unsafe {
|
||||
cursor.advance_unchecked(read);
|
||||
cursor.advance(read);
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
|
|
@ -144,7 +144,7 @@ impl Handle {
|
|||
|
||||
// SAFETY: `read` bytes were written to the initialized portion of the buffer
|
||||
unsafe {
|
||||
cursor.advance_unchecked(read);
|
||||
cursor.advance(read);
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
|
|
|
|||
|
|
@ -259,7 +259,7 @@ impl AnonPipe {
|
|||
Err(e) => Err(e),
|
||||
Ok(n) => {
|
||||
unsafe {
|
||||
buf.advance_unchecked(n);
|
||||
buf.advance(n);
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
|
|
|
|||
|
|
@ -19,7 +19,7 @@ impl io::Read for Stdin {
|
|||
fn read_buf(&mut self, mut buf: BorrowedCursor<'_>) -> io::Result<()> {
|
||||
unsafe {
|
||||
let n = abi::sys_read(fileno::STDIN, buf.as_mut().as_mut_ptr().cast(), buf.capacity());
|
||||
buf.advance_unchecked(n);
|
||||
buf.advance(n);
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
|
|
|
|||
|
|
@ -5,11 +5,13 @@ use std::fmt::{self, Display, Formatter, FormattingOptions};
|
|||
pub(crate) trait Joined: IntoIterator {
|
||||
/// Takes an iterator over elements that implement [`Display`], and format them into `f`, separated by `sep`.
|
||||
///
|
||||
/// This is similar to [`Itertools::format`](itertools::Itertools::format), but instead of returning an implementation of `Display`,
|
||||
/// This is similar to [`Itertools::format`], but instead of returning an implementation of `Display`,
|
||||
/// it formats directly into a [`Formatter`].
|
||||
///
|
||||
/// The performance of `joined` is slightly better than `format`, since it doesn't need to use a `Cell` to keep track of whether [`fmt`](Display::fmt)
|
||||
/// was already called (`joined`'s API doesn't allow it be called more than once).
|
||||
///
|
||||
/// [`Itertools::format`]: https://docs.rs/itertools/latest/itertools/trait.Itertools.html#method.format
|
||||
fn joined(&mut self, sep: impl Display, f: &mut Formatter<'_>) -> fmt::Result;
|
||||
}
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue