Struct CachePadded
#[repr(C, align(128))]
pub struct CachePadded<T> { /* private fields */ }
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.
Layout
Since crossbeam-utils 0.8.22, this type is #[repr(C)] and is guaranteed that the pointer to
CachePadded<T> has the same address as the pointer to the underlying T.
Examples
Alignment and padding:
use CachePadded;
let array = ;
let addr1 = &*array as *const i8 as usize;
let addr2 = &*array as *const i8 as usize;
assert!;
assert_eq!;
assert_eq!;
When building a concurrent queue with a head and a tail index, it is wise to place them in different cache lines so that concurrent threads pushing and popping elements don't invalidate each other's cache lines:
use CachePadded;
use AtomicUsize;
Implementations
impl<T> CachePadded<T>
const fn new(t: T) -> CachePadded<T>Pads and aligns a value to the length of a cache line.
Examples
use CachePadded; let padded_value = new;fn into_inner(self) -> TReturns the inner value.
Examples
use CachePadded; let padded_value = new; let value = padded_value.into_inner; assert_eq!;
Trait Implementations
impl<T> Deref for CachePadded<T>
type Target = T;fn deref(&self) -> &T
impl<T> DerefMut for CachePadded<T>
fn deref_mut(&mut self) -> &mut T
impl<T> From<T> for CachePadded<T>
fn from(t: T) -> Self
impl<T: Clone> Clone for CachePadded<T>
fn clone(&self) -> CachePadded<T>
impl<T: Copy> Copy for CachePadded<T>
impl<T: Debug> Debug for CachePadded<T>
fn fmt(&self, f: &mut Formatter<'_>) -> Result
impl<T: Default> Default for CachePadded<T>
fn default() -> CachePadded<T>
impl<T: Display> Display for CachePadded<T>
fn fmt(&self, f: &mut Formatter<'_>) -> Result
impl<T: Eq> Eq for CachePadded<T>
impl<T: Hash> Hash for CachePadded<T>
fn hash<__H: Hasher>(&self, state: &mut __H)
impl<T: PartialEq> PartialEq for CachePadded<T>
fn eq(&self, other: &CachePadded<T>) -> bool
impl<T: PartialEq> StructuralPartialEq for CachePadded<T>
impl<T: Send> Send 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> UnsafeUnpin for CachePadded<T>
where
T: UnsafeUnpin,
impl<T> UnwindSafe for CachePadded<T>
where
T: UnwindSafe,
Blanket Implementations
impl<P, T> Receiver for CachePadded<T>
where
P: Deref<Target = T> + ?Sized,
T: ?Sized,
type Target = T;
impl<T> Any for CachePadded<T>
where
T: 'static + ?Sized,
fn type_id(&self) -> TypeId
impl<T> Borrow<T> for CachePadded<T>
where
T: ?Sized,
fn borrow(&self) -> &T
impl<T> BorrowMut<T> for CachePadded<T>
where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
impl<T> CloneToUninit for CachePadded<T>
where
T: Clone,
unsafe fn clone_to_uninit(&self, dest: *mut u8)
impl<T> From<T> for CachePadded<T>
fn from(t: T) -> TReturns the argument unchanged.
impl<T> ToOwned for CachePadded<T>
where
T: Clone,
type Owned = T;fn to_owned(&self) -> Tfn clone_into(&self, target: &mut T)
impl<T> ToString for CachePadded<T>
where
T: Display + ?Sized,
fn to_string(&self) -> String
impl<T, U> Into<U> for CachePadded<T>
where
U: From<T>,
fn into(self) -> UCalls
U::from(self).That is, this conversion is whatever the implementation of
[From]<T> for Uchooses to do.
impl<T, U> TryFrom<U> for CachePadded<T>
where
U: Into<T>,
type Error = never;fn try_from(value: U) -> Result<T, never>
impl<T, U> TryInto<U> for CachePadded<T>
where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error;fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>