Struct re_viewer::external::crossbeam::utils::CachePadded
#[repr(align(128))]pub struct CachePadded<T> {
value: T,
}
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
.
§Examples
Alignment and padding:
use crossbeam_utils::CachePadded;
let array = [CachePadded::new(1i8), CachePadded::new(2i8)];
let addr1 = &*array[0] as *const i8 as usize;
let addr2 = &*array[1] as *const i8 as usize;
assert!(addr2 - addr1 >= 32);
assert_eq!(addr1 % 32, 0);
assert_eq!(addr2 % 32, 0);
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 crossbeam_utils::CachePadded;
use std::sync::atomic::AtomicUsize;
struct Queue<T> {
head: CachePadded<AtomicUsize>,
tail: CachePadded<AtomicUsize>,
buffer: *mut T,
}
Fields§
§value: T
Implementations§
§impl<T> CachePadded<T>
impl<T> CachePadded<T>
pub 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.
§Examples
use crossbeam_utils::CachePadded;
let padded_value = CachePadded::new(1);
pub fn into_inner(self) -> T
pub fn into_inner(self) -> T
Returns the inner value.
§Examples
use crossbeam_utils::CachePadded;
let padded_value = CachePadded::new(7);
let value = padded_value.into_inner();
assert_eq!(value, 7);
Trait Implementations§
§impl<T> Clone for CachePadded<T>where
T: Clone,
impl<T> Clone for CachePadded<T>where
T: Clone,
§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 more§impl<T> Debug for CachePadded<T>where
T: Debug,
impl<T> Debug for CachePadded<T>where
T: Debug,
§impl<T> Default for CachePadded<T>where
T: Default,
impl<T> Default for CachePadded<T>where
T: Default,
§fn default() -> CachePadded<T>
fn default() -> CachePadded<T>
§impl<T> Deref for CachePadded<T>
impl<T> Deref for CachePadded<T>
§impl<T> DerefMut for CachePadded<T>
impl<T> DerefMut for CachePadded<T>
§impl<T> Display for CachePadded<T>where
T: Display,
impl<T> Display for CachePadded<T>where
T: Display,
§impl<T> From<T> for CachePadded<T>
impl<T> From<T> for CachePadded<T>
§fn from(t: T) -> CachePadded<T>
fn from(t: T) -> CachePadded<T>
§impl<T> Hash for CachePadded<T>where
T: Hash,
impl<T> Hash for CachePadded<T>where
T: Hash,
§impl<T> PartialEq for CachePadded<T>where
T: PartialEq,
impl<T> PartialEq for CachePadded<T>where
T: PartialEq,
§fn eq(&self, other: &CachePadded<T>) -> bool
fn eq(&self, other: &CachePadded<T>) -> bool
self
and other
values to be equal, and is used
by ==
.impl<T> Copy for CachePadded<T>where
T: Copy,
impl<T> Eq for CachePadded<T>where
T: Eq,
impl<T> Send for CachePadded<T>where
T: Send,
impl<T> StructuralPartialEq for CachePadded<T>
impl<T> Sync for CachePadded<T>where
T: Sync,
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> CheckedAs for T
impl<T> CheckedAs for T
source§fn checked_as<Dst>(self) -> Option<Dst>where
T: CheckedCast<Dst>,
fn checked_as<Dst>(self) -> Option<Dst>where
T: CheckedCast<Dst>,
source§impl<Src, Dst> CheckedCastFrom<Src> for Dstwhere
Src: CheckedCast<Dst>,
impl<Src, Dst> CheckedCastFrom<Src> for Dstwhere
Src: CheckedCast<Dst>,
source§fn checked_cast_from(src: Src) -> Option<Dst>
fn checked_cast_from(src: Src) -> Option<Dst>
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
T
in a tonic::Request