pub struct CachePadded<T> { /* private fields */ }Expand description
Pads and aligns a value to the length of a cache line.
In concurrent programming, sometimes it is desirable to make sure commonly accessed pieces of
data are not placed into the same cache line. Updating an atomic value invalidates the whole
cache line it belongs to, which makes the next access to the same cache line slower for other
CPU cores. Use CachePadded to ensure updating one piece of data doesn’t invalidate other
cached data.
§Size and alignment
Cache lines are assumed to be N bytes long, depending on the architecture:
- On x86-64, aarch64, and powerpc64, N = 128.
- On arm, mips, mips64, sparc, and hexagon, N = 32.
- On m68k, N = 16.
- On s390x, N = 256.
- On all others, N = 64.
Note that N is just a reasonable guess and is not guaranteed to match the actual cache line length of the machine the program is running on. On modern Intel architectures, spatial prefetcher is pulling pairs of 64-byte cache lines at a time, so we pessimistically assume that cache lines are 128 bytes long.
The size of CachePadded<T> is the smallest multiple of N bytes large enough to accommodate
a value of type T.
The alignment of CachePadded<T> is the maximum of N bytes and the alignment of T.
Implementations§
Source§impl<T> CachePadded<T>
impl<T> CachePadded<T>
Sourcepub const fn new(t: T) -> CachePadded<T>
pub const fn new(t: T) -> CachePadded<T>
Pads and aligns a value to the length of a cache line.
Sourcepub fn into_inner(self) -> T
pub fn into_inner(self) -> T
Returns the inner value.
Trait Implementations§
Source§impl<T: Clone> Clone for CachePadded<T>
impl<T: Clone> Clone for CachePadded<T>
Source§fn clone(&self) -> CachePadded<T>
fn clone(&self) -> CachePadded<T>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl<T: Debug> Debug for CachePadded<T>
impl<T: Debug> Debug for CachePadded<T>
Source§impl<T: Default> Default for CachePadded<T>
impl<T: Default> Default for CachePadded<T>
Source§fn default() -> CachePadded<T>
fn default() -> CachePadded<T>
Source§impl<T> Deref for CachePadded<T>
impl<T> Deref for CachePadded<T>
Source§impl<T> DerefMut for CachePadded<T>
impl<T> DerefMut for CachePadded<T>
Source§impl<T: Display> Display for CachePadded<T>
impl<T: Display> Display for CachePadded<T>
Source§impl<T> From<T> for CachePadded<T>
impl<T> From<T> for CachePadded<T>
Source§impl<T: Hash> Hash for CachePadded<T>
impl<T: Hash> Hash for CachePadded<T>
Source§impl<T: PartialEq> PartialEq for CachePadded<T>
impl<T: PartialEq> PartialEq for CachePadded<T>
impl<T: Copy> Copy for CachePadded<T>
impl<T: Eq> Eq for CachePadded<T>
impl<T: Send> Send for CachePadded<T>
impl<T> StructuralPartialEq for CachePadded<T>
impl<T: Sync> Sync for CachePadded<T>
Auto Trait Implementations§
impl<T> Freeze for CachePadded<T>where
T: Freeze,
impl<T> RefUnwindSafe for CachePadded<T>where
T: RefUnwindSafe,
impl<T> Unpin for CachePadded<T>where
T: Unpin,
impl<T> UnwindSafe for CachePadded<T>where
T: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<R> Rng for R
impl<R> Rng for R
Source§fn random<T>(&mut self) -> Twhere
StandardUniform: Distribution<T>,
fn random<T>(&mut self) -> Twhere
StandardUniform: Distribution<T>,
StandardUniform distribution. Read moreSource§fn random_iter<T>(self) -> Iter<StandardUniform, Self, T>
fn random_iter<T>(self) -> Iter<StandardUniform, Self, T>
Source§fn random_range<T, R>(&mut self, range: R) -> Twhere
T: SampleUniform,
R: SampleRange<T>,
fn random_range<T, R>(&mut self, range: R) -> Twhere
T: SampleUniform,
R: SampleRange<T>,
Source§fn random_bool(&mut self, p: f64) -> bool
fn random_bool(&mut self, p: f64) -> bool
p of being true. Read moreSource§fn random_ratio(&mut self, numerator: u32, denominator: u32) -> bool
fn random_ratio(&mut self, numerator: u32, denominator: u32) -> bool
numerator/denominator of being
true. Read moreSource§fn sample<T, D>(&mut self, distr: D) -> Twhere
D: Distribution<T>,
fn sample<T, D>(&mut self, distr: D) -> Twhere
D: Distribution<T>,
Source§fn sample_iter<T, D>(self, distr: D) -> Iter<D, Self, T>where
D: Distribution<T>,
Self: Sized,
fn sample_iter<T, D>(self, distr: D) -> Iter<D, Self, T>where
D: Distribution<T>,
Self: Sized,
Source§fn gen<T>(&mut self) -> Twhere
StandardUniform: Distribution<T>,
fn gen<T>(&mut self) -> Twhere
StandardUniform: Distribution<T>,
random to avoid conflict with the new gen keyword in Rust 2024.Rng::random.Source§fn gen_range<T, R>(&mut self, range: R) -> Twhere
T: SampleUniform,
R: SampleRange<T>,
fn gen_range<T, R>(&mut self, range: R) -> Twhere
T: SampleUniform,
R: SampleRange<T>,
random_rangeRng::random_range.Source§impl<R> TryRngCore for R
impl<R> TryRngCore for R
Source§type Error = Infallible
type Error = Infallible
Source§fn try_next_u32(&mut self) -> Result<u32, <R as TryRngCore>::Error>
fn try_next_u32(&mut self) -> Result<u32, <R as TryRngCore>::Error>
u32.Source§fn try_next_u64(&mut self) -> Result<u64, <R as TryRngCore>::Error>
fn try_next_u64(&mut self) -> Result<u64, <R as TryRngCore>::Error>
u64.Source§fn try_fill_bytes(
&mut self,
dst: &mut [u8],
) -> Result<(), <R as TryRngCore>::Error>
fn try_fill_bytes( &mut self, dst: &mut [u8], ) -> Result<(), <R as TryRngCore>::Error>
dest entirely with random data.Source§fn unwrap_mut(&mut self) -> UnwrapMut<'_, Self>
fn unwrap_mut(&mut self) -> UnwrapMut<'_, Self>
UnwrapMut wrapper.Source§fn read_adapter(&mut self) -> RngReadAdapter<'_, Self>where
Self: Sized,
fn read_adapter(&mut self) -> RngReadAdapter<'_, Self>where
Self: Sized,
RngCore to a RngReadAdapter.